bird-1.6.3/0000755000103200001440000000000013027054676011437 5ustar feelausersbird-1.6.3/README0000644000103200001440000001047413027054563012320 0ustar feelausers BIRD Internet Routing Daemon Home page http://bird.network.cz/ Mailing list bird-users@network.cz (c) 1998--2008 Martin Mares (c) 1998--2000 Pavel Machek (c) 1998--2008 Ondrej Filip (c) 2009--2016 CZ.NIC z.s.p.o. ================================================================================ The BIRD project aims to develop a dynamic IP routing daemon with full support of all modern routing protocols, easy to use configuration interface and powerful route filtering language, primarily targeted on (but not limited to) Linux and other UNIX-like systems and distributed under the GNU General Public License. What do we support ================== o Both IPv4 and IPv6 (use --enable-ipv6 when configuring) o Multiple routing tables o Border Gateway Protocol (BGPv4) o Routing Information Protocol (RIPv2, RIPng) o Open Shortest Path First protocol (OSPFv2, OSPFv3) o Babel Routing Protocol (Babel) o Bidirectional Forwarding Detection (BFD) o IPv6 router advertisements o Static routes o Inter-table protocol o Command-line interface allowing on-line control and inspection of status of the daemon o Soft reconfiguration, no need to use complex online commands to change the configuration, just edit the configuration file and notify BIRD to re-read it and it will smoothly switch itself to the new configuration, not disturbing routing protocols unless they are affected by the configuration changes o Powerful language for route filtering, see doc/bird.conf.example o Linux, FreeBSD, NetBSD and OpenBSD ports How to install BIRD =================== o From standard distribution package of your OS (recommended) o From official binary packages for Debian and Red Hat Linux ftp://bird.network.cz/pub/bird/debian/ ftp://bird.network.cz/pub/bird/redhat/ o From source code of the latest stable release version ftp://bird.network.cz/pub/bird/ o From source code of the actual development version git://git.nic.cz/bird.git https://gitlab.labs.nic.cz/labs/bird/ How to install BIRD from source code ------------------------------------ $ ./configure $ make $ su # make install # vi /usr/local/etc/bird.conf See the file INSTALL for more information about installation from source code. Documentation ============= Online documentation is available at http://bird.network.cz/?get_doc or as HTML files in the doc directory, you can install it by `make install-docs' and rebuild it by `make docs', but you'll need SGMLtools and LaTeX to be installed on your machine. You can also download a neatly formatted PostScript version as a separate archive (bird-doc-*.tar.gz) from ftp://bird.network.cz/pub/bird/ User support ============ If you want to help us debugging, enhancing and porting BIRD or just lurk around to see what's going to develop, feel free to subscribe to the BIRD users mailing list bird-users@network.cz, just send `subscribe' to bird-request@network.cz. Bug reports, suggestions, feature requests and code are welcome! We don't use gitlab issues for reporting, sorry. Subscribe: http://bird.network.cz/mailman/listinfo/bird-users/ Archive: http://bird.network.cz/pipermail/bird-users/ Licence ======= This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA History ======= BIRD development started as a student project at the Faculty of Math and Physics, Charles University, Prague, Czech Republic under supervision of RNDr. Libor Forst . BIRD has been developed and supported by CZ.NIC z.s.p.o. http://www.nic.cz/ since 2009. Good Luck and enjoy the BIRD :) The BIRD Team bird-1.6.3/lib/0000755000103200001440000000000013027054563012200 5ustar feelausersbird-1.6.3/lib/printf.c0000644000103200001440000002357213027054563013657 0ustar feelausers/* * BIRD Library -- Formatted Output * * (c) 1991, 1992 Lars Wirzenius & Linus Torvalds * * Hacked up for BIRD by Martin Mares * Buffer size limitation implemented by Martin Mares. */ #include "nest/bird.h" #include "string.h" #include #include "nest/iface.h" /* we use this so that we can do without the ctype library */ #define is_digit(c) ((c) >= '0' && (c) <= '9') static int skip_atoi(const char **s) { int i=0; while (is_digit(**s)) i = i*10 + *((*s)++) - '0'; return i; } #define ZEROPAD 1 /* pad with zero */ #define SIGN 2 /* unsigned/signed long */ #define PLUS 4 /* show plus */ #define SPACE 8 /* space if plus */ #define LEFT 16 /* left justified */ #define SPECIAL 32 /* 0x */ #define LARGE 64 /* use 'ABCDEF' instead of 'abcdef' */ #define do_div(n,base) ({ \ int __res; \ __res = ((unsigned long) n) % (unsigned) base; \ n = ((unsigned long) n) / (unsigned) base; \ __res; }) static char * number(char * str, long num, int base, int size, int precision, int type, int remains) { char c,sign,tmp[66]; const char *digits="0123456789abcdefghijklmnopqrstuvwxyz"; int i; if (size >= 0 && (remains -= size) < 0) return NULL; if (type & LARGE) digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; if (type & LEFT) type &= ~ZEROPAD; if (base < 2 || base > 36) return 0; c = (type & ZEROPAD) ? '0' : ' '; sign = 0; if (type & SIGN) { if (num < 0) { sign = '-'; num = -num; size--; } else if (type & PLUS) { sign = '+'; size--; } else if (type & SPACE) { sign = ' '; size--; } } if (type & SPECIAL) { if (base == 16) size -= 2; else if (base == 8) size--; } i = 0; if (num == 0) tmp[i++]='0'; else while (num != 0) tmp[i++] = digits[do_div(num,base)]; if (i > precision) precision = i; size -= precision; if (size < 0 && -size > remains) return NULL; if (!(type&(ZEROPAD+LEFT))) while(size-->0) *str++ = ' '; if (sign) *str++ = sign; if (type & SPECIAL) { if (base==8) *str++ = '0'; else if (base==16) { *str++ = '0'; *str++ = digits[33]; } } if (!(type & LEFT)) while (size-- > 0) *str++ = c; while (i < precision--) *str++ = '0'; while (i-- > 0) *str++ = tmp[i]; while (size-- > 0) *str++ = ' '; return str; } /** * bvsnprintf - BIRD's vsnprintf() * @buf: destination buffer * @size: size of the buffer * @fmt: format string * @args: a list of arguments to be formatted * * This functions acts like ordinary sprintf() except that it checks * available space to avoid buffer overflows and it allows some more * format specifiers: |%I| for formatting of IP addresses (any non-zero * width is automatically replaced by standard IP address width which * depends on whether we use IPv4 or IPv6; |%#I| gives hexadecimal format), * |%R| for Router / Network ID (u32 value printed as IPv4 address) * |%lR| for 64bit Router / Network ID (u64 value printed as eight :-separated octets) * and |%m| resp. |%M| for error messages (uses strerror() to translate @errno code to * message text). On the other hand, it doesn't support floating * point numbers. * * Result: number of characters of the output string or -1 if * the buffer space was insufficient. */ int bvsnprintf(char *buf, int size, const char *fmt, va_list args) { int len; unsigned long num; int i, base; u32 x; u64 X; char *str, *start; const char *s; char ipbuf[MAX(STD_ADDRESS_P_LENGTH,ROUTER_ID_64_LENGTH)+1]; struct iface *iface; int flags; /* flags to number() */ int field_width; /* width of output field */ int precision; /* min. # of digits for integers; max number of chars for from string */ int qualifier; /* 'h', 'l', or 'L' for integer fields */ for (start=str=buf ; *fmt ; ++fmt, size-=(str-start), start=str) { if (*fmt != '%') { if (!size) return -1; *str++ = *fmt; continue; } /* process flags */ flags = 0; repeat: ++fmt; /* this also skips first '%' */ switch (*fmt) { case '-': flags |= LEFT; goto repeat; case '+': flags |= PLUS; goto repeat; case ' ': flags |= SPACE; goto repeat; case '#': flags |= SPECIAL; goto repeat; case '0': flags |= ZEROPAD; goto repeat; } /* get field width */ field_width = -1; if (is_digit(*fmt)) field_width = skip_atoi(&fmt); else if (*fmt == '*') { ++fmt; /* it's the next argument */ field_width = va_arg(args, int); if (field_width < 0) { field_width = -field_width; flags |= LEFT; } } /* get the precision */ precision = -1; if (*fmt == '.') { ++fmt; if (is_digit(*fmt)) precision = skip_atoi(&fmt); else if (*fmt == '*') { ++fmt; /* it's the next argument */ precision = va_arg(args, int); } if (precision < 0) precision = 0; } /* get the conversion qualifier */ qualifier = -1; if (*fmt == 'h' || *fmt == 'l' || *fmt == 'L') { qualifier = *fmt; ++fmt; } /* default base */ base = 10; if (field_width > size) return -1; switch (*fmt) { case 'c': if (!(flags & LEFT)) while (--field_width > 0) *str++ = ' '; *str++ = (byte) va_arg(args, int); while (--field_width > 0) *str++ = ' '; continue; case 'm': if (flags & SPECIAL) { if (!errno) continue; if (size < 2) return -1; *str++ = ':'; *str++ = ' '; start += 2; size -= 2; } s = strerror(errno); goto str; case 'M': s = strerror(va_arg(args, int)); goto str; case 's': s = va_arg(args, char *); if (!s) s = ""; str: len = strlen(s); if (precision >= 0 && len > precision) len = precision; if (len > size) return -1; if (!(flags & LEFT)) while (len < field_width--) *str++ = ' '; for (i = 0; i < len; ++i) *str++ = *s++; while (len < field_width--) *str++ = ' '; continue; case 'p': if (field_width == -1) { field_width = 2*sizeof(void *); flags |= ZEROPAD; } str = number(str, (unsigned long) va_arg(args, void *), 16, field_width, precision, flags, size); if (!str) return -1; continue; case 'n': if (qualifier == 'l') { long * ip = va_arg(args, long *); *ip = (str - buf); } else { int * ip = va_arg(args, int *); *ip = (str - buf); } continue; /* IP address */ case 'I': if (flags & SPECIAL) ipa_ntox(va_arg(args, ip_addr), ipbuf); else { ipa_ntop(va_arg(args, ip_addr), ipbuf); if (field_width == 1) field_width = STD_ADDRESS_P_LENGTH; } s = ipbuf; goto str; /* Interface scope after link-local IP address */ case 'J': iface = va_arg(args, struct iface *); if (!iface) continue; if (!size) return -1; *str++ = '%'; start++; size--; s = iface->name; goto str; /* Router/Network ID - essentially IPv4 address in u32 value */ case 'R': if(qualifier == 'l') { X = va_arg(args, u64); bsprintf(ipbuf, "%02x:%02x:%02x:%02x:%02x:%02x:%02x:%02x", ((X >> 56) & 0xff), ((X >> 48) & 0xff), ((X >> 40) & 0xff), ((X >> 32) & 0xff), ((X >> 24) & 0xff), ((X >> 16) & 0xff), ((X >> 8) & 0xff), (X & 0xff)); } else { x = va_arg(args, u32); bsprintf(ipbuf, "%d.%d.%d.%d", ((x >> 24) & 0xff), ((x >> 16) & 0xff), ((x >> 8) & 0xff), (x & 0xff)); } s = ipbuf; goto str; /* integer number formats - set up the flags and "break" */ case 'o': base = 8; break; case 'X': flags |= LARGE; case 'x': base = 16; break; case 'd': case 'i': flags |= SIGN; case 'u': break; default: if (size < 2) return -1; if (*fmt != '%') *str++ = '%'; if (*fmt) *str++ = *fmt; else --fmt; continue; } if (qualifier == 'l') num = va_arg(args, unsigned long); else if (qualifier == 'h') { num = (unsigned short) va_arg(args, int); if (flags & SIGN) num = (short) num; } else if (flags & SIGN) num = va_arg(args, int); else num = va_arg(args, uint); str = number(str, num, base, field_width, precision, flags, size); if (!str) return -1; } if (!size) return -1; *str = '\0'; return str-buf; } /** * bvsprintf - BIRD's vsprintf() * @buf: buffer * @fmt: format string * @args: a list of arguments to be formatted * * This function is equivalent to bvsnprintf() with an infinite * buffer size. Please use carefully only when you are absolutely * sure the buffer won't overflow. */ int bvsprintf(char *buf, const char *fmt, va_list args) { return bvsnprintf(buf, 1000000000, fmt, args); } /** * bsprintf - BIRD's sprintf() * @buf: buffer * @fmt: format string * * This function is equivalent to bvsnprintf() with an infinite * buffer size and variable arguments instead of a &va_list. * Please use carefully only when you are absolutely * sure the buffer won't overflow. */ int bsprintf(char * buf, const char *fmt, ...) { va_list args; int i; va_start(args, fmt); i=bvsnprintf(buf, 1000000000, fmt, args); va_end(args); return i; } /** * bsnprintf - BIRD's snprintf() * @buf: buffer * @size: buffer size * @fmt: format string * * This function is equivalent to bsnprintf() with variable arguments instead of a &va_list. */ int bsnprintf(char * buf, int size, const char *fmt, ...) { va_list args; int i; va_start(args, fmt); i=bvsnprintf(buf, size, fmt, args); va_end(args); return i; } int buffer_vprint(buffer *buf, const char *fmt, va_list args) { int i = bvsnprintf((char *) buf->pos, buf->end - buf->pos, fmt, args); buf->pos = (i >= 0) ? (buf->pos + i) : buf->end; return i; } int buffer_print(buffer *buf, const char *fmt, ...) { va_list args; int i; va_start(args, fmt); i=bvsnprintf((char *) buf->pos, buf->end - buf->pos, fmt, args); va_end(args); buf->pos = (i >= 0) ? (buf->pos + i) : buf->end; return i; } void buffer_puts(buffer *buf, const char *str) { byte *bp = buf->pos; byte *be = buf->end; while (bp < be && *str) *bp++ = *str++; if (bp < be) *bp = 0; buf->pos = bp; } bird-1.6.3/lib/sha256.h0000644000103200001440000000200113027054563013352 0ustar feelausers/* * BIRD Library -- SHA-256 and SHA-224 Hash Functions * * (c) 2015 CZ.NIC z.s.p.o. * * Based on the code from libgcrypt-1.6.0, which is * (c) 2003, 2006, 2008, 2009 Free Software Foundation, Inc. * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_SHA256_H_ #define _BIRD_SHA256_H_ #include "nest/bird.h" #define SHA224_SIZE 28 #define SHA224_HEX_SIZE 57 #define SHA224_BLOCK_SIZE 64 #define SHA256_SIZE 32 #define SHA256_HEX_SIZE 65 #define SHA256_BLOCK_SIZE 64 struct hash_context; struct sha256_context { u32 h0, h1, h2, h3, h4, h5, h6, h7; byte buf[SHA256_BLOCK_SIZE]; uint nblocks; uint count; }; #define sha224_context sha256_context void sha256_init(struct hash_context *ctx); void sha224_init(struct hash_context *ctx); void sha256_update(struct hash_context *ctx, const byte *buf, uint len); #define sha224_update sha256_update byte *sha256_final(struct hash_context *ctx); #define sha224_final sha256_final #endif /* _BIRD_SHA256_H_ */ bird-1.6.3/lib/mempool.c0000644000103200001440000001361613027054563014023 0ustar feelausers/* * BIRD Resource Manager -- Memory Pools * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Linear memory pools * * Linear memory pools are collections of memory blocks which * support very fast allocation of new blocks, but are able to free only * the whole collection at once. * * Example: Each configuration is described by a complex system of structures, * linked lists and function trees which are all allocated from a single linear * pool, thus they can be freed at once when the configuration is no longer used. */ #include #include #include "nest/bird.h" #include "lib/resource.h" #include "lib/string.h" struct lp_chunk { struct lp_chunk *next; uint size; uintptr_t data_align[0]; byte data[0]; }; struct linpool { resource r; byte *ptr, *end; struct lp_chunk *first, *current, **plast; /* Normal (reusable) chunks */ struct lp_chunk *first_large; /* Large chunks */ uint chunk_size, threshold, total, total_large; }; static void lp_free(resource *); static void lp_dump(resource *); static resource *lp_lookup(resource *, unsigned long); static size_t lp_memsize(resource *r); static struct resclass lp_class = { "LinPool", sizeof(struct linpool), lp_free, lp_dump, lp_lookup, lp_memsize }; /** * lp_new - create a new linear memory pool * @p: pool * @blk: block size * * lp_new() creates a new linear memory pool resource inside the pool @p. * The linear pool consists of a list of memory chunks of size at least * @blk. */ linpool *lp_new(pool *p, uint blk) { linpool *m = ralloc(p, &lp_class); m->plast = &m->first; m->chunk_size = blk; m->threshold = 3*blk/4; return m; } /** * lp_alloc - allocate memory from a &linpool * @m: linear memory pool * @size: amount of memory * * lp_alloc() allocates @size bytes of memory from a &linpool @m * and it returns a pointer to the allocated memory. * * It works by trying to find free space in the last memory chunk * associated with the &linpool and creating a new chunk of the standard * size (as specified during lp_new()) if the free space is too small * to satisfy the allocation. If @size is too large to fit in a standard * size chunk, an "overflow" chunk is created for it instead. */ void * lp_alloc(linpool *m, uint size) { byte *a = (byte *) BIRD_ALIGN((unsigned long) m->ptr, CPU_STRUCT_ALIGN); byte *e = a + size; if (e <= m->end) { m->ptr = e; return a; } else { struct lp_chunk *c; if (size >= m->threshold) { /* Too large => allocate large chunk */ c = xmalloc(sizeof(struct lp_chunk) + size); m->total_large += size; c->next = m->first_large; m->first_large = c; c->size = size; } else { if (m->current) { /* Still have free chunks from previous incarnation (before lp_flush()) */ c = m->current; m->current = c->next; } else { /* Need to allocate a new chunk */ c = xmalloc(sizeof(struct lp_chunk) + m->chunk_size); m->total += m->chunk_size; *m->plast = c; m->plast = &c->next; c->next = NULL; c->size = m->chunk_size; } m->ptr = c->data + size; m->end = c->data + m->chunk_size; } return c->data; } } /** * lp_allocu - allocate unaligned memory from a &linpool * @m: linear memory pool * @size: amount of memory * * lp_allocu() allocates @size bytes of memory from a &linpool @m * and it returns a pointer to the allocated memory. It doesn't * attempt to align the memory block, giving a very efficient way * how to allocate strings without any space overhead. */ void * lp_allocu(linpool *m, uint size) { byte *a = m->ptr; byte *e = a + size; if (e <= m->end) { m->ptr = e; return a; } return lp_alloc(m, size); } /** * lp_allocz - allocate cleared memory from a &linpool * @m: linear memory pool * @size: amount of memory * * This function is identical to lp_alloc() except that it * clears the allocated memory block. */ void * lp_allocz(linpool *m, uint size) { void *z = lp_alloc(m, size); bzero(z, size); return z; } /** * lp_flush - flush a linear memory pool * @m: linear memory pool * * This function frees the whole contents of the given &linpool @m, * but leaves the pool itself. */ void lp_flush(linpool *m) { struct lp_chunk *c; /* Relink all normal chunks to free list and free all large chunks */ m->ptr = m->end = NULL; m->current = m->first; while (c = m->first_large) { m->first_large = c->next; xfree(c); } m->total_large = 0; } static void lp_free(resource *r) { linpool *m = (linpool *) r; struct lp_chunk *c, *d; for(d=m->first; d; d = c) { c = d->next; xfree(d); } for(d=m->first_large; d; d = c) { c = d->next; xfree(d); } } static void lp_dump(resource *r) { linpool *m = (linpool *) r; struct lp_chunk *c; int cnt, cntl; for(cnt=0, c=m->first; c; c=c->next, cnt++) ; for(cntl=0, c=m->first_large; c; c=c->next, cntl++) ; debug("(chunk=%d threshold=%d count=%d+%d total=%d+%d)\n", m->chunk_size, m->threshold, cnt, cntl, m->total, m->total_large); } static size_t lp_memsize(resource *r) { linpool *m = (linpool *) r; struct lp_chunk *c; int cnt = 0; for(c=m->first; c; c=c->next) cnt++; for(c=m->first_large; c; c=c->next) cnt++; return ALLOC_OVERHEAD + sizeof(struct linpool) + cnt * (ALLOC_OVERHEAD + sizeof(struct lp_chunk)) + m->total + m->total_large; } static resource * lp_lookup(resource *r, unsigned long a) { linpool *m = (linpool *) r; struct lp_chunk *c; for(c=m->first; c; c=c->next) if ((unsigned long) c->data <= a && (unsigned long) c->data + c->size > a) return r; for(c=m->first_large; c; c=c->next) if ((unsigned long) c->data <= a && (unsigned long) c->data + c->size > a) return r; return NULL; } bird-1.6.3/lib/lists.h0000644000103200001440000000456213027054563013516 0ustar feelausers/* * BIRD Library -- Linked Lists * * (c) 1998 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_LISTS_H_ #define _BIRD_LISTS_H_ /* * I admit the list structure is very tricky and also somewhat awkward, * but it's both efficient and easy to manipulate once one understands the * basic trick: The list head always contains two synthetic nodes which are * always present in the list: the head and the tail. But as the `next' * entry of the tail and the `prev' entry of the head are both NULL, the * nodes can overlap each other: * * head head_node.next * null head_node.prev tail_node.next * tail tail_node.prev */ typedef struct node { struct node *next, *prev; } node; typedef union list { /* In fact two overlayed nodes */ struct { /* Head node */ struct node head_node; void *head_padding; }; struct { /* Tail node */ void *tail_padding; struct node tail_node; }; struct { /* Split to separate pointers */ struct node *head; struct node *null; struct node *tail; }; } list; #define NODE (node *) #define HEAD(list) ((void *)((list).head)) #define TAIL(list) ((void *)((list).tail)) #define NODE_NEXT(n) ((void *)((NODE (n))->next)) #define NODE_VALID(n) ((NODE (n))->next) #define WALK_LIST(n,list) for(n=HEAD(list); NODE_VALID(n); n=NODE_NEXT(n)) #define WALK_LIST2(n,nn,list,pos) \ for(nn=(list).head; NODE_VALID(nn) && (n=SKIP_BACK(typeof(*n),pos,nn)); nn=nn->next) #define WALK_LIST_DELSAFE(n,nxt,list) \ for(n=HEAD(list); nxt=NODE_NEXT(n); n=(void *) nxt) /* WALK_LIST_FIRST supposes that called code removes each processed node */ #define WALK_LIST_FIRST(n,list) \ while(n=HEAD(list), (NODE (n))->next) #define WALK_LIST_BACKWARDS(n,list) for(n=TAIL(list);(NODE (n))->prev; \ n=(void *)((NODE (n))->prev)) #define WALK_LIST_BACKWARDS_DELSAFE(n,prv,list) \ for(n=TAIL(list); prv=(void *)((NODE (n))->prev); n=(void *) prv) #define EMPTY_LIST(list) (!(list).head->next) #ifndef _BIRD_LISTS_C_ #define LIST_INLINE static inline #include "lib/lists.c" #undef LIST_INLINE #else /* _BIRD_LISTS_C_ */ #define LIST_INLINE void add_tail(list *, node *); void add_head(list *, node *); void rem_node(node *); void add_tail_list(list *, list *); void init_list(list *); void insert_node(node *, node *); #endif #endif bird-1.6.3/lib/tbf.c0000644000103200001440000000101013027054563013107 0ustar feelausers/* * BIRD Library -- Token Bucket Filter * * (c) 2014 Ondrej Zajicek * (c) 2014 CZ.NIC z.s.p.o. * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "nest/bird.h" void tbf_update(struct tbf *f) { bird_clock_t delta = now - f->timestamp; if (delta == 0) return; f->timestamp = now; if ((0 < delta) && (delta < f->burst)) { u32 next = f->count + delta * f->rate; f->count = MIN(next, f->burst); } else f->count = f->burst; } bird-1.6.3/lib/resource.sgml0000644000103200001440000000303313027054563014712 0ustar feelausers Resources Introduction

Most large software projects implemented in classical procedural programming languages usually end up with lots of code taking care of resource allocation and deallocation. Bugs in such code are often very difficult to find, because they cause only `resource leakage', that is keeping a lot of memory and other resources which nobody references to.

We've tried to solve this problem by employing a resource tracking system which keeps track of all the resources allocated by all the modules of BIRD, deallocates everything automatically when a module shuts down and it is able to print out the list of resources and the corresponding modules they are allocated by.

Each allocated resource (from now we'll speak about allocated resources only) is represented by a structure starting with a standard header (struct There exist the following types of resources: bird-1.6.3/lib/unaligned.h0000644000103200001440000000233013027054563014315 0ustar feelausers/* * Unaligned Data Accesses -- Generic Version, Network Order * * (c) 2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_UNALIGNED_H_ #define _BIRD_UNALIGNED_H_ /* * We don't do any clever tricks with unaligned accesses since it's * virtually impossible to figure out what alignment does the CPU want * (unaligned accesses can be emulated by the OS which makes them work, * but unusably slow). We use memcpy and hope GCC will optimize it out * if possible. */ #include "lib/string.h" static inline u16 get_u16(const void *p) { u16 x; memcpy(&x, p, 2); return ntohs(x); } static inline u32 get_u32(const void *p) { u32 x; memcpy(&x, p, 4); return ntohl(x); } static inline u64 get_u64(const void *p) { u32 xh, xl; memcpy(&xh, p, 4); memcpy(&xl, p+4, 4); return (((u64) ntohl(xh)) << 32) | ntohl(xl); } static inline void put_u16(void *p, u16 x) { x = htons(x); memcpy(p, &x, 2); } static inline void put_u32(void *p, u32 x) { x = htonl(x); memcpy(p, &x, 4); } static inline void put_u64(void *p, u64 x) { u32 xh, xl; xh = htonl(x >> 32); xl = htonl((u32) x); memcpy(p, &xh, 4); memcpy(p+4, &xl, 4); } #endif bird-1.6.3/lib/socket.h0000644000103200001440000001324413027054563013645 0ustar feelausers/* * BIRD Socket Interface * * (c) 1998--2004 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_SOCKET_H_ #define _BIRD_SOCKET_H_ #include // #include #include "lib/resource.h" typedef struct birdsock { resource r; pool *pool; /* Pool where incoming connections should be allocated (for SK_xxx_PASSIVE) */ int type; /* Socket type */ void *data; /* User data */ ip_addr saddr, daddr; /* IPA_NONE = unspecified */ uint sport, dport; /* 0 = unspecified (for IP: protocol type) */ int tos; /* TOS / traffic class, -1 = default */ int priority; /* Local socket priority, -1 = default */ int ttl; /* Time To Live, -1 = default */ u32 flags; struct iface *iface; /* Interface; specify this for broad/multicast sockets */ byte *rbuf, *rpos; /* NULL=allocate automatically */ uint fast_rx; /* RX has higher priority in event loop */ uint rbsize; int (*rx_hook)(struct birdsock *, uint size); /* NULL=receiving turned off, returns 1 to clear rx buffer */ byte *tbuf, *tpos; /* NULL=allocate automatically */ byte *ttx; /* Internal */ uint tbsize; void (*tx_hook)(struct birdsock *); void (*err_hook)(struct birdsock *, int); /* errno or zero if EOF */ /* Information about received datagrams (UDP, RAW), valid in rx_hook */ ip_addr faddr, laddr; /* src (From) and dst (Local) address of the datagram */ uint fport; /* src port of the datagram */ uint lifindex; /* local interface that received the datagram */ /* laddr and lifindex are valid only if SKF_LADDR_RX flag is set to request it */ int af; /* Address family (AF_INET, AF_INET6 or 0 for non-IP) of fd */ int fd; /* System-dependent data */ int index; /* Index in poll buffer */ int rcv_ttl; /* TTL of last received datagram */ node n; void *rbuf_alloc, *tbuf_alloc; char *password; /* Password for MD5 authentication */ char *err; /* Error message */ } sock; sock *sock_new(pool *); /* Allocate new socket */ #define sk_new(X) sock_new(X) /* Wrapper to avoid name collision with OpenSSL */ int sk_open(sock *); /* Open socket */ int sk_rx_ready(sock *s); int sk_send(sock *, uint len); /* Send data, <0=err, >0=ok, 0=sleep */ int sk_send_to(sock *, uint len, ip_addr to, uint port); /* sk_send to given destination */ void sk_reallocate(sock *); /* Free and allocate tbuf & rbuf */ void sk_set_rbsize(sock *s, uint val); /* Resize RX buffer */ void sk_set_tbsize(sock *s, uint val); /* Resize TX buffer, keeping content */ void sk_set_tbuf(sock *s, void *tbuf); /* Switch TX buffer, NULL-> return to internal */ void sk_dump_all(void); static inline int sk_send_buffer_empty(sock *sk) { return sk->tbuf == sk->tpos; } #ifdef IPV6 #define sk_is_ipv4(X) 0 #define sk_is_ipv6(X) 1 #else #define sk_is_ipv4(X) 1 #define sk_is_ipv6(X) 0 #endif int sk_setup_multicast(sock *s); /* Prepare UDP or IP socket for multicasting */ int sk_join_group(sock *s, ip_addr maddr); /* Join multicast group on sk iface */ int sk_leave_group(sock *s, ip_addr maddr); /* Leave multicast group on sk iface */ int sk_setup_broadcast(sock *s); int sk_set_ttl(sock *s, int ttl); /* Set transmit TTL for given socket */ int sk_set_min_ttl(sock *s, int ttl); /* Set minimal accepted TTL for given socket */ int sk_set_md5_auth(sock *s, ip_addr local, ip_addr remote, struct iface *ifa, char *passwd, int setkey); int sk_set_ipv6_checksum(sock *s, int offset); int sk_set_icmp6_filter(sock *s, int p1, int p2); void sk_log_error(sock *s, const char *p); byte * sk_rx_buffer(sock *s, int *len); /* Temporary */ extern int sk_priority_control; /* Suggested priority for control traffic, should be sysdep define */ /* Socket flags */ #define SKF_V4ONLY 0x01 /* Use IPv4 for IP sockets */ #define SKF_V6ONLY 0x02 /* Use IPV6_V6ONLY socket option */ #define SKF_LADDR_RX 0x04 /* Report local address for RX packets */ #define SKF_TTL_RX 0x08 /* Report TTL / Hop Limit for RX packets */ #define SKF_BIND 0x10 /* Bind datagram socket to given source address */ #define SKF_HIGH_PORT 0x20 /* Choose port from high range if possible */ #define SKF_THREAD 0x100 /* Socked used in thread, Do not add to main loop */ #define SKF_TRUNCATED 0x200 /* Received packet was truncated, set by IO layer */ #define SKF_HDRINCL 0x400 /* Used internally */ #define SKF_PKTINFO 0x800 /* Used internally */ /* * Socket types SA SP DA DP IF TTL SendTo (?=may, -=must not, *=must) */ #define SK_TCP_PASSIVE 0 /* ? * - - - ? - */ #define SK_TCP_ACTIVE 1 /* ? ? * * - ? - */ #define SK_TCP 2 #define SK_UDP 3 /* ? ? ? ? ? ? ? */ #define SK_IP 5 /* ? - ? * ? ? ? */ #define SK_MAGIC 7 /* Internal use by sysdep code */ #define SK_UNIX_PASSIVE 8 #define SK_UNIX 9 /* * For SK_UDP or SK_IP sockets setting DA/DP allows to use sk_send(), * otherwise sk_send_to() must be used. * * For SK_IP sockets setting DP specifies protocol number, which is used * for both receiving and sending. * * For multicast on SK_UDP or SK_IP sockets set IF and TTL, * call sk_setup_multicast() to enable multicast on that socket, * and then use sk_join_group() and sk_leave_group() to manage * a set of received multicast groups. * * For datagram (SK_UDP, SK_IP) sockets, there are two ways to handle * source address. The socket could be bound to it using bind() * syscall, but that also forbids the reception of multicast packets, * or the address could be set on per-packet basis using platform * dependent options (but these are not available in some corner * cases). The first way is used when SKF_BIND is specified, the * second way is used otherwise. */ #endif bird-1.6.3/lib/slists.c0000644000103200001440000000670313027054563013673 0ustar feelausers/* * BIRD Library -- Safe Linked Lists * * (c) 1998 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #define _BIRD_SLISTS_C_ #include "nest/bird.h" #include "lib/slists.h" static inline void s_merge(snode *from, snode *to) { siterator *f, *g; if (!(f = from->readers)) return; if (!(g = to->readers)) { /* Fast path */ to->readers = f; f->prev = (siterator *) to; fixup: while (f && f->node) { f->node = NULL; f = f->next; } return; } /* Really merging */ while (g->next) g = g->next; g->next = f; f->prev = g; goto fixup; } snode * s_get(siterator *i) { siterator *f, *g; snode *n; if (!(n = i->node)) { /* * No node found. We have to walk the iterator list backwards * to find where are we linked. */ f = i; while (!f->null) f = f->prev; n = (snode *) f; } f = i->prev; /* Maybe the snode itself */ g = i->next; f->next = g; if (g) g->prev = f; i->prev = NULL; i->next = NULL; return n; } void s_put(siterator *i, snode *n) { siterator *f; i->node = n; if (f = n->readers) f->prev = i; i->next = f; n->readers = i; i->prev = (siterator *) n; i->null = NULL; } void s_add_tail(slist *l, snode *n) { snode *z = l->tail; n->next = (snode *) &l->null; n->prev = z; z->next = n; l->tail = n; n->readers = NULL; } void s_add_head(slist *l, snode *n) { snode *z = l->head; n->next = z; n->prev = (snode *) &l->head; z->prev = n; l->head = n; n->readers = NULL; } void s_insert_node(snode *n, snode *after) { snode *z = after->next; n->next = z; n->prev = after; after->next = n; z->prev = n; n->readers = NULL; } void s_rem_node(snode *n) { snode *z = n->prev; snode *x = n->next; z->next = x; x->prev = z; s_merge(n, x); } void s_init_list(slist *l) { l->head = (snode *) &l->null; l->null = NULL; l->tail = (snode *) &l->head; l->tail_readers = NULL; } void s_add_tail_list(slist *to, slist *l) { snode *p = to->tail; snode *q = l->head; p->next = q; q->prev = p; q = l->tail; q->next = (snode *) &to->null; to->tail = q; s_merge((snode *) &l->null, (snode *) &to->null); } #ifdef TEST #include "lib/resource.h" #include void dump(char *c, slist *a) { snode *x; puts(c); for(x=SHEAD(*a); x; x=x->next) { siterator *i, *j; printf("%p", x); j = (siterator *) x; for(i=x->readers; i; i=i->next) { if (i->prev != j) printf(" ???"); j = i; printf(" [%p:%p]", i, i->node); } putchar('\n'); } puts("---"); } int main(void) { slist a, b; snode *x, *y; siterator i, j; s_init_list(&a); s_init_list(&b); x = xmalloc(sizeof(*x)); s_add_tail(&a, x); x = xmalloc(sizeof(*x)); s_add_tail(&a, x); x = xmalloc(sizeof(*x)); s_add_tail(&a, x); dump("1", &a); s_init(&i, &a); s_init(&j, &a); dump("2", &a); x = s_get(&i); printf("Got %p\n", x); dump("3", &a); s_put(&i, x->next); dump("4", &a); y = s_get(&j); while (y) { s_put(&j, y); dump("5*", &a); y = s_get(&j)->next; } dump("5 done", &a); s_rem_node(a.head->next); dump("6 (deletion)", &a); s_put(&i, s_get(&i)->next); dump("6 (relink)", &a); x = xmalloc(sizeof(*x)); s_add_tail(&b, x); dump("7 (second list)", &b); s_add_tail_list(&b, &a); dump("8 (after merge)", &b); return 0; } #endif bird-1.6.3/lib/event.c0000644000103200001440000000570513027054563013474 0ustar feelausers/* * BIRD Library -- Event Processing * * (c) 1999 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Events * * Events are there to keep track of deferred execution. * Since BIRD is single-threaded, it requires long lasting tasks to be split to smaller * parts, so that no module can monopolize the CPU. To split such a task, just create * an &event resource, point it to the function you want to have called and call ev_schedule() * to ask the core to run the event when nothing more important requires attention. * * You can also define your own event lists (the &event_list structure), enqueue your * events in them and explicitly ask to run them. */ #include "nest/bird.h" #include "lib/event.h" event_list global_event_list; inline void ev_postpone(event *e) { if (ev_active(e)) { rem_node(&e->n); e->n.next = NULL; } } static void ev_dump(resource *r) { event *e = (event *) r; debug("(code %p, data %p, %s)\n", e->hook, e->data, e->n.next ? "scheduled" : "inactive"); } static struct resclass ev_class = { "Event", sizeof(event), (void (*)(resource *)) ev_postpone, ev_dump, NULL, NULL }; /** * ev_new - create a new event * @p: resource pool * * This function creates a new event resource. To use it, * you need to fill the structure fields and call ev_schedule(). */ event * ev_new(pool *p) { event *e = ralloc(p, &ev_class); return e; } /** * ev_run - run an event * @e: an event * * This function explicitly runs the event @e (calls its hook * function) and removes it from an event list if it's linked to any. * * From the hook function, you can call ev_enqueue() or ev_schedule() * to re-add the event. */ inline void ev_run(event *e) { ev_postpone(e); e->hook(e->data); } /** * ev_enqueue - enqueue an event * @l: an event list * @e: an event * * ev_enqueue() stores the event @e to the specified event * list @l which can be run by calling ev_run_list(). */ inline void ev_enqueue(event_list *l, event *e) { ev_postpone(e); add_tail(l, &e->n); } /** * ev_schedule - schedule an event * @e: an event * * This function schedules an event by enqueueing it to a system-wide * event list which is run by the platform dependent code whenever * appropriate. */ void ev_schedule(event *e) { ev_enqueue(&global_event_list, e); } void io_log_event(void *hook, void *data); /** * ev_run_list - run an event list * @l: an event list * * This function calls ev_run() for all events enqueued in the list @l. */ int ev_run_list(event_list *l) { node *n; list tmp_list; init_list(&tmp_list); add_tail_list(&tmp_list, l); init_list(l); WALK_LIST_FIRST(n, tmp_list) { event *e = SKIP_BACK(event, n, n); /* This is ugly hack, we want to log just events executed from the main I/O loop */ if (l == &global_event_list) io_log_event(e->hook, e->data); ev_run(e); } return !EMPTY_LIST(*l); } bird-1.6.3/lib/fletcher16.h0000644000103200001440000001233313027054563014316 0ustar feelausers/* * BIRD Library -- Fletcher-16 checksum * * (c) 2015 Ondrej Zajicek * (c) 2015 CZ.NIC z.s.p.o. * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Fletcher-16 checksum * * Fletcher-16 checksum is a position-dependent checksum algorithm used for * error-detection e.g. in OSPF LSAs. * * To generate Fletcher-16 checksum, zero the checksum field in data, initialize * the context by fletcher16_init(), process the data by fletcher16_update(), * compute the checksum value by fletcher16_final() and store it to the checksum * field in data by put_u16() (or other means involving htons() conversion). * * To verify Fletcher-16 checksum, initialize the context by fletcher16_init(), * process the data by fletcher16_update(), compute a passing checksum by * fletcher16_compute() and check if it is zero. */ #ifndef _BIRD_FLETCHER16_H_ #define _BIRD_FLETCHER16_H_ #include "nest/bird.h" struct fletcher16_context { int c0, c1; }; /** * fletcher16_init - initialize Fletcher-16 context * @ctx: the context */ static inline void fletcher16_init(struct fletcher16_context *ctx) { ctx->c0 = ctx->c1 = 0; } /** * fletcher16_update - process data to Fletcher-16 context * @ctx: the context * @buf: data buffer * @len: data length * * fletcher16_update() reads data from the buffer @buf and updates passing sums * in the context @ctx. It may be used multiple times for multiple blocks of * checksummed data. */ static inline void fletcher16_update(struct fletcher16_context *ctx, const u8* buf, int len) { /* * The Fletcher-16 sum is essentially a sequence of * ctx->c1 += ctx->c0 += *buf++, modulo 255. * * In the inner loop, we eliminate modulo operation and we do some loop * unrolling. MODX is the maximal number of steps that can be done without * modulo before overflow, see RFC 1008 for details. We use a bit smaller * value to cover for initial steps due to loop unrolling. */ #define MODX 4096 int blen, i; blen = len % 4; len -= blen; for (i = 0; i < blen; i++) ctx->c1 += ctx->c0 += *buf++; do { blen = MIN(len, MODX); len -= blen; for (i = 0; i < blen; i += 4) { ctx->c1 += ctx->c0 += *buf++; ctx->c1 += ctx->c0 += *buf++; ctx->c1 += ctx->c0 += *buf++; ctx->c1 += ctx->c0 += *buf++; } ctx->c0 %= 255; ctx->c1 %= 255; } while (len); } /** * fletcher16_update_n32 - process data to Fletcher-16 context, with endianity adjustment * @ctx: the context * @buf: data buffer * @len: data length * * fletcher16_update_n32() works like fletcher16_update(), except it applies * 32-bit host/network endianity swap to the data before they are processed. * I.e., it assumes that the data is a sequence of u32 that must be converted by * ntohl() or htonl() before processing. The @buf need not to be aligned, but * its length (@len) must be multiple of 4. Note that on big endian systems the * host endianity is the same as the network endianity, therefore there is no * endianity swap. */ static inline void fletcher16_update_n32(struct fletcher16_context *ctx, const u8* buf, int len) { /* See fletcher16_update() for details */ int blen, i; do { blen = MIN(len, MODX); len -= blen; for (i = 0; i < blen; i += 4) { #ifdef CPU_BIG_ENDIAN ctx->c1 += ctx->c0 += *buf++; ctx->c1 += ctx->c0 += *buf++; ctx->c1 += ctx->c0 += *buf++; ctx->c1 += ctx->c0 += *buf++; #else ctx->c1 += ctx->c0 += buf[3]; ctx->c1 += ctx->c0 += buf[2]; ctx->c1 += ctx->c0 += buf[1]; ctx->c1 += ctx->c0 += buf[0]; buf += 4; #endif } ctx->c0 %= 255; ctx->c1 %= 255; } while (len); } /** * fletcher16_final - compute final Fletcher-16 checksum value * @ctx: the context * @len: total data length * @pos: offset in data where the checksum will be stored * * fletcher16_final() computes the final checksum value and returns it. * The caller is responsible for storing it in the appropriate position. * The checksum value depends on @len and @pos, but only their difference * (i.e. the offset from the end) is significant. * * The checksum value is represented as u16, although it is defined as two * consecutive bytes. We treat them as one u16 in big endian / network order. * I.e., the returned value is in the form that would be returned by get_u16() * from the checksum field in the data buffer, therefore the caller should use * put_u16() or an explicit host-to-network conversion when storing it to the * checksum field in the data buffer. * * Note that the returned checksum value is always nonzero. */ static inline u16 fletcher16_final(struct fletcher16_context *ctx, int len, int pos) { int x = ((len - pos - 1) * ctx->c0 - ctx->c1) % 255; if (x <= 0) x += 255; int y = 510 - ctx->c0 - x; if (y > 255) y -= 255; return (x << 8) | y; } /** * fletcher16_compute - compute Fletcher-16 sum for verification * @ctx: the context * * fletcher16_compute() returns a passing Fletcher-16 sum for processed data. * If the data contains the proper Fletcher-16 checksum value, the returned * value is zero. */ static inline u16 fletcher16_compute(struct fletcher16_context *ctx) { return (ctx->c0 << 8) | ctx->c1; } #endif bird-1.6.3/lib/sha512.h0000644000103200001440000000200213027054563013346 0ustar feelausers/* * BIRD Library -- SHA-512 and SHA-384 Hash Functions * * (c) 2015 CZ.NIC z.s.p.o. * * Based on the code from libgcrypt-1.6.0, which is * (c) 2003, 2006, 2008, 2009 Free Software Foundation, Inc. * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_SHA512_H_ #define _BIRD_SHA512_H_ #include "nest/bird.h" #define SHA384_SIZE 48 #define SHA384_HEX_SIZE 97 #define SHA384_BLOCK_SIZE 128 #define SHA512_SIZE 64 #define SHA512_HEX_SIZE 129 #define SHA512_BLOCK_SIZE 128 struct hash_context; struct sha512_context { u64 h0, h1, h2, h3, h4, h5, h6, h7; byte buf[SHA512_BLOCK_SIZE]; uint nblocks; uint count; }; #define sha384_context sha512_context void sha512_init(struct hash_context *ctx); void sha384_init(struct hash_context *ctx); void sha512_update(struct hash_context *ctx, const byte *buf, uint len); #define sha384_update sha512_update byte *sha512_final(struct hash_context *ctx); #define sha384_final sha512_final #endif /* _BIRD_SHA512_H_ */ bird-1.6.3/lib/resource.h0000644000103200001440000000576413027054563014214 0ustar feelausers/* * BIRD Resource Manager * * (c) 1998--1999 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_RESOURCE_H_ #define _BIRD_RESOURCE_H_ #include "lib/lists.h" /* Resource */ typedef struct resource { node n; /* Inside resource pool */ struct resclass *class; /* Resource class */ } resource; /* Resource class */ struct resclass { char *name; /* Resource class name */ unsigned size; /* Standard size of single resource */ void (*free)(resource *); /* Freeing function */ void (*dump)(resource *); /* Dump to debug output */ resource *(*lookup)(resource *, unsigned long); /* Look up address (only for debugging) */ size_t (*memsize)(resource *); /* Return size of memory used by the resource, may be NULL */ }; /* Estimate of system allocator overhead per item, for memory consumtion stats */ #define ALLOC_OVERHEAD 8 /* Generic resource manipulation */ typedef struct pool pool; void resource_init(void); pool *rp_new(pool *, char *); /* Create new pool */ void rfree(void *); /* Free single resource */ void rdump(void *); /* Dump to debug output */ size_t rmemsize(void *res); /* Return size of memory used by the resource */ void rlookup(unsigned long); /* Look up address (only for debugging) */ void rmove(void *, pool *); /* Move to a different pool */ void *ralloc(pool *, struct resclass *); extern pool root_pool; /* Normal memory blocks */ void *mb_alloc(pool *, unsigned size); void *mb_allocz(pool *, unsigned size); void *mb_realloc(void *m, unsigned size); void mb_free(void *); /* Memory pools with linear allocation */ typedef struct linpool linpool; linpool *lp_new(pool *, unsigned blk); void *lp_alloc(linpool *, unsigned size); /* Aligned */ void *lp_allocu(linpool *, unsigned size); /* Unaligned */ void *lp_allocz(linpool *, unsigned size); /* With clear */ void lp_flush(linpool *); /* Free everything, but leave linpool */ /* Slabs */ typedef struct slab slab; slab *sl_new(pool *, unsigned size); void *sl_alloc(slab *); void sl_free(slab *, void *); /* * Low-level memory allocation functions, please don't use * outside resource manager and possibly sysdep code. */ void buffer_realloc(void **buf, unsigned *size, unsigned need, unsigned item_size); #ifdef HAVE_LIBDMALLOC /* * The standard dmalloc macros tend to produce lots of namespace * conflicts and we use only xmalloc, xrealloc and xfree, so we * can define the stubs ourselves. */ #define DMALLOC_DISABLE #include #define xmalloc(size) _xmalloc_leap(__FILE__, __LINE__, size) #define xrealloc(size) _xrealloc_leap(__FILE__, __LINE__, size) #define xfree(ptr) _xfree_leap(__FILE__, __LINE__, ptr) #else /* * Unfortunately, several libraries we might want to link to define * their own xmalloc and we don't want to interfere with them, hence * the renaming. */ #define xmalloc bird_xmalloc #define xrealloc bird_xrealloc void *xmalloc(unsigned); void *xrealloc(void *, unsigned); #define xfree(x) free(x) #endif #endif bird-1.6.3/lib/xmalloc.c0000644000103200001440000000221213027054563014000 0ustar feelausers/* * BIRD Library -- malloc() With Checking * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include "nest/bird.h" #include "lib/resource.h" #ifndef HAVE_LIBDMALLOC /** * xmalloc - malloc with checking * @size: block size * * This function is equivalent to malloc() except that in case of * failure it calls die() to quit the program instead of returning * a %NULL pointer. * * Wherever possible, please use the memory resources instead. */ void * xmalloc(uint size) { void *p = malloc(size); if (p) return p; die("Unable to allocate %d bytes of memory", size); } /** * xrealloc - realloc with checking * @ptr: original memory block * @size: block size * * This function is equivalent to realloc() except that in case of * failure it calls die() to quit the program instead of returning * a %NULL pointer. * * Wherever possible, please use the memory resources instead. */ void * xrealloc(void *ptr, uint size) { void *p = realloc(ptr, size); if (p) return p; die("Unable to allocate %d bytes of memory", size); } #endif bird-1.6.3/lib/Doc0000644000103200001440000000027113027054563012630 0ustar feelausersH Library functions S ip.c S lists.c S checksum.c bitops.c patmatch.c printf.c xmalloc.c tbf.c S mac.c D resource.sgml S resource.c S mempool.c S slab.c S event.c S ../sysdep/unix/io.c bird-1.6.3/lib/sha256.c0000644000103200001440000001651513027054563013364 0ustar feelausers/* * BIRD Library -- SHA-256 and SHA-224 Hash Functions * * (c) 2015 CZ.NIC z.s.p.o. * * Based on the code from libgcrypt-1.6.0, which is * (c) 2003, 2006, 2008, 2009 Free Software Foundation, Inc. * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "lib/sha256.h" #include "lib/unaligned.h" // #define SHA256_UNROLLED void sha256_init(struct hash_context *CTX) { struct sha256_context *ctx = (void *) CTX; ctx->h0 = 0x6a09e667; ctx->h1 = 0xbb67ae85; ctx->h2 = 0x3c6ef372; ctx->h3 = 0xa54ff53a; ctx->h4 = 0x510e527f; ctx->h5 = 0x9b05688c; ctx->h6 = 0x1f83d9ab; ctx->h7 = 0x5be0cd19; ctx->nblocks = 0; ctx->count = 0; } void sha224_init(struct hash_context *CTX) { struct sha224_context *ctx = (void *) CTX; ctx->h0 = 0xc1059ed8; ctx->h1 = 0x367cd507; ctx->h2 = 0x3070dd17; ctx->h3 = 0xf70e5939; ctx->h4 = 0xffc00b31; ctx->h5 = 0x68581511; ctx->h6 = 0x64f98fa7; ctx->h7 = 0xbefa4fa4; ctx->nblocks = 0; ctx->count = 0; } /* (4.2) same as SHA-1's F1. */ static inline u32 f1(u32 x, u32 y, u32 z) { return (z ^ (x & (y ^ z))); } /* (4.3) same as SHA-1's F3 */ static inline u32 f3(u32 x, u32 y, u32 z) { return ((x & y) | (z & (x|y))); } /* Bitwise rotation of an uint to the right */ static inline u32 ror(u32 x, int n) { return ((x >> (n&(32-1))) | (x << ((32-n)&(32-1)))); } /* (4.4) */ static inline u32 sum0(u32 x) { return (ror(x, 2) ^ ror(x, 13) ^ ror(x, 22)); } /* (4.5) */ static inline u32 sum1(u32 x) { return (ror(x, 6) ^ ror(x, 11) ^ ror(x, 25)); } /* Transform the message X which consists of 16 32-bit-words. See FIPS 180-2 for details. */ #define S0(x) (ror((x), 7) ^ ror((x), 18) ^ ((x) >> 3)) /* (4.6) */ #define S1(x) (ror((x), 17) ^ ror((x), 19) ^ ((x) >> 10)) /* (4.7) */ #define R(a,b,c,d,e,f,g,h,k,w) \ do \ { \ t1 = (h) + sum1((e)) + f1((e),(f),(g)) + (k) + (w); \ t2 = sum0((a)) + f3((a),(b),(c)); \ h = g; \ g = f; \ f = e; \ e = d + t1; \ d = c; \ c = b; \ b = a; \ a = t1 + t2; \ } while (0) /* The SHA-256 core: Transform the message X which consists of 16 32-bit-words. See FIPS 180-2 for details. */ static uint sha256_transform(struct sha256_context *ctx, const byte *data) { static const u32 K[64] = { 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 }; u32 a,b,c,d,e,f,g,h,t1,t2; u32 w[64]; int i; a = ctx->h0; b = ctx->h1; c = ctx->h2; d = ctx->h3; e = ctx->h4; f = ctx->h5; g = ctx->h6; h = ctx->h7; for (i = 0; i < 16; i++) w[i] = get_u32(data + i * 4); for (; i < 64; i++) w[i] = S1(w[i-2]) + w[i-7] + S0(w[i-15]) + w[i-16]; for (i = 0; i < 64;) { #ifndef SHA256_UNROLLED R(a,b,c,d,e,f,g,h,K[i],w[i]); i++; #else /* Unrolled */ t1 = h + sum1(e) + f1(e, f, g) + K[i] + w[i]; t2 = sum0(a) + f3(a, b, c); d += t1; h = t1 + t2; t1 = g + sum1(d) + f1(d, e, f) + K[i+1] + w[i+1]; t2 = sum0(h) + f3(h, a, b); c += t1; g = t1 + t2; t1 = f + sum1(c) + f1(c, d, e) + K[i+2] + w[i+2]; t2 = sum0(g) + f3(g, h, a); b += t1; f = t1 + t2; t1 = e + sum1(b) + f1(b, c, d) + K[i+3] + w[i+3]; t2 = sum0(f) + f3(f, g, h); a += t1; e = t1 + t2; t1 = d + sum1(a) + f1(a, b, c) + K[i+4] + w[i+4]; t2 = sum0(e) + f3(e, f, g); h += t1; d = t1 + t2; t1 = c + sum1(h) + f1(h, a, b) + K[i+5] + w[i+5]; t2 = sum0(d) + f3(d, e, f); g += t1; c = t1 + t2; t1 = b + sum1(g) + f1(g, h, a) + K[i+6] + w[i+6]; t2 = sum0(c) + f3(c, d, e); f += t1; b = t1 + t2; t1 = a + sum1(f) + f1(f, g, h) + K[i+7] + w[i+7]; t2 = sum0(b) + f3(b, c, d); e += t1; a = t1 + t2; i += 8; #endif } ctx->h0 += a; ctx->h1 += b; ctx->h2 += c; ctx->h3 += d; ctx->h4 += e; ctx->h5 += f; ctx->h6 += g; ctx->h7 += h; return /*burn_stack*/ 74*4+32; } #undef S0 #undef S1 #undef R /* Common function to write a chunk of data to the transform function of a hash algorithm. Note that the use of the term "block" does not imply a fixed size block. Note that we explicitly allow to use this function after the context has been finalized; the result does not have any meaning but writing after finalize is sometimes helpful to mitigate timing attacks. */ void sha256_update(struct hash_context *CTX, const byte *buf, uint len) { struct sha256_context *ctx = (void *) CTX; if (ctx->count) { /* Fill rest of internal buffer */ for (; len && ctx->count < SHA256_BLOCK_SIZE; len--) ctx->buf[ctx->count++] = *buf++; if (ctx->count < SHA256_BLOCK_SIZE) return; /* Process data from internal buffer */ sha256_transform(ctx, ctx->buf); ctx->nblocks++; ctx->count = 0; } if (!len) return; /* Process data from input buffer */ while (len >= SHA256_BLOCK_SIZE) { sha256_transform(ctx, buf); ctx->nblocks++; buf += SHA256_BLOCK_SIZE; len -= SHA256_BLOCK_SIZE; } /* Copy remaining data to internal buffer */ memcpy(ctx->buf, buf, len); ctx->count = len; } /* * The routine finally terminates the computation and returns the digest. The * handle is prepared for a new cycle, but adding bytes to the handle will the * destroy the returned buffer. * * Returns: 32 bytes with the message the digest. 28 bytes for SHA-224. */ byte * sha256_final(struct hash_context *CTX) { struct sha256_context *ctx = (void *) CTX; u32 t, th, msb, lsb; sha256_update(CTX, NULL, 0); /* flush */ t = ctx->nblocks; th = 0; /* multiply by 64 to make a byte count */ lsb = t << 6; msb = (th << 6) | (t >> 26); /* add the count */ t = lsb; if ((lsb += ctx->count) < t) msb++; /* multiply by 8 to make a bit count */ t = lsb; lsb <<= 3; msb <<= 3; msb |= t >> 29; if (ctx->count < 56) { /* enough room */ ctx->buf[ctx->count++] = 0x80; /* pad */ while (ctx->count < 56) ctx->buf[ctx->count++] = 0; /* pad */ } else { /* need one extra block */ ctx->buf[ctx->count++] = 0x80; /* pad character */ while (ctx->count < 64) ctx->buf[ctx->count++] = 0; sha256_update(CTX, NULL, 0); /* flush */; memset(ctx->buf, 0, 56 ); /* fill next block with zeroes */ } /* append the 64 bit count */ put_u32(ctx->buf + 56, msb); put_u32(ctx->buf + 60, lsb); sha256_transform(ctx, ctx->buf); byte *p = ctx->buf; #define X(a) do { put_u32(p, ctx->h##a); p += 4; } while(0) X(0); X(1); X(2); X(3); X(4); X(5); X(6); X(7); #undef X return ctx->buf; } bird-1.6.3/lib/mac.c0000644000103200001440000002005513027054563013106 0ustar feelausers/* * BIRD Library -- Message Authentication Codes * * (c) 2016 Ondrej Zajicek * (c) 2016 CZ.NIC z.s.p.o. * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Message authentication codes * * MAC algorithms are simple cryptographic tools for message authentication. * They use shared a secret key a and message text to generate authentication * code, which is then passed with the message to the other side, where the code * is verified. There are multiple families of MAC algorithms based on different * cryptographic primitives, BIRD implements two MAC families which use hash * functions. * * The first family is simply a cryptographic hash camouflaged as MAC algorithm. * Originally supposed to be (m|k)-hash (message is concatenated with key, and * that is hashed), but later it turned out that a raw hash is more practical. * This is used for cryptographic authentication in OSPFv2, RIP and BFD. * * The second family is the standard HMAC (RFC 2104), using inner and outer hash * to process key and message. HMAC (with SHA) is used in advanced OSPF and RIP * authentication (RFC 5709, RFC 4822). */ #include "lib/mac.h" #include "lib/md5.h" #include "lib/sha1.h" #include "lib/sha256.h" #include "lib/sha512.h" /* * Internal hash calls */ static inline void hash_init(struct mac_context *mctx, struct hash_context *hctx) { mctx->type->hash_init(hctx); } static inline void hash_update(struct mac_context *mctx, struct hash_context *hctx, const byte *buf, uint len) { mctx->type->hash_update(hctx, buf, len); } static inline byte * hash_final(struct mac_context *mctx, struct hash_context *hctx) { return mctx->type->hash_final(hctx); } static inline void hash_buffer(struct mac_context *mctx, byte *outbuf, const byte *buffer, uint length) { struct hash_context hctx; hash_init(mctx, &hctx); hash_update(mctx, &hctx, buffer, length); memcpy(outbuf, hash_final(mctx, &hctx), mctx->type->hash_size); } /* * (not-really-MAC) Hash */ static void nrmh_init(struct mac_context *ctx, const byte *key UNUSED, uint keylen UNUSED) { struct nrmh_context *ct = (void *) ctx; hash_init(ctx, &ct->ictx); } static void nrmh_update(struct mac_context *ctx, const byte *data, uint datalen) { struct nrmh_context *ct = (void *) ctx; hash_update(ctx, &ct->ictx, data, datalen); } static byte * nrmh_final(struct mac_context *ctx) { struct nrmh_context *ct = (void *) ctx; return hash_final(ctx, &ct->ictx); } /* * HMAC */ static void hmac_init(struct mac_context *ctx, const byte *key, uint keylen) { struct hmac_context *ct = (void *) ctx; uint block_size = ctx->type->block_size; uint hash_size = ctx->type->hash_size; byte *keybuf = alloca(block_size); byte *buf = alloca(block_size); uint i; /* Hash the key if necessary */ if (keylen <= block_size) { memcpy(keybuf, key, keylen); memset(keybuf + keylen, 0, block_size - keylen); } else { hash_buffer(ctx, keybuf, key, keylen); memset(keybuf + hash_size, 0, block_size - hash_size); } /* Initialize the inner digest */ hash_init(ctx, &ct->ictx); for (i = 0; i < block_size; i++) buf[i] = keybuf[i] ^ 0x36; hash_update(ctx, &ct->ictx, buf, block_size); /* Initialize the outer digest */ hash_init(ctx, &ct->octx); for (i = 0; i < block_size; i++) buf[i] = keybuf[i] ^ 0x5c; hash_update(ctx, &ct->octx, buf, block_size); } static void hmac_update(struct mac_context *ctx, const byte *data, uint datalen) { struct hmac_context *ct = (void *) ctx; /* Just update the inner digest */ hash_update(ctx, &ct->ictx, data, datalen); } static byte * hmac_final(struct mac_context *ctx) { struct hmac_context *ct = (void *) ctx; /* Finish the inner digest */ byte *isha = hash_final(ctx, &ct->ictx); /* Finish the outer digest */ hash_update(ctx, &ct->octx, isha, ctx->type->hash_size); return hash_final(ctx, &ct->octx); } /* * Common code */ #define HASH_DESC(name, px, PX) \ { name, PX##_SIZE, sizeof(struct nrmh_context), nrmh_init, nrmh_update, nrmh_final, \ PX##_SIZE, PX##_BLOCK_SIZE, px##_init, px##_update, px##_final } #define HMAC_DESC(name, px, PX) \ { name, PX##_SIZE, sizeof(struct hmac_context), hmac_init, hmac_update, hmac_final, \ PX##_SIZE, PX##_BLOCK_SIZE, px##_init, px##_update, px##_final } const struct mac_desc mac_table[ALG_MAX] = { [ALG_MD5] = HASH_DESC("Keyed MD5", md5, MD5), [ALG_SHA1] = HASH_DESC("Keyed SHA-1", sha1, SHA1), [ALG_SHA224] = HASH_DESC("Keyed SHA-224", sha224, SHA224), [ALG_SHA256] = HASH_DESC("Keyed SHA-256", sha256, SHA256), [ALG_SHA384] = HASH_DESC("Keyed SHA-384", sha384, SHA384), [ALG_SHA512] = HASH_DESC("Keyed SHA-512", sha512, SHA512), [ALG_HMAC_MD5] = HMAC_DESC("HMAC-MD5", md5, MD5), [ALG_HMAC_SHA1] = HMAC_DESC("HMAC-SHA-1", sha1, SHA1), [ALG_HMAC_SHA224] = HMAC_DESC("HMAC-SHA-224", sha224, SHA224), [ALG_HMAC_SHA256] = HMAC_DESC("HMAC-SHA-256", sha256, SHA256), [ALG_HMAC_SHA384] = HMAC_DESC("HMAC-SHA-384", sha384, SHA384), [ALG_HMAC_SHA512] = HMAC_DESC("HMAC-SHA-512", sha512, SHA512), }; /** * mac_init - initialize MAC algorithm * @ctx: context to initialize * @id: MAC algorithm ID * @key: MAC key * @keylen: MAC key length * * Initialize MAC context @ctx for algorithm @id (e.g., %ALG_HMAC_SHA1), with * key @key of length @keylen. After that, message data could be added using * mac_update() function. */ void mac_init(struct mac_context *ctx, uint id, const byte *key, uint keylen) { ctx->type = &mac_table[id]; ctx->type->init(ctx, key, keylen); } #if 0 /** * mac_update - add more data to MAC algorithm * @ctx: MAC context * @data: data to add * @datalen: length of data * * Push another @datalen bytes of data pointed to by @data into the MAC * algorithm currently in @ctx. Can be called multiple times for the same MAC * context. It has the same effect as concatenating all the data together and * passing them at once. */ void mac_update(struct mac_context *ctx, const byte *data, uint datalen) { DUMMY; } /** * mac_final - finalize MAC algorithm * @ctx: MAC context * * Finish MAC computation and return a pointer to the result. No more * @mac_update() calls could be done, but the context may be reinitialized * later. * * Note that the returned pointer points into data in the @ctx context. If it * ceases to exist, the pointer becomes invalid. */ byte *mac_final(struct mac_context *ctx) { DUMMY; } /** * mac_cleanup - cleanup MAC context * @ctx: MAC context * * Cleanup MAC context after computation (by filling with zeros). Not strictly * necessary, just to erase sensitive data from stack. This also invalidates the * pointer returned by @mac_final(). */ void mac_cleanup(struct mac_context *ctx) { DUMMY; } #endif /** * mac_fill - compute and fill MAC * @id: MAC algorithm ID * @key: secret key * @keylen: key length * @data: message data * @datalen: message length * @mac: place to fill MAC * * Compute MAC for specified key @key and message @data using algorithm @id and * copy it to buffer @mac. mac_fill() is a shortcut function doing all usual * steps for transmitted messages. */ void mac_fill(uint id, const byte *key, uint keylen, const byte *data, uint datalen, byte *mac) { struct mac_context ctx; mac_init(&ctx, id, key, keylen); mac_update(&ctx, data, datalen); memcpy(mac, mac_final(&ctx), mac_get_length(&ctx)); mac_cleanup(&ctx); } /** * mac_verify - compute and verify MAC * @id: MAC algorithm ID * @key: secret key * @keylen: key length * @data: message data * @datalen: message length * @mac: received MAC * * Compute MAC for specified key @key and message @data using algorithm @id and * compare it with received @mac, return whether they are the same. mac_verify() * is a shortcut function doing all usual steps for received messages. */ int mac_verify(uint id, const byte *key, uint keylen, const byte *data, uint datalen, const byte *mac) { struct mac_context ctx; mac_init(&ctx, id, key, keylen); mac_update(&ctx, data, datalen); int res = !memcmp(mac, mac_final(&ctx), mac_get_length(&ctx)); mac_cleanup(&ctx); return res; } bird-1.6.3/lib/bitops.c0000644000103200001440000000324713027054563013652 0ustar feelausers/* * BIRD Library -- Generic Bit Operations * * (c) 1998 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "nest/bird.h" #include "bitops.h" /** * u32_mkmask - create a bit mask * @n: number of bits * * u32_mkmask() returns an unsigned 32-bit integer which binary * representation consists of @n ones followed by zeroes. */ u32 u32_mkmask(uint n) { return n ? ~((1 << (32 - n)) - 1) : 0; } /** * u32_masklen - calculate length of a bit mask * @x: bit mask * * This function checks whether the given integer @x represents * a valid bit mask (binary representation contains first ones, then * zeroes) and returns the number of ones or -1 if the mask is invalid. */ int u32_masklen(u32 x) { int l = 0; u32 n = ~x; if (n & (n+1)) return -1; if (x & 0x0000ffff) { x &= 0x0000ffff; l += 16; } if (x & 0x00ff00ff) { x &= 0x00ff00ff; l += 8; } if (x & 0x0f0f0f0f) { x &= 0x0f0f0f0f; l += 4; } if (x & 0x33333333) { x &= 0x33333333; l += 2; } if (x & 0x55555555) l++; if (x & 0xaaaaaaaa) l++; return l; } /** * u32_log2 - compute a binary logarithm. * @v: number * * This function computes a integral part of binary logarithm of given * integer @v and returns it. The computed value is also an index of the * most significant non-zero bit position. */ u32 u32_log2(u32 v) { /* The code from http://www-graphics.stanford.edu/~seander/bithacks.html */ u32 r, shift; r = (v > 0xFFFF) << 4; v >>= r; shift = (v > 0xFF ) << 3; v >>= shift; r |= shift; shift = (v > 0xF ) << 2; v >>= shift; r |= shift; shift = (v > 0x3 ) << 1; v >>= shift; r |= shift; r |= (v >> 1); return r; } bird-1.6.3/lib/ip.h0000644000103200001440000002672713027054563012777 0ustar feelausers/* * BIRD Internet Routing Daemon -- The Internet Protocol * * (c) 1998 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_IP_H_ #define _BIRD_IP_H_ #include "lib/endian.h" #include "lib/string.h" #include "lib/bitops.h" #include "lib/unaligned.h" #define IP4_ALL_NODES ipa_build4(224, 0, 0, 1) #define IP4_ALL_ROUTERS ipa_build4(224, 0, 0, 2) #define IP4_OSPF_ALL_ROUTERS ipa_build4(224, 0, 0, 5) #define IP4_OSPF_DES_ROUTERS ipa_build4(224, 0, 0, 6) #define IP4_RIP_ROUTERS ipa_build4(224, 0, 0, 9) #define IP6_ALL_NODES ipa_build6(0xFF020000, 0, 0, 1) #define IP6_ALL_ROUTERS ipa_build6(0xFF020000, 0, 0, 2) #define IP6_OSPF_ALL_ROUTERS ipa_build6(0xFF020000, 0, 0, 5) #define IP6_OSPF_DES_ROUTERS ipa_build6(0xFF020000, 0, 0, 6) #define IP6_RIP_ROUTERS ipa_build6(0xFF020000, 0, 0, 9) #define IP6_BABEL_ROUTERS ipa_build6(0xFF020000, 0, 0, 0x00010006) #define IP4_NONE _MI4(0) #define IP6_NONE _MI6(0,0,0,0) #define IP4_MIN_MTU 576 #define IP6_MIN_MTU 1280 #define IP_PREC_INTERNET_CONTROL 0xc0 #define IP4_HEADER_LENGTH 20 #define IP6_HEADER_LENGTH 40 #define UDP_HEADER_LENGTH 8 #ifdef IPV6 #define MAX_PREFIX_LENGTH 128 #define BITS_PER_IP_ADDRESS 128 #define STD_ADDRESS_P_LENGTH 39 #define SIZE_OF_IP_HEADER 40 #else #define MAX_PREFIX_LENGTH 32 #define BITS_PER_IP_ADDRESS 32 #define STD_ADDRESS_P_LENGTH 15 #define SIZE_OF_IP_HEADER 24 #endif #ifdef DEBUGGING typedef struct ip4_addr { u32 addr; } ip4_addr; #define _MI4(x) ((struct ip4_addr) { x }) #define _I(x) (x).addr #else typedef u32 ip4_addr; #define _MI4(x) (x) #define _I(x) (x) #endif typedef struct ip6_addr { u32 addr[4]; } ip6_addr; #define _MI6(a,b,c,d) ((struct ip6_addr) {{ a, b, c, d }}) #define _I0(a) ((a).addr[0]) #define _I1(a) ((a).addr[1]) #define _I2(a) ((a).addr[2]) #define _I3(a) ((a).addr[3]) #ifdef IPV6 /* Structure ip_addr may contain both IPv4 and IPv6 addresses */ typedef ip6_addr ip_addr; #define IPA_NONE IP6_NONE #define ipa_from_ip4(x) _MI6(0,0,0xffff,_I(x)) #define ipa_from_ip6(x) x #define ipa_from_u32(x) ipa_from_ip4(ip4_from_u32(x)) #define ipa_to_ip4(x) _MI4(_I3(x)) #define ipa_to_ip6(x) x #define ipa_to_u32(x) ip4_to_u32(ipa_to_ip4(x)) #define ipa_is_ip4(a) ip6_is_v4mapped(a) #else /* Provisionary ip_addr definition same as ip4_addr */ typedef ip4_addr ip_addr; #define IPA_NONE IP4_NONE #define ipa_from_ip4(x) x #define ipa_from_ip6(x) IPA_NONE #define ipa_from_u32(x) ipa_from_ip4(ip4_from_u32(x)) #define ipa_to_ip4(x) x #define ipa_to_ip6(x) IP6_NONE #define ipa_to_u32(x) ip4_to_u32(ipa_to_ip4(x)) #define ipa_is_ip4(a) 1 #endif /* * Public constructors */ #define ip4_from_u32(x) _MI4(x) #define ip4_to_u32(x) _I(x) #define ip4_build(a,b,c,d) _MI4(((a) << 24) | ((b) << 16) | ((c) << 8) | (d)) #define ip6_build(a,b,c,d) _MI6(a,b,c,d) #define ipa_build4(a,b,c,d) ipa_from_ip4(ip4_build(a,b,c,d)) #define ipa_build6(a,b,c,d) ipa_from_ip6(ip6_build(a,b,c,d)) /* * Basic algebraic functions */ static inline int ip4_equal(ip4_addr a, ip4_addr b) { return _I(a) == _I(b); } static inline int ip4_zero(ip4_addr a) { return _I(a) == 0; } static inline int ip4_nonzero(ip4_addr a) { return _I(a) != 0; } static inline ip4_addr ip4_and(ip4_addr a, ip4_addr b) { return _MI4(_I(a) & _I(b)); } static inline ip4_addr ip4_or(ip4_addr a, ip4_addr b) { return _MI4(_I(a) | _I(b)); } static inline ip4_addr ip4_xor(ip4_addr a, ip4_addr b) { return _MI4(_I(a) ^ _I(b)); } static inline ip4_addr ip4_not(ip4_addr a) { return _MI4(~_I(a)); } static inline int ip6_equal(ip6_addr a, ip6_addr b) { return _I0(a) == _I0(b) && _I1(a) == _I1(b) && _I2(a) == _I2(b) && _I3(a) == _I3(b); } static inline int ip6_zero(ip6_addr a) { return !_I0(a) && !_I1(a) && !_I2(a) && !_I3(a); } static inline int ip6_nonzero(ip6_addr a) { return _I0(a) || _I1(a) || _I2(a) || _I3(a); } static inline ip6_addr ip6_and(ip6_addr a, ip6_addr b) { return _MI6(_I0(a) & _I0(b), _I1(a) & _I1(b), _I2(a) & _I2(b), _I3(a) & _I3(b)); } static inline ip6_addr ip6_or(ip6_addr a, ip6_addr b) { return _MI6(_I0(a) | _I0(b), _I1(a) | _I1(b), _I2(a) | _I2(b), _I3(a) | _I3(b)); } static inline ip6_addr ip6_xor(ip6_addr a, ip6_addr b) { return _MI6(_I0(a) ^ _I0(b), _I1(a) ^ _I1(b), _I2(a) ^ _I2(b), _I3(a) ^ _I3(b)); } static inline ip6_addr ip6_not(ip6_addr a) { return _MI6(~_I0(a), ~_I1(a), ~_I2(a), ~_I3(a)); } #ifdef IPV6 #define ipa_equal(x,y) ip6_equal(x,y) #define ipa_zero(x) ip6_zero(x) #define ipa_nonzero(x) ip6_nonzero(x) #define ipa_and(x,y) ip6_and(x,y) #define ipa_or(x,y) ip6_or(x,y) #define ipa_xor(x,y) ip6_xor(x,y) #define ipa_not(x) ip6_not(x) #else #define ipa_equal(x,y) ip4_equal(x,y) #define ipa_zero(x) ip4_zero(x) #define ipa_nonzero(x) ip4_nonzero(x) #define ipa_and(x,y) ip4_and(x,y) #define ipa_or(x,y) ip4_or(x,y) #define ipa_xor(x,y) ip4_xor(x,y) #define ipa_not(x) ip4_not(x) #endif #ifdef IPV6 /* * A zero address is either a token for invalid/unused, or the prefix of default * routes. These functions should be used in the second case, where both IPv4 * and IPv6 zero addresses should be checked. */ static inline int ipa_zero2(ip_addr a) { return !_I0(a) && !_I1(a) && ((_I2(a) == 0) || (_I2(a) == 0xffff)) && !_I3(a); } static inline int ipa_nonzero2(ip_addr a) { return _I0(a) || _I1(a) || ((_I2(a) != 0) && (_I2(a) != 0xffff)) || _I3(a); } #else #define ipa_zero2(x) ip4_zero(x) #define ipa_nonzero2(x) ip4_nonzero(x) #endif /* * Hash and compare functions */ static inline uint ip4_hash(ip4_addr a) { /* Returns a 16-bit value */ u32 x = _I(a); x ^= x >> 16; x ^= x << 10; return x & 0xffff; } static inline u32 ip4_hash32(ip4_addr a) { /* Returns a 32-bit value, although low-order bits are not mixed */ u32 x = _I(a); x ^= x << 16; x ^= x << 12; return x; } static inline uint ip6_hash(ip6_addr a) { /* Returns a 16-bit hash key */ u32 x = _I0(a) ^ _I1(a) ^ _I2(a) ^ _I3(a); return (x ^ (x >> 16) ^ (x >> 8)) & 0xffff; } static inline u32 ip6_hash32(ip6_addr a) { /* Returns a 32-bit hash key, although low-order bits are not mixed */ u32 x = _I0(a) ^ _I1(a) ^ _I2(a) ^ _I3(a); return x ^ (x << 16) ^ (x << 24); } static inline int ip4_compare(ip4_addr a, ip4_addr b) { return (_I(a) > _I(b)) - (_I(a) < _I(b)); } int ip6_compare(ip6_addr a, ip6_addr b); #ifdef IPV6 #define ipa_hash(x) ip6_hash(x) #define ipa_hash32(x) ip6_hash32(x) #define ipa_compare(x,y) ip6_compare(x,y) #else #define ipa_hash(x) ip4_hash(x) #define ipa_hash32(x) ip4_hash32(x) #define ipa_compare(x,y) ip4_compare(x,y) #endif /* * IP address classification */ /* Address class */ #define IADDR_INVALID -1 #define IADDR_SCOPE_MASK 0xfff #define IADDR_HOST 0x1000 #define IADDR_BROADCAST 0x2000 #define IADDR_MULTICAST 0x4000 /* Address scope */ #define SCOPE_HOST 0 #define SCOPE_LINK 1 #define SCOPE_SITE 2 #define SCOPE_ORGANIZATION 3 #define SCOPE_UNIVERSE 4 #define SCOPE_UNDEFINED 5 int ip4_classify(ip4_addr ad); int ip6_classify(ip6_addr *a); static inline int ip6_is_link_local(ip6_addr a) { return (_I0(a) & 0xffc00000) == 0xfe800000; } static inline int ip6_is_v4mapped(ip6_addr a) { return _I0(a) == 0 && _I1(a) == 0 && _I2(a) == 0xffff; } #ifdef IPV6 #define ipa_classify(x) ip6_classify(&(x)) #define ipa_is_link_local(x) ip6_is_link_local(x) #else #define ipa_classify(x) ip4_classify(x) #define ipa_is_link_local(x) 0 #endif static inline int ipa_classify_net(ip_addr a) { return ipa_zero2(a) ? (IADDR_HOST | SCOPE_UNIVERSE) : ipa_classify(a); } /* * Miscellaneous IP prefix manipulation */ static inline ip4_addr ip4_mkmask(uint n) { return _MI4(u32_mkmask(n)); } static inline int ip4_masklen(ip4_addr a) { return u32_masklen(_I(a)); } ip6_addr ip6_mkmask(uint n); int ip6_masklen(ip6_addr *a); /* ipX_pxlen() requires that x != y */ static inline uint ip4_pxlen(ip4_addr a, ip4_addr b) { return 31 - u32_log2(_I(a) ^ _I(b)); } static inline uint ip6_pxlen(ip6_addr a, ip6_addr b) { int i = 0; i += (a.addr[i] == b.addr[i]); i += (a.addr[i] == b.addr[i]); i += (a.addr[i] == b.addr[i]); i += (a.addr[i] == b.addr[i]); return 32 * i + 31 - u32_log2(a.addr[i] ^ b.addr[i]); } static inline u32 ip4_getbit(ip4_addr a, uint pos) { return _I(a) & (0x80000000 >> pos); } static inline u32 ip6_getbit(ip6_addr a, uint pos) { return a.addr[pos / 32] & (0x80000000 >> (pos % 32)); } static inline ip4_addr ip4_opposite_m1(ip4_addr a) { return _MI4(_I(a) ^ 1); } static inline ip4_addr ip4_opposite_m2(ip4_addr a) { return _MI4(_I(a) ^ 3); } static inline ip6_addr ip6_opposite_m1(ip6_addr a) { return _MI6(_I0(a), _I1(a), _I2(a), _I3(a) ^ 1); } static inline ip6_addr ip6_opposite_m2(ip6_addr a) { return _MI6(_I0(a), _I1(a), _I2(a), _I3(a) ^ 3); } ip4_addr ip4_class_mask(ip4_addr ad); #ifdef IPV6 #define ipa_mkmask(x) ip6_mkmask(x) #define ipa_masklen(x) ip6_masklen(&x) #define ipa_pxlen(x,y) ip6_pxlen(x,y) #define ipa_getbit(x,n) ip6_getbit(x,n) #define ipa_opposite_m1(x) ip6_opposite_m1(x) #define ipa_opposite_m2(x) ip6_opposite_m2(x) #else #define ipa_mkmask(x) ip4_mkmask(x) #define ipa_masklen(x) ip4_masklen(x) #define ipa_pxlen(x,y) ip4_pxlen(x,y) #define ipa_getbit(x,n) ip4_getbit(x,n) #define ipa_opposite_m1(x) ip4_opposite_m1(x) #define ipa_opposite_m2(x) ip4_opposite_m2(x) #endif /* * Host/network order conversions */ static inline ip4_addr ip4_hton(ip4_addr a) { return _MI4(htonl(_I(a))); } static inline ip4_addr ip4_ntoh(ip4_addr a) { return _MI4(ntohl(_I(a))); } static inline ip6_addr ip6_hton(ip6_addr a) { return _MI6(htonl(_I0(a)), htonl(_I1(a)), htonl(_I2(a)), htonl(_I3(a))); } static inline ip6_addr ip6_ntoh(ip6_addr a) { return _MI6(ntohl(_I0(a)), ntohl(_I1(a)), ntohl(_I2(a)), ntohl(_I3(a))); } #ifdef IPV6 #define ipa_hton(x) x = ip6_hton(x) #define ipa_ntoh(x) x = ip6_ntoh(x) #else #define ipa_hton(x) x = ip4_hton(x) #define ipa_ntoh(x) x = ip4_ntoh(x) #endif /* * Unaligned data access (in network order) */ static inline ip4_addr get_ip4(void *buf) { return _MI4(get_u32(buf)); } static inline ip6_addr get_ip6(void *buf) { ip6_addr a; memcpy(&a, buf, 16); return ip6_ntoh(a); } static inline void * put_ip4(void *buf, ip4_addr a) { put_u32(buf, _I(a)); return buf+4; } static inline void * put_ip6(void *buf, ip6_addr a) { a = ip6_hton(a); memcpy(buf, &a, 16); return buf+16; } // XXXX these functions must be redesigned or removed #ifdef IPV6 #define get_ipa(x) get_ip6(x) #define put_ipa(x,y) put_ip6(x,y) #else #define get_ipa(x) get_ip4(x) #define put_ipa(x,y) put_ip4(x,y) #endif /* * Binary/text form conversions */ char *ip4_ntop(ip4_addr a, char *b); char *ip6_ntop(ip6_addr a, char *b); static inline char * ip4_ntox(ip4_addr a, char *b) { return b + bsprintf(b, "%08x", _I(a)); } static inline char * ip6_ntox(ip6_addr a, char *b) { return b + bsprintf(b, "%08x.%08x.%08x.%08x", _I0(a), _I1(a), _I2(a), _I3(a)); } int ip4_pton(const char *a, ip4_addr *o); int ip6_pton(const char *a, ip6_addr *o); // XXXX these functions must be redesigned or removed #ifdef IPV6 #define ipa_ntop(x,y) ip6_ntop(x,y) #define ipa_ntox(x,y) ip6_ntox(x,y) #define ipa_pton(x,y) ip6_pton(x,y) #else #define ipa_ntop(x,y) ip4_ntop(x,y) #define ipa_ntox(x,y) ip4_ntox(x,y) #define ipa_pton(x,y) ip4_pton(x,y) #endif /* * Miscellaneous */ // XXXX review this #define ip_is_prefix(a,l) (!ipa_nonzero(ipa_and(a, ipa_not(ipa_mkmask(l))))) #define ipa_in_net(x,n,p) (ipa_zero(ipa_and(ipa_xor((n),(x)),ipa_mkmask(p)))) #define net_in_net(n1,l1,n2,l2) (((l1) >= (l2)) && (ipa_zero(ipa_and(ipa_xor((n1),(n2)),ipa_mkmask(l2))))) char *ip_scope_text(uint); struct prefix { ip_addr addr; uint len; }; #endif bird-1.6.3/lib/ip.c0000644000103200001440000003040613027054563012757 0ustar feelausers/* * BIRD Library -- IP address functions * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: IP addresses * * BIRD uses its own abstraction of IP address in order to share the same * code for both IPv4 and IPv6. IP addresses are represented as entities * of type &ip_addr which are never to be treated as numbers and instead * they must be manipulated using the following functions and macros. */ #include #include "nest/bird.h" #include "lib/ip.h" int ip6_compare(ip6_addr a, ip6_addr b) { int i; for (i=0; i<4; i++) if (a.addr[i] > b.addr[i]) return 1; else if (a.addr[i] < b.addr[i]) return -1; return 0; } ip6_addr ip6_mkmask(uint n) { ip6_addr a; int i; for (i=0; i<4; i++) { if (!n) a.addr[i] = 0; else if (n >= 32) { a.addr[i] = ~0; n -= 32; } else { a.addr[i] = u32_mkmask(n); n = 0; } } return a; } int ip6_masklen(ip6_addr *a) { int i, j, n; for (i=0, n=0; i<4; i++, n+=32) if (a->addr[i] != ~0U) { j = u32_masklen(a->addr[i]); if (j < 0) return j; n += j; while (++i < 4) if (a->addr[i]) return -1; break; } return n; } int ip4_classify(ip4_addr ad) { u32 a = _I(ad); u32 b = a >> 24U; if (b && b <= 0xdf) { if (b == 0x7f) return IADDR_HOST | SCOPE_HOST; else if ((b == 0x0a) || ((a & 0xffff0000) == 0xc0a80000) || ((a & 0xfff00000) == 0xac100000)) return IADDR_HOST | SCOPE_SITE; else return IADDR_HOST | SCOPE_UNIVERSE; } if (b >= 0xe0 && b <= 0xef) return IADDR_MULTICAST | SCOPE_UNIVERSE; if (a == 0xffffffff) return IADDR_BROADCAST | SCOPE_LINK; return IADDR_INVALID; } int ip6_classify(ip6_addr *a) { u32 x = a->addr[0]; if ((x & 0xe0000000) == 0x20000000) /* 2000::/3 Aggregatable Global Unicast Address */ return IADDR_HOST | SCOPE_UNIVERSE; if ((x & 0xffc00000) == 0xfe800000) /* fe80::/10 Link-Local Address */ return IADDR_HOST | SCOPE_LINK; if ((x & 0xffc00000) == 0xfec00000) /* fec0::/10 Site-Local Address */ return IADDR_HOST | SCOPE_SITE; if ((x & 0xfe000000) == 0xfc000000) /* fc00::/7 Unique Local Unicast Address (RFC 4193) */ return IADDR_HOST | SCOPE_SITE; if ((x & 0xff000000) == 0xff000000) /* ff00::/8 Multicast Address */ { uint scope = (x >> 16) & 0x0f; switch (scope) { case 1: return IADDR_MULTICAST | SCOPE_HOST; case 2: return IADDR_MULTICAST | SCOPE_LINK; case 5: return IADDR_MULTICAST | SCOPE_SITE; case 8: return IADDR_MULTICAST | SCOPE_ORGANIZATION; case 14: return IADDR_MULTICAST | SCOPE_UNIVERSE; default: return IADDR_MULTICAST | SCOPE_UNDEFINED; } } if (!x && !a->addr[1]) { u32 a2 = a->addr[2]; u32 a3 = a->addr[3]; if (a2 == 0 && a3 == 1) return IADDR_HOST | SCOPE_HOST; /* Loopback address */ if (a2 == 0) return ip4_classify(_MI4(a3)); /* IPv4 compatible addresses */ if (a2 == 0xffff) return ip4_classify(_MI4(a3)); /* IPv4 mapped addresses */ return IADDR_INVALID; } return IADDR_HOST | SCOPE_UNDEFINED; } /* * Conversion of IPv6 address to presentation format and vice versa. * Heavily inspired by routines written by Paul Vixie for the BIND project * and of course by RFC 2373. */ char * ip4_ntop(ip4_addr a, char *b) { u32 x = _I(a); return b + bsprintf(b, "%d.%d.%d.%d", (x >> 24) & 0xff, (x >> 16) & 0xff, (x >> 8) & 0xff, x & 0xff); } char * ip6_ntop(ip6_addr a, char *b) { u16 words[8]; int bestpos, bestlen, curpos, curlen, i; /* First of all, preprocess the address and find the longest run of zeros */ bestlen = bestpos = curpos = curlen = 0; for (i=0; i<8; i++) { u32 x = a.addr[i/2]; words[i] = ((i%2) ? x : (x >> 16)) & 0xffff; if (words[i]) curlen = 0; else { if (!curlen) curpos = i; curlen++; if (curlen > bestlen) { bestpos = curpos; bestlen = curlen; } } } if (bestlen < 2) bestpos = -1; /* Is it an encapsulated IPv4 address? */ if (!bestpos && ((bestlen == 5 && a.addr[2] == 0xffff) || (bestlen == 6))) { u32 x = a.addr[3]; b += bsprintf(b, "::%s%d.%d.%d.%d", a.addr[2] ? "ffff:" : "", (x >> 24) & 0xff, (x >> 16) & 0xff, (x >> 8) & 0xff, x & 0xff); return b; } /* Normal IPv6 formatting, compress the largest sequence of zeros */ for (i=0; i<8; i++) { if (i == bestpos) { i += bestlen - 1; *b++ = ':'; if (i == 7) *b++ = ':'; } else { if (i) *b++ = ':'; b += bsprintf(b, "%x", words[i]); } } *b = 0; return b; } int ip4_pton(const char *a, ip4_addr *o) { int i; unsigned long int l; u32 ia = 0; i=4; while (i--) { char *d, *c = strchr(a, '.'); if (!c != !i) return 0; l = strtoul(a, &d, 10); if (((d != c) && *d) || (l > 255)) return 0; ia = (ia << 8) | l; if (c) c++; a = c; } *o = ip4_from_u32(ia); return 1; } int ip6_pton(const char *a, ip6_addr *o) { u16 words[8]; int i, j, k, l, hfil; const char *start; if (a[0] == ':') /* Leading :: */ { if (a[1] != ':') return 0; a++; } hfil = -1; i = 0; while (*a) { if (*a == ':') /* :: */ { if (hfil >= 0) return 0; hfil = i; a++; continue; } j = 0; l = 0; start = a; for (;;) { if (*a >= '0' && *a <= '9') k = *a++ - '0'; else if (*a >= 'A' && *a <= 'F') k = *a++ - 'A' + 10; else if (*a >= 'a' && *a <= 'f') k = *a++ - 'a' + 10; else break; j = (j << 4) + k; if (j >= 0x10000 || ++l > 4) return 0; } if (*a == ':' && a[1]) a++; else if (*a == '.' && (i == 6 || i < 6 && hfil >= 0)) { /* Embedded IPv4 address */ ip4_addr x; if (!ip4_pton(start, &x)) return 0; words[i++] = _I(x) >> 16; words[i++] = _I(x); break; } else if (*a) return 0; if (i >= 8) return 0; words[i++] = j; } /* Replace :: with an appropriate number of zeros */ if (hfil >= 0) { j = 8 - i; for (i=7; i-j >= hfil; i--) words[i] = words[i-j]; for (; i>=hfil; i--) words[i] = 0; } /* Convert the address to ip6_addr format */ for (i=0; i<4; i++) o->addr[i] = (words[2*i] << 16) | words[2*i+1]; return 1; } /** * ip_scope_text - get textual representation of address scope * @scope: scope (%SCOPE_xxx) * * Returns a pointer to a textual name of the scope given. */ char * ip_scope_text(uint scope) { static char *scope_table[] = { "host", "link", "site", "org", "univ", "undef" }; if (scope > SCOPE_UNDEFINED) return "?"; else return scope_table[scope]; } ip4_addr ip4_class_mask(ip4_addr ad) { u32 m, a = _I(ad); if (a == 0x00000000) m = 0x00000000; else if (a < 0x80000000) m = 0xff000000; else if (a < 0xc0000000) m = 0xffff0000; else m = 0xffffff00; if (a & ~m) m = 0xffffffff; return _MI4(m); } #if 0 /** * ipa_equal - compare two IP addresses for equality * @x: IP address * @y: IP address * * ipa_equal() returns 1 if @x and @y represent the same IP address, else 0. */ int ipa_equal(ip_addr x, ip_addr y) { DUMMY } /** * ipa_nonzero - test if an IP address is defined * @x: IP address * * ipa_nonzero returns 1 if @x is a defined IP address (not all bits are zero), * else 0. * * The undefined all-zero address is reachable as a |IPA_NONE| macro. */ int ipa_nonzero(ip_addr x) { DUMMY } /** * ipa_and - compute bitwise and of two IP addresses * @x: IP address * @y: IP address * * This function returns a bitwise and of @x and @y. It's primarily * used for network masking. */ ip_addr ipa_and(ip_addr x, ip_addr y) { DUMMY } /** * ipa_or - compute bitwise or of two IP addresses * @x: IP address * @y: IP address * * This function returns a bitwise or of @x and @y. */ ip_addr ipa_or(ip_addr x, ip_addr y) { DUMMY } /** * ipa_xor - compute bitwise xor of two IP addresses * @x: IP address * @y: IP address * * This function returns a bitwise xor of @x and @y. */ ip_addr ipa_xor(ip_addr x, ip_addr y) { DUMMY } /** * ipa_not - compute bitwise negation of two IP addresses * @x: IP address * * This function returns a bitwise negation of @x. */ ip_addr ipa_not(ip_addr x) { DUMMY } /** * ipa_mkmask - create a netmask * @x: prefix length * * This function returns an &ip_addr corresponding of a netmask * of an address prefix of size @x. */ ip_addr ipa_mkmask(int x) { DUMMY } /** * ipa_masklen - calculate netmask length * @x: IP address * * This function checks whether @x represents a valid netmask and * returns the size of the associate network prefix or -1 for invalid * mask. */ int ipa_masklen(ip_addr x) { DUMMY } /** * ipa_hash - hash IP addresses * @x: IP address * * ipa_hash() returns a 16-bit hash value of the IP address @x. */ int ipa_hash(ip_addr x) { DUMMY } /** * ipa_hton - convert IP address to network order * @x: IP address * * Converts the IP address @x to the network byte order. * * Beware, this is a macro and it alters the argument! */ void ipa_hton(ip_addr x) { DUMMY } /** * ipa_ntoh - convert IP address to host order * @x: IP address * * Converts the IP address @x from the network byte order. * * Beware, this is a macro and it alters the argument! */ void ipa_ntoh(ip_addr x) { DUMMY } /** * ipa_classify - classify an IP address * @x: IP address * * ipa_classify() returns an address class of @x, that is a bitwise or * of address type (%IADDR_INVALID, %IADDR_HOST, %IADDR_BROADCAST, %IADDR_MULTICAST) * with address scope (%SCOPE_HOST to %SCOPE_UNIVERSE) or -1 (%IADDR_INVALID) * for an invalid address. */ int ipa_classify(ip_addr x) { DUMMY } /** * ip4_class_mask - guess netmask according to address class * @x: IPv4 address * * This function (available in IPv4 version only) returns a * network mask according to the address class of @x. Although * classful addressing is nowadays obsolete, there still live * routing protocols transferring no prefix lengths nor netmasks * and this function could be useful to them. */ ip4_addr ip4_class_mask(ip4_addr x) { DUMMY } /** * ipa_from_u32 - convert IPv4 address to an integer * @x: IP address * * This function takes an IPv4 address and returns its numeric * representation. */ u32 ipa_from_u32(ip_addr x) { DUMMY } /** * ipa_to_u32 - convert integer to IPv4 address * @x: a 32-bit integer * * ipa_to_u32() takes a numeric representation of an IPv4 address * and converts it to the corresponding &ip_addr. */ ip_addr ipa_to_u32(u32 x) { DUMMY } /** * ipa_compare - compare two IP addresses for order * @x: IP address * @y: IP address * * The ipa_compare() function takes two IP addresses and returns * -1 if @x is less than @y in canonical ordering (lexicographical * order of the bit strings), 1 if @x is greater than @y and 0 * if they are the same. */ int ipa_compare(ip_addr x, ip_addr y) { DUMMY } /** * ipa_build6 - build an IPv6 address from parts * @a1: part #1 * @a2: part #2 * @a3: part #3 * @a4: part #4 * * ipa_build() takes @a1 to @a4 and assembles them to a single IPv6 * address. It's used for example when a protocol wants to bind its * socket to a hard-wired multicast address. */ ip_addr ipa_build6(u32 a1, u32 a2, u32 a3, u32 a4) { DUMMY } /** * ip_ntop - convert IP address to textual representation * @a: IP address * @buf: buffer of size at least %STD_ADDRESS_P_LENGTH * * This function takes an IP address and creates its textual * representation for presenting to the user. */ char *ip_ntop(ip_addr a, char *buf) { DUMMY } /** * ip_ntox - convert IP address to hexadecimal representation * @a: IP address * @buf: buffer of size at least %STD_ADDRESS_P_LENGTH * * This function takes an IP address and creates its hexadecimal * textual representation. Primary use: debugging dumps. */ char *ip_ntox(ip_addr a, char *buf) { DUMMY } /** * ip_pton - parse textual representation of IP address * @a: textual representation * @o: where to put the resulting address * * This function parses a textual IP address representation and * stores the decoded address to a variable pointed to by @o. * Returns 0 if a parse error has occurred, else 0. */ int ip_pton(char *a, ip_addr *o) { DUMMY } #endif bird-1.6.3/lib/checksum.c0000644000103200001440000000462213027054563014152 0ustar feelausers/* * BIRD Library -- IP One-Complement Checksum * * (c) 1999--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Miscellaneous functions. */ #include #include "nest/bird.h" #include "checksum.h" static inline u32 add32(u32 sum, u32 x) { u32 z = sum + x; // return z + (z < sum); /* add carry */ if (z < x) z++; return z; } static u16 ipsum_calc_block(u32 *buf, uint len, u16 isum) { /* * A few simple facts about the IP checksum (see RFC 1071 for detailed * discussion): * * o It's associative and commutative. * o It's byte order independent. * o It's word size independent. * * This gives us a neat 32-bits-at-a-time algorithm which respects * usual alignment requirements and is reasonably fast. */ ASSERT(!(len % 4)); if (!len) return isum; u32 *end = buf + (len >> 2); u32 sum = isum; while (buf < end) sum = add32(sum, *buf++); sum = (sum >> 16) + (sum & 0xffff); /* add high-16 to low-16 */ sum += (sum >> 16); /* add carry */ return sum; } static u16 ipsum_calc(void *frag, uint len, va_list args) { u16 sum = 0; for(;;) { sum = ipsum_calc_block(frag, len, sum); frag = va_arg(args, void *); if (!frag) break; len = va_arg(args, uint); } return sum; } /** * ipsum_verify - verify an IP checksum * @frag: first packet fragment * @len: length in bytes * * This function verifies whether a given fragmented packet * has correct one's complement checksum as used by the IP * protocol. * * It uses all the clever tricks described in RFC 1071 to speed * up checksum calculation as much as possible. * * Result: 1 if the checksum is correct, 0 else. */ int ipsum_verify(void *frag, uint len, ...) { va_list args; u16 sum; va_start(args, len); sum = ipsum_calc(frag, len, args); va_end(args); return sum == 0xffff; } /** * ipsum_calculate - compute an IP checksum * @frag: first packet fragment * @len: length in bytes * * This function calculates a one's complement checksum of a given fragmented * packet. * * It uses all the clever tricks described in RFC 1071 to speed * up checksum calculation as much as possible. */ u16 ipsum_calculate(void *frag, uint len, ...) { va_list args; u16 sum; va_start(args, len); sum = ipsum_calc(frag, len, args); va_end(args); return 0xffff - sum; } bird-1.6.3/lib/checksum.h0000644000103200001440000000065613027054563014162 0ustar feelausers/* * BIRD Library -- IP One-Complement Checksum * * (c) 1999 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_CHECKSUM_H_ #define _BIRD_CHECKSUM_H_ /* * Both checksumming functions accept a vararg list of packet * fragments finished by NULL pointer. */ int ipsum_verify(void *frag, uint len, ...); u16 ipsum_calculate(void *frag, uint len, ...); #endif bird-1.6.3/lib/bitops.h0000644000103200001440000000125513027054563013654 0ustar feelausers/* * BIRD Library -- Generic Bit Operations * * (c) 1998 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_BITOPTS_H_ #define _BIRD_BITOPTS_H_ /* * Bit mask operations: * * u32_mkmask Make bit mask consisting of consecutive ones * from the left and the rest filled with zeroes. * E.g., u32_mkmask(5) = 0xf8000000. * u32_masklen Inverse operation to u32_mkmask, -1 if not a bitmask. */ u32 u32_mkmask(uint n); int u32_masklen(u32 x); u32 u32_log2(u32 v); static inline u32 u32_hash(u32 v) { return v * 2902958171u; } static inline u8 u32_popcount(u32 v) { return __builtin_popcount(v); } #endif bird-1.6.3/lib/sha1.h0000644000103200001440000000372313027054563013212 0ustar feelausers/* * BIRD Library -- SHA-1 Hash Function (FIPS 180-1, RFC 3174) * * (c) 2015 CZ.NIC z.s.p.o. * * Based on the code from libucw-6.4 * (c) 2008--2009 Martin Mares * * Based on the code from libgcrypt-1.2.3, which is * (c) 1998, 2001, 2002, 2003 Free Software Foundation, Inc. * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_SHA1_H_ #define _BIRD_SHA1_H_ #include "nest/bird.h" #define SHA1_SIZE 20 /* Size of the SHA1 hash in its binary representation */ #define SHA1_HEX_SIZE 41 /* Buffer length for a string containing SHA1 in hexadecimal format. */ #define SHA1_BLOCK_SIZE 64 /* SHA1 splits input to blocks of this size. */ /* * Internal SHA1 state. * You should use it just as an opaque handle only. */ struct hash_context; struct sha1_context { u32 h0, h1, h2, h3, h4; byte buf[SHA1_BLOCK_SIZE]; uint nblocks; uint count; }; void sha1_init(struct hash_context *ctx); /* Initialize new algorithm run in the @ctx context. **/ /* * Push another @len bytes of data pointed to by @buf onto the SHA1 hash * currently in @ctx. You can call this any times you want on the same hash (and * you do not need to reinitialize it by @sha1_init()). It has the same effect * as concatenating all the data together and passing them at once. */ void sha1_update(struct hash_context *ctx, const byte *buf, uint len); /* * No more @sha1_update() calls will be done. This terminates the hash and * returns a pointer to it. * * Note that the pointer points into data in the @ctx context. If it ceases to * exist, the pointer becomes invalid. */ byte *sha1_final(struct hash_context *ctx); /* * A convenience one-shot function for SHA1 hash. It is equivalent to this * snippet of code: * * sha1_context ctx; * sha1_init(&ctx); * sha1_update(&ctx, buffer, length); * memcpy(outbuf, sha1_final(&ctx), SHA1_SIZE); */ void sha1_hash_buffer(byte *outbuf, const byte *buffer, uint length); #endif /* _BIRD_SHA1_H_ */ bird-1.6.3/lib/hash.h0000644000103200001440000001314313027054563013276 0ustar feelausers/* * BIRD Library -- Generic Hash Table * * (c) 2013 Ondrej Zajicek * (c) 2013 CZ.NIC z.s.p.o. * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_HASH_H_ #define _BIRD_HASH_H_ #define HASH(type) struct { type **data; uint count, order; } #define HASH_TYPE(v) typeof(** (v).data) #define HASH_SIZE(v) (1U << (v).order) #define HASH_EQ(v,id,k1,k2...) (id##_EQ(k1, k2)) #define HASH_FN(v,id,key...) ((u32) (id##_FN(key)) >> (32 - (v).order)) #define HASH_INIT(v,pool,init_order) \ ({ \ (v).count = 0; \ (v).order = (init_order); \ (v).data = mb_allocz(pool, HASH_SIZE(v) * sizeof(* (v).data)); \ }) #define HASH_FREE(v) \ ({ \ mb_free((v).data); \ (v) = (typeof(v)){ }; \ }) #define HASH_FIND(v,id,key...) \ ({ \ u32 _h = HASH_FN(v, id, key); \ HASH_TYPE(v) *_n = (v).data[_h]; \ while (_n && !HASH_EQ(v, id, id##_KEY(_n), key)) \ _n = id##_NEXT(_n); \ _n; \ }) #define HASH_INSERT(v,id,node) \ ({ \ u32 _h = HASH_FN(v, id, id##_KEY((node))); \ HASH_TYPE(v) **_nn = (v).data + _h; \ id##_NEXT(node) = *_nn; \ *_nn = node; \ (v).count++; \ }) #define HASH_DO_REMOVE(v,id,_nn) \ ({ \ *_nn = id##_NEXT((*_nn)); \ (v).count--; \ }) #define HASH_DELETE(v,id,key...) \ ({ \ u32 _h = HASH_FN(v, id, key); \ HASH_TYPE(v) *_n, **_nn = (v).data + _h; \ \ while ((*_nn) && !HASH_EQ(v, id, id##_KEY((*_nn)), key)) \ _nn = &(id##_NEXT((*_nn))); \ \ if (_n = *_nn) \ HASH_DO_REMOVE(v,id,_nn); \ _n; \ }) #define HASH_REMOVE(v,id,node) \ ({ \ u32 _h = HASH_FN(v, id, id##_KEY((node))); \ HASH_TYPE(v) *_n, **_nn = (v).data + _h; \ \ while ((*_nn) && (*_nn != (node))) \ _nn = &(id##_NEXT((*_nn))); \ \ if (_n = *_nn) \ HASH_DO_REMOVE(v,id,_nn); \ _n; \ }) #define HASH_REHASH(v,id,pool,step) \ ({ \ HASH_TYPE(v) *_n, *_n2, **_od; \ uint _i, _os; \ \ _os = HASH_SIZE(v); \ _od = (v).data; \ (v).count = 0; \ (v).order += (step); \ (v).data = mb_allocz(pool, HASH_SIZE(v) * sizeof(* (v).data)); \ \ for (_i = 0; _i < _os; _i++) \ for (_n = _od[_i]; _n && (_n2 = id##_NEXT(_n), 1); _n = _n2) \ HASH_INSERT(v, id, _n); \ \ mb_free(_od); \ }) #define REHASH_LO_MARK(a,b,c,d,e,f) a #define REHASH_HI_MARK(a,b,c,d,e,f) b #define REHASH_LO_STEP(a,b,c,d,e,f) c #define REHASH_HI_STEP(a,b,c,d,e,f) d #define REHASH_LO_BOUND(a,b,c,d,e,f) e #define REHASH_HI_BOUND(a,b,c,d,e,f) f #define HASH_DEFINE_REHASH_FN(id,type) \ static void id##_REHASH(void *v, pool *p, int step) \ { HASH_REHASH(* (HASH(type) *) v, id, p, step); } #define HASH_MAY_STEP_UP(v,id,pool) HASH_MAY_STEP_UP_(v,pool, id##_REHASH, id##_PARAMS) #define HASH_MAY_STEP_DOWN(v,id,pool) HASH_MAY_STEP_DOWN_(v,pool, id##_REHASH, id##_PARAMS) #define HASH_MAY_RESIZE_DOWN(v,id,pool) HASH_MAY_RESIZE_DOWN_(v,pool, id##_REHASH, id##_PARAMS) #define HASH_MAY_STEP_UP_(v,pool,rehash_fn,args) \ ({ \ if (((v).count > (HASH_SIZE(v) REHASH_HI_MARK(args))) && \ ((v).order < (REHASH_HI_BOUND(args)))) \ rehash_fn(&(v), pool, REHASH_HI_STEP(args)); \ }) #define HASH_MAY_STEP_DOWN_(v,pool,rehash_fn,args) \ ({ \ if (((v).count < (HASH_SIZE(v) REHASH_LO_MARK(args))) && \ ((v).order > (REHASH_LO_BOUND(args)))) \ rehash_fn(&(v), pool, -(REHASH_LO_STEP(args))); \ }) #define HASH_MAY_RESIZE_DOWN_(v,pool,rehash_fn,args) \ ({ \ uint _o = (v).order; \ while (((v).count < ((1U << _o) REHASH_LO_MARK(args))) && \ (_o > (REHASH_LO_BOUND(args)))) \ _o -= (REHASH_LO_STEP(args)); \ if (_o < (v).order) \ rehash_fn(&(v), pool, _o - (v).order); \ }) #define HASH_INSERT2(v,id,pool,node) \ ({ \ HASH_INSERT(v, id, node); \ HASH_MAY_STEP_UP(v, id, pool); \ }) #define HASH_DELETE2(v,id,pool,key...) \ ({ \ HASH_TYPE(v) *_n = HASH_DELETE(v, id, key); \ if (_n) HASH_MAY_STEP_DOWN(v, id, pool); \ _n; \ }) #define HASH_REMOVE2(v,id,pool,node) \ ({ \ HASH_TYPE(v) *_n = HASH_REMOVE(v, id, node); \ if (_n) HASH_MAY_STEP_DOWN(v, id, pool); \ _n; \ }) #define HASH_WALK(v,next,n) \ do { \ HASH_TYPE(v) *n; \ uint _i; \ uint _s = HASH_SIZE(v); \ for (_i = 0; _i < _s; _i++) \ for (n = (v).data[_i]; n; n = n->next) #define HASH_WALK_END } while (0) #define HASH_WALK_DELSAFE(v,next,n) \ do { \ HASH_TYPE(v) *n, *_next; \ uint _i; \ uint _s = HASH_SIZE(v); \ for (_i = 0; _i < _s; _i++) \ for (n = (v).data[_i]; n && (_next = n->next, 1); n = _next) #define HASH_WALK_DELSAFE_END } while (0) #define HASH_WALK_FILTER(v,next,n,nn) \ do { \ HASH_TYPE(v) *n, **nn; \ uint _i; \ uint _s = HASH_SIZE(v); \ for (_i = 0; _i < _s; _i++) \ for (nn = (v).data + _i; n = *nn; (*nn == n) ? (nn = &n->next) : NULL) #define HASH_WALK_FILTER_END } while (0) #endif bird-1.6.3/lib/buffer.h0000644000103200001440000000224313027054563013623 0ustar feelausers/* * BIRD Library -- Generic Buffer Structure * * (c) 2013 Ondrej Zajicek * (c) 2013 CZ.NIC z.s.p.o. * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_BUFFER_H_ #define _BIRD_BUFFER_H_ #include "lib/resource.h" #include "sysdep/config.h" #define BUFFER(type) struct { type *data; uint used, size; } #define BUFFER_SIZE(v) ((v).size * sizeof(* (v).data)) #define BUFFER_INIT(v,pool,isize) \ ({ \ (v).used = 0; \ (v).size = (isize); \ (v).data = mb_alloc(pool, BUFFER_SIZE(v)); \ }) #define BUFFER_SET(v,nsize) \ ({ \ (v).used = (nsize); \ if ((v).used > (v).size) \ buffer_realloc((void **) &((v).data), &((v).size), (v).used, sizeof(* (v).data)); \ }) #define BUFFER_INC(v,step) \ ({ \ uint _o = (v).used; \ BUFFER_SET(v, (v).used + (step)); \ (v).data + _o; \ }) #define BUFFER_DEC(v,step) ({ (v).used -= (step); }) #define BUFFER_PUSH(v) (*BUFFER_INC(v,1)) #define BUFFER_POP(v) BUFFER_DEC(v,1) #define BUFFER_FLUSH(v) ({ (v).used = 0; }) #endif /* _BIRD_BUFFER_H_ */ bird-1.6.3/lib/alloca.h0000644000103200001440000000043713027054563013610 0ustar feelausers/* * BIRD Library -- Alloca.h * * (c) 2004 Ondrej Filip * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_ALLOCA_H_ #define _BIRD_ALLOCA_H_ #ifdef HAVE_ALLOCA_H #include #else #include #endif #endif bird-1.6.3/lib/resource.c0000644000103200001440000002071013027054563014173 0ustar feelausers/* * BIRD Resource Manager * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include #include #include "nest/bird.h" #include "lib/resource.h" #include "lib/string.h" /** * DOC: Resource pools * * Resource pools (&pool) are just containers holding a list of * other resources. Freeing a pool causes all the listed resources * to be freed as well. Each existing &resource is linked to some pool * except for a root pool which isn't linked anywhere, so all the * resources form a tree structure with internal nodes corresponding * to pools and leaves being the other resources. * * Example: Almost all modules of BIRD have their private pool which * is freed upon shutdown of the module. */ struct pool { resource r; list inside; char *name; }; static void pool_dump(resource *); static void pool_free(resource *); static resource *pool_lookup(resource *, unsigned long); static size_t pool_memsize(resource *P); static struct resclass pool_class = { "Pool", sizeof(pool), pool_free, pool_dump, pool_lookup, pool_memsize }; pool root_pool; static int indent; /** * rp_new - create a resource pool * @p: parent pool * @name: pool name (to be included in debugging dumps) * * rp_new() creates a new resource pool inside the specified * parent pool. */ pool * rp_new(pool *p, char *name) { pool *z = ralloc(p, &pool_class); z->name = name; init_list(&z->inside); return z; } static void pool_free(resource *P) { pool *p = (pool *) P; resource *r, *rr; r = HEAD(p->inside); while (rr = (resource *) r->n.next) { r->class->free(r); xfree(r); r = rr; } } static void pool_dump(resource *P) { pool *p = (pool *) P; resource *r; debug("%s\n", p->name); indent += 3; WALK_LIST(r, p->inside) rdump(r); indent -= 3; } static size_t pool_memsize(resource *P) { pool *p = (pool *) P; resource *r; size_t sum = sizeof(pool) + ALLOC_OVERHEAD; WALK_LIST(r, p->inside) sum += rmemsize(r); return sum; } static resource * pool_lookup(resource *P, unsigned long a) { pool *p = (pool *) P; resource *r, *q; WALK_LIST(r, p->inside) if (r->class->lookup && (q = r->class->lookup(r, a))) return q; return NULL; } /** * rmove - move a resource * @res: resource * @p: pool to move the resource to * * rmove() moves a resource from one pool to another. */ void rmove(void *res, pool *p) { resource *r = res; if (r) { if (r->n.next) rem_node(&r->n); add_tail(&p->inside, &r->n); } } /** * rfree - free a resource * @res: resource * * rfree() frees the given resource and all information associated * with it. In case it's a resource pool, it also frees all the objects * living inside the pool. * * It works by calling a class-specific freeing function. */ void rfree(void *res) { resource *r = res; if (!r) return; if (r->n.next) rem_node(&r->n); r->class->free(r); r->class = NULL; xfree(r); } /** * rdump - dump a resource * @res: resource * * This function prints out all available information about the given * resource to the debugging output. * * It works by calling a class-specific dump function. */ void rdump(void *res) { char x[16]; resource *r = res; bsprintf(x, "%%%ds%%p ", indent); debug(x, "", r); if (r) { debug("%s ", r->class->name); r->class->dump(r); } else debug("NULL\n"); } size_t rmemsize(void *res) { resource *r = res; if (!r) return 0; if (!r->class->memsize) return r->class->size + ALLOC_OVERHEAD; return r->class->memsize(r); } /** * ralloc - create a resource * @p: pool to create the resource in * @c: class of the new resource * * This function is called by the resource classes to create a new * resource of the specified class and link it to the given pool. * Allocated memory is zeroed. Size of the resource structure is taken * from the @size field of the &resclass. */ void * ralloc(pool *p, struct resclass *c) { resource *r = xmalloc(c->size); bzero(r, c->size); r->class = c; if (p) add_tail(&p->inside, &r->n); return r; } /** * rlookup - look up a memory location * @a: memory address * * This function examines all existing resources to see whether * the address @a is inside any resource. It's used for debugging * purposes only. * * It works by calling a class-specific lookup function for each * resource. */ void rlookup(unsigned long a) { resource *r; debug("Looking up %08lx\n", a); if (r = pool_lookup(&root_pool.r, a)) rdump(r); else debug("Not found.\n"); } /** * resource_init - initialize the resource manager * * This function is called during BIRD startup. It initializes * all data structures of the resource manager and creates the * root pool. */ void resource_init(void) { root_pool.r.class = &pool_class; root_pool.name = "Root"; init_list(&root_pool.inside); } /** * DOC: Memory blocks * * Memory blocks are pieces of contiguous allocated memory. * They are a bit non-standard since they are represented not by a pointer * to &resource, but by a void pointer to the start of data of the * memory block. All memory block functions know how to locate the header * given the data pointer. * * Example: All "unique" data structures such as hash tables are allocated * as memory blocks. */ struct mblock { resource r; unsigned size; uintptr_t data_align[0]; byte data[0]; }; static void mbl_free(resource *r UNUSED) { } static void mbl_debug(resource *r) { struct mblock *m = (struct mblock *) r; debug("(size=%d)\n", m->size); } static resource * mbl_lookup(resource *r, unsigned long a) { struct mblock *m = (struct mblock *) r; if ((unsigned long) m->data <= a && (unsigned long) m->data + m->size > a) return r; return NULL; } static size_t mbl_memsize(resource *r) { struct mblock *m = (struct mblock *) r; return ALLOC_OVERHEAD + sizeof(struct mblock) + m->size; } static struct resclass mb_class = { "Memory", 0, mbl_free, mbl_debug, mbl_lookup, mbl_memsize }; /** * mb_alloc - allocate a memory block * @p: pool * @size: size of the block * * mb_alloc() allocates memory of a given size and creates * a memory block resource representing this memory chunk * in the pool @p. * * Please note that mb_alloc() returns a pointer to the memory * chunk, not to the resource, hence you have to free it using * mb_free(), not rfree(). */ void * mb_alloc(pool *p, unsigned size) { struct mblock *b = xmalloc(sizeof(struct mblock) + size); b->r.class = &mb_class; add_tail(&p->inside, &b->r.n); b->size = size; return b->data; } /** * mb_allocz - allocate and clear a memory block * @p: pool * @size: size of the block * * mb_allocz() allocates memory of a given size, initializes it to * zeroes and creates a memory block resource representing this memory * chunk in the pool @p. * * Please note that mb_allocz() returns a pointer to the memory * chunk, not to the resource, hence you have to free it using * mb_free(), not rfree(). */ void * mb_allocz(pool *p, unsigned size) { void *x = mb_alloc(p, size); bzero(x, size); return x; } /** * mb_realloc - reallocate a memory block * @m: memory block * @size: new size of the block * * mb_realloc() changes the size of the memory block @m to a given size. * The contents will be unchanged to the minimum of the old and new sizes; * newly allocated memory will be uninitialized. Contrary to realloc() * behavior, @m must be non-NULL, because the resource pool is inherited * from it. * * Like mb_alloc(), mb_realloc() also returns a pointer to the memory * chunk, not to the resource, hence you have to free it using * mb_free(), not rfree(). */ void * mb_realloc(void *m, unsigned size) { struct mblock *b = SKIP_BACK(struct mblock, data, m); b = xrealloc(b, sizeof(struct mblock) + size); replace_node(&b->r.n, &b->r.n); b->size = size; return b->data; } /** * mb_free - free a memory block * @m: memory block * * mb_free() frees all memory associated with the block @m. */ void mb_free(void *m) { if (!m) return; struct mblock *b = SKIP_BACK(struct mblock, data, m); rfree(b); } #define STEP_UP(x) ((x) + (x)/2 + 4) void buffer_realloc(void **buf, unsigned *size, unsigned need, unsigned item_size) { unsigned nsize = MIN(*size, need); while (nsize < need) nsize = STEP_UP(nsize); *buf = mb_realloc(*buf, nsize * item_size); *size = nsize; } bird-1.6.3/lib/Modules0000644000103200001440000000045213027054563013534 0ustar feelauserssha256.c sha256.h sha512.c sha512.h sha1.c sha1.h birdlib.h bitops.c bitops.h ip.h ip.c lists.c lists.h mac.c mac.h md5.c md5.h mempool.c resource.c resource.h slab.c socket.h tbf.c unaligned.h xmalloc.c printf.c string.h patmatch.c slists.c slists.h event.c event.h checksum.c checksum.h alloca.h bird-1.6.3/lib/md5.c0000644000103200001440000001637313027054563013043 0ustar feelausers/* * BIRD Library -- MD5 Hash Function and HMAC-MD5 Function * * (c) 2015 CZ.NIC z.s.p.o. * * The code was written by Colin Plumb in 1993, no copyright is claimed. * * Adapted for BIRD by Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "lib/md5.h" #ifdef CPU_LITTLE_ENDIAN #define byteReverse(buf, len) /* Nothing */ #else void byteReverse(byte *buf, uint longs); /* * Note: this code is harmless on little-endian machines. */ void byteReverse(byte *buf, uint longs) { u32 t; do { t = (u32) ((uint) buf[3] << 8 | buf[2]) << 16 | ((uint) buf[1] << 8 | buf[0]); *(u32 *) buf = t; buf += 4; } while (--longs); } #endif static void md5_transform(u32 buf[4], u32 const in[16]); /* * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious * initialization constants. */ void md5_init(struct hash_context *CTX) { struct md5_context *ctx = (void *) CTX; ctx->buf[0] = 0x67452301; ctx->buf[1] = 0xefcdab89; ctx->buf[2] = 0x98badcfe; ctx->buf[3] = 0x10325476; ctx->bits[0] = 0; ctx->bits[1] = 0; } /* * Update context to reflect the concatenation of another buffer full * of bytes. */ void md5_update(struct hash_context *CTX, const byte *buf, uint len) { struct md5_context *ctx = (void *) CTX; u32 t; /* Update bitcount */ t = ctx->bits[0]; if ((ctx->bits[0] = t + ((u32) len << 3)) < t) ctx->bits[1]++; /* Carry from low to high */ ctx->bits[1] += len >> 29; t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */ /* Handle any leading odd-sized chunks */ if (t) { byte *p = (byte *) ctx->in + t; t = 64 - t; if (len < t) { memcpy(p, buf, len); return; } memcpy(p, buf, t); byteReverse(ctx->in, 16); md5_transform(ctx->buf, (u32 *) ctx->in); buf += t; len -= t; } /* Process data in 64-byte chunks */ while (len >= 64) { memcpy(ctx->in, buf, 64); byteReverse(ctx->in, 16); md5_transform(ctx->buf, (u32 *) ctx->in); buf += 64; len -= 64; } /* Handle any remaining bytes of data. */ memcpy(ctx->in, buf, len); } /* * Final wrapup - pad to 64-byte boundary with the bit pattern * 1 0* (64-bit count of bits processed, MSB-first) */ byte * md5_final(struct hash_context *CTX) { struct md5_context *ctx = (void *) CTX; uint count; byte *p; /* Compute number of bytes mod 64 */ count = (ctx->bits[0] >> 3) & 0x3F; /* Set the first char of padding to 0x80. This is safe since there is always at least one byte free */ p = ctx->in + count; *p++ = 0x80; /* Bytes of padding needed to make 64 bytes */ count = 64 - 1 - count; /* Pad out to 56 mod 64 */ if (count < 8) { /* Two lots of padding: Pad the first block to 64 bytes */ memset(p, 0, count); byteReverse(ctx->in, 16); md5_transform(ctx->buf, (u32 *) ctx->in); /* Now fill the next block with 56 bytes */ memset(ctx->in, 0, 56); } else { /* Pad block to 56 bytes */ memset(p, 0, count - 8); } byteReverse(ctx->in, 14); /* Append length in bits and transform */ ((u32 *) ctx->in)[14] = ctx->bits[0]; ((u32 *) ctx->in)[15] = ctx->bits[1]; md5_transform(ctx->buf, (u32 *) ctx->in); byteReverse((byte *) ctx->buf, 4); return (byte*) ctx->buf; } /* The four core functions - F1 is optimized somewhat */ /* #define F1(x, y, z) (x & y | ~x & z) */ #define F1(x, y, z) (z ^ (x & (y ^ z))) #define F2(x, y, z) F1(z, x, y) #define F3(x, y, z) (x ^ y ^ z) #define F4(x, y, z) (y ^ (x | ~z)) /* This is the central step in the MD5 algorithm. */ #define MD5STEP(f, w, x, y, z, data, s) \ ( w += f(x, y, z) + data, w = w<>(32-s), w += x ) /* * The core of the MD5 algorithm, this alters an existing MD5 hash to * reflect the addition of 16 longwords of new data. MD5Update blocks * the data and converts bytes into longwords for this routine. */ void md5_transform(u32 buf[4], u32 const in[16]) { register u32 a, b, c, d; a = buf[0]; b = buf[1]; c = buf[2]; d = buf[3]; MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7); MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12); MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17); MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22); MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7); MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12); MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17); MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22); MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5); MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9); MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14); MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5); MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9); MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14); MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5); MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9); MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14); MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20); MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5); MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14); MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4); MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11); MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16); MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23); MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4); MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23); MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4); MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11); MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16); MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23); MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4); MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11); MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23); MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6); MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10); MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15); MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21); MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6); MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15); MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21); MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15); MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21); MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6); MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21); buf[0] += a; buf[1] += b; buf[2] += c; buf[3] += d; } bird-1.6.3/lib/event.h0000644000103200001440000000127613027054563013500 0ustar feelausers/* * BIRD Library -- Event Processing * * (c) 1999 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_EVENT_H_ #define _BIRD_EVENT_H_ #include "lib/resource.h" typedef struct event { resource r; void (*hook)(void *); void *data; node n; /* Internal link */ } event; typedef list event_list; extern event_list global_event_list; event *ev_new(pool *); void ev_run(event *); #define ev_init_list(el) init_list(el) void ev_enqueue(event_list *, event *); void ev_schedule(event *); void ev_postpone(event *); int ev_run_list(event_list *); static inline int ev_active(event *e) { return e->n.next != NULL; } #endif bird-1.6.3/lib/mac.h0000644000103200001440000000653513027054563013122 0ustar feelausers/* * BIRD Library -- Message Authentication Codes * * (c) 2016 Ondrej Zajicek * (c) 2016 CZ.NIC z.s.p.o. * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_MAC_H_ #define _BIRD_MAC_H_ #include "nest/bird.h" #include "lib/sha512.h" #define ALG_UNDEFINED 0 #define ALG_MD5 0x01 #define ALG_SHA1 0x02 #define ALG_SHA224 0x03 #define ALG_SHA256 0x04 #define ALG_SHA384 0x05 #define ALG_SHA512 0x06 #define ALG_HMAC 0x10 #define ALG_HMAC_MD5 0x11 #define ALG_HMAC_SHA1 0x12 #define ALG_HMAC_SHA224 0x13 #define ALG_HMAC_SHA256 0x14 #define ALG_HMAC_SHA384 0x15 #define ALG_HMAC_SHA512 0x16 #define ALG_MAX 0x17 /* These are maximums for HASH/MAC lengths and required context space */ #define MAX_HASH_SIZE SHA512_SIZE #define HASH_STORAGE sizeof(struct sha512_context) #define MAC_STORAGE sizeof(struct hmac_context) /* This value is used by several IETF protocols for padding */ #define HMAC_MAGIC htonl(0x878FE1F3) /* Generic context used by hash functions */ struct hash_context { u8 data[HASH_STORAGE]; u64 align[0]; }; /* Context for embedded hash (not-really-MAC hash) */ struct nrmh_context { const struct mac_desc *type; struct hash_context ictx; }; /* Context for hash based HMAC */ struct hmac_context { const struct mac_desc *type; struct hash_context ictx; struct hash_context octx; }; /* Generic context used by MAC functions */ struct mac_context { const struct mac_desc *type; u8 data[MAC_STORAGE - sizeof(void *)]; u64 align[0]; }; /* Union to satisfy C aliasing rules */ union mac_context_union { struct mac_context mac; struct nrmh_context nrmh; struct hmac_context hmac; }; struct mac_desc { const char *name; /* Name of MAC algorithm */ uint mac_length; /* Length of authentication code */ uint ctx_length; /* Length of algorithm context */ void (*init)(struct mac_context *ctx, const byte *key, uint keylen); void (*update)(struct mac_context *ctx, const byte *data, uint datalen); byte *(*final)(struct mac_context *ctx); uint hash_size; /* Hash length, for hash-based MACs */ uint block_size; /* Hash block size, for hash-based MACs */ void (*hash_init)(struct hash_context *ctx); void (*hash_update)(struct hash_context *ctx, const byte *data, uint datalen); byte *(*hash_final)(struct hash_context *ctx); }; extern const struct mac_desc mac_table[ALG_MAX]; static inline const char *mac_type_name(uint id) { return mac_table[id].name; } static inline uint mac_type_length(uint id) { return mac_table[id].mac_length; } static inline const char *mac_get_name(struct mac_context *ctx) { return ctx->type->name; } static inline uint mac_get_length(struct mac_context *ctx) { return ctx->type->mac_length; } void mac_init(struct mac_context *ctx, uint id, const byte *key, uint keylen); static inline void mac_update(struct mac_context *ctx, const byte *data, uint datalen) { ctx->type->update(ctx, data, datalen); } static inline byte *mac_final(struct mac_context *ctx) { return ctx->type->final(ctx); } static inline void mac_cleanup(struct mac_context *ctx) { memset(ctx, 0, ctx->type->ctx_length); } void mac_fill(uint id, const byte *key, uint keylen, const byte *data, uint datalen, byte *mac); int mac_verify(uint id, const byte *key, uint keylen, const byte *data, uint datalen, const byte *mac); #endif /* _BIRD_MAC_H_ */ bird-1.6.3/lib/lists.c0000644000103200001440000000677313027054563013517 0ustar feelausers/* * BIRD Library -- Linked Lists * * (c) 1998 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Linked lists * * The BIRD library provides a set of functions for operating on linked * lists. The lists are internally represented as standard doubly linked * lists with synthetic head and tail which makes all the basic operations * run in constant time and contain no extra end-of-list checks. Each list * is described by a &list structure, nodes can have any format as long * as they start with a &node structure. If you want your nodes to belong * to multiple lists at once, you can embed multiple &node structures in them * and use the SKIP_BACK() macro to calculate a pointer to the start of the * structure from a &node pointer, but beware of obscurity. * * There also exist safe linked lists (&slist, &snode and all functions * being prefixed with |s_|) which support asynchronous walking very * similar to that used in the &fib structure. */ #define _BIRD_LISTS_C_ #include "nest/bird.h" #include "lib/lists.h" /** * add_tail - append a node to a list * @l: linked list * @n: list node * * add_tail() takes a node @n and appends it at the end of the list @l. */ LIST_INLINE void add_tail(list *l, node *n) { node *z = l->tail; n->next = &l->tail_node; n->prev = z; z->next = n; l->tail = n; } /** * add_head - prepend a node to a list * @l: linked list * @n: list node * * add_head() takes a node @n and prepends it at the start of the list @l. */ LIST_INLINE void add_head(list *l, node *n) { node *z = l->head; n->next = z; n->prev = &l->head_node; z->prev = n; l->head = n; } /** * insert_node - insert a node to a list * @n: a new list node * @after: a node of a list * * Inserts a node @n to a linked list after an already inserted * node @after. */ LIST_INLINE void insert_node(node *n, node *after) { node *z = after->next; n->next = z; n->prev = after; after->next = n; z->prev = n; } /** * rem_node - remove a node from a list * @n: node to be removed * * Removes a node @n from the list it's linked in. Afterwards, node @n is cleared. */ LIST_INLINE void rem_node(node *n) { node *z = n->prev; node *x = n->next; z->next = x; x->prev = z; n->next = NULL; n->prev = NULL; } /** * replace_node - replace a node in a list with another one * @old: node to be removed * @new: node to be inserted * * Replaces node @old in the list it's linked in with node @new. Node * @old may be a copy of the original node, which is not accessed * through the list. The function could be called with @old == @new, * which just fixes neighbors' pointers in the case that the node * was reallocated. */ LIST_INLINE void replace_node(node *old, node *new) { old->next->prev = new; old->prev->next = new; new->prev = old->prev; new->next = old->next; } /** * init_list - create an empty list * @l: list * * init_list() takes a &list structure and initializes its * fields, so that it represents an empty list. */ LIST_INLINE void init_list(list *l) { l->head = &l->tail_node; l->null = NULL; l->tail = &l->head_node; } /** * add_tail_list - concatenate two lists * @to: destination list * @l: source list * * This function appends all elements of the list @l to * the list @to in constant time. */ LIST_INLINE void add_tail_list(list *to, list *l) { node *p = to->tail; node *q = l->head; p->next = q; q->prev = p; q = l->tail; q->next = &to->tail_node; to->tail = q; } bird-1.6.3/lib/md5.h0000644000103200001440000000117713027054563013044 0ustar feelausers/* * BIRD Library -- MD5 Hash Function and HMAC-MD5 Function * * (c) 2015 CZ.NIC z.s.p.o. * * Adapted for BIRD by Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_MD5_H_ #define _BIRD_MD5_H_ #include "nest/bird.h" #define MD5_SIZE 16 #define MD5_HEX_SIZE 33 #define MD5_BLOCK_SIZE 64 struct hash_context; struct md5_context { u32 buf[4]; u32 bits[2]; byte in[64]; }; void md5_init(struct hash_context *ctx); void md5_update(struct hash_context *ctx, const byte *buf, uint len); byte *md5_final(struct hash_context *ctx); #endif /* _BIRD_MD5_H_ */ bird-1.6.3/lib/patmatch.c0000644000103200001440000000270213027054563014146 0ustar feelausers/* * BIRD Library -- Generic Shell-Like Pattern Matching (currently only '?' and '*') * * (c) 1998--2000 Martin Mares */ #include "nest/bird.h" #include "lib/string.h" #ifndef MATCH_FUNC_NAME #define MATCH_FUNC_NAME patmatch #endif #ifndef Convert #define Convert(x) x #endif int MATCH_FUNC_NAME(const byte *p, const byte *s) { while (*p) { if (*p == '?' && *s) p++, s++; else if (*p == '*') { int z = p[1]; if (!z) return 1; if (z == '\\' && p[2]) z = p[2]; z = Convert(z); for(;;) { while (*s && Convert(*s) != z) s++; if (!*s) return 0; if (MATCH_FUNC_NAME(p+1, s)) return 1; s++; } } else { if (*p == '\\' && p[1]) p++; if (Convert(*p++) != Convert(*s++)) return 0; } } return !*s; } #if 0 /** * patmatch - match shell-like patterns * @p: pattern * @s: string * * patmatch() returns whether given string @s matches the given shell-like * pattern @p. The patterns consist of characters (which are matched literally), * question marks which match any single character, asterisks which match any * (possibly empty) string of characters and backslashes which are used to * escape any special characters and force them to be treated literally. * * The matching process is not optimized with respect to time, so please * avoid using this function for complex patterns. */ int patmatch(byte *p, byte *s) { DUMMY; } #endif bird-1.6.3/lib/string.h0000644000103200001440000000215213027054563013657 0ustar feelausers/* * BIRD Library -- String Functions * * (c) 1998 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_STRING_H_ #define _BIRD_STRING_H_ #include #include #include int bsprintf(char *str, const char *fmt, ...); int bvsprintf(char *str, const char *fmt, va_list args); int bsnprintf(char *str, int size, const char *fmt, ...); int bvsnprintf(char *str, int size, const char *fmt, va_list args); int buffer_vprint(buffer *buf, const char *fmt, va_list args); int buffer_print(buffer *buf, const char *fmt, ...); void buffer_puts(buffer *buf, const char *str); int patmatch(const byte *pat, const byte *str); static inline char *xbasename(const char *str) { char *s = strrchr(str, '/'); return s ? s+1 : (char *) str; } static inline char * xstrdup(const char *c) { size_t l = strlen(c) + 1; char *z = xmalloc(l); memcpy(z, c, l); return z; } static inline void memset32(void *D, u32 val, uint n) { u32 *dst = D; uint i; for (i = 0; i < n; i++) dst[i] = val; } #define ROUTER_ID_64_LENGTH 23 #endif bird-1.6.3/lib/slists.h0000644000103200001440000000526313027054563013700 0ustar feelausers/* * BIRD Library -- Safe Linked Lists * * (c) 1998 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_SLISTS_H_ #define _BIRD_SLISTS_H_ /* * These linked lists work in a way similar to standard lists defined * in lib/lists.h, but in addition to all usual list functions they * provide fast deletion/insertion/everything-safe asynchronous * walking. * * Example: * slist l; * siterator i; * snode *n; * * s_init(&i, &l); // Initialize iteration * ... * n = s_get(&i); // Some time later, fetch present * // value of the iterator and unlink it * // from the list. * while (n->next) { * ... * if (decided_to_stop) { * s_put(&i, n); // Store current position (maybe even * // that we stay at list end) * return; // and return * } * ... * } * // After finishing, don't link the iterator back */ typedef struct snode { struct snode *next, *prev; struct siterator *readers; } snode; typedef struct slist { /* In fact two overlayed snodes */ struct snode *head, *null, *tail; struct siterator *tail_readers; } slist; typedef struct siterator { /* * Caution: Layout of this structure depends hard on layout of the * snode. Our `next' must be at position of snode `readers' * field, our `null' must be at position of `prev' and it must * contain NULL in order to distinguish between siterator * and snode (snodes with NULL `prev' field never carry * iterators). You are not expected to understand this. */ struct siterator *prev, *null, *next; /* * For recently merged nodes this can be NULL, but then it's NULL * for all successors as well. This is done to speed up iterator * merging when there are lots of deletions. */ snode *node; } siterator; #define SNODE (snode *) #define SHEAD(list) ((void *)((list).head)) #define STAIL(list) ((void *)((list).tail)) #define SNODE_NEXT(n) ((void *)((SNODE (n))->next)) #define SNODE_VALID(n) ((SNODE (n))->next) #define WALK_SLIST(n,list) for(n=SHEAD(list); SNODE_VALID(n); n=SNODE_NEXT(n)) #define WALK_SLIST_DELSAFE(n,nxt,list) \ for(n=SHEAD(list); nxt=SNODE_NEXT(n); n=(void *) nxt) #define EMPTY_SLIST(list) (!(list).head->next) void s_add_tail(slist *, snode *); void s_add_head(slist *, snode *); void s_rem_node(snode *); void s_add_tail_list(slist *, slist *); void s_init_list(slist *); void s_insert_node(snode *, snode *); snode *s_get(siterator *); void s_put(siterator *, snode *n); static inline void s_init(siterator *i, slist *l) { s_put(i, SHEAD(*l)); } static inline int s_is_used(siterator *i) { return (i->prev != NULL); } #endif bird-1.6.3/lib/birdlib.h0000644000103200001440000000734113027054563013765 0ustar feelausers/* * BIRD Library * * (c) 1998--2004 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_BIRDLIB_H_ #define _BIRD_BIRDLIB_H_ #include "timer.h" #include "alloca.h" /* Ugly structure offset handling macros */ #define OFFSETOF(s, i) ((size_t) &((s *)0)->i) #define SKIP_BACK(s, i, p) ((s *)((char *)p - OFFSETOF(s, i))) #define BIRD_ALIGN(s, a) (((s)+a-1)&~(a-1)) /* Utility macros */ #define MIN_(a,b) (((a)<(b))?(a):(b)) #define MAX_(a,b) (((a)>(b))?(a):(b)) #ifndef PARSER #undef MIN #undef MAX #define MIN(a,b) MIN_(a,b) #define MAX(a,b) MAX_(a,b) #endif #define U64(c) UINT64_C(c) #define ABS(a) ((a)>=0 ? (a) : -(a)) #define DELTA(a,b) (((a)>=(b))?(a)-(b):(b)-(a)) #define ARRAY_SIZE(a) (sizeof(a)/sizeof(*(a))) /* Bitfield macros */ /* b is u32 array (or ptr), l is size of it in bits (multiple of 32), p is 0..(l-1) */ #define BIT32_VAL(p) (((u32) 1) << ((p) % 32)) #define BIT32_TEST(b,p) ((b)[(p)/32] & BIT32_VAL(p)) #define BIT32_SET(b,p) ((b)[(p)/32] |= BIT32_VAL(p)) #define BIT32_CLR(b,p) ((b)[(p)/32] &= ~BIT32_VAL(p)) #define BIT32_ZERO(b,l) memset((b), 0, (l)/8) #ifndef NULL #define NULL ((void *) 0) #endif #ifndef IPV6 #define IP_VERSION 4 #else #define IP_VERSION 6 #endif /* Macros for gcc attributes */ #define NORET __attribute__((noreturn)) #define UNUSED __attribute__((unused)) #define PACKED __attribute__((packed)) #ifdef IPV6 #define UNUSED4 #define UNUSED6 UNUSED #else #define UNUSED4 UNUSED #define UNUSED6 #endif /* Microsecond time */ typedef s64 btime; #define S_ *1000000 #define MS_ *1000 #define US_ *1 #define TO_S /1000000 #define TO_MS /1000 #define TO_US /1 #ifndef PARSER #define S S_ #define MS MS_ #define US US_ #endif /* Rate limiting */ struct tbf { bird_clock_t timestamp; /* Last update */ u16 count; /* Available tokens */ u16 burst; /* Max number of tokens */ u16 rate; /* Rate of replenishment */ u16 mark; /* Whether last op was limited */ }; /* Default TBF values for rate limiting log messages */ #define TBF_DEFAULT_LOG_LIMITS { .rate = 1, .burst = 5 } void tbf_update(struct tbf *f); static inline int tbf_limit(struct tbf *f) { tbf_update(f); if (!f->count) { f->mark = 1; return 1; } f->count--; f->mark = 0; return 0; } /* Logging and dying */ typedef struct buffer { byte *start; byte *pos; byte *end; } buffer; #define STACK_BUFFER_INIT(buf,size) \ do { \ buf.start = alloca(size); \ buf.pos = buf.start; \ buf.end = buf.start + size; \ } while(0) #define LOG_BUFFER_INIT(buf) \ STACK_BUFFER_INIT(buf, LOG_BUFFER_SIZE) #define LOG_BUFFER_SIZE 1024 #define log log_msg void log_commit(int class, buffer *buf); void log_msg(const char *msg, ...); void log_rl(struct tbf *rl, const char *msg, ...); void die(const char *msg, ...) NORET; void bug(const char *msg, ...) NORET; #define L_DEBUG "\001" /* Debugging messages */ #define L_TRACE "\002" /* Protocol tracing */ #define L_INFO "\003" /* Informational messages */ #define L_REMOTE "\004" /* Remote protocol errors */ #define L_WARN "\005" /* Local warnings */ #define L_ERR "\006" /* Local errors */ #define L_AUTH "\007" /* Authorization failed etc. */ #define L_FATAL "\010" /* Fatal errors */ #define L_BUG "\011" /* BIRD bugs */ void debug(const char *msg, ...); /* Printf to debug output */ /* Debugging */ #if defined(LOCAL_DEBUG) || defined(GLOBAL_DEBUG) #define DBG(x, y...) debug(x, ##y) #else #define DBG(x, y...) do { } while(0) #endif #ifdef DEBUGGING #define ASSERT(x) do { if (!(x)) bug("Assertion `%s' failed at %s:%d", #x, __FILE__, __LINE__); } while(0) #else #define ASSERT(x) do { } while(0) #endif /* Pseudorandom numbers */ u32 random_u32(void); #endif bird-1.6.3/lib/sha1.c0000644000103200001440000001603713027054563013207 0ustar feelausers/* * BIRD Library -- SHA-1 Hash Function (FIPS 180-1, RFC 3174) * * (c) 2015 CZ.NIC z.s.p.o. * * Based on the code from libucw-6.4 * (c) 2008--2009 Martin Mares * * Based on the code from libgcrypt-1.2.3, which is * (c) 1998, 2001, 2002, 2003 Free Software Foundation, Inc. * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "lib/sha1.h" #include "lib/unaligned.h" void sha1_init(struct hash_context *CTX) { struct sha1_context *ctx = (void *) CTX; ctx->h0 = 0x67452301; ctx->h1 = 0xefcdab89; ctx->h2 = 0x98badcfe; ctx->h3 = 0x10325476; ctx->h4 = 0xc3d2e1f0; ctx->nblocks = 0; ctx->count = 0; } /* * Transform the message X which consists of 16 32-bit-words */ static void sha1_transform(struct sha1_context *ctx, const byte *data) { u32 a,b,c,d,e,tm; u32 x[16]; /* Get values from the chaining vars. */ a = ctx->h0; b = ctx->h1; c = ctx->h2; d = ctx->h3; e = ctx->h4; #ifdef CPU_BIG_ENDIAN memcpy(x, data, 64); #else int i; for (i = 0; i < 16; i++) x[i] = get_u32(data+4*i); #endif #define K1 0x5A827999L #define K2 0x6ED9EBA1L #define K3 0x8F1BBCDCL #define K4 0xCA62C1D6L #define F1(x,y,z) ( z ^ ( x & ( y ^ z ) ) ) #define F2(x,y,z) ( x ^ y ^ z ) #define F3(x,y,z) ( ( x & y ) | ( z & ( x | y ) ) ) #define F4(x,y,z) ( x ^ y ^ z ) #define M(i) (tm = x[i&0x0f] ^ x[(i-14)&0x0f] ^ x[(i-8)&0x0f] ^ x[(i-3)&0x0f], (x[i&0x0f] = ROL(tm, 1))) /* Bitwise rotation of an unsigned int to the left **/ #define ROL(x, bits) (((x) << (bits)) | ((uint)(x) >> (sizeof(uint)*8 - (bits)))) #define R(a, b, c, d, e, f, k, m) \ do \ { \ e += ROL(a, 5) + f(b, c, d) + k + m; \ b = ROL(b, 30); \ } while(0) R( a, b, c, d, e, F1, K1, x[ 0] ); R( e, a, b, c, d, F1, K1, x[ 1] ); R( d, e, a, b, c, F1, K1, x[ 2] ); R( c, d, e, a, b, F1, K1, x[ 3] ); R( b, c, d, e, a, F1, K1, x[ 4] ); R( a, b, c, d, e, F1, K1, x[ 5] ); R( e, a, b, c, d, F1, K1, x[ 6] ); R( d, e, a, b, c, F1, K1, x[ 7] ); R( c, d, e, a, b, F1, K1, x[ 8] ); R( b, c, d, e, a, F1, K1, x[ 9] ); R( a, b, c, d, e, F1, K1, x[10] ); R( e, a, b, c, d, F1, K1, x[11] ); R( d, e, a, b, c, F1, K1, x[12] ); R( c, d, e, a, b, F1, K1, x[13] ); R( b, c, d, e, a, F1, K1, x[14] ); R( a, b, c, d, e, F1, K1, x[15] ); R( e, a, b, c, d, F1, K1, M(16) ); R( d, e, a, b, c, F1, K1, M(17) ); R( c, d, e, a, b, F1, K1, M(18) ); R( b, c, d, e, a, F1, K1, M(19) ); R( a, b, c, d, e, F2, K2, M(20) ); R( e, a, b, c, d, F2, K2, M(21) ); R( d, e, a, b, c, F2, K2, M(22) ); R( c, d, e, a, b, F2, K2, M(23) ); R( b, c, d, e, a, F2, K2, M(24) ); R( a, b, c, d, e, F2, K2, M(25) ); R( e, a, b, c, d, F2, K2, M(26) ); R( d, e, a, b, c, F2, K2, M(27) ); R( c, d, e, a, b, F2, K2, M(28) ); R( b, c, d, e, a, F2, K2, M(29) ); R( a, b, c, d, e, F2, K2, M(30) ); R( e, a, b, c, d, F2, K2, M(31) ); R( d, e, a, b, c, F2, K2, M(32) ); R( c, d, e, a, b, F2, K2, M(33) ); R( b, c, d, e, a, F2, K2, M(34) ); R( a, b, c, d, e, F2, K2, M(35) ); R( e, a, b, c, d, F2, K2, M(36) ); R( d, e, a, b, c, F2, K2, M(37) ); R( c, d, e, a, b, F2, K2, M(38) ); R( b, c, d, e, a, F2, K2, M(39) ); R( a, b, c, d, e, F3, K3, M(40) ); R( e, a, b, c, d, F3, K3, M(41) ); R( d, e, a, b, c, F3, K3, M(42) ); R( c, d, e, a, b, F3, K3, M(43) ); R( b, c, d, e, a, F3, K3, M(44) ); R( a, b, c, d, e, F3, K3, M(45) ); R( e, a, b, c, d, F3, K3, M(46) ); R( d, e, a, b, c, F3, K3, M(47) ); R( c, d, e, a, b, F3, K3, M(48) ); R( b, c, d, e, a, F3, K3, M(49) ); R( a, b, c, d, e, F3, K3, M(50) ); R( e, a, b, c, d, F3, K3, M(51) ); R( d, e, a, b, c, F3, K3, M(52) ); R( c, d, e, a, b, F3, K3, M(53) ); R( b, c, d, e, a, F3, K3, M(54) ); R( a, b, c, d, e, F3, K3, M(55) ); R( e, a, b, c, d, F3, K3, M(56) ); R( d, e, a, b, c, F3, K3, M(57) ); R( c, d, e, a, b, F3, K3, M(58) ); R( b, c, d, e, a, F3, K3, M(59) ); R( a, b, c, d, e, F4, K4, M(60) ); R( e, a, b, c, d, F4, K4, M(61) ); R( d, e, a, b, c, F4, K4, M(62) ); R( c, d, e, a, b, F4, K4, M(63) ); R( b, c, d, e, a, F4, K4, M(64) ); R( a, b, c, d, e, F4, K4, M(65) ); R( e, a, b, c, d, F4, K4, M(66) ); R( d, e, a, b, c, F4, K4, M(67) ); R( c, d, e, a, b, F4, K4, M(68) ); R( b, c, d, e, a, F4, K4, M(69) ); R( a, b, c, d, e, F4, K4, M(70) ); R( e, a, b, c, d, F4, K4, M(71) ); R( d, e, a, b, c, F4, K4, M(72) ); R( c, d, e, a, b, F4, K4, M(73) ); R( b, c, d, e, a, F4, K4, M(74) ); R( a, b, c, d, e, F4, K4, M(75) ); R( e, a, b, c, d, F4, K4, M(76) ); R( d, e, a, b, c, F4, K4, M(77) ); R( c, d, e, a, b, F4, K4, M(78) ); R( b, c, d, e, a, F4, K4, M(79) ); /* Update chaining vars. */ ctx->h0 += a; ctx->h1 += b; ctx->h2 += c; ctx->h3 += d; ctx->h4 += e; } /* * Update the message digest with the contents of BUF with length LEN. */ void sha1_update(struct hash_context *CTX, const byte *buf, uint len) { struct sha1_context *ctx = (void *) CTX; if (ctx->count) { /* Fill rest of internal buffer */ for (; len && ctx->count < SHA1_BLOCK_SIZE; len--) ctx->buf[ctx->count++] = *buf++; if (ctx->count < SHA1_BLOCK_SIZE) return; /* Process data from internal buffer */ sha1_transform(ctx, ctx->buf); ctx->nblocks++; ctx->count = 0; } if (!len) return; /* Process data from input buffer */ while (len >= SHA1_BLOCK_SIZE) { sha1_transform(ctx, buf); ctx->nblocks++; buf += SHA1_BLOCK_SIZE; len -= SHA1_BLOCK_SIZE; } /* Copy remaining data to internal buffer */ memcpy(ctx->buf, buf, len); ctx->count = len; } /* * The routine final terminates the computation and returns the digest. The * handle is prepared for a new cycle, but adding bytes to the handle will the * destroy the returned buffer. * * Returns: 20 bytes representing the digest. */ byte * sha1_final(struct hash_context *CTX) { struct sha1_context *ctx = (void *) CTX; u32 t, msb, lsb; sha1_update(CTX, NULL, 0); /* flush */ t = ctx->nblocks; /* multiply by 64 to make a byte count */ lsb = t << 6; msb = t >> 26; /* add the count */ t = lsb; if ((lsb += ctx->count) < t) msb++; /* multiply by 8 to make a bit count */ t = lsb; lsb <<= 3; msb <<= 3; msb |= t >> 29; if (ctx->count < 56) { /* enough room */ ctx->buf[ctx->count++] = 0x80; /* pad */ while (ctx->count < 56) ctx->buf[ctx->count++] = 0; /* pad */ } else { /* need one extra block */ ctx->buf[ctx->count++] = 0x80; /* pad character */ while (ctx->count < 64) ctx->buf[ctx->count++] = 0; sha1_update(CTX, NULL, 0); /* flush */ memset(ctx->buf, 0, 56); /* fill next block with zeroes */ } /* append the 64 bit count */ ctx->buf[56] = msb >> 24; ctx->buf[57] = msb >> 16; ctx->buf[58] = msb >> 8; ctx->buf[59] = msb; ctx->buf[60] = lsb >> 24; ctx->buf[61] = lsb >> 16; ctx->buf[62] = lsb >> 8; ctx->buf[63] = lsb; sha1_transform(ctx, ctx->buf); byte *p = ctx->buf; #define X(a) do { put_u32(p, ctx->h##a); p += 4; } while(0) X(0); X(1); X(2); X(3); X(4); #undef X return ctx->buf; } bird-1.6.3/lib/sha512.c0000644000103200001440000003010713027054563013350 0ustar feelausers/* * BIRD Library -- SHA-512 and SHA-384 Hash Functions * * (c) 2015 CZ.NIC z.s.p.o. * * Based on the code from libgcrypt-1.6.0, which is * (c) 2003, 2006, 2008, 2009 Free Software Foundation, Inc. * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "lib/sha512.h" #include "lib/unaligned.h" // #define SHA512_UNROLLED void sha512_init(struct hash_context *CTX) { struct sha512_context *ctx = (void *) CTX; ctx->h0 = U64(0x6a09e667f3bcc908); ctx->h1 = U64(0xbb67ae8584caa73b); ctx->h2 = U64(0x3c6ef372fe94f82b); ctx->h3 = U64(0xa54ff53a5f1d36f1); ctx->h4 = U64(0x510e527fade682d1); ctx->h5 = U64(0x9b05688c2b3e6c1f); ctx->h6 = U64(0x1f83d9abfb41bd6b); ctx->h7 = U64(0x5be0cd19137e2179); ctx->nblocks = 0; ctx->count = 0; } void sha384_init(struct hash_context *CTX) { struct sha384_context *ctx = (void *) CTX; ctx->h0 = U64(0xcbbb9d5dc1059ed8); ctx->h1 = U64(0x629a292a367cd507); ctx->h2 = U64(0x9159015a3070dd17); ctx->h3 = U64(0x152fecd8f70e5939); ctx->h4 = U64(0x67332667ffc00b31); ctx->h5 = U64(0x8eb44a8768581511); ctx->h6 = U64(0xdb0c2e0d64f98fa7); ctx->h7 = U64(0x47b5481dbefa4fa4); ctx->nblocks = 0; ctx->count = 0; } static inline u64 ROTR(u64 x, u64 n) { return ((x >> n) | (x << (64 - n))); } static inline u64 Ch(u64 x, u64 y, u64 z) { return ((x & y) ^ ( ~x & z)); } static inline u64 Maj(u64 x, u64 y, u64 z) { return ((x & y) ^ (x & z) ^ (y & z)); } static inline u64 sum0(u64 x) { return (ROTR(x, 28) ^ ROTR(x, 34) ^ ROTR(x, 39)); } static inline u64 sum1(u64 x) { return (ROTR(x, 14) ^ ROTR(x, 18) ^ ROTR(x, 41)); } static const u64 k[] = { U64(0x428a2f98d728ae22), U64(0x7137449123ef65cd), U64(0xb5c0fbcfec4d3b2f), U64(0xe9b5dba58189dbbc), U64(0x3956c25bf348b538), U64(0x59f111f1b605d019), U64(0x923f82a4af194f9b), U64(0xab1c5ed5da6d8118), U64(0xd807aa98a3030242), U64(0x12835b0145706fbe), U64(0x243185be4ee4b28c), U64(0x550c7dc3d5ffb4e2), U64(0x72be5d74f27b896f), U64(0x80deb1fe3b1696b1), U64(0x9bdc06a725c71235), U64(0xc19bf174cf692694), U64(0xe49b69c19ef14ad2), U64(0xefbe4786384f25e3), U64(0x0fc19dc68b8cd5b5), U64(0x240ca1cc77ac9c65), U64(0x2de92c6f592b0275), U64(0x4a7484aa6ea6e483), U64(0x5cb0a9dcbd41fbd4), U64(0x76f988da831153b5), U64(0x983e5152ee66dfab), U64(0xa831c66d2db43210), U64(0xb00327c898fb213f), U64(0xbf597fc7beef0ee4), U64(0xc6e00bf33da88fc2), U64(0xd5a79147930aa725), U64(0x06ca6351e003826f), U64(0x142929670a0e6e70), U64(0x27b70a8546d22ffc), U64(0x2e1b21385c26c926), U64(0x4d2c6dfc5ac42aed), U64(0x53380d139d95b3df), U64(0x650a73548baf63de), U64(0x766a0abb3c77b2a8), U64(0x81c2c92e47edaee6), U64(0x92722c851482353b), U64(0xa2bfe8a14cf10364), U64(0xa81a664bbc423001), U64(0xc24b8b70d0f89791), U64(0xc76c51a30654be30), U64(0xd192e819d6ef5218), U64(0xd69906245565a910), U64(0xf40e35855771202a), U64(0x106aa07032bbd1b8), U64(0x19a4c116b8d2d0c8), U64(0x1e376c085141ab53), U64(0x2748774cdf8eeb99), U64(0x34b0bcb5e19b48a8), U64(0x391c0cb3c5c95a63), U64(0x4ed8aa4ae3418acb), U64(0x5b9cca4f7763e373), U64(0x682e6ff3d6b2b8a3), U64(0x748f82ee5defb2fc), U64(0x78a5636f43172f60), U64(0x84c87814a1f0ab72), U64(0x8cc702081a6439ec), U64(0x90befffa23631e28), U64(0xa4506cebde82bde9), U64(0xbef9a3f7b2c67915), U64(0xc67178f2e372532b), U64(0xca273eceea26619c), U64(0xd186b8c721c0c207), U64(0xeada7dd6cde0eb1e), U64(0xf57d4f7fee6ed178), U64(0x06f067aa72176fba), U64(0x0a637dc5a2c898a6), U64(0x113f9804bef90dae), U64(0x1b710b35131c471b), U64(0x28db77f523047d84), U64(0x32caab7b40c72493), U64(0x3c9ebe0a15c9bebc), U64(0x431d67c49c100d4c), U64(0x4cc5d4becb3e42b6), U64(0x597f299cfc657e2a), U64(0x5fcb6fab3ad6faec), U64(0x6c44198c4a475817) }; /* * Transform the message W which consists of 16 64-bit-words */ static uint sha512_transform(struct sha512_context *ctx, const byte *data) { u64 a, b, c, d, e, f, g, h; u64 w[16]; uint t; /* get values from the chaining vars */ a = ctx->h0; b = ctx->h1; c = ctx->h2; d = ctx->h3; e = ctx->h4; f = ctx->h5; g = ctx->h6; h = ctx->h7; for (t = 0; t < 16; t++) w[t] = get_u64(data + t * 8); #define S0(x) (ROTR((x),1) ^ ROTR((x),8) ^ ((x)>>7)) #define S1(x) (ROTR((x),19) ^ ROTR((x),61) ^ ((x)>>6)) for (t = 0; t < 80 - 16; ) { u64 t1, t2; /* Performance on a AMD Athlon(tm) Dual Core Processor 4050e with gcc 4.3.3 using gcry_md_hash_buffer of each 10000 bytes initialized to 0,1,2,3...255,0,... and 1000 iterations: Not unrolled with macros: 440ms Unrolled with macros: 350ms Unrolled with inline: 330ms */ #ifndef SHA512_UNROLLED t1 = h + sum1(e) + Ch(e, f, g) + k[t] + w[t%16]; w[t%16] += S1(w[(t - 2)%16]) + w[(t - 7)%16] + S0(w[(t - 15)%16]); t2 = sum0(a) + Maj(a, b, c); h = g; g = f; f = e; e = d + t1; d = c; c = b; b = a; a = t1 + t2; t++; #else /* Unrolled */ t1 = h + sum1(e) + Ch(e, f, g) + k[t] + w[0]; w[0] += S1(w[14]) + w[9] + S0(w[1]); t2 = sum0(a) + Maj(a, b, c); d += t1; h = t1 + t2; t1 = g + sum1(d) + Ch(d, e, f) + k[t+1] + w[1]; w[1] += S1(w[15]) + w[10] + S0(w[2]); t2 = sum0(h) + Maj(h, a, b); c += t1; g = t1 + t2; t1 = f + sum1(c) + Ch(c, d, e) + k[t+2] + w[2]; w[2] += S1(w[0]) + w[11] + S0(w[3]); t2 = sum0(g) + Maj(g, h, a); b += t1; f = t1 + t2; t1 = e + sum1(b) + Ch(b, c, d) + k[t+3] + w[3]; w[3] += S1(w[1]) + w[12] + S0(w[4]); t2 = sum0(f) + Maj(f, g, h); a += t1; e = t1 + t2; t1 = d + sum1(a) + Ch(a, b, c) + k[t+4] + w[4]; w[4] += S1(w[2]) + w[13] + S0(w[5]); t2 = sum0(e) + Maj(e, f, g); h += t1; d = t1 + t2; t1 = c + sum1(h) + Ch(h, a, b) + k[t+5] + w[5]; w[5] += S1(w[3]) + w[14] + S0(w[6]); t2 = sum0(d) + Maj(d, e, f); g += t1; c = t1 + t2; t1 = b + sum1(g) + Ch(g, h, a) + k[t+6] + w[6]; w[6] += S1(w[4]) + w[15] + S0(w[7]); t2 = sum0(c) + Maj(c, d, e); f += t1; b = t1 + t2; t1 = a + sum1(f) + Ch(f, g, h) + k[t+7] + w[7]; w[7] += S1(w[5]) + w[0] + S0(w[8]); t2 = sum0(b) + Maj(b, c, d); e += t1; a = t1 + t2; t1 = h + sum1(e) + Ch(e, f, g) + k[t+8] + w[8]; w[8] += S1(w[6]) + w[1] + S0(w[9]); t2 = sum0(a) + Maj(a, b, c); d += t1; h = t1 + t2; t1 = g + sum1(d) + Ch(d, e, f) + k[t+9] + w[9]; w[9] += S1(w[7]) + w[2] + S0(w[10]); t2 = sum0(h) + Maj(h, a, b); c += t1; g = t1 + t2; t1 = f + sum1(c) + Ch(c, d, e) + k[t+10] + w[10]; w[10] += S1(w[8]) + w[3] + S0(w[11]); t2 = sum0(g) + Maj(g, h, a); b += t1; f = t1 + t2; t1 = e + sum1(b) + Ch(b, c, d) + k[t+11] + w[11]; w[11] += S1(w[9]) + w[4] + S0(w[12]); t2 = sum0(f) + Maj(f, g, h); a += t1; e = t1 + t2; t1 = d + sum1(a) + Ch(a, b, c) + k[t+12] + w[12]; w[12] += S1(w[10]) + w[5] + S0(w[13]); t2 = sum0(e) + Maj(e, f, g); h += t1; d = t1 + t2; t1 = c + sum1(h) + Ch(h, a, b) + k[t+13] + w[13]; w[13] += S1(w[11]) + w[6] + S0(w[14]); t2 = sum0(d) + Maj(d, e, f); g += t1; c = t1 + t2; t1 = b + sum1(g) + Ch(g, h, a) + k[t+14] + w[14]; w[14] += S1(w[12]) + w[7] + S0(w[15]); t2 = sum0(c) + Maj(c, d, e); f += t1; b = t1 + t2; t1 = a + sum1(f) + Ch(f, g, h) + k[t+15] + w[15]; w[15] += S1(w[13]) + w[8] + S0(w[0]); t2 = sum0(b) + Maj(b, c, d); e += t1; a = t1 + t2; t += 16; #endif } for (; t < 80; ) { u64 t1, t2; #ifndef SHA512_UNROLLED t1 = h + sum1(e) + Ch(e, f, g) + k[t] + w[t%16]; t2 = sum0(a) + Maj(a, b, c); h = g; g = f; f = e; e = d + t1; d = c; c = b; b = a; a = t1 + t2; t++; #else /* Unrolled */ t1 = h + sum1(e) + Ch(e, f, g) + k[t] + w[0]; t2 = sum0(a) + Maj(a, b, c); d += t1; h = t1 + t2; t1 = g + sum1(d) + Ch(d, e, f) + k[t+1] + w[1]; t2 = sum0(h) + Maj(h, a, b); c += t1; g = t1 + t2; t1 = f + sum1(c) + Ch(c, d, e) + k[t+2] + w[2]; t2 = sum0(g) + Maj(g, h, a); b += t1; f = t1 + t2; t1 = e + sum1(b) + Ch(b, c, d) + k[t+3] + w[3]; t2 = sum0(f) + Maj(f, g, h); a += t1; e = t1 + t2; t1 = d + sum1(a) + Ch(a, b, c) + k[t+4] + w[4]; t2 = sum0(e) + Maj(e, f, g); h += t1; d = t1 + t2; t1 = c + sum1(h) + Ch(h, a, b) + k[t+5] + w[5]; t2 = sum0(d) + Maj(d, e, f); g += t1; c = t1 + t2; t1 = b + sum1(g) + Ch(g, h, a) + k[t+6] + w[6]; t2 = sum0(c) + Maj(c, d, e); f += t1; b = t1 + t2; t1 = a + sum1(f) + Ch(f, g, h) + k[t+7] + w[7]; t2 = sum0(b) + Maj(b, c, d); e += t1; a = t1 + t2; t1 = h + sum1(e) + Ch(e, f, g) + k[t+8] + w[8]; t2 = sum0(a) + Maj(a, b, c); d += t1; h = t1 + t2; t1 = g + sum1(d) + Ch(d, e, f) + k[t+9] + w[9]; t2 = sum0(h) + Maj(h, a, b); c += t1; g = t1 + t2; t1 = f + sum1(c) + Ch(c, d, e) + k[t+10] + w[10]; t2 = sum0(g) + Maj(g, h, a); b += t1; f = t1 + t2; t1 = e + sum1(b) + Ch(b, c, d) + k[t+11] + w[11]; t2 = sum0(f) + Maj(f, g, h); a += t1; e = t1 + t2; t1 = d + sum1(a) + Ch(a, b, c) + k[t+12] + w[12]; t2 = sum0(e) + Maj(e, f, g); h += t1; d = t1 + t2; t1 = c + sum1(h) + Ch(h, a, b) + k[t+13] + w[13]; t2 = sum0(d) + Maj(d, e, f); g += t1; c = t1 + t2; t1 = b + sum1(g) + Ch(g, h, a) + k[t+14] + w[14]; t2 = sum0(c) + Maj(c, d, e); f += t1; b = t1 + t2; t1 = a + sum1(f) + Ch(f, g, h) + k[t+15] + w[15]; t2 = sum0(b) + Maj(b, c, d); e += t1; a = t1 + t2; t += 16; #endif } /* Update chaining vars. */ ctx->h0 += a; ctx->h1 += b; ctx->h2 += c; ctx->h3 += d; ctx->h4 += e; ctx->h5 += f; ctx->h6 += g; ctx->h7 += h; return /* burn_stack */ (8 + 16) * sizeof(u64) + sizeof(u32) + 3 * sizeof(void*); } void sha512_update(struct hash_context *CTX, const byte *buf, uint len) { struct sha512_context *ctx = (void *) CTX; if (ctx->count) { /* Fill rest of internal buffer */ for (; len && ctx->count < SHA512_BLOCK_SIZE; len--) ctx->buf[ctx->count++] = *buf++; if (ctx->count < SHA512_BLOCK_SIZE) return; /* Process data from internal buffer */ sha512_transform(ctx, ctx->buf); ctx->nblocks++; ctx->count = 0; } if (!len) return; /* Process data from input buffer */ while (len >= SHA512_BLOCK_SIZE) { sha512_transform(ctx, buf); ctx->nblocks++; buf += SHA512_BLOCK_SIZE; len -= SHA512_BLOCK_SIZE; } /* Copy remaining data to internal buffer */ memcpy(ctx->buf, buf, len); ctx->count = len; } /* * The routine final terminates the computation and returns the digest. The * handle is prepared for a new cycle, but adding bytes to the handle will the * destroy the returned buffer. * * Returns: 64 bytes representing the digest. When used for sha384, we take the * first 48 of those bytes. */ byte * sha512_final(struct hash_context *CTX) { struct sha512_context *ctx = (void *) CTX; u64 t, th, msb, lsb; sha512_update(CTX, NULL, 0); /* flush */ t = ctx->nblocks; th = 0; /* multiply by 128 to make a byte count */ lsb = t << 7; msb = (th << 7) | (t >> 57); /* add the count */ t = lsb; if ((lsb += ctx->count) < t) msb++; /* multiply by 8 to make a bit count */ t = lsb; lsb <<= 3; msb <<= 3; msb |= t >> 61; if (ctx->count < 112) { /* enough room */ ctx->buf[ctx->count++] = 0x80; /* pad */ while(ctx->count < 112) ctx->buf[ctx->count++] = 0; /* pad */ } else { /* need one extra block */ ctx->buf[ctx->count++] = 0x80; /* pad character */ while(ctx->count < 128) ctx->buf[ctx->count++] = 0; sha512_update(CTX, NULL, 0); /* flush */ memset(ctx->buf, 0, 112); /* fill next block with zeroes */ } /* append the 128 bit count */ put_u64(ctx->buf + 112, msb); put_u64(ctx->buf + 120, lsb); sha512_transform(ctx, ctx->buf); byte *p = ctx->buf; #define X(a) do { put_u64(p, ctx->h##a); p += 8; } while(0) X(0); X(1); X(2); X(3); X(4); X(5); X(6); X(7); #undef X return ctx->buf; } bird-1.6.3/lib/heap.h0000644000103200001440000001156413027054563013275 0ustar feelausers/* * UCW Library -- Universal Heap Macros * * (c) 2001 Martin Mares * (c) 2005 Tomas Valla * * This software may be freely distributed and used according to the terms * of the GNU Lesser General Public License. */ /** * [[intro]] * Introduction * ------------ * * Binary heap is a simple data structure, which for example supports efficient insertions, deletions * and access to the minimal inserted item. We define several macros for such operations. * Note that because of simplicity of heaps, we have decided to define direct macros instead * of a <> as for several other data structures in the Libucw. * * A heap is represented by a number of elements and by an array of values. Beware that we * index this array from one, not from zero as do the standard C arrays. * * Most macros use these parameters: * * - @type - the type of elements * - @num - a variable (signed or unsigned integer) with the number of elements * - @heap - a C array of type @type; the heap is stored in `heap[1] .. heap[num]`; `heap[0]` is unused * - @less - a callback to compare two element values; `less(x, y)` shall return a non-zero value iff @x is lower than @y * - @swap - a callback to swap two array elements; `swap(heap, i, j, t)` must swap `heap[i]` with `heap[j]` with possible help of temporary variable @t (type @type). * * A valid heap must follow these rules: * * - `num >= 0` * - `heap[i] >= heap[i / 2]` for each `i` in `[2, num]` * * The first element `heap[1]` is always lower or equal to all other elements. * * [[macros]] * Macros * ------ */ /* For internal usage. */ #define HEAP_BUBBLE_DOWN_J(heap,num,less,swap) \ for (;;) \ { \ _l = 2*_j; \ if (_l > num) \ break; \ if (less(heap[_j],heap[_l]) && (_l == num || less(heap[_j],heap[_l+1]))) \ break; \ if (_l != num && less(heap[_l+1],heap[_l])) \ _l++; \ swap(heap,_j,_l,x); \ _j = _l; \ } /* For internal usage. */ #define HEAP_BUBBLE_UP_J(heap,num,less,swap) \ while (_j > 1) \ { \ _u = _j/2; \ if (less(heap[_u], heap[_j])) \ break; \ swap(heap,_u,_j,x); \ _j = _u; \ } /** * Shuffle the unordered array @heap of @num elements to become a valid heap. The time complexity is linear. **/ #define HEAP_INIT(heap,num,type,less,swap) \ do { \ uint _i = num; \ uint _j, _l; \ type x; \ while (_i >= 1) \ { \ _j = _i; \ HEAP_BUBBLE_DOWN_J(heap,num,less,swap) \ _i--; \ } \ } while(0) /** * Delete the minimum element `heap[1]` in `O(log(n))` time. * The removed value is moved just after the resulting heap (`heap[num + 1]`). **/ #define HEAP_DELMIN(heap,num,type,less,swap) \ do { \ uint _j, _l; \ type x; \ swap(heap,1,num,x); \ num--; \ _j = 1; \ HEAP_BUBBLE_DOWN_J(heap,num,less,swap); \ } while(0) /** * Insert `heap[num]` in `O(log(n))` time. The value of @num must be increased before. **/ #define HEAP_INSERT(heap,num,type,less,swap) \ do { \ uint _j, _u; \ type x; \ _j = num; \ HEAP_BUBBLE_UP_J(heap,num,less,swap); \ } while(0) /** * If you need to increase the value of `heap[pos]`, just do it and then call this macro to rebuild the heap. * Only `heap[pos]` can be changed, the rest of the array must form a valid heap. * The time complexity is `O(log(n))`. **/ #define HEAP_INCREASE(heap,num,type,less,swap,pos) \ do { \ uint _j, _l; \ type x; \ _j = pos; \ HEAP_BUBBLE_DOWN_J(heap,num,less,swap); \ } while(0) /** * If you need to decrease the value of `heap[pos]`, just do it and then call this macro to rebuild the heap. * Only `heap[pos]` can be changed, the rest of the array must form a valid heap. * The time complexity is `O(log(n))`. **/ #define HEAP_DECREASE(heap,num,type,less,swap,pos) \ do { \ uint _j, _u; \ type x; \ _j = pos; \ HEAP_BUBBLE_UP_J(heap,num,less,swap); \ } while(0) /** * Delete `heap[pos]` in `O(log(n))` time. **/ #define HEAP_DELETE(heap,num,type,less,swap,pos) \ do { \ uint _j, _l, _u; \ type x; \ _j = pos; \ swap(heap,_j,num,x); \ num--; \ if (less(heap[_j], heap[num+1])) \ HEAP_BUBBLE_UP_J(heap,num,less,swap) \ else \ HEAP_BUBBLE_DOWN_J(heap,num,less,swap); \ } while(0) /** * Default swapping macro. **/ #define HEAP_SWAP(heap,a,b,t) (t=heap[a], heap[a]=heap[b], heap[b]=t) bird-1.6.3/lib/slab.c0000644000103200001440000001655313027054563013277 0ustar feelausers/* * BIRD Resource Manager -- A SLAB-like Memory Allocator * * Heavily inspired by the original SLAB paper by Jeff Bonwick. * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Slabs * * Slabs are collections of memory blocks of a fixed size. * They support very fast allocation and freeing of such blocks, prevent memory * fragmentation and optimize L2 cache usage. Slabs have been invented by Jeff Bonwick * and published in USENIX proceedings as `The Slab Allocator: An Object-Caching Kernel * Memory Allocator'. Our implementation follows this article except that we don't use * constructors and destructors. * * When the |DEBUGGING| switch is turned on, we automatically fill all * newly allocated and freed blocks with a special pattern to make detection * of use of uninitialized or already freed memory easier. * * Example: Nodes of a FIB are allocated from a per-FIB Slab. */ #include #include #include "nest/bird.h" #include "lib/resource.h" #include "lib/string.h" #undef FAKE_SLAB /* Turn on if you want to debug memory allocations */ #ifdef DEBUGGING #define POISON /* Poison all regions after they are freed */ #endif static void slab_free(resource *r); static void slab_dump(resource *r); static resource *slab_lookup(resource *r, unsigned long addr); static size_t slab_memsize(resource *r); #ifdef FAKE_SLAB /* * Fake version used for debugging. */ struct slab { resource r; uint size; list objs; }; static struct resclass sl_class = { "FakeSlab", sizeof(struct slab), slab_free, slab_dump, NULL, slab_memsize }; struct sl_obj { node n; uintptr_t data_align[0]; byte data[0]; }; slab * sl_new(pool *p, uint size) { slab *s = ralloc(p, &sl_class); s->size = size; init_list(&s->objs); return s; } void * sl_alloc(slab *s) { struct sl_obj *o = xmalloc(sizeof(struct sl_obj) + s->size); add_tail(&s->objs, &o->n); return o->data; } void sl_free(slab *s, void *oo) { struct sl_obj *o = SKIP_BACK(struct sl_obj, data, oo); rem_node(&o->n); xfree(o); } static void slab_free(resource *r) { slab *s = (slab *) r; struct sl_obj *o, *p; for(o = HEAD(s->objs); p = (struct sl_obj *) o->n.next; o = p) xfree(o); } static void slab_dump(resource *r) { slab *s = (slab *) r; int cnt = 0; struct sl_obj *o; WALK_LIST(o, s->objs) cnt++; debug("(%d objects per %d bytes)\n", cnt, s->size); } static size_t slab_memsize(resource *r) { slab *s = (slab *) r; size_t cnt = 0; struct sl_obj *o; WALK_LIST(o, s->objs) cnt++; return ALLOC_OVERHEAD + sizeof(struct slab) + cnt * (ALLOC_OVERHEAD + s->size); } #else /* * Real efficient version. */ #define SLAB_SIZE 4096 #define MAX_EMPTY_HEADS 1 struct slab { resource r; uint obj_size, head_size, objs_per_slab, num_empty_heads, data_size; list empty_heads, partial_heads, full_heads; }; static struct resclass sl_class = { "Slab", sizeof(struct slab), slab_free, slab_dump, slab_lookup, slab_memsize }; struct sl_head { node n; struct sl_obj *first_free; int num_full; }; struct sl_obj { struct sl_head *slab; union { struct sl_obj *next; byte data[0]; } u; }; struct sl_alignment { /* Magic structure for testing of alignment */ byte data; int x[0]; }; /** * sl_new - create a new Slab * @p: resource pool * @size: block size * * This function creates a new Slab resource from which * objects of size @size can be allocated. */ slab * sl_new(pool *p, uint size) { slab *s = ralloc(p, &sl_class); uint align = sizeof(struct sl_alignment); if (align < sizeof(int)) align = sizeof(int); s->data_size = size; size += OFFSETOF(struct sl_obj, u.data); if (size < sizeof(struct sl_obj)) size = sizeof(struct sl_obj); size = (size + align - 1) / align * align; s->obj_size = size; s->head_size = (sizeof(struct sl_head) + align - 1) / align * align; s->objs_per_slab = (SLAB_SIZE - s->head_size) / size; if (!s->objs_per_slab) bug("Slab: object too large"); s->num_empty_heads = 0; init_list(&s->empty_heads); init_list(&s->partial_heads); init_list(&s->full_heads); return s; } static struct sl_head * sl_new_head(slab *s) { struct sl_head *h = xmalloc(SLAB_SIZE); struct sl_obj *o = (struct sl_obj *)((byte *)h+s->head_size); struct sl_obj *no; uint n = s->objs_per_slab; h->first_free = o; h->num_full = 0; while (n--) { o->slab = h; no = (struct sl_obj *)((char *) o+s->obj_size); o->u.next = n ? no : NULL; o = no; } return h; } /** * sl_alloc - allocate an object from Slab * @s: slab * * sl_alloc() allocates space for a single object from the * Slab and returns a pointer to the object. */ void * sl_alloc(slab *s) { struct sl_head *h; struct sl_obj *o; redo: h = HEAD(s->partial_heads); if (!h->n.next) goto no_partial; okay: o = h->first_free; if (!o) goto full_partial; h->first_free = o->u.next; h->num_full++; #ifdef POISON memset(o->u.data, 0xcd, s->data_size); #endif return o->u.data; full_partial: rem_node(&h->n); add_tail(&s->full_heads, &h->n); goto redo; no_partial: h = HEAD(s->empty_heads); if (h->n.next) { rem_node(&h->n); add_head(&s->partial_heads, &h->n); s->num_empty_heads--; goto okay; } h = sl_new_head(s); add_head(&s->partial_heads, &h->n); goto okay; } /** * sl_free - return a free object back to a Slab * @s: slab * @oo: object returned by sl_alloc() * * This function frees memory associated with the object @oo * and returns it back to the Slab @s. */ void sl_free(slab *s, void *oo) { struct sl_obj *o = SKIP_BACK(struct sl_obj, u.data, oo); struct sl_head *h = o->slab; #ifdef POISON memset(oo, 0xdb, s->data_size); #endif o->u.next = h->first_free; h->first_free = o; if (!--h->num_full) { rem_node(&h->n); if (s->num_empty_heads >= MAX_EMPTY_HEADS) xfree(h); else { add_head(&s->empty_heads, &h->n); s->num_empty_heads++; } } else if (!o->u.next) { rem_node(&h->n); add_head(&s->partial_heads, &h->n); } } static void slab_free(resource *r) { slab *s = (slab *) r; struct sl_head *h, *g; WALK_LIST_DELSAFE(h, g, s->empty_heads) xfree(h); WALK_LIST_DELSAFE(h, g, s->partial_heads) xfree(h); WALK_LIST_DELSAFE(h, g, s->full_heads) xfree(h); } static void slab_dump(resource *r) { slab *s = (slab *) r; int ec=0, pc=0, fc=0; struct sl_head *h; WALK_LIST(h, s->empty_heads) ec++; WALK_LIST(h, s->partial_heads) pc++; WALK_LIST(h, s->full_heads) fc++; debug("(%de+%dp+%df blocks per %d objs per %d bytes)\n", ec, pc, fc, s->objs_per_slab, s->obj_size); } static size_t slab_memsize(resource *r) { slab *s = (slab *) r; size_t heads = 0; struct sl_head *h; WALK_LIST(h, s->empty_heads) heads++; WALK_LIST(h, s->partial_heads) heads++; WALK_LIST(h, s->full_heads) heads++; return ALLOC_OVERHEAD + sizeof(struct slab) + heads * (ALLOC_OVERHEAD + SLAB_SIZE); } static resource * slab_lookup(resource *r, unsigned long a) { slab *s = (slab *) r; struct sl_head *h; WALK_LIST(h, s->partial_heads) if ((unsigned long) h < a && (unsigned long) h + SLAB_SIZE < a) return r; WALK_LIST(h, s->full_heads) if ((unsigned long) h < a && (unsigned long) h + SLAB_SIZE < a) return r; return NULL; } #endif bird-1.6.3/conf/0000755000103200001440000000000013027054563012357 5ustar feelausersbird-1.6.3/conf/gen_keywords.m40000644000103200001440000000334513027054563015326 0ustar feelausersm4_divert(-1)m4_dnl # # BIRD -- Generator of Configuration Keyword List # # (c) 1998--2000 Martin Mares # # Can be freely distributed and used under the terms of the GNU GPL. # # Common aliases m4_define(DNL, `m4_dnl') # Diversions used: # 1 keywords # Simple iterator m4_define(CF_itera, `m4_ifelse($#, 1, [[CF_iter($1)]], [[CF_iter($1)[[]]CF_itera(m4_shift($@))]])') m4_define(CF_iterate, `m4_define([[CF_iter]], m4_defn([[$1]]))CF_itera($2)') # We include all the headers m4_define(CF_HDR, `m4_divert(0)') m4_define(CF_DECLS, `m4_divert(-1)') m4_define(CF_DEFINES, `m4_divert(-1)') # Keywords are translated to C initializers m4_define(CF_handle_kw, `m4_divert(1){ "m4_translit($1,[[A-Z]],[[a-z]])", $1, NULL }, m4_divert(-1)') m4_define(CF_keywd, `m4_ifdef([[CF_tok_$1]],,[[m4_define([[CF_tok_$1]],1)CF_handle_kw($1)]])') m4_define(CF_KEYWORDS, `m4_define([[CF_toks]],[[]])CF_iterate([[CF_keywd]], [[$@]])m4_ifelse(CF_toks,,,%token[[]]CF_toks )DNL') # CLI commands generate keywords as well m4_define(CF_CLI, `CF_KEYWORDS(m4_translit($1, [[ ]], [[,]])) ') # Enums are translated to C initializers: use CF_ENUM(typename, prefix, values) m4_define(CF_enum, `m4_divert(1){ "CF_enum_prefix[[]]$1", -((CF_enum_type<<16) | CF_enum_prefix[[]]$1), NULL }, m4_divert(-1)') m4_define(CF_ENUM, `m4_define([[CF_enum_type]],$1)m4_define([[CF_enum_prefix]],$2)CF_iterate([[CF_enum]], [[m4_shift(m4_shift($@))]])DNL') # After all configuration templates end, we generate the m4_m4wrap(` m4_divert(0) static struct keyword keyword_list[] = { m4_undivert(1){ NULL, -1, NULL } }; ') # As we are processing C source, we must access all M4 primitives via # m4_* and also set different quoting convention: `[[' and ']]' m4_changequote([[,]]) bird-1.6.3/conf/Doc0000644000103200001440000000004413027054563013005 0ustar feelausersH Configuration S conf.c S cf-lex.l bird-1.6.3/conf/confbase.Y0000644000103200001440000000732613027054563014301 0ustar feelausers/* * BIRD -- Configuration Parser Top * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ CF_HDR #define PARSER 1 #include "nest/bird.h" #include "conf/conf.h" #include "lib/resource.h" #include "lib/socket.h" #include "lib/timer.h" #include "lib/string.h" #include "nest/protocol.h" #include "nest/iface.h" #include "nest/route.h" #include "nest/cli.h" #include "filter/filter.h" /* FIXME: Turn on YYERROR_VERBOSE and work around lots of bison bugs? */ CF_DEFINES static void check_u16(unsigned val) { if (val > 0xFFFF) cf_error("Value %d out of range (0-65535)", val); } CF_DECLS %union { int i; u32 i32; ip_addr a; struct symbol *s; char *t; struct rtable_config *r; struct f_inst *x; struct filter *f; struct f_tree *e; struct f_trie *trie; struct f_val v; struct f_path_mask *h; struct password_item *p; struct rt_show_data *ra; struct roa_show_data *ro; struct sym_show_data *sd; struct lsadb_show_data *ld; struct iface *iface; struct roa_table *rot; void *g; bird_clock_t time; struct prefix px; struct proto_spec ps; struct timeformat *tf; } %token END CLI_MARKER INVALID_TOKEN ELSECOL DDOT %token GEQ LEQ NEQ AND OR %token PO PC %token NUM ENUM %token RTRID %token IPA %token SYM %token TEXT %type ipa_scope %type expr bool pxlen %type expr_us %type ipa %type prefix prefix_or_ipa %type text %type text_or_none %nonassoc PREFIX_DUMMY %left AND OR %nonassoc '=' '<' '>' '~' GEQ LEQ NEQ NMA PO PC %left '+' '-' %left '*' '/' '%' %left '!' %nonassoc '.' CF_KEYWORDS(DEFINE, ON, OFF, YES, NO, S, MS, US, PORT) CF_GRAMMAR /* Basic config file structure */ config: conf_entries END { return 0; } | CLI_MARKER cli_cmd { return 0; } ; conf_entries: /* EMPTY */ | conf_entries conf ; CF_ADDTO(conf, ';') /* Constant expressions */ CF_ADDTO(conf, definition) definition: DEFINE SYM '=' term ';' { struct f_val *val = cfg_alloc(sizeof(struct f_val)); *val = f_eval($4, cfg_mem); if (val->type == T_RETURN) cf_error("Runtime error"); cf_define_symbol($2, SYM_CONSTANT | val->type, val); } ; expr: NUM | '(' term ')' { $$ = f_eval_int($2); } | SYM { if ($1->class != (SYM_CONSTANT | T_INT)) cf_error("Number expected"); $$ = SYM_VAL($1).i; } ; expr_us: expr S { $$ = (u32) $1 * 1000000; } | expr MS { $$ = (u32) $1 * 1000; } | expr US { $$ = (u32) $1 * 1; } ; /* expr_u16: expr { check_u16($1); $$ = $1; }; */ /* Switches */ bool: expr { $$ = !!$1; } | ON { $$ = 1; } | YES { $$ = 1; } | OFF { $$ = 0; } | NO { $$ = 0; } | /* Silence means agreement */ { $$ = 1; } ; /* Addresses, prefixes and netmasks */ ipa: IPA | SYM { if ($1->class != (SYM_CONSTANT | T_IP)) cf_error("IP address expected"); $$ = SYM_VAL($1).px.ip; } ; ipa_scope: /* empty */ { $$ = NULL; } | '%' SYM { $$ = if_get_by_name($2->name); } ; prefix: ipa pxlen { if (!ip_is_prefix($1, $2)) cf_error("Invalid prefix"); $$.addr = $1; $$.len = $2; } ; prefix_or_ipa: prefix | ipa { $$.addr = $1; $$.len = BITS_PER_IP_ADDRESS; } ; pxlen: '/' expr { if ($2 < 0 || $2 > BITS_PER_IP_ADDRESS) cf_error("Invalid prefix length %d", $2); $$ = $2; } | ':' ipa { $$ = ipa_masklen($2); if ($$ < 0) cf_error("Invalid netmask %I", $2); } ; datetime: TEXT { $$ = tm_parse_datetime($1); if (!$$) cf_error("Invalid date and time"); } ; text: TEXT | SYM { if ($1->class != (SYM_CONSTANT | T_STRING)) cf_error("String expected"); $$ = SYM_VAL($1).s; } ; text_or_none: TEXT { $$ = $1; } | { $$ = NULL; } ; CF_CODE CF_END bird-1.6.3/conf/conf.h0000644000103200001440000001340113027054563013454 0ustar feelausers/* * BIRD Internet Routing Daemon -- Configuration File Handling * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_CONF_H_ #define _BIRD_CONF_H_ #include "lib/resource.h" #include "lib/timer.h" /* Configuration structure */ struct config { pool *pool; /* Pool the configuration is stored in */ linpool *mem; /* Linear pool containing configuration data */ list protos; /* Configured protocol instances (struct proto_config) */ list tables; /* Configured routing tables (struct rtable_config) */ list roa_tables; /* Configured ROA tables (struct roa_table_config) */ list logfiles; /* Configured log files (sysdep) */ int mrtdump_file; /* Configured MRTDump file (sysdep, fd in unix) */ char *syslog_name; /* Name used for syslog (NULL -> no syslog) */ struct rtable_config *master_rtc; /* Configuration of master routing table */ struct iface_patt *router_id_from; /* Configured list of router ID iface patterns */ u32 router_id; /* Our Router ID */ ip_addr listen_bgp_addr; /* Listening BGP socket should use this address */ unsigned listen_bgp_port; /* Listening BGP socket should use this port (0 is default) */ u32 listen_bgp_flags; /* Listening BGP socket should use these flags */ unsigned proto_default_debug; /* Default protocol debug mask */ unsigned proto_default_mrtdump; /* Default protocol mrtdump mask */ struct timeformat tf_route; /* Time format for 'show route' */ struct timeformat tf_proto; /* Time format for 'show protocol' */ struct timeformat tf_log; /* Time format for the logfile */ struct timeformat tf_base; /* Time format for other purposes */ u32 gr_wait; /* Graceful restart wait timeout */ int cli_debug; /* Tracing of CLI connections and commands */ int latency_debug; /* I/O loop tracks duration of each event */ u32 latency_limit; /* Events with longer duration are logged (us) */ u32 watchdog_warning; /* I/O loop watchdog limit for warning (us) */ u32 watchdog_timeout; /* Watchdog timeout (in seconds, 0 = disabled) */ char *err_msg; /* Parser error message */ int err_lino; /* Line containing error */ char *err_file_name; /* File name containing error */ char *file_name; /* Name of main configuration file */ int file_fd; /* File descriptor of main configuration file */ struct symbol **sym_hash; /* Lexer: symbol hash table */ struct symbol **sym_fallback; /* Lexer: fallback symbol hash table */ int obstacle_count; /* Number of items blocking freeing of this config */ int shutdown; /* This is a pseudo-config for daemon shutdown */ bird_clock_t load_time; /* When we've got this configuration */ }; /* Please don't use these variables in protocols. Use proto_config->global instead. */ extern struct config *config; /* Currently active configuration */ extern struct config *new_config; /* Configuration being parsed */ struct config *config_alloc(const byte *name); int config_parse(struct config *); int cli_parse(struct config *); void config_free(struct config *); int config_commit(struct config *, int type, int timeout); int config_confirm(void); int config_undo(void); void config_init(void); void cf_error(char *msg, ...) NORET; void config_add_obstacle(struct config *); void config_del_obstacle(struct config *); void order_shutdown(void); #define RECONFIG_NONE 0 #define RECONFIG_HARD 1 #define RECONFIG_SOFT 2 #define RECONFIG_UNDO 3 #define CONF_DONE 0 #define CONF_PROGRESS 1 #define CONF_QUEUED 2 #define CONF_UNQUEUED 3 #define CONF_CONFIRM 4 #define CONF_SHUTDOWN -1 #define CONF_NOTHING -2 /* Pools */ extern linpool *cfg_mem; #define cfg_alloc(size) lp_alloc(cfg_mem, size) #define cfg_allocu(size) lp_allocu(cfg_mem, size) #define cfg_allocz(size) lp_allocz(cfg_mem, size) char *cfg_strdup(const char *c); void cfg_copy_list(list *dest, list *src, unsigned node_size); /* Lexer */ extern int (*cf_read_hook)(byte *buf, uint max, int fd); struct symbol { struct symbol *next; struct sym_scope *scope; int class; int aux; void *aux2; void *def; char name[1]; }; #define SYM_MAX_LEN 64 /* Remember to update cf_symbol_class_name() */ #define SYM_VOID 0 #define SYM_PROTO 1 #define SYM_TEMPLATE 2 #define SYM_FUNCTION 3 #define SYM_FILTER 4 #define SYM_TABLE 5 #define SYM_ROA 6 #define SYM_VARIABLE 0x100 /* 0x100-0x1ff are variable types */ #define SYM_CONSTANT 0x200 /* 0x200-0x2ff are variable types */ #define SYM_TYPE(s) (((struct f_val *) (s)->def)->type) #define SYM_VAL(s) (((struct f_val *) (s)->def)->val) struct include_file_stack { void *buffer; /* Internal lexer state */ char *file_name; /* File name */ int fd; /* File descriptor */ int lino; /* Current line num */ int depth; /* Include depth, 0 = cannot include */ struct include_file_stack *prev; /* Previous record in stack */ struct include_file_stack *up; /* Parent (who included this file) */ }; extern struct include_file_stack *ifs; int cf_lex(void); void cf_lex_init(int is_cli, struct config *c); void cf_lex_unwind(void); struct symbol *cf_find_symbol(struct config *cfg, byte *c); struct symbol *cf_get_symbol(byte *c); struct symbol *cf_default_name(char *template, int *counter); struct symbol *cf_define_symbol(struct symbol *symbol, int type, void *def); void cf_push_scope(struct symbol *); void cf_pop_scope(void); struct symbol *cf_walk_symbols(struct config *cf, struct symbol *sym, int *pos); char *cf_symbol_class_name(struct symbol *sym); static inline int cf_symbol_is_constant(struct symbol *sym) { return (sym->class & 0xff00) == SYM_CONSTANT; } /* Parser */ int cf_parse(void); /* Sysdep hooks */ void sysdep_preconfig(struct config *); int sysdep_commit(struct config *, struct config *); void sysdep_shutdown_done(void); #endif bird-1.6.3/conf/gen_commands.m40000644000103200001440000000117713027054563015261 0ustar feelausersm4_divert(-1)m4_dnl # # BIRD -- Generator of CLI Command List # # (c) 2000 Martin Mares # # Can be freely distributed and used under the terms of the GNU GPL. # m4_define(CF_CLI, `m4_divert(0){ "m4_translit($1,A-Z,a-z)", "$3", "$4", 1 }, m4_divert(-1)') m4_define(CF_CLI_CMD, `m4_divert(0){ "m4_translit($1,A-Z,a-z)", "$2", "$3", 1 }, m4_divert(-1)') m4_define(CF_CLI_HELP, `m4_divert(0){ "m4_translit($1,A-Z,a-z)", "$2", "$3", 0 }, m4_divert(-1)') # As we are processing C source, we must access all M4 primitives via # m4_* and also set different quoting convention: `[[' and ']]' m4_changequote([[,]]) bird-1.6.3/conf/gen_parser.m40000644000103200001440000000405113027054563014746 0ustar feelausersm4_divert(-1)m4_dnl # # BIRD -- Generator of Configuration Grammar # # (c) 1998--1999 Martin Mares # # Can be freely distributed and used under the terms of the GNU GPL. # # Diversions used: # 1 includes # 2 types etc. # 3 rules # 4 C code # Common aliases m4_define(DNL, `m4_dnl') # Define macros for defining sections m4_define(CF_ZONE, `m4_divert($1)/* $2 from m4___file__ */') m4_define(CF_HDR, `CF_ZONE(1, Headers)') m4_define(CF_DEFINES, `CF_ZONE(1, Defines)') m4_define(CF_DECLS, `CF_ZONE(2, Declarations)') m4_define(CF_GRAMMAR, `CF_ZONE(3, Grammar)') m4_define(CF_CODE, `CF_ZONE(4, C Code)') m4_define(CF_END, `m4_divert(-1)') # Simple iterator m4_define(CF_itera, `m4_ifelse($#, 1, [[CF_iter($1)]], [[CF_iter($1)[[]]CF_itera(m4_shift($@))]])') m4_define(CF_iterate, `m4_define([[CF_iter]], m4_defn([[$1]]))CF_itera($2)') # Keywords act as untyped %token m4_define(CF_keywd, `m4_ifdef([[CF_tok_$1]],,[[m4_define([[CF_tok_$1]],1)m4_define([[CF_toks]],CF_toks $1)]])') m4_define(CF_KEYWORDS, `m4_define([[CF_toks]],[[]])CF_iterate([[CF_keywd]], [[$@]])m4_ifelse(CF_toks,,,%token[[]]CF_toks )DNL') # Dynamic syntax rules m4_define(CF_dyn_rules,) m4_define(CF_ADDTO, `m4_define([[CF_rule_$1]],m4_ifdef([[CF_rule_$1]],CF_rule_$1 | ,[[m4_define([[CF_dyn_rules]],CF_dyn_rules[[CF_RULE($1) ]])]])$2)DNL') # CLI commands m4_define(CF_CLI, `m4_define([[CF_cmd]], cmd_[[]]m4_translit($1, [[ ]], _))DNL m4_divert(2)CF_KEYWORDS(m4_translit($1, [[ ]], [[,]])) m4_divert(3)CF_ADDTO(cli_cmd, CF_cmd) CF_cmd: $1 $2 END') m4_define(CF_CLI_CMD, `') m4_define(CF_CLI_HELP, `') # ENUM declarations are ignored m4_define(CF_ENUM, `') # After all configuration templates end, we finally generate the grammar file. m4_m4wrap(` m4_divert(0)DNL %{ m4_undivert(1)DNL %} m4_undivert(2)DNL %% m4_undivert(3)DNL /* Dynamic rules */ m4_define(CF_RULE, [[$1: CF_rule_$1 ;]]) CF_dyn_rules %% m4_undivert(4)DNL ') # As we are processing C source, we must access all M4 primitives via # m4_* and also set different quoting convention: `[[' and ']]' m4_changequote([[,]]) bird-1.6.3/conf/cf-lex.l0000644000103200001440000004042613027054563013720 0ustar feelausers/* * BIRD -- Configuration Lexer * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Lexical analyzer * * The lexical analyzer used for configuration files and CLI commands * is generated using the |flex| tool accompanied by a couple of * functions maintaining the hash tables containing information about * symbols and keywords. * * Each symbol is represented by a &symbol structure containing name * of the symbol, its lexical scope, symbol class (%SYM_PROTO for a * name of a protocol, %SYM_CONSTANT for a constant etc.) and class * dependent data. When an unknown symbol is encountered, it's * automatically added to the symbol table with class %SYM_VOID. * * The keyword tables are generated from the grammar templates * using the |gen_keywords.m4| script. */ %{ #undef REJECT /* Avoid name clashes */ #include #include #include #include #include #include #include #include #include #include #include #define PARSER 1 #include "nest/bird.h" #include "nest/route.h" #include "nest/protocol.h" #include "filter/filter.h" #include "conf/conf.h" #include "conf/cf-parse.tab.h" #include "lib/string.h" struct keyword { byte *name; int value; struct keyword *next; }; #include "conf/keywords.h" #define KW_HASH_SIZE 64 static struct keyword *kw_hash[KW_HASH_SIZE]; static int kw_hash_inited; #define SYM_HASH_SIZE 128 struct sym_scope { struct sym_scope *next; /* Next on scope stack */ struct symbol *name; /* Name of this scope */ int active; /* Currently entered */ }; static struct sym_scope *conf_this_scope; static int cf_hash(byte *c); static inline struct symbol * cf_get_sym(byte *c, uint h0); linpool *cfg_mem; int (*cf_read_hook)(byte *buf, unsigned int max, int fd); struct include_file_stack *ifs; static struct include_file_stack *ifs_head; #define MAX_INCLUDE_DEPTH 8 #define YY_INPUT(buf,result,max) result = cf_read_hook(buf, max, ifs->fd); #define YY_NO_UNPUT #define YY_FATAL_ERROR(msg) cf_error(msg) static void cf_include(char *arg, int alen); static int check_eof(void); %} %option noyywrap %option noinput %option nounput %option noreject %x COMMENT CCOMM CLI ALPHA [a-zA-Z_] DIGIT [0-9] XIGIT [0-9a-fA-F] ALNUM [a-zA-Z_0-9] WHITE [ \t] include ^{WHITE}*include{WHITE}*\".*\"{WHITE}*; %% {include} { char *start, *end; if (!ifs->depth) cf_error("Include not allowed in CLI"); start = strchr(yytext, '"'); start++; end = strchr(start, '"'); *end = 0; if (start == end) cf_error("Include with empty argument"); cf_include(start, end-start); } {DIGIT}+\.{DIGIT}+\.{DIGIT}+\.{DIGIT}+ { ip4_addr a; if (!ip4_pton(yytext, &a)) cf_error("Invalid IPv4 address %s", yytext); #ifdef IPV6 cf_lval.i32 = ip4_to_u32(a); return RTRID; #else cf_lval.a = ipa_from_ip4(a); return IPA; #endif } ({XIGIT}*::|({XIGIT}*:){3,})({XIGIT}*|{DIGIT}+\.{DIGIT}+\.{DIGIT}+\.{DIGIT}+) { #ifdef IPV6 if (ipa_pton(yytext, &cf_lval.a)) return IPA; cf_error("Invalid IPv6 address %s", yytext); #else cf_error("This is an IPv4 router, therefore IPv6 addresses are not supported"); #endif } 0x{XIGIT}+ { char *e; unsigned long int l; errno = 0; l = strtoul(yytext+2, &e, 16); if (e && *e || errno == ERANGE || (unsigned long int)(unsigned int) l != l) cf_error("Number out of range"); cf_lval.i = l; return NUM; } {DIGIT}+ { char *e; unsigned long int l; errno = 0; l = strtoul(yytext, &e, 10); if (e && *e || errno == ERANGE || (unsigned long int)(unsigned int) l != l) cf_error("Number out of range"); cf_lval.i = l; return NUM; } else: { /* Hack to distinguish if..else from else: in case */ return ELSECOL; } ({ALPHA}{ALNUM}*|[']({ALNUM}|[-]|[\.]|[:])*[']) { if(*yytext == '\'') { yytext[yyleng-1] = 0; yytext++; } unsigned int h = cf_hash(yytext); struct keyword *k = kw_hash[h & (KW_HASH_SIZE-1)]; while (k) { if (!strcmp(k->name, yytext)) { if (k->value > 0) return k->value; else { cf_lval.i = -k->value; return ENUM; } } k=k->next; } cf_lval.s = cf_get_sym(yytext, h); return SYM; } (.|\n) { BEGIN(INITIAL); return CLI_MARKER; } \.\. { return DDOT; } [={}:;,.()+*/%<>~\[\]?!\|-] { return yytext[0]; } ["][^"\n]*["] { yytext[yyleng-1] = 0; cf_lval.t = cfg_strdup(yytext+1); return TEXT; } ["][^"\n]*\n cf_error("Unterminated string"); <> { if (check_eof()) return END; } {WHITE}+ \n ifs->lino++; # BEGIN(COMMENT); \/\* BEGIN(CCOMM); . cf_error("Unknown character"); \n { ifs->lino++; BEGIN(INITIAL); } . \*\/ BEGIN(INITIAL); \n ifs->lino++; \/\* cf_error("Comment nesting not supported"); <> cf_error("Unterminated comment"); . \!\= return NEQ; \!\~ return NMA; \<\= return LEQ; \>\= return GEQ; \&\& return AND; \|\| return OR; \[\= return PO; \=\] return PC; %% static int cf_hash(byte *c) { unsigned int h = 13; while (*c) h = (h * 37) + *c++; return h; } /* * IFS stack - it contains structures needed for recursive processing * of include in config files. On the top of the stack is a structure * for currently processed file. Other structures are either for * active files interrupted because of include directive (these have * fd and flex buffer) or for inactive files scheduled to be processed * later (when parent requested including of several files by wildcard * match - these do not have fd and flex buffer yet). * * FIXME: Most of these ifs and include functions are really sysdep/unix. */ static struct include_file_stack * push_ifs(struct include_file_stack *old) { struct include_file_stack *ret; ret = cfg_allocz(sizeof(struct include_file_stack)); ret->lino = 1; ret->prev = old; return ret; } static struct include_file_stack * pop_ifs(struct include_file_stack *old) { yy_delete_buffer(old->buffer); close(old->fd); return old->prev; } static void enter_ifs(struct include_file_stack *new) { if (!new->buffer) { new->fd = open(new->file_name, O_RDONLY); if (new->fd < 0) { ifs = ifs->up; cf_error("Unable to open included file %s: %m", new->file_name); } new->buffer = yy_create_buffer(NULL, YY_BUF_SIZE); } yy_switch_to_buffer(new->buffer); } /** * cf_lex_unwind - unwind lexer state during error * * cf_lex_unwind() frees the internal state on IFS stack when the lexical * analyzer is terminated by cf_error(). */ void cf_lex_unwind(void) { struct include_file_stack *n; for (n = ifs; n != ifs_head; n = n->prev) { /* Memory is freed automatically */ if (n->buffer) yy_delete_buffer(n->buffer); if (n->fd) close(n->fd); } ifs = ifs_head; } static void cf_include(char *arg, int alen) { struct include_file_stack *base_ifs = ifs; int new_depth, rv, i; char *patt; glob_t g = {}; new_depth = ifs->depth + 1; if (new_depth > MAX_INCLUDE_DEPTH) cf_error("Max include depth reached"); /* expand arg to properly handle relative filenames */ if (*arg != '/') { int dlen = strlen(ifs->file_name); char *dir = alloca(dlen + 1); patt = alloca(dlen + alen + 2); memcpy(dir, ifs->file_name, dlen + 1); sprintf(patt, "%s/%s", dirname(dir), arg); } else patt = arg; /* Skip globbing if there are no wildcards, mainly to get proper response when the included config file is missing */ if (!strpbrk(arg, "?*[")) { ifs = push_ifs(ifs); ifs->file_name = cfg_strdup(patt); ifs->depth = new_depth; ifs->up = base_ifs; enter_ifs(ifs); return; } /* Expand the pattern */ rv = glob(patt, GLOB_ERR | GLOB_NOESCAPE, NULL, &g); if (rv == GLOB_ABORTED) cf_error("Unable to match pattern %s: %m", patt); if ((rv != 0) || (g.gl_pathc <= 0)) return; /* * Now we put all found files to ifs stack in reverse order, they * will be activated and processed in order as ifs stack is popped * by pop_ifs() and enter_ifs() in check_eof(). */ for(i = g.gl_pathc - 1; i >= 0; i--) { char *fname = g.gl_pathv[i]; struct stat fs; if (stat(fname, &fs) < 0) { globfree(&g); cf_error("Unable to stat included file %s: %m", fname); } if (fs.st_mode & S_IFDIR) continue; /* Prepare new stack item */ ifs = push_ifs(ifs); ifs->file_name = cfg_strdup(fname); ifs->depth = new_depth; ifs->up = base_ifs; } globfree(&g); enter_ifs(ifs); } static int check_eof(void) { if (ifs == ifs_head) { /* EOF in main config file */ ifs->lino = 1; /* Why this? */ return 1; } ifs = pop_ifs(ifs); enter_ifs(ifs); return 0; } static struct symbol * cf_new_sym(byte *c, uint h0) { uint h = h0 & (SYM_HASH_SIZE-1); struct symbol *s, **ht; int l; if (!new_config->sym_hash) new_config->sym_hash = cfg_allocz(SYM_HASH_SIZE * sizeof(struct keyword *)); ht = new_config->sym_hash; l = strlen(c); if (l > SYM_MAX_LEN) cf_error("Symbol too long"); s = cfg_alloc(sizeof(struct symbol) + l); s->next = ht[h]; ht[h] = s; s->scope = conf_this_scope; s->class = SYM_VOID; s->def = NULL; s->aux = 0; strcpy(s->name, c); return s; } static struct symbol * cf_find_sym(struct config *cfg, byte *c, uint h0) { uint h = h0 & (SYM_HASH_SIZE-1); struct symbol *s, **ht; if (ht = cfg->sym_hash) { for(s = ht[h]; s; s=s->next) if (!strcmp(s->name, c) && s->scope->active) return s; } if (ht = cfg->sym_fallback) { /* We know only top-level scope is active */ for(s = ht[h]; s; s=s->next) if (!strcmp(s->name, c) && s->scope->active) return s; } return NULL; } static inline struct symbol * cf_get_sym(byte *c, uint h0) { return cf_find_sym(new_config, c, h0) ?: cf_new_sym(c, h0); } /** * cf_find_symbol - find a symbol by name * @cfg: specificed config * @c: symbol name * * This functions searches the symbol table in the config @cfg for a symbol of * given name. First it examines the current scope, then the second recent one * and so on until it either finds the symbol and returns a pointer to its * &symbol structure or reaches the end of the scope chain and returns %NULL to * signify no match. */ struct symbol * cf_find_symbol(struct config *cfg, byte *c) { return cf_find_sym(cfg, c, cf_hash(c)); } /** * cf_get_symbol - get a symbol by name * @c: symbol name * * This functions searches the symbol table of the currently parsed config * (@new_config) for a symbol of given name. It returns either the already * existing symbol or a newly allocated undefined (%SYM_VOID) symbol if no * existing symbol is found. */ struct symbol * cf_get_symbol(byte *c) { return cf_get_sym(c, cf_hash(c)); } struct symbol * cf_default_name(char *template, int *counter) { char buf[SYM_MAX_LEN]; struct symbol *s; char *perc = strchr(template, '%'); for(;;) { bsprintf(buf, template, ++(*counter)); s = cf_get_sym(buf, cf_hash(buf)); if (s->class == SYM_VOID) return s; if (!perc) break; } cf_error("Unable to generate default name"); } /** * cf_define_symbol - define meaning of a symbol * @sym: symbol to be defined * @type: symbol class to assign * @def: class dependent data * * Defines new meaning of a symbol. If the symbol is an undefined * one (%SYM_VOID), it's just re-defined to the new type. If it's defined * in different scope, a new symbol in current scope is created and the * meaning is assigned to it. If it's already defined in the current scope, * an error is reported via cf_error(). * * Result: Pointer to the newly defined symbol. If we are in the top-level * scope, it's the same @sym as passed to the function. */ struct symbol * cf_define_symbol(struct symbol *sym, int type, void *def) { if (sym->class) { if (sym->scope == conf_this_scope) cf_error("Symbol already defined"); sym = cf_new_sym(sym->name, cf_hash(sym->name)); } sym->class = type; sym->def = def; return sym; } static void cf_lex_init_kh(void) { struct keyword *k; for(k=keyword_list; k->name; k++) { unsigned h = cf_hash(k->name) & (KW_HASH_SIZE-1); k->next = kw_hash[h]; kw_hash[h] = k; } kw_hash_inited = 1; } /** * cf_lex_init - initialize the lexer * @is_cli: true if we're going to parse CLI command, false for configuration * @c: configuration structure * * cf_lex_init() initializes the lexical analyzer and prepares it for * parsing of a new input. */ void cf_lex_init(int is_cli, struct config *c) { if (!kw_hash_inited) cf_lex_init_kh(); ifs_head = ifs = push_ifs(NULL); if (!is_cli) { ifs->file_name = c->file_name; ifs->fd = c->file_fd; ifs->depth = 1; } yyrestart(NULL); ifs->buffer = YY_CURRENT_BUFFER; if (is_cli) BEGIN(CLI); else BEGIN(INITIAL); conf_this_scope = cfg_allocz(sizeof(struct sym_scope)); conf_this_scope->active = 1; } /** * cf_push_scope - enter new scope * @sym: symbol representing scope name * * If we want to enter a new scope to process declarations inside * a nested block, we can just call cf_push_scope() to push a new * scope onto the scope stack which will cause all new symbols to be * defined in this scope and all existing symbols to be sought for * in all scopes stored on the stack. */ void cf_push_scope(struct symbol *sym) { struct sym_scope *s = cfg_alloc(sizeof(struct sym_scope)); s->next = conf_this_scope; conf_this_scope = s; s->active = 1; s->name = sym; } /** * cf_pop_scope - leave a scope * * cf_pop_scope() pops the topmost scope from the scope stack, * leaving all its symbols in the symbol table, but making them * invisible to the rest of the config. */ void cf_pop_scope(void) { conf_this_scope->active = 0; conf_this_scope = conf_this_scope->next; ASSERT(conf_this_scope); } struct symbol * cf_walk_symbols(struct config *cf, struct symbol *sym, int *pos) { for(;;) { if (!sym) { if (*pos >= SYM_HASH_SIZE) return NULL; sym = cf->sym_hash[(*pos)++]; } else sym = sym->next; if (sym && sym->scope->active) return sym; } } /** * cf_symbol_class_name - get name of a symbol class * @sym: symbol * * This function returns a string representing the class * of the given symbol. */ char * cf_symbol_class_name(struct symbol *sym) { if (cf_symbol_is_constant(sym)) return "constant"; switch (sym->class) { case SYM_VOID: return "undefined"; case SYM_PROTO: return "protocol"; case SYM_TEMPLATE: return "protocol template"; case SYM_FUNCTION: return "function"; case SYM_FILTER: return "filter"; case SYM_TABLE: return "routing table"; case SYM_ROA: return "ROA table"; default: return "unknown type"; } } /** * DOC: Parser * * Both the configuration and CLI commands are analyzed using a syntax * driven parser generated by the |bison| tool from a grammar which * is constructed from information gathered from grammar snippets by * the |gen_parser.m4| script. * * Grammar snippets are files (usually with extension |.Y|) contributed * by various BIRD modules in order to provide information about syntax of their * configuration and their CLI commands. Each snipped consists of several * sections, each of them starting with a special keyword: |CF_HDR| for * a list of |#include| directives needed by the C code, |CF_DEFINES| * for a list of C declarations, |CF_DECLS| for |bison| declarations * including keyword definitions specified as |CF_KEYWORDS|, |CF_GRAMMAR| * for the grammar rules, |CF_CODE| for auxiliary C code and finally * |CF_END| at the end of the snippet. * * To create references between the snippets, it's possible to define * multi-part rules by utilizing the |CF_ADDTO| macro which adds a new * alternative to a multi-part rule. * * CLI commands are defined using a |CF_CLI| macro. Its parameters are: * the list of keywords determining the command, the list of parameters, * help text for the parameters and help text for the command. * * Values of |enum| filter types can be defined using |CF_ENUM| with * the following parameters: name of filter type, prefix common for all * literals of this type and names of all the possible values. */ bird-1.6.3/conf/conf.c0000644000103200001440000003561713027054563013464 0ustar feelausers/* * BIRD Internet Routing Daemon -- Configuration File Handling * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Configuration manager * * Configuration of BIRD is complex, yet straightforward. There are three * modules taking care of the configuration: config manager (which takes care * of storage of the config information and controls switching between configs), * lexical analyzer and parser. * * The configuration manager stores each config as a &config structure * accompanied by a linear pool from which all information associated * with the config and pointed to by the &config structure is allocated. * * There can exist up to four different configurations at one time: an active * one (pointed to by @config), configuration we are just switching from * (@old_config), one queued for the next reconfiguration (@future_config; if * there is one and the user wants to reconfigure once again, we just free the * previous queued config and replace it with the new one) and finally a config * being parsed (@new_config). The stored @old_config is also used for undo * reconfiguration, which works in a similar way. Reconfiguration could also * have timeout (using @config_timer) and undo is automatically called if the * new configuration is not confirmed later. The new config (@new_config) and * associated linear pool (@cfg_mem) is non-NULL only during parsing. * * Loading of new configuration is very simple: just call config_alloc() to get * a new &config structure, then use config_parse() to parse a configuration * file and fill all fields of the structure and finally ask the config manager * to switch to the new config by calling config_commit(). * * CLI commands are parsed in a very similar way -- there is also a stripped-down * &config structure associated with them and they are lex-ed and parsed by the * same functions, only a special fake token is prepended before the command * text to make the parser recognize only the rules corresponding to CLI commands. */ #include #include #undef LOCAL_DEBUG #include "nest/bird.h" #include "nest/route.h" #include "nest/protocol.h" #include "nest/iface.h" #include "lib/resource.h" #include "lib/string.h" #include "lib/event.h" #include "lib/timer.h" #include "conf/conf.h" #include "filter/filter.h" static jmp_buf conf_jmpbuf; struct config *config, *new_config; static struct config *old_config; /* Old configuration */ static struct config *future_config; /* New config held here if recon requested during recon */ static int old_cftype; /* Type of transition old_config -> config (RECONFIG_SOFT/HARD) */ static int future_cftype; /* Type of scheduled transition, may also be RECONFIG_UNDO */ /* Note that when future_cftype is RECONFIG_UNDO, then future_config is NULL, therefore proper check for future scheduled config checks future_cftype */ static event *config_event; /* Event for finalizing reconfiguration */ static timer *config_timer; /* Timer for scheduled configuration rollback */ /* These are public just for cmd_show_status(), should not be accessed elsewhere */ int shutting_down; /* Shutdown requested, do not accept new config changes */ int configuring; /* Reconfiguration is running */ int undo_available; /* Undo was not requested from last reconfiguration */ /* Note that both shutting_down and undo_available are related to requests, not processing */ /** * config_alloc - allocate a new configuration * @name: name of the config * * This function creates new &config structure, attaches a resource * pool and a linear memory pool to it and makes it available for * further use. Returns a pointer to the structure. */ struct config * config_alloc(const byte *name) { pool *p = rp_new(&root_pool, "Config"); linpool *l = lp_new(p, 4080); struct config *c = lp_allocz(l, sizeof(struct config)); /* Duplication of name string in local linear pool */ uint nlen = strlen(name) + 1; char *ndup = lp_allocu(l, nlen); memcpy(ndup, name, nlen); c->mrtdump_file = -1; /* Hack, this should be sysdep-specific */ c->pool = p; c->mem = l; c->file_name = ndup; c->load_time = now; c->tf_route = c->tf_proto = (struct timeformat){"%T", "%F", 20*3600}; c->tf_base = c->tf_log = (struct timeformat){"%F %T", NULL, 0}; c->gr_wait = DEFAULT_GR_WAIT; return c; } /** * config_parse - parse a configuration * @c: configuration * * config_parse() reads input by calling a hook function pointed to * by @cf_read_hook and parses it according to the configuration * grammar. It also calls all the preconfig and postconfig hooks * before, resp. after parsing. * * Result: 1 if the config has been parsed successfully, 0 if any * error has occurred (such as anybody calling cf_error()) and * the @err_msg field has been set to the error message. */ int config_parse(struct config *c) { int done = 0; DBG("Parsing configuration file `%s'\n", c->file_name); new_config = c; cfg_mem = c->mem; if (setjmp(conf_jmpbuf)) goto cleanup; cf_lex_init(0, c); sysdep_preconfig(c); protos_preconfig(c); rt_preconfig(c); roa_preconfig(c); cf_parse(); protos_postconfig(c); if (EMPTY_LIST(c->protos)) cf_error("No protocol is specified in the config file"); #ifdef IPV6 if (!c->router_id) cf_error("Router ID must be configured manually on IPv6 routers"); #endif done = 1; cleanup: new_config = NULL; cfg_mem = NULL; return done; } /** * cli_parse - parse a CLI command * @c: temporary config structure * * cli_parse() is similar to config_parse(), but instead of a configuration, * it parses a CLI command. See the CLI module for more information. */ int cli_parse(struct config *c) { int done = 0; c->sym_fallback = config->sym_hash; new_config = c; cfg_mem = c->mem; if (setjmp(conf_jmpbuf)) goto cleanup; cf_lex_init(1, c); cf_parse(); done = 1; cleanup: c->sym_fallback = NULL; new_config = NULL; cfg_mem = NULL; return done; } /** * config_free - free a configuration * @c: configuration to be freed * * This function takes a &config structure and frees all resources * associated with it. */ void config_free(struct config *c) { if (c) rfree(c->pool); } void config_add_obstacle(struct config *c) { DBG("+++ adding obstacle %d\n", c->obstacle_count); c->obstacle_count++; } void config_del_obstacle(struct config *c) { DBG("+++ deleting obstacle %d\n", c->obstacle_count); c->obstacle_count--; if (!c->obstacle_count) ev_schedule(config_event); } static int global_commit(struct config *new, struct config *old) { if (!old) return 0; if (!ipa_equal(old->listen_bgp_addr, new->listen_bgp_addr) || (old->listen_bgp_port != new->listen_bgp_port) || (old->listen_bgp_flags != new->listen_bgp_flags)) log(L_WARN "Reconfiguration of BGP listening socket not implemented, please restart BIRD."); if (!new->router_id) { new->router_id = old->router_id; if (new->router_id_from) { u32 id = if_choose_router_id(new->router_id_from, old->router_id); if (!id) log(L_WARN "Cannot determine router ID, using old one"); else new->router_id = id; } } return 0; } static int config_do_commit(struct config *c, int type) { if (type == RECONFIG_UNDO) { c = old_config; type = old_cftype; } else config_free(old_config); old_config = config; old_cftype = type; config = c; configuring = 1; if (old_config && !config->shutdown) log(L_INFO "Reconfiguring"); if (old_config) old_config->obstacle_count++; DBG("sysdep_commit\n"); int force_restart = sysdep_commit(c, old_config); DBG("global_commit\n"); force_restart |= global_commit(c, old_config); DBG("rt_commit\n"); rt_commit(c, old_config); roa_commit(c, old_config); DBG("protos_commit\n"); protos_commit(c, old_config, force_restart, type); int obs = 0; if (old_config) obs = --old_config->obstacle_count; DBG("do_commit finished with %d obstacles remaining\n", obs); return !obs; } static void config_done(void *unused UNUSED) { if (config->shutdown) sysdep_shutdown_done(); configuring = 0; if (old_config) log(L_INFO "Reconfigured"); if (future_cftype) { int type = future_cftype; struct config *conf = future_config; future_cftype = RECONFIG_NONE; future_config = NULL; log(L_INFO "Reconfiguring to queued configuration"); if (config_do_commit(conf, type)) config_done(NULL); } } /** * config_commit - commit a configuration * @c: new configuration * @type: type of reconfiguration (RECONFIG_SOFT or RECONFIG_HARD) * @timeout: timeout for undo (or 0 for no timeout) * * When a configuration is parsed and prepared for use, the * config_commit() function starts the process of reconfiguration. * It checks whether there is already a reconfiguration in progress * in which case it just queues the new config for later processing. * Else it notifies all modules about the new configuration by calling * their commit() functions which can either accept it immediately * or call config_add_obstacle() to report that they need some time * to complete the reconfiguration. After all such obstacles are removed * using config_del_obstacle(), the old configuration is freed and * everything runs according to the new one. * * When @timeout is nonzero, the undo timer is activated with given * timeout. The timer is deactivated when config_commit(), * config_confirm() or config_undo() is called. * * Result: %CONF_DONE if the configuration has been accepted immediately, * %CONF_PROGRESS if it will take some time to switch to it, %CONF_QUEUED * if it's been queued due to another reconfiguration being in progress now * or %CONF_SHUTDOWN if BIRD is in shutdown mode and no new configurations * are accepted. */ int config_commit(struct config *c, int type, int timeout) { if (shutting_down) { config_free(c); return CONF_SHUTDOWN; } undo_available = 1; if (timeout > 0) tm_start(config_timer, timeout); else tm_stop(config_timer); if (configuring) { if (future_cftype) { log(L_INFO "Queueing new configuration, ignoring the one already queued"); config_free(future_config); } else log(L_INFO "Queueing new configuration"); future_cftype = type; future_config = c; return CONF_QUEUED; } if (config_do_commit(c, type)) { config_done(NULL); return CONF_DONE; } return CONF_PROGRESS; } /** * config_confirm - confirm a commited configuration * * When the undo timer is activated by config_commit() with nonzero timeout, * this function can be used to deactivate it and therefore confirm * the current configuration. * * Result: %CONF_CONFIRM when the current configuration is confirmed, * %CONF_NONE when there is nothing to confirm (i.e. undo timer is not active). */ int config_confirm(void) { if (config_timer->expires == 0) return CONF_NOTHING; tm_stop(config_timer); return CONF_CONFIRM; } /** * config_undo - undo a configuration * * Function config_undo() can be used to change the current * configuration back to stored %old_config. If no reconfiguration is * running, this stored configuration is commited in the same way as a * new configuration in config_commit(). If there is already a * reconfiguration in progress and no next reconfiguration is * scheduled, then the undo is scheduled for later processing as * usual, but if another reconfiguration is already scheduled, then * such reconfiguration is removed instead (i.e. undo is applied on * the last commit that scheduled it). * * Result: %CONF_DONE if the configuration has been accepted immediately, * %CONF_PROGRESS if it will take some time to switch to it, %CONF_QUEUED * if it's been queued due to another reconfiguration being in progress now, * %CONF_UNQUEUED if a scheduled reconfiguration is removed, %CONF_NOTHING * if there is no relevant configuration to undo (the previous config request * was config_undo() too) or %CONF_SHUTDOWN if BIRD is in shutdown mode and * no new configuration changes are accepted. */ int config_undo(void) { if (shutting_down) return CONF_SHUTDOWN; if (!undo_available || !old_config) return CONF_NOTHING; undo_available = 0; tm_stop(config_timer); if (configuring) { if (future_cftype) { config_free(future_config); future_config = NULL; log(L_INFO "Removing queued configuration"); future_cftype = RECONFIG_NONE; return CONF_UNQUEUED; } else { log(L_INFO "Queueing undo configuration"); future_cftype = RECONFIG_UNDO; return CONF_QUEUED; } } if (config_do_commit(NULL, RECONFIG_UNDO)) { config_done(NULL); return CONF_DONE; } return CONF_PROGRESS; } extern void cmd_reconfig_undo_notify(void); static void config_timeout(struct timer *t UNUSED) { log(L_INFO "Config timeout expired, starting undo"); cmd_reconfig_undo_notify(); int r = config_undo(); if (r < 0) log(L_ERR "Undo request failed"); } void config_init(void) { config_event = ev_new(&root_pool); config_event->hook = config_done; config_timer = tm_new(&root_pool); config_timer->hook = config_timeout; } /** * order_shutdown - order BIRD shutdown * * This function initiates shutdown of BIRD. It's accomplished by asking * for switching to an empty configuration. */ void order_shutdown(void) { struct config *c; if (shutting_down) return; log(L_INFO "Shutting down"); c = lp_alloc(config->mem, sizeof(struct config)); memcpy(c, config, sizeof(struct config)); init_list(&c->protos); init_list(&c->tables); c->shutdown = 1; config_commit(c, RECONFIG_HARD, 0); shutting_down = 1; } /** * cf_error - report a configuration error * @msg: printf-like format string * * cf_error() can be called during execution of config_parse(), that is * from the parser, a preconfig hook or a postconfig hook, to report an * error in the configuration. */ void cf_error(char *msg, ...) { char buf[1024]; va_list args; va_start(args, msg); if (bvsnprintf(buf, sizeof(buf), msg, args) < 0) strcpy(buf, ""); va_end(args); new_config->err_msg = cfg_strdup(buf); new_config->err_lino = ifs->lino; new_config->err_file_name = ifs->file_name; cf_lex_unwind(); longjmp(conf_jmpbuf, 1); } /** * cfg_strdup - copy a string to config memory * @c: string to copy * * cfg_strdup() creates a new copy of the string in the memory * pool associated with the configuration being currently parsed. * It's often used when a string literal occurs in the configuration * and we want to preserve it for further use. */ char * cfg_strdup(const char *c) { int l = strlen(c) + 1; char *z = cfg_allocu(l); memcpy(z, c, l); return z; } void cfg_copy_list(list *dest, list *src, unsigned node_size) { node *dn, *sn; init_list(dest); WALK_LIST(sn, *src) { dn = cfg_alloc(node_size); memcpy(dn, sn, node_size); add_tail(dest, dn); } } bird-1.6.3/conf/Makefile0000644000103200001440000000171613027054563014024 0ustar feelauserssource=cf-parse.tab.c cf-lex.c conf.c root-rel=../ include ../Rules conf-src=$(srcdir)/conf conf-fragments=$(conf-src)/confbase.Y @CONFS@ $(addsuffix /config.Y,$(static-dir-paths)) ifdef DEBUG BISON_DEBUG=-t #FLEX_DEBUG=-d endif cf-parse.tab.h: cf-parse.tab.c cf-parse.tab.c: cf-parse.y $(BISON) -bcf-parse -dv -pcf_ $(BISON_DEBUG) cf-parse.y cf-parse.y: $(conf-fragments) $(conf-src)/gen_parser.m4 $(M4) -P $(conf-src)/gen_parser.m4 $(conf-fragments) >cf-parse.y keywords.h: $(conf-fragments) $(conf-src)/gen_keywords.m4 $(M4) -P $(conf-src)/gen_keywords.m4 $(conf-fragments) >keywords.h commands.h: $(conf-fragments) $(conf-src)/gen_commands.m4 $(srcdir)/client/cmds.m4 $(M4) -P $(conf-src)/gen_commands.m4 $(srcdir)/client/cmds.m4 $(conf-fragments) | sort >commands.h cf-lex.c: cf-lex.l $(FLEX) $(FLEX_DEBUG) -s -B -8 -ocf-lex.c -Pcf_ cf-lex.l depend: keywords.h commands.h cf-parse.tab.c cf-lex.c cf-lex.o: CFLAGS+=-Wno-sign-compare -Wno-unused-function bird-1.6.3/Doc0000644000103200001440000000006413027054563012062 0ustar feelausersC doc C nest C conf C filter C proto C sysdep C lib bird-1.6.3/client/0000755000103200001440000000000013027054563012710 5ustar feelausersbird-1.6.3/client/client.c0000644000103200001440000001776513027054563014352 0ustar feelausers/* * BIRD Client * * (c) 1999--2004 Martin Mares * (c) 2013 Tomas Hlavacek * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: BIRD client * * There are two variants of BIRD client: regular and light. regular * variant depends on readline and ncurses libraries, while light * variant uses just libc. Most of the code and the main() is common * for both variants (in client.c file) and just a few functions are * different (in birdc.c for regular and birdcl.c for light). Two * binaries are generated by linking common object files like client.o * (which is compiled from client.c just once) with either birdc.o or * birdcl.o for each variant. */ #include #include #include #include #include #include #include #include #include "nest/bird.h" #include "lib/resource.h" #include "lib/string.h" #include "client/client.h" #include "sysdep/unix/unix.h" #define SERVER_READ_BUF_LEN 4096 static char *opt_list = "s:vrl"; static int verbose, restricted, once; static char *init_cmd; static char *server_path = PATH_CONTROL_SOCKET; static int server_fd; static byte server_read_buf[SERVER_READ_BUF_LEN]; static byte *server_read_pos = server_read_buf; int init = 1; /* During intial sequence */ int busy = 1; /* Executing BIRD command */ int interactive; /* Whether stdin is terminal */ static int num_lines, skip_input; int term_lns, term_cls; /*** Parsing of arguments ***/ static void usage(char *name) { fprintf(stderr, "Usage: %s [-s ] [-v] [-r] [-l]\n", name); exit(1); } static void parse_args(int argc, char **argv) { int server_changed = 0; int c; while ((c = getopt(argc, argv, opt_list)) >= 0) switch (c) { case 's': server_path = optarg; server_changed = 1; break; case 'v': verbose++; break; case 'r': restricted = 1; break; case 'l': if (!server_changed) server_path = xbasename(server_path); break; default: usage(argv[0]); } /* If some arguments are not options, we take it as commands */ if (optind < argc) { char *tmp; int i; int len = 0; for (i = optind; i < argc; i++) len += strlen(argv[i]) + 1; tmp = init_cmd = malloc(len); for (i = optind; i < argc; i++) { strcpy(tmp, argv[i]); tmp += strlen(tmp); *tmp++ = ' '; } tmp[-1] = 0; once = 1; interactive = 0; } } /*** Input ***/ static void server_send(char *cmd); static int handle_internal_command(char *cmd) { if (!strncmp(cmd, "exit", 4) || !strncmp(cmd, "quit", 4)) { cleanup(); exit(0); } if (!strncmp(cmd, "help", 4)) { puts("Press `?' for context sensitive help."); return 1; } return 0; } static void submit_server_command(char *cmd) { busy = 1; num_lines = 2; server_send(cmd); } static inline void submit_init_command(char *cmd_raw) { char *cmd = cmd_expand(cmd_raw); if (!cmd) { cleanup(); exit(0); } submit_server_command(cmd); free(cmd); } void submit_command(char *cmd_raw) { char *cmd = cmd_expand(cmd_raw); if (!cmd) return; if (!handle_internal_command(cmd)) submit_server_command(cmd); free(cmd); } static void init_commands(void) { if (restricted) { submit_server_command("restrict"); restricted = 0; return; } if (init_cmd) { /* First transition - client received hello from BIRD and there is waiting initial command */ submit_init_command(init_cmd); init_cmd = NULL; return; } if (once) { /* Initial command is finished and we want to exit */ cleanup(); exit(0); } input_init(); term_lns = (term_lns > 0) ? term_lns : 25; term_cls = (term_cls > 0) ? term_cls : 80; init = 0; } /*** Output ***/ void more(void) { more_begin(); printf("--More--\015"); fflush(stdout); redo: switch (getchar()) { case ' ': num_lines = 2; break; case '\n': case '\r': num_lines--; break; case 'q': skip_input = 1; break; default: goto redo; } printf(" \015"); fflush(stdout); more_end(); } /*** Communication with server ***/ static void server_connect(void) { struct sockaddr_un sa; server_fd = socket(AF_UNIX, SOCK_STREAM, 0); if (server_fd < 0) DIE("Cannot create socket"); if (strlen(server_path) >= sizeof(sa.sun_path)) die("server_connect: path too long"); bzero(&sa, sizeof(sa)); sa.sun_family = AF_UNIX; strcpy(sa.sun_path, server_path); if (connect(server_fd, (struct sockaddr *) &sa, SUN_LEN(&sa)) < 0) DIE("Unable to connect to server control socket (%s)", server_path); if (fcntl(server_fd, F_SETFL, O_NONBLOCK) < 0) DIE("fcntl"); } #define PRINTF(LEN, PARGS...) do { if (!skip_input) len = printf(PARGS); } while(0) static void server_got_reply(char *x) { int code; int len = 0; if (*x == '+') /* Async reply */ PRINTF(len, ">>> %s\n", x+1); else if (x[0] == ' ') /* Continuation */ PRINTF(len, "%s%s\n", verbose ? " " : "", x+1); else if (strlen(x) > 4 && sscanf(x, "%d", &code) == 1 && code >= 0 && code < 10000 && (x[4] == ' ' || x[4] == '-')) { if (code) PRINTF(len, "%s\n", verbose ? x : x+5); if (x[4] == ' ') { busy = 0; skip_input = 0; return; } } else PRINTF(len, "??? <%s>\n", x); if (interactive && busy && !skip_input && !init && (len > 0)) { num_lines += (len + term_cls - 1) / term_cls; /* Divide and round up */ if (num_lines >= term_lns) more(); } } static void server_read(void) { int c; byte *start, *p; redo: c = read(server_fd, server_read_pos, server_read_buf + sizeof(server_read_buf) - server_read_pos); if (!c) die("Connection closed by server"); if (c < 0) { if (errno == EINTR) goto redo; else DIE("Server read error"); } start = server_read_buf; p = server_read_pos; server_read_pos += c; while (p < server_read_pos) if (*p++ == '\n') { p[-1] = 0; server_got_reply(start); start = p; } if (start != server_read_buf) { int l = server_read_pos - start; memmove(server_read_buf, start, l); server_read_pos = server_read_buf + l; } else if (server_read_pos == server_read_buf + sizeof(server_read_buf)) { strcpy(server_read_buf, "?"); server_read_pos = server_read_buf + 11; } } static void select_loop(void) { int rv; while (1) { if (init && !busy) init_commands(); if (!init) input_notify(!busy); fd_set select_fds; FD_ZERO(&select_fds); FD_SET(server_fd, &select_fds); if (!busy) FD_SET(0, &select_fds); rv = select(server_fd+1, &select_fds, NULL, NULL, NULL); if (rv < 0) { if (errno == EINTR) continue; else DIE("select"); } if (FD_ISSET(0, &select_fds)) { input_read(); continue; } if (FD_ISSET(server_fd, &select_fds)) { server_read(); continue; } } } static void wait_for_write(int fd) { while (1) { int rv; fd_set set; FD_ZERO(&set); FD_SET(fd, &set); rv = select(fd+1, NULL, &set, NULL, NULL); if (rv < 0) { if (errno == EINTR) continue; else DIE("select"); } if (FD_ISSET(server_fd, &set)) return; } } static void server_send(char *cmd) { int l = strlen(cmd); byte *z = alloca(l + 1); memcpy(z, cmd, l); z[l++] = '\n'; while (l) { int cnt = write(server_fd, z, l); if (cnt < 0) { if (errno == EAGAIN) wait_for_write(server_fd); else if (errno == EINTR) continue; else DIE("Server write error"); } else { l -= cnt; z += cnt; } } } int main(int argc, char **argv) { interactive = isatty(0); parse_args(argc, argv); cmd_build_tree(); server_connect(); select_loop(); return 0; } bird-1.6.3/client/client.h0000644000103200001440000000136613027054563014345 0ustar feelausers/* * BIRD Client * * (c) 1999--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ extern int init, busy, interactive; extern int term_lns, term_cls; /* birdc.c / birdcl.c */ void input_start_list(void); void input_stop_list(void); void input_init(void); void input_notify(int prompt); void input_read(void); void more_begin(void); void more_end(void); void cleanup(void); /* commands.c */ void cmd_build_tree(void); void cmd_help(char *cmd, int len); int cmd_complete(char *cmd, int len, char *buf, int again); char *cmd_expand(char *cmd); /* client.c */ void submit_command(char *cmd_raw); /* die() with system error messages */ #define DIE(x, y...) die(x ": %s", ##y, strerror(errno)) bird-1.6.3/client/Doc0000644000103200001440000000003713027054563013340 0ustar feelausersH Client S client.c commands.c bird-1.6.3/client/util.c0000644000103200001440000000174413027054563014037 0ustar feelausers/* * BIRD Client -- Utility Functions * * (c) 1999--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include #include #include "nest/bird.h" #include "lib/string.h" #include "client/client.h" /* Client versions of logging functions */ static void vlog(const char *msg, va_list args) { char buf[1024]; int n = vsnprintf(buf, sizeof(buf), msg, args); if (n < 0) snprintf(buf, sizeof(buf), "???"); else if (n >= (int) sizeof(buf)) snprintf(buf + sizeof(buf) - 100, 100, " ... "); fputs(buf, stderr); fputc('\n', stderr); } void bug(const char *msg, ...) { va_list args; va_start(args, msg); cleanup(); fputs("Internal error: ", stderr); vlog(msg, args); vfprintf(stderr, msg, args); va_end(args); exit(1); } void die(const char *msg, ...) { va_list args; va_start(args, msg); cleanup(); vlog(msg, args); va_end(args); exit(1); } bird-1.6.3/client/cmds.m40000644000103200001440000000045113027054563014100 0ustar feelausers# # BIRD -- Internal Commands Of The Client # # (c) 2000 Martin Mares # # Can be freely distributed and used under the terms of the GNU GPL. # CF_CLI(QUIT,,, [[Quit the client]]) CF_CLI(EXIT,,, [[Exit the client]]) CF_CLI(HELP,,, [[Description of the help system]]) bird-1.6.3/client/commands.c0000644000103200001440000001353713027054563014666 0ustar feelausers/* * BIRD Client -- Command Handling * * (c) 1999--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include #include #include "nest/bird.h" #include "lib/resource.h" #include "lib/string.h" #include "client/client.h" struct cmd_info { char *command; char *args; char *help; int is_real_cmd; }; static struct cmd_info command_table[] = { #include "conf/commands.h" }; struct cmd_node { struct cmd_node *sibling, *son, **plastson; struct cmd_info *cmd, *help; int len; signed char prio; char token[1]; }; static struct cmd_node cmd_root; void cmd_build_tree(void) { uint i; cmd_root.plastson = &cmd_root.son; for(i=0; icommand; old = &cmd_root; while (*c) { char *d = c; while (*c && !isspace(*c)) c++; for(new=old->son; new; new=new->sibling) if (new->len == c-d && !memcmp(new->token, d, c-d)) break; if (!new) { int size = sizeof(struct cmd_node) + c-d; new = malloc(size); bzero(new, size); *old->plastson = new; old->plastson = &new->sibling; new->plastson = &new->son; new->len = c-d; memcpy(new->token, d, c-d); new->prio = (new->len == 3 && (!memcmp(new->token, "roa", 3) || !memcmp(new->token, "rip", 3))) ? 0 : 1; /* Hack */ } old = new; while (isspace(*c)) c++; } if (cmd->is_real_cmd) old->cmd = cmd; else old->help = cmd; } } static void cmd_do_display_help(struct cmd_info *c) { char buf[strlen(c->command) + strlen(c->args) + 4]; sprintf(buf, "%s %s", c->command, c->args); printf("%-45s %s\n", buf, c->help); } static void cmd_display_help(struct cmd_info *c1, struct cmd_info *c2) { if (c1) cmd_do_display_help(c1); else if (c2) cmd_do_display_help(c2); } static struct cmd_node * cmd_find_abbrev(struct cmd_node *root, char *cmd, int len, int *pambiguous) { struct cmd_node *m, *best = NULL, *best2 = NULL; *pambiguous = 0; for(m=root->son; m; m=m->sibling) { if (m->len == len && !memcmp(m->token, cmd, len)) return m; if (m->len > len && !memcmp(m->token, cmd, len)) { if (best && best->prio > m->prio) continue; if (best && best->prio == m->prio) best2 = best; best = m; } } if (best2) { *pambiguous = 1; return NULL; } return best; } static void cmd_list_ambiguous(struct cmd_node *root, char *cmd, int len) { struct cmd_node *m; for(m=root->son; m; m=m->sibling) if (m->len > len && !memcmp(m->token, cmd, len)) cmd_display_help(m->help, m->cmd); } void cmd_help(char *cmd, int len) { char *end = cmd + len; struct cmd_node *n, *m; char *z; int ambig; n = &cmd_root; while (cmd < end) { if (isspace(*cmd)) { cmd++; continue; } z = cmd; while (cmd < end && !isspace(*cmd)) cmd++; m = cmd_find_abbrev(n, z, cmd-z, &ambig); if (ambig) { cmd_list_ambiguous(n, z, cmd-z); return; } if (!m) break; n = m; } cmd_display_help(n->cmd, NULL); for (m=n->son; m; m=m->sibling) cmd_display_help(m->help, m->cmd); } static int cmd_find_common_match(struct cmd_node *root, char *cmd, int len, int *pcount, char *buf) { struct cmd_node *m; int best, best_prio, i; *pcount = 0; best = -1; best_prio = -1; for(m=root->son; m; m=m->sibling) { if (m->len < len || memcmp(m->token, cmd, len)) continue; if (best_prio > m->prio) continue; if (best_prio < m->prio) { *pcount = 0; best = -1; } (*pcount)++; if (best < 0) { strcpy(buf, m->token + len); best = m->len - len; best_prio = m->prio; } else { i = 0; while (i < best && i < m->len - len && buf[i] == m->token[len+i]) i++; best = i; } } return best; } int cmd_complete(char *cmd, int len, char *buf, int again) { char *start = cmd; char *end = cmd + len; char *fin; struct cmd_node *n, *m; char *z; int ambig, cnt = 0, common; /* Find the last word we want to complete */ for(fin=end; fin > start && !isspace(fin[-1]); fin--) ; /* Find the context */ n = &cmd_root; while (cmd < fin && n->son) { if (isspace(*cmd)) { cmd++; continue; } z = cmd; while (cmd < fin && !isspace(*cmd)) cmd++; m = cmd_find_abbrev(n, z, cmd-z, &ambig); if (ambig) { if (!again) return -1; input_start_list(); cmd_list_ambiguous(n, z, cmd-z); input_stop_list(); return 0; } if (!m) return -1; n = m; } /* Completion of parameters is not yet supported */ if (!n->son) return -1; /* We know the context, let's try to complete */ common = cmd_find_common_match(n, fin, end-fin, &cnt, buf); if (!cnt) return -1; if (cnt == 1) { buf[common++] = ' '; buf[common] = 0; return 1; } if (common > 0) { buf[common] = 0; return 1; } if (!again) return -1; input_start_list(); cmd_list_ambiguous(n, fin, end-fin); input_stop_list(); return 0; } char * cmd_expand(char *cmd) { struct cmd_node *n, *m; char *c, *b, *args; int ambig; args = c = cmd; n = &cmd_root; while (*c) { if (isspace(*c)) { c++; continue; } b = c; while (*c && !isspace(*c)) c++; m = cmd_find_abbrev(n, b, c-b, &ambig); if (!m) { if (!ambig) break; puts("Ambiguous command, possible expansions are:"); cmd_list_ambiguous(n, b, c-b); return NULL; } args = c; n = m; } if (!n->cmd) { puts("No such command. Press `?' for help."); return NULL; } b = malloc(strlen(n->cmd->command) + strlen(args) + 1); sprintf(b, "%s%s", n->cmd->command, args); return b; } bird-1.6.3/client/birdcl.c0000644000103200001440000000461513027054563014321 0ustar feelausers/* * BIRD Client - Light variant I/O * * (c) 1999--2004 Martin Mares * (c) 2013 Tomas Hlavacek * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include #include #include #include #include #include #include "nest/bird.h" #include "lib/resource.h" #include "lib/string.h" #include "client/client.h" #include "sysdep/unix/unix.h" #define INPUT_BUF_LEN 2048 struct termios tty_save; void input_start_list(void) { /* Empty in non-ncurses version. */ } void input_stop_list(void) { /* Empty in non-ncurses version. */ } void input_notify(int prompt) { /* No ncurses -> no status to reveal/hide, print prompt manually. */ if (!prompt) return; printf("bird> "); fflush(stdout); } static int lastnb(char *str, int i) { while (i--) if ((str[i] != ' ') && (str[i] != '\t')) return str[i]; return 0; } void input_read(void) { char buf[INPUT_BUF_LEN]; if ((fgets(buf, INPUT_BUF_LEN, stdin) == NULL) || (buf[0] == 0)) { putchar('\n'); cleanup(); exit(0); } int l = strlen(buf); if ((l+1) == INPUT_BUF_LEN) { printf("Input too long.\n"); return; } if (buf[l-1] == '\n') buf[--l] = '\0'; if (!interactive) printf("%s\n", buf); if (l == 0) return; if (lastnb(buf, l) == '?') { cmd_help(buf, strlen(buf)); return; } submit_command(buf); } static struct termios stored_tty; static int more_active = 0; void more_begin(void) { static struct termios tty; tty = stored_tty; tty.c_lflag &= (~ECHO); tty.c_lflag &= (~ICANON); if (tcsetattr (0, TCSANOW, &tty) < 0) DIE("tcsetattr"); more_active = 1; } void more_end(void) { more_active = 0; if (tcsetattr (0, TCSANOW, &stored_tty) < 0) DIE("tcsetattr"); } static void sig_handler(int signal UNUSED) { cleanup(); exit(0); } void input_init(void) { if (!interactive) return; if (tcgetattr(0, &stored_tty) < 0) DIE("tcgetattr"); if (signal(SIGINT, sig_handler) == SIG_IGN) signal(SIGINT, SIG_IGN); if (signal(SIGTERM, sig_handler) == SIG_IGN) signal(SIGTERM, SIG_IGN); struct winsize tws; if (ioctl(0, TIOCGWINSZ, &tws) == 0) { term_lns = tws.ws_row; term_cls = tws.ws_col; } } void cleanup(void) { if (more_active) more_end(); } bird-1.6.3/client/Makefile0000644000103200001440000000030613027054563014347 0ustar feelauserssource=commands.c util.c client.c root-rel=../ dir-name=client clients := $(client) birdcl source-dep := $(source) $(addsuffix .c,$(clients)) subdir: $(addsuffix .o,$(clients)) include ../Rules bird-1.6.3/client/birdc.c0000644000103200001440000000735513027054563014151 0ustar feelausers/* * BIRD Client - Readline variant I/O * * (c) 1999--2004 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include #include #include #include #include #include #include "nest/bird.h" #include "lib/resource.h" #include "lib/string.h" #include "client/client.h" static int input_hidden_end; static int prompt_active; /*** Input ***/ /* HACK: libreadline internals we need to access */ extern int _rl_vis_botlin; extern void _rl_move_vert(int); static void add_history_dedup(char *cmd) { /* Add history line if it differs from the last one */ HIST_ENTRY *he = history_get(history_length); if (!he || strcmp(he->line, cmd)) add_history(cmd); } static void input_got_line(char *cmd_buffer) { if (!cmd_buffer) { cleanup(); exit(0); } if (cmd_buffer[0]) { add_history_dedup(cmd_buffer); submit_command(cmd_buffer); } free(cmd_buffer); } void input_start_list(void) { /* Leave the currently edited line and make space for listing */ _rl_move_vert(_rl_vis_botlin); #ifdef HAVE_RL_CRLF rl_crlf(); #endif } void input_stop_list(void) { /* Reprint the currently edited line after listing */ rl_on_new_line(); rl_redisplay(); } static int input_complete(int arg UNUSED, int key UNUSED) { static int complete_flag; char buf[256]; if (rl_last_func != input_complete) complete_flag = 0; switch (cmd_complete(rl_line_buffer, rl_point, buf, complete_flag)) { case 0: complete_flag = 1; break; case 1: rl_insert_text(buf); break; default: complete_flag = 1; #ifdef HAVE_RL_DING rl_ding(); #endif } return 0; } static int input_help(int arg, int key UNUSED) { int i, in_string, in_bracket; if (arg != 1) return rl_insert(arg, '?'); in_string = in_bracket = 0; for (i = 0; i < rl_point; i++) { if (rl_line_buffer[i] == '"') in_string = ! in_string; else if (! in_string) { if (rl_line_buffer[i] == '[') in_bracket++; else if (rl_line_buffer[i] == ']') in_bracket--; } } /* `?' inside string or path -> insert */ if (in_string || in_bracket) return rl_insert(1, '?'); rl_begin_undo_group(); /* HACK: We want to display `?' at point position */ rl_insert_text("?"); rl_redisplay(); rl_end_undo_group(); input_start_list(); cmd_help(rl_line_buffer, rl_point); rl_undo_command(1, 0); input_stop_list(); return 0; } void input_init(void) { rl_readline_name = "birdc"; rl_add_defun("bird-complete", input_complete, '\t'); rl_add_defun("bird-help", input_help, '?'); rl_callback_handler_install("bird> ", input_got_line); // rl_get_screen_size(); term_lns = LINES; term_cls = COLS; prompt_active = 1; // readline library does strange things when stdin is nonblocking. // if (fcntl(0, F_SETFL, O_NONBLOCK) < 0) // DIE("fcntl"); } static void input_reveal(void) { /* need this, otherwise some lib seems to eat pending output when the prompt is displayed */ fflush(stdout); tcdrain(STDOUT_FILENO); rl_end = input_hidden_end; rl_expand_prompt("bird> "); rl_forced_update_display(); prompt_active = 1; } static void input_hide(void) { input_hidden_end = rl_end; rl_end = 0; rl_expand_prompt(""); rl_redisplay(); prompt_active = 0; } void input_notify(int prompt) { if (prompt == prompt_active) return; if (prompt) input_reveal(); else input_hide(); } void input_read(void) { rl_callback_read_char(); } void more_begin(void) { } void more_end(void) { } void cleanup(void) { if (init) return; input_hide(); rl_callback_handler_remove(); } bird-1.6.3/configure.in0000644000103200001440000002405613027054563013752 0ustar feelausersdnl ** This is a configure script template for BIRD dnl ** Process it with autoconf to get ./configure dnl ** (c) 1999--2000 Martin Mares AC_REVISION($Id$) AC_INIT(conf/confbase.Y) AC_CONFIG_AUX_DIR(tools) AC_ARG_ENABLE(debug, [ --enable-debug enable internal debugging routines (default: disabled)],,enable_debug=no) AC_ARG_ENABLE(memcheck, [ --enable-memcheck check memory allocations when debugging (default: enabled)],,enable_memcheck=yes) AC_ARG_ENABLE(client, [ --enable-client enable building of BIRD client (default: enabled)],,enable_client=yes) AC_ARG_ENABLE(ipv6, [ --enable-ipv6 enable building of IPv6 version (default: disabled)],,enable_ipv6=no) AC_ARG_ENABLE(pthreads, [ --enable-pthreads enable POSIX threads support (default: detect)],,enable_pthreads=try) AC_ARG_WITH(suffix, [ --with-suffix=STRING use specified suffix for BIRD files (default: 6 for IPv6 version)],[given_suffix="yes"]) AC_ARG_WITH(sysconfig, [ --with-sysconfig=FILE use specified BIRD system configuration file]) AC_ARG_WITH(protocols, [ --with-protocols=LIST include specified routing protocols (default: all)],,[with_protocols="all"]) AC_ARG_WITH(sysinclude, [ --with-sysinclude=PATH search for system includes on specified place]) AC_ARG_WITH(runtimedir, [ --with-runtimedir=PATH path for runtime files (default: $(localstatedir)/run)],[runtimedir="$with_runtimedir"],[runtimedir="\$(localstatedir)/run"]) AC_ARG_WITH(iproutedir, [ --with-iproutedir=PATH path to iproute2 config files (default: /etc/iproute2)],[given_iproutedir="yes"]) AC_ARG_VAR([FLEX], [location of the Flex program]) AC_ARG_VAR([BISON], [location of the Bison program]) AC_ARG_VAR([M4], [location of the M4 program]) if test "$srcdir" = . ; then # Building in current directory => create obj directory holding all objects objdir=obj mkdir -p obj srcdir_rel=.. makefiles="Makefile:tools/Makefile-top.in obj/Makefile:tools/Makefile.in obj/Rules:tools/Rules.in" exedir=.. else # Building in separate directory objdir=. srcdir_rel=$srcdir makefiles="Makefile:tools/Makefile.in Rules:tools/Rules.in" exedir=. fi case $srcdir_rel in /*) srcdir_rel_mf=$srcdir_rel ;; *) srcdir_rel_mf="\$(root-rel)$srcdir_rel" ;; esac AC_SUBST(objdir) AC_SUBST(exedir) AC_SUBST(srcdir_rel_mf) AC_SUBST(runtimedir) if test "$enable_ipv6" = yes ; then ip=ipv6 SUFFIX=6 proto_radv=radv else ip=ipv4 SUFFIX="" fi if test "$given_suffix" = yes ; then SUFFIX="$with_suffix" fi AC_SUBST(SUFFIX) if test "$enable_debug" = yes ; then CONFIG_FILE="bird$SUFFIX.conf" CONTROL_SOCKET="bird$SUFFIX.ctl" else CONFIG_FILE="\$(sysconfdir)/bird$SUFFIX.conf" CONTROL_SOCKET="$runtimedir/bird$SUFFIX.ctl" fi AC_SUBST(CONFIG_FILE) AC_SUBST(CONTROL_SOCKET) AC_SEARCH_LIBS(clock_gettime, [c rt posix4], , AC_MSG_ERROR([[Function clock_gettime not available.]])) AC_CANONICAL_HOST # Store this value because ac_test_CFLAGS is overwritten by AC_PROG_CC if test "$ac_test_CFLAGS" != set ; then bird_cflags_default=yes fi AC_PROG_CC if test -z "$GCC" ; then AC_MSG_ERROR([This program requires the GNU C Compiler.]) fi # Enable threads by default just in Linux and FreeBSD #if test "$enable_pthreads" = try ; then # case "$host_os" in # (linux* | freebsd* | openbsd* | netbsd* ) enable_pthreads=try ;; # (*) enable_pthreads=no ;; # esac #fi if test "$enable_pthreads" != no ; then BIRD_CHECK_PTHREADS if test "$bird_cv_lib_pthreads" = yes ; then AC_DEFINE(USE_PTHREADS) CFLAGS="$CFLAGS -pthread" LDFLAGS="$LDFLAGS -pthread" proto_bfd=bfd elif test "$enable_pthreads" = yes ; then AC_MSG_ERROR([POSIX threads not available.]) fi if test "$enable_pthreads" = try ; then enable_pthreads="$bird_cv_lib_pthreads" fi fi if test "$bird_cflags_default" = yes ; then BIRD_CHECK_GCC_OPTION(bird_cv_c_option_wno_pointer_sign, -Wno-pointer-sign, -Wall) BIRD_CHECK_GCC_OPTION(bird_cv_c_option_wno_missing_init, -Wno-missing-field-initializers, -Wall -Wextra) BIRD_CHECK_GCC_OPTION(bird_cv_c_option_fno_strict_aliasing, -fno-strict-aliasing) BIRD_CHECK_GCC_OPTION(bird_cv_c_option_fno_strict_overflow, -fno-strict-overflow) CFLAGS="$CFLAGS -Wall -Wextra -Wstrict-prototypes -Wno-parentheses" BIRD_ADD_GCC_OPTION(bird_cv_c_option_wno_pointer_sign, -Wno-pointer-sign) BIRD_ADD_GCC_OPTION(bird_cv_c_option_wno_missing_init, -Wno-missing-field-initializers) BIRD_ADD_GCC_OPTION(bird_cv_c_option_fno_strict_aliasing, -fno-strict-aliasing) BIRD_ADD_GCC_OPTION(bird_cv_c_option_fno_strict_overflow, -fno-strict-overflow) fi AC_MSG_CHECKING([CFLAGS]) AC_MSG_RESULT($CFLAGS) AC_PROG_CPP AC_PROG_INSTALL AC_PROG_RANLIB AC_CHECK_PROG(FLEX, flex, flex) AC_CHECK_PROG(BISON, bison, bison) AC_CHECK_PROGS(M4, gm4 m4) test -z "$FLEX" && AC_MSG_ERROR([Flex is missing.]) test -z "$BISON" && AC_MSG_ERROR([Bison is missing.]) test -z "$M4" && AC_MSG_ERROR([M4 is missing.]) BIRD_CHECK_PROG_FLAVOR_GNU([$M4], , [AC_MSG_ERROR([Provided M4 is not GNU M4.])]) if test -n "$with_sysconfig" -a "$with_sysconfig" != no ; then if test -f $with_sysconfig ; then sysdesc=$with_sysconfig else sysdesc=$srcdir/sysdep/cf/$with_sysconfig if ! test -f $sysdesc ; then sysdesc=$sysdesc.h fi fi elif test -f sysconfig.h ; then sysdesc=sysconfig else case "$ip:$host_os" in ipv6:linux*) sysdesc=linux-v6 default_iproutedir="/etc/iproute2" ;; ipv4:linux*) sysdesc=linux default_iproutedir="/etc/iproute2" ;; ipv6:netbsd*) sysdesc=bsd-v6 CPPFLAGS="$CPPFLAGS -I/usr/pkg/include" LDFLAGS="$LDFLAGS -L/usr/pkg/lib -R/usr/pkg/lib" ;; ipv4:netbsd*) sysdesc=bsd CPPFLAGS="$CPPFLAGS -I/usr/pkg/include" LDFLAGS="$LDFLAGS -L/usr/pkg/lib -R/usr/pkg/lib" ;; ipv6:freebsd*) sysdesc=bsd-v6 ;; ipv4:freebsd*) sysdesc=bsd ;; ipv6:dragonfly*) sysdesc=bsd-v6 ;; ipv4:dragonfly*) sysdesc=bsd ;; ipv6:kfreebsd*) sysdesc=bsd-v6 ;; ipv4:kfreebsd*) sysdesc=bsd ;; ipv6:openbsd*) sysdesc=bsd-v6 ;; ipv4:openbsd*) sysdesc=bsd ;; *) AC_MSG_ERROR([Cannot determine correct system configuration. Please use --with-sysconfig to set it manually.]) ;; esac sysdesc=$srcdir/sysdep/cf/$sysdesc.h fi AC_MSG_CHECKING([which OS configuration should we use]) AC_MSG_RESULT($sysdesc) if ! test -f $sysdesc ; then AC_MSG_ERROR([The system configuration file is missing.]) fi sysname=`echo $sysdesc | sed 's/\.h$//'` AC_DEFINE_UNQUOTED(SYSCONF_INCLUDE, "$sysdesc") AC_MSG_CHECKING([system-dependent directories]) sysdep_dirs="`sed <$sysdesc '/^Link: /!d;s/^Link: \(.*\)$/\1/' | tr '\012' ' '` lib" AC_MSG_RESULT($sysdep_dirs) AC_SUBST(sysdep_dirs) if test "$with_iproutedir" = no ; then with_iproutedir= ; fi if test -n "$given_iproutedir" then iproutedir=$with_iproutedir else iproutedir=$default_iproutedir fi AC_SUBST(iproutedir) all_protocols="$proto_bfd bgp ospf pipe $proto_radv rip static" if test "$ip" = ipv6 ; then all_protocols="$all_protocols babel" fi all_protocols=`echo $all_protocols | sed 's/ /,/g'` if test "$with_protocols" = all ; then with_protocols="$all_protocols" fi AC_MSG_CHECKING([protocols]) protocols=`echo "$with_protocols" | sed 's/,/ /g'` if test "$protocols" = no ; then protocols= ; fi for a in $protocols ; do if ! test -f $srcdir/proto/$a/Makefile ; then AC_MSG_RESULT(failed) AC_MSG_ERROR([Requested protocol $a not found.]) fi AC_DEFINE_UNQUOTED(CONFIG_`echo $a | tr 'a-z' 'A-Z'`) done AC_MSG_RESULT(ok) AC_SUBST(protocols) case $sysdesc in */linux*|*/linux-v6*) AC_CHECK_HEADER(linux/rtnetlink.h,,[AC_MSG_ERROR([Appropriate version of Linux kernel headers not found.])],[ #include #include ]) ;; esac AC_CHECK_HEADER(syslog.h, [AC_DEFINE(HAVE_SYSLOG)]) AC_CHECK_HEADER(alloca.h, [AC_DEFINE(HAVE_ALLOCA_H)]) AC_MSG_CHECKING(whether 'struct sockaddr' has sa_len) AC_TRY_COMPILE([#include #include ], [static struct sockaddr sa; int i = sizeof(sa.sa_len);], [AC_MSG_RESULT(yes) AC_DEFINE(HAVE_SIN_LEN,,sin_len)], AC_MSG_RESULT(no)) AC_C_BIGENDIAN([AC_DEFINE(CPU_BIG_ENDIAN)], [AC_DEFINE(CPU_LITTLE_ENDIAN)], [AC_MSG_ERROR([Cannot determine CPU endianity.])]) BIRD_CHECK_INTEGERS BIRD_CHECK_STRUCT_ALIGN BIRD_CHECK_TIME_T BIRD_CHECK_STRUCT_IP_MREQN if test "$enable_debug" = yes ; then AC_DEFINE(DEBUGGING) if test "$enable_memcheck" = yes ; then AC_CHECK_LIB(dmalloc, dmalloc_debug) if test $ac_cv_lib_dmalloc_dmalloc_debug != yes ; then AC_CHECK_LIB(efence, malloc) fi fi fi CLIENT= CLIENT_LIBS= if test "$enable_client" = yes ; then CLIENT=birdc AC_CHECK_LIB(history, add_history, CLIENT_LIBS="-lhistory") AC_CHECK_LIB(ncurses, tgetent, USE_TERMCAP_LIB=-lncurses, AC_CHECK_LIB(curses, tgetent, USE_TERMCAP_LIB=-lcurses, AC_CHECK_LIB(tinfow, tgetent, USE_TERMCAP_LIB=-ltinfow, AC_CHECK_LIB(tinfo, tgetent, USE_TERMCAP_LIB=-ltinfo, AC_CHECK_LIB(termcap, tgetent, USE_TERMCAP_LIB=-ltermcap, AC_MSG_ERROR([[The client requires ncurses library. Either install the library or use --disable-client to compile without the client.]])))))) AC_CHECK_LIB(readline, rl_callback_read_char, CLIENT_LIBS="-lreadline $CLIENT_LIBS $USE_TERMCAP_LIB", AC_MSG_ERROR([[The client requires GNU readline library 2.1 or newer. Either install the library or use --disable-client to compile without the client.]]), $USE_TERMCAP_LIB) AC_CHECK_LIB(readline, rl_crlf, AC_DEFINE(HAVE_RL_CRLF),,$USE_TERMCAP_LIB) AC_CHECK_LIB(readline, rl_ding, AC_DEFINE(HAVE_RL_DING),,$USE_TERMCAP_LIB) fi AC_SUBST(CLIENT) AC_SUBST(CLIENT_LIBS) mkdir -p $objdir/sysdep AC_CONFIG_HEADERS([$objdir/sysdep/autoconf.h:sysdep/autoconf.h.in]) AC_CONFIG_COMMANDS([merge],[[export CPP="$CPP" $srcdir/tools/mergedirs $srcdir $srcdir_rel $objdir $sysdep_dirs]], [[srcdir=$srcdir] [srcdir_rel=$srcdir_rel] [objdir=$objdir] [sysdep_dirs="$sysdep_dirs"]]) AC_CONFIG_FILES($makefiles) AC_OUTPUT rm -f $objdir/sysdep/paths.h cat >&AC_FD_MSG < * * Can be freely distributed and used under the terms of the GNU GPL. */ #define CONFIG_AUTO_ROUTES #define CONFIG_SELF_CONSCIOUS #define CONFIG_MULTIPLE_TABLES #define CONFIG_ALL_TABLES_AT_ONCE #define CONFIG_MC_PROPER_SRC #define CONFIG_UNIX_DONTROUTE #define CONFIG_RESTRICTED_PRIVILEGES /* Link: sysdep/linux Link: sysdep/unix */ bird-1.6.3/sysdep/cf/README0000644000103200001440000000162213027054563014212 0ustar feelausersAvailable configuration variables: ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CONFIG_AUTO_ROUTES Device routes are added automagically by the kernel CONFIG_SELF_CONSCIOUS We're able to recognize whether route was installed by us CONFIG_MULTIPLE_TABLES The kernel supports multiple routing tables CONFIG_ALL_TABLES_AT_ONCE Kernel scanner wants to process all tables at once CONFIG_SINGLE_ROUTE There is only one route per network CONFIG_MC_PROPER_SRC Multicast packets have source address according to socket saddr field CONFIG_SKIP_MC_BIND Don't call bind on multicast socket (def for *BSD) CONFIG_NO_IFACE_BIND Bind to iface is not available, use workarounds (def for *BSD) CONFIG_UNIX_DONTROUTE Use setsockopts DONTROUTE (undef for *BSD) CONFIG_USE_HDRINCL Use IP_HDRINCL instead of control messages for source address on raw IP sockets. CONFIG_RESTRICTED_PRIVILEGES Implements restricted privileges using drop_uid() bird-1.6.3/sysdep/cf/linux-v6.h0000644000103200001440000000062013027054563015170 0ustar feelausers/* * Configuration for Linux based systems running IPv6 * * (c) 1998--1999 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #define IPV6 #define CONFIG_AUTO_ROUTES #define CONFIG_SELF_CONSCIOUS #define CONFIG_MULTIPLE_TABLES #define CONFIG_ALL_TABLES_AT_ONCE #define CONFIG_RESTRICTED_PRIVILEGES /* Link: sysdep/linux Link: sysdep/unix */ bird-1.6.3/sysdep/cf/bsd-v6.h0000644000103200001440000000065613027054563014612 0ustar feelausers/* * Configuration for *BSD based systems (tested on FreeBSD and NetBSD) * * (c) 2004 Ondrej Filip * * Can be freely distributed and used under the terms of the GNU GPL. */ #define IPV6 #define CONFIG_AUTO_ROUTES #define CONFIG_SELF_CONSCIOUS #define CONFIG_MULTIPLE_TABLES #define CONFIG_SINGLE_ROUTE #define CONFIG_SKIP_MC_BIND #define CONFIG_NO_IFACE_BIND /* Link: sysdep/unix Link: sysdep/bsd */ bird-1.6.3/sysdep/cf/bsd.h0000644000103200001440000000067313027054563014260 0ustar feelausers/* * Configuration for *BSD based systems (tested on FreeBSD and NetBSD) * * (c) 2004 Ondrej Filip * * Can be freely distributed and used under the terms of the GNU GPL. */ #define CONFIG_AUTO_ROUTES #define CONFIG_SELF_CONSCIOUS #define CONFIG_MULTIPLE_TABLES #define CONFIG_SINGLE_ROUTE #define CONFIG_SKIP_MC_BIND #define CONFIG_NO_IFACE_BIND #define CONFIG_USE_HDRINCL /* Link: sysdep/unix Link: sysdep/bsd */ bird-1.6.3/sysdep/autoconf.h.in0000644000103200001440000000235013027054563015335 0ustar feelausers/* * This file contains all system parameters automatically * discovered by the configure script. */ /* System configuration file */ #define SYSCONF_INCLUDE ? /* Include debugging code */ #undef DEBUGGING /* 8-bit integer type */ #define INTEGER_8 ? /* 16-bit integer type */ #define INTEGER_16 ? /* 32-bit integer type */ #define INTEGER_32 ? /* 64-bit integer type */ #define INTEGER_64 ? /* CPU endianity */ #undef CPU_LITTLE_ENDIAN #undef CPU_BIG_ENDIAN /* Usual alignment for structures */ #define CPU_STRUCT_ALIGN 1 /* Characteristics of time_t */ #undef TIME_T_IS_64BIT #undef TIME_T_IS_SIGNED /* We have struct ip_mreqn in */ #undef HAVE_STRUCT_IP_MREQN /* Protocols compiled in */ #undef CONFIG_STATIC #undef CONFIG_RIP #undef CONFIG_RADV #undef CONFIG_BFD #undef CONFIG_BGP #undef CONFIG_OSPF #undef CONFIG_PIPE #undef CONFIG_BABEL /* We use multithreading */ #undef USE_PTHREADS /* We have and syslog() */ #undef HAVE_SYSLOG /* We have */ #undef HAVE_ALLOCA_H /* Are we using dmalloc? */ #undef HAVE_LIBDMALLOC /* Readline stuff */ #undef HAVE_RL_CRLF #undef HAVE_RL_DING /* struct sockaddr_in(6) */ #undef HAVE_SIN_LEN /* We have stdint.h */ #undef HAVE_STDINT_H #define CONFIG_PATH ? bird-1.6.3/sysdep/Doc0000644000103200001440000000002513027054563013366 0ustar feelausersD sysdep.sgml C unix bird-1.6.3/sysdep/sysdep.sgml0000644000103200001440000000173713027054563015144 0ustar feelausers System dependent parts Introduction

We've tried to make BIRD as portable as possible, but unfortunately communication with the network stack differs from one OS to another, so we need at least some OS specific code. The good news is that this code is isolated in a small set of modules: is a header file with configuration information, definition of the standard set of types and so on. bird-1.6.3/sysdep/config.h0000644000103200001440000000157013027054563014362 0ustar feelausers/* * This file contains all parameters dependent on the * operating system and build-time configuration. */ #ifndef _BIRD_CONFIG_H_ #define _BIRD_CONFIG_H_ /* BIRD version */ #define BIRD_VERSION "1.6.3" /* Include parameters determined by configure script */ #include "sysdep/autoconf.h" /* Include OS configuration file as chosen in autoconf.h */ #include SYSCONF_INCLUDE #ifndef MACROS_ONLY /* * Of course we could add the paths to autoconf.h, but autoconf * is stupid and puts make-specific substitutious to the paths. */ #include "sysdep/paths.h" /* Types */ typedef signed INTEGER_8 s8; typedef unsigned INTEGER_8 u8; typedef INTEGER_16 s16; typedef unsigned INTEGER_16 u16; typedef INTEGER_32 s32; typedef unsigned INTEGER_32 u32; typedef INTEGER_64 s64; typedef unsigned INTEGER_64 u64; typedef u8 byte; typedef u16 word; typedef unsigned int uint; #endif #endif bird-1.6.3/sysdep/unix/0000755000103200001440000000000013027054563013724 5ustar feelausersbird-1.6.3/sysdep/unix/krt.c0000644000103200001440000006670413027054563014705 0ustar feelausers/* * BIRD -- UNIX Kernel Synchronization * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Kernel synchronization * * This system dependent module implements the Kernel and Device protocol, * that is synchronization of interface lists and routing tables with the * OS kernel. * * The whole kernel synchronization is a bit messy and touches some internals * of the routing table engine, because routing table maintenance is a typical * example of the proverbial compatibility between different Unices and we want * to keep the overhead of our KRT business as low as possible and avoid maintaining * a local routing table copy. * * The kernel syncer can work in three different modes (according to system config header): * Either with a single routing table and single KRT protocol [traditional UNIX] * or with many routing tables and separate KRT protocols for all of them * or with many routing tables, but every scan including all tables, so we start * separate KRT protocols which cooperate with each other [Linux]. * In this case, we keep only a single scan timer. * * We use FIB node flags in the routing table to keep track of route * synchronization status. We also attach temporary &rte's to the routing table, * but it cannot do any harm to the rest of BIRD since table synchronization is * an atomic process. * * When starting up, we cheat by looking if there is another * KRT instance to be initialized later and performing table scan * only once for all the instances. * * The code uses OS-dependent parts for kernel updates and scans. These parts are * in more specific sysdep directories (e.g. sysdep/linux) in functions krt_sys_* * and kif_sys_* (and some others like krt_replace_rte()) and krt-sys.h header file. * This is also used for platform specific protocol options and route attributes. * * There was also an old code that used traditional UNIX ioctls for these tasks. * It was unmaintained and later removed. For reference, see sysdep/krt-* files * in commit 396dfa9042305f62da1f56589c4b98fac57fc2f6 */ /* * If you are brave enough, continue now. You cannot say you haven't been warned. */ #undef LOCAL_DEBUG #include "nest/bird.h" #include "nest/iface.h" #include "nest/route.h" #include "nest/protocol.h" #include "filter/filter.h" #include "lib/timer.h" #include "conf/conf.h" #include "lib/string.h" #include "unix.h" #include "krt.h" /* * Global resources */ pool *krt_pool; static linpool *krt_filter_lp; static list krt_proto_list; void krt_io_init(void) { krt_pool = rp_new(&root_pool, "Kernel Syncer"); krt_filter_lp = lp_new(krt_pool, 4080); init_list(&krt_proto_list); krt_sys_io_init(); } /* * Interfaces */ struct kif_proto *kif_proto; static struct kif_config *kif_cf; static timer *kif_scan_timer; static bird_clock_t kif_last_shot; static void kif_scan(timer *t) { struct kif_proto *p = t->data; KRT_TRACE(p, D_EVENTS, "Scanning interfaces"); kif_last_shot = now; kif_do_scan(p); } static void kif_force_scan(void) { if (kif_proto && kif_last_shot + 2 < now) { kif_scan(kif_scan_timer); tm_start(kif_scan_timer, ((struct kif_config *) kif_proto->p.cf)->scan_time); } } void kif_request_scan(void) { if (kif_proto && kif_scan_timer->expires > now) tm_start(kif_scan_timer, 1); } static inline int prefer_addr(struct ifa *a, struct ifa *b) { int sa = a->scope > SCOPE_LINK; int sb = b->scope > SCOPE_LINK; if (sa < sb) return 0; else if (sa > sb) return 1; else return ipa_compare(a->ip, b->ip) < 0; } static inline struct ifa * find_preferred_ifa(struct iface *i, ip_addr prefix, ip_addr mask) { struct ifa *a, *b = NULL; WALK_LIST(a, i->addrs) { if (!(a->flags & IA_SECONDARY) && ipa_equal(ipa_and(a->ip, mask), prefix) && (!b || prefer_addr(a, b))) b = a; } return b; } struct ifa * kif_choose_primary(struct iface *i) { struct kif_config *cf = (struct kif_config *) (kif_proto->p.cf); struct kif_primary_item *it; struct ifa *a; WALK_LIST(it, cf->primary) { if (!it->pattern || patmatch(it->pattern, i->name)) if (a = find_preferred_ifa(i, it->prefix, ipa_mkmask(it->pxlen))) return a; } if (a = kif_get_primary_ip(i)) return a; return find_preferred_ifa(i, IPA_NONE, IPA_NONE); } static struct proto * kif_init(struct proto_config *c) { struct kif_proto *p = proto_new(c, sizeof(struct kif_proto)); kif_sys_init(p); return &p->p; } static int kif_start(struct proto *P) { struct kif_proto *p = (struct kif_proto *) P; kif_proto = p; kif_sys_start(p); /* Start periodic interface scanning */ kif_scan_timer = tm_new(P->pool); kif_scan_timer->hook = kif_scan; kif_scan_timer->data = p; kif_scan_timer->recurrent = KIF_CF->scan_time; kif_scan(kif_scan_timer); tm_start(kif_scan_timer, KIF_CF->scan_time); return PS_UP; } static int kif_shutdown(struct proto *P) { struct kif_proto *p = (struct kif_proto *) P; tm_stop(kif_scan_timer); kif_sys_shutdown(p); kif_proto = NULL; return PS_DOWN; } static int kif_reconfigure(struct proto *p, struct proto_config *new) { struct kif_config *o = (struct kif_config *) p->cf; struct kif_config *n = (struct kif_config *) new; if (!kif_sys_reconfigure((struct kif_proto *) p, n, o)) return 0; if (o->scan_time != n->scan_time) { tm_stop(kif_scan_timer); kif_scan_timer->recurrent = n->scan_time; kif_scan(kif_scan_timer); tm_start(kif_scan_timer, n->scan_time); } if (!EMPTY_LIST(o->primary) || !EMPTY_LIST(n->primary)) { /* This is hack, we have to update a configuration * to the new value just now, because it is used * for recalculation of primary addresses. */ p->cf = new; ifa_recalc_all_primary_addresses(); } return 1; } static void kif_preconfig(struct protocol *P UNUSED, struct config *c) { kif_cf = NULL; kif_sys_preconfig(c); } struct proto_config * kif_init_config(int class) { if (kif_cf) cf_error("Kernel device protocol already defined"); kif_cf = (struct kif_config *) proto_config_new(&proto_unix_iface, class); kif_cf->scan_time = 60; init_list(&kif_cf->primary); kif_sys_init_config(kif_cf); return (struct proto_config *) kif_cf; } static void kif_copy_config(struct proto_config *dest, struct proto_config *src) { struct kif_config *d = (struct kif_config *) dest; struct kif_config *s = (struct kif_config *) src; /* Shallow copy of everything (just scan_time currently) */ proto_copy_rest(dest, src, sizeof(struct kif_config)); /* Copy primary addr list */ cfg_copy_list(&d->primary, &s->primary, sizeof(struct kif_primary_item)); /* Fix sysdep parts */ kif_sys_copy_config(d, s); } struct protocol proto_unix_iface = { .name = "Device", .template = "device%d", .preference = DEF_PREF_DIRECT, .config_size = sizeof(struct kif_config), .preconfig = kif_preconfig, .init = kif_init, .start = kif_start, .shutdown = kif_shutdown, .reconfigure = kif_reconfigure, .copy_config = kif_copy_config }; /* * Tracing of routes */ static inline void krt_trace_in(struct krt_proto *p, rte *e, char *msg) { if (p->p.debug & D_PACKETS) log(L_TRACE "%s: %I/%d: %s", p->p.name, e->net->n.prefix, e->net->n.pxlen, msg); } static inline void krt_trace_in_rl(struct tbf *f, struct krt_proto *p, rte *e, char *msg) { if (p->p.debug & D_PACKETS) log_rl(f, L_TRACE "%s: %I/%d: %s", p->p.name, e->net->n.prefix, e->net->n.pxlen, msg); } /* * Inherited Routes */ #ifdef KRT_ALLOW_LEARN static struct tbf rl_alien = TBF_DEFAULT_LOG_LIMITS; /* * krt_same_key() specifies what (aside from the net) is the key in * kernel routing tables. It should be OS-dependent, this is for * Linux. It is important for asynchronous alien updates, because a * positive update is implicitly a negative one for any old route with * the same key. */ static inline int krt_same_key(rte *a, rte *b) { return a->u.krt.metric == b->u.krt.metric; } static inline int krt_uptodate(rte *a, rte *b) { if (a->attrs != b->attrs) return 0; if (a->u.krt.proto != b->u.krt.proto) return 0; return 1; } static void krt_learn_announce_update(struct krt_proto *p, rte *e) { net *n = e->net; rta *aa = rta_clone(e->attrs); rte *ee = rte_get_temp(aa); net *nn = net_get(p->p.table, n->n.prefix, n->n.pxlen); ee->net = nn; ee->pflags = 0; ee->pref = p->p.preference; ee->u.krt = e->u.krt; rte_update(&p->p, nn, ee); } static void krt_learn_announce_delete(struct krt_proto *p, net *n) { n = net_find(p->p.table, n->n.prefix, n->n.pxlen); rte_update(&p->p, n, NULL); } /* Called when alien route is discovered during scan */ static void krt_learn_scan(struct krt_proto *p, rte *e) { net *n0 = e->net; net *n = net_get(&p->krt_table, n0->n.prefix, n0->n.pxlen); rte *m, **mm; e->attrs = rta_lookup(e->attrs); for(mm=&n->routes; m = *mm; mm=&m->next) if (krt_same_key(m, e)) break; if (m) { if (krt_uptodate(m, e)) { krt_trace_in_rl(&rl_alien, p, e, "[alien] seen"); rte_free(e); m->u.krt.seen = 1; } else { krt_trace_in(p, e, "[alien] updated"); *mm = m->next; rte_free(m); m = NULL; } } else krt_trace_in(p, e, "[alien] created"); if (!m) { e->next = n->routes; n->routes = e; e->u.krt.seen = 1; } } static void krt_learn_prune(struct krt_proto *p) { struct fib *fib = &p->krt_table.fib; struct fib_iterator fit; KRT_TRACE(p, D_EVENTS, "Pruning inherited routes"); FIB_ITERATE_INIT(&fit, fib); again: FIB_ITERATE_START(fib, &fit, f) { net *n = (net *) f; rte *e, **ee, *best, **pbest, *old_best; /* * Note that old_best may be NULL even if there was an old best route in * the previous step, because it might be replaced in krt_learn_scan(). * But in that case there is a new valid best route. */ old_best = NULL; best = NULL; pbest = NULL; ee = &n->routes; while (e = *ee) { if (e->u.krt.best) old_best = e; if (!e->u.krt.seen) { *ee = e->next; rte_free(e); continue; } if (!best || best->u.krt.metric > e->u.krt.metric) { best = e; pbest = ee; } e->u.krt.seen = 0; e->u.krt.best = 0; ee = &e->next; } if (!n->routes) { DBG("%I/%d: deleting\n", n->n.prefix, n->n.pxlen); if (old_best) krt_learn_announce_delete(p, n); FIB_ITERATE_PUT(&fit, f); fib_delete(fib, f); goto again; } best->u.krt.best = 1; *pbest = best->next; best->next = n->routes; n->routes = best; if ((best != old_best) || p->reload) { DBG("%I/%d: announcing (metric=%d)\n", n->n.prefix, n->n.pxlen, best->u.krt.metric); krt_learn_announce_update(p, best); } else DBG("%I/%d: uptodate (metric=%d)\n", n->n.prefix, n->n.pxlen, best->u.krt.metric); } FIB_ITERATE_END(f); p->reload = 0; } static void krt_learn_async(struct krt_proto *p, rte *e, int new) { net *n0 = e->net; net *n = net_get(&p->krt_table, n0->n.prefix, n0->n.pxlen); rte *g, **gg, *best, **bestp, *old_best; e->attrs = rta_lookup(e->attrs); old_best = n->routes; for(gg=&n->routes; g = *gg; gg = &g->next) if (krt_same_key(g, e)) break; if (new) { if (g) { if (krt_uptodate(g, e)) { krt_trace_in(p, e, "[alien async] same"); rte_free(e); return; } krt_trace_in(p, e, "[alien async] updated"); *gg = g->next; rte_free(g); } else krt_trace_in(p, e, "[alien async] created"); e->next = n->routes; n->routes = e; } else if (!g) { krt_trace_in(p, e, "[alien async] delete failed"); rte_free(e); return; } else { krt_trace_in(p, e, "[alien async] removed"); *gg = g->next; rte_free(e); rte_free(g); } best = n->routes; bestp = &n->routes; for(gg=&n->routes; g=*gg; gg=&g->next) { if (best->u.krt.metric > g->u.krt.metric) { best = g; bestp = gg; } g->u.krt.best = 0; } if (best) { best->u.krt.best = 1; *bestp = best->next; best->next = n->routes; n->routes = best; } if (best != old_best) { DBG("krt_learn_async: distributing change\n"); if (best) krt_learn_announce_update(p, best); else krt_learn_announce_delete(p, n); } } static void krt_learn_init(struct krt_proto *p) { if (KRT_CF->learn) rt_setup(p->p.pool, &p->krt_table, "Inherited", NULL); } static void krt_dump(struct proto *P) { struct krt_proto *p = (struct krt_proto *) P; if (!KRT_CF->learn) return; debug("KRT: Table of inheritable routes\n"); rt_dump(&p->krt_table); } static void krt_dump_attrs(rte *e) { debug(" [m=%d,p=%d]", e->u.krt.metric, e->u.krt.proto); } #endif /* * Routes */ static void krt_flush_routes(struct krt_proto *p) { struct rtable *t = p->p.table; KRT_TRACE(p, D_EVENTS, "Flushing kernel routes"); FIB_WALK(&t->fib, f) { net *n = (net *) f; rte *e = n->routes; if (rte_is_valid(e) && (n->n.flags & KRF_INSTALLED)) { /* FIXME: this does not work if gw is changed in export filter */ krt_replace_rte(p, e->net, NULL, e, NULL); n->n.flags &= ~KRF_INSTALLED; } } FIB_WALK_END; } static struct rte * krt_export_net(struct krt_proto *p, net *net, rte **rt_free, ea_list **tmpa) { struct announce_hook *ah = p->p.main_ahook; struct filter *filter = ah->out_filter; rte *rt; if (p->p.accept_ra_types == RA_MERGED) return rt_export_merged(ah, net, rt_free, tmpa, krt_filter_lp, 1); rt = net->routes; *rt_free = NULL; if (!rte_is_valid(rt)) return NULL; if (filter == FILTER_REJECT) return NULL; struct proto *src = rt->attrs->src->proto; *tmpa = src->make_tmp_attrs ? src->make_tmp_attrs(rt, krt_filter_lp) : NULL; /* We could run krt_import_control() here, but it is already handled by KRF_INSTALLED */ if (filter == FILTER_ACCEPT) goto accept; if (f_run(filter, &rt, tmpa, krt_filter_lp, FF_FORCE_TMPATTR) > F_ACCEPT) goto reject; accept: if (rt != net->routes) *rt_free = rt; return rt; reject: if (rt != net->routes) rte_free(rt); return NULL; } static int krt_same_dest(rte *k, rte *e) { rta *ka = k->attrs, *ea = e->attrs; if (ka->dest != ea->dest) return 0; switch (ka->dest) { case RTD_ROUTER: return ipa_equal(ka->gw, ea->gw); case RTD_DEVICE: return !strcmp(ka->iface->name, ea->iface->name); case RTD_MULTIPATH: return mpnh_same(ka->nexthops, ea->nexthops); default: return 1; } } /* * This gets called back when the low-level scanning code discovers a route. * We expect that the route is a temporary rte and its attributes are uncached. */ void krt_got_route(struct krt_proto *p, rte *e) { net *net = e->net; int verdict; #ifdef KRT_ALLOW_LEARN switch (e->u.krt.src) { case KRT_SRC_KERNEL: verdict = KRF_IGNORE; goto sentenced; case KRT_SRC_REDIRECT: verdict = KRF_DELETE; goto sentenced; case KRT_SRC_ALIEN: if (KRT_CF->learn) krt_learn_scan(p, e); else { krt_trace_in_rl(&rl_alien, p, e, "[alien] ignored"); rte_free(e); } return; } #endif /* The rest is for KRT_SRC_BIRD (or KRT_SRC_UNKNOWN) */ if (net->n.flags & KRF_VERDICT_MASK) { /* Route to this destination was already seen. Strange, but it happens... */ krt_trace_in(p, e, "already seen"); rte_free(e); return; } if (!p->ready) { /* We wait for the initial feed to have correct KRF_INSTALLED flag */ verdict = KRF_IGNORE; goto sentenced; } if (net->n.flags & KRF_INSTALLED) { rte *new, *rt_free; ea_list *tmpa; new = krt_export_net(p, net, &rt_free, &tmpa); /* TODO: There also may be changes in route eattrs, we ignore that for now. */ if (!new) verdict = KRF_DELETE; else if ((net->n.flags & KRF_SYNC_ERROR) || !krt_same_dest(e, new)) verdict = KRF_UPDATE; else verdict = KRF_SEEN; if (rt_free) rte_free(rt_free); lp_flush(krt_filter_lp); } else verdict = KRF_DELETE; sentenced: krt_trace_in(p, e, ((char *[]) { "?", "seen", "will be updated", "will be removed", "ignored" }) [verdict]); net->n.flags = (net->n.flags & ~KRF_VERDICT_MASK) | verdict; if (verdict == KRF_UPDATE || verdict == KRF_DELETE) { /* Get a cached copy of attributes and temporarily link the route */ rta *a = e->attrs; a->source = RTS_DUMMY; e->attrs = rta_lookup(a); e->next = net->routes; net->routes = e; } else rte_free(e); } static void krt_prune(struct krt_proto *p) { struct rtable *t = p->p.table; KRT_TRACE(p, D_EVENTS, "Pruning table %s", t->name); FIB_WALK(&t->fib, f) { net *n = (net *) f; int verdict = f->flags & KRF_VERDICT_MASK; rte *new, *old, *rt_free = NULL; ea_list *tmpa = NULL; if (verdict == KRF_UPDATE || verdict == KRF_DELETE) { /* Get a dummy route from krt_got_route() */ old = n->routes; n->routes = old->next; } else old = NULL; if (verdict == KRF_CREATE || verdict == KRF_UPDATE) { /* We have to run export filter to get proper 'new' route */ new = krt_export_net(p, n, &rt_free, &tmpa); if (!new) verdict = (verdict == KRF_CREATE) ? KRF_IGNORE : KRF_DELETE; else tmpa = ea_append(tmpa, new->attrs->eattrs); } else new = NULL; switch (verdict) { case KRF_CREATE: if (new && (f->flags & KRF_INSTALLED)) { krt_trace_in(p, new, "reinstalling"); krt_replace_rte(p, n, new, NULL, tmpa); } break; case KRF_SEEN: case KRF_IGNORE: /* Nothing happens */ break; case KRF_UPDATE: krt_trace_in(p, new, "updating"); krt_replace_rte(p, n, new, old, tmpa); break; case KRF_DELETE: krt_trace_in(p, old, "deleting"); krt_replace_rte(p, n, NULL, old, NULL); break; default: bug("krt_prune: invalid route status"); } if (old) rte_free(old); if (rt_free) rte_free(rt_free); lp_flush(krt_filter_lp); f->flags &= ~KRF_VERDICT_MASK; } FIB_WALK_END; #ifdef KRT_ALLOW_LEARN if (KRT_CF->learn) krt_learn_prune(p); #endif if (p->ready) p->initialized = 1; } void krt_got_route_async(struct krt_proto *p, rte *e, int new) { net *net = e->net; switch (e->u.krt.src) { case KRT_SRC_BIRD: ASSERT(0); /* Should be filtered by the back end */ case KRT_SRC_REDIRECT: if (new) { krt_trace_in(p, e, "[redirect] deleting"); krt_replace_rte(p, net, NULL, e, NULL); } /* If !new, it is probably echo of our deletion */ break; #ifdef KRT_ALLOW_LEARN case KRT_SRC_ALIEN: if (KRT_CF->learn) { krt_learn_async(p, e, new); return; } #endif } rte_free(e); } /* * Periodic scanning */ #ifdef CONFIG_ALL_TABLES_AT_ONCE static timer *krt_scan_timer; static int krt_scan_count; static void krt_scan(timer *t UNUSED) { struct krt_proto *p; kif_force_scan(); /* We need some node to decide whether to print the debug messages or not */ p = SKIP_BACK(struct krt_proto, krt_node, HEAD(krt_proto_list)); KRT_TRACE(p, D_EVENTS, "Scanning routing table"); krt_do_scan(NULL); void *q; WALK_LIST(q, krt_proto_list) { p = SKIP_BACK(struct krt_proto, krt_node, q); krt_prune(p); } } static void krt_scan_timer_start(struct krt_proto *p) { if (!krt_scan_count) krt_scan_timer = tm_new_set(krt_pool, krt_scan, NULL, 0, KRT_CF->scan_time); krt_scan_count++; tm_start(krt_scan_timer, 1); } static void krt_scan_timer_stop(struct krt_proto *p UNUSED) { krt_scan_count--; if (!krt_scan_count) { rfree(krt_scan_timer); krt_scan_timer = NULL; } } static void krt_scan_timer_kick(struct krt_proto *p UNUSED) { tm_start(krt_scan_timer, 0); } #else static void krt_scan(timer *t) { struct krt_proto *p = t->data; kif_force_scan(); KRT_TRACE(p, D_EVENTS, "Scanning routing table"); krt_do_scan(p); krt_prune(p); } static void krt_scan_timer_start(struct krt_proto *p) { p->scan_timer = tm_new_set(p->p.pool, krt_scan, p, 0, KRT_CF->scan_time); tm_start(p->scan_timer, 1); } static void krt_scan_timer_stop(struct krt_proto *p) { tm_stop(p->scan_timer); } static void krt_scan_timer_kick(struct krt_proto *p) { tm_start(p->scan_timer, 0); } #endif /* * Updates */ static struct ea_list * krt_make_tmp_attrs(rte *rt, struct linpool *pool) { struct ea_list *l = lp_alloc(pool, sizeof(struct ea_list) + 2 * sizeof(eattr)); l->next = NULL; l->flags = EALF_SORTED; l->count = 2; l->attrs[0].id = EA_KRT_SOURCE; l->attrs[0].flags = 0; l->attrs[0].type = EAF_TYPE_INT | EAF_TEMP; l->attrs[0].u.data = rt->u.krt.proto; l->attrs[1].id = EA_KRT_METRIC; l->attrs[1].flags = 0; l->attrs[1].type = EAF_TYPE_INT | EAF_TEMP; l->attrs[1].u.data = rt->u.krt.metric; return l; } static void krt_store_tmp_attrs(rte *rt, struct ea_list *attrs) { /* EA_KRT_SOURCE is read-only */ rt->u.krt.metric = ea_get_int(attrs, EA_KRT_METRIC, 0); } static int krt_import_control(struct proto *P, rte **new, ea_list **attrs UNUSED, struct linpool *pool UNUSED) { struct krt_proto *p = (struct krt_proto *) P; rte *e = *new; if (e->attrs->src->proto == P) { #ifdef CONFIG_SINGLE_ROUTE /* * Implicit withdraw - when the imported kernel route becomes the best one, * we know that the previous one exported to the kernel was already removed, * but if we processed the update as usual, we would send withdraw to the * kernel, which would remove the new imported route instead. * * We will remove KRT_INSTALLED flag, which stops such withdraw to be * processed in krt_rt_notify() and krt_replace_rte(). */ if (e == e->net->routes) e->net->n.flags &= ~KRF_INSTALLED; #endif return -1; } if (!KRT_CF->devroutes && (e->attrs->dest == RTD_DEVICE) && (e->attrs->source != RTS_STATIC_DEVICE)) return -1; if (!krt_capable(e)) return -1; return 0; } static void krt_rt_notify(struct proto *P, struct rtable *table UNUSED, net *net, rte *new, rte *old, struct ea_list *eattrs) { struct krt_proto *p = (struct krt_proto *) P; if (config->shutdown) return; if (!(net->n.flags & KRF_INSTALLED)) old = NULL; if (new) net->n.flags |= KRF_INSTALLED; else net->n.flags &= ~KRF_INSTALLED; if (p->initialized) /* Before first scan we don't touch the routes */ krt_replace_rte(p, net, new, old, eattrs); } static void krt_if_notify(struct proto *P, uint flags, struct iface *iface UNUSED) { struct krt_proto *p = (struct krt_proto *) P; /* * When interface went down, we should remove routes to it. In the ideal world, * OS kernel would send us route removal notifications in such cases, but we * cannot rely on it as it is often not true. E.g. Linux kernel removes related * routes when an interface went down, but it does not notify userspace about * that. To be sure, we just schedule a scan to ensure synchronization. */ if ((flags & IF_CHANGE_DOWN) && KRT_CF->learn) krt_scan_timer_kick(p); } static int krt_reload_routes(struct proto *P) { struct krt_proto *p = (struct krt_proto *) P; /* Although we keep learned routes in krt_table, we rather schedule a scan */ if (KRT_CF->learn) { p->reload = 1; krt_scan_timer_kick(p); } return 1; } static void krt_feed_end(struct proto *P) { struct krt_proto *p = (struct krt_proto *) P; p->ready = 1; krt_scan_timer_kick(p); } static int krt_rte_same(rte *a, rte *b) { /* src is always KRT_SRC_ALIEN and type is irrelevant */ return (a->u.krt.proto == b->u.krt.proto) && (a->u.krt.metric == b->u.krt.metric); } /* * Protocol glue */ struct krt_config *krt_cf; static struct proto * krt_init(struct proto_config *C) { struct krt_proto *p = proto_new(C, sizeof(struct krt_proto)); struct krt_config *c = (struct krt_config *) C; p->p.accept_ra_types = c->merge_paths ? RA_MERGED : RA_OPTIMAL; p->p.merge_limit = c->merge_paths; p->p.import_control = krt_import_control; p->p.rt_notify = krt_rt_notify; p->p.if_notify = krt_if_notify; p->p.reload_routes = krt_reload_routes; p->p.feed_end = krt_feed_end; p->p.make_tmp_attrs = krt_make_tmp_attrs; p->p.store_tmp_attrs = krt_store_tmp_attrs; p->p.rte_same = krt_rte_same; krt_sys_init(p); return &p->p; } static int krt_start(struct proto *P) { struct krt_proto *p = (struct krt_proto *) P; add_tail(&krt_proto_list, &p->krt_node); #ifdef KRT_ALLOW_LEARN krt_learn_init(p); #endif if (!krt_sys_start(p)) { rem_node(&p->krt_node); return PS_START; } krt_scan_timer_start(p); if (P->gr_recovery && KRT_CF->graceful_restart) P->gr_wait = 1; return PS_UP; } static int krt_shutdown(struct proto *P) { struct krt_proto *p = (struct krt_proto *) P; krt_scan_timer_stop(p); /* FIXME we should flush routes even when persist during reconfiguration */ if (p->initialized && !KRT_CF->persist) krt_flush_routes(p); p->ready = 0; p->initialized = 0; if (p->p.proto_state == PS_START) return PS_DOWN; krt_sys_shutdown(p); rem_node(&p->krt_node); return PS_DOWN; } static int krt_reconfigure(struct proto *p, struct proto_config *new) { struct krt_config *o = (struct krt_config *) p->cf; struct krt_config *n = (struct krt_config *) new; if (!krt_sys_reconfigure((struct krt_proto *) p, n, o)) return 0; /* persist, graceful restart need not be the same */ return o->scan_time == n->scan_time && o->learn == n->learn && o->devroutes == n->devroutes && o->merge_paths == n->merge_paths; } static void krt_preconfig(struct protocol *P UNUSED, struct config *c) { krt_cf = NULL; krt_sys_preconfig(c); } static void krt_postconfig(struct proto_config *C) { struct krt_config *c = (struct krt_config *) C; #ifdef CONFIG_ALL_TABLES_AT_ONCE if (krt_cf->scan_time != c->scan_time) cf_error("All kernel syncers must use the same table scan interval"); #endif if (C->table->krt_attached) cf_error("Kernel syncer (%s) already attached to table %s", C->table->krt_attached->name, C->table->name); C->table->krt_attached = C; krt_sys_postconfig(c); } struct proto_config * krt_init_config(int class) { #ifndef CONFIG_MULTIPLE_TABLES if (krt_cf) cf_error("Kernel protocol already defined"); #endif krt_cf = (struct krt_config *) proto_config_new(&proto_unix_kernel, class); krt_cf->scan_time = 60; krt_sys_init_config(krt_cf); return (struct proto_config *) krt_cf; } static void krt_copy_config(struct proto_config *dest, struct proto_config *src) { struct krt_config *d = (struct krt_config *) dest; struct krt_config *s = (struct krt_config *) src; /* Shallow copy of everything */ proto_copy_rest(dest, src, sizeof(struct krt_config)); /* Fix sysdep parts */ krt_sys_copy_config(d, s); } static int krt_get_attr(eattr *a, byte *buf, int buflen) { switch (a->id) { case EA_KRT_SOURCE: bsprintf(buf, "source"); return GA_NAME; case EA_KRT_METRIC: bsprintf(buf, "metric"); return GA_NAME; default: return krt_sys_get_attr(a, buf, buflen); } } struct protocol proto_unix_kernel = { .name = "Kernel", .template = "kernel%d", .attr_class = EAP_KRT, .preference = DEF_PREF_INHERITED, .config_size = sizeof(struct krt_config), .preconfig = krt_preconfig, .postconfig = krt_postconfig, .init = krt_init, .start = krt_start, .shutdown = krt_shutdown, .reconfigure = krt_reconfigure, .copy_config = krt_copy_config, .get_attr = krt_get_attr, #ifdef KRT_ALLOW_LEARN .dump = krt_dump, .dump_attrs = krt_dump_attrs, #endif }; bird-1.6.3/sysdep/unix/unix.h0000644000103200001440000000647413027054563015073 0ustar feelausers/* * BIRD -- Declarations Common to Unix Port * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_UNIX_H_ #define _BIRD_UNIX_H_ #include struct pool; struct iface; struct birdsock; /* main.c */ extern char *bird_name; void async_config(void); void async_dump(void); void async_shutdown(void); void cmd_check_config(char *name); void cmd_reconfig(char *name, int type, int timeout); void cmd_reconfig_confirm(void); void cmd_reconfig_undo(void); void cmd_shutdown(void); #define UNIX_DEFAULT_CONFIGURE_TIMEOUT 300 #define UNIX_DEFAULT_LATENCY_LIMIT (1 S_) #define UNIX_DEFAULT_WATCHDOG_WARNING (5 S_) /* io.c */ #define ERR(c) do { s->err = c; return -1; } while (0) #define ERR2(c) do { s->err = c; goto err; } while (0) #define ERR_MSG(c) do { errno = 0; s->err = c; return -1; } while (0) #define SOCKADDR_SIZE 32 typedef struct sockaddr_bird { struct sockaddr sa; char padding[SOCKADDR_SIZE - sizeof(struct sockaddr)]; } sockaddr; #ifdef IPV6 #define BIRD_AF AF_INET6 #define ipa_from_sa(x) ipa_from_sa6(x) #else #define BIRD_AF AF_INET #define ipa_from_sa(x) ipa_from_sa4(x) #endif /* This is sloppy hack, it should be detected by configure script */ /* Linux systems have it defined so this is definition for BSD systems */ #ifndef s6_addr32 #define s6_addr32 __u6_addr.__u6_addr32 #endif static inline ip_addr ipa_from_in4(struct in_addr a UNUSED6) { return ipa_from_u32(ntohl(a.s_addr)); } static inline ip_addr ipa_from_in6(struct in6_addr a UNUSED4) { return ipa_build6(ntohl(a.s6_addr32[0]), ntohl(a.s6_addr32[1]), ntohl(a.s6_addr32[2]), ntohl(a.s6_addr32[3])); } static inline ip_addr ipa_from_sa4(sockaddr *sa UNUSED6) { return ipa_from_in4(((struct sockaddr_in *) sa)->sin_addr); } static inline ip_addr ipa_from_sa6(sockaddr *sa UNUSED4) { return ipa_from_in6(((struct sockaddr_in6 *) sa)->sin6_addr); } static inline struct in_addr ipa_to_in4(ip_addr a) { return (struct in_addr) { htonl(ipa_to_u32(a)) }; } #ifdef IPV6 static inline struct in6_addr ipa_to_in6(ip_addr a) { return (struct in6_addr) { .s6_addr32 = { htonl(_I0(a)), htonl(_I1(a)), htonl(_I2(a)), htonl(_I3(a)) } }; } #else /* Temporary dummy */ static inline struct in6_addr ipa_to_in6(ip_addr a UNUSED) { return (struct in6_addr) { .s6_addr32 = { 0, 0, 0, 0 } }; } #endif void sockaddr_fill(sockaddr *sa, int af, ip_addr a, struct iface *ifa, uint port); int sockaddr_read(sockaddr *sa, int af, ip_addr *a, struct iface **ifa, uint *port); #ifndef SUN_LEN #define SUN_LEN(ptr) ((size_t) (((struct sockaddr_un *) 0)->sun_path) + strlen ((ptr)->sun_path)) #endif volatile int async_config_flag; volatile int async_dump_flag; volatile int async_shutdown_flag; void io_init(void); void io_loop(void); void io_log_dump(void); int sk_open_unix(struct birdsock *s, char *name); void *tracked_fopen(struct pool *, char *name, char *mode); void test_old_bird(char *path); /* krt.c bits */ void krt_io_init(void); /* log.c */ void main_thread_init(void); void log_init_debug(char *); /* Initialize debug dump to given file (NULL=stderr, ""=off) */ void log_switch(int debug, list *l, char *); /* Use l=NULL for initial switch */ struct log_config { node n; uint mask; /* Classes to log */ void *fh; /* FILE to log to, NULL=syslog */ int terminal_flag; }; #endif bird-1.6.3/sysdep/unix/Doc0000644000103200001440000000006513027054563014355 0ustar feelausersS log.c S krt.c # io.c is documented under Resources bird-1.6.3/sysdep/unix/config.Y0000644000103200001440000001023013027054563015317 0ustar feelausers/* * BIRD -- UNIX Configuration * * (c) 1999--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ CF_HDR #include "lib/unix.h" #include CF_DECLS CF_KEYWORDS(LOG, SYSLOG, ALL, DEBUG, TRACE, INFO, REMOTE, WARNING, ERROR, AUTH, FATAL, BUG, STDERR, SOFT) CF_KEYWORDS(TIMEFORMAT, ISO, OLD, SHORT, LONG, BASE, NAME, CONFIRM, UNDO, CHECK, TIMEOUT) CF_KEYWORDS(DEBUG, LATENCY, LIMIT, WATCHDOG, WARNING, TIMEOUT) %type log_mask log_mask_list log_cat cfg_timeout %type log_file %type cfg_name %type timeformat_which %type syslog_name CF_GRAMMAR CF_ADDTO(conf, log_config) log_config: LOG log_file log_mask ';' { struct log_config *c = cfg_allocz(sizeof(struct log_config)); c->fh = $2; c->mask = $3; add_tail(&new_config->logfiles, &c->n); } ; syslog_name: NAME text { $$ = $2; } | { $$ = bird_name; } ; log_file: text { FILE *f = tracked_fopen(new_config->pool, $1, "a"); if (!f) cf_error("Unable to open log file `%s': %m", $1); $$ = f; } | SYSLOG syslog_name { $$ = NULL; new_config->syslog_name = $2; } | STDERR { $$ = stderr; } ; log_mask: ALL { $$ = ~0; } | '{' log_mask_list '}' { $$ = $2; } ; log_mask_list: log_cat { $$ = 1 << $1; } | log_mask_list ',' log_cat { $$ = $1 | (1 << $3); } ; log_cat: DEBUG { $$ = L_DEBUG[0]; } | TRACE { $$ = L_TRACE[0]; } | INFO { $$ = L_INFO[0]; } | REMOTE { $$ = L_REMOTE[0]; } | WARNING { $$ = L_WARN[0]; } | ERROR { $$ = L_ERR[0]; } | AUTH { $$ = L_AUTH[0]; } | FATAL { $$ = L_FATAL[0]; } | BUG { $$ = L_BUG[0]; } ; CF_ADDTO(conf, mrtdump_base) mrtdump_base: MRTDUMP PROTOCOLS mrtdump_mask ';' { new_config->proto_default_mrtdump = $3; } | MRTDUMP text ';' { FILE *f = tracked_fopen(new_config->pool, $2, "a"); if (!f) cf_error("Unable to open MRTDump file '%s': %m", $2); new_config->mrtdump_file = fileno(f); } ; CF_ADDTO(conf, timeformat_base) timeformat_which: ROUTE { $$ = &new_config->tf_route; } | PROTOCOL { $$ = &new_config->tf_proto; } | BASE { $$ = &new_config->tf_base; } | LOG { $$ = &new_config->tf_log; } timeformat_spec: timeformat_which TEXT { *$1 = (struct timeformat){$2, NULL, 0}; } | timeformat_which TEXT expr TEXT { *$1 = (struct timeformat){$2, $4, $3}; } | timeformat_which ISO SHORT { *$1 = (struct timeformat){"%T", "%F", 20*3600}; } | timeformat_which ISO LONG { *$1 = (struct timeformat){"%F %T", NULL, 0}; } | timeformat_which OLD SHORT { *$1 = (struct timeformat){NULL, NULL, 0}; } | timeformat_which OLD LONG { *$1 = (struct timeformat){"%d-%m-%Y %T", NULL, 0}; } ; timeformat_base: TIMEFORMAT timeformat_spec ';' ; CF_ADDTO(conf, debug_unix) debug_unix: DEBUG LATENCY bool { new_config->latency_debug = $3; } | DEBUG LATENCY LIMIT expr_us { new_config->latency_limit = $4; } | WATCHDOG WARNING expr_us { new_config->watchdog_warning = $3; } | WATCHDOG TIMEOUT expr_us { new_config->watchdog_timeout = ($3 + 999999) TO_S; } ; /* Unix specific commands */ CF_CLI_HELP(CONFIGURE, ..., [[Reload configuration]]) CF_CLI(CONFIGURE, cfg_name cfg_timeout, [\"\"] [timeout []], [[Reload configuration]]) { cmd_reconfig($2, RECONFIG_HARD, $3); } ; CF_CLI(CONFIGURE SOFT, cfg_name cfg_timeout, [\"\"] [timeout []], [[Reload configuration and ignore changes in filters]]) { cmd_reconfig($3, RECONFIG_SOFT, $4); } ; /* Hack to get input completion for 'timeout' */ CF_CLI_CMD(CONFIGURE TIMEOUT, [], [[Reload configuration with undo timeout]]) CF_CLI_CMD(CONFIGURE SOFT TIMEOUT, [], [[Reload configuration with undo timeout]]) CF_CLI(CONFIGURE CONFIRM,,, [[Confirm last configuration change - deactivate undo timeout]]) { cmd_reconfig_confirm(); } ; CF_CLI(CONFIGURE UNDO,,, [[Undo last configuration change]]) { cmd_reconfig_undo(); } ; CF_CLI(CONFIGURE CHECK, cfg_name, [\"\"], [[Parse configuration and check its validity]]) { cmd_check_config($3); } ; CF_CLI(DOWN,,, [[Shut the daemon down]]) { cmd_shutdown(); } ; cfg_name: /* empty */ { $$ = NULL; } | TEXT ; cfg_timeout: /* empty */ { $$ = 0; } | TIMEOUT { $$ = UNIX_DEFAULT_CONFIGURE_TIMEOUT; } | TIMEOUT expr { $$ = $2; } ; CF_CODE CF_END bird-1.6.3/sysdep/unix/log.c0000644000103200001440000001615013027054563014654 0ustar feelausers/* * BIRD Library -- Logging Functions * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Logging * * The Logging module offers a simple set of functions for writing * messages to system logs and to the debug output. Message classes * used by this module are described in |birdlib.h| and also in the * user's manual. */ #include #include #include #include #include #include #include "nest/bird.h" #include "nest/cli.h" #include "nest/mrtdump.h" #include "lib/string.h" #include "lib/lists.h" #include "lib/unix.h" static FILE *dbgf; static list *current_log_list; static char *current_syslog_name; /* NULL -> syslog closed */ #ifdef USE_PTHREADS #include static pthread_mutex_t log_mutex; static inline void log_lock(void) { pthread_mutex_lock(&log_mutex); } static inline void log_unlock(void) { pthread_mutex_unlock(&log_mutex); } static pthread_t main_thread; void main_thread_init(void) { main_thread = pthread_self(); } static int main_thread_self(void) { return pthread_equal(pthread_self(), main_thread); } #else static inline void log_lock(void) { } static inline void log_unlock(void) { } void main_thread_init(void) { } static int main_thread_self(void) { return 1; } #endif #ifdef HAVE_SYSLOG #include static int syslog_priorities[] = { LOG_DEBUG, LOG_DEBUG, LOG_DEBUG, LOG_INFO, LOG_ERR, LOG_WARNING, LOG_ERR, LOG_ERR, LOG_CRIT, LOG_CRIT }; #endif static char *class_names[] = { "???", "DBG", "TRACE", "INFO", "RMT", "WARN", "ERR", "AUTH", "FATAL", "BUG" }; /** * log_commit - commit a log message * @class: message class information (%L_DEBUG to %L_BUG, see |lib/birdlib.h|) * @buf: message to write * * This function writes a message prepared in the log buffer to the * log file (as specified in the configuration). The log buffer is * reset after that. The log message is a full line, log_commit() * terminates it. * * The message class is an integer, not a first char of a string like * in log(), so it should be written like *L_INFO. */ void log_commit(int class, buffer *buf) { struct log_config *l; if (buf->pos == buf->end) strcpy(buf->end - 100, " ... "); log_lock(); WALK_LIST(l, *current_log_list) { if (!(l->mask & (1 << class))) continue; if (l->fh) { if (l->terminal_flag) fputs("bird: ", l->fh); else { byte tbuf[TM_DATETIME_BUFFER_SIZE]; tm_format_datetime(tbuf, &config->tf_log, now); fprintf(l->fh, "%s <%s> ", tbuf, class_names[class]); } fputs(buf->start, l->fh); fputc('\n', l->fh); fflush(l->fh); } #ifdef HAVE_SYSLOG else syslog(syslog_priorities[class], "%s", buf->start); #endif } log_unlock(); /* cli_echo is not thread-safe, so call it just from the main thread */ if (main_thread_self()) cli_echo(class, buf->start); buf->pos = buf->start; } int buffer_vprint(buffer *buf, const char *fmt, va_list args); static void vlog(int class, const char *msg, va_list args) { buffer buf; LOG_BUFFER_INIT(buf); buffer_vprint(&buf, msg, args); log_commit(class, &buf); } /** * log - log a message * @msg: printf-like formatting string with message class information * prepended (%L_DEBUG to %L_BUG, see |lib/birdlib.h|) * * This function formats a message according to the format string @msg * and writes it to the corresponding log file (as specified in the * configuration). Please note that the message is automatically * formatted as a full line, no need to include |\n| inside. * It is essentially a sequence of log_reset(), logn() and log_commit(). */ void log_msg(const char *msg, ...) { int class = 1; va_list args; va_start(args, msg); if (*msg >= 1 && *msg <= 8) class = *msg++; vlog(class, msg, args); va_end(args); } void log_rl(struct tbf *f, const char *msg, ...) { int last_hit = f->mark; int class = 1; va_list args; /* Rate limiting is a bit tricky here as it also logs '...' during the first hit */ if (tbf_limit(f) && last_hit) return; if (*msg >= 1 && *msg <= 8) class = *msg++; va_start(args, msg); vlog(class, (f->mark ? "..." : msg), args); va_end(args); } /** * bug - report an internal error * @msg: a printf-like error message * * This function logs an internal error and aborts execution * of the program. */ void bug(const char *msg, ...) { va_list args; va_start(args, msg); vlog(L_BUG[0], msg, args); va_end(args); abort(); } /** * bug - report a fatal error * @msg: a printf-like error message * * This function logs a fatal error and aborts execution * of the program. */ void die(const char *msg, ...) { va_list args; va_start(args, msg); vlog(L_FATAL[0], msg, args); va_end(args); exit(1); } /** * debug - write to debug output * @msg: a printf-like message * * This function formats the message @msg and prints it out * to the debugging output. No newline character is appended. */ void debug(const char *msg, ...) { va_list args; char buf[1024]; va_start(args, msg); if (dbgf) { if (bvsnprintf(buf, sizeof(buf), msg, args) < 0) bsprintf(buf + sizeof(buf) - 100, " ... \n"); fputs(buf, dbgf); } va_end(args); } static list * default_log_list(int debug, int init, char **syslog_name) { static list init_log_list; init_list(&init_log_list); *syslog_name = NULL; #ifdef HAVE_SYSLOG if (!debug) { static struct log_config lc_syslog = { .mask = ~0 }; add_tail(&init_log_list, &lc_syslog.n); *syslog_name = bird_name; if (!init) return &init_log_list; } #endif static struct log_config lc_stderr = { .mask = ~0, .terminal_flag = 1 }; lc_stderr.fh = stderr; add_tail(&init_log_list, &lc_stderr.n); return &init_log_list; } void log_switch(int debug, list *l, char *new_syslog_name) { if (!l || EMPTY_LIST(*l)) l = default_log_list(debug, !l, &new_syslog_name); current_log_list = l; #ifdef HAVE_SYSLOG if (current_syslog_name && new_syslog_name && !strcmp(current_syslog_name, new_syslog_name)) return; if (current_syslog_name) { closelog(); xfree(current_syslog_name); current_syslog_name = NULL; } if (new_syslog_name) { current_syslog_name = xstrdup(new_syslog_name); openlog(current_syslog_name, LOG_CONS | LOG_NDELAY, LOG_DAEMON); } #endif } void log_init_debug(char *f) { if (dbgf && dbgf != stderr) fclose(dbgf); if (!f) dbgf = NULL; else if (!*f) dbgf = stderr; else if (!(dbgf = fopen(f, "a"))) { /* Cannot use die() nor log() here, logging is not yet initialized */ fprintf(stderr, "bird: Unable to open debug file %s: %s\n", f, strerror(errno)); exit(1); } if (dbgf) setvbuf(dbgf, NULL, _IONBF, 0); } void mrt_dump_message(struct proto *p, u16 type, u16 subtype, byte *buf, u32 len) { /* Prepare header */ put_u32(buf+0, now_real); put_u16(buf+4, type); put_u16(buf+6, subtype); put_u32(buf+8, len - MRTDUMP_HDR_LENGTH); if (p->cf->global->mrtdump_file != -1) write(p->cf->global->mrtdump_file, buf, len); } bird-1.6.3/sysdep/unix/timer.h0000644000103200001440000000365613027054563015227 0ustar feelausers/* * BIRD -- Unix Timers * * (c) 1998 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_TIMER_H_ #define _BIRD_TIMER_H_ #include #include "lib/resource.h" typedef time_t bird_clock_t; /* Use instead of time_t */ typedef struct timer { resource r; void (*hook)(struct timer *); void *data; unsigned randomize; /* Amount of randomization */ unsigned recurrent; /* Timer recurrence */ node n; /* Internal link */ bird_clock_t expires; /* 0=inactive */ } timer; timer *tm_new(pool *); void tm_start(timer *, unsigned after); void tm_stop(timer *); void tm_dump_all(void); extern bird_clock_t now; /* Relative, monotonic time in seconds */ extern bird_clock_t now_real; /* Time in seconds since fixed known epoch */ extern bird_clock_t boot_time; static inline int tm_active(timer *t) { return t->expires != 0; } static inline bird_clock_t tm_remains(timer *t) { return t->expires ? t->expires - now : 0; } static inline void tm_start_max(timer *t, unsigned after) { bird_clock_t rem = tm_remains(t); tm_start(t, (rem > after) ? rem : after); } static inline timer * tm_new_set(pool *p, void (*hook)(struct timer *), void *data, unsigned rand, unsigned rec) { timer *t = tm_new(p); t->hook = hook; t->data = data; t->randomize = rand; t->recurrent = rec; return t; } struct timeformat { char *fmt1, *fmt2; bird_clock_t limit; }; bird_clock_t tm_parse_date(char *); /* Convert date to bird_clock_t */ bird_clock_t tm_parse_datetime(char *); /* Convert date to bird_clock_t */ #define TM_DATETIME_BUFFER_SIZE 32 /* Buffer size required by tm_format_datetime */ void tm_format_datetime(char *x, struct timeformat *fmt_spec, bird_clock_t t); #ifdef TIME_T_IS_64BIT #define TIME_INFINITY 0x7fffffffffffffff #else #ifdef TIME_T_IS_SIGNED #define TIME_INFINITY 0x7fffffff #else #define TIME_INFINITY 0xffffffff #endif #endif #endif bird-1.6.3/sysdep/unix/random.c0000644000103200001440000000057613027054563015360 0ustar feelausers/* * BIRD Internet Routing Daemon -- Random Numbers * * (c) 2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include "nest/bird.h" u32 random_u32(void) { long int rand_low, rand_high; rand_low = random(); rand_high = random(); return (rand_low & 0xffff) | ((rand_high & 0xffff) << 16); } bird-1.6.3/sysdep/unix/Modules0000644000103200001440000000011713027054563015256 0ustar feelauserslog.c main.c timer.h io.c unix.h endian.h config.Y random.c krt.c krt.h krt.Y bird-1.6.3/sysdep/unix/io.c0000644000103200001440000013444413027054563014511 0ustar feelausers/* * BIRD Internet Routing Daemon -- Unix I/O * * (c) 1998--2004 Martin Mares * (c) 2004 Ondrej Filip * * Can be freely distributed and used under the terms of the GNU GPL. */ /* Unfortunately, some glibc versions hide parts of RFC 3542 API if _GNU_SOURCE is not defined. */ #ifndef _GNU_SOURCE #define _GNU_SOURCE #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "nest/bird.h" #include "lib/lists.h" #include "lib/resource.h" #include "lib/timer.h" #include "lib/socket.h" #include "lib/event.h" #include "lib/string.h" #include "nest/iface.h" #include "lib/unix.h" #include "lib/sysio.h" /* Maximum number of calls of tx handler for one socket in one * poll iteration. Should be small enough to not monopolize CPU by * one protocol instance. */ #define MAX_STEPS 4 /* Maximum number of calls of rx handler for all sockets in one poll iteration. RX callbacks are often much more costly so we limit this to gen small latencies */ #define MAX_RX_STEPS 4 /* * Tracked Files */ struct rfile { resource r; FILE *f; }; static void rf_free(resource *r) { struct rfile *a = (struct rfile *) r; fclose(a->f); } static void rf_dump(resource *r) { struct rfile *a = (struct rfile *) r; debug("(FILE *%p)\n", a->f); } static struct resclass rf_class = { "FILE", sizeof(struct rfile), rf_free, rf_dump, NULL, NULL }; void * tracked_fopen(pool *p, char *name, char *mode) { FILE *f = fopen(name, mode); if (f) { struct rfile *r = ralloc(p, &rf_class); r->f = f; } return f; } /** * DOC: Timers * * Timers are resources which represent a wish of a module to call * a function at the specified time. The platform dependent code * doesn't guarantee exact timing, only that a timer function * won't be called before the requested time. * * In BIRD, time is represented by values of the &bird_clock_t type * which are integral numbers interpreted as a relative number of seconds since * some fixed time point in past. The current time can be read * from variable @now with reasonable accuracy and is monotonic. There is also * a current 'absolute' time in variable @now_real reported by OS. * * Each timer is described by a &timer structure containing a pointer * to the handler function (@hook), data private to this function (@data), * time the function should be called at (@expires, 0 for inactive timers), * for the other fields see |timer.h|. */ #define NEAR_TIMER_LIMIT 4 static list near_timers, far_timers; static bird_clock_t first_far_timer = TIME_INFINITY; /* now must be different from 0, because 0 is a special value in timer->expires */ bird_clock_t now = 1, now_real, boot_time; static void update_times_plain(void) { bird_clock_t new_time = time(NULL); int delta = new_time - now_real; if ((delta >= 0) && (delta < 60)) now += delta; else if (now_real != 0) log(L_WARN "Time jump, delta %d s", delta); now_real = new_time; } static void update_times_gettime(void) { struct timespec ts; int rv; rv = clock_gettime(CLOCK_MONOTONIC, &ts); if (rv != 0) die("clock_gettime: %m"); if (ts.tv_sec != now) { if (ts.tv_sec < now) log(L_ERR "Monotonic timer is broken"); now = ts.tv_sec; now_real = time(NULL); } } static int clock_monotonic_available; static inline void update_times(void) { if (clock_monotonic_available) update_times_gettime(); else update_times_plain(); } static inline void init_times(void) { struct timespec ts; clock_monotonic_available = (clock_gettime(CLOCK_MONOTONIC, &ts) == 0); if (!clock_monotonic_available) log(L_WARN "Monotonic timer is missing"); } static void tm_free(resource *r) { timer *t = (timer *) r; tm_stop(t); } static void tm_dump(resource *r) { timer *t = (timer *) r; debug("(code %p, data %p, ", t->hook, t->data); if (t->randomize) debug("rand %d, ", t->randomize); if (t->recurrent) debug("recur %d, ", t->recurrent); if (t->expires) debug("expires in %d sec)\n", t->expires - now); else debug("inactive)\n"); } static struct resclass tm_class = { "Timer", sizeof(timer), tm_free, tm_dump, NULL, NULL }; /** * tm_new - create a timer * @p: pool * * This function creates a new timer resource and returns * a pointer to it. To use the timer, you need to fill in * the structure fields and call tm_start() to start timing. */ timer * tm_new(pool *p) { timer *t = ralloc(p, &tm_class); return t; } static inline void tm_insert_near(timer *t) { node *n = HEAD(near_timers); while (n->next && (SKIP_BACK(timer, n, n)->expires < t->expires)) n = n->next; insert_node(&t->n, n->prev); } /** * tm_start - start a timer * @t: timer * @after: number of seconds the timer should be run after * * This function schedules the hook function of the timer to * be called after @after seconds. If the timer has been already * started, it's @expire time is replaced by the new value. * * You can have set the @randomize field of @t, the timeout * will be increased by a random number of seconds chosen * uniformly from range 0 .. @randomize. * * You can call tm_start() from the handler function of the timer * to request another run of the timer. Also, you can set the @recurrent * field to have the timer re-added automatically with the same timeout. */ void tm_start(timer *t, unsigned after) { bird_clock_t when; if (t->randomize) after += random() % (t->randomize + 1); when = now + after; if (t->expires == when) return; if (t->expires) rem_node(&t->n); t->expires = when; if (after <= NEAR_TIMER_LIMIT) tm_insert_near(t); else { if (!first_far_timer || first_far_timer > when) first_far_timer = when; add_tail(&far_timers, &t->n); } } /** * tm_stop - stop a timer * @t: timer * * This function stops a timer. If the timer is already stopped, * nothing happens. */ void tm_stop(timer *t) { if (t->expires) { rem_node(&t->n); t->expires = 0; } } static void tm_dump_them(char *name, list *l) { node *n; timer *t; debug("%s timers:\n", name); WALK_LIST(n, *l) { t = SKIP_BACK(timer, n, n); debug("%p ", t); tm_dump(&t->r); } debug("\n"); } void tm_dump_all(void) { tm_dump_them("Near", &near_timers); tm_dump_them("Far", &far_timers); } static inline time_t tm_first_shot(void) { time_t x = first_far_timer; if (!EMPTY_LIST(near_timers)) { timer *t = SKIP_BACK(timer, n, HEAD(near_timers)); if (t->expires < x) x = t->expires; } return x; } void io_log_event(void *hook, void *data); static void tm_shot(void) { timer *t; node *n, *m; if (first_far_timer <= now) { bird_clock_t limit = now + NEAR_TIMER_LIMIT; first_far_timer = TIME_INFINITY; n = HEAD(far_timers); while (m = n->next) { t = SKIP_BACK(timer, n, n); if (t->expires <= limit) { rem_node(n); tm_insert_near(t); } else if (t->expires < first_far_timer) first_far_timer = t->expires; n = m; } } while ((n = HEAD(near_timers)) -> next) { int delay; t = SKIP_BACK(timer, n, n); if (t->expires > now) break; rem_node(n); delay = t->expires - now; t->expires = 0; if (t->recurrent) { int i = t->recurrent - delay; if (i < 0) i = 0; tm_start(t, i); } io_log_event(t->hook, t->data); t->hook(t); } } /** * tm_parse_datetime - parse a date and time * @x: datetime string * * tm_parse_datetime() takes a textual representation of * a date and time (dd-mm-yyyy hh:mm:ss) * and converts it to the corresponding value of type &bird_clock_t. */ bird_clock_t tm_parse_datetime(char *x) { struct tm tm; int n; time_t t; if (sscanf(x, "%d-%d-%d %d:%d:%d%n", &tm.tm_mday, &tm.tm_mon, &tm.tm_year, &tm.tm_hour, &tm.tm_min, &tm.tm_sec, &n) != 6 || x[n]) return tm_parse_date(x); tm.tm_mon--; tm.tm_year -= 1900; t = mktime(&tm); if (t == (time_t) -1) return 0; return t; } /** * tm_parse_date - parse a date * @x: date string * * tm_parse_date() takes a textual representation of a date (dd-mm-yyyy) * and converts it to the corresponding value of type &bird_clock_t. */ bird_clock_t tm_parse_date(char *x) { struct tm tm; int n; time_t t; if (sscanf(x, "%d-%d-%d%n", &tm.tm_mday, &tm.tm_mon, &tm.tm_year, &n) != 3 || x[n]) return 0; tm.tm_mon--; tm.tm_year -= 1900; tm.tm_hour = tm.tm_min = tm.tm_sec = 0; t = mktime(&tm); if (t == (time_t) -1) return 0; return t; } static void tm_format_reltime(char *x, struct tm *tm, bird_clock_t delta) { static char *month_names[12] = { "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" }; if (delta < 20*3600) bsprintf(x, "%02d:%02d", tm->tm_hour, tm->tm_min); else if (delta < 360*86400) bsprintf(x, "%s%02d", month_names[tm->tm_mon], tm->tm_mday); else bsprintf(x, "%d", tm->tm_year+1900); } #include "conf/conf.h" /** * tm_format_datetime - convert date and time to textual representation * @x: destination buffer of size %TM_DATETIME_BUFFER_SIZE * @fmt_spec: specification of resulting textual representation of the time * @t: time * * This function formats the given relative time value @t to a textual * date/time representation (dd-mm-yyyy hh:mm:ss) in real time. */ void tm_format_datetime(char *x, struct timeformat *fmt_spec, bird_clock_t t) { const char *fmt_used; struct tm *tm; bird_clock_t delta = now - t; t = now_real - delta; tm = localtime(&t); if (fmt_spec->fmt1 == NULL) return tm_format_reltime(x, tm, delta); if ((fmt_spec->limit == 0) || (delta < fmt_spec->limit)) fmt_used = fmt_spec->fmt1; else fmt_used = fmt_spec->fmt2; int rv = strftime(x, TM_DATETIME_BUFFER_SIZE, fmt_used, tm); if (((rv == 0) && fmt_used[0]) || (rv == TM_DATETIME_BUFFER_SIZE)) strcpy(x, ""); } /** * DOC: Sockets * * Socket resources represent network connections. Their data structure (&socket) * contains a lot of fields defining the exact type of the socket, the local and * remote addresses and ports, pointers to socket buffers and finally pointers to * hook functions to be called when new data have arrived to the receive buffer * (@rx_hook), when the contents of the transmit buffer have been transmitted * (@tx_hook) and when an error or connection close occurs (@err_hook). * * Freeing of sockets from inside socket hooks is perfectly safe. */ #ifndef SOL_IP #define SOL_IP IPPROTO_IP #endif #ifndef SOL_IPV6 #define SOL_IPV6 IPPROTO_IPV6 #endif #ifndef SOL_ICMPV6 #define SOL_ICMPV6 IPPROTO_ICMPV6 #endif /* * Sockaddr helper functions */ static inline int UNUSED sockaddr_length(int af) { return (af == AF_INET) ? sizeof(struct sockaddr_in) : sizeof(struct sockaddr_in6); } static inline void sockaddr_fill4(struct sockaddr_in *sa, ip_addr a, uint port) { memset(sa, 0, sizeof(struct sockaddr_in)); #ifdef HAVE_SIN_LEN sa->sin_len = sizeof(struct sockaddr_in); #endif sa->sin_family = AF_INET; sa->sin_port = htons(port); sa->sin_addr = ipa_to_in4(a); } static inline void sockaddr_fill6(struct sockaddr_in6 *sa, ip_addr a, struct iface *ifa, uint port) { memset(sa, 0, sizeof(struct sockaddr_in6)); #ifdef SIN6_LEN sa->sin6_len = sizeof(struct sockaddr_in6); #endif sa->sin6_family = AF_INET6; sa->sin6_port = htons(port); sa->sin6_flowinfo = 0; sa->sin6_addr = ipa_to_in6(a); if (ifa && ipa_is_link_local(a)) sa->sin6_scope_id = ifa->index; } void sockaddr_fill(sockaddr *sa, int af, ip_addr a, struct iface *ifa, uint port) { if (af == AF_INET) sockaddr_fill4((struct sockaddr_in *) sa, a, port); else if (af == AF_INET6) sockaddr_fill6((struct sockaddr_in6 *) sa, a, ifa, port); else bug("Unknown AF"); } static inline void sockaddr_read4(struct sockaddr_in *sa, ip_addr *a, uint *port) { *port = ntohs(sa->sin_port); *a = ipa_from_in4(sa->sin_addr); } static inline void sockaddr_read6(struct sockaddr_in6 *sa, ip_addr *a, struct iface **ifa, uint *port) { *port = ntohs(sa->sin6_port); *a = ipa_from_in6(sa->sin6_addr); if (ifa && ipa_is_link_local(*a)) *ifa = if_find_by_index(sa->sin6_scope_id); } int sockaddr_read(sockaddr *sa, int af, ip_addr *a, struct iface **ifa, uint *port) { if (sa->sa.sa_family != af) goto fail; if (af == AF_INET) sockaddr_read4((struct sockaddr_in *) sa, a, port); else if (af == AF_INET6) sockaddr_read6((struct sockaddr_in6 *) sa, a, ifa, port); else goto fail; return 0; fail: *a = IPA_NONE; *port = 0; return -1; } /* * IPv6 multicast syscalls */ /* Fortunately standardized in RFC 3493 */ #define INIT_MREQ6(maddr,ifa) \ { .ipv6mr_multiaddr = ipa_to_in6(maddr), .ipv6mr_interface = ifa->index } static inline int sk_setup_multicast6(sock *s) { int index = s->iface->index; int ttl = s->ttl; int n = 0; if (setsockopt(s->fd, SOL_IPV6, IPV6_MULTICAST_IF, &index, sizeof(index)) < 0) ERR("IPV6_MULTICAST_IF"); if (setsockopt(s->fd, SOL_IPV6, IPV6_MULTICAST_HOPS, &ttl, sizeof(ttl)) < 0) ERR("IPV6_MULTICAST_HOPS"); if (setsockopt(s->fd, SOL_IPV6, IPV6_MULTICAST_LOOP, &n, sizeof(n)) < 0) ERR("IPV6_MULTICAST_LOOP"); return 0; } static inline int sk_join_group6(sock *s, ip_addr maddr) { struct ipv6_mreq mr = INIT_MREQ6(maddr, s->iface); if (setsockopt(s->fd, SOL_IPV6, IPV6_JOIN_GROUP, &mr, sizeof(mr)) < 0) ERR("IPV6_JOIN_GROUP"); return 0; } static inline int sk_leave_group6(sock *s, ip_addr maddr) { struct ipv6_mreq mr = INIT_MREQ6(maddr, s->iface); if (setsockopt(s->fd, SOL_IPV6, IPV6_LEAVE_GROUP, &mr, sizeof(mr)) < 0) ERR("IPV6_LEAVE_GROUP"); return 0; } /* * IPv6 packet control messages */ /* Also standardized, in RFC 3542 */ /* * RFC 2292 uses IPV6_PKTINFO for both the socket option and the cmsg * type, RFC 3542 changed the socket option to IPV6_RECVPKTINFO. If we * don't have IPV6_RECVPKTINFO we suppose the OS implements the older * RFC and we use IPV6_PKTINFO. */ #ifndef IPV6_RECVPKTINFO #define IPV6_RECVPKTINFO IPV6_PKTINFO #endif /* * Same goes for IPV6_HOPLIMIT -> IPV6_RECVHOPLIMIT. */ #ifndef IPV6_RECVHOPLIMIT #define IPV6_RECVHOPLIMIT IPV6_HOPLIMIT #endif #define CMSG6_SPACE_PKTINFO CMSG_SPACE(sizeof(struct in6_pktinfo)) #define CMSG6_SPACE_TTL CMSG_SPACE(sizeof(int)) static inline int sk_request_cmsg6_pktinfo(sock *s) { int y = 1; if (setsockopt(s->fd, SOL_IPV6, IPV6_RECVPKTINFO, &y, sizeof(y)) < 0) ERR("IPV6_RECVPKTINFO"); return 0; } static inline int sk_request_cmsg6_ttl(sock *s) { int y = 1; if (setsockopt(s->fd, SOL_IPV6, IPV6_RECVHOPLIMIT, &y, sizeof(y)) < 0) ERR("IPV6_RECVHOPLIMIT"); return 0; } static inline void sk_process_cmsg6_pktinfo(sock *s, struct cmsghdr *cm) { if (cm->cmsg_type == IPV6_PKTINFO) { struct in6_pktinfo *pi = (struct in6_pktinfo *) CMSG_DATA(cm); s->laddr = ipa_from_in6(pi->ipi6_addr); s->lifindex = pi->ipi6_ifindex; } } static inline void sk_process_cmsg6_ttl(sock *s, struct cmsghdr *cm) { if (cm->cmsg_type == IPV6_HOPLIMIT) s->rcv_ttl = * (int *) CMSG_DATA(cm); } static inline void sk_prepare_cmsgs6(sock *s, struct msghdr *msg, void *cbuf, size_t cbuflen) { struct cmsghdr *cm; struct in6_pktinfo *pi; int controllen = 0; msg->msg_control = cbuf; msg->msg_controllen = cbuflen; cm = CMSG_FIRSTHDR(msg); cm->cmsg_level = SOL_IPV6; cm->cmsg_type = IPV6_PKTINFO; cm->cmsg_len = CMSG_LEN(sizeof(*pi)); controllen += CMSG_SPACE(sizeof(*pi)); pi = (struct in6_pktinfo *) CMSG_DATA(cm); pi->ipi6_ifindex = s->iface ? s->iface->index : 0; pi->ipi6_addr = ipa_to_in6(s->saddr); msg->msg_controllen = controllen; } /* * Miscellaneous socket syscalls */ static inline int sk_set_ttl4(sock *s, int ttl) { if (setsockopt(s->fd, SOL_IP, IP_TTL, &ttl, sizeof(ttl)) < 0) ERR("IP_TTL"); return 0; } static inline int sk_set_ttl6(sock *s, int ttl) { if (setsockopt(s->fd, SOL_IPV6, IPV6_UNICAST_HOPS, &ttl, sizeof(ttl)) < 0) ERR("IPV6_UNICAST_HOPS"); return 0; } static inline int sk_set_tos4(sock *s, int tos) { if (setsockopt(s->fd, SOL_IP, IP_TOS, &tos, sizeof(tos)) < 0) ERR("IP_TOS"); return 0; } static inline int sk_set_tos6(sock *s, int tos) { if (setsockopt(s->fd, SOL_IPV6, IPV6_TCLASS, &tos, sizeof(tos)) < 0) ERR("IPV6_TCLASS"); return 0; } static inline int sk_set_high_port(sock *s UNUSED) { /* Port range setting is optional, ignore it if not supported */ #ifdef IP_PORTRANGE if (sk_is_ipv4(s)) { int range = IP_PORTRANGE_HIGH; if (setsockopt(s->fd, SOL_IP, IP_PORTRANGE, &range, sizeof(range)) < 0) ERR("IP_PORTRANGE"); } #endif #ifdef IPV6_PORTRANGE if (sk_is_ipv6(s)) { int range = IPV6_PORTRANGE_HIGH; if (setsockopt(s->fd, SOL_IPV6, IPV6_PORTRANGE, &range, sizeof(range)) < 0) ERR("IPV6_PORTRANGE"); } #endif return 0; } static inline byte * sk_skip_ip_header(byte *pkt, int *len) { if ((*len < 20) || ((*pkt & 0xf0) != 0x40)) return NULL; int hlen = (*pkt & 0x0f) * 4; if ((hlen < 20) || (hlen > *len)) return NULL; *len -= hlen; return pkt + hlen; } byte * sk_rx_buffer(sock *s, int *len) { if (sk_is_ipv4(s) && (s->type == SK_IP)) return sk_skip_ip_header(s->rbuf, len); else return s->rbuf; } /* * Public socket functions */ /** * sk_setup_multicast - enable multicast for given socket * @s: socket * * Prepare transmission of multicast packets for given datagram socket. * The socket must have defined @iface. * * Result: 0 for success, -1 for an error. */ int sk_setup_multicast(sock *s) { ASSERT(s->iface); if (sk_is_ipv4(s)) return sk_setup_multicast4(s); else return sk_setup_multicast6(s); } /** * sk_join_group - join multicast group for given socket * @s: socket * @maddr: multicast address * * Join multicast group for given datagram socket and associated interface. * The socket must have defined @iface. * * Result: 0 for success, -1 for an error. */ int sk_join_group(sock *s, ip_addr maddr) { if (sk_is_ipv4(s)) return sk_join_group4(s, maddr); else return sk_join_group6(s, maddr); } /** * sk_leave_group - leave multicast group for given socket * @s: socket * @maddr: multicast address * * Leave multicast group for given datagram socket and associated interface. * The socket must have defined @iface. * * Result: 0 for success, -1 for an error. */ int sk_leave_group(sock *s, ip_addr maddr) { if (sk_is_ipv4(s)) return sk_leave_group4(s, maddr); else return sk_leave_group6(s, maddr); } /** * sk_setup_broadcast - enable broadcast for given socket * @s: socket * * Allow reception and transmission of broadcast packets for given datagram * socket. The socket must have defined @iface. For transmission, packets should * be send to @brd address of @iface. * * Result: 0 for success, -1 for an error. */ int sk_setup_broadcast(sock *s) { int y = 1; if (setsockopt(s->fd, SOL_SOCKET, SO_BROADCAST, &y, sizeof(y)) < 0) ERR("SO_BROADCAST"); return 0; } /** * sk_set_ttl - set transmit TTL for given socket * @s: socket * @ttl: TTL value * * Set TTL for already opened connections when TTL was not set before. Useful * for accepted connections when different ones should have different TTL. * * Result: 0 for success, -1 for an error. */ int sk_set_ttl(sock *s, int ttl) { s->ttl = ttl; if (sk_is_ipv4(s)) return sk_set_ttl4(s, ttl); else return sk_set_ttl6(s, ttl); } /** * sk_set_min_ttl - set minimal accepted TTL for given socket * @s: socket * @ttl: TTL value * * Set minimal accepted TTL for given socket. Can be used for TTL security. * implementations. * * Result: 0 for success, -1 for an error. */ int sk_set_min_ttl(sock *s, int ttl) { if (sk_is_ipv4(s)) return sk_set_min_ttl4(s, ttl); else return sk_set_min_ttl6(s, ttl); } #if 0 /** * sk_set_md5_auth - add / remove MD5 security association for given socket * @s: socket * @local: IP address of local side * @remote: IP address of remote side * @ifa: Interface for link-local IP address * @passwd: Password used for MD5 authentication * @setkey: Update also system SA/SP database * * In TCP MD5 handling code in kernel, there is a set of security associations * used for choosing password and other authentication parameters according to * the local and remote address. This function is useful for listening socket, * for active sockets it may be enough to set s->password field. * * When called with passwd != NULL, the new pair is added, * When called with passwd == NULL, the existing pair is removed. * * Note that while in Linux, the MD5 SAs are specific to socket, in BSD they are * stored in global SA/SP database (but the behavior also must be enabled on * per-socket basis). In case of multiple sockets to the same neighbor, the * socket-specific state must be configured for each socket while global state * just once per src-dst pair. The @setkey argument controls whether the global * state (SA/SP database) is also updated. * * Result: 0 for success, -1 for an error. */ int sk_set_md5_auth(sock *s, ip_addr local, ip_addr remote, struct iface *ifa, char *passwd, int setkey) { DUMMY; } #endif /** * sk_set_ipv6_checksum - specify IPv6 checksum offset for given socket * @s: socket * @offset: offset * * Specify IPv6 checksum field offset for given raw IPv6 socket. After that, the * kernel will automatically fill it for outgoing packets and check it for * incoming packets. Should not be used on ICMPv6 sockets, where the position is * known to the kernel. * * Result: 0 for success, -1 for an error. */ int sk_set_ipv6_checksum(sock *s, int offset) { if (setsockopt(s->fd, SOL_IPV6, IPV6_CHECKSUM, &offset, sizeof(offset)) < 0) ERR("IPV6_CHECKSUM"); return 0; } int sk_set_icmp6_filter(sock *s, int p1, int p2) { /* a bit of lame interface, but it is here only for Radv */ struct icmp6_filter f; ICMP6_FILTER_SETBLOCKALL(&f); ICMP6_FILTER_SETPASS(p1, &f); ICMP6_FILTER_SETPASS(p2, &f); if (setsockopt(s->fd, SOL_ICMPV6, ICMP6_FILTER, &f, sizeof(f)) < 0) ERR("ICMP6_FILTER"); return 0; } void sk_log_error(sock *s, const char *p) { log(L_ERR "%s: Socket error: %s%#m", p, s->err); } /* * Actual struct birdsock code */ static list sock_list; static struct birdsock *current_sock; static struct birdsock *stored_sock; static inline sock * sk_next(sock *s) { if (!s->n.next->next) return NULL; else return SKIP_BACK(sock, n, s->n.next); } static void sk_alloc_bufs(sock *s) { if (!s->rbuf && s->rbsize) s->rbuf = s->rbuf_alloc = xmalloc(s->rbsize); s->rpos = s->rbuf; if (!s->tbuf && s->tbsize) s->tbuf = s->tbuf_alloc = xmalloc(s->tbsize); s->tpos = s->ttx = s->tbuf; } static void sk_free_bufs(sock *s) { if (s->rbuf_alloc) { xfree(s->rbuf_alloc); s->rbuf = s->rbuf_alloc = NULL; } if (s->tbuf_alloc) { xfree(s->tbuf_alloc); s->tbuf = s->tbuf_alloc = NULL; } } static void sk_free(resource *r) { sock *s = (sock *) r; sk_free_bufs(s); if (s->fd >= 0) { close(s->fd); /* FIXME: we should call sk_stop() for SKF_THREAD sockets */ if (s->flags & SKF_THREAD) return; if (s == current_sock) current_sock = sk_next(s); if (s == stored_sock) stored_sock = sk_next(s); rem_node(&s->n); } } void sk_set_rbsize(sock *s, uint val) { ASSERT(s->rbuf_alloc == s->rbuf); if (s->rbsize == val) return; s->rbsize = val; xfree(s->rbuf_alloc); s->rbuf_alloc = xmalloc(val); s->rpos = s->rbuf = s->rbuf_alloc; } void sk_set_tbsize(sock *s, uint val) { ASSERT(s->tbuf_alloc == s->tbuf); if (s->tbsize == val) return; byte *old_tbuf = s->tbuf; s->tbsize = val; s->tbuf = s->tbuf_alloc = xrealloc(s->tbuf_alloc, val); s->tpos = s->tbuf + (s->tpos - old_tbuf); s->ttx = s->tbuf + (s->ttx - old_tbuf); } void sk_set_tbuf(sock *s, void *tbuf) { s->tbuf = tbuf ?: s->tbuf_alloc; s->ttx = s->tpos = s->tbuf; } void sk_reallocate(sock *s) { sk_free_bufs(s); sk_alloc_bufs(s); } static void sk_dump(resource *r) { sock *s = (sock *) r; static char *sk_type_names[] = { "TCP<", "TCP>", "TCP", "UDP", NULL, "IP", NULL, "MAGIC", "UNIX<", "UNIX", "DEL!" }; debug("(%s, ud=%p, sa=%I, sp=%d, da=%I, dp=%d, tos=%d, ttl=%d, if=%s)\n", sk_type_names[s->type], s->data, s->saddr, s->sport, s->daddr, s->dport, s->tos, s->ttl, s->iface ? s->iface->name : "none"); } static struct resclass sk_class = { "Socket", sizeof(sock), sk_free, sk_dump, NULL, NULL }; /** * sk_new - create a socket * @p: pool * * This function creates a new socket resource. If you want to use it, * you need to fill in all the required fields of the structure and * call sk_open() to do the actual opening of the socket. * * The real function name is sock_new(), sk_new() is a macro wrapper * to avoid collision with OpenSSL. */ sock * sock_new(pool *p) { sock *s = ralloc(p, &sk_class); s->pool = p; // s->saddr = s->daddr = IPA_NONE; s->tos = s->priority = s->ttl = -1; s->fd = -1; return s; } static int sk_setup(sock *s) { int y = 1; int fd = s->fd; if (fcntl(fd, F_SETFL, O_NONBLOCK) < 0) ERR("O_NONBLOCK"); if (!s->af) return 0; if (ipa_nonzero(s->saddr) && !(s->flags & SKF_BIND)) s->flags |= SKF_PKTINFO; #ifdef CONFIG_USE_HDRINCL if (sk_is_ipv4(s) && (s->type == SK_IP) && (s->flags & SKF_PKTINFO)) { s->flags &= ~SKF_PKTINFO; s->flags |= SKF_HDRINCL; if (setsockopt(fd, SOL_IP, IP_HDRINCL, &y, sizeof(y)) < 0) ERR("IP_HDRINCL"); } #endif if (s->iface) { #ifdef SO_BINDTODEVICE struct ifreq ifr = {}; strcpy(ifr.ifr_name, s->iface->name); if (setsockopt(s->fd, SOL_SOCKET, SO_BINDTODEVICE, &ifr, sizeof(ifr)) < 0) ERR("SO_BINDTODEVICE"); #endif #ifdef CONFIG_UNIX_DONTROUTE if (setsockopt(s->fd, SOL_SOCKET, SO_DONTROUTE, &y, sizeof(y)) < 0) ERR("SO_DONTROUTE"); #endif } if (s->priority >= 0) if (sk_set_priority(s, s->priority) < 0) return -1; if (sk_is_ipv4(s)) { if (s->flags & SKF_LADDR_RX) if (sk_request_cmsg4_pktinfo(s) < 0) return -1; if (s->flags & SKF_TTL_RX) if (sk_request_cmsg4_ttl(s) < 0) return -1; if ((s->type == SK_UDP) || (s->type == SK_IP)) if (sk_disable_mtu_disc4(s) < 0) return -1; if (s->ttl >= 0) if (sk_set_ttl4(s, s->ttl) < 0) return -1; if (s->tos >= 0) if (sk_set_tos4(s, s->tos) < 0) return -1; } if (sk_is_ipv6(s)) { if (s->flags & SKF_V6ONLY) if (setsockopt(fd, SOL_IPV6, IPV6_V6ONLY, &y, sizeof(y)) < 0) ERR("IPV6_V6ONLY"); if (s->flags & SKF_LADDR_RX) if (sk_request_cmsg6_pktinfo(s) < 0) return -1; if (s->flags & SKF_TTL_RX) if (sk_request_cmsg6_ttl(s) < 0) return -1; if ((s->type == SK_UDP) || (s->type == SK_IP)) if (sk_disable_mtu_disc6(s) < 0) return -1; if (s->ttl >= 0) if (sk_set_ttl6(s, s->ttl) < 0) return -1; if (s->tos >= 0) if (sk_set_tos6(s, s->tos) < 0) return -1; } return 0; } static void sk_insert(sock *s) { add_tail(&sock_list, &s->n); } static void sk_tcp_connected(sock *s) { sockaddr sa; int sa_len = sizeof(sa); if ((getsockname(s->fd, &sa.sa, &sa_len) < 0) || (sockaddr_read(&sa, s->af, &s->saddr, &s->iface, &s->sport) < 0)) log(L_WARN "SOCK: Cannot get local IP address for TCP>"); s->type = SK_TCP; sk_alloc_bufs(s); s->tx_hook(s); } static int sk_passive_connected(sock *s, int type) { sockaddr loc_sa, rem_sa; int loc_sa_len = sizeof(loc_sa); int rem_sa_len = sizeof(rem_sa); int fd = accept(s->fd, ((type == SK_TCP) ? &rem_sa.sa : NULL), &rem_sa_len); if (fd < 0) { if ((errno != EINTR) && (errno != EAGAIN)) s->err_hook(s, errno); return 0; } sock *t = sk_new(s->pool); t->type = type; t->fd = fd; t->af = s->af; t->ttl = s->ttl; t->tos = s->tos; t->rbsize = s->rbsize; t->tbsize = s->tbsize; if (type == SK_TCP) { if ((getsockname(fd, &loc_sa.sa, &loc_sa_len) < 0) || (sockaddr_read(&loc_sa, s->af, &t->saddr, &t->iface, &t->sport) < 0)) log(L_WARN "SOCK: Cannot get local IP address for TCP<"); if (sockaddr_read(&rem_sa, s->af, &t->daddr, &t->iface, &t->dport) < 0) log(L_WARN "SOCK: Cannot get remote IP address for TCP<"); } if (sk_setup(t) < 0) { /* FIXME: Call err_hook instead ? */ log(L_ERR "SOCK: Incoming connection: %s%#m", t->err); /* FIXME: handle it better in rfree() */ close(t->fd); t->fd = -1; rfree(t); return 1; } sk_insert(t); sk_alloc_bufs(t); s->rx_hook(t, 0); return 1; } /** * sk_open - open a socket * @s: socket * * This function takes a socket resource created by sk_new() and * initialized by the user and binds a corresponding network connection * to it. * * Result: 0 for success, -1 for an error. */ int sk_open(sock *s) { int af = BIRD_AF; int fd = -1; int do_bind = 0; int bind_port = 0; ip_addr bind_addr = IPA_NONE; sockaddr sa; switch (s->type) { case SK_TCP_ACTIVE: s->ttx = ""; /* Force s->ttx != s->tpos */ /* Fall thru */ case SK_TCP_PASSIVE: fd = socket(af, SOCK_STREAM, IPPROTO_TCP); bind_port = s->sport; bind_addr = s->saddr; do_bind = bind_port || ipa_nonzero(bind_addr); break; case SK_UDP: fd = socket(af, SOCK_DGRAM, IPPROTO_UDP); bind_port = s->sport; bind_addr = (s->flags & SKF_BIND) ? s->saddr : IPA_NONE; do_bind = 1; break; case SK_IP: fd = socket(af, SOCK_RAW, s->dport); bind_port = 0; bind_addr = (s->flags & SKF_BIND) ? s->saddr : IPA_NONE; do_bind = ipa_nonzero(bind_addr); break; case SK_MAGIC: af = 0; fd = s->fd; break; default: bug("sk_open() called for invalid sock type %d", s->type); } if (fd < 0) ERR("socket"); s->af = af; s->fd = fd; if (sk_setup(s) < 0) goto err; if (do_bind) { if (bind_port) { int y = 1; if (setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, &y, sizeof(y)) < 0) ERR2("SO_REUSEADDR"); #ifdef CONFIG_NO_IFACE_BIND /* Workaround missing ability to bind to an iface */ if ((s->type == SK_UDP) && s->iface && ipa_zero(bind_addr)) { if (setsockopt(fd, SOL_SOCKET, SO_REUSEPORT, &y, sizeof(y)) < 0) ERR2("SO_REUSEPORT"); } #endif } else if (s->flags & SKF_HIGH_PORT) if (sk_set_high_port(s) < 0) log(L_WARN "Socket error: %s%#m", s->err); sockaddr_fill(&sa, af, bind_addr, s->iface, bind_port); if (bind(fd, &sa.sa, SA_LEN(sa)) < 0) ERR2("bind"); } if (s->password) if (sk_set_md5_auth(s, s->saddr, s->daddr, s->iface, s->password, 0) < 0) goto err; switch (s->type) { case SK_TCP_ACTIVE: sockaddr_fill(&sa, af, s->daddr, s->iface, s->dport); if (connect(fd, &sa.sa, SA_LEN(sa)) >= 0) sk_tcp_connected(s); else if (errno != EINTR && errno != EAGAIN && errno != EINPROGRESS && errno != ECONNREFUSED && errno != EHOSTUNREACH && errno != ENETUNREACH) ERR2("connect"); break; case SK_TCP_PASSIVE: if (listen(fd, 8) < 0) ERR2("listen"); break; case SK_MAGIC: break; default: sk_alloc_bufs(s); } if (!(s->flags & SKF_THREAD)) sk_insert(s); return 0; err: close(fd); s->fd = -1; return -1; } int sk_open_unix(sock *s, char *name) { struct sockaddr_un sa; int fd; /* We are sloppy during error (leak fd and not set s->err), but we die anyway */ fd = socket(AF_UNIX, SOCK_STREAM, 0); if (fd < 0) return -1; if (fcntl(fd, F_SETFL, O_NONBLOCK) < 0) return -1; /* Path length checked in test_old_bird() */ sa.sun_family = AF_UNIX; strcpy(sa.sun_path, name); if (bind(fd, (struct sockaddr *) &sa, SUN_LEN(&sa)) < 0) return -1; if (listen(fd, 8) < 0) return -1; s->fd = fd; sk_insert(s); return 0; } #define CMSG_RX_SPACE MAX(CMSG4_SPACE_PKTINFO+CMSG4_SPACE_TTL, \ CMSG6_SPACE_PKTINFO+CMSG6_SPACE_TTL) #define CMSG_TX_SPACE MAX(CMSG4_SPACE_PKTINFO,CMSG6_SPACE_PKTINFO) static void sk_prepare_cmsgs(sock *s, struct msghdr *msg, void *cbuf, size_t cbuflen) { if (sk_is_ipv4(s)) sk_prepare_cmsgs4(s, msg, cbuf, cbuflen); else sk_prepare_cmsgs6(s, msg, cbuf, cbuflen); } static void sk_process_cmsgs(sock *s, struct msghdr *msg) { struct cmsghdr *cm; s->laddr = IPA_NONE; s->lifindex = 0; s->rcv_ttl = -1; for (cm = CMSG_FIRSTHDR(msg); cm != NULL; cm = CMSG_NXTHDR(msg, cm)) { if ((cm->cmsg_level == SOL_IP) && sk_is_ipv4(s)) { sk_process_cmsg4_pktinfo(s, cm); sk_process_cmsg4_ttl(s, cm); } if ((cm->cmsg_level == SOL_IPV6) && sk_is_ipv6(s)) { sk_process_cmsg6_pktinfo(s, cm); sk_process_cmsg6_ttl(s, cm); } } } static inline int sk_sendmsg(sock *s) { struct iovec iov = {s->tbuf, s->tpos - s->tbuf}; byte cmsg_buf[CMSG_TX_SPACE]; sockaddr dst; sockaddr_fill(&dst, s->af, s->daddr, s->iface, s->dport); struct msghdr msg = { .msg_name = &dst.sa, .msg_namelen = SA_LEN(dst), .msg_iov = &iov, .msg_iovlen = 1 }; #ifdef CONFIG_USE_HDRINCL byte hdr[20]; struct iovec iov2[2] = { {hdr, 20}, iov }; if (s->flags & SKF_HDRINCL) { sk_prepare_ip_header(s, hdr, iov.iov_len); msg.msg_iov = iov2; msg.msg_iovlen = 2; } #endif if (s->flags & SKF_PKTINFO) sk_prepare_cmsgs(s, &msg, cmsg_buf, sizeof(cmsg_buf)); return sendmsg(s->fd, &msg, 0); } static inline int sk_recvmsg(sock *s) { struct iovec iov = {s->rbuf, s->rbsize}; byte cmsg_buf[CMSG_RX_SPACE]; sockaddr src; struct msghdr msg = { .msg_name = &src.sa, .msg_namelen = sizeof(src), // XXXX ?? .msg_iov = &iov, .msg_iovlen = 1, .msg_control = cmsg_buf, .msg_controllen = sizeof(cmsg_buf), .msg_flags = 0 }; int rv = recvmsg(s->fd, &msg, 0); if (rv < 0) return rv; //ifdef IPV4 // if (cf_type == SK_IP) // rv = ipv4_skip_header(pbuf, rv); //endif sockaddr_read(&src, s->af, &s->faddr, NULL, &s->fport); sk_process_cmsgs(s, &msg); if (msg.msg_flags & MSG_TRUNC) s->flags |= SKF_TRUNCATED; else s->flags &= ~SKF_TRUNCATED; return rv; } static inline void reset_tx_buffer(sock *s) { s->ttx = s->tpos = s->tbuf; } static int sk_maybe_write(sock *s) { int e; switch (s->type) { case SK_TCP: case SK_MAGIC: case SK_UNIX: while (s->ttx != s->tpos) { e = write(s->fd, s->ttx, s->tpos - s->ttx); if (e < 0) { if (errno != EINTR && errno != EAGAIN) { reset_tx_buffer(s); /* EPIPE is just a connection close notification during TX */ s->err_hook(s, (errno != EPIPE) ? errno : 0); return -1; } return 0; } s->ttx += e; } reset_tx_buffer(s); return 1; case SK_UDP: case SK_IP: { if (s->tbuf == s->tpos) return 1; e = sk_sendmsg(s); if (e < 0) { if (errno != EINTR && errno != EAGAIN) { reset_tx_buffer(s); s->err_hook(s, errno); return -1; } if (!s->tx_hook) reset_tx_buffer(s); return 0; } reset_tx_buffer(s); return 1; } default: bug("sk_maybe_write: unknown socket type %d", s->type); } } int sk_rx_ready(sock *s) { int rv; struct pollfd pfd = { .fd = s->fd }; pfd.events |= POLLIN; redo: rv = poll(&pfd, 1, 0); if ((rv < 0) && (errno == EINTR || errno == EAGAIN)) goto redo; return rv; } /** * sk_send - send data to a socket * @s: socket * @len: number of bytes to send * * This function sends @len bytes of data prepared in the * transmit buffer of the socket @s to the network connection. * If the packet can be sent immediately, it does so and returns * 1, else it queues the packet for later processing, returns 0 * and calls the @tx_hook of the socket when the tranmission * takes place. */ int sk_send(sock *s, unsigned len) { s->ttx = s->tbuf; s->tpos = s->tbuf + len; return sk_maybe_write(s); } /** * sk_send_to - send data to a specific destination * @s: socket * @len: number of bytes to send * @addr: IP address to send the packet to * @port: port to send the packet to * * This is a sk_send() replacement for connection-less packet sockets * which allows destination of the packet to be chosen dynamically. * Raw IP sockets should use 0 for @port. */ int sk_send_to(sock *s, unsigned len, ip_addr addr, unsigned port) { s->daddr = addr; if (port) s->dport = port; s->ttx = s->tbuf; s->tpos = s->tbuf + len; return sk_maybe_write(s); } /* int sk_send_full(sock *s, unsigned len, struct iface *ifa, ip_addr saddr, ip_addr daddr, unsigned dport) { s->iface = ifa; s->saddr = saddr; s->daddr = daddr; s->dport = dport; s->ttx = s->tbuf; s->tpos = s->tbuf + len; return sk_maybe_write(s); } */ /* sk_read() and sk_write() are called from BFD's event loop */ int sk_read(sock *s, int revents) { switch (s->type) { case SK_TCP_PASSIVE: return sk_passive_connected(s, SK_TCP); case SK_UNIX_PASSIVE: return sk_passive_connected(s, SK_UNIX); case SK_TCP: case SK_UNIX: { int c = read(s->fd, s->rpos, s->rbuf + s->rbsize - s->rpos); if (c < 0) { if (errno != EINTR && errno != EAGAIN) s->err_hook(s, errno); else if (errno == EAGAIN && !(revents & POLLIN)) { log(L_ERR "Got EAGAIN from read when revents=%x (without POLLIN)", revents); s->err_hook(s, 0); } } else if (!c) s->err_hook(s, 0); else { s->rpos += c; if (s->rx_hook(s, s->rpos - s->rbuf)) { /* We need to be careful since the socket could have been deleted by the hook */ if (current_sock == s) s->rpos = s->rbuf; } return 1; } return 0; } case SK_MAGIC: return s->rx_hook(s, 0); default: { int e = sk_recvmsg(s); if (e < 0) { if (errno != EINTR && errno != EAGAIN) s->err_hook(s, errno); return 0; } s->rpos = s->rbuf + e; s->rx_hook(s, e); return 1; } } } int sk_write(sock *s) { switch (s->type) { case SK_TCP_ACTIVE: { sockaddr sa; sockaddr_fill(&sa, s->af, s->daddr, s->iface, s->dport); if (connect(s->fd, &sa.sa, SA_LEN(sa)) >= 0 || errno == EISCONN) sk_tcp_connected(s); else if (errno != EINTR && errno != EAGAIN && errno != EINPROGRESS) s->err_hook(s, errno); return 0; } default: if (s->ttx != s->tpos && sk_maybe_write(s) > 0) { if (s->tx_hook) s->tx_hook(s); return 1; } return 0; } } void sk_err(sock *s, int revents) { int se = 0, sse = sizeof(se); if ((s->type != SK_MAGIC) && (revents & POLLERR)) if (getsockopt(s->fd, SOL_SOCKET, SO_ERROR, &se, &sse) < 0) { log(L_ERR "IO: Socket error: SO_ERROR: %m"); se = 0; } s->err_hook(s, se); } void sk_dump_all(void) { node *n; sock *s; debug("Open sockets:\n"); WALK_LIST(n, sock_list) { s = SKIP_BACK(sock, n, n); debug("%p ", s); sk_dump(&s->r); } debug("\n"); } /* * Internal event log and watchdog */ #define EVENT_LOG_LENGTH 32 struct event_log_entry { void *hook; void *data; btime timestamp; btime duration; }; static struct event_log_entry event_log[EVENT_LOG_LENGTH]; static struct event_log_entry *event_open; static int event_log_pos, event_log_num, watchdog_active; static btime last_time; static btime loop_time; static void io_update_time(void) { struct timespec ts; int rv; if (!clock_monotonic_available) return; /* * This is third time-tracking procedure (after update_times() above and * times_update() in BFD), dedicated to internal event log and latency * tracking. Hopefully, we consolidate these sometimes. */ rv = clock_gettime(CLOCK_MONOTONIC, &ts); if (rv < 0) die("clock_gettime: %m"); last_time = ((s64) ts.tv_sec S) + (ts.tv_nsec / 1000); if (event_open) { event_open->duration = last_time - event_open->timestamp; if (event_open->duration > config->latency_limit) log(L_WARN "Event 0x%p 0x%p took %d ms", event_open->hook, event_open->data, (int) (event_open->duration TO_MS)); event_open = NULL; } } /** * io_log_event - mark approaching event into event log * @hook: event hook address * @data: event data address * * Store info (hook, data, timestamp) about the following internal event into * a circular event log (@event_log). When latency tracking is enabled, the log * entry is kept open (in @event_open) so the duration can be filled later. */ void io_log_event(void *hook, void *data) { if (config->latency_debug) io_update_time(); struct event_log_entry *en = event_log + event_log_pos; en->hook = hook; en->data = data; en->timestamp = last_time; en->duration = 0; event_log_num++; event_log_pos++; event_log_pos %= EVENT_LOG_LENGTH; event_open = config->latency_debug ? en : NULL; } static inline void io_close_event(void) { if (event_open) io_update_time(); } void io_log_dump(void) { int i; log(L_DEBUG "Event log:"); for (i = 0; i < EVENT_LOG_LENGTH; i++) { struct event_log_entry *en = event_log + (event_log_pos + i) % EVENT_LOG_LENGTH; if (en->hook) log(L_DEBUG " Event 0x%p 0x%p at %8d for %d ms", en->hook, en->data, (int) ((last_time - en->timestamp) TO_MS), (int) (en->duration TO_MS)); } } void watchdog_sigalrm(int sig UNUSED) { /* Update last_time and duration, but skip latency check */ config->latency_limit = 0xffffffff; io_update_time(); /* We want core dump */ abort(); } static inline void watchdog_start1(void) { io_update_time(); loop_time = last_time; } static inline void watchdog_start(void) { io_update_time(); loop_time = last_time; event_log_num = 0; if (config->watchdog_timeout) { alarm(config->watchdog_timeout); watchdog_active = 1; } } static inline void watchdog_stop(void) { io_update_time(); if (watchdog_active) { alarm(0); watchdog_active = 0; } btime duration = last_time - loop_time; if (duration > config->watchdog_warning) log(L_WARN "I/O loop cycle took %d ms for %d events", (int) (duration TO_MS), event_log_num); } /* * Main I/O Loop */ volatile int async_config_flag; /* Asynchronous reconfiguration/dump scheduled */ volatile int async_dump_flag; volatile int async_shutdown_flag; void io_init(void) { init_list(&near_timers); init_list(&far_timers); init_list(&sock_list); init_list(&global_event_list); krt_io_init(); init_times(); update_times(); boot_time = now; srandom((int) now_real); } static int short_loops = 0; #define SHORT_LOOP_MAX 10 void io_loop(void) { int poll_tout; time_t tout; int nfds, events, pout; sock *s; node *n; int fdmax = 256; struct pollfd *pfd = xmalloc(fdmax * sizeof(struct pollfd)); watchdog_start1(); for(;;) { events = ev_run_list(&global_event_list); timers: update_times(); tout = tm_first_shot(); if (tout <= now) { tm_shot(); goto timers; } poll_tout = (events ? 0 : MIN(tout - now, 3)) * 1000; /* Time in milliseconds */ io_close_event(); nfds = 0; WALK_LIST(n, sock_list) { pfd[nfds] = (struct pollfd) { .fd = -1 }; /* everything other set to 0 by this */ s = SKIP_BACK(sock, n, n); if (s->rx_hook) { pfd[nfds].fd = s->fd; pfd[nfds].events |= POLLIN; } if (s->tx_hook && s->ttx != s->tpos) { pfd[nfds].fd = s->fd; pfd[nfds].events |= POLLOUT; } if (pfd[nfds].fd != -1) { s->index = nfds; nfds++; } else s->index = -1; if (nfds >= fdmax) { fdmax *= 2; pfd = xrealloc(pfd, fdmax * sizeof(struct pollfd)); } } /* * Yes, this is racy. But even if the signal comes before this test * and entering poll(), it gets caught on the next timer tick. */ if (async_config_flag) { io_log_event(async_config, NULL); async_config(); async_config_flag = 0; continue; } if (async_dump_flag) { io_log_event(async_dump, NULL); async_dump(); async_dump_flag = 0; continue; } if (async_shutdown_flag) { io_log_event(async_shutdown, NULL); async_shutdown(); async_shutdown_flag = 0; continue; } /* And finally enter poll() to find active sockets */ watchdog_stop(); pout = poll(pfd, nfds, poll_tout); watchdog_start(); if (pout < 0) { if (errno == EINTR || errno == EAGAIN) continue; die("poll: %m"); } if (pout) { /* guaranteed to be non-empty */ current_sock = SKIP_BACK(sock, n, HEAD(sock_list)); while (current_sock) { sock *s = current_sock; if (s->index == -1) { current_sock = sk_next(s); goto next; } int e; int steps; steps = MAX_STEPS; if (s->fast_rx && (pfd[s->index].revents & POLLIN) && s->rx_hook) do { steps--; io_log_event(s->rx_hook, s->data); e = sk_read(s, pfd[s->index].revents); if (s != current_sock) goto next; } while (e && s->rx_hook && steps); steps = MAX_STEPS; if (pfd[s->index].revents & POLLOUT) do { steps--; io_log_event(s->tx_hook, s->data); e = sk_write(s); if (s != current_sock) goto next; } while (e && steps); current_sock = sk_next(s); next: ; } short_loops++; if (events && (short_loops < SHORT_LOOP_MAX)) continue; short_loops = 0; int count = 0; current_sock = stored_sock; if (current_sock == NULL) current_sock = SKIP_BACK(sock, n, HEAD(sock_list)); while (current_sock && count < MAX_RX_STEPS) { sock *s = current_sock; if (s->index == -1) { current_sock = sk_next(s); goto next2; } if (!s->fast_rx && (pfd[s->index].revents & POLLIN) && s->rx_hook) { count++; io_log_event(s->rx_hook, s->data); sk_read(s, pfd[s->index].revents); if (s != current_sock) goto next2; } if (pfd[s->index].revents & (POLLHUP | POLLERR)) { sk_err(s, pfd[s->index].revents); if (s != current_sock) goto next2; } current_sock = sk_next(s); next2: ; } stored_sock = current_sock; } } } void test_old_bird(char *path) { int fd; struct sockaddr_un sa; fd = socket(AF_UNIX, SOCK_STREAM, 0); if (fd < 0) die("Cannot create socket: %m"); if (strlen(path) >= sizeof(sa.sun_path)) die("Socket path too long"); bzero(&sa, sizeof(sa)); sa.sun_family = AF_UNIX; strcpy(sa.sun_path, path); if (connect(fd, (struct sockaddr *) &sa, SUN_LEN(&sa)) == 0) die("I found another BIRD running."); close(fd); } bird-1.6.3/sysdep/unix/krt.h0000644000103200001440000001043713027054563014702 0ustar feelausers/* * BIRD -- UNIX Kernel Route Syncer * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_KRT_H_ #define _BIRD_KRT_H_ struct config; struct krt_config; struct krt_proto; struct kif_config; struct kif_proto; #include "lib/krt-sys.h" /* Flags stored in net->n.flags, rest are in nest/route.h */ #define KRF_VERDICT_MASK 0x0f #define KRF_CREATE 0 /* Not seen in kernel table */ #define KRF_SEEN 1 /* Seen in kernel table during last scan */ #define KRF_UPDATE 2 /* Need to update this entry */ #define KRF_DELETE 3 /* Should be deleted */ #define KRF_IGNORE 4 /* To be ignored */ #define KRT_DEFAULT_ECMP_LIMIT 16 #define EA_KRT_SOURCE EA_CODE(EAP_KRT, 0) #define EA_KRT_METRIC EA_CODE(EAP_KRT, 1) /* Whenever we recognize our own routes, we allow learing of foreign routes */ #ifdef CONFIG_SELF_CONSCIOUS #define KRT_ALLOW_LEARN #endif /* krt.c */ extern struct protocol proto_unix_kernel; struct krt_config { struct proto_config c; struct krt_params sys; /* Sysdep params */ int persist; /* Keep routes when we exit */ int scan_time; /* How often we re-scan routes */ int learn; /* Learn routes from other sources */ int devroutes; /* Allow export of device routes */ int graceful_restart; /* Regard graceful restart recovery */ int merge_paths; /* Exported routes are merged for ECMP */ }; struct krt_proto { struct proto p; struct krt_state sys; /* Sysdep state */ #ifdef KRT_ALLOW_LEARN struct rtable krt_table; /* Internal table of inherited routes */ #endif #ifndef CONFIG_ALL_TABLES_AT_ONCE timer *scan_timer; #endif node krt_node; /* Node in krt_proto_list */ byte ready; /* Initial feed has been finished */ byte initialized; /* First scan has been finished */ byte reload; /* Next scan is doing reload */ }; extern pool *krt_pool; #define KRT_CF ((struct krt_config *)p->p.cf) #define KRT_TRACE(pr, fl, msg, args...) do { \ DBG("KRT: " msg "\n" , ## args); \ if (pr->p.debug & fl) \ { log(L_TRACE "%s: " msg, pr->p.name , ## args); } } while(0) struct proto_config * kif_init_config(int class); void kif_request_scan(void); void krt_got_route(struct krt_proto *p, struct rte *e); void krt_got_route_async(struct krt_proto *p, struct rte *e, int new); /* Values for rte->u.krt_sync.src */ #define KRT_SRC_UNKNOWN -1 /* Nobody knows */ #define KRT_SRC_BIRD 0 /* Our route (not passed in async mode) */ #define KRT_SRC_REDIRECT 1 /* Redirect route, delete it */ #define KRT_SRC_ALIEN 2 /* Route installed by someone else */ #define KRT_SRC_KERNEL 3 /* Kernel routes, are ignored by krt syncer */ extern struct protocol proto_unix_iface; struct kif_primary_item { node n; byte *pattern; ip_addr prefix; int pxlen; }; struct kif_config { struct proto_config c; struct kif_params sys; /* Sysdep params */ int scan_time; /* How often we re-scan interfaces */ list primary; /* Preferences for primary addresses (struct kif_primary_item) */ }; struct kif_proto { struct proto p; struct kif_state sys; /* Sysdep state */ }; struct kif_proto *kif_proto; #define KIF_CF ((struct kif_config *)p->p.cf) struct proto_config * krt_init_config(int class); /* krt sysdep */ void krt_sys_io_init(void); void krt_sys_init(struct krt_proto *); int krt_sys_start(struct krt_proto *); void krt_sys_shutdown(struct krt_proto *); int krt_sys_reconfigure(struct krt_proto *p UNUSED, struct krt_config *n, struct krt_config *o); void krt_sys_preconfig(struct config *); void krt_sys_postconfig(struct krt_config *); void krt_sys_init_config(struct krt_config *); void krt_sys_copy_config(struct krt_config *, struct krt_config *); int krt_capable(rte *e); void krt_do_scan(struct krt_proto *); void krt_replace_rte(struct krt_proto *p, net *n, rte *new, rte *old, struct ea_list *eattrs); int krt_sys_get_attr(eattr *a, byte *buf, int buflen); /* kif sysdep */ void kif_sys_init(struct kif_proto *); void kif_sys_start(struct kif_proto *); void kif_sys_shutdown(struct kif_proto *); int kif_sys_reconfigure(struct kif_proto *, struct kif_config *, struct kif_config *); void kif_sys_init_config(struct kif_config *); void kif_sys_copy_config(struct kif_config *, struct kif_config *); void kif_do_scan(struct kif_proto *); struct ifa *kif_get_primary_ip(struct iface *i); #endif bird-1.6.3/sysdep/unix/main.c0000644000103200001440000003745513027054563015032 0ustar feelausers/* * BIRD Internet Routing Daemon -- Unix Entry Point * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #undef LOCAL_DEBUG #ifndef _GNU_SOURCE #define _GNU_SOURCE #endif #include #include #include #include #include #include #include #include #include #include "nest/bird.h" #include "lib/lists.h" #include "lib/resource.h" #include "lib/socket.h" #include "lib/event.h" #include "lib/string.h" #include "nest/route.h" #include "nest/protocol.h" #include "nest/iface.h" #include "nest/cli.h" #include "nest/locks.h" #include "conf/conf.h" #include "filter/filter.h" #include "unix.h" #include "krt.h" /* * Debugging */ #ifdef DEBUGGING static int debug_flag = 1; #else static int debug_flag = 0; #endif void async_dump(void) { debug("INTERNAL STATE DUMP\n\n"); rdump(&root_pool); sk_dump_all(); tm_dump_all(); if_dump_all(); neigh_dump_all(); rta_dump_all(); rt_dump_all(); protos_dump_all(); debug("\n"); } /* * Dropping privileges */ #ifdef CONFIG_RESTRICTED_PRIVILEGES #include "lib/syspriv.h" #else static inline void drop_uid(uid_t uid UNUSED) { die("Cannot change user on this platform"); } #endif static inline void drop_gid(gid_t gid) { if (setgid(gid) < 0) die("setgid: %m"); } /* * Reading the Configuration */ #ifdef PATH_IPROUTE_DIR static inline void add_num_const(char *name, int val) { struct symbol *s = cf_get_symbol(name); s->class = SYM_CONSTANT | T_INT; s->def = cfg_allocz(sizeof(struct f_val)); SYM_TYPE(s) = T_INT; SYM_VAL(s).i = val; } /* the code of read_iproute_table() is based on rtnl_tab_initialize() from iproute2 package */ static void read_iproute_table(char *file, char *prefix, int max) { char buf[512], namebuf[512]; char *name; int val; FILE *fp; strcpy(namebuf, prefix); name = namebuf + strlen(prefix); fp = fopen(file, "r"); if (!fp) return; while (fgets(buf, sizeof(buf), fp)) { char *p = buf; while (*p == ' ' || *p == '\t') p++; if (*p == '#' || *p == '\n' || *p == 0) continue; if (sscanf(p, "0x%x %s\n", &val, name) != 2 && sscanf(p, "0x%x %s #", &val, name) != 2 && sscanf(p, "%d %s\n", &val, name) != 2 && sscanf(p, "%d %s #", &val, name) != 2) continue; if (val < 0 || val > max) continue; for(p = name; *p; p++) if ((*p < 'a' || *p > 'z') && (*p < '0' || *p > '9') && (*p != '_')) *p = '_'; add_num_const(namebuf, val); } fclose(fp); } #endif // PATH_IPROUTE_DIR static char *config_name = PATH_CONFIG_FILE; static int cf_read(byte *dest, uint len, int fd) { int l = read(fd, dest, len); if (l < 0) cf_error("Read error"); return l; } void sysdep_preconfig(struct config *c) { init_list(&c->logfiles); c->latency_limit = UNIX_DEFAULT_LATENCY_LIMIT; c->watchdog_warning = UNIX_DEFAULT_WATCHDOG_WARNING; #ifdef PATH_IPROUTE_DIR read_iproute_table(PATH_IPROUTE_DIR "/rt_protos", "ipp_", 256); read_iproute_table(PATH_IPROUTE_DIR "/rt_realms", "ipr_", 256); read_iproute_table(PATH_IPROUTE_DIR "/rt_scopes", "ips_", 256); read_iproute_table(PATH_IPROUTE_DIR "/rt_tables", "ipt_", 256); #endif } int sysdep_commit(struct config *new, struct config *old UNUSED) { log_switch(debug_flag, &new->logfiles, new->syslog_name); return 0; } static int unix_read_config(struct config **cp, char *name) { struct config *conf = config_alloc(name); int ret; *cp = conf; conf->file_fd = open(name, O_RDONLY); if (conf->file_fd < 0) return 0; cf_read_hook = cf_read; ret = config_parse(conf); close(conf->file_fd); return ret; } static struct config * read_config(void) { struct config *conf; if (!unix_read_config(&conf, config_name)) { if (conf->err_msg) die("%s, line %d: %s", conf->err_file_name, conf->err_lino, conf->err_msg); else die("Unable to open configuration file %s: %m", config_name); } return conf; } void async_config(void) { struct config *conf; log(L_INFO "Reconfiguration requested by SIGHUP"); if (!unix_read_config(&conf, config_name)) { if (conf->err_msg) log(L_ERR "%s, line %d: %s", conf->err_file_name, conf->err_lino, conf->err_msg); else log(L_ERR "Unable to open configuration file %s: %m", config_name); config_free(conf); } else config_commit(conf, RECONFIG_HARD, 0); } static struct config * cmd_read_config(char *name) { struct config *conf; if (!name) name = config_name; cli_msg(-2, "Reading configuration from %s", name); if (!unix_read_config(&conf, name)) { if (conf->err_msg) cli_msg(8002, "%s, line %d: %s", conf->err_file_name, conf->err_lino, conf->err_msg); else cli_msg(8002, "%s: %m", name); config_free(conf); conf = NULL; } return conf; } void cmd_check_config(char *name) { struct config *conf = cmd_read_config(name); if (!conf) return; cli_msg(20, "Configuration OK"); config_free(conf); } static void cmd_reconfig_msg(int r) { switch (r) { case CONF_DONE: cli_msg( 3, "Reconfigured"); break; case CONF_PROGRESS: cli_msg( 4, "Reconfiguration in progress"); break; case CONF_QUEUED: cli_msg( 5, "Reconfiguration already in progress, queueing new config"); break; case CONF_UNQUEUED: cli_msg(17, "Reconfiguration already in progress, removing queued config"); break; case CONF_CONFIRM: cli_msg(18, "Reconfiguration confirmed"); break; case CONF_SHUTDOWN: cli_msg( 6, "Reconfiguration ignored, shutting down"); break; case CONF_NOTHING: cli_msg(19, "Nothing to do"); break; default: break; } } /* Hack for scheduled undo notification */ cli *cmd_reconfig_stored_cli; void cmd_reconfig_undo_notify(void) { if (cmd_reconfig_stored_cli) { cli *c = cmd_reconfig_stored_cli; cli_printf(c, CLI_ASYNC_CODE, "Config timeout expired, starting undo"); cli_write_trigger(c); } } void cmd_reconfig(char *name, int type, int timeout) { if (cli_access_restricted()) return; struct config *conf = cmd_read_config(name); if (!conf) return; int r = config_commit(conf, type, timeout); if ((r >= 0) && (timeout > 0)) { cmd_reconfig_stored_cli = this_cli; cli_msg(-22, "Undo scheduled in %d s", timeout); } cmd_reconfig_msg(r); } void cmd_reconfig_confirm(void) { if (cli_access_restricted()) return; int r = config_confirm(); cmd_reconfig_msg(r); } void cmd_reconfig_undo(void) { if (cli_access_restricted()) return; cli_msg(-21, "Undo requested"); int r = config_undo(); cmd_reconfig_msg(r); } /* * Command-Line Interface */ static sock *cli_sk; static char *path_control_socket = PATH_CONTROL_SOCKET; static void cli_write(cli *c) { sock *s = c->priv; while (c->tx_pos) { struct cli_out *o = c->tx_pos; int len = o->wpos - o->outpos; s->tbuf = o->outpos; o->outpos = o->wpos; if (sk_send(s, len) <= 0) return; c->tx_pos = o->next; } /* Everything is written */ s->tbuf = NULL; cli_written(c); } void cli_write_trigger(cli *c) { sock *s = c->priv; if (s->tbuf == NULL) cli_write(c); } static void cli_tx(sock *s) { cli_write(s->data); } int cli_get_command(cli *c) { sock *s = c->priv; byte *t = c->rx_aux ? : s->rbuf; byte *tend = s->rpos; byte *d = c->rx_pos; byte *dend = c->rx_buf + CLI_RX_BUF_SIZE - 2; while (t < tend) { if (*t == '\r') t++; else if (*t == '\n') { t++; c->rx_pos = c->rx_buf; c->rx_aux = t; *d = 0; return (d < dend) ? 1 : -1; } else if (d < dend) *d++ = *t++; } c->rx_aux = s->rpos = s->rbuf; c->rx_pos = d; return 0; } static int cli_rx(sock *s, uint size UNUSED) { cli_kick(s->data); return 0; } static void cli_err(sock *s, int err) { if (config->cli_debug) { if (err) log(L_INFO "CLI connection dropped: %s", strerror(err)); else log(L_INFO "CLI connection closed"); } cli_free(s->data); } static int cli_connect(sock *s, uint size UNUSED) { cli *c; if (config->cli_debug) log(L_INFO "CLI connect"); s->rx_hook = cli_rx; s->tx_hook = cli_tx; s->err_hook = cli_err; s->data = c = cli_new(s); s->pool = c->pool; /* We need to have all the socket buffers allocated in the cli pool */ s->fast_rx = 1; c->rx_pos = c->rx_buf; c->rx_aux = NULL; rmove(s, c->pool); return 1; } static void cli_init_unix(uid_t use_uid, gid_t use_gid) { sock *s; cli_init(); s = cli_sk = sk_new(cli_pool); s->type = SK_UNIX_PASSIVE; s->rx_hook = cli_connect; s->rbsize = 1024; s->fast_rx = 1; /* Return value intentionally ignored */ unlink(path_control_socket); if (sk_open_unix(s, path_control_socket) < 0) die("Cannot create control socket %s: %m", path_control_socket); if (use_uid || use_gid) if (chown(path_control_socket, use_uid, use_gid) < 0) die("chown: %m"); if (chmod(path_control_socket, 0660) < 0) die("chmod: %m"); } /* * PID file */ static char *pid_file; static int pid_fd; static inline void open_pid_file(void) { if (!pid_file) return; pid_fd = open(pid_file, O_WRONLY|O_CREAT, 0664); if (pid_fd < 0) die("Cannot create PID file %s: %m", pid_file); } static inline void write_pid_file(void) { int pl, rv; char ps[24]; if (!pid_file) return; /* We don't use PID file for uniqueness, so no need for locking */ pl = bsnprintf(ps, sizeof(ps), "%ld\n", (long) getpid()); if (pl < 0) bug("PID buffer too small"); rv = ftruncate(pid_fd, 0); if (rv < 0) die("fruncate: %m"); rv = write(pid_fd, ps, pl); if(rv < 0) die("write: %m"); close(pid_fd); } static inline void unlink_pid_file(void) { if (pid_file) unlink(pid_file); } /* * Shutdown */ void cmd_shutdown(void) { if (cli_access_restricted()) return; cli_msg(7, "Shutdown requested"); order_shutdown(); } void async_shutdown(void) { DBG("Shutting down...\n"); order_shutdown(); } void sysdep_shutdown_done(void) { unlink_pid_file(); unlink(path_control_socket); log_msg(L_FATAL "Shutdown completed"); exit(0); } /* * Signals */ static void handle_sighup(int sig UNUSED) { DBG("Caught SIGHUP...\n"); async_config_flag = 1; } static void handle_sigusr(int sig UNUSED) { DBG("Caught SIGUSR...\n"); async_dump_flag = 1; } static void handle_sigterm(int sig UNUSED) { DBG("Caught SIGTERM...\n"); async_shutdown_flag = 1; } void watchdog_sigalrm(int sig UNUSED); static void signal_init(void) { struct sigaction sa; bzero(&sa, sizeof(sa)); sa.sa_handler = handle_sigusr; sa.sa_flags = SA_RESTART; sigaction(SIGUSR1, &sa, NULL); sa.sa_handler = handle_sighup; sa.sa_flags = SA_RESTART; sigaction(SIGHUP, &sa, NULL); sa.sa_handler = handle_sigterm; sa.sa_flags = SA_RESTART; sigaction(SIGTERM, &sa, NULL); sa.sa_handler = watchdog_sigalrm; sa.sa_flags = 0; sigaction(SIGALRM, &sa, NULL); signal(SIGPIPE, SIG_IGN); } /* * Parsing of command-line arguments */ static char *opt_list = "c:dD:ps:P:u:g:flRh"; static int parse_and_exit; char *bird_name; static char *use_user; static char *use_group; static int run_in_foreground = 0; static void display_usage(void) { fprintf(stderr, "Usage: %s [--version] [--help] [-c ] [OPTIONS]\n", bird_name); } static void display_help(void) { display_usage(); fprintf(stderr, "\n" "Options: \n" " -c Use given configuration file instead\n" " of prefix/etc/bird.conf\n" " -d Enable debug messages and run bird in foreground\n" " -D Log debug messages to given file instead of stderr\n" " -f Run bird in foreground\n" " -g Use given group ID\n" " -h, --help Display this information\n" " -l Look for a configuration file and a communication socket\n" " file in the current working directory\n" " -p Test configuration file and exit without start\n" " -P Create a PID file with given filename\n" " -R Apply graceful restart recovery after start\n" " -s Use given filename for a control socket\n" " -u Drop privileges and use given user ID\n" " --version Display version of BIRD\n"); exit(0); } static void display_version(void) { fprintf(stderr, "BIRD version " BIRD_VERSION "\n"); exit(0); } static inline char * get_bird_name(char *s, char *def) { char *t; if (!s) return def; t = strrchr(s, '/'); if (!t) return s; if (!t[1]) return def; return t+1; } static inline uid_t get_uid(const char *s) { struct passwd *pw; char *endptr; long int rv; if (!s) return 0; errno = 0; rv = strtol(s, &endptr, 10); if (!errno && !*endptr) return rv; pw = getpwnam(s); if (!pw) die("Cannot find user '%s'", s); return pw->pw_uid; } static inline gid_t get_gid(const char *s) { struct group *gr; char *endptr; long int rv; if (!s) return 0; errno = 0; rv = strtol(s, &endptr, 10); if (!errno && !*endptr) return rv; gr = getgrnam(s); if (!gr) die("Cannot find group '%s'", s); return gr->gr_gid; } static void parse_args(int argc, char **argv) { int config_changed = 0; int socket_changed = 0; int c; bird_name = get_bird_name(argv[0], "bird"); if (argc == 2) { if (!strcmp(argv[1], "--version")) display_version(); if (!strcmp(argv[1], "--help")) display_help(); } while ((c = getopt(argc, argv, opt_list)) >= 0) switch (c) { case 'c': config_name = optarg; config_changed = 1; break; case 'd': debug_flag |= 1; break; case 'D': log_init_debug(optarg); debug_flag |= 2; break; case 'p': parse_and_exit = 1; break; case 's': path_control_socket = optarg; socket_changed = 1; break; case 'P': pid_file = optarg; break; case 'u': use_user = optarg; break; case 'g': use_group = optarg; break; case 'f': run_in_foreground = 1; break; case 'l': if (!config_changed) config_name = xbasename(config_name); if (!socket_changed) path_control_socket = xbasename(path_control_socket); break; case 'R': graceful_restart_recovery(); break; case 'h': display_help(); break; default: fputc('\n', stderr); display_usage(); exit(1); } if (optind < argc) { display_usage(); exit(1); } } /* * Hic Est main() */ int main(int argc, char **argv) { #ifdef HAVE_LIBDMALLOC if (!getenv("DMALLOC_OPTIONS")) dmalloc_debug(0x2f03d00); #endif parse_args(argc, argv); if (debug_flag == 1) log_init_debug(""); log_switch(debug_flag, NULL, NULL); resource_init(); olock_init(); io_init(); rt_init(); if_init(); roa_init(); config_init(); uid_t use_uid = get_uid(use_user); gid_t use_gid = get_gid(use_group); if (!parse_and_exit) { test_old_bird(path_control_socket); cli_init_unix(use_uid, use_gid); } if (use_gid) drop_gid(use_gid); if (use_uid) drop_uid(use_uid); if (!parse_and_exit) open_pid_file(); protos_build(); proto_build(&proto_unix_kernel); proto_build(&proto_unix_iface); struct config *conf = read_config(); if (parse_and_exit) exit(0); if (!(debug_flag||run_in_foreground)) { pid_t pid = fork(); if (pid < 0) die("fork: %m"); if (pid) return 0; setsid(); close(0); if (open("/dev/null", O_RDWR) < 0) die("Cannot open /dev/null: %m"); dup2(0, 1); dup2(0, 2); } main_thread_init(); write_pid_file(); signal_init(); config_commit(conf, RECONFIG_HARD, 0); graceful_restart_init(); #ifdef LOCAL_DEBUG async_dump_flag = 1; #endif log(L_INFO "Started"); DBG("Entering I/O loop.\n"); io_loop(); bug("I/O loop died"); } bird-1.6.3/sysdep/unix/krt.Y0000644000103200001440000000470113027054563014660 0ustar feelausers/* * BIRD -- UNIX Kernel Syncer Configuration * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ CF_HDR #include "lib/krt.h" CF_DEFINES #define THIS_KRT ((struct krt_config *) this_proto) #define THIS_KIF ((struct kif_config *) this_proto) CF_DECLS CF_KEYWORDS(KERNEL, PERSIST, SCAN, TIME, LEARN, DEVICE, ROUTES, GRACEFUL, RESTART, KRT_SOURCE, KRT_METRIC, MERGE, PATHS) %type kern_mp_limit CF_GRAMMAR /* Kernel syncer protocol */ CF_ADDTO(proto, kern_proto '}') kern_proto_start: proto_start KERNEL { this_proto = krt_init_config($1); } ; CF_ADDTO(kern_proto, kern_proto_start proto_name '{') CF_ADDTO(kern_proto, kern_proto proto_item ';') CF_ADDTO(kern_proto, kern_proto kern_item ';') kern_mp_limit: /* empty */ { $$ = KRT_DEFAULT_ECMP_LIMIT; } | LIMIT expr { $$ = $2; if (($2 <= 0) || ($2 > 255)) cf_error("Merge paths limit must be in range 1-255"); } ; kern_item: PERSIST bool { THIS_KRT->persist = $2; } | SCAN TIME expr { /* Scan time of 0 means scan on startup only */ THIS_KRT->scan_time = $3; } | LEARN bool { THIS_KRT->learn = $2; #ifndef KRT_ALLOW_LEARN if ($2) cf_error("Learning of kernel routes not supported on this platform"); #endif } | DEVICE ROUTES bool { THIS_KRT->devroutes = $3; } | GRACEFUL RESTART bool { THIS_KRT->graceful_restart = $3; } | MERGE PATHS bool kern_mp_limit { THIS_KRT->merge_paths = $3 ? $4 : 0; #ifndef KRT_ALLOW_MERGE_PATHS if ($3) cf_error("Path merging not supported on this platform"); #endif } ; /* Kernel interface protocol */ CF_ADDTO(proto, kif_proto '}') kif_proto_start: proto_start DEVICE { this_proto = kif_init_config($1); } ; CF_ADDTO(kif_proto, kif_proto_start proto_name '{') CF_ADDTO(kif_proto, kif_proto proto_item ';') CF_ADDTO(kif_proto, kif_proto kif_item ';') kif_item: SCAN TIME expr { /* Scan time of 0 means scan on startup only */ THIS_KIF->scan_time = $3; } | PRIMARY text_or_none prefix_or_ipa { struct kif_primary_item *kpi = cfg_alloc(sizeof (struct kif_primary_item)); kpi->pattern = $2; kpi->prefix = $3.addr; kpi->pxlen = $3.len; add_tail(&THIS_KIF->primary, &kpi->n); } ; CF_ADDTO(dynamic_attr, KRT_SOURCE { $$ = f_new_dynamic_attr(EAF_TYPE_INT | EAF_TEMP, T_INT, EA_KRT_SOURCE); }) CF_ADDTO(dynamic_attr, KRT_METRIC { $$ = f_new_dynamic_attr(EAF_TYPE_INT | EAF_TEMP, T_INT, EA_KRT_METRIC); }) CF_CODE CF_END bird-1.6.3/sysdep/unix/endian.h0000644000103200001440000000053713027054563015340 0ustar feelausers/* * BIRD -- Endianity Conversion * * (c) 1999 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_ENDIAN_H_ #define _BIRD_ENDIAN_H_ /* hton[sl] and ntoh[sl] are defined here */ #include #include #ifdef HAVE_STDINT_H #include #endif #endif bird-1.6.3/sysdep/bsd/0000755000103200001440000000000013027054563013511 5ustar feelausersbird-1.6.3/sysdep/bsd/krt-sys.h0000644000103200001440000000230113027054563015272 0ustar feelausers/* * BIRD -- *BSD Kernel Route Syncer * * (c) 2004 Ondrej Filip * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_KRT_SYS_H_ #define _BIRD_KRT_SYS_H_ struct birdsock; /* Kernel interfaces */ struct kif_params { }; struct kif_state { }; static inline void kif_sys_init(struct kif_proto *p UNUSED) { } static inline int kif_sys_reconfigure(struct kif_proto *p UNUSED, struct kif_config *n UNUSED, struct kif_config *o UNUSED) { return 1; } static inline void kif_sys_preconfig(struct config *c UNUSED) { } static inline void kif_sys_postconfig(struct kif_config *c UNUSED) { } static inline void kif_sys_init_config(struct kif_config *c UNUSED) { } static inline void kif_sys_copy_config(struct kif_config *d UNUSED, struct kif_config *s UNUSED) { } /* Kernel routes */ extern int krt_max_tables; struct krt_params { int table_id; /* Kernel table ID we sync with */ }; struct krt_state { struct birdsock *sk; }; static inline void krt_sys_io_init(void) { } static inline void krt_sys_init(struct krt_proto *p UNUSED) { } static inline int krt_sys_get_attr(eattr *a UNUSED, byte *buf UNUSED, int buflen UNUSED) { return 0; } #endif bird-1.6.3/sysdep/bsd/setkey.h0000644000103200001440000001103113027054563015162 0ustar feelausers/* * BIRD -- Manipulation the IPsec SA/SP database using setkey(8) utility * * (c) 2016 CZ.NIC z.s.p.o. */ #include #include #include #include #include #include "nest/bird.h" #include "lib/unix.h" /* * Open a socket for manage the IPsec SA/SP database entries */ static int setkey_open_socket(void) { int s = socket(PF_KEY, SOCK_RAW, PF_KEY_V2); if (s < 0) { log(L_ERR "SETKEY: socket: %m"); return -1; } return s; } static int setkey_send(struct sadb_msg *msg, uint len) { int s = setkey_open_socket(); if (s < 0) return -1; if (msg->sadb_msg_type == SADB_ADD) { /* Delete possible current key in the IPsec SA/SP database */ msg->sadb_msg_type = SADB_DELETE; send(s, msg, len, 0); msg->sadb_msg_type = SADB_ADD; } if (send(s, msg, len, 0) < 0) { log(L_ERR "SETKEY: send: %m"); close(s); return -1; } close(s); return 0; } /* * Perform setkey(8)-like operation for set the password for TCP MD5 Signature. * Could be called with SABD_ADD or SADB_DELETE argument. Note that SADB_ADD * argument is internally processed as a pair of SADB_ADD and SADB_DELETE * operations to implement replace. */ static int setkey_md5(sockaddr *src, sockaddr *dst, char *passwd, uint type) { uint passwd_len = passwd ? strlen(passwd) : 0; uint total = sizeof(struct sadb_msg) + sizeof(struct sadb_key) + PFKEY_ALIGN8(passwd_len) + sizeof(struct sadb_sa) + sizeof(struct sadb_x_sa2) + sizeof(struct sadb_address) + PFKEY_ALIGN8(src->sa.sa_len) + sizeof(struct sadb_address) + PFKEY_ALIGN8(dst->sa.sa_len); char *buf = alloca(total); char *pos = buf; uint len; memset(buf, 0, total); struct sadb_msg *msg = (void *) pos; len = sizeof(struct sadb_msg); msg->sadb_msg_version = PF_KEY_V2; msg->sadb_msg_type = type; msg->sadb_msg_satype = SADB_X_SATYPE_TCPSIGNATURE; msg->sadb_msg_len = 0; /* Fix it later */ msg->sadb_msg_pid = getpid(); pos += len; /* Set authentication algorithm and password */ struct sadb_key *key = (void *) pos; len = sizeof(struct sadb_key) + PFKEY_ALIGN8(passwd_len); key->sadb_key_len = PFKEY_UNIT64(len); key->sadb_key_exttype = SADB_EXT_KEY_AUTH; key->sadb_key_bits = passwd_len * 8; memcpy(pos + sizeof(struct sadb_key), passwd, passwd_len); pos += len; struct sadb_sa *sa = (void *) pos; len = sizeof(struct sadb_sa); sa->sadb_sa_len = PFKEY_UNIT64(len); sa->sadb_sa_exttype = SADB_EXT_SA; sa->sadb_sa_spi = htonl((u32) TCP_SIG_SPI); sa->sadb_sa_auth = SADB_X_AALG_TCP_MD5; sa->sadb_sa_encrypt = SADB_EALG_NONE; sa->sadb_sa_flags = SADB_X_EXT_CYCSEQ; pos += len; struct sadb_x_sa2 *sa2 = (void *) pos; len = sizeof(struct sadb_x_sa2); sa2->sadb_x_sa2_len = PFKEY_UNIT64(len); sa2->sadb_x_sa2_exttype = SADB_X_EXT_SA2; sa2->sadb_x_sa2_mode = IPSEC_MODE_ANY; pos += len; /* Set source address */ struct sadb_address *saddr = (void *) pos; len = sizeof(struct sadb_address) + PFKEY_ALIGN8(src->sa.sa_len); saddr->sadb_address_len = PFKEY_UNIT64(len); saddr->sadb_address_exttype = SADB_EXT_ADDRESS_SRC; saddr->sadb_address_proto = IPSEC_ULPROTO_ANY; saddr->sadb_address_prefixlen = MAX_PREFIX_LENGTH; memcpy(pos + sizeof(struct sadb_address), &src->sa, src->sa.sa_len); pos += len; /* Set destination address */ struct sadb_address *daddr = (void *) pos; len = sizeof(struct sadb_address) + PFKEY_ALIGN8(dst->sa.sa_len); daddr->sadb_address_len = PFKEY_UNIT64(len); daddr->sadb_address_exttype = SADB_EXT_ADDRESS_DST; daddr->sadb_address_proto = IPSEC_ULPROTO_ANY; daddr->sadb_address_prefixlen = MAX_PREFIX_LENGTH; memcpy(pos + sizeof(struct sadb_address), &dst->sa, dst->sa.sa_len); pos += len; len = pos - buf; msg->sadb_msg_len = PFKEY_UNIT64(len); return setkey_send(msg, len); } /* * Manipulation with the IPsec SA/SP database */ static int sk_set_md5_in_sasp_db(sock *s, ip_addr local, ip_addr remote, struct iface *ifa, char *passwd) { sockaddr src, dst; sockaddr_fill(&src, s->af, local, ifa, 0); sockaddr_fill(&dst, s->af, remote, ifa, 0); if (passwd && *passwd) { int len = strlen(passwd); if (len > TCP_KEYLEN_MAX) ERR_MSG("The password for TCP MD5 Signature is too long"); if (setkey_md5(&src, &dst, passwd, SADB_ADD) < 0) ERR_MSG("Cannot add TCP-MD5 password into the IPsec SA/SP database"); } else { if (setkey_md5(&src, &dst, NULL, SADB_DELETE) < 0) ERR_MSG("Cannot delete TCP-MD5 password from the IPsec SA/SP database"); } return 0; } bird-1.6.3/sysdep/bsd/sysio.h0000644000103200001440000001306313027054563015033 0ustar feelausers/* * BIRD Internet Routing Daemon -- BSD Multicasting and Network Includes * * (c) 2004 Ondrej Filip * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include // Workaround for some BSDs #include #ifdef __NetBSD__ #ifndef IP_RECVTTL #define IP_RECVTTL 23 #endif #ifndef IP_MINTTL #define IP_MINTTL 24 #endif #endif #ifdef __DragonFly__ #define TCP_MD5SIG TCP_SIGNATURE_ENABLE #endif #undef SA_LEN #define SA_LEN(x) (x).sa.sa_len /* * BSD IPv4 multicast syscalls */ #define INIT_MREQ4(maddr,ifa) \ { .imr_multiaddr = ipa_to_in4(maddr), .imr_interface = ipa_to_in4(ifa->addr->ip) } static inline int sk_setup_multicast4(sock *s) { struct in_addr ifa = ipa_to_in4(s->iface->addr->ip); u8 ttl = s->ttl; u8 n = 0; /* This defines where should we send _outgoing_ multicasts */ if (setsockopt(s->fd, IPPROTO_IP, IP_MULTICAST_IF, &ifa, sizeof(ifa)) < 0) ERR("IP_MULTICAST_IF"); if (setsockopt(s->fd, IPPROTO_IP, IP_MULTICAST_TTL, &ttl, sizeof(ttl)) < 0) ERR("IP_MULTICAST_TTL"); if (setsockopt(s->fd, IPPROTO_IP, IP_MULTICAST_LOOP, &n, sizeof(n)) < 0) ERR("IP_MULTICAST_LOOP"); return 0; } static inline int sk_join_group4(sock *s, ip_addr maddr) { struct ip_mreq mr = INIT_MREQ4(maddr, s->iface); if (setsockopt(s->fd, IPPROTO_IP, IP_ADD_MEMBERSHIP, &mr, sizeof(mr)) < 0) ERR("IP_ADD_MEMBERSHIP"); return 0; } static inline int sk_leave_group4(sock *s, ip_addr maddr) { struct ip_mreq mr = INIT_MREQ4(maddr, s->iface); if (setsockopt(s->fd, IPPROTO_IP, IP_DROP_MEMBERSHIP, &mr, sizeof(mr)) < 0) ERR("IP_ADD_MEMBERSHIP"); return 0; } /* * BSD IPv4 packet control messages */ /* It uses IP_RECVDSTADDR / IP_RECVIF socket options instead of IP_PKTINFO */ #define CMSG4_SPACE_PKTINFO (CMSG_SPACE(sizeof(struct in_addr)) + \ CMSG_SPACE(sizeof(struct sockaddr_dl))) #define CMSG4_SPACE_TTL CMSG_SPACE(sizeof(char)) static inline int sk_request_cmsg4_pktinfo(sock *s) { int y = 1; if (setsockopt(s->fd, IPPROTO_IP, IP_RECVDSTADDR, &y, sizeof(y)) < 0) ERR("IP_RECVDSTADDR"); if (setsockopt(s->fd, IPPROTO_IP, IP_RECVIF, &y, sizeof(y)) < 0) ERR("IP_RECVIF"); return 0; } static inline int sk_request_cmsg4_ttl(sock *s) { int y = 1; if (setsockopt(s->fd, IPPROTO_IP, IP_RECVTTL, &y, sizeof(y)) < 0) ERR("IP_RECVTTL"); return 0; } static inline void sk_process_cmsg4_pktinfo(sock *s, struct cmsghdr *cm) { if (cm->cmsg_type == IP_RECVDSTADDR) s->laddr = ipa_from_in4(* (struct in_addr *) CMSG_DATA(cm)); if (cm->cmsg_type == IP_RECVIF) s->lifindex = ((struct sockaddr_dl *) CMSG_DATA(cm))->sdl_index; } static inline void sk_process_cmsg4_ttl(sock *s, struct cmsghdr *cm) { if (cm->cmsg_type == IP_RECVTTL) s->rcv_ttl = * (byte *) CMSG_DATA(cm); } #ifdef IP_SENDSRCADDR static inline void sk_prepare_cmsgs4(sock *s, struct msghdr *msg, void *cbuf, size_t cbuflen) { /* Unfortunately, IP_SENDSRCADDR does not work for raw IP sockets on BSD kernels */ struct cmsghdr *cm; struct in_addr *sa; int controllen = 0; msg->msg_control = cbuf; msg->msg_controllen = cbuflen; cm = CMSG_FIRSTHDR(msg); cm->cmsg_level = IPPROTO_IP; cm->cmsg_type = IP_SENDSRCADDR; cm->cmsg_len = CMSG_LEN(sizeof(*sa)); controllen += CMSG_SPACE(sizeof(*sa)); sa = (struct in_addr *) CMSG_DATA(cm); *sa = ipa_to_in4(s->saddr); msg->msg_controllen = controllen; } #else static inline void sk_prepare_cmsgs4(sock *s UNUSED, struct msghdr *msg UNUSED, void *cbuf UNUSED, size_t cbuflen UNUSED) { } #endif static void UNUSED sk_prepare_ip_header(sock *s, void *hdr, int dlen) { struct ip *ip = hdr; bzero(ip, 20); ip->ip_v = 4; ip->ip_hl = 5; ip->ip_tos = (s->tos < 0) ? 0 : s->tos; ip->ip_len = 20 + dlen; ip->ip_ttl = (s->ttl < 0) ? 64 : s->ttl; ip->ip_p = s->dport; ip->ip_src = ipa_to_in4(s->saddr); ip->ip_dst = ipa_to_in4(s->daddr); #ifdef __OpenBSD__ /* OpenBSD expects ip_len in network order, other BSDs expect host order */ ip->ip_len = htons(ip->ip_len); #endif } /* * Miscellaneous BSD socket syscalls */ #ifndef TCP_KEYLEN_MAX #define TCP_KEYLEN_MAX 80 #endif #ifndef TCP_SIG_SPI #define TCP_SIG_SPI 0x1000 #endif #if defined(__FreeBSD__) #define USE_MD5SIG_SETKEY #include "lib/setkey.h" #endif int sk_set_md5_auth(sock *s, ip_addr local UNUSED, ip_addr remote UNUSED, struct iface *ifa UNUSED, char *passwd, int setkey UNUSED) { #ifdef USE_MD5SIG_SETKEY if (setkey) if (sk_set_md5_in_sasp_db(s, local, remote, ifa, passwd) < 0) return -1; #endif int enable = (passwd && *passwd) ? TCP_SIG_SPI : 0; if (setsockopt(s->fd, IPPROTO_TCP, TCP_MD5SIG, &enable, sizeof(enable)) < 0) { if (errno == ENOPROTOOPT) ERR_MSG("Kernel does not support TCP MD5 signatures"); else ERR("TCP_MD5SIG"); } return 0; } static inline int sk_set_min_ttl4(sock *s, int ttl) { if (setsockopt(s->fd, IPPROTO_IP, IP_MINTTL, &ttl, sizeof(ttl)) < 0) { if (errno == ENOPROTOOPT) ERR_MSG("Kernel does not support IPv4 TTL security"); else ERR("IP_MINTTL"); } return 0; } static inline int sk_set_min_ttl6(sock *s, int ttl UNUSED) { ERR_MSG("Kernel does not support IPv6 TTL security"); } static inline int sk_disable_mtu_disc4(sock *s UNUSED) { /* TODO: Set IP_DONTFRAG to 0 ? */ return 0; } static inline int sk_disable_mtu_disc6(sock *s UNUSED) { /* TODO: Set IPV6_DONTFRAG to 0 ? */ return 0; } int sk_priority_control = -1; static inline int sk_set_priority(sock *s, int prio UNUSED) { ERR_MSG("Socket priority not supported"); } bird-1.6.3/sysdep/bsd/Modules0000644000103200001440000000006113027054563015041 0ustar feelauserskrt-sock.c krt-sock.Y krt-sys.h sysio.h setkey.h bird-1.6.3/sysdep/bsd/krt-sock.Y0000644000103200001440000000110513027054563015375 0ustar feelausers/* * BIRD -- BSD Kernel Syncer Configuration * * (c) 1999--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ CF_HDR CF_DECLS CF_KEYWORDS(KERNEL, TABLE) CF_GRAMMAR CF_ADDTO(kern_proto, kern_proto kern_sys_item ';') kern_sys_item: KERNEL TABLE expr { if ($3 && (krt_max_tables == 1)) cf_error("Multiple kernel routing tables not supported"); if ($3 < 0 || $3 >= krt_max_tables) cf_error("Kernel table id must be in range 0-%d", krt_max_tables - 1); THIS_KRT->sys.table_id = $3; } ; CF_CODE CF_END bird-1.6.3/sysdep/bsd/krt-sock.c0000644000103200001440000005523013027054563015417 0ustar feelausers/* * BIRD -- BSD Routing Table Syncing * * (c) 2004 Ondrej Filip * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #undef LOCAL_DEBUG #include "nest/bird.h" #include "nest/iface.h" #include "nest/route.h" #include "nest/protocol.h" #include "nest/iface.h" #include "lib/timer.h" #include "lib/unix.h" #include "lib/krt.h" #include "lib/string.h" #include "lib/socket.h" /* * There are significant differences in multiple tables support between BSD variants. * * OpenBSD has table_id field for routes in route socket protocol, therefore all * tables could be managed by one kernel socket. FreeBSD lacks such field, * therefore multiple sockets (locked to specific table using SO_SETFIB socket * option) must be used. * * Both FreeBSD and OpenBSD uses separate scans for each table. In OpenBSD, * table_id is specified explicitly as sysctl scan argument, while in FreeBSD it * is handled implicitly by changing default table using setfib() syscall. * * KRT_SHARED_SOCKET - use shared kernel socked instead of one for each krt_proto * KRT_USE_SETFIB_SCAN - use setfib() for sysctl() route scan * KRT_USE_SETFIB_SOCK - use SO_SETFIB socket option for kernel sockets * KRT_USE_SYSCTL_7 - use 7-th arg of sysctl() as table id for route scans * KRT_USE_SYSCTL_NET_FIBS - use net.fibs sysctl() for dynamic max number of fibs */ #ifdef __FreeBSD__ #define KRT_MAX_TABLES 256 #define KRT_USE_SETFIB_SCAN #define KRT_USE_SETFIB_SOCK #define KRT_USE_SYSCTL_NET_FIBS #endif #ifdef __OpenBSD__ #define KRT_MAX_TABLES (RT_TABLEID_MAX+1) #define KRT_SHARED_SOCKET #define KRT_USE_SYSCTL_7 #endif #ifndef KRT_MAX_TABLES #define KRT_MAX_TABLES 1 #endif /* Dynamic max number of tables */ int krt_max_tables; #ifdef KRT_USE_SYSCTL_NET_FIBS static int krt_get_max_tables(void) { int fibs; size_t fibs_len = sizeof(fibs); if (sysctlbyname("net.fibs", &fibs, &fibs_len, NULL, 0) < 0) { log(L_WARN "KRT: unable to get max number of fib tables: %m"); return 1; } return MIN(fibs, KRT_MAX_TABLES); } #else static int krt_get_max_tables(void) { return KRT_MAX_TABLES; } #endif /* KRT_USE_SYSCTL_NET_FIBS */ /* setfib() syscall for FreeBSD scans */ #ifdef KRT_USE_SETFIB_SCAN /* static int krt_default_fib; static int krt_get_active_fib(void) { int fib; size_t fib_len = sizeof(fib); if (sysctlbyname("net.my_fibnum", &fib, &fib_len, NULL, 0) < 0) { log(L_WARN "KRT: unable to get active fib number: %m"); return 0; } return fib; } */ extern int setfib(int fib); #endif /* KRT_USE_SETFIB_SCAN */ /* table_id -> krt_proto map */ #ifdef KRT_SHARED_SOCKET static struct krt_proto *krt_table_map[KRT_MAX_TABLES]; #endif /* Route socket message processing */ int krt_capable(rte *e) { rta *a = e->attrs; return a->cast == RTC_UNICAST && (a->dest == RTD_ROUTER || a->dest == RTD_DEVICE #ifdef RTF_REJECT || a->dest == RTD_UNREACHABLE #endif #ifdef RTF_BLACKHOLE || a->dest == RTD_BLACKHOLE #endif ); } #ifndef RTAX_MAX #define RTAX_MAX 8 #endif struct ks_msg { struct rt_msghdr rtm; struct sockaddr_storage buf[RTAX_MAX]; }; #define ROUNDUP(a) \ ((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long)) #define NEXTADDR(w, u) \ if (msg.rtm.rtm_addrs & (w)) {\ l = ROUNDUP(((struct sockaddr *)&(u))->sa_len);\ memmove(body, &(u), l); body += l;} #define GETADDR(p, F) \ bzero(p, sizeof(*p));\ if ((addrs & (F)) && ((struct sockaddr *)body)->sa_len) {\ uint l = ROUNDUP(((struct sockaddr *)body)->sa_len);\ memcpy(p, body, (l > sizeof(*p) ? sizeof(*p) : l));\ body += l;} static int krt_send_route(struct krt_proto *p, int cmd, rte *e) { net *net = e->net; rta *a = e->attrs; static int msg_seq; struct iface *j, *i = a->iface; int l; struct ks_msg msg; char *body = (char *)msg.buf; sockaddr gate, mask, dst; ip_addr gw; DBG("krt-sock: send %I/%d via %I\n", net->n.prefix, net->n.pxlen, a->gw); bzero(&msg,sizeof (struct rt_msghdr)); msg.rtm.rtm_version = RTM_VERSION; msg.rtm.rtm_type = cmd; msg.rtm.rtm_seq = msg_seq++; msg.rtm.rtm_addrs = RTA_DST; msg.rtm.rtm_flags = RTF_UP | RTF_PROTO1; if (net->n.pxlen == MAX_PREFIX_LENGTH) msg.rtm.rtm_flags |= RTF_HOST; else msg.rtm.rtm_addrs |= RTA_NETMASK; #ifdef KRT_SHARED_SOCKET msg.rtm.rtm_tableid = KRT_CF->sys.table_id; #endif #ifdef RTF_REJECT if(a->dest == RTD_UNREACHABLE) msg.rtm.rtm_flags |= RTF_REJECT; #endif #ifdef RTF_BLACKHOLE if(a->dest == RTD_BLACKHOLE) msg.rtm.rtm_flags |= RTF_BLACKHOLE; #endif /* This is really very nasty, but I'm not able * to add "(reject|blackhole)" route without * gateway set */ if(!i) { i = HEAD(iface_list); WALK_LIST(j, iface_list) { if (j->flags & IF_LOOPBACK) { i = j; break; } } } gw = a->gw; #ifdef IPV6 /* Embed interface ID to link-local address */ if (ipa_is_link_local(gw)) _I0(gw) = 0xfe800000 | (i->index & 0x0000ffff); #endif sockaddr_fill(&dst, BIRD_AF, net->n.prefix, NULL, 0); sockaddr_fill(&mask, BIRD_AF, ipa_mkmask(net->n.pxlen), NULL, 0); sockaddr_fill(&gate, BIRD_AF, gw, NULL, 0); switch (a->dest) { case RTD_ROUTER: msg.rtm.rtm_flags |= RTF_GATEWAY; msg.rtm.rtm_addrs |= RTA_GATEWAY; break; #ifdef RTF_REJECT case RTD_UNREACHABLE: #endif #ifdef RTF_BLACKHOLE case RTD_BLACKHOLE: #endif case RTD_DEVICE: if(i) { #ifdef RTF_CLONING if (cmd == RTM_ADD && (i->flags & IF_MULTIACCESS) != IF_MULTIACCESS) /* PTP */ msg.rtm.rtm_flags |= RTF_CLONING; #endif if(!i->addr) { log(L_ERR "KRT: interface %s has no IP addess", i->name); return -1; } sockaddr_fill(&gate, BIRD_AF, i->addr->ip, NULL, 0); msg.rtm.rtm_addrs |= RTA_GATEWAY; } break; default: bug("krt-sock: unknown flags, but not filtered"); } msg.rtm.rtm_index = i->index; NEXTADDR(RTA_DST, dst); NEXTADDR(RTA_GATEWAY, gate); NEXTADDR(RTA_NETMASK, mask); l = body - (char *)&msg; msg.rtm.rtm_msglen = l; if ((l = write(p->sys.sk->fd, (char *)&msg, l)) < 0) { log(L_ERR "KRT: Error sending route %I/%d to kernel: %m", net->n.prefix, net->n.pxlen); return -1; } return 0; } void krt_replace_rte(struct krt_proto *p, net *n, rte *new, rte *old, struct ea_list *eattrs UNUSED) { int err = 0; if (old) krt_send_route(p, RTM_DELETE, old); if (new) err = krt_send_route(p, RTM_ADD, new); if (err < 0) n->n.flags |= KRF_SYNC_ERROR; else n->n.flags &= ~KRF_SYNC_ERROR; } #define SKIP(ARG...) do { DBG("KRT: Ignoring route - " ARG); return; } while(0) static void krt_read_route(struct ks_msg *msg, struct krt_proto *p, int scan) { /* p is NULL iff KRT_SHARED_SOCKET and !scan */ rte *e; net *net; sockaddr dst, gate, mask; ip_addr idst, igate, imask; void *body = (char *)msg->buf; int new = (msg->rtm.rtm_type != RTM_DELETE); char *errmsg = "KRT: Invalid route received"; int flags = msg->rtm.rtm_flags; int addrs = msg->rtm.rtm_addrs; int src; byte src2; if (!(flags & RTF_UP) && scan) SKIP("not up in scan\n"); if (!(flags & RTF_DONE) && !scan) SKIP("not done in async\n"); if (flags & RTF_LLINFO) SKIP("link-local\n"); #ifdef KRT_SHARED_SOCKET if (!scan) { int table_id = msg->rtm.rtm_tableid; p = (table_id < KRT_MAX_TABLES) ? krt_table_map[table_id] : NULL; if (!p) SKIP("unknown table id %d\n", table_id); } #endif GETADDR(&dst, RTA_DST); GETADDR(&gate, RTA_GATEWAY); GETADDR(&mask, RTA_NETMASK); if (dst.sa.sa_family != BIRD_AF) SKIP("invalid DST"); idst = ipa_from_sa(&dst); imask = ipa_from_sa(&mask); igate = (gate.sa.sa_family == BIRD_AF) ? ipa_from_sa(&gate) : IPA_NONE; /* We do not test family for RTA_NETMASK, because BSD sends us some strange values, but interpreting them as IPv4/IPv6 works */ int c = ipa_classify_net(idst); if ((c < 0) || !(c & IADDR_HOST) || ((c & IADDR_SCOPE_MASK) <= SCOPE_LINK)) SKIP("strange class/scope\n"); int pxlen = (flags & RTF_HOST) ? MAX_PREFIX_LENGTH : ipa_masklen(imask); if (pxlen < 0) { log(L_ERR "%s (%I) - netmask %I", errmsg, idst, imask); return; } if ((flags & RTF_GATEWAY) && ipa_zero(igate)) { log(L_ERR "%s (%I/%d) - missing gateway", errmsg, idst, pxlen); return; } u32 self_mask = RTF_PROTO1; u32 alien_mask = RTF_STATIC | RTF_PROTO1 | RTF_GATEWAY; src2 = (flags & RTF_STATIC) ? 1 : 0; src2 |= (flags & RTF_PROTO1) ? 2 : 0; #ifdef RTF_PROTO2 alien_mask |= RTF_PROTO2; src2 |= (flags & RTF_PROTO2) ? 4 : 0; #endif #ifdef RTF_PROTO3 alien_mask |= RTF_PROTO3; src2 |= (flags & RTF_PROTO3) ? 8 : 0; #endif #ifdef RTF_REJECT alien_mask |= RTF_REJECT; #endif #ifdef RTF_BLACKHOLE alien_mask |= RTF_BLACKHOLE; #endif if (flags & (RTF_DYNAMIC | RTF_MODIFIED)) src = KRT_SRC_REDIRECT; else if (flags & self_mask) { if (!scan) SKIP("echo\n"); src = KRT_SRC_BIRD; } else if (flags & alien_mask) src = KRT_SRC_ALIEN; else src = KRT_SRC_KERNEL; net = net_get(p->p.table, idst, pxlen); rta a = { .src = p->p.main_source, .source = RTS_INHERIT, .scope = SCOPE_UNIVERSE, .cast = RTC_UNICAST }; /* reject/blackhole routes have also set RTF_GATEWAY, we wil check them first. */ #ifdef RTF_REJECT if(flags & RTF_REJECT) { a.dest = RTD_UNREACHABLE; goto done; } #endif #ifdef RTF_BLACKHOLE if(flags & RTF_BLACKHOLE) { a.dest = RTD_BLACKHOLE; goto done; } #endif a.iface = if_find_by_index(msg->rtm.rtm_index); if (!a.iface) { log(L_ERR "KRT: Received route %I/%d with unknown ifindex %u", net->n.prefix, net->n.pxlen, msg->rtm.rtm_index); return; } if (flags & RTF_GATEWAY) { neighbor *ng; a.dest = RTD_ROUTER; a.gw = igate; #ifdef IPV6 /* Clean up embedded interface ID returned in link-local address */ if (ipa_is_link_local(a.gw)) _I0(a.gw) = 0xfe800000; #endif ng = neigh_find2(&p->p, &a.gw, a.iface, 0); if (!ng || (ng->scope == SCOPE_HOST)) { /* Ignore routes with next-hop 127.0.0.1, host routes with such next-hop appear on OpenBSD for address aliases. */ if (ipa_classify(a.gw) == (IADDR_HOST | SCOPE_HOST)) return; log(L_ERR "KRT: Received route %I/%d with strange next-hop %I", net->n.prefix, net->n.pxlen, a.gw); return; } } else a.dest = RTD_DEVICE; done: e = rte_get_temp(&a); e->net = net; e->u.krt.src = src; e->u.krt.proto = src2; e->u.krt.seen = 0; e->u.krt.best = 0; e->u.krt.metric = 0; if (scan) krt_got_route(p, e); else krt_got_route_async(p, e, new); } static void krt_read_ifannounce(struct ks_msg *msg) { struct if_announcemsghdr *ifam = (struct if_announcemsghdr *)&msg->rtm; if (ifam->ifan_what == IFAN_ARRIVAL) { /* Not enough info to create the iface, so we just trigger iface scan */ kif_request_scan(); } else if (ifam->ifan_what == IFAN_DEPARTURE) { struct iface *iface = if_find_by_index(ifam->ifan_index); /* Interface is destroyed */ if (!iface) { DBG("KRT: unknown interface (%s, #%d) going down. Ignoring\n", ifam->ifan_name, ifam->ifan_index); return; } if_delete(iface); } DBG("KRT: IFANNOUNCE what: %d index %d name %s\n", ifam->ifan_what, ifam->ifan_index, ifam->ifan_name); } static void krt_read_ifinfo(struct ks_msg *msg, int scan) { struct if_msghdr *ifm = (struct if_msghdr *)&msg->rtm; void *body = (void *)(ifm + 1); struct sockaddr_dl *dl = NULL; uint i; struct iface *iface = NULL, f = {}; int fl = ifm->ifm_flags; int nlen = 0; for (i = 1; i<=RTA_IFP; i <<= 1) { if (i & ifm->ifm_addrs) { if (i == RTA_IFP) { dl = (struct sockaddr_dl *)body; break; } body += ROUNDUP(((struct sockaddr *)&(body))->sa_len); } } if (dl && (dl->sdl_family != AF_LINK)) { log(L_WARN "Ignoring strange IFINFO"); return; } if (dl) nlen = MIN(sizeof(f.name)-1, dl->sdl_nlen); /* Note that asynchronous IFINFO messages do not contain iface name, so we have to found an existing iface by iface index */ iface = if_find_by_index(ifm->ifm_index); if (!iface) { /* New interface */ if (!dl) return; /* No interface name, ignoring */ memcpy(f.name, dl->sdl_data, nlen); DBG("New interface '%s' found\n", f.name); } else if (dl && memcmp(iface->name, dl->sdl_data, nlen)) { /* Interface renamed */ if_delete(iface); memcpy(f.name, dl->sdl_data, nlen); } else { /* Old interface */ memcpy(f.name, iface->name, sizeof(f.name)); } f.index = ifm->ifm_index; f.mtu = ifm->ifm_data.ifi_mtu; if (fl & IFF_UP) f.flags |= IF_ADMIN_UP; if (ifm->ifm_data.ifi_link_state != LINK_STATE_DOWN) f.flags |= IF_LINK_UP; /* up or unknown */ if (fl & IFF_LOOPBACK) /* Loopback */ f.flags |= IF_MULTIACCESS | IF_LOOPBACK | IF_IGNORE; else if (fl & IFF_POINTOPOINT) /* PtP */ f.flags |= IF_MULTICAST; else if (fl & IFF_BROADCAST) /* Broadcast */ f.flags |= IF_MULTIACCESS | IF_BROADCAST | IF_MULTICAST; else f.flags |= IF_MULTIACCESS; /* NBMA */ iface = if_update(&f); if (!scan) if_end_partial_update(iface); } static void krt_read_addr(struct ks_msg *msg, int scan) { struct ifa_msghdr *ifam = (struct ifa_msghdr *)&msg->rtm; void *body = (void *)(ifam + 1); sockaddr addr, mask, brd; struct iface *iface = NULL; struct ifa ifa; struct sockaddr null; ip_addr iaddr, imask, ibrd; int addrs = ifam->ifam_addrs; int scope, masklen = -1; int new = (ifam->ifam_type == RTM_NEWADDR); /* Strange messages with zero (invalid) ifindex appear on OpenBSD */ if (ifam->ifam_index == 0) return; if(!(iface = if_find_by_index(ifam->ifam_index))) { log(L_ERR "KIF: Received address message for unknown interface %d", ifam->ifam_index); return; } GETADDR (&null, RTA_DST); GETADDR (&null, RTA_GATEWAY); GETADDR (&mask, RTA_NETMASK); GETADDR (&null, RTA_GENMASK); GETADDR (&null, RTA_IFP); GETADDR (&addr, RTA_IFA); GETADDR (&null, RTA_AUTHOR); GETADDR (&brd, RTA_BRD); /* Some other family address */ if (addr.sa.sa_family != BIRD_AF) return; iaddr = ipa_from_sa(&addr); imask = ipa_from_sa(&mask); ibrd = ipa_from_sa(&brd); if ((masklen = ipa_masklen(imask)) < 0) { log(L_ERR "KIF: Invalid masklen %I for %s", imask, iface->name); return; } #ifdef IPV6 /* Clean up embedded interface ID returned in link-local address */ if (ipa_is_link_local(iaddr)) _I0(iaddr) = 0xfe800000; if (ipa_is_link_local(ibrd)) _I0(ibrd) = 0xfe800000; #endif bzero(&ifa, sizeof(ifa)); ifa.iface = iface; ifa.ip = iaddr; ifa.pxlen = masklen; scope = ipa_classify(ifa.ip); if (scope < 0) { log(L_ERR "KIF: Invalid interface address %I for %s", ifa.ip, iface->name); return; } ifa.scope = scope & IADDR_SCOPE_MASK; if (masklen < BITS_PER_IP_ADDRESS) { ifa.prefix = ipa_and(ifa.ip, ipa_mkmask(masklen)); if (masklen == (BITS_PER_IP_ADDRESS - 1)) ifa.opposite = ipa_opposite_m1(ifa.ip); #ifndef IPV6 if (masklen == (BITS_PER_IP_ADDRESS - 2)) ifa.opposite = ipa_opposite_m2(ifa.ip); #endif if (iface->flags & IF_BROADCAST) ifa.brd = ibrd; if (!(iface->flags & IF_MULTIACCESS)) ifa.opposite = ibrd; } else if (!(iface->flags & IF_MULTIACCESS) && ipa_nonzero(ibrd)) { ifa.prefix = ifa.opposite = ibrd; ifa.flags |= IA_PEER; } else { ifa.prefix = ifa.ip; ifa.flags |= IA_HOST; } if (new) ifa_update(&ifa); else ifa_delete(&ifa); if (!scan) if_end_partial_update(iface); } static void krt_read_msg(struct proto *p, struct ks_msg *msg, int scan) { /* p is NULL iff KRT_SHARED_SOCKET and !scan */ switch (msg->rtm.rtm_type) { case RTM_GET: if(!scan) return; case RTM_ADD: case RTM_DELETE: case RTM_CHANGE: krt_read_route(msg, (struct krt_proto *)p, scan); break; case RTM_IFANNOUNCE: krt_read_ifannounce(msg); break; case RTM_IFINFO: krt_read_ifinfo(msg, scan); break; case RTM_NEWADDR: case RTM_DELADDR: krt_read_addr(msg, scan); break; default: break; } } /* Sysctl based scans */ static byte *krt_buffer; static size_t krt_buflen, krt_bufmin; static struct proto *krt_buffer_owner; static byte * krt_buffer_update(struct proto *p, size_t *needed) { size_t req = *needed; if ((req > krt_buflen) || ((p == krt_buffer_owner) && (req < krt_bufmin))) { /* min buflen is 32 kB, step is 8 kB, or 128 kB if > 1 MB */ size_t step = (req < 0x100000) ? 0x2000 : 0x20000; krt_buflen = (req < 0x6000) ? 0x8000 : (req + step); krt_bufmin = (req < 0x8000) ? 0 : (req - 2*step); if (krt_buffer) mb_free(krt_buffer); krt_buffer = mb_alloc(krt_pool, krt_buflen); krt_buffer_owner = p; } *needed = krt_buflen; return krt_buffer; } static void krt_buffer_release(struct proto *p) { if (p == krt_buffer_owner) { mb_free(krt_buffer); krt_buffer = NULL; krt_buflen = 0; krt_buffer_owner = 0; } } static void krt_sysctl_scan(struct proto *p, int cmd, int table_id) { byte *buf, *next; int mib[7], mcnt; size_t needed; struct ks_msg *m; int retries = 3; int rv; mib[0] = CTL_NET; mib[1] = PF_ROUTE; mib[2] = 0; mib[3] = BIRD_AF; mib[4] = cmd; mib[5] = 0; mcnt = 6; #ifdef KRT_USE_SYSCTL_7 if (table_id >= 0) { mib[6] = table_id; mcnt = 7; } #endif #ifdef KRT_USE_SETFIB_SCAN if (table_id > 0) if (setfib(table_id) < 0) { log(L_ERR "KRT: setfib(%d) failed: %m", table_id); return; } #endif try: rv = sysctl(mib, mcnt, NULL, &needed, NULL, 0); if (rv < 0) { /* OpenBSD returns EINVAL for not yet used tables */ if ((errno == EINVAL) && (table_id > 0)) goto exit; log(L_ERR "KRT: Route scan estimate failed: %m"); goto exit; } /* The table is empty */ if (needed == 0) goto exit; buf = krt_buffer_update(p, &needed); rv = sysctl(mib, mcnt, buf, &needed, NULL, 0); if (rv < 0) { /* The buffer size changed since last sysctl ('needed' is not changed) */ if ((errno == ENOMEM) && retries--) goto try; log(L_ERR "KRT: Route scan failed: %m"); goto exit; } #ifdef KRT_USE_SETFIB_SCAN if (table_id > 0) if (setfib(0) < 0) die("KRT: setfib(%d) failed: %m", 0); #endif /* Process received messages */ for (next = buf; next < (buf + needed); next += m->rtm.rtm_msglen) { m = (struct ks_msg *)next; krt_read_msg(p, m, 1); } return; exit: krt_buffer_release(p); #ifdef KRT_USE_SETFIB_SCAN if (table_id > 0) if (setfib(0) < 0) die("KRT: setfib(%d) failed: %m", 0); #endif } void krt_do_scan(struct krt_proto *p) { krt_sysctl_scan(&p->p, NET_RT_DUMP, KRT_CF->sys.table_id); } void kif_do_scan(struct kif_proto *p) { if_start_update(); krt_sysctl_scan(&p->p, NET_RT_IFLIST, -1); if_end_update(); } /* Kernel sockets */ static int krt_sock_hook(sock *sk, uint size UNUSED) { struct ks_msg msg; int l = read(sk->fd, (char *)&msg, sizeof(msg)); if (l <= 0) log(L_ERR "krt-sock: read failed"); else krt_read_msg((struct proto *) sk->data, &msg, 0); return 0; } static void krt_sock_err_hook(sock *sk, int e UNUSED) { krt_sock_hook(sk, 0); } static sock * krt_sock_open(pool *pool, void *data, int table_id UNUSED) { sock *sk; int fd; fd = socket(PF_ROUTE, SOCK_RAW, AF_UNSPEC); if (fd < 0) die("Cannot open kernel socket for routes"); #ifdef KRT_USE_SETFIB_SOCK if (table_id > 0) { if (setsockopt(fd, SOL_SOCKET, SO_SETFIB, &table_id, sizeof(table_id)) < 0) die("Cannot set FIB %d for kernel socket: %m", table_id); } #endif sk = sk_new(pool); sk->type = SK_MAGIC; sk->rx_hook = krt_sock_hook; sk->err_hook = krt_sock_err_hook; sk->fd = fd; sk->data = data; if (sk_open(sk) < 0) bug("krt-sock: sk_open failed"); return sk; } #ifdef KRT_SHARED_SOCKET static sock *krt_sock; static int krt_sock_count; static void krt_sock_open_shared(void) { if (!krt_sock_count) krt_sock = krt_sock_open(krt_pool, NULL, -1); krt_sock_count++; } static void krt_sock_close_shared(void) { krt_sock_count--; if (!krt_sock_count) { rfree(krt_sock); krt_sock = NULL; } } int krt_sys_start(struct krt_proto *p) { krt_table_map[KRT_CF->sys.table_id] = p; krt_sock_open_shared(); p->sys.sk = krt_sock; return 1; } void krt_sys_shutdown(struct krt_proto *p) { krt_sock_close_shared(); p->sys.sk = NULL; krt_table_map[KRT_CF->sys.table_id] = NULL; krt_buffer_release(&p->p); } #else int krt_sys_start(struct krt_proto *p) { p->sys.sk = krt_sock_open(p->p.pool, p, KRT_CF->sys.table_id); return 1; } void krt_sys_shutdown(struct krt_proto *p) { rfree(p->sys.sk); p->sys.sk = NULL; krt_buffer_release(&p->p); } #endif /* KRT_SHARED_SOCKET */ /* KRT configuration callbacks */ static u32 krt_table_cf[(KRT_MAX_TABLES+31) / 32]; int krt_sys_reconfigure(struct krt_proto *p UNUSED, struct krt_config *n, struct krt_config *o) { return n->sys.table_id == o->sys.table_id; } void krt_sys_preconfig(struct config *c UNUSED) { krt_max_tables = krt_get_max_tables(); bzero(&krt_table_cf, sizeof(krt_table_cf)); } void krt_sys_postconfig(struct krt_config *x) { u32 *tbl = krt_table_cf; int id = x->sys.table_id; if (tbl[id/32] & (1 << (id%32))) cf_error("Multiple kernel syncers defined for table #%d", id); tbl[id/32] |= (1 << (id%32)); } void krt_sys_init_config(struct krt_config *c) { c->sys.table_id = 0; /* Default table */ } void krt_sys_copy_config(struct krt_config *d, struct krt_config *s) { d->sys.table_id = s->sys.table_id; } /* KIF misc code */ void kif_sys_start(struct kif_proto *p UNUSED) { } void kif_sys_shutdown(struct kif_proto *p) { krt_buffer_release(&p->p); } struct ifa * kif_get_primary_ip(struct iface *i UNUSED6) { #ifndef IPV6 static int fd = -1; if (fd < 0) fd = socket(AF_INET, SOCK_DGRAM, 0); struct ifreq ifr; memset(&ifr, 0, sizeof(ifr)); strncpy(ifr.ifr_name, i->name, IFNAMSIZ); int rv = ioctl(fd, SIOCGIFADDR, (char *) &ifr); if (rv < 0) return NULL; ip_addr addr; struct sockaddr_in *sin = (struct sockaddr_in *) &ifr.ifr_addr; memcpy(&addr, &sin->sin_addr.s_addr, sizeof(ip_addr)); ipa_ntoh(addr); struct ifa *a; WALK_LIST(a, i->addrs) { if (ipa_equal(a->ip, addr)) return a; } #endif return NULL; } bird-1.6.3/sysdep/linux/0000755000103200001440000000000013027054563014100 5ustar feelausersbird-1.6.3/sysdep/linux/netlink.c0000644000103200001440000011566613027054563015727 0ustar feelausers/* * BIRD -- Linux Netlink Interface * * (c) 1999--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include #include #include #include #include #undef LOCAL_DEBUG #include "nest/bird.h" #include "nest/route.h" #include "nest/protocol.h" #include "nest/iface.h" #include "lib/timer.h" #include "lib/unix.h" #include "lib/krt.h" #include "lib/socket.h" #include "lib/string.h" #include "lib/hash.h" #include "conf/conf.h" #include #include #include #include #ifndef MSG_TRUNC /* Hack: Several versions of glibc miss this one :( */ #define MSG_TRUNC 0x20 #endif #ifndef IFA_FLAGS #define IFA_FLAGS 8 #endif #ifndef IFF_LOWER_UP #define IFF_LOWER_UP 0x10000 #endif #ifndef RTA_TABLE #define RTA_TABLE 15 #endif #ifdef IPV6 #define krt_ecmp6(X) 1 #else #define krt_ecmp6(X) 0 #endif /* * Structure nl_parse_state keeps state of received route processing. Ideally, * we could just independently parse received Netlink messages and immediately * propagate received routes to the rest of BIRD, but Linux kernel represents * and announces IPv6 ECMP routes not as one route with multiple next hops (like * RTA_MULTIPATH in IPv4 ECMP), but as a set of routes with the same prefix. * * Therefore, BIRD keeps currently processed route in nl_parse_state structure * and postpones its propagation until we expect it to be final; i.e., when * non-matching route is received or when the scan ends. When another matching * route is received, it is merged with the already processed route to form an * ECMP route. Note that merging is done only for IPv6 (merge == 1), but the * postponing is done in both cases (for simplicity). All IPv4 routes are just * considered non-matching. * * This is ignored for asynchronous notifications (every notification is handled * as a separate route). It is not an issue for our routes, as we ignore such * notifications anyways. But importing alien IPv6 ECMP routes does not work * properly. */ struct nl_parse_state { struct linpool *pool; int scan; int merge; net *net; rta *attrs; struct krt_proto *proto; s8 new; s8 krt_src; u8 krt_type; u8 krt_proto; u32 krt_metric; }; /* * Synchronous Netlink interface */ struct nl_sock { int fd; u32 seq; byte *rx_buffer; /* Receive buffer */ struct nlmsghdr *last_hdr; /* Recently received packet */ uint last_size; }; #define NL_RX_SIZE 8192 #define NL_OP_DELETE 0 #define NL_OP_ADD (NLM_F_CREATE|NLM_F_EXCL) #define NL_OP_REPLACE (NLM_F_CREATE|NLM_F_REPLACE) #define NL_OP_APPEND (NLM_F_CREATE|NLM_F_APPEND) static linpool *nl_linpool; static struct nl_sock nl_scan = {.fd = -1}; /* Netlink socket for synchronous scan */ static struct nl_sock nl_req = {.fd = -1}; /* Netlink socket for requests */ static void nl_open_sock(struct nl_sock *nl) { if (nl->fd < 0) { nl->fd = socket(PF_NETLINK, SOCK_RAW, NETLINK_ROUTE); if (nl->fd < 0) die("Unable to open rtnetlink socket: %m"); nl->seq = now; nl->rx_buffer = xmalloc(NL_RX_SIZE); nl->last_hdr = NULL; nl->last_size = 0; } } static void nl_open(void) { nl_open_sock(&nl_scan); nl_open_sock(&nl_req); } static void nl_send(struct nl_sock *nl, struct nlmsghdr *nh) { struct sockaddr_nl sa; memset(&sa, 0, sizeof(sa)); sa.nl_family = AF_NETLINK; nh->nlmsg_pid = 0; nh->nlmsg_seq = ++(nl->seq); if (sendto(nl->fd, nh, nh->nlmsg_len, 0, (struct sockaddr *)&sa, sizeof(sa)) < 0) die("rtnetlink sendto: %m"); nl->last_hdr = NULL; } static void nl_request_dump(int af, int cmd) { struct { struct nlmsghdr nh; struct rtgenmsg g; } req = { .nh.nlmsg_type = cmd, .nh.nlmsg_len = sizeof(req), .nh.nlmsg_flags = NLM_F_REQUEST | NLM_F_DUMP, .g.rtgen_family = af }; nl_send(&nl_scan, &req.nh); } static struct nlmsghdr * nl_get_reply(struct nl_sock *nl) { for(;;) { if (!nl->last_hdr) { struct iovec iov = { nl->rx_buffer, NL_RX_SIZE }; struct sockaddr_nl sa; struct msghdr m = { .msg_name = &sa, .msg_namelen = sizeof(sa), .msg_iov = &iov, .msg_iovlen = 1, }; int x = recvmsg(nl->fd, &m, 0); if (x < 0) die("nl_get_reply: %m"); if (sa.nl_pid) /* It isn't from the kernel */ { DBG("Non-kernel packet\n"); continue; } nl->last_size = x; nl->last_hdr = (void *) nl->rx_buffer; if (m.msg_flags & MSG_TRUNC) bug("nl_get_reply: got truncated reply which should be impossible"); } if (NLMSG_OK(nl->last_hdr, nl->last_size)) { struct nlmsghdr *h = nl->last_hdr; nl->last_hdr = NLMSG_NEXT(h, nl->last_size); if (h->nlmsg_seq != nl->seq) { log(L_WARN "nl_get_reply: Ignoring out of sequence netlink packet (%x != %x)", h->nlmsg_seq, nl->seq); continue; } return h; } if (nl->last_size) log(L_WARN "nl_get_reply: Found packet remnant of size %d", nl->last_size); nl->last_hdr = NULL; } } static struct tbf rl_netlink_err = TBF_DEFAULT_LOG_LIMITS; static int nl_error(struct nlmsghdr *h, int ignore_esrch) { struct nlmsgerr *e; int ec; if (h->nlmsg_len < NLMSG_LENGTH(sizeof(struct nlmsgerr))) { log(L_WARN "Netlink: Truncated error message received"); return ENOBUFS; } e = (struct nlmsgerr *) NLMSG_DATA(h); ec = -e->error; if (ec && !(ignore_esrch && (ec == ESRCH))) log_rl(&rl_netlink_err, L_WARN "Netlink: %s", strerror(ec)); return ec; } static struct nlmsghdr * nl_get_scan(void) { struct nlmsghdr *h = nl_get_reply(&nl_scan); if (h->nlmsg_type == NLMSG_DONE) return NULL; if (h->nlmsg_type == NLMSG_ERROR) { nl_error(h, 0); return NULL; } return h; } static int nl_exchange(struct nlmsghdr *pkt, int ignore_esrch) { struct nlmsghdr *h; nl_send(&nl_req, pkt); for(;;) { h = nl_get_reply(&nl_req); if (h->nlmsg_type == NLMSG_ERROR) break; log(L_WARN "nl_exchange: Unexpected reply received"); } return nl_error(h, ignore_esrch) ? -1 : 0; } /* * Netlink attributes */ static int nl_attr_len; static void * nl_checkin(struct nlmsghdr *h, int lsize) { nl_attr_len = h->nlmsg_len - NLMSG_LENGTH(lsize); if (nl_attr_len < 0) { log(L_ERR "nl_checkin: underrun by %d bytes", -nl_attr_len); return NULL; } return NLMSG_DATA(h); } struct nl_want_attrs { u8 defined:1; u8 checksize:1; u8 size; }; #define BIRD_IFLA_MAX (IFLA_WIRELESS+1) static struct nl_want_attrs ifla_attr_want[BIRD_IFLA_MAX] = { [IFLA_IFNAME] = { 1, 0, 0 }, [IFLA_MTU] = { 1, 1, sizeof(u32) }, [IFLA_WIRELESS] = { 1, 0, 0 }, }; #define BIRD_IFA_MAX (IFA_FLAGS+1) #ifndef IPV6 static struct nl_want_attrs ifa_attr_want4[BIRD_IFA_MAX] = { [IFA_ADDRESS] = { 1, 1, sizeof(ip4_addr) }, [IFA_LOCAL] = { 1, 1, sizeof(ip4_addr) }, [IFA_BROADCAST] = { 1, 1, sizeof(ip4_addr) }, [IFA_FLAGS] = { 1, 1, sizeof(u32) }, }; #else static struct nl_want_attrs ifa_attr_want6[BIRD_IFA_MAX] = { [IFA_ADDRESS] = { 1, 1, sizeof(ip6_addr) }, [IFA_LOCAL] = { 1, 1, sizeof(ip6_addr) }, [IFA_FLAGS] = { 1, 1, sizeof(u32) }, }; #endif #define BIRD_RTA_MAX (RTA_TABLE+1) static struct nl_want_attrs mpnh_attr_want4[BIRD_RTA_MAX] = { [RTA_GATEWAY] = { 1, 1, sizeof(ip4_addr) }, }; #ifndef IPV6 static struct nl_want_attrs rtm_attr_want4[BIRD_RTA_MAX] = { [RTA_DST] = { 1, 1, sizeof(ip4_addr) }, [RTA_OIF] = { 1, 1, sizeof(u32) }, [RTA_GATEWAY] = { 1, 1, sizeof(ip4_addr) }, [RTA_PRIORITY] = { 1, 1, sizeof(u32) }, [RTA_PREFSRC] = { 1, 1, sizeof(ip4_addr) }, [RTA_METRICS] = { 1, 0, 0 }, [RTA_MULTIPATH] = { 1, 0, 0 }, [RTA_FLOW] = { 1, 1, sizeof(u32) }, [RTA_TABLE] = { 1, 1, sizeof(u32) }, }; #else static struct nl_want_attrs rtm_attr_want6[BIRD_RTA_MAX] = { [RTA_DST] = { 1, 1, sizeof(ip6_addr) }, [RTA_IIF] = { 1, 1, sizeof(u32) }, [RTA_OIF] = { 1, 1, sizeof(u32) }, [RTA_GATEWAY] = { 1, 1, sizeof(ip6_addr) }, [RTA_PRIORITY] = { 1, 1, sizeof(u32) }, [RTA_PREFSRC] = { 1, 1, sizeof(ip6_addr) }, [RTA_METRICS] = { 1, 0, 0 }, [RTA_FLOW] = { 1, 1, sizeof(u32) }, [RTA_TABLE] = { 1, 1, sizeof(u32) }, }; #endif static int nl_parse_attrs(struct rtattr *a, struct nl_want_attrs *want, struct rtattr **k, int ksize) { int max = ksize / sizeof(struct rtattr *); bzero(k, ksize); for ( ; RTA_OK(a, nl_attr_len); a = RTA_NEXT(a, nl_attr_len)) { if ((a->rta_type >= max) || !want[a->rta_type].defined) continue; if (want[a->rta_type].checksize && (RTA_PAYLOAD(a) != want[a->rta_type].size)) { log(L_ERR "nl_parse_attrs: Malformed message received"); return 0; } k[a->rta_type] = a; } if (nl_attr_len) { log(L_ERR "nl_parse_attrs: remnant of size %d", nl_attr_len); return 0; } return 1; } static inline u32 rta_get_u32(struct rtattr *a) { return *(u32 *) RTA_DATA(a); } static inline ip4_addr rta_get_ip4(struct rtattr *a) { return ip4_ntoh(*(ip4_addr *) RTA_DATA(a)); } static inline ip6_addr rta_get_ip6(struct rtattr *a) { return ip6_ntoh(*(ip6_addr *) RTA_DATA(a)); } struct rtattr * nl_add_attr(struct nlmsghdr *h, uint bufsize, uint code, const void *data, uint dlen) { uint pos = NLMSG_ALIGN(h->nlmsg_len); uint len = RTA_LENGTH(dlen); if (pos + len > bufsize) bug("nl_add_attr: packet buffer overflow"); struct rtattr *a = (struct rtattr *)((char *)h + pos); a->rta_type = code; a->rta_len = len; h->nlmsg_len = pos + len; if (dlen > 0) memcpy(RTA_DATA(a), data, dlen); return a; } static inline void nl_add_attr_u32(struct nlmsghdr *h, unsigned bufsize, int code, u32 data) { nl_add_attr(h, bufsize, code, &data, 4); } static inline void nl_add_attr_ipa(struct nlmsghdr *h, unsigned bufsize, int code, ip_addr ipa) { ipa_hton(ipa); nl_add_attr(h, bufsize, code, &ipa, sizeof(ipa)); } static inline struct rtattr * nl_open_attr(struct nlmsghdr *h, uint bufsize, uint code) { return nl_add_attr(h, bufsize, code, NULL, 0); } static inline void nl_close_attr(struct nlmsghdr *h, struct rtattr *a) { a->rta_len = (void *)h + NLMSG_ALIGN(h->nlmsg_len) - (void *)a; } static inline struct rtnexthop * nl_open_nexthop(struct nlmsghdr *h, uint bufsize) { uint pos = NLMSG_ALIGN(h->nlmsg_len); uint len = RTNH_LENGTH(0); if (pos + len > bufsize) bug("nl_open_nexthop: packet buffer overflow"); h->nlmsg_len = pos + len; return (void *)h + pos; } static inline void nl_close_nexthop(struct nlmsghdr *h, struct rtnexthop *nh) { nh->rtnh_len = (void *)h + NLMSG_ALIGN(h->nlmsg_len) - (void *)nh; } static void nl_add_multipath(struct nlmsghdr *h, unsigned bufsize, struct mpnh *nh) { struct rtattr *a = nl_open_attr(h, bufsize, RTA_MULTIPATH); for (; nh; nh = nh->next) { struct rtnexthop *rtnh = nl_open_nexthop(h, bufsize); rtnh->rtnh_flags = 0; rtnh->rtnh_hops = nh->weight; rtnh->rtnh_ifindex = nh->iface->index; nl_add_attr_ipa(h, bufsize, RTA_GATEWAY, nh->gw); nl_close_nexthop(h, rtnh); } nl_close_attr(h, a); } static struct mpnh * nl_parse_multipath(struct krt_proto *p, struct rtattr *ra) { /* Temporary buffer for multicast nexthops */ static struct mpnh *nh_buffer; static int nh_buf_size; /* in number of structures */ static int nh_buf_used; struct rtattr *a[BIRD_RTA_MAX]; struct rtnexthop *nh = RTA_DATA(ra); struct mpnh *rv, *first, **last; unsigned len = RTA_PAYLOAD(ra); first = NULL; last = &first; nh_buf_used = 0; while (len) { /* Use RTNH_OK(nh,len) ?? */ if ((len < sizeof(*nh)) || (len < nh->rtnh_len)) return NULL; if (nh_buf_used == nh_buf_size) { nh_buf_size = nh_buf_size ? (nh_buf_size * 2) : 4; nh_buffer = xrealloc(nh_buffer, nh_buf_size * sizeof(struct mpnh)); } *last = rv = nh_buffer + nh_buf_used++; rv->next = NULL; last = &(rv->next); rv->weight = nh->rtnh_hops; rv->iface = if_find_by_index(nh->rtnh_ifindex); if (!rv->iface) return NULL; /* Nonexistent RTNH_PAYLOAD ?? */ nl_attr_len = nh->rtnh_len - RTNH_LENGTH(0); nl_parse_attrs(RTNH_DATA(nh), mpnh_attr_want4, a, sizeof(a)); if (a[RTA_GATEWAY]) { memcpy(&rv->gw, RTA_DATA(a[RTA_GATEWAY]), sizeof(ip_addr)); ipa_ntoh(rv->gw); neighbor *ng = neigh_find2(&p->p, &rv->gw, rv->iface, (nh->rtnh_flags & RTNH_F_ONLINK) ? NEF_ONLINK : 0); if (!ng || (ng->scope == SCOPE_HOST)) return NULL; } else return NULL; len -= NLMSG_ALIGN(nh->rtnh_len); nh = RTNH_NEXT(nh); } return first; } static void nl_add_metrics(struct nlmsghdr *h, uint bufsize, u32 *metrics, int max) { struct rtattr *a = nl_open_attr(h, bufsize, RTA_METRICS); int t; for (t = 1; t < max; t++) if (metrics[0] & (1 << t)) nl_add_attr_u32(h, bufsize, t, metrics[t]); nl_close_attr(h, a); } static int nl_parse_metrics(struct rtattr *hdr, u32 *metrics, int max) { struct rtattr *a = RTA_DATA(hdr); int len = RTA_PAYLOAD(hdr); metrics[0] = 0; for (; RTA_OK(a, len); a = RTA_NEXT(a, len)) { if (a->rta_type == RTA_UNSPEC) continue; if (a->rta_type >= max) continue; if (RTA_PAYLOAD(a) != 4) return -1; metrics[0] |= 1 << a->rta_type; metrics[a->rta_type] = rta_get_u32(a); } if (len > 0) return -1; return 0; } /* * Scanning of interfaces */ static void nl_parse_link(struct nlmsghdr *h, int scan) { struct ifinfomsg *i; struct rtattr *a[BIRD_IFLA_MAX]; int new = h->nlmsg_type == RTM_NEWLINK; struct iface f = {}; struct iface *ifi; char *name; u32 mtu; uint fl; if (!(i = nl_checkin(h, sizeof(*i))) || !nl_parse_attrs(IFLA_RTA(i), ifla_attr_want, a, sizeof(a))) return; if (!a[IFLA_IFNAME] || (RTA_PAYLOAD(a[IFLA_IFNAME]) < 2) || !a[IFLA_MTU]) { /* * IFLA_IFNAME and IFLA_MTU are required, in fact, but there may also come * a message with IFLA_WIRELESS set, where (e.g.) no IFLA_IFNAME exists. * We simply ignore all such messages with IFLA_WIRELESS without notice. */ if (a[IFLA_WIRELESS]) return; log(L_ERR "KIF: Malformed message received"); return; } name = RTA_DATA(a[IFLA_IFNAME]); mtu = rta_get_u32(a[IFLA_MTU]); ifi = if_find_by_index(i->ifi_index); if (!new) { DBG("KIF: IF%d(%s) goes down\n", i->ifi_index, name); if (!ifi) return; if_delete(ifi); } else { DBG("KIF: IF%d(%s) goes up (mtu=%d,flg=%x)\n", i->ifi_index, name, mtu, i->ifi_flags); if (ifi && strncmp(ifi->name, name, sizeof(ifi->name)-1)) if_delete(ifi); strncpy(f.name, name, sizeof(f.name)-1); f.index = i->ifi_index; f.mtu = mtu; fl = i->ifi_flags; if (fl & IFF_UP) f.flags |= IF_ADMIN_UP; if (fl & IFF_LOWER_UP) f.flags |= IF_LINK_UP; if (fl & IFF_LOOPBACK) /* Loopback */ f.flags |= IF_MULTIACCESS | IF_LOOPBACK | IF_IGNORE; else if (fl & IFF_POINTOPOINT) /* PtP */ f.flags |= IF_MULTICAST; else if (fl & IFF_BROADCAST) /* Broadcast */ f.flags |= IF_MULTIACCESS | IF_BROADCAST | IF_MULTICAST; else f.flags |= IF_MULTIACCESS; /* NBMA */ if (fl & IFF_MULTICAST) f.flags |= IF_MULTICAST; ifi = if_update(&f); if (!scan) if_end_partial_update(ifi); } } static void nl_parse_addr(struct nlmsghdr *h, int scan) { struct ifaddrmsg *i; struct rtattr *a[BIRD_IFA_MAX]; int new = h->nlmsg_type == RTM_NEWADDR; struct ifa ifa; struct iface *ifi; int scope; u32 ifa_flags; if (!(i = nl_checkin(h, sizeof(*i)))) return; switch (i->ifa_family) { #ifndef IPV6 case AF_INET: if (!nl_parse_attrs(IFA_RTA(i), ifa_attr_want4, a, sizeof(a))) return; if (!a[IFA_LOCAL]) { log(L_ERR "KIF: Malformed message received (missing IFA_LOCAL)"); return; } break; #else case AF_INET6: if (!nl_parse_attrs(IFA_RTA(i), ifa_attr_want6, a, sizeof(a))) return; break; #endif default: return; } if (!a[IFA_ADDRESS]) { log(L_ERR "KIF: Malformed message received (missing IFA_ADDRESS)"); return; } if (a[IFA_FLAGS]) ifa_flags = rta_get_u32(a[IFA_FLAGS]); else ifa_flags = i->ifa_flags; ifi = if_find_by_index(i->ifa_index); if (!ifi) { log(L_ERR "KIF: Received address message for unknown interface %d", i->ifa_index); return; } bzero(&ifa, sizeof(ifa)); ifa.iface = ifi; if (ifa_flags & IFA_F_SECONDARY) ifa.flags |= IA_SECONDARY; #ifdef IPV6 /* Ignore tentative addresses silently */ if (ifa_flags & IFA_F_TENTATIVE) return; #endif /* IFA_LOCAL can be unset for IPv6 interfaces */ memcpy(&ifa.ip, RTA_DATA(a[IFA_LOCAL] ? : a[IFA_ADDRESS]), sizeof(ifa.ip)); ipa_ntoh(ifa.ip); ifa.pxlen = i->ifa_prefixlen; if (i->ifa_prefixlen > BITS_PER_IP_ADDRESS) { log(L_ERR "KIF: Invalid prefix length for interface %s: %d", ifi->name, i->ifa_prefixlen); new = 0; } if (i->ifa_prefixlen == BITS_PER_IP_ADDRESS) { ip_addr addr; memcpy(&addr, RTA_DATA(a[IFA_ADDRESS]), sizeof(addr)); ipa_ntoh(addr); ifa.prefix = ifa.brd = addr; /* It is either a host address or a peer address */ if (ipa_equal(ifa.ip, addr)) ifa.flags |= IA_HOST; else { ifa.flags |= IA_PEER; ifa.opposite = addr; } } else { ip_addr netmask = ipa_mkmask(ifa.pxlen); ifa.prefix = ipa_and(ifa.ip, netmask); ifa.brd = ipa_or(ifa.ip, ipa_not(netmask)); if (i->ifa_prefixlen == BITS_PER_IP_ADDRESS - 1) ifa.opposite = ipa_opposite_m1(ifa.ip); #ifndef IPV6 if (i->ifa_prefixlen == BITS_PER_IP_ADDRESS - 2) ifa.opposite = ipa_opposite_m2(ifa.ip); if ((ifi->flags & IF_BROADCAST) && a[IFA_BROADCAST]) { ip_addr xbrd; memcpy(&xbrd, RTA_DATA(a[IFA_BROADCAST]), sizeof(xbrd)); ipa_ntoh(xbrd); if (ipa_equal(xbrd, ifa.prefix) || ipa_equal(xbrd, ifa.brd)) ifa.brd = xbrd; else if (ifi->flags & IF_TMP_DOWN) /* Complain only during the first scan */ log(L_ERR "KIF: Invalid broadcast address %I for %s", xbrd, ifi->name); } #endif } scope = ipa_classify(ifa.ip); if (scope < 0) { log(L_ERR "KIF: Invalid interface address %I for %s", ifa.ip, ifi->name); return; } ifa.scope = scope & IADDR_SCOPE_MASK; DBG("KIF: IF%d(%s): %s IPA %I, flg %x, net %I/%d, brd %I, opp %I\n", ifi->index, ifi->name, new ? "added" : "removed", ifa.ip, ifa.flags, ifa.prefix, ifa.pxlen, ifa.brd, ifa.opposite); if (new) ifa_update(&ifa); else ifa_delete(&ifa); if (!scan) if_end_partial_update(ifi); } void kif_do_scan(struct kif_proto *p UNUSED) { struct nlmsghdr *h; if_start_update(); nl_request_dump(AF_UNSPEC, RTM_GETLINK); while (h = nl_get_scan()) if (h->nlmsg_type == RTM_NEWLINK || h->nlmsg_type == RTM_DELLINK) nl_parse_link(h, 1); else log(L_DEBUG "nl_scan_ifaces: Unknown packet received (type=%d)", h->nlmsg_type); nl_request_dump(BIRD_AF, RTM_GETADDR); while (h = nl_get_scan()) if (h->nlmsg_type == RTM_NEWADDR || h->nlmsg_type == RTM_DELADDR) nl_parse_addr(h, 1); else log(L_DEBUG "nl_scan_ifaces: Unknown packet received (type=%d)", h->nlmsg_type); if_end_update(); } /* * Routes */ static inline u32 krt_table_id(struct krt_proto *p) { return KRT_CF->sys.table_id; } static HASH(struct krt_proto) nl_table_map; #define RTH_FN(k) u32_hash(k) #define RTH_EQ(k1,k2) k1 == k2 #define RTH_KEY(p) krt_table_id(p) #define RTH_NEXT(p) p->sys.hash_next #define RTH_REHASH rth_rehash #define RTH_PARAMS /8, *2, 2, 2, 6, 20 HASH_DEFINE_REHASH_FN(RTH, struct krt_proto) int krt_capable(rte *e) { rta *a = e->attrs; if (a->cast != RTC_UNICAST) return 0; switch (a->dest) { case RTD_ROUTER: case RTD_DEVICE: if (a->iface == NULL) return 0; case RTD_BLACKHOLE: case RTD_UNREACHABLE: case RTD_PROHIBIT: case RTD_MULTIPATH: break; default: return 0; } return 1; } static inline int nh_bufsize(struct mpnh *nh) { int rv = 0; for (; nh != NULL; nh = nh->next) rv += RTNH_LENGTH(RTA_LENGTH(sizeof(ip_addr))); return rv; } static int nl_send_route(struct krt_proto *p, rte *e, struct ea_list *eattrs, int op, int dest, ip_addr gw, struct iface *iface) { eattr *ea; net *net = e->net; rta *a = e->attrs; u32 priority = 0; struct { struct nlmsghdr h; struct rtmsg r; char buf[128 + KRT_METRICS_MAX*8 + nh_bufsize(a->nexthops)]; } r; DBG("nl_send_route(%I/%d,op=%x)\n", net->n.prefix, net->n.pxlen, op); bzero(&r.h, sizeof(r.h)); bzero(&r.r, sizeof(r.r)); r.h.nlmsg_type = op ? RTM_NEWROUTE : RTM_DELROUTE; r.h.nlmsg_len = NLMSG_LENGTH(sizeof(struct rtmsg)); r.h.nlmsg_flags = op | NLM_F_REQUEST | NLM_F_ACK; r.r.rtm_family = BIRD_AF; r.r.rtm_dst_len = net->n.pxlen; r.r.rtm_protocol = RTPROT_BIRD; r.r.rtm_scope = RT_SCOPE_NOWHERE; nl_add_attr_ipa(&r.h, sizeof(r), RTA_DST, net->n.prefix); /* * Strange behavior for RTM_DELROUTE: * 1) rtm_family is ignored in IPv6, works for IPv4 * 2) not setting RTA_PRIORITY is different from setting default value (on IPv6) * 3) not setting RTA_PRIORITY is equivalent to setting 0, which is wildcard */ if (krt_table_id(p) < 256) r.r.rtm_table = krt_table_id(p); else nl_add_attr_u32(&r.h, sizeof(r), RTA_TABLE, krt_table_id(p)); if (a->source == RTS_DUMMY) priority = e->u.krt.metric; else if (KRT_CF->sys.metric) priority = KRT_CF->sys.metric; else if ((op != NL_OP_DELETE) && (ea = ea_find(eattrs, EA_KRT_METRIC))) priority = ea->u.data; if (priority) nl_add_attr_u32(&r.h, sizeof(r), RTA_PRIORITY, priority); /* For route delete, we do not specify remaining route attributes */ if (op == NL_OP_DELETE) goto dest; /* Default scope is LINK for device routes, UNIVERSE otherwise */ if (ea = ea_find(eattrs, EA_KRT_SCOPE)) r.r.rtm_scope = ea->u.data; else r.r.rtm_scope = (dest == RTD_DEVICE) ? RT_SCOPE_LINK : RT_SCOPE_UNIVERSE; if (ea = ea_find(eattrs, EA_KRT_PREFSRC)) nl_add_attr_ipa(&r.h, sizeof(r), RTA_PREFSRC, *(ip_addr *)ea->u.ptr->data); if (ea = ea_find(eattrs, EA_KRT_REALM)) nl_add_attr_u32(&r.h, sizeof(r), RTA_FLOW, ea->u.data); u32 metrics[KRT_METRICS_MAX]; metrics[0] = 0; struct ea_walk_state ews = { .eattrs = eattrs }; while (ea = ea_walk(&ews, EA_KRT_METRICS, KRT_METRICS_MAX)) { int id = ea->id - EA_KRT_METRICS; metrics[0] |= 1 << id; metrics[id] = ea->u.data; } if (metrics[0]) nl_add_metrics(&r.h, sizeof(r), metrics, KRT_METRICS_MAX); dest: /* a->iface != NULL checked in krt_capable() for router and device routes */ switch (dest) { case RTD_ROUTER: r.r.rtm_type = RTN_UNICAST; nl_add_attr_u32(&r.h, sizeof(r), RTA_OIF, iface->index); nl_add_attr_ipa(&r.h, sizeof(r), RTA_GATEWAY, gw); break; case RTD_DEVICE: r.r.rtm_type = RTN_UNICAST; nl_add_attr_u32(&r.h, sizeof(r), RTA_OIF, iface->index); break; case RTD_BLACKHOLE: r.r.rtm_type = RTN_BLACKHOLE; break; case RTD_UNREACHABLE: r.r.rtm_type = RTN_UNREACHABLE; break; case RTD_PROHIBIT: r.r.rtm_type = RTN_PROHIBIT; break; case RTD_MULTIPATH: r.r.rtm_type = RTN_UNICAST; nl_add_multipath(&r.h, sizeof(r), a->nexthops); break; case RTD_NONE: break; default: bug("krt_capable inconsistent with nl_send_route"); } /* Ignore missing for DELETE */ return nl_exchange(&r.h, (op == NL_OP_DELETE)); } static inline int nl_add_rte(struct krt_proto *p, rte *e, struct ea_list *eattrs) { rta *a = e->attrs; int err = 0; if (krt_ecmp6(p) && (a->dest == RTD_MULTIPATH)) { struct mpnh *nh = a->nexthops; err = nl_send_route(p, e, eattrs, NL_OP_ADD, RTD_ROUTER, nh->gw, nh->iface); if (err < 0) return err; for (nh = nh->next; nh; nh = nh->next) err += nl_send_route(p, e, eattrs, NL_OP_APPEND, RTD_ROUTER, nh->gw, nh->iface); return err; } return nl_send_route(p, e, eattrs, NL_OP_ADD, a->dest, a->gw, a->iface); } static inline int nl_delete_rte(struct krt_proto *p, rte *e, struct ea_list *eattrs) { int err = 0; /* For IPv6, we just repeatedly request DELETE until we get error */ do err = nl_send_route(p, e, eattrs, NL_OP_DELETE, RTD_NONE, IPA_NONE, NULL); while (krt_ecmp6(p) && !err); return err; } void krt_replace_rte(struct krt_proto *p, net *n, rte *new, rte *old, struct ea_list *eattrs) { int err = 0; /* * We could use NL_OP_REPLACE, but route replace on Linux has some problems: * * 1) Does not check for matching rtm_protocol * 2) Has broken semantics for IPv6 ECMP * 3) Crashes some kernel version when used for IPv6 ECMP * * So we use NL_OP_DELETE and then NL_OP_ADD. We also do not trust the old * route value, so we do not try to optimize IPv6 ECMP reconfigurations. */ if (old) nl_delete_rte(p, old, eattrs); if (new) err = nl_add_rte(p, new, eattrs); if (err < 0) n->n.flags |= KRF_SYNC_ERROR; else n->n.flags &= ~KRF_SYNC_ERROR; } static inline struct mpnh * nl_alloc_mpnh(struct nl_parse_state *s, ip_addr gw, struct iface *iface, byte weight) { struct mpnh *nh = lp_alloc(s->pool, sizeof(struct mpnh)); nh->gw = gw; nh->iface = iface; nh->next = NULL; nh->weight = weight; return nh; } static int nl_mergable_route(struct nl_parse_state *s, net *net, struct krt_proto *p, uint priority, uint krt_type) { /* Route merging must be active */ if (!s->merge) return 0; /* Saved and new route must have same network, proto/table, and priority */ if ((s->net != net) || (s->proto != p) || (s->krt_metric != priority)) return 0; /* Both must be regular unicast routes */ if ((s->krt_type != RTN_UNICAST) || (krt_type != RTN_UNICAST)) return 0; return 1; } static void nl_announce_route(struct nl_parse_state *s) { rte *e = rte_get_temp(s->attrs); e->net = s->net; e->u.krt.src = s->krt_src; e->u.krt.proto = s->krt_proto; e->u.krt.seen = 0; e->u.krt.best = 0; e->u.krt.metric = s->krt_metric; if (s->scan) krt_got_route(s->proto, e); else krt_got_route_async(s->proto, e, s->new); s->net = NULL; s->attrs = NULL; s->proto = NULL; lp_flush(s->pool); } static inline void nl_parse_begin(struct nl_parse_state *s, int scan, int merge) { memset(s, 0, sizeof (struct nl_parse_state)); s->pool = nl_linpool; s->scan = scan; s->merge = merge; } static inline void nl_parse_end(struct nl_parse_state *s) { if (s->net) nl_announce_route(s); } #define SKIP(ARG...) do { DBG("KRT: Ignoring route - " ARG); return; } while(0) static void nl_parse_route(struct nl_parse_state *s, struct nlmsghdr *h) { struct krt_proto *p; struct rtmsg *i; struct rtattr *a[BIRD_RTA_MAX]; int new = h->nlmsg_type == RTM_NEWROUTE; ip_addr dst = IPA_NONE; u32 oif = ~0; u32 table; u32 priority = 0; u32 def_scope = RT_SCOPE_UNIVERSE; int src; if (!(i = nl_checkin(h, sizeof(*i)))) return; switch (i->rtm_family) { #ifndef IPV6 case AF_INET: if (!nl_parse_attrs(RTM_RTA(i), rtm_attr_want4, a, sizeof(a))) return; break; #else case AF_INET6: if (!nl_parse_attrs(RTM_RTA(i), rtm_attr_want6, a, sizeof(a))) return; break; #endif default: return; } if (a[RTA_DST]) { memcpy(&dst, RTA_DATA(a[RTA_DST]), sizeof(dst)); ipa_ntoh(dst); } if (a[RTA_OIF]) oif = rta_get_u32(a[RTA_OIF]); if (a[RTA_TABLE]) table = rta_get_u32(a[RTA_TABLE]); else table = i->rtm_table; p = HASH_FIND(nl_table_map, RTH, table); /* Do we know this table? */ DBG("KRT: Got %I/%d, type=%d, oif=%d, table=%d, prid=%d, proto=%s\n", dst, i->rtm_dst_len, i->rtm_type, oif, table, i->rtm_protocol, p ? p->p.name : "(none)"); if (!p) SKIP("unknown table %d\n", table); #ifdef IPV6 if (a[RTA_IIF]) SKIP("IIF set\n"); #else if (i->rtm_tos != 0) /* We don't support TOS */ SKIP("TOS %02x\n", i->rtm_tos); #endif if (s->scan && !new) SKIP("RTM_DELROUTE in scan\n"); if (a[RTA_PRIORITY]) priority = rta_get_u32(a[RTA_PRIORITY]); int c = ipa_classify_net(dst); if ((c < 0) || !(c & IADDR_HOST) || ((c & IADDR_SCOPE_MASK) <= SCOPE_LINK)) SKIP("strange class/scope\n"); switch (i->rtm_protocol) { case RTPROT_UNSPEC: SKIP("proto unspec\n"); case RTPROT_REDIRECT: src = KRT_SRC_REDIRECT; break; case RTPROT_KERNEL: src = KRT_SRC_KERNEL; return; case RTPROT_BIRD: if (!s->scan) SKIP("echo\n"); src = KRT_SRC_BIRD; break; case RTPROT_BOOT: default: src = KRT_SRC_ALIEN; } net *net = net_get(p->p.table, dst, i->rtm_dst_len); if (s->net && !nl_mergable_route(s, net, p, priority, i->rtm_type)) nl_announce_route(s); rta *ra = lp_allocz(s->pool, sizeof(rta)); ra->src = p->p.main_source; ra->source = RTS_INHERIT; ra->scope = SCOPE_UNIVERSE; ra->cast = RTC_UNICAST; switch (i->rtm_type) { case RTN_UNICAST: if (a[RTA_MULTIPATH] && (i->rtm_family == AF_INET)) { ra->dest = RTD_MULTIPATH; ra->nexthops = nl_parse_multipath(p, a[RTA_MULTIPATH]); if (!ra->nexthops) { log(L_ERR "KRT: Received strange multipath route %I/%d", net->n.prefix, net->n.pxlen); return; } break; } ra->iface = if_find_by_index(oif); if (!ra->iface) { log(L_ERR "KRT: Received route %I/%d with unknown ifindex %u", net->n.prefix, net->n.pxlen, oif); return; } if (a[RTA_GATEWAY]) { neighbor *ng; ra->dest = RTD_ROUTER; memcpy(&ra->gw, RTA_DATA(a[RTA_GATEWAY]), sizeof(ra->gw)); ipa_ntoh(ra->gw); #ifdef IPV6 /* Silently skip strange 6to4 routes */ if (ipa_in_net(ra->gw, IPA_NONE, 96)) return; #endif ng = neigh_find2(&p->p, &ra->gw, ra->iface, (i->rtm_flags & RTNH_F_ONLINK) ? NEF_ONLINK : 0); if (!ng || (ng->scope == SCOPE_HOST)) { log(L_ERR "KRT: Received route %I/%d with strange next-hop %I", net->n.prefix, net->n.pxlen, ra->gw); return; } } else { ra->dest = RTD_DEVICE; def_scope = RT_SCOPE_LINK; } break; case RTN_BLACKHOLE: ra->dest = RTD_BLACKHOLE; break; case RTN_UNREACHABLE: ra->dest = RTD_UNREACHABLE; break; case RTN_PROHIBIT: ra->dest = RTD_PROHIBIT; break; /* FIXME: What about RTN_THROW? */ default: SKIP("type %d\n", i->rtm_type); return; } if (i->rtm_scope != def_scope) { ea_list *ea = lp_alloc(s->pool, sizeof(ea_list) + sizeof(eattr)); ea->next = ra->eattrs; ra->eattrs = ea; ea->flags = EALF_SORTED; ea->count = 1; ea->attrs[0].id = EA_KRT_SCOPE; ea->attrs[0].flags = 0; ea->attrs[0].type = EAF_TYPE_INT; ea->attrs[0].u.data = i->rtm_scope; } if (a[RTA_PREFSRC]) { ip_addr ps; memcpy(&ps, RTA_DATA(a[RTA_PREFSRC]), sizeof(ps)); ipa_ntoh(ps); ea_list *ea = lp_alloc(s->pool, sizeof(ea_list) + sizeof(eattr)); ea->next = ra->eattrs; ra->eattrs = ea; ea->flags = EALF_SORTED; ea->count = 1; ea->attrs[0].id = EA_KRT_PREFSRC; ea->attrs[0].flags = 0; ea->attrs[0].type = EAF_TYPE_IP_ADDRESS; ea->attrs[0].u.ptr = lp_alloc(s->pool, sizeof(struct adata) + sizeof(ps)); ea->attrs[0].u.ptr->length = sizeof(ps); memcpy(ea->attrs[0].u.ptr->data, &ps, sizeof(ps)); } if (a[RTA_FLOW]) { ea_list *ea = lp_alloc(s->pool, sizeof(ea_list) + sizeof(eattr)); ea->next = ra->eattrs; ra->eattrs = ea; ea->flags = EALF_SORTED; ea->count = 1; ea->attrs[0].id = EA_KRT_REALM; ea->attrs[0].flags = 0; ea->attrs[0].type = EAF_TYPE_INT; ea->attrs[0].u.data = rta_get_u32(a[RTA_FLOW]); } if (a[RTA_METRICS]) { u32 metrics[KRT_METRICS_MAX]; ea_list *ea = lp_alloc(s->pool, sizeof(ea_list) + KRT_METRICS_MAX * sizeof(eattr)); int t, n = 0; if (nl_parse_metrics(a[RTA_METRICS], metrics, ARRAY_SIZE(metrics)) < 0) { log(L_ERR "KRT: Received route %I/%d with strange RTA_METRICS attribute", net->n.prefix, net->n.pxlen); return; } for (t = 1; t < KRT_METRICS_MAX; t++) if (metrics[0] & (1 << t)) { ea->attrs[n].id = EA_CODE(EAP_KRT, KRT_METRICS_OFFSET + t); ea->attrs[n].flags = 0; ea->attrs[n].type = EAF_TYPE_INT; /* FIXME: Some are EAF_TYPE_BITFIELD */ ea->attrs[n].u.data = metrics[t]; n++; } if (n > 0) { ea->next = ra->eattrs; ea->flags = EALF_SORTED; ea->count = n; ra->eattrs = ea; } } /* * Ideally, now we would send the received route to the rest of kernel code. * But IPv6 ECMP routes are sent as a sequence of routes, so we postpone it * and merge next hops until the end of the sequence. */ if (!s->net) { /* Store the new route */ s->net = net; s->attrs = ra; s->proto = p; s->new = new; s->krt_src = src; s->krt_type = i->rtm_type; s->krt_proto = i->rtm_protocol; s->krt_metric = priority; } else { /* Merge next hops with the stored route */ rta *a = s->attrs; if (a->dest != RTD_MULTIPATH) { a->dest = RTD_MULTIPATH; a->nexthops = nl_alloc_mpnh(s, a->gw, a->iface, 0); } mpnh_insert(&a->nexthops, nl_alloc_mpnh(s, ra->gw, ra->iface, 0)); } } void krt_do_scan(struct krt_proto *p UNUSED) /* CONFIG_ALL_TABLES_AT_ONCE => p is NULL */ { struct nlmsghdr *h; struct nl_parse_state s; nl_parse_begin(&s, 1, krt_ecmp6(p)); nl_request_dump(BIRD_AF, RTM_GETROUTE); while (h = nl_get_scan()) if (h->nlmsg_type == RTM_NEWROUTE || h->nlmsg_type == RTM_DELROUTE) nl_parse_route(&s, h); else log(L_DEBUG "nl_scan_fire: Unknown packet received (type=%d)", h->nlmsg_type); nl_parse_end(&s); } /* * Asynchronous Netlink interface */ static sock *nl_async_sk; /* BIRD socket for asynchronous notifications */ static byte *nl_async_rx_buffer; /* Receive buffer */ static void nl_async_msg(struct nlmsghdr *h) { struct nl_parse_state s; switch (h->nlmsg_type) { case RTM_NEWROUTE: case RTM_DELROUTE: DBG("KRT: Received async route notification (%d)\n", h->nlmsg_type); nl_parse_begin(&s, 0, 0); nl_parse_route(&s, h); nl_parse_end(&s); break; case RTM_NEWLINK: case RTM_DELLINK: DBG("KRT: Received async link notification (%d)\n", h->nlmsg_type); if (kif_proto) nl_parse_link(h, 0); break; case RTM_NEWADDR: case RTM_DELADDR: DBG("KRT: Received async address notification (%d)\n", h->nlmsg_type); if (kif_proto) nl_parse_addr(h, 0); break; default: DBG("KRT: Received unknown async notification (%d)\n", h->nlmsg_type); } } static int nl_async_hook(sock *sk, uint size UNUSED) { struct iovec iov = { nl_async_rx_buffer, NL_RX_SIZE }; struct sockaddr_nl sa; struct msghdr m = { .msg_name = &sa, .msg_namelen = sizeof(sa), .msg_iov = &iov, .msg_iovlen = 1, }; struct nlmsghdr *h; int x; uint len; x = recvmsg(sk->fd, &m, 0); if (x < 0) { if (errno == ENOBUFS) { /* * Netlink reports some packets have been thrown away. * One day we might react to it by asking for route table * scan in near future. */ log(L_WARN "Kernel dropped some netlink messages, will resync on next scan."); return 1; /* More data are likely to be ready */ } else if (errno != EWOULDBLOCK) log(L_ERR "Netlink recvmsg: %m"); return 0; } if (sa.nl_pid) /* It isn't from the kernel */ { DBG("Non-kernel packet\n"); return 1; } h = (void *) nl_async_rx_buffer; len = x; if (m.msg_flags & MSG_TRUNC) { log(L_WARN "Netlink got truncated asynchronous message"); return 1; } while (NLMSG_OK(h, len)) { nl_async_msg(h); h = NLMSG_NEXT(h, len); } if (len) log(L_WARN "nl_async_hook: Found packet remnant of size %d", len); return 1; } static void nl_async_err_hook(sock *sk, int e UNUSED) { nl_async_hook(sk, 0); } static void nl_open_async(void) { sock *sk; struct sockaddr_nl sa; int fd; if (nl_async_sk) return; DBG("KRT: Opening async netlink socket\n"); fd = socket(PF_NETLINK, SOCK_RAW, NETLINK_ROUTE); if (fd < 0) { log(L_ERR "Unable to open asynchronous rtnetlink socket: %m"); return; } bzero(&sa, sizeof(sa)); sa.nl_family = AF_NETLINK; #ifdef IPV6 sa.nl_groups = RTMGRP_LINK | RTMGRP_IPV6_IFADDR | RTMGRP_IPV6_ROUTE; #else sa.nl_groups = RTMGRP_LINK | RTMGRP_IPV4_IFADDR | RTMGRP_IPV4_ROUTE; #endif if (bind(fd, (struct sockaddr *) &sa, sizeof(sa)) < 0) { log(L_ERR "Unable to bind asynchronous rtnetlink socket: %m"); close(fd); return; } nl_async_rx_buffer = xmalloc(NL_RX_SIZE); sk = nl_async_sk = sk_new(krt_pool); sk->type = SK_MAGIC; sk->rx_hook = nl_async_hook; sk->err_hook = nl_async_err_hook; sk->fd = fd; if (sk_open(sk) < 0) bug("Netlink: sk_open failed"); } /* * Interface to the UNIX krt module */ void krt_sys_io_init(void) { nl_linpool = lp_new(krt_pool, 4080); HASH_INIT(nl_table_map, krt_pool, 6); } int krt_sys_start(struct krt_proto *p) { struct krt_proto *old = HASH_FIND(nl_table_map, RTH, krt_table_id(p)); if (old) { log(L_ERR "%s: Kernel table %u already registered by %s", p->p.name, krt_table_id(p), old->p.name); return 0; } HASH_INSERT2(nl_table_map, RTH, krt_pool, p); nl_open(); nl_open_async(); return 1; } void krt_sys_shutdown(struct krt_proto *p) { HASH_REMOVE2(nl_table_map, RTH, krt_pool, p); } int krt_sys_reconfigure(struct krt_proto *p UNUSED, struct krt_config *n, struct krt_config *o) { return (n->sys.table_id == o->sys.table_id) && (n->sys.metric == o->sys.metric); } void krt_sys_init_config(struct krt_config *cf) { cf->sys.table_id = RT_TABLE_MAIN; cf->sys.metric = 0; } void krt_sys_copy_config(struct krt_config *d, struct krt_config *s) { d->sys.table_id = s->sys.table_id; d->sys.metric = s->sys.metric; } static const char *krt_metrics_names[KRT_METRICS_MAX] = { NULL, "lock", "mtu", "window", "rtt", "rttvar", "sstresh", "cwnd", "advmss", "reordering", "hoplimit", "initcwnd", "features", "rto_min", "initrwnd", "quickack" }; static const char *krt_features_names[KRT_FEATURES_MAX] = { "ecn", NULL, NULL, "allfrag" }; int krt_sys_get_attr(eattr *a, byte *buf, int buflen UNUSED) { switch (a->id) { case EA_KRT_PREFSRC: bsprintf(buf, "prefsrc"); return GA_NAME; case EA_KRT_REALM: bsprintf(buf, "realm"); return GA_NAME; case EA_KRT_SCOPE: bsprintf(buf, "scope"); return GA_NAME; case EA_KRT_LOCK: buf += bsprintf(buf, "lock:"); ea_format_bitfield(a, buf, buflen, krt_metrics_names, 2, KRT_METRICS_MAX); return GA_FULL; case EA_KRT_FEATURES: buf += bsprintf(buf, "features:"); ea_format_bitfield(a, buf, buflen, krt_features_names, 0, KRT_FEATURES_MAX); return GA_FULL; default:; int id = (int)EA_ID(a->id) - KRT_METRICS_OFFSET; if (id > 0 && id < KRT_METRICS_MAX) { bsprintf(buf, "%s", krt_metrics_names[id]); return GA_NAME; } return GA_UNKNOWN; } } void kif_sys_start(struct kif_proto *p UNUSED) { nl_open(); nl_open_async(); } void kif_sys_shutdown(struct kif_proto *p UNUSED) { } bird-1.6.3/sysdep/linux/syspriv.h0000644000103200001440000000355013027054563015773 0ustar feelausers#ifndef _BIRD_SYSPRIV_H_ #define _BIRD_SYSPRIV_H_ #ifndef _GNU_SOURCE #define _GNU_SOURCE #endif #include #include #include #ifndef _LINUX_CAPABILITY_VERSION_3 #define _LINUX_CAPABILITY_VERSION_3 0x20080522 #define _LINUX_CAPABILITY_U32S_3 2 #endif /* CAP_TO_MASK is missing in CentOS header files */ #ifndef CAP_TO_MASK #define CAP_TO_MASK(x) (1 << ((x) & 31)) #endif /* capset() prototype is missing ... */ int capset(cap_user_header_t hdrp, const cap_user_data_t datap); static inline int set_capabilities(u32 caps) { struct __user_cap_header_struct cap_hdr; struct __user_cap_data_struct cap_dat[_LINUX_CAPABILITY_U32S_3]; int err; cap_hdr.version = _LINUX_CAPABILITY_VERSION_3; cap_hdr.pid = 0; memset(cap_dat, 0, sizeof(cap_dat)); cap_dat[0].effective = cap_dat[0].permitted = caps; err = capset(&cap_hdr, cap_dat); if (!err) return 0; /* Kernel may support do not support our version of capability interface. The last call returned supported version so we just retry it. */ if (errno == EINVAL) { err = capset(&cap_hdr, cap_dat); if (!err) return 0; } return -1; } static void drop_uid(uid_t uid) { u32 caps = CAP_TO_MASK(CAP_NET_BIND_SERVICE) | CAP_TO_MASK(CAP_NET_BROADCAST) | CAP_TO_MASK(CAP_NET_ADMIN) | CAP_TO_MASK(CAP_NET_RAW); /* change effective user ID to be able to switch to that user ID completely after dropping CAP_SETUID */ if (seteuid(uid) < 0) die("seteuid: %m"); /* restrict the capabilities */ if (set_capabilities(caps) < 0) die("capset: %m"); /* keep the capabilities after dropping root ID */ if (prctl(PR_SET_KEEPCAPS, 1) < 0) die("prctl: %m"); /* completely switch to the unprivileged user ID */ if (setresuid(uid, uid, uid) < 0) die("setresuid: %m"); } #endif /* _BIRD_SYSPRIV_H_ */ bird-1.6.3/sysdep/linux/krt-sys.h0000644000103200001440000000706313027054563015673 0ustar feelausers/* * BIRD -- Linux Kernel Netlink Route Syncer * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_KRT_SYS_H_ #define _BIRD_KRT_SYS_H_ /* Kernel interfaces */ struct kif_params { }; struct kif_state { }; static inline void kif_sys_init(struct kif_proto *p UNUSED) { } static inline int kif_sys_reconfigure(struct kif_proto *p UNUSED, struct kif_config *n UNUSED, struct kif_config *o UNUSED) { return 1; } static inline void kif_sys_preconfig(struct config *c UNUSED) { } static inline void kif_sys_postconfig(struct kif_config *c UNUSED) { } static inline void kif_sys_init_config(struct kif_config *c UNUSED) { } static inline void kif_sys_copy_config(struct kif_config *d UNUSED, struct kif_config *s UNUSED) { } static inline struct ifa * kif_get_primary_ip(struct iface *i UNUSED) { return NULL; } /* Kernel routes */ #define KRT_ALLOW_MERGE_PATHS 1 #define EA_KRT_PREFSRC EA_CODE(EAP_KRT, 0x10) #define EA_KRT_REALM EA_CODE(EAP_KRT, 0x11) #define EA_KRT_SCOPE EA_CODE(EAP_KRT, 0x12) #define KRT_METRICS_MAX 0x10 /* RTAX_QUICKACK+1 */ #define KRT_METRICS_OFFSET 0x20 /* Offset of EA_KRT_* vs RTAX_* */ #define KRT_FEATURES_MAX 4 /* * Following attributes are parts of RTA_METRICS kernel route attribute, their * ids must be consistent with their RTAX_* constants (+ KRT_METRICS_OFFSET) */ #define EA_KRT_METRICS EA_CODE(EAP_KRT, 0x20) /* Dummy one */ #define EA_KRT_LOCK EA_CODE(EAP_KRT, 0x21) #define EA_KRT_MTU EA_CODE(EAP_KRT, 0x22) #define EA_KRT_WINDOW EA_CODE(EAP_KRT, 0x23) #define EA_KRT_RTT EA_CODE(EAP_KRT, 0x24) #define EA_KRT_RTTVAR EA_CODE(EAP_KRT, 0x25) #define EA_KRT_SSTRESH EA_CODE(EAP_KRT, 0x26) #define EA_KRT_CWND EA_CODE(EAP_KRT, 0x27) #define EA_KRT_ADVMSS EA_CODE(EAP_KRT, 0x28) #define EA_KRT_REORDERING EA_CODE(EAP_KRT, 0x29) #define EA_KRT_HOPLIMIT EA_CODE(EAP_KRT, 0x2a) #define EA_KRT_INITCWND EA_CODE(EAP_KRT, 0x2b) #define EA_KRT_FEATURES EA_CODE(EAP_KRT, 0x2c) #define EA_KRT_RTO_MIN EA_CODE(EAP_KRT, 0x2d) #define EA_KRT_INITRWND EA_CODE(EAP_KRT, 0x2e) #define EA_KRT_QUICKACK EA_CODE(EAP_KRT, 0x2f) /* Bits of EA_KRT_LOCK, also based on RTAX_* constants */ #define EA_KRT_LOCK_MTU EA_KRT_LOCK | EA_BIT(0x2) #define EA_KRT_LOCK_WINDOW EA_KRT_LOCK | EA_BIT(0x3) #define EA_KRT_LOCK_RTT EA_KRT_LOCK | EA_BIT(0x4) #define EA_KRT_LOCK_RTTVAR EA_KRT_LOCK | EA_BIT(0x5) #define EA_KRT_LOCK_SSTHRESH EA_KRT_LOCK | EA_BIT(0x6) #define EA_KRT_LOCK_CWND EA_KRT_LOCK | EA_BIT(0x7) #define EA_KRT_LOCK_ADVMSS EA_KRT_LOCK | EA_BIT(0x8) #define EA_KRT_LOCK_REORDERING EA_KRT_LOCK | EA_BIT(0x9) #define EA_KRT_LOCK_HOPLIMIT EA_KRT_LOCK | EA_BIT(0xa) // define EA_KRT_LOCK_INITCWND EA_KRT_LOCK | EA_BIT(0xb) // define EA_KRT_LOCK_FEATURES EA_KRT_LOCK | EA_BIT(0xc) #define EA_KRT_LOCK_RTO_MIN EA_KRT_LOCK | EA_BIT(0xd) // define EA_KRT_LOCK_INITRWND EA_KRT_LOCK | EA_BIT(0xe) /* Bits of EA_KRT_FEATURES, based on RTAX_FEATURE_* constants */ #define EA_KRT_FEATURE_ECN EA_KRT_FEATURES | EA_BIT(0x0) // define EA_KRT_FEATURE_SACK EA_KRT_FEATURES | EA_BIT(0x1) // define EA_KRT_FEATURE_TSTAMP EA_KRT_FEATURES | EA_BIT(0x2) #define EA_KRT_FEATURE_ALLFRAG EA_KRT_FEATURES | EA_BIT(0x3) struct krt_params { u32 table_id; /* Kernel table ID we sync with */ u32 metric; /* Kernel metric used for all routes */ }; struct krt_state { struct krt_proto *hash_next; }; static inline void krt_sys_init(struct krt_proto *p UNUSED) { } static inline void krt_sys_preconfig(struct config *c UNUSED) { } static inline void krt_sys_postconfig(struct krt_config *x UNUSED) { } #endif bird-1.6.3/sysdep/linux/sysio.h0000644000103200001440000001331413027054563015421 0ustar feelausers/* * BIRD Internet Routing Daemon -- Linux Multicasting and Network Includes * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef HAVE_STRUCT_IP_MREQN /* Several versions of glibc don't define this structure, so we have to do it ourselves */ struct ip_mreqn { struct in_addr imr_multiaddr; /* IP multicast address of group */ struct in_addr imr_address; /* local IP address of interface */ int imr_ifindex; /* Interface index */ }; #endif #ifndef IP_MINTTL #define IP_MINTTL 21 #endif #ifndef IPV6_TCLASS #define IPV6_TCLASS 67 #endif #ifndef IPV6_MINHOPCOUNT #define IPV6_MINHOPCOUNT 73 #endif #ifndef TCP_MD5SIG #define TCP_MD5SIG 14 #define TCP_MD5SIG_MAXKEYLEN 80 struct tcp_md5sig { struct sockaddr_storage tcpm_addr; /* address associated */ u16 __tcpm_pad1; /* zero */ u16 tcpm_keylen; /* key length */ u32 __tcpm_pad2; /* zero */ u8 tcpm_key[TCP_MD5SIG_MAXKEYLEN]; /* key (binary) */ }; #endif /* Linux does not care if sa_len is larger than needed */ #define SA_LEN(x) sizeof(sockaddr) /* * Linux IPv4 multicast syscalls */ #define INIT_MREQ4(maddr,ifa) \ { .imr_multiaddr = ipa_to_in4(maddr), .imr_ifindex = ifa->index } static inline int sk_setup_multicast4(sock *s) { struct ip_mreqn mr = { .imr_ifindex = s->iface->index }; int ttl = s->ttl; int n = 0; /* This defines where should we send _outgoing_ multicasts */ if (setsockopt(s->fd, SOL_IP, IP_MULTICAST_IF, &mr, sizeof(mr)) < 0) ERR("IP_MULTICAST_IF"); if (setsockopt(s->fd, SOL_IP, IP_MULTICAST_TTL, &ttl, sizeof(ttl)) < 0) ERR("IP_MULTICAST_TTL"); if (setsockopt(s->fd, SOL_IP, IP_MULTICAST_LOOP, &n, sizeof(n)) < 0) ERR("IP_MULTICAST_LOOP"); return 0; } static inline int sk_join_group4(sock *s, ip_addr maddr) { struct ip_mreqn mr = INIT_MREQ4(maddr, s->iface); if (setsockopt(s->fd, SOL_IP, IP_ADD_MEMBERSHIP, &mr, sizeof(mr)) < 0) ERR("IP_ADD_MEMBERSHIP"); return 0; } static inline int sk_leave_group4(sock *s, ip_addr maddr) { struct ip_mreqn mr = INIT_MREQ4(maddr, s->iface); if (setsockopt(s->fd, SOL_IP, IP_DROP_MEMBERSHIP, &mr, sizeof(mr)) < 0) ERR("IP_DROP_MEMBERSHIP"); return 0; } /* * Linux IPv4 packet control messages */ /* Mostly similar to standardized IPv6 code */ #define CMSG4_SPACE_PKTINFO CMSG_SPACE(sizeof(struct in_pktinfo)) #define CMSG4_SPACE_TTL CMSG_SPACE(sizeof(int)) static inline int sk_request_cmsg4_pktinfo(sock *s) { int y = 1; if (setsockopt(s->fd, SOL_IP, IP_PKTINFO, &y, sizeof(y)) < 0) ERR("IP_PKTINFO"); return 0; } static inline int sk_request_cmsg4_ttl(sock *s) { int y = 1; if (setsockopt(s->fd, SOL_IP, IP_RECVTTL, &y, sizeof(y)) < 0) ERR("IP_RECVTTL"); return 0; } static inline void sk_process_cmsg4_pktinfo(sock *s, struct cmsghdr *cm) { if (cm->cmsg_type == IP_PKTINFO) { struct in_pktinfo *pi = (struct in_pktinfo *) CMSG_DATA(cm); s->laddr = ipa_from_in4(pi->ipi_addr); s->lifindex = pi->ipi_ifindex; } } static inline void sk_process_cmsg4_ttl(sock *s, struct cmsghdr *cm) { if (cm->cmsg_type == IP_TTL) s->rcv_ttl = * (int *) CMSG_DATA(cm); } static inline void sk_prepare_cmsgs4(sock *s, struct msghdr *msg, void *cbuf, size_t cbuflen) { struct cmsghdr *cm; struct in_pktinfo *pi; int controllen = 0; msg->msg_control = cbuf; msg->msg_controllen = cbuflen; cm = CMSG_FIRSTHDR(msg); cm->cmsg_level = SOL_IP; cm->cmsg_type = IP_PKTINFO; cm->cmsg_len = CMSG_LEN(sizeof(*pi)); controllen += CMSG_SPACE(sizeof(*pi)); pi = (struct in_pktinfo *) CMSG_DATA(cm); pi->ipi_ifindex = s->iface ? s->iface->index : 0; pi->ipi_spec_dst = ipa_to_in4(s->saddr); pi->ipi_addr = ipa_to_in4(IPA_NONE); msg->msg_controllen = controllen; } /* * Miscellaneous Linux socket syscalls */ int sk_set_md5_auth(sock *s, ip_addr local UNUSED, ip_addr remote, struct iface *ifa, char *passwd, int setkey UNUSED) { struct tcp_md5sig md5; memset(&md5, 0, sizeof(md5)); sockaddr_fill((sockaddr *) &md5.tcpm_addr, s->af, remote, ifa, 0); if (passwd) { int len = strlen(passwd); if (len > TCP_MD5SIG_MAXKEYLEN) ERR_MSG("The password for TCP MD5 Signature is too long"); md5.tcpm_keylen = len; memcpy(&md5.tcpm_key, passwd, len); } if (setsockopt(s->fd, SOL_TCP, TCP_MD5SIG, &md5, sizeof(md5)) < 0) { if (errno == ENOPROTOOPT) ERR_MSG("Kernel does not support TCP MD5 signatures"); else ERR("TCP_MD5SIG"); } return 0; } static inline int sk_set_min_ttl4(sock *s, int ttl) { if (setsockopt(s->fd, SOL_IP, IP_MINTTL, &ttl, sizeof(ttl)) < 0) { if (errno == ENOPROTOOPT) ERR_MSG("Kernel does not support IPv4 TTL security"); else ERR("IP_MINTTL"); } return 0; } static inline int sk_set_min_ttl6(sock *s, int ttl) { if (setsockopt(s->fd, SOL_IPV6, IPV6_MINHOPCOUNT, &ttl, sizeof(ttl)) < 0) { if (errno == ENOPROTOOPT) ERR_MSG("Kernel does not support IPv6 TTL security"); else ERR("IPV6_MINHOPCOUNT"); } return 0; } static inline int sk_disable_mtu_disc4(sock *s) { int dont = IP_PMTUDISC_DONT; if (setsockopt(s->fd, SOL_IP, IP_MTU_DISCOVER, &dont, sizeof(dont)) < 0) ERR("IP_MTU_DISCOVER"); return 0; } static inline int sk_disable_mtu_disc6(sock *s) { int dont = IPV6_PMTUDISC_DONT; if (setsockopt(s->fd, SOL_IPV6, IPV6_MTU_DISCOVER, &dont, sizeof(dont)) < 0) ERR("IPV6_MTU_DISCOVER"); return 0; } int sk_priority_control = 7; static inline int sk_set_priority(sock *s, int prio) { if (setsockopt(s->fd, SOL_SOCKET, SO_PRIORITY, &prio, sizeof(prio)) < 0) ERR("SO_PRIORITY"); return 0; } bird-1.6.3/sysdep/linux/Modules0000644000103200001440000000006013027054563015427 0ustar feelauserskrt-sys.h netlink.c netlink.Y sysio.h syspriv.h bird-1.6.3/sysdep/linux/netlink.Y0000644000103200001440000000744213027054563015705 0ustar feelausers/* * BIRD -- Linux Netlink Configuration * * (c) 1999--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ CF_HDR CF_DECLS CF_KEYWORDS(KERNEL, TABLE, METRIC, KRT_PREFSRC, KRT_REALM, KRT_SCOPE, KRT_MTU, KRT_WINDOW, KRT_RTT, KRT_RTTVAR, KRT_SSTRESH, KRT_CWND, KRT_ADVMSS, KRT_REORDERING, KRT_HOPLIMIT, KRT_INITCWND, KRT_RTO_MIN, KRT_INITRWND, KRT_QUICKACK, KRT_LOCK_MTU, KRT_LOCK_WINDOW, KRT_LOCK_RTT, KRT_LOCK_RTTVAR, KRT_LOCK_SSTRESH, KRT_LOCK_CWND, KRT_LOCK_ADVMSS, KRT_LOCK_REORDERING, KRT_LOCK_HOPLIMIT, KRT_LOCK_RTO_MIN, KRT_FEATURE_ECN, KRT_FEATURE_ALLFRAG) CF_GRAMMAR CF_ADDTO(kern_proto, kern_proto kern_sys_item ';') kern_sys_item: KERNEL TABLE expr { THIS_KRT->sys.table_id = $3; } | METRIC expr { THIS_KRT->sys.metric = $2; } ; CF_ADDTO(dynamic_attr, KRT_PREFSRC { $$ = f_new_dynamic_attr(EAF_TYPE_IP_ADDRESS, T_IP, EA_KRT_PREFSRC); }) CF_ADDTO(dynamic_attr, KRT_REALM { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_REALM); }) CF_ADDTO(dynamic_attr, KRT_SCOPE { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_SCOPE); }) CF_ADDTO(dynamic_attr, KRT_MTU { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_MTU); }) CF_ADDTO(dynamic_attr, KRT_WINDOW { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_WINDOW); }) CF_ADDTO(dynamic_attr, KRT_RTT { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_RTT); }) CF_ADDTO(dynamic_attr, KRT_RTTVAR { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_RTTVAR); }) CF_ADDTO(dynamic_attr, KRT_SSTRESH { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_SSTRESH); }) CF_ADDTO(dynamic_attr, KRT_CWND { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_CWND); }) CF_ADDTO(dynamic_attr, KRT_ADVMSS { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_ADVMSS); }) CF_ADDTO(dynamic_attr, KRT_REORDERING { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_REORDERING); }) CF_ADDTO(dynamic_attr, KRT_HOPLIMIT { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_HOPLIMIT); }) CF_ADDTO(dynamic_attr, KRT_INITCWND { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_INITCWND); }) CF_ADDTO(dynamic_attr, KRT_RTO_MIN { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_RTO_MIN); }) CF_ADDTO(dynamic_attr, KRT_INITRWND { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_INITRWND); }) CF_ADDTO(dynamic_attr, KRT_QUICKACK { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_KRT_QUICKACK); }) CF_ADDTO(dynamic_attr, KRT_LOCK_MTU { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_LOCK_MTU); }) CF_ADDTO(dynamic_attr, KRT_LOCK_WINDOW { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_LOCK_WINDOW); }) CF_ADDTO(dynamic_attr, KRT_LOCK_RTT { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_LOCK_RTT); }) CF_ADDTO(dynamic_attr, KRT_LOCK_RTTVAR { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_LOCK_RTTVAR); }) CF_ADDTO(dynamic_attr, KRT_LOCK_SSTRESH { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_LOCK_SSTHRESH); }) CF_ADDTO(dynamic_attr, KRT_LOCK_CWND { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_LOCK_CWND); }) CF_ADDTO(dynamic_attr, KRT_LOCK_ADVMSS { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_LOCK_ADVMSS); }) CF_ADDTO(dynamic_attr, KRT_LOCK_REORDERING { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_LOCK_REORDERING); }) CF_ADDTO(dynamic_attr, KRT_LOCK_HOPLIMIT { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_LOCK_HOPLIMIT); }) CF_ADDTO(dynamic_attr, KRT_LOCK_RTO_MIN { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_LOCK_RTO_MIN); }) CF_ADDTO(dynamic_attr, KRT_FEATURE_ECN { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_FEATURE_ECN); }) CF_ADDTO(dynamic_attr, KRT_FEATURE_ALLFRAG { $$ = f_new_dynamic_attr(EAF_TYPE_BITFIELD, T_BOOL, EA_KRT_FEATURE_ALLFRAG); }) CF_CODE CF_END bird-1.6.3/NEWS0000644000103200001440000003436213027054563012141 0ustar feelausersVersion 1.6.3 (2016-12-21) o Large BGP communities o BFD authentication (MD5, SHA1) o SHA1 and SHA2 authentication for RIP and OSPF o Improved documentation o Several bug fixes Version 1.6.2 (2016-09-29) o Fixes serious bug introduced in the previous version Version 1.6.1 (2016-09-22) o Support for IPv6 ECMP o Better handling of IPv6 tentative addresses o Several updates and fixes in Babel protocol o Filter: New !~ operator o Filter: ASN ranges in bgpmask o KRT: New kernel protocol option 'metric' o KRT: New route attribute 'krt_scope' o Improved BIRD help messages o Fixes memory leak in BGP multipath o Fixes handling of empty path segments in BGP AS_PATH o Several bug fixes Version 1.6.0 (2016-04-29) o Major RIP protocol redesign o New Babel routing protocol o BGP multipath support o KRT: Add support for plenty of kernel route metrics o KRT: Allow more than 256 routing tables o Static: Allow to specify attributes for static routes o Static: Support for BFD controlled static routes o FreeBSD: Setup password for BGP MD5 authentication o IO: Remove socket number limit o Plenty of bug fixes Upgrade notes: For RIP, most protocol options were moved to interface blocks. Version 1.5.0 (2015-04-20) o Major OSPF protocol redesign. o OSPFv2 multi-instance extension (RFC 6549). o BGP AS-wide unique router ID (RFC 6286). o BGP enhanced route refresh (RFC 7313). o Link state support in BGP. o Latency tracking and internal watchdog. o Uses high port range for BFD on BSD. o Increase max symbol length to 64. o Allows to define unnamed protocols from templates. o Fixes two serious bugs in BGP. o Several bugfixes and minor improvements. o Several minor option changes: - OSPF: Protocol-wide 'instance id' option added. - BGP: Parameters to option 'neighbor' extended. - BGP: Separate option 'interface' added. - BGP: Option 'start delay time' renamed to 'connect delay time'. - BGP: Option 'route limit' deprecated. Upgrade notes: For OSPF, there are deep internal changes, but user-visible changes are limited to log messages and minor changes in formatting of command output. For BGP, version 1.5.0 is essentially a minor release. There are two deprecated options ('start delay time' and 'route limit') and some minor formatting changes. Version 1.4.5 (2014-10-06) o New 'show route noexport' command option. o Port option for BGP sessions. o Better constant handling in set literals. o Better rate filtering of log messages. o Several minor bugfixes. Version 1.4.4 (2014-07-09) o Extended OSPF multipath support. o Default router preference for RAdv. o Significant changes in socket layer. o Important bugfix in BGP. o Several minor bugfixes. Version 1.4.3 (2014-04-14) o Important bugfix in IPv6 BGP. Version 1.4.2 (2014-04-02) o Important bugfix in BFD. Version 1.4.1 (2014-03-31) o BGP add-path support (RFC draft). o BGP graceful restart (RFC 4724). o OSPF: many changes in socket layer. o OSPF: support for secondary addresses in BSD. o OSPF: names for vlink pseudointerfaces (vlinkX). o Several bugfixes. Version 1.4.0 (2013-11-25) o BFD protocol (RFC 5880). o BFD support for OSPF and BGP. o New 'allow local as' option for BGP. o Filters allows setting gw, ifname and ifindex. o Filter operator 'delete/filter' extended to bgp_paths. o Filter operator 'len' extended to [e]clists. o BIRD client now allows shorthands for noninteractive commands. o Flag -P for PID file support. o Flag -f added to force BIRD to run in foreground. o Protocol export/import/receive limits are checked during reconfiguration. o Several bugfixes and minor improvements. o Several minor but incompatible changes: - IBGP is multihop by default. - Changes primary address selection on BSD to the first one. - Integers in filters are handled as unsigned. - ISO 8601 time formats used by default. - Import of device routes from kernel protocol allowed. - Last state change now tracks just protocol state change. - Minor changes to default router ID calculation. Version 1.3.11 (2013-07-27) o OSPF stub router option (RFC 3137). o TTL security for OSPF and RIP. o Protocol packet priority and traffic class handling. o Multiple routing tables support for FreeBSD and OpenBSD. o Extends constants to all filter data types. o Implements eval command. o 'bgppath ~ int set' filter operation. o Several bugfixes. Version 1.3.10 (2013-04-30) o Lightweight BIRD client for embedded environments. o Dynamic IPv6 router advertisements. o New 'next hop keep' option for BGP. o Smart default routing table for 'show route export/preexport/protocol'. o Automatic router ID selection could be configured to use address of loopback. o Allows configured global addresses of NBMA neighbors in OSPFv3. o Allows BIRD commands from UNIX shell even in restricted mode. o Route limits inherited from templates can be disabled. o Symbol names enclosed by apostrophes can contain dots. o Several bugfixes. Version 1.3.9 (2013-01-11) o BIRD can be configured to keep and show filtered routes. o Separate receive and import limits. o Several new reconfiguration cmd options (undo, timeout, check). o Configurable automatic router ID selection. o Dragonfly BSD support. o Fixed OSPFv3 vlinks. o Several minor bugfixes. Version 1.3.8 (2012-08-07) o Generalized import and export route limits. o RDNSS and DNSSL support for RAdv. o Include in config file support wildcards. o History deduplication in BIRD client. o New route attributes krt_source, krt_metric. o Different instance ID support for OSPFv3. o Real broadcast mode for OSPFv2. o Several minor bugfixes. Version 1.3.7 (2012-03-22) o Route Origin Authorization basics. o RIPng working again. o Extended clist operations in filters. o Fixes several bugs in BSD iface handling. o Several minor bugfixes and enhancements. Version 1.3.6 (2012-01-20) o Important bugfix in BGP. Version 1.3.5 (2012-01-10) o Protocol templates. o Deterministic MED option for BGP. o Support for link-local addresses in BGP and static protocols. o Several bugfixes. Version 1.3.4 (2011-10-10) o Static recursive routes. o Several bugfixes. Version 1.3.3 (2011-09-11) o OSPF NSSA. o BGP extended communities. o BGP TTL security. o Configuration option "include" added (based on patch from Alexander V. Chernikov). o Some minor bugfixes. Version 1.3.2 (2011-07-08) o Allows run with restricted privileges. o Community list filter operation. o Fixes several problems in filter syntax: - Fixes several conflicts in the grammar. - Fixes a bug in (a..b, c) pair patterns. - Makes pair patterns orthogonal. - Allows term expressions in pair patterns without additional ( ). - Allows several comma separated values in switch cases. o Many bugfixes. Version 1.3.1 (2011-05-02) o Added Linux kernel route attributes krt_prefsrc and krt_realm. o Added BGP option 'med metric' related to MED handling. o Allows to use constants from /etc/iproute2/rt_* files. o Several bugfixes. Version 1.3.0 (2011-03-31) o Proper iBGP (can be used with IGP). o Multipath support (OSPF and static). o L2 link state detection. o IPv6 router advertisements. o Much improved OSPF reconfiguration. o Point-to-MultiPoint interfaces (OSPF). o Minor changes and improvements in config file grammar. o Better community list matching. o Changes default behavior of BGP IPv6 socket to v6only. Use 'listen bgp dual' for the old behavior. o Changes default for handling missing link-local addresses on route servers. Use 'missing lladdr drop' for the old behavior. o Important bugfix for OSPF. o Several minor bugfixes. Version 1.2.5 (2010-10-10) o Several mostly minor bugfixes. Version 1.2.4 (2010-08-03) o Added 'show memory' command. o Important bugfix in IPv6 BGP. o Several minor bugfixes. Version 1.2.3 (2010-06-01) o Pattern matching for community lists. o Many fixes in OSPF protocol (esp. in multi-areas and vlinks). o Several minor bugfixes. Version 1.2.2 (2010-04-10) o Much better BSD kernel support (IPv6, alien routes, ...). o Deep OSPF socket changes, fixes OSPFv2/v3 behavior on BSD. o OSPFv2 in Linux now supports more non-stub IP prefixes on one physical iface. o Export of device routes to the kernel is more restricted. o Routes with strange scope not allowed in BIRD routing tables. o New filterable route attributes bgp_originator_id, bgp_cluster_list and ospf_router_id. o Restricted read-only CLI (option -r). o Pattern matching for 'show protocols' command. o BGP protocol details in 'show protocols all' command. o Configurable syslog name (and default on IPv6 changed). o Statistic counters for pipes were fixed. o Many bugfixes in BGP, OSPF, filters, ... Version 1.2.1 (2010-02-11) o Option 'interpret communities' allows to override implicit handling of well-known communities. o 'configure' command uses route reload when filters change. o Adds router ID of advertising router as OSPF route attribute. o 'show route' command indicates primary route and shows OSPF Router ID. o Configurable date/time formats. o Symbol names can be enclosed by '' and so include hyphen and start with number. o Several minor bugfixes. Version 1.2.0 (2010-01-05) o Implements OSPFv3 (IPv6 support for OSPF). Because the code is shared with OSPFv2 and there were deep changes in it, we suggest caution during upgrade to OSPF users. Some advanced features (like NSSA, vlinks and authentication) are not yet implemented. o Implements MRTdump - binary logging protocol compatible with other routing daemons. Only BGP part of MRTdump is yet implemented. o Changes default value of BGP attribute LOCAL_PREF from 0 to 100. Use 'default bgp_local_pref 0' BGP protocol option for the old behavior. The new value is suggested by RFC 4277. o Changes default mode of pipes from opaque to transparent. Use 'mode opaque' protocol option if the old behavior is needed. Opaque pipe mode is deprecated and might be removed in the future. Version 1.1.7 (2009-12-20) o Implements BGP Route Refresh (RFC 2918). o Implements route reload command. o Deep changes and bugfixes in pipe protocol. o Bugfix in OSPF premature aging of LSA. o Bugfix in OSPF next hop calculation. o Bugfix in core related to route withdraws. o Several minor bugfixes. Version 1.1.6 (2009-11-19) o Implements RFC 5004 - prefer older external routes. o There is a change how route servers handle missing IPv6 link local addresses in next hop atribute - see 'missing lladdr' option. o Several minor features (description field, parse check option). o Several minor bugfixes. Version 1.1.5 (2009-10-29) o Better scalability of BGP. o New accessors for AS path - first and last. o Allows to set protocol-specific router ID. o Allows import kernel 'onlink' routes. o Endianity check in buildsystem changed. Version 1.1.4 (2009-10-02) o BGP passive option. o Several minor bugfixes. Version 1.1.3 (2009-09-11) o Bugfix in core o Bugfix in BGP related to AS2->AS4 conversion. Version 1.1.2 (2009-08-23) o Allow more kernel routing tables in IPv6. o Bugfix in core Version 1.1.1 (2009-08-14) o 'more' style paging in BIRD client. o Important core bug fixed. o Portability to non-x86 related bugfixes. o As usual, miscellaneous bugfixes. Version 1.1.0 (2009-06-28) o Parametrized pair and path mask expressions in the filter language. o Transparent pipe mode allows to implement BGP route server with independent route policy for each peer. o Kernel route table synchronization does not allow overwriting of alien routes. o Configurable BGP import route limits. o During BGP error delay, incoming connections are rejected. o BGP route statistics. o Better support for multiple network addresses on OSPF interfaces. o As usual, miscellaneous bugfixes. Version 1.0.15 (2009-05-25) o FreeBSD and NetBSD port renewed. OpenBSD port introduced. o import/preimport 'show route' modifiers was renamed to export/preexport for consistency with filters. o Minor change in the grammar of 'interface' config option. o Many bugfixes in IPv6 BGP. o As usual, miscellaneous bugfixes. Version 1.0.14 (2009-04-28) o A lot of bugfixes in BGP, OSPF and core. o A bugfix in filters in the pipe protocol. It is recommended to check whether the new behavior of used pipe filters is consistent with expectations. o Reimplementation of prefix sets and a slight change in the meaning of some prefix set patterns. Version 1.0.13 (2009-03-14) o A lot of bugfixes in BGP, OSPF and core o A new syntax for BGP masks Version 1.0.12 (2008-11-12) o new BGP features: BGP MD5, ASN32, BGP route reflector o BGP bugfixes ... Version 1.0.9 (2004-07-15) o Minor bugfix in RIP o A lot of OSPF code rewritten, OSPF supports multiple areas, virtual links, MD5 authentication. It is fully compatible with rfc2329. Version 1.0.8 (2004-06-07) o A lot of bug fixes in RIP, OSPF and BGP (thanx to Andreas Steinmetz) o FreeBSD and NetBSD port introduced o Complete code clean up Version 1.0.7 (2003-08-20) o OSPF bug fixes Version 1.0.6 (2003-04-06) o No more byte order problems in RIP authentication. Thanks to Eric Leblond for a patch. o Fixed interoperability problems with Cisco and Zebra when talking IPv6 BGP. o Handle more primary addresses with different scopes gracefully. IPv6 needs that. o Comparison of prefixes in filters doesn't ignore their lengts. o As usually, OSPF bug fixes. o Documentation building tools now work with recent linuxdoc-tools. Version 1.0.5 (2001-06-09) o Minor cleanups in the libraries. o Removed a couple of warnings when compiling with newer glibc. o OSPF bug fixes. Version 1.0.4 (2000-09-04) o Fixed a serious bug in 1.0.3. Version 1.0.3 (2000-09-03) o OSPF works better on NBMA networks. Some configuration tags added. Version 1.0.2 (2000-08-24) o Minor bug fixes to OSPF. Version 1.0.1 (2000-06-22) o Updated documentation and fixed a couple of bugs. Version 1.0.0 (2000-06-09) o First stable release. Version 0.0.0 (2000-05-13) o First public development release. bird-1.6.3/.gitignore0000644000103200001440000000017513027054563013425 0ustar feelausers/autom4te.cache/ /doc/*.html /obj/ /Makefile /bird /birdc /birdcl /config.log /config.status /configure /bird.conf /bird.log bird-1.6.3/INSTALL0000644000103200001440000000106213027054563012462 0ustar feelausersHow to install BIRD =================== $ ./configure $ make # make install Default location for configuration file is /usr/local/etc/bird.conf and for control socket is /usr/local/var/run/bird.ctl . You can change that by --sysconfdir and --localstatedir configure options. Requirements ============ For compiling BIRD you need these programs and libraries: - GNU C Compiler - GNU Make - GNU Bison - GNU M4 - Flex - ncurses library - GNU Readline library (2.1 or newer) For compiling BIRD documentation you also need: - Linuxdoc-Tools - LaTeX bird-1.6.3/ChangeLog0000644000103200001440000227646413027054676013236 0ustar feelauserscommit 017da76b729cc36c4a3416995b06386235660f42 Author: Ondrej Zajicek (work) Date: Wed Dec 21 16:46:47 2016 +0100 NEWS and version update commit 2c33da507046c25d87741fe0ce7947985c8c7a10 Author: Jan Moskyto Matejka Date: Tue Dec 20 20:13:08 2016 +0100 Netlink: fix occasional netlink hangs on busy machines commit 7d95c44572d79ef15ec8b0220950b4e4374c6bc6 Author: Ondrej Zajicek (work) Date: Thu Dec 15 15:31:25 2016 +0100 OSPF: Fix ECMP external merging The variable nfa is not cleaned before each loop iteration and can have a wrong value of nfa.nhs_reuse from the previous step. Thanks to Bernardo Figueiredo for the bugreport and analysis. commit 9e7d3a781075b39a7e0f97e63b6f313955daa661 Author: Ondrej Zajicek (work) Date: Tue Dec 13 17:34:42 2016 +0100 OSPF: Fix net-summary origination combined with stubnet option Stubnet nodes in OSPF FIB were removed during rt_sync(), but the pointer remained in top_hash_entry.nf, so net-summary LSA origination was confused, reported 'LSA ID collision' and net-summary LSAs were not originated properly. Thanks to Naveen Chowdary Yerramneni for bugreport and analysis. commit ed1a908e535e4333b358d83b472453a2ad6d3f51 Author: Ondrej Zajicek (work) Date: Fri Nov 25 11:51:38 2016 +0100 BGP: Fix memory leak in graceful restart code Prefix and bucket tables are initialized when entering established state but not explicitly freed when leaving it (that is handled by protocol restart). With graceful restart, BGP may enter and leave established state multiple times without hard protocol restart causing memory leak. commit 261816b0d4f3d4549a4402b95541b82fc7f10a4b Author: Ondrej Zajicek (work) Date: Tue Nov 15 16:24:39 2016 +0100 BGP: Cluster list item should be prepended Commit 3c09af41... changed behavior of int_set_add() from prepend to append, which makes more sense for community list, but prepend must be used for cluster list. Add int_set_prepend() and use it in cluster list handling code. commit c8cafc8ebb5320ac7c6117c17e6460036f0fdf62 Author: Ondrej Zajicek (work) Date: Tue Nov 8 17:46:29 2016 +0100 Minor code cleanups commit 920a86e8493fe25008f084f67f368aea9b197efd Author: Ondrej Zajicek (work) Date: Thu Nov 3 09:53:53 2016 +0100 Add missing extern commit e03dc6a984555e3c943735d50376cada2220bac8 Author: Ondrej Zajicek (work) Date: Sun Oct 30 23:51:23 2016 +0100 BFD: Authentication Implement BFD authentication (part of RFC 5880). Supports plaintext passwords and cryptographic MD5 / SHA-1 authentication. Based on former commit from Pavel Tvrdik commit 29239ba2bbee3e9ec7d17793b25936a1bfc795ca Author: Ondrej Zajicek (work) Date: Thu Oct 27 20:58:21 2016 +0200 OSPF: Use message authentication interface Based on former commit from Pavel Tvrdik commit 390601f038b69d5de3841c691f92af0fcd088454 Author: Ondrej Zajicek (work) Date: Wed Oct 26 16:07:45 2016 +0200 RIP: Use message authentication interface Based on former commit from Pavel Tvrdik commit 64385aee0cc2dfae8297f29ce6724cedf7cc4736 Author: Pavel Tvrdík Date: Thu Jan 28 17:05:15 2016 +0100 DOC: Password algorithm option commit 56cb3bedc2634a44ea41587566c2889f5b5f5b5b Author: Pavel Tvrdík Date: Tue Jan 26 16:45:13 2016 +0100 Nest: Add support for MAC algorithms in grammar commit de2a27e255b6ec834d11c005909b28a150c7c0db Author: Ondrej Zajicek (work) Date: Tue Oct 25 17:04:17 2016 +0200 Add generic message authentication interface Add generic interface for generating and verifying MACs (message authentication codes). Replace multiple HMAC implementation with a generic one. commit 7eec3988758cb4c19a0ab3bf90cab2a4914165be Author: Ondrej Zajicek (work) Date: Tue Nov 1 16:18:27 2016 +0100 BSD: Fix build on OpenBSD broken by previous commit commit 3e236955c9369475872b9b86a58502fa777b50b9 Author: Jan Moskyto Matejka Date: Fri Oct 14 15:37:04 2016 +0200 Build: switch on -Wextra, get rid of most of the warnings There are several unresolved -Wmissing-field-initializers on older versions of GCC than 5.1, all of them false positive. commit 17fe57d8dcc89aea520788914b252cf49cf060ff Author: Ondrej Zajicek (work) Date: Tue Nov 1 11:37:49 2016 +0100 Log: Fix broken syslog name BIRD passed string from configuration to openlog(), which kept it internally. After reconfiguration the old string was freed, therefore openlog had invalid copy. Thanks to Chris Caputo for the original patch. commit 3213273d8261c69a343fcd7d4c9607385dfdbb65 Author: Ondrej Filip Date: Thu Oct 27 11:08:28 2016 +0200 IANA assigned a different number to large BGP communities - changed. commit c68e8cd374f16a1d659c80f9ebe503f2dd0d4acb Author: Ondrej Zajicek (work) Date: Tue Oct 18 13:06:05 2016 +0200 Filter: Minor formatting changes in test.conf commit 3c09af416939d26c252aa1b339b52fd8f9f8e774 Author: Pavel Tvrdik Date: Thu Oct 13 16:57:21 2016 +0200 Clist: The add() function will append a new value The add() function used to prepend a new community to clist, but after this fix the add() function appends new community. commit 5fd7dacadc3cd8f91f66cb56e3a9ef81028aa102 Author: Pavel Tvrdik Date: Thu Oct 13 15:17:41 2016 +0200 Filter: Expand testing of large community sets commit 2e7fb11a6e31324151c6db98df2fe26d2d6cffab Author: Jan Moskyto Matejka Date: Wed Oct 12 14:16:34 2016 +0200 Fixed memory bloating on kernel merge paths together with export filter. Some memory was being allocated from bad linpool, not from the given one as they should. Thanks to Madhu and Justin Cattle for reporting this. commit 9df52a98e2eae28f219510d4c3d65ec43a50c394 Author: Pavel Tvrdik Date: Mon Sep 5 11:20:28 2016 +0200 Doc: Change debug to { flag1|flag2|flag3 [, ...] } style Thanks to Micah Anderson for bug report and Ondrej Zajicek for the idea! commit 9fcb9637b55d234dfedfcb54bd76ed5a9570b7a1 Author: Pavel Tvrdik Date: Mon Sep 19 16:01:29 2016 +0200 Nest: Remove trailing whitespaces commit 3d28f0145382feddcf7f66c0a20b6c5b3e0edbc9 Author: Pavel Tvrdik Date: Mon Sep 26 18:05:51 2016 +0200 Doc: Fix deprecated unescaped braces in perl script This commit should fix warning `make docs' ./sgml2html bird.sgml Unescaped left brace in regex is deprecated, passed through in regex; marked by <-- HERE in m/\\nameurl{ <-- HERE (.*)}{(.*)}/ at fmt_latex2e.pl line 287. commit c2564d34af9e01a828c24b0be7f269e5b036b5da Author: Pavel Tvrdik Date: Sat Oct 1 12:50:29 2016 +0200 Tree/Trie: Check the end of buffer We set buffer->pos to buffer->end in function buffer_print() when bvsnprintf() failed, so there would be uninitialized memory between the old buffer->pos and the current buffer->pos. commit 7935b9d21228dcd1eb95ebcb056b2a815e3e854b Author: Pavel Tvrdik Date: Thu Sep 29 18:08:40 2016 +0200 Doc: Add tag for links to RFCs commit 9c20a8b7ae69487397392c720a5e75087c343df1 Author: Pavel Tvrdik Date: Mon Oct 3 12:35:36 2016 +0200 Doc: Fix inline Don't make space before or after link name. commit 963929df021ae54d8ff4cd18ca228932fc89dc13 Author: Pavel Tvrdik Date: Mon Oct 3 12:04:44 2016 +0200 Doc: Do not use symlinks for files commit 70104ef4fb5f8105422d6eb811a93b68aeae709d Author: Pavel Tvrdik Date: Mon Oct 3 11:46:40 2016 +0200 Doc: Generate one-sided version This removes jumping offset for odd and even pages for binding book. commit f9bd11c337afcc3e95b459e3901a4ca28cb14b85 Author: Pavel Tvrdik Date: Mon Oct 3 11:39:56 2016 +0200 Doc: Use [table t] or [table name] commit 74d76f6c3877e4a745fb63b55486810322076153 Author: Pavel Tvrdik Date: Mon Oct 3 11:36:44 2016 +0200 Doc: Fix unnecessary special chars commit f15dc6813870565d01378265ab20e017757af220 Author: Pavel Tvrdik Date: Mon Oct 3 10:59:43 2016 +0200 Doc: Enable break lines in commit f5952c7343841fe4b7b63b7a56e95aba104f2e82 Author: Pavel Tvrdik Date: Mon Oct 3 10:32:28 2016 +0200 Doc: Daemon command-line options alphabet order commit 22558357d45c27583156f8c11412e37ce48a42e0 Author: Pavel Tvrdik Date: Mon Oct 3 10:22:24 2016 +0200 Doc: Add command-line options --version, --help commit b9864aa87193ac1a5ebbc04d24ec782a1fe9637a Author: Pavel Tvrdik Date: Mon Sep 26 18:00:59 2016 +0200 Doc: Add labels to all chapters and options commit a2df7c0303d235f4122969243e9df152a8a16dcb Author: Pavel Tvrdik Date: Thu Sep 29 14:05:25 2016 +0200 Doc: Generate clickable PDF commit 9faf72c8cc9a099b41c90ee1822e8bca22fd0596 Author: Pavel Tvrdik Date: Thu Sep 29 11:20:04 2016 +0200 Doc: Fix whitespaces commit a998836d4bd4df8820e67f51e16d81a5a8dc9e9b Author: Ondrej Zajicek (work) Date: Tue Oct 4 23:19:35 2016 +0200 Filter: fix missing separator commit a46e01eeef17a7efe876618623397f60e62afe37 Author: Ondrej Zajicek (work) Date: Tue Oct 4 12:45:39 2016 +0200 Nest: Fix signedness of large communities commit cec4a73ccb22ed412e87560e4210b6df40832aad Author: Ondrej Zajicek (work) Date: Tue Oct 4 00:31:43 2016 +0200 Doc: Documentation for large communities commit 60566c5c804070c145fafd75ef2c17efb489a1eb Author: Ondrej Zajicek (work) Date: Sat Oct 1 22:31:01 2016 +0200 Filter: large community sets Add support for lc sets to filter code. Grammar of (small) community sets has to be updated to avoid parser collisions. commit 66dbdbd993115c57acafdb776d2165d0b4a90a45 Author: Ondrej Zajicek (work) Date: Sat Oct 1 12:50:29 2016 +0200 BGP: Support for large communities Add support for large communities (draft-ietf-idr-large-community), 96bit alternative to RFC 1997 communities. Thanks to Matt Griswold for the original patch. commit f51b1f556595108d53b9f4580bfcb96bfbc85442 Author: Ondrej Zajicek (work) Date: Thu Sep 29 15:06:19 2016 +0200 NEWS and version update commit 5bf35a9aee448ce7e3493ec7b80c84c8f5f39242 Author: Pavel Tvrdik Date: Thu Sep 29 13:28:18 2016 +0200 Docs: fix BFD label BFD headline will appear in Table of Contents again. commit ccd2a3eda24230df550e9880f4340fc6341c8f52 Author: Jan Moskyto Matejka Date: Thu Sep 29 12:00:53 2016 +0200 Kernel socket missing err_hook fix Thanks to Tim Weippert for bugreport. commit 79e2293ab2abbd92bb3326a95759a4ca32d9af81 Author: Ondrej Zajicek (work) Date: Thu Sep 22 13:34:56 2016 +0200 NEWS and version update commit 768d5e1058693d2bfb7c3bcbe04306097c3246a0 Author: Pavel Tvrdik Date: Tue Sep 20 15:13:01 2016 +0200 Add !~ operator to filter grammar commit 75ac3d199d1fd5b199dd753915234b8634c272e5 Author: Ondrej Zajicek Date: Wed Sep 21 12:07:59 2016 +0200 Remove cvsignore We have gitignore commit 6e75d0d27fe85f12a22928e5729465823704281e Author: Ondrej Zajicek (work) Date: Mon Sep 19 12:29:56 2016 +0200 KRT: Add krt_scope attribute Add a new route attribute, krt_scope, to expose the Linux kernel route scope. Constants from /etc/iproute2/rt_scopes (prefixed by "ips_") are expected to be used with the attribute. Both import and export are supported. Also, the patch fixes device route export to the kernel, by setting link scope automatically. commit 292f7858e60b0dffd8c06f6818d90ccf3b34e0b2 Author: Pavel Tvrdik Date: Thu Sep 8 16:27:40 2016 +0200 Main: Improve BIRD help messages commit 6273fcf072fc5789ebabf4f1acd6fc6c9fa143ee Author: Pavel Tvrdik Date: Wed Sep 7 14:58:51 2016 +0200 Add stdlib.h to client/commands.c commit 0f5054f6850c7419933a6337a34263f565663ee3 Author: Pavel Tvrdik Date: Thu Sep 8 13:45:36 2016 +0200 BFD: Fix invalid read from pollfd array It is possible that sockets_add() are called between sockets_prepare() and sockets_fire() during poll loop in birdloop_main(), so we need to use loop->poll_fd.used instead of loop->sock_num to find the last field. commit a290da25a16b7c79d4a7a87f522b4068bca04979 Author: Pavel Tvrdik Date: Tue Sep 6 17:08:45 2016 +0200 rt-table: Fix kernel protocol export filter memory bug Kernel protocol calls rt_export_merged(), which used @rte_update_pool for temporary allocations, supposing it is called from other functions from rt-table.c that handles locking and flushing of the linpool. Therefore, linpool was not flushed properly and memory leaked. Add linpool argument to rt_export_merged() and use @krt_filter_lp when called from kernel protocol. Thanks to Justin Cattle and Alexander Frolkin for the bugreport. (Commit squashed and updated by Ondrej Zajicek) commit bc00f058154bb4a630d24d64a55b5f181d235c63 Author: Pavel Tvrdik Date: Tue Sep 6 17:18:15 2016 +0200 Filter: Prefer xmalloc/xfree to malloc/free commit 4adcb9df1bf551cc5fd1145c09af1843fdc4fe85 Author: Ondrej Zajicek (work) Date: Thu Sep 15 14:59:06 2016 +0200 KRT: Add kernel metric protocol option Kernel routes with different metrics do not clash with each other, therefore using dedicated metric value is a reliable way to avoid overwriting routes from other sources (e.g. kernel device routes). Although kernel route metric could already be set as a route attribute by filters, that is not consistent with the way how Linux kernel handles route metric - not just a route attribute, but a part of a route key. commit 2feaa6931bfe39eba696b33b0c8aac13d313b223 Author: Ondrej Zajicek (work) Date: Wed Sep 14 11:40:15 2016 +0200 KRT: Support for IPv6 ECMP Linux represents IPv6 ECMP routes as a sequence of unipath routes with the same prefix. We have to translate between our representation (one route with multipath next hop) and the Linux representation in both directions. Proper learning of alien IPv6 ECMP routes still not supported. Thanks to Mikhail Sennikovskii for the original patch. commit 84cac51a51fc29349077e8cecadf1aed11f9b824 Author: Ondrej Zajicek (work) Date: Tue Aug 30 17:17:27 2016 +0200 Nest: Keep multipath next hops sorted commit a1839f3c61af66814a8c52b9ad28e59aab4ede0e Author: Ondrej Zajicek (work) Date: Wed Aug 31 14:02:41 2016 +0200 KRT: Fix trivial error commit f9f2e280ea4fa1af19d8ce9e54abeb495694c0d5 Author: Ondrej Zajicek (work) Date: Tue Aug 30 12:43:46 2016 +0200 KRT: Forbid path merging on BSD We support ECMP routes only on Linux. Exported routes are checked in krt_capable(), but a route generated during path merging avoids this check. commit 768d013267bd2a52bab70ba6d413f49365fb31e3 Merge: 678c97f d107ef7 Author: Ondrej Zajicek (work) Date: Tue Aug 23 17:35:26 2016 +0200 Merge remote-tracking branch 'origin/misc-fixes' commit 678c97f21ef15c98546f41647f3244799a37db1f Author: Ondrej Zajicek (work) Date: Tue Aug 23 17:33:00 2016 +0200 Minor README update commit d107ef78df2564cba75af1a6dcc9894c4468b207 Author: Pavel Tvrdik Date: Tue Aug 16 13:02:32 2016 +0200 Whitespace fixes commit dbac8793bd88279fd8956ce42db7bd2230965948 Author: Pavel Tvrdik Date: Tue Aug 16 10:42:12 2016 +0200 Add link to INSTALL in README file commit 9b3d2464cd6dafdd3021f4513f24d19d56d42d3d Author: Pavel Tvrdik Date: Tue Aug 16 10:15:58 2016 +0200 Rewrote README file * Made structure with headlines, * reordered, * kicked out 'What is missing' part, * Updated content by home page site and user docs commit 671ddd5b05cf35b2ab7b80f1d13641c875f22e77 Author: Ondřej Surý Date: Tue Aug 16 09:25:50 2016 +0200 Add .gitignore to ignore generated files commit 33d22f0e9e79c387c492d1cf16bdb723ca1d588a Author: Ondřej Surý Date: Tue Aug 16 09:24:12 2016 +0200 whitespace fixes commit 61e6725335fbba86175ec770c1e94c5f60e76d5c Author: Ondřej Surý Date: Tue Aug 16 09:23:55 2016 +0200 Include in cf-lex.l to avoid UINTx_MAX redefinition commit 0ea2afe67150661328c93679587740fbd8928b2a Author: Pavel Tvrdik Date: Mon Aug 15 16:16:36 2016 +0200 Adds mailing list address at the top of README file commit 13a31a4001e02ea7c84d26cbeaaa9fea816736f7 Author: Ondrej Zajicek (work) Date: Wed Jul 20 15:55:45 2016 +0200 Babel: Immediately update hello interval on interface reconfigure An interface reconfiguration may change both the hello and update intervals. An update interval change is immediately put into effect, while a hello interval change is not. This also updates the hello interval immediately (if the new interval is shorter than the old one), and sends a hello to notify peers of the change. Signed-off-by: Toke Høiland-Jørgensen commit a08a81c6b40dcf07e786b67e5015fc91a44333ca Author: Ondrej Zajicek (work) Date: Wed Jul 20 15:31:25 2016 +0200 Netlink: Fix build with older headers missing IFA_FLAGS commit e37d2e3e708db78f9b8f15eb34bb266cfae7bb42 Author: Ondrej Zajicek (work) Date: Wed Jul 20 15:06:57 2016 +0200 Netlink: Ignore tentative addresses Ignore tentative IPv6 addresses and wait until finish of Duplicate Address Detection (We got notification when an address is no longer tentative) to avoid problems when protocols try to use interfaces with tentative link-local addresses. Based on patch from Jan Moskyto Matejka commit 0a21c21112eff1286a0a2a7f7afc812f8d16cfa2 Author: Ondrej Zajicek (work) Date: Tue Jul 19 15:40:57 2016 +0200 Doc: Fix password ID option description Thanks to Alexander Velkov for noticing it commit c6ed5a0f9925476714d6b351c61dbce704a4f09d Author: Ondrej Zajicek (work) Date: Tue Jul 19 14:38:36 2016 +0200 Babel: Do not maintain feasibility distance for our own routes We do not need to maintain feasibility distances for our own router ID (we ignore the updates anyway). Not doing so makes the routes be garbage collected sooner when export filters change. Signed-off-by: Toke Høiland-Jørgensen commit 0f673666017bfc9c05c9495ae53bc323b9dc6660 Author: Ondrej Zajicek (work) Date: Tue Jul 19 14:28:53 2016 +0200 Babel: Do not keep an infeasible route as selected When a route becomes infeasible it should not be kept as selected; this is forbidden by section 3.6 of the RFC and prevents subsequent updates from the same router ID from replacing it. Signed-off-by: Toke Høiland-Jørgensen commit 5d6ca220850c615126ea6820f8c05528269feec6 Author: Ondrej Zajicek (work) Date: Tue Jul 19 14:23:41 2016 +0200 Babel: Send wildcard retractions on shutdown and startup This makes BIRD send a wildcard retraction on all interfaces before shutting down and right after starting up. This helps ensure that neighbours will discard the announced routes as soon as possible, rather than only after the normal timeout procedures. Signed-off-by: Toke Høiland-Jørgensen commit ecae2f43f37df642e5098201a0472802e6a70e78 Author: Ondrej Zajicek (work) Date: Tue Jul 19 13:33:02 2016 +0200 Babel: Rework handling of retractions An update with wildcard AE and infinite metric should be treated as a global retraction of all prefixes announced by that neighbour, per section 4.4.9 of the RFC. In addition, router ID and seqno in retraction updates should be ignored. This reworks the handling of retractions and adjusts the parser to handle all this correctly. Signed-off-by: Toke Høiland-Jørgensen commit 12640c149976e1eca54d9c22c593d07a27c49d42 Author: Ondrej Zajicek (work) Date: Tue Jul 19 12:16:51 2016 +0200 Babel: Documentation updates This updates the documentation to correctly mention Babel when protocols are listed, and adds examples and route attribute documentation to the Babel section of the docs. Signed-off-by: Toke Høiland-Jørgensen commit 321ff8c4049ec6c2fa198858b4a7f1814ce05e39 Author: Ondrej Zajicek (work) Date: Tue Jul 19 11:57:20 2016 +0200 Babel: Make sure intervals do not overflow Intervals are carried as 16-bit centisecond values, but kept internally in 16-bit second values, which causes a potential for overflow. This adds some checks to make sure this does not happen. Signed-off-by: Toke Høiland-Jørgensen commit 6887f409f0766c60dd8c3d3fdf01a1d989c090a5 Author: Ondrej Filip Date: Sun Jul 17 14:54:52 2016 +0200 Prepare for longer interface names - clean up of the code. commit ea0cb652e91d871e7808e93aa15ef34fc453c4fc Author: Ondrej Zajicek (work) Date: Mon Jul 11 20:41:32 2016 +0200 BGP: Fix extended messages Change attribute length limit to handle extended (64 kB) messages. Do not mix updates and withdraws (RFC 7606). commit f0b822a831d0f0f593bbedf0a7f15b94c3ca1d43 Author: Ondrej Zajicek (work) Date: Mon Jul 11 20:22:55 2016 +0200 Log: Fix error handling of debug file open Logging is not yet initialized, we have to use fprintf() here. Thanks to Pavel Tvrdik for noticing and debugging it. commit f1f39bb9d8e2260fe181240dd8194b06bdcfb54f Author: Ondrej Zajicek (work) Date: Fri Jul 1 11:03:13 2016 +0200 Filter: Fixes reconfiguration with last_nonaggregated operator commit 775a5a81958e66a69663803dd2e731e3800da9e7 Author: Ondrej Zajicek (work) Date: Wed Jun 29 14:11:03 2016 +0200 BGP: Skip empty path segments in received AS_PATH Although RFC 4271 does not forbid empty path segments, they are useless and some implementations consider them invalid. It is clarified in RFC 7606, specifying that AS_PATH with empty segment is considered malformed. commit 8f01879c5629bd714dfeec968337cfcd4dbe6a87 Author: Pavel Tvrdík Date: Tue Mar 29 10:37:31 2016 +0200 cppcheck: fix va_end() functions commit 122deb6d5b14f46f3cfb25bf3f5726005d6a3b3e Author: Ondrej Zajicek (work) Date: Thu Jun 9 00:30:41 2016 +0200 Filters: Fixes pm_same() w.r.t. ASN ranges and ASN expressions This is necessary for proper detection of filter changes during reconfigurations. commit a0fe1944d12771d60986a352552e5f4b306e5f7f Author: Ondrej Filip Date: Wed Jun 8 16:22:44 2016 +0200 Add AS# ranges to bgpmask. commit 90dc0f08434323535f84d64e113dae84675c46b2 Author: Ondrej Filip Date: Sat Jun 4 12:38:06 2016 +0200 Small typo in documentation example, submitted by Felix Eckhofer. commit 9dbcb11cb50167e959536e5a564ee9aafae509c6 Author: Jan Moskyto Matejka Date: Mon May 30 14:28:22 2016 +0200 Unix IO: Tried to fix strange behavior after POLLHUP or POLLERR. commit 3f2c7600fa2e35b1028c755aa06092b5991e1a8e Author: Ondrej Zajicek (work) Date: Thu May 12 21:29:04 2016 +0200 We don't need bvsnprintf() in BIRD client commit 8e433d6a529a883d566dc1d5a4afe0f1e2750baf Author: Pavel Tvrdik Date: Thu May 12 15:49:44 2016 +0200 Prog Doc: Complete several missing parameters commit fff7498d6a54d4bcce4bd56db7ef3fb28be35578 Author: Pavel Tvrdik Date: Thu May 12 13:37:23 2016 +0200 User Doc: Fix several typing error commit 31e9e10144a6994773a04d94903fa3bdde6de91e Author: Stijn Tintel Date: Tue May 10 16:45:35 2016 +0300 netlink: update struct msghdr The netlink code assumes an order for the members of struct msghdr. This breaks recvmsg and sendmsg with musl libc on mips64. Fix this by using designated initializers instead. Signed-off-by: Stijn Tintel commit f7a99acb4eac23223f51ce83b8081cc9695fef1e Author: Pavel Tvrdik Date: Tue May 3 09:32:49 2016 +0200 Initialize variable ifr in sk_setup() ==00:00:00:02.831 2468== Syscall param socketcall.setsockopt(optval) points to uninitialised byte(s) ==00:00:00:02.831 2468== at 0x513BDEA: setsockopt (in /usr/lib/libc-2.23.so) ==00:00:00:02.831 2468== by 0x45C7AF: sk_setup (io.c:1216) ==00:00:00:02.831 2468== by 0x45CDFF: sk_open (io.c:1417) ==00:00:00:02.831 2468== by 0x44B562: rip_open_socket (packets.c:740) ==00:00:00:02.831 2468== by 0x4481A7: rip_iface_locked (rip.c:616) ==00:00:00:02.831 2468== by 0x4133E4: olock_run_event (locks.c:177) ==00:00:00:02.831 2468== by 0x45A6DE: ev_run (event.c:85) ==00:00:00:02.831 2468== by 0x45A7AD: ev_run_list (event.c:142) ==00:00:00:02.831 2468== by 0x45E0FC: io_loop (io.c:2066) ==00:00:00:02.831 2468== by 0x463B56: main (main.c:845) ==00:00:00:02.831 2468== Address 0xffefffd24 is on thread 1's stack ==00:00:00:02.831 2468== in frame #1, created by sk_setup (io.c:1188) ==00:00:00:02.831 2468== Uninitialised value was created by a stack allocation ==00:00:00:02.831 2468== at 0x45C6BB: sk_setup (io.c:1188) commit 1e3810f9f8e251d82a8157b39df9be196315c43e Author: Ondrej Zajicek (work) Date: Fri Apr 29 13:25:46 2016 +0200 Doc: Minor fix commit 52bae25580e6e0edae8384885818044ef89103e3 Author: Ondrej Zajicek (work) Date: Fri Apr 29 13:07:21 2016 +0200 NEWS and version update commit 937e75d8f1d203b637ba0ea050026f9af92485f3 Author: Ondrej Zajicek (work) Date: Thu Apr 28 18:01:40 2016 +0200 Add the Babel routing protocol (RFC 6126) This patch implements the IPv6 subset of the Babel routing protocol. Based on the patch from Toke Hoiland-Jorgensen, with some heavy modifications and bugfixes. Thanks to Toke Hoiland-Jorgensen for the original patch. commit a7baa09862e6b4856cd66197c6bd74c7df336b8f Author: Ondrej Zajicek (work) Date: Wed Apr 13 14:30:28 2016 +0200 BSD: Add the IPsec SA/SP database entries control Add code for manipulation with TCP-MD5 keys in the IPsec SA/SP database at FreeBSD systems. Now, BGP MD5 authentication (RFC 2385) keys are handled automatically on both Linux and FreeBSD. Based on patches from Pavel Tvrdik. commit 43fc6bb0fb720762f12124076e2241855741ceb5 Author: Ondrej Zajicek (work) Date: Mon Apr 11 00:41:10 2016 +0200 Documentation update commit e90dd656cc9126e1fbcc45fb77a10bf1baa2a1b5 Author: Ondrej Zajicek (work) Date: Fri Apr 8 15:10:57 2016 +0200 Direct: Implement check link for direct protocol When enabled, direct protocol generates routes only if the underlying link state is up. commit f2ae2badff37c008ba8217a12f8ee6dc6a3c5a39 Author: Ondrej Zajicek (work) Date: Thu Apr 7 12:20:45 2016 +0200 Main: Add local option Add option that changes default paths for config file and control socket to the current working directory. commit 06edbb67ed807811654e7fd8f0f9b83766430216 Author: Ondrej Zajicek (work) Date: Thu Apr 7 01:10:24 2016 +0200 Nest: Reset export route counter during graceful restart Counter exp_routes is increased during initial route feed after GR recovery, so it has to start with zero, otherwise BIRD will end with double value in exp_routes. commit bd22d7f41d37dec8f7b8b845f6a18c775e66ddfc Author: Ondrej Zajicek (work) Date: Wed Apr 6 11:57:28 2016 +0200 IO: Avoid multiple event cycles in one loop cycle. Event cycle may took too much time and trigger next timer events, so avoid cycling between timer and event cycles inside the loop cycle. commit 9e7b3ebdf9556d7464911dd39e862b1c003319b3 Author: Ondrej Zajicek (work) Date: Wed Apr 6 11:49:34 2016 +0200 IO: Replace RX priority heuristic with explicit mark In BIRD, RX has lower priority than TX with the exception of RX from control socket. The patch replaces heuristic based on socket type with explicit mark and uses it for both control socket and BGP session waiting to be established. This should avoid an issue when during heavy load, outgoing connection could connect (TX event), send open, but then failed to receive OPEN / establish in time, not sending notifications between and therefore got hold timer expired error from the neighbor immediately after it finally established the connection. commit e86cfd41d975122cc944db68383aef4028da9575 Author: Ondrej Zajicek (work) Date: Wed Mar 23 18:25:15 2016 +0100 KRT: Fix route learn scan when route changed When a kernel route changed, function krt_learn_scan() noticed that and replaced the route in internal kernel FIB, but after that, function krt_learn_prune() failed to propagate the new route to the nest, because it confused the new route with the (removed) old best route and decided that the best route did not changed. Wow, the original code (and the bug) is almost 17 years old. commit ea0a8be2ff5afb8385a69cc0df70984e0fd3a570 Author: Jan Moskyto Matejka Date: Wed Mar 30 16:21:32 2016 +0200 IO/Poll: fix mistaken variable merge The events variable is used in the short loop decision. The reasons are not much clear, keeping this to keep the former behaviour. commit 54bb032d21d25a2221877e15325e79add10278ec Author: Jan Moskyto Matejka Date: Wed Mar 23 01:45:37 2016 +0100 Birdlib: Modify lists to avoid problems with pointer aliasing rules The old linked list implementation used some wild typecasts and required GCC option -fno-strict-aliasing to work properly. This patch fixes that. However, we still keep the option due to other potential problems. (Commited by Ondrej Santiago Zajicek) commit 665b8e5283df4f64eb44d8fb434489be1474b5d4 Author: Ondrej Zajicek (work) Date: Tue Mar 22 13:35:40 2016 +0100 Birdlib: Do cleanups after remove/free To avoid byzantine behavior in case of some errors, linked lists are cleared after rem_node() and resource headers are cleared after rfree(). commit 39a6b19d6d7e420805bd75783b77bf442745bccb Author: Ondrej Zajicek (work) Date: Tue Mar 22 12:51:31 2016 +0100 OSPF: Fix bogus LSA ID collisions between received and originated LSAs After restart, LSAs locally originated by the previous instance are received from neighbors. They are installed to LSA db and flushed. If export of a route triggers origination of a new external LSA before flush of the received one is complete, the check in ospf_originate_lsa() causes origination to fail (because en->nf is NULL for the old LSA and non-NULL for the new LSA). The patch fixes this by updating the en->nf for LSAs being flushed (as is already done for empty ones). Generally, en->nf field deserves some better description in the code. Thanks to Jigar Mehta for analyzing the problem. commit 0a505706bc909b2625d308ffb2eaed3dc8398538 Author: Ondrej Zajicek (work) Date: Wed Mar 9 17:51:50 2016 +0100 Minor changes in documentation commit a459f4df16eca156cb7c6def4a758fd89c9fa504 Author: Ondrej Zajicek (work) Date: Wed Mar 9 17:37:44 2016 +0100 OSPF: Fix reading from freed memory Thanks to Pavel Tvrdik for noticing it. commit 62a4ad365760afae485ae61c5aab734012545be4 Merge: 9036bbf 9c92f69 Author: Jan Moskyto Matejka Date: Tue Mar 22 13:23:55 2016 +0100 Merge remote-tracking branch 'origin/poll' commit 9c92f69272de3795f7289969e815d99a93d0d9b3 Author: Jan Moskyto Matejka Date: Fri Mar 18 11:44:28 2016 +0100 Unix: Substituted select -> poll also in congestion checker It does strange things when even one fd larger than FD_SETSIZE is passed to select(). commit 9036bbf2b7cc781c87f2a6b3979198f77ec6ada1 Author: Pavel Tvrdík Date: Tue Mar 15 14:55:40 2016 +0100 RIP: fix typo in configuration at rx length opt commit 79a4f74a65941603cc42680d2e61b00ec88abe97 Author: Pavel Tvrdík Date: Tue Mar 15 10:29:32 2016 +0100 BGP: Add documentaion for extended messages commit fd926ed4eea319b94bd0e09e093b90846bcb169b Author: Jan Moskyto Matejka Date: Tue Mar 15 14:57:49 2016 +0100 Poll: Prevent the improbable case of EAGAIN after POLLIN commit e1c13a5a7b86f2ba09178300bad960224658c833 Author: Jan Moskyto Matejka Date: Wed Mar 9 12:12:02 2016 +0100 Unix: Rework of select-loop to poll-loop This should lift the limit of FD_SETSIZE and allow more than 1024 fd's. FD_SETSIZE limit doesn't matter now when creating new sockets. commit ce95af7a5f5159033e569a7ccedce0e20bb5d913 Merge: b25509e e3f506f Author: Jan Moskyto Matejka Date: Thu Feb 25 18:25:53 2016 +0100 Merge branch 'master' of gitlab.labs.nic.cz:labs/bird commit e3f506f9b53bd8e44976df1c935c7ec417793ace Author: Ondrej Zajicek (work) Date: Thu Feb 25 18:16:59 2016 +0100 OSPF: Multicast ability is irrelevant for stub interfaces commit b25509e5128e6f2a856cd4a07bb78f3d6b7fc789 Author: Jan Moskyto Matejka Date: Wed Jan 20 15:23:17 2016 +0100 All the current pthread implementations are OK and working with us. No more need to disable pthread for specific BSD's. commit 9c9cc35c0273f8bcae10fb8b546d199514b2bbc5 Author: Ondrej Zajicek (work) Date: Tue Feb 16 17:33:58 2016 +0100 Filter: Implement last_nonaggregated operator on bgp_path commit c2106b674ca632f7c0bffd7cab4b1940f74d353c Author: Ondrej Zajicek (work) Date: Thu Feb 11 21:53:55 2016 +0100 Unix: Fix bug in syslog name handling Pointer to current_log_name has to be changed even if the name is the same, because the old one will be invalid/freed after reconfiguration. commit 487c6961cb29046dbe9560262e3e742e38691b83 Author: Ondrej Zajicek (work) Date: Thu Feb 11 16:38:28 2016 +0100 BGP: Fix bug in incoming connection handling When a BGP session was established by an outgoing connection with Graceful Restart behavior negotiated, a pending incoming connection in OpenSent state, and another incoming connection was received, then the outgoing connection (and whole BGP session) was closed, but the old incoming connection was just overwritten by the new one. That later caused a crash when the hold timer from the old connection fired. commit 52e21323b6c49af9d076586241451973a7d1e7c6 Author: Ondrej Zajicek (work) Date: Wed Nov 25 15:52:58 2015 +0100 BGP: Update capability number from IANA for extended messages commit 33b4f40acce02c90b4b7766c5c94ebf2d22765c6 Author: Pavel Tvrdík Date: Fri Nov 13 16:08:28 2015 +0100 MD5: Mormalize naming style commit 90f78507f4a13673ccf0ba7c786b43d9e882fca7 Merge: 8eb8e54 ad27615 Author: Ondrej Zajicek (work) Date: Tue Nov 24 15:21:11 2015 +0100 Merge branch 'master' into rip-new commit ad27615760e2795da3efe5e97c0e888281d5ca59 Author: Jan Moskyto Matejka Date: Tue Nov 10 14:59:41 2015 +0100 Netlink: attribute validation before parsing Wanted netlink attributes are defined in a table, specifying their size and neediness. Removing the long conditions that did the validation before. Also parsing IPv4 and IPv6 versions regardless on the IPV6 macro. commit e422ca0f292d08a873deacdbffbb6c6cbd79f88a Author: Ondrej Zajicek (work) Date: Tue Nov 24 13:52:26 2015 +0100 Some consts for function arguments Patch from Pavel Tvrdik commit 5126380beace4e39578f005fe115917b8e8b8ff3 Author: Ondrej Zajicek (work) Date: Tue Nov 24 13:47:28 2015 +0100 Minor changes to SHA hash functions commit 12d752ef24ab507d249a60098ec98dcf28b70036 Merge: 1e4891e f312a83 Author: Ondrej Zajicek (work) Date: Mon Nov 23 11:32:18 2015 +0100 Merge commit 'origin/crypto-hash^' commit 1e4891e48e7b6f022564e7409d15c3fdb65ec2ad Author: Ondrej Zajicek (work) Date: Mon Nov 23 11:13:40 2015 +0100 Nest: Fix bug in device proto If an interface address notification is received during device protocol shutdown/restart, BIRD crashed. Thanks to Wei Huang for the bugreport. commit f312a837e919c660884ceb9c50c106df1e4c0658 Author: Pavel Tvrdík Date: Fri Nov 13 16:14:36 2015 +0100 Add SHA-384/512 and HMAC-SHA-384/512 crypto hash commit 4035e0e79c609bde30a2f755eec864771ea08e21 Author: Pavel Tvrdík Date: Fri Nov 13 16:13:15 2015 +0100 Add SHA-224/256 and HMAC-SHA-224/256 crypto hash commit 5d0c36f1da83b2a2a07e043247410948d90c600e Author: Pavel Tvrdík Date: Fri Nov 13 16:11:51 2015 +0100 Add SHA1 and SHA1-HMAC crypto hash commit 75ff08022ea58fe3efa96639f080ce375e997675 Author: Pavel Tvrdík Date: Fri Nov 13 16:10:33 2015 +0100 Add get_u64() and put_u64() into lib/unaligned.h commit fce764f90e8331d1adb6a85ec00136dfeae1a398 Author: Pavel Tvrdík Date: Mon Nov 9 09:14:26 2015 +0100 Fix compiling with --enable-debug option commit 9ddbfbddf87462bbf50437bdc1d44499a5c223e7 Author: Jan Moskyto Matejka Date: Tue Nov 3 14:42:41 2015 +0100 Netlink: Allow more than 256 routing tables. Since 2.6.19, the netlink API defines RTA_TABLE routing attribute to allow 32-bit routing table IDs. Using this attribute to index routing tables at Linux, instead of 8-bit rtm_table field. commit 86b4e17001fe4cca6dde7ff523346121c0ae68fe Author: Ondrej Zajicek (work) Date: Mon Nov 9 01:01:12 2015 +0100 Nest: Fixes bug in missing cleanup during table removal When a table is removed during reconfiguration, a reference was not cleared in the old configuration, which breaks undo. commit 9b9a7143c43d01f0459d40363d56e9c7690c596f Author: Ondrej Zajicek (work) Date: Mon Nov 9 00:42:02 2015 +0100 Conf: Fixes bug in symbol lookup during reconfiguration Symbol lookup by cf_find_symbol() not only did the lookup but also added new void symbols allocated from cfg_mem linpool, which gets broken when lookups are done outside of config parsing, which may lead to crashes during reconfiguration. The patch separates lookup-only cf_find_symbol() and config-modifying cf_get_symbol(), while the later is called only during parsing. Also new_config and cfg_mem global variables are NULLed outside of parsing. commit 3aed0a6ff7b2b811a535202fd787281d2ac33409 Author: Ondrej Zajicek (work) Date: Tue Nov 3 11:27:27 2015 +0100 IO: Fix the previous bugfix I should check it after making some trivial changes. The original patch from Alexander has it right. commit 338f85ca7721fac16394ccabd561ddb5ccaacb36 Author: Ondrej Zajicek (work) Date: Tue Nov 3 11:08:57 2015 +0100 IO: Handle fd values too big for select() If the number of sockets is too much for select(), we should at least handle it with proper error messages and reject new sockets instead of breaking the event loop. Thanks to Alexander V. Chernikov for the patch. commit 8eb8e546dc8cc647fcfa4a3a17dfa8ab36b00958 Merge: 8465dcc acb04cf Author: Ondrej Zajicek (work) Date: Sat Oct 17 14:44:34 2015 +0200 Merge branch 'master' into rip-new commit acb04cfdc550697a7171a86ca559fd8c52841acb Author: Ondrej Zajicek (work) Date: Sat Oct 17 14:36:53 2015 +0200 Minor changes commit 8465dccb06afffed171dc1e224e4eb5f67cc3326 Author: Ondrej Zajicek (work) Date: Mon Oct 5 12:14:50 2015 +0200 Major RIP redesign The new RIP implementation fixes plenty of old bugs and also adds support for many new features: ECMP support, link state support, BFD support, configurable split horizon and more. Most options are now per-interface. commit b5e76398de1d4468b4061d9ef57dd3154b2f745e Author: Ondrej Zajicek Date: Wed Aug 19 11:16:23 2015 +0200 OSPF: Fixes some issues with link detection Thanks to Bernardo Figueiredo and Israel G. Lugo for the bugreport. commit c7b99a932cab1873042e356143ab71755920157a Author: Ondrej Zajicek Date: Tue Jul 28 15:08:21 2015 +0200 Nest: Fixes one of previous commit commit dbf4c0cb258bd92efb54f95194f664f95ba98fd9 Author: Ondrej Zajicek Date: Tue Jul 28 12:56:51 2015 +0200 Minor update to test commits commit 641172c6e5e4e291029084074f94f448d6bc69dd Author: Ondrej Zajicek Date: Tue Jul 28 12:35:12 2015 +0200 Netlink: Fixes uninitialized variable Thanks to Pavel Tvrdik for the bugfix commit 538264cf1a7690d90b2953aebff21958c2b55c44 Author: Ondrej Zajicek Date: Fri Jul 24 18:02:07 2015 +0200 Static: Support for BFD controlled static routes commit 1321e12ac460bd542d3946a0c4a4dacd71157cfa Author: Ondrej Zajicek Date: Mon Jul 20 11:12:02 2015 +0200 Static: Allows to specify attributes for static routes The patch adds suport for specifying route attributes together with static routes, e.g.: route 10.1.1.0/24 via 10.0.0.1 { krt_advmss = 1200; ospf_metric1 = 100; }; commit ffa398b8d8bac4cf6368fe700466cad4ff12fee8 Author: Ondrej Zajicek Date: Sun Jul 19 11:39:24 2015 +0200 BFD: Fixes crash after socket error Thanks to Thomas King for the bugreport. commit a8ad8fd6491d04620fe4fdebc50f0da2927f9b21 Author: Ondrej Zajicek Date: Sat Jul 18 23:15:04 2015 +0200 Simplify build messages Thanks to Christian Tacke for the original patch. commit 17661ff934a80d517284c96756357d4ed5af9a64 Author: Ondrej Zajicek Date: Sat Jul 18 19:30:35 2015 +0200 Nest: Fixes symbols in router id Thanks to Peter Hudec for noticing the problem. commit 6683d42d5b560c8805b977736b2a769ea2d9aa8b Author: Ondrej Zajicek Date: Sat Jul 18 19:05:11 2015 +0200 Documentation update commit 06e0d1b692d8a190c3f1d073c5c557d8efe78b17 Author: Ondrej Zajicek Date: Sat Jul 18 13:38:21 2015 +0200 BGP: Extended messages support Implements draft-ietf-idr-bgp-extended-messages-10, for now undocumented and with temporary private capability number. commit ab4da3423d89fb6c60a4137f19c189a8716ecab6 Author: Ondrej Zajicek Date: Sat Jul 18 13:05:05 2015 +0200 Direct: Fixes behavior for the same routes on different interfaces Thanks to Andrew (seti.kr.ua) for the bug report. commit 8d9eef17713a9b38cd42bd59c4ce76c3ef6c2fc2 Author: Ondrej Zajicek Date: Mon Jun 8 02:20:43 2015 +0200 BGP multipath support Kernel option 'merge paths' allows to merge routes exported to kernel protocol (currently BGP and static routes) to multipath routes. commit db027a41d47b8fc52b65067ccabe2024554e53ca Author: Ondrej Zajicek Date: Thu Jun 4 11:35:26 2015 +0200 Fixes subtle bug in temporary attribute handling In some cases, export filter accessed attributes of a different route. commit 78a2cc289fbe11d5b5783220e2cc61d119a78ec3 Author: Ondrej Zajicek Date: Wed Jun 3 11:58:46 2015 +0200 KRT: Fixes some minor bugs in kernel protocol commit d217ba5111a80a629e408961b902d7759c4b46f5 Author: Ondrej Zajicek Date: Sun May 31 23:25:33 2015 +0200 Moving of mulipath merging code from OSPF to nest commit ca34698ca62d979c281ed517f040619e31c3ada3 Author: Ondrej Zajicek Date: Sun May 31 11:29:53 2015 +0200 Fixes bug in pipe feeding when filtered routes are kept in table commit ae80a2de95d3d3c153ce20b90c9d8757d02cb33d Author: Pavel Tvrdík Date: Tue May 19 08:53:34 2015 +0200 unsigned [int] -> uint commit e348ef01b433e06888310c1098a05291034a856c Author: Pavel Tvrdík Date: Tue May 19 08:14:04 2015 +0200 unsgined char -> byte commit 398f92253186d70eb3f2e910c7f8dd2636ee5fa1 Author: Ondrej Filip Date: Mon Jun 1 10:41:17 2015 +0200 Typo fix by Hans van Kranenburg commit 9fe1d3ca8a6420b4bdaf15a54ab7b13be6cc07eb Author: Ondrej Zajicek Date: Fri May 22 11:12:48 2015 +0200 Fixes unnamed protocols from templates commit d0e23d42de133de706151411d8d4091d07904d29 Author: Ondrej Zajicek Date: Sun May 17 00:54:33 2015 +0200 Simplify flushing process Related to changes from previous patch. commit 86f567e13c2202fc3c3a1ce49f9a35220a50f117 Author: Ondrej Zajicek Date: Sat May 16 20:17:59 2015 +0200 Fix minor issue in pipe route propagation In some circumstances during reconfiguration, routes propagated by pipes to other tables may hang there even after the primary routes are removed. There is already a workaround for this issue in the code which removes these stale routes by flush process when source protocols are shut down. This patch is a cleaner fix and allows to simplify the flush process commit 38e835dede88158d97c3039ed22faabed79c7181 Author: Ondrej Zajicek Date: Wed May 13 13:19:26 2015 +0200 Fix in the last commit commit 9fdf9d29b6b570205c36934aab7e50539e042102 Author: Ondrej Zajicek Date: Tue May 12 16:42:22 2015 +0200 KRT: Add support for plenty of kernel route metrics Linux kernel route metrics (RTA_METRICS netlink route attribute) are represented and accessible as new route attributes: krt_mtu, krt_window, krt_rtt, krt_rttvar, krt_sstresh, krt_cwnd, krt_advmss, krt_reordering, krt_hoplimit, krt_initcwnd, krt_rto_min, krt_initrwnd, krt_quickack, krt_lock_mtu, krt_lock_window, krt_lock_rtt, krt_lock_rttvar, krt_lock_sstresh, krt_lock_cwnd, krt_lock_advmss, krt_lock_reordering, krt_lock_hoplimit, krt_lock_rto_min, krt_feature_ecn, krt_feature_allfrag commit 315f23a0470112ced04badbb117bc7854ee53e06 Author: Ondrej Zajicek Date: Sat May 9 18:50:15 2015 +0200 Add bitfield route attribute type commit 77edab640925e8d1131f0d00b41de055129ff99f Author: Ondrej Zajicek Date: Fri May 1 14:40:56 2015 +0200 OSPF: Redesign LSA checksumming New LSA checksumming code separates generic Fletcher-16 and OSPF-specific code and avoids back and forth endianity conversions, making it much more readable and also several times faster. commit 30d09eb96e8d46143d04285016a137d71a87c416 Author: Ondrej Zajicek Date: Tue Apr 28 13:45:44 2015 +0200 OSPF: Fixes validation of LSA checksums Prior to this patch, BIRD validates the OSPF LSA checksum by calculating a new checksum and comparing it with the checksum in the header. Due to the specifics of the Fletcher checksum used in OSPF, this is not necessarily correct as the checkbytes in the header may be calculated via a different means and end up with a different value that is nonetheless still correct. The documented means of validating the checksum as specified in RFC 905 B.4 is to calculate c0 and c1 from the unchanged contents of the packet, which must result in a zero value to be considered valid. Thanks to Chris Boot for the patch. commit 7069fc9e724134ddd841219f5673cc9b13c58490 Author: Ondrej Zajicek Date: Sat Apr 25 21:41:43 2015 +0200 KRT: Fixes route reload Did not really worked commit c5ff44a703e4ab810a5bd45cf9140643a50fb3ec Author: Ondrej Zajicek Date: Sat Apr 25 20:43:43 2015 +0200 KRT: Fixes learning of preferred kernel routes. When a new route was imported from kernel and chosen as preferred, then the old best route was propagated as a withdraw to the kernel protocol. Under some circumstances such withdraw propagated to the BSD kernel could remove the new alien route and thus reverting the import. commit 90097f4fb924922b416247abf291fb21f39dc8e1 Author: Ondrej Zajicek Date: Wed Apr 22 10:53:15 2015 +0200 KRT: Support for RTM_CHANGE on BSD commit deec752ef941eef4c36c21c5c5426d08e98c7a44 Author: Ondrej Zajicek Date: Mon Apr 20 12:27:00 2015 +0200 NEWS and version update commit b867a87c2fd694e6e690dc94da76754e89f03370 Author: Ondrej Zajicek Date: Sun Apr 19 00:19:56 2015 +0200 Fixes port range socket option commit ef3cac669ca0f6f2b983e33ab6d553705c35f3df Author: Ondrej Zajicek Date: Sat Apr 18 13:22:41 2015 +0200 OSPF: Fixes handling of external routes with immediate gw The bug caused that received external LSAs with locally reachable next hops were ignored. I wonder why nobody noticed it sooner. commit 304ac2e861a5ea28683489aff38ff37ff6873bb4 Author: Ondrej Zajicek Date: Sun Apr 12 10:47:17 2015 +0200 Minor fixes commit d924d5a5626397da7e71fddfb1c0fd22c2714f2c Author: Ondrej Zajicek Date: Wed Apr 1 00:01:35 2015 +0200 BGP: Fixes serious bug in TX handling Under some circumstances and heavy load, TX could be postponed until the session fails with hold timer expired. Thanks to Javor Kliachev for making the bug reproductible. commit 16a3254c4cb592e7cfa3aea744e9fd58665d6367 Author: Ondrej Zajicek Date: Tue Mar 31 23:59:40 2015 +0200 Understand IFF_MULTICAST flag on ifaces in Linux Unfortunately, some interfaces support multicast but do not have this flag set, so we use it only as a positive hint. Thanks to Clint Armstrong for noticing the problem. commit 2eadd36fa004d705a4003892d1639485eeaf8486 Author: Ondrej Zajicek Date: Sun Mar 29 21:24:47 2015 +0200 BGP: AS-wide unique router ID (RFC 6286) support RFC 6286 relaxed rules for router IDs, allowing EBGP sessions between routers with the same ID (but different ASN). commit 9aed29e605334d34d0e6a90fc172ee83d0274ad3 Author: Ondrej Zajicek Date: Sun Mar 29 18:27:13 2015 +0200 BGP: Enhanced route refresh (RFC 7313) support Also hook feed_done is renamed to feed_end. commit a5a5a41e2ee51ad6dfef0ab24e07d6d9b16a4215 Author: Ondrej Filip Date: Mon Mar 9 23:59:26 2015 +0100 Possibility to define unnamed protocols from template added. commit 509aab5debef5b4710d8983da6ef076a226fd7ea Author: Ondrej Zajicek Date: Mon Mar 2 10:58:20 2015 +0100 Fixes serious bug in BGP add-path Temporary rta is reused in BGP, while rta_lookup() breaks it. Thanks to Alexander Chernikov for analysing the problem. commit af454f9b7c3930a7900e60a7fb608b7de11852aa Author: Ondrej Zajicek Date: Mon Mar 2 09:42:44 2015 +0100 Fixes bug in debug dumps Using 'dump sockets' in IPv6 mode caused crash due to mismatched format string. Thanks to Pavel Tvrdik for noticing it. commit 8bcb5fb1e8a0718f88f99cde2f5b5a3bae5c4451 Author: Ondrej Zajicek Date: Mon Mar 2 09:41:14 2015 +0100 Implement latency tracking, internal event log and watchdog commit 4e63974471c4e2f11781cda163e0dc2ac6fb72f9 Author: Ondrej Zajicek Date: Tue Feb 24 16:19:14 2015 +0100 Add minor comment commit 9c89560e6cdf44a21b2eff8765973ed8665fa07f Author: Ondrej Zajicek Date: Sun Feb 22 20:14:14 2015 +0100 Use IP_PORTRANGE_HIGH for BFD where available commit 6cf72d7ad7cbe1eb2f5b63660be6967d29b37044 Author: Ondrej Zajicek Date: Sun Feb 22 16:08:28 2015 +0100 Rename BGP option 'start delay' to 'connect delay' Also update log message for error-triggered startup delay. commit a1beb8f3ee7a6e41dbe4bfd336b8bf5eecb46d01 Author: Ondrej Zajicek Date: Sun Feb 22 13:50:58 2015 +0100 Relax BGP neighbor parameter Permit specifying neighbor address, AS number and port independently. Add 'interface' parameter for specifying interface for link-local sessions independently. Thanks to Alexander V. Chernikov for the original patch. commit 86c3eea0f3ec74ac1024d4aba4e98c962126f387 Author: Ondrej Zajicek Date: Sat Feb 21 21:19:49 2015 +0100 Use AF_UNSPEC for RTM_GETLINK This value is specified in documentation. commit 2bbc308321894e0fd301766e8d7d78a4ec119053 Author: Ondrej Zajicek Date: Sat Feb 21 21:08:23 2015 +0100 Store protocol config size inside protocol structure Make proto_config_new() use this info instead of supplied size. Thanks to Alexander V. Chernikov for the patch. commit 374917adccb955fbb2796955166fabe46a09e096 Author: Ondrej Zajicek Date: Sat Feb 21 20:39:59 2015 +0100 Make BGP protocol instance search a separate function Thanks to Alexander V. Chernikov for the patch. commit 6264aad16f3320eceb20825c6049917e771b9364 Author: Pavel Tvrdík Date: Wed Jan 7 15:04:02 2015 +0100 Minor fixes commit 85a3639d99a39a79b65c2dbc2a136baee6ba2a2b Author: Pavel Tvrdik Date: Fri Dec 5 09:25:38 2014 +0100 Better Clang compatibility commit 7d37bf79de190c89f704bfbf0a753f328d995d5a Author: Pavel Tvrdik Date: Wed Dec 3 10:32:26 2014 +0100 Remove a comparison of unsigned expression < 0 commit e598853e681d23dd7820627eeed96bf53197eae5 Author: Pavel Tvrdik Date: Wed Dec 3 10:57:31 2014 +0100 Add const to a param msg at functions log_msg, log_rl, die, bug and debug commit 4a591d4b947e0abc0ad013ca1b75da27c6922be5 Author: Pavel Tvrdik Date: Wed Dec 3 10:10:34 2014 +0100 Replacing GNU old-style field designator extension commit 8ce9a87755372d7612375bb1a81a288f309746c8 Author: Ondrej Zajicek Date: Sat Feb 21 14:52:17 2015 +0100 Fixes minor bug in BFD. Thanks to Pavel Tvrdik for noticing it. commit 51762a45b39f906fe72db2d3d46c9890cb01bbd8 Author: Ondrej Zajicek Date: Sat Feb 21 14:05:20 2015 +0100 Allows user data attached to f_trie_node structure. Thanks to Alexander Chernikov for the patch. commit bc7f4e0e3447c579f68b43d407b64a5262f0d11e Author: Ondrej Zajicek Date: Sat Feb 21 12:42:31 2015 +0100 Bump max symbol length to 64. And move the constant to conf.h header. Thanks to Alexander Chernikov for the patch. commit ab006391305165c805f75e3a2ce20946748233c9 Author: Ondrej Zajicek Date: Sat Feb 21 12:27:05 2015 +0100 Fixes a bug in locking code. When multiple protocols have a lock for the same IP address, it crashes under some circumstances. Thanks to Matthias Schiffer for the bugreport. commit dfc7a6c6a0758a1d9a13b94708228c9844efe97e Author: Ondrej Zajicek Date: Sat Feb 21 12:24:30 2015 +0100 Fixes potential alignment bug in BGP. Thanks to Andrew (seti.kr.ua) for the bug report. commit 523f020b5f6b63096a7d5e90938baecd4beea0bd Author: Ondrej Zajicek Date: Sat Feb 21 11:46:14 2015 +0100 Link state support in BGP. Configurable fast shutdown of a BGP session when an interface loses link. commit 7730553b7eeb33d21e5597f110334ca584ad532d Merge: 0da562a ec2194f Author: Ondrej Zajicek Date: Sat Feb 21 11:39:45 2015 +0100 Merge remote-tracking branch 'origin/soft-int' commit 0da562a7cb25ed2b8724248ad6f841b1831a09c3 Author: Ondrej Zajicek Date: Sat Nov 8 23:52:42 2014 +0100 Fixes error message in 'show route' cmd. Message 'Network not in table' was not reported if a network node without any routes was found in a routing table. commit ec2194fa7a20a2768ca0027b5f3c024f0a251866 Author: Ondrej Filip Date: Wed Nov 5 11:07:25 2014 +0100 Version 1.5.0pre commit dd5ef279bce002b9942ea437ef80ce3443bbe1dc Author: Ondrej Filip Date: Tue Nov 4 18:11:59 2014 +0100 Small typo fixed. commit f92e6ab364d50900bc9104af4539f6ea42b25c43 Author: Ondrej Zajicek Date: Mon Nov 3 20:35:58 2014 +0100 Changes order of iface/addr/neigh event hooks. Now the order is: Up -> iface, addr, neigh Down -> neigh, addr, iface It fixes the case when an iface appears, related static routes are activated and exported to OSPF before the iface notification and therefore forwarding addresses are not encoded in generated external LSAs. commit ac9dc669d80cbfeea3d0cdba5ec7354c804b1ae9 Author: Ondrej Zajicek Date: Mon Nov 3 20:35:25 2014 +0100 Bugfix in latest OSPF changes. commit cd3b700393144796c9dead54b6ac2fc31aaa5272 Author: Ondrej Zajicek Date: Mon Nov 3 14:53:59 2014 +0100 Bugfix to OSPF reconfiguration. commit 6f8bbaa10bbd21729d0b62a5878febcbee2c0811 Author: Ondrej Zajicek Date: Mon Nov 3 10:42:55 2014 +0100 Fininshing integrated OSPF. commit d148d0af363cdac7783c4bf79527669cdd5ddf4a Author: Ondrej Filip Date: Sat Oct 25 21:08:35 2014 +0200 Mailling list location changed. commit 88a183c6c9a2b86b52f67e87bbc8b7edd32670c6 Author: Ondrej Zajicek Date: Fri Oct 24 11:11:43 2014 +0200 Integrated IP functions. commit f8fefde318c6248ad94e7b6d60155deed9ab8eed Author: Ondrej Zajicek Date: Fri Oct 24 10:27:21 2014 +0200 Refactoring of OSPF messages. commit d26cfa0519daf1369b697b0df000c8db8b730e66 Author: Ondrej Filip Date: Thu Oct 16 18:05:54 2014 +0200 __attribute__((packed)) added. Thank to Maksim Tamarsky commit 78342404ff573e85e396f0611014b90cea9b4c0a Merge: 178a197 cfdea7b Author: Ondrej Zajicek Date: Tue Oct 14 17:23:34 2014 +0200 Merge remote-tracking branch 'origin/master' into soft-int commit cfdea7b85f6c520cc5a62eb907d2190db14c9900 Author: Ondrej Zajicek Date: Sun Oct 5 23:59:18 2014 +0200 NEWS and version update. commit 7aa809016e9a2e24ef914888f7413dc1f2721b17 Author: Ondrej Zajicek Date: Thu Oct 2 12:46:26 2014 +0200 Implements show route noexport option. Shows routes that would be exported to the protocol but are rejected by the export filter. commit 1123e707400984108f48ac7c1be559f7ed8d9306 Author: Ondrej Zajicek Date: Thu Oct 2 11:41:34 2014 +0200 Implements token bucket filter for rate limiting. commit dcde7ae597ccb7d81648b9ecab7c0f61c88e60f2 Author: Ondrej Zajicek Date: Thu Oct 2 11:33:55 2014 +0200 Allows to configure different remote port for BGP sessions. Thanks to João Taveira Araújo for the original patch. commit 252c7e4d0b7b45c89f69b3c4763b0c013aa5830d Author: Ondrej Zajicek Date: Thu Oct 2 11:05:55 2014 +0200 Refresh kernel protocol when interface disappears. When an interface goes down, (Linux) kernel removes routes pointing to that ifacem but does not send withdraws for them. We rescan the kernel table to ensure synchronization. Thanks to Alexander Demenshin for the bugreport. commit b2f008378a39104152b20a969942cd6c99644984 Author: Ondrej Zajicek Date: Thu Oct 2 11:02:14 2014 +0200 Allows more constants in set literals. Thanks to Michael Fincham for the bugreport. commit 0479b44373892db273f3e0365c7cbaad2eeb0d5f Author: Ondrej Zajicek Date: Thu Oct 2 10:59:34 2014 +0200 Fixes some warnings. commit 178a197afb77770d8a90765e39065679936a45d1 Author: Ondrej Zajicek Date: Mon Jul 21 21:50:56 2014 +0200 OSPF instance id option and documentation update. commit 742029eb782f19c05decbd443d245f12360d5e78 Author: Ondrej Zajicek Date: Sat Jul 19 17:28:38 2014 +0200 Whitespace cleanup in OSPF. commit a7a7372aa7c527619ee527e3b37013f9fb87d618 Author: Ondrej Zajicek Date: Fri Jul 18 18:24:12 2014 +0200 Temporary integrated OSPF commit. commit 7c00551749005ad951845eb924f76e1fd28e62a2 Author: Ondrej Filip Date: Wed Jul 9 23:46:02 2014 +0200 Version 1.4.4. commit 06c4b6ac9da204453049fa56a204474486a9c9e9 Author: Ondrej Zajicek Date: Wed Jul 9 18:42:59 2014 +0200 NEWS and version update. commit 029ec22d0acedb79e03394b60ea99bb46c479d79 Author: Ondrej Zajicek Date: Wed Jul 9 18:34:42 2014 +0200 Fixes a bug in BSD kernel interfacing code. The bug was introduced in 05476c4d04a24bdb26fa64e05ab31bc36118f34e. commit 751482899c190194b4958bc54ded428f98f565e9 Author: Ondrej Zajicek Date: Mon Jul 7 22:56:21 2014 +0200 Implements default router preference (RFC 4191) for RAdv. Thanks to Baptiste Jonglez for the patch. commit 6285793f18817091060c7257f7d4af0db010a67a Author: Ondrej Zajicek Date: Mon Jul 7 22:23:37 2014 +0200 Replaces function name in test.conf as it collided with new keyword. commit 20e8d040b09f1e01c431c686f1ced5a12ba7bc68 Author: Ondrej Zajicek Date: Mon Jun 30 11:55:22 2014 +0200 Fixes integer overflow in show memory command. Thanks to Job Snijders for the bugreport. commit 8945f73d946a9323daf8dfc1bf5b3884cf6d7664 Author: Ondrej Zajicek Date: Thu Jun 26 13:30:27 2014 +0200 Ensures that msg_controllen includes last padding. Although RFC 3542 allows both cases, Theo de Raadt thinks he knows better, and msg_controllen without last padding fails on OpenBSD. Thanks to Job Snijders for the bugreport. commit 70945cb645402a4bb1d3dc46a07928caeb954c1f Author: Ondrej Zajicek Date: Thu Jun 26 11:58:57 2014 +0200 Temporary integrated OSPF commit. commit 9d5960cfa5b4c15ddd48dbab599f864a6aa1e025 Author: Ondrej Zajicek Date: Tue Jun 10 12:16:01 2014 +0200 Fixes max include depth in documentation. Thanks to Artyom Gavrichenkov for the patch. commit 9eceab33f97724be148f9f05614d7551940e85f1 Author: Ondrej Zajicek Date: Thu May 29 23:05:03 2014 +0200 String constants could be used for string option values. Thanks to Frederik Kriewitz for the patch. commit 05476c4d04a24bdb26fa64e05ab31bc36118f34e Author: Ondrej Zajicek Date: Sun May 18 11:42:26 2014 +0200 IPv4/IPv6 integrated socket code. commit 1149aa977d906a6400f998d5f6600871584395d0 Author: Ondrej Zajicek Date: Mon May 5 11:05:12 2014 +0200 Fixes a problem with undoing of deconfiguring of protocol. Thanks to Sergey Popovich for the original patch. commit 5a3905fe905ab1cc1a58fe9e6a4284f7d5057d13 Merge: 66370ea 7d9ab86 Author: Ondrej Zajicek Date: Sun May 4 11:59:50 2014 +0200 Merge commit 'origin/master' commit 66370eac1f88ec74b3017f1c39038d7b8b776de6 Author: Ondrej Zajicek Date: Sun May 4 00:01:06 2014 +0200 Fixes BGP crash when update with some attributes and empty NLRI is received. Thanks to Charlie Allom for the bugreport. commit 7d9ab86b7ac7d1f039af92a58eb749a24811b5c9 Author: Ondrej Zajicek Date: Sun May 4 00:01:06 2014 +0200 Fixes BGP crash when update with some attributes and empty NLRI is received. commit c865cae3eb327d1e0a745352c483bc7cb00f9323 Author: Ondrej Zajicek Date: Mon Apr 28 17:31:03 2014 +0200 Fixes 'show route export' w.r.t. protocols with different RA_* types. commit 984d734944a39b70a59f74e57f0e6fc3f720dd48 Author: Ondrej Zajicek Date: Sun Apr 27 00:46:32 2014 +0200 Fixes limit verification during reconfiguration. commit 145368f5474436ad7c48fa26f5bde8108ae5ef4a Author: Ondrej Zajicek Date: Wed Apr 23 13:54:28 2014 +0200 Extends multipath support for OSPF. Fixes cases where the same network or external route are propagated by several OSPF routes and some other corner cases in next hop construction and ECMP. Allows to specify whether external routes should be merged. Thanks to Peter Christensen for the original patch. commit 4dd24f05f384ac14546d4bebbfcb0ecf9a976ec6 Merge: 1cb0f83 6c6ebd6 Author: Ondrej Zajicek Date: Wed Apr 23 13:52:15 2014 +0200 Merge commit 'origin/master' commit 6c6ebd64c3e44a2658a7ae8729159f1653c00a89 Author: Ondrej Zajicek Date: Mon Apr 14 14:47:20 2014 +0200 NEWS and version update. commit 7c4a8007255403d046d7e909f710f0b1ed1791b1 Author: Ondrej Filip Date: Mon Apr 14 12:28:30 2014 +0200 Fixed bug in unused function. commit 859cbd75e12966b09985b2a992da5ffb250938f8 Author: Ondrej Zajicek Date: Mon Apr 14 12:50:03 2014 +0200 Fixes a bug in (mainly) IPv6 BGP. Stack variable may be used unitialized and that would lead to spurious rta_free(), which may cause crash. The bug was introduced in 1.4.1 from merging add-path branch. Thanks to Peter Andreev for reporting it and Alexander V. Chernikov for resolving it. commit 1cb0f83d291d9bb3da06067bc2ea838238d5c487 Author: Ondrej Zajicek Date: Mon Apr 7 11:48:25 2014 +0200 Fixes some asserts. commit 538fec7b1b7dd729eadf1c933e27f59080cd3576 Author: Ondrej Zajicek Date: Wed Apr 2 23:00:10 2014 +0200 NEWS and version update. commit 2750b2484f256686a38ef6b89db7e2afe9b7999a Author: Ondrej Zajicek Date: Wed Apr 2 20:09:37 2014 +0200 Fixes missing line in BFD context help. commit 864f52a5f4c47ac8dc44a8808beb7f038cbf9899 Author: Ondrej Zajicek Date: Wed Apr 2 19:58:23 2014 +0200 Fixes nasty bug in BFD. When a BFD session is removed while being scheduled for notification, the session stays in notify list and is removed twice, which leads to a strange crash after a while. commit 60442b1698563ebc5837454d89dbe4afa037882d Author: Ondrej Zajicek Date: Mon Mar 31 18:51:51 2014 +0200 NEWS and version update. commit d96ec7f6e0d26546d9a27064fd13591618258894 Author: Ondrej Zajicek Date: Mon Mar 31 18:51:16 2014 +0200 Updates BFD documentation. commit eb5ea6bdd6fa45f03425ea38b8d1b16fd5ff7469 Author: Ondrej Zajicek Date: Mon Mar 31 13:21:13 2014 +0200 Fixes build on some old systems. commit 43eb8f610f7796375419dc8d72df7a41c01c82af Author: Ondrej Zajicek Date: Mon Mar 31 12:02:20 2014 +0200 Removes conflicting definition. This function is a part of Readline interface for a long time (with a different type). commit d7c0628591b802e202903b63fce53b6a422a3db2 Author: Ondrej Zajicek Date: Mon Mar 31 00:56:44 2014 +0200 Check validity of interface definitions. Thanks to Aleksey Berezin for the bugreport. commit 0c3d9dacafdb807d2101c67610969707353f434a Author: Ondrej Zajicek Date: Tue Mar 25 14:58:00 2014 +0100 Fixes file descriptor leak when parser ends with error. Thanks to MrBr for the bugreport. commit 4e7c974d22ee5d938d8d8e7018f0a63f609d630b Author: Ondrej Zajicek Date: Mon Mar 24 19:22:19 2014 +0100 Fixes a bug in graceful restart. commit 9637c7c0acbc56bbf6fedc44d89f921386843992 Author: Ondrej Zajicek Date: Mon Mar 24 13:33:15 2014 +0100 Minor fixes in documentation. commit dad92c30c7892457335d52a09548330498567ea8 Author: Ondrej Zajicek Date: Mon Mar 24 12:56:56 2014 +0100 Reformat bird.sgml to have consistent line length. commit c980f8002e0f0578d5e715d48d65d9fb9a0c5a70 Merge: 2e84b4e 227af30 Author: Ondrej Zajicek Date: Mon Mar 24 12:41:43 2014 +0100 Merge branch 'bgp-grace' commit 227af309e55a59f14d1a5a757f17900164bffc97 Author: Ondrej Zajicek Date: Mon Mar 24 12:32:12 2014 +0100 Fixes some minor issues in graceful restart. commit 2e84b4e82dbf8fce0fd12fb0c25d925ffd287970 Author: Ondrej Zajicek Date: Sun Mar 23 01:40:37 2014 +0100 Fixes a bug in rte_src handling. commit 6eda3f135f5bab4db456531d25bc3e5f669ec22e Author: Ondrej Zajicek Date: Sun Mar 23 01:35:33 2014 +0100 Documentation (and minor fixes) for BGP graceful restart. commit 0c791f873aeb7c1052c97db7da4fe23873d69603 Author: Ondrej Zajicek Date: Thu Mar 20 14:07:12 2014 +0100 BGP graceful restart support. Also significant core protocol state changes needed for that, global graceful restart recovery state and kernel proto support for recovery. commit d40c26594c22ad934a13061e11b373bdf81af8f9 Author: Ondrej Zajicek Date: Wed Feb 26 13:25:39 2014 +0100 Fixes issues with static protocol reconfiguration. The old static route was not removed when the nexthop changed and the new one was not viable (no neighbor). Thanks to Pierluigi Rolando for the original patch. commit 3216eb03ddddc057bb18fa4dd02b7935a604f71f Author: Ondrej Zajicek Date: Wed Feb 26 12:52:00 2014 +0100 Fixes longstanding issue with interfaces staying in IF_TMP_DOWN. Thanks to Pierluigi Rolando and others for the bugreport. commit d776540811cdf672dc113f29feef2415465589c6 Author: Ondrej Zajicek Date: Wed Feb 12 12:57:38 2014 +0100 Adds configure error message. commit 4e398e34bf140baf73fe8dceaf81078fb343f65a Author: Ondrej Zajicek Date: Fri Feb 7 13:09:55 2014 +0100 Workaround thread-unsafeness of cli_echo(). commit 9ae0f4b78c5e3619ee19969c052c863bf96be6d9 Author: Ondrej Zajicek Date: Fri Feb 7 11:46:01 2014 +0100 Fixes autoconf check for ncurses. commit 5c200e0a4d26d183e04fda43de16340521002c40 Merge: 4a5eb28 080ed4d Author: Ondrej Zajicek Date: Thu Feb 6 20:15:05 2014 +0100 Merge branch 'add-path' commit 4a5eb284c9d51441e09976021d1bd93c21408d46 Author: Ondrej Zajicek Date: Thu Feb 6 18:09:18 2014 +0100 Update include directive documentation. Thanks to Pierluigi Rolando for the bugreport. commit 12201fd854424628be7a00e1180ba082db7efa0b Author: Ondrej Zajicek Date: Thu Feb 6 18:00:41 2014 +0100 Fix a documentation update. commit 10c2e1e0125dfa600b1c2b6553883cccf2d025dd Author: Ondrej Zajicek Date: Thu Feb 6 17:54:25 2014 +0100 Fixes crash when state of disabled OSPF protocol is queried. Thanks to Ondrej Caletka for the bugreport. commit cba9cbf1bdb253c7727da10ff4f835d7ffbadeed Author: Ondrej Zajicek Date: Thu Feb 6 17:51:16 2014 +0100 Silence this annoying warning. commit 48e5f32db676645640f84ab3d630cce975aa6b20 Author: Ondrej Zajicek Date: Thu Feb 6 17:46:01 2014 +0100 Many changes in I/O and OSPF sockets and packet handling. I/O: - BSD: specify src addr on IP sockets by IP_HDRINCL - BSD: specify src addr on UDP sockets by IP_SENDSRCADDR - Linux: specify src addr on IP/UDP sockets by IP_PKTINFO - IPv6: specify src addr on IP/UDP sockets by IPV6_PKTINFO - Alternative SKF_BIND flag for binding to IP address - Allows IP/UDP sockets without tx_hook, on these sockets a packet is discarded when TX queue is full - Use consistently SOL_ for socket layer values. OSPF: - Packet src addr is always explicitly set - Support for secondary addresses in BSD - Dynamic RX/TX buffers - Fixes some minor buffer overruns - Interface option 'tx length' - Names for vlink pseudoifaces (vlinkX) - Vlinks use separate socket for TX - Vlinks do not use fixed associated iface - Fixes TTL for direct unicast packets - Fixes DONTROUTE for OSPF sockets - Use ifa->ifname instead of ifa->iface->name commit f48fa14214301382b2e6b134788a7506b61b664f Merge: 6601a14 300e400 Author: Ondrej Zajicek Date: Thu Feb 6 16:47:43 2014 +0100 Merge commit 'origin/master' into socket commit 300e4008f02382b87409dabb52a317b8336de55b Author: Ondrej Filip Date: Wed Feb 5 23:32:28 2014 +0100 Fedora init script improvement suggested by alex@alex.org.uk commit e9e6fbf924630abf821aa38f99e571f706536350 Author: Ondrej Filip Date: Wed Feb 5 15:57:37 2014 +0100 Minor changes in Fedora init script. commit ec35c7c2fc24e499a86022860c38460ae4bbad39 Author: Ondrej Filip Date: Tue Jan 21 23:43:22 2014 +0100 Small doc update. commit 6601a14831cdd32fc671ebc9dc299d2be427e489 Merge: 2d0b7e2 283c7df Author: Ondrej Zajicek Date: Tue Dec 10 22:30:46 2013 +0100 Merge branch 'add-path' commit 2d0b7e24a52d51904faa8a8e96d68863491c110a Author: Ondrej Zajicek Date: Mon Dec 2 11:54:32 2013 +0100 Fixes problem with source address selection in BGP and BFD. commit 080ed4d8c2c1982dd0c81c62703064b620a67a01 Author: Ondrej Zajicek Date: Sun Dec 1 18:25:39 2013 +0100 Fixes bug in documentation. commit 10115b1d70552f3ec4446dfec9e62c3a16d9eae0 Author: Ondrej Zajicek Date: Sun Dec 1 18:20:09 2013 +0100 Updates add-path documentation. commit e7d2ac4401be8aaf9629e248cad6a74498a6be24 Author: Ondrej Zajicek Date: Tue Nov 26 22:37:24 2013 +0100 Finishes add-path. Fixes some bugs and uses generic hash implementation. commit 283c7dfada53a6dee6a8a17ecab492ffafd44b66 Merge: 736e143 0bb4e37 Author: Ondrej Zajicek Date: Mon Nov 25 18:42:47 2013 +0100 Merge branch 'master' into add-path commit 0bb4e37db317a1290bad24fe430cac6569a9bd8c Author: Ondrej Filip Date: Mon Nov 25 15:16:20 2013 +0100 Release date added. commit e75520c455a1a3fd026a9633c3ad26d865165fee Author: Ondrej Zajicek Date: Mon Nov 25 13:46:29 2013 +0100 NEWS and version update. commit 90eb5e7a8bb60cb637626a3b433caf10cd8d2a03 Author: Ondrej Zajicek Date: Mon Nov 25 13:44:07 2013 +0100 Use ISO 8601 timeformats by default. commit 0c95f85ec59cc970e8f9aa2da56e25dad249bbb8 Author: Ondrej Zajicek Date: Mon Nov 25 11:06:00 2013 +0100 Fixes a reply code. commit 8137fe6d45762844248300de2a030e96042b1975 Author: Ondrej Zajicek Date: Mon Nov 25 02:03:23 2013 +0100 Allows shorthands for birdc noninteractive commands. commit e237b28a4d4b17ab50182ac110f28594967e76dc Author: Ondrej Zajicek Date: Mon Nov 25 01:21:39 2013 +0100 Changes primary addr selection on BSD to respect SIOCGIFADDR ioctl() result. Thanks to Alexander V. Chernikov for the original patch. commit 5ebc92935cb58c78286d91f0831de94cd4ae0f9e Author: Ondrej Zajicek Date: Sun Nov 24 22:22:24 2013 +0100 Last state change should track protocol state change. And not core state change, which is not much relevant (e.g. refeed in BGP). commit c72aca41e5fa55b0efa768e93b55f5c307f84025 Author: Ondrej Zajicek Date: Sun Nov 24 22:12:51 2013 +0100 OSPF ifaces on loopback should be stub. commit e4d179f2c2f213c9190ff4d05979dc33f2c5b2c7 Author: Ondrej Zajicek Date: Sun Nov 24 12:50:53 2013 +0100 Minor changes to default router ID calculation. commit f3e59178506dab9d54cf19ec701f8d9a7fe283f9 Author: Ondrej Zajicek Date: Sun Nov 24 12:37:24 2013 +0100 Enables multihop mode for IBGP by default. This is more consistent with common usage and also with the behavior of other implementations (Cisco, Juniper). Also changes the default for gw mode to be based solely on direct/multihop. commit 52e030e14666ff00a4bb0c700d2c027fbeb87d04 Author: Ondrej Zajicek Date: Sun Nov 24 00:17:02 2013 +0100 Converts filters to unsigned integers. commit 65194bd1eb2e6af217a750fa1e02b6eea66c7130 Author: Ondrej Zajicek Date: Mon Aug 15 02:12:54 2011 +0200 Removes workaround related to import of kernel device routes. Thanks to Benjamin Cama for notification. commit 204e0d5d59279c4245d4d46b86a570b043d683cf Author: Ondrej Filip Date: Sat Nov 23 18:11:55 2013 +0100 Dots added. New release will be 1.4.0. commit d0e33681540c9ad64b15f57a9d39c27658127a31 Author: Ondrej Filip Date: Sat Nov 23 13:27:47 2013 +0100 Added some other features into NEWS file commit d940a2c4d4096f761a750e2df42ab55fd27a7e80 Author: Ondrej Filip Date: Sat Nov 23 13:26:52 2013 +0100 Added a few sentences about symbol names. commit 736e143fa50607fcd88132291e96089b899af979 Merge: 094d2bd 2b3d52a Author: Ondrej Zajicek Date: Sat Nov 23 11:50:34 2013 +0100 Merge branch 'master' into add-path Conflicts: filter/filter.c nest/proto.c nest/rt-table.c proto/bgp/bgp.h proto/bgp/config.Y commit 2b3d52aa421ae1c31e30107beefd82fddbb42854 Author: Ondrej Zajicek Date: Sat Nov 23 01:56:16 2013 +0100 NEWS and version update. commit 77e43c8b72ff77dc7607accb09576c0baab422e0 Author: Ondrej Zajicek Date: Fri Nov 22 22:49:04 2013 +0100 Minor fixes. commit 547d3bf45dd430828d597dfb56624bdc1bd798b3 Author: Ondrej Zajicek Date: Fri Nov 22 22:42:47 2013 +0100 Allows pthreads by default on Linux and FreeBSD only. commit 41f8bf57c4d80cbec89b90b901afa9df4d2d76f1 Author: Ondrej Zajicek Date: Fri Nov 22 21:59:43 2013 +0100 Changes identifiers to avoid use of reserved ones. commit 56027b5cbd7f432d30f7fc99bcf8680c840e6163 Author: Ondrej Zajicek Date: Fri Nov 22 21:58:43 2013 +0100 Minor fix in log_commit() w.r.t. changes in BFD branch. commit 1fba34a7a1e245f08212a31a65030230da8c451d Author: Ondrej Zajicek Date: Fri Nov 22 18:45:57 2013 +0100 Adds check for buffer size in OSPF LSA flood. commit 0aeac9cb7f9887374ce0258c8653f9518529bf08 Merge: 8931425 7c9930f Author: Ondrej Zajicek Date: Fri Nov 22 02:43:41 2013 +0100 Merge commit 'origin/bfd' commit 8931425d02dd8656b48142f608d3119ab6f4a96f Author: Ondrej Zajicek Date: Fri Nov 22 02:12:21 2013 +0100 Fixes problem with RIP on multiple ifaces on BSD. RIP sockets for multiple ifaces collided, because we cannot bind to a specific iface on BSD. Workarounded by SO_REUSEPORT. Thanks to Eugene M. Zheganin for the bugreport. commit 548c329cde371bceef05f86b7f904378a392d89c Author: Ondrej Zajicek Date: Fri Nov 22 01:20:32 2013 +0100 Adds rate limiting to some log messages. commit 64534ea2f4361c247d7a0d1b6b14a02e8e3d6d33 Author: Ondrej Zajicek Date: Thu Nov 21 13:17:42 2013 +0100 Fixes an issue when opposite address is mistaken for broadcast on ptp ifaces on BSDs. Thanks to Lex van Roon for the bugreport and to Alexander V. Chernikov for examining it and locating the problem. commit 7c9930f9c8feb3b08f7a9e94a08807ccbbc096f5 Author: Ondrej Zajicek Date: Thu Nov 21 11:36:49 2013 +0100 Adds a missing file. I forgot to add that to the previous commit. commit f8f2419d4c5b9028b9b3d2d893fe802f18eb239b Author: Ondrej Zajicek Date: Wed Nov 20 13:30:00 2013 +0100 Additional filter test case. commit 4d4979c67c65dceb1ae557707312b83fde4bc8a8 Author: Ondrej Zajicek Date: Wed Nov 20 13:25:33 2013 +0100 Fixes some potential issues with invalid term size in clients. commit 1ec522538fb81a56b068c087d0a842faf7aa7869 Author: Ondrej Zajicek Date: Tue Nov 19 22:33:48 2013 +0100 BFD protocol, ready for release. Supports OSPF and BGP and also statically configured sessions. commit 33be3ba713901befe2df651b869a406df8fc8ace Author: Ondrej Zajicek Date: Mon Oct 21 15:06:09 2013 +0200 Accepts a change of OSPFv3 neighbor's IP address. Thanks to Pierre Pfister for the patch. commit a15dab76f93337b07b4b03a64ac3bac26285dfd9 Author: Ondrej Zajicek Date: Mon Oct 21 14:58:32 2013 +0200 Implements 'allow local as' option. Similar to allowas-in option on other routers. commit f8cc7396cf25328b002394bbd7af679188b03370 Author: Ondrej Zajicek Date: Tue Oct 15 10:57:57 2013 +0200 Forces KRT rescan on syncer startup with multi syncer config. Thanks to Sergey Popovich for the patch. commit 1cd198cf52b3eae677159d81eacca3e0ebe24e71 Author: Ondrej Filip Date: Sat Oct 5 22:45:08 2013 +0200 Flag -f "run in foreground" added as requested by a package maintainter. commit 0e175f9f0fd872e95225355dbdeca49cd35ec0fd Author: Ondrej Zajicek Date: Sat Oct 5 20:12:28 2013 +0200 Fixes some BFD bugs and makes logging thread-safe. commit e7c2380260f20a4a3587b47df97879ef91c69774 Author: Ondrej Zajicek Date: Sat Oct 5 19:30:12 2013 +0200 Implements PID file support. Thanks to Thierry Fournier for the original patch. commit 7ccb36d3308ef57d340e663f0cabd24663f4f62a Author: Ondrej Zajicek Date: Wed Oct 2 14:57:29 2013 +0200 Implements C.len operator for clist and eclist types. Thanks to Sergey Popovich for the original patch. commit 28a10f84cbc3635e59bff348cb1715859dfacade Author: Ondrej Zajicek Date: Wed Oct 2 14:41:37 2013 +0200 Some fixes in filter code. Thanks to Sergey Popovich for original patches. commit 70c5780535fa3bd2360e8208f9273ac6d1741107 Author: Ondrej Zajicek Date: Wed Oct 2 12:10:09 2013 +0200 Minor code cleanups. Thanks to Sergey Popovich for the patch. commit b655596d1d9ad7664d12249c946ba3483b2de3f0 Author: Ondrej Zajicek Date: Wed Oct 2 11:42:46 2013 +0200 Simplifies val_in_range(). Also fixes missing type check for element ~ set. commit ec57bbf67f9e4221fb98f6769f592cedf2eb2d24 Author: Ondrej Filip Date: Mon Sep 30 14:07:34 2013 +0200 Recheck export/import/receive limits during reconfiguration. commit a5fc59587fe864e4fcfb44eb3be57231b4ca339b Author: Ondrej Zajicek Date: Thu Sep 26 22:08:21 2013 +0200 Rewrites static attribute filter code and adds ifname/ifindex attributes. Thanks to Sergey Popovich for the original ifname/ifindex patch. commit 4df2019ebfc0f77feb16b6a33dea6d5ac595f55e Author: Ondrej Zajicek Date: Thu Sep 26 17:36:30 2013 +0200 Fixes build issues without BGP. Thanks to Sergey Popovich for the patch. commit f83ce94d5e410d5e5b921121867321c19451896b Author: Ondrej Zajicek Date: Thu Sep 26 17:33:00 2013 +0200 Fixes missing unregister of kernel table handling code. And some minor fixes. Thanks to Sergey Popovich for the patch. commit f515e22924591542a909db0deb8545386aaa576e Author: Ondrej Zajicek Date: Sun Sep 22 19:15:39 2013 +0200 Allows other than IA_PEER addresses on PtP ifaces on BSD. Also fixes a potential problem with link-local dest_addrs for IA_PEER addresses. Thanks to Alexander V. Chernikov for the suggestion. commit 6a8d3f1c1ffbd964e4d11b452c73e1ea70310af3 Author: Ondrej Zajicek Date: Mon Sep 16 23:57:40 2013 +0200 BFD work in progress. Now it compiles and mostly works. commit e550a37206528be39e4751865b46720885fd64ed Author: Ondrej Filip Date: Fri Sep 13 18:55:02 2013 +0200 Fixes problem with OSPF neighbor router ID change. Thanx to Alexander V. Chernikov commit c404f4b968b69a2c5c1975d04abf7474891d5656 Author: Ondrej Filip Date: Wed Sep 11 01:15:34 2013 +0200 OSPF state machine fix - thanx to Alexander V. Chernikov commit 92f8878cbf5d8ad9e9b909a9dcbb2112de54a542 Author: Ondrej Zajicek Date: Tue Sep 10 13:03:58 2013 +0200 Fixes a bug related to multiple IPs and direct protocol. Multiple IPs in the same IP prefix confuse the direct protocol and could cause withdrawal of a valid prefix. Thanks to Dan Rimal for a bugreport. commit 2a0130f94d2304e316f0ffad8e52fce094559782 Author: Ondrej Zajicek Date: Tue Sep 10 13:01:22 2013 +0200 Fixes a bug in kernel extended attribute processing. The bug caused that krt_prefsrc attribute was not processed when a route received from a kernel protocol was exported to another kernel protocol. Thanks to Sergey Popovich for a bugreport. commit 507e182a60c3704f8a28a0450f1affc2c7c1b66a Author: Ondrej Zajicek Date: Tue Sep 10 12:58:24 2013 +0200 Fixes reconfiguration of global set variables. When global set variables were used, every reconfiguration restarted protocols that use it in filters. Thanks to Sergey Popovich for a bugreport. commit d27e127aa996d500fed21be2bbbe888cafecb830 Merge: bff9ce5 b0a8c7f Author: Ondrej Zajicek Date: Tue Sep 10 12:54:57 2013 +0200 Merge commit 'origin/master' commit bf139664aa2ae9956b520ba4813bb6e03bf1a3e8 Author: Ondrej Zajicek Date: Tue Sep 10 12:09:36 2013 +0200 Initial BFD commit, work in progress. commit b0a8c7fc8547eef21ede33887580b5e867ee742c Author: Ondrej Filip Date: Thu Aug 15 20:26:50 2013 +0200 Wrong change commited - 'route limit' marked as obsolete. commit e628cad0ca9eb7d9bf4141e57201169c46faa661 Author: Ondrej Filip Date: Thu Aug 15 20:20:05 2013 +0200 BGP option 'route limit' is marked as obsolete. 'import limit' should be used instead. commit 6d90e57332e102e261d69a1a05dfaa19fb31d933 Author: Ondrej Filip Date: Thu Aug 15 19:54:18 2013 +0200 Typo in documentation fixed. commit 1f64a487a065cc27c52ab0d3d38b7c82926fea70 Author: Ondrej Filip Date: Thu Aug 15 13:29:33 2013 +0200 Symbol names enclosed by apostrophes can contain colons. commit bff9ce5130d16af2fd802d42bdb2bff00980c9ae Author: Ondrej Zajicek Date: Thu Aug 15 01:06:47 2013 +0200 Extends delete/filter operators to work no bgp_paths. commit 8a112d8ba2e77d79468146ec8f54b3c90b6e68e4 Author: Ondrej Zajicek Date: Tue Aug 13 23:04:06 2013 +0200 Removes strip from make install Thanks to Alexander V. Chernikov for the patch. commit b21955e05800c3ceedfe39eef605da84285296c7 Author: Ondrej Zajicek Date: Tue Aug 13 20:42:43 2013 +0200 Fixes a bug related to mixed up neighbor events in BGP. Neighbor events related to received route next hops got mixed up with sticky neighbor node for an IP of the BGP peer. If a neighbor for a next hop disappears, BGP session is shut down. commit 00192d5ab88ff9eeccbc1bc10cb534976a56963d Author: Ondrej Zajicek Date: Tue Aug 13 20:25:05 2013 +0200 Implements proper setting of 'gw' route attribute. Thanks to Sergey Popovich for the bugreport. commit f8e8fcfabeb206287065f48e800743b0aa797cc2 Author: Ondrej Zajicek Date: Mon Jul 29 13:07:15 2013 +0200 Test commit. commit fd6cbe9053c529df7eac431ff72d3c509ba91ca9 Author: Ondrej Zajicek Date: Mon Jul 29 12:52:38 2013 +0200 Test commit. commit cff430f396b006ef34e756075948dcb6b07fc427 Author: Ondrej Zajicek Date: Mon Jul 29 12:28:03 2013 +0200 Test commit. Also contains minor fixes in doc formatting. commit 50b71c1b96f99ac40e733295daeb03927777b206 Author: Ondrej Filip Date: Sun Jul 28 18:50:40 2013 +0200 Fixed small error in documantation (thanks engels@openit.de). commit 643228bc1cfb6a8f5169ee8ebfe1b75c81cc8543 Author: Ondrej Zajicek Date: Sat Jul 27 00:47:58 2013 +0200 NEWS and version update. commit f4830d8cb801c9124361bcc0c9e33f8f6005c08d Author: Ondrej Zajicek Date: Sat Jul 27 00:38:29 2013 +0200 Documentation update. commit 4ee39ff2ff78f86ce1ec79a77e22120984452549 Author: Ondrej Zajicek Date: Fri Jul 26 11:06:08 2013 +0200 Fixes initial random values for function arguments. Thanks to Javor Kliachev for the bugreport. commit 1103b32e830fbf98d9b3e32c0425b9a589773bf8 Author: Ondrej Zajicek Date: Thu Jul 25 22:33:57 2013 +0200 Allows to define constants of all filter types. commit ac5745134847c044b21c311e5ab11d92d05bacc1 Author: Ondrej Zajicek Date: Thu Jul 25 13:55:24 2013 +0200 Implements RFC 6608 Subcodes for BGP FSM Error. commit 508d936078aecc8fbbb9ca1218104599c4a3cb4a Author: Ondrej Zajicek Date: Thu Jul 25 13:15:32 2013 +0200 Implements eval command and minor CLI cleanups. Implemented eval command can be used to evaluate expressions. The patch also documents echo command and allows to use log classes instead of integer as a mask for echo. commit a0b176e3b2b50d3a30574afa927e0ee8ef65be68 Author: Ondrej Zajicek Date: Wed Jul 24 14:20:46 2013 +0200 Fixes header file name. Thanks to Fritz Grimpen for the patch. commit e1afee279993363ffb4a7005554d0774eb09b764 Author: Ondrej Zajicek Date: Wed Jul 24 14:19:37 2013 +0200 Fixes socket error hook for radv protocol. commit 9135c1f0ca6322bff9648895b5394b97761b4bcb Author: Ondrej Zajicek Date: Wed Jul 24 14:11:12 2013 +0200 Fixes bug in protocol flushing and rtable pruning. When route was propagated to another rtable through a pipe and then the pipe was reconfigured softly in such a way that any subsequent route updates are filtered, then the source protocol shutdown didn't clean up the route in the second rtable which caused stale routes and potential crashes. commit 48b15ef10fede35113af71bd0dbb0b27a5fcb8f5 Author: Ondrej Zajicek Date: Sat Jul 13 01:39:41 2013 +0200 Fixes stuck connection during BGP session shutdown. If TX buffers were full during BGP session shutdown then a protocol waited indefinitely to be able to send notification packet to close the session. commit 354496ace87341428e6005fbc073fbe57b4e6c0e Author: Ondrej Zajicek Date: Thu Jul 11 13:50:44 2013 +0200 Some fixes for TTL security. commit cc31b75a8fd7949533c12db2c3e9d67eeaf46d10 Author: Ondrej Zajicek Date: Tue Jul 9 23:27:10 2013 +0200 Implements 'bgppath ~ int set' filter op. commit c01a94663cc18f53fd741c5d44387eead9ca88af Author: Ondrej Zajicek Date: Sun Jul 7 12:11:42 2013 +0200 Implements multiple routing table support for FreeBSD and OpenBSD. Inspired by the patch from Alexander V. Chernikov. commit c6964c305b425b98aaf0492806a28b578d799d83 Author: Ondrej Zajicek Date: Sat Jun 29 22:55:41 2013 +0200 Makes krt.c much more readable. commit 6ac4f87a2d661c739e55a63577e7bccf696c7abd Author: Ondrej Zajicek Date: Wed Jun 26 14:35:39 2013 +0200 Documentation for TTL security. commit 70e212f913b6ce9d343d6c401b4f1712986a5f8c Author: Ondrej Zajicek Date: Tue Jun 25 15:33:00 2013 +0200 Implements TTL security for OSPF and RIP. Interfaces for OSPF and RIP could be configured to use (and request) TTL 255 for traffic to direct neighbors. Thanks to Simon Dickhoven for the original patch for RIPng. commit ef4a50be10c6dd0abffd957132cd146029c3d79d Author: Ondrej Zajicek Date: Mon Jun 24 16:37:30 2013 +0200 Better packet priority and traffic class handling. Implements support for IPv6 traffic class, sets higher priority for OSPF and RIP outgoing packets by default and allows to configure ToS/DS/TClass IP header field and the local priority of outgoing packets. commit fad04c750ca6906fb095f1b45958dec0ac8e210c Author: Ondrej Zajicek Date: Thu Jun 13 11:27:14 2013 +0200 Fixes problems with kernel routes multiple routing tables. Temporary dummy routes created by a kernel protocol during routing table scan get mixed with real routes propagated from another kernel protocol through a pipe. commit f623ab9875cad2d129f708e95021d3a252930000 Author: Ondrej Zajicek Date: Tue Jun 11 12:12:11 2013 +0200 Implements OSPF stub router option (RFC 3137). Also fixes OSPFv3 routing table calculcation w.r.t. errata 2078 to RFC 5340. commit 924868543c2010f3ef2cfcb7ba6bac5988ab3264 Author: Ondrej Zajicek Date: Tue May 28 10:48:14 2013 +0200 Fixes crash with vlinks. commit 9810d055628877232f811d684567e203381e10dc Author: Ondrej Zajicek Date: Tue May 28 10:44:44 2013 +0200 Fixes problems with routing table scans on some platforms. Negative bit shifts are definitely undefined oprations. commit 9c99d753fd672bd9839715ee325ef01cca993dbf Author: Ondrej Zajicek Date: Thu May 9 11:11:06 2013 +0200 Fixes a problem with BGP neighbors, link-local addresses and locking. Thanks to Fritz Grimpen for the bugfix. commit a2017200c71293d0a28a39d1f250ba38d57f6289 Author: Ondrej Zajicek Date: Mon Apr 29 22:33:50 2013 +0200 NEWS and version update. commit 572c6440432e3138ea622cfb5a4ef7580d77ef4a Author: Ondrej Zajicek Date: Mon Apr 29 22:08:05 2013 +0200 Fixes a crash when mrtdump is enabled and interface goes away. Thanks to Peter Christensen for the bugfix. commit 32622d0ea366406f3afa14bb9edb4855d6979786 Merge: efd6d12 a5e9f3d Author: Ondrej Zajicek Date: Tue Apr 23 02:54:13 2013 +0200 Merge branch 'birdcl' commit a5e9f3d26f887deb451a3ea086e52266c117aa0a Author: Ondrej Zajicek Date: Tue Apr 23 02:42:35 2013 +0200 Restructures birdc and birdcl to merge duplicated code. The BIRD client code is restructured that most of the code (including main function) is shared in client.c, while birdc.c and birdcl.c contain just I/O-specific callbacks. This removes all duplicated code from variant-specific files. commit d2c392d44839baaefa48f4a38060be648d3415fb Author: Ondrej Zajicek Date: Fri Apr 19 13:59:08 2013 +0200 Removes unnecessary client subdirectories and updates buildsystem. Renames some files: birdc/client.c -> birdc.c birdcl/client.c -> birdcl.c client_common.c -> common.c commit efd6d12b975441c7e1875a59dd9e0f3db7e958cb Author: Ondrej Zajicek Date: Wed Apr 17 15:09:50 2013 +0200 Adds two new default GCC options. Adds two new default GCC options related to optimizations (-fno-strict-aliasing and -fno-strict-overflow). This should fix some hyperaggressive GCC optimizations. Also updates autoconf option detection. commit 8df02847e8af29863c325b7297e3a2b2ed5f961c Author: Ondrej Zajicek Date: Wed Apr 17 13:06:40 2013 +0200 Fixes a compatibility issue in OSPFv2 PtP links. BIRD used zero netmask in hello packets on all PtP links, not just on unnumbered ones. This patch fixes it and adds option 'ptp netmask' for overriding the default behavior. Thanks to Alexander V. Chernikov for the original patch. commit cd3b02d198093abbbe671f647e4deb2470eb9cf1 Author: Ondrej Zajicek Date: Tue Apr 16 17:53:22 2013 +0200 Allows IP of loopback to be used in automatic router ID selection. Thanks to Alexander V. Chernikov for the patch. commit 8bd9b930c320f09d3b3792b5f991cf702e9d55be Author: Ondrej Zajicek Date: Tue Apr 16 17:40:44 2013 +0200 Fixes a bug in IPv6 BGP next hop processing. BGP next hop attributes with empty link-local IPv6 addresses were not handled properly. Thanks to Sergey Popovich for the bugfix. commit 48bc232f08141d26691237c3d79db587ce16932b Author: Ondrej Zajicek Date: Tue Apr 16 17:27:34 2013 +0200 Implements 'next hop keep' option for BGP. This option allows to keep the received next hop even in cases when the route is sent to an interface with a different subnet. commit 9ff5257357d9975654279db17bbc8525583ba1cc Author: Ondrej Zajicek Date: Tue Apr 16 16:22:31 2013 +0200 Better handling of global addresses as configured NBMA neighbors in OSPFv3. Configured NBMA neighbors in OSPFv3 should be link-local addresses, old behavior was to silently ignore global ones. The patch allows BIRD to accept global ones, but adds a warning and a documentation notice. Thanks to Wilco Baan Hofman for the bugreport. commit 568d9c9faeab70951d8e9bfea521e1b38a9a3d1c Author: Tomas Hlavacek Date: Sat Apr 6 22:07:32 2013 +0200 Fix birdcl async message handling Fix handling of async messafe in the bird light client. The async message may occure at the any moment so we need the client to liste for the message from server when it waits for user input. commit ce1348537455e5482a283f7a4cae734d13dcf34e Author: Tomas Hlavacek Date: Tue Mar 19 18:02:40 2013 +0100 Fix birdcl questionmark handling Fix handling of questionmark handling in the bird light client. The questionmark should display help when it is the last non-blank character on command line. Otherwise the questionmark does not have any special meaning and it could be a part of a pattern. commit 8322ecde124188a9408b54afead4666bb954e5a5 Author: Tomas Hlavacek Date: Sun Feb 24 23:47:22 2013 +0100 Add lightweight client - birdcl Restructure client/ subdir. Add two different flavors of client. The full featured birdc client code is in client/birdc/. The new light client birtcl is in client/birdcl/. Common sources of both clients are directly in client/. Rework on-line auto-completion in client/command.c to conditionally turn off ncurses-specific code. Add lightweight client without libreadline and ncurses dependencies - birdcl. The birdcl lacks support of history, on-line auto-completion and there are different implementations of "more" functionality and help on '?' press. New client operates in canonical terminal mode (apart from "more" display) and therefore all commands have to be executed by a return key including help commands (called by '?' character in the end of the line). Apart from these limitations the interaction style should be the same as for the full client - birdc. Build of birdcl is always on (independent on --enable-client parameter). commit e454916149d4efe66732fdd0388181813cab6ed0 Author: Tomas Hlavacek Date: Wed Jan 23 17:14:53 2013 +0100 Pull out independent routines from client_full.c Pull out routines for interacting with the server and interpreting internal commands which are not dependent on libreadline and ncurses libraries. This is a preparation step for a new lightweight birdc client. commit 5c2c4ea8b1e924fce433094e744c0467da55aaab Author: Tomas Hlavacek Date: Wed Jan 23 15:51:04 2013 +0100 Rename client/client.c to client_full.c Rename client/client.c to client-full.c and change the Makefile accordingly. This is a preparation step for introducing a new lightweight client which should reuse as much code as possible from the old one but it should not depend on external libraries. Signed-off-by: Tomas Hlavacek commit a9fc659b840e13323aa43e92eb8f39ceb19b5ed6 Author: Ondrej Filip Date: Tue Feb 26 14:29:53 2013 +0100 Small typos fixed. commit de41dcd13d6f9d4785c80e6234ac38f2a15f5429 Author: Ondrej Filip Date: Tue Feb 26 14:13:11 2013 +0100 Redundant lines removed. commit e667622a35722ec007137e678f4f70841562e57f Author: Ondrej Filip Date: Mon Feb 25 10:39:46 2013 +0100 Default rounting table for 'show route export/preexport/protocol' is the one related to a respective protocol. commit a9c38203bdcad92f7ac0a8a912241d2acb483f2c Author: Ondrej Filip Date: Sun Feb 24 00:43:08 2013 +0100 Allow 1 sec RIP update. commit 04ddefb357b2b8759be16633f7bb1df49b0405ea Author: Ondrej Filip Date: Fri Feb 22 07:15:27 2013 +0100 Use BIRD's ASSERT instead of assert.h commit 2bf59bf4d3e4fcaff489d3445134e5e2e2af9cf6 Author: Ondrej Filip Date: Thu Feb 21 00:44:59 2013 +0100 Hotfix to solve an issue with delaying timers reported by Aleksey Chudov. commit 9d969be5f2d867704e82bd7d6c8049623d50708f Author: Ondrej Filip Date: Thu Feb 14 23:35:51 2013 +0100 I still believe that 0 == NULL, however this patch will make Santiago happy. :-) commit 4c2abee74e64f64fba61aad6e2b66e3895820003 Author: Ondrej Filip Date: Tue Feb 12 13:15:01 2013 +0100 Allow submitting BIRD commands from UNIX shell even in restricted mode. commit 8c4da7e01ded3f06cbf873e67c5ae1cf70cf280b Author: Ondrej Filip Date: Sun Feb 10 19:17:38 2013 +0100 Symbol names enclosed by apostrophes can contain DOTs. commit 0bc3542ab6e0a96342e35ead8ff1c52f980facc2 Author: Ondrej Filip Date: Sun Feb 10 19:06:56 2013 +0100 Route limits can be disabled - this makes sense for protocol templates commit 155134f3960bc06a18c8c7d9a97181b786d77a3a Author: Ondrej Filip Date: Sun Feb 10 19:04:08 2013 +0100 A few semicolons added to decrease a number of warnings. commit c6a2fe64bed8dc67af0e868052b055aa0f45cdf2 Author: Ondrej Zajicek Date: Sat Feb 9 00:53:04 2013 +0100 Fixes handling of iface routes in static proto during reconfiguration. During reconfiguration, iface routes were installed even when iface was down. commit 36da2857bc911924a250a234f38cf58c3b21f1bc Author: Ondrej Zajicek Date: Fri Feb 8 23:58:27 2013 +0100 Implements router advertisements activated by received routes. The RAdv protocol could be configured to change its behavior based on availability of routes, e.g., do not announce router lifetime when a default route is not available. commit d214ae4fdc1e323f89efb8a80c068fef4a45758f Author: Ondrej Zajicek Date: Sat Jan 12 21:26:42 2013 +0100 Fix missing documentation for one option. commit 13d4dd138d5dc6c884ded280f9244fac707c4f32 Author: Ondrej Zajicek Date: Fri Jan 11 14:53:20 2013 +0100 NEWS update. commit b662290f40ea0fa0b1a1ba283e50e833724f2050 Author: Ondrej Zajicek Date: Thu Jan 10 13:07:33 2013 +0100 Separate import and receive limits. They have different behavior w.r.t. filtered routes that are kept. commit 79b4e12e6032faf6bb1f3feac385bd36ee53019e Author: Ondrej Zajicek Date: Thu Dec 27 12:56:23 2012 +0100 Implements interface masks for choosing router id. Router ID could be automatically determined based of subset of ifaces/addresses specified by 'router id from' option. The patch also does some minor changes related to router ID reconfiguration. Thanks to Alexander V. Chernikov for most of the work. commit a92cf57dd6ba021a495fe7268c86dc8e6aeecbb2 Author: Ondrej Zajicek Date: Wed Dec 26 12:40:48 2012 +0100 Implements undo command and optional timeout for configuration Several new configure command variants: configure undo - undo last reconfiguration configure timeout - configure with scheduled undo if not confirmed in timeout configure confirm - confirm last configuration configure check - just parse and validate config file commit 80a9cadc76101157707aecc0b482ad88ad702fc3 Author: Ondrej Zajicek Date: Tue Nov 27 02:08:04 2012 +0100 Changes static route targets drop/reject to blackhole/unreachable. To be consistent with rest of BIRD and Linux. Old names are also allowed for compatibility. commit b31774eeb01a2f63e4ce4dc83f36ffd17879593e Author: Ondrej Zajicek Date: Tue Nov 27 01:30:09 2012 +0100 Removes some nonsense. commit 3e40f3e795e39f0b92445fd5295382220077c77f Author: Ondrej Zajicek Date: Tue Nov 27 01:25:47 2012 +0100 Fixes setting of route attributes of type router id. commit c93c02088a026b83f452fbd260135ba4c8da7ecf Author: Ondrej Zajicek Date: Fri Nov 16 13:30:54 2012 +0100 NEWS and version update. commit 70577529244d6d920b75d95e797156e05141db30 Author: Ondrej Zajicek Date: Fri Nov 16 13:29:16 2012 +0100 Fixes route tracing w.r.t. kept filtered routes. commit cf3a704b6a2263aba6bb6adb4c2c9dd93b72f470 Author: Ondrej Zajicek Date: Fri Nov 16 02:34:12 2012 +0100 Updates the documentation. commit 6cadbf325bfcf25a04d869778abb443f9e1b6119 Author: Ondrej Zajicek Date: Thu Nov 15 14:08:20 2012 +0100 Change unnamed ptp link description on OSPFv2. Although it is a slight deviation from the standard, it has no ill consequences for OSPFv2 and the change fixes a compatibility issue with some broken implementations. commit 15550957957f3c790f3bec3f6b8721559ea25969 Author: Ondrej Zajicek Date: Thu Nov 15 01:29:01 2012 +0100 Changes 'rejected' to 'filtered' in one of the last patches. commit e16469bc4d182428687a5ef5f2fb4707afa15abd Author: Ondrej Filip Date: Mon Nov 12 13:48:29 2012 +0100 AS# in bgp.agreggator was a signed integer - fixed. commit 227af52fb5be09c841fbd9f86e7bb3992b981a4a Author: Ondrej Zajicek Date: Sat Nov 10 16:18:12 2012 +0100 Fixes OSPF reconfigure w.r.t. downed ifaces. commit a55a90faec5cce09cee65f484e3731207af00335 Author: Ondrej Zajicek Date: Sat Nov 10 14:54:35 2012 +0100 Peer address of stub iface should be announced in OSPF Router LSA. commit cf98be7b6743e45dde9e0458664cc0762bf08867 Author: Ondrej Zajicek Date: Sat Nov 10 14:26:13 2012 +0100 Allows rejected routes to be kept and examined. When 'import keep rejected' protocol option is activated, routes rejected by the import filter are kept in the routing table, but they are hidden and not propagated to other protocols. It is possible to examine them using 'show route rejected'. commit dd4da6f640fb581cbd7d1ca537bf382558492b8e Author: Ondrej Zajicek Date: Wed Oct 31 17:14:35 2012 +0100 Fixes another bug in OSPFv3 vlinks. commit 8249ad9b304ea88b29e3aea76ebe49bb50348aaa Author: Ondrej Zajicek Date: Mon Oct 29 20:39:03 2012 +0100 Fixes sorting in OSPF show state. commit e4404cef0be10e639566986a2f8c1906c9f37de1 Author: Ondrej Zajicek Date: Mon Oct 29 20:29:31 2012 +0100 Fixes several bugs related to OSPFv3 vlinks. commit 0343d066dab077d1391640c53198199b16bef993 Author: Ondrej Zajicek Date: Wed Aug 29 12:42:49 2012 +0200 Fixes a bug in primary IP selection. commit 8ecbaf9c70b802a1200ad37f2bfd4bc64173c5fe Author: Ondrej Zajicek Date: Thu Aug 16 13:09:26 2012 +0200 Fixes a bug with neighbor cache and overlapping IP prefixes. When there are overlapping IP prefixes and one disappears, neighbors associated with it was removed even if there is another covering IP prefix. commit 094d2bdb79e1ffa0a02761fd651aa0f0b6b0c585 Author: Ondrej Zajicek Date: Tue Aug 14 16:25:22 2012 +0200 Implements ADD-PATH extension for BGP. Allows to send and receive multiple routes for one network by one BGP session. Also contains necessary core changes to support this (routing tables accepting several routes for one network from one protocol). It needs some more cleanup before merging to the master branch. commit d760229ab897fa1bf1fd0fe7019cc2431d21a1cc Author: Ondrej Filip Date: Wed Aug 8 14:10:31 2012 +0200 DragonFly support add - thanks to john@marino.st commit 60c412b9368fd7c3b0a8df2200f02140adcb0cf3 Merge: 3fe1d9e 94e2f1c Author: Ondrej Filip Date: Tue Aug 7 11:15:23 2012 +0200 Merge branch 'master' of ssh://git.nic.cz/bird commit 94e2f1c111721d6213ea65cac5c53036e38e3973 Author: Ondrej Zajicek Date: Tue Aug 7 11:06:57 2012 +0200 NEWS and version update. commit c06de722ddf36f3d6aaabfd4ae9d74a3ea72bbf9 Author: Ondrej Zajicek Date: Mon Aug 6 11:09:13 2012 +0200 Some minor fixes. commit 5400c0e7f982757418a0aeb892459b52fbbcffc3 Author: Ondrej Zajicek Date: Mon Aug 6 02:42:24 2012 +0200 Fixes BGP subcode during global shutdown. commit bbcfd5a0485a8df9568d8da0fc524e272e3e7601 Author: Ondrej Zajicek Date: Thu Jul 26 13:59:50 2012 +0200 Fixes default route in OSPF multiple area setting. commit 48cf5e84e6ed17578e4ad43c5ef54d6ff7d825c4 Author: Ondrej Zajicek Date: Tue Jul 24 20:12:14 2012 +0200 Documentation update, commit 0e224d598579626e03d3727d5901ba2d654ac521 Author: Ondrej Zajicek Date: Sun Jul 22 12:35:04 2012 +0200 RDNSS and DNSSL documentation for RAdv. commit 36415e4b1dd769458cced44525ee74d26d15f9c6 Author: Ondrej Zajicek Date: Fri Jul 20 19:56:57 2012 +0200 Allows to redefine master table. commit c4b76d7b19cf48ddbcbe913c22ef7f1e8429f5ea Author: Ondrej Zajicek Date: Wed Jul 18 19:35:30 2012 +0200 Rename sk_new() to avoid name collision with OpenSSL. commit 4be266a9831799dcc2e67e83fc83d9db43828a64 Author: Ondrej Zajicek Date: Wed Jul 18 19:29:33 2012 +0200 Implements wildcard matching in config file include. Also fixes some minor bugs in include. Thanks Kelly Cochran for suggestion and draft patch. commit abced4a91495e27fe86b142bc1967cec53bab3dc Merge: fc06fb6 7617026 Author: Ondrej Zajicek Date: Mon Jul 16 14:44:45 2012 +0200 Merge branch 'rt-accepted' Conflicts: nest/config.Y nest/rt-table.c proto/bgp/bgp.c commit 761702644397886bd3c1be10fd55c01485b7c454 Merge: 26822d8 553e405 Author: Ondrej Zajicek Date: Mon Jul 16 10:41:29 2012 +0200 Merge commit 'origin/rt-accepted' into rt-accepted commit 26822d8fe1376b2ffd902a3b5caa47f81a88e74e Author: Ondrej Zajicek Date: Wed Jul 4 21:31:03 2012 +0200 Finalize RA_ACCEPTED handling. commit fc06fb62443c135773ee4c05ed83925cc47b046d Author: Ondrej Zajicek Date: Sat Jul 7 10:40:00 2012 +0200 Implements RDNSS and DNSSL support for RAdv. commit 3fe1d9e4a40663b93b59f5b6f9d61af9dc6a8ae6 Merge: 72b2db8 95127cb Author: Ondrej Filip Date: Tue May 15 23:40:37 2012 +0200 Merge branch 'master' of ssh://git.nic.cz/bird commit 95127cbbb76e8870e029454a5313bc4b6ce69a4a Author: Ondrej Zajicek Date: Mon May 14 11:47:41 2012 +0200 Real broadcast mode for OSPFv2. commit 0ec031f7400fbacdd86b40ae1870c58715a7f108 Author: Ondrej Zajicek Date: Fri May 11 18:52:59 2012 +0200 Allows to set instance ID for OSPFv3 interfaces. commit 47c447c42e0bfa1836d951d1e6c1a2236d39dcbb Author: Ondrej Zajicek Date: Fri May 4 23:05:47 2012 +0200 Minor cleanups. commit b7f3df79054aca327654c1fb4739c4ff02e59e6e Author: Ondrej Zajicek Date: Fri May 11 12:01:27 2012 +0200 Fixes a bug in RA_ACCEPTED handling. commit 72b2db8db7534c52e928618410ec1f18787752c8 Merge: 2795700 95616c8 Author: Ondrej Filip Date: Fri May 11 00:01:29 2012 +0200 Merge branch 'master' of ssh://git.nic.cz/bird commit 95616c820248018f4999972cad315f2da60e4960 Author: Ondrej Zajicek Date: Fri May 4 16:38:25 2012 +0200 Cleanup in sysdep KRT code, part 4. Adding some files that was accidentally removed (instead of moved) in cleanup part 2. commit 064e7be5cd4dffd564b4ea41ba6d843492a55c97 Author: Ondrej Zajicek Date: Fri May 4 00:20:23 2012 +0200 History deduplication in birdc. commit e14bd38087ed8ef1945dd0a3878cc560478145f0 Author: Ondrej Zajicek Date: Thu May 3 14:04:56 2012 +0200 Fixes flushing of device routes. commit ab188fb76d7822350724b182106a19995a73d719 Author: Ondrej Zajicek Date: Thu May 3 12:25:15 2012 +0200 Implements build options to specify socket dir and suffix. commit 2795700c3158fa52b6cf957e9d0b9ad4a27c67a5 Merge: 1f85226 bf42207 Author: Ondrej Filip Date: Wed May 2 11:10:40 2012 +0200 Merge branch 'master' of ssh://git.nic.cz/bird commit 7a2c48dafce9420a23fd57408c31eecfc20c4fe0 Author: Ondrej Zajicek Date: Mon Apr 30 22:34:06 2012 +0200 Cleanup in sysdep KRT code, part 3. Just one more renaming, old krt_set_notify() to krt_replace_rte(). commit f1aceff59bbf942bc11c2e9a4c51e381c06f2b20 Author: Ondrej Zajicek Date: Mon Apr 30 22:21:52 2012 +0200 Cleanup in sysdep KRT code, part 2. Remove support for historic Linux kernels, merge krt-iface, krt-set and krt-scan stub headers. commit 396dfa9042305f62da1f56589c4b98fac57fc2f6 Author: Ondrej Zajicek Date: Mon Apr 30 15:31:32 2012 +0200 Cleanup in sysdep KRT code, part 1. OS-dependent functions renamed to be more consistent, prepared to merge krt-set and krt-scan headers. Name changes: struct krt_if_params -> struct kif_params struct krt_if_status -> struct kif_status struct krt_set/scan_params -> struct krt_params struct krt_set/scan_status -> struct krt_status krt_if_params_same -> kif_sys_reconfigure krt_if_copy_params -> kif_sys_copy_config krt_set/scan_params_same -> krt_sys_reconfigure krt_set/scan_copy_params -> krt_sys_copy_config krt_if_scan -> kif_do_scan krt_set_notify -> krt_do_notify krt_scan_fire -> krt_do_scan krt_if_ -> kif_sys_ krt_scan_ -> krt_sys_ krt_set_ -> krt_sys_ commit 182a78957d60a4c91c1ff8d1ff0f09b1b64b70ba Author: Ondrej Zajicek Date: Sun Apr 29 01:35:52 2012 +0200 Allows some modifications of dest attribute in filters. commit bf42207332e8e502d636038f1ec44aaea6ec50e0 Author: Ondrej Zajicek Date: Sat Apr 28 13:03:48 2012 +0200 Changes keyword 'exceed' to 'action'. commit ab758e4fb205346946f2d828236bd23efc2a419e Author: Ondrej Zajicek Date: Sat Apr 28 12:59:40 2012 +0200 Some fixes in route export limits. commit d494df63ac3061accdff348511a565c021411b28 Author: Ondrej Zajicek Date: Fri Apr 27 00:04:51 2012 +0200 Some minor fixes. commit 1f85226ecb76d3803b8fe37eb0891c45a6557dcd Merge: 92f8f7e d9b77cc Author: Ondrej Filip Date: Thu Apr 26 17:03:53 2012 +0200 Merge branch 'master' of ssh://git.nic.cz/bird commit d9b77cc28115e5c1ef64c69722c9d1fd1392dcd1 Author: Ondrej Zajicek Date: Tue Apr 24 23:39:57 2012 +0200 Implements generalized export limits. And also fixes some minor bugs in limits. commit 3589546af4baa4d349409a318f8c9658dd11b3cc Merge: 7d0a31d cca9706 Author: Ondrej Zajicek Date: Tue Apr 24 23:37:01 2012 +0200 Merge commit 'origin/master' commit 92f8f7e3a3a5a42768c18c1f3d4d8f9f98150c61 Author: Ondrej Filip Date: Tue Apr 24 16:31:17 2012 +0200 Small bug in detection of class-A networks. commit cca970666a90af02eaeb6848bbfc3d5a2222fa21 Author: Ondrej Filip Date: Sun Apr 22 14:03:07 2012 +0200 Small typo in programmer's documentation. commit 7d0a31deed92971e274aa0314e12619f93c850c9 Author: Ondrej Zajicek Date: Sat Apr 21 21:05:36 2012 +0200 Fixes in generalized import limits. commit 334a0ed24d015e106558cc9eeef301c6f0d21aec Author: Ondrej Zajicek Date: Fri Apr 20 21:04:55 2012 +0200 Fixes missing device attributes when exporting routes to kernel. Thanks to Howden Nick for the bugreport. commit 9b2b502be521b58a736f7b78644e89ee01b4418b Author: Ondrej Zajicek Date: Fri Apr 20 21:04:55 2012 +0200 Fixes missing device attributes when exporting routes to kernel. Thanks to Howden Nick for the bugreport. commit f93e6f338e59e02b0cddea85e7d367948d9cf3f2 Author: Ondrej Filip Date: Thu Apr 19 17:14:16 2012 +0200 Small clean up in debug texts commit 553e4054609e7aa8dcb92849c92a6fea73354f0e Author: Ondrej Filip Date: Thu Apr 19 17:12:13 2012 +0200 Small clean up in debug texts commit ebecb6f6a11bb418dd054cf12a2673ca0d9eac37 Author: Ondrej Zajicek Date: Sun Apr 15 15:28:29 2012 +0200 Implements generalized import hooks. Thanks to Alexander V. Chernikov for the original patch. commit 3e17e380598b9a512bb369f51a4cf55da269f608 Merge: 00a09f3 ae8b300 Author: Ondrej Zajicek Date: Sun Apr 15 15:17:03 2012 +0200 Merge branch 'master' into rt-accepted commit ae8b300164a975597f9b6caea0b205af2e4db30b Merge: d360f12 ed7c4b0 Author: Ondrej Zajicek Date: Sun Apr 15 15:15:05 2012 +0200 Merge commit 'origin/master' commit d360f129e393298ff3e5309ec06a3baf170784fb Author: Ondrej Zajicek Date: Sun Apr 15 15:13:12 2012 +0200 Fix static protocol w.r.t. some recent changes in protocol ahooks. commit 00a09f3c367e79297f827b52ec5f16842db1ac4e Author: Ondrej Zajicek Date: Sun Apr 15 15:07:58 2012 +0200 Implement RA_ACCEPTED mode of route propagation. commit ed7c4b0cd530126b9a794f817f5d1d93556a1bce Author: Ondrej Filip Date: Mon Apr 9 14:19:28 2012 +0200 Small bugfix in error message related to reconfiguration. commit bf2abe2f515d7b7aaed5fb4f37af82169adcd2f2 Merge: fb829de c0adf7e Author: Ondrej Zajicek Date: Fri Mar 30 11:04:12 2012 +0200 Merge branch 'soon' Conflicts: nest/proto.c nest/rt-table.c commit fb829de69052755a31d76d73e17525d050e5ff4d Author: Ondrej Zajicek Date: Wed Mar 28 18:40:04 2012 +0200 Fixes responsiveness for protocol shutdown. When a protocol went down, all its routes were flushed in one step, that may block BIRD for too much time. The patch fixes that by limiting maximum number of routes flushed in one step. commit cb3cf95859d81c711337738f004675f43c8bbb0e Merge: c9df01d 16fc65a Author: Ondrej Zajicek Date: Sun Mar 25 20:59:13 2012 +0200 Merge commit 'origin/master' commit c9df01d3215379c0463dd2a3b0c9b1700d6e2ac3 Author: Ondrej Zajicek Date: Sun Mar 25 19:44:14 2012 +0200 Fixes several minor bugs in kernel syncer. commit 9ba2798c65c02254ec000ab03a76fbbaae1ddc97 Author: Ondrej Zajicek Date: Fri Mar 23 01:17:02 2012 +0100 Adds krt_metric linux route attribute. commit 72aed1a00ba9e18116d6fd907f7e1a36d0a0a583 Author: Ondrej Zajicek Date: Fri Mar 23 00:26:26 2012 +0100 Adds krt_source route attribute. Thanks Jeremie Dimino for the original patch. commit 16fc65acc536d3788efe4c0554a2f52699fedc7f Author: Ondrej Filip Date: Thu Mar 22 14:52:40 2012 +0100 Minor correction commit 89647357af0d8507652f257f1e8f5679fe9a7078 Author: Ondrej Zajicek Date: Thu Mar 22 12:29:02 2012 +0100 NEWS and version update. commit c47d037ecb5b9c835700b152eed7589409a2e42f Author: Ondrej Zajicek Date: Thu Mar 22 11:46:38 2012 +0100 Some minor changes to CLI. commit df27911880bffb88c1eae90e36c755a3ed3d77ad Author: Ondrej Zajicek Date: Mon Mar 19 13:00:00 2012 +0100 Fixes problem with dirname(). Thanks Henrique de Moraes Holschuh for the original patch. commit af582c4811175d9a27ed5d08a4f6d5eaa69ecec7 Author: Ondrej Zajicek Date: Sun Mar 18 17:32:30 2012 +0100 Route Origin Authorization basics. - ROA tables, which are used as a basic part for RPKI. - Commands for examining and modifying ROA tables. - Filter operators based on ROA tables consistent with RFC 6483. commit fd087589f80a435a42cedb87b917c71363b11860 Author: Ondrej Zajicek Date: Fri Mar 16 13:01:12 2012 +0100 Fixes broken vlinks in OSPF. commit 0f808c066f3b5b190de951db042a34a1eb957a16 Author: Ondrej Zajicek Date: Fri Mar 16 12:47:12 2012 +0100 Adds filtering to 'show symbols' command. Thanks Alexander V. Chernikov for the original patch. commit 20ab192beca749166e19118e987b53b5e131d0cf Author: Ondrej Zajicek Date: Fri Mar 16 12:12:26 2012 +0100 Adds filtering to 'show ospf lsadb' command. Thanks Alexander V. Chernikov for the original patch. commit 0888a737b045b48106edbd28ba3cd62fcc8c191e Author: Ondrej Zajicek Date: Thu Mar 15 20:42:29 2012 +0100 Extends set operations in filters. Allows add/filter/delete clist on clist (set algebra on clists). Allows number ~ bgppath match. commit 9f1500f50a0196f912eeb97e77ccf6873e186c29 Author: Ondrej Zajicek Date: Thu Mar 15 13:45:55 2012 +0100 Adds warning for mismatch MTU in OSPF packets. Thanks Alexander V. Chernikov for the original patch. commit 2f9955b5d508698b04ff41e5e38097acdac416b9 Author: Ondrej Zajicek Date: Thu Mar 15 13:12:00 2012 +0100 Fixes TTL for multicast OSPF packets. Thanks Alexander V. Chernikov for the suggestion. commit 8796a8a56edbcd420de724a58947c7aedadf04de Author: Ondrej Zajicek Date: Thu Mar 15 12:50:49 2012 +0100 Fixes name for unnamed filters. Thanks to Alexander V. Chernikov for the suggestion. commit 7d837aa014a78bce2b329cc9f56e8dc799d456e8 Author: Ondrej Zajicek Date: Thu Mar 15 12:43:47 2012 +0100 Fixes documentation - default pipe mode. Thanks to Benjamin Cama for the bugreport. commit e2bf812f3dc84981eac045b617261987c25b5e90 Author: Ondrej Zajicek Date: Thu Mar 15 12:38:08 2012 +0100 Fixes RIPng compatibility. Also probably breaks compatibility with older BIRDs, but RIPng not really worked here. Thanks to Goesta Smekal for the original patch. commit f761503760fba2d4124cc3352f5260c31fac526d Author: Ondrej Zajicek Date: Thu Mar 15 12:23:49 2012 +0100 Fixes RIPng socket and neighbor handling. RIPng did not really work because of link-local addresses. Thanks to Roman Hoog Antink for some notes. commit 117e3c4bbfd4b7f1b2cae6ef9e5cb603fe33307a Author: Ondrej Zajicek Date: Thu Mar 15 12:18:26 2012 +0100 Fixes a bug in pair set intervals. Pair intervals in form (a,b)..(c,d) were mishanded. Thanks to Alexander Shikoff for the bugreport. commit c0adf7e9fc0bb920175a639c6f56ed7b4190f3e4 Author: Ondrej Zajicek Date: Thu Mar 15 11:58:08 2012 +0100 Better support for multitable protocols. The nest-protocol interaction is changed to better handle multitable protocols. Multitable protocols now declare that by 'multitable' field, which tells nest that a protocol handles things related to proto-rtable interaction (table locking, announce hook adding, reconfiguration of filters) itself. Filters and stats are moved to announce hooks, a protocol could have different filters and stats to different tables. The patch is based on one from Alexander V. Chernikov, thanks. commit 46c1a583a5c1ea81e8d8f372bd7f614506a63938 Author: Ondrej Zajicek Date: Fri Feb 3 11:50:51 2012 +0100 Fixes a bug causing crash during soft reconfiguration of export to kernel proto. commit 39c028e9e9e3acf840051f4271fadd4939fde2af Author: Ondrej Zajicek Date: Tue Jan 24 11:31:00 2012 +0100 Assign default protocol preference via proto_config_new(). The patch from Alexander V. Chernikov. commit 09686693d35bd71187847c95c0967d4125215b97 Author: Ondrej Zajicek Date: Mon Jan 23 03:15:12 2012 +0100 Implements handling of BSD iface arrival/departure notifications. Thanks to Alexander V. Chernikov for original patch. commit 732a0a257d180a95a02587203555b8552b6128ac Author: Ondrej Zajicek Date: Mon Jan 23 01:26:40 2012 +0100 Fixes problems with creating/removing/renaming ifaces on BSD. commit 5c78e0e386d4c770b646cab4a8adc3c87987f50f Author: Ondrej Zajicek Date: Sun Jan 22 11:03:30 2012 +0100 Some more verbose warnings. commit bc092571171d00de8b429fec8ba70c39240d7e91 Author: Ondrej Zajicek Date: Sat Jan 21 22:56:16 2012 +0100 Fixes another minor bug in iface scan. Iface flags are not updated in some cases. commit b573755df426156c22d2a4c65e3f502284820166 Author: Ondrej Zajicek Date: Sat Jan 21 22:41:31 2012 +0100 Fixes a bug in BSD iface scan. if_update() should be called always, because periodic iface scan code removes all not-updated ifaces. commit 544f2e1b36fb9473132f77d9c0f6e97d1495bb24 Author: Ondrej Zajicek Date: Fri Jan 20 18:16:35 2012 +0100 NEWS and version update. commit 3ce17142791b2e1a7f0b8e512b5b74224600056c Author: Ondrej Zajicek Date: Fri Jan 20 16:20:03 2012 +0100 Fixes a new bug in BGP route ordering. commit 2c5ca47ad4d18cae162c2ddf85af2dedb89f00a5 Author: Ondrej Filip Date: Tue Jan 10 13:44:06 2012 +0100 New version 1.3.5 commit 4b3a8ff8c6e34f0486b82a10706f1ee0b688048e Author: root Date: Mon Jan 9 16:57:45 2012 +0100 Extend buffer for netlink messages. commit 2c67a564b368bee94f387ba988e8a2e9a76a04ce Author: Ondrej Zajicek Date: Mon Jan 9 03:32:34 2012 +0100 NEWS and version update. commit 8cf8f820fe66af1755e360ea1c5179483766131d Author: Ondrej Zajicek Date: Mon Jan 9 03:20:52 2012 +0100 Show interface for link-local gw in static protocol. commit d7f469c15c1fd8315061f85b87a19946c3ea4700 Author: Ondrej Zajicek Date: Mon Jan 9 02:40:57 2012 +0100 Some minor fixes. commit 3f58437405f8e37e9c14d83274a6b82ffd9583f8 Author: Ondrej Zajicek Date: Sun Jan 8 16:28:33 2012 +0100 Fix for IPv6 addresses on non-multiaccess ifaces on BSD. Thanks Matthias Schiffer for the patch. commit 53ffbff39f054e1302fb296327b9bb1b4f88226c Author: Ondrej Zajicek Date: Sun Jan 8 15:28:27 2012 +0100 Implements support for link-local addresses in BGP. Thanks Matthias Schiffer for the original patch. commit eb1451a3a0c45a4cc62dd0f1f3c3157ec38e2f8e Author: Ondrej Zajicek Date: Sun Jan 8 15:27:04 2012 +0100 Better support for link-local addresses in IO code. commit a03ede64936d0aee1a760a19dc6194b2fdc9c692 Author: Ondrej Zajicek Date: Tue Jan 3 00:42:25 2012 +0100 Fixes a tricky bug in route filtering. Route attributes was used after rta was freed during copy-on-write in filter code. This causes some random crashes, esp. with multipath routes. commit 69a8259c5e438f949bd58b1a2f8e1d12a49f9216 Author: Ondrej Zajicek Date: Sun Jan 1 12:02:20 2012 +0100 Allows sticky link-local neighbors. Allows using NEF_STICKY neighbors with link-local addresses. This is used for static route nexthops, they can be specified like fe80::1%eth0 . commit c32c3f88f0c8788118ed3701c11a5aea2aaf9356 Author: Ondrej Zajicek Date: Thu Dec 22 13:44:43 2011 +0100 Fixes parsing larger numbers on 64bit platforms. commit be4cd99a3688cef19f66e1c8b8e0506ffc1e13fc Author: Ondrej Zajicek Date: Thu Dec 22 13:20:29 2011 +0100 Implements deterministic MED handling. Thanks to Alexander V. Chernikov for many suggestions. commit cf7f0645316f5df0984467cf7001f5466254eaf3 Author: Ondrej Zajicek Date: Mon Dec 12 00:24:15 2011 +0100 Fixes problem with sticky neighbors and iface address changes. Thanks Matthias Schiffer for the bugreport and the original patch. commit 2779d50a24dc1b7c6b4cf83a17af817c02462855 Author: Ondrej Zajicek Date: Thu Nov 17 21:12:23 2011 +0100 Fixes RAdv proto w.r.t. templates. Thanks Alexander V. Chernikov for this. commit 60fd666b796dfa8ba12b44338754ca73b76da2e8 Author: Ondrej Zajicek Date: Thu Nov 10 09:22:20 2011 +0100 Fixes missing header. commit a7f23f581f5e3efe92ec97dfca7d01c66f31ab04 Author: Ondrej Zajicek Date: Mon Nov 7 00:31:23 2011 +0100 Implements protocol templates. Based on the patch from Alexander V. Chernikov. Extended to support almost all protocols. Uses 'protocol bgp NAME from TEMPLATE { ... }' syntax. commit 74add5df17c386bd109ebea7b1dac04d1651ae51 Author: Ondrej Zajicek Date: Thu Oct 27 13:21:24 2011 +0200 Fixes seqnum generation. Thanks Mohammad Amin Shoaie for notification. commit 78e33c29bbbc6f4dd308cd8ef589ce543c3d8d6e Author: Ondrej Zajicek Date: Wed Oct 26 20:06:36 2011 +0200 Some minor fixes in parser. commit 14a8f396e1d8fc5787041eace8ab026fe5a0896c Author: Ondrej Zajicek Date: Wed Oct 26 13:55:24 2011 +0200 Fixes sockets for IPv4 RIP. Thanks Roman Hoog Antink for a suggestion. commit 00a124e3fc218aa39c634bbda244789f2ea0cd3d Author: Ondrej Zajicek Date: Mon Oct 10 02:33:11 2011 +0200 NEWS and version update. commit 9b7fdfc84a516ede415cd1941e5ff1d6312e83ff Author: Ondrej Zajicek Date: Mon Oct 10 01:01:58 2011 +0200 Fixes for include. commit 1cb97af419ee5bff45049f4d3a85acadbb5b1cb9 Author: Ondrej Zajicek Date: Sun Oct 9 17:01:01 2011 +0200 Extend the error message. commit 9491f9f593c1195039cecd1bb2a502363b58c66d Author: Ondrej Zajicek Date: Thu Oct 6 23:01:23 2011 +0200 Use reserved address blocks for documentation (RFC 5737). commit 32f95476a8d60508ca9d24fe20b09899b72de9d7 Author: Ondrej Zajicek Date: Thu Oct 6 22:48:49 2011 +0200 Signal problems with route installation to kernel tables. commit 35c875f0d1eb7c72e0b0ab8a90eb32cbcbfdac02 Author: Ondrej Zajicek Date: Sat Oct 1 09:57:49 2011 +0200 Fixes some error messages and the NSSA gw lookup. Thanks to Alexander V. Chernikov for the patch. commit 736fd7303cb05e910507edaa9310178a23dbcf1e Author: Ondrej Zajicek Date: Tue Sep 27 13:49:32 2011 +0200 Fixes a bug with multiple function arguments. commit bf6d91dc4edf3d08f0de41f71503159b1713fc9a Author: Ondrej Zajicek Date: Sat Sep 24 11:06:42 2011 +0200 Use undefined scope for undefined IPv6 addresses. commit 4116db182d8d80d26902a8b33f82664bb5770066 Author: Ondrej Zajicek Date: Sat Sep 24 02:21:52 2011 +0200 Implements static recursive routes. commit 4271f2b77ed3862a2356475dc18b0cf5c1086364 Author: Ondrej Filip Date: Sun Sep 18 13:52:50 2011 +0200 Fixed problem during 'configure' with EC commit 55b58d8c1f51942c487cc268bd9e2ca214913377 Author: Ondrej Filip Date: Mon Sep 12 12:13:53 2011 +0200 Removed some completed jobs. commit 1e69379e70da3486a601cab7a41ccf7a5825101d Author: Ondrej Filip Date: Sun Sep 11 21:43:24 2011 +0200 NEWS file updated. commit 48ec367aabaaa5328f4072d237001e245a7363df Author: Ondrej Filip Date: Sun Sep 11 21:21:47 2011 +0200 Configuration can include other files. commit a98995273bd8788cf525f44479026d5ce6b7dd52 Author: Ondrej Zajicek Date: Sun Sep 4 13:23:26 2011 +0200 NEWS and version update. commit cb2b586f00f5e7ef9a902b028fc5bfe117890457 Author: Ondrej Zajicek Date: Sun Sep 4 10:39:10 2011 +0200 NetBSD compile fix. commit 51947659abbf9af861aa7dec36fd1c845fb617ab Author: Ondrej Zajicek Date: Sun Sep 4 00:56:02 2011 +0200 Minor changes in BGP protocol info. Shows neighbor IP and ASN even if protocol is down. commit 6c4df70373fa640a7f068d4e1b563621b67c0d2b Author: Ondrej Zajicek Date: Sat Sep 3 21:59:40 2011 +0200 Fixes possible buffer overflow when printing BGP attributes. Thanks to Alexander V. Chernikov for the patch. commit 2918e61046388821c3d4411c602dc5b28ad59329 Author: Ondrej Zajicek Date: Sat Sep 3 21:31:26 2011 +0200 Fixes for OSPF NSSA handling. commit b1b19433602f2a2ff58cfe2c1858ff883eee7b20 Author: Ondrej Zajicek Date: Tue Aug 16 23:05:35 2011 +0200 The generalized TTL security mechanism (RFC 5082) support. Thanks to Alexander V. Chernikov for the patch. commit a52d52fa91ffcbcea58326fc2de476ce5644256f Author: Ondrej Zajicek Date: Mon Aug 15 20:54:58 2011 +0200 Fixes some missing tabs. They unintentionally disappeared in 1.3.2. commit a209d5d8e1bea2b37a7cddebe1f275da4ebde4e3 Author: Ondrej Zajicek Date: Mon Aug 15 02:06:56 2011 +0200 A minor fix in BSD. commit 8815d846bf77e4231f36b64d8e4ac9a3ec2d1504 Author: Ondrej Zajicek Date: Sun Aug 14 15:53:47 2011 +0200 BGP Extended communities documentation. commit 42a0c05408c4151442e6a0ec1c6889acbcfe9c17 Author: Ondrej Zajicek Date: Fri Aug 12 21:03:43 2011 +0200 BGP Extended communities. commit bde872bba745e5596bdb066df6ef323b7cabcfdd Author: Ondrej Zajicek Date: Mon Aug 8 10:57:54 2011 +0200 The documentation update. commit ed317862c2958303cf541fe63f4ea26d00918a9a Author: Ondrej Zajicek Date: Mon Aug 8 01:45:31 2011 +0200 OSPF NSSA support, inter-area LSA translation. commit aca0e79faa391a2841134dac78a499dfdca68bd9 Author: root Date: Fri Jul 29 14:52:28 2011 +0200 Handles missing macro. commit 14272097df989808790673521f643053f898aa8c Author: Ondrej Zajicek Date: Thu Jul 28 13:50:02 2011 +0200 Fixes crash on BSD. commit 4160a9dd9416ee5afd215750bdd6c6e7a4e7ed1f Author: Ondrej Zajicek Date: Fri Jul 22 20:00:24 2011 +0200 OSPF NSSA translator election. commit 41b612c31be05409e69e7365db82b3d1aefc4ca3 Author: Ondrej Zajicek Date: Wed Jul 20 23:40:20 2011 +0200 OSPF NSSA support, part one. commit 9008579b97239564e1dcac855cf726fa9ab7dabd Author: Ondrej Zajicek Date: Wed Jul 20 23:46:03 2011 +0200 Fixes broken multi-area OSPF. commit c49490f8c096ef1379f08e7d70cc24f0c28b80ef Author: Ondrej Zajicek Date: Fri Jul 8 08:58:50 2011 +0200 NEWS and version update. commit beeda6af44e72e3a20fcd2837b231a04354790fa Author: Ondrej Zajicek Date: Thu Jul 7 17:43:39 2011 +0200 Removes timers for stub interfaces. Also fixes some minor bugs. commit 7d4e923603fdb43b6f017e5ef78e37d0891c699c Author: Ondrej Zajicek Date: Wed Jul 6 03:10:02 2011 +0200 Do not open sockets for stub interfaces. commit f796945f04d8be4e71cdf48d919c2035c0a2551d Author: Ondrej Zajicek Date: Sun Jul 3 23:24:38 2011 +0200 Fixes LSA checksum computation for larger LSAs. commit fdf16eb65872b3bee02fb9e25c80ea32cf59f8e9 Author: Ondrej Zajicek Date: Sun Jul 3 19:43:30 2011 +0200 Prints full community lists during 'show route all'. commit 6370d6f61b30b2390727eee8136e0e575dff609f Author: Ondrej Zajicek Date: Sun Jun 26 22:25:09 2011 +0200 Fix route types in rta_show(). commit e08d2ff08e4cff4bec38878e084fee7666caaaf2 Author: Ondrej Zajicek Date: Sun Jun 26 17:09:24 2011 +0200 Adds filter clist operation. commit 35f8c731ea29bd534c74b2d0de089d5683ebcd8d Author: Ondrej Zajicek Date: Sat Jun 25 14:51:16 2011 +0200 Fixes output of BGP timers in 'show protocols all'. commit d8b5a786d27eed72106f88f893c521e67f1bef06 Author: Ondrej Zajicek Date: Sat Jun 25 11:35:54 2011 +0200 IPV6_CHECKSUM should not be used on ICMPv6 sockets. commit 23fd464447c4d0f0efe7b61ca3128bbb1bc1c21c Author: Ondrej Zajicek Date: Mon Jun 20 20:35:59 2011 +0200 Fixes a bug related to protocol enabling and reconfigure. When a protocol was enabled interactively (but disabled in the config file), then reconfigure in some cases forgets to disable it. commit ae85e28cf410cefe4f6e1cdf92510fbf9cea7ae0 Author: Ondrej Zajicek Date: Mon Jun 20 07:37:55 2011 +0200 Fixes a bug in OSPF causing DoS by an invalid packet. commit 61c96d724464ee067e589b72ca9d10a2f7692901 Author: Ondrej Zajicek Date: Tue May 31 17:27:46 2011 +0200 Fixes bug that causes crash with strange BGP updates. commit 5e9bdac28ec95172b0c31641507f6a2fcd2e95fb Author: Ondrej Zajicek Date: Sat May 21 22:48:08 2011 +0200 Fixes a bug with setting preference during show route cmd. If show route cmd was used with a filter that changed preference, BIRD crashed. commit 1155c79209b6a670d0e1f85b2603363ba1132ae0 Author: Ondrej Zajicek Date: Thu May 19 01:20:00 2011 +0200 Fixes compatibility with Mikrotik. commit b54ad333b3c8b486b059f6c0e1afc8c35b64ebea Author: Ondrej Zajicek Date: Mon May 16 12:39:55 2011 +0200 Documentation update. commit e8b89a610443f32b901801668cbae634e13f3e68 Author: Ondrej Zajicek Date: Sun May 15 16:29:44 2011 +0200 Update and document the privilege restriction. commit 1bc2695744c729804af32d48ce68854cba4de8f7 Author: Ondrej Zajicek Date: Tue May 10 02:42:17 2011 +0200 Allows run with restricted privileges. Adds option -u and -g to specify user and group. When different user (than root) is specified, linux capabilities CAP_NET_* are kept. commit 46bb7e0d176a4dc0a47bb406988f92fb29cceaf4 Merge: b8cc390 b7c4898 Author: Ondrej Zajicek Date: Fri May 6 22:09:44 2011 +0200 Merge commit 'origin/master' commit b8cc390e7ed724a9ad605453227d1e4686f3a11b Author: Ondrej Zajicek Date: Fri May 6 22:00:54 2011 +0200 Fixes several problems in filter syntax. - Fixes several conflicts in the grammar. - Fixes a bug in (a..b, c) pair patterns. - Makes pair patterns orthogonal. - Allows term expressions in pair patterns without additional ( ). - Allows several comma separated values in switch cases. commit b7c48981069f25c01c552519e10aec4ebab1f031 Author: Ondrej Filip Date: Thu May 5 14:14:20 2011 +0200 Compilation was failing without OSPF or RIP protocol - FIXED. commit 409e8a6e21d3df0919fd2e131ba9a58222baee50 Author: Ondrej Zajicek Date: Mon May 2 02:06:03 2011 +0200 NEWS and version update. commit a506476acd4baa212f542b257eb5abba733ba4c5 Author: Ondrej Zajicek Date: Sun May 1 17:16:05 2011 +0200 There may be more IP address records with the same IP. commit 5964569c23829ec93fcf671a2582be01c8aebecf Merge: acc93ef d600909 Author: Ondrej Zajicek Date: Fri Apr 29 19:03:19 2011 +0200 Merge commit 'origin/master' commit acc93efd4c754cc995ee8edf52ce0bc45511062e Author: Ondrej Zajicek Date: Thu Apr 28 00:31:37 2011 +0200 Use constants from /etc/iproute2/rt_* files. commit 73272f04af40484b72451f541a986da996b0da58 Author: Ondrej Zajicek Date: Fri Apr 22 16:13:27 2011 +0200 Adds BGP option related to MED handling. Adds option 'med metric' allows to compare MEDs between routes received from different neighbors. commit d600909da9ef0a4b25052c1bf2de83d4e7628b0e Author: Ondrej Filip Date: Wed Apr 13 13:19:37 2011 +0200 Fixed bug FICORA #503685. commit 71ca77169d5d3e67459e46841b8bdb95accd8c2a Author: Ondrej Zajicek Date: Wed Apr 13 12:32:27 2011 +0200 Adds support for several Linux kernel route attributes. commit 4aef102be1e29d3450e53a20a6b2f96d50527139 Author: Ondrej Zajicek Date: Thu Apr 7 11:31:56 2011 +0200 Fixes KRT sync in BSD. When buffer is too small (because of change between sysctls()), needed is *not* changed. commit 489c308a75b121f286cc8637ead8b2bf7bf896ec Author: Ondrej Zajicek Date: Tue Apr 5 11:41:18 2011 +0200 Minor fixes. commit bf27abd6d4a20448f5b4c80e9aa9258dc8670f62 Merge: 4ef0950 a5b84ab Author: Ondrej Zajicek Date: Fri Apr 1 13:56:42 2011 +0200 Merge commit 'origin/master' commit 4ef0950603ffbd515d97359015585b4a7512bc75 Author: Ondrej Zajicek Date: Fri Apr 1 13:54:39 2011 +0200 Fixes a problem with BGP protocols and implicit router IDs. commit d93a43a57d37b7cc5506a823a081d21f515c3820 Author: Ondrej Zajicek Date: Fri Apr 1 12:21:18 2011 +0200 Fix leaked debug message. commit a5b84ab540ff3131938b38ebc82ed8e3ce46f261 Author: Ondrej 'Feela' Filip Date: Thu Mar 31 10:30:58 2011 +0200 NEWS updated. commit eb3786e4ea46ce1abc4ca211346369b36dc17dd7 Author: Ondrej Zajicek Date: Wed Mar 30 02:00:56 2011 +0200 NEWS and version update. (and minor changes in documentation) commit 06fb60c4af38d529d20b662748243b3f4a693c60 Author: Ondrej Zajicek Date: Wed Mar 30 01:09:18 2011 +0200 Fixes some problems in BGP error handling. commit 83696b3913c9f52a3d53db073e1ba0641b60ab07 Author: Ondrej Zajicek Date: Tue Mar 29 02:44:39 2011 +0200 Hide 6to4 route warnings. commit ab164971891c64126097eedca11d2f5586f1d8e7 Author: Ondrej Zajicek Date: Tue Mar 29 01:41:46 2011 +0200 Fixes a nasty bug in OSPF. Sending malformed network prefixes in LSAs causes OSPF to crash just after the LSA is propagated to the other routers. commit 52a43ae3b76f86b697537bc3ad8afdb3b421cf2c Author: Ondrej Zajicek Date: Mon Mar 28 22:46:18 2011 +0200 Minor changes in addresses. Mainly changes IA_UNNUMBERED to IA_PEER and adds IA_HOST. Also do not show broadcast addr in show interfaces. Nobody cares for that. commit c454872f4e81e69a8e9950289ab810fcac3fc922 Author: Ondrej Filip Date: Sun Mar 27 23:27:37 2011 +0200 Avoid using stack. commit 4e712ec3b7cb4678607b2a48a2feaa0658333ab2 Author: Ondrej Filip Date: Sat Mar 26 15:21:35 2011 +0100 Added CZ.NIC copyright. commit 86c038ccae2149645058d4288ff8efb498013522 Author: Ondrej Filip Date: Sat Mar 26 14:38:00 2011 +0100 Documentation about previous commit added. commit 4fc36f394ec0988a18decb2d1916e3cebef18d22 Author: Ondrej Filip Date: Sat Mar 26 14:18:56 2011 +0100 This adds (*,x) functionality. commit d0e9b36d30176a9e18cad6151b20746e1588cdc8 Author: Ondrej Zajicek Date: Wed Mar 23 17:15:11 2011 +0100 Added header file. commit 0aa88530ad3c58a6bdab886cabd9b2a4278486e8 Author: Ondrej Zajicek Date: Wed Mar 23 13:40:46 2011 +0100 Convert && and || to shortcut boolean operators. commit 26d92bb8921ac4e022cdc88bde8fc7bc617f8766 Author: Ondrej Zajicek Date: Wed Mar 23 12:49:53 2011 +0100 A hack to distinguish if..else from else: in case. The old BIRD grammar needs two lookaheads to distinguish if..else from else: in case, which caused the parser to fail on some combinations of both expressions. This patch replaces two tokens 'else' ':' by one token 'else:' to fix that. commit 6bcef22580010aec695fb2b559c7b33ee00261b0 Author: Ondrej Zajicek Date: Sat Mar 19 12:13:59 2011 +0100 Documentation for the router advertisement protocol. commit 8e48831a970a784a979446813191628790d477f1 Author: Ondrej Zajicek Date: Thu Mar 17 15:53:36 2011 +0100 Vastly improved OSPF reconfiguration. Now it can handle a change in iface pattern structure. It can add, remove and reconfigure interfaces, vlinks and areas. commit 93e868c730dc0b1825b2a685e0b066c051b1cb07 Author: Ondrej Zajicek Date: Sun Mar 13 11:33:50 2011 +0100 Implements Router Advertisement protocol. commit 9d67ffb0b4cdfbbf88779ce2b44ba810d1ba85d3 Author: Ondrej Zajicek Date: Sat Jan 8 19:34:12 2011 +0100 Fixes scope for sticky neighbors. commit d32a071da9655c2d05038e721bcf020498263c1e Author: Ondrej Zajicek Date: Sat Jan 8 11:31:12 2011 +0100 Some cleanups in krt_read_ifinfo(). commit dad7ee70c1711b2cbdfd86c615736fe12c0d126a Author: Ondrej Zajicek Date: Sat Jan 8 11:22:38 2011 +0100 Fixes interface names on BSD systems. commit e7b4948cbd3e4cacf4fe0f774b44d1f74029ea6d Author: Ondrej Zajicek Date: Tue Dec 28 01:43:07 2010 +0100 A simplification of the next-hop calculation. Thanks to Joakim Tjernlund for the idea. commit 919f5411c48f509a49400a1293e670f5d5d2bcf1 Author: Ondrej Zajicek Date: Fri Dec 24 18:08:07 2010 +0100 Implements Point-to-MultiPoint interface type for OSPF. commit 39847cda73d8e8536300b74d90d01b6e2f233ef7 Author: Ondrej Zajicek Date: Thu Dec 23 12:24:40 2010 +0100 Add some comments. commit f0160f0e06be883528e5e29edfd509efa14d0c78 Author: Ondrej Zajicek Date: Thu Dec 23 10:25:22 2010 +0100 Fixes a minor memory wasting. commit 8cab377d92b62c028ee7aab49049b7cb6cd53ab9 Author: Ondrej Zajicek Date: Wed Dec 22 23:33:40 2010 +0100 Remove unnecessary check. commit 154e2aeded13f46666a69b7a7241149c43ebc01f Author: Ondrej Zajicek Date: Mon Dec 13 11:17:11 2010 +0100 Fixes string handling in birdc. commit e91f6960bae16314e9429719c2c2321edb484a44 Author: Ondrej Zajicek Date: Tue Dec 7 23:36:48 2010 +0100 Documentation update (multipath). commit 32b4972834352d641f7d2c08a27c18b0babd3790 Author: Ondrej Zajicek Date: Tue Dec 7 23:36:11 2010 +0100 Multipath support for linux kernel protocol. commit 57c574d82a44d10143aba7aaea6d1384d850c079 Author: Ondrej Zajicek Date: Tue Dec 7 23:35:39 2010 +0100 Multipath support for OSPF commit 9852f81064a38d35ff1bd5cc9fab7fc33926c83c Author: Ondrej Zajicek Date: Tue Dec 7 23:34:36 2010 +0100 Multipath support for static protocol. commit 7e95c05d889f22be44aef5051eb07d35a4a8f579 Author: Ondrej Zajicek Date: Tue Dec 7 23:33:55 2010 +0100 Core multipath support. commit 01427d3f2b69a4ae1b616b380d4911a132ec450f Author: Ondrej Zajicek Date: Fri Nov 19 18:03:27 2010 +0100 Remove some runaway debug messages and typos. commit 391931d45686a807d322878d4b3d5c9634e2dbca Author: Ondrej Zajicek Date: Fri Nov 19 13:46:21 2010 +0100 Minor finalizations of link state checks. commit 79f561a173c9ceb824d64aa32d82e43ba62acebc Author: Ondrej Zajicek Date: Sat Nov 13 14:19:55 2010 +0100 Fixes a typo (in OSPF_MAX_PKT_SIZE value). And updates a comment. commit d9e7e1b13d69fa50d1979576c418c579f05463c6 Author: Ondrej Zajicek Date: Sat Nov 13 14:19:23 2010 +0100 Adds support for iface link detection to OSPF. commit fe181e7c63843ad65401cc1e400ae1ac3187122f Author: Ondrej Zajicek Date: Thu Nov 11 12:24:27 2010 +0100 Adds support for iface link check to static protocol. commit f25cb0ef9f6341648513e793a3162b32fc250d2b Author: Ondrej Zajicek Date: Thu Nov 11 10:03:02 2010 +0100 Implements link state detection. Also changes some symbol names (IFF_ADMIN_DOWN -> IFF_SHUTDOWN, IFF_LINK_UP -> IFF_ADMIN_UP). commit 5cdf264f937687aff194574f5fe2badb087337b8 Author: Ondrej Zajicek Date: Wed Nov 10 16:43:11 2010 +0100 Fixes a bug related to implicit backbone on ABR. commit c4443085a198c26a478463429477e7e8a599fa07 Author: Ondrej Zajicek Date: Thu Nov 4 17:25:48 2010 +0100 OSPF tx buffers should have the same size as rx buffers. We should be able to send everything we received. commit d5356072ac18d5b0eb12f14afca6bfbea702dda2 Author: Ondrej Zajicek Date: Thu Nov 4 17:22:43 2010 +0100 Fixes a bug in LSA update of large LSAs. commit d3209d939d4d0d8801432f212edd4302a7d03633 Author: Ondrej Zajicek Date: Wed Nov 3 10:04:46 2010 +0100 Fixes a bug in OSPF. commit fcf5a4f4b3e1a984f65d873e7a5a8c830b1ad9bf Author: Ondrej Zajicek Date: Wed Nov 3 10:02:24 2010 +0100 Change default for BGP IPv6 socket to V6ONLY. Also add a new option 'dual' for the old behavior. commit 5adc02a6f87bda06094ce36eb699884c03760bf5 Author: Ondrej Zajicek Date: Fri Oct 22 11:25:47 2010 +0200 Documentation update. commit ed76033c847939877e4fbfadf06898521aafb740 Author: Ondrej Zajicek Date: Fri Oct 22 08:35:19 2010 +0200 Fixes some typos. commit 938b191b9282b138cbdd30dfc11b78c0467d6380 Author: Ondrej Zajicek Date: Sat Oct 9 01:00:53 2010 +0200 Fixes error handling in ASN expressions. commit 112d71a73f30d26891eda4374bf0f2ab31c5c048 Author: Ondrej Zajicek Date: Fri Oct 8 14:25:53 2010 +0200 Fixes syntactic priority of '.' . Dot in expressions like net.len definitely should have the highhest priority. commit b2b7bbfc690a7ad6a61a8cdf4abe87345057fb2e Author: Ondrej Zajicek Date: Mon Oct 4 19:55:11 2010 +0200 Fixes scope of filter symbols. commit 0d1b3c4c0e3261d1d4261e9aeb9975a01d0ff2f9 Author: Ondrej Zajicek Date: Mon Sep 20 13:01:01 2010 +0200 Changes print-like filter commands to use a log instead of a stderr. And extends the log subsystem to better handle that. commit 2dec1e3471385ea191862c8fe85d76a8e47410de Author: Ondrej Zajicek Date: Wed Sep 15 02:01:23 2010 +0200 Fixes a bug in pair sets. commit a58022a64ee8aa2fc46816020723dfbf4bfd08d9 Author: Ondrej Zajicek Date: Sat Sep 11 20:14:53 2010 +0200 Fixes a bug in community set delete. commit 4ca93a50675489a6a5ef9369c24806cc3cbff45e Author: Ondrej Zajicek Date: Wed Sep 8 12:08:38 2010 +0200 Fixes a one byte buffer overflow. commit 948c865fac85f91dd7463195b190d8f133e0f741 Author: Ondrej Zajicek Date: Fri Sep 3 17:15:02 2010 +0200 Fixes a crash in RIP during reconfigure. commit 3cb6c83f1a2eb563e459ce34d0f4850cc9dd4776 Author: Ondrej Zajicek Date: Fri Sep 3 16:32:00 2010 +0200 Fixes a memory leak in RIP. commit faf58cec4d0c0d3c1fddee6faf2f57a1362477bb Author: Ondrej Zajicek Date: Sun Aug 22 14:43:53 2010 +0200 Fixes a bug in NBMA on an iface with multiple IP addresses. commit ac4a1eedfc515e041877d48fd5f64ee4e3b30532 Author: Ondrej Zajicek Date: Fri Aug 13 14:30:36 2010 +0200 Change default for handling missing link-local addresses on route servers. commit dcc71a7fb7e507acc2e0b417e6c9d1940448908e Author: Ondrej Zajicek Date: Thu Aug 12 10:22:40 2010 +0200 Supports unique local unicast addresses. commit 0ef69b1c4a255360e1fa76dffd7a0cb97ea1e9dc Author: Ondrej Filip Date: Mon Aug 9 14:09:53 2010 +0200 Typo in doc. commit 265d06dcbc138c7373ec7b341fcd628eb87e4c4b Author: Ondrej Zajicek Date: Wed Aug 4 15:27:11 2010 +0200 Fixes IPv6 build. commit 373d3dbe8dfbce21af72618c0f912dd0e23a6f3c Author: Ondrej Zajicek Date: Wed Aug 4 13:53:52 2010 +0200 Fixes build on Sparc. commit 946dc15c928d9a48cdcc857bc80f4fabf9a4e2bf Author: Ondrej Filip Date: Tue Aug 3 17:35:34 2010 +0200 Documentation update and improvement of tests related to expressions in sets. commit e0e8c04a83bbe24cdcf3836ca171ce60db299b1f Author: Ondrej Filip Date: Tue Aug 3 15:23:30 2010 +0200 Small typo in documentation. commit edaec901e12c2f0756ab44f7493e999145d7dff9 Author: Ondrej Filip Date: Tue Aug 3 15:22:29 2010 +0200 Even set of number can be made by expressions. commit 4733b49ed6ec11669061e15680417961d13c7a61 Author: Ondrej Filip Date: Tue Aug 3 15:14:26 2010 +0200 Syntax of sets improved. commit 2c9033afd5ce5e99255d248fb065e94534405da7 Author: Ondrej Zajicek Date: Tue Aug 3 08:26:47 2010 +0200 Do not allow interdependent recursive routes. commit f428631cd6f48c5155bd1b7724e9bb8a545fda12 Author: Ondrej Zajicek Date: Tue Aug 3 01:12:43 2010 +0200 Ignore warning when BGP peer is unreachable. commit b74f45f8a05444dca16f0995c7d201ea592ce299 Author: Ondrej Zajicek Date: Tue Aug 3 00:59:13 2010 +0200 Documentation update. commit ba5e5940aa1f11128c76a3964823bda22e47ab04 Author: Ondrej Zajicek Date: Mon Aug 2 13:11:53 2010 +0200 Adds igp_metric attribute. commit d395fe48553062413a85fd04cda0752f933e70c6 Author: Ondrej Zajicek Date: Sat Jul 31 11:37:30 2010 +0200 Fixes bug in OSPF ext-LSA origination. commit d1e146f2f8da303af7bbe0cec363cc15c58c37fd Author: Ondrej Zajicek Date: Sat Jul 31 01:04:32 2010 +0200 Implements IGP metric comparison for BGP routes. commit ac3ac49a71d4b290cfb28aecafc8ac4a69df7a64 Author: Ondrej Zajicek Date: Wed Jul 28 13:13:34 2010 +0200 Adds route resolvability test. commit 1b180121a90ef98f3adce1a355d48d64c6fc3c4f Author: Ondrej Zajicek Date: Wed Jul 28 11:45:35 2010 +0200 Use link-local addresses in recursive next hops for IPv6 BGP. commit c477f48916d74c2db6156145851f9536ae0a0a6c Author: Ondrej Zajicek Date: Tue Jul 27 18:20:12 2010 +0200 Hostcache should use trie to filter relevant route changes. commit 7f0d245a5e6d2d789e1fce4b5388ea69aba3b428 Author: Ondrej Zajicek Date: Tue Jul 27 17:17:11 2010 +0200 Minor changes in prefix trie. commit f2b76f2c45bb8e7c1f13f6d4924e10f0c6b12778 Author: Ondrej Zajicek Date: Mon Jul 26 16:39:27 2010 +0200 For hostentry cache, replace FIB with a hash table using (IP, dep table) as a key. commit 852b7062e33b9886eb869fac8b9354497c49b126 Author: Ondrej Zajicek Date: Thu Jul 22 15:09:35 2010 +0200 Fixes a buffer overflow in TX code of IPv6 BGP. commit 7873e9828ff7ba7203fd30ffa7d50859d583d4ca Author: Ondrej Zajicek Date: Wed Jul 14 19:03:23 2010 +0200 Fixes the documentation. commit 087cecd0e2db0ec1e630fde67ec560578264bf32 Author: Ondrej Zajicek Date: Tue Jul 13 12:48:23 2010 +0200 Adds some options and documentation related to recursive next hops. commit f038f0a6385d7b81f57254e3c9bf84021a6b040d Author: Ondrej Zajicek Date: Mon Jul 12 21:39:10 2010 +0200 Fixes missing check in reconfiguration. commit 9be9a264137cdd881f339c37d1a1918527924254 Author: Ondrej Zajicek Date: Mon Jul 12 17:39:39 2010 +0200 Implements proper multihop BGP. Also does some incompatible changes to config file syntax, like removing 'via IP' from multihop option. commit cfe34a316e35a209fcd814ccf3523c262e8d4b0a Author: Ondrej Zajicek Date: Mon Jul 5 17:50:19 2010 +0200 Implements hostcache and recursive next hops. Hostcache is a structure for monitoring changes in a routing table that is used for routes with dynamic/recursive next hops. This is needed for proper iBGP next hop handling. commit 824de84d48eff6cbd0c550309fbd0bbf7740cb14 Author: Ondrej Zajicek Date: Wed Jun 2 22:25:39 2010 +0200 Do not start with huge OSPF FIBs. Most OSPF instances don't need 64k FIB fields. This change halves resident memory usage on small OSPF networks. commit acb60628f53ba1fc29d1a554683acdb03f961c6f Author: Ondrej Zajicek Date: Wed Jun 2 22:20:40 2010 +0200 Implements command that shows memory usage. commit 4461b8979143bd13024663622c419646a1db0c85 Author: Ondrej Filip Date: Wed Jun 2 12:11:20 2010 +0200 Minor bug that appears only in debug mode. commit 9ef239946b7298a679a9b155606257738bb52347 Author: Ondrej Zajicek Date: Mon May 31 20:41:40 2010 +0200 NEWS and version update. commit a34b09349e809a6d8f696fb0897c0bfdc3b66159 Author: Ondrej Zajicek Date: Mon May 31 11:35:29 2010 +0200 Disable BGP protocol when cannot open listening socket. commit 9b061f7ea5933f70c200bb3b3a7be5a2e472e805 Author: Ondrej Zajicek Date: Fri May 28 11:16:39 2010 +0200 Minor fixes. commit 691057f03310e712428e19214ae48462d0f258e1 Author: Ondrej Zajicek Date: Wed May 26 16:09:22 2010 +0200 Support loopback/dummy addresses. commit e0a62ad0f8be198bf8afb1f6900f138dfe12d4fb Author: Ondrej Zajicek Date: Wed May 26 12:32:30 2010 +0200 Fixes a bug in duplicit configured stubnets. If there was the same configured stubnet on local and remote router, the remote route always won regardless of its cost. commit 52572e94ec75728c114f47db37aaf220c1af29d6 Author: Ondrej Zajicek Date: Sun May 23 12:34:09 2010 +0200 Check for OSPF seqnum wraparound and handle it. commit ba5c0057ed01fb006b7a6fb1bd8c21f0c9ae12be Author: Ondrej Zajicek Date: Sat May 22 22:47:24 2010 +0200 Extends pair set syntax, matching and deleting against clist. Expressions like (123,*) can be used in pair set literals, clists can be matched against pair sets (community ~ pairset) and pair sets can be used to specify items to delete from clists (community.delete(pairset)). commit 6d04ef8987f6f5483d353d393ef66dae4b887f30 Author: Ondrej Zajicek Date: Fri May 21 16:40:09 2010 +0200 Comment update. commit 87a9abeac976180ade1c7619545e610d743994b5 Author: Ondrej Zajicek Date: Fri May 21 15:17:49 2010 +0200 Fixes interface scan on Linux 2.4.x in IPv6 mode. commit 002b6423188abdd62c5a494069fd299b96863a79 Author: Ondrej Zajicek Date: Fri May 21 11:51:39 2010 +0200 Fixes bug on Linux 2.4.x - kernel sync does not work until restart of kernel protocol. Which was, actually, a bug in timers - on older kernel, monotonic timer is missing and the other implementation started with now == 0, which collides with usage 0 as a special value in timer->expires field. commit c1cefd7bea79201c58c7c0fa8e192be3cc5ed771 Author: Ondrej Zajicek Date: Sun May 16 11:03:59 2010 +0200 Do not remove old static route if it is in new config with different gw. commit 7ff5803becec14da870d3997d78e3963fa5ec6e6 Author: Ondrej Zajicek Date: Sun May 16 10:27:20 2010 +0200 Do not originate summary or external LSA if it already here and not changed. commit 475977242ac5bb9ff8826c2dd8c9a1a180320de2 Author: Ondrej Zajicek Date: Fri May 14 16:54:39 2010 +0200 Handle EPIPE as a common connection close event. commit 0267f49fb2e44525aa2777bcb9900c4bb2db41e1 Author: Ondrej Zajicek Date: Fri May 14 15:24:53 2010 +0200 Do not add community if it is already in clist. commit ee7408c2be2cd514ba6eefc5589e57a6056198dc Author: Ondrej Zajicek Date: Fri May 7 15:54:27 2010 +0200 Fixes a bug in LSA flooding. LSAs are sometimes prematurely removed from LS retransmission lists. commit 54818e9beb6bfcbcb5dcc2b175dca9d174012e6c Author: Ondrej Zajicek Date: Mon May 3 00:10:48 2010 +0200 A minor bugfix in OSPF ext-LSA processing. commit 506fa1a73eab0c6426f68cd7784c6712898b88f3 Author: Ondrej Zajicek Date: Sun May 2 22:41:40 2010 +0200 Merge several fixes suggested by Joakim Tjernlund. commit 6384c7d7aa85d1e593eca30cda48f6677b023cb0 Author: Ondrej Zajicek Date: Sun May 2 19:58:34 2010 +0200 OSPF: most of summary LSA orig./flush logic rewritten. Fixes many bugs in the old code and makes it much cleaner. commit ba321706578de8402d50214a9e79a65835cdd821 Author: Ondrej Zajicek Date: Wed Apr 28 00:39:57 2010 +0200 Better support for /31 networks. commit 48b0814ace2d05f9fef093d9f309bfa186a6f365 Author: Ondrej Zajicek Date: Tue Apr 27 18:29:01 2010 +0200 A fix in OSPFv3 next_hop calculation. commit 96599c957baa9c82bde91d610ce4f519aead05e9 Merge: ba13017 9d1ee13 Author: Ondrej Filip Date: Tue Apr 27 11:28:44 2010 +0200 Merge branch 'master' of ssh://git.nic.cz/projects/bird/GIT/bird commit ba130172549ef2313f713e048083432f74e7d03d Author: Ondrej Filip Date: Tue Apr 27 11:27:54 2010 +0200 Avoid warning if not compiled with pipes. commit 9d1ee1388771a3caa6c23163571a80457adfab2c Author: Ondrej Zajicek Date: Mon Apr 26 19:08:57 2010 +0200 Neighbors on OSPF broadcast networks should be identified by IP address, not RID. Allows simple support for multiple interfaces to the same network. commit 4e5fb4b60c59db3248fd12db2bc6f0424d798122 Author: Ondrej Zajicek Date: Sun Apr 25 20:12:34 2010 +0200 Skip LSA host<->network endianity conversions on big endians. commit c1b51598d49ff737b926bd8ad2e308a5a15ce3a2 Author: Ondrej Zajicek Date: Sun Apr 25 19:13:49 2010 +0200 Implements changes in checksum alg suggested by Joakim Tjernlund. commit 0ea8fb4abe5acad0b8f470bbdc5cc929b6a58ced Author: Ondrej Zajicek Date: Sat Apr 24 15:18:21 2010 +0200 Fixes and enhancements in 'show ospf state' command. Now it shows a distance, option to change showing reachable/all network nodes and better handling of AS-external LSAs in multiple areas. The command 'show ospf topology' was changed to not show stubnets in both OSPFv2 and OSPFv3 (previously it displayed stubnets in OSPFv2). commit 1d44ddf20f3ecef864d4bd20355251839fcd10ee Merge: 3b89a23 6bc414d Author: Ondrej Zajicek Date: Wed Apr 21 21:52:10 2010 +0200 Merge commit 'origin/master' into new commit 3b89a2327ba385abf2a8321a5a900faba3765612 Author: Ondrej Zajicek Date: Wed Apr 21 21:50:38 2010 +0200 Fixes several problems in OSPF vlink implementation. commit 6bc414d619e1d8710990e89e5085d18e2d5c544c Author: Ondrej Filip Date: Mon Apr 19 16:10:20 2010 +0200 It seems that prefixes /31 and /127 are valid and used in this strange world. commit 607d991424006c083be63878b6a606e76679e1ce Author: Ondrej Zajicek Date: Wed Apr 14 15:35:08 2010 +0200 Fixes build on newer Linux systems. commit dcc6049444f5e12e0d0fcc4cfbb244c08b4c20b0 Author: Ondrej Zajicek Date: Wed Apr 14 14:46:21 2010 +0200 Fixes IPv6 build on older systems. commit 6e8067609673afef9eb9e786f4e43a73a3b544f0 Author: Ondrej Zajicek Date: Sun Apr 11 12:22:47 2010 +0200 Fixes next hop calculation on NBMA and parallel PTP links. commit 7969ea3b41db05294c78a5e0ec0bd3c29ae8c549 Author: Ondrej Zajicek Date: Sun Apr 11 10:19:54 2010 +0200 Fixes a bug in OSPF on NBMA interfaces. A very tricky bug. OSPF on NBMA interfaces probably never really worked. When a packet was sent to multiple destinations, the checksum was calculated multiple times from a packet with already filled checksum field (from previous calculation). Therefore, many packets were sent with an invalid checksum. commit d759c1a6f834cd8a8a7c264d159b9ceb246aec2a Author: Ondrej Zajicek Date: Fri Apr 9 17:42:39 2010 +0200 NEWS and version update. commit de14a7c7aa9225cbc9f837fac9e332a99a99ed69 Author: Ondrej Zajicek Date: Fri Apr 9 00:56:47 2010 +0200 Ignore routes with next-hop 127.0.0.1 on BSD. commit a9f380fe83187a95ead715e516696024e73f3fb7 Author: Ondrej Zajicek Date: Thu Apr 8 18:41:17 2010 +0200 On BSD, consider unmarked non-device routes as alien. commit 6b5a8649a48d7616efbc798095eee2c10563b4e6 Author: Ondrej Zajicek Date: Thu Apr 8 17:56:56 2010 +0200 Do not export empty community list attribute in BGP. commit 0277cc0baf1439a779f4c3ed8b2a77f29f5cfed7 Author: Ondrej Zajicek Date: Thu Apr 8 17:47:14 2010 +0200 Revert "Fixes behavior of defined() on bgp_community attribute." This reverts commit 74e9331fe0892c4c96b4c4d7db3f14bb7e9d928e. commit 646b24d93249199ee59fdecd685532212b506bda Author: Ondrej Zajicek Date: Wed Apr 7 23:15:56 2010 +0200 Minor changes. commit 44d4ab7a960cf143c43d1645f2985cc9d74e3077 Author: Ondrej Zajicek Date: Wed Apr 7 11:00:36 2010 +0200 Configurable syslog name. Also fixes a bug in syslog initialization. commit b8113a5e92cb19a0910041d5708f4eafeb713b54 Author: Ondrej Zajicek Date: Wed Apr 7 00:19:23 2010 +0200 Implements BGP 'show protocols' info details. commit c429d4a4ba2cc8778634461e8adea33e0f0ae022 Author: Ondrej Zajicek Date: Sun Apr 4 15:41:31 2010 +0200 Restrict export of device routes to the kernel protocol. In usual configuration, such export is already restricted with the aid of the direct protocol but there are some races that can circumvent it. This makes it harder to break kernel device routes. Also adds an option to disable this restriction. commit d2d2b5d2ae43f608d03304d280367b658650138b Author: Ondrej Zajicek Date: Sat Apr 3 12:03:52 2010 +0200 Ignore some kernel messages. commit 44aa101cd0716daf1b9f0d9ca5ec1814386c1e0d Author: Ondrej Zajicek Date: Sat Apr 3 11:42:18 2010 +0200 Fixes related to routes with link-local gw on BSD. commit 46a82e9c2c04c432775c7db5ab5d5cc0301b2a94 Author: Ondrej Zajicek Date: Sat Apr 3 10:45:21 2010 +0200 Fixes missing header. commit e60d55becdd9b2eeb36ac16daedae2ab54d05b0c Author: Ondrej Zajicek Date: Fri Apr 2 19:03:18 2010 +0200 Fixes OSPFv3 route generation for local stub networks. commit e7b09e4ab99fc850480480bbb577ffa36a6c5cd7 Author: Ondrej Zajicek Date: Fri Apr 2 16:11:46 2010 +0200 Use SO_BINDTODEVICE also in Linux/IPv6. commit 97ab4c34986139b2419c563a3de7ddfe41727d07 Author: Ondrej Zajicek Date: Fri Apr 2 11:36:38 2010 +0200 Fixes link-local addresses on BSD. commit bed417288e989c48a1362bb1177f436a2e2f9f4f Author: Ondrej Zajicek Date: Fri Apr 2 11:31:20 2010 +0200 Minor fixes to previous patches. commit 126683feeda03ffb5a4ce23611e59a4598382d49 Author: Ondrej Zajicek Date: Mon Mar 29 19:29:03 2010 +0200 Filter language updates; new route attributes and datatype. - Adds bgp_originator_id and bgp_cluster_list route attributes. - Adds dotted quad filter datatype (for router IDs, used by bgp_originator_id and ospf_router_id route attributes). - Fixes pair ~ pair set matching. - Documentation updates. commit eb0f129fcedcecbee85403095abad8f59b82683c Merge: b1c030b 48cff37 Author: Ondrej Zajicek Date: Fri Mar 26 18:53:31 2010 +0100 Merge branch 'socket2' into new commit 48cff379a718998cd984d60fb6f8b48cb961c0f1 Author: Ondrej Zajicek Date: Fri Mar 26 16:21:29 2010 +0100 Added some comments. commit af157fa3dbe2bba0674eb7634efd3ade6c89d604 Author: Ondrej Zajicek Date: Fri Mar 26 14:48:01 2010 +0100 Disable multiple OSPF pseudointerfaces on BSD. commit b1c030b0ba59eed6da5271ed592d6b93ed088518 Author: Ondrej Zajicek Date: Wed Mar 24 16:39:18 2010 +0100 Adds autoconf test for -Wno-pointer-sign compliler option. commit 4d9a0d1f02134235bf686caf49af44232590c456 Author: Ondrej Zajicek Date: Wed Mar 24 10:39:14 2010 +0100 Update lastmod in 'ignored' case only for RIP routes. commit 885b3d6127ae2c5c4f17d9dba95ffe67bdf7a688 Author: Ondrej Zajicek Date: Fri Mar 19 19:23:34 2010 +0100 Fixes LLS compatibility. commit 5d53b80770b4927b5a8205ee0e57f80454b0abf5 Author: Ondrej Zajicek Date: Fri Mar 19 18:46:56 2010 +0100 Allow iface pattern matching code to match peer address on ptp links. commit aa4612480424ad2fede0cd4ae4c7a893f61c6c0f Author: Ondrej Zajicek Date: Fri Mar 19 09:41:18 2010 +0100 Clear local variables in filters and functions. Fixes crash when used uninitialized variables. This problem was surprisingly tricky to fix. commit 74e9331fe0892c4c96b4c4d7db3f14bb7e9d928e Author: Ondrej Zajicek Date: Thu Mar 18 00:10:35 2010 +0100 Fixes behavior of defined() on bgp_community attribute. commit 1528d30aebc462a13861d7cdb827e74556f3aa91 Author: Ondrej Zajicek Date: Wed Mar 17 23:17:55 2010 +0100 Fixes unterminated string for atomic_aggr attribute formatting. commit 97e46d28fff1aa27d7d15e113cc3a52ae20934c7 Author: Ondrej Zajicek Date: Wed Mar 17 12:19:22 2010 +0100 Adds check for no protocol and some minor CLI fixes. - Adds check to deny config file with no specified protocol to prevent loading of empty config file. - Moves CLI init before config parse to receive immediate error message when cannot open control socket. - Fixes socket name path check and other error handling in CLI init. commit 4e3bfd9006ba3033a814a392f9bf4bbca060c8a9 Merge: e8da1bd cda2dfb Author: Ondrej Zajicek Date: Mon Mar 15 00:39:45 2010 +0100 Merge commit 'origin/master' into new commit e8da1bd0b5f83991d37bc7e8364101c3faa78b3b Author: Ondrej Zajicek Date: Mon Mar 15 00:34:44 2010 +0100 Fixes missing cases in filters. commit 0aad2b9292f8e5ff32d048378faf80d2d0bfbb80 Author: Ondrej Zajicek Date: Sun Mar 14 16:36:59 2010 +0100 Temporary OSPF commit - sockets. commit 54305181f6ee3af57dd3d15d53ea2e851b36ed23 Merge: e7b76b9 afa9f66 Author: Ondrej Zajicek Date: Thu Mar 11 18:55:59 2010 +0100 Merge branch 'new' into socket2 commit e7b76b976084006e430543f4b872f624326dbfe6 Author: Ondrej Zajicek Date: Thu Mar 11 18:07:24 2010 +0100 Temoporary OSPF commit - socket changes. commit afa9f66c27e2f96b92059131def53cc7b2497705 Author: Ondrej Zajicek Date: Wed Mar 10 01:04:09 2010 +0100 Adds support for PTP links on BSD. commit cda2dfb7a9e03543eaf407ee26e5046fc589ef29 Author: Ondrej Filip Date: Mon Mar 8 00:05:37 2010 +0100 Arnold from DE-CIX suggested to have this formulation more precise. commit 53434e44a95fe9334f4bdf5e0da987929addffb1 Author: Ondrej Zajicek Date: Sat Feb 27 16:00:07 2010 +0100 Better flushing of interfaces. When device protocol goes down, interfaces should be flushed asynchronously (in the same way like routes from protocols are flushed), when protocol goes to DOWN/HUNGRY. This fixes the problem with static routes staying in kernel routing table after BIRD shutdown. commit 3075824dbd4bb654e98614dfd9992ceec0428beb Author: Ondrej Zajicek Date: Fri Feb 26 14:09:24 2010 +0100 Comparing cluster list length should be later in bgp_rte_better(). commit 212ff335828fbe28311fcbae6154cf2495a44d0e Author: Ondrej Zajicek Date: Fri Feb 26 13:55:22 2010 +0100 Fixes signedness in format route attributes. commit ff2857b03db854f99902766ad842aaa5fa29ec3c Author: Ondrej Zajicek Date: Fri Feb 26 10:55:58 2010 +0100 Many changes in (mainly) kernel syncers. - BSD kernel syncer is now self-conscious and can learn alien routes - important bugfix in BSD kernel syncer (crash after protocol restart) - many minor changes and bugfixes in kernel syncers and neighbor cache - direct protocol does not generate host and link local routes - min_scope check is removed, all routes have SCOPE_UNIVERSE by default - also fixes some remaining compiler warnings commit e81b440f6878605edd19ed62441648ac71260881 Author: Ondrej Zajicek Date: Sun Feb 21 14:34:53 2010 +0100 Fix configure to enable warnings and fix most of them. commit 9e43ccf07b96597ef098955a07383d826938cd2d Merge: e285bd2 89534cd Author: Ondrej Zajicek Date: Sun Feb 21 10:15:49 2010 +0100 Merge commit 'origin/master' into new commit e285bd236e9cd42e3f92db3a35b5ec2d307c7a48 Author: Ondrej Zajicek Date: Sun Feb 21 10:14:41 2010 +0100 Fixes installation (missing /usr/local/var/run). commit e0a45fb42163a6bfdeeee44bd0a6a7461552e10f Author: Ondrej Zajicek Date: Sun Feb 21 09:57:26 2010 +0100 Restricted read-only CLI. Also adds support for executing commands using birdc . commit 89534cdae500cc82d9081088be90013e4121542d Author: Ondrej Filip Date: Sat Feb 20 21:14:02 2010 +0100 'rr client id' is not expression but ID (like router id). commit a68066538fde600941ea43c40d777e14cfac0ee7 Author: Ondrej Filip Date: Sat Feb 20 21:09:40 2010 +0100 Minor typos in configuration example. commit e304fd4bcf5813b581a39078a25a5cf6916b9f29 Author: Ondrej Zajicek Date: Sat Feb 20 00:03:31 2010 +0100 Implements pattern match for 'show protocols' command. And generally consolidates protocol commands. commit dfd48621d1a54f2beb461fe3847fc4b2a535675e Author: Ondrej Zajicek Date: Wed Feb 17 21:53:07 2010 +0100 Replaces the algorithm for building balanced trees. Changes the time complexity of the algorithm from O(n^2) to O(n*log(n)). This speeds up loading of huge DEC-IX config from 128 s to 15 s. It also makes the code significantly simpler. commit 14f6aca48037a0653e6bcfa27a4da48e8f962198 Author: Ondrej Zajicek Date: Wed Feb 17 11:29:48 2010 +0100 Changes right recursion to left in the grammar of the case expression. commit dca75fd7c207f0bfc627cb6b74a484da3b27e05f Author: Ondrej Zajicek Date: Sat Feb 13 12:26:26 2010 +0100 Removes phantom protocol from the pipe design. It seems that by adding one pipe-specific exception to route announcement code and by adding one argument to rt_notify() callback i could completely eliminate the need for the phantom protocol instance and therefore make the code more straightforward. It will also fix some minor bugs (like ignoring debug flag changes from the command line). commit 9db74169be76f658df2207d1ec99eac48fa36f5f Author: Ondrej Zajicek Date: Sat Feb 13 10:44:46 2010 +0100 Fixes protocol statistics for pipes. commit c83876265eeae3591bfe90375503728e633cb807 Author: Ondrej Zajicek Date: Thu Feb 11 22:27:06 2010 +0100 Fixes a tricky bug in the pipe protocol. When uncofiguring the pipe and the peer table, the peer table was unlocked when pipe protocol state changed to down/flushing and not to down/hungry. This leads to the removal of the peer table before the routes from the pipe were flushed. The fix leads to adding some pipe-specific hacks to the nest, but this seems inevitable. commit a2ea1bac601ca79946e2a215dac9427c526cedab Author: Ondrej Zajicek Date: Thu Feb 11 21:19:20 2010 +0100 Moves errno.h include. commit 2af25a971a28ccac05d2385669e8b103c0328f7d Author: Ondrej Zajicek Date: Thu Feb 11 11:12:58 2010 +0100 Fixes a crash caused by missing error hook on BGP listening socket. Error happened when too many BGP connections arrived in one moment (ECONNABORTED). commit 353729f513aa6a1f9e7f66083a0f9d2117fe2be5 Author: Ondrej Zajicek Date: Thu Feb 11 10:23:35 2010 +0100 Temporary OSPF commit - socket changes. commit fa5a99c766dde2a4ac3d44596ff5396a0efd1cc8 Author: Ondrej Filip Date: Wed Feb 10 23:09:23 2010 +0100 NEWS version update. commit 75f8861898d53f43cb23dbba9c776bce223c18c8 Author: Ondrej Zajicek Date: Wed Feb 10 16:18:17 2010 +0100 NEWS and version update. commit fae9be7782a161bdf93c83884d62941a34cbe518 Merge: 7d19666 0efd646 Author: Ondrej Zajicek Date: Wed Feb 10 14:59:26 2010 +0100 Merge commit 'origin/master' into new commit 7d1966689f3f748d8bfa36eef64ced6a750ecb47 Author: Ondrej Zajicek Date: Wed Feb 10 14:57:16 2010 +0100 RTF_CLONING is removed in FreeBSD 8. commit 0efd646278987df023586d85817a848c2bb39a1d Author: Ondrej Filip Date: Wed Feb 10 12:30:14 2010 +0100 Define symbols as text between ''. commit c27b2449d1f57e780974ed13fbd572a48e2a3602 Author: Ondrej Zajicek Date: Mon Feb 8 16:01:03 2010 +0100 Shows source (Router ID) for OSPF routes and adds such attribute. A sad thing is that we does not have a 'router_id' filter type, so it must be given as decimal number in filters. commit 5a56f27cd00c2cad661aed9b54696699e800883c Author: Ondrej Zajicek Date: Mon Feb 8 12:42:09 2010 +0100 Adds asterisk to the primary route in 'show route' cmd. And also fixes a minor bug. commit aa80826e4af4e6e0a6de5604ab5ce7991f2a8b4e Author: Ondrej Zajicek Date: Sun Feb 7 09:49:34 2010 +0100 Unnumbered OSPF interfaces should be always in the point-to-point mode. commit 76b53a4e207696c535a45f4358a8e047ca936e45 Author: Ondrej Zajicek Date: Sat Feb 6 22:57:51 2010 +0100 Adds some log messages related to configure. Also fixes a bug in the previous patch. commit ebae4770c949de41c64c9efbeaaef44adfb25790 Author: Ondrej Zajicek Date: Sat Feb 6 19:19:09 2010 +0100 Modifies configure to just reload protocols when filters change. Before this change, protocols were restarted in that case. commit c37e78510f2ac4d9bb4c44eddf33352eda72fd0f Author: Ondrej Zajicek Date: Wed Feb 3 00:19:24 2010 +0100 Makes date/time formats configurable. commit 44f26560ec9f108039e6736d6de929f899bf20ea Author: Ondrej Zajicek Date: Tue Feb 2 10:14:21 2010 +0100 Workaround for some broken BGP implementations that skip initial KEEPALIVE. commit 5f47c4c11ed8da3415c4c8c247bf52ab6a48255d Author: Ondrej Zajicek Date: Tue Feb 2 00:03:46 2010 +0100 Changes right-recursion to left-recursion in a filter grammar. Because we don't want to have a limit on a function/filter length. commit 1a7a4e59a22f903a0be791f229e86ab881593851 Merge: 4167702 1960d20 Author: Ondrej Zajicek Date: Thu Jan 28 16:00:16 2010 +0100 Merge commit 'origin/master' into new commit 41677025ee67fcccd34493f9b205037dd68811c9 Author: Ondrej Zajicek Date: Thu Jan 28 15:59:18 2010 +0100 Changes 'ignore communities' to 'interpret communities'. commit 1960d20350c5191b089f0a233d99969a0ff23ef6 Author: Ondrej Filip Date: Wed Jan 27 23:45:36 2010 +0100 Priority for '||' and '&&' fixed. commit 7515dafc006f8b71bc15aa7ed9749c7d4fb00153 Author: Ondrej Filip Date: Wed Jan 27 22:26:45 2010 +0100 Allow multiple || and && statements. commit 6cb8f742f1adf99881334b8ae21c398d98571aa1 Author: Ondrej Zajicek Date: Wed Jan 27 17:22:57 2010 +0100 Better handling of well-known communities. Process well-known communities before the export filter (old behavior is to process these attributes after, which does not allow to send route with such community) and just for routes received from other BGP protocols. Also fixes a bug in next_hop check. commit a3062085827db3115961eacd9d945ac202728174 Author: Ondrej Zajicek Date: Wed Jan 13 14:53:33 2010 +0100 Comment update. commit 974363c172e026b00be5f78ec585dda1e402b6f6 Merge: 99f5fc1 844e0f6 Author: Ondrej Zajicek Date: Fri Jan 8 22:20:09 2010 +0100 Merge commit 'origin/master' into new commit 99f5fc14cd457f71973bc2264566284049ccfb2c Author: Ondrej Zajicek Date: Fri Jan 8 22:19:41 2010 +0100 A partial vlink fix. commit 844e0f65dbab98f71f2a5631277a720613d4d7a5 Merge: 3242ab4 fc33143 Author: Ondrej Filip Date: Fri Jan 8 21:19:03 2010 +0100 Merge branch 'master' of ssh://git.nic.cz/projects/bird/GIT/bird commit 3242ab437f47f34d6734726003d647d0f493a163 Author: Ondrej Filip Date: Fri Jan 8 21:06:06 2010 +0100 Typo in documentation. commit fc33143f02642cc775a704dec37446e0b4343a43 Author: Ondrej Zajicek Date: Fri Jan 8 17:22:51 2010 +0100 A fix for broken multi-area OSPF commit 0741e68750fdda754790b6de7739e06310bdf723 Author: Ondrej Zajicek Date: Fri Jan 8 10:21:51 2010 +0100 Socket table update. commit 538dd2e486c3cc95ffebbdf73c934ddc71d70e09 Author: Ondrej Filip Date: Fri Jan 8 01:14:34 2010 +0100 Cryptographic auth can be used also on virtual links. commit 5f47fd85e341d94e2cbf46801cc14be06fb65dd8 Author: Ondrej Filip Date: Fri Jan 8 01:13:58 2010 +0100 Small typo. commit 6901fd0685f75ad5e95ea252039eec9e8926cd6a Author: Ondrej Filip Date: Thu Jan 7 23:42:11 2010 +0100 More information about vlinks. commit 18722dc98c57af6bfa2d9b967417b65db263e5ca Author: Ondrej Filip Date: Thu Jan 7 23:03:19 2010 +0100 Bugfix in DBG call. commit 3127b81755de4a09475df71072964e292c6994a7 Author: Ondrej Filip Date: Thu Jan 7 22:54:39 2010 +0100 Be a little bit more verbose on virtual links. commit cf0858c2174c6bf0a4f63b914d06a2342c433b09 Author: Ondrej Zajicek Date: Thu Jan 7 22:43:06 2010 +0100 A fix of a previous fix. commit ba39197c11db085c4bc062e45fd9c74f42b41ca0 Author: Ondrej Zajicek Date: Thu Jan 7 22:22:10 2010 +0100 Fixes vlinks for OSPFv2. commit 29bfbae7936beb401d944daf0f0106aa8a92ef50 Author: Ondrej Zajicek Date: Thu Jan 7 16:24:36 2010 +0100 Debugging change leaked to repository. commit 3034b384dd9e6c78e686a294b1f80775fdb3e392 Author: Ondrej Zajicek Date: Thu Jan 7 11:46:11 2010 +0100 A minor fix in OSPF. commit 861f223a531be17d2e3e7abc0246be3057b809a0 Author: Ondrej Zajicek Date: Wed Jan 6 23:20:43 2010 +0100 BSD compatibility fix. commit 0c75411bec2f4e37bfdb4c7162631a22898052c1 Author: Ondrej Zajicek Date: Wed Jan 6 16:57:20 2010 +0100 NEWS, version and documentation update. commit cf31112f0d7618464097f71228f84bd534f1bc0f Author: Ondrej Zajicek Date: Sun Jan 3 12:17:52 2010 +0100 Implements MRTdump feature. commit 610bb3cff05f6d5b09c77724bc97295b809d15e2 Author: Ondrej Zajicek Date: Tue Dec 22 10:49:39 2009 +0100 Show command cleanups. commit 0ad19261bf551ef49a1565e21e384ec749ec16d4 Merge: c4ae538 67b24e7 Author: Ondrej Zajicek Date: Tue Dec 22 01:34:01 2009 +0100 Merge commit 'origin/master' into new commit 67b24e7c1991de345dcb14173943a28d499f6f85 Author: Ondrej Filip Date: Mon Dec 21 16:29:23 2009 +0100 Wrong switch name in configuration example. commit c4ae53858be1bce6798f31ee2fb46775a607085f Author: Ondrej Zajicek Date: Mon Dec 21 11:53:58 2009 +0100 Change default mode of pipes to transparent. Opaque pipes are obsolete and should disappear in the future. commit fbcb7d5faf419057ccbe2340f3714f8885495c51 Author: Ondrej Zajicek Date: Mon Dec 21 11:50:42 2009 +0100 Change default LOCAL_PREF attribute to 100 (suggested value by RFC 4277). commit ba9a122142a3d42137c129fabaef097702d44801 Merge: 0225ea4 c4199e3 Author: Ondrej Zajicek Date: Sun Dec 20 22:57:44 2009 +0100 Merge branch 'ospf3' into new commit c4199e30313c88c0911060a5b5f3cc181ceedb37 Merge: f2d7da7 ea7ada3 Author: Ondrej Zajicek Date: Sun Dec 20 22:56:09 2009 +0100 Merge branch 'dev' into ospf3 commit 053dc3d81fe6470966bc35a852e791de0c00ee68 Author: Ondrej 'Feela' Filip Date: Sun Dec 20 16:18:22 2009 +0100 Typo corrected. commit ea7ada3809ed672bd9d2f9e5742f42b238cc5389 Author: Ondrej Zajicek Date: Sun Dec 20 14:59:12 2009 +0100 Fixes a new bug in the pipe protocol soft reconfiguration. Also updates route reload for pipes. commit 1a5178587ff63234d1b323fca965acb4a42cb9e2 Author: Ondrej Zajicek Date: Sun Dec 20 12:13:15 2009 +0100 Fixes unnecessary pipe restart during configure. commit 6877ff73a61d1924bc8940f7b646f52f7b34eca0 Author: Ondrej Zajicek Date: Sat Dec 19 18:45:46 2009 +0100 NEWS and version update. commit 0225ea4eddb44bd9dd4f112e512325cbf80134d3 Merge: 43c1cec f2d7da7 Author: Ondrej Zajicek Date: Tue Dec 15 00:32:13 2009 +0100 Merge branch 'ospf3' into new commit f2d7da742bd683b8eaecb1be8e3b04618171c796 Author: Ondrej Zajicek Date: Tue Dec 15 00:30:07 2009 +0100 Fixes export of routes with link-local gw. commit 43c1ceccb9caf8c4f63f191346c2f33889b4ad22 Author: Ondrej Zajicek Date: Mon Dec 14 23:31:25 2009 +0100 Remove bgp_as4_support variable. commit 13a7395704deeeff2d86910d8bcf9a6f32a7b207 Author: Ondrej Zajicek Date: Mon Dec 14 23:08:48 2009 +0100 Minor doc update. commit f75747073e45c3129568c4936c2f34fa618db41e Author: Ondrej Zajicek Date: Mon Dec 14 21:17:15 2009 +0100 Implements route reload for OSPF. commit 63542845dfb6d2277f93f77ad9ca3ad8bbaddd09 Merge: 34a877c 8a7fb88 Author: Ondrej Zajicek Date: Mon Dec 14 20:37:32 2009 +0100 Merge branch 'dev' into ospf3 Conflicts: proto/ospf/lsreq.c proto/ospf/lsupd.c proto/ospf/rt.c commit 34a877ccac25d38172716d3d2488449c870cad0b Author: Ondrej Zajicek Date: Mon Dec 14 17:29:33 2009 +0100 Minor updates. commit 8a7fb8858fa87bce6f2f15ee2bbb77704b5fff4e Author: Ondrej Zajicek Date: Mon Dec 14 01:32:37 2009 +0100 Finishes 'route reload' feature. commit 28008482a97c0ac70e648759fe37bad0633ed9f7 Author: Ondrej Zajicek Date: Sat Dec 12 01:35:51 2009 +0100 Minor fixes in OSPF. commit 8a70a13e7e79afa6818b10cf64d4f1ae4cf89e4b Author: Ondrej Zajicek Date: Fri Dec 11 01:20:53 2009 +0100 Implements protocol-specific Router ID for OSPF. And fixes one minor bug. commit be2d38b7e977c1f72ed9cd52f8e3e85130c0aaa1 Author: Ondrej Zajicek Date: Fri Dec 11 00:31:56 2009 +0100 Temporary OSPFv3 commit. commit 9807690b413f3a1d29d064761cc99ed5261cfb58 Author: Ondrej Zajicek Date: Sun Dec 6 22:05:50 2009 +0100 Fixes link-back check. commit b76aeb823446616b746b52b5c8152f4c5a73b242 Author: Ondrej Zajicek Date: Fri Dec 4 22:20:13 2009 +0100 Fixes next hop handling. commit 98955023926734c7ecf79f9b8d004baff5225a78 Author: Ondrej Zajicek Date: Thu Dec 3 23:20:02 2009 +0100 Fixes OSPFv2 build. commit bb3c7c6d22c48cd78b4c5b77a78ff1b92adca053 Author: Ondrej Zajicek Date: Thu Dec 3 18:56:39 2009 +0100 Fixes some log messages. commit 69fbf9a25190e0149dcc31e830e952c586fe2024 Author: Ondrej Zajicek Date: Thu Dec 3 18:25:14 2009 +0100 Minor fix in LSA update. commit a421ec33cb9029899122d0ab63bab0fa268348d2 Author: Ondrej Zajicek Date: Wed Dec 2 22:22:40 2009 +0100 Fixes silly bug. commit 11361a101517c2c87e3d35d2c63cacb3ddb97724 Author: Ondrej Zajicek Date: Wed Dec 2 22:19:47 2009 +0100 Implements route re-feed. This can be used to re-feed routes to protocol after soft change in export filters. commit 11787b8473ae1685d43dad809592fabc64eb8f46 Author: Ondrej Zajicek Date: Wed Dec 2 17:26:16 2009 +0100 Fixes some problems in pipes. For transparent pipes, loop detection works correctly now. Pipes are now more symmetric - in both directions filtering is done in do_rte_announce(). commit e8b29bdc8dc34d4a0358458907a5d8ac29011d28 Author: Ondrej Zajicek Date: Wed Dec 2 14:33:34 2009 +0100 Fixes one missing log message. commit 4b84bd4554b2a9331055bfd8d02a0bab0d10df92 Author: Ondrej Zajicek Date: Sun Nov 29 10:29:33 2009 +0100 Fixes some crashes in OSPFv2. commit e4a810b0ce3d7904e87a210c44c36eda7cba7a3e Author: Ondrej Zajicek Date: Sun Nov 29 10:09:25 2009 +0100 Temporary commit. commit a6250a7d1013442ad4feb0d67128a707f2c6880b Author: Ondrej Zajicek Date: Thu Nov 26 23:23:29 2009 +0100 Fix -p option. commit bf47fe4b2e40ccfcfe6af2d86548d06cdf9739c5 Author: Ondrej Zajicek Date: Thu Nov 26 20:47:59 2009 +0100 Implements BGP route refresh. commit 5e6f568115511e2bcf43c60dfdcbd7a35cb04b93 Merge: 069bfcb 1f8be1e Author: Ondrej Zajicek Date: Tue Nov 24 17:19:23 2009 +0100 Merge commit 'origin/master' into dev commit 069bfcb53cef012c063a27e5af93d620be2917bd Author: Ondrej Zajicek Date: Tue Nov 24 17:15:20 2009 +0100 Fixes serious bug in core related to route filtering. If protocol announces a route, route is accepted by import filter to routing table, and later it announces replacement of that route that is rejected by import filter, old route remains in routing table. commit 717e4c4d8173a8dbae2956f1703ff6d4365a9d34 Author: Ondrej Zajicek Date: Fri Nov 20 09:29:29 2009 +0100 Fixes in the documentation. commit 1f8be1e46f666e79072cc5f800c2dba91788368b Author: Ondrej Filip Date: Thu Nov 19 23:15:58 2009 +0100 Added word 'IPv6' to underline, that this problem was not IPv4 related. commit 6a72a276f6a677a8adec9566867023d76ac7da7e Author: Ondrej Zajicek Date: Thu Nov 19 12:53:55 2009 +0100 New version. commit a4644ed6ab32c098b755bdac03498634b2794409 Author: Ondrej Zajicek Date: Thu Nov 19 11:44:17 2009 +0100 Implement option to exit after config file parsing. commit 3f9b7bfe9ff050430a5886b22a5ab11b5f253048 Author: Ondrej Zajicek Date: Wed Nov 18 20:32:36 2009 +0100 Implements option that controls IPv6 BGP next hops when lladdr is missing. commit 62aa96caa28180f76c8aff0c49dd21128e396153 Author: Ondrej Zajicek Date: Tue Nov 17 15:50:29 2009 +0100 Adds some documentation to the description option. commit e04555c04545278cfe3aeae85d707b1d78e5abeb Author: Ondrej Zajicek Date: Tue Nov 17 15:45:05 2009 +0100 Implement description field of protocol. commit d0e2d6d1e05455cf1ec4e71135edaa659fe96dac Author: Ondrej Zajicek Date: Tue Nov 17 14:17:23 2009 +0100 Show both IPv6 next hop addresses in BGP. commit 3228c72cc030f409914134440a7e55bbcfc9ff6a Author: Ondrej Zajicek Date: Tue Nov 17 11:41:29 2009 +0100 Implements RFC 5004 - prefer older external routes. commit cbf8b08d622695f360bcdd80d61eb4add967749e Author: Ondrej Zajicek Date: Tue Nov 17 10:31:33 2009 +0100 Temporary OSPFv3 devel commit commit 2eece54a04d95f534b935ccac4c3959b25516bd5 Author: Ondrej Zajicek Date: Sun Nov 15 14:24:20 2009 +0100 Fixes bug related to reconfiguration with bgp_path first/last operators. commit 653b4015f137d9590147f8774ec686031696f81c Author: Ondrej Zajicek Date: Fri Nov 13 14:54:43 2009 +0100 After shutdown, BIRD should have exit code 0. commit d3f36e5978e85a926c497e2aa2cbdf319776ebb5 Author: Ondrej Zajicek Date: Fri Nov 13 14:43:29 2009 +0100 Fixes BIRD socket unlink. commit 4ac7c8341c660db654821ed2dc0273645dc19645 Author: Ondrej Zajicek Date: Mon Nov 9 23:22:53 2009 +0100 Use IPv6 checksums in OSPFv3. commit 3f22fa9e74c8643d3e4f7e3a7b4f2aa992ad09f5 Merge: a6bc04d b7c0e93 Author: Ondrej Zajicek Date: Mon Nov 9 22:54:39 2009 +0100 Merge branch 'dev' into ospf3 commit b7c0e93ebd40cdc4f6e89067a3e5f7293263c7f9 Merge: 7965e17 f1f1e89 Author: Ondrej Zajicek Date: Mon Nov 2 16:27:17 2009 +0100 Merge commit 'origin/master' into dev commit 7965e17d67e8e2e68d96a8471f4828c0dc0d0b21 Author: Ondrej Zajicek Date: Mon Nov 2 16:25:05 2009 +0100 Fixes build in Debian GNU/kFreeBSD. commit f1f1e899b708e0e2ebaba46444fad650648ccb93 Author: Ondrej 'Feela' Filip Date: Mon Nov 2 15:59:01 2009 +0100 Version 1.1.5 commit a6bc04d59130c49a1dbfadffa4285b11e2ff4939 Author: Ondrej Zajicek Date: Thu Oct 29 23:57:42 2009 +0100 Implements better checks on incoming packets and LSAs in OSPF. commit 9d4d38d1a5d67f5485d2b2fa439c879583dfdcb0 Author: Ondrej Zajicek Date: Wed Oct 28 22:39:24 2009 +0100 Fixes some problems related to link-local routes in KRT interface. commit b5332824ea4108d62cb559205391fd2c530348e4 Author: Ondrej Zajicek Date: Wed Oct 28 20:33:08 2009 +0100 New version. commit e6ff7a08e4e7808e1175c3c3bc830d93c0454b19 Author: Ondrej Zajicek Date: Tue Oct 27 22:25:36 2009 +0100 Replaces local endianity testing macro with the common one. That makes it easier to integrate BIRD to crosscompiling buildsystems. commit 9727681a38d3a7c474892e167c0e5a4e0cfac844 Author: Ondrej Zajicek Date: Sun Oct 25 20:02:28 2009 +0100 Implements proper handling of summary/external LSA IDs. commit bff74c7aa3ce4d407cb18b48c9df7b670c3c7a3d Author: Ondrej Zajicek Date: Tue Oct 20 19:04:28 2009 +0200 Allows importing 'onlink' routes. commit 988992446d3aaaef9c19902d94cd1908a963fd80 Author: Ondrej Zajicek Date: Thu Oct 15 11:57:25 2009 +0200 Implement command to show LSA db. commit b66abe8ef986698caccd08b38a991330f0791075 Author: Ondrej Zajicek Date: Thu Oct 15 00:28:04 2009 +0200 Reimplements 'show ospf state' for OSPFv3 and fixes some bugs. commit 4cdd078453d585ac97a183ea1f3951d85f1b8784 Author: Ondrej Zajicek Date: Mon Oct 12 23:31:42 2009 +0200 Implements protocol-specific router id and updates documentation. commit 52b9b2a1786140c38af03de570b0cc96c835c1d3 Author: Ondrej Zajicek Date: Mon Oct 12 20:44:58 2009 +0200 Rename as_path_get_last/as_path_get_first to be consistent. commit ea89da381fc682155e7d08d6ad3d4ac8aa5fe115 Author: Ondrej Zajicek Date: Sun Oct 11 18:56:16 2009 +0200 Workaround for stupid callback scheduler. There is no reak callback scheduler and previous behavior causes bad things during hard congestion (like BGP hold timeouts). Smart callback scheduler is still missing, but main loop was changed such that it first processes all tx callbacks (which are fast enough) (but max 4* per socket) + rx callbacks for CLI, and in the second phase it processes one rx callback per socket up to four sockets (as rx callback can be slow when there are too many protocols, because route redistribution is done synchronously inside rx callback). If there is event callback ready, second phase is skipped in 90% of iterations (to speed up CLI during congestion). commit 7ea5b00f42bd3d1fdafb0be349e3ebbcdf3ea466 Author: Ondrej Zajicek Date: Thu Oct 8 15:23:24 2009 +0100 First and last accessors to as_paths. commit d82fc18d75e4ebf615657cb5d98f000c728b13e4 Author: Ondrej Zajicek Date: Wed Oct 7 21:10:29 2009 +0100 Implement proper LSA ID generation. commit 43c7a1ffa07dda2a9f37c046e1cd9a75242db2b7 Author: Ondrej Zajicek Date: Wed Sep 30 18:48:38 2009 +0200 New version. commit aa7088fe2646e53b5168f7ea4e5bd098f891951c Author: Ondrej Zajicek Date: Wed Sep 30 16:34:47 2009 +0200 Fixes one previous commit. commit a5bf5f781cf921bd1e092b7f9ae6ccdbf7424428 Author: Ondrej Zajicek Date: Thu Sep 24 23:14:44 2009 +0200 Show bad peer AS number in log in decimal. commit be6e39ebbf7ed107abde6fc1a18e8827ca47a7c1 Author: Ondrej Zajicek Date: Thu Sep 24 22:12:11 2009 +0200 Passive option. commit 2d507e64b7d7029906aac30dbea317795b5339de Author: Ondrej Zajicek Date: Thu Sep 24 19:08:14 2009 +0200 Do not allow gateway routes with NULL iface. commit 54fe0d9230be440d9f627ff7f94a202e6117e1b9 Author: Ondrej Zajicek Date: Fri Sep 18 13:59:04 2009 +0200 Fixes setting of IP addresses to route attributes (NEXT_HOP). commit db96fccb31bc0436ec182ff825f592d6c16dc930 Author: Ondrej Zajicek Date: Fri Sep 18 01:11:09 2009 +0200 Fixes bug in filter rta copy-on-write. Filters should try to copy-on-write just cached rtas. commit 46eb80d5d50a2b284cae19444149d57d857a8e02 Author: Ondrej Zajicek Date: Thu Sep 17 17:52:36 2009 +0200 Fixes headers for uintptr_t (and build on NetBSD). commit f4c6ca8c9c7ca7c0d481e6059396beed6adc768d Author: Ondrej Zajicek Date: Thu Sep 17 13:35:37 2009 +0200 Fixes preference bounds. commit 0781e9c62cd34175eb4e3bc61ffe785d08538727 Author: Ondrej Zajicek Date: Thu Sep 17 12:40:02 2009 +0200 Fixes preference in transparent pipes. commit 9f0ba7b1c7a0754c473b8ab202f572c9c8363285 Author: Ondrej Zajicek Date: Thu Sep 17 12:18:03 2009 +0200 Implements proper RID handling in OSPFv3. commit 5eb4d0180ed92cee31d962fbc4d0175a7e1d5933 Author: Ondrej Filip Date: Fri Sep 11 12:20:30 2009 +0200 New release 1.1.3 commit c15e569065e80f91b4c9c77b86640aac72aa0a47 Author: Ondrej Zajicek Date: Tue Sep 8 17:06:47 2009 +0200 Make endianity swapping simpler. commit be862406627da3bd1facea9309b3f32e67422eab Author: Ondrej Zajicek Date: Tue Sep 8 13:45:02 2009 +0200 Temporary OSPFv3 development commit. Finally, it is working. commit 29bcd04e75a4d145bee500b8aef79052974b1981 Author: Ondrej Filip Date: Sun Sep 6 21:26:46 2009 +0200 Update of config.sub & config.guess commit daeeb8e982a3463f4a866e805b64f214d9f44160 Author: Ondrej Zajicek Date: Fri Sep 4 11:24:08 2009 +0200 Clear memory allocated by ralloc(). This also fixes bug that timer->recurrent was not cleared in tm_new() and unexpected recurrence of startup timer in BGP confused state machine and caused crash. commit f9c799a00e705b1420b214628c2bb2a30bf491d9 Author: Ondrej Zajicek Date: Fri Sep 4 11:06:51 2009 +0200 Temporary OSPFv3 development commit (changing multicast support). commit d2ceaf4ec82837239a35ace00399ce3aa845849e Author: Ondrej Zajicek Date: Fri Aug 28 13:45:43 2009 +0200 Temporary OSPFv3 development commit commit 05198c12f48c9d4a65ee6d1d4117bd8067a71131 Author: Ondrej Zajicek Date: Thu Aug 27 19:01:04 2009 +0200 Some cleanups. commit 061ab802a67cfc336785f6daeecdcbd4910734ed Author: Ondrej Zajicek Date: Thu Aug 27 18:25:46 2009 +0200 Temporary OSPFv3 development commit commit 949bd34e81ee99370decdabefa51c9c11ffe915b Author: Ondrej Zajicek Date: Tue Aug 25 19:01:37 2009 +0200 Fixes bug related to AS2->AS4 conversion. commit b49e6f5a65d437cb7e7bdefe8397e0f550496012 Author: Ondrej Zajicek Date: Tue Aug 25 16:42:14 2009 +0200 Temporary OSPFv3 development commit commit a0c405501fa6a0df8472f1598256e725cec753fd Author: Ondrej Filip Date: Sun Aug 23 23:04:59 2009 +0200 Version 1.1.2 commit d2f8d0a509d96d752c86f8807e7f6644467e5af5 Author: Ondrej Filip Date: Sun Aug 23 23:03:31 2009 +0200 Version 1.1.2 commit 2ef58837dcb7b78edc193bc9ef1da316bba86998 Merge: 86975e5 5516a66 Author: Ondrej Zajicek Date: Fri Aug 21 09:46:49 2009 +0200 Merge commit 'origin/master' into dev commit 86975e584eeabbc4f3111f2d100f05ca00579d31 Author: Ondrej Zajicek Date: Fri Aug 21 09:43:31 2009 +0200 Allow more kernel routing tables in IPv6. commit fee78355b480294f28c3c6814953297dca92d4a0 Author: Ondrej Zajicek Date: Fri Aug 21 09:31:35 2009 +0200 Fixes bug in eattr binary search. commit c3226991a061415fa83b757cbff678111c586e58 Author: Ondrej Zajicek Date: Fri Aug 21 09:27:52 2009 +0200 Temporary OSPFv3 development commit commit 5516a66d492497ba8776212defb3117ed1dbfbf8 Author: Ondrej Filip Date: Sun Aug 16 22:41:07 2009 +0200 Ondrej Zajicek add to the team. commit 87d7fd9725ded186f6fa331d68a1e9df5d1982cf Author: Ondrej Filip Date: Sun Aug 16 22:36:41 2009 +0200 Bugfix - each protocol can be compiled separately. commit c5be5a163c2a7b640cb3d0942de44ec87de0f25b Author: Ondrej Zajicek Date: Wed Aug 12 10:26:42 2009 +0200 NEWS and version update. commit 9c46ad8e2fba592d28d19757d39bc090fc5b0d47 Author: Ondrej Zajicek Date: Wed Aug 12 10:16:32 2009 +0200 Count number of lines (and not messages) in 'more'. commit c0973621bc1e06cb6176dc2dfd97bec637861edd Author: Ondrej Zajicek Date: Tue Aug 11 15:49:56 2009 +0200 Fixes another bug in rte_recalculate(). Previous bugfix revealed another hidden bug here. commit ac07aacd2cdb5cf69a3bfdbc0e078cb0ae96c0db Author: Ondrej Zajicek Date: Tue Aug 11 11:03:37 2009 +0200 Replace assert with log. Although it is true unless there is a bug in BIRD, this assert is not needed (code below does not require that assumption), so we should not crash. commit 024e633c16cf21ae94d7e023e057e59080f92175 Author: Ondrej Zajicek Date: Tue Aug 11 10:54:50 2009 +0200 Fixes bug that caused losing of some routes. When update changes preferred route in such a way that it ceased to be preferred, the new route was linked to wrong place and lost. commit e75d3c74a8f665a6e7dc0cc743a68e980e7c10da Author: Ondrej Zajicek Date: Mon Aug 10 14:36:30 2009 +0200 Flex does not need the output of Bison. commit ea9097eaad7dfccd5a88480d748781d947b25cc8 Author: Ondrej Zajicek Date: Mon Aug 10 14:13:28 2009 +0200 Fixes parallel runs of Bison. Previous version of Makefile executed Bison two times (in parallel), because of two specified targets. I am not sure wheter this is the best fix. Previon commit f2cfc509960741bd587cf92f7d154d06fbb2c9a4 Author: Ondrej Zajicek Date: Mon Aug 10 13:59:56 2009 +0200 Compilation and dependency generation should be serialized. commit 581b59907ca5b79b44cc0654e57c34ab77883a96 Author: Ondrej Zajicek Date: Mon Aug 10 13:57:08 2009 +0200 Clean files generated by Bison and Flex. commit 5b1f877e6edfb3b541d444ae5b1ffd025dd9fbd6 Author: Ondrej Zajicek Date: Mon Aug 10 12:04:25 2009 +0200 Fixes typo in Makefile commit b92c8e30191dd757c76239076eda82d0065f2348 Merge: 54d70d3 71a9574 Author: Ondrej Zajicek Date: Mon Aug 10 10:16:00 2009 +0200 Merge branch 'master' into dev commit 71a9574a515613cded23b20f260a88784bcd4286 Author: Ondrej Filip Date: Sun Aug 9 19:43:42 2009 +0200 Makefile changed to make it work with 'make -jN' where N>1 commit 0ac39033c7470f7301bb108f8e777c7ce6af273f Author: Ondrej Filip Date: Sun Aug 9 19:43:15 2009 +0200 Missing dependency added. commit 0d328932be54a6756c6b43b0cd6d8d314a5b7fe2 Author: Ondrej Filip Date: Thu Jul 30 18:39:41 2009 +0200 Symbols PASSWORDS and BROADCAST not declared for OSPF commit 54d70d3ebb20c36f483cde9d7d5b877772d4884e Author: Ondrej Zajicek Date: Thu Jul 23 22:21:17 2009 +0200 Fixes compiler warning in OFFSETOF(). commit 3aab39f589c352e30e9db92346b579dd561482b3 Author: Ondrej Zajicek Date: Thu Jul 23 16:51:28 2009 +0200 Use %R in OSPF when appropriate. commit 2f6483cd312ffd7ef055099ce801fb8f437d9abe Author: Ondrej Zajicek Date: Thu Jul 23 16:06:25 2009 +0200 Adds %R printf directive for Router ID. commit f0333f44a5a4bec9f3978a90cf7eda1b0a2ec151 Author: Ondrej Zajicek Date: Wed Jul 15 01:47:29 2009 +0200 Implements 'more' feature to birdc. Also does some code restructuring. commit 6baef17ecf1ed994cfc8038bc610e8b7ff88506a Author: Ondrej Zajicek Date: Tue Jul 14 14:18:54 2009 +0200 Fixes bug in CLI TX buffer management. commit 70670bf317a612a1700ffbd0dbc8d92614e0caf2 Author: Ondrej Zajicek Date: Thu Jul 9 15:42:39 2009 +0200 Fixed bug related to reconfiguration of BGP with MD5 passwords. commit dd7b4a13848f5a92b403a563e8e27a3cbdfc937f Merge: d1abbea bffd4c0 Author: Ondrej Zajicek Date: Mon Jul 6 23:10:33 2009 +0200 Merge branch 'master' into dev commit d1abbeacfb5a099418f53b583625ac97b1c62059 Author: Ondrej Zajicek Date: Mon Jul 6 19:07:01 2009 +0200 Fixes memory alignment problems on Sparc64. Not quite standard construction, i should add some autoconf macro. Not tested yet. commit 2389c46fe314867f99bbdfa1f6c9ff92d433d754 Author: Ondrej Zajicek Date: Sun Jul 5 21:18:55 2009 +0200 Another pile of ipa_from_u32() calls. commit b082c1bfcc53b10012a427aa3b4b8281fe2f496c Author: Ondrej Zajicek Date: Sun Jul 5 20:26:51 2009 +0200 Fixes OSPF on big-endians. Hmm, #ifdef is not very typo-safe. commit f9bdcad4694cf80690982dfc58d28f91216c8bd0 Author: Ondrej Zajicek Date: Sun Jul 5 19:01:54 2009 +0200 Fixes type mismatch in OSPF printf statements. Mixing ip_addr and u32 does bad things on Ultrasparc. Although both have the same size. Fascinating. It was not catched by compiler because of varargs. commit bffd4c0b3900b28cfa84131752d44277866cb413 Author: Ondrej Filip Date: Sun Jun 28 10:03:24 2009 +0200 Small typos. commit f1684ae6c05a52e1757c709dfbbedb5fc8ae1e07 Author: Ondrej Filip Date: Sun Jun 28 09:43:29 2009 +0200 New release 1.1.0! commit ef86b8465ff7d8e81038f37103594eb9c66d9c58 Author: Ondrej Filip Date: Sat Jun 27 18:56:26 2009 +0200 Unused file removed. commit 2d785e8d6a646a878c970583aa54a15209fa0e6e Author: Ondrej Zajicek Date: Fri Jun 26 13:33:41 2009 +0200 Fixes bug on TCP passive socket binding on BSD. BGP on BSD was bound to random port. I am surprised that nobody noticed it already. commit 5004d02cb9df1f3ee231632a8e89929f4eb4f088 Merge: 1876e18 99355da Author: Ondrej Zajicek Date: Fri Jun 26 01:06:12 2009 +0200 Merge branch 'master' into dev commit 1876e18d32fa4b21888aae2c984b1b61338c3e60 Author: Ondrej Zajicek Date: Thu Jun 25 15:44:43 2009 +0200 Minor bugfix. commit 200ede8226a4173b2405bcd1c98cf20604c33545 Author: Ondrej Zajicek Date: Thu Jun 25 14:42:25 2009 +0200 NEWS and version update. commit d72cdff411d0bf4ddecaea5d0fc6d4341b4cb3f1 Author: Ondrej Zajicek Date: Tue Jun 23 11:08:30 2009 +0200 Replace 'bind' option with 'listen' option. To be consistent with other daemons. commit da95a7a7dad6ebf572adfb448dfc1a5c8400e6ab Author: Ondrej Zajicek Date: Tue Jun 23 11:00:38 2009 +0200 Fixes bug in ORIGIN check. commit 29c430f8569b90e1962d92a26f96fad7e72d27ec Author: Ondrej Zajicek Date: Tue Jun 23 10:50:57 2009 +0200 Changes handling of AS_PATH_CONFED_* segments in AS_PATH. Although standard says that if we receive AS_PATH_CONFED_* (and we are not a part of a confederation) segment, we should drop session, nobody does that and it is unwise to do that. Now we drop session just in case that peer ASN is in AS_PATH_CONFED_* segment (to detect peer that considers BIRD as a part of its confederation). commit 4323099da9e6e8d53072595009731da9b39e9f19 Author: Ondrej Zajicek Date: Sat Jun 20 00:59:32 2009 +0200 Fixes bug in scheduling of callback by main loop. If other side of a socket is sending data faster than BIRD is processing, BIRD does not schedule any other callbacks (events, timers, rx/tx callbacks). commit 2757985709f0a132427d4f440ec913b6a0064f80 Author: Ondrej Zajicek Date: Sat Jun 20 00:40:21 2009 +0200 Documentation update commit bf1aec970e9ac0600266fe7a045847a62f18ac3b Author: Ondrej Zajicek Date: Fri Jun 19 23:49:34 2009 +0200 Adds support for soft reconfiguration. commit 789772ed4586213d6a7fbb867b9296a01ce1b9c0 Author: Ondrej Zajicek Date: Thu Jun 18 19:20:07 2009 +0200 Implements option that changes BGP listening socket parametres. commit 1b3b3e34ecbc281a13d4ca0b99e891ee9c4d5cac Author: Ondrej Zajicek Date: Thu Jun 18 14:32:44 2009 +0200 Minor bugfixes. commit 6f5603badc12dbbf440e8f85b1165cc8f5d671c7 Author: Ondrej Zajicek Date: Thu Jun 11 20:51:13 2009 +0200 Documentation update. commit 386752028143e78d0a617216d86f95af4024346d Author: Ondrej Zajicek Date: Thu Jun 11 17:25:38 2009 +0200 Implements an option that allows to change a set of stub networks. commit 3d15dcdb1cc91c694aa9319b86bb37510d7ed12b Author: Ondrej Zajicek Date: Wed Jun 10 23:45:08 2009 +0200 Changes OSPF to generate stub networks for non-primary addresses. Also does some reorganization in RT LSA announcement. commit b99d378698641b9821e4b708a90761aeb9bf6cc4 Author: Ondrej Zajicek Date: Sun Jun 7 00:38:38 2009 +0200 Minor BGP changes related to error wait time. commit 723826267101cfbb918125f0f270166cd309229d Author: Ondrej Zajicek Date: Sat Jun 6 18:56:33 2009 +0200 Fixes bug related to startup delay change. commit dd91e467657b2dba84df308d0dc74d268bbfa228 Author: Ondrej Zajicek Date: Sat Jun 6 18:16:22 2009 +0200 Differentiate between error delay and connect/reconnect delay. The difference is here to reject incoming connections in the first case. commit 2a04b045e480bbf75229f0177abbd7f84d3b7089 Author: Ondrej Zajicek Date: Thu Jun 4 13:38:18 2009 +0200 Adds route limit documentation. commit 72b28a041df18f0da2e6a85360d6935c6a2db471 Author: Ondrej Zajicek Date: Thu Jun 4 13:31:09 2009 +0200 Implements import route limits. commit 925fe2d3de0e12c644f91f94d13bf388aeda9b57 Author: Ondrej Zajicek Date: Thu Jun 4 01:22:56 2009 +0200 Implements route statistics and fixes some minor bugs. commit 99355da18f8598e93d0e55167582da9687eae082 Author: Ondrej Filip Date: Tue Jun 2 12:01:24 2009 +0200 Inlude DESTDIR in install to make life of packagers easier. commit 26978ec419217fccfbb8901033703ede886e78b7 Author: Ondrej Filip Date: Tue Jun 2 11:36:07 2009 +0200 Clean also ipv6 bird.ctl commit de8f238fdb85bdba8ce4b5988584403cf5dbcd1e Author: Ondrej Filip Date: Tue Jun 2 11:00:12 2009 +0200 Error in test fixed. commit dc16584ac2be1c097acbf8a0b2f6d412214f2a01 Author: Ondrej Filip Date: Tue Jun 2 00:28:08 2009 +0200 Small change to make BIRD's IPv6 packaging easier commit c07c65d6d079eaf4525f03f5d126d51caa2595d6 Author: Ondrej Zajicek Date: Mon Jun 1 23:18:45 2009 +0200 Escaped debbuging message removed. commit 92a72a4cbdd010f69e8d054019770e55a47637e0 Author: Ondrej Zajicek Date: Mon Jun 1 19:32:41 2009 +0200 Adds support for dynamic pair and bgp mask expressions. commit f429d4348275030a9f488046c4021aa377ad1a79 Author: Ondrej Zajicek Date: Mon Jun 1 16:20:48 2009 +0200 Removes some remnant of '|' bgp path separator. commit f98e2915794e8641f0704b22cbd9b574514f5b23 Author: Ondrej Zajicek Date: Mon Jun 1 14:07:13 2009 +0200 The pipe cleanup. commit 2d45e09f58c4ce857e10c241cf0e89b51b9ec49c Author: Ondrej Zajicek Date: Mon Jun 1 12:10:10 2009 +0200 Adds opaque/transparent pipe mode selection. commit 23ac9e9a9eefe13918ee7f21a1d0f271a44d9efd Author: Ondrej Zajicek Date: Sun May 31 15:24:27 2009 +0200 Changes pipes to transfer all routes between routing table, not just optimal routes. commit 23e563d86b412632644bdc4a886b0b7fb60e5175 Author: Ondrej Zajicek Date: Sat May 30 00:35:35 2009 +0200 Fixes buggy prefix ~ prefix matching. commit 9be1086d2970633fb5af2a1faaae16d5a1cf48ea Author: Ondrej Filip Date: Fri May 29 23:08:28 2009 +0200 New type variable 'V' defined in filters. This type is checked only for name, never for value in function filter_same() commit 43de796b8a10f561d8b3ef64a86e5ce70de01eb5 Author: Ondrej Filip Date: Fri May 29 23:04:54 2009 +0200 Function pm_path_compare() checked just length of the bgpmasks commit d59405ec6652e95f4825492c7322536bb7044db0 Author: Ondrej Filip Date: Fri May 29 23:02:36 2009 +0200 Typo in warning fixed. commit 874b868544c3a6ba45ace062091cc3aee007b719 Author: Ondrej Zajicek Date: Fri May 29 22:49:30 2009 +0200 Implements primary address selection base on 'primary' option. commit 51f4469f03759642870a45634d9b53054e3deb92 Author: Ondrej Zajicek Date: Fri May 29 17:36:37 2009 +0200 Fixes problems with rewriting of kernel device routes. commit 6f68f066b63e992321ec1873a15c233f567b9aca Author: Ondrej Zajicek Date: Fri May 29 13:32:24 2009 +0200 Add 'primary' configuration option. commit 7c3d06b087946cbea4affa4a814e72b7a3556833 Merge: f571473 4c2507d Author: Ondrej Zajicek Date: Thu May 28 13:58:51 2009 +0200 Merge branch 'dev' into ospf commit a6c9f0648db56175ee9e077e2ca631b678552835 Author: Ondrej Filip Date: Thu May 28 13:37:04 2009 +0200 Missing boolean comparison added. commit 4c2507da687cdad1b9d147c1655e5ac46aaaa511 Author: Ondrej Filip Date: Tue May 26 10:43:59 2009 +0200 Warning for BSD system and TCP-MD5. commit 0c8c86c825f9cebf4c1d9f8d9cd57b2fad84d35b Author: Ondrej Zajicek Date: Mon May 25 01:41:20 2009 +0200 Adds INSTALL file. commit f571473ef3f78f6e38558d306d4d16ce7797e26c Author: Ondrej Zajicek Date: Sun May 24 17:55:33 2009 +0200 Hello packets on PTP networks should have zero netmask. This also ensures that misconfigured routers (one side ptp and one side broadcast) do not make adjacency. commit 8cc598a5205dbe46f5f249fa4f2de0586438965d Author: Ondrej Zajicek Date: Sun May 24 17:51:27 2009 +0200 Ignore Hello packets from different IP network (than primary). commit 050ceb867fbb96395c6f7d3207acbb5fe57b8d1c Author: Ondrej Zajicek Date: Fri May 22 18:41:52 2009 +0200 Update versions. commit 0c51083e97a4288219b29e82be65f399d085adee Author: Ondrej Zajicek Date: Fri May 22 18:08:54 2009 +0200 NEWS update. commit ea2ae6dd0ae3f5dd8cd41c1e5a1170a163027725 Author: Ondrej Zajicek Date: Fri May 22 17:12:15 2009 +0200 Change import/preimport to export/preexport to be consistent with filters. commit d72a0ac2396471ffb2b3a580ee986f950e4d23ae Author: Ondrej Zajicek Date: Fri May 22 15:16:53 2009 +0200 Fixes serious bug in route attribute handing. ea_same() sometimes returns true for different route attributes, which caused that hash table in BGP does not work correctly and some routes were sent with different attributes. commit 80f0d6764aa2c54eabdc1b41321a46e8cbcce2b9 Author: Ondrej Zajicek Date: Fri May 22 13:37:07 2009 +0200 Fixes type mismatch on BSD systems. commit d0c64519e798132b73ae5769b9246acb77b4c5aa Author: Ondrej Zajicek Date: Fri May 22 01:13:07 2009 +0200 Ugly hack for finding readline on NetBSD commit 8de11deb9107b0bcfc7bf3922ee7edff3dbcd73a Author: Ondrej Zajicek Date: Fri May 22 00:26:30 2009 +0200 Better checks for M4 in configure. commit 6c84554b671fce473fe333ab3d8b548a0768882b Merge: f434d19 4d176e1 Author: Ondrej Zajicek Date: Thu May 21 09:26:59 2009 +0200 Merge branch 'master' into dev commit f434d19174cb2d3054a00248ca609aa87bf8c263 Author: Ondrej Zajicek Date: Wed May 13 22:04:44 2009 +0200 Documentation updates commit 4d176e14509c71823a539b3c8b6103e254296d4f Author: Ondrej Filip Date: Mon May 11 02:01:11 2009 +0200 'show route protocol

' added to CLI. commit ef9c9ab9b64a6f3b5154e5340ffdcd1d211ec4c5 Author: Ondrej Filip Date: Mon May 11 01:32:49 2009 +0200 OpenBSD port related changes. commit dd8d2acd3c4ed7d7eb56ca9dbb7c9a6d43e2a869 Author: Ondrej Filip Date: Sun May 10 19:23:05 2009 +0200 Fixed bug in cli help. commit e755986a342b9a35cb7dd52e055066b1168aef12 Author: Ondrej Zajicek Date: Sun May 10 13:15:17 2009 +0200 Fixes in documentation. commit 19e10907c197ef123fafdd8a2783f9eb5f4a6f72 Author: Ondrej Zajicek Date: Fri May 8 14:37:06 2009 +0200 Fixes communication on netlink sockets Independent sessions on netlink sockets mixed state in some common variables. commit 20e94fb85b7097b57089e3912475ac881fd5528d Author: Ondrej Zajicek Date: Wed May 6 22:02:45 2009 +0200 A change in OSPF and RIP interface patterns. Allows to add more interface patterns to one common 'options' section like: interface "eth3", "eth4" { options common to eth3 and eth4 }; Also removes undocumented and unnecessary ability to specify more interface patterns with different 'options' sections: interface "eth3" { options ... }, "eth4" { options ... }; commit 10ab65a8c9eb846655feacd22c29747743a65328 Author: Ondrej Zajicek Date: Wed May 6 15:18:52 2009 +0200 Fixes one recently introduced IPv6 BGP compatibility problem. commit 2b70f0742e808053f87315433a2a64c749c3ec1d Author: Ondrej Filip Date: Mon May 4 18:17:46 2009 +0200 Linux specific TCP-MD5 handling moved to sysdep/linux/sysio.h FreeBSD coded added. BSD cannot set BGP passwords itself. This has to be done by external command. commit 1bc4b2cc840eb3f48c7e245528ef79c2b0ba50e7 Author: Ondrej Filip Date: Mon May 4 17:49:56 2009 +0200 Syntax error fix for systems without CONFIG_SELF_CONSCIOUS (KRT_ALLOW_LEARN) commit b7a735ea9d14ceb5c31712fbe122b54f0d7ec6e7 Author: Ondrej Zajicek Date: Wed Apr 29 22:17:40 2009 +0200 Allow 'third party' BGP updates for originated routes. commit 4827b69ff43661f4f34d437999b0edaac76f7355 Author: Ondrej Zajicek Date: Wed Apr 29 18:58:24 2009 +0200 Fixes BGP IPv6 link local next hop handling. When sending 'third party' BGP update, Bird used bogus link local addresses instead of addresses it received before. commit ad440a570b37e8674ef35f3a18df48f0eb2579eb Author: Ondrej Zajicek Date: Tue Apr 28 18:11:56 2009 +0200 Fixes handling of 'next hop self' and 'source address' configuration options. commit a6ee026693a9c24c71dcf846abd32508782e0249 Author: Ondrej Filip Date: Tue Apr 28 11:56:33 2009 +0200 Typo in gendist script. commit f8fbda6fb0c30fdc6e5182679e7bf1eb2fb9c8e9 Author: Ondrej Filip Date: Tue Apr 28 11:53:12 2009 +0200 Small formatting typo in documentation. commit 73841442d916490fa6a9b5967dbb1f797ca3dac1 Author: Ondrej Filip Date: Tue Apr 28 10:20:50 2009 +0200 Gendist script adapted to git. commit 11e0568f8b7a51584c7d0fa60368050dfba17193 Author: Ondrej Zajicek Date: Tue Apr 28 09:46:59 2009 +0200 NEWS and version update commit 64cf11f544257cae443d899111be1299b1ec0684 Author: Ondrej Zajicek Date: Thu Apr 23 23:15:07 2009 +0200 Fixes BGPv6 bug - missing endianity conversion. Also removes code skipping SNPAs (obsoleted by newer RFCs, should be ignored). commit f307842ad85396f8186fa049d551b6cde9925484 Author: Ondrej Zajicek Date: Thu Apr 23 14:44:02 2009 +0200 Fixes BGPv6 bug - mandatory attributes weren't validated; commit 8f0c887a52fb19cee14725f66d435cebf2010390 Author: Ondrej Zajicek Date: Thu Apr 23 14:16:05 2009 +0200 Fixe bug in BGPv6 that causes to send invalid network withdraws. commit b9539e78d8ebfa9e13d7b61ec9278b76abefdac3 Author: Ondrej Zajicek Date: Thu Apr 23 12:36:24 2009 +0200 Fixes bug in BGPv6 causing crash by checking missing attributes. commit e366625c0ef21d02caf2dab1935862ace1e10fed Author: Ondrej Zajicek Date: Fri Apr 17 18:43:11 2009 +0200 Fixes mixed-up messages on netlink socket Under specific circumstances there might be two mixed-up netlink sessions (one for scan, the other for route change request). This patch separates netlink scans and requests to two fds (and seq counters). This should fix http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=428865 commit c8a6b9a3d199444fd45879dd5cc5ececd9624822 Author: Ondrej Zajicek Date: Fri Apr 17 01:48:36 2009 +0200 Rewrite of buggy AS path matching. Old AS path maching supposes thath AS number appears only once in AS path, but that is not true. It also contains some bugs related to AS path sets. New code does not use any assumptions about semantic structure of AS path. It is asymptotically slower than the old code, but on real paths it is not significant. It also allows '?' for matching one arbitrary AS number. commit 024c310b537abc3ddbac3054de71fd759d422824 Author: Ondrej Zajicek Date: Wed Apr 8 20:15:01 2009 +0200 Fixes broken cryptographic authentication in OSPF Cryptographic authentication in OSPF is defective by design - there might be several packets independently sent to the network (for example HELLO, LSUPD and LSACK) where they might be reordered and that causes crypt. sequence number error. That can be workarounded by not incresing sequence number too often. Now we update it only when last packet was sent before at least one second. This can constitute a risk of replay attacks, but RFC supposes something similar (like time in seconds used as CSN). commit b722fe7ebdf7e11f097ed0a85302769de2ac10fb Author: Ondrej Zajicek Date: Mon Apr 6 16:53:06 2009 +0200 Fixes bug in OSPF packet retransmission. If a DBDES packet from a master to a slave is lost, then the old code does not retransmit it and instead send a next one with the same sequence number. That leads to silent desynchronization of LSA databases. commit 8298d780be5a5b00c31c10a37a5f3a1353d6e234 Author: Ondrej Zajicek Date: Mon Apr 6 16:17:47 2009 +0200 Better OSPF packet tracing log messages. Replaces old OSPF packet tracing messages with uniform messages with packet dumps. commit bcb81251b4e37b96743aa1cdf790f30ef41a465e Author: Ondrej Zajicek Date: Tue Mar 31 21:30:58 2009 +0200 Documentation update commit c60cdd8c3926a1b3d9156327e8aae64986084ff4 Author: Ondrej Zajicek Date: Tue Mar 31 21:17:00 2009 +0200 Cleanup changes commit b1a597e0c3821c791a41278454e74261cf1b95fb Author: Ondrej Zajicek Date: Tue Mar 31 12:55:57 2009 +0200 Reimplementation of prefix sets. Prefix sets were broken beyond any repair and have to be reimplemented. They are reimplemented using a trie with bitmasks in nodes. There is also change in the interpretation of minus prefix pattern, but the old interpretation was already inconsistent with the documentation and broken. There is also some bugfixes in filter code related to set variables. commit 1733d080c9f60de69e843f22e138f27240a8176c Author: Ondrej Zajicek Date: Wed Mar 25 19:15:26 2009 +0100 Minor text updates. commit 40b65f947aed065c03c5f2d5c66c6c794a5aadda Author: Ondrej Zajicek Date: Wed Mar 25 19:05:52 2009 +0100 Fixes bug in pipe route filtering. Routes comming through pipe from primary to secondary table were filtered by both EXPORT and IMPORT filters, but they should be only filtered by EXPORT filters. commit 4d7d0cb137b700a17751b5a565539357304f9080 Author: Ondrej Zajicek Date: Wed Mar 25 18:29:17 2009 +0100 Fixes minor bug in pipe. Missing macro leads to not calling some of protocol's callbacks. commit 3d574679b8cceb1362bb973e7dfe9981fc93b79b Author: Ondrej Zajicek Date: Fri Mar 20 12:58:21 2009 +0100 Fix bugs related to kernel table synchronization. KRF_INSTALLED flag was not cleared during reconfiguration that lead to not removing routes during reconfigure when export rules changed. We also should not try to remove routes we didi not installed, on Linux this leads to warnings (as kernel checks route source field and do not allow to remove non-bird routes) but we should not rely on it. commit 48d79d521cc13f11eafa129a4216512403b83115 Author: Ondrej Zajicek Date: Wed Mar 18 20:30:21 2009 +0100 Better handling of AS4 optional attribute errors AS4 optional attribute errors were handled by session drop (according to BGP RFC). This patch implements error handling according to new BGP AS4 draft (*) - ignoring invalid AS4 optional attributes. (*) http://www.ietf.org/internet-drafts/draft-chen-rfc4893bis-02.txt commit eb875dbbe1afaceaf3645384f2a35c98b4c5b5f6 Author: Ondrej Zajicek Date: Sat Mar 14 22:18:49 2009 +0100 Documentation fixes. commit ad586334d51a0aef9de868e9586198e402576599 Author: Ondrej Zajicek Date: Sat Mar 14 14:01:39 2009 +0100 Path related documentation update commit cf1860349182503523975fb8084d514407a75fb4 Author: Ondrej Zajicek Date: Sat Mar 14 12:43:10 2009 +0100 New syntax for bgp_path commit f16ad72ed76c398f081b97b09d56f4b199822464 Author: Ondrej Zajicek Date: Fri Mar 13 14:19:03 2009 +0100 Update NEWS commit e8ba557c7f66aaf02dd24f554fba8b3607c2b3d5 Author: Ondrej Zajicek Date: Fri Mar 13 12:49:44 2009 +0100 Update capability handshake options Add 'capabilities' option, change default behavior to advertise ipv4, add some checks and ignore incoming capabilities when capabilities are disabled. commit e3299ab14877de6ce688050e550c44cd4e85b212 Author: Ondrej Zajicek Date: Thu Mar 5 11:52:47 2009 +0100 Added Cisco and Quagga capability workaround option. commit 82a79586e5810af2f0338cb4c5982e085b5c5292 Author: Ondrej Zajicek Date: Fri Feb 27 15:24:46 2009 +0100 Better handling of too long attributes This patch extends the length for attributes from 1024 to 2048 (because both AS_PATH and AS4_PATH attributes take 2+4 B per AS). If there is not enough space for attributes, Bird skips that route group. Old behavior (skipping remaining attributes) leads to skipping required attributes and session drop. commit cb5303927188de9504a6e18aedec299956a22b6f Author: Ondrej Zajicek Date: Thu Feb 26 14:23:54 2009 +0100 Rate limit for most abundant log messages commit a9dc5e1ef2fd08c53bceb54690f6dac83ddf0c81 Author: Ondrej Zajicek Date: Wed Feb 25 16:28:21 2009 +0100 Fixes another bug in packet retransmissions. When slave was in full state, it didn't retransmit lost packets. That leads to OSPF connection locked in states loading-full. commit 82ba9032be9cf1210ffffd01245b99ce5d9b6b1b Author: Ondrej Zajicek Date: Sat Feb 21 22:46:50 2009 +0100 Fixes crash during some expressions Bird crashed when 'bgp_path.len' was used for routes that does not came from BGP. commit cd17c651a60c30837b683f8ca6e07139dc57d882 Author: Ondrej Zajicek Date: Sat Feb 21 17:47:56 2009 +0100 Add format for BGP_AGGREGATOR attribute commit 25cb9f1d0165df5e86956021cc3e6ee87730ef3b Author: Ondrej Zajicek Date: Sat Feb 21 16:20:45 2009 +0100 Fix bug in empty bgp mask handling commit e312bb4014d5b4ccc706c737f4362ac6ca1046ee Author: Ondrej Zajicek Date: Thu Feb 12 21:53:44 2009 +0100 Documentation update commit d901db3fb72860d4669793bfb1af3a9aa7a27b91 Author: Ondrej Zajicek Date: Thu Feb 12 19:46:51 2009 +0100 Fixes bug in packet retransmissions. When packet was lost during dbdes exchange, slave did not retransmit it. That leads to OSPF connection locked in states exchange-exstart. commit b807ef9a15db2a5db14f68011923975dfc472f49 Author: Ondrej Zajicek Date: Thu Feb 12 13:43:06 2009 +0100 Fixes bug in protocol state machine Scheduling flush must be done before resource pool freeing as it frees some allocated list nodes from a global list. commit 80ac7dc18145baa04a05eee3a69d325087cb9472 Author: Ondrej Zajicek Date: Thu Feb 12 13:41:34 2009 +0100 Do not use ? for client-side help when in new BGP path syntax commit f9491630390da4de138961354433635729668b7d Author: Ondrej Zajicek Date: Tue Jan 27 17:35:00 2009 +0100 New syntax for bgp_path commit 11ec0f1a5171c556dec09e90c20af12f45a6d902 Author: Ondrej Zajicek Date: Fri Jan 16 12:49:51 2009 +0100 Fixes compilation on older systems. Older kernel headers (the ones in Debian Sarge) does not have __kernel_sockaddr_storage . commit e3c460bc9034b30743dd861ddbdbc026cd2997b5 Author: Ondrej Zajicek Date: Fri Jan 16 12:08:07 2009 +0100 Fixes some past config grammar update that caused password related regression. commit 3b108f18e8c151d9c570fd418fc822c1e9ad5e79 Author: Ondrej Zajicek Date: Fri Jan 16 10:58:52 2009 +0100 One null-pointer dereference bugfix hidden in whitespace changes commit 0dd7ccc7669834495c637f5055f2cd783367f8f9 Author: Ondrej Zajicek Date: Tue Jan 13 19:25:27 2009 +0100 Fix typo. commit 0844b65d13d7a5928d425e9adaf28de63550a542 Author: Ondrej Zajicek Date: Tue Jan 13 19:15:49 2009 +0100 Fix OSPF protocol error recovery behavior. When OSPF neighbor state drops down to EXSTART, clear LSA request and retransmit lists, as specified by RFC. I hope that this will prevent oscillations between EXSTART and LOADING states, which sometimes happened. It also contains related fix from Yury Shevchuk that properly resets DB summary list iterator. commit f15cb99c79034fbd98d90b104bd6267e6c2fec81 Author: Ondrej Zajicek Date: Mon Jan 12 23:42:51 2009 +0100 Add check detecting packet overwrite in TX buffer. commit 02a9eeeb8547b3f0940a0295df8a78ce2181ec30 Author: Ondrej Zajicek Date: Mon Jan 12 14:40:21 2009 +0100 Slist update commit 23d6702952841184d364a5520dbe6be7a1a5d14b Author: Ondrej Zajicek Date: Sun Jan 11 12:14:27 2009 +0100 Some fixes and update of OSPF debug messages commit 0e9617e400d54f6f5119a24e7380b7719c2fc3dd Author: Ondrej Zajicek Date: Sun Jan 11 10:51:54 2009 +0100 Move check for NULL before usage of variable. commit f20907adf60960f63b797f4423b4790e8591e99c Author: Ondrej Zajicek Date: Sun Jan 11 10:47:41 2009 +0100 Fixes bug in OSPF Checksum was not recalculated when LSA was changed and packets with bad checksum were sent. commit 330aecead80140b0016d6de56dad1d193be774c8 Author: Ondrej Zajicek Date: Thu Dec 25 17:49:57 2008 +0100 Bugfix in interpret Missing cases in filter code interpret leads to crash when bgp_next_hop attr was queried. commit 083c43e22efb5353a258827a9e6f2f995cfe822d Author: Ondrej Zajicek Date: Thu Dec 25 11:55:27 2008 +0100 fixes some 64-bit related bugs. Filter code used 'aux' integer field of 'symbol' struct to store ptr to next symbol and both 'aux2' and 'def' fields for value. Changed to just 'def' for value and 'aux2' for ptr to next symbol. Also another minor bugfix. commit 165a62272720071ca5e9ed1badfddc78b7a7af10 Author: Ondrej Zajicek Date: Wed Dec 24 17:24:41 2008 +0100 Adds support for fallback to capabilityless BGP connect When capability related error is received, next connect will be without capabilities. Also cease error subcodes descriptions (according to [RFC4486]) are added. commit 591211557f4106ed9e877fa9b80eb56ffb99fef3 Author: Ondrej Zajicek Date: Wed Dec 24 12:18:10 2008 +0100 Fixes bug related to reconfiguration of BGP. BGP keeps its copy of configuration ptr and didn't update it during reconfiguration. But old configuration is freed during reconfiguration. That leads to unnecessary reset of BGP connection during reconfiguration (old conf is corrupted and therefore different) and possibly other strange behavior. commit 11b32d911715cbfb3ce4c87685b1388e4b0de1c4 Author: Ondrej Zajicek Date: Fri Dec 19 01:34:39 2008 +0100 Major changes to BGP Fixes two race conditions causing crash of Bird, several unhandled cases during BGP initialization, and some other bugs. Also changes handling of startup delay to be more useful and implement reporting of last error in 'show protocols' command. commit b933281ed5efb9ad9375c3ea41ee2412b9f89c15 Author: Ondrej Zajicek Date: Thu Dec 18 23:26:08 2008 +0100 Fixes nasty bug in event processing. WALK_LIST_DELSAFE (in ev_run_list) is not safe with regard to deletion of next node. When some events are rescheduled during event execution, it may lead to deletion of next node and some events are skipped. Such skipped nodes remain in temporary list on stack and the last of them contains 'next' pointer to stack area. When this event is later scheduled, it damages stack area trying to remove it from the list, which leads to random crashes with funny backtraces :-) . commit 35164c501722f07beef21178b19090fa9d1930cd Author: Ondrej Zajicek Date: Fri Dec 12 17:48:03 2008 +0100 rx_hook may be cleaned in some callback so we check it before executing sk_read(). commit d6a836f8d673a117fd19136d24e98fa9bbc4b27e Author: Ondrej Zajicek Date: Mon Dec 8 12:24:55 2008 +0100 Fixes core state machine. The core state machine was broken - it didn't free resources in START -> DOWN transition and might freed resources after UP -> STOP transition before protocol turned down. It leads to deadlock on olock acquisition when lock was not freed during previous stop. The current behavior is that resources, allocated during DOWN -> * transition, are freed in * -> DOWN transition, and flushing (scheduled in UP -> *) just counteract feeding (scheduled in * -> UP). Protocol fell down when both flushing is done (if needed) and protocol reports DOWN. BTW, is thera a reason why neighbour cache item acquired by protocol is not tracked by resource mechanism? commit fbde6c39084637c2f3f4d31261a44dbf367958d1 Author: Ondrej Zajicek Date: Sat Nov 22 01:12:22 2008 +0100 Fixes race condition leading to memory corruption and crash. When protocol started, feeding was scheduled. If protocol got down before feeding was executed, then function responsible for connecting protocol to kernel routing tables was called after the function responsible for disconnecting, then resource pool of protocol was freed, but freed linked list structures remains in the list. commit 35f983f88912eadb1e0b25d800693256cbee33ce Author: Ondrej Zajicek Date: Fri Nov 21 18:17:03 2008 +0100 Fixes segfault with multiple routing tables. commit 661ec5db7fa047d883997d0b2cbdd71659f80777 Author: Ondrej Zajicek Date: Fri Nov 21 13:05:12 2008 +0100 I am not sure whether this is proper fix for a problem that birdc shows only parts of larger outputs (for example 'show route all'). It seems that birdc reads (from bird) and writes (to stdout) everything but during execution of some readline code some already written output disappeared (although it is fflush()ed and tcdrain()ed). As birdc reads from stdin when select said there are some data, O_NONBLOCK for stdin is unnecessary and when it is removed, i didn't notified this problem. commit eac21b46f7cf0f704c976f2ffdb289837ad100cc Author: Ondrej Zajicek Date: Fri Nov 21 13:01:05 2008 +0100 This is bug, isn't it? commit e00115904ff7c1854957117d52a6db484050965b Author: Ondrej Zajicek Date: Fri Nov 21 12:59:03 2008 +0100 birdc died during terminal resize because of unhandled EINTR in select loop. commit 44711e0ca2658da080e04ce7e208a78c9b20e927 Author: Ondrej Zajicek Date: Sun Nov 16 22:16:04 2008 +0100 Fix some bugs in filter interpret. commit ebacaf6f7b4418dd283fd3e39b84e48e331a6a66 Author: Ondrej Zajicek Date: Sun Nov 16 11:35:30 2008 +0100 Fix bug in AS path matching commit 258d0ad4ca550895a1ef20fc478c0160be5374f2 Author: Ondrej Zajicek Date: Fri Nov 14 23:03:15 2008 +0100 Fixes feeding of new protocol, only preferred routes are announced. commit 3f670371cfeef155256a8a77ac5581accee13b05 Author: Ondrej Zajicek Date: Fri Nov 14 21:13:56 2008 +0100 OSPF routes appeared with random value of ospf_tag attribute. This patch fixes it. commit e29fa06ece1bf9f9a47f224db797df940556136e Author: Ondrej Zajicek Date: Fri Nov 14 14:50:37 2008 +0100 New read-only route attribute 'proto' added. It returns a string representing a name of the protocol that originated the route. Strings can be compared using = or matched using ~. Routes can be filtered, for example: show route where proto ~ "bgp1*" commit aebe06b40ce730a88cc8a3121be1944b3ddf5765 Author: Ondrej Zajicek Date: Sat Nov 8 23:33:22 2008 +0100 Proper format functions for ORIGINATOR_ID, CLUSTER_LIST commit b21f68b4cd4794c84e5f0eb2c34204c87ccf0e9a Author: Ondrej Zajicek Date: Sat Nov 8 17:24:23 2008 +0100 Fix bugs in OSPF MD5 authentication. First bug is that default values for MD5 password ID changed during reconfigure, Second bug is that BIRD chooses password in first-fit manner, but RFC says that it should use the one with the latest generate-from. It also modifies the syntax for multiple passwords. Now it is possible to just add more 'password' statements to the interface section and it is not needed to use 'passwords' section. Old syntax can be used too. commit 08cca48a149bd6d5210659daf220b6dae87a43b3 Author: Ondrej Zajicek Date: Thu Nov 6 19:13:55 2008 +0100 Uprava configure commit fd91ae3325adfdc83f95a284caa746c000ad7e30 Author: Ondrej Zajicek Date: Wed Nov 5 22:36:49 2008 +0100 Fix problem with local time changes. commit 1389f3699fc643dac6fd4d2f19fb59da3624a2fa Author: Ondrej Zajicek Date: Wed Nov 5 21:39:04 2008 +0100 Fixes bugs in IPv6 code caused by recent commits. commit baa9ef18c62612bd91a8362ef20427046105c113 Author: Ondrej Zajicek Date: Tue Nov 4 14:52:47 2008 +0100 These warnings are so abundant (because char * / byte * mix) that they are completely useless. commit 6c8102e3a8bf8ae4c15d383f0bd31294dd2ef76e Author: Ondrej Zajicek Date: Tue Nov 4 14:51:45 2008 +0100 Ignore messages related to wireless extensions. commit a39b165e45fbfea053fd0237e0d5a3ebdcf40f78 Author: Ondrej Zajicek Date: Sat Nov 1 16:58:40 2008 +0100 Multihop BGP was completely broken, because listening socket has always ttl 1. commit a92fe607173b52cf28256f00399953c623788c35 Author: Ondrej Zajicek Date: Sat Nov 1 12:55:43 2008 +0100 Implementation of route server. commit e16466b379be2b94c84b351a69e63b6de5be9dc5 Author: Ondrej Zajicek Date: Wed Oct 29 14:16:34 2008 +0100 Fix race condition that breaks BGP connections after reconfigure. RFC says that only connections in OpenConfirm and Established state should participate in connection collision detection. The current implementation leads to race condition when both sides are trying to connect at the almost same time, then both sides receive OPEN message by different connections at the almost same time and close the other connection. Both connections are closed and the both sides end in start/idle or start/active state. commit f0ad56f4414fef2781339cfa41704f7bf4c61ad2 Author: Ondrej Zajicek Date: Tue Oct 28 16:10:42 2008 +0100 Fixes some sloppiness of commit a3b70dc499b64f41aa776b5b4afee5c7bfb8dfa6. commit a98fbf0f12b5e83e25afa0f585ca6a4d4ac5f6bf Merge: a3b70dc 1567ede Author: Ondrej Zajicek Date: Mon Oct 27 00:20:22 2008 +0100 Merge branch 'dev' into out commit a3b70dc499b64f41aa776b5b4afee5c7bfb8dfa6 Author: Ondrej Zajicek Date: Mon Oct 27 00:03:30 2008 +0100 Two new informative CLI commands for OSPF. Two new CLI commands for OSPF giving nice informative (and still machine parsable) representation of OSPF network graph (based on datas from the LSA database). The first command (show ospf topology) shows routers, networks and stub networks, The second command (show ospf state) shows also external routes and area-external networks and routers propagated by given area boundary router. commit 68fa95cfec78f1bfe790949bf747d578ad583ec2 Author: Ondrej Zajicek Date: Sun Oct 26 23:55:38 2008 +0100 Check of socket name length commit 52586ccdf17cd9f34f767718d97f8a258da5efdb Author: Ondrej Zajicek Date: Sun Oct 26 23:53:05 2008 +0100 Missing newline. commit a97122a3caff40bf35e6019a9b60d5e5ef35a84f Author: Ondrej Zajicek Date: Sun Oct 26 23:43:13 2008 +0100 Bugfix in LSA origination for PTP OSPF links. The code generating LSAs for PTP OSPF links is buggy. The old behavior is that it generates PTP link if there is a full/ptp neighbor and stub link if there isn't. According to RFC 2328, the correct behavior is to generate stub link in both cases (in the first case together with PTP link). And because of buggy detection of unnumbered networks, for numbered networks the code creates stub links with 0.0.0.0/32. commit 4c94a6c7e78fb75a9952d891db9d47605f8a26e1 Author: Ondrej Zajicek Date: Sun Oct 26 23:23:09 2008 +0100 Do not repeat 'Invalid broadcast address' error message. 'Invalid broadcast address' error is reported only once for an interface and not during every interface scan. commit d7f3b306495327e76aa9ae381c6c7575104e0e24 Author: Ondrej Zajicek Date: Sun Oct 26 23:20:50 2008 +0100 Ignore unknown netlink events. Bird sometimes reported 'bird: nl_parse_link: Malformed message received'. The cause is that bird asynchronously received netlink packet from wireless driver about some wireless event on its link layer. In that case bird shouldn't complain. commit 1567edea8d3da7da08092eef15bb3bd4544c6464 Author: Ondrej Zajicek Date: Sun Oct 26 23:09:46 2008 +0100 Bugfix for routing table breaking bug. Here is a patch fixing a bug that causes breakage of a local routing table during shutdown of Bird. The problem was caused by shutdown of 'device' protocol before shutdown of 'kernel' protocol. When 'device' protocol went down, the route (with local network prefix) From different protocol (BGP or OSPF) became preferred and installed to the kernel routing table. Such routes were broken (like 192.168.1.0/24 via 192.168.1.2). I think it is also the cause of problem reported by Martin Kraus. The patch disables updating of kernel routing table during shutdown of Bird. I am not sure whether this is the best way to fix it, I would prefer to forbid 'kernel' protocol to overwrite routes with 'proto kernel'. The patch also fixes a problem that during shutdown sometimes routes created by Bird remained in the kernel routing table. commit b6bf284a905412cfe107b4967e55649e6194187e Author: Ondrej Zajicek Date: Sun Oct 26 22:59:21 2008 +0100 Bugfixes in MULIT_EXIT_DISC attribute handling. - Old MED handling was completely different from behavior specified in RFCs - for example they havn't been propagated to neighboring areas. - Update tie-breaking according to RFC 4271. - Change default value for 'default bgp_med' configuration option according to RFC 4271. commit 4819c3e17ac22c6810ee80261ac3bffb5127e39d Author: Ondrej Zajicek Date: Sun Oct 26 22:54:23 2008 +0100 Bugfix in LOCAL_PREF attribute handling. commit 1adc17b4b57267e301fcd67309494bbbddbfa718 Author: Ondrej Zajicek Date: Sun Oct 26 22:52:21 2008 +0100 Update of a documentation - new options for AS4, MD5 auth and route reflection. commit ba5ed6f3e4eb4b2899cdad08e2edb99063bfbcee Author: Ondrej Zajicek Date: Sun Oct 26 22:48:02 2008 +0100 Implementation of an option for disabling AS4 support per BGP instance. commit 4847a894bf7d4852325c3f1ea4bb4890054a1f66 Author: Ondrej Zajicek Date: Sun Oct 26 22:45:09 2008 +0100 Implementation of route reflection for BGP commit d51aa2819005a03e4cfb6f62333be6ccadfb3c06 Author: Ondrej Zajicek Date: Sun Oct 26 22:42:39 2008 +0100 Implementation of MD5 authentication of BGP sessions. commit 11cb620266035ffbe17b21c4a174380cb8b6a521 Author: Ondrej Zajicek Date: Sun Oct 26 22:36:08 2008 +0100 Implementation of 4B ASN support for BGP commit 44cb1449edec6a80e063981a955e8025ee87ea65 Author: Martin Mares Date: Sun Oct 26 14:14:37 2008 +0100 The top-level Makefile is a generated file, so remove it from the repo. commit c94d56cb04b15dc32f54e8e39b877a92d7bda8c5 Author: Martin Mares Date: Sun Oct 26 14:11:06 2008 +0100 Updated version number in the README. commit 226cb2bc3ff573c4c027d525a96aa2b10a28b817 Author: Ondrej Filip Date: Mon Aug 25 12:51:06 2008 +0000 Expand ospf dump information. commit 97c6fa02e089e3fb057185fe5937297afc5a11ec Author: Ondrej Filip Date: Mon Aug 25 12:06:20 2008 +0000 Previous patch reverted. :-( commit 73e53eb555a58846c4d2db6464d41d1761a60169 Author: Ondrej Filip Date: Mon Aug 25 12:00:55 2008 +0000 Endianity problem in debug message fix. commit 030e3a79cb9376fa85597fdb8243299cd843ca3a Author: Ondrej Filip Date: Mon Aug 25 11:57:46 2008 +0000 Buffer overflow fix. commit 057021df0d699f9c21368ab0fa51fe821cc9a544 Author: Martin Mares Date: Mon Aug 25 11:19:49 2008 +0000 Fix behavior of ipa_opposite(). It was giving wrong results on /30 networks. commit 6c36c4b66be5c67a8d5cfa9578aa5a85ebebab6d Author: Martin Mares Date: Mon Aug 25 11:14:14 2008 +0000 Updated config.{guess,sub} to a recent version. Patch from the Debian package. commit 3c3271d9fce8cdd614f1d1b24bcebb3599aad930 Author: Ondrej Filip Date: Sun Aug 24 23:24:14 2008 +0000 Close fd of config file after reconfiguration. commit 85ae398a61184d8f7a353eacaa6aefd3422dfd71 Author: Ondrej Filip Date: Sun Aug 24 23:20:46 2008 +0000 The source address configuration in BGP added. commit a456788bce7f9d1e54b19ffbfd35b8fa889c4b47 Author: Ondrej Filip Date: Wed Jun 20 12:32:39 2007 +0000 New version of flex needs argument separated. commit 8411a37e7dc72a5fd2e4fb68d1c557dc89253973 Author: Martin Mares Date: Wed Jun 20 07:33:26 2007 +0000 Detach from the TTY properly. commit 4b1cf69e765b19ebc0cb988be08910c156c76376 Author: Ondrej Filip Date: Wed Mar 16 16:09:28 2005 +0000 Again back to regina.gin.cz. commit c81b4ec36105ff036a7e2423936ab5773011fed1 Author: Ondrej Filip Date: Wed Mar 16 16:08:40 2005 +0000 Yes, we will go for 1.0.12 commit f39e3bfdbff318b3a889f42acfb589e9dfd34c2f Author: Ondrej Filip Date: Tue Mar 15 23:42:41 2005 +0000 Small bugfix in tracing. commit 94c42054ea65d10477afc76f221e3ac345a431eb Author: Ondrej Filip Date: Tue Mar 15 22:06:36 2005 +0000 Added new parametr 'rx buffer '. BIRD is able to receive very large packets (if configured). commit e6ea2e375e4c547ca1b6fc9c313c2b7940acbd77 Author: Ondrej Filip Date: Tue Mar 15 20:51:33 2005 +0000 Maximal packet size in virtual links is 576. commit e300066d5f66b8bd1d5561d63c10a8fbdce3ba8e Author: Ondrej Filip Date: Mon Mar 14 11:24:56 2005 +0000 OSPF can accept larger packets than MTU. commit 427e59939bc72c79f1566167b337927b14cb1715 Author: Ondrej Filip Date: Mon Mar 14 11:07:10 2005 +0000 Look for large packets. commit a2d5b405d41c212993e47d47607df3b708254c97 Author: Ondrej Filip Date: Mon Mar 14 10:59:52 2005 +0000 Bugfix in external routes calculation. commit f735de0290ce9a8f119f3d72bdde5a16dafe27ad Author: Ondrej Filip Date: Mon Feb 21 14:06:22 2005 +0000 Small typos in documentation. commit 129e912924b7726166b9ff5925a9dff84ee511f9 Author: Ondrej Filip Date: Mon Feb 21 10:22:57 2005 +0000 Ftp server change. commit 89478fe3ab6d07b824adbd4c8ed997ccaca5c7b4 Author: Ondrej Filip Date: Mon Feb 21 10:04:37 2005 +0000 Change of ftp servers. commit 39fc85b4c63582b56c4f96de49d0c6aad03c4086 Author: Ondrej Filip Date: Sun Feb 20 19:03:34 2005 +0000 Unused code deleted. commit 63ca37f3139505a1881bf2c343f18d4ed8e22ce4 Author: Ondrej Filip Date: Sun Feb 20 18:56:06 2005 +0000 Cleanup - all unused variables deleted. commit efc9e1b78b9332a0a8dfce31f1ef8efc82edc63d Author: Ondrej Filip Date: Sun Feb 20 17:04:00 2005 +0000 Some tasks are fulfilled. :-) commit 52d61a84989cc40140e7e8b5fc294ac48d4e0245 Author: Ondrej Filip Date: Sun Feb 20 16:54:09 2005 +0000 Intelligent reconfiguration should work again. commit dafaef9ba9e7b46b9ff42b2cb75954a86f920951 Author: Ondrej Filip Date: Sun Feb 20 16:53:06 2005 +0000 Originate default route into stub areas. commit 028a4cfc02f425de34323082d800a39b7bbc51de Author: Ondrej Filip Date: Sun Feb 20 04:28:55 2005 +0000 Let's go for 1.0.11. commit d8c7d9e8846f025e42227c64e992a3a52ca7dfb4 Author: Ondrej Filip Date: Sun Feb 20 04:27:56 2005 +0000 Since now I can also use 'dead interval', not just 'dead counter'. commit 7de7470a2a6c649ce4d4ce52146e84e6638ebf58 Author: Ondrej Filip Date: Sun Feb 20 03:37:47 2005 +0000 Bugfix - count courrectly next hop on single hop virtual link. commit 6eb4b73fe829cf5da56d8990c33e5c7edaa19d77 Author: Ondrej Filip Date: Sun Feb 20 03:30:44 2005 +0000 Time of neighbor's dead was not shown correctly. commit 5506c82ce6123f70220f2d84ff21269bb832bfac Author: Ondrej Filip Date: Fri Feb 18 19:36:32 2005 +0000 Bugfix in previous bugfix. commit 60e04f041303fdafd0abf0dec003a9745345c68a Author: Ondrej Filip Date: Fri Feb 18 18:51:42 2005 +0000 Minor bugfix: Summary LSA for aggregated area was always propagated with metric = 1. Now it's metric of most distant component. commit 27a1e3ac35bd3f6a9b5161eafb5b8178162a37f8 Author: Ondrej Filip Date: Tue Feb 15 16:17:42 2005 +0000 Minor bugfixes in routing table calsulation. commit 8ffc753441cd58acf46783de335062ed9af7a12e Author: Ondrej Filip Date: Tue Feb 15 06:32:31 2005 +0000 Minor changes to keep gcc happy. commit c025b85273178bc7c129bf54e420a91c775a9340 Author: Ondrej Filip Date: Mon Feb 14 23:15:04 2005 +0000 Real write is only in sk_maybe_write. Previous change partially reverted. Thank you MJ. commit 2eef9e887ad82976476ea81aa3a25d97c3956b87 Author: Ondrej Filip Date: Mon Feb 14 21:34:46 2005 +0000 Be more verbose in log. commit 7c49f715593ad7bbe0a4fb86284e2023f7b65bc1 Author: Ondrej Filip Date: Mon Feb 14 21:28:51 2005 +0000 Added s->err_hook wrapper that empties socket. commit 030d3b387edae4a30fb524ed839be020b7b8df8e Author: Ondrej Filip Date: Mon Feb 14 11:58:46 2005 +0000 Small changed to reduce the number of warnings. commit b181f444a6538b03a02296f02928e3c131b251a6 Author: Ondrej Filip Date: Mon Feb 14 11:54:16 2005 +0000 Small changes to reduce number of warnings. commit 75c1c585197f2b4a1b0295d36fe16a4869c21914 Author: Ondrej Filip Date: Mon Feb 14 11:37:40 2005 +0000 Yes, I'd like to go to 1.0.10 commit 5d3f555234d7144272e3081665411d098280d5ad Author: Ondrej Filip Date: Sun Feb 13 23:36:31 2005 +0000 Many bugfixes in routing table calculation and summary LSA origination. commit 0d3effcf8ca3784c36ce6229343ddfd754e405dc Author: Ondrej Filip Date: Sat Feb 12 22:27:55 2005 +0000 Time added in password management. commit 89ba9a18068dc83557e03c58bf280f4dc203271d Author: Ondrej Filip Date: Sat Feb 12 22:22:18 2005 +0000 Bugfix in inter-area route calculation and summary LSA origination. Bugfix of some debugging commands. commit bae7c43ff35482807654519253b1daa0a6518951 Author: Ondrej Filip Date: Sat Feb 12 22:19:46 2005 +0000 Bugfix in password acceptance commit 9912fa51c8dabbbdf068d271ee7bddfb4a8526ef Author: Ondrej Filip Date: Sat Feb 12 22:18:48 2005 +0000 Bugfix - cost of interface can be larger than 0xffff commit 4991756863538cc5168cc5f10b2599c84eafd8bf Author: Ondrej Filip Date: Wed Sep 15 19:33:01 2004 +0000 Dont check netmask field on PTP links. commit 8910351c76af983411e09e04aff86ea5d9940cf1 Author: Ondrej Filip Date: Wed Sep 8 16:06:07 2004 +0000 sort from GNU coreutils 5.2.1 doesn't accept the +- syntax anymore. Hopefully the -k syntax is supported by all other sort versions commit c6dce04bed40959b331a5b79aadd11c3b34d4af5 Author: Ondrej Filip Date: Wed Sep 8 16:04:02 2004 +0000 Bugfix. commit 27e3e5e0c95b068111bf00d7dceb473dc77a93f2 Author: Martin Mares Date: Thu Aug 19 09:15:36 2004 +0000 Do not forget to propagate LDFLAGS from configure. Allows static linking, among other things. commit 7715f9d9edb2cd5a230424881b1d5ec4e842738a Author: Ondrej Filip Date: Tue Aug 10 17:47:32 2004 +0000 Bugfix in config.y commit 56e2a4b776b0d013f71bff9fbf8550442c11df91 Author: Ondrej Filip Date: Thu Aug 5 18:06:30 2004 +0000 Bugfix in OSPF - BIRD sometimes failed during rt calculation with VLINKs. commit 6236beab1ec5ba61487c418119e01a933e1cacee Author: Ondrej Filip Date: Mon Aug 2 22:38:43 2004 +0000 Some more TODOs for OSPF. commit 8d94a524b637dbb1513c23daefa8411dcdc9a054 Author: Ondrej Filip Date: Fri Jul 16 08:27:11 2004 +0000 Added handling of STUB bool. commit 73089070e6e5c94ffac2da4c9e267ae9bcda2164 Author: Ondrej Filip Date: Fri Jul 16 08:01:32 2004 +0000 Typo. commit 002ecc063845243613eb1ff40c3aa2a46c7013a1 Author: Ondrej Filip Date: Fri Jul 16 07:22:43 2004 +0000 Bugfix - bird needed double ';' after rfc1583compat. commit 4e9742bb597225d7cefc0ee08270f76db29b65f1 Author: Ondrej Filip Date: Thu Jul 15 19:46:52 2004 +0000 Added note about *BSD. commit 6b68de07d9a4f1ad122e46dc40c6cdfd8b06ae4b Author: Ondrej Filip Date: Thu Jul 15 17:58:07 2004 +0000 News update to 1.0.9. commit 004cf4fc0ced85dba570173f372c51b1bf71dafe Author: Ondrej Filip Date: Thu Jul 15 17:28:13 2004 +0000 Minor bugfix to compile bird in IPv6. commit b37bb5ce03aed03d8b1bb0346f3277a93ff76da4 Author: Ondrej Filip Date: Thu Jul 15 16:48:12 2004 +0000 Minor bugfix - add interface routes. commit 28e8d862b7952419e6050230cf154d244a5bae51 Author: Ondrej Filip Date: Thu Jul 15 16:42:06 2004 +0000 Minor bugfix in calculation of external routes. commit 86c84d76b706e77ec5977a3c9e300b0fca9f6b10 Author: Ondrej Filip Date: Thu Jul 15 16:37:52 2004 +0000 Huge OSPF database redesign. Since now, all LSAs of all areas are in single database. This avoids duplication of external LSAs and fixes bug in external LSA distribution. commit 777acf91bb0d8ca0f33f367ae5fa00f46dde5a9a Author: Ondrej Filip Date: Wed Jul 14 21:47:39 2004 +0000 Everything is tested and works. I thins it's right time to go to 1.0.9. commit 3b16080c97a2d89c90f7df7a8fda0401ec9abe42 Author: Ondrej Filip Date: Wed Jul 14 21:46:20 2004 +0000 Multiple OSPF areas can be attached. Origination of summary LSA works. Routing table calculation works. Virtual links works. Well, I hope, OSPF is fully compatible with RFC2328!!!! commit a417ad13a117d2458702cbec4aa418ba99981611 Author: Ondrej Filip Date: Tue Jul 13 23:42:14 2004 +0000 Send hello just after interface is up. This makes the adjacency forming faster. Minor code clean up. commit 897999c22a85499e4e8a476e27469201645012fb Author: Ondrej Filip Date: Tue Jul 13 23:31:37 2004 +0000 Send hello as soon as possible after the interface is up. This helps to faster establish the adjacency. commit 490767adfce6207012f54f004babcb2aef7f33f8 Author: Ondrej Filip Date: Tue Jul 13 22:10:14 2004 +0000 Add more reasonable options to LSAs. (But it seems, that it's ignored.) commit fe1489e6c13a405b0c76c36213af4017dd4ea2ec Author: Ondrej Filip Date: Tue Jul 13 22:04:57 2004 +0000 Bugfix: Router was unable to advertise AS external routes. commit 62eee82321a9a0451eea9b41a478444ceb87ecb0 Author: Ondrej Filip Date: Tue Jul 13 21:27:33 2004 +0000 Default tick = 1. The today's CPU is fast enough. commit 35fdf4b6a2c3d8ad11be3a7d2525d653237fa3bf Author: Ondrej Filip Date: Tue Jul 13 21:22:32 2004 +0000 Don't inform us about every ospf_age() commit 16c2d48d8fe10521fd493886cf245c75d843fc69 Author: Ondrej Filip Date: Tue Jul 13 20:53:56 2004 +0000 Bugfix - RIP now updates routes with worse metric. commit bc956fcab678f591137cba2a0ebe80c0812437db Author: Ondrej Filip Date: Tue Jul 13 14:46:14 2004 +0000 MD5 authentication in OSPF works. :-) commit 32d3228d864cb6af8c679a7742f4b0a71c2facc0 Author: Ondrej Filip Date: Tue Jul 13 13:52:54 2004 +0000 Bugfix in simple authentification. commit 12dd8dc8779c13889a6860b769df7e0d68e7764c Author: Ondrej Filip Date: Tue Jul 13 12:21:24 2004 +0000 Bugfix - nasty bug in router LSA origination - Router did not describe all interfaces. commit 621ccdfe5acd2889956ec0f8e96b812acd09f168 Author: Ondrej Filip Date: Tue Jul 13 11:58:50 2004 +0000 Bugfix - options bits were not included in LSAs Bugfix - E bit was not unset on stub areas. commit 9baece57d308d9e0d8eaab9d068471e1884817b8 Author: Ondrej Filip Date: Thu Jul 8 16:56:49 2004 +0000 Syntax bugfix. commit 69b27ed6fd7794d36852764319e4dad19d4b6f87 Author: Ondrej Filip Date: Thu Jul 1 15:01:44 2004 +0000 Length calculation bugfix. commit 02ad2737fd24573d870a5009a624c9b3c49aa176 Author: Ondrej Filip Date: Thu Jul 1 15:01:26 2004 +0000 Password WALK_LIST bugfix. commit bc4ea680cea9eca46cd2c5f41db91c3014f90167 Author: Ondrej Filip Date: Thu Jul 1 15:01:04 2004 +0000 Hello reading bugfix. commit ea357b8b6de387a55930a3fc831b8ccbcef24582 Author: Ondrej Filip Date: Sat Jun 26 22:52:39 2004 +0000 Update of the documentation. (passwords and md5). Option for md5 auth in config. commit 3e2bd0f17aab3d2bd460d5f7aef4d3bc152ea1ab Author: Ondrej Filip Date: Sat Jun 26 20:15:34 2004 +0000 Md5 authentification added (unsested). Packet receiving clean up. commit 5236fb03afecd3d7a6ec6e96712c79a31be32132 Author: Ondrej Filip Date: Sat Jun 26 20:11:14 2004 +0000 Password management redesigned (untested). commit 98ac61766d81d9f20c4a7c7e12859c3b82b24f4c Author: Ondrej Filip Date: Fri Jun 25 16:39:53 2004 +0000 A lot of changes: - metric is 3 byte long now - summary lsa originating - more OSPF areas possible - virtual links - better E1/E2 routes handling - some bug fixes.. I have to do: - md5 auth (last mandatory item from rfc2328) - !!!!DEBUG!!!!! (mainly virtual link system has probably a lot of bugs) - 2328 appendig E commit 5ed68e46d781f8a14d3ef3ffd7fe3afc4a62260e Author: Ondrej Filip Date: Wed Jun 23 23:59:48 2004 +0000 Small typo changes. commit 973cf09c3b311691d063a00f52be7e9b8bdec376 Author: Ondrej Filip Date: Wed Jun 23 21:36:55 2004 +0000 Hotfix to problem with metric change reported by Luca. commit 3fe5f8990764b33cc0245317e90fbbcd0cde84de Author: Ondrej Filip Date: Wed Jun 23 21:34:26 2004 +0000 P->magic used just in LOCAL_DEBUG mode commit 09e4117cc19dd94efbdad6edde9bc7d715a58a9a Author: Ondrej Filip Date: Fri Jun 18 12:54:53 2004 +0000 sk_write bugfix for BSD. commit b4d8a0c280d34e6164a88d0e2f9ebf16fd5a1d68 Author: Ondrej Filip Date: Wed Jun 16 23:01:49 2004 +0000 Some cisco routers send shorter ospf messages in larger packets. Well it's strange, but, actually it's correct. commit 1a61882d370e6aef99ebc11d6bbc4e9dc48c6b95 Author: Ondrej Filip Date: Fri Jun 11 09:36:50 2004 +0000 Better routing table calculation. We are ready to work with multiple OSPF areas. commit b1f7229ad7d0b10fcc1fde6645c8b8ebbb3644a6 Author: Ondrej Filip Date: Fri Jun 11 09:34:48 2004 +0000 Better adjacency building, some minor bugfixes. commit 9a4b87905d727a518af04c16b8d7b603404098b7 Author: Ondrej Filip Date: Fri Jun 11 09:06:08 2004 +0000 Deleted RTS_OSPF_BOUNDARY commit 8bf684eca2de6ffd9ba797cad485e36db0b9548f Author: Ondrej Filip Date: Fri Jun 11 09:05:06 2004 +0000 RTS_OSPF_BONDARY is nonsense, RTS_OSPF_IA must have smaller id than RTS_OSPF_EXT commit 7df86c25fc6c871795265faebe02bf4dcecdd190 Author: Ondrej Filip Date: Wed Jun 9 12:39:49 2004 +0000 Better checking of configuration. commit b7e9c74cba36ed6932dbc30a4b9b0b9f9a06dba5 Author: Ondrej Filip Date: Mon Jun 7 16:51:23 2004 +0000 Used parameter can be marked as unused. :-) Thanx MJ. commit e02652a7d2e1f9bb599dbf9fa5862f03f4188efa Author: Ondrej Filip Date: Mon Jun 7 16:42:48 2004 +0000 Bugfix in RT calculation. commit 6721e2862bf69d3af7dd643cd9f442b76e134d5b Author: Ondrej Filip Date: Mon Jun 7 14:38:35 2004 +0000 Build and run both IPv4 and IPv6. commit ff61673427370c71d0a5f2d0d838f00ff46bbda1 Author: Ondrej Filip Date: Mon Jun 7 14:37:29 2004 +0000 Delete automate*cache. commit bf1b1b605b26202466f58b0572db5918acf8cf22 Author: Ondrej Filip Date: Mon Jun 7 13:07:12 2004 +0000 Let's go for release. commit 541cbe97633281b273ade8045b77834a5b6a1db4 Author: Ondrej Filip Date: Mon Jun 7 12:52:32 2004 +0000 It was too verbose. commit c90ac711bc5d1989dcb093088c74d062b43e9914 Author: Ondrej Filip Date: Mon Jun 7 10:42:24 2004 +0000 Cleanup in show route import

. commit 282997f21e6d40c840433128b198a19e9fdf41fb Author: Ondrej Filip Date: Mon Jun 7 10:00:29 2004 +0000 Some new warnings eliminated. commit 19d9e3033661b49cd4e4771166c45db2f1f24805 Author: Ondrej Filip Date: Mon Jun 7 09:52:15 2004 +0000 Marked unused parameters as unused. commit fb257e43fc23f9e0455444ef67c4be0dae22a713 Author: Ondrej Filip Date: Mon Jun 7 09:09:14 2004 +0000 Deleted some unused code. commit 5e3436d20ffdd95a164ffcb82f584fad76fb94e7 Author: Ondrej Filip Date: Sun Jun 6 19:53:52 2004 +0000 Cleanup in packet.c. Deleted unused parameters. commit d5d9693ce90c190ca7358b4ac71b9d034603a3ae Author: Ondrej Filip Date: Sun Jun 6 18:45:08 2004 +0000 Deleted unused parameters. commit e677d04aeb19e26da30e6a3ae94ad6e183d7af8e Author: Ondrej Filip Date: Sun Jun 6 17:20:16 2004 +0000 RPM is now able to build IPv4 and IPv6 bird. commit 41c8976e29bbf2986b063d1a8c5c8b386fae500e Author: Ondrej Filip Date: Sun Jun 6 17:05:25 2004 +0000 Test old instance of BIRD. commit cd09226078471cf9a2db4e755fbd5f6f137137c9 Author: Ondrej Filip Date: Sun Jun 6 17:03:56 2004 +0000 Be sure, that ospf_area is aged before routing table calculation. commit 933bfdde2a0bc4e31e74a3f9e03174b0287c03fb Author: Ondrej Filip Date: Sun Jun 6 16:14:57 2004 +0000 Keep al lSAs invalidated. commit 54a2178fd4c16189e7e0140c0a885b2cd6d2025e Author: Ondrej Filip Date: Sun Jun 6 16:05:14 2004 +0000 TODO updated. commit b8f17cf1923ff5894b6689479f7fb7d008b8ce44 Author: Ondrej Filip Date: Sun Jun 6 16:00:09 2004 +0000 Small cleanup, indentation and preparation for multiple areas routing table calculation. commit d631698ec8a63270f7ca9bc069508d1313a08f92 Author: Ondrej Filip Date: Sun Jun 6 14:27:11 2004 +0000 Indentation. commit d8d553cadfecab2a2f3d8a69624b5a743bd97ce3 Author: Ondrej Filip Date: Sun Jun 6 14:25:55 2004 +0000 This warning is stupid. commit 2e10a170fe70e405b5d6cb2cb53cd9a15de25b73 Author: Ondrej Filip Date: Sun Jun 6 09:37:54 2004 +0000 Indentation. commit 66261211a9c9abd5e1591f0875d16da1e3975fcb Author: Ondrej Filip Date: Sun Jun 6 09:13:37 2004 +0000 Struct area_net changed. commit b9ed99f738c10c0576a9ab8a70b028a92d0d74a7 Author: Ondrej Filip Date: Sun Jun 6 08:55:33 2004 +0000 Cleanup in iface.c commit a5918961f3a62c55857f811f712f861fa3d35d4f Author: Ondrej Filip Date: Sun Jun 6 08:12:42 2004 +0000 Be more verbose in troubles. commit 66004c91a89479abd3df89404afff62c5d60d4c3 Author: Ondrej Filip Date: Sat Jun 5 15:02:52 2004 +0000 Set size of the buffers. (Thanx MJ.) commit 9831e5916f6956377739f948869d377b091f5c92 Author: Martin Mares Date: Sat Jun 5 09:58:23 2004 +0000 Staticized lots of local functions. commit 598b984d1f04ea71fc04bc89f390f230a3960680 Author: Martin Mares Date: Sat Jun 5 09:58:06 2004 +0000 One less unused variable. commit 2f6de49f8c4d9c7ebd12554d386037e5b063beda Author: Martin Mares Date: Sat Jun 5 09:57:49 2004 +0000 Better prototypes. commit 54c411f6afeafb88649c565d252ab0245266eeee Author: Martin Mares Date: Sat Jun 5 09:57:35 2004 +0000 Add more warnings if --enable-warnings is turned on. (probably requires gcc-3.0 or newer, but I hope it's OK) commit 189dab54a211d2d92148d2aae7130df3a080e7c8 Author: Martin Mares Date: Sat Jun 5 09:29:38 2004 +0000 `defaut' should be `default'. commit 1512813e95a7edd2fad2834221dc1cb79aab6406 Author: Martin Mares Date: Sat Jun 5 09:28:17 2004 +0000 ... and a whole bunch of unused parameters and variables in ospf. commit c91fc9b6064e988e7526ecedd6b9e25f0204c4b7 Author: Martin Mares Date: Sat Jun 5 09:27:49 2004 +0000 ... and in rip (there are even unused functions!). commit 662faa4afc4d2f29bb884d0c7ad0aca9fc7de7c9 Author: Martin Mares Date: Sat Jun 5 09:27:35 2004 +0000 ... in pipe. commit e21423bab8a7cfc1cf5d13ab77ebebfae8ce156e Author: Martin Mares Date: Sat Jun 5 09:27:17 2004 +0000 ... in BGP. commit fab37e81971a08b550c6d63ff11f0bf34f0a9aa2 Author: Martin Mares Date: Sat Jun 5 09:27:02 2004 +0000 One more in the library. commit 6ecd20605c62e91069ecd014374836d8392ae948 Author: Martin Mares Date: Sat Jun 5 09:26:55 2004 +0000 ... and in the filter. commit d7390312d4e322e0dac3fefddd6033cb255933a4 Author: Martin Mares Date: Sat Jun 5 09:26:48 2004 +0000 Unused parameters in the client. commit 6578a60493f9dbf83d6485ac99635094bef2af7d Author: Martin Mares Date: Sat Jun 5 09:11:07 2004 +0000 Marked unused parameters in sysdep code as such. commit 7c103b1ee17a274fa062fcf4b14234b48db8123a Author: Martin Mares Date: Sat Jun 5 09:10:56 2004 +0000 Marked unused parameters in core code as such. commit e98bc2ea9b957287e78bc51e3293fc48a49c26b2 Author: Martin Mares Date: Sat Jun 5 09:05:12 2004 +0000 Renamed log() to log_msg(), but still keeping the old name as a macro. This is done to avoid clashes with gcc-3.3 which has built-in logarithms :) commit 5da8f82feb14512725e09664f6db96f03e3ece8f Author: Martin Mares Date: Sat Jun 5 09:01:12 2004 +0000 A better comment. commit c33d4cad9fbfb0b2a4b3ee699943d9955bcd9e3e Author: Martin Mares Date: Sat Jun 5 08:59:17 2004 +0000 Moved the tests for socket existence here. BTW, where do you exactly set the new buffer sizes? commit 4da25acb0ab964826f133025493a9b80d8bef509 Author: Martin Mares Date: Sat Jun 5 08:56:43 2004 +0000 Cleaned up sk_reallocate() and friends. Also, removed the `if (s)' test, because I believe that as the whole socket interface doesn't accent NULL pointers, sk_reallocate() shouldn't be the only exception. commit c6bdc78befaf5ae9e5e3c58a8df1301d5cafd4e7 Author: Ondrej Filip Date: Fri Jun 4 21:19:47 2004 +0000 Be more verbose. commit 6f3203fabf30b0e5ca7d41b4550efbc5df0b421a Author: Ondrej Filip Date: Fri Jun 4 21:05:43 2004 +0000 cleanup in lsupd.c, indenting, "struct proto" removed... commit 9b7de4c4d13a5701aac446627672e65fce9e1a9d Author: Ondrej Filip Date: Fri Jun 4 20:41:02 2004 +0000 'struct proto' removed Finally, I found the bug reported by Andreas Steinmetz. FIXED. commit 54467ed46b31e29215e50d32b0a757998de29793 Author: Ondrej Filip Date: Fri Jun 4 19:53:36 2004 +0000 Useless logs removed. commit 551e30886d7ed156d3fe98cc9562ffa2c22e4ce3 Author: Ondrej Filip Date: Fri Jun 4 19:21:19 2004 +0000 Bugfix in last patch. commit e7ef86a58cc5393ba764606b0ee6d760e6164f0c Author: Ondrej Filip Date: Fri Jun 4 18:51:29 2004 +0000 OSPF is ready for changing MTU. commit f158bb710b8be65b626f54399c8a5db8df9bd7b6 Author: Ondrej Filip Date: Fri Jun 4 18:24:15 2004 +0000 no comment commit 12bed559ffaccc7093188722899e4ac85521777e Author: Ondrej Filip Date: Fri Jun 4 17:49:25 2004 +0000 dbdes indent an minor changes. commit 85305e5d8f7137dc5ce4572d72e80ad186792b37 Author: Ondrej Filip Date: Fri Jun 4 17:32:38 2004 +0000 typo in README commit 874654076a9e3d2c36a248b3d3a4066dff76276b Author: Ondrej Filip Date: Fri Jun 4 17:31:03 2004 +0000 better log() usage. commit 27f49a2c3c2a86b4822ff1980d751666ed8cee97 Author: Ondrej Filip Date: Fri Jun 4 17:28:41 2004 +0000 lsreq.c indented and small 'struct proto' changes. commit 77539c4471d4b3f19347d2efc99680f815e1c78a Author: Ondrej Filip Date: Fri Jun 4 17:12:27 2004 +0000 hello.* reindented, code cleanup. commit 8e15e048f2e14dcdd9915860feace487e4ae07d5 Author: Ondrej Filip Date: Fri Jun 4 17:05:24 2004 +0000 Deleted useles "struct proto" sending. commit 7a03e29d5c7ff07c907ed0d4c4f1c226eba5941d Author: Ondrej Filip Date: Fri Jun 4 16:56:54 2004 +0000 Better log() usage. commit fb9bf6888c75adb88e5a8818161b89b207cf1f9f Author: Ondrej Filip Date: Fri Jun 4 16:55:53 2004 +0000 Indented. No other change. commit c76ba51a5fc7d61e18213f99d9c09502af0bc192 Author: Ondrej Filip Date: Fri Jun 4 16:30:04 2004 +0000 lsack.c cleaned. Better names for functions and DIRECT acks can be sent in one packet now. commit 28de5133ecdcb5b45dc251123047164fbb940e50 Author: Ondrej Filip Date: Fri Jun 4 15:45:35 2004 +0000 ackd_timer_hook moded to neighbor.c commit d03e8ce00b8fea374bbc06a4eb5254e911557e83 Author: Ondrej Filip Date: Fri Jun 4 15:26:46 2004 +0000 Fatal bug found. Sometimes BIRD did not originate router LSA. FIXED. :-) commit b90f9c526e553f1c30b9b177fc72c382ab333fc7 Author: Ondrej Filip Date: Fri Jun 4 14:23:58 2004 +0000 Initialize iterator on the right place. commit 18b40a40726bf6ec03e496a068faa8d173c27dd8 Author: Ondrej Filip Date: Fri Jun 4 14:23:21 2004 +0000 This can happen now. commit f9fdabe4f68685e6244e88524b2526958c56e44d Author: Ondrej Filip Date: Fri Jun 4 14:22:30 2004 +0000 Small reversing of previous patch. commit 3df1e80464ce5e6cea1b9a9500d1adbfe59cd564 Author: Ondrej Filip Date: Fri Jun 4 14:21:08 2004 +0000 Don't repeat "Sheduling rt calc....." commit d6c28f3ada7d2da8e762a1ed8e4fb70dfce2ca6f Author: Ondrej Filip Date: Fri Jun 4 14:03:30 2004 +0000 Code and comments cleanup. commit 39e517d47c6070dd81bb7d6f57358ea98e462f03 Author: Ondrej Filip Date: Fri Jun 4 12:53:10 2004 +0000 hello.c and hello.h cleaned up. No design changes. commit 591656cdd5b13a4626dfb26e45dd02690cdb450c Author: Ondrej Filip Date: Thu Jun 3 08:18:49 2004 +0000 Added source addr for multicast socket. commit 7d72aadb8acfac16e9b637e6ebb5ce288ebf1d77 Author: Ondrej Filip Date: Thu Jun 3 08:18:14 2004 +0000 CONFIG_SKIP_MC_BIND added. BSD hates it, Linux needs it. commit cb4dd4e2f78f806438bfb8163b783ac7b2f43b2d Author: Ondrej Filip Date: Wed Jun 2 15:14:49 2004 +0000 Deleted useless rfree. (Socked was freed by cli_free()) commit 9b133458891724da2fd22f2a16ae19376e225ca0 Author: Ondrej Filip Date: Wed Jun 2 09:14:03 2004 +0000 Hotfix for router's parent without nexthop. It will probably work perfect, but I need to eliminate such situation. commit f9625e9acabbdc5834f528e6fe1b87b8f4ce4968 Author: Ondrej Filip Date: Tue Jun 1 14:06:25 2004 +0000 Bugfix in external routes calculation. commit 7048461df113b335b9cfc56c517bc5802ef7b6c8 Author: Ondrej Filip Date: Tue Jun 1 13:58:39 2004 +0000 Code clean up. commit e8bf6c0766dba95c4b7ebb8b29dad31392f212b7 Author: Ondrej Filip Date: Tue Jun 1 13:44:53 2004 +0000 Easier cleanup of an interface. commit c9f6cf8a05aba6a79bfb57120ca48adcf8e3949d Author: Ondrej Filip Date: Tue Jun 1 13:29:08 2004 +0000 Don't free socket's resources. commit 035f6acbfec1e06a207217ae81153b67ced995f3 Author: Ondrej Filip Date: Tue Jun 1 13:12:10 2004 +0000 Patch from Andreas Steinmetz commit 8281ff201e1eebe35cb8e7716565361bed77a6cd Author: Ondrej Filip Date: Tue Jun 1 12:57:13 2004 +0000 Reverting last patch. commit 77772dbc6555dfb9aa76c812bcd1792ab503cbe1 Author: Ondrej Filip Date: Tue Jun 1 10:55:10 2004 +0000 Caching loopback interface. commit a8bb459a3f8769501726ef25e696ea127014383f Author: Ondrej Filip Date: Tue Jun 1 10:53:30 2004 +0000 log->DBG commit 1554cc02826794007c113bc336ed574bb771343f Author: Ondrej Filip Date: Tue Jun 1 10:45:28 2004 +0000 Minor changes caused by MJ's comment. commit b613b9928bdb1df3bd541d318d7f9c1bf492dfbc Author: Ondrej Filip Date: Tue Jun 1 10:32:02 2004 +0000 #ifdef CONFIG_UNIX_DONTROUTE added. commit 7fdd338c3600aa4e7a0ae3d5ce270b5a1f8ccc0c Author: Ondrej Filip Date: Tue Jun 1 10:28:25 2004 +0000 ALIGN -> BIRD_ALIGN commit 22122d4d4c43c2c64a37aae597b4d439a6bfa268 Author: Ondrej Filip Date: Tue Jun 1 10:10:09 2004 +0000 Now, only one AC_OUTPUT is used. commit 402a9fa78a9849dbbefcbea81cd9cf7c8ab87c22 Author: Ondrej Filip Date: Tue Jun 1 09:10:11 2004 +0000 Useles log()s deleted. commit e85bd57a0e106c7ae3fc44dccf9bac89e2f9939e Author: Ondrej Filip Date: Tue Jun 1 09:07:16 2004 +0000 bzero has 2 arguments. commit b88a1d4040df6bcd49eefe1c2c1ba8fa66ad0d43 Author: Ondrej Filip Date: Tue Jun 1 08:59:47 2004 +0000 memset -> bzero commit fa643be1cc6973923a46ac52a20ccec2ec5e3f18 Author: Martin Mares Date: Mon May 31 22:24:42 2004 +0000 Updated the distribution script. commit bb68ad2fd34dc6ab8723ae1c9c37f9dc19ed85ea Author: Martin Mares Date: Mon May 31 22:22:21 2004 +0000 Documented the pxlen parameter. commit 3810eccf6bc5af413d883fd298d59e0d7bdb96ea Author: Martin Mares Date: Mon May 31 22:16:54 2004 +0000 Added a simple utility for converting CVS log messages to a reasonable changelog format. commit ea0ac8f69aec4eff8109eb3d74cc0ca5a330fa58 Author: Martin Mares Date: Mon May 31 22:00:18 2004 +0000 Move CLI socket to the newly created CLI's pool. (thanks to Andreas for the original idea) commit 38a608c55af7654f23c9a16129ab6211aac3b7ab Author: Martin Mares Date: Mon May 31 21:48:19 2004 +0000 Rewritten the I/O loop. All socket operations are now safe, meaning that you can delete the socket from anywhere in the hooks and nothing should break. Also, the receive/transmit buffers are now regular xmalloc()'ed buffers, not separate resources which would need shuffling around between pools. sk_close() is gone, use rfree() instead. commit 206f59dfa8e59e32f4aef12dacb0804581b9f602 Author: Martin Mares Date: Mon May 31 21:02:09 2004 +0000 Added UNUSED. commit 6a57bb311018570b6ee7beccafd2075108e346cb Author: Martin Mares Date: Mon May 31 20:57:38 2004 +0000 Killed a couple of unused variables. We really should compile with warnings enabled. commit d83faf8dc441259183d87c6669e76e4addc61b21 Author: Martin Mares Date: Mon May 31 20:53:22 2004 +0000 static declarations don't belong to includes. (And most of them were redundant anyway.) commit 7deffd845a0f2bfe4cebbb01e0505314af32693a Author: Martin Mares Date: Mon May 31 20:51:45 2004 +0000 Need for tcdrain(). commit 9f387e11a319ea55104c6e8362f9820bf1b00097 Author: Martin Mares Date: Mon May 31 20:49:11 2004 +0000 Make the check for work with recent libc's. commit 0757bcb728c8bd56fa03ea296862d62e05f6ba09 Author: Martin Mares Date: Mon May 31 20:35:19 2004 +0000 One space more. commit 2cc37815ae1f194c5a0c51e5761377caea9cc164 Author: Martin Mares Date: Mon May 31 18:47:19 2004 +0000 Added rmove() (by Andreas, tweaked by me). commit 0077aab4f9041e4d05d2d6916edfb0e15738cb37 Author: Martin Mares Date: Mon May 31 18:16:42 2004 +0000 The code was broken for external /29 to /32 routes. Assuming that you have one machine publishing a route to 10.1.1.3/32 and another one publishing a route to 10.1.1.4/32. If the first machine went down the route to 10.1.1.4/32 was wrongly killed by the old code, leading either to missing routes or worse to bug()s like "Router parent does not have next hop" or just segfaults. The patch fixes this but in the long term a redesign is required here. Note that the patch doesn't worse the situation, instead it prevents the problems stated. The redesign is required to handle multiple routes to small subnets properly. (by Andreas) Feela, I think that this is at least a good temporary fix, but it's of course up to you to decide. commit 4ef3dccfa112faddf79fed76a539353b705702b5 Author: Martin Mares Date: Mon May 31 18:13:14 2004 +0000 The OSPF authentication type was sent in host byte order instead of of network byte order thus breaking interoperability with other routing daemons on litte endian machines. The patch fixes this but note that this breaks compatability with older bird installations using OSPF and password authentication (Andreas) commit 3cb96cd343196baabf847f5d670711162e66e298 Author: Martin Mares Date: Mon May 31 18:11:16 2004 +0000 The initial sequence number for RIP md5 authentication was always zero. Bad as when bird e.g. was running for two weeks and then restarted it would take another two weeks until the peers of this router would accept data again from this router, as the sequence number would be too low. Changed to use the the current system time as the starting sequence number which is a more sane start value. (by Andreas, cleaned up by me) commit 277a34eff195fe39a63db59731f5f2c8d54abdb2 Author: Martin Mares Date: Mon May 31 18:08:50 2004 +0000 Small correction to va_start/va_end in cli_printf (va_end was missing). (Andreas) commit 5f2a6a9ff324d846c86ffafb60ae5a4c01d06313 Author: Martin Mares Date: Mon May 31 17:55:30 2004 +0000 Fix handling on full pipe to client in bird. Prevent packet overflows for even only medium sized route table output. Fix a strange garbled output problem in the client. The latter seems to be caused by some library doing tcflush while there is still command output pending. So the best fix here is to do fflush and then tcdrain. Note that this problem occurs only under certain load situations and is not too easy to reproduce. (by Andreas) commit a4ffe2739d1a3efb45f209b63b2b6faa558e43a9 Author: Martin Mares Date: Mon May 31 17:53:02 2004 +0000 Bird's control socket should be in /var/run and the convention for --localstatedir is /var. The control socket pathname creation is thus corrected here. (Andreas) commit 03e3d184b2d8fac4c82408b1ac1738cb7af5680e Author: Martin Mares Date: Mon May 31 17:44:39 2004 +0000 Fix bison input for current build tools, otherwise bison or the compiler will abort the build. (by Andreas) commit 4a02013767ab05b9cf7567c09e5fad59c9bd1c10 Author: Martin Mares Date: Mon May 31 17:42:38 2004 +0000 Make RIP nolisten mode actually work. The socket is required for sending, the received data has to be discarded instead. (patch by Andreas Steinmetz modified by me) commit 1bd897dd33a49bd03f661e84687f8bba25af2983 Author: Ondrej Filip Date: Mon May 31 17:27:21 2004 +0000 Changed of comments. commit 10af3676ea4268452776acd7b06a95c72d71f2e0 Author: Ondrej Filip Date: Mon May 31 17:16:47 2004 +0000 Grrr, committing too fast. #include "alloca.h" -> #include "lib/alloca.h" commit 7dbd4fd332bb614db858944da86b29c86d9b1d81 Author: Ondrej Filip Date: Mon May 31 17:13:58 2004 +0000 alloca.h added commit 0e6eef620d4b838fc558711cd2d5572ec7a576c2 Author: Ondrej Filip Date: Mon May 31 17:07:05 2004 +0000 Use #include "alloca.h" commit c222500d8e098f0504405724b56676a2efc0861f Author: Ondrej Filip Date: Mon May 31 17:00:22 2004 +0000 Previous change was mistake. commit 6f18235aad187ed9e2afbb166b34c5cc3765b430 Author: Ondrej Filip Date: Mon May 31 16:42:12 2004 +0000 Useless include deleted. commit f54fa9e15dce42b8c80b7ea95ab2653cc5be4e4e Author: Martin Mares Date: Mon May 31 16:10:01 2004 +0000 Updated copyright notices. Also testing whether syncmail works. commit 73219ecfecbf2851e1a3b6c4a1084b2eaa6d159c Author: Ondrej Filip Date: Mon May 31 15:13:56 2004 +0000 Delete autom4te.cache in 'make distclean'. commit 6de62923120c1dba8461aed8aed95eff433fcf4a Author: Ondrej Filip Date: Mon May 31 15:08:29 2004 +0000 Better readline checking. commit 012279f395a7cb87a3085b6c4674777da7ee9661 Author: Ondrej Filip Date: Mon May 31 13:59:03 2004 +0000 Some include added. commit d93fb7e6b9a1d2964bc926ca9ed7ab11f5003c1d Author: Ondrej Filip Date: Mon May 31 13:58:38 2004 +0000 #ifndef ALIGN - it is defined on *BSD commit a60277b9997a891fdc5d62e07ac96885c009f531 Author: Ondrej Filip Date: Mon May 31 13:35:06 2004 +0000 Added RTD_NONE /* Just for internal use */ commit 0c745adc8003ac816be15e2246fa4685e127d120 Author: Ondrej Filip Date: Mon May 31 13:34:20 2004 +0000 #ifdef ALLOCA_H commit bd62eeca27aba7da34a65a8f039d1b011115ddca Author: Ondrej Filip Date: Mon May 31 13:32:58 2004 +0000 Small change to compile client on FreeBSD. commit b1a1fabac70201e9b05aeb9fd6af703f0fbffdb4 Author: Ondrej Filip Date: Mon May 31 13:25:00 2004 +0000 *BSD port added. (Tested on FreeBSD and NetBSD) commit 781aa475aaa7503d4a86f0d4b8771cd027d30c04 Author: Ondrej Filip Date: Mon May 31 13:22:49 2004 +0000 Minor bug fix in neighbor state machine. commit de259a41e3175d4080d5a33a39f0279308a25b56 Author: Ondrej Filip Date: Mon May 31 10:38:44 2004 +0000 Minor bug in configuration. commit 7cb37e6fd2d9fb5723d6f680d0e064e4ba9c6091 Author: Ondrej Filip Date: Mon May 31 10:26:18 2004 +0000 Added some more test (alloca.h, sa_len) etc. Add AC_OUTPUT before AC_OUTPUT_COMMANDS commit caeb02ea19b8b3b04bc9705d5270954bfc21cab6 Author: Ondrej Filip Date: Wed May 19 12:30:58 2004 +0000 Bug in DBDES receiving fixed. commit 502ded521508a402910b2bf8f23f2e34f79f91cb Author: Martin Mares Date: Sat Dec 6 16:41:11 2003 +0000 Fix reporting of RIP socket errors. Thanks to Eric Leblond for the patch. commit 37299f1e442f5ca23fd9124d9645096c5a6f7536 Author: Ondrej Filip Date: Tue Sep 30 17:05:55 2003 +0000 OSPF was not able to be built stand-alone. commit 00bd27a1cc8eee6df626a7441cc548e82bf42c4c Author: Ondrej Filip Date: Sun Sep 14 13:41:24 2003 +0000 Endianity problem fixed. Thanx to Sörös József commit 35a86ceb4082d8d31e6949f8d454eaa28c498a86 Author: Ondrej Filip Date: Wed Sep 3 17:31:23 2003 +0000 This prevents infinite loop when bird has more that 60 neighbors. Thanks to Rani Assaf commit bf135bcb1feca7b9ee35342c239ed3a66415d854 Author: Ondrej Filip Date: Mon Sep 1 08:46:07 2003 +0000 Prepared for release 1.0.8. commit c11007bc423188872d37e277fe4637094a40d90f Author: Ondrej Filip Date: Tue Aug 26 10:41:02 2003 +0000 Endian-related bug fixes sent by Krzysztof Szuster commit 1d1a3c1c2a72ef91b785f5ed08ca5ab3f001b14e Author: Ondrej Filip Date: Sat Aug 23 10:47:46 2003 +0000 Minor OSPF changes for faster startup. commit baa5dd6ccc14eb6bc43fad37a2bfe88ad190c0fa Author: Ondrej Filip Date: Sat Aug 23 10:42:41 2003 +0000 Many spelling mistakes fixed. Thanks you Harry Moyes. commit c197d44e1790ab1738cf9e438c2c91bd74e9b94e Author: Martin Mares Date: Wed Aug 13 22:07:55 2003 +0000 This probably IS the memory leak we're looking for. Alien routes weren't correctly disposed of. commit 13b75bacf7221eb655dcbed54e3c3605bea5169e Author: Martin Mares Date: Wed Aug 13 20:04:39 2003 +0000 protocol->import_control() could potentially call rte_cow() as well. AFAIK it doesn't happen in any of our protocol, but better be sure. commit 2adab6ae9cc586871a8854e51452839cb1dd1db0 Author: Martin Mares Date: Wed Aug 13 19:31:22 2003 +0000 This was a potential memory leak, but not the one Feela observed. This one could happen when an import filter of some protocol modified the rte (so that it would be rte_cow()ed) and later rejected it. commit b77834b3f41e551adc045d23f387533d428349ae Author: Martin Mares Date: Sun Apr 6 21:36:35 2003 +0000 Slept for a year :-) commit c153ee91373438095ae6ec18e2dfb9f334d2dfe6 Author: Martin Mares Date: Sun Apr 6 19:52:22 2003 +0000 Nobody is perfect. Me twice :) commit 8edd56bded8ffc7fabbce690133892de6dcd5f62 Author: Martin Mares Date: Sun Apr 6 19:49:17 2003 +0000 Oops, forgot to change some paths. commit d02b7a738eb94d031b106319f3af259717c80fe0 Author: Martin Mares Date: Sun Apr 6 19:49:02 2003 +0000 More news. commit f2c642e0e5c266f8b955cfa5aec785c3f96c5ed5 Author: Martin Mares Date: Sun Apr 6 19:46:42 2003 +0000 We're 1.0.6 now. commit 0e41e34a231198498289e367b93b3e9b99d5eb2e Author: Martin Mares Date: Sun Apr 6 19:45:55 2003 +0000 Avoid problems with copying a directory to itself. commit f240a133b32db88c98ad5a7f9d72fdb909311af6 Author: Martin Mares Date: Sun Apr 6 19:42:28 2003 +0000 Releasing version 1.0.6. commit 9c7631235ac174ebd33a3e04e07211b3ae8501f6 Author: Martin Mares Date: Sun Apr 6 19:35:50 2003 +0000 Updated the documentation building tools to work with a recent linuxdoc-tools package. Note that this is (and always was) a terrible hack and we really should replace it with something reasonable which wouldn't need changing every time linuxdoc-tools evolve. I also needed to include a patched version of LinuxDocTools.pm, because the original one explicitly refused to work with a non-linuxdoc DTD. The authors of linuxdoc recommend to use sgmltools-lite in such cases, but it would mean rewritting our formatting rules to the DSSSL language which I don't dare to speak about here :) commit a9aa5887f3b9b43d9a3a5617ef9176da936ce35f Author: Martin Mares Date: Sun Apr 6 18:55:37 2003 +0000 Added release history. commit 8cf76fa8536e52a5c90d500ac1d74f49d87e905d Author: Martin Mares Date: Sun Apr 6 18:38:01 2003 +0000 Bug fixes to authentication code by Eric Leblond . commit d85e1f0e2f389d273ff14e89faced390b76d842b Author: Martin Mares Date: Thu Feb 27 10:48:30 2003 +0000 Prefix comparison bug (hopefully) fixed. commit 6ea8ca1469a9c9150a4e0be9f8e6ab025eee990a Author: Martin Mares Date: Sun Feb 23 10:22:04 2003 +0000 Updated a comment. commit abf06173a3d84559dd26d2a78a1e5df9656a4d80 Author: Martin Mares Date: Sat Feb 22 23:06:32 2003 +0000 Current Linux kernels don't remember rtm_protocol for IPv6 routes and supply RTPROT_BOOT instead. Work around that. commit 11d4474c17e76e9811dcb32f555fa1c6f3684fab Author: Martin Mares Date: Sat Feb 22 22:47:45 2003 +0000 Better selection of link-local NLRI addresses, at least for our own address. Need to do it better for the other neighbors -- the current solution works only if they use the standard 64+64 global addresses and the interface identifier in lower 64 bits is the same as for the link-scope addresses. commit 7b7a7b43a6915efbe9180f07cd1284a39efacf02 Author: Martin Mares Date: Sat Feb 22 22:39:06 2003 +0000 There can be multiple primary addresses with different scopes and only the highest scope one has IA_PRIMARY set, so report the remaining ones as "Unselected". commit 8001948b43c9367e86473630f58527249d7da04f Author: Martin Mares Date: Sat Feb 22 22:38:15 2003 +0000 Report link-scope addresses as well. commit 8c92bf6a0ddc21f2fa19c195a73d43837f60fc23 Author: Martin Mares Date: Sat Feb 22 10:40:35 2003 +0000 Temporary fix for BGP protocol capability announcement for IPv6 mode. commit 60a72ed49b36aea732d3584527040a7b3b0e72e0 Author: Martin Mares Date: Sat Feb 22 10:25:22 2003 +0000 Fixed length check miscalculation in IPv6 receive path. commit 47f18ac39a313cf213b43320557239c5d0855a11 Author: Martin Mares Date: Wed Nov 13 08:47:19 2002 +0000 ABS should be a macro. commit 7d875e094bbbb9d4b234e31fe08f31510ac1d7d0 Author: Martin Mares Date: Wed Nov 13 08:47:06 2002 +0000 Added missing includes. commit de10a974f2e2e8a11b6a6852cd770c1096e1c25d Author: Martin Mares Date: Wed Nov 13 08:46:12 2002 +0000 Added missing semicolons. commit 59b96d7b4d8a055aa77917099b358cfc7b5e0731 Author: Martin Mares Date: Wed Nov 13 08:45:24 2002 +0000 Don't use obsolete functions which are no longer declared in the header. commit a19cd811000902facceff5a30facf7dba9cb2095 Author: Martin Mares Date: Wed Nov 13 08:30:56 2002 +0000 Added missing #include and wondering how could it ever compile. commit 19bd5c8e2c0fd47ff27668b8c45acc79f4d703b4 Author: Pavel Machek Date: Sat Sep 21 13:57:48 2002 +0000 Password does not need to be null-terminated, do not print garbage in such case. Thanks to silvio@big.net. commit 4ca0d0847e015bbecf6db3cec8f3ce57c2d8035c Author: Ondrej Filip Date: Wed Apr 3 15:41:05 2002 +0000 Small typo fixed. commit 53a50af50427e2fedc4bbfeca7a5934a798a3827 Author: Martin Mares Date: Sun Mar 10 12:32:12 2002 +0000 Applied Pavel's fix for broadcast/multicast mode. commit e59e310e6435c6c72b585c6f4b5e6c9bbd006553 Author: Ondrej Filip Date: Mon Mar 4 15:54:39 2002 +0000 Age LSA DB after LSA origination and before routing table calculation. commit 025b0e856a85dcae755e97922febc190145ba89c Author: Ondrej Filip Date: Mon Mar 4 15:52:40 2002 +0000 New trace added. commit b78696282de32a202a9bed304f8edf044833f36f Author: Ondrej Filip Date: Fri Dec 7 17:34:09 2001 +0000 Bugfix in router importation. commit 30c34a10797c2773a0b99e71b22f111ee2a7f980 Author: Ondrej Filip Date: Fri Dec 7 17:10:49 2001 +0000 Small bugfix in RIP documentation. commit 8e32493c56a49f10a6949985d5b0bb4dbcbe204d Author: Ondrej Filip Date: Tue Aug 21 17:00:15 2001 +0000 Removed some useless (hope!) code in next hop calculation. commit 68db89a2ce35a96aef827f4e86c5dfd82842f9d7 Author: Ondrej Filip Date: Tue Aug 21 16:44:57 2001 +0000 Finally, next hop problem fixed. commit 37da55168cdb0f562266eff4b821f6e576d93931 Author: Ondrej Filip Date: Tue Aug 21 15:03:42 2001 +0000 Useless trace. commit e8ab16803065894497dd306c941b0815fac5b25a Author: Ondrej Filip Date: Tue Aug 21 15:00:29 2001 +0000 Hope, bug in next hop calculation for stub routes fixed. commit e43ae6330eaf349eafe6820465c85266eef80e07 Author: Martin Mares Date: Sun Aug 19 11:15:24 2001 +0000 Fix %I format strings. commit 30b773041c37d10649a16d5f28af00a25871aac7 Author: Martin Mares Date: Sun Aug 19 11:11:44 2001 +0000 IP address formatting now uses the same rules as formatting of strings with two exceptions: o Any non-zero field width is automatically replaced by standard IP address width. This hides dependences on IPv4/IPv6. o %#I generates hexadecimal form of the address. Therefore |%I| generates unpadded format, |%1I| full size flush-right, and |%-1I| full size flush-left format. commit 16319aebd30da5161bed95d72094250228a7f61c Author: Ondrej Filip Date: Sun Aug 12 00:09:47 2001 +0000 Dokumented switch network. commit c926eee72471d8127ff833548b0ce1f8cb6de276 Author: Ondrej Filip Date: Sun Aug 12 00:04:42 2001 +0000 Area networks added into configuration. commit b2bdb4065667f466575b831f4a3166bd309d9d14 Author: Ondrej Filip Date: Sat Aug 11 16:22:29 2001 +0000 Changed definition of stub area. commit 85062e8a600cc7896b8bcaf3960bb782aa9f2ff0 Author: Ondrej Filip Date: Sat Aug 11 14:40:51 2001 +0000 Bugfix in B-bit setting in router LSA. commit 78e2c6ccf16b41bc19a4cd69f959c8ae47e68b9d Author: Ondrej Filip Date: Sat Aug 11 14:01:54 2001 +0000 I will not originate the same lsa before MINLSINTERVAL. commit 5fc7c5c51344a8cc1fae2cc9077c2c331c1e419a Author: Martin Mares Date: Fri Aug 3 08:44:51 2001 +0000 Don't loop forever when trying to skip an out-sequence netlink reply. commit 24c00cb11915edb8c13dbc21f245a73fc34689ed Author: Ondrej Filip Date: Tue Jun 12 21:10:30 2001 +0000 Install route into main routing table just if it's necessary. commit c48b33292b6d39cdacd642565907c0d5b90adc68 Author: Ondrej Filip Date: Sat Jun 9 15:13:38 2001 +0000 Yes, 1.0.5 released. commit 87c450dffcbcc76270c95b4c923838445cd6816b Author: Ondrej Filip Date: Sat Jun 9 14:56:01 2001 +0000 Added comments. commit e9d3c3aaea24724c285027154bd9f5ddef8394e0 Author: Ondrej Filip Date: Sat Jun 9 14:55:10 2001 +0000 Bug in next-hop calculation fixed. (For dual connected neighbors.) commit ea31425a6191f0b3e181f8a1c7368fc4dfca24b4 Author: Ondrej Filip Date: Mon Apr 9 19:15:03 2001 +0000 Patch from David Rohleder thanx. commit 01b776e117d21ccfef996fd91c014c6e14a458a7 Author: Martin Mares Date: Tue Mar 6 13:40:39 2001 +0000 Fixed vs. problems. commit 27e993fb4ecc310a83da3a74b21b15c32c207a09 Author: Martin Mares Date: Tue Feb 20 09:49:19 2001 +0000 Fixed duplicity in log category numbering. Thanks to Zheng Yuan for spotting this. commit 4d04187465fdeb3fb755b4d01ec640bbe0e36eb9 Author: Martin Mares Date: Fri Jan 19 20:30:08 2001 +0000 Added paper for my talk about BIRD at SLT 2001. commit 0766e962e9a9539ceccd23090e5bb8e1301fce8c Author: Martin Mares Date: Wed Jan 17 08:32:28 2001 +0000 Bug fix from Zheng Yuan . commit a2d01907c5b24bab78cc055fa23354597bd44a03 Author: Martin Mares Date: Mon Jan 15 09:24:16 2001 +0000 Added an explanatory comment. commit 8c6ce98b9d9b5c4970e902cf667c1ffb64f04a62 Author: Martin Mares Date: Mon Jan 8 11:13:01 2001 +0000 Fixed infinite recursion in password_same. Pavel, please check. commit 32749f493fdaea31f70d8586597febacd2c511d9 Author: Ondrej Filip Date: Thu Dec 14 01:04:51 2000 +0000 Hmm, nasty bug, LSUPD was not well flooded via PTP interfaces. :-( commit 501c5bb03fabd3d5721cfd8c82298f729d79e7a3 Author: Ondrej Filip Date: Tue Nov 21 23:47:51 2000 +0000 Small bugfix in ext routes calculation. commit a5096a1bdebe217eb0d04a95489562ac132f4552 Author: Ondrej Filip Date: Wed Nov 8 22:46:54 2000 +0000 Yet another nasty bugfix of iface_patts_equal(). commit 0639f7263a9a73cce6948cad23cd2d4858d36c5b Author: Ondrej Filip Date: Wed Nov 8 17:06:35 2000 +0000 Bugfix in iface_patts_equal. When both patterns were NULL strcmp it sigfaulted. commit 482bbc7396268fce66e8ecb59f248bc51229cdc9 Author: Ondrej Filip Date: Sat Sep 9 19:21:01 2000 +0000 Minor rpm changes to make RedHat happy. commit 52fa3e386948b13b928ff9be778a7de62a00ceb3 Author: Ondrej Filip Date: Mon Sep 4 21:21:34 2000 +0000 Fixed many bugs in rt calculation and interface adding. Now it seems to be OK, I'm going to advertise 1.0.4. commit b02e40111ea8d97bf1c3bfa25970ee0d828cd7bc Author: Ondrej Filip Date: Mon Sep 4 19:42:17 2000 +0000 I allocate struct ifa before unlocking. So route exported to OSPF are correct. I work also with interfaces that have some problems with socket opening. I declare them as stub. commit fdb19982020abeddf2d9eb73efae92ae2cc58d93 Author: Ondrej Filip Date: Sun Sep 3 22:18:40 2000 +0000 Serious bug in ext lsa origination found. Going for 1.0.4. commit f02e4258b9bb7f823ddfbfb88284c868502b1433 Author: Ondrej Filip Date: Sun Sep 3 18:27:21 2000 +0000 Some misspells. commit 43dff480efcc85bf32327b07c3c53c9c68cb3941 Author: Ondrej Filip Date: Sun Sep 3 18:13:00 2000 +0000 Version 1.0.3. commit 19e930a9bbcc2dfdb87c8ada1a54ac4563a0cad6 Author: Ondrej Filip Date: Sun Sep 3 17:53:12 2000 +0000 Version 1.0.3 released. commit f82e9bc3744f9ff5aa05d08a18fd03e46fb08b6f Author: Ondrej Filip Date: Sun Sep 3 16:21:14 2000 +0000 Another atrey->atrey.karlin.mff.cuni.cz commit 1e972b5524ff1ad28f4013632253a851c3559fc9 Author: Ondrej Filip Date: Sun Sep 3 16:16:33 2000 +0000 Log some unusual situation. commit 76460860ece8ce43a42da7cb2342e57f553b646c Author: Ondrej Filip Date: Sun Sep 3 06:54:35 2000 +0000 Small bugfix. (Use atrey.karlin.... instead of atrey.) commit e3bc10fdc49266db827af4e4062e639862037eb6 Author: Ondrej Filip Date: Sat Sep 2 08:54:40 2000 +0000 Added stub interface. (Interface which is propagated to OSPF but it does not sends nor listens packets.) I added some new options, please look at it and look into doc if it's OK. commit 5ddec4e6cfef8e5867d7440693894517f955e96f Author: Ondrej Filip Date: Sat Sep 2 07:58:05 2000 +0000 Reconfigure poll interval. commit 7cedbf217e8ce8a8669f31b1ee38e5f9ccb4eefd Author: Ondrej Filip Date: Sat Sep 2 00:15:07 2000 +0000 Reconfiguration for new options. commit e7e2878b744f415df9fcef291da67975da4dfc29 Author: Ondrej Filip Date: Sat Sep 2 00:14:46 2000 +0000 More examples. commit a190e7200bf37ba834c776a28583bf897b4377f5 Author: Ondrej Filip Date: Sat Sep 2 00:03:36 2000 +0000 Added hellos on NBMA networks. (I don't violate RFC now.) commit 94e2bbcc72f69edbcb3ce66ffa52998f374243c5 Author: Ondrej Filip Date: Mon Aug 28 14:32:11 2000 +0000 Better ospf metric explanation. commit 5a063efeea11a80e865e9fa4b5e13c4ca8514b51 Author: Ondrej Filip Date: Mon Aug 28 13:51:13 2000 +0000 Bugfix in ext lsa importing. commit 8b6b49239f409571486ae9589bcd57f706421517 Author: Ondrej Filip Date: Fri Aug 25 12:26:03 2000 +0000 Minor bug. It does not work on non RH systems. Thanx to Craig Bourne commit 6cf7e97abe05ee8943f8a2d300e1c46038b95df1 Author: Ondrej Filip Date: Thu Aug 24 20:08:00 2000 +0000 Added files for RPM building. commit a24e3157628ade4c0c0c380094bec898b630b2ee Author: Ondrej Filip Date: Wed Aug 23 06:51:26 2000 +0000 Released as version 1.0.2. commit 9e2920824e13739a9169153f0164e6a4fe4adc1d Author: Ondrej Filip Date: Fri Aug 18 16:47:27 2000 +0000 Typo. commit f321a61f77262d33dd43d50136c8116ebf8139c6 Author: Ondrej Filip Date: Fri Aug 18 16:44:37 2000 +0000 Fixed bug in nex hop calculation of external routes. commit 88aa2af7effa3752d033ccab5e18fb1303603585 Author: Ondrej Filip Date: Fri Aug 18 16:36:54 2000 +0000 Just formatting. commit 28a6e1aa0ee17cee6aaad67d7433cb8038062582 Author: Ondrej Filip Date: Thu Aug 17 19:42:52 2000 +0000 Stupid bug in next hop calculation of external routes. commit 1eec76077814fbe06879026809759dd5f5b8655f Author: Ondrej Filip Date: Wed Aug 16 20:18:19 2000 +0000 Typo in rte_better. commit 059fc1e94abcd658e9340313ffd080c5829ba8ef Author: Ondrej Filip Date: Wed Aug 16 19:37:04 2000 +0000 My calculation of external routes violated rfc. :-( commit d6a7e2fb8590660c00e984ff41d2e668d2ead69b Author: Ondrej Filip Date: Wed Aug 16 19:03:06 2000 +0000 Bug in rte_better. commit e7894eceded6ea1f757829a8845863c57660c9dd Author: Martin Mares Date: Mon Jun 26 20:02:30 2000 +0000 Added slides for our presentation, but don't export them to the distribution tarball -- they are in Czech and therefore of no use to almost anybody :( commit 2084109a3734227f0dcc21f3c8915a983ad9d586 Author: Martin Mares Date: Wed Jun 21 22:11:29 2000 +0000 Include CVS ChangeLog in the distribution commit fc12a680b1102ae1b620180417ef8b0272b11bed Author: Martin Mares Date: Wed Jun 21 22:08:46 2000 +0000 Released as version 1.0.1. commit ad3907559c196ee39906d527ea4f3372beb6e6c5 Author: Pavel Machek Date: Wed Jun 21 19:40:46 2000 +0000 RIP bugfix commit 2836ce3951bbdda62c3dddd509669127f46e776d Author: Martin Mares Date: Wed Jun 21 09:58:09 2000 +0000 Check broadcast address sanity before believing it. commit bcbdcbb6ae7256e01165220bb3b2d5b72850f665 Author: Martin Mares Date: Tue Jun 20 07:49:08 2000 +0000 Don't accept incoming connections when the neighbor is not up. commit f9eb8f7e066970d56a814128fd49170348a7fbd8 Author: Martin Mares Date: Mon Jun 19 23:50:02 2000 +0000 If compiled with --enable-debug, don't even try to log to syslog unless the user forces it in the config file. commit 972fdb45323b75af254cfe6c912c52d3596a230a Author: Ondrej Filip Date: Mon Jun 19 15:12:50 2000 +0000 Routing table calculation clean up. commit ca00d4a13a7207da1ea3acf1f0e38ddc27669a4d Author: Martin Mares Date: Sun Jun 18 19:49:32 2000 +0000 Fix numbering of routing tables in IPv6 version. commit 4daf03e5138dea8e5c409ab20a07f35667caa89e Author: Martin Mares Date: Fri Jun 16 23:12:47 2000 +0000 Use our own SUN_LEN if libc doesn't provide it. commit 365211d5886ec59a543e9fbc2151d6218561c18c Author: Ondrej Filip Date: Tue Jun 13 19:03:41 2000 +0000 Bugfix in logging. commit dd44b2ce90950033c5c5419db67a1d53fb177f71 Author: Martin Mares Date: Fri Jun 9 07:52:57 2000 +0000 bird-1.0.0 has been released. commit 5ddf4a58f9c4173acefa1df92ccd3da90230a863 Author: Martin Mares Date: Fri Jun 9 07:32:57 2000 +0000 During initialization, log to both syslog and stderr. When a configuration file has been read and it doesn't specify any logging, log to syslog only (if syslog is not available, then stderr). commit 0b3bf4b1d898b4e438fe4959a63fc16211baff12 Author: Martin Mares Date: Fri Jun 9 07:30:22 2000 +0000 Use SUN_LEN() for length of UNIX domain addresses. This should fix problems with connection to clients on libc5 machines. commit 0e376168c570507c8cb64b143eff0049442e201e Author: Martin Mares Date: Fri Jun 9 06:54:01 2000 +0000 Shut up an uninitialized variable warning. commit 1aa2a9c8351d6121124831f503306ff6869bbf39 Author: Martin Mares Date: Fri Jun 9 06:49:43 2000 +0000 Added a `What is missing' section. commit 4386360bd9f71b159497ac3b671b4e3d117a6b73 Author: Martin Mares Date: Fri Jun 9 06:46:58 2000 +0000 Before building distribution tarballs, make distclean first. commit 2d176ac5d22b08c25ac277821e3daef3a6f2ae23 Author: Martin Mares Date: Fri Jun 9 06:45:48 2000 +0000 Released as 1.0.0, but marked it as a BETA version. commit 99955b54be850fad280a556ca80dc21374d2c5b7 Author: Martin Mares Date: Fri Jun 9 06:31:43 2000 +0000 Proper building and installation of documentation in the Makefiles. commit a012cbb16f3d73ca7ffafe6f7933de7369e2ee48 Author: Ondrej Filip Date: Thu Jun 8 19:16:21 2000 +0000 Nasty bug in LSA refreshing. I didn't refesh my own copy! :-( commit 135857e5777a4f1762fa6d948bb9d6b72e101c91 Author: Ondrej Filip Date: Thu Jun 8 19:14:08 2000 +0000 Acknoledge your own premature aged LSA. commit 054a352475437d924e473c95b5d3ad01ae4ab161 Author: Ondrej Filip Date: Thu Jun 8 19:02:31 2000 +0000 Don't send dbdes before rtlsa origination. commit 4bb18dd2daa1e13ab4f9aaff2ddc4875c4776559 Author: Pavel Machek Date: Thu Jun 8 16:57:41 2000 +0000 Fix i_same for 'c' instruction. commit 89e7de98e455071c5ff3796765fb6fd6860a63c6 Author: Martin Mares Date: Thu Jun 8 15:44:52 2000 +0000 Updated distribution README. commit d4f72db31a512eafbb8aff4e5c1226fa59879382 Author: Martin Mares Date: Thu Jun 8 15:22:06 2000 +0000 When distcleaning, clean up doc as well. commit 96264d4d2f22c652f6cef84ff6226352e1457cce Author: Pavel Machek Date: Thu Jun 8 14:06:20 2000 +0000 Final version of documentation (famous last words) commit 66701947c43d34f89be59fe9845efd7c65f64454 Author: Martin Mares Date: Thu Jun 8 12:56:59 2000 +0000 Fixes. commit 6567e6cf5081542dfeb2c1f2493873c4fabb012f Author: Martin Mares Date: Thu Jun 8 12:42:34 2000 +0000 Missing parameters... commit 1632f1fe32b9f13bf7746586bcbad70ffafe4697 Author: Pavel Machek Date: Thu Jun 8 12:38:16 2000 +0000 More spellchecking and typographic changes. commit 725270cb1da0672128675924844531e56c6ea64e Author: Martin Mares Date: Thu Jun 8 12:37:21 2000 +0000 Fixes for the programmer's manual. commit 8d56febe64769c19a06c2c0f3ff121d25eceaa5b Author: Ondrej Filip Date: Thu Jun 8 12:04:57 2000 +0000 HASH_DEF_ORDER back to 6. commit 2a56bb3bd66a9b52dd6c2e2626630b4eaa79d04b Author: Martin Mares Date: Thu Jun 8 11:05:19 2000 +0000 Set margins. commit 5a64ac70361e9dacfe155492cd52ae88eedcd75c Author: Ondrej Filip Date: Thu Jun 8 11:00:15 2000 +0000 Introduction to configuration of OSPF. commit c62d1c19a924668ccf5315ca8882ea041581e3bf Author: Martin Mares Date: Thu Jun 8 10:48:51 2000 +0000 ... as well there. commit 49569a8b53b7494b19344f5fc9cd659f68477ba4 Author: Martin Mares Date: Thu Jun 8 10:48:35 2000 +0000 Oops! Configuration compiles now. commit a460184532f36f75bc9727886faf07c2bde2d7f5 Author: Pavel Machek Date: Thu Jun 8 10:30:55 2000 +0000 Tiny fixes. commit 86598d87be6b572d3ca9731a72bc820889f5265c Author: Martin Mares Date: Thu Jun 8 10:27:01 2000 +0000 Updated. commit a5a947d4d8f86dd1180d76f0803402383df0dcab Author: Pavel Machek Date: Thu Jun 8 10:26:19 2000 +0000 Fixing error messages. commit ca77641d0787be514cae6a622e26e6a58af11d12 Author: Pavel Machek Date: Thu Jun 8 10:25:56 2000 +0000 Use `switch' for `disabled'. commit ec423cc725d4b097e596dbadd84f3dea40deb0b8 Author: Martin Mares Date: Thu Jun 8 10:25:02 2000 +0000 Updated CLI helps. commit 5a203dac615369806dc6eee0418ea39c597bea41 Author: Pavel Machek Date: Thu Jun 8 10:24:42 2000 +0000 Docs updates. commit b178d92a0ba1dc198f05dc8252c826e9bd62c5cf Author: Pavel Machek Date: Thu Jun 8 08:24:32 2000 +0000 Better messages commit 099c017fca667bbb59cff65be2ac58c82f8fb3a8 Author: Ondrej Filip Date: Thu Jun 8 02:28:04 2000 +0000 Still some endianity bugs. commit 59ba3342968fdd2a016b192559a64439281e25bf Author: Ondrej Filip Date: Thu Jun 8 02:04:45 2000 +0000 I forgot some endianity operations. commit 423230f2f1080c6a4f6d05b6d7705cfaee500f48 Author: Ondrej Filip Date: Thu Jun 8 01:49:19 2000 +0000 Ehm, my (B)DR election was based on router id, but RFC says ip! commit 17e29574bcf0e03e3243a48e784b0248925cc5b4 Author: Ondrej Filip Date: Wed Jun 7 23:48:33 2000 +0000 Better algoritmus of LSA aging. commit 25a3f3da7a2312e5ae21ada2aeccc412e2d1d867 Author: Ondrej Filip Date: Wed Jun 7 23:34:43 2000 +0000 I mark all LSA as in distance INFINITY in process of aging. I don't have to WALK twice through it. commit 1186369bbd45ab901eccc313708cc20f9dbf0f42 Author: Ondrej Filip Date: Wed Jun 7 23:23:37 2000 +0000 Doc. commit 37c3e558ab31a5e6088cef063dcd1e267238be74 Author: Ondrej Filip Date: Wed Jun 7 23:05:32 2000 +0000 Simple explanation, how LSA are kept in database. commit 87f0d22ef84826f6dc6d0a1ae7ba8020b6e52573 Author: Ondrej Filip Date: Wed Jun 7 22:57:59 2000 +0000 Minor change. commit c2553b1b3e1ff61e24b9435b897ef942abcec006 Author: Ondrej Filip Date: Wed Jun 7 22:56:52 2000 +0000 Minor changes. commit eee9cefd8c13184e45878ce8e2ef12fcdece3ded Author: Ondrej Filip Date: Wed Jun 7 22:53:51 2000 +0000 Doc commit e9ab0b4212dc0939d782c991c86c362e09eb279f Author: Ondrej Filip Date: Wed Jun 7 22:31:47 2000 +0000 Doc in lsalib.c + related minor changes. commit d5e4b51865c9532a9b886e942d30bb64dc87a675 Author: Ondrej Filip Date: Wed Jun 7 22:10:46 2000 +0000 Doc commit 351feeb51472602c83ec847f1feba10d68a5d57b Author: Ondrej Filip Date: Wed Jun 7 21:56:32 2000 +0000 Doc. commit b4af36e0d8eeb6a032b2ce2464aae76a04117827 Author: Ondrej Filip Date: Wed Jun 7 21:50:16 2000 +0000 Removed some FIXMEs simply deleting them. commit 7ab3ff6a287d6adc8f1d371d9da1504de502c8a6 Author: Ondrej Filip Date: Wed Jun 7 21:46:22 2000 +0000 Doc in neighbor.c and some tiny changes related to. commit cadbb827f99fc24da9227dce545aa1185bab7916 Author: Ondrej Filip Date: Wed Jun 7 21:12:00 2000 +0000 A copyright change. commit 6f58dc64c9084aca66850b88d907cecf9b00c88d Author: Ondrej Filip Date: Wed Jun 7 20:50:08 2000 +0000 Doc commit 89755a86237c786878a2d0c5e527559c8a4c0b6d Author: Ondrej Filip Date: Wed Jun 7 20:30:27 2000 +0000 Introdution into OSPF. commit 64722c9852a8ea4bdc7db0304351850a8106300e Author: Pavel Machek Date: Wed Jun 7 15:27:16 2000 +0000 Added brief description of client features. Grammar really is not good place to write help from, so please check this. commit 3e82b32d3637a3a3d2eb935dc7036b32bc3fecd4 Author: Pavel Machek Date: Wed Jun 7 14:45:55 2000 +0000 Progdocs updates commit 074a166d9441a2b03931751dbc181e0d462a9d7c Author: Pavel Machek Date: Wed Jun 7 14:39:34 2000 +0000 Better explanation for if/case, and RFC pointers for rip. Still searching for RIPv2 rfc number! commit 8dcf2544996af34f3c3d71116844352427787324 Author: Pavel Machek Date: Wed Jun 7 14:16:11 2000 +0000 Even better documentation of filters. commit 7aa99d22bcabb48cfc737055942715d8efd47f6b Author: Martin Mares Date: Wed Jun 7 14:12:44 2000 +0000 Updated. commit f06a219a2445bc9ff86071fdbb9b97e51b412c31 Author: Ondrej Filip Date: Wed Jun 7 14:12:13 2000 +0000 Better explanation of OSPF attributes. But it's still not perfect. commit 4e8ec66698e0e644f56c18b3f58393d9f5ae49a7 Author: Martin Mares Date: Wed Jun 7 14:08:14 2000 +0000 Spelling. commit 07f29765a58ee72fc79d74b28dbfead24e0b5baf Author: Pavel Machek Date: Wed Jun 7 14:06:37 2000 +0000 RIPv6 now works. commit 76c7efec63ffd2431ce5f6bd2299763f741ac37c Author: Ondrej Filip Date: Wed Jun 7 14:01:18 2000 +0000 Better example for OSPF configuration. commit 907503adb6d0b0763ff92266e2fbc522d77f5476 Author: Pavel Machek Date: Wed Jun 7 14:00:17 2000 +0000 Comment fix. commit 18b4d6bf278485f86ae5b636f3155fb36735ff1e Author: Pavel Machek Date: Wed Jun 7 13:58:49 2000 +0000 rip ipv6 bugfix commit 3ca3e999ecf00cc6ab8a52a73a7ead26e83a75b7 Author: Martin Mares Date: Wed Jun 7 13:54:24 2000 +0000 Spelling and style corrections to the OSPF section. commit 771ae456a5ff0e12379047b737da31b0be4059ea Author: Pavel Machek Date: Wed Jun 7 13:54:06 2000 +0000 Better progdocs for filters commit fa6c2405e2bab551245e1af7ed19b550b8bbef79 Author: Ondrej Filip Date: Wed Jun 7 13:46:13 2000 +0000 Now I can change cost of interface without OSPF restart. commit 6316555eea2b9b232a622fdb9aceaa4de1e23f59 Author: Martin Mares Date: Wed Jun 7 13:32:10 2000 +0000 Minor tagging fixes in OSPF docs. commit 25696edb03e08f562d1993ae38ec9ae43942347d Author: Pavel Machek Date: Wed Jun 7 13:30:02 2000 +0000 Full list of possible values in attributes, better operators description. commit 088bc8add198b27456269ca7e536d6bc77ca285b Author: Ondrej Filip Date: Wed Jun 7 13:28:54 2000 +0000 Bugfix in <>. commit 58f7d004fddd2cccdb019be59b6cc7a8abe50510 Author: Martin Mares Date: Wed Jun 7 13:25:53 2000 +0000 Fixes to the progdoc. commit 38203d789a872077ec174a63a448568725e4715f Author: Ondrej Filip Date: Wed Jun 7 13:19:48 2000 +0000 Originate rt lsa before sending first dbdes. commit 0c69604c8d0c9618e6cc94c98da993439d90dde6 Author: Pavel Machek Date: Wed Jun 7 13:15:48 2000 +0000 SGML syntax fix. commit 8fd12e6b27e713b0b7b24f3f7d9efd57038b1be6 Author: Ondrej Filip Date: Wed Jun 7 12:35:43 2000 +0000 OSPF user documentation added. commit 2e9b24211a523c754b9437d6b742d6df304d8aeb Author: Martin Mares Date: Wed Jun 7 12:29:08 2000 +0000 Spelling fixes to progdoc. commit e403aa89e50471eb6f2838117887b1207627ae3a Author: Martin Mares Date: Wed Jun 7 12:27:30 2000 +0000 Updated TODO file. commit cf0fca30353a9966c793647f7c9d10b0b56678a9 Author: Martin Mares Date: Wed Jun 7 12:27:18 2000 +0000 Added `progspell' target which runs ispell on the progdoc SGML file with all function, variable and structure names removed. commit 1ae494a7e1fb7dde3ffc4e5dd7df31a1bf8dd6bf Author: Martin Mares Date: Wed Jun 7 11:55:36 2000 +0000 Avoid SEGV's in tracing. commit 8cd5c52fcb7d429f41601f7be114168cb2371072 Author: Ondrej Filip Date: Wed Jun 7 01:19:16 2000 +0000 Removed useless trace. commit 3df89cefc19d08f621afac0ff485dba3591a39a0 Author: Ondrej Filip Date: Wed Jun 7 01:18:36 2000 +0000 #define SIZE_OF_IP_HEADER commit bd457b8d2162034e03ac2bb62484d8b238fd556f Author: Ondrej Filip Date: Wed Jun 7 01:03:53 2000 +0000 Some minor changes: Typo: transit delay!=transmit delay Zero checks etc. commit edc34dc9121c188f7794d404fb112c8b162e968a Author: Ondrej Filip Date: Wed Jun 7 00:56:11 2000 +0000 Reconfiguration hook. It will survive many timer and constat changes. commit 1532a244da43b25fb78b7b3a67a344fa4ac542d4 Author: Pavel Machek Date: Tue Jun 6 20:54:05 2000 +0000 mj's fixes to rip documentation. commit a7c9f7c065907e310ce1954821f2a8fc61c0261b Author: Pavel Machek Date: Tue Jun 6 20:35:59 2000 +0000 Batch of mj's corrections (config + filters) commit a63a9ce609864e6ba3e76a1c47fd6423b532dec1 Author: Ondrej Filip Date: Tue Jun 6 12:50:02 2000 +0000 Better dumping neighbors' states on PTP interface. commit a00c7a18f561bf46533dac46ee56227ebdf1be08 Author: Martin Mares Date: Tue Jun 6 11:58:25 2000 +0000 Typos in Static section. commit 02357f960e6a2946add25652c009fa8dfe847f68 Author: Pavel Machek Date: Tue Jun 6 11:53:22 2000 +0000 Merged mj's changes, up-to "import filter". commit 41ad16e2d5dc03f6620b94f8e531373788e11db9 Author: Ondrej Filip Date: Tue Jun 6 11:50:48 2000 +0000 Added IP protocols. commit a852c139dc90febae40be055050ed30490d823b8 Author: Pavel Machek Date: Tue Jun 6 11:05:12 2000 +0000 Don't let example overflow, and new chapter for "about routing tables". commit ee4880c82fcefe61cccb8ec729905a2b19706d33 Author: Ondrej Filip Date: Tue Jun 6 02:54:41 2000 +0000 Some '\n' deleted. commit 064b1d893243bc187980f53292414583ff3b4630 Author: Ondrej Filip Date: Tue Jun 6 02:50:49 2000 +0000 Tracing. commit bd37f45c10be697403e59c957273d172b3d3ed8e Author: Ondrej Filip Date: Tue Jun 6 02:43:32 2000 +0000 Deleted some debug() commit abcbfd0400eeb514c63376b50d3948581c20ca4c Author: Ondrej Filip Date: Tue Jun 6 02:34:57 2000 +0000 Tracing. commit 531a48d8c5c168329640ccb21cd062dbb7b6f5a2 Author: Ondrej Filip Date: Tue Jun 6 02:32:14 2000 +0000 Tracing in LS ack. commit 992705f65a9feb04ed0e918d06ad283928aca13a Author: Ondrej Filip Date: Tue Jun 6 02:27:08 2000 +0000 Tracing in topology commit d3995c498d92d7ce54fb2fcb6904e4e41f7588dc Author: Ondrej Filip Date: Tue Jun 6 02:16:39 2000 +0000 Tracing in LSUPD. commit f14032efdd87bca5c2839be01ffe66797976c7bc Author: Ondrej Filip Date: Tue Jun 6 02:09:58 2000 +0000 First part of tracing. commit 51cff78b2571e24963d3a81694f854605eb75eac Author: Ondrej Filip Date: Tue Jun 6 01:46:32 2000 +0000 Allocate OSPF areas before interfaces. commit c1824c4d4c7753246ba26d27c7a3b7be3006d46b Author: Ondrej Filip Date: Tue Jun 6 01:23:03 2000 +0000 Simple autentication added. commit fef1badfcfb0519cca10f3561e5cb79ef9f9e969 Author: Ondrej Filip Date: Tue Jun 6 01:00:34 2000 +0000 All die() renamed to bug(). commit 80787d418bd028f59e34ffb08c1c221992fe3b41 Author: Ondrej Filip Date: Tue Jun 6 00:52:35 2000 +0000 Dummy reconfigure added. commit f8f1e1f110c3ff1aec03a9fa918257cf4d29e916 Author: Ondrej Filip Date: Tue Jun 6 00:46:00 2000 +0000 Interface locks added. commit 7d68e18b414bbdef9a5472006e8674a3d74e5a00 Author: Ondrej Filip Date: Tue Jun 6 00:21:06 2000 +0000 Added NBMA into examples. commit b131e163c292aac09dc7f73924de0fad6547743d Author: Ondrej Filip Date: Tue Jun 6 00:16:31 2000 +0000 Some useles variable deleted. commit 3301b9d1c57b4e76d32f1244e3da33012e70d20d Author: Ondrej Filip Date: Tue Jun 6 00:16:03 2000 +0000 Some useless variable deleted. commit eb436e16fd85340d3403a033ee86f973428a2f08 Author: Ondrej Filip Date: Tue Jun 6 00:08:27 2000 +0000 NBMA networks seems to work, but this should be better. :-) commit e5b5d18c1c8b33e76e954c0696e056fc11701631 Author: Ondrej Filip Date: Mon Jun 5 23:44:26 2000 +0000 NBMA networks should work now. commit 5c18880e35f668d33a993be5b2854547a08d9199 Author: Martin Mares Date: Mon Jun 5 21:26:11 2000 +0000 Avoid sentence containing a colon to start new doc subsection. commit ab698fc57c9898790964df7f9f59329e1f8930ba Author: Ondrej Filip Date: Mon Jun 5 21:09:03 2000 +0000 Added example of OSPF configuration. commit a13eaf219acf5b90af09b914a2182e23d5812aee Author: Martin Mares Date: Mon Jun 5 21:02:57 2000 +0000 Define element which initializes different formatting for the programmer's guide (\raggedbottom etc.). Also, omit "\usepackage{t1enc}", so that bullets work now. commit 854128a5ed540f230933cdc2c787e94d2658647b Author: Martin Mares Date: Mon Jun 5 21:01:58 2000 +0000 Don't print empty synopses of functions. commit 3b580a23ad32e8445c419932d6f7715cdc2a0687 Author: Ondrej Filip Date: Mon Jun 5 20:57:53 2000 +0000 Bugfix in NET LSA flushing. Configuration now works! :-) Better "show ospf" Some minor bugfixes. commit f1aa23d4b3949ccd7c86f9a4e87eda63149b5f6d Author: Martin Mares Date: Mon Jun 5 20:24:42 2000 +0000 Minor tweaks of spacing. commit 4bb9ce56bbf42ac09fc8293d8419835b6f178e83 Author: Ondrej Filip Date: Mon Jun 5 19:45:06 2000 +0000 Reset inactim timer if you receive any packet from neighbor. commit 496c819f26f67593797f0b861e153399c1d63a86 Author: Ondrej Filip Date: Mon Jun 5 19:35:48 2000 +0000 Removed some FIXMEs by deleting them. commit 3585d400e03a4e43def868b492df440ae52a29bb Author: Ondrej Filip Date: Mon Jun 5 19:31:55 2000 +0000 Don't info about DR and BDR on non-MA networks. commit 2debcb9eb0d76362003726ca8b0f5f43ee275dee Author: Martin Mares Date: Mon Jun 5 19:17:37 2000 +0000 Move TeX trickery for typesetting of function descriptions to where it belongs. commit fdb0c540a82d9732d4d1d36c83e186f36d756d08 Author: Ondrej Filip Date: Mon Jun 5 19:12:22 2000 +0000 PTP link in RTLSA was not announced correctly. commit 1605f043aa65b2434eb29d994f622bd79d0f2be7 Author: Martin Mares Date: Mon Jun 5 19:08:27 2000 +0000 Avoid using style combinations such as italic typewriter font. commit 8441f179253777b3e4bf3461ac847b33ddb098a4 Author: Martin Mares Date: Mon Jun 5 18:40:25 2000 +0000 Unless a filter specifies otherwise, all external routes have type 2 metric 10000. commit f8032bbdb150221e84f0bd7de825cf3e9f15aa66 Author: Martin Mares Date: Mon Jun 5 18:32:51 2000 +0000 Simplified the grammar and fixed several minor bugs (e.g., `INTERFACE "eth0" };' was a valid entry). commit 44fc1888cf284d863c897b861942612acf36f52f Author: Ondrej Filip Date: Mon Jun 5 18:09:49 2000 +0000 First calculate checksum and then send refreshed LSA! commit aba5e89f9310bb33c7362b02108e640983ad0819 Author: Ondrej Filip Date: Mon Jun 5 18:09:15 2000 +0000 Better checksum checking. commit 4c5f93d76bd0636407a185c175fe73411ae79a32 Author: Pavel Machek Date: Mon Jun 5 17:13:36 2000 +0000 Better documentation. There are functions whose description is good when reading source but whose documentation does not belong to progdocs. commit 22080a8640f268247a4cf74c9e76f958a05c4b69 Author: Pavel Machek Date: Mon Jun 5 16:42:54 2000 +0000 Make rip example fit on page. commit 8798c811762f463b662108643d7c4c869deb7f98 Author: Pavel Machek Date: Mon Jun 5 16:36:16 2000 +0000 Docs updates: make prog.dvi do not overflow in .dvi include filter documentation in the system commit eb2c99a132c87c5560edc77909edfab2df44f0a2 Author: Ondrej Filip Date: Mon Jun 5 16:32:29 2000 +0000 Yet another change, now flushing of net lsa seems to be perfect. :-) commit b458ce83d7cdc507aa18e5fed2ab206847bc317e Author: Martin Mares Date: Mon Jun 5 16:19:27 2000 +0000 Print out function synopsis as a part of the declaration. Also, reverted my previous hack for `&' and replaced it by just disabling the `& -> &' conversions. commit 2a5d7caa951d37c50d52ebef8ef269fa587dec5e Author: Ondrej Filip Date: Mon Jun 5 16:13:50 2000 +0000 I calculated next hop of parent instead of actual LSA. :-( commit 07b7100292fb87169ad5f18285927c39697f6998 Author: Ondrej Filip Date: Mon Jun 5 15:44:11 2000 +0000 Don;t send packet over downed interface. commit 8b79c4ccd597b90222f57eb3dfadeb24f39db7bd Author: Pavel Machek Date: Mon Jun 5 15:41:44 2000 +0000 Add safety check. commit 98da26a0a0ee9dd8f7030dcaf6f733adf8b8ad2c Author: Pavel Machek Date: Mon Jun 5 15:41:29 2000 +0000 Better error messages commit 49222deffff154ad7c287efd4a6847cc545cda6b Author: Ondrej Filip Date: Mon Jun 5 15:06:26 2000 +0000 Bug in comment. It didn't compile. commit b093c328f5b352e3d059cb14cceed1e4daa1b9dc Author: Pavel Machek Date: Mon Jun 5 12:52:57 2000 +0000 Updates to both programmers and users doc commit 73275d855dcc8a184bc19f3750c8775a59111260 Author: Martin Mares Date: Mon Jun 5 12:49:04 2000 +0000 Documented all the sysdeps (only briefly, I admit). Except for Filters, RIP and OSPF, the progdocs are complete. commit 525fa2c1f0e955455bed3fdb397aceb1e6e69a57 Author: Martin Mares Date: Mon Jun 5 12:19:12 2000 +0000 Documented sockets, events and timers. commit 10304bed435034cf8432b1c6262f7e7f0d84d49c Author: Martin Mares Date: Mon Jun 5 11:46:40 2000 +0000 Split random number functions off io.c, so that they can be documented separately. commit 5cc1e1f805934952f38ceb2ca6947c6d2e704937 Author: Martin Mares Date: Mon Jun 5 11:41:41 2000 +0000 Documented memory resources. commit 9238b06a2c6faac8b16e990821c91affde4072c4 Author: Martin Mares Date: Mon Jun 5 10:01:09 2000 +0000 Spelling. commit 42b3daa09cda8a4b80661177d3bf74b9258b0b88 Author: Martin Mares Date: Mon Jun 5 09:51:24 2000 +0000 Description of protocol module moved to where it belongs. If documentation of standard modules is stored in their source, such auxilliary files should be as well. commit ac272c0067cc7f04e74f0418bc0c9ce63a657175 Author: Ondrej Filip Date: Mon Jun 5 05:06:53 2000 +0000 Bug in LSA origination. commit dc2548d2ccc45722f0dcaa861dd3b45a397d2cac Author: Ondrej Filip Date: Mon Jun 5 05:06:22 2000 +0000 Premature age LSA if you're NOT dr. commit 88048fb3c970842a16c65b1566ba817871a04eb5 Author: Ondrej Filip Date: Mon Jun 5 03:46:19 2000 +0000 Small patch to better hash type=2 LSAs. commit 273fd2c16475d3d1275a4fe17443c3ba2b93fbc4 Author: Ondrej Filip Date: Mon Jun 5 02:23:20 2000 +0000 Many bugfixes (I don't remember all of them): Added link ID calculation for external routes with same prefix but different mask. Bugfix in NET lsa origination. Bugfix in NET hashing. Bugfix in LSA installing. commit 2d37d36c676e16b92ac38a60d3c269efeeaf07ac Author: Martin Mares Date: Sun Jun 4 20:06:42 2000 +0000 Updated the TODO list with our last-minute stuff. Moved the rest to "Various ideas". commit e24ddd9bef7e3d3490a8ee7667cd25069b40fe81 Author: Martin Mares Date: Sun Jun 4 20:00:35 2000 +0000 Don't set precedence and TTL for the dummy socket. commit 13e9bac33fc99e71efddf1790ce1e7dfdc09dfa8 Author: Martin Mares Date: Sun Jun 4 19:57:04 2000 +0000 One more newline less... :) commit df49d4e14b7c24f8ca958870fd1e9ddc84df1f1b Author: Martin Mares Date: Sun Jun 4 19:56:06 2000 +0000 Removed lots of trailing newlines in log messages. Please note that the only calls which don't add newlines automatically (i.e., don't print a full line of output) are debug() and DBG(). commit 201187c55837587d8f88775cd957d9c8e423c254 Author: Martin Mares Date: Sun Jun 4 19:55:11 2000 +0000 debug -> DBG commit bf3eb98eb829adc8bee4a210cfcefe29ba0524a1 Author: Martin Mares Date: Sun Jun 4 19:30:55 2000 +0000 Use nested scopes properly. Updated according to cf_define_symbol() changes. The rest of code doesn't need changing since it doesn't use nesting. commit 04dc62a0116941d2f1510216539ae8c11c5f1cb3 Author: Martin Mares Date: Sun Jun 4 19:30:13 2000 +0000 Nested scopes could never have worked. My fault I wrote such a buggy code, Pavel's fault that he's never tested shadowing of declarations in the filters. cf_define_symbol() has been modified to check the scope of the symbol it's given and it if it's an already defined symbol, but in a different scope, a copy is created in the current scope and redefined to the new meaning, the consequence being that it cf_define_symbol() now returns the new symbol you need to use when assigning aux and aux2. commit dab66519160042f1fb62a285e3a947233ce74e70 Author: Ondrej Filip Date: Sun Jun 4 19:21:23 2000 +0000 Install newer lsa even if nothing in its body change. commit 67cc9135bfd515149ecca62f32026cd6e2a390b0 Author: Ondrej Filip Date: Sun Jun 4 19:20:28 2000 +0000 Many bugs in ext lsa origination. commit ce8f0c083a5f46e001dff759e924910c415cfb48 Author: Ondrej Filip Date: Sun Jun 4 19:19:36 2000 +0000 Schedule RT calcualtion if you delete LSA by premature aging. commit f7667ba1c4c7a35266ae5018b059a14a01f7f907 Author: Martin Mares Date: Sun Jun 4 18:46:30 2000 +0000 When cloning a rte and replacing its rta, remember to free the old one so that we don't leak memory. Thanks go to the resource tracking system for quickly discovering the source of leakages. commit 7722938d63d206ebc0e1da732009e1e9f2cd9d72 Author: Martin Mares Date: Sun Jun 4 18:34:39 2000 +0000 Added library progdocs. commit 102e3e0e0277e7b123c7c1ae3635c4a8fb55c900 Author: Ondrej Filip Date: Sun Jun 4 17:51:52 2000 +0000 Just to be sure, that rt calculation cannot start beforeorigination of rt LSA. commit 83e50ffc472c8869d58a7d1da27846bd727a8cfd Author: Ondrej Filip Date: Sun Jun 4 17:33:15 2000 +0000 Bug in debugging. commit 71f7d043a6f03b5d5cd0701bb679b914b1bf47d1 Author: Ondrej Filip Date: Sun Jun 4 17:10:52 2000 +0000 :-) No bison does not have any comment to my code. :-) commit 54e55169da71a6e6e2d8f9fbc0123297301217d7 Author: Martin Mares Date: Sun Jun 4 17:06:18 2000 +0000 BGP documented. commit 3560cf8e0b68ce0cac5a9af2aadbc09d4f529e7c Author: Ondrej Filip Date: Sun Jun 4 16:36:57 2000 +0000 Clean up. commit e7811248685520ceff362b8bc7f090067ca42114 Author: Ondrej Filip Date: Sun Jun 4 16:17:39 2000 +0000 Another clean up. commit 47f8e0c2169bba2dd209f1c7ed89f1d605d36b3e Author: Martin Mares Date: Sun Jun 4 16:16:08 2000 +0000 Document. commit 3b31c538333156770ddb74a7a27f271784745144 Author: Martin Mares Date: Sun Jun 4 16:15:37 2000 +0000 Documented all the trivial protocols. commit 2a863dd6e18a43fe3de5b1f3651e816f6fc27bb1 Author: Ondrej Filip Date: Sun Jun 4 16:12:01 2000 +0000 Small change to make bison happy. commit 58f9453776dff92b4ee4c81f6ca3601b6ee9f041 Author: Martin Mares Date: Sun Jun 4 15:22:20 2000 +0000 Moved parser docs to cf-lex.l, so that the parser compiles. commit cdb898cfd40fe866a1835689814113075b7b5a67 Author: Martin Mares Date: Sat Jun 3 18:23:27 2000 +0000 Minor changes to the progdocs. commit 06607335ef73bc0ffeb377a420e6438b531a4ea7 Author: Martin Mares Date: Sat Jun 3 18:23:00 2000 +0000 Documentation. commit 899fc0abfe8400425860d0e9e4d6cc7fd338978c Author: Martin Mares Date: Sat Jun 3 18:22:43 2000 +0000 `|' now works as it should. commit 2e130b5cadb970b7f4f743e69cd459b5b42cf208 Author: Martin Mares Date: Sat Jun 3 17:02:30 2000 +0000 Recognize `|xxxx|' as verbatim text and typeset it using . commit c0b2f6463fd7464ce6fe4d9dc67f37e61bface11 Author: Martin Mares Date: Sat Jun 3 16:56:00 2000 +0000 cf_symbol_class_name now recognizes SYM_IPA. commit 3d675cdbe7287d3024d041ce4e28dacf7ca527cc Author: Martin Mares Date: Sat Jun 3 14:40:39 2000 +0000 More documentation. commit aaaff77605879ffd80f8980f06ea66329e9aaea8 Author: Ondrej Filip Date: Sat Jun 3 09:50:31 2000 +0000 More conf. items defined. commit a789d814ddd8473fdb85bedb02014f6cb6435373 Author: Ondrej Filip Date: Sat Jun 3 08:42:04 2000 +0000 Multiple items in area {} :-) commit 89d6782dd1a7775a292db3b2b622c8a48dbd757c Author: Ondrej Filip Date: Sat Jun 3 01:29:00 2000 +0000 interface {} added. commit b36a0a799c751864f65bc3384df301448b54f3bf Author: Ondrej Filip Date: Fri Jun 2 19:55:55 2000 +0000 area {} added to config. commit 7e602d5ea74206236373230a4620736370b3cc9c Author: Martin Mares Date: Fri Jun 2 17:42:21 2000 +0000 Killed several bugs in kernel-doc. The most painful one was that it was unable to recognize structure markers `&'. commit a7ed3e557fd1f8c4e56fef9a5238091181c01186 Author: Martin Mares Date: Fri Jun 2 17:41:43 2000 +0000 New TODO list. commit ddbcb927f255ef4720e87b7f14339add37e705ce Author: Martin Mares Date: Fri Jun 2 17:24:11 2000 +0000 Documented protocol hooks. commit 371adba6deb0add48fd4d03d40d4e098590689fc Author: Martin Mares Date: Fri Jun 2 17:23:53 2000 +0000 Use for chapters, for sections and for subsections. commit 6cba2d5eeb522cbf6f1cc28c38fc2c445f41d1e6 Author: Martin Mares Date: Fri Jun 2 17:22:43 2000 +0000 Typographical enhancements. Now, the documentation is typeset using a modified book style. Please look at this version and tell me your opinion. Especially I don't feel happy about the spacing and (not) indenting of paragraphs. Also, I've removed things like "fax" and "letter" from the LaTeX mapping file. commit 3fa5722defc340571a6518d5556b1e354f05ce18 Author: Ondrej Filip Date: Fri Jun 2 15:05:41 2000 +0000 First option into config added. :-) commit 62924172aef9cf5308fd21d3ad5f6572b977c268 Author: Ondrej Filip Date: Fri Jun 2 13:52:50 2000 +0000 Flush LSA when receive aged one. commit 3c6269b8fec71fa22d5b087cae0e9ef86ff2b351 Author: Martin Mares Date: Fri Jun 2 13:42:36 2000 +0000 Added documentation on protocols. Protocol hooks deserve an extra chapter (to come soon). commit e4ba0ec1977e9925ec67f9442067e5ff7cb36111 Author: Ondrej Filip Date: Fri Jun 2 13:27:34 2000 +0000 Bugfix in receiving of aged LSA. commit 9a8f20fc0fda1cf910fe8ca21e850ab1524c4355 Author: Martin Mares Date: Fri Jun 2 12:41:25 2000 +0000 Better description of the route distribution process. commit 2eac33f774a2075cff3d28f7fdb36e0482e48f35 Author: Ondrej Filip Date: Fri Jun 2 12:34:28 2000 +0000 Better LSA Aging. commit 3ce8c61000da58261750af2b6e60dbf2fca2abcf Author: Martin Mares Date: Fri Jun 2 12:29:55 2000 +0000 Documentation on routing tables and route attributes. commit 566a0eede7094519df07418116beeb7f3f976c7a Author: Martin Mares Date: Fri Jun 2 12:29:24 2000 +0000 Removed rta_find() since nobody uses it and it's more convenient to use ea_find() directly. commit ece612e12808325b1b7eb24d060a42343549238f Author: Ondrej Filip Date: Fri Jun 2 11:24:38 2000 +0000 sh interface "iface" dumpped all. commit 7a5582ac0045b80274de3183eca9b71eb52f2e6b Author: Ondrej Filip Date: Fri Jun 2 11:00:14 2000 +0000 Better dumping, if I get strange lsack. commit 3488634cba08aeda19a733f7c76aef7a54a4e0ec Author: Ondrej Filip Date: Fri Jun 2 10:21:02 2000 +0000 Handle "show ospf *" even if protocol is down. commit a489f0ce8ba44df0894a2bd102660fed1bed5ac6 Author: Ondrej Filip Date: Fri Jun 2 09:57:22 2000 +0000 Silly bug in sh interface. Now I test ALL interfaces. :-) commit 489f800b45d6d2d1a1fc9b371a015563cea9722d Author: Ondrej Filip Date: Fri Jun 2 09:53:26 2000 +0000 Speedup loading process. commit 75317ab8e522b5dceb87b204e09d8ad919ac8558 Author: Martin Mares Date: Fri Jun 2 09:51:26 2000 +0000 Spelling fixes. commit f8e2d916b6cbe42131bfefbc5a2cd0ddfaf8131b Author: Martin Mares Date: Fri Jun 2 09:46:35 2000 +0000 Minor fixes. commit 92e8be8c898932bf959e722acfbb33d154b8fcc4 Author: Ondrej Filip Date: Fri Jun 2 09:42:24 2000 +0000 Bugfix in lsreq receiving. commit cd4fecb66affe468928abd87cadef4ff9a991d0b Author: Martin Mares Date: Fri Jun 2 09:35:17 2000 +0000 Made it *compile* !!! commit 64ba9f7bcc4bb3b53c0cab303c230855a1443a42 Author: Pavel Machek Date: Fri Jun 2 08:01:12 2000 +0000 Do not try to divide by zero. commit 326e33f521f7796cbdde4a36a67bb4c7ffd25c1b Author: Pavel Machek Date: Fri Jun 2 07:59:26 2000 +0000 Results of complete reading of documentation. commit c4f0f0140863c743b1d63c3bc94cb8e85417a4ad Author: Ondrej Filip Date: Thu Jun 1 17:52:21 2000 +0000 Added show ospf interface. show ospf neighbors now knows "". commit 58740ed4c587a230bf1406eca52cbc84bcb1c5c3 Author: Martin Mares Date: Thu Jun 1 17:12:19 2000 +0000 Documentation. commit 658d272bb635b5efeeed883dec5af9dddf12397f Author: Martin Mares Date: Thu Jun 1 17:11:10 2000 +0000 Better handling of parameterless functions. commit 725774926676352d2a065cbeb95a81b95bfcfa3e Author: Ondrej Filip Date: Thu Jun 1 16:45:10 2000 +0000 Some other reply codes allocated. commit 4ab4e9778f35f8a123ee6bbc2387b9870859b707 Author: Ondrej Filip Date: Thu Jun 1 16:26:59 2000 +0000 show ospf implemented. commit cf318e3cd3206ad6a459a01e29e8494a100a67eb Author: Martin Mares Date: Thu Jun 1 16:17:29 2000 +0000 Removed comments about workings of the old neighbor cache which are (1) obsolete and (2) replaced by the progdoc. commit 1f495723c355b66383ab391fdba84aae7e9226eb Author: Martin Mares Date: Thu Jun 1 16:16:49 2000 +0000 Documented. commit ce4aca093a267da3dcd07b25f4390d393fd3c259 Author: Martin Mares Date: Thu Jun 1 16:16:18 2000 +0000 FIB documentation. I've changed the init callback type to a typedef to work around a bug in kernel-doc I'm too lazy to hunt now. commit a783e259d8d710208280126177487cc790418515 Author: Ondrej Filip Date: Thu Jun 1 15:53:06 2000 +0000 Cisco-like "show ospf neighbors" implemented. commit b594ad238692738352cd8827d71038a356b0d5a5 Author: Martin Mares Date: Thu Jun 1 15:13:23 2000 +0000 tm_format_reltime() works with both past and future timestamps. commit c23f40b1458e448ec9e7c974a2c486f2eccff871 Author: Martin Mares Date: Thu Jun 1 15:04:25 2000 +0000 Use instead of . commit a9aa4c1ebb5ccdb2c6c7672267ad32670261a10b Author: Martin Mares Date: Thu Jun 1 13:13:49 2000 +0000 Inactive sticky neighbors have no scope. commit 23df5e4cf3b0ff10e7484fc5ca40cb5ea638078b Author: Martin Mares Date: Thu Jun 1 13:00:39 2000 +0000 Print route tag in hexadecimal and omit it if it's zero. commit bc00185e5a2d51d965465f117722fd4189437d24 Author: Martin Mares Date: Thu Jun 1 13:00:19 2000 +0000 Updated to new neighbor cache. commit 491cd43b777e46a301ae2a8f5400acaeb28b8ca5 Author: Martin Mares Date: Thu Jun 1 12:59:50 2000 +0000 Updated RIP to new neighbor cache semantics. When presented with next hop equal to a local address, just ignore the route (as it is usually just an external route exported by us echoed by some RIP peer), when given an invalid next hop, moan to the log. commit 4a91150175268d49a1c17131838e5afad925788b Author: Martin Mares Date: Thu Jun 1 12:58:41 2000 +0000 Updated for new scope handling. Also, provide proper address scopes in struct ifa. commit 0f32f2a65a086561fdfd31d4efdea839ec9ce573 Author: Martin Mares Date: Thu Jun 1 12:58:04 2000 +0000 Modified the neighbor cache to remember local addresses as well. neighbor->scope now contains proper address scope which is zero (SCOPE_HOST) for local addresses, higher (SCOPE_LINK, ..., SCOPE_UNIVERSE) for remote ones. commit 56ca7acd3afd0df7928b3adfe4a8db8b29b89fb2 Author: Martin Mares Date: Thu Jun 1 12:55:26 2000 +0000 BGP: RFC 2842 has replaced the cap-draft. commit df968040f6b0f9eb83aa9c9eb4b4d6dcee6a384a Author: Ondrej Filip Date: Thu Jun 1 12:17:08 2000 +0000 Print tag unsigned rather then signed. commit c52c7e764576fed027defa0c06a056f89912787a Author: Ondrej Filip Date: Thu Jun 1 12:08:14 2000 +0000 Calculate checksum when reflooding (after min ls_refresh). commit 5f4aee76a2e26a6947f47273d510edc524716a45 Author: Pavel Machek Date: Thu Jun 1 08:43:29 2000 +0000 Added && and ||. commit 1877dab21715eb23addb3391afbd8dbf571f833d Author: Pavel Machek Date: Thu Jun 1 08:34:30 2000 +0000 Allow case net { 62.0.0.0/8+: 10.0.0.0/8+: else: reject; } commit 1895e81e0532f732f501036402bbdd1825885cfd Author: Pavel Machek Date: Thu Jun 1 08:32:49 2000 +0000 Allow matching on enums: if !(scope ~ [ SCOPE_HOST, SCOPE_SITE ]) then { print "Failed in test"; quitbird; } commit 42542c56c23174bfaefb1b949b90ed72afbea8fd Author: Ondrej Filip Date: Thu Jun 1 00:32:08 2000 +0000 Cleanup. commit d27d0efe17a197ae41e25bc56526d5fc4ac4a93e Author: Ondrej Filip Date: Thu Jun 1 00:22:48 2000 +0000 Very stuping bug. (I took me 4 hours to find it!) I just wrote "=!" instead of "!=". :-((((((( commit 2983460bc0adabe357ba839972ea8d09c97c32a4 Author: Martin Mares Date: Wed May 31 22:39:06 2000 +0000 Both `help' command and the `unknown command' error message now tell the user to press `?' if he wants help. commit 2f5e5ff9d6e91e7a3e478b316d6b2d23003ad80e Author: Martin Mares Date: Wed May 31 22:28:36 2000 +0000 Before configuration file is read, log to _both_ syslog and stderr. commit c184d9d0bdded559fb9d19accd17b88963e46669 Author: Pavel Machek Date: Wed May 31 21:51:04 2000 +0000 Documentation update commit 0b1cad81623e85f1f1b9ef3652cdc389641496e5 Author: Pavel Machek Date: Wed May 31 21:50:13 2000 +0000 Complain when filter does not end in accept nor reject. commit b5958826cc5fc75b5f99c51559d1ffedea5884b4 Author: Ondrej Filip Date: Wed May 31 18:55:57 2000 +0000 Ehm, some other "down" steps. commit 3f6953a103b9a846625a0d51e30b6dc59eedc7f0 Author: Ondrej Filip Date: Wed May 31 18:45:16 2000 +0000 Some bugs in cleanup after iface down. commit 489b21555e59d39d1c26dd3051f077c6f0a07c85 Author: Ondrej Filip Date: Wed May 31 18:36:51 2000 +0000 Why does not work "sk_close(sk);rfree(sk);"? commit 46962be628c1bd1d9c2badeea181ff6f87f0cb29 Author: Ondrej Filip Date: Wed May 31 18:31:53 2000 +0000 Better debugging. Safe neigh_list deleting. commit 3728267827e83bc095956b16256feae9e28adce7 Author: Ondrej Filip Date: Wed May 31 18:21:42 2000 +0000 And finally, Premature aging works. :-) commit 31ee3d5f214666a4b2da328dc894a5a9089acc87 Author: Ondrej Filip Date: Wed May 31 15:51:39 2000 +0000 Another step to make premature aging better. commit a9eeefd63ab7886bc2a5b8f0f7a2d1ec69a9c831 Author: Ondrej Filip Date: Wed May 31 15:28:13 2000 +0000 Warning destroyed. :-) commit 82364f4db8fff969932989bfcc5be89c73b15174 Author: Ondrej Filip Date: Wed May 31 15:24:29 2000 +0000 Flood my LSA (if exists) after old one is flushed. commit 0822995cb31b596d1fe9e8bb67f7e9d1c184694e Author: Ondrej Filip Date: Wed May 31 15:04:45 2000 +0000 Set E2 metric for internal routes to LSINFINITY. commit 9a04d0307e85913554122a2dd0397486b5ef702c Author: Ondrej Filip Date: Wed May 31 14:52:22 2000 +0000 Delete _all_ ext routes from unreachable neighbor. commit 528932368ac5c5ffe6ee3412fc8e9e1cb9cbd7db Author: Ondrej Filip Date: Wed May 31 14:43:42 2000 +0000 Stuping bug in net LSA origination. Now, I should survive loss of my only neighbor. commit 1c1f1b6c0a9012aaf0d3b94275895cb87b5ff695 Author: Martin Mares Date: Wed May 31 14:27:49 2000 +0000 This should be enough from the SGMLtools distribution to make the SGMLtools happy. The only symlink you need now is dist/birddoc -> dist/sgmltool. I'm convinced it could be avoided by renaming the directory instead, but I'd rather avoid it due to CVS pecularities. commit 1885aa8ce33e6617d45dbc2f5ee2852bf5f72e88 Author: Martin Mares Date: Wed May 31 14:25:27 2000 +0000 Clean LaTeX .aux and .toc files as well. commit fcdddff5f3f5c9f2a15377a9dd08f105a3b696a0 Author: Martin Mares Date: Wed May 31 14:24:21 2000 +0000 Formatting of progdoc works in both HTML and LaTeX. The LaTeX output still has somewhat weird spacing, but it will be hopefully easy to fix. commit d1660fd3f38c29739ff36c86c6010d65fb90c608 Author: Ondrej Filip Date: Wed May 31 14:21:56 2000 +0000 Sort cleanup in aging. commit 70a383198ae08bed395f2a083c1bea5b37447705 Author: Ondrej Filip Date: Wed May 31 14:06:33 2000 +0000 LSArt origination and routing table calculation is now not doing so often. Instead of calculation I just schedule it latter. commit aa185265f1cb310c053edb1a3bde28b4dab94964 Author: Martin Mares Date: Wed May 31 13:54:00 2000 +0000 Updated headings and copyrights. commit 38cf78a97a1541cf80a5b10c08ab25d564654516 Author: Martin Mares Date: Wed May 31 13:30:58 2000 +0000 Added the introduction chapter of progdoc. commit 3caca73fd9c05121b9748793df5f1378af3a8ce5 Author: Martin Mares Date: Wed May 31 13:30:29 2000 +0000 Spelling check and update of LocalWords. commit fc741dab27913b9c5f9a97642158b5011a9c4700 Author: Ondrej Filip Date: Wed May 31 13:20:25 2000 +0000 Handle better next hop in external LSA. commit e0bbb7b7ef1aabbf037190225ebac11f7812ae84 Author: Ondrej Filip Date: Wed May 31 12:52:12 2000 +0000 Very ancient bug in (B)DR election, I didn't fill correctly my own IP. commit a7a3a0a383a9dadcd93d876e7d9b43f870f20941 Author: Ondrej Filip Date: Wed May 31 12:07:09 2000 +0000 Added tagging of external LSA. commit fec5bec0b5f0e114a635c99a731e922ce735ff81 Author: Martin Mares Date: Wed May 31 11:36:21 2000 +0000 Make documentation targets available from the top-level makefile as well, but not with separate object tree yet. commit 46527a939e97a8a0d6d023ad7853e5e9a2df1ea9 Author: Martin Mares Date: Wed May 31 11:35:47 2000 +0000 Modified the Makefile to work in the source tree. From now, you can just `make userdocs' in doc, no need to use ugly scripts. Also, `make progdocs' builds the programmer's documentation in HTML, LaTeX version to come later. commit fcb5f4a725c9edecca7d4646c633e42f66ab53b6 Author: Martin Mares Date: Wed May 31 11:30:18 2000 +0000 Updated all the Doc files to new format. commit 6be13de762cebc9fc5f977e0e3423a9e2ae23a95 Author: Martin Mares Date: Wed May 31 11:29:56 2000 +0000 New progdoc script generating SGML output. commit c9c3611734cfb8265586ad8447483cbba9727617 Author: Martin Mares Date: Wed May 31 11:29:22 2000 +0000 Added new output format `bird' which creates birddoc SGML. commit 3fc259549595c952befbe589764ae0bc1ae82728 Author: Martin Mares Date: Wed May 31 11:28:52 2000 +0000 Added tags for markup of programmer's documentation. commit c92795e934758a32472ebc5766ff0f61b1c1409c Author: Martin Mares Date: Wed May 31 11:28:07 2000 +0000 Moved old TeX documents to old/ to make them not interfere with doc building. commit a2a3ced83eea3919639adafbdacb7ec11011f9cb Author: Martin Mares Date: Wed May 31 10:07:27 2000 +0000 Added Pipe documentation. commit 0884f492232bb81366c04982bf4935307d273c26 Author: Ondrej Filip Date: Tue May 30 23:29:23 2000 +0000 Ehm, in had this in code: "break; i--;" :-( commit 3b0b2cb61f4e9c3bfbb4770b941c5aba56d9e70e Author: Martin Mares Date: Tue May 30 22:48:14 2000 +0000 IPv6: Absolutize link-scope addresses of incoming packets. IPv6 socket interface is hopefully right now. commit cfa6ab0593a02c3d4d0d959c771f72430f1adf67 Author: Martin Mares Date: Tue May 30 22:47:33 2000 +0000 Added ipa_absolutize() which converts link-scope addresses to global scope ones according to prefix assigned to the corresponding interface. commit 69a20d2effb651e475b8ab8b04ee1a04a76db07f Author: Martin Mares Date: Tue May 30 21:46:21 2000 +0000 Recognize `!'. commit 5919c66e8fdd87ee7e5c5a1e0ce01893e0ce103d Author: Martin Mares Date: Tue May 30 21:25:32 2000 +0000 Route attributes for OSPF. commit 2cec475b8fbaa6cb0865ceacd900ffb678818330 Author: Martin Mares Date: Tue May 30 21:24:53 2000 +0000 Removed several unused local variables. commit 2f71123158973d770eee1dea64b46a4774bcf9a5 Author: Martin Mares Date: Tue May 30 21:24:15 2000 +0000 Killed bug in merging of dynamic attributes. commit caab3bb374d2671982d068c0fb0aa6217691d5bd Author: Martin Mares Date: Tue May 30 21:23:49 2000 +0000 Better formatting of protocol status. commit 36032dedc619a39d45d6abe79d27110a98751ba9 Author: Pavel Machek Date: Tue May 30 19:20:02 2000 +0000 Added section about client. commit 3e8645560624ac70ccc6d5f96fabcdae0a87cf4d Author: Ondrej Filip Date: Tue May 30 18:21:51 2000 +0000 Added \n in debug. commit 7e1c7efae2762752ef897bfa215b299127412b66 Author: Ondrej Filip Date: Tue May 30 17:57:06 2000 +0000 Stupig bug in debugging. commit 3dd8f983b649c83f50d44ca2093ab1f931eaba4d Author: Ondrej Filip Date: Tue May 30 17:51:22 2000 +0000 You can decide if add LSA into lsrth during flood_lsa(). commit 3d410fdfa1a6fc20952cf94b39ebff197a3c065a Author: Ondrej Filip Date: Tue May 30 17:49:25 2000 +0000 Reflood your old lsa. commit 13b02be25a41d7a505f7a888f948220a15edcf8a Author: Ondrej Filip Date: Tue May 30 17:00:17 2000 +0000 Don't run rt calculation twice. commit b477a9a855f75486c2e03bb7b68faba7923bc511 Author: Ondrej Filip Date: Tue May 30 16:49:48 2000 +0000 Don't send empty LS upd. (And better debugging.) commit e1e31816c4e6931465936afa39f5773cf4591b35 Author: Ondrej Filip Date: Tue May 30 16:48:42 2000 +0000 Aging delta changed. (Ehm, aging is very dirty I'll have to change it.) commit 1b128de364e5a1931c1cc61b04c1e44960007025 Author: Ondrej Filip Date: Tue May 30 16:13:59 2000 +0000 Better shutdown. commit 935ceabea43714e4abae7ecaac0f072e8a4ecb15 Author: Ondrej Filip Date: Tue May 30 16:08:29 2000 +0000 Don't send empty LS update. commit a548a7e167d50587aac4549d32924c95dc329e99 Author: Ondrej Filip Date: Tue May 30 15:05:47 2000 +0000 Bug in direct ack (via update). commit 4513280611d6c4e3409bf75139a9bd844843d462 Author: Ondrej Filip Date: Tue May 30 15:04:52 2000 +0000 Bug in socket closing. commit ef6f26b417060f9ac6c26224469b909a0c3aa933 Author: Ondrej Filip Date: Tue May 30 15:01:51 2000 +0000 Bug in lsa comparision. commit 2aa476a535c878a412bb732eae16d97848f07ff3 Author: Ondrej Filip Date: Tue May 30 13:39:06 2000 +0000 Yeah, the endianity bug found. commit 76e2514328a71abd1ed37b9b32421d2ab924b4c0 Author: Ondrej Filip Date: Tue May 30 13:25:47 2000 +0000 Better dumping. commit 7b099bf9a73b4a81f74d90fa8f413c9ebd85f384 Author: Pavel Machek Date: Tue May 30 11:50:17 2000 +0000 Recovering after change linuxdoc->birddoc commit 068b41272e8fbb81882a187dcef6d5f3d4e43ed2 Author: Pavel Machek Date: Tue May 30 11:27:42 2000 +0000 Don't say too bad things about our concurence. commit e9df1bb64786b24a230686310aeb4850b93fa5bb Author: Pavel Machek Date: Tue May 30 11:23:47 2000 +0000 Small change in working to make it obvious we are free software. commit 1cb10462c33731817f61ffbdd2e42c538baf0e0f Author: Pavel Machek Date: Tue May 30 11:22:12 2000 +0000 Date removed. commit f3b33928ce43794d499dc0e1fbbeb623572042d1 Author: Pavel Machek Date: Tue May 30 11:15:19 2000 +0000 Tried to change garbagetime -> garbage time to be more consistent. commit 24e1e2005b0728bfc404f248efb7d17b34cb0910 Author: Pavel Machek Date: Tue May 30 11:09:09 2000 +0000 Another testbed for filters. commit 04c3a83c60253d5c71500194a19160538c0da034 Author: Ondrej Filip Date: Tue May 30 11:07:31 2000 +0000 Better inicialisation. commit 0dc4431cde1eeb06d9b4d7dbf18242919ce2811a Author: Pavel Machek Date: Tue May 30 11:07:22 2000 +0000 Access to all attributes we should be able to access seems to work. commit 5970fcda8c4eb2cfe69c04d50429855c7c57bb6d Author: Ondrej Filip Date: Tue May 30 10:53:48 2000 +0000 Some exchange between init() and start(). commit 26c09e1d25abff7fb88959dc6fbaa7ae5eb295ad Author: Pavel Machek Date: Tue May 30 10:42:39 2000 +0000 Added read-only access to all required fields in rta. commit 2d6627a7a5e52f8314520f9aefd82040e24849cb Author: Pavel Machek Date: Tue May 30 10:42:00 2000 +0000 Fixed bug in RIP docs. commit 73232f6b18222d73b38eae58e2c4c90062202709 Author: Ondrej Filip Date: Tue May 30 10:36:57 2000 +0000 Better rt dumping. commit 2bdb5e0083b6f24d29d74bb5e62cd13d724ba54f Author: Pavel Machek Date: Tue May 30 10:23:04 2000 +0000 Cleaning static attributes commit 05dbc97b13534eb886945d1f291aaba34238c99c Author: Ondrej Filip Date: Tue May 30 10:20:14 2000 +0000 Bug in rt_notify. commit fe613ecded2fca875a146e1c07713f131e85f7ff Author: Pavel Machek Date: Tue May 30 10:13:32 2000 +0000 Access to few more attributes is needed. commit f7876c36602015dbf6d7aa3d73fda5ad1c2f6c5a Author: Pavel Machek Date: Tue May 30 10:13:15 2000 +0000 More todo in documentation. commit 298f2530ec05ee86c52f2fbce306ac186a3f6dd8 Author: Pavel Machek Date: Tue May 30 10:13:02 2000 +0000 Moved description of filters to programmers docs. commit 9e85a5e6f26866a255577ff10786c12a64cba624 Author: Martin Mares Date: Mon May 29 22:16:04 2000 +0000 Delay user input whereever appropriate. commit 4761efdb43aa128fa0326963d88debe8fb942c84 Author: Martin Mares Date: Mon May 29 22:10:18 2000 +0000 Tracing of CLI connections/commands can be now controlled by `debug commands ' in the configuration. Level 0 means no tracing, 1 means connections only, 2 includes all commands. commit 26eee1c33ac90ccbc5753afac06d34980fade2b8 Author: Martin Mares Date: Mon May 29 22:09:29 2000 +0000 Updated TODO. commit 7294f68b3b3474183434ae05b43a344f1bfce6db Author: Martin Mares Date: Mon May 29 22:08:04 2000 +0000 `path metric' and `disable after error' are switches, not numeric clauses. commit e67af42805c16093bb720a1bd04ad8932e86e49e Author: Martin Mares Date: Mon May 29 21:58:35 2000 +0000 Support --version and --help. commit 5459fac61f3a645c636bdf32c140f4d7083034d2 Author: Martin Mares Date: Mon May 29 21:03:27 2000 +0000 Added BGP documentation. commit 56ab03c71f35c6c360b58b88f9e524c97714fdf6 Author: Martin Mares Date: Mon May 29 13:47:18 2000 +0000 Added introduction to BGP. commit 0e4789c2c3a8f217f01a4e472c8dd45db609c34b Author: Martin Mares Date: Mon May 29 13:13:58 2000 +0000 Added Kernel protocol documentation. commit d9d41c60426ab1896bc689cd2a26c51f49e27e3a Author: Martin Mares Date: Mon May 29 12:46:27 2000 +0000 Capitalize properly in Install section. BTW, what about configure options and similar things? commit 4f88ac47c671af2221061b793fa495a78994e44a Author: Pavel Machek Date: Mon May 29 12:23:49 2000 +0000 Reduce number of chapters -- having subchapter for 2 lines of code looks ugly in output. commit 0e694e041a99860454fe0a74eb83133d89896d62 Author: Martin Mares Date: Mon May 29 12:18:30 2000 +0000 Minor fixes as requested by Pavel. commit 440439e3cc2ce7a9e6b36e6801f37c42cce1a729 Author: Pavel Machek Date: Mon May 29 12:05:56 2000 +0000 Really short installation section added. commit 04a22949d7f63d6979642e41ded0f61d7a477980 Author: Martin Mares Date: Mon May 29 12:05:21 2000 +0000 Renamed the DTD from linuxdoc to birddoc. Pavel, please check whether it builds in your environment as well. commit 897cd7aa559033aae99281e569a5153a22a952f9 Author: Martin Mares Date: Mon May 29 12:03:28 2000 +0000 Tried to write a better introduction. commit 9d8934891405348ad925d8421b673ea979f256eb Author: Pavel Machek Date: Mon May 29 11:53:24 2000 +0000 Docs updates. commit 79a2b697e3c94a787d72db4ed85b78928d3240c2 Author: Martin Mares Date: Mon May 29 11:30:25 2000 +0000 Added description of Static, Device and Direct protocols. commit 98627595fb4223991d60f809bbeac98cf34aabfb Author: Pavel Machek Date: Mon May 29 11:22:43 2000 +0000 Better description of how route is selected. commit d247d261e55bec7fadfef89c39ca3257816af771 Author: Pavel Machek Date: Mon May 29 11:22:30 2000 +0000 Info about client. (Mj, if you tell me that's trivial, what about you writing it?) commit 2f647f3f9f51effbb63aee5bb2c45d054b7922e4 Author: Pavel Machek Date: Mon May 29 11:13:51 2000 +0000 Added "what is router" to introduction. commit 1b55b1a3640da3ec2b032dcea3f4f7cbdff82303 Author: Martin Mares Date: Mon May 29 10:32:37 2000 +0000 Spelling fixes. Added skeleton for subchapters on all the protocols. Each subchapter should contain: Introduction (brief intro to the protocol, where should it be used, references to the relevant standards) Configuration Attributes Example Added a more detailed description of RIP attributes. commit e9d6b1d19fc35e611aa5a6020c0b531dee96d77d Author: Ondrej Filip Date: Sun May 28 20:11:56 2000 +0000 Kosmetic change in debugging. commit f7c0525edcffc6c85d0e526c4c9741b06fc521d2 Author: Ondrej Filip Date: Sun May 28 19:16:04 2000 +0000 get_route_info() added. commit d150c6379c03a9df98ff5dd53a6442a10713b571 Author: Pavel Machek Date: Sun May 28 19:11:08 2000 +0000 Documentation update. commit cdc25e8db7bfb38a9aca71abc5c202c25f4b0732 Author: Ondrej Filip Date: Sun May 28 19:07:39 2000 +0000 To find out a type of route (external, inter/intra area) commit 4414d9a57a0dae3da0e0e0d924bf8cab89070716 Author: Ondrej Filip Date: Sun May 28 18:49:33 2000 +0000 get_status() implemented. commit d5f029df482e596ccdbac341f605f6f809229db1 Author: Ondrej Filip Date: Sun May 28 18:34:20 2000 +0000 Just added some debug(). commit 4bd28fb68e6e691aee87cec41f219224e2dd69dc Author: Ondrej Filip Date: Sat May 27 15:36:02 2000 +0000 Better shutdown. (Flush my own router LSA and send 1WAY to every neighbor.) Ext LSA originating and flushing added. commit e8085abaa76c32bb325e378dfe2851bc98602c1e Author: Ondrej Filip Date: Sat May 27 14:17:35 2000 +0000 Originating of external LSA. commit 2d5b999236c20d293006af0b4d94af7ae04dd2a7 Author: Ondrej Filip Date: Fri May 26 19:04:18 2000 +0000 Import control implemented. commit 216fd83c4b213ea3774d2c536ae089ea1e81b443 Author: Pavel Machek Date: Thu May 25 16:28:08 2000 +0000 Spell checking. commit 9b24a6fb94049691075dfcdc00e2a0ae244c2325 Author: Pavel Machek Date: Thu May 25 16:17:54 2000 +0000 Text version generated from lynx looks as ugly as hell, sgml is much better at generating nice output. Unfortunately, sgml output contains a^ha highlight some printers do not like. commit d26524fa0c06f6716d5e226b18d7d4770924c6d4 Author: Pavel Machek Date: Thu May 25 15:28:24 2000 +0000 Add section about routing tables. commit ad9074e9ba2f2c1fa7e681b5f79f9049e5c640f8 Author: Pavel Machek Date: Thu May 25 15:20:40 2000 +0000 Cleaned up warnings. commit 69477cad708235f2ab79796dc62c06d3c879111c Author: Pavel Machek Date: Thu May 25 15:11:13 2000 +0000 Add section about utility functions in filters commit 4a5bb2bf1bbbb7d2bba7776af481a13a58ec39ae Author: Pavel Machek Date: Thu May 25 15:01:08 2000 +0000 Description of types needed for BGP. commit 9a09a64bb4160a5bb79cdf91bd95b7f77966f62e Author: Pavel Machek Date: Thu May 25 14:58:38 2000 +0000 Use ? in path matching to avoid /* trap. commit ba1dda495ad29cd86260533828ce38c7d327f045 Author: Pavel Machek Date: Thu May 25 14:50:46 2000 +0000 SGML correctness fix. commit 0e5373fd823d174d0cdd7820fc94cdbe4b0db5a3 Author: Pavel Machek Date: Thu May 25 12:33:42 2000 +0000 Some more documentation, plus minor fixes. commit 72282e2a1b52552eadd61a86659119db8478427d Author: Pavel Machek Date: Thu May 25 12:33:15 2000 +0000 Fixed comment not to be misleading. commit 416e3ee4b07d9ed30ada45eee736d877efe139db Author: Martin Mares Date: Sat May 20 11:00:14 2000 +0000 Get Linux version from , not `uname -r`. commit 2eca3b3a9ce8ea405f81cb1dbf55b79d3b2d3c18 Author: Martin Mares Date: Fri May 19 19:49:33 2000 +0000 Routing table garbage collector gets really called. commit 0ba8a6147d2a6ca4611c9e87e6b9d640d94966b4 Author: Martin Mares Date: Fri May 19 19:40:12 2000 +0000 Fixed a very nasty bug in FIB iterators. commit d2a7c0e9b2b51287cca6bf9f9ef513cbe29d4dbd Author: Martin Mares Date: Fri May 19 18:05:19 2000 +0000 Don't print trace messages about null updates. commit 3ced9b349daeb64357136311e436401c246d7777 Author: Martin Mares Date: Fri May 19 18:05:01 2000 +0000 Fixed freeing of non-embedded extended attributes. commit 075898dea7ee73b49462af3d3ab0269fd46afcc4 Author: Martin Mares Date: Fri May 19 18:03:53 2000 +0000 No more problems when protocols gets disabled during feeding. commit dc6405d27e1ecedf6289039c7b3ed94c50683b2d Author: Martin Mares Date: Fri May 19 17:21:42 2000 +0000 Latest changes by Pavel have removed the error messages printed after unsuccessful socket open, but replaced them by segmentatio fault! Grrrrrrrrr. commit e66e6c2119e9de2f8012e587eafe752723706265 Author: Pavel Machek Date: Fri May 19 16:57:40 2000 +0000 If community list is not defined, act as it is empty. commit 9511a483b1b735d8bf9f671d494b363da5719ecc Author: Pavel Machek Date: Fri May 19 16:44:25 2000 +0000 Less error messages in case sk_open fails. commit eb4097e4e47db23403c4050b43ea5136ffbe4b41 Author: Pavel Machek Date: Fri May 19 16:22:53 2000 +0000 Added name of protocol to messages being logged. commit af0b25d20d1476d81696fb0241a815fb45168f53 Author: Pavel Machek Date: Fri May 19 15:59:21 2000 +0000 More updates. commit 242352b7a7f1b181b6e42dc77b998005d3f07c78 Author: Pavel Machek Date: Fri May 19 14:13:49 2000 +0000 Improve docs of log statment, improve markup. commit 8af8a87375f3a609583866a5f50487baebe38e2e Author: Pavel Machek Date: Fri May 19 14:05:55 2000 +0000 Descriptive lists rendered better in TeX. commit a0dd1c74334fa22588f9d1c8cb73013f1940b974 Author: Pavel Machek Date: Fri May 19 13:58:39 2000 +0000 Some spellchecking, and use right tags for right things. commit 5e88d7302599b7ac521624c77adf0b3c72601670 Author: Martin Mares Date: Fri May 19 11:01:41 2000 +0000 BGP now reports originating AS and origin type in get_route_info(). commit f49528a3dfa034415527824cbbd0762f3829f0cd Author: Martin Mares Date: Fri May 19 11:01:06 2000 +0000 Added as_path_get_first(). commit f7ad556f2017075abaef659bf018a0ce215b13b3 Author: Martin Mares Date: Fri May 19 11:00:47 2000 +0000 Commented out the `inserting entry which is already there' message since it's pretty normal: during feeding of the protocol, a new route can appear which will be announced normally and then repeated by the feeding process. commit 76dfda9e74580b6c07206b7afbbdafeea36ad08f Author: Martin Mares Date: Fri May 19 10:59:47 2000 +0000 Fixed a buglet in asynchronous feeding and increased maximum number of routes allowed per feeding phase. commit ac5d801217b4b85a5f716ace25f7f9ac48dfee0f Author: Martin Mares Date: Fri May 19 10:46:26 2000 +0000 Asynchronous feeding of protocols. commit 0850ce22d76c80c4f6a10fd0139d4cc903716bfa Author: Ondrej Filip Date: Wed May 17 21:20:47 2000 +0000 Smal debug bugfix. commit 6d5e703dc9ac387d72005f3b5da82e80275d5fc6 Author: Pavel Machek Date: Wed May 17 20:23:05 2000 +0000 Minor cleaning commit 00c1f79a79281c16beec132d945db480daca958d Author: Ondrej Filip Date: Wed May 17 20:01:25 2000 +0000 rte_same implemented. commit bbd76b421a1975560084e50669db9cacd61d2b58 Author: Ondrej Filip Date: Wed May 17 19:27:51 2000 +0000 rte_better implemented. commit 9f0d45d634ac38d54ed92c5726fbaed65850e15f Author: Pavel Machek Date: Wed May 17 12:14:05 2000 +0000 Finished cleanng up mess: multiplication reinstalled. commit 4ee2178935b1f4cdd465e290c13f6580901cec8d Author: Ondrej Filip Date: Wed May 17 00:28:45 2000 +0000 Don't die, if you receive strange LSA. commit 7f6b3cf247c0df8d10e9ed29a5ff6a6af5e1cf8f Author: Ondrej Filip Date: Wed May 17 00:28:11 2000 +0000 Typo in comment. commit 18a0c0bb763d918f3a06bfeb2be2b1051a7f4629 Author: Ondrej Filip Date: Tue May 16 23:59:38 2000 +0000 Downing of interface should work. commit 8fb0c2c298fbfa133cf783a1547bc3b1c84fe466 Author: Ondrej Filip Date: Tue May 16 23:24:50 2000 +0000 Calculation of external routes finally works. commit 31834faaf3ab055242e3a9998a37029b56f54d8a Author: Ondrej Filip Date: Tue May 16 22:43:30 2000 +0000 Ehmm, removed 'if(1 || ...' so I can test the second part . commit b1c9d871614874092e397ae505799be82284713d Author: Martin Mares Date: Tue May 16 22:37:53 2000 +0000 Fixed the horrible mess Pavel has created with his last commit. commit 508c36ab7981a8e50d1235c2c443491e4b04aa01 Author: Ondrej Filip Date: Tue May 16 22:34:49 2000 +0000 Routing table calculation for ext LSAs having next-hop=!0.0.0.0 commit a96a979d5b2b3a7ef02d878e9598d3268cb4c8a7 Author: Pavel Machek Date: Tue May 16 18:50:51 2000 +0000 Line numbers for runtime errors (what's wrong with cvs? I could not commit this from home) commit 7581b81bd7a77b5baebbd43833c00574d543c62e Author: Pavel Machek Date: Tue May 16 18:47:06 2000 +0000 More additions to documentation and spellchecking. commit e5a47266d0d6b8614c5199ea513de029b35552b0 Author: Martin Mares Date: Tue May 16 15:08:52 2000 +0000 Turned off LOCAL_DEBUG. commit e79671a72ccd392debcce1cdc05e46747eaf37e2 Author: Martin Mares Date: Tue May 16 15:08:43 2000 +0000 Fixed incorrect error message about router ID syntax. commit 5b846de6a6361b3c8aac84438e7b332c972f2a08 Author: Pavel Machek Date: Tue May 16 15:05:05 2000 +0000 Interface dummy is too strange for me... but psst, that's secret. commit be77b6890c5f6b956553c0432554e5912a30528f Author: Martin Mares Date: Tue May 16 15:02:33 2000 +0000 Poisoning: take there... commit d6796e7b546bd0a28b85666a95eda039eabc5c5f Author: Pavel Machek Date: Tue May 16 15:02:27 2000 +0000 Don't segfault when someone adds passwords. commit 2f2663bdb735ca155c32b0e12da814e62bbf9e9d Author: Pavel Machek Date: Tue May 16 15:00:15 2000 +0000 Password same now actually works commit 898fdd85dc4568816ac0436c1b012f2fb35ef3e4 Author: Pavel Machek Date: Tue May 16 14:58:06 2000 +0000 Rip should now reconfigure itself only if needed. commit 60de3356ab9b1996a84e3ba2865176a078b6d0ca Author: Pavel Machek Date: Tue May 16 14:24:33 2000 +0000 Resolved shift/reduce conflict commit e2f4f275646d21de363c32ff3c8fb4f492f07c04 Author: Martin Mares Date: Tue May 16 13:53:44 2000 +0000 Oops, the poison was too deadly... commit b8e60d3562277762ec372424482b22c024e657d6 Author: Martin Mares Date: Tue May 16 13:51:31 2000 +0000 Added poisoning of free'd objects when we're debugging. commit df9f0fb30a7046872eff21624a315d5fd56e938f Author: Martin Mares Date: Tue May 16 13:43:26 2000 +0000 Don't log state changes if nothing user-visible has changed. commit f990fc61e0dd13ae90c9bbff811736dfd52988b0 Author: Martin Mares Date: Tue May 16 13:36:38 2000 +0000 When in persist mode, don't delete routes from kernel tables even if they cease to exist in our routing tables due to protocols having shut down. commit c5a06f65ee20328b8d0f2276287e223e4fd4a595 Author: Pavel Machek Date: Mon May 15 12:27:45 2000 +0000 Allow other operations than +. commit f4ab23174688920e44bb4cae6e8b4f280a066e28 Author: Martin Mares Date: Mon May 15 12:19:28 2000 +0000 bgp_get_status: If protocol is down, don't print BGP state. commit cbfd671f114a96095f021662ad1cf0eaa6d089c1 Author: Pavel Machek Date: Mon May 15 12:19:26 2000 +0000 Allow accessing defined symbols. commit cc590a11a7a285463dff89d0bd677d0762dd8e45 Author: Martin Mares Date: Mon May 15 12:15:18 2000 +0000 Changed syntax of expressions. Each `expr' can be now either a numeric literal or a symbol or parenthesised filter expression. commit 6be662d917822e9a23b0abd613e170c1d42bfdbe Author: Pavel Machek Date: Mon May 15 12:07:09 2000 +0000 Use new eval mechanism for testing filters. commit e3f2d5fce3e339bb34f14d7b2569c1bd43b741ba Author: Martin Mares Date: Mon May 15 11:48:23 2000 +0000 Cleanup of configuration. o Use `expr' instead of `NUM' and `ipa' instead of `IPA', so that defined symbols work everywhere. o `define' now accepts both numbers and IP addresses. o Renamed `ipa' in filters to `fipa'. Pavel, please update filters to accept define'd symbols as well. commit 3b1c523d79763b22e0fe06862ff349fd94e816b1 Author: Martin Mares Date: Mon May 15 10:53:56 2000 +0000 Got rid of startup functions and filters_postconfig(). By the way, how do you expect pointers to fit in an int? commit 1c20608e02109ef0839e0168d100c75f0cc65fd9 Author: Martin Mares Date: Mon May 15 10:49:38 2000 +0000 Added f_eval_int() and EVAL configuration command. commit 9449c91ab2eb962b17989125c712f805f82a092b Author: Martin Mares Date: Sat May 13 11:42:42 2000 +0000 Added `show route for ' which looks up route leading to given network. commit 56d6c530eba46dde7280d6743fea7e750f2d5635 Author: Martin Mares Date: Sat May 13 11:42:06 2000 +0000 Added fib_route() which does (although very slow) lookup of longest-match routing in a FIB. commit d3abfbc68d7f921b2547b39a6baa9bee6c89b78d Author: Martin Mares Date: Sat May 13 11:41:26 2000 +0000 Added prefix_or_ipa. commit 758458be054ebdf4cd77620faf214f2b491a49dc Author: Martin Mares Date: Sat May 13 11:17:49 2000 +0000 Unified parsing of prefixes. Had to rename `prefix' in filters to `fprefix'. commit 02bd064ab76f163313261dad5c273cb376be2a75 Author: Martin Mares Date: Sat May 13 11:02:02 2000 +0000 Adapted to new rt_notify semantics. commit e4bfafa1008918cf904ede023feb18fa4cb7d524 Author: Martin Mares Date: Sat May 13 11:01:41 2000 +0000 Manual enable/disable works right. commit 08f0290a1ebf94624c4eb4cbcb10e2b35a846432 Author: Martin Mares Date: Sat May 13 11:00:37 2000 +0000 Changed semantics of the rt_update hook. The attribute list we pass now contains all attributes, not just the temporary ones. This avoids having to merge the lists inside protocols or doing searches on both of them. Also, do filtering of routes properly. (I'd like to avoid it, but it's needed at least in the krt protocol.) commit bfd7117846271a5e54271ee5248addd7e10ad021 Author: Pavel Machek Date: Fri May 12 10:57:36 2000 +0000 Documentation fixes suggested by mj commit 7e681ef3603862829c3bbf6b5c81c69c34faeb81 Author: Ondrej Filip Date: Fri May 12 00:22:43 2000 +0000 Calculation of external routes works. :-) commit be2bb403414b2d8cd608b710a29992b2c8a4c8b0 Author: Ondrej Filip Date: Thu May 11 22:02:53 2000 +0000 Minor changes. commit 5da1f935374b2e0435b67cc4d867369d522e62ff Author: Ondrej Filip Date: Thu May 11 22:00:55 2000 +0000 Bugfix in flooding. (bad size) Better debugging. More robust in receiving. commit c8d1f3feb2e2ca12aee76b1ce907dfff31c1012b Author: Ondrej Filip Date: Thu May 11 22:00:16 2000 +0000 Better debugging. More robust. commit 7a42e6ce899ceec7329212b9ceca4f15387fc280 Author: Ondrej Filip Date: Thu May 11 17:14:57 2000 +0000 Bugfix in network LSA originating. commit 67edcf392f74e1c79ea521d583df7ca365caea0b Author: Martin Mares Date: Thu May 11 16:55:26 2000 +0000 Updated README, generating the first alpha release. commit 0e5aa966cca94152363b2d8e9c1b316c04d90adb Author: Martin Mares Date: Thu May 11 16:30:56 2000 +0000 Multicast problems should be gone, although the fix is Linux only and we'll need to figure out something better when working on new ports. commit 28323d9ddbdcfa35c6dec139da4eefca584b143e Author: Martin Mares Date: Thu May 11 15:05:13 2000 +0000 Several minor RIP changes (Pavel, please check as usually): o Use FIB_ITERATE_INIT instead of calling the function fit_init() which is explictly marked as private in route.h. o When printing trace messages, don't spit out protocol name twice. o Some messages are a bit more verbose. o Added a bunch of FIXME's. o When running in broadcast mode, don't forget to bind the local end of the socket to the same broadcast address, so that we don't get the broadcasts looped back via different interface. I'm just going to look up the same problem for multicasts. commit 109c2f6cf350069c12abb7d182da6458ff56c1c7 Author: Martin Mares Date: Thu May 11 12:30:06 2000 +0000 If a broadcast address is missing, go fake one. commit 2138d3b4d84058338ad4010eff8da62afa6531ab Author: Martin Mares Date: Thu May 11 12:20:07 2000 +0000 Use correct flags for the LOCAL_PREF attribute. When an invalid attribute is found, copy the entire attribute to the data section of the NOTIFICATION message. commit 6e06e6eef098859da95ff56a8ee9b4c75467901a Author: Pavel Machek Date: Thu May 11 12:00:35 2000 +0000 Critical files from linuxdoc1 distribution checked in. commit 0e7a720a1c8119912c00edf893702857c0d39d04 Author: Pavel Machek Date: Thu May 11 11:54:03 2000 +0000 Use instead of in bird.sgml, fix url references. commit 7692aad10c22a58a6f83d82fc0b11db94cc777f9 Author: Pavel Machek Date: Thu May 11 10:47:33 2000 +0000 Don't include Rules: they are not needed and break stand-alone make of documentation. commit ec21aecfddde3be2b061850a050108265dfbf194 Author: Pavel Machek Date: Thu May 11 10:33:18 2000 +0000 Fixed nasty segfault in rip. commit 10f5c47d2e3d9fdeb2dd4ade1d09a1e06b53a7f6 Author: Pavel Machek Date: Thu May 11 09:41:16 2000 +0000 Some more paranoia into rip_insert and rip_delete commit 94d1a6c9dc9ac578cb88428462ab41f113ca4e23 Author: Pavel Machek Date: Thu May 11 09:36:55 2000 +0000 Unused variable killed. commit 394920a09c6163d2b98896802526c79c82f52d20 Author: Ondrej Filip Date: Wed May 10 23:42:37 2000 +0000 Test better lsa size. commit 31dca4353460b7a8bfb272e63ceac46deb3a6944 Author: Ondrej Filip Date: Wed May 10 23:42:13 2000 +0000 Be more verbose. commit 74ac7cdb1afe1e23a130b290f4a366268073f62c Author: Ondrej Filip Date: Wed May 10 23:41:52 2000 +0000 Bugfix in (B)DR election. commit ff73f1d63d2d1e49737ea2471dc5cb92e9591847 Author: Ondrej Filip Date: Wed May 10 23:41:18 2000 +0000 More robust tests in packet receiving. commit 13741548a6a75479577ea991bad1e38a4fba6320 Author: Ondrej Filip Date: Wed May 10 15:04:21 2000 +0000 Some better lsa checking added. commit a9c41c854802d1a8d44e666548423589022111c8 Author: Ondrej Filip Date: Wed May 10 14:29:00 2000 +0000 Out dump deleted. commit 2a41c8d9fcd2907a531c7306e174f51218486d57 Author: Pavel Machek Date: Wed May 10 13:42:50 2000 +0000 use password_same utility function commit 45a48e2de21cbf1a48c6f478ed068e48f20f918b Author: Pavel Machek Date: Wed May 10 13:42:46 2000 +0000 password_same utility function commit a3f657ac764ff38a5829f27a0dccbf6220043a1a Author: Ondrej Filip Date: Wed May 10 13:35:49 2000 +0000 Ever test possibility of forming of adjacency. commit 3e474192745e7e92d27cad7ffa16a8395e884cf2 Author: Pavel Machek Date: Wed May 10 13:23:21 2000 +0000 Inlined metric and mode into struct rip_interface to make reconfig work. reconfigure is conservative but should work. commit 30aa02d70df2275d2289d9b736d879b9951bcaee Author: Pavel Machek Date: Wed May 10 13:05:39 2000 +0000 rip_reconfigure done right commit b8524e9be4f1d15f4cd2cd365d7842eff8d5a499 Author: Pavel Machek Date: Wed May 10 12:48:06 2000 +0000 ipa_same does not exist. commit 0bff946c0a29469b669939813e5a2861c1f010fb Author: Pavel Machek Date: Wed May 10 12:46:47 2000 +0000 Nicer messages from rip. commit 6f3849774ffe35e445e33ba03f041c1a84ba35f1 Author: Pavel Machek Date: Wed May 10 12:38:05 2000 +0000 Use ea_get_int instead of ea_find. commit c7e46aae66861ce282e9b1a0140fa422763094ce Author: Ondrej Filip Date: Wed May 10 12:37:43 2000 +0000 Destroying of neighbor moved from 'hello' to 'neighbor' and improved. commit 7f5f44bb9248f05f397617f3874feef26bbb0b0b Author: Pavel Machek Date: Wed May 10 12:32:45 2000 +0000 Reconfigure hook copied from bgp. commit 84a1305437ddd893771c43d1a9bff32260a56789 Author: Pavel Machek Date: Wed May 10 12:26:09 2000 +0000 Send first udpate sooner. commit 14758d87c48e9d829f58ace0736b0c5b3c7dc6ae Author: Pavel Machek Date: Wed May 10 12:23:06 2000 +0000 Only announce change to main routing table if it is better than current. commit 353f3261385267fd07b634284989a760fc37b79d Author: Ondrej Filip Date: Wed May 10 12:22:00 2000 +0000 Better dumping. commit 5e50f0a0289517e64e026cb27e886d49e6044aca Author: Pavel Machek Date: Wed May 10 11:57:56 2000 +0000 Don't touch used memory. commit e8bd039da8de22de85bd135617b4a8ce9c979585 Author: Ondrej Filip Date: Wed May 10 11:52:39 2000 +0000 Bugfix in ip_addr endianity. commit be3b6dc574c26ab3292fb2ceb94809242bea3d79 Author: Pavel Machek Date: Wed May 10 11:48:34 2000 +0000 Killed unused variable. commit 28950169e7ac82ceb9a6d72fe2789714b4073eb2 Author: Ondrej Filip Date: Wed May 10 11:48:21 2000 +0000 Bug in (B)DR election fixed. commit d9f89e011498ec54006a026d9e0dd963db663ab0 Author: Pavel Machek Date: Wed May 10 11:40:30 2000 +0000 You can now say "mode multicast". commit 65a9c57175b60048d5501b2c951d5e46b3909fcb Author: Ondrej Filip Date: Wed May 10 11:22:08 2000 +0000 Change u32 to ip_addr in ext lsa. commit aa1e082c6779505e9ca24ba9f9d6cdfd4c647b06 Author: Ondrej Filip Date: Wed May 10 10:47:17 2000 +0000 Calculation of external routes. commit 4bfe4e8551722533cc99c776b3b70818ef59bf24 Author: Pavel Machek Date: Wed May 10 06:56:42 2000 +0000 Fix segfaults by using new ea_get_int. commit c0100454cf37833d23fdb9d24412de659f683c12 Author: Pavel Machek Date: Wed May 10 06:54:40 2000 +0000 Added more convient interface for ea_find. What is special about int default;? Compiler chokes on that! commit fe95ab68164f0c9f18e65f7965ac4d93b24bef97 Author: Ondrej Filip Date: Tue May 9 21:52:58 2000 +0000 FIXME's removed by deleting them. :-) commit 32fa4a5a461eb1af4146d9985663d90fcddd9697 Author: Ondrej Filip Date: Tue May 9 21:06:48 2000 +0000 Premature aging of self-originated LSA received in flooding. commit 3b8b1bd03709d2fa2eab8ec81321717e3b58dcaf Author: Ondrej Filip Date: Tue May 9 19:38:34 2000 +0000 Better dumping. commit a3ae6246c29ecceefc1e867c7b5f73a5b3c857c9 Author: Ondrej Filip Date: Tue May 9 19:38:16 2000 +0000 Bugfix in lsrt slist adding. commit b224ca32cfb5268db4984b5a640ab8a73852059b Author: Ondrej Filip Date: Tue May 9 19:36:32 2000 +0000 Flushing of old LSAs added. commit 850fda2518d6e91ca8e126ff91adad62fd507276 Author: Ondrej Filip Date: Tue May 9 18:35:57 2000 +0000 Backup seen is not called so often. commit cd22a62b3ce3aa4cf8985337657ec9750176aa49 Author: Ondrej Filip Date: Tue May 9 18:20:39 2000 +0000 Don't send flushed LSAs. commit 9669362f0577dbda0d7b9495d0c2fec11fa866f1 Author: Ondrej Filip Date: Tue May 9 18:17:34 2000 +0000 Many bugfixes. (I added one entry twice to slist.) Debug cleanup. Retransmiting of unacknolegded LSAs commit 5f743d969739d6dca12b51561baac3131e160429 Author: Ondrej Filip Date: Tue May 9 13:56:47 2000 +0000 Many bugfixes. Actually, how could this ever work? :-) commit 5d608eba1636e307624300fdd47b9024be92d39a Author: Ondrej Filip Date: Tue May 9 12:31:38 2000 +0000 Bug fix in sending updates. commit 0e1b949be7f71d038e871dac159b424e76978bff Author: Ondrej Filip Date: Tue May 9 12:18:41 2000 +0000 Bugfix in testing of possibility of adjacency. commit 432996f40fceb58cd5ee5026eb4f7018ef6af1ef Author: Ondrej Filip Date: Tue May 9 12:03:57 2000 +0000 Better dumping. commit 54ac9d2e03c6ae44b4e183c9bcf963196218c477 Author: Ondrej Filip Date: Tue May 9 12:02:48 2000 +0000 Bugfix in hello. commit 4057093fa40248c5b607039481576a6c5e4e902b Author: Ondrej Filip Date: Tue May 9 11:52:44 2000 +0000 Small cleanup. commit 551d44438275e9ebc9e7590814f413ac7d0cccd6 Author: Ondrej Filip Date: Tue May 9 11:29:52 2000 +0000 Sorry, it didn't compile. :-( commit b29c620f90d429b868038984a5427470f00aebac Author: Ondrej Filip Date: Tue May 9 11:27:31 2000 +0000 Another bugfix in neighbor state machine. commit 279a3b76d193944431a992a1ac43543fe15ab903 Author: Ondrej Filip Date: Tue May 9 10:47:10 2000 +0000 Small bug in neighbor state machine. commit fafe44b651f68d0a588cac94ddada8a1270adb97 Author: Ondrej Filip Date: Tue May 9 00:03:08 2000 +0000 Just added declaration of AS Ext routes calculation. commit 43e75f38e7b8716efb3729ee56fd4a879e03c1dc Author: Ondrej Filip Date: Mon May 8 23:46:31 2000 +0000 Do not stop lsrr_timer in FULL state. Use it for retransmition. commit ed4a53c6a5685d04fe2b0cceda83860324f4892c Author: Ondrej Filip Date: Mon May 8 22:50:37 2000 +0000 Some changes in debugging. commit 9bacea42112216e604bd55e3027e019e131304dd Author: Ondrej Filip Date: Mon May 8 22:49:58 2000 +0000 Fixed some FIXME's by deleting them. :-) commit 8a3049f6f139622c6976502d931c746449a1fe48 Author: Ondrej Filip Date: Mon May 8 22:42:56 2000 +0000 Useless '\n' in log() commit eae4fcf2539703d0dbd47e29ab24be29e0ddc2ff Author: Ondrej Filip Date: Mon May 8 22:40:55 2000 +0000 Stopping RXMT timer when going to lower state than EXSTART. commit d8033f2238922f3c63c247e924f1e31659d821ef Author: Martin Mares Date: Mon May 8 22:37:16 2000 +0000 Generated first public alpha release. Unless you object, I'll announce it today (9.5.) at noon. commit 8aecbf160adb15eef3f66d750745928f66f8a310 Author: Martin Mares Date: Mon May 8 22:33:50 2000 +0000 New example config. commit c976342828d5de3d16b59d623f4f7fb03f52acc9 Author: Martin Mares Date: Mon May 8 22:33:38 2000 +0000 Implemented debugging function rlookup() which you can call from gdb to see what resource does the address given as a parameter belong to. commit 0521e4f68490d5ef5cc6ba6b2b4e4edf7cf6aa1a Author: Martin Mares Date: Mon May 8 22:33:02 2000 +0000 rt_prune: Don't kill routes from protocols in FS_FEEDING state. If debugging, call fib_check() on the table's fib. commit c09d1e8df2d5d1ebfb4ce3dfbe93347a83acd99d Author: Martin Mares Date: Mon May 8 22:32:17 2000 +0000 KEEPALIVE TIME ought to set keepalive time, not connect retry time :) commit 5ff0a270cb411d423a78ed13604a5f2b25d4b289 Author: Martin Mares Date: Mon May 8 22:31:58 2000 +0000 In non-debug mode, set default logging to syslog only, not stderr. commit 4524331a3d758106f4ffa6a54a60aeae45341789 Author: Martin Mares Date: Mon May 8 22:31:34 2000 +0000 Fixed type in daemonization code. commit fc0ca2d8e1ab6a71a81f5f12c04f02d670d22348 Author: Ondrej Filip Date: Mon May 8 22:28:42 2000 +0000 Typo in debug. commit a6fdf9c6ac58e2d95d84c58102af8d5f3a70958a Author: Ondrej Filip Date: Mon May 8 22:27:25 2000 +0000 Grrr, useless debug. commit 5ee479aac9e488e15245905c598e778eb787dfe1 Author: Ondrej Filip Date: Mon May 8 22:26:11 2000 +0000 Small typo. commit 0ebb8b64f384d57889271389abe9b8926dde7af8 Author: Ondrej Filip Date: Mon May 8 22:24:22 2000 +0000 Bugfix in new neighbor allocation. commit 77fbd315dfa2dd6b8252cf13386d8b8480234bcc Author: Ondrej Filip Date: Mon May 8 22:10:10 2000 +0000 Better debug output. commit b57a45b81a74c091bbc71966a7c6aacebaf34e57 Author: Ondrej Filip Date: Mon May 8 22:03:29 2000 +0000 Next hop calculation improved. (I ignored stub networks advertised by my neighbors. commit 158b99c912ef5c5cef22fd3e343341cbb52eb105 Author: Ondrej Filip Date: Mon May 8 22:02:45 2000 +0000 Better logging. (%d->%I) commit 8abbde02d46830168b79a1df6c18c3ffaea49b9e Author: Martin Mares Date: Mon May 8 19:11:49 2000 +0000 Several simplifications of the fib iterators. commit 0bcba21e893efb9853a68b04674e4bde9da5a1b8 Author: Martin Mares Date: Mon May 8 19:10:36 2000 +0000 When not debugging, daemonize automatically. commit 33a368ad594822239bfbaa2eab50c76171e09b9e Author: Martin Mares Date: Mon May 8 14:58:00 2000 +0000 Implemented `show route count' which is `show route stats' with exception that it doesn't print the routes themselves. commit 0c3588bf5e43936ea0f1e630dea500912b598c60 Author: Martin Mares Date: Mon May 8 14:53:22 2000 +0000 Don't crash when the socket gets closed between updates. Also, this time not only update `remains', but update it right :) commit 6b5ab87581ba496ad0a9c12ef66f1372e1459685 Author: Martin Mares Date: Mon May 8 14:51:57 2000 +0000 Added `--disable-memcheck' switch which avoids linking of efence/dmalloc, so that we can run in debugging mode with large routing tables. commit e48dae3ed70daf52ad93c4fdc73270ab1510661f Author: Martin Mares Date: Mon May 8 14:51:26 2000 +0000 Stop feeding the protocol if it suddenly shuts down. commit 9ff8f334edec974b16497e1e74172977e0fff221 Author: Martin Mares Date: Mon May 8 14:32:19 2000 +0000 Update `remains' counter correctly. commit d69e5ff2ad8b552c22770e4c85bd7c5afafe2816 Author: Martin Mares Date: Mon May 8 14:29:30 2000 +0000 Use PATH_CONTROL_SOCKET instead of tacking on "bird.ctl" manually. commit cd44b466515578583d46dcb1a0abdae6e658a166 Author: Martin Mares Date: Mon May 8 14:24:19 2000 +0000 Forgot to add a spiky comment :) commit f9254d2349c7e2e3c110f7850e402d1c11624940 Author: Martin Mares Date: Mon May 8 14:19:47 2000 +0000 Autoconf is *evil*. The sysconfdir and similar variables are unusable in C includes as they contain substitutions specific to make. Worked around by creating sysconf/paths.h which is created from the Makefile instead of by the configure script. commit 0bf7386b33fecac40be43f8db5b0ba0356123fd2 Author: Martin Mares Date: Mon May 8 14:18:33 2000 +0000 Updated TODO. commit c0760ab0fc880778f23c71a7874aa38f90e28925 Author: Martin Mares Date: Mon May 8 13:56:11 2000 +0000 Debugging compilation is no longer default. This means that the configuration file is expected in $prefix/etc etc. Use --enable-debug to request debugging. commit d8508f70b0325cd283bc1551c455cdc3aab011fe Author: Martin Mares Date: Mon May 8 13:54:59 2000 +0000 `make install' now works. commit 93d6bf38a6c07b8281e11280d5cdbb721d19f7c8 Author: Martin Mares Date: Mon May 8 13:26:30 2000 +0000 The bgp_list is gone. Incomming connections are now handled in a much more straightforward manner by scanning the active configuration for matching protocols. commit 5d86aefb6c4a8e298ee79dc9cbf7c07196d56b5b Author: Martin Mares Date: Mon May 8 13:12:14 2000 +0000 Really free attributes. commit 818ff1e2b7b8eb8e707608e76ead94e5c6bd442c Author: Martin Mares Date: Mon May 8 12:38:00 2000 +0000 When reporting a bug(), call abort() instead of exit(), so that we can analyse the core. commit c304392e65a3d6554e97bce00146fe5f2bcb64b1 Author: Martin Mares Date: Mon May 8 12:37:39 2000 +0000 Some less socket error messages. commit 507eea4c8b4c52a5ddf232bc180a7a42cf29f074 Author: Martin Mares Date: Mon May 8 12:37:24 2000 +0000 Don't generate corrupted packets when sending only route deletes. commit 9cbf43eb8a7e0186144e95d7b244e0c69b0e9189 Author: Martin Mares Date: Mon May 8 12:09:10 2000 +0000 Don't report refused connections. commit b6c9d8eb2e255b65f29efd1acfd35a4277b3bf14 Author: Martin Mares Date: Mon May 8 12:05:55 2000 +0000 Removed the `async' switch which was used for debugging only anyway. Don't moan when netlink reports lost packets. commit d0126f0bf0098104cd99fedd61a4bdbe7f7b3f1f Author: Martin Mares Date: Mon May 8 11:40:30 2000 +0000 bugs_in_attr_cache_hashing--; commit 79681f4a19d0eca6e40d919a387099f5646f29bc Author: Martin Mares Date: Mon May 8 11:04:22 2000 +0000 Link the instance to the global BGP list as soon as possible. commit 94e935d8a2e02f18e3731624720e8f84be5e9f15 Author: Martin Mares Date: Mon May 8 11:02:53 2000 +0000 Incoming buffer must be at least 8KB long. commit 916c8c0abacfd5ba93353fec9dba84a81845c95e Author: Martin Mares Date: Mon May 8 10:40:00 2000 +0000 Use preferences properly. commit 1151401e2b8b4434bbd1419ff33a48f2848d600d Author: Martin Mares Date: Mon May 8 10:38:51 2000 +0000 Don't crash when reporting deleted routes. Set preferences correctly. commit 92ef4fa719058af80a9dbb39e3d2fbd9314e8a1a Author: Martin Mares Date: Mon May 8 10:38:25 2000 +0000 Preference is a configurable parameter. commit 0117d004945afdfb6cc9a62db4561cd4eddee24a Author: Martin Mares Date: Mon May 8 10:37:45 2000 +0000 Fixed `show route primary'. commit 18c031fae8945409b0ff1139d88092ba19ec2780 Author: Martin Mares Date: Mon May 8 10:13:59 2000 +0000 Debugged printing and pruning of neighbor cache entries. commit 0d3070824da904bd0f3f576b353b738bfa15a53a Author: Martin Mares Date: Sun May 7 11:32:34 2000 +0000 Don't count networks with no routes (they are not displayed at all and will be removed during the next garbage collection pass). commit 23693958aa95edf5baaeaa5baa55725dc4895681 Author: Martin Mares Date: Sun May 7 11:28:59 2000 +0000 Implemented `show route <...> stats'. commit 6998bb9ee345a0e8b558fc87133f1c2a442b7096 Author: Martin Mares Date: Sun May 7 11:28:34 2000 +0000 Squashed one bug in fib_rehash(). No more routes disappearing as if struct by a lightning :) commit 891cec854f84674317fa152b71254fc52d893826 Author: Martin Mares Date: Sun May 7 11:27:23 2000 +0000 Killed one more reference to RTS_RIP_EXT. commit acfce55c8637988954543c60597cd2f1525ba6ec Author: Martin Mares Date: Sun May 7 10:41:45 2000 +0000 Setup of incoming connection is now a separate function. commit ce1da96ee7efc9310f138e4234495557cdef59e2 Author: Martin Mares Date: Sat May 6 22:57:39 2000 +0000 Added commands `show route protocol

' and `show route import

' which show the routing table as exported to the protocol given resp. as returned from its import control hook. To get handling of filtered extended attributes right (even in the old `show route where ' command), the get_route_info hook gets an attribute list and all protocol specific rte attributes are contained there as temporary ones. Updated RIP to do that. Added ea_append() which joins two ea_list's. commit 84f070020500de40e69e6d00df9d41ecc90a3b23 Author: Martin Mares Date: Sat May 6 21:46:09 2000 +0000 IPv6 support compiles on both glibc 2.0 and 2.1. commit 498c33395f99743206088770c441222c76493378 Author: Martin Mares Date: Sat May 6 21:42:19 2000 +0000 Cosmetic fixes. commit 0b7610985cd44435ab40dd2e78646f400db908c5 Author: Martin Mares Date: Sat May 6 21:31:41 2000 +0000 Fixed silly bug in previous commit. commit 67be5b23cd80646c2aa5a9c6a3d373ceecb275b6 Author: Martin Mares Date: Sat May 6 21:21:19 2000 +0000 When rte_update is called for an identical route, don't announce anything. Please implement the rte_same hook in your protocols. It should just compare your metrics stored directly in rte, the rest is done by the core. commit ab1129c1bdea41ff06fd21390cde5667d07f6e65 Author: Martin Mares Date: Fri May 5 17:17:42 2000 +0000 Added skeleton Doc files for the whole developer's documentation. commit b177724896b75159dbc8e203ac0e5a134229ae90 Author: Martin Mares Date: Fri May 5 17:15:56 2000 +0000 Connected the `doc' subtree to global makefiles. All documentation is built in obj/doc (resp. doc/ if you do a stand-alone build). Use `make docs' to make the whole documentation or `make userdocs' resp. `make progdocs' for user manual resp. developer's guide. commit c7d7794bb9a71be58d06c6c9ea67943d3e33a566 Author: Martin Mares Date: Fri May 5 17:14:44 2000 +0000 Added a tool for processing of developer documentation. Everything is controlled by Doc files in source directories (see the corresponding programmer's manual entry for the format and look at Doc and lib/Doc for an example). Currently it generates HTML indices and calls kernel-doc to generate per-section HTML files. commit 249d238c14cafa812db02ea3090b34c58b183cf6 Author: Pavel Machek Date: Fri May 5 09:39:08 2000 +0000 First attempt at documenting configuration. commit beaf86e13c6b9595bc979b5ed9669e3e43f793cd Author: Martin Mares Date: Thu May 4 21:23:10 2000 +0000 Removed RTS_RIP_EXT. commit 9a220cabbc28a4e54f814aa5d596696a15e6544d Author: Martin Mares Date: Thu May 4 20:52:28 2000 +0000 #ifdef out lots of debugging information. The long resource/routing table dump printed upon startup is gone now and if you wish to see it, just send bird SIGUSR1 or use the `debug' commands. commit b3acb10632ce9fa492a92ced1e533f0bf5edee21 Author: Martin Mares Date: Thu May 4 20:49:45 2000 +0000 Updated. commit 2a149b18cca3b20063be398e8098dfa8e1e2705d Author: Martin Mares Date: Thu May 4 20:38:44 2000 +0000 Unused variables in IPv6 code. commit 93a786cb034fdd18b8131a16a6ea3d1cd9bd00de Author: Martin Mares Date: Thu May 4 20:30:36 2000 +0000 Removed a lot of unused variables. Please try compiling your code with --enable-warnings to see them. (The unused parameter warnings are usually bogus, the unused variable ones are very useful, but gcc is unable to control them separately.) commit c817b9916f1134f687ba53220d607e6e193cf651 Author: Martin Mares Date: Thu May 4 20:18:46 2000 +0000 Added --enable-ipv6 which tells configure to select the right configuration for IPv6 automatically. Added --enable-warnings which turns off some more warnings. Default protocol list now depends on --enable-ipv6. commit 9b63e3a58afe17b98eb7722e352984574846c22c Author: Pavel Machek Date: Thu May 4 20:08:34 2000 +0000 Spelling fixes. commit cf3d6470d7c8d401b162516ed7446c1d3866d5d3 Author: Martin Mares Date: Thu May 4 20:02:56 2000 +0000 IPv6 BGP support finished. Also simplified the BGP stuff a bit. commit 6db8c5a63b341d0913afa44457a93a8e83529fb2 Author: Martin Mares Date: Thu May 4 20:02:19 2000 +0000 pxlen works even in IPv6 mode. commit 5dc4b0aae20ef7e6b862af29a3135e018147ce97 Author: Pavel Machek Date: Thu May 4 10:03:53 2000 +0000 Display examples more nicely commit 1d9622e10ddc3baf2cd4f81bc2fa95593b4d3e85 Author: Martin Mares Date: Thu May 4 09:08:28 2000 +0000 Switched off LOCAL_DEBUG. commit 1c1da87b271ee3db0045f31612d99894531ada54 Author: Martin Mares Date: Thu May 4 09:03:31 2000 +0000 Receive-only IPv6 BGP. commit d345cda5a1cea03a09e5a37c999e88c5177c8a9e Author: Ondrej Filip Date: Thu May 4 01:23:03 2000 +0000 Bugfix in Network lsa originating Bugfix in ntohlsab() and htonlsab() For calculating of rt I use my own fib. I delete routes! ;-) commit 9e48d717cf681dcc3cfaaee4358b5c6fa3aa409e Author: Ondrej Filip Date: Wed May 3 22:36:12 2000 +0000 Test for "flushing" added. commit a02c6c184b513fe1886c86533e696045e960515b Author: Ondrej Filip Date: Wed May 3 22:23:41 2000 +0000 Cleanup of code. Some arguments of functions were useless. commit ad5453b540b3c9d7430dcff9a3674d9db8ab999c Author: Ondrej Filip Date: Wed May 3 22:12:33 2000 +0000 Testing if I can flush LSA from database. commit 9bc1808a27b35499d2438d731ade6d2cba8aa355 Author: Ondrej Filip Date: Wed May 3 00:08:48 2000 +0000 Better rt and net originating. commit 0bf2f2039e1fc95fe0fa3ee231711212f1f2b128 Author: Ondrej Filip Date: Tue May 2 23:09:44 2000 +0000 Originating of network LSA. commit 92bbd812e332c9948d737e95526c571ff371d394 Author: Ondrej Filip Date: Tue May 2 22:34:35 2000 +0000 OSPF added to default protocols. commit 249fdef7a10ce507bd224ad9be48a86f09d8f21c Author: Ondrej Filip Date: Tue May 2 22:31:48 2000 +0000 Adding InfTransDelay for outgoing lsa. commit c45f48fba5a0904f9c3512c3b42c38183fef348b Author: Ondrej Filip Date: Tue May 2 22:19:41 2000 +0000 Aging of lsa database added. commit a92847e78fabd637938f324c78d5eb41538a5692 Author: Ondrej Filip Date: Tue May 2 19:27:57 2000 +0000 Route calculation for stub networks. commit 53943a002265d8e2b6a887eaa497a01840675693 Author: Martin Mares Date: Tue May 2 16:10:04 2000 +0000 Defined format specifier `%M' which behaves as `%m', but takes the error code as an argument. Use it in socket hooks where we really shouldn't rely on errno containing the right value or even existing. commit 85368cd4b7244535f6ce56a27f6d22ddfa2bf4e6 Author: Martin Mares Date: Tue May 2 16:07:41 2000 +0000 Full protocol tracing. commit 85a291ff3055f0b10ffc199138c67305f5b3fc98 Author: Martin Mares Date: Tue May 2 15:21:51 2000 +0000 IPv6 address classification fixes. commit d1a74339d4edb717fbe98d412bd5e4ad03bb20a2 Author: Martin Mares Date: Tue May 2 12:51:39 2000 +0000 Handle redistribution of unknown attributes correctly. commit 85195f1a53eb350cd32ecba69c208dbece6fb776 Author: Ondrej Filip Date: Sun Apr 30 22:14:31 2000 +0000 Many small changes and bug fixes. Routing table calculation works. I'm waiting for rt lookup to add stub networks. commit 2337ade7546254eb48a22a1e195cc7999e684d21 Author: Pavel Machek Date: Sun Apr 30 18:47:48 2000 +0000 Moved documentation to top of file, where it belongs. commit c6c56264361e102691fe42134ab585f631f83898 Author: Ondrej Filip Date: Sun Apr 30 11:31:05 2000 +0000 Sync with nest's rt table and some minor improvements. commit e80e9d0da5d737b7f6e65358067f62a6ac85f4fe Author: Ondrej Filip Date: Sun Apr 30 09:32:41 2000 +0000 RT calculation strongly simplified. Now, I don't need any memory allocation. :-) commit 8c62d6e3b631d58f46d87c36826cb29f8dadeb15 Author: Pavel Machek Date: Sat Apr 29 17:48:38 2000 +0000 Minor documentation update. commit 468f2347fc0ea3e0eb6513ccd0433d0b48f2c739 Author: Ondrej Filip Date: Sat Apr 29 15:57:14 2000 +0000 Calculating of nexts hop(s) added. commit 9c1a55deeeb5aa5cd2f18b109fabb50947c308ab Author: Pavel Machek Date: Sat Apr 29 15:45:30 2000 +0000 IpV6 now actually compiles. Mj, could you provide example of static config for ipv6 that is _not_ rejected by checks? I tried this and got rejected. route 62:168::/32 via 62:169::; route 1:2::/32 via 1:3::; commit 46cdc7e20faaf922431a157bcb0f82a45b7aa2d2 Author: Martin Mares Date: Fri Apr 28 15:15:36 2000 +0000 Updated TODO. commit cea636640005c9ee9b628ce07a2d467c132941fe Author: Martin Mares Date: Fri Apr 28 15:13:29 2000 +0000 The `bgp_origin' attribute is now an enum. commit a412f01ea84709b9af0113acc5aa2ce3dad1d292 Author: Martin Mares Date: Fri Apr 28 15:12:03 2000 +0000 Include CF_HDR section in keywords.h as well, so that protocol symbols can be used in definition of ENUM's. commit 2edb31b097018be00f29cb7647432c4c2c8b99ba Author: Martin Mares Date: Fri Apr 28 15:11:10 2000 +0000 Split CF_HDR section to CF_HDR (only includes) and CF_DEFINES (defines, C declarations etc.). commit decc99fbbdba3394a5c611e2914b4d74aa6742a9 Author: Pavel Machek Date: Fri Apr 28 10:15:57 2000 +0000 Killed fixme: I already fixed it. commit a769a180d77b88fbfc77cae3e895a320007f6e30 Author: Pavel Machek Date: Fri Apr 28 10:14:59 2000 +0000 Provide rip_get_attr, how do I test it? commit 6c0a7174af459d62a52e97d15da29528169a68f9 Author: Pavel Machek Date: Fri Apr 28 09:55:52 2000 +0000 Add sample documentation to rip. commit e83b42deb4405729d9f53448bdbcea05e7d15e8f Author: Pavel Machek Date: Fri Apr 28 09:55:36 2000 +0000 Include proto/rip/rip.c in documentation system. commit ff95080f9272c4a0123ab05dff608a43cf3c15b7 Author: Pavel Machek Date: Fri Apr 28 09:48:28 2000 +0000 Cleanup of dead code + example documentation for two functions. commit 602b1445e3bfa24b1ce9cd1d148e4aa5cb742cf4 Author: Pavel Machek Date: Fri Apr 28 09:48:01 2000 +0000 Documentation-generating tool taken from linux-2.3.99-pre6, and makefile to actually use it. commit f94557dec5714f8415aa9e74615b5c821f45808f Author: Martin Mares Date: Thu Apr 27 22:40:19 2000 +0000 Some more fixes for attributeless UPDATEs. commit f75e3bbc01f2b711d1a2479eddd9ea35f8cfff47 Author: Martin Mares Date: Thu Apr 27 22:35:08 2000 +0000 Fixed a couple of nasty CLI bugs which were triggered on long or multi-part outputs. It took a whole evening to hunt them down, but now the CLI seems to work fine. Now I run three BGP connections with several thousand routes! commit 54896cbdba42a2ccd83c7f23c8ba14bed37a8b73 Author: Martin Mares Date: Thu Apr 27 22:31:11 2000 +0000 Path attribute can be missing if we process a packet with empty NLRI section. commit 8f6accb5bb26d534576e086894c107387f67906a Author: Martin Mares Date: Thu Apr 27 22:28:49 2000 +0000 Event handlers no longer return re-queue flag. Instead of using it, just call ev_schedule() on the same handler which should work perfectly now. commit 987de54578ce4053d737c64ea924a32f46a441a7 Author: Martin Mares Date: Thu Apr 27 19:44:27 2000 +0000 Fixed stupid bug in as_path_format(). commit 9165888ad24bdefed6a705219c767558d5091cec Author: Martin Mares Date: Thu Apr 27 19:41:10 2000 +0000 Handle connect errors correctly. commit 2add26dfa9c1da1e7fd6248de593c60cf0eba9ca Author: Ondrej Filip Date: Wed Apr 26 20:16:36 2000 +0000 Stub networks done. commit 5904a51266d82482392bad5d6d17a3be54c65596 Author: Ondrej Filip Date: Wed Apr 26 14:03:56 2000 +0000 Nets are used before routers. commit 5db9bae28676d743f53636d74997c85039d09278 Author: Martin Mares Date: Wed Apr 26 13:26:31 2000 +0000 IBGP fixes. commit e1ddd9937759bc22b7241e48400d17840a101d9d Author: Martin Mares Date: Wed Apr 26 13:26:11 2000 +0000 Changed handling of incoming connections, so that we can send data from the send hook without worrying about existence of socket buffers. Also, don't forget to copy peer addresses. commit dfa9a53a66e5747ddbeedfa0a47fa2ca9fc93b99 Author: Ondrej Filip Date: Wed Apr 26 12:54:23 2000 +0000 Routing table calculation. Dijkstra done. commit 0cadd5f531a82578ea6323f730cf8204b755895f Author: Martin Mares Date: Wed Apr 26 12:33:37 2000 +0000 Removed several FIXME's. commit dbf3939a53192c093f9f367edb15bf613126e347 Author: Martin Mares Date: Wed Apr 26 12:32:07 2000 +0000 Better formatting of router ID's. commit ebd3720f8335cecd671382c23fe61f03b7e2acaa Author: Martin Mares Date: Wed Apr 26 12:30:41 2000 +0000 Fixed several bugs in protocol state machine. Reconfigurations and restarts of BGP seem to work now. commit c010f4cb3771536fc62e534549e22c725285bbd2 Author: Pavel Machek Date: Wed Apr 26 11:33:03 2000 +0000 Use right address for ripv6. commit 7f704c06d86c58985e964e05df57d14b92e0cd05 Author: Pavel Machek Date: Wed Apr 26 11:07:57 2000 +0000 Cleanup in preparation for ipv6. commit b0c9c21c2926921843bbbade72e65831280906a8 Author: Pavel Machek Date: Wed Apr 26 09:38:07 2000 +0000 Small cleanup. commit 98347659463cb68cbd751148e19c62cfb109a32b Author: Pavel Machek Date: Wed Apr 26 09:37:07 2000 +0000 Whitespace changes. commit 2e5a8735f4be2c2514ae3a67960ea4ac3f06e364 Author: Pavel Machek Date: Wed Apr 26 09:36:47 2000 +0000 filter_same should now work with path masks. commit f71bded6e97a3eeb4dc58458d042cbe1af631380 Author: Pavel Machek Date: Wed Apr 26 09:30:12 2000 +0000 Bugfix in i_same (comparing of paths still does not work). commit 7a86a8b08db03f002a672d1e8a6481ad52114d1e Author: Pavel Machek Date: Wed Apr 26 08:03:50 2000 +0000 Added code for testing filters. commit 471bd6c30bb0d172699ea7af8f8b9356c8fe48b3 Author: Pavel Machek Date: Wed Apr 26 07:47:47 2000 +0000 Marked place where new enums belong. commit 94d9dfa47a14609e7057f26614b4094dddc8439d Author: Pavel Machek Date: Wed Apr 26 07:31:45 2000 +0000 Startup renamed to __startup: it is internal function and mj already uses word startup in other context. commit 6fd766c17eedf4897e2dff712f0e06bb84dd3d8a Author: Martin Mares Date: Tue Apr 25 23:08:31 2000 +0000 Implemented automatic restart after error with all the timers needed. commit 8573314326a36cc8c9aa1755e7ad6c51617015c8 Author: Martin Mares Date: Tue Apr 25 23:08:03 2000 +0000 Avoid printing of error messages on Cease notifications. commit 00c0c18aea40dd39efc275e24ad9d5e12a873a32 Author: Martin Mares Date: Tue Apr 25 23:07:47 2000 +0000 Allow sk_close(NULL). commit b3155b3399d84bb2dae8441171aa73236d790048 Author: Martin Mares Date: Tue Apr 25 22:01:19 2000 +0000 Randomize timers properly. commit 42532f084640645cfde9af7c0aa69a36b1de91ad Author: Martin Mares Date: Tue Apr 25 21:58:17 2000 +0000 Support dynamic reconfiguration. commit 41b26cfb552a4a441490779344326ff85819252b Author: Martin Mares Date: Tue Apr 25 21:56:46 2000 +0000 Don't forget to set filter pointers in struct proto when reconfiguring. commit 99f70c78e11f99f73a142ffcb8b65bd142c0a36c Author: Martin Mares Date: Tue Apr 25 21:31:15 2000 +0000 Use the same attribute names as in filters. commit 684c25d98fbfd7cc9275f401d8d451135615af8d Author: Martin Mares Date: Tue Apr 25 21:21:52 2000 +0000 When sending BGP attributes, re-create the flags, so that attributes added by filters which get the flags wrong are fixed automagically. commit efcece2da3054d9a0e5b5d2233549b3323428023 Author: Martin Mares Date: Tue Apr 25 21:13:25 2000 +0000 Better reporting of both local and remote errors. commit a47a01083b6ff9196f39136d68ed32ac70b31d15 Author: Martin Mares Date: Tue Apr 25 13:32:17 2000 +0000 Real parsing of BGP OPEN options including capability negotiation. commit 8b258e4e659cd8bacf0f7e3997d30b43561ac3e6 Author: Martin Mares Date: Fri Apr 21 13:01:28 2000 +0000 LOCAL_PREF is now always present and exported over all ibgp connections [draft] Allow setting of address of the local end of the TCP connection. Several bug fixes. commit 2a9e064d7b41ae6e944dd9fbcb18b89e8fda0dba Author: Martin Mares Date: Fri Apr 21 12:25:35 2000 +0000 If no NLRI's are present in an UPDATE message, parse the attributes, but don't check presence of mandatory attributes. [draft-09] commit f380aa60faa41872b78155f899518b25933d18b9 Author: Martin Mares Date: Thu Apr 20 23:05:41 2000 +0000 IPv6 compiles with glibc 2.1. commit f33c6c66020da3b10b27fba5585d20702b173c6f Author: Martin Mares Date: Thu Apr 20 22:55:32 2000 +0000 Use xmalloc() instead of malloc(). commit 7787ace61ae41060e599ce52e8f0017750d350da Author: Martin Mares Date: Thu Apr 20 22:54:22 2000 +0000 Synced to draft-ietf-idr-bgp4-09. commit 9bc6ab404190db53c9c9dbc183f6fc6fa3e704fb Author: Martin Mares Date: Thu Apr 20 22:34:50 2000 +0000 Fixed reporting of unknown options. commit 7d6eebae3b87cac2d09fd5201b603d4fd969fe06 Author: Pavel Machek Date: Thu Apr 20 10:25:51 2000 +0000 Create syntax sugar for add/delete/prepend, so xyzzy.prepend(123) is possible. That means that milestone 3 was reached. commit 77f37ae0994774f6402499e0a79287d85afa6edf Author: Pavel Machek Date: Thu Apr 20 10:24:41 2000 +0000 Test new syntax of add() and delete(). commit 5f532adde20300ecab63d3e521fb0dfbfb33df2b Author: Martin Mares Date: Wed Apr 19 13:54:35 2000 +0000 Temporarily ignore unknown options. commit f381cdce5225c0652bf9182ac40a1a54436c9692 Author: Martin Mares Date: Wed Apr 19 13:54:17 2000 +0000 The ATOMIC_AGGREGATE parameter is optional transitive. commit e0d6a7bda446d96dc3d56f65afed1872f20407cb Author: Martin Mares Date: Wed Apr 19 13:28:56 2000 +0000 Delay fetching of router ID. commit 035044b1d946c50efd4b59a8869198a0300c8151 Author: Martin Mares Date: Wed Apr 19 12:51:14 2000 +0000 Select the right source address and don't check port numbers. commit 85c92555efcd67d2671a8aef1bf7c3f4acc2b21d Author: Ondrej Filip Date: Tue Apr 18 22:11:05 2000 +0000 Grr, another patch to make it compile. commit 740d16d972d8e2accdb7a2f92048de302c9e966c Author: Ondrej Filip Date: Tue Apr 18 22:07:58 2000 +0000 Another ack bugfix. (Bad test for MIN_LS_ARRIVAL.) commit 84228eee273e2a689f4479d9a91f6b0a32c19b44 Author: Ondrej Filip Date: Tue Apr 18 21:40:11 2000 +0000 LS ack bugfix. (I didn't remove LSA from LSret hash.) commit 19fc4c763e745d56c8d80d04d6813766c1cfa04a Author: Ondrej Filip Date: Tue Apr 18 21:13:56 2000 +0000 LS ack. commit 26116eac93b51c503f5448d9f583847a51bef68d Author: Ondrej Filip Date: Tue Apr 18 20:34:19 2000 +0000 Better LS Ack dumping. commit 48f5a61f694faceb7cdc41e291f0da9411000c45 Author: Ondrej Filip Date: Tue Apr 18 19:56:43 2000 +0000 Bugfix in neighbor dumping. commit 9eada7ca03c6c4111e759b0910a1a654a7f3216e Author: Ondrej Filip Date: Tue Apr 18 19:44:16 2000 +0000 Fixed the serious bug in LSack. Oh, I'm an idiot. I sent LSACK, but in header was LSUPD. :-( commit 9eea604769662479891020b5a0fb282faa6dc36f Author: Ondrej Filip Date: Tue Apr 18 19:31:42 2000 +0000 Multicast open socket for (B)DR bugfix. commit 79f036ef6e9b2204528a41079c59a3a9ae9d50f5 Author: Ondrej Filip Date: Tue Apr 18 19:22:49 2000 +0000 Dump changes. commit 4472402551a1cc8d760a4e980fdcd7a417e0796a Author: Ondrej Filip Date: Tue Apr 18 18:29:50 2000 +0000 Many %u changer into %I. commit 89929e9daad0df36a289e7ae7d70dbc648c3b6b3 Author: Ondrej Filip Date: Tue Apr 18 18:21:10 2000 +0000 Many %u changed into %I and dump cleanup. commit 1508ee8b537aceba98d3af619ba0cded4d2fce9d Author: Ondrej Filip Date: Tue Apr 18 18:01:26 2000 +0000 Iface chstate run only if something really change. commit dd100e40c60811324b450ef7c078f0e992b2ded6 Author: Ondrej Filip Date: Tue Apr 18 17:58:16 2000 +0000 Better dumping in neighbor chstate. commit 8914e37dc028c89488d07556a511d8b49d38856f Author: Ondrej Filip Date: Tue Apr 18 17:54:06 2000 +0000 Better chstate dumping. commit 284c43ff66e8b5879945d2c4e1a285354bd38ddf Author: Ondrej Filip Date: Tue Apr 18 17:36:46 2000 +0000 Sending of ACK disabled, since I'll find bug. commit 023f5e86eba76a79dd90d5a4546ae8b200ccf023 Author: Ondrej Filip Date: Tue Apr 18 17:00:56 2000 +0000 Another LSack update. It's still NOT correct and it surely kills gated or Cyclades OSPF implementation. :-) commit 67315ef64e3655c65cfab032d637fe29d3cf91b2 Author: Ondrej Filip Date: Tue Apr 18 01:06:16 2000 +0000 Some lsack work. There is something very worng. :-( It locked my network. commit 2a0925948de20bd391d2c27a08ffdf2b4350e5c3 Author: Ondrej Filip Date: Mon Apr 17 21:10:40 2000 +0000 Listening on AllDRouters for DR and BACKUP added. commit 38130b863ffcab6b45484e4e5f1eca1dd933bb1a Author: Ondrej Filip Date: Mon Apr 17 20:42:42 2000 +0000 Small change in LSA originating. commit 52276996063bc4a0fbcb642f5075df1cde7ce684 Author: Pavel Machek Date: Mon Apr 17 16:51:28 2000 +0000 Few bugs removed from sgml, makefile added. commit f9b8bcca4eb1fdd8067a66a845b585af61335e3c Author: Pavel Machek Date: Mon Apr 17 16:49:05 2000 +0000 Bird.html will now be autogenerated. commit d37f899ba4e88b56a824fd44e7d81455c099bcba Author: Pavel Machek Date: Mon Apr 17 16:48:22 2000 +0000 First version of sgml documentation commit 0150e5211adabcbde55a76506f0f1a5901214b52 Author: Pavel Machek Date: Mon Apr 17 14:12:02 2000 +0000 Cleaned up mess with types in e,a and e,S. Dynamic attributes should now work. commit 74a7da482b1a537aaa97b4b5d6f6815887150f26 Author: Martin Mares Date: Mon Apr 17 13:41:50 2000 +0000 Adding of dynamic attributes is hopefully correct now. commit 8f10985e1ef77c7d44c8912cf92f99e5c4502cbd Author: Martin Mares Date: Mon Apr 17 13:14:48 2000 +0000 Added BGP to the default list of protocols we build. commit bd2d8190dd79645174beeef1a306c8df53db3b60 Author: Martin Mares Date: Mon Apr 17 13:13:08 2000 +0000 Honor standard communities (no_export, no_advertise, no_export_subconfed) when exporting routes. commit 56a2bed46bf7713cd773b0fd0c097bcfc6345cc1 Author: Martin Mares Date: Mon Apr 17 12:46:07 2000 +0000 Don't import/export MED and LOCAL_PREF on external links. Added real comparison of BGP routes (inspired by the Cisco one). Default local preference and default MED are now settable. Defined filter keywords for all BGP attributes we know. commit 3bbc4ad6ad63d55b1d7845b53865963db79c2e16 Author: Pavel Machek Date: Mon Apr 17 12:40:38 2000 +0000 Special hack for atomic_aggr. commit 708711c37306d6bc3a83935a4d4065814d9c4215 Author: Pavel Machek Date: Mon Apr 17 12:38:24 2000 +0000 Community lists can be now accessed as dynamical attributes. Mj: please create such dynamic atribute for bgp. commit 913ce95b083b2d61e498c63fce3e8f2d5b974cfb Author: Pavel Machek Date: Mon Apr 17 11:52:32 2000 +0000 EAF_ORIGINATED done right. commit 700bbe60fb941534937ad11ca71968224889fa87 Author: Martin Mares Date: Mon Apr 17 11:49:41 2000 +0000 The previous fix for spacing was (a) totally out of context, (b) wrong. Please *read* the code when trying to change it. Also killed a couple of type clashes. commit 2bd2de0188f6a0c1c9482cfc15e35c2b1b81c81a Author: Pavel Machek Date: Mon Apr 17 11:49:21 2000 +0000 pair ~ community list matching works. commit 5a2455886db55ae2d1eb8934c7686b4f6586f83c Author: Pavel Machek Date: Mon Apr 17 11:42:34 2000 +0000 Put space between entries so they are separated. FIXME: should use format as in filters. commit 4444ed2b26ae07dabbcc3e511798e2d7df3a2846 Author: Pavel Machek Date: Mon Apr 17 11:42:08 2000 +0000 It is good idea to separate entries in list _somehow_. Adding/deleting to community lists from filters now works. commit 991c36b509ad5bb96b4a28d0ec53813628e393a4 Author: Pavel Machek Date: Mon Apr 17 11:37:05 2000 +0000 Use EAF_ORIGINATED as mj wanted. mj: check this! commit 9c400ec9dd0ee74f1f350ead87dcd7366dbab7b1 Author: Pavel Machek Date: Mon Apr 17 11:34:38 2000 +0000 Int sets moved to core. It is now possible to have variable of type clist. commit e3558ab14ee60c8c9792bc3ed54d9f0c3eaa8ea8 Author: Martin Mares Date: Mon Apr 17 11:25:15 2000 +0000 Normalize community sets when exporting. Set PARTIAL bits correctly. commit 51a183af78a330cca46f12dcbff79bb045c4c854 Author: Martin Mares Date: Mon Apr 17 11:23:05 2000 +0000 Define EAF_ORIGINATED and propagate it properly when merging attribute lists. commit 4b03f64b341db7b73eedc00bc5321fedf349a236 Author: Martin Mares Date: Mon Apr 17 11:22:24 2000 +0000 Aesthetical tweaks (asterisk spells `asterisk' etc.) commit 159fa4cea9fb8f36db8335755248e0fac81fb050 Author: Pavel Machek Date: Mon Apr 17 11:20:00 2000 +0000 Finish moving of path matching. Use int_set_print from core for printing community lists. commit 2a40efa5e6252eb5a5dbe5e82dcd9c67ad7838a9 Author: Pavel Machek Date: Mon Apr 17 11:11:33 2000 +0000 as_path_match moved to a-path.c commit 684c6f5a0e134426159be7dbd514271aea9f4d3d Author: Pavel Machek Date: Mon Apr 17 11:06:39 2000 +0000 Path_getlen moved to nest and length was made callable from filters. commit ecd25633bdc3e491a0eca44c63c158eeff388f13 Author: Pavel Machek Date: Mon Apr 17 10:54:01 2000 +0000 Use printing routine from nest/ instead of our own. commit 4b641bab521c4fbabf931c3eac7704e8e2cab298 Author: Pavel Machek Date: Mon Apr 17 10:50:03 2000 +0000 Path matching now actually works, including / * 1 2 3 * /. commit e399b6f6ad91e6f94081dfe694740451100c7a7f Author: Pavel Machek Date: Mon Apr 17 10:42:28 2000 +0000 Path and path matching seem to work, now. commit 1ed2fe960929081065e75a7fb4322f28a76c508b Author: Martin Mares Date: Mon Apr 17 10:19:15 2000 +0000 Send and receive communities. commit c6add07fa6ca8366fbdcfcd9bc2872c129378366 Author: Martin Mares Date: Mon Apr 17 10:18:55 2000 +0000 Printing of AS paths and community sets. commit afc54517db6946e9cfb62bbdc855954316152c62 Author: Pavel Machek Date: Mon Apr 17 10:16:47 2000 +0000 Prepend and creation of empty path should work, but it has strange syntax for now. commit f421cfdd80cfce7d1ec4759c603e47071eb028f8 Author: Martin Mares Date: Mon Apr 17 09:37:31 2000 +0000 Sending of update messages works! commit c0668f36967ce651e452a476b786b7604038a556 Author: Martin Mares Date: Mon Apr 17 07:53:29 2000 +0000 Created nest/a-path.c and a-set.c which should contain general operations on AS paths and community sets. Moved as_path_prepend() there. Pavel, please move the other functions as well. commit ebff007f08965d83dba5840ee02171d09ac2598d Author: Ondrej Filip Date: Wed Apr 12 15:37:52 2000 +0000 LSack receiving bugfix. commit 4bf41ac8b1d7edb4754c579b714d1c71dc421b4e Author: Ondrej Filip Date: Wed Apr 12 15:20:13 2000 +0000 LS Ack receiving done. commit 58313b24c8e31f02f242b7d090b54aab8295ce04 Author: Ondrej Filip Date: Wed Apr 12 14:49:20 2000 +0000 Stupid "+1"-bug fixed. commit c8f685cb9d88e447d6057f92bcbb1e0df441ca35 Author: Martin Mares Date: Wed Apr 12 14:14:47 2000 +0000 Made last Pavel's changes compile. commit 0a40e97328180576577da26a5ce8933f616d84f1 Author: Pavel Machek Date: Wed Apr 12 14:12:37 2000 +0000 as_path_prepend is usable outside bgp. commit c2b28c99103a643dd29ad48152999d6dac7722fe Author: Martin Mares Date: Wed Apr 12 14:09:26 2000 +0000 Real bucket lists. commit a2d157463accf02e2db9fd3dd174b7e46dae8938 Author: Pavel Machek Date: Wed Apr 12 14:05:37 2000 +0000 One less shift/reduce conflict. commit ac7a2145ccd5cfc54788b0218cc253e3b1721b76 Author: Pavel Machek Date: Wed Apr 12 14:02:04 2000 +0000 f_new_dynamic_attr gets third argument, type as filters know it. commit 12d5677aa3e6217edc7d5508ac3dbbf87edc8624 Author: Martin Mares Date: Wed Apr 12 13:56:04 2000 +0000 Define BGP_PATH. commit 2803c9ddbeca3ece264e618b3a63669e25f4dd85 Author: Martin Mares Date: Wed Apr 12 13:55:53 2000 +0000 Minor updates by Pavel. commit 66d573d4903801c45011de36b6b593f1cde9ea73 Author: Martin Mares Date: Wed Apr 12 13:55:30 2000 +0000 Attribute type hack. commit 10a53608860724c47596948f2fd426d4eca8224d Author: Pavel Machek Date: Wed Apr 12 13:31:39 2000 +0000 Filters now know type path. It is possible to declare variable of type path, but it is not possible to write constant of type path. It should be possible to print paths and match them. commit 775063494694d247b340bb1145e509e31af27802 Author: Martin Mares Date: Wed Apr 12 13:21:23 2000 +0000 Introduced `ARRAY_SIZE' macro to replace all the sizeof(a)/sizeof(*a) constructs. commit dcab78904794156483878b4b8cd924e30a71bcdd Author: Pavel Machek Date: Wed Apr 12 13:07:53 2000 +0000 Renamed f_path to f_path_mask -- which is what it really is. Use linklist instead of array of signed integers for path mask. commit c3edb89ec141355de58fbade353d4b2182c62c1e Author: Pavel Machek Date: Wed Apr 12 12:49:53 2000 +0000 Path masks are needed for filters. commit 77de68825caae7a9cb1275b0020e49fa9cb27e29 Author: Pavel Machek Date: Wed Apr 12 12:10:37 2000 +0000 BGP_PATH masks now actually work as data type. commit 78c6217c1e9f8a46026cecf6a6369b72d5d883b0 Author: Pavel Machek Date: Wed Apr 12 10:34:45 2000 +0000 Path printing is now much nicer: not having to put it backward simplifies it. (Sorry for previous commit, cvs is naughty). commit f7d534cf2e8932869b049bd64677bb0a67e362c1 Author: Pavel Machek Date: Wed Apr 12 10:34:02 2000 +0000 Path printing is now much nicer. commit b475c543b420b65bac90992df99a0fe6c9da7c88 Author: Martin Mares Date: Mon Apr 10 22:08:32 2000 +0000 Fix comments. commit 9196e9f8f951f7cbd372b9243dd10fc761f2fbe6 Author: Pavel Machek Date: Mon Apr 10 16:36:40 2000 +0000 Commit fixes. commit 7f77e2500218c197ba56a473d587dedda7309029 Author: Pavel Machek Date: Mon Apr 10 15:07:43 2000 +0000 Functions for matching paths added, tested lightly. Functions for working with community lists added, they compile. This should not be definitive place for this stuff. commit 73e03bce66e3e8d167f00813d942ef35bfd105e2 Author: Pavel Machek Date: Mon Apr 10 14:45:00 2000 +0000 As usuall, most important info was missing. commit ae8f5584990ce3bfb5b0bec2f7a1c052e45860df Author: Martin Mares Date: Mon Apr 10 12:39:51 2000 +0000 Implemented outgoing attribute cache. commit 6f57dcc07cdf54133bd57aeaec7446f59f2c91cd Author: Martin Mares Date: Mon Apr 10 12:39:29 2000 +0000 Export ea_same() and ea_hash(). commit f2cb1d708dc5de4167a3dc12b50001391d01f5f0 Author: Martin Mares Date: Mon Apr 10 12:38:15 2000 +0000 Dropped CPU_NEEDS_ALIGN_* as unaligned.h no longer uses them. commit 48e842cc98b1436da57c8682c6c8414ba379ed7c Author: Martin Mares Date: Mon Apr 10 11:21:40 2000 +0000 Use neighbor cache to track direct route to the peer or multihop destination. Calculate next_hop properly based on the local address we get from the neighbor entry. commit 287111fed1c8e9eb135df1108ea747e02b30e9e9 Author: Martin Mares Date: Mon Apr 10 10:40:00 2000 +0000 Fix stupid bug in neighbor cache. commit ef2c708dfac4c8b4b5ab0ed8b71842da5c7ab3d7 Author: Martin Mares Date: Sun Apr 9 22:05:02 2000 +0000 More BGP progress... For Pavel: You can use bgp_path_prepend() for prepending AS numbers to AS paths. commit d3feceff105fbcee7a9976812156aea7517c44e6 Author: Martin Mares Date: Sun Apr 9 22:04:12 2000 +0000 BGP doesn't need any inline attributes. commit 3d0ea3a7c3e3b14bd0b9602d6b14518c907d8789 Author: Pavel Machek Date: Fri Apr 7 09:02:17 2000 +0000 Fix of comment. commit 2c971094ebf73c2a2cfc5927095a0c6fd3c15836 Author: Ondrej Filip Date: Wed Apr 5 00:51:25 2000 +0000 LSA flooding done. commit 10000b96a89d1ab4425e29164c3694aa26622b1c Author: Ondrej Filip Date: Tue Apr 4 22:27:19 2000 +0000 Small clean up. (Duplicate #defines.) commit f1f7faceb445fdfa2b2a013b791882afd68ae421 Author: Ondrej Filip Date: Tue Apr 4 22:22:08 2000 +0000 "Bug in hashing" fixed. Ehm it was bug in lsrql node removing. commit d8852b362c015db38abf180888e77900f35089de Author: Ondrej Filip Date: Tue Apr 4 15:55:55 2000 +0000 LSupdate processing improved. Now there is some bug in hashing. :-( commit 921a93f2176723d235989efe882050c0265bea84 Author: Ondrej Filip Date: Tue Apr 4 00:32:17 2000 +0000 Flooding work continues. commit 8496b2e41a81f8281da0e0c3e4bbb72a57d3bf21 Author: Ondrej Filip Date: Mon Apr 3 22:31:07 2000 +0000 Minor change in area list. Now I use MJ's lists. commit 394acced118df7360e480920c65ca260c5b8c44f Author: Ondrej Filip Date: Sun Apr 2 20:41:33 2000 +0000 Work on lsupdates continues. Some checksum cleanup. commit db9fb727699a6244afcff28dcc2320a3e66ee269 Author: Ondrej Filip Date: Sun Apr 2 19:04:23 2000 +0000 lsa_cmp moved into lsalib.c commit 10be74da202b20a7d502724ef8e7a9787b7eba0a Author: Martin Mares Date: Sat Apr 1 10:21:11 2000 +0000 Formatting of dynamic attributes (except for paths and communities which will be added soon). commit dad177d7e045ed07181da02ccd619f8f943a5c80 Author: Martin Mares Date: Sat Apr 1 10:20:12 2000 +0000 RIP: Set attribute class. commit 3991d84e8fa9118a43149d4d3304726eb786bd46 Author: Martin Mares Date: Sat Apr 1 10:19:47 2000 +0000 Changed initialization of protocol list -- now we call proto_build() instead of calling the protocols manually. Implemented printing of dynamic attributes in `show route all'. Each protocol can now register its own attribute class (protocol->attr_class, set to EAP_xxx) and also a callback for naming and formatting of attributes. The callback can return one of the following results: GA_UNKNOWN Attribute not recognized. GA_NAME Attribute name recognized and put to the buffer, generic code should format the value. GA_FULL Both attribute name and value put to the buffer. Please update protocols generating dynamic attributes to provide the attr_class and formatting hook. commit f8809249906811683e7e8d2a7b8cdcccde86742a Author: Martin Mares Date: Sat Apr 1 09:17:33 2000 +0000 BGP now handles incoming routes (IPv4 only). commit 85810613993913831822b84ab7a9792a88fc7a8f Author: Martin Mares Date: Sat Apr 1 09:16:42 2000 +0000 When tracing, always print incoming part of the trace before the outgoing one. Avoid buffer overflows in `show routes' command. commit 798df5b1ab6b497d8d9d6d51764f5aef4eb2d567 Author: Martin Mares Date: Sat Apr 1 09:15:55 2000 +0000 When processing ACCEPT/REJECT carrying no message, don't print trailing newline. I hope the fix is correct, but please check. commit b157361533412de2123787a412e6e463c0b2f13a Author: Martin Mares Date: Sat Apr 1 09:15:10 2000 +0000 SOURCE should really refer to rta->source, not rta->gw. Please check that all rta attributes are available, I guess that at least rta->dest is missing. commit 499cb346f6fb29f9157e12942484c8b4362597c3 Author: Ondrej Filip Date: Sat Apr 1 02:45:49 2000 +0000 LSA checksum works. But it's very uneficient on little endian systems. commit ac4b4683aee8e5aa566b0b5f99bd940bc10d9b71 Author: Martin Mares Date: Fri Mar 31 23:40:00 2000 +0000 Removal of useless includes continues... commit 3cf4a2e2b03d00adce703cd1dc961eea77b7a57b Author: Martin Mares Date: Fri Mar 31 23:35:59 2000 +0000 Removed lots of superfluous includes. Use debug() instead of printf(). commit a37410cbddfadca651c795e9817f66c54374a943 Author: Martin Mares Date: Fri Mar 31 23:33:03 2000 +0000 Use bsprintf() instead of sprintf(). commit 221135d6bf256c85b4aeb08881d6262f6eaadff4 Author: Martin Mares Date: Fri Mar 31 23:30:21 2000 +0000 Include "lib/string.h" instead of . It should give us bzero() and other non-portable functions on all systems. commit c00d31befab5a7e932231f7a8050547c72c94631 Author: Martin Mares Date: Fri Mar 31 23:21:37 2000 +0000 Parsing of BGP attributes. commit 08732b71784b640aebbea88d4452f4c5987d0a09 Author: Martin Mares Date: Fri Mar 31 23:21:19 2000 +0000 Fixed bug in processing of dynamic attributes. commit 65e55e9cca38828980123ea64fe203d799a20810 Author: Ondrej Filip Date: Fri Mar 31 01:40:12 2000 +0000 Checksum changes. Bug is still NOT fixed. :-( commit 9f940976d10e6295f78adf4afb1868a7ed6cac73 Author: Ondrej Filip Date: Fri Mar 31 01:14:41 2000 +0000 Some bug fixes. LSA checksum is still bad. I'll fix it later. commit f45fd3164bf2f9342e12e867f8d68c7fc77d3177 Author: Ondrej Filip Date: Fri Mar 31 00:21:41 2000 +0000 Sending of lspd as responce to lsreq done. commit 14a7921c83f0ecfc8793b3a38e4ac16ae9bd75d3 Author: Ondrej Filip Date: Thu Mar 30 20:18:51 2000 +0000 LSA structure changes. (Len added.) commit de769e24c01ff0c4aa573d9b4cec833dcae182d2 Author: Ondrej Filip Date: Thu Mar 30 20:00:42 2000 +0000 Skeleton structures and files added. commit 95eb1dba3ffe810bd876546ca4580af3bccdf181 Author: Ondrej Filip Date: Thu Mar 30 19:37:26 2000 +0000 Add hashing to link state request list. commit 76915ec9798a2c067ef05c6fb94cea58af12128e Author: Ondrej Filip Date: Thu Mar 30 19:21:17 2000 +0000 Minor changes. commit 973399ae2c21b41983a35fe71657fb41351d99e6 Author: Martin Mares Date: Thu Mar 30 18:44:23 2000 +0000 Basic analysis of UPDATE packets. commit b552ecc4d7ddb1b960aa26b96ebea95a3af72043 Author: Martin Mares Date: Thu Mar 30 17:39:48 2000 +0000 Connection state machine works. commit ce0603a6eda81b97d6db021c91b86cb4c920eb04 Author: Ondrej Filip Date: Thu Mar 30 16:22:58 2000 +0000 Better list manipulation. commit 3fdbafb6f49946f15d0c10d311dd35479bf6c0f1 Author: Martin Mares Date: Thu Mar 30 10:44:20 2000 +0000 More BGP. This time it connects, but the state machine still isn't complete. commit 320f41735795b51c51a9f5c976a2335a9ec96e32 Author: Martin Mares Date: Thu Mar 30 10:43:37 2000 +0000 Defined sk_close() which closes the socket safely even if called from socket hook. Replaces the SK_DELETED hack. Squashed a couple of bugs in handling of TCP sockets. commit 3a6337ecb2f6e5c8454a8416214c60432611aaa6 Author: Martin Mares Date: Thu Mar 30 08:50:46 2000 +0000 Use FF_FORCE_TMPATTR where appropriate. commit 3076b5aedc1d348413276b361806053e80dca7c6 Author: Martin Mares Date: Thu Mar 30 08:50:30 2000 +0000 Renamed FF_OUTGOING to FF_FORCE_TMPATTR which much better fits the semantics. Call rte_cow() instead of rte_do_cow(), so that COW works properly. Stripped "\n" off several (de)bug messages. commit 6d2b32114feadb283cb988daa7ed80142aa8c4d1 Author: Ondrej Filip Date: Thu Mar 30 00:18:59 2000 +0000 LSreq initial work. commit 3ee2310c5dccebe2b63098ab478b5b1d61e4fcb2 Author: Martin Mares Date: Wed Mar 29 22:57:46 2000 +0000 Avoid conflicts with libraries defining their own xmalloc by defining xmalloc to bird_xmalloc internally. commit 2560c8860eeed2e352c394aec920a4f696563e6c Author: Ondrej Filip Date: Wed Mar 29 17:51:40 2000 +0000 Slave bug fix. commit 910e557b47f52bf38aa923a69249670d71befc02 Author: Ondrej Filip Date: Wed Mar 29 17:18:06 2000 +0000 Many changes in dbdes sending & receiving. EXDONE caused. commit 315648af8ed75c91e0dd82748a933963b9e0c4ec Author: Ondrej Filip Date: Wed Mar 29 13:02:58 2000 +0000 RXMT timer handling bug fix. commit 3fba20968816a9dbd4565fd6806f29d72d73f638 Author: Ondrej Filip Date: Wed Mar 29 12:47:07 2000 +0000 Some FIXME added. commit 96501dfe5f6fd7a2837aee910c78f147e54e4f0b Author: Ondrej Filip Date: Wed Mar 29 12:45:37 2000 +0000 Sending of DBdes bug fixed. commit 04c6319a630e9e18bc45da5e5b1c1f11d726c261 Author: Ondrej Filip Date: Wed Mar 29 12:32:25 2000 +0000 IMMS reverted to bits. Outgoing packets dumping added. Cisco does not set inteface MTU. Hmm.... commit 0a06a9b8b3dbd59c850303c49eea97c12e1ac0ff Author: Pavel Machek Date: Wed Mar 29 09:02:00 2000 +0000 f_run gets one more parameter to distinguish between in and out modes. commit 8d2e3eba92e339f0635e0cb2fbfb49482b26295a Author: Pavel Machek Date: Wed Mar 29 08:58:06 2000 +0000 Cross-protocol issues solved better commit 963ea03d872db30e1a0d0216e488b1960590af2d Author: Ondrej Filip Date: Wed Mar 29 00:34:28 2000 +0000 DBdes sending/receiving changes. commit d0031c5ee94b29b7a5419a0504c160e424d970b0 Author: Pavel Machek Date: Mon Mar 27 12:21:11 2000 +0000 Use neigh_connected_to in rip, and behave more correctly w.r.t. whotoldme and nexthop. commit 200accf396b869267fd707b56afddb27d8479acc Author: Martin Mares Date: Mon Mar 27 12:16:37 2000 +0000 if_connected() is again private. Introduced neigh_connected_to() to serve the same purpose efficiently. commit 6480dd08803bc46bcd19b466ac6c499699d17448 Author: Pavel Machek Date: Sun Mar 26 21:31:57 2000 +0000 I broke compilation. Sorry. commit 8c86f96fa6f783326455f8a8d88a242cd8dd9f1b Author: Pavel Machek Date: Sun Mar 26 18:01:27 2000 +0000 Split horizont done right. Locks done better. commit 697711be2cf6b5da140b8c12c301affa53488021 Author: Pavel Machek Date: Sun Mar 26 18:00:45 2000 +0000 if_connected is usefull outside of neighbour cache. commit 9ee07ca53fd94ad72b7cb2776cc15f13a026a910 Author: Pavel Machek Date: Fri Mar 24 10:08:20 2000 +0000 FIXME was actually already resolved commit 772f489932cf24d7a408835ac67f7b4f4d85a1eb Author: Pavel Machek Date: Thu Mar 23 12:08:40 2000 +0000 Minor change to make code more readable. commit ff8ed6328595c77e8b0ed3ed4cea3fb4d9bb141d Author: Pavel Machek Date: Wed Mar 22 14:26:03 2000 +0000 Rip now tries to lock interface. Fixed fatal errors which caused segfault at startup. Fixed fatal errors in rip which caused it not to send more than first update. commit ba4466701aed032f947272dead47b3abc7bb7a3f Author: Pavel Machek Date: Wed Mar 22 14:23:40 2000 +0000 Format of dates changed, so rip authentication is now commented out. commit 72a6ef11fe6589d0f4d5158c207ff8a0669becc3 Author: Martin Mares Date: Tue Mar 21 15:53:50 2000 +0000 Construction of BGP packets. commit a8f944cb6e6c75c1aac2500ccf1f3905c4c3fd7a Author: Martin Mares Date: Tue Mar 21 15:51:30 2000 +0000 Wrote real version of unaligned data access functions (needed for BGP). commit c01e37416d09a92bf838250a15fe99fdc48bc010 Author: Martin Mares Date: Mon Mar 20 21:50:17 2000 +0000 Started work on BGP. Wrote main part of the connection handling code. commit 1cf716f0751ce1d146d6d5114cb36686844d4817 Author: Martin Mares Date: Mon Mar 20 21:49:21 2000 +0000 Handle EINPROGRESS properly. Set IP_DONTROUTE sockopt only if sk->ttl == 1. commit 267a2c0ebd980c16c1cf01044b0ee44095f34b9e Author: Martin Mares Date: Mon Mar 20 20:52:18 2000 +0000 Added missing newline in debug output. commit ca97b489de8cca61d1affa49983b7cdc1c81cf96 Author: Martin Mares Date: Mon Mar 20 18:45:03 2000 +0000 Define new data types for BGP. commit 2638249d34cc7f600fba25edd29538c00a3aca31 Author: Martin Mares Date: Sun Mar 19 22:09:07 2000 +0000 Bare skeleton of the BGP. commit 349e21bb0bb7584fb18c19859d876893c3130947 Author: Martin Mares Date: Sun Mar 19 21:59:24 2000 +0000 Protocol tracing: Don't dump core on filtered out routes. commit 856b87d1e4c44608df5debd8e4246a3c4026bbcb Author: Pavel Machek Date: Mon Mar 13 13:31:00 2000 +0000 Cleanup, mostly debugging messages. commit abf2be7d0cabc3c8c021b6f6784cf63610571715 Author: Martin Mares Date: Sun Mar 12 23:04:04 2000 +0000 Add internal commands of the client to the command list. commit 971b2310ae4d367d608e34e9465ad5d2c65e505d Author: Martin Mares Date: Sun Mar 12 22:55:09 2000 +0000 Commands which failed expansions are to be stored to history, too. commit f098e072bec8d5858afbf713635217ea84c7e45d Author: Martin Mares Date: Sun Mar 12 22:53:05 2000 +0000 Fixed a bunch of FIXME's by removing them :) commit 432709027680d7791b325b2c2116c658eba21c8d Author: Martin Mares Date: Sun Mar 12 22:44:54 2000 +0000 Made `show status' show uptime and time of last reconfiguration. commit 7a88832e78cbc18db109c091d74f6d27284cff44 Author: Martin Mares Date: Sun Mar 12 22:43:13 2000 +0000 Added tm_format_datetime(). commit 81ce667b7b7c38e109984602cf4e5ecbec80f7f1 Author: Martin Mares Date: Sun Mar 12 22:40:07 2000 +0000 Don't crash when filter_same() gets called on FILTER_ACCEPT or FILTER_REJECT. commit a92bebe0ec3545b1f99909d20224977aa6da1827 Author: Martin Mares Date: Sun Mar 12 21:58:51 2000 +0000 Yet another LOCAL_DEBUG turned off. commit 832fa033b7ecacf3225d7aa8c86e30484a07d946 Author: Martin Mares Date: Sun Mar 12 21:54:39 2000 +0000 Cleaned up debugging in kernel syncer. Netlink has still LOCAL_DEBUG turned on, but after some testing I'll gag it. commit e68dd11c43ebec527da69da7b093ae90ef6d6ea9 Author: Martin Mares Date: Sun Mar 12 21:47:25 2000 +0000 Use do { } while(0) instead of empty DBG if not debugging. commit 6b9fa320806ce8a734d865ebcb8052ba0e50c527 Author: Martin Mares Date: Sun Mar 12 21:01:38 2000 +0000 Great cleanup of debug messages. LOCAL_DEBUG turned off in most modules, several debug() calls converted to DBG(). commit 6a9f28b0b9254ba21c36126d6f10388815840001 Author: Martin Mares Date: Sun Mar 12 20:50:35 2000 +0000 Added tracing of interface events. commit b0a47440e33e7a270205130b01d59faadb6b6726 Author: Martin Mares Date: Sun Mar 12 20:49:08 2000 +0000 Oops, got `<' and `>' markers in trace output reversed. commit cfd46ee4c5b0d3689f8f9d094a68bc4b732cd0af Author: Martin Mares Date: Sun Mar 12 20:30:53 2000 +0000 Added debugging of communication between protocols and routing tables. Just ask for "debug routes" if you want to see the routes and "debug filters" if you want even the rejected ones. commit c8d5ffafb7c7e644048691221ca9d56ec68925a0 Author: Pavel Machek Date: Fri Mar 10 20:21:12 2000 +0000 Fix <=, >=, != commit ce17d4c165cadb09d391e34cda1b796a125ef012 Author: Ondrej Filip Date: Thu Mar 9 22:38:05 2000 +0000 LSA DB is completely redesigned. Now it should be faster and it needs less memory. commit af834f8630eb0078c723fb9b0af053dba6725d5e Author: Pavel Machek Date: Thu Mar 9 16:38:51 2000 +0000 Categorized TRACE() messages in rip commit cb822c0777657703e546bc99a7e5b646abe83d3f Author: Pavel Machek Date: Thu Mar 9 15:12:41 2000 +0000 Rip tracing: still need config hunk to set p->debug. commit 38466dbdacc706d7a6abcf348c448bd9f8fb01d4 Author: Pavel Machek Date: Thu Mar 9 14:59:10 2000 +0000 log() classes done right commit 995e5894cd9872603bc7c0ffd79fef96e4839006 Author: Pavel Machek Date: Thu Mar 9 14:47:43 2000 +0000 1 less shift/reduce conflict print now takes arguments separated by , [ 1.2.3.0/24 .. 3.4.5.0/8 ] is now forbidden [ 1.2.3.0/8 ] now actually works commit e4a73dbfcbb24a6a01ca960b641ce29d5045b3ba Author: Pavel Machek Date: Thu Mar 9 13:21:40 2000 +0000 CONST() is now gone commit 30147b89ff3a389ad40096505f3d1a5ba1705736 Author: Ondrej Filip Date: Wed Mar 8 12:50:28 2000 +0000 Sending of DBDes. (Checksum and length calculation NOT done.) commit 839380d7ecd133531ead2403c6dbc74950dad13c Author: Martin Mares Date: Tue Mar 7 21:50:21 2000 +0000 Added debugging of protocol state transitions. commit f30b86f9d5004a3e159c385269e76efc71b1566a Author: Martin Mares Date: Tue Mar 7 21:50:03 2000 +0000 Added configuration of default protocol debugging flags. commit 3eb0b586ca93b1d0d34f935cac8524e02f708126 Author: Martin Mares Date: Tue Mar 7 21:04:36 2000 +0000 No longer echoes commands before sending them. commit 3cbfcafecdf4f3dd1b201e0adf849f9959284c87 Author: Martin Mares Date: Tue Mar 7 21:04:14 2000 +0000 DBG calls debug() if defined(LOCAL_DEBUG) || defined(GLOBAL_DEBUG). commit 96d8e3bff242d5c9d0eb75fa04a21f6c09d8dbcf Author: Martin Mares Date: Tue Mar 7 20:49:48 2000 +0000 Added protocol debugging flags (protocol.h: D_xxx), parsing of them in configuration files and commands for manipulating them. Current debug message policy: o D_STATES, D_ROUTES and D_FILTERS are handled in generic code. o Other debug flags should be handled in the protocols and whenever the flag is set, the corresponding messages should be printed using calls to log(L_TRACE, ...), each message prefixed with the name of the protocol instance. These messages should cover the whole normal operation of the protocol and should be useful for an administrator trying to understand what does the protocol behave on his network or who is attempting to diagnose network problems. If your messages don't fit to the categories I've defined, feel free to add your own ones (by adding them to protocol.h and on two places in nest/config.Y), but please try to keep the categories as general as possible (i.e., not tied to your protocol). o Internal debug messages not interesting even to an experienced user should be printed by calling DBG() which is either void or a call to debug() depending on setting of the LOCAL_DEBUG symbol at the top of your source. o Dump functions (proto->dump etc.) should call debug() to print their messages. o If you are doing any internal consistency checks, use ASSERT or bug(). o Nobody shall ever call printf() or any other stdio functions. Also please try to log any protocol errors you encounter and tag them with the appropriate message category (usually L_REMOTE or L_AUTH). Always carefully check contents of any message field you receive and verify all IP addresses you work with (by calling ipa_classify() or by using the neighbour cache if you want to check direct connectedness as well). commit c801e1fbabee49838287a9e96814d3d0bf84ffa2 Author: Martin Mares Date: Tue Mar 7 20:09:35 2000 +0000 Renamed command `shutdown' to `down', so that `s' can be used as an abbreviation for `show'. commit 3549667925d04fa6a46ea35f56a9d3c741634d6a Author: Martin Mares Date: Sun Mar 5 22:48:30 2000 +0000 Implemented real slab allocator. If you suspect it from being buggy, just #define FAKE_SLAB at the top of lib/slab.c to bypass it. commit 9f4929e749d945c727f245ed7ef30c557124c352 Author: Martin Mares Date: Sat Mar 4 22:30:44 2000 +0000 Renamed EAF_INLINE to EAF_TEMP to make the name reflect the real meaning. commit b9626ec6eaf299b889f52d017d025f356b43371a Author: Martin Mares Date: Sat Mar 4 22:21:06 2000 +0000 Garbage collector events and counters are now per table and one day they can be made configurable if it turns out to be useful. commit 16c07e3d519b87a2166a513dd4edd8dab3bc3d19 Author: Martin Mares Date: Sat Mar 4 21:27:57 2000 +0000 Removed bogus comment. commit 54fb7701a21693eb7a51342eb98d663dd7324e8a Author: Martin Mares Date: Sat Mar 4 21:26:35 2000 +0000 Fixed display of short continued messages in verbose mode. commit c7814f01fc5fb51ae4054833ea8074ab9bcc86de Author: Martin Mares Date: Sat Mar 4 21:26:19 2000 +0000 Enabled short continuations. commit a58dad62383855ad1a60d4ec5406c38d24874506 Author: Martin Mares Date: Sat Mar 4 21:19:10 2000 +0000 Please *think* when defining operator priorities. (-: num_of_parser_conflicts -= 42 :-) commit ee76a92a80a0241421f57fe332c251255d2af4f8 Author: Martin Mares Date: Sat Mar 4 21:09:14 2000 +0000 Implemented real attribute cache. commit d4d7562806b7306d6e5ed9b759906e264b743dc5 Author: Pavel Machek Date: Thu Mar 2 22:23:18 2000 +0000 Avoid being exponential, do not allow ! = commit c8518ae136d94dc9576531a311947ba13213aea0 Author: Martin Mares Date: Wed Mar 1 15:05:43 2000 +0000 Removed RTF_EXTERIOR and RTF_TAGGED (unused). commit 85053fce04a2cba09332a6eb667f09f9c4182392 Author: Martin Mares Date: Wed Mar 1 14:51:47 2000 +0000 Reimplemented neighbor cache. Now uses real hashing. commit 7293c5dd8175aac4650cb48c68c7dd278a74371e Author: Martin Mares Date: Wed Mar 1 14:49:07 2000 +0000 Added proto->hash_key which contains randomly generated hash key used for calculation of hash functions depending on proto. commit 62ab789de5f5ace97a93fce551469f0229ba8c92 Author: Pavel Machek Date: Wed Mar 1 14:42:59 2000 +0000 Added type parameter to f_new_dynamic_attr. commit 31e79264a21df1acdbfbb66af40e05073b115a2c Author: Pavel Machek Date: Wed Mar 1 14:31:31 2000 +0000 tmp_attrs fixed. I do not know if it is right since mj ingores talk once started :-(. commit 4ebbbd4079cbf6295367b9c7a555c1b668fa0d8c Author: Martin Mares Date: Wed Mar 1 12:15:20 2000 +0000 Changed comments regarding hash function. commit 14a6c2a705fce9143e721b8da167dcbaa053c936 Author: Martin Mares Date: Wed Mar 1 12:03:43 2000 +0000 IP_PREC_INTERNET_CONTROL for IPv6 (see the comment). commit 4c1b4e1a582ea8d13943c46ad87588d5743439cb Author: Martin Mares Date: Wed Mar 1 11:48:11 2000 +0000 If the user has specified identical preferences for instances of different protocols, break the tie by comparing addresses, so we keep the ordering unambiguous. commit aee539f241dd233eb9e716e11ee2c449ab482a75 Author: Martin Mares Date: Wed Mar 1 11:42:13 2000 +0000 Made `datetime' more user friendly. Now it should be a quoted string of type "dd-mm-yyyy". commit db1326aa5e39711d88d305ac08a0afa137ab77f0 Author: Martin Mares Date: Wed Mar 1 11:32:23 2000 +0000 Dynamic attributes are now declared in per-protocol grammar files instead of filter/config.Y. Bird now compiles even if you disable RIP. Removed RTA and IMPOSSIBLE tokens (unused). Removed superfluous comment in filter.h. I've tried to do my best, but Pavel, please check these changes. commit 2ca3d9a8fc25be6f7d41d8a6ff50a70612c11c93 Author: Martin Mares Date: Wed Mar 1 11:30:16 2000 +0000 Defined INVALID_TOKEN which is a token guaranteed to be never generated. commit d07bab399735ee80205637f8e180e7595e0c0a67 Author: Martin Mares Date: Wed Mar 1 11:29:30 2000 +0000 ipa_opposite hack is not applicable in IPv6. commit ef0883a12fc699fbcef61f56fe8445f5e2ac1bb7 Author: Martin Mares Date: Tue Feb 29 23:20:55 2000 +0000 Adapted RIP to new interface flags. Pavel, please verify it's right. commit 6a636392d33627944df9d5a9573932cdc0bf6da5 Author: Martin Mares Date: Tue Feb 29 23:19:52 2000 +0000 Rewrote interface type detection logic. The `unnumbered' flag is now per address, not per interface (hence it's ifa->flags & IA_UNNUMBERED) and should be set reliably. IF_MULTIACCESS should be fixed now, but it isn't wise to rely on it on interfaces configured with /30 prefix. commit e69e4ed9349ee28262fe74f70e7e52c181d5d098 Author: Martin Mares Date: Sun Feb 27 22:00:19 2000 +0000 Support expansion of command abbreviations. Client considered finished (modulo bugs). commit de30342f97490e3a3626c4a5fbf3352d1d0aa9c8 Author: Ondrej Filip Date: Fri Feb 25 19:19:41 2000 +0000 Router LSA & area adding. commit b786df7035f43bb5eb4f7bca980e3bf684e527b7 Author: Ondrej Filip Date: Fri Feb 25 14:26:54 2000 +0000 Memory allocation in ospf_area changed. commit 2d496d2028e1283384f1c9d243f96eb59c42297e Author: Pavel Machek Date: Fri Feb 25 11:15:26 2000 +0000 Get rid of 'ab'-s, added return to functions. commit df0cf75dc849f5182d75328f4d4189a2d6048b57 Author: Martin Mares Date: Thu Feb 24 18:46:24 2000 +0000 Hmmm, libreadline 2.1 seems to be the oldest version we work with. commit 1d4ba6583afa5e6d4118aca0d0a645342d575b68 Author: Martin Mares Date: Thu Feb 24 18:43:23 2000 +0000 Moan loudly if libreadline is an old version which doesn't support callbacks. commit ab56f6b16fd9401565a066122be3231dccd24fb6 Author: Ondrej Filip Date: Thu Feb 24 00:26:10 2000 +0000 Area work and router LSA starts when interface goes up. commit ea28da044af9a35407724ba091d9a823c1cfe7e7 Author: Ondrej Filip Date: Wed Feb 23 23:23:19 2000 +0000 Small change for debugging. commit 91808fffc22e37b6d558f22db911ad0a3277d694 Author: Ondrej Filip Date: Wed Feb 23 23:14:18 2000 +0000 Structures for router LSA added. commit 6fa948d6c5abd0620836f66c654354ce38936f3a Author: Ondrej Filip Date: Wed Feb 23 23:13:27 2000 +0000 Better debugging. commit e6fcf113eca687d4dd888ef41033114ec8be82b9 Author: Ondrej Filip Date: Wed Feb 23 23:13:10 2000 +0000 Better debuging. commit fae0396ea4fd9d2530086eef77b8a11b6640d640 Author: Martin Mares Date: Thu Feb 17 23:37:16 2000 +0000 Completion works. Unfortunately, we have to access a couple of internal symbols of libreadline :-( commit 0223d4fff11badc03470b4320fa9dfe28afd1bed Author: Martin Mares Date: Thu Feb 17 22:00:13 2000 +0000 Client: Online help works (Cisco style: just press `?' at the end of a line). commit c51f132d582632037b4ef064fbd32d785af245fc Author: Martin Mares Date: Tue Feb 15 12:18:37 2000 +0000 First usable version of the client. No command completion and similar nifty features yet, but it works. commit 973304bc2b274ffaa6e27612256f6cea4a3a40c1 Author: Martin Mares Date: Mon Feb 14 17:32:50 2000 +0000 Don't make dependencies in client directory if the client is not configured in. commit 4bf6de87379a3458b59275373b9e88611baabb88 Author: Ondrej Filip Date: Tue Feb 8 22:43:10 2000 +0000 Hash table structure redesigned. commit 316d7bd7d16ea7ea26831bb7100dd0ac3c63084e Author: Ondrej Filip Date: Tue Feb 8 22:13:12 2000 +0000 Other LS struct added. commit d3cb698053e14b3d35750d92389c34b71503bfc6 Author: Ondrej Filip Date: Tue Feb 8 19:24:22 2000 +0000 LSA type changed from u16 to u8. commit c7b915d68c9475ba3a23c99ec7f796ec0a53978b Author: Ondrej Filip Date: Tue Feb 8 19:12:42 2000 +0000 Malloc() changed to cfg_alloc(). commit 9a4037d40891321a2f091cb1f1003bb1ee725136 Author: Pavel Machek Date: Mon Jan 31 17:44:22 2000 +0000 filter_same() implemented. Don't bet on it, yet. commit 70844a6a46305080d7ada79936fb272beb411cf4 Author: Pavel Machek Date: Wed Jan 26 21:28:53 2000 +0000 Updated docs about filters, and added fixme. commit bd215f8bab7e0d94fa482b47ff8d5971cd5ab799 Author: Pavel Machek Date: Wed Jan 26 14:12:18 2000 +0000 Do not send empty packets in rip. commit 8660913ba83d66491caf407a7e6eb16a4eeda2d0 Author: Pavel Machek Date: Wed Jan 26 12:07:18 2000 +0000 Output made prettier. commit 7211be1cffdee84fd15e8b6b2a07a644948f1455 Author: Martin Mares Date: Thu Jan 20 13:13:30 2000 +0000 Configure, link and use the readline library. commit 9fac310d1a4e46f4bcc70177e59cbf93763ef479 Author: Martin Mares Date: Wed Jan 19 15:07:00 2000 +0000 Put client on a stony ground. The whole client is going to be system-specific (the current version UNIX-specific) anyway, so it's useless to try splitting it to sysdep and generic part. Instead of this, configure script decides (based on system type and user's wish) what (if any) client should be built and what autoconfiguration it requires. Also, the client provides its own die/bug/... functions. commit f50b9e48b93e3f69423a0e6e5fef273ba2022958 Author: Martin Mares Date: Wed Jan 19 14:37:56 2000 +0000 Generate a list of all commands and their help texts for the client to use. commit 4b87e256eba51a8711c24fbae501ac7975b4ecd3 Author: Martin Mares Date: Wed Jan 19 12:30:19 2000 +0000 Split off general commands to cmds.c. Added `show symbols' command which dumps whole symbol table together with symbol types etc. commit f5ad9f87a389c1167a8468d0190bcf6d3cc33cf6 Author: Martin Mares Date: Wed Jan 19 11:52:32 2000 +0000 Killed a couple of bugs in the neighbor cache. Manual disable/enable/restart/shutdown/reconfiguration of protocols no longer hangs on loops in neighbor lists :) commit 3ea1ba632b3cdb5005a9339fd5e74d5f93631a48 Author: Martin Mares Date: Tue Jan 18 11:01:03 2000 +0000 Killed protocol->priority. Protocol startup should be clean and hack-free now. It seems everything still works (except for disable/enable/restart which hangs sometimes, but it's another story). commit 54aaa89ada2d048c64a5afd58844bc395b1a3cfe Author: Martin Mares Date: Tue Jan 18 10:42:45 2000 +0000 protocol->startup_counter no longer exists. commit aa8761de9471dbe28149d990bdbc851c744f4e2b Author: Martin Mares Date: Tue Jan 18 10:39:30 2000 +0000 Kernel route syncer now supports dynamic reconfiguration. Also it doesn't depend on the startup counter hack now and uses a zero-time timer instead to make itself scheduled after normal protocol startup. commit fb89b1a4ced5f3d847ecbc1d4b86a0cb47564ef7 Author: Martin Mares Date: Mon Jan 17 12:40:00 2000 +0000 Removed point-to-point tunnel hack as it breaks ordinary PtP interfaces. I'll find a better solution soon. commit 295ae16d4ddf4b714e716a0a1537f40c54f1119c Author: Martin Mares Date: Mon Jan 17 12:38:50 2000 +0000 Static protocol supports full dynamic reconfiguration. commit 471cc0be651a8db7068a65963ecfd4cc45f97ab1 Author: Martin Mares Date: Mon Jan 17 12:38:07 2000 +0000 Moved initlialization of protocol lists to global init. Argh. commit d272fe22dddcb5c293d6aac18d36e3e3e66406a5 Author: Martin Mares Date: Mon Jan 17 11:52:50 2000 +0000 Separated `official protocol names' used in status dumps from name templates used for automatic generation of instance names. protocol->name is the official name protocol->template is the name template (usually "name%d"), should be all lowercase. Updated all protocols to define the templates, checked that their configuration grammar includes proto_name which generates the name and interns it in the symbol table. commit f7fcb752520759ab3aed274ca608e8e6f96665c8 Author: Martin Mares Date: Mon Jan 17 11:17:33 2000 +0000 Reconfiguration for device protocol. commit 0ec90e9fc6f6bec2d0b64f6b9711a6d3edb4bd52 Author: Martin Mares Date: Mon Jan 17 00:20:45 2000 +0000 Pipe protocol supports reconfiguration. commit 88dc89f9918f524d9ca143d409c261a4a8230555 Author: Martin Mares Date: Mon Jan 17 00:20:17 2000 +0000 Device protocol supports reconfiguration. commit 26368f656c2398acc4d3ed55879d2f371cecf75b Author: Martin Mares Date: Mon Jan 17 00:19:58 2000 +0000 Don't forget changing proto->name to point to name in new configuration (to avoid the name being freed with the old config). Also remember to add proto_pipe to protocol_list. commit ca0edc53956ecd493055ba1625754ee75d58a9c7 Author: Martin Mares Date: Sun Jan 16 23:36:53 2000 +0000 When a quoted string is encountered, don't forget to copy it to the config pool before passing it to the parser. commit 99278e10421a2e6703e77f91e6ef436eaf660405 Author: Martin Mares Date: Sun Jan 16 23:36:19 2000 +0000 Wording changes. commit f14a4becbe77cfb3c2e4243d6fc383b0acd8956f Author: Martin Mares Date: Sun Jan 16 23:30:06 2000 +0000 Reworked proto lists -- each proto is now in two lists: the global one (proto_list) and per-type one (original lists). A lot of things simplified. Implemented `disable', `enable' and `restart' CLI commands. commit 30a6108cccac93048440113211df2eed1fb541b1 Author: Martin Mares Date: Sun Jan 16 17:49:32 2000 +0000 Added filter_same() for comparision of two filters. Pavel, please implement this as soon as possible. commit bf8558bc9cab35f31bccd6a55e51f121370765c4 Author: Martin Mares Date: Sun Jan 16 17:40:26 2000 +0000 Converted shutdown to a kind of reconfiguration, it's no more handled as a exception in protocol state machines. Introduced a `shutdown' CLI command. Killed few reconfiguration bugs. commit ebc793a5f552bb676014f771d81c074b7dd4345d Author: Martin Mares Date: Sun Jan 16 17:39:16 2000 +0000 No more problems when events get scheduled during event processing. commit 50fe90edf3deab409ea7887c131bfe6ce89fa556 Author: Martin Mares Date: Sun Jan 16 16:44:50 2000 +0000 First attempt on dynamic reconfiguration. There are still lots of bugs and problems to solve, but the hardest part works. commit 394aec8fdd112a81da1e2f6f0e09ee74256dc24e Author: Martin Mares Date: Sun Jan 16 16:40:57 2000 +0000 Don't forget to set proto->min_scope = SCOPE_HOST. commit 150875747813977ddf12474fa10a771090586402 Author: Ondrej Filip Date: Wed Jan 5 00:03:47 2000 +0000 Preparing for building LS databaze. Huh, why is it so complicated? :-( Adding definition of some constants. commit 7a7c1d9f34b95263d3bc100dec6cf3b94f1a9802 Author: Pavel Machek Date: Mon Dec 20 19:14:06 1999 +0000 Few more entries for bird documentation commit c8c0f62444a048e9d0986463ee1bfcdfc06df7c8 Author: Pavel Machek Date: Sat Dec 18 20:41:19 1999 +0000 This is first version of documentation. Be sure to take a close look at it, and it would be very nice if you wrote at least introductions to your chapters... commit 60d7d10e6f19483545760f2241312758dd72a2ad Author: Pavel Machek Date: Sat Dec 18 20:39:53 1999 +0000 Added fixme. commit 476e10842503b51331a7994b6e25c91b20eb8e71 Author: Martin Mares Date: Thu Dec 16 13:51:43 1999 +0000 Minor cleanups. commit e693ddff874890a9e5c990f6ca75d2e2358d065a Author: Martin Mares Date: Thu Dec 16 13:23:32 1999 +0000 Handle cases when SIOCGIFINDEX is defined, but doesn't work (new glibc with 2.0 kernels). commit 3f996d46df3cf1bdbefe0b0b0f5245c76b12756b Author: Martin Mares Date: Thu Dec 16 13:14:32 1999 +0000 Added missing semicolon. rip.h compiles in IPv6 mode, rip.c still doesn't. commit a2867cd957c9282d47440a1f42a6b823f5c9e4b2 Author: Martin Mares Date: Thu Dec 16 13:14:02 1999 +0000 Better order of includes. set_inaddr() moved to sysio.h. commit 12a9d139eecea7e7fb5e73e82a2531c70894d4c8 Author: Martin Mares Date: Thu Dec 16 13:13:22 1999 +0000 ipv6_compare() accepts non-lvalue arguments as well. This makes filters compile with IPv6. commit 67ece6df42b20ecc524cf3e5c14e8b541afec860 Author: Martin Mares Date: Thu Dec 16 13:06:13 1999 +0000 Tried to clean up multicast handling. Now we don't try to guess multicast abilities depending on definedness of symbols and use hard-wired system-dependent configuration defines instead. Please test whereever you can. commit ccdc33975648647270bf33511ec5bbab4d634634 Author: Martin Mares Date: Thu Dec 16 12:59:09 1999 +0000 Avoid touching F_MODIFY, it no longer exists. commit 6aea8905c4f0c2b0da6061b445894496e473145d Author: Martin Mares Date: Thu Dec 16 12:18:33 1999 +0000 TODO entries and FIXME's. commit d46ffc97ffc9ae753f999614bb69033b1f44df6d Author: Martin Mares Date: Thu Dec 16 12:18:19 1999 +0000 Kicked off F_MODIFY (not generated nor used) commit f545d38707bf01aa9db3915d782a547f89f92c1d Author: Martin Mares Date: Thu Dec 9 18:54:20 1999 +0000 Added universal locking mechanism which will solve problems with protocols wanting to use the same port on the same interface during reconfiguration time. How to use locks: In the if_notify hook, just order locks for the interfaces you want to work with and do the real socket opening after the lock hook function gets called. When you stop using the socket, close it and rfree() the lock. Please update your protocols to use the new locking mechanism. commit 30bc402ebb324749f9468f8ff196545bb0a58442 Author: Martin Mares Date: Wed Dec 8 15:12:54 1999 +0000 Temporary work-arounds for multicast problems. Needs further investigation. commit 0da472d7e867e31c49fccc4ee45df3ef47c29c9b Author: Martin Mares Date: Wed Dec 8 14:16:13 1999 +0000 Except for special protocols (nowadays only the kernel syncer), don't export host and link scope routes. commit dff1f5791794102e4e6880516545145c5036873f Author: Pavel Machek Date: Wed Dec 8 13:33:44 1999 +0000 Added hooks for show route. Fixed passing metrics around routing tables. commit dc82daaa9b0d88dca8684a7a766b253853ee7023 Author: Martin Mares Date: Wed Dec 8 13:20:19 1999 +0000 - Path to control socket is selectable via command-line option. - die() when control socket open failed. commit 4d4de35f002e3d7a780462b834f01eeb0f70239a Author: Pavel Machek Date: Wed Dec 8 12:51:45 1999 +0000 Fix timing and fix endianity in metrics. commit 2e18b87dcf5d4029d11bc46b37d601aae4f97174 Author: Pavel Machek Date: Wed Dec 8 12:51:26 1999 +0000 Disallow rta.net syntax. commit 3df563fa4c3c0acca181ce09dbb05452720e90e8 Author: Pavel Machek Date: Wed Dec 8 12:51:15 1999 +0000 Put rip options into config file. commit 9b47eb8530263b5ebd4a41f9ef3dab982775fc44 Author: Pavel Machek Date: Wed Dec 8 12:50:57 1999 +0000 Make bird.conf that does not crash machine when you run bird as root. commit 6c14255dd666c362f19f193a41a31f66310a34ea Author: Pavel Machek Date: Wed Dec 8 10:15:51 1999 +0000 Make rta. syntax optional. commit febe526303996d48a667cd077f5703ca91f43219 Author: Pavel Machek Date: Wed Dec 8 10:15:40 1999 +0000 Separated bird.conf and bird.conf for testing filters. commit f78056fb2cf4554d5dcc50b5e0e79bc09ae825cf Author: Martin Mares Date: Mon Dec 6 13:51:04 1999 +0000 Allow logging to stderr as well. commit 4ab5331c6370ba83dc7b228f9a94ccc1c64a973e Author: Martin Mares Date: Mon Dec 6 13:50:50 1999 +0000 Added type `g' for void (general) pointer. commit a0c37b45e59f024fc24b65ffbaf2c9e0f1996938 Author: Martin Mares Date: Mon Dec 6 13:45:56 1999 +0000 Logging is now configurable. You can define multiple log outputs (to both files and syslog) and assign lists of message categories to each of them. commit 7c0cc76ed76100ef8492f13eeec1e061d52b9be0 Author: Martin Mares Date: Mon Dec 6 13:44:45 1999 +0000 Moved initialization of protocol list to proto.c. Added sysdep configuration hooks. commit a9c986f98116fef5c35d956e7a867be0735f3268 Author: Martin Mares Date: Mon Dec 6 13:43:47 1999 +0000 Added tracked_fopen() which is a fopen registered in resource database. Will be used for log files. commit 34350a52700955d50895058d01b5407aea970e9b Author: Martin Mares Date: Mon Dec 6 12:34:45 1999 +0000 Implemented echoing of log messages to CLI connections. Just try `echo all'. commit f3792601dfe85c3017c984a6de5722d0e9da8a16 Author: Martin Mares Date: Sat Dec 4 23:28:56 1999 +0000 Don't forget to send an OK reply after dumping debug information. commit 305a01f57bd97906000c36bb154d63bc90012ef7 Author: Martin Mares Date: Sat Dec 4 23:17:29 1999 +0000 Added DEBUG commands. Removed CLI tests, real commands now serve as much better examples. commit feed82267663c6826da896309de180417bd0b39f Author: Martin Mares Date: Fri Dec 3 11:41:23 1999 +0000 Implemented `show static'. It's a relatively good example of how to write show commands for other protocols. commit 02c1fbddd462fecc6887a44ef67202870bcae7be Author: Martin Mares Date: Fri Dec 3 11:40:45 1999 +0000 Added proto_get_named() to be used in CLI commands to get protocol instance of a given protocol with optionally given name. See `show static' for an example. commit 28e01f85c65c536837227829f645818dfa6a2652 Author: Martin Mares Date: Fri Dec 3 11:10:50 1999 +0000 Renamed SHOW PROTOCOLS VERBOSE to SHOW PROTOCOLS ALL to be consistent with the other commands. commit 430da60fa29196cf8715e09e1d81c7ea0b672f05 Author: Martin Mares Date: Thu Dec 2 14:04:44 1999 +0000 Implemented `show route where ' command. Pavel, please check my addition to filter/config.Y. commit f2c6c80a2422b87a2947b7324ad14309198d64a4 Author: Martin Mares Date: Thu Dec 2 14:03:25 1999 +0000 I tried to turn on the YYERROR_VERBOSE switch, but bison is buggy as hell, so it doesn't even compile. Turned it again off and added a comment on it. commit efe51e38632dd7875af6789536be9ccfefd758c9 Author: Martin Mares Date: Thu Dec 2 12:04:39 1999 +0000 Avoid `default rule can be matched' warning in CLI state. commit 9c3726afd2edabf42f11f21cf787061db6c5a33a Author: Martin Mares Date: Wed Dec 1 15:17:24 1999 +0000 Updated TODO file. commit 730f2e2c8c29b3461caa096fa514cbf71f84e51b Author: Martin Mares Date: Wed Dec 1 15:10:21 1999 +0000 Added dumping of routing tables (`show route'). This includes filtering. commit 04a60c689aeb10fafa9919bcff5f8391e0f3a158 Author: Martin Mares Date: Wed Dec 1 15:08:32 1999 +0000 Added get_route_info and show_route_data hooks to struct protocol. Please implement them. commit f611f0ee824a6b363dc675e8f6ac963f20e7d007 Author: Martin Mares Date: Wed Dec 1 15:07:56 1999 +0000 Reset temporary parser data before parsing, not afterwards. This enables deferred CLI command handlers to store their temporary data in the CLI parsing pool. commit 2ad6dcdb2c949904643eabbbf6d0029045e8ea45 Author: Martin Mares Date: Wed Dec 1 15:07:06 1999 +0000 Make ACCEPT/REJECT actually return the result... commit e7f76bae8ccfe405ce3032aaa3a5e9228e5feb98 Author: Pavel Machek Date: Wed Dec 1 13:44:42 1999 +0000 Stupid bug (essentially while(1) loop) occuring sometimes during start of bird fixed. commit 7e1f99719e01af86006bc5c9b9a472516ec85a2c Author: Pavel Machek Date: Wed Dec 1 12:54:23 1999 +0000 accept should behave as return, not running any commands after it. commit 639e62855495fcf461c177373d8f5eb0d5d87332 Author: Pavel Machek Date: Wed Dec 1 12:52:57 1999 +0000 Actually check sequence numbers. commit 3daf783f95790682025ef03ac5b2f486943e6214 Author: Martin Mares Date: Wed Dec 1 12:01:41 1999 +0000 Implemented get_status for the pipe protocol (reports name of the other side of the pipe). Please do so for your protocols as well. commit 9685deb910c9e7400915209c1924e100b1feb5d5 Author: Martin Mares Date: Wed Dec 1 12:00:15 1999 +0000 `show protocols' now shows time of last state change and protocol-dependent status information (obtained via newly introduced hook protocol->get_status). commit 5954dcfab74c8d8a2774f259c9940c1d87e76518 Author: Martin Mares Date: Wed Dec 1 11:59:24 1999 +0000 Introduced new protocol-dependent integer field `aux' to struct neighbor. commit afa8937ac8433a7cb430a14f7613e8d0555f1149 Author: Martin Mares Date: Wed Dec 1 11:59:00 1999 +0000 Added tm_format_reltime() for formatting of relative time quantities. commit 6781e5213b3c910317a68aaee7ee53e81ee93948 Author: Pavel Machek Date: Wed Dec 1 11:39:58 1999 +0000 FIXME's cleaned up: I have actually fixed things without killing comments. There are no urgent FIXME's in filters. Perhaps we should start with documentation? commit f2ed663aea02ac38621ecfe91cd1f37f4a56dc4d Author: Martin Mares Date: Wed Dec 1 10:28:39 1999 +0000 Use linux-22 configuration with all 2.2.x and 2.3.x kernels. This means you need to have your kernel compiled with netlink routing messages enabled. If it doesn't work for you, use --with-sysconfig=linux-21 and let me know what's going wrong. commit 1d2664a4d4455470e0b6c7fc50d232283e39e1e0 Author: Martin Mares Date: Tue Nov 30 14:04:09 1999 +0000 Remember protocol instance in proto_config and use that for `show protocols '. commit c9aae7f47fd7ad71b80cbc86c01a26c504ba08d0 Author: Martin Mares Date: Tue Nov 30 14:03:36 1999 +0000 Lexer supports fallback symbol tables and uses them to recognize symbols from global config when parsing CLI commands. cf_lex_init_tables() is now called automatically inside the lexer. commit f0474f207061151183bb85d59f09422e7bb7e2ee Author: Martin Mares Date: Tue Nov 30 14:02:27 1999 +0000 Use TIME_INFINITY for initialization of password entries instead of 2000000000 (BTW who wrote that???) commit 487d1afa523706d8b0caec63492f4a2b6cef3bce Author: Martin Mares Date: Tue Nov 30 14:01:39 1999 +0000 Moved TIME_INFINITY to timer.h, so that it's publicly available. commit 0d3e6bceeeec4ebf007e02374f799cd1fb21f20c Author: Martin Mares Date: Tue Nov 30 12:57:14 1999 +0000 `show interfaces' and `show protocols' works. commit 10b5baaef32076369b06b4318cc61e6fa11e5493 Author: Martin Mares Date: Tue Nov 30 12:56:52 1999 +0000 Don't use continuation shortcuts until real client is written. commit 163b2073465b1d2f90d23832456e79463fdec308 Author: Ondrej Filip Date: Tue Nov 30 10:35:26 1999 +0000 Inicialisation of Topology Graph (TG). commit ae97b946e99bef043613d210489a926fe4807ec1 Author: Martin Mares Date: Thu Nov 25 15:35:30 1999 +0000 Added few basic commands: show status, show interfaces [summary], show protocols (incomplete). commit 35793769273f7286aafa0455547d1d7cfeef3931 Author: Martin Mares Date: Thu Nov 25 15:34:51 1999 +0000 cli_msg() moved to cli.h, so that it can be used outside the parser. commit ea32afb765381e642a525409a8f6cdff99aa0225 Author: Martin Mares Date: Thu Nov 25 15:34:20 1999 +0000 Added ip_scope_text() for translating of scopes to strings. commit 1a509a6310cb2a5211bf3ac9fd963f06d9109cb1 Author: Pavel Machek Date: Thu Nov 25 15:03:12 1999 +0000 md5 authentication seems to work. commit d3702d57fd5357e9a11ada6c46769a79da8e547a Author: Pavel Machek Date: Thu Nov 25 14:54:08 1999 +0000 Bugfixes: select right password for password authentication, do not try to process authentication blocks as datablocks, make it possible to add data at end of packet. Password authentication should actually work. commit 4aa885a53c479c774aab5befe55a1714b89cdc9e Author: Pavel Machek Date: Thu Nov 25 13:42:49 1999 +0000 Filters: fix rta access to use ->aux field. commit 7e61cac325aae2628d668673f60853608e072e66 Author: Pavel Machek Date: Thu Nov 25 13:38:25 1999 +0000 Triggered updates should now actually work. Fixed metric=16 -> time it out logic. commit 774f149959030b66faca7a97dfb4d1703a84e0d7 Author: Pavel Machek Date: Thu Nov 25 12:01:45 1999 +0000 Fix timeouts. Triggered updates are not done, yet. commit 455ca441d99184e1514415bd7acb25f82d01366e Author: Pavel Machek Date: Wed Nov 24 12:16:31 1999 +0000 Check that prefixes are really prefixes + fix config file to comply. (:-( 1.2.3.4/8 looks nicer than 1.0.0.0/8). commit 8f013d9ca443d4ff39af7560039f108efa9ef474 Author: Pavel Machek Date: Wed Nov 24 12:09:58 1999 +0000 Sorry, previous commit did not even compile. commit 48f9e0195488db0a515e4e5140d402fe4fe7d927 Author: Pavel Machek Date: Wed Nov 24 12:04:32 1999 +0000 Filters: write access to dynamic attributes should actually work. It would be nice to find method of testing such beasts. commit 99bbd23b229419403f673c626001eb0f35cc3a4e Author: Martin Mares Date: Thu Nov 18 14:41:43 1999 +0000 More CLI plans... commit 8d24b6899d0aba52fef8c48921ce4d1481ee212c Author: Martin Mares Date: Thu Nov 18 14:41:29 1999 +0000 Allow EA type to be set to 'undefined' which overrides all further definitons of that EA in the same list and causes ea_find() to fail unless you add EA_ALLOW_UNDEF to the second argument. ea_sort (resp. ea_do_prune()) removes all undef'd attributes from the list. I hope this works :) commit f31156ca217226ad110cc46e6365d70e64c527e0 Author: Pavel Machek Date: Thu Nov 18 14:29:10 1999 +0000 Filters: first parts of extended attributes being read-write. It can not actually work since I do not do rta/rte cow, yet. commit c7b43f33ae8d583ead531d76ed81f1b5deb507f3 Author: Pavel Machek Date: Thu Nov 18 14:01:36 1999 +0000 Split inst->code into inst->code and inst->aux. Both are only 16 bit, so aux is suitable for storing type but not much more. commit da40b6f753f4dd48dbcaebbe6174decb28705ab8 Author: Martin Mares Date: Thu Nov 18 13:42:51 1999 +0000 DEF_PREF_UKR and DEF_PREF_SINK removed. commit 346a12c2109b99d907e7ebeb3560992e92a6c26b Author: Pavel Machek Date: Thu Nov 18 13:21:52 1999 +0000 You can now print enum. commit 4364b47e48ddedb841e8ec8db25c8b4fa878a911 Author: Ondrej Filip Date: Wed Nov 17 15:50:41 1999 +0000 ospf.c and ospc.h splitted into various files. commit bff1db76292b194bbbf0c476d960f40aa0ea47ce Author: Martin Mares Date: Wed Nov 17 14:58:21 1999 +0000 Added skeleton of command tree. Please inspect. commit 2af2636a691da37c73ba032ece29dee1dd20fff7 Author: Ondrej Filip Date: Wed Nov 17 13:28:51 1999 +0000 Another bugfix. (In EXCHANGE state.) commit e17baa31088766f7f278be6754d0acc6e8380e4e Author: Ondrej Filip Date: Wed Nov 17 13:15:01 1999 +0000 Fixed bug receiving dbdes packets in EXSTART state. commit 62a463954815748d0d82da0e30651e6eea7bc9cf Author: Martin Mares Date: Wed Nov 17 12:14:44 1999 +0000 Added some temporary examples of how to define CLI commands (search for CF_CLI). To define a new command, just add a new rule to the gramar: CF_CLI(COMMAND NAME, arguments, help-args, help-text) { what-should-the-command-do } ; where are appended to the RHS of the rule, is the argument list as shown in the help and is description of the command for the help. is a C code snippet to be executed. It should not take too much time to execute. If you want to print out a lot of information, you can schedule a routine to be called after the current buffer is flushed by making cli->cont point to the routine (see the TEST LONG command definition for an example); if the connection is closed in the meantime, cli->cleanup gets called. You can access `struct cli' belonging to the connection you're currently servicing as this_cli, but only during parse time, not from routines scheduled for deferred execution. Functions to call inside command handlers: cli_printf(cli, code, printf-args) -- print text to CLI connection, is message code as assigned in doc/reply_codes or a negative one if it's a continuation line. cli_msg(code, printf-args) -- the same for this_cli. Use 'sock -x bird.ctl' for connecting to the CLI until a client is written. commit 30770df2ab33ffbfd75a9478265ac5e1a1db98d9 Author: Martin Mares Date: Wed Nov 17 12:04:24 1999 +0000 If the main event queue is not empty, call select() with zero timeout, so that the events are ran again after the FD's are checked. This allows us to schedule I/O checks between processing of user commands. commit 84a7d7f77c05578d9ebfff90672e73f021999d25 Author: Martin Mares Date: Wed Nov 17 12:01:11 1999 +0000 ev_run() now returns whether the event has been requeued or not. ev_run_list() now returns number of events which remain in the list. commit ffb59d243a350ed525850e864b38af0ecb0ffea5 Author: Martin Mares Date: Wed Nov 17 12:00:21 1999 +0000 Command line interface now works. commit ea9bb932a31e5df14e3a1a5f580e62b6aedc0247 Author: Martin Mares Date: Wed Nov 17 11:16:15 1999 +0000 Commented out nexthop selection, see the comment. commit 7d509304b58d7ebf1d53e36a8e656830b409e1e8 Author: Martin Mares Date: Mon Nov 15 11:36:22 1999 +0000 An example of how to define enums. commit fd54b602665f71879087faeb0b733fefa9c964bb Author: Martin Mares Date: Mon Nov 15 11:36:09 1999 +0000 ENUM's are now recognized as constants. commit 944f008af7a46144e38f963097e8e4cce493e2a7 Author: Martin Mares Date: Mon Nov 15 11:35:41 1999 +0000 Defined CF_ENUM. commit cbc31830079fb5e49c14c3de446b10ed8da99ce0 Author: Martin Mares Date: Mon Nov 15 11:34:51 1999 +0000 SYM_STAT is gone. commit 4515bdba4f56b298e62150ffe24608ba1a42e7da Author: Pavel Machek Date: Thu Nov 11 13:55:39 1999 +0000 Fixed order of arguments for function call. Enumeration types should work once CF_ENUM() is ready. Created test.conf for testing of filters. (I'm currently thinking about ./tests in root directory which will just fire all available tests...) commit 4ed8718a19747bba95ff86fb8d3c6ea357b50101 Author: Pavel Machek Date: Thu Nov 11 13:27:59 1999 +0000 Shift/reduce conflict goes away _and_ if/then/else works. commit 986e34131dbd2bca668c2b0a6ebb25de6848fc0a Author: Ondrej Filip Date: Wed Nov 10 16:06:12 1999 +0000 Sending DBDES packet in EXSTART done. commit 1183b6b2297f03113d31dc73ef0edc8fc7ef0b7e Author: Pavel Machek Date: Wed Nov 10 13:59:13 1999 +0000 Enums do not work, this is testcase. commit cb8034f42cfaa2753152fa1d776cc618d07fedda Author: Pavel Machek Date: Wed Nov 10 13:44:29 1999 +0000 First try on enumerational types. Mj's noassoc removed: this brings back shift/reduce conflict but it makes parser actually work. Mj please check it. IF/THEN/ELSE still will not work. commit 2f702671b46fa2ea01021170f685f554e4012782 Author: Pavel Machek Date: Wed Nov 10 13:07:18 1999 +0000 No more shift/reduce conflicts. commit 4995564570f9779686f767ec98034ce58d836203 Author: Martin Mares Date: Wed Nov 10 13:05:57 1999 +0000 Shift/reduce conflicts in IF/THEN/ELSE rules solved. commit f453665704cc8d946f86057e67151ef27419e280 Author: Pavel Machek Date: Wed Nov 10 12:44:07 1999 +0000 Enumerational types, defined keyword added. commit 6ba36f06ae10ea7efd60c30f8ef40d6143c69ef6 Author: Martin Mares Date: Wed Nov 10 12:27:01 1999 +0000 Added LSA hashing table (parts of code stolen from rt-fib.c, but heavily simplified since we don't need asynchronous walking). commit 3918b1b050701dee217fa9bc8c4c44d47cb84124 Author: Pavel Machek Date: Wed Nov 10 11:52:36 1999 +0000 Added timeout for routes (which means proper expiring of routes) added few fixmes. commit 024dcaaea253e1f69f4325edebec4a9b5618caea Author: Martin Mares Date: Wed Nov 10 10:48:19 1999 +0000 Added project status report for KSVI. commit a5b583f20abfbf8181b46c08947df7043c213113 Author: Pavel Machek Date: Thu Nov 4 14:39:51 1999 +0000 FIXME's updated. One fixme is remaining for correct RIPv4. Wow. commit 7bf19253d0c33e6accd5b36a5b221f6d1d9cadcc Author: Pavel Machek Date: Thu Nov 4 14:26:18 1999 +0000 Reject packets which are not authenticated. Set correct nexthop on outgoing packets. commit 3c989eb4a784c34870e9d66d5be3c976d8f03797 Author: Pavel Machek Date: Thu Nov 4 14:05:40 1999 +0000 Fixed comments about shift/reduce conflicts. commit ae3e1af2a86c428f473ef0270151cead16cc0e8e Author: Pavel Machek Date: Thu Nov 4 14:03:45 1999 +0000 Add possibility of local variables. commit f30b25f9625d5542ace217bb6b3610d0a09f228a Author: Pavel Machek Date: Thu Nov 4 14:03:36 1999 +0000 Use local variables to test that functionality. commit df8b85e33f6df0567127efdd80acf98ba6f3ffea Author: Martin Mares Date: Thu Nov 4 13:53:47 1999 +0000 Silly bug. commit c8f61a01ea1862d0c0a3ec4cc15c5d49e1366725 Author: Martin Mares Date: Thu Nov 4 13:51:52 1999 +0000 Symbols are not scoped. commit 91447965fed2728a1f877e21f7f58aab4c0022c7 Author: Pavel Machek Date: Thu Nov 4 13:33:30 1999 +0000 Possibility to access first extended attributes. commit 2727bb7c5bbdac54661a5097f86d979799095db8 Author: Martin Mares Date: Thu Nov 4 13:29:43 1999 +0000 Renamed attr->attrs to attr->eattrs. commit 6dc7a0cb39d712c7670a113d5a66e9e868eb9872 Author: Pavel Machek Date: Wed Nov 3 22:23:01 1999 +0000 Filters now do not allow function (int arg; int arg2; ). commit e5005be2b415ebd9bdea28a3515961f4eb904501 Author: Pavel Machek Date: Wed Nov 3 22:21:26 1999 +0000 You should not follow next two times. commit ecc3cf6f50768284b9660b5717190107e742404f Author: Ondrej Filip Date: Wed Nov 3 12:59:38 1999 +0000 Working on db des receiving. Preparing for building LDA database. commit 03b7bd14de501891ea8ae1d914e1da0b1f4147d5 Author: Martin Mares Date: Sun Oct 31 17:48:21 1999 +0000 Started a list of CLI reply codes. commit bc2fb68098faaf09393437a7743285d2af71d102 Author: Martin Mares Date: Sun Oct 31 17:47:47 1999 +0000 Parse CLI commands. We use the same parser as for configuration files (because we want to allow filter and similar complex constructs to be used in commands and we should avoid code duplication), only with CLI_MARKER token prepended before the whole input. Defined macro CF_CLI(cmd, args, help) for defining CLI commands in .Y files. The first argument specifies the command itself, the remaining two arguments are copied to the help file (er, will be copied after the help file starts to exist). This macro automatically creates a skeleton rule for the command, you only need to append arguments as in: CF_CLI(STEAL MONEY, <$>, [[Steal <$> US dollars or equivalent in any other currency]]): NUM { cli_msg(0, "%d$ stolen", $3); } ; Also don't forget to reset lexer state between inputs. commit b9672a845f7ff7d2441e21746566eacc51f274b7 Author: Martin Mares Date: Sun Oct 31 15:43:44 1999 +0000 The CLI I/O functions work as desired. commit 7d3aab1c1643e8b2bcff7f856e0d4455fa0ba4b4 Author: Martin Mares Date: Fri Oct 29 12:10:10 1999 +0000 First steps of the Command Line Interface: I/O routines. commit b93abffae4ad5767625b35c9a09513e9d27a5256 Author: Martin Mares Date: Fri Oct 29 12:09:29 1999 +0000 Implemented unix-domain sockets. commit 0d70292d88276a9883ab8bc15b00e6a2e2fe4487 Author: Martin Mares Date: Fri Oct 29 12:08:49 1999 +0000 Events now return a value. If it's non-zero, the event is re-queued for processing in next event cycle. This can be used to prevent background actions (hint: user commands) from hogging the CPU for too long time. commit 92af6f309b9283482384bd9bbd0351cd71e3cf1d Author: Martin Mares Date: Fri Oct 29 10:08:27 1999 +0000 Simplify handling of free chunks. commit 54165b1315dd09b0ea97705367b73086131c1ed8 Author: Martin Mares Date: Fri Oct 29 10:08:09 1999 +0000 Configure PATH_CONTROL_SOCKET. autoconf.h is now written to obj/sysdep, the source tree is hopefully completely read-only now. commit ed6081502ad814289b9b7b5537658c3b1ad435e5 Author: Martin Mares Date: Fri Oct 29 09:44:44 1999 +0000 Added skeleton of the client. Does nothing, but at least compiles. commit 41be4444f2f548c5cc135593b2c820180a22ff99 Author: Pavel Machek Date: Thu Oct 28 21:03:36 1999 +0000 switch() { } done right. commit c2250f91c749f563229ad624bbd03053c1d671d0 Author: Ondrej Filip Date: Tue Oct 19 16:13:06 1999 +0000 Minor changes and bug fixes. Preparing for Exchange and higher states. commit 96f1b8ba10f7787fc7cf0e0430a85766200707a5 Author: Ondrej Filip Date: Mon Oct 18 21:48:51 1999 +0000 Huge changes. Neighbor and interface state machines rewritten. It should be cleaner now, I'm preparing for file splitting. Maybe I added some minor bugs. :-( commit f942a589ef627f5b2604955cbfdbe91fa706f29d Author: Pavel Machek Date: Tue Oct 12 13:04:50 1999 +0000 FIXME's for rip added. Will we ever able to generate packets saying "route 1.2.3.4 using someone else"? commit 89dc383a8ce26bfe49250e5063bcadec22ff42c6 Author: Martin Mares Date: Tue Oct 12 07:46:08 1999 +0000 Changed syntax of ip_class_mask, the old one was stupid. commit d3dd620b96c5960207b9321b416423b8130a4df7 Author: Pavel Machek Date: Tue Oct 12 06:27:42 1999 +0000 Filters: permit variables of prefix types, cleanup around variables. TODO list added, hopefully complete. Use new features of filters in bird.conf commit c79ec2ec1962394f1550afa10a8b396f0e4dfc52 Author: Pavel Machek Date: Mon Oct 11 14:19:29 1999 +0000 Untested IPv6 support added. I do not know if it compiles in IPV6 mode. commit 720d911d777f64872df923e102ebc509113885f0 Author: Pavel Machek Date: Thu Oct 7 14:10:08 1999 +0000 Added constants of type prefix and pair, added their printing commit 4872cef4dfcadab405d0393a21f9136852d7b9c4 Author: Pavel Machek Date: Thu Oct 7 14:09:50 1999 +0000 Added examples of pairs and prefixes commit c9f8c1a855cfdde2095cd792289dbce2b7a06371 Author: Pavel Machek Date: Thu Oct 7 13:38:26 1999 +0000 FIXME's added. Hopefully fixme list is now complete for filters. commit f782b72c538b5728f6c3f531a25f669f0bf99b2c Author: Martin Mares Date: Sat Oct 2 11:06:44 1999 +0000 Failure to set socket TOS is not a fatal error. commit 507cb9e58b947ad8c6ad1c73706a08010d90f4cc Author: Martin Mares Date: Sat Oct 2 10:55:19 1999 +0000 Don't forget to free large blocks. commit ac40c888c21c72ae7f6c3d329dd2ba5417eec009 Author: Pavel Machek Date: Sat Oct 2 10:44:48 1999 +0000 Obvious bugs in authentication fixed. commit 7db7b7db603a2d852066c313da76c72673a204fa Author: Pavel Machek Date: Wed Sep 29 14:24:58 1999 +0000 Case arg { 1: printf "one"; } works. You can not use two commands after one label, yet. commit 4caa2231fc75ed351b9a9f20a97a81ce5d4421d0 Author: Pavel Machek Date: Wed Sep 29 14:23:11 1999 +0000 Make configuration use new case statement. commit 2c1d1cc765238aef0e8bfdbc1d8bc954fa0fc222 Author: Ondrej Filip Date: Wed Aug 25 18:44:50 1999 +0000 DD packet receiving in ExStart. commit 1af664158d20e9887ca11b63fc062a63f333297a Author: Ondrej Filip Date: Tue Aug 24 18:32:26 1999 +0000 A structure for receiving DD seq packets added. commit e3121112ab8cda4b4e413a801e5626f9ffb02ca8 Author: Ondrej Filip Date: Tue Aug 24 14:42:51 1999 +0000 Preparing to send DD packets. commit 2981814066543b72e292b7b36ca41bfa1cc2554c Author: Pavel Machek Date: Fri Aug 20 09:59:39 1999 +0000 Few FIXME's removed from auth, few FIXME's added to filter. commit bce8a34b128f1c0495f3f7a28d832d9c2b4a9543 Author: Pavel Machek Date: Wed Aug 18 13:19:33 1999 +0000 Few fixme's fixed in rip (will not crash any more on request for sending routing table - hopefully). Next few steps in md5 authentication (not yet complete). commit f651941402079052fbdabf64092e7dd4a6a8cafe Author: Martin Mares Date: Tue Aug 17 20:47:40 1999 +0000 Added a function for generating 32-bit random numbers. commit b332fcdfc8f0b1ac7111a63c55f72ba4b00b8035 Author: Ondrej Filip Date: Mon Aug 16 10:32:05 1999 +0000 Better dumping. commit 032df28048c1c3d64716d3876ea759660d9d3cf0 Author: Ondrej Filip Date: Tue Aug 10 12:06:45 1999 +0000 Small bux fixes. A neigh_chstate added. commit a7d388d23e26bdc94aefc3788b6be6c278f6dc5b Author: Ondrej Filip Date: Mon Aug 9 18:59:37 1999 +0000 Multiple "hton problems" fixed. Now we're in EXSTART state. commit 2be22ddb4cf4c7a88a0c424f0de7c968e5c326a1 Author: Ondrej Filip Date: Mon Aug 9 18:49:50 1999 +0000 "My own IP problem" fixed. commit a4c2ee717cf42bb53688c18840bd7294b6bf61dd Author: Ondrej Filip Date: Mon Aug 9 18:34:08 1999 +0000 Bug fix in checksum calculation. commit b1693b8f749ccc683a2a78dc3129e56e500bc73f Author: Ondrej Filip Date: Mon Aug 9 18:11:51 1999 +0000 Bug in election fixed. commit e83dc0d7e78fd31b435b36424beb790bf55881a8 Author: Ondrej Filip Date: Mon Aug 9 17:58:01 1999 +0000 (Backup) Designated Router election added. commit 8c51f96acff1cfb05d1cf05f4355fce655c32599 Author: Ondrej Filip Date: Mon Aug 9 13:03:28 1999 +0000 Some interface state machine changes. I found some problem in RFC, trying to conntact authors. commit 55e06729b173b24ce0c243db7e96094f10071eaf Author: Martin Mares Date: Tue Aug 3 19:57:43 1999 +0000 Forgot to do a `cvs add', grr. commit d7975d261f8a30efcdbd9fad6ba47419a6ac6c39 Author: Martin Mares Date: Tue Aug 3 19:38:48 1999 +0000 Ouch, how could I write this? commit 4532a89e31734a457d4debe56df713d66e31cdd6 Author: Martin Mares Date: Tue Aug 3 19:37:37 1999 +0000 Taught Netlink how to behave in IPv6 world. commit 4f22c9818554087d8f5ab51b8666a7a48d1f4329 Author: Martin Mares Date: Tue Aug 3 19:36:51 1999 +0000 Support for IPv6 sockets. How nice one doesn't have to ifdef around ten years of API evolution :-) commit dce267832a0468ed5e596f0b0733b926af7ead3a Author: Martin Mares Date: Tue Aug 3 19:36:06 1999 +0000 Basic support for IPv6. The system-dependent part doesn't work yet, but the core routines are there and seem to be working. o lib/ipv6.[ch] written o Lexical analyser recognizes IPv6 addresses and when in IPv6 mode, treats pure IPv4 addresses as router IDs. o Router ID must be configured manually on IPv6 systems. o Added SCOPE_ORGANIZATION for org-scoped IPv6 multicasts. o Fixed few places where ipa_(hton|ntoh) was called as a function returning converted address. commit 707ef833783ef731c56baae1c0dc7b7a9e7321ff Author: Martin Mares Date: Tue Aug 3 19:35:01 1999 +0000 Pruned the TODO list. commit 9c11ec9efca2fc75495cf8dcb28a959ba22b01fa Author: Martin Mares Date: Tue Aug 3 19:34:26 1999 +0000 Implemented a Table-to-Table protocol a.k.a The Pipe. commit 8c943173ced1fb85c627a8ba1c3d7360eab7d22b Author: Martin Mares Date: Tue Aug 3 19:33:45 1999 +0000 Allow announces of rte's to protocols in FS_FEEDING state. Else, we would get chicken-egg problems in the table-to-table protocol. commit 7de45ba4a01bfdc986a4b597c04ad39d9b97a58a Author: Martin Mares Date: Tue Aug 3 19:33:22 1999 +0000 Kernel route syncer supports multiple tables. The changes are just too extensive for lazy me to list them there, but see the comment at the top of sysdep/unix/krt.c. The code got a bit more ifdeffy than I'd like, though. Also fixed a bunch of FIXME's and added a couple of others. :) commit 9d8856897f92ad74be140adafaac41f9df6edf31 Author: Martin Mares Date: Tue Aug 3 19:31:54 1999 +0000 Protocol engine bug fixes: o Make proto_config->table always point to the right table even if it should be the default one. o When shutting down, kill protocol in reverse order of their priority. o When stopping a protocol down, disconnect it from routing tables immediately instead of waiting for the delayed protocol flush event. Also added a protocol instance counter (used by KRT code in very magic ways). commit b6628a8c98fa53c1b293221ad0f7e0611cb0b76d Author: Martin Mares Date: Tue Aug 3 19:31:30 1999 +0000 Added macros for walking lists backwards. commit 9a706f32afe703a44e605e92cc50cc77d4e91088 Author: Martin Mares Date: Tue Aug 3 19:31:11 1999 +0000 Added missing structure declarations. commit 8edf2361f9c4bd745a1249db3f66dfc079dd2ca1 Author: Martin Mares Date: Tue Aug 3 19:30:49 1999 +0000 Cleaned up handling of interface patterns: o Parsing of interface patterns moved to generic code, introduced this_ipatt which works similarly to this_iface. o Interface patterns now support selection by both interface names and primary IP addresses. o Proto `direct' updated. o RIP updated as well, it also seems the memory corruption bug there is gone. commit 9273035403ace754e5b405b2c5efba7d55c28e78 Author: Martin Mares Date: Tue Aug 3 19:30:20 1999 +0000 Changes to interface handling on traditional Unices: o Aliases are interpreted as secondary addresses. o When the system doesn't supply interface indices, generate our ones. commit 5e13ffe6f4e229974238bb2ea96ea2ce8282b7ed Author: Martin Mares Date: Tue Aug 3 19:29:57 1999 +0000 Faster checksum function. commit 913f7dc9f2dca8bebf8daebcce006b96f55ae6db Author: Martin Mares Date: Tue Aug 3 19:29:27 1999 +0000 Added functions for parsing and formatting of dates. commit 6542ece91a783e999f61cc51cbe18c8b4c96a36c Author: Pavel Machek Date: Thu Jul 1 09:11:21 1999 +0000 Function calling in filters works - somehow. Calling syntax is currently very ugly, beware. Variables are not really local - that needs to be fixed. commit 39369d6fbe4b3f73c8110b14623f367c8ffded50 Author: Ondrej Filip Date: Wed Jun 2 16:31:13 1999 +0000 Fixed stupid bug with hello vs inactim timers. commit bae0f7dbb111e2c8fbb8a94b59de6e241020ad66 Author: Ondrej Filip Date: Tue Jun 1 17:29:56 1999 +0000 Neigbor deleting done. (I have some problems with timers, so it does not send hello.) commit cd70d93470498c0b68a084be5aeab5dd45a0df60 Author: Ondrej Filip Date: Tue Jun 1 16:35:18 1999 +0000 Detecting of new neighbor added. It starts inactivity timer. commit bd7f1081f24aa6ca4cdba004478742b730644a91 Author: Martin Mares Date: Tue Jun 1 15:31:43 1999 +0000 Grrr, the "obvious fix" to multicasting code from yesterday was fundamentally wrong. Reversed. commit 3e1f30610e109b3eff7e3d8b420c4b7988bd3152 Author: Martin Mares Date: Tue Jun 1 13:57:24 1999 +0000 Defined IP_PREC_INTERNET_CONTROL and made all (well, both :)) protocols use it when creating sockets. commit 9de840bdbd59669a129f68f1ff3595b34439ec09 Author: Pavel Machek Date: Mon May 31 20:34:48 1999 +0000 Set corectly destination address for RIP multicast. Broadcasting & multicasting rip actually works [broadcasting is kind of hard to turn it on, through]. commit b94bbe00278b0c6e84f34875367d85d34d08621b Author: Pavel Machek Date: Mon May 31 20:30:16 1999 +0000 Added FIXME: mode broadcast randombly corrupts memory. Small cleaning and bugfixes. commit c7208da0b72dc7e4ff512edbecc62a99b0392c5a Author: Martin Mares Date: Mon May 31 20:28:46 1999 +0000 Fix potential multicasting bug. commit 9607536dbf7c50f9c2fc7a670eab51e5c313d10f Author: Pavel Machek Date: Mon May 31 19:43:08 1999 +0000 Kill duplicity between rif and rif_patt. commit 72efa4b6f82222f91b63b9f61bbc88e458096ea7 Author: Pavel Machek Date: Mon May 31 19:37:16 1999 +0000 Small fixes to rip. commit bf97bd28276af42aa59ea29b926b4848ae14e149 Author: Pavel Machek Date: Mon May 31 19:22:40 1999 +0000 Cleanup of warnings commit 91c7c7416b4a18ac2b9e872c2a1a6391cf8b3dc8 Author: Pavel Machek Date: Mon May 31 19:16:22 1999 +0000 Incoming side of authentication done but untested. Right handling of filters in rip. commit 2e6197d634a14533899915477032f082e675e35f Author: Pavel Machek Date: Mon May 31 19:15:52 1999 +0000 Added password_strncpy() which pads destination with zeros. commit 9c9e49ac392dfdbff97be579842028a4eb1d0dec Author: Pavel Machek Date: Mon May 31 19:15:32 1999 +0000 Added extended attributes for rip. commit c72b09c8508d71b9a0a998c2dabe475d54b4d014 Author: Ondrej Filip Date: Mon May 31 19:07:31 1999 +0000 IP socket priority (sock->tos) added. Constant taken from tcpdump of CISCO and gated. commit 35ff423d54ebabffc5ab9dd757dfa2a1a70e9676 Author: Ondrej Filip Date: Mon May 31 18:56:20 1999 +0000 Some RX_Hello checks added. commit bb027be1e232ca2207a03a8e001441965cc07801 Author: Martin Mares Date: Mon May 31 18:55:35 1999 +0000 Added extra argument to rt_update hook which contains a pointer to the temporary attribute list. commit 75b84c34e3434209517f2ebc8160f39d33e3735e Author: Ondrej Filip Date: Mon May 31 18:24:54 1999 +0000 Sending and receving of hello pkts works. No I will start building neighbor database. commit 4a4911a36a865525f5de86ea8b575164ea9a855a Author: Martin Mares Date: Mon May 31 17:39:44 1999 +0000 Added missing quotes. commit 10915c9650d4b63b12140effc68718e2aecd01d3 Author: Pavel Machek Date: Mon May 31 17:12:38 1999 +0000 Modified rip to new password handling in nest. Now it at least compiles. commit 900d5470ae2cada4d37ed62f8bf2ce64c84349cd Author: Pavel Machek Date: Mon May 31 17:12:00 1999 +0000 Added PASSIVE option to paswwords. commit 139ca21d05df71b59a72af126d063170421cf9f7 Author: Martin Mares Date: Mon May 31 13:21:07 1999 +0000 Added sk_send_buffer_empty(). commit fd5f8704bb7c2e9845a7c4785ace83a2b77d2c57 Author: Pavel Machek Date: Wed May 26 14:37:47 1999 +0000 Make rip use newly defined password lists. commit 858a717796d7aa48fe9b22a6b035fec9edbb5a2a Author: Pavel Machek Date: Wed May 26 14:37:07 1999 +0000 Change format of passwords (less ;'s) and fix password.h to allow multiple inclusions. commit 7eb01479c92cd2f615993f2112aa5986f3e2b0ad Author: Pavel Machek Date: Wed May 26 14:36:34 1999 +0000 Example of password list usage. commit 1a2ded450ecfbb8ccb7f459d7265fc5333d13420 Author: Pavel Machek Date: Wed May 26 14:24:57 1999 +0000 Skeleton for password handling, currently I only build structures and do nothing more advanced for them commit 9d79fec8dc7c5a3b7e590c00df7eadcef9e80144 Author: Pavel Machek Date: Wed May 26 14:24:32 1999 +0000 Added notion of datetime commit 6bd08d017b5cb2608a81c0c7c9fe8fb5da73ba60 Author: Pavel Machek Date: Wed May 26 14:22:41 1999 +0000 Better date/time input methods need to be done commit 903a3f3928a5d7c223ff4c0087343cf214f8478d Author: Ondrej Filip Date: Mon May 24 21:49:22 1999 +0000 struct ospf_neigbor corrected. commit c76674f0e98d356ea235ea76fd55d71a3673b123 Author: Ondrej Filip Date: Mon May 24 21:17:16 1999 +0000 struct ospf_neigbor added. Neigbor state machine implementation can start. commit 65112dd270dbfa598c1f8a5074bf7224b9e1469c Author: Ondrej Filip Date: Mon May 24 18:22:00 1999 +0000 ifa->time split into wait_timer and hello_timer. I will send hello in WAITING state. commit daeb60393d011f8ee1326e212b310983276b6ba1 Author: Ondrej Filip Date: Mon May 24 17:37:45 1999 +0000 Small bug in ipv4_skip_header. commit b9f8590025fd5d6dd360f759c5a219d69b975123 Author: Ondrej Filip Date: Mon May 24 17:29:05 1999 +0000 IP header test added. commit 4b0d57e53120e404e00f7d252119e45288ceeb71 Author: Martin Mares Date: Fri May 21 14:29:44 1999 +0000 Added CONFIG_MULTIPLE_TABLES whereever appropriate. commit 1c3c9dceb385198199c6c0190f3011d106142b67 Author: Martin Mares Date: Fri May 21 14:29:23 1999 +0000 Removed one unused structure field. commit a70693ca9bc935513d1bfa9b3a49459d27927657 Author: Martin Mares Date: Fri May 21 14:28:44 1999 +0000 Don't forget to export CPPFLAGS to GCC. :) commit a07e9d82352d0060ff4f00aa8d0a2575cafc781a Author: Martin Mares Date: Fri May 21 14:09:06 1999 +0000 Added --with-sysinclude to allow explicitly setting where kernel includes reside, so that you can easily switch between 2.0 and 2.2 ones. Check existence of for linux-22 configs to make sure we're using the correct set of includes. commit 4f1a6d27b9a44f61329bc7b6779a0c645362e181 Author: Martin Mares Date: Mon May 17 20:16:53 1999 +0000 Kill remaining master_table relics in KRT code. Make all protocols pass routing table to rte_update and rte_discard. commit 0e02abfd5770062768eeb4c75061b7d2f656489d Author: Martin Mares Date: Mon May 17 20:14:52 1999 +0000 From now we support multiple tables. The master_table variable is definitely gone. Both rte_update() and rte_discard() have an additional argument telling which table should they modify. Also, rte_update() no longer walks the whole protocol list -- each table has a list of all protocols connected to this table and having the rt_notify hook set. Each protocol can also freely decide (by calling proto_add_announce_hook) to connect to any other table, but it will be probably used only by the table-to-table protocol. The default debugging dumps now include all routing tables and also all their connections. commit 4107df1d1b7454a16e6f45ea55aae13b01c9f566 Author: Martin Mares Date: Mon May 17 20:06:19 1999 +0000 Implemented two new symbol handling functions: o cf_define_symbol() -- it assigns a meaning to a symbol, bailing out if it already has one. o cf_find_symbol() -- finds symbol by name and creates it if not found. Also modified filter/config.Y to make use of the first function. commit b23c5e0ff4e9071b2568bf2f7d437bc13273d17d Author: Martin Mares Date: Fri May 14 18:03:09 1999 +0000 Added ip_skip_header() and modified OSPF to use it. commit 11ce4490fac7d0446802738f5fb8fd68c36bd30b Author: Ondrej Filip Date: Fri May 14 08:50:25 1999 +0000 *** empty log message *** commit 67ff91302f21f6a40201bcc8a01c9c76eaaf1ed1 Author: Ondrej Filip Date: Fri May 14 08:46:06 1999 +0000 Netmask checking for hello packets added. commit 7426ee3d49fab13428f198c78c8b7f3da131382e Author: Ondrej Filip Date: Thu May 13 09:18:36 1999 +0000 Checksum control added. commit 296ecb56eb4d1951d23d74d502d2c48a42eb6eee Author: Ondrej Filip Date: Tue May 11 15:34:33 1999 +0000 OSPF RX implementation starts.... commit 1b16029c12a501752388523ebfe2981e7d7d7ed3 Author: Pavel Machek Date: Tue May 11 09:53:45 1999 +0000 Mensi updaty do ripu. Pridana passwd autentikace (netestovano). commit f7103dfcfe174d39c8aa10eb100550e3ec213981 Author: Ondrej Filip Date: Tue May 11 09:50:02 1999 +0000 Better logging output. Added 'struct proto *' info 'struct ospf iface'. commit 1a54d44a23de7b0bf0dfe62dd3d09d8167e5a597 Author: Martin Mares Date: Mon May 10 21:37:39 1999 +0000 Added packet checksumming code. Watch the comments for an explanation. commit a2697f02ac5109e749bff4d07bee6cedd0ab650b Author: Martin Mares Date: Fri May 7 13:46:16 1999 +0000 Netlink support for secondary interface addresses. commit 9a158361da249e0eab1e0f7bd2c7dbe9f32eddfa Author: Martin Mares Date: Thu May 6 21:38:11 1999 +0000 I rewrote the interface handling code, so that it supports multiple addresses per interface (needed for example for IPv6 support). Visible changes: o struct iface now contains a list of all interface addresses (represented by struct ifa), iface->addr points to the primary address (if any). o Interface has IF_UP set iff it's up and it has a primary address. o IF_UP is now independent on IF_IGNORED (i.e., you need to test IF_IGNORED in the protocols; I've added this, but please check). o The if_notify_change hook has been simplified (only one interface pointer etc.). o Introduced a ifa_notify_change hook. (For now, only the Direct protocol does use it -- it's wise to just listen to device routes in all other protocols.) o Removed IF_CHANGE_FLAGS notifier flag (it was meaningless anyway). o Updated all the code except netlink (I'll look at it tomorrow) to match the new semantics (please look at your code to ensure I did it right). Things to fix: o Netlink. o Make krt-iface interpret "eth0:1"-type aliases as secondary addresses. commit ec8b579e9c9703601bf745745b620103fe2e2477 Author: Martin Mares Date: Tue Apr 27 16:03:17 1999 +0000 Recognize site scope for IPv4 addresses (prefixes reserved for private networks). Removed old #ifndef logic which was used to avoid IPv4/IPv6 clashes before conditionals in Modules lists were introduced. commit 59e2188cb7020e43e25c9d5bdcd011f341ddfc1d Author: Ondrej Filip Date: Tue Apr 27 13:04:33 1999 +0000 Just changes of comments. commit 6376a961332552e2bc178d647f1e5cfa01a1ac32 Author: Ondrej Filip Date: Tue Apr 27 12:56:52 1999 +0000 Hello timer implemented. commit 93bde8dce23ae10476263a84cc40bbe186263fdc Author: Ondrej Filip Date: Thu Apr 22 13:12:28 1999 +0000 Work on hello continues. commit 36bbfc704c7d2153537751e24413db9b9c97bc58 Author: Pavel Machek Date: Mon Apr 19 18:41:56 1999 +0000 Updated filters: they now actually see IP/pxlen of net being filtered, gateway, and who told us, so they can do usefull jobs from now on. commit afbc41ab3d4f07f7dc4dbc6c769fe7fa1567f357 Author: Pavel Machek Date: Wed Apr 14 21:11:24 1999 +0000 SImplify code a tiny bit. commit b11d8a4f59b3559779938b0a37914a7bc8c07a6b Author: Ondrej Filip Date: Wed Apr 14 15:13:44 1999 +0000 Redesigned struct ospf_iface & new struct ospf_sock. commit b31568a516142e905712bad498914fb6a82dc25b Author: Ondrej Filip Date: Wed Apr 14 12:47:18 1999 +0000 Small bug fix in memcpy. commit 4c5e5e3a1c438cb2e92535e3fabc458aa0d6deb3 Author: Martin Mares Date: Wed Apr 14 12:29:47 1999 +0000 Multicasts once again: When using SO_BINDTODEVICE, don't specify IP address of the interface. commit 1b50a1e4be2b54bd4ccadfaeaf558aea15255de4 Author: Martin Mares Date: Wed Apr 14 11:39:07 1999 +0000 Next attempt to get SO_BINDTODEVICE work :) commit 36154beb705cdaf03f9ee050798d9e653ded6ca5 Author: Martin Mares Date: Wed Apr 14 11:21:02 1999 +0000 Use SO_BINDTODEVICE if we're using old multicast API (i.e., struct ip_mreq and not ip_mreqn). This should get multicasts on unnumbered PtP links work. commit 9da4d143402efd16bec286e3723b42386b20968b Author: Martin Mares Date: Wed Apr 14 11:09:55 1999 +0000 A couple of OSPF fixes: o ((flags & IF_CHANGE_UP) == IF_CHANGE_UP) -> (flags & IF_CHANGE_UP) o bcopy -> memcpy (bcopy is unportable) o Ifdeffed out add_tail(&(ifa->sk_list),NODE mcsk) -- the node in socket structure is for internal use by the resource manager only. (Now, the debugging dump of open sockets looks sane :-)). commit 1ab4dee0288e4ad6c8fbefae3aa64ca873cf4500 Author: Martin Mares Date: Wed Apr 14 10:49:31 1999 +0000 Removed redeclaration of `idval', so that it compiles :) commit 4c630a6dd7e02cbbe1cca2c626feb86801ee4d03 Author: Ondrej Filip Date: Tue Apr 13 21:46:20 1999 +0000 Added wait timer for eligible BCAST & NBMA interface. commit 55e7732a5a5fe47752eafe6024ba473bd7959e45 Author: Ondrej Filip Date: Tue Apr 13 19:27:44 1999 +0000 Change in ospf_iface. (My bad understanding of lists manipulation.) commit aec76c6e8e5702144522f0061bc102d26e10b97c Author: Ondrej Filip Date: Tue Apr 13 18:21:53 1999 +0000 IPv6 changes. commit 43fc099b98594fb3ac6a56a90fd00f42fc98f742 Author: Pavel Machek Date: Tue Apr 13 11:40:04 1999 +0000 Sets of IP addresses should work, now. (From now on it is also possible to write if 1.2.3.4 < 1.2.3.5, but I'm not sure if it is good for anything.) commit 24eaae9e5d0b154ec47d9d4e13649fb066814ef1 Author: Ondrej Filip Date: Tue Apr 13 00:46:34 1999 +0000 Small change to stop using loopback. commit cb2e8c49706c14ea662df44cd3911c1f9db4b4a8 Author: Ondrej Filip Date: Tue Apr 13 00:24:05 1999 +0000 A small init change to avoid core dump. commit 5b1a92e6d4350bcecff4f78b9cfabfb98ca7ce2a Author: Ondrej Filip Date: Mon Apr 12 23:54:21 1999 +0000 Not all I mean serious. Almost everything will change. Changes: struct ospf_iface draft, various constants added... commit 2f5d154466e8d76f4054561a361bb45f157c29a6 Author: Martin Mares Date: Mon Apr 12 20:26:06 1999 +0000 Added ipa_compare as requested. commit 38506f71b0bea5580987e999a7b1a69f58aec7ec Author: Pavel Machek Date: Mon Apr 12 19:58:18 1999 +0000 Sets of integers now actually work. Sets of IP will work as soon as compare function is ready. commit 01bd7759b260b379089acf28cc47bd49572ebd22 Author: Martin Mares Date: Mon Apr 12 18:07:05 1999 +0000 Ignore alias interfaces (some day, we will treat them as pure secondary interface addresses). commit 08e2d6259a71c5e43ac0083ea6d81357678f99eb Author: Martin Mares Date: Mon Apr 12 18:01:07 1999 +0000 Removed TOS support. This simplifies many things a lot. commit 170c984a9ef1bde00711f405b03d24a2e151501c Author: Martin Mares Date: Mon Apr 12 17:27:21 1999 +0000 Cosmetic message fix. commit 113694892e9669a1ae3dd44274f27c862c6c293a Author: Martin Mares Date: Mon Apr 12 17:21:11 1999 +0000 Use $(CC) instead of gcc even when generating dependencies. commit 620c4f90c9437362bf17180e6dbbf14c4e480e40 Author: Martin Mares Date: Mon Apr 12 17:20:50 1999 +0000 Oops, a typo in previous struct ip_mreqn changes... commit 61fb537c6273c50deb7d33f8af246993eab4bc4d Author: Martin Mares Date: Mon Apr 12 15:27:56 1999 +0000 Use `struct ip_mreqn' instead of `struct ip_mreq' for multicast operations on 2.1/2.2 kernels. This allows passing of real interface indexes instead of referencing interfaces by their IP addresses which fails badly in presence of unnumbered interfaces. Unfortunately, this structure is not visible with glibc 2.0 as it provides its own networking headers :-( Both libc5 and glibc 2.1 should be OK. commit 5a99ade413b97a780758f5c8f927604ad6c8e57b Author: Martin Mares Date: Mon Apr 12 14:57:46 1999 +0000 Fixed a couple of bugs in handling of multicast sockets. See comments in lib/socket.h for a detailed guide on how to use them. commit bad631e04806287e99e2464c0fdc884f9efa1e71 Author: Pavel Machek Date: Mon Apr 12 12:07:15 1999 +0000 Oops, typo. commit 8ba2cc064b823274e8af043bf0676bfc252e810a Author: Pavel Machek Date: Mon Apr 12 12:01:59 1999 +0000 In case no startup function is defined, don't try to launch it. commit ed9a82369ffc660ec20d9b7fa64188a450267672 Author: Martin Mares Date: Sun Apr 11 19:28:16 1999 +0000 Added new target "tags" to generate a tag table for Emacs. Also made "depend" work before the tree is compiled first time. commit 2db3b2887ea93c9946956a9a5ce5a06f0ef783c3 Author: Pavel Machek Date: Sat Apr 10 09:45:08 1999 +0000 Decrease number of warnings. commit 49ed70b48e3b66c4dd71315e842733d69204698e Author: Martin Mares Date: Wed Apr 7 14:25:56 1999 +0000 Portability fixes. commit 23b1539bf90bfb6b35d9a2be0a2b6b1e311c1460 Author: Pavel Machek Date: Wed Apr 7 12:11:08 1999 +0000 Filters upgraded - a bit. Moved code to filter.c because it is where it belongs. (f-util.c stays there for auxiliary and non-important things.) commit 7976a574b692f747d833d899caf0fbbf702714c1 Author: Martin Mares Date: Tue Apr 6 21:31:03 1999 +0000 ip_pton: Avoid modification of the string we're converting. commit e2dc2f30efd65cf3da4db150fae695978388e247 Author: Martin Mares Date: Mon Apr 5 20:25:03 1999 +0000 Routing table core changes to support full route filtering: o Introduced rte_cow() which should be used for copying on write the rte's in filters. Each rte now carries a flag saying whether it's a real route (possessing table linkage and other insignia) or a local copy. This function can be expected to be fast since its fast-path is inlined. o Introduced rte_update_pool which is a linear memory pool used for all temporary data during rte_update. You should not reference it directly -- instead use a pool pointer passed to all related functions. o Split rte_update to three functions: rte_update The front end: handles all checking, inbound filtering and calls rte_recalculate() for the final version of the route. rte_recalculate Update the table according to already filtered route. rte_announce Announce routing table changes to all protocols, passing them through export filters and so on. The interface has _not_ changed -- still call rte_update() and it will do the rest for you automagically. o Use new filtering semantics to be explained in a separate mail. commit 9e0e485e50ea74c4f1c5cb65bdfe6ce819c2cee2 Author: Martin Mares Date: Mon Apr 5 20:17:59 1999 +0000 Added some new protocol hooks (look at the comments for better explanation): make_tmp_attrs Convert inline attributes to ea_list store_tmp_attrs Convert ea_list to inline attributes import_control Pre-import decisions commit 5056c559c4eb253a4eee10cf35b694faec5265eb Author: Martin Mares Date: Mon Apr 5 20:15:31 1999 +0000 Changed syntax of attaching filters to protocols to hopefully the final version: EXPORT for outbound routes (i.e., those announced by BIRD to the rest of the world). IMPORT for inbound routes (i.e., those imported by BIRD from the rest of the world). where is one of: ALL pass all routes NONE drop all routes FILTER use named filter FILTER { } use explicitly defined filter For all protocols, the default is IMPORT ALL, EXPORT NONE. This includes the kernel protocol, so that you need to add EXPORT ALL to get the previous configuration of kernel syncer (as usually, see doc/bird.conf.example for a bird.conf example :)). commit 63a381dbf5e37c2740982d07988cea983c699816 Author: Martin Mares Date: Mon Apr 5 20:10:31 1999 +0000 Several filter changes. (Pavel, please check if they are OK.) o Changed parameters of f_run. Changed rtein+rteout pair to rte pointer passed by reference, added ea_list of temporary attrs again passed by reference and finally added a pointer to memory pool for storing temporary data (new ea_lists's, temporary rta's etc.). o Re-ordered result codes, so that all accepts come before all rejects. o Introduced FILTER_ACCEPT and FILTER_REJECT dummy values (will be used in protocol configurations). o Added filter_name() which returns name of a filter or ACCEPT/REJECT for the dummies. commit d4ff748224fc18e460e74ab14d70d01fd50e4b92 Author: Martin Mares Date: Mon Apr 5 20:06:02 1999 +0000 Use a more reasonable pool chunk size: 4080 bytes seem to be a good approximation of a integral fraction of page size even if both malloc overhead and chunk header space is counted. commit c10421d3d4b5f23dc953c887332bdb6e80ae0540 Author: Martin Mares Date: Sat Apr 3 13:05:18 1999 +0000 More changes to the kernel syncer. o Now compatible with filtering. o Learning of kernel routes supported only on CONFIG_SELF_CONSCIOUS systems (on the others it's impossible to get it semantically correct). o Learning now stores all of its routes in a separate fib and selects the ones the kernel really uses for forwarding packets. o Better treatment of CONFIG_AUTO_ROUTES ports. o Lots of internal changes. commit 69ec9087ad3fb631f46275220909a876deadb6b5 Author: Martin Mares Date: Sat Apr 3 13:01:58 1999 +0000 Added new protocol hook for dumping of protocol-dependent route attributes. Please implement in all protocols. commit 73c7bed168890399981f70e1d0be35d8cde01fed Author: Martin Mares Date: Sat Apr 3 13:00:52 1999 +0000 Defined CONFIG_SELF_CONSCIOUS whenever the kernel scanner is able to distinguish between our own routes and alien ones. commit fe662dfd782619fd6505a1456b973b2525ab6ebf Author: Martin Mares Date: Fri Apr 2 13:38:54 1999 +0000 Fixed `too many interfaces' cases. commit 0498d92f955f011ceb70e1124f25ac567c359005 Author: Pavel Machek Date: Fri Apr 2 11:45:55 1999 +0000 Believe it or not, printf()'s does not work too much without this one. commit 8cda9cdbcf445ebe828b7bf89dcb4c7f83937756 Author: Martin Mares Date: Thu Apr 1 19:23:59 1999 +0000 Argh, the fix was wrong. commit e4241f24f2ebc796a9cfb03db2a9502f5ebd9c0c Author: Martin Mares Date: Thu Apr 1 15:35:15 1999 +0000 Portability fixes. commit abae6e9cd3f041648eaa85fad2f861515b67c1ce Author: Martin Mares Date: Thu Apr 1 15:33:52 1999 +0000 First few FreeBSD portability fixes. commit 6accdf4f437ef2a3251df917f2b83fe985e64961 Author: Martin Mares Date: Mon Mar 29 20:46:00 1999 +0000 Updated the TODO list. commit fb71b23e6004d18480dcfdfbc2e7da7bbc4eb400 Author: Martin Mares Date: Mon Mar 29 20:33:45 1999 +0000 Remember that we can run device syncer without kernel syncer and vice versa now. commit 78d5ec15043ab67fdf31feabe4a83129488625fe Author: Martin Mares Date: Mon Mar 29 20:28:25 1999 +0000 Please don't commit debugging code which makes BIRD exit before anything actually starts to happen. Grrr. commit e4912e3594c9211c8a147f1dcd4eeaf3b0095ed0 Author: Martin Mares Date: Mon Mar 29 20:26:32 1999 +0000 Prefer `gm4' over `m4' (due to BSD et al.). commit ba92164871f65bb9adcfa66b901d1a7b86697a86 Author: Pavel Machek Date: Mon Mar 29 20:21:28 1999 +0000 Update of filters towards new interface. commit 5bc512aa3a0d3e4ca378fff3316b75c131f17637 Author: Martin Mares Date: Mon Mar 29 20:14:33 1999 +0000 Clarify resource dumps and include them in the main debugging dump. commit 3f2a21fd348e49cf3ca98750b14e14dd04b3209b Author: Martin Mares Date: Mon Mar 29 20:14:00 1999 +0000 Don't try to delete interface routes on CONFIG_AUTO_ROUTES systems. commit 6c02d83f4d225abc03f99fb80299f1ba10ac174a Author: Martin Mares Date: Mon Mar 29 19:56:32 1999 +0000 Added FIXME: If a strange interface appears, ignore it instead of only writing an error message... commit f5c687f7911501ac1efd8163fade4862dc65456c Author: Martin Mares Date: Mon Mar 29 19:35:47 1999 +0000 Added lp_flush() which flushes contents of a linear pool, leaving all the memory available for subsequent allocations from the same pool. Both flushing and re-using the memory costs just few instructions. commit f54801ffedf3d6342b37c1560502bfc24e7fe64a Author: Martin Mares Date: Mon Mar 29 19:14:43 1999 +0000 Moved all system-dependent #include's containing endianity conversion functions to sysdep header endian.h. commit 6134024815adf2541293008f848dce4e8a21d061 Author: Martin Mares Date: Mon Mar 29 19:13:36 1999 +0000 #define NULL if not defined by system includes. commit 7f400d1c620e80461e61384c7d0b8893edb92695 Author: Martin Mares Date: Mon Mar 29 19:04:14 1999 +0000 After today's lengthy discussions about filter syntax, let's clean up whitespace/semicolon rules for whole config file: o All non-zero amounts of whitespace are equivalent to single space (aka `all the whitespace has been born equal' ;-)). o Comments count as whitespace. o Whitespace has no syntactic signifance (it can only separate lexical elements). o Consequence: line ends are no longer treated as `;'s. o Every declaration must be terminated by an explicit `;' unless or by a group enclosed in `{' and `}'. commit 1127ac6ec7eff52d4ccbc4d836a63fa6513f6d48 Author: Martin Mares Date: Sat Mar 27 22:51:05 1999 +0000 Cleaned up system configuration files -- removed few obsolete parameters, documented the remaining ones (sysdep/cf/README). Available configurations: o linux-20: Old Linux interface via /proc/net/route (selected by default on pre-2.1 kernels). o linux-21: Old Linux interface, but device routes handled by the kernel (selected by default for 2.1 and newer kernels). o linux-22: Linux with Netlink (I play with it a lot yet, so it isn't a default). o linux-ipv6: Prototype config for IPv6 on Linux. Not functional yet. commit 7dc4827c968053e45bcb7f145e9986eeb20c993b Author: Martin Mares Date: Fri Mar 26 21:50:43 1999 +0000 Added everything protocols need to know about multiple routing tables, i.e. struct proto now contains field 'table' pointing to routing table the protocol is attached to. Use this instead of &master_table. Modified all protocols except the kernel syncer to use this field. commit 7e5f5ffdda7232048c4baf3fdec358afb494a29d Author: Martin Mares Date: Fri Mar 26 21:44:38 1999 +0000 Moved to a much more systematic way of configuring kernel protocols. o Nothing is configured automatically. You _need_ to specify the kernel syncer in config file in order to get it started. o Syncing has been split to route syncer (protocol "Kernel") and interface syncer (protocol "Device"), device routes are generated by protocol "Direct" (now can exist in multiple instances, so that it will be possible to feed different device routes to different routing tables once multiple tables get supported). See doc/bird.conf.example for a living example of these shiny features. commit 739ebd8e82b090ed91b3ebe77509ecd6784eca9a Author: Martin Mares Date: Fri Mar 26 21:38:02 1999 +0000 Allow different instances of the same protocol with identical preferences. commit 4ba84ebc8285c3a5c556fc769101cc29cb3d3708 Author: Martin Mares Date: Fri Mar 26 21:37:29 1999 +0000 Slightly better generator of default protocol instance names. commit 241b7311ec5a091b7f3e1a1f2a776f3ef403c500 Author: Martin Mares Date: Fri Mar 26 21:35:28 1999 +0000 Don't compile OSPF by default. commit b5239f223874b87dd7c9de4d624cdf1230022111 Author: Martin Mares Date: Fri Mar 26 21:33:36 1999 +0000 Don't try to manipulate neighbor lists for copied interface structures. This avoids few nasty references to free memory. commit f79a749d0b9a5a7509db9ad6c547bbabc0457675 Author: Martin Mares Date: Wed Mar 24 09:23:34 1999 +0000 Removed our declaration of RTPROT_BIRD since Alexey has assigned us a real protocol number in 2.2.4 kernel. commit 421838ffef49338218dd85ff5efd1d5396ab7ccf Author: Martin Mares Date: Wed Mar 17 15:01:07 1999 +0000 rte_update: Check sanity of incoming entries. Throw out (and log) all routes to bogus prefixes and non-local routes to host scope addresses. commit 529c414953c24c326d9063a8f06fa652f0dfbc30 Author: Martin Mares Date: Wed Mar 17 14:31:26 1999 +0000 Allow input and output filters (only accept/reject style as we didn't define modifying filters yet) to be attached to protocol instances. commit e0f2e42f4f420f7bbdda3d4656c9dda585f1297a Author: Martin Mares Date: Wed Mar 17 14:29:39 1999 +0000 A couple of filter tweaks: o Introduced struct filter which serves as an external reference to filter. Using struct symbol for this is unwise since it doesn't allow extra information attached to the filter and it also forces all filters to be named. o Implemented config rule 'filter' which matches either named filter or an embedded unnamed filter (`{ }'). o Fixed totally bogus comment at the top of filter.h. o Added a missing prototype for f_run() to filter.h. commit c612a3be310069b9fbbcfef931bb546d536a716f Author: Martin Mares Date: Wed Mar 17 13:13:18 1999 +0000 Removed the `rta_same' hook since it's no longer needed (all protocols needing some local information should use extended attrs and cached rta's). commit b77ae37d11aa6e16dce31f50ca42ea30714a793e Author: Martin Mares Date: Wed Mar 17 13:09:09 1999 +0000 Implemented extended route attributes and all related functions. commit 9a38757c6ab87bf64ebc22b25b1410a3a09e6b10 Author: Pavel Machek Date: Wed Mar 17 13:05:25 1999 +0000 Initialize pointers to functions so that code is actually alive. commit 3c7ad64c57de77763357684fab919b2fc082a759 Author: Pavel Machek Date: Wed Mar 17 13:04:33 1999 +0000 Compilation fix for mj. commit 29df5739c455a954598c809c2e930abc41c8488e Author: Pavel Machek Date: Wed Mar 17 10:20:23 1999 +0000 Don't segfault on unknown interface. commit d36d838df5f726e1f6845fe0e6e5c188426ac00d Author: Pavel Machek Date: Wed Mar 17 10:19:07 1999 +0000 accept & reject should now work commit c1f8dc9149d3868e5a0f4e4ad97759fb3b177bec Author: Ondrej Filip Date: Tue Mar 9 22:27:43 1999 +0000 Yes, joining the crew. Sorry for being late. Added dummy functions for OSPF. commit 2575593e0fa9fb84a4cc481928c32519b3fea2cd Author: Pavel Machek Date: Tue Mar 9 14:45:27 1999 +0000 Resolved conflicts, you no longer need to wrap constants in const() commit 1aa5cf1c6171393d4be4447eada173d4e1eb983a Author: Pavel Machek Date: Tue Mar 9 14:44:43 1999 +0000 Added '=' to operator list commit b7005824453583d1459b49c5a424b50e2ea9a2c8 Author: Pavel Machek Date: Mon Mar 8 20:30:06 1999 +0000 Filters are now a tiny bit stronger (if is actually working ;-) commit 111213f0b66cff8f562f7d9117c9080a9882129e Author: Martin Mares Date: Thu Mar 4 19:00:31 1999 +0000 Fixed processing of !krt_capable() routes. Converted device route decisions to the krt_capable mechanism as well. commit e16155ae4aaee5d9ba7b6940f8312b36707718e4 Author: Martin Mares Date: Thu Mar 4 18:36:18 1999 +0000 KRT: Implemented asynchronous route / interface state notifications (via Netlink). Tweaked kernel synchronization rules a bit. Discovered locking bug in kernel Netlink :-) Future plans: Hunt all the bugs and solve all the FIXME's. commit 2253c9e239253d2094b4b1cabd97d296af885afb Author: Martin Mares Date: Thu Mar 4 14:23:32 1999 +0000 Although there are still heaps of FIXME's, Netlink works. To build BIRD with Netlink support, just configure it with ./configure --with-sysconfig=linux-21 After it will be tested well enough, I'll probably make it a default for 2.2 kernels (and rename it to linux-22 :)). commit f81dc8564ae6c17638d7e3970b9980d0d00fc78a Author: Martin Mares Date: Thu Mar 4 11:40:05 1999 +0000 Converted some mb_alloc/bzero pairs to mb_allocz. commit 8fe48f1377c8b501e9b090748b195c62f5b582d2 Author: Martin Mares Date: Thu Mar 4 11:39:24 1999 +0000 Initialize allocated struct proto :-) commit 7a2105becdbadf20c1b4e4d2359e339c90610825 Author: Martin Mares Date: Thu Mar 4 11:36:26 1999 +0000 Use dmalloc instead of EFence when available (dmalloc has lot of improvements over EFence and also hopefully smaller memory overhead, but sadly it's non-free for commercial use). If the DMALLOC_OPTIONS environment variable is not set, switch on `reasonable' checks by default. Also introduced mb_allocz() for cleared mb_alloc(). commit aa64578641c15b137172acc927d9d7af5914576b Author: Martin Mares Date: Wed Mar 3 20:57:29 1999 +0000 Netlink scans routes... commit 51ad41f2fc0c95179cb4ba65e568d2b84de32a28 Author: Martin Mares Date: Wed Mar 3 20:56:33 1999 +0000 EFence helped to find using of already free rte's in rt_prune(). commit 53b7a2982adf5d09a1cfddbc12cf172e0700fc55 Author: Martin Mares Date: Wed Mar 3 20:55:35 1999 +0000 Fix several things I broke today. commit 0e889c52542508dd49433bed1785072cb7799009 Author: Martin Mares Date: Wed Mar 3 20:40:51 1999 +0000 Added a hack forcing protocols with priority>0 to be started up immediately. Grrr, need to find a real solution some day. commit 2d14045224f2233aed386eddf155d10a81892c3f Author: Martin Mares Date: Wed Mar 3 19:49:56 1999 +0000 Rewrote the kernel syncer. The old layering was horrible. The new kernel syncer is cleanly split between generic UNIX module and OS dependent submodules: - krt.c (the generic part) - krt-iface (low-level functions for interface handling) - krt-scan (low-level functions for routing table scanning) - krt-set (low-level functions for setting of kernel routes) krt-set and krt-iface are common for all BSD-like Unices, krt-scan is heavily system dependent (most Unices require /dev/kmem parsing, Linux uses /proc), Netlink substitues all three modules. We expect each UNIX port supports kernel routing table scanning, kernel interface table scanning, kernel route manipulation and possibly also asynchronous event notifications (new route, interface state change; not implemented yet) and build the KRT protocol on the top of these primitive operations. commit b2280748ad5087b5dab54dd4e423053ffe1f2387 Author: Martin Mares Date: Wed Mar 3 19:33:54 1999 +0000 Introduced protocol priority (all 'normal' protocols should use the default zero priority). No more "kernel syncer initialized before device routes" problems. commit 84c7e1943f0dbf896b1dd8d02a21120aa00463f4 Author: Pavel Machek Date: Tue Mar 2 19:49:28 1999 +0000 Add interface for running filters (please comment!), avoid bison warnings commit 05a845ed8e623c51025058037d0ca25db712ae68 Author: Pavel Machek Date: Tue Mar 2 19:49:22 1999 +0000 Avoid segfault commit 7972248d5d7f404a65fd630b2af712703aca0746 Author: Martin Mares Date: Tue Mar 2 18:37:02 1999 +0000 Netlink module supports interface scan on startup. Working on more. commit e35ef181a41384446aca614522a7cbb10606dd5b Author: Martin Mares Date: Tue Mar 2 18:36:09 1999 +0000 o The if_change_too_big_p change was too high-spirited. Fixed. o Introduced if_find_by_index() o Recognizing two types of interface updates: full update (starting with if_start_update(), ending with if_end_update(), guaranteed to see all existing interfaces) and a partial update (only if_update(), usually due to asynchronous interface notifications). commit bcbd8cc3be670a96e1405b896cff4be0912ba379 Author: Martin Mares Date: Tue Mar 2 17:28:06 1999 +0000 Interface logic changes: o Introduced IF_LINK_UP flag corresponding to real link state. o Allowed addressless interfaces. o IF_UP is now automatically calculated and set iff the interface is administratively up, has link up and has an IP address assigned. It may be IF_IGNORED, though (as in case of the loopback). o Any changes which include up/down transition are considered small enough to not provoke artificial upping and downing of the interface. o When an interface disappears (i.e., it wasn't seen in the last scan), we announce this change only once. o IF_LOOPBACK implies IF_IGNORE. commit 25287d6f7e687c77704816e565529960c65e3250 Author: Martin Mares Date: Tue Mar 2 17:20:07 1999 +0000 Don't try to install static routes to disconnected neighbors. commit eab0d1e5e5e89d82e435d224f5faf1a16524c69c Author: Martin Mares Date: Tue Mar 2 16:39:41 1999 +0000 Latest changes broke out-of-tree compilation. commit 3d8ef0c9ef7878292ef314a0f5f34390d74f4e9f Author: Pavel Machek Date: Tue Mar 2 13:15:35 1999 +0000 I just don't like files enclosed in <>. commit e834074dd43cabd10ca9811191a212f86b8f6ed7 Author: Martin Mares Date: Mon Mar 1 22:42:47 1999 +0000 If we are compiling with debugging enabled and libefence is available, link it to get debugging malloc. commit b982b6db2bc9df396d4cd329e23c5b3199a409a2 Author: Martin Mares Date: Mon Mar 1 22:31:27 1999 +0000 Implemented netlink protocol parsing functions. More to come tomorrow. commit b4b3b39e20a669ab3f33f71474e937b5e9ce6d26 Author: Martin Mares Date: Mon Mar 1 22:30:33 1999 +0000 Added SK_MAGIC type sockets for internal use by system dependent code, especially for netlink communication. commit c748cdb9ec8b7de5daaf759825bc428cd0bcd400 Author: Pavel Machek Date: Mon Mar 1 21:18:01 1999 +0000 Hopefully ended translating to new interface commit bdb95a21a45bce1754bf54de3e7423cf8eebf9ee Author: Martin Mares Date: Mon Mar 1 20:17:46 1999 +0000 Added skeletal version of Linux netlink interface. It doesn't work yet, but the framework is there and I'll try finish it soon. commit ea3582a6f66223dfd2c0dd6c597dc40b48033fd5 Author: Martin Mares Date: Mon Mar 1 20:15:14 1999 +0000 Include "config.h" instead of "autoconf.h" in all Modules lists to make defines in the static portion of configuration includes available as well. commit 1b769b08c195f7d95525131f65e5794c3c09a335 Author: Martin Mares Date: Mon Mar 1 20:13:54 1999 +0000 Renamed struct rtattr to struct rta to make things more consistent and avoid namespace clashes with . Other files should not be affected since they use 'rta' directly. commit 025d14cd5a0909b534762e5a50bfef97c2b4c9ee Author: Martin Mares Date: Mon Mar 1 19:05:58 1999 +0000 Use traditional Unix route/iface interface only when CONFIG_NETLINK is not defined. Also moved declarations of Unix iface logic to krt.h. commit 12be9b8c1870ab8813d29350a2e2743f8e144642 Author: Martin Mares Date: Mon Mar 1 17:51:29 1999 +0000 Pruned the TODO list. commit 293e313ec91d4d23d6333e8cd852d425079cee68 Author: Pavel Machek Date: Mon Feb 15 13:34:43 1999 +0000 More rip fixes (config data moved to struct rip_proto_config), still not tested. commit b5fe3dc21c930e1d9864e342a75785efe862bd24 Author: Martin Mares Date: Sat Feb 13 22:13:04 1999 +0000 Cleaned up TODO file. That's all for today, midnight gets closer. commit 45090fecd97c97cceb677257c6e8c26044065d13 Author: Martin Mares Date: Sat Feb 13 22:02:21 1999 +0000 Synced example config with new options. commit d88e99a92ae688cc7f6534af4c2555fe6f6709f6 Author: Martin Mares Date: Sat Feb 13 21:59:48 1999 +0000 Implemented static device routes. Expect for reconfiguration issues, the static protocol is complete now. commit d1f7eab6b5f1bd86a47402cb8fdb5cbcedc8947f Author: Martin Mares Date: Sat Feb 13 21:58:53 1999 +0000 Parameter order for the proto->if_notify hook was different in the include file and different in reality. Decided to use the same order as we do for proto->rt_notify (i.e., first new value and second the old one). commit 726141746b7f86b02a902bd6b316792e4be0380c Author: Martin Mares Date: Sat Feb 13 21:34:33 1999 +0000 '#' comments in config files are equivalent to end of line, therefore also to implicit ';'. commit 5996da6a1d2eb11ac45d9d578618b9350e58593d Author: Martin Mares Date: Sat Feb 13 21:29:01 1999 +0000 Implemented garbage collection of routing tables to delete orphaned network nodes having no routes attached. Such cleanup must be done from event handler since most functions manipulating the routing tables expect network entries won't disappear from under their hands and it's also probably faster when done asynchronously. commit f4a0a64e02c13b2b467f9c1a29222f817b54ce2d Author: Martin Mares Date: Sat Feb 13 21:00:25 1999 +0000 Static protocol doesn't need any shutdown function. Everything gets disposed by the core: neighbors, rte's, etc's... commit 3fb4ca2ce2b5750d38a5e31023d2873c9942cc78 Author: Martin Mares Date: Sat Feb 13 20:57:47 1999 +0000 Don't send any neighbor notifications to protocols being flushed. commit 783f8b689a29aaffbe75e964fdd09a3c219ea81c Author: Martin Mares Date: Sat Feb 13 20:55:08 1999 +0000 When protocols go down, prune the neighbor list. commit 013a9b91fe495371cbf9a5690613de45b634e3af Author: Martin Mares Date: Sat Feb 13 20:46:03 1999 +0000 When shutting down, remove all routes (except for RTS_INHERIT and RTS_DEVICE routes) from kernel routing tables unless the "persist" switch is set. commit 0a2e9d9f5685fb4ca63e02fd3645194bb6de79d7 Author: Martin Mares Date: Sat Feb 13 20:19:24 1999 +0000 Moved sanity check of protocol state during annoucements to rte_announce. commit f4aabcee62890b7c3e999e188ab72752fbb20b79 Author: Martin Mares Date: Sat Feb 13 20:15:36 1999 +0000 Perform gracious shutdown upon receipt of SIGTERM. Finally we can test the whole protocol shutdown code... :) commit 7f3d1a0850ff7f240b2f240db6d44b3a5dee6d48 Author: Martin Mares Date: Sat Feb 13 19:57:19 1999 +0000 Squashed one bug in timing of route scans. commit 4c9dd1e4b95e273eacc900abb63db4b8bafaf34b Author: Martin Mares Date: Sat Feb 13 19:43:21 1999 +0000 Synchronize signals to the main select/event/timer loop. Parse command line options. commit 1a54b1c6ac5177a1ef21f799f6cf28f355c5bbe9 Author: Martin Mares Date: Sat Feb 13 19:15:28 1999 +0000 Implemented real cleanup and pruning of routing table on protocol shutdown. commit ab749558a2a4356c38ed760649ef7d62daa48223 Author: Martin Mares Date: Sat Feb 13 19:14:16 1999 +0000 Pass new argument to FIB_ITERATE_END. commit 2569bc40731081ac70ee328a7df37109399b53c6 Author: Martin Mares Date: Sat Feb 13 19:13:51 1999 +0000 Fixed bug in FIB_ITERATE_END: it assumed the control variable is named "z". I've added an argument specifying name of the variable. Renamed "again" label in FIB_ITERATE_* to "fis_again" to avoid name clashes. commit 4e9498cbb171d52e2f3015d3e9d6c7b1b7205e27 Author: Martin Mares Date: Sat Feb 13 18:42:00 1999 +0000 config->router_id works again. commit 67bd949a520151a5ab50090d02617adc4960868c Author: Martin Mares Date: Thu Feb 11 22:59:06 1999 +0000 Real implementation of protocol state machines. Delayed startup/shutdown should work now. Initial feeding of protocols by interfaces/routes is done from the event queue to prevent unwanted recursion. commit 14dea0ed25cd0385ce35cf66ff309a78960b18ca Author: Martin Mares Date: Thu Feb 11 22:51:15 1999 +0000 Run the event queue before writing SIGUSR dumps. commit 64011f898c1bc99183a57f21d6e099c8f4496a09 Author: Martin Mares Date: Thu Feb 11 22:45:54 1999 +0000 struct proto again contains instance name (a copy of proto->cf->name). commit 3b15402fd4055cb5bd66cd9ac1106ceecff9f760 Author: Martin Mares Date: Thu Feb 11 22:18:36 1999 +0000 Grrr, forgot to commit the event routines themselves :| commit e8f73195fa68b027fdcb89f239107c2d4902bd9a Author: Martin Mares Date: Thu Feb 11 21:18:26 1999 +0000 Added simple event scheduling system to avoid recursive calling of various callbacks. Events are just another resource type objects (thus automatically freed and unlinked when the protocol using them shuts down). Each event can be linked in at most one event list. For most purposes, just use the global event list handled by the following functions: ev_schedule Schedule event to be called at the next event scheduling point. If the event was already scheduled, it's just re-linked to the end of the list. ev_postpone Postpone an already scheduled event, so that it won't get called. Postponed events can be scheduled again by ev_schedule(). You can also create custom event lists to build your own synchronization primitives. Just use: ev_init_list to initialize an event list ev_enqueue to schedule event on specified event list ev_postpone works as well for custom lists ev_run_list to run all events on your custom list ev_run to run a specific event and dequeue it commit edf62ba13fa6a74447d7ad44b23acbee964731bc Author: Pavel Machek Date: Mon Feb 8 22:50:32 1999 +0000 Propagate depend into all subdirectories; make rip compile after latest mj's changes. commit ed245f967f76d29d6a4ce971ba4287ba6a7031f7 Author: Martin Mares Date: Fri Feb 5 21:39:21 1999 +0000 Synced Linux sysdeps to new interface. commit 10d807d000155a6257f6fbad88eb72a8bf9045da Author: Martin Mares Date: Fri Feb 5 21:38:50 1999 +0000 Synced kernel interface to new interface. commit e9e3dc265971fbf985c5df09cb1d98494c386581 Author: Martin Mares Date: Fri Feb 5 21:38:22 1999 +0000 Modified static router to use new interface. commit 31b3e1bbf5bc823ec5cf6d88931132f00e6c52b9 Author: Martin Mares Date: Fri Feb 5 21:37:34 1999 +0000 Implemented new configuration/reconfiguration interface and defined protocol state machines. Full explanation will follow soon. commit c4c63eecc37a744c53c23da89b1ba09b9640cb6e Author: Martin Mares Date: Fri Feb 5 21:29:19 1999 +0000 Added several parentheses to MIN/MAX macros. commit 292099d55f1131d75efec647d3780e7a1a665fdf Author: Pavel Machek Date: Wed Feb 3 12:28:16 1999 +0000 Few fixes in parsing of filters commit 294c182eb1dd02d0ae8658acb4a21db5d2977f3c Author: Martin Mares Date: Sat Jan 23 21:08:59 1999 +0000 Replaced the old ugly ipv6 compilation hack by a conditional in Modules. commit 2c2f67bd83c267c1dbee68c6ed7d67f9be77e566 Author: Martin Mares Date: Sat Jan 23 21:08:36 1999 +0000 Filter all `Modules' files through C preprocessor, so that they can reference BIRD configuration. By the way: Do you know GCC by default does `#define unix 1'? commit ca3d562b24d5a3e303ab00d276496fb38b7382ee Author: Pavel Machek Date: Fri Jan 15 18:13:55 1999 +0000 filters_init() renamed to filters_postconfig(). commit c9b6670608577521c883db4bccd75b871568b7f7 Author: Martin Mares Date: Fri Jan 15 18:04:28 1999 +0000 Original `expr' is back, filter expressions renamed to `term'. In the future, we'll allow any filter term in place of `expr' and we'll just evaluate it immediately, but not now as we have no evaluation routines. commit 3169cf699175a2489712eee955a9ee9890ef00c9 Author: Martin Mares Date: Fri Jan 15 17:18:41 1999 +0000 Added bird.conf to .cvsignore and created an example configuration file. If you want to run bird now, just copy doc/bird.conf.example as bird.conf and edit it to suit your needs. commit e3a39a9ee70bf7060f9de38268885b637bc1a65a Author: Martin Mares Date: Fri Jan 15 16:59:26 1999 +0000 Killed duplicate %type for expr. commit ca6dfded2c22c74298ff595e59afe4672151889b Author: Pavel Machek Date: Fri Jan 15 16:52:14 1999 +0000 Make filters actually compiled. commit b9d70dc84e488212328103438bdf4e369c7d27a1 Author: Pavel Machek Date: Fri Jan 15 16:49:17 1999 +0000 Filters, second try. This time they have their own directory. commit b79f9215b99c7a54dbb2639c972dda497d141133 Author: Martin Mares Date: Fri Jan 15 16:40:14 1999 +0000 Propagate "depend" target to real top-level Makefile. commit 489b6b5e003f4a8a7856688ab0372b2ca59c84d9 Author: Pavel Machek Date: Fri Jan 15 16:13:51 1999 +0000 #if 1 that creeped into cvs killed. commit eeb05158acd0cb8def7aa155c2c718f608e6a5ae Author: Pavel Machek Date: Fri Jan 15 14:42:55 1999 +0000 Be a tiny bit more verbose. commit 72380a3447d2c54730a4a32495e5dd964c34f57e Author: Pavel Machek Date: Fri Jan 15 14:41:51 1999 +0000 Filters added. They are unable to do anything interesting for now (with exception of printing integers to screen), but they exist. commit 41183888ee8addbd7887936e3b41974f5824d8ae Author: Pavel Machek Date: Fri Jan 15 14:40:50 1999 +0000 Properly initialize filters. Also bumped version to 0.0.0 as it actually does something. commit cceb3e7d2fafcf3acee1db1d762ed697863b6f3b Author: Martin Mares Date: Tue Jan 12 20:36:18 1999 +0000 Fixed trivial bug in naming of `depend' file. Argh. commit 663683a575cb170c656db06770b490037ecf3db7 Author: Pavel Machek Date: Tue Jan 12 16:50:38 1999 +0000 Make it compile again (stupid makefiles!), make quiet option work (multicast/broadcast options are currently unimplemented). commit 77cedad1f6de8fcd0e59f280d08437ab3216428e Author: Pavel Machek Date: Tue Jan 12 16:41:34 1999 +0000 Keep protocol data out of iface_patt. commit 50e89a6ea26caba59c7d4dd512fdc12c09cee64c Author: Pavel Machek Date: Tue Jan 12 16:40:55 1999 +0000 Patterns expanded in the right way commit 18fff6a1979725c1ed839d9a10285e22dc0b8214 Author: Martin Mares Date: Sun Jan 10 00:26:11 1999 +0000 Initialize only protocols which are compiled in :) commit b296730cb6b72ff84ba04fa58a6c7198f3a831e0 Author: Martin Mares Date: Sun Jan 10 00:25:50 1999 +0000 Few last-minute bug fixes. commit 49e7e5ee0b2848f5bf120a962e2e7eb11b86566a Author: Martin Mares Date: Sun Jan 10 00:18:32 1999 +0000 New makefiles. Includes support for out-of-source-tree builds. commit 2f9bcf9713523f6fefecd143cc2aa2a8dda7f27f Author: Martin Mares Date: Sat Jan 9 15:02:11 1999 +0000 First step of "autoconfization". Created a configure script which guesses most system-dependent parameters and determines name of system configuration file (sysdep/cf/...) with the remaining ones. To compile BIRD, you now need to do: autoconf # Create configure from configure.in ./configure # Run configure script make # Compile everything Configuration files: sysdep/config.h Master config file sysdep/autoconf.h Parameters determined by configure script sysdep/cf/*.h Fixed system configuration we're unable to guess. Makefiles are still the original ones, but this will change soon. commit 6996f459c6d8e6205bbacd83e3656b47635f7d6d Author: Pavel Machek Date: Tue Dec 22 19:41:04 1998 +0000 Bird now uses fib structure instead of linklist. commit 1d7c44b7119d30874563c9f8bbac25273ecabb57 Author: Pavel Machek Date: Tue Dec 22 19:20:43 1998 +0000 Oops, previous modification for passing NULL to fib_init() did not compile :-(. commit ce45fc128783ea7b93bd7ebd5ac4eec763adbb40 Author: Pavel Machek Date: Tue Dec 22 18:55:49 1998 +0000 Allow NULL to init_fib(). commit 852fc0af31ed885e355bb1d14ce0e4468830c359 Author: Martin Mares Date: Sun Dec 20 14:29:06 1998 +0000 log(), die() and bug() messages shound NOT contain trailing newlines. commit 08c69a7720af32a82b8e2b4b9ea3742074b3b8ee Author: Martin Mares Date: Sun Dec 20 14:27:37 1998 +0000 die() -> bug() where appropriate. commit ee969ea7f4c4f40020e4209b167da04d04aba52c Author: Martin Mares Date: Sun Dec 20 14:26:57 1998 +0000 Added #if 0 to rip_postconfig(), so that it doesn't crash whole daemon when RIP is unconfigured. die() -> bug() commit 98e87c8628f9b0a0a96bc46879b65a78b756a718 Author: Martin Mares Date: Sun Dec 20 14:24:35 1998 +0000 Finer grained logging levels: #define L_DEBUG "\001" /* Debugging messages */ #define L_INFO "\002" /* Informational messages */ #define L_WARN "\003" /* Warnings */ #define L_ERR "\004" /* Errors */ #define L_AUTH "\005" /* Authorization failed etc. */ #define L_FATAL "\006" /* Fatal errors */ #define L_TRACE "\002" /* Protocol tracing */ #define L_INFO "\003" /* Informational messages */ #define L_REMOTE "\004" /* Remote protocol errors */ #define L_WARN "\004" /* Local warnings */ #define L_ERR "\005" /* Local errors */ #define L_AUTH "\006" /* Authorization failed etc. */ #define L_FATAL "\007" /* Fatal errors */ #define L_BUG "\010" /* BIRD bugs */ Introduced bug() which is like die(), but with level L_BUG. Protocols should _never_ call die() as it should be used only during initialization and on irrecoverable catastrophic events like out of memory. Also introduced ASSERT() which behaves like normal assert(), but it calls bug() when assertion fails. When !defined(DEBUGGING), it gets ignored. commit e440395d7d3c503692321e2f6ec4e42bf758acb1 Author: Martin Mares Date: Sun Dec 20 14:01:37 1998 +0000 When printing a routing table, fib_check() it. commit 3ab001b97402bc01a4777cf1cb60ce940d50ffe3 Author: Martin Mares Date: Sun Dec 20 14:01:20 1998 +0000 Rewrote fib functions to make them insert/delete/asynchronous-walk safe. This is implemented in a way similar to lib/slists.h, but it took some more effort to make rehashing not disturb the readers. We do it by just taking _highest_ k bits of ipa_hash as our hash value and sorting each box by whole ipa_hash(). Consult FIB_ITERATE_* macros in nest/route.h. Implemented fib_check() debugging function and also rewrote the rehashing algorithm to use better thresholds and not to waste time by rehashing forth and back. commit a6f250f5c6d079badc4a1274b19a21a52de6acec Author: Martin Mares Date: Sun Dec 20 13:57:49 1998 +0000 New hash functions according to benchmarks posted yesterday. (The IPv6 version has not been benchmarked yet due to insufficient test data.) Now ipa_hash() returns a uniformely distributed 16-bit value. commit a05406e69c699c8b6f43bf58f47b8b0385113083 Author: Martin Mares Date: Sun Dec 20 13:56:27 1998 +0000 Implemented deletion/insertion/asynchronous-walk lists. For example of their use, look at comments in lib/slists.h. commit 29ad2c9ee11df80c780c4e3f0fd217783af1d727 Author: Martin Mares Date: Sat Dec 19 21:53:28 1998 +0000 Variance estimation fixed. commit 87b60bf7e8ad12b3efd3d6f37df0d029f50d2d91 Author: Martin Mares Date: Sat Dec 19 11:51:47 1998 +0000 Added several tools for fib hashing function analysis. It turned out we can use very simple function which is monotonic with respect to re-hashing: n ^= n >> 16; n ^= n << 10; h = (n >> (16 - o)) & ((1 << o) - 1); where o is table order. Statistical analysis for both backbone routing table and local OSPF routing tables gives values near theoretical optimum for uniform distribution (see ips.c for formulae). The trick is very simple: We always calculate a 16-bit hash value n and use o most significant bits (this gives us monotonity wrt. rehashing if we sort the chains by the value of n). The first shift/xor pair reduces the IP address to a 16-bit one, the second pair makes higher bits of the 16-bit value uniformly distributed even for tables containing lots of long prefixes (typical interior routing case with 24-bit or even longer prefixes). commit 02933ddbbec94f1bb01c0b9e5198fe272c1f5025 Author: Pavel Machek Date: Wed Dec 9 20:08:57 1998 +0000 debug() -> DBG() in rip. commit 06fa1453cdc419acd0c037ac82f49b4d8e77cfbd Author: Pavel Machek Date: Wed Dec 9 15:22:40 1998 +0000 Initial multicast support (can not work, but skeleton is there) commit 8e66a0ebb927f40c9fcb48bbf5f2d811d7b7c7f3 Author: Martin Mares Date: Tue Dec 8 18:37:58 1998 +0000 Hopefully finished kernel syncer (krt) rewrite: o Interface syncing is now a part of krt and it can have configurable parameters. Actually, the only one is scan rate now :) o Kernel routing table syncing is now synchronized with interface syncing (we need the most recent version of the interface list to prevent lots of routes to non-existent destinations from appearing). Instead of its own timer, we just check if it's route scan time after each iface list scan. o Syncing of device routes implemented. o CONFIG_AUTO_ROUTES should control syncing of automatic device routes. o Rewrote krt_remove_route() to really remove routes :) o Better diagnostics. o Fixed a couple of bugs. commit 980297d2899a5aec6609d1f7b44626e52e6e4417 Author: Martin Mares Date: Tue Dec 8 18:31:31 1998 +0000 Fixed a couple of bugs in static protocol. All static routes except device ones seem to work well. commit 618533af91051b7b26ac19816e89cd81352b0f13 Author: Martin Mares Date: Tue Dec 8 18:30:35 1998 +0000 Added source RTS_DUMMY for temporary routes. They should never appear in the main table. commit f39e4713c270752d7bbfcc8115a7ea7f589c3997 Author: Martin Mares Date: Tue Dec 8 16:20:13 1998 +0000 Rewritten kernel syncer. Now uses the rta trickery I've introduced yesterday and does things "the right way". Few things are still missing (device routes etc.), I'll add them later in the evening. commit 04925e9040330afc92f8001e6a19ae2146e36782 Author: Martin Mares Date: Mon Dec 7 21:59:15 1998 +0000 Minor rte/rta interface changes: o rte can now contain a pointer to both cached and uncached rta. Protocols which don't need their own attribute caching can now just fill-in a rta, link it to rte without any calls to attribute cache and call rte_update() which will replace rte->attrs by a cached copy. o In order to support this, one of previously pad bytes in struct rta now holds new attribute flags (RTAF_CACHED). If you call rte_update() with uncached rta, you _must_ clear these flags. In other cases rta_lookup() sets it appropriately. o Added rte_free() which is useful when you construct a rte and then the circumstances change and you decide not to use it for an update. (Needed for temporary rte's in kernel syncer...) commit cdc6bfa70f730c3741537cc21cdd0a5d13ed2af9 Author: Martin Mares Date: Mon Dec 7 10:16:15 1998 +0000 Comparison of kernel reject routes fixed. commit 12df4d909bdfa9e99dd0dd1b9fd690ce85b87dc5 Author: Martin Mares Date: Mon Dec 7 10:15:42 1998 +0000 KRF_* flags moved to krt.h as they are internal to kernel syncer, fib->pad0,pad1 renamed to x0,x1 and in case of struct net x0 is reserved for kernel syncing as well. commit f6bd206607d9fcad3572841813d7376bd2df4952 Author: Martin Mares Date: Sun Dec 6 23:13:31 1998 +0000 All static routes except for device ones should work and appear/disappear when their destination comes on/off link. Deserves better testing :) See example in bird.conf. commit 78d06cf2bc8ec8b9850802fc9d34afe4d1782c6c Author: Martin Mares Date: Sun Dec 6 23:11:47 1998 +0000 Removed protocol-specific data in rte for protocol static since no such data ever existed. commit 436965d25e840ef5f9614ed55181f5bf8c765d3b Author: Martin Mares Date: Sun Dec 6 23:11:18 1998 +0000 Aesthetic fix for neighbor cache debug dump. commit 89d2355d3d16ac51ad5861d91b17eaa65713f80b Author: Martin Mares Date: Sun Dec 6 23:10:45 1998 +0000 Added new rule for prefix length / netmask. commit cc12cf05c789ef85d72cf19e9b52f0c4982542f7 Author: Martin Mares Date: Sun Dec 6 23:10:28 1998 +0000 cf_error() now accepts any format strings instead of just an error message. Also added extra kludge to get rid of collisions of REJECT symbols. commit a1bf6440b5c27f7fb829eb25f6ac1c2629eb72eb Author: Martin Mares Date: Sun Dec 6 18:21:23 1998 +0000 Added skeleton of static route protocol. commit 980ffedbb04bf3beedf147fc7dfed40cdbf968aa Author: Martin Mares Date: Sun Dec 6 17:40:42 1998 +0000 Kernel syncer is now configurable. It will probably need some more options, but at least basic tuning is possible now. commit 0846203e896d8ab009217968e391b5e13ea3c4c6 Author: Martin Mares Date: Sun Dec 6 17:39:08 1998 +0000 Fixed bug in CF_ADDTO. How it's possible it has ever worked? commit 166b9c4912f1a52d7910c630280cf5a076eb1990 Author: Martin Mares Date: Sun Dec 6 17:38:42 1998 +0000 Added rule "bool" for boolean switches. commit b35d72ac668c52ef0755cedba89bdca54bd995ac Author: Martin Mares Date: Sun Dec 6 11:59:18 1998 +0000 Name cleanups as suggested by Pavel: - cfg_strcpy() -> cfg_strdup() - mempool -> linpool, mp_* -> lp_* [to avoid confusion with memblock, mb_*] Anyway, it might be better to stop ranting about names and do some *real* work. commit 2d9290e973b9cfc909057a0409152e020d1c29db Author: Pavel Machek Date: Fri Dec 4 11:45:51 1998 +0000 Rip now has configurable per-interface metric (please rewiev), and few more configurable parameters. To do that, union was added into iface_patt. commit 9b999c393c6f89a73d5fe0f4e152b77ca0afb1b2 Author: Pavel Machek Date: Tue Dec 1 16:17:10 1998 +0000 Infinity is now configurable ammount. commit 50d8424ad1f40f9979214c1d6cbf8e290ba9a5cb Author: Martin Mares Date: Sun Nov 29 22:03:58 1998 +0000 Added configuration of the device internal protocol. This is primarily intended to serve as an example of interface pattern list use. As a side effect, you can disable generating of device routes by disabling this protocol. commit 66efdf962a343c7cf5aef475f35f9e3864cb4fdd Author: Martin Mares Date: Sun Nov 29 22:01:33 1998 +0000 Handle disabled protocol instances. commit ed45f2e126680c7197be2058f9c162f1d5019eeb Author: Martin Mares Date: Sun Nov 29 22:01:03 1998 +0000 Added functions for manipulating interface name pattern lists: o iface_patt_match(list, iface) -- match interface against list o iface_patts_equal(a, b, c) -- compare whether two pattern lists are equal or not. c(x,y) is called for comparison of protocol-dependent data. commit 49e4a4d1fd64da045182f6ccd38753feb364f9c5 Author: Martin Mares Date: Sun Nov 29 21:59:37 1998 +0000 Created new functions for allocating configuration data: o cfg_alloc(size) -- generic memory allocation o cfg_allocu(size) -- unaligned memory allocation o cfg_allocz(size) -- zeroed memory allocation o cfg_strcpy(str) -- allocate a copy of a string Also fixed a bug in lexing of string literals. commit 5cd462f291b45a6a33168cdfbc4ba55ee068af65 Author: Martin Mares Date: Sun Nov 29 14:51:47 1998 +0000 `wc -l TODO` decreased. commit dee929d86844b1956b1c0f1d2c0289a787ab9226 Author: Martin Mares Date: Sun Nov 29 14:47:24 1998 +0000 Added function for shell-like pattern matching. Will be used for matching interface names in protocol-to-iface bindings. commit bd5d0d62f10c65d56e1900014be5989a3feb8380 Author: Martin Mares Date: Sun Nov 29 14:40:39 1998 +0000 Allow setting debug value and `disabled' flag in protocol definition. commit 0cf86f0fc34c7daf020a9189279644af89e273a1 Author: Martin Mares Date: Sun Nov 29 14:38:34 1998 +0000 Renamed `DEBUG' symbol to `DEBUGGING' to prevent collisions with token names and include files. commit 7af99789c78894fa2c7ffce3d7172d6a46c1c0e3 Author: Martin Mares Date: Fri Nov 27 21:34:03 1998 +0000 Oops, forgot to remove a debugging kludge. commit 0b62c3a7c7548cd447b4f18e0346cc9e74862ab3 Author: Martin Mares Date: Fri Nov 27 21:32:45 1998 +0000 Trivial 15-line bison excercise: Implemented expressions including user-defined numeric symbols. Whenever possible, use `expr' instead of `NUM' to get full express ion power :-) commit c74c0e3cdf008988a8873d3f76c0d71b29ab8673 Author: Martin Mares Date: Fri Nov 27 21:09:57 1998 +0000 First attempt at protocol configuration (now done only for RIP). commit 93fb60d54ca7ce3efec1cc0b39fb0840d055ccd1 Author: Martin Mares Date: Fri Nov 27 21:08:37 1998 +0000 Fixed few misspellings and exported instance init as rip_init_instance(). commit 8450be97d6ffb052fce95292d39c3f67afbcdc1c Author: Martin Mares Date: Fri Nov 27 21:07:02 1998 +0000 Added generator of default names. commit 906b0170a41cc0d8ea11c7bae0a9fea3d18fe6d1 Author: Martin Mares Date: Fri Nov 27 19:39:16 1998 +0000 Experimental config file. commit b4712244a0fb49b32dc58d28523f122d8ed2cae8 Author: Martin Mares Date: Fri Nov 27 19:38:30 1998 +0000 Dummy grammar for RIP configuration. Now empty, but must be here since it's referenced in the makefiles. commit da87782278cdb38a90f5236fbbc4928c9ca2ee15 Author: Martin Mares Date: Fri Nov 27 19:37:57 1998 +0000 Parser fragment for the core. Now handles only router ID setting. commit 70591fa06481e7935dcf66ec79812c470c71f4c8 Author: Martin Mares Date: Fri Nov 27 19:37:07 1998 +0000 Compile and use the new configuration code by default. commit f142750d3420d482d7e9344c71777fdd37754114 Author: Martin Mares Date: Fri Nov 27 19:36:06 1998 +0000 Base of the parser. commit 82fc7be7bbb9af40d0abf8477f7af25e1423da1a Author: Martin Mares Date: Fri Nov 27 19:35:50 1998 +0000 Lexical analyser. commit fe7cec12e8589b7d6af6033cb80804fbcbe7c0b8 Author: Martin Mares Date: Fri Nov 27 19:35:10 1998 +0000 Replaced nest/confile.h by conf/conf.h, added a lot of new definitions. commit ce6ca80926c0ce87c9a08ea4f4236b1a95846086 Author: Martin Mares Date: Fri Nov 27 19:33:53 1998 +0000 This script takes configuration fragments and generates full Bison grammar from them. commit 882c588a4060739a4820941cd1c6014bd10ab0db Author: Martin Mares Date: Fri Nov 27 19:33:26 1998 +0000 This script takes configuration fragments and extracts keyword list from them. commit d2ed2579fa365fa36b7882ef847b9e640290c05e Author: Martin Mares Date: Fri Nov 27 19:31:41 1998 +0000 Now merges configuration fragments (*.Y) as well. commit dfeef5d8bb9fe19cb44d4121fd8324179a38b7a0 Author: Martin Mares Date: Fri Nov 27 19:29:27 1998 +0000 Implemented ip_pton() commit a3afae585af9a544f919a95509107aae33fbe53c Author: Martin Mares Date: Fri Nov 27 19:29:00 1998 +0000 Removed prototype of rp_free() since this function has never existed. commit 3cef8c706ccfbc17d8af6aed7820c9231d908214 Author: Martin Mares Date: Fri Nov 27 19:28:29 1998 +0000 Added path to config file. commit 4254dc45e77b4c2d45178c7a5ce1e9bff19b8bf7 Author: Martin Mares Date: Sat Nov 21 10:25:34 1998 +0000 Killed bug in processing of 'h' prefix. Patch taken from linux-2.1.129. commit 9158ca99f740d5b1b50d233e0f64e61504dc6fdf Author: Martin Mares Date: Mon Nov 16 21:41:21 1998 +0000 Complain loudly if the logging buffer would overflow. commit 53a416d376a16b2091dce898a16600b0cd27c348 Author: Martin Mares Date: Mon Nov 16 21:40:35 1998 +0000 Implemented snprintf and similar functions. It took a lot of thinking, but the modifications were relatively simple and straightforward. commit c3e9b2ab2448bce4a6fe6a5be9c8de8beecc8e17 Author: Pavel Machek Date: Mon Oct 26 15:35:19 1998 +0000 RIP now includes notion of interface, and is correctly talking to itself on second host. Split horizont is broken. commit dafd580ed94f38c95a84d8d00d3a57c7c194d6db Author: Martin Mares Date: Mon Oct 26 15:24:32 1998 +0000 Previous fix was wrong. commit db6984c43c47bfb549394f6571f024df301b19ee Author: Martin Mares Date: Mon Oct 26 15:01:04 1998 +0000 rte_update: Doesn't loop forever when multiple routes point to the same destination. commit dc7c7494e372febc44ae7d1f4ed618a6fe8bf45e Author: Pavel Machek Date: Tue Oct 20 16:45:53 1998 +0000 RIP _NOW_ actually talks to itself (workaround core bug: send data from other port than we receive at), few FIXME's added. commit 756b86dea31f2b94b1fbc1d95098f1a177b2817e Author: Martin Mares Date: Tue Oct 20 16:39:04 1998 +0000 Learn static device routes from the kernel (temporary until we can make such things configurable). commit feb6abe009aa13b3cd0ce22e6333163fb7561c16 Author: Pavel Machek Date: Tue Oct 20 16:12:43 1998 +0000 RIP now actually talks to itself. commit 8ca8683c705c76dc155521204ef098e6fe547696 Author: Martin Mares Date: Tue Oct 20 15:47:02 1998 +0000 Beware the NULL route, my son... The bugs that bite, the BIRDs that crash :-) commit acc62f5e1d4a100ec0be5c73e928a041aa9a4f9d Author: Martin Mares Date: Tue Oct 20 15:17:38 1998 +0000 Insert/remove hooks return void, not int. commit a0762910a62085d875b5bf5e1494c4fdde6f603f Author: Martin Mares Date: Tue Oct 20 15:13:18 1998 +0000 Added pointer to network to RTE. The complications with passing NET separately aren't worth 4 bytes per RTE. rte_discard and rte_dump don't need net * as parameter. commit b6903c948b2325f11cfb07f2df0590708920b987 Author: Martin Mares Date: Mon Oct 19 18:18:12 1998 +0000 Updated TODO. commit 7d8329078066b5682a0330b20dbdf74c7a01cbac Author: Martin Mares Date: Mon Oct 19 18:13:36 1998 +0000 Generate router_id automatically if possible (standard "smallest of local regular interface addresses" rule). Protocols should NOT rely on router_id existence -- when router ID is not available, the router_id variable is set to zero and protocols requiring valid router ID should just refuse to start, reporting such error to the log. commit 08045252553478457f923a9f941675df9992f507 Author: Martin Mares Date: Mon Oct 19 17:52:29 1998 +0000 Basic kernel routing table syncing implemented. Learning of routes installed by other programs or the kernel itself is not supported yet, but it's not needed for development of other protocols. commit 567e6c62208d3bb05b58b8ed08c2be29d6542f2b Author: Martin Mares Date: Mon Oct 19 17:48:45 1998 +0000 Use (SOCK_DGRAM,IPPROTO_IP) socket instead of (SOCK_STREAM,IPPROTO_TCP). This is exactly what Linux ifconfig does and seems to be the preferred way. commit 4cf45766bac4b1e3f5196f7e36d012cb7c010dc1 Author: Martin Mares Date: Mon Oct 19 17:47:50 1998 +0000 Exporting fill_in_sockaddr() for use by other unix-dependent code. commit 36f2caf147fb80e2b3db59d367e07f5d143f3710 Author: Martin Mares Date: Mon Oct 19 17:46:45 1998 +0000 Fixed generation of device routes for unnumbered point-to-point links. commit f184ea6f7e1233403d06fa4615cb9f27f9d9a839 Author: Martin Mares Date: Mon Oct 19 17:45:29 1998 +0000 Proto struct now contain (down | starting | up) state. commit 16a8ba30a97d82f8e43385d1a9b116fdb16746a8 Author: Martin Mares Date: Sun Oct 18 22:25:56 1998 +0000 We parse /proc/net/route and flag RT entries according to it. More to come today in the morning... commit 4c45595e3bb9f0b605e3102742831dad8915b309 Author: Martin Mares Date: Sun Oct 18 22:24:41 1998 +0000 o FIB flags now available for FIB users. o struct network: FIB flags used for kernel syncing. o struct network: `next' field deleted (historical relic). commit ab3a76a382745e0195b213c6d87ddc0e3cabd690 Author: Martin Mares Date: Sun Oct 18 22:22:28 1998 +0000 Added ipa_from_u32 and ipa_from_u32 for use in the kernel sync code (IPv4 only). Don't ever think of using it in routing protocols. commit 7e7790c61f14dff300d7c5464fdd47e4c15a0731 Author: Martin Mares Date: Sun Oct 18 12:50:43 1998 +0000 Since almost every UNIX system requires different techniques for reading the kernel routing table as opposed to modifying it which is approximately the same on non-netlink systems, I've split the kernel routing table routines to read and write parts. To be implemented later ;-) commit 8b1688177b2b3c6a3740f792997f3057b9bff0da Author: Martin Mares Date: Sun Oct 18 12:48:15 1998 +0000 * Please distinguish between DGB() and debug(). commit 3629bcf0c7ff8ccc56baabc4769f90635d1a7864 Author: Martin Mares Date: Sun Oct 18 12:26:02 1998 +0000 Preconfig, postconfig and init hooks can be NULL. commit 0432c0173bb4d234e8ba8e4afea0a8e708e119d8 Author: Martin Mares Date: Sun Oct 18 11:53:21 1998 +0000 Split protocol init to building of protocol list and real protocol init. Added kernel route table syncer skeleton. commit 05e56feb57b8e313a2328dbe82e2c2a70ff5115a Author: Martin Mares Date: Sun Oct 18 11:50:36 1998 +0000 Removed global pointer to proto_dev. commit 5b22683d2f27fcc5954cc9d4d58e55e539414d53 Author: Martin Mares Date: Sun Oct 18 11:13:16 1998 +0000 After contemplating about RIP route timeouts for a long time, I've implemented protocol callbacks for route insertion and deletion from the central table. RIP should maintain its own per-protocol queue of existing routes, scan it periodically and call rte_discard() for routes that have timed out. commit 570ce189d77fc40841e8e9f8f86ea3c3840aa450 Author: Martin Mares Date: Sun Oct 18 10:49:46 1998 +0000 Implemented `route last modified' time. commit 2a900b1b1565d778f19c10b087aea558f067bba7 Author: Martin Mares Date: Sat Oct 17 11:26:28 1998 +0000 Fixed misleading comment. commit 7f3d198df118dc218bb2049f1cc0597ec62864bc Author: Martin Mares Date: Sat Oct 17 11:24:13 1998 +0000 Each protocol now hears even its own routes and needs to make its own loop detection. This is needed since both RIP and OSPF handle multiple neighbors and they need to redistribute routes learned from each neighbor to the remaining ones. commit 47b793064c25c8adcab48cacc018be1675f2448a Author: Martin Mares Date: Sat Oct 17 11:05:18 1998 +0000 Solve chicken-and-egg problems with protocol startup. We now queue all inactive protocols and don't send route/interface updates to them and when they come up, we resend the whole route/interface tables privately. Removed the "scan interface list after protocol start" work-around. commit d92882be9b1bfcc1a8e8a7bd552bdec4831694aa Author: Martin Mares Date: Sat Oct 17 11:02:39 1998 +0000 WALK_LIST_DELSAFE now actually works (it really couldn't since it didn't reference list head at all). commit c05ea56f8eb15dfe3c9d18496deaa926e0cf8aac Author: Pavel Machek Date: Sat Oct 17 10:25:22 1998 +0000 rip should now correctly listen, but entries will not time out. commit 8333431c4d0d7dcf065938e21440b4ce20cb8f8f Author: Pavel Machek Date: Thu Oct 15 15:12:24 1998 +0000 Rip: rip_rta_same added. commit 93f1c532e99cddb5575075313c0707bcd4758f07 Author: Martin Mares Date: Wed Oct 14 13:38:17 1998 +0000 Moved scanning of interfaces, so that they get initialized after all routing protocol instances. commit cf3934c5691ec4a00d54b863576916f9a1dd1f1a Author: Pavel Machek Date: Wed Oct 14 13:27:53 1998 +0000 Lists: unneccessary test killed, make code friendly to non-gcc. commit c93214d442644c9667d69f904d57aef6b4ddd47e Author: Martin Mares Date: Tue Oct 13 19:57:33 1998 +0000 o There are cases when SIOCGIFINDEX is defined, but it doesn't work. When this happens, don't reject the whole interface, just mark it as index 0. o Removed Pavel's comment about EFAULT and SIGSEGV. EFAULT is a valid return code for cases where the buffer is too small. o Commented out the smart interface list size logic temporarily as it seems Linux 2.0 SIOCGIFCONF doesn't react to ifc_req==NULL sanely. Replaced it by exponential stepping. commit fdf33cde1cd14a2a0215d6d459489e258fe20789 Author: Pavel Machek Date: Tue Oct 13 14:59:46 1998 +0000 Strange, on atrey ioctl() does not fill structure, and bird segfaults on it. Now we "only" die(). commit 21580e304f612b276a90d2a90f4fb86569609255 Author: Pavel Machek Date: Tue Oct 13 14:32:18 1998 +0000 I prefer to have broken drivers than completely stupid ones... Linus Torvalds Rip now uses main routing table properly: entries are stored directly into main routing table and we are relying on core to call our's compare. That unfortunately broke garbage collecting (and probably many more things). It compiles. commit 1d941de47a90fb9ca39d7acf6aa396447d1fc7df Author: Pavel Machek Date: Wed Oct 7 19:33:50 1998 +0000 RIP now somehow listens to main routing table (dont expect it to work) commit 8c43696da0c0680820aa949da35e823e68162788 Author: Martin Mares Date: Mon Aug 31 21:13:42 1998 +0000 Route update hook now gets network prefix as well as updated route attributes. commit bf65d27deaa0bacd801ec06a3257dda03a53fee2 Author: Pavel Machek Date: Thu Jul 30 07:43:45 1998 +0000 Bird's info are now understood by ripquery. commit 279f4c7b7b2ebe13793649f191040042a8c4c014 Author: Pavel Machek Date: Tue Jul 28 21:44:11 1998 +0000 Rip now includes code to reply, but it is currently broken. commit 48b41d58112737f87f1217414291e61f5430f611 Author: Pavel Machek Date: Tue Jul 28 21:42:08 1998 +0000 Do not segfault on iface == NULL. commit a872b0f7dae38cfef574d0d3b30609e968cdf95b Author: Pavel Machek Date: Mon Jul 20 20:05:40 1998 +0000 Reversed buggy patch. commit c25e90efed6bc76d05370403839640ed05017506 Author: Martin Mares Date: Wed Jul 15 19:42:23 1998 +0000 Added comment explaining `now'. commit 1be52eea5777f082b02e0f484620e692017b16a2 Author: Martin Mares Date: Fri Jul 10 08:39:34 1998 +0000 Removed format specification attributes for log() and debug() until GCC is fixed to handle custom formats. commit 786d0bb9e7c5db5104e3fd0ff7fdfbd1e19844ea Author: Martin Mares Date: Fri Jul 10 08:38:29 1998 +0000 Added ipa_class_mask() which guesses netmask for classful addressing. For pure A/B/C class addresses it just returns the class netmask, for subnets it tries to guess subnet mask. Please make sure the address you pass to this function is really a valid host address (i.e., call ipa_validate() first). commit 28a9a189d71ef3b05daa21d60277149edb8e98ad Author: Martin Mares Date: Fri Jul 10 08:32:18 1998 +0000 Replaced remaining references of clock_t by bird_clock_t. commit a103373f6147f27e4ac71e5903563e57ce52902c Author: Pavel Machek Date: Thu Jul 9 19:39:04 1998 +0000 Commiting RIP. RIP should somehow listen, will not reply. I needed to commit it so that whole thing compiles. commit 86b0023033a25cdc6ab5480e03893f516184a2a5 Author: Pavel Machek Date: Thu Jul 9 19:37:39 1998 +0000 Making SIGUSR1 dump also all protocols. commit 87d2be86e5f8af0e2f01e7fb711bd282e29e376b Author: Pavel Machek Date: Thu Jul 9 19:36:52 1998 +0000 Adding proto_dump_all() function commit cf3527e2f4f1f4009fa332e6284b8904c24d0d43 Author: Pavel Machek Date: Thu Jul 9 19:36:05 1998 +0000 Adding MIN()/MAX() macros commit aea2dcabdc4ed80172ac8d4f5c4d31bc8607d1e7 Author: Pavel Machek Date: Thu Jul 9 19:35:23 1998 +0000 Adding walk list which permits you to delete entries. commit 962ba482fd7bba97cf13a96105503efff4dcb88a Author: Martin Mares Date: Wed Jun 17 14:36:02 1998 +0000 Use '%I' instead of dirty address printing hacks. commit d997534f65903e8078efe2f8ceb19941692598f7 Author: Martin Mares Date: Wed Jun 17 14:34:13 1998 +0000 Oops, forgot '%m'... commit 9556f225853748d5fee9a21e179b8fd5da2d3c42 Author: Martin Mares Date: Wed Jun 17 14:33:29 1998 +0000 debug() and log() use the new printf. Feel free to use new formatting sequences for all output. commit ecacdfa434acf8af38ed8c1c0c8e71dab400b0f4 Author: Martin Mares Date: Wed Jun 17 14:31:36 1998 +0000 Added local version of sprintf (bsprintf and bvsprintf) offering few new format strings: %I IP address %#I IP address in hexadecimal %1I IP address padded to full length %m strerror(errno) commit 97d858c590998786d4d8a16b5c1f657800d74736 Author: Martin Mares Date: Wed Jun 17 14:28:46 1998 +0000 ip_ntop() and ip_ntox() for IPv4. commit 6b5e06abb57528a091fd171dff379634fa7c4dad Author: Martin Mares Date: Wed Jun 17 14:26:30 1998 +0000 Added function for converting of IP addresses to printable form. commit 620a355a15d65a8a2980f98b2de3e7d04c3dab62 Author: Martin Mares Date: Thu Jun 4 20:30:11 1998 +0000 Now sending IF_CHANGE_CREATE when a new interface appears and IF_CHANGE_UP only if it's really up. commit 236d4eb8ce5dc894e97bcf1f561186d41c361cea Author: Martin Mares Date: Thu Jun 4 20:29:44 1998 +0000 FIB_WALK and friends are now slightly more friendly. commit 66e53309acceb0fd7e56faf54e1cc733a5477c67 Author: Martin Mares Date: Thu Jun 4 20:29:05 1998 +0000 Dumping of _static_ attributes implemented. commit b1e4f81485c15bacfff6040a1295bee31479a875 Author: Martin Mares Date: Thu Jun 4 20:28:43 1998 +0000 We have full interface routes now. commit 0cdbd3975a1ebc5e6705d23ed90388269c24b42e Author: Martin Mares Date: Thu Jun 4 20:28:19 1998 +0000 Handle route deletion without segfaults. A bit more debug dumps. commit 5331da6a4d0c77e70d134fa40b5061b00ab593b0 Author: Martin Mares Date: Thu Jun 4 20:27:49 1998 +0000 Fixed processing of timers. commit fd50083df499dd7aa4dd3eec97171003da300250 Author: Martin Mares Date: Wed Jun 3 08:43:44 1998 +0000 Killed socket debug code. Initialize config pool and protocols. More to come later... commit c5ffa447598bc24cf1b674553bc4d3cc80a831d1 Author: Martin Mares Date: Wed Jun 3 08:42:16 1998 +0000 Skeleton of device route protocol. As it's tightly coupled with our kernel, it sits here instead of `proto/dev'. commit d9f330c5ffe03c05b7e6541a06adac657f24407b Author: Martin Mares Date: Wed Jun 3 08:40:10 1998 +0000 Protocol hooks. All of them may be NULL. commit 7f4a39886c128bfc2e39987180eb1482ee04d553 Author: Martin Mares Date: Wed Jun 3 08:38:53 1998 +0000 Basic protocol operations. commit a5f1a60e0254871c3285aabde372f5a6790c19c3 Author: Martin Mares Date: Wed Jun 3 08:38:06 1998 +0000 Changed protocol declarations a bit. commit 33beab4f6c7904204a5116b4eb4cbed5f859f24a Author: Martin Mares Date: Wed Jun 3 08:36:34 1998 +0000 Added configuration pool. commit c5fd704e48333fb8e690d78a3be1303f6c2638c7 Author: Martin Mares Date: Wed Jun 3 08:35:40 1998 +0000 Protocols will reside in directory `proto'. commit 869c695998f0bc3b80d8500d88a53fb169c21bc1 Author: Martin Mares Date: Mon Jun 1 21:41:32 1998 +0000 Synced to new interface code. commit 4cc78c5082344f0d237a5cdfb05e53dfd04ffd8b Author: Martin Mares Date: Mon Jun 1 21:41:11 1998 +0000 - Rewrote whole interface logic. Removed support for multiple addresses per interface since it makes much trouble everywhere. Instead, we understand secondary addresses as subinterfaces. - In case interface addresses or basic flags change, we simply convert it to a down/up sequence. - Implemented the universal neighbour cache. (Just forget what did previous includes say of neighbour caching, this one is brand new.) commit 0fe3b28b68f10a32f3fe43e8221559a72be5ca28 Author: Martin Mares Date: Mon Jun 1 21:36:58 1998 +0000 Added ipa_xor() and ipa_in_net(). commit af847acc27978cf48721aafbacab70e48f42ede7 Author: Martin Mares Date: Tue May 26 21:46:38 1998 +0000 Whee, multicast sockets work! Implemented recurrent timers. commit 140f03410500420a4b44e62a98896a29c99a2b00 Author: Martin Mares Date: Tue May 26 21:44:54 1998 +0000 Added CONFIG_AUTO_ROUTES (automatic device route creation) and CONFIG_ALL_MULTICAST (all interfaces capable of multicasting, not depending on IFF_MULTICAST flag). commit fe82105e5dc2077c16da802f721160443e0c6fc2 Author: Martin Mares Date: Tue May 26 21:43:45 1998 +0000 Debug messages. commit 8a48ecb8b15e827f779d4b9fb080dff280b99872 Author: Martin Mares Date: Tue May 26 21:42:05 1998 +0000 Implemented scanning of network interfaces. Mostly very ugly code due to terrible kernel interface (SIOGIFCONF and friends). commit b1487ee909ebd4cfc59f30d3678cb6667d4a72c8 Author: Martin Mares Date: Tue May 26 21:38:06 1998 +0000 Added generic functions for unaligned data access. commit ed68a5c6a4da7050995934adb07612dea1cf6644 Author: Martin Mares Date: Tue May 26 21:37:37 1998 +0000 Resource pools are now named. commit d5417b379f05541418fb4f1ac87100ba8106b0c6 Author: Martin Mares Date: Tue May 26 21:36:48 1998 +0000 Added ipa_opposite(). commit 5222c46ceb8035f2292c3a91f6ee85fbbed82c5e Author: Martin Mares Date: Tue May 26 21:36:17 1998 +0000 DBG now calls debug() instead of sending it to log(). commit d804db0dabf944495071fe6b62a9d836f78997af Author: Martin Mares Date: Sun May 24 15:00:48 1998 +0000 Added few socket declarations. commit b5d9ee5c878b41ffbc138be171d700992e9d78c7 Author: Martin Mares Date: Sun May 24 14:50:18 1998 +0000 Added UNIX implementation of both timers and sockets. Timers should work, sockets were tested only in TCP mode. main.c now contains some test cases for socket code. commit 6d45cf21be3f979ba4e8a1a5f557663618fadfb3 Author: Martin Mares Date: Sun May 24 14:49:14 1998 +0000 Added debug dump function, but it's still empty :( commit ded3ee6dddae06c1cabc3a2d34e3139eb0eb338f Author: Martin Mares Date: Sun May 24 14:48:52 1998 +0000 protos_init, not proto_init. commit b53499cdaa21994f5d92afed23fdf85c2b7fe134 Author: Martin Mares Date: Sun May 24 14:48:09 1998 +0000 Added interface index (used only by OS-dependent code since ifindexes itself are OS-dependent). commit d4bc8dc00037e868771fb259a1e7b9ae5e92ed5a Author: Martin Mares Date: Sun May 24 14:46:20 1998 +0000 Staticized some variables and functions. commit 315aba32b3c5744a040331d653218d15a55455a5 Author: Martin Mares Date: Sun May 24 14:44:25 1998 +0000 Fixed path to includes. commit a2ccbb0b97c1eac3a68f01b7786822a66aaaefa2 Author: Martin Mares Date: Sun May 24 14:40:29 1998 +0000 Implemented timers. Using bird_clock_t for absolute time from now... commit 235562ca5ac1db2e2ea026bff42c8c2a898b44db Author: Martin Mares Date: Sun May 24 09:20:59 1998 +0000 Point-to-point links: added address of the opposite end. commit 480effedac0ae45a4f01ce32bac962db08ba5a3d Author: Martin Mares Date: Sun May 24 09:19:26 1998 +0000 Added declarations of all our socket functions. commit 2326b001d6f28e69b88c3c19795d8c0999f07db1 Author: Martin Mares Date: Wed May 20 11:54:33 1998 +0000 Added routing table and routing attribute code. commit 3994080eb1a86f085498bee1f36cbdb52b30191d Author: Martin Mares Date: Fri May 15 13:43:59 1998 +0000 Fixed path to includes. commit 25697773b529d80278679978b7416ca9c87e15e9 Author: Martin Mares Date: Fri May 15 07:56:13 1998 +0000 The library is now glued together from generic and OS-dependent parts by the `mergedirs' script. Few more IP address manipulation functions and some fixes. commit 62aa008abd627c6862310daf65ffd337a920bdbb Author: Martin Mares Date: Fri May 15 07:54:32 1998 +0000 Parts of routing table code. Data structure declarations should be complete now. commit 18c8241a91bd9208879666f1a1a13f454e66d75b Author: Martin Mares Date: Sun May 3 16:43:39 1998 +0000 BIRD library: The story continues. Complete resource manages and IP address handling. commit a8b6038225d18155883e330c96b2bc2e44153e1e Author: Martin Mares Date: Sun May 3 16:42:45 1998 +0000 Next attempt on data structures... commit 6032aa6ade49545d7c8b6025cf6e6373eb7c910c Author: Martin Mares Date: Sun May 3 16:42:08 1998 +0000 Added new subdir for UNIX-dependent files. Now contains only functions for logging, but it will change soon. commit 1feea03e7463d8eaeb00d5df6c2cd3e8e20f2bcd Author: Martin Mares Date: Tue Apr 28 14:39:34 1998 +0000 Changed #include to #include "x/y" for our local includes, so that gcc -MM can be used to separate them from the system ones. Added automatic generation of dependencies. commit c40e05a0dffa33a8724e56121a2b6dcdfa9183e0 Author: Martin Mares Date: Thu Apr 23 14:01:15 1998 +0000 Added IP address manipulation macros, interface declarations and logging. commit 481f69854a788bd2bea5c6938e038ec6e21c491b Author: Martin Mares Date: Thu Apr 23 08:09:39 1998 +0000 Added few route attributes. commit 58ef912c6babf1866193ab04674a5866dd761f13 Author: Martin Mares Date: Wed Apr 22 12:58:34 1998 +0000 First look at data structures. More to come tomorrow... commit b60f7489148d021cb541414b8788f795ec4378fa Author: Martin Mares Date: Fri Mar 20 18:30:55 1998 +0000 Added banner presented to KSVI. bird-1.6.3/aclocal.m40000644000103200001440000001047513027054563013301 0ustar feelausersdnl ** Additional Autoconf tests for BIRD configure script dnl ** (c) 1999 Martin Mares AC_DEFUN(BIRD_CHECK_INTEGERS, [AC_CHECK_SIZEOF(char, 0) AC_CHECK_SIZEOF(short int, 0) AC_CHECK_SIZEOF(int, 0) AC_CHECK_SIZEOF(long int, 0) AC_CHECK_SIZEOF(long long int, 0) for size in 1 2 4 8; do bits=`expr $size "*" 8` AC_MSG_CHECKING([for $bits-bit type]) if test $ac_cv_sizeof_int = $size ; then res=int elif test $ac_cv_sizeof_char = $size ; then res=char elif test $ac_cv_sizeof_short_int = $size ; then res="short int" elif test $ac_cv_sizeof_long_int = $size ; then res="long int" elif test $ac_cv_sizeof_long_long_int = $size ; then res="long long int" else AC_MSG_RESULT([not found]) AC_MSG_ERROR([Cannot find $bits-bit integer type.]) fi AC_MSG_RESULT($res) AC_DEFINE_UNQUOTED(INTEGER_$bits, $res) done ]) dnl BIRD_CHECK_ENDIAN is unused and obsolete AC_DEFUN(BIRD_CHECK_ENDIAN, [AC_CACHE_CHECK([CPU endianity], bird_cv_c_endian,[ AC_TRY_RUN([ #include unsigned int x = 0x12345678; unsigned char *z = (unsigned char *) &x; int main(void) { FILE *f = fopen("conftestresult", "w"); if (!f) return 10; fprintf(f, "%02x %02x %02x %02x", *z, *(z+1), *(z+2), *(z+3)); fclose(f); exit(0); } ],[ endian=`cat conftestresult` if test "$endian" = "12 34 56 78" ; then bird_cv_c_endian=big-endian elif test "$endian" = "78 56 34 12" ; then bird_cv_c_endian=little-endian fi ],[endian="test program failed"],[endian="not available, we're cross compiling"]) if test -z "$bird_cv_c_endian" ; then AC_MSG_RESULT($endian) AC_MSG_ERROR([Cannot determine CPU endianity.]) fi ]) case $bird_cv_c_endian in big-endian) AC_DEFINE(CPU_BIG_ENDIAN) ;; little-endian) AC_DEFINE(CPU_LITTLE_ENDIAN) ;; esac ]) AC_DEFUN(BIRD_CHECK_STRUCT_ALIGN, [AC_CACHE_CHECK([usual alignment of structures],bird_cv_c_struct_align,[ AC_TRY_RUN([ #include struct { char x; long int y; } ary[2]; int main(void) { FILE *f = fopen("conftestresult", "w"); if (!f) return 10; fprintf(f, "%d", sizeof(ary)/2); fclose(f); exit(0); } ],[ bird_cv_c_struct_align=`cat conftestresult` ],[ AC_MSG_RESULT([test program failed]) AC_MSG_ERROR([Cannot determine structure alignment]) ],[bird_cv_c_struct_align=16]) ]) AC_DEFINE_UNQUOTED(CPU_STRUCT_ALIGN, $bird_cv_c_struct_align) ]) AC_DEFUN(BIRD_CHECK_TIME_T, [AC_CACHE_CHECK([characteristics of time_t], bird_cv_type_time_t, [ AC_TRY_RUN([ #include #include #include int main(void) { FILE *f = fopen("conftestresult", "w"); if (!f) return 10; fprintf(f, "%d-bit ", sizeof(time_t)*CHAR_BIT); if ((time_t) -1 > 0) fprintf(f, "un"); fprintf(f, "signed"); fclose(f); exit(0); } ],[bird_cv_type_time_t=`cat conftestresult` ],[ AC_MSG_RESULT([test program failed]) AC_MSG_ERROR([Cannot determine time_t size and signedness.]) ],[bird_cv_type_time_t="32-bit signed"]) ]) case "$bird_cv_type_time_t" in *64-bit*) AC_DEFINE(TIME_T_IS_64BIT) ;; esac case "$bird_cv_type_time_t" in *unsigned*) ;; *) AC_DEFINE(TIME_T_IS_SIGNED) ;; esac ]) AC_DEFUN(BIRD_CHECK_STRUCT_IP_MREQN, [AC_CACHE_CHECK([for struct ip_mreqn], bird_cv_struct_ip_mreqn,[ AC_TRY_COMPILE([#include ],[struct ip_mreqn x; ],[bird_cv_struct_ip_mreqn=yes ],[bird_cv_struct_ip_mreqn=no ])]) if test "$bird_cv_struct_ip_mreqn" = yes ; then AC_DEFINE(HAVE_STRUCT_IP_MREQN) fi ]) AC_DEFUN(BIRD_CHECK_PTHREADS, [ bird_tmp_cflags="$CFLAGS" CFLAGS="$CFLAGS -pthread" AC_CACHE_CHECK([whether POSIX threads are available], bird_cv_lib_pthreads, [AC_LINK_IFELSE([AC_LANG_PROGRAM([[#include ]], [[pthread_t pt; pthread_create(&pt, NULL, NULL, NULL); pthread_spinlock_t lock; pthread_spin_lock(&lock); ]])], [bird_cv_lib_pthreads=yes], [bird_cv_lib_pthreads=no])]) CFLAGS="$bird_tmp_cflags" ]) AC_DEFUN(BIRD_CHECK_GCC_OPTION, [ bird_tmp_cflags="$CFLAGS" CFLAGS="$3 $2" AC_CACHE_CHECK([whether CC supports $2], $1, [AC_COMPILE_IFELSE([AC_LANG_PROGRAM([])], [$1=yes], [$1=no])]) CFLAGS="$bird_tmp_cflags" ]) AC_DEFUN(BIRD_ADD_GCC_OPTION, [ if test "$$1" = yes ; then CFLAGS="$CFLAGS $2" fi ]) # BIRD_CHECK_PROG_FLAVOR_GNU(PROGRAM-PATH, IF-SUCCESS, [IF-FAILURE]) # copied autoconf internal _AC_PATH_PROG_FLAVOR_GNU m4_define([BIRD_CHECK_PROG_FLAVOR_GNU], [# Check for GNU $1 case `"$1" --version 2>&1` in *GNU*) $2;; m4_ifval([$3], [*) $3;; ])esac ])# bird-1.6.3/tools/0000755000103200001440000000000013027054563012572 5ustar feelausersbird-1.6.3/tools/config.sub0000755000103200001440000010224013027054563014554 0ustar feelausers#! /bin/sh # Configuration validation subroutine script. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 # Free Software Foundation, Inc. timestamp='2009-04-17' # This file is (in principle) common to ALL GNU software. # The presence of a machine in this file suggests that SOME GNU software # can handle that machine. It does not imply ALL GNU software can. # # This file is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA # 02110-1301, USA. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] CPU-MFR-OPSYS $0 [OPTION] ALIAS Canonicalize a configuration name. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.sub ($timestamp) Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" exit 1 ;; *local*) # First pass through any local machine types. echo $1 exit ;; * ) break ;; esac done case $# in 0) echo "$me: missing argument$help" >&2 exit 1;; 1) ;; *) echo "$me: too many arguments$help" >&2 exit 1;; esac # Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). # Here we must recognize all the valid KERNEL-OS combinations. maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in nto-qnx* | linux-gnu* | linux-dietlibc | linux-newlib* | linux-uclibc* | \ uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | knetbsd*-gnu* | netbsd*-gnu* | \ kopensolaris*-gnu* | \ storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; *) basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ;; esac ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -apple | -axis | -knuth | -cray) os= basic_machine=$1 ;; -sim | -cisco | -oki | -wec | -winbond) os= basic_machine=$1 ;; -scout) ;; -wrs) os=-vxworks basic_machine=$1 ;; -chorusos*) os=-chorusos basic_machine=$1 ;; -chorusrdb) os=-chorusrdb basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco6) os=-sco5v6 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5) os=-sco3.2v5 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5v6*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -udk*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -lynx*) os=-lynxos ;; -ptx*) basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; -psos*) os=-psos ;; -mint | -mint[0-9]*) basic_machine=m68k-atari os=-mint ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. 1750a | 580 \ | a29k \ | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ | am33_2.0 \ | arc | arm | arm[bl]e | arme[lb] | armv[2345] | armv[345][lb] | avr | avr32 \ | bfin \ | c4x | clipper \ | d10v | d30v | dlx | dsp16xx \ | fido | fr30 | frv \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | i370 | i860 | i960 | ia64 \ | ip2k | iq2000 \ | lm32 \ | m32c | m32r | m32rle | m68000 | m68k | m88k \ | maxq | mb | microblaze | mcore | mep | metag \ | mips | mipsbe | mipseb | mipsel | mipsle \ | mips16 \ | mips64 | mips64el \ | mips64octeon | mips64octeonel \ | mips64orion | mips64orionel \ | mips64r5900 | mips64r5900el \ | mips64vr | mips64vrel \ | mips64vr4100 | mips64vr4100el \ | mips64vr4300 | mips64vr4300el \ | mips64vr5000 | mips64vr5000el \ | mips64vr5900 | mips64vr5900el \ | mipsisa32 | mipsisa32el \ | mipsisa32r2 | mipsisa32r2el \ | mipsisa64 | mipsisa64el \ | mipsisa64r2 | mipsisa64r2el \ | mipsisa64sb1 | mipsisa64sb1el \ | mipsisa64sr71k | mipsisa64sr71kel \ | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ | moxie \ | mt \ | msp430 \ | nios | nios2 \ | ns16k | ns32k \ | or32 \ | pdp10 | pdp11 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle | ppcbe \ | pyramid \ | score \ | sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \ | sparcv8 | sparcv9 | sparcv9b | sparcv9v \ | spu | strongarm \ | tahoe | thumb | tic4x | tic80 | tron \ | v850 | v850e \ | we32k \ | x86 | xc16x | xscale | xscalee[bl] | xstormy16 | xtensa \ | z8k | z80) basic_machine=$basic_machine-unknown ;; m6811 | m68hc11 | m6812 | m68hc12) # Motorola 68HC11/12. basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) ;; ms1) basic_machine=mt-unknown ;; # We use `pc' rather than `unknown' # because (1) that's what they normally are, and # (2) the word "unknown" tends to confuse beginning users. i*86 | x86_64) basic_machine=$basic_machine-pc ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. 580-* \ | a29k-* \ | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ | alphapca5[67]-* | alpha64pca5[67]-* | arc-* \ | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ | avr-* | avr32-* \ | bfin-* | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* | c54x-* | c55x-* | c6x-* \ | clipper-* | craynv-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | elxsi-* \ | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | i*86-* | i860-* | i960-* | ia64-* \ | ip2k-* | iq2000-* \ | lm32-* \ | m32c-* | m32r-* | m32rle-* \ | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ | m88110-* | m88k-* | maxq-* | mcore-* | metag-* \ | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ | mips16-* \ | mips64-* | mips64el-* \ | mips64octeon-* | mips64octeonel-* \ | mips64orion-* | mips64orionel-* \ | mips64r5900-* | mips64r5900el-* \ | mips64vr-* | mips64vrel-* \ | mips64vr4100-* | mips64vr4100el-* \ | mips64vr4300-* | mips64vr4300el-* \ | mips64vr5000-* | mips64vr5000el-* \ | mips64vr5900-* | mips64vr5900el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64r2-* | mipsisa64r2el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ | mipstx39-* | mipstx39el-* \ | mmix-* \ | mt-* \ | msp430-* \ | nios-* | nios2-* \ | none-* | np1-* | ns16k-* | ns32k-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* | ppcbe-* \ | pyramid-* \ | romp-* | rs6000-* \ | sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \ | sparclite-* \ | sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | strongarm-* | sv1-* | sx?-* \ | tahoe-* | thumb-* \ | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* | tile-* \ | tron-* \ | v850-* | v850e-* | vax-* \ | we32k-* \ | x86-* | x86_64-* | xc16x-* | xps100-* | xscale-* | xscalee[bl]-* \ | xstormy16-* | xtensa*-* \ | ymp-* \ | z8k-* | z80-*) ;; # Recognize the basic CPU types without company name, with glob match. xtensa*) basic_machine=$basic_machine-unknown ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 386bsd) basic_machine=i386-unknown os=-bsd ;; 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; a29khif) basic_machine=a29k-amd os=-udi ;; abacus) basic_machine=abacus-unknown ;; adobe68k) basic_machine=m68010-adobe os=-scout ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amd64) basic_machine=x86_64-pc ;; amd64-*) basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-unknown ;; amigaos | amigados) basic_machine=m68k-unknown os=-amigaos ;; amigaunix | amix) basic_machine=m68k-unknown os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; apollo68bsd) basic_machine=m68k-apollo os=-bsd ;; aros) basic_machine=i386-pc os=-aros ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; blackfin) basic_machine=bfin-unknown os=-linux ;; blackfin-*) basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; c90) basic_machine=c90-cray os=-unicos ;; cegcc) basic_machine=arm-unknown os=-cegcc ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | j90) basic_machine=j90-cray os=-unicos ;; craynv) basic_machine=craynv-cray os=-unicosmp ;; cr16) basic_machine=cr16-unknown os=-elf ;; crds | unos) basic_machine=m68k-crds ;; crisv32 | crisv32-* | etraxfs*) basic_machine=crisv32-axis ;; cris | cris-* | etrax*) basic_machine=cris-axis ;; crx) basic_machine=crx-unknown os=-elf ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; decsystem10* | dec10*) basic_machine=pdp10-dec os=-tops10 ;; decsystem20* | dec20*) basic_machine=pdp10-dec os=-tops20 ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; dicos) basic_machine=i686-pc os=-dicos ;; djgpp) basic_machine=i586-pc os=-msdosdjgpp ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; es1800 | OSE68k | ose68k | ose | OSE) basic_machine=m68k-ericsson os=-ose ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; go32) basic_machine=i386-pc os=-go32 ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; h8300xray) basic_machine=h8300-hitachi os=-xray ;; h8500hms) basic_machine=h8500-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp3k9[0-9][0-9] | hp9[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k6[0-9][0-9] | hp6[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k7[0-79][0-9] | hp7[0-79][0-9]) basic_machine=hppa1.1-hp ;; hp9k78[0-9] | hp78[0-9]) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[0-9][13679] | hp8[0-9][13679]) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; hppa-next) os=-nextstep3 ;; hppaosf) basic_machine=hppa1.1-hp os=-osf ;; hppro) basic_machine=hppa1.1-hp os=-proelf ;; i370-ibm* | ibm*) basic_machine=i370-ibm ;; # I'm not sure what "Sysv32" means. Should this be sysv3.2? i*86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv32 ;; i*86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv4 ;; i*86v) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv ;; i*86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-solaris2 ;; i386mach) basic_machine=i386-mach os=-mach ;; i386-vsta | vsta) basic_machine=i386-unknown os=-vsta ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; m68knommu) basic_machine=m68k-unknown os=-linux ;; m68knommu-*) basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; mingw32) basic_machine=i386-pc os=-mingw32 ;; mingw32ce) basic_machine=arm-unknown os=-mingw32ce ;; miniframe) basic_machine=m68000-convergent ;; *mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*) basic_machine=m68k-atari os=-mint ;; mips3*-*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown ;; monitor) basic_machine=m68k-rom68k os=-coff ;; morphos) basic_machine=powerpc-unknown os=-morphos ;; msdos) basic_machine=i386-pc os=-msdos ;; ms1-*) basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'` ;; mvs) basic_machine=i370-ibm os=-mvs ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; netbsd386) basic_machine=i386-unknown os=-netbsd ;; netwinder) basic_machine=armv4l-rebel os=-linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; necv70) basic_machine=v70-nec os=-sysv ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; mon960) basic_machine=i960-intel os=-mon960 ;; nonstopux) basic_machine=mips-compaq os=-nonstopux ;; np1) basic_machine=np1-gould ;; nsr-tandem) basic_machine=nsr-tandem ;; op50n-* | op60c-*) basic_machine=hppa1.1-oki os=-proelf ;; openrisc | openrisc-*) basic_machine=or32-unknown ;; os400) basic_machine=powerpc-ibm os=-os400 ;; OSE68000 | ose68000) basic_machine=m68000-ericsson os=-ose ;; os68k) basic_machine=m68k-none os=-os68k ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; parisc) basic_machine=hppa-unknown os=-linux ;; parisc-*) basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pc98) basic_machine=i386-pc ;; pc98-*) basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium | p5 | k5 | k6 | nexgen | viac3) basic_machine=i586-pc ;; pentiumpro | p6 | 6x86 | athlon | athlon_*) basic_machine=i686-pc ;; pentiumii | pentium2 | pentiumiii | pentium3) basic_machine=i686-pc ;; pentium4) basic_machine=i786-pc ;; pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*) basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumpro-* | p6-* | 6x86-* | athlon-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium4-*) basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; power) basic_machine=power-ibm ;; ppc) basic_machine=powerpc-unknown ;; ppc-*) basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppcle | powerpclittle | ppc-le | powerpc-little) basic_machine=powerpcle-unknown ;; ppcle-* | powerpclittle-*) basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64) basic_machine=powerpc64-unknown ;; ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64le | powerpc64little | ppc64-le | powerpc64-little) basic_machine=powerpc64le-unknown ;; ppc64le-* | powerpc64little-*) basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ps2) basic_machine=i386-ibm ;; pw32) basic_machine=i586-unknown os=-pw32 ;; rdos) basic_machine=i386-pc os=-rdos ;; rom68k) basic_machine=m68k-rom68k os=-coff ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; s390 | s390-*) basic_machine=s390-ibm ;; s390x | s390x-*) basic_machine=s390x-ibm ;; sa29200) basic_machine=a29k-amd os=-udi ;; sb1) basic_machine=mipsisa64sb1-unknown ;; sb1el) basic_machine=mipsisa64sb1el-unknown ;; sde) basic_machine=mipsisa32-sde os=-elf ;; sei) basic_machine=mips-sei os=-seiux ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; sh5el) basic_machine=sh5le-unknown ;; sh64) basic_machine=sh64-unknown ;; sparclite-wrs | simso-wrs) basic_machine=sparclite-wrs os=-vxworks ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; st2000) basic_machine=m68k-tandem ;; stratus) basic_machine=i860-stratus os=-sysv4 ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) basic_machine=sparc-sun os=-solaris2 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; sv1) basic_machine=sv1-cray os=-unicos ;; symmetry) basic_machine=i386-sequent os=-dynix ;; t3e) basic_machine=alphaev5-cray os=-unicos ;; t90) basic_machine=t90-cray os=-unicos ;; tic54x | c54x*) basic_machine=tic54x-unknown os=-coff ;; tic55x | c55x*) basic_machine=tic55x-unknown os=-coff ;; tic6x | c6x*) basic_machine=tic6x-unknown os=-coff ;; tile*) basic_machine=tile-unknown os=-linux-gnu ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; toad1) basic_machine=pdp10-xkl os=-tops20 ;; tower | tower-32) basic_machine=m68k-ncr ;; tpf) basic_machine=s390x-ibm os=-tpf ;; udi29k) basic_machine=a29k-amd os=-udi ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; v810 | necv810) basic_machine=v810-nec os=-none ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vpp*|vx|vx-*) basic_machine=f301-fujitsu ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; vxworks29k) basic_machine=a29k-wrs os=-vxworks ;; w65*) basic_machine=w65-wdc os=-none ;; w89k-*) basic_machine=hppa1.1-winbond os=-proelf ;; xbox) basic_machine=i686-pc os=-mingw32 ;; xps | xps100) basic_machine=xps100-honeywell ;; ymp) basic_machine=ymp-cray os=-unicos ;; z8k-*-coff) basic_machine=z8k-unknown os=-sim ;; z80-*-coff) basic_machine=z80-unknown os=-sim ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. w89k) basic_machine=hppa1.1-winbond ;; op50n) basic_machine=hppa1.1-oki ;; op60c) basic_machine=hppa1.1-oki ;; romp) basic_machine=romp-ibm ;; mmix) basic_machine=mmix-knuth ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp10) # there are many clones, so DEC is not a safe bet basic_machine=pdp10-unknown ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; mac | mpw | mac-mpw) basic_machine=m68k-apple ;; pmac | pmac-mpw) basic_machine=powerpc-apple ;; *-unknown) # Make sure to match an already-canonicalized machine name. ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # First match some system type aliases # that might get confused with valid system types. # -solaris* is a basic system type, with this one exception. -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -svr4*) os=-sysv4 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # First accept the basic system types. # The portable systems comes first. # Each alternative MUST END IN A *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -*vms* | -sco* | -esix* | -isc* | -aix* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -solaris* | -sym* \ | -kopensolaris* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* | -aros* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \ | -openbsd* | -solidbsd* \ | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \ | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -chorusos* | -chorusrdb* | -cegcc* \ | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -linux-gnu* | -linux-newlib* | -linux-uclibc* \ | -uxpv* | -beos* | -mpeix* | -udk* \ | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ | -skyos* | -haiku* | -rdos* | -toppers* | -drops*) # Remember, each alternative MUST END IN *, to match a version number. ;; -qnx*) case $basic_machine in x86-* | i*86-*) ;; *) os=-nto$os ;; esac ;; -nto-qnx*) ;; -nto*) os=`echo $os | sed -e 's|nto|nto-qnx|'` ;; -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \ | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) ;; -mac*) os=`echo $os | sed -e 's|mac|macos|'` ;; -linux-dietlibc) os=-linux-dietlibc ;; -linux*) os=`echo $os | sed -e 's|linux|linux-gnu|'` ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -opened*) os=-openedition ;; -os400*) os=-os400 ;; -wince*) os=-wince ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -atheos*) os=-atheos ;; -syllable*) os=-syllable ;; -386bsd) os=-bsd ;; -ctix* | -uts*) os=-sysv ;; -nova*) os=-rtmk-nova ;; -ns2 ) os=-nextstep2 ;; -nsk*) os=-nsk ;; # Preserve the version number of sinix5. -sinix5.*) os=`echo $os | sed -e 's|sinix|sysv|'` ;; -sinix*) os=-sysv4 ;; -tpf*) os=-tpf ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -ose*) os=-ose ;; -es1800*) os=-ose ;; -xenix) os=-xenix ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) os=-mint ;; -aros*) os=-aros ;; -kaos*) os=-kaos ;; -zvmoe) os=-zvmoe ;; -dicos*) os=-dicos ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in score-*) os=-elf ;; spu-*) os=-elf ;; *-acorn) os=-riscix1.2 ;; arm*-rebel) os=-linux ;; arm*-semi) os=-aout ;; c4x-* | tic4x-*) os=-coff ;; # This must come before the *-dec entry. pdp10-*) os=-tops20 ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; m68*-apollo) os=-domain ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 # This also exists in the configure program, but was not the # default. # os=-sunos4 ;; m68*-cisco) os=-aout ;; mep-*) os=-elf ;; mips*-cisco) os=-elf ;; mips*-*) os=-elf ;; or32-*) os=-coff ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-be) os=-beos ;; *-haiku) os=-haiku ;; *-ibm) os=-aix ;; *-knuth) os=-mmixware ;; *-wec) os=-proelf ;; *-winbond) os=-proelf ;; *-oki) os=-proelf ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigaos ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-next ) os=-nextstep ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-nextstep3 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-siemens) os=-sysv4 ;; *-masscomp) os=-rtu ;; f30[01]-fujitsu | f700-fujitsu) os=-uxpv ;; *-rom68k) os=-coff ;; *-*bug) os=-coff ;; *-apple) os=-macos ;; *-atari*) os=-mint ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -aix*) vendor=ibm ;; -beos*) vendor=be ;; -hpux*) vendor=hp ;; -mpeix*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs* | -opened*) vendor=ibm ;; -os400*) vendor=ibm ;; -ptx*) vendor=sequent ;; -tpf*) vendor=ibm ;; -vxsim* | -vxworks* | -windiss*) vendor=wrs ;; -aux*) vendor=apple ;; -hms*) vendor=hitachi ;; -mpw* | -macos*) vendor=apple ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) vendor=atari ;; -vos*) vendor=stratus ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os exit # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: bird-1.6.3/tools/cvslog0000755000103200001440000000264713027054563014026 0ustar feelausers#!/usr/bin/perl # Process `cvs log' output to get a resonable changelog # (c) 2003--2004 Martin Mares use Digest::MD5; use POSIX; my %names= ( 'mj' => 'Martin Mares ', 'feela' => 'Ondrej Filip ', 'pavel' => 'Pavel Machek ' ); while () { chomp; /^$/ && next; /^[?]/ && next; /^RCS file: / || die; $_ = ; chomp; my ($file) = /^Working file: (.*)$/ or die; #print "$file\n"; do { $_ = or die; } while (!/^description:/); $_ = ; for(;;) { /^======/ && last; if (/^------/) { $_ = ; next; } /^revision / || die; $_ = ; my ($author) = /;\s*author:\s*([^;]+)/ or die; my ($yy,$mm,$dd,$HH,$MM,$SS) = /^date: (....)\/(..)\/(..) (..):(..):(..);/ or die; my $t = POSIX::mktime($SS,$MM,$HH,$dd,$mm-1,$yy-1900) or die; my $T = sprintf("%06d", int(($t + 1800)/3600)); $d = ""; while ($_ = ) { /^(-----|=====)/ && last; $d .= " $_"; } my $id = "$T:" . Digest::MD5::md5_hex($d); if (!defined $msg{$id}) { $date{$id} = "$yy-$mm-$dd $HH:$MM:$SS"; $msg{$id} = $d; $files{$id} = ""; $author{$id} = $author; } $files{$id} .= " * $file\n"; #print "\t$id\n"; } } foreach $id (sort keys %date) { if (!exists ($names{$author{$id}})) { die "Unknown commiter $author{$id}"; } print "### ", $date{$id}, " ", $names{$author{$id}}, "\n\n"; print $files{$id}, "\n"; print $msg{$id}, "\n"; } bird-1.6.3/tools/mergedirs0000755000103200001440000000225613027054563014506 0ustar feelausers#!/bin/sh if [ -z "$4" ] ; then echo "Usage: mergedirs " exit 1 fi cpp=${CPP:-cc -E} SRCDIR=$1 shift SRCREL=$1 case $SRCDIR in /*) ;; *) SRCREL="../$SRCREL" ;; esac shift OBJDIR=$1 LIBDIR=$OBJDIR/lib CONFDIR=$OBJDIR/conf shift echo "Merging system-dependent modules ($@)" MODULES=`for a in $@ ; do cat $SRCDIR/sysdep/config.h $SRCDIR/$a/Modules | $cpp -U unix -D MACROS_ONLY -I $OBJDIR - | sed "/^[ ]*\$/d;/^#/d;s@\\(.*\\)@\\1 $a/\\1@" done | sort -k1,1 -u | cut -d ' ' -f 2` rm -rf $LIBDIR $CONFDIR mkdir -p $LIBDIR $CONFDIR for a in $MODULES ; do b=`basename $a` case $b in *.h) ln -s $SRCREL/$a $LIBDIR/$b ;; *.c) OBJ=`echo $b | sed 's/\.c$/\.o/'` OBJS="$OBJS $OBJ" SRCS="$SRCS \\ $b" ln -s $SRCREL/$a $LIBDIR/$b ;; *.Y) CONFS="$CONFS\$(srcdir)/$a " ln -s $SRCREL/$a $CONFDIR/$b ;; *) echo "$b: Unknown file type" exit 1 ;; esac done cat >$LIBDIR/Makefile <$CONFDIR/Makefile "s|@CONFS@|$CONFS|" CONFS=`cd $SRCDIR ; ls conf/*.[chl]` for a in $CONFS ; do ln -s $SRCREL/$a $CONFDIR/ done bird-1.6.3/tools/progdoc0000755000103200001440000000211413027054563014153 0ustar feelausers#!/usr/bin/perl $srcdir = $ARGV[0]; open(OUT, ">prog.sgml") || die "Cannot create output file"; include("doc/prog-head.sgml"); process(""); include("doc/prog-foot.sgml"); close OUT; exit 0; sub include { my $f = shift @_; open(IN, "$srcdir/$f") || die "Unable to find $f"; while () { print OUT; } close IN; } sub process { my $dir = shift @_; print "$dir/Doc\n"; open(IN, "$srcdir/$dir/Doc") || die "Unable to read $dir/Doc"; my @docfile = ; close IN; foreach $_ (@docfile) { chomp; /^#/ && next; /^([A-Z]+)\s*(.*)/ || die "Parse error: $_"; $cmd = $1; $arg = $2; if ($cmd eq "C") { process("$dir/$arg"); } elsif ($cmd eq "H") { push @stack, "H"; print OUT "$arg\n"; } elsif ($cmd eq "S") { print " $arg\n"; open(DOC, "cd $srcdir/$dir ; $srcdir/doc/kernel-doc -bird $arg |") || die "Unable to start kernel-doc"; while () { print OUT; } close DOC; } elsif ($cmd eq "D") { print " $arg\n"; include("$dir/$arg"); } else { die "Unknown command: $cmd"; } } } bird-1.6.3/tools/Rules.in0000644000103200001440000000325413027054563014220 0ustar feelausers# Makefile fragments for the BIRD Internet Routing Daemon # (c) 1999--2000 Martin Mares srcdir=@srcdir_rel_mf@ srcdir_abs := $(shell cd $(srcdir) ; pwd) objdir=@objdir@ exedir=@exedir@ protocols=@protocols@ static-dirs := nest filter $(addprefix proto/,$(protocols)) static-dir-paths := $(addprefix $(srcdir)/,$(static-dirs)) dynamic-dirs := lib conf dynamic-dir-paths := $(dynamic-dirs) client-dirs := client client-dir-paths := $(client-dirs) doc-dirs := doc doc-dir-paths := $(doc-dirs) all-dirs:=$(static-dirs) $(dynamic-dirs) $(client-dirs) $(doc-dirs) clean-dirs:=$(all-dirs) proto sysdep CPPFLAGS=-I$(root-rel) -I$(srcdir) @CPPFLAGS@ CFLAGS=$(CPPFLAGS) @CFLAGS@ LDFLAGS=@LDFLAGS@ LIBS=@LIBS@ CLIENT_LIBS=@CLIENT_LIBS@ CC=@CC@ M4=@M4@ BISON=@BISON@ FLEX=@FLEX@ RANLIB=@RANLIB@ INSTALL=@INSTALL@ INSTALL_PROGRAM=@INSTALL_PROGRAM@ INSTALL_DATA=@INSTALL_DATA@ prefix=@prefix@ exec_prefix=@exec_prefix@ bindir=@bindir@ sbindir=@sbindir@ sysconfdir=@sysconfdir@ localstatedir=@localstatedir@ docdir=@prefix@/doc ifdef source objs := $(subst .c,.o,$(source)) ifdef dir-name src-path := $(srcdir)/$(dir-name)/ endif all: cd $(root-rel) && make ifdef lib-dest subdir: $(lib-dest) $(lib-dest): $(objs) rm -f $@ ar rcs $@ $^ $(RANLIB) $@ else subdir: all.o all.o: $(objs) # $(LD) -r -o $@ $^ # Changed to $(CC) because $(LD) has problems with crosscompiling @echo LD -r -o $@ $^ @$(CC) -nostdlib -r -o $@ $^ endif %.o: $(src-path)%.c @echo CC -o $@ -c $< @$(CC) $(CFLAGS) -o $@ -c $< ifndef source-dep source-dep := $(source) endif depend: $(CC) $(CPPFLAGS) -MM $(addprefix $(src-path),$(source-dep)) >depend ifneq ($(wildcard depend),) include depend endif endif bird-1.6.3/tools/Makefile.in0000644000103200001440000000630513027054563014643 0ustar feelausers# Makefile for the BIRD Internet Routing Daemon # (c) 1999--2000 Martin Mares include Rules .PHONY: all daemon birdc birdcl subdir depend clean distclean tags docs userdocs progdocs all: sysdep/paths.h .dep-stamp subdir daemon birdcl @CLIENT@ daemon: $(exedir)/bird birdc: $(exedir)/birdc birdcl: $(exedir)/birdcl bird-dep := $(addsuffix /all.o, $(static-dirs)) conf/all.o lib/birdlib.a $(bird-dep): sysdep/paths.h .dep-stamp subdir birdc-dep := client/birdc.o client/all.o lib/birdlib.a $(birdc-dep): sysdep/paths.h .dep-stamp subdir birdcl-dep := client/birdcl.o client/all.o lib/birdlib.a $(birdcl-dep): sysdep/paths.h .dep-stamp subdir export client := @CLIENT@ depend: sysdep/paths.h .dir-stamp set -e ; for a in $(dynamic-dirs) ; do $(MAKE) -C $$a $@ ; done set -e ; for a in $(static-dirs) $(client-dirs) ; do $(MAKE) -C $$a -f $(srcdir_abs)/$$a/Makefile $@ ; done subdir: sysdep/paths.h .dir-stamp .dep-stamp set -e ; for a in $(dynamic-dirs) ; do $(MAKE) -C $$a $@ ; done set -e ; for a in $(static-dirs) $(client-dirs) ; do $(MAKE) -C $$a -f $(srcdir_abs)/$$a/Makefile $@ ; done $(exedir)/bird: $(bird-dep) @echo LD $(LDFLAGS) -o $@ $^ $(LIBS) @$(CC) $(LDFLAGS) -o $@ $^ $(LIBS) $(exedir)/birdc: $(birdc-dep) @echo LD $(LDFLAGS) -o $@ $^ $(LIBS) $(CLIENT_LIBS) @$(CC) $(LDFLAGS) -o $@ $^ $(LIBS) $(CLIENT_LIBS) $(exedir)/birdcl: $(birdcl-dep) @echo LD $(LDFLAGS) -o $@ $^ $(LIBS) @$(CC) $(LDFLAGS) -o $@ $^ $(LIBS) .dir-stamp: sysdep/paths.h mkdir -p $(static-dirs) $(client-dirs) $(doc-dirs) touch .dir-stamp .dep-stamp: $(MAKE) depend touch .dep-stamp docs: userdocs progdocs userdocs progdocs: .dir-stamp $(MAKE) -C doc -f $(srcdir_abs)/doc/Makefile $@ sysdep/paths.h: echo >sysdep/paths.h "/* Generated by Makefile, don't edit manually! */" echo >>sysdep/paths.h "#define PATH_CONFIG_FILE \"@CONFIG_FILE@\"" echo >>sysdep/paths.h "#define PATH_CONTROL_SOCKET \"@CONTROL_SOCKET@\"" if test -n "@iproutedir@" ; then echo >>sysdep/paths.h "#define PATH_IPROUTE_DIR \"@iproutedir@\"" ; fi tags: cd $(srcdir) ; etags -lc `find $(static-dirs) $(addprefix $(objdir)/,$(dynamic-dirs)) $(client-dirs) -name *.[chY]` install: all $(INSTALL) -d $(DESTDIR)/$(sbindir) $(DESTDIR)/$(sysconfdir) $(DESTDIR)/@runtimedir@ $(INSTALL_PROGRAM) $(exedir)/bird $(DESTDIR)/$(sbindir)/bird@SUFFIX@ $(INSTALL_PROGRAM) $(exedir)/birdcl $(DESTDIR)/$(sbindir)/birdcl@SUFFIX@ if test -n "@CLIENT@" ; then \ $(INSTALL_PROGRAM) $(exedir)/birdc $(DESTDIR)/$(sbindir)/birdc@SUFFIX@ ; \ fi if ! test -f $(DESTDIR)/@CONFIG_FILE@ ; then \ $(INSTALL_DATA) $(srcdir)/doc/bird.conf.example $(DESTDIR)/@CONFIG_FILE@ ; \ else \ echo "Not overwriting old bird@SUFFIX@.conf" ; \ fi install-docs: $(INSTALL) -d $(DESTDIR)/$(docdir) $(INSTALL_DATA) $(srcdir)/doc/{bird,prog}{,-*}.html $(DESTDIR)/$(docdir)/ clean: find . -name "*.[oa]" -o -name core -o -name depend -o -name "*.html" | xargs rm -f rm -f conf/cf-lex.c conf/cf-parse.* conf/commands.h conf/keywords.h rm -f $(exedir)/bird $(exedir)/birdcl $(exedir)/birdc $(exedir)/bird.ctl $(exedir)/bird6.ctl .dep-stamp distclean: clean rm -f config.* configure sysdep/autoconf.h sysdep/paths.h Makefile Rules rm -rf .dir-stamp $(clean-dirs) bird-1.6.3/tools/Makefile-top.in0000644000103200001440000000101013027054563015427 0ustar feelausers# Makefile for in place build of BIRD # (c) 1999--2000 Martin Mares objdir=@objdir@ all depend tags install install-docs: $(MAKE) -C $(objdir) $@ docs userdocs progdocs: $(MAKE) -C doc $@ clean: $(MAKE) -C $(objdir) clean find . -name "*~" -or -name "*.[oa]" -or -name "\#*\#" -or -name TAGS -or -name core -or -name depend -or -name ".#*" | xargs rm -f distclean: clean $(MAKE) -C doc distclean rm -rf $(objdir) autom4te.cache rm -f config.* configure sysdep/autoconf.h sysdep/paths.h Makefile bird-1.6.3/tools/install-sh0000755000103200001440000001124313027054563014577 0ustar feelausers#!/bin/sh # # install - install a program, script, or datafile # This comes from X11R5. # # Calling this script install-sh is preferred over install.sh, to prevent # `make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. # # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit="${DOITPROG-}" # put in absolute paths if you don't have them in your path; or use env. vars. mvprog="${MVPROG-mv}" cpprog="${CPPROG-cp}" chmodprog="${CHMODPROG-chmod}" chownprog="${CHOWNPROG-chown}" chgrpprog="${CHGRPPROG-chgrp}" stripprog="${STRIPPROG-strip}" rmprog="${RMPROG-rm}" mkdirprog="${MKDIRPROG-mkdir}" tranformbasename="" transform_arg="" instcmd="$mvprog" chmodcmd="$chmodprog 0755" chowncmd="" chgrpcmd="" stripcmd="" rmcmd="$rmprog -f" mvcmd="$mvprog" src="" dst="" dir_arg="" while [ x"$1" != x ]; do case $1 in -c) instcmd="$cpprog" shift continue;; -d) dir_arg=true shift continue;; -m) chmodcmd="$chmodprog $2" shift shift continue;; -o) chowncmd="$chownprog $2" shift shift continue;; -g) chgrpcmd="$chgrpprog $2" shift shift continue;; -s) stripcmd="$stripprog" shift continue;; -t=*) transformarg=`echo $1 | sed 's/-t=//'` shift continue;; -b=*) transformbasename=`echo $1 | sed 's/-b=//'` shift continue;; *) if [ x"$src" = x ] then src=$1 else # this colon is to work around a 386BSD /bin/sh bug : dst=$1 fi shift continue;; esac done if [ x"$src" = x ] then echo "install: no input file specified" exit 1 else true fi if [ x"$dir_arg" != x ]; then dst=$src src="" if [ -d $dst ]; then instcmd=: else instcmd=mkdir fi else # Waiting for this to be detected by the "$instcmd $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if [ -f $src -o -d $src ] then true else echo "install: $src does not exist" exit 1 fi if [ x"$dst" = x ] then echo "install: no destination specified" exit 1 else true fi # If destination is a directory, append the input filename; if your system # does not like double slashes in filenames, you may need to add some logic if [ -d $dst ] then dst="$dst"/`basename $src` else true fi fi ## this sed command emulates the dirname command dstdir=`echo $dst | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'` # Make sure that the destination directory exists. # this part is taken from Noah Friedman's mkinstalldirs script # Skip lots of stat calls in the usual case. if [ ! -d "$dstdir" ]; then defaultIFS=' ' IFS="${IFS-${defaultIFS}}" oIFS="${IFS}" # Some sh's can't handle IFS=/ for some reason. IFS='%' set - `echo ${dstdir} | sed -e 's@/@%@g' -e 's@^%@/@'` IFS="${oIFS}" pathcomp='' while [ $# -ne 0 ] ; do pathcomp="${pathcomp}${1}" shift if [ ! -d "${pathcomp}" ] ; then $mkdirprog "${pathcomp}" else true fi pathcomp="${pathcomp}/" done fi if [ x"$dir_arg" != x ] then $doit $instcmd $dst && if [ x"$chowncmd" != x ]; then $doit $chowncmd $dst; else true ; fi && if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dst; else true ; fi && if [ x"$stripcmd" != x ]; then $doit $stripcmd $dst; else true ; fi && if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dst; else true ; fi else # If we're going to rename the final executable, determine the name now. if [ x"$transformarg" = x ] then dstfile=`basename $dst` else dstfile=`basename $dst $transformbasename | sed $transformarg`$transformbasename fi # don't allow the sed command to completely eliminate the filename if [ x"$dstfile" = x ] then dstfile=`basename $dst` else true fi # Make a temp file name in the proper directory. dsttmp=$dstdir/#inst.$$# # Move or copy the file name to the temp name $doit $instcmd $src $dsttmp && trap "rm -f ${dsttmp}" 0 && # and set any options; do chmod last to preserve setuid bits # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $instcmd $src $dsttmp" command. if [ x"$chowncmd" != x ]; then $doit $chowncmd $dsttmp; else true;fi && if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dsttmp; else true;fi && if [ x"$stripcmd" != x ]; then $doit $stripcmd $dsttmp; else true;fi && if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dsttmp; else true;fi && # Now rename the file to the real destination. $doit $rmcmd -f $dstdir/$dstfile && $doit $mvcmd $dsttmp $dstdir/$dstfile fi && exit 0 bird-1.6.3/tools/gendist0000755000103200001440000000202613027054563014155 0ustar feelausers#!/bin/sh # # Generate BIRD Distribution Archive # (c) 2000--2004 Martin Mares # set -e AC=`if [ -x /usr/bin/autoconf2.50 ] ; then echo autoconf2.50 ; else echo autoconf ; fi` $AC ./configure make distclean $AC rm -rf autom4te*cache ( cd doc ; make docs ; make clean ) VERSION=`sed $T/$REL/ChangeLog mv $T/$REL/doc/*.ps $T/$DREL/doc rm -f $T/$REL/bird.conf* rm -rf $T/$REL/.git/ rm -rf `find $T/$REL -name CVS -o -name tmp` $T/$REL/{misc,rfc,doc/slides} ( cd $T ; tar czvvf $REL.tar.gz $REL ) ( cd $T ; tar czvvf $DREL.tar.gz $DREL ) rm -rf $T/$REL $T/$DREL echo -n "OK? " read OK echo Uploading to Atrey... scp $T/$REL.tar.gz $T/$DREL.tar.gz atrey.karlin.mff.cuni.cz:~ftp/pub/bird/ echo Uploading to Trubka... scp $T/$REL.tar.gz $T/$DREL.tar.gz bird.network.cz:~ftp/pub/bird/ echo Done. bird-1.6.3/tools/config.guess0000755000103200001440000013226413027054563015122 0ustar feelausers#! /bin/sh # Attempt to guess a canonical system name. # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, # 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 # Free Software Foundation, Inc. timestamp='2009-04-27' # This file is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, but # WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA # 02110-1301, USA. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Per Bothner . # Please send patches to . Submit a context # diff and a properly formatted ChangeLog entry. # # This script attempts to guess a canonical system name similar to # config.sub. If it succeeds, it prints the system name on stdout, and # exits with 0. Otherwise, it exits with 1. # # The plan is that this can be called by configure scripts if you # don't specify an explicit build system type. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.guess ($timestamp) Originally written by Per Bothner. Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; * ) break ;; esac done if test $# != 0; then echo "$me: too many arguments$help" >&2 exit 1 fi trap 'exit 1' 1 2 15 # CC_FOR_BUILD -- compiler used by this script. Note that the use of a # compiler to aid in system detection is discouraged as it requires # temporary files to be created and, as you can see below, it is a # headache to deal with in a portable fashion. # Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still # use `HOST_CC' if defined, but it is deprecated. # Portable tmp directory creation inspired by the Autoconf team. set_cc_for_build=' trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; : ${TMPDIR=/tmp} ; { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } || { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; dummy=$tmp/dummy ; tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > $dummy.c ; for c in cc gcc c89 c99 ; do if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then CC_FOR_BUILD="$c"; break ; fi ; done ; if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found ; fi ;; ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; esac ; set_cc_for_build= ;' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 1994-08-24) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in *:NetBSD:*:*) # NetBSD (nbsd) targets should (where applicable) match one or # more of the tupples: *-*-netbsdelf*, *-*-netbsdaout*, # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently # switched to ELF, *-*-netbsd* would select the old # object file format. This provides both forward # compatibility and a consistent mechanism for selecting the # object file format. # # Note: NetBSD doesn't particularly care about the vendor # portion of the name. We always set it to "unknown". sysctl="sysctl -n hw.machine_arch" UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \ /usr/sbin/$sysctl 2>/dev/null || echo unknown)` case "${UNAME_MACHINE_ARCH}" in armeb) machine=armeb-unknown ;; arm*) machine=arm-unknown ;; sh3el) machine=shl-unknown ;; sh3eb) machine=sh-unknown ;; sh5el) machine=sh5le-unknown ;; *) machine=${UNAME_MACHINE_ARCH}-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently, or will in the future. case "${UNAME_MACHINE_ARCH}" in arm*|i386|m68k|ns32k|sh3*|sparc|vax) eval $set_cc_for_build if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep __ELF__ >/dev/null then # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). # Return netbsd for either. FIX? os=netbsd else os=netbsdelf fi ;; *) os=netbsd ;; esac # The OS release # Debian GNU/NetBSD machines have a different userland, and # thus, need a distinct triplet. However, they do not need # kernel version information, so it can be replaced with a # suitable tag, in the style of linux-gnu. case "${UNAME_VERSION}" in Debian*) release='-gnu' ;; *) release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` ;; esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. echo "${machine}-${os}${release}" exit ;; *:OpenBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE} exit ;; *:ekkoBSD:*:*) echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE} exit ;; *:SolidBSD:*:*) echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE} exit ;; macppc:MirBSD:*:*) echo powerpc-unknown-mirbsd${UNAME_RELEASE} exit ;; *:MirBSD:*:*) echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE} exit ;; alpha:OSF1:*:*) case $UNAME_RELEASE in *4.0) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` ;; *5.*) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` ;; esac # According to Compaq, /usr/sbin/psrinfo has been available on # OSF/1 and Tru64 systems produced since 1995. I hope that # covers most systems running today. This code pipes the CPU # types through head -n 1, so we only detect the type of CPU 0. ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` case "$ALPHA_CPU_TYPE" in "EV4 (21064)") UNAME_MACHINE="alpha" ;; "EV4.5 (21064)") UNAME_MACHINE="alpha" ;; "LCA4 (21066/21068)") UNAME_MACHINE="alpha" ;; "EV5 (21164)") UNAME_MACHINE="alphaev5" ;; "EV5.6 (21164A)") UNAME_MACHINE="alphaev56" ;; "EV5.6 (21164PC)") UNAME_MACHINE="alphapca56" ;; "EV5.7 (21164PC)") UNAME_MACHINE="alphapca57" ;; "EV6 (21264)") UNAME_MACHINE="alphaev6" ;; "EV6.7 (21264A)") UNAME_MACHINE="alphaev67" ;; "EV6.8CB (21264C)") UNAME_MACHINE="alphaev68" ;; "EV6.8AL (21264B)") UNAME_MACHINE="alphaev68" ;; "EV6.8CX (21264D)") UNAME_MACHINE="alphaev68" ;; "EV6.9A (21264/EV69A)") UNAME_MACHINE="alphaev69" ;; "EV7 (21364)") UNAME_MACHINE="alphaev7" ;; "EV7.9 (21364A)") UNAME_MACHINE="alphaev79" ;; esac # A Pn.n version is a patched version. # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` exit ;; Alpha\ *:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # Should we change UNAME_MACHINE based on the output of uname instead # of the specific Alpha model? echo alpha-pc-interix exit ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-unknown-sysv4 exit ;; *:[Aa]miga[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-amigaos exit ;; *:[Mm]orph[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-morphos exit ;; *:OS/390:*:*) echo i370-ibm-openedition exit ;; *:z/VM:*:*) echo s390-ibm-zvmoe exit ;; *:OS400:*:*) echo powerpc-ibm-os400 exit ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit ;; arm:riscos:*:*|arm:RISCOS:*:*) echo arm-unknown-riscos exit ;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit ;; Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit ;; NILE*:*:*:dcosx) echo pyramid-pyramid-svr4 exit ;; DRS?6000:unix:4.0:6*) echo sparc-icl-nx6 exit ;; DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) case `/usr/bin/uname -p` in sparc) echo sparc-icl-nx7; exit ;; esac ;; s390x:SunOS:*:*) echo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*) eval $set_cc_for_build SUN_ARCH="i386" # If there is a compiler, see if it is configured for 64-bit objects. # Note that the Sun cc does not turn __LP64__ into 1 like gcc does. # This test works for both compilers. if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then SUN_ARCH="x86_64" fi fi echo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:*:*) case "`/usr/bin/arch -k`" in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3 case "`/bin/arch`" in sun3) echo m68k-sun-sunos${UNAME_RELEASE} ;; sun4) echo sparc-sun-sunos${UNAME_RELEASE} ;; esac exit ;; aushp:SunOS:*:*) echo sparc-auspex-sunos${UNAME_RELEASE} exit ;; # The situation for MiNT is a little confusing. The machine name # can be virtually everything (everything which is not # "atarist" or "atariste" at least should have a processor # > m68000). The system name ranges from "MiNT" over "FreeMiNT" # to the lowercase version "mint" (or "freemint"). Finally # the system name "TOS" denotes a system which is actually not # MiNT. But MiNT is downward compatible to TOS, so this should # be no problem. atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) echo m68k-milan-mint${UNAME_RELEASE} exit ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) echo m68k-hades-mint${UNAME_RELEASE} exit ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) echo m68k-unknown-mint${UNAME_RELEASE} exit ;; m68k:machten:*:*) echo m68k-apple-machten${UNAME_RELEASE} exit ;; powerpc:machten:*:*) echo powerpc-apple-machten${UNAME_RELEASE} exit ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit ;; 2020:CLIX:*:* | 2430:CLIX:*:*) echo clipper-intergraph-clix${UNAME_RELEASE} exit ;; mips:*:*:UMIPS | mips:*:*:RISCos) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #ifdef __cplusplus #include /* for printf() prototype */ int main (int argc, char *argv[]) { #else int main (argc, argv) int argc; char *argv[]; { #endif #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` && SYSTEM_NAME=`$dummy $dummyarg` && { echo "$SYSTEM_NAME"; exit; } echo mips-mips-riscos${UNAME_RELEASE} exit ;; Motorola:PowerMAX_OS:*:*) echo powerpc-motorola-powermax exit ;; Motorola:*:4.3:PL8-*) echo powerpc-harris-powermax exit ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ] then if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \ [ ${TARGET_BINARY_INTERFACE}x = x ] then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi else echo i586-dg-dgux${UNAME_RELEASE} fi exit ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit ;; *:IRIX*:*:*) echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` exit ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id exit ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) echo i386-ibm-aix exit ;; ia64:AIX:*:*) if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${UNAME_MACHINE}-ibm-aix${IBM_REV} exit ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` then echo "$SYSTEM_NAME" else echo rs6000-ibm-aix3.2.5 fi elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit ;; *:AIX:*:[456]) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${IBM_ARCH}-ibm-aix${IBM_REV} exit ;; *:AIX:*:*) echo rs6000-ibm-aix exit ;; ibmrt:4.4BSD:*|romp-ibm:BSD:*) echo romp-ibm-bsd4.4 exit ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to exit ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit ;; 9000/[34678]??:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/[678][0-9][0-9]) if [ -x /usr/bin/getconf ]; then sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` case "${sc_cpu_version}" in 523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0 528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1 532) # CPU_PA_RISC2_0 case "${sc_kernel_bits}" in 32) HP_ARCH="hppa2.0n" ;; 64) HP_ARCH="hppa2.0w" ;; '') HP_ARCH="hppa2.0" ;; # HP-UX 10.20 esac ;; esac fi if [ "${HP_ARCH}" = "" ]; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #define _HPUX_SOURCE #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac if [ ${HP_ARCH} = "hppa2.0w" ] then eval $set_cc_for_build # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler # generating 64-bit code. GNU and HP use different nomenclature: # # $ CC_FOR_BUILD=cc ./config.guess # => hppa2.0w-hp-hpux11.23 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess # => hppa64-hp-hpux11.23 if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | grep __LP64__ >/dev/null then HP_ARCH="hppa2.0w" else HP_ARCH="hppa64" fi fi echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit ;; ia64:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ia64-hp-hpux${HPUX_REV} exit ;; 3050*:HI-UX:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } echo unknown-hitachi-hiuxwe2 exit ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) echo hppa1.0-hp-mpeix exit ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) echo hppa1.1-hp-osf exit ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit ;; i*86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo ${UNAME_MACHINE}-unknown-osf1mk else echo ${UNAME_MACHINE}-unknown-osf1 fi exit ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*[A-Z]90:*:*:*) echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ -e 's/\.[^.]*$/.X/' exit ;; CRAY*TS:*:*:*) echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*SV1:*:*:*) echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; *:UNICOS/mp:*:*) echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'` echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; 5000:UNIX_System_V:4.*:*) FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'` echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} exit ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi${UNAME_RELEASE} exit ;; *:BSD/OS:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit ;; *:FreeBSD:*:*) case ${UNAME_MACHINE} in pc98) echo i386-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; amd64) echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; *) echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; esac exit ;; i*:CYGWIN*:*) echo ${UNAME_MACHINE}-pc-cygwin exit ;; *:MINGW*:*) echo ${UNAME_MACHINE}-pc-mingw32 exit ;; i*:windows32*:*) # uname -m includes "-pc" on this system. echo ${UNAME_MACHINE}-mingw32 exit ;; i*:PW*:*) echo ${UNAME_MACHINE}-pc-pw32 exit ;; *:Interix*:[3456]*) case ${UNAME_MACHINE} in x86) echo i586-pc-interix${UNAME_RELEASE} exit ;; EM64T | authenticamd | genuineintel) echo x86_64-unknown-interix${UNAME_RELEASE} exit ;; IA64) echo ia64-unknown-interix${UNAME_RELEASE} exit ;; esac ;; [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) echo i${UNAME_MACHINE}-pc-mks exit ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? echo i586-pc-interix exit ;; i*:UWIN*:*) echo ${UNAME_MACHINE}-pc-uwin exit ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) echo x86_64-unknown-cygwin exit ;; p*:CYGWIN*:*) echo powerpcle-unknown-cygwin exit ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; *:GNU:*:*) # the GNU system echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit ;; *:GNU/*:*:*) # other systems with GNU libc and userland echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-gnu exit ;; i*86:Minix:*:*) echo ${UNAME_MACHINE}-pc-minix exit ;; arm*:Linux:*:*) eval $set_cc_for_build if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_EABI__ then echo ${UNAME_MACHINE}-unknown-linux-gnu else echo ${UNAME_MACHINE}-unknown-linux-gnueabi fi exit ;; avr32*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; cris:Linux:*:*) echo cris-axis-linux-gnu exit ;; crisv32:Linux:*:*) echo crisv32-axis-linux-gnu exit ;; frv:Linux:*:*) echo frv-unknown-linux-gnu exit ;; ia64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; m32r*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; m68*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; mips:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef mips #undef mipsel #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=mipsel #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=mips #else CPU= #endif #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^CPU/{ s: ::g p }'`" test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; } ;; mips64:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef mips64 #undef mips64el #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=mips64el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=mips64 #else CPU= #endif #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^CPU/{ s: ::g p }'`" test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; } ;; or32:Linux:*:*) echo or32-unknown-linux-gnu exit ;; ppc:Linux:*:*) echo powerpc-unknown-linux-gnu exit ;; ppc64:Linux:*:*) echo powerpc64-unknown-linux-gnu exit ;; alpha:Linux:*:*) case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in EV5) UNAME_MACHINE=alphaev5 ;; EV56) UNAME_MACHINE=alphaev56 ;; PCA56) UNAME_MACHINE=alphapca56 ;; PCA57) UNAME_MACHINE=alphapca56 ;; EV6) UNAME_MACHINE=alphaev6 ;; EV67) UNAME_MACHINE=alphaev67 ;; EV68*) UNAME_MACHINE=alphaev68 ;; esac objdump --private-headers /bin/sh | grep ld.so.1 >/dev/null if test "$?" = 0 ; then LIBC="libc1" ; else LIBC="" ; fi echo ${UNAME_MACHINE}-unknown-linux-gnu${LIBC} exit ;; padre:Linux:*:*) echo sparc-unknown-linux-gnu exit ;; parisc:Linux:*:* | hppa:Linux:*:*) # Look for CPU level case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in PA7*) echo hppa1.1-unknown-linux-gnu ;; PA8*) echo hppa2.0-unknown-linux-gnu ;; *) echo hppa-unknown-linux-gnu ;; esac exit ;; parisc64:Linux:*:* | hppa64:Linux:*:*) echo hppa64-unknown-linux-gnu exit ;; s390:Linux:*:* | s390x:Linux:*:*) echo ${UNAME_MACHINE}-ibm-linux exit ;; sh64*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; sh*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; sparc:Linux:*:* | sparc64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; vax:Linux:*:*) echo ${UNAME_MACHINE}-dec-linux-gnu exit ;; x86_64:Linux:*:*) echo x86_64-unknown-linux-gnu exit ;; xtensa*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-gnu exit ;; i*86:Linux:*:*) # The BFD linker knows what the default object file format is, so # first see if it will tell us. cd to the root directory to prevent # problems with other programs or directories called `ld' in the path. # Set LC_ALL=C to ensure ld outputs messages in English. ld_supported_targets=`cd /; LC_ALL=C ld --help 2>&1 \ | sed -ne '/supported targets:/!d s/[ ][ ]*/ /g s/.*supported targets: *// s/ .*// p'` case "$ld_supported_targets" in elf32-i386) TENTATIVE="${UNAME_MACHINE}-pc-linux-gnu" ;; a.out-i386-linux) echo "${UNAME_MACHINE}-pc-linux-gnuaout" exit ;; "") # Either a pre-BFD a.out linker (linux-gnuoldld) or # one that does not give us useful --help. echo "${UNAME_MACHINE}-pc-linux-gnuoldld" exit ;; esac # Determine whether the default compiler is a.out or elf eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include #ifdef __ELF__ # ifdef __GLIBC__ # if __GLIBC__ >= 2 LIBC=gnu # else LIBC=gnulibc1 # endif # else LIBC=gnulibc1 # endif #else #if defined(__INTEL_COMPILER) || defined(__PGI) || defined(__SUNPRO_C) || defined(__SUNPRO_CC) LIBC=gnu #else LIBC=gnuaout #endif #endif #ifdef __dietlibc__ LIBC=dietlibc #endif EOF eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' /^LIBC/{ s: ::g p }'`" test x"${LIBC}" != x && { echo "${UNAME_MACHINE}-pc-linux-${LIBC}" exit } test x"${TENTATIVE}" != x && { echo "${TENTATIVE}"; exit; } ;; i*86:DYNIX/ptx:4*:*) # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. # earlier versions are messed up and put the nodename in both # sysname and nodename. echo i386-sequent-sysv4 exit ;; i*86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} exit ;; i*86:OS/2:*:*) # If we were able to find `uname', then EMX Unix compatibility # is probably installed. echo ${UNAME_MACHINE}-pc-os2-emx exit ;; i*86:XTS-300:*:STOP) echo ${UNAME_MACHINE}-unknown-stop exit ;; i*86:atheos:*:*) echo ${UNAME_MACHINE}-unknown-atheos exit ;; i*86:syllable:*:*) echo ${UNAME_MACHINE}-pc-syllable exit ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.0*:*) echo i386-unknown-lynxos${UNAME_RELEASE} exit ;; i*86:*DOS:*:*) echo ${UNAME_MACHINE}-pc-msdosdjgpp exit ;; i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*) UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'` if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL} else echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL} fi exit ;; i*86:*:5:[678]*) # UnixWare 7.x, OpenUNIX and OpenServer 6. case `/bin/uname -X | grep "^Machine"` in *486*) UNAME_MACHINE=i486 ;; *Pentium) UNAME_MACHINE=i586 ;; *Pent*|*Celeron) UNAME_MACHINE=i686 ;; esac echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION} exit ;; i*86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ && UNAME_MACHINE=i686 (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ && UNAME_MACHINE=i686 echo ${UNAME_MACHINE}-pc-sco$UNAME_REL else echo ${UNAME_MACHINE}-pc-sysv32 fi exit ;; pc:*:*:*) # Left here for compatibility: # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i586. # Note: whatever this is, it MUST be the same as what config.sub # prints for the "djgpp" host, or else GDB configury will decide that # this is a cross-build. echo i586-pc-msdosdjgpp exit ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit ;; paragon:*:*:*) echo i860-intel-osf1 exit ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 fi exit ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit ;; mc68k:UNIX:SYSTEM5:3.51m) echo m68k-convergent-sysv exit ;; M680?0:D-NIX:5.3:*) echo m68k-diab-dnix exit ;; M68*:*:R3V[5678]*:*) test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4; exit; } ;; NCR*:*:4.2:* | MPRAS*:*:4.2:*) OS_REL='.3' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) echo m68k-unknown-lynxos${UNAME_RELEASE} exit ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} exit ;; rs6000:LynxOS:2.*:*) echo rs6000-unknown-lynxos${UNAME_RELEASE} exit ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.0*:*) echo powerpc-unknown-lynxos${UNAME_RELEASE} exit ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv${UNAME_RELEASE} exit ;; RM*:ReliantUNIX-*:*:*) echo mips-sni-sysv4 exit ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo ${UNAME_MACHINE}-sni-sysv4 else echo ns32k-sni-sysv fi exit ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit ;; i*86:VOS:*:*) # From Paul.Green@stratus.com. echo ${UNAME_MACHINE}-stratus-vos exit ;; *:VOS:*:*) # From Paul.Green@stratus.com. echo hppa1.1-stratus-vos exit ;; mc68*:A/UX:*:*) echo m68k-apple-aux${UNAME_RELEASE} exit ;; news*:NEWS-OS:6*:*) echo mips-sony-newsos6 exit ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) if [ -d /usr/nec ]; then echo mips-nec-sysv${UNAME_RELEASE} else echo mips-unknown-sysv${UNAME_RELEASE} fi exit ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit ;; BePC:Haiku:*:*) # Haiku running on Intel PC compatible. echo i586-pc-haiku exit ;; SX-4:SUPER-UX:*:*) echo sx4-nec-superux${UNAME_RELEASE} exit ;; SX-5:SUPER-UX:*:*) echo sx5-nec-superux${UNAME_RELEASE} exit ;; SX-6:SUPER-UX:*:*) echo sx6-nec-superux${UNAME_RELEASE} exit ;; SX-7:SUPER-UX:*:*) echo sx7-nec-superux${UNAME_RELEASE} exit ;; SX-8:SUPER-UX:*:*) echo sx8-nec-superux${UNAME_RELEASE} exit ;; SX-8R:SUPER-UX:*:*) echo sx8r-nec-superux${UNAME_RELEASE} exit ;; Power*:Rhapsody:*:*) echo powerpc-apple-rhapsody${UNAME_RELEASE} exit ;; *:Rhapsody:*:*) echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE} exit ;; *:Darwin:*:*) UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown case $UNAME_PROCESSOR in unknown) UNAME_PROCESSOR=powerpc ;; esac echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} exit ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) UNAME_PROCESSOR=`uname -p` if test "$UNAME_PROCESSOR" = "x86"; then UNAME_PROCESSOR=i386 UNAME_MACHINE=pc fi echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE} exit ;; *:QNX:*:4*) echo i386-pc-qnx exit ;; NSE-?:NONSTOP_KERNEL:*:*) echo nse-tandem-nsk${UNAME_RELEASE} exit ;; NSR-?:NONSTOP_KERNEL:*:*) echo nsr-tandem-nsk${UNAME_RELEASE} exit ;; *:NonStop-UX:*:*) echo mips-compaq-nonstopux exit ;; BS2000:POSIX*:*:*) echo bs2000-siemens-sysv exit ;; DS/*:UNIX_System_V:*:*) echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE} exit ;; *:Plan9:*:*) # "uname -m" is not consistent, so use $cputype instead. 386 # is converted to i386 for consistency with other x86 # operating systems. if test "$cputype" = "386"; then UNAME_MACHINE=i386 else UNAME_MACHINE="$cputype" fi echo ${UNAME_MACHINE}-unknown-plan9 exit ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 exit ;; *:TENEX:*:*) echo pdp10-unknown-tenex exit ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) echo pdp10-dec-tops20 exit ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) echo pdp10-xkl-tops20 exit ;; *:TOPS-20:*:*) echo pdp10-unknown-tops20 exit ;; *:ITS:*:*) echo pdp10-unknown-its exit ;; SEI:*:*:SEIUX) echo mips-sei-seiux${UNAME_RELEASE} exit ;; *:DragonFly:*:*) echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` exit ;; *:*VMS:*:*) UNAME_MACHINE=`(uname -p) 2>/dev/null` case "${UNAME_MACHINE}" in A*) echo alpha-dec-vms ; exit ;; I*) echo ia64-dec-vms ; exit ;; V*) echo vax-dec-vms ; exit ;; esac ;; *:XENIX:*:SysV) echo i386-pc-xenix exit ;; i*86:skyos:*:*) echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//' exit ;; i*86:rdos:*:*) echo ${UNAME_MACHINE}-pc-rdos exit ;; i*86:AROS:*:*) echo ${UNAME_MACHINE}-pc-aros exit ;; esac #echo '(No uname command or uname output not recognized.)' 1>&2 #echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2 eval $set_cc_for_build cat >$dummy.c < # include #endif main () { #if defined (sony) #if defined (MIPSEB) /* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed, I don't know.... */ printf ("mips-sony-bsd\n"); exit (0); #else #include printf ("m68k-sony-newsos%s\n", #ifdef NEWSOS4 "4" #else "" #endif ); exit (0); #endif #endif #if defined (__arm) && defined (__acorn) && defined (__unix) printf ("arm-acorn-riscix\n"); exit (0); #endif #if defined (hp300) && !defined (hpux) printf ("m68k-hp-bsd\n"); exit (0); #endif #if defined (NeXT) #if !defined (__ARCHITECTURE__) #define __ARCHITECTURE__ "m68k" #endif int version; version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`; if (version < 4) printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version); else printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-pc-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) struct utsname un; uname(&un); if (strncmp(un.version, "V2", 2) == 0) { printf ("i386-sequent-ptx2\n"); exit (0); } if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */ printf ("i386-sequent-ptx1\n"); exit (0); } printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) # if !defined (ultrix) # include # if defined (BSD) # if BSD == 43 printf ("vax-dec-bsd4.3\n"); exit (0); # else # if BSD == 199006 printf ("vax-dec-bsd4.3reno\n"); exit (0); # else printf ("vax-dec-bsd\n"); exit (0); # endif # endif # else printf ("vax-dec-bsd\n"); exit (0); # endif # else printf ("vax-dec-ultrix\n"); exit (0); # endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; } # Convex versions that predate uname can use getsysinfo(1) if [ -x /usr/convex/getsysinfo ] then case `getsysinfo -f cpu_type` in c1*) echo c1-convex-bsd exit ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; c34*) echo c34-convex-bsd exit ;; c38*) echo c38-convex-bsd exit ;; c4*) echo c4-convex-bsd exit ;; esac fi cat >&2 < in order to provide the needed information to handle your system. config.guess timestamp = $timestamp uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` /bin/uname -X = `(/bin/uname -X) 2>/dev/null` hostinfo = `(hostinfo) 2>/dev/null` /bin/universe = `(/bin/universe) 2>/dev/null` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` /bin/arch = `(/bin/arch) 2>/dev/null` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` UNAME_MACHINE = ${UNAME_MACHINE} UNAME_RELEASE = ${UNAME_RELEASE} UNAME_SYSTEM = ${UNAME_SYSTEM} UNAME_VERSION = ${UNAME_VERSION} EOF exit 1 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: bird-1.6.3/TODO0000644000103200001440000000330313027054563012121 0ustar feelausersCore ~~~~ - socket open failure should not be fatal - &&,||: priorities - static: allow specifying a per-route filter program for setting route attributes? Globals ~~~~~~~ - right usage of DBG vs. debug - logging and tracing; use appropriate log levels - check incoming packets and log errors!! - check log calls for trailing newlines and log levels followed by comma - check if all protocols set proper packet priorities and TTL's. - try compiling with -Wunused - does everybody test return value of sk_open? - protocols: implement CLI hooks and per-procotol CLI commands - protocols: implement reconfigure hook - protocols: use locking - check use of system includes and sprintf() Various ideas ~~~~~~~~~~~~~ - client: Ctrl-R eats one more enter - bgp: timing of updates? - netlink: import Linux route attributes to our rta's, so that they can be filtered? - config: executable config files - filters: user defined attributes? - io: use poll if available - route recalculation timing and flap dampening [see RFC2439 for algorithms] - aggregate engine: standard route aggregation and summarization [RFC2519] - aggregate engine: injection of manually configured pseudo-static routes - generate default route if any working BGP connection exists (aggregate engine again?) - generate default route to IGP's (aggregate engine yet another time?) - look at RFC 2386 (QoS-based routing) - cli: show tables? OSPF ~~~~ - check incoming packets using neighbor cache - RFC2328 appendix E: Use a better algorithm - automatic generation of external route tags (RFC1403) - RFC2370 opaque LSA's - Limit export rate of external LSAs (like Gated does) - Bugfix in link state retransmission list (aging) - Graceful OSPF restart - RFC3623 bird-1.6.3/nest/0000755000103200001440000000000013027054563012403 5ustar feelausersbird-1.6.3/nest/attrs.h0000644000103200001440000001133313027054563013712 0ustar feelausers/* * BIRD Internet Routing Daemon -- Attribute Operations * * (c) 2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_ATTRS_H_ #define _BIRD_ATTRS_H_ #include /* a-path.c */ #define AS_PATH_SET 1 /* Types of path segments */ #define AS_PATH_SEQUENCE 2 #define AS_PATH_CONFED_SEQUENCE 3 #define AS_PATH_CONFED_SET 4 #define AS_PATH_MAXLEN 10000 #define AS_TRANS 23456 /* AS_TRANS is used when we need to store 32bit ASN larger than 0xFFFF * to 16bit slot (like in 16bit AS_PATH). See RFC 4893 for details */ struct f_tree; struct adata *as_path_prepend(struct linpool *pool, struct adata *olda, u32 as); int as_path_convert_to_old(struct adata *path, byte *dst, int *new_used); int as_path_convert_to_new(struct adata *path, byte *dst, int req_as); void as_path_format(struct adata *path, byte *buf, uint size); int as_path_getlen(struct adata *path); int as_path_getlen_int(struct adata *path, int bs); int as_path_get_first(struct adata *path, u32 *orig_as); int as_path_get_last(struct adata *path, u32 *last_as); u32 as_path_get_last_nonaggregated(struct adata *path); int as_path_contains(struct adata *path, u32 as, int min); int as_path_match_set(struct adata *path, struct f_tree *set); struct adata *as_path_filter(struct linpool *pool, struct adata *path, struct f_tree *set, u32 key, int pos); #define PM_ASN 0 #define PM_QUESTION 1 #define PM_ASTERISK 2 #define PM_ASN_EXPR 3 #define PM_ASN_RANGE 4 struct f_path_mask { struct f_path_mask *next; int kind; uintptr_t val; uintptr_t val2; }; int as_path_match(struct adata *path, struct f_path_mask *mask); /* a-set.c */ /* Extended Community subtypes (kinds) */ #define EC_RT 0x0002 #define EC_RO 0x0003 #define EC_GENERIC 0xFFFF /* Transitive bit (for first u32 half of EC) */ #define EC_TBIT 0x40000000 #define ECOMM_LENGTH 8 static inline int int_set_get_size(struct adata *list) { return list->length / 4; } static inline int ec_set_get_size(struct adata *list) { return list->length / 8; } static inline int lc_set_get_size(struct adata *list) { return list->length / 12; } static inline u32 *int_set_get_data(struct adata *list) { return (u32 *) list->data; } static inline u32 ec_hi(u64 ec) { return ec >> 32; } static inline u32 ec_lo(u64 ec) { return ec; } static inline u64 ec_get(const u32 *l, int i) { return (((u64) l[i]) << 32) | l[i+1]; } /* RFC 4360 3.1. Two-Octet AS Specific Extended Community */ static inline u64 ec_as2(u64 kind, u64 key, u64 val) { return ((kind | 0x0000) << 48) | (key << 32) | val; } /* RFC 5668 4-Octet AS Specific BGP Extended Community */ static inline u64 ec_as4(u64 kind, u64 key, u64 val) { return ((kind | 0x0200) << 48) | (key << 16) | val; } /* RFC 4360 3.2. IPv4 Address Specific Extended Community */ static inline u64 ec_ip4(u64 kind, u64 key, u64 val) { return ((kind | 0x0100) << 48) | (key << 16) | val; } static inline u64 ec_generic(u64 key, u64 val) { return (key << 32) | val; } /* Large community value */ typedef struct lcomm { u32 asn; u32 ldp1; u32 ldp2; } lcomm; #define LCOMM_LENGTH 12 static inline lcomm lc_get(const u32 *l, int i) { return (lcomm) { l[i], l[i+1], l[i+2] }; } static inline void lc_put(u32 *l, lcomm v) { l[0] = v.asn; l[1] = v.ldp1; l[2] = v.ldp2; } static inline int lc_match(const u32 *l, int i, lcomm v) { return (l[i] == v.asn && l[i+1] == v.ldp1 && l[i+2] == v.ldp2); } static inline u32 *lc_copy(u32 *dst, const u32 *src) { memcpy(dst, src, LCOMM_LENGTH); return dst + 3; } int int_set_format(struct adata *set, int way, int from, byte *buf, uint size); int ec_format(byte *buf, u64 ec); int ec_set_format(struct adata *set, int from, byte *buf, uint size); int lc_format(byte *buf, lcomm lc); int lc_set_format(struct adata *set, int from, byte *buf, uint size); int int_set_contains(struct adata *list, u32 val); int ec_set_contains(struct adata *list, u64 val); int lc_set_contains(struct adata *list, lcomm val); struct adata *int_set_prepend(struct linpool *pool, struct adata *list, u32 val); struct adata *int_set_add(struct linpool *pool, struct adata *list, u32 val); struct adata *ec_set_add(struct linpool *pool, struct adata *list, u64 val); struct adata *lc_set_add(struct linpool *pool, struct adata *list, lcomm val); struct adata *int_set_del(struct linpool *pool, struct adata *list, u32 val); struct adata *ec_set_del(struct linpool *pool, struct adata *list, u64 val); struct adata *lc_set_del(struct linpool *pool, struct adata *list, lcomm val); struct adata *int_set_union(struct linpool *pool, struct adata *l1, struct adata *l2); struct adata *ec_set_union(struct linpool *pool, struct adata *l1, struct adata *l2); struct adata *lc_set_union(struct linpool *pool, struct adata *l1, struct adata *l2); #endif bird-1.6.3/nest/password.c0000644000103200001440000000262113027054563014412 0ustar feelausers/* * BIRD -- Password handling * * (c) 1999 Pavel Machek * (c) 2004 Ondrej Filip * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "nest/bird.h" #include "nest/password.h" #include "lib/string.h" #include "lib/mac.h" struct password_item *last_password_item = NULL; struct password_item * password_find(list *l, int first_fit) { struct password_item *pi; struct password_item *pf = NULL; if (l) { WALK_LIST(pi, *l) { if ((pi->genfrom < now_real) && (pi->gento > now_real)) { if (first_fit) return pi; if (!pf || pf->genfrom < pi->genfrom) pf = pi; } } } return pf; } struct password_item * password_find_by_id(list *l, uint id) { struct password_item *pi; if (!l) return NULL; WALK_LIST(pi, *l) if ((pi->id == id) && (pi->accfrom <= now_real) && (now_real < pi->accto)) return pi; return NULL; } struct password_item * password_find_by_value(list *l, char *pass, uint size) { struct password_item *pi; if (!l) return NULL; WALK_LIST(pi, *l) if (password_verify(pi, pass, size) && (pi->accfrom <= now_real) && (now_real < pi->accto)) return pi; return NULL; } uint max_mac_length(list *l) { struct password_item *pi; uint val = 0; if (!l) return 0; WALK_LIST(pi, *l) val = MAX(val, mac_type_length(pi->alg)); return val; } bird-1.6.3/nest/rt-attr.c0000644000103200001440000007023013027054563014146 0ustar feelausers/* * BIRD -- Route Attribute Cache * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Route attribute cache * * Each route entry carries a set of route attributes. Several of them * vary from route to route, but most attributes are usually common * for a large number of routes. To conserve memory, we've decided to * store only the varying ones directly in the &rte and hold the rest * in a special structure called &rta which is shared among all the * &rte's with these attributes. * * Each &rta contains all the static attributes of the route (i.e., * those which are always present) as structure members and a list of * dynamic attributes represented by a linked list of &ea_list * structures, each of them consisting of an array of &eattr's containing * the individual attributes. An attribute can be specified more than once * in the &ea_list chain and in such case the first occurrence overrides * the others. This semantics is used especially when someone (for example * a filter) wishes to alter values of several dynamic attributes, but * it wants to preserve the original attribute lists maintained by * another module. * * Each &eattr contains an attribute identifier (split to protocol ID and * per-protocol attribute ID), protocol dependent flags, a type code (consisting * of several bit fields describing attribute characteristics) and either an * embedded 32-bit value or a pointer to a &adata structure holding attribute * contents. * * There exist two variants of &rta's -- cached and un-cached ones. Un-cached * &rta's can have arbitrarily complex structure of &ea_list's and they * can be modified by any module in the route processing chain. Cached * &rta's have their attribute lists normalized (that means at most one * &ea_list is present and its values are sorted in order to speed up * searching), they are stored in a hash table to make fast lookup possible * and they are provided with a use count to allow sharing. * * Routing tables always contain only cached &rta's. */ #include "nest/bird.h" #include "nest/route.h" #include "nest/protocol.h" #include "nest/iface.h" #include "nest/cli.h" #include "nest/attrs.h" #include "lib/alloca.h" #include "lib/hash.h" #include "lib/resource.h" #include "lib/string.h" pool *rta_pool; static slab *rta_slab; static slab *mpnh_slab; static slab *rte_src_slab; /* rte source ID bitmap */ static u32 *src_ids; static u32 src_id_size, src_id_used, src_id_pos; #define SRC_ID_INIT_SIZE 4 /* rte source hash */ #define RSH_KEY(n) n->proto, n->private_id #define RSH_NEXT(n) n->next #define RSH_EQ(p1,n1,p2,n2) p1 == p2 && n1 == n2 #define RSH_FN(p,n) p->hash_key ^ u32_hash(n) #define RSH_REHASH rte_src_rehash #define RSH_PARAMS /2, *2, 1, 1, 8, 20 #define RSH_INIT_ORDER 6 static HASH(struct rte_src) src_hash; struct protocol *attr_class_to_protocol[EAP_MAX]; static void rte_src_init(void) { rte_src_slab = sl_new(rta_pool, sizeof(struct rte_src)); src_id_pos = 0; src_id_size = SRC_ID_INIT_SIZE; src_ids = mb_allocz(rta_pool, src_id_size * sizeof(u32)); /* ID 0 is reserved */ src_ids[0] = 1; src_id_used = 1; HASH_INIT(src_hash, rta_pool, RSH_INIT_ORDER); } static inline int u32_cto(uint x) { return ffs(~x) - 1; } static inline u32 rte_src_alloc_id(void) { uint i, j; for (i = src_id_pos; i < src_id_size; i++) if (src_ids[i] != 0xffffffff) goto found; /* If we are at least 7/8 full, expand */ if (src_id_used > (src_id_size * 28)) { src_id_size *= 2; src_ids = mb_realloc(src_ids, src_id_size * sizeof(u32)); bzero(src_ids + i, (src_id_size - i) * sizeof(u32)); goto found; } for (i = 0; i < src_id_pos; i++) if (src_ids[i] != 0xffffffff) goto found; ASSERT(0); found: ASSERT(i < 0x8000000); src_id_pos = i; j = u32_cto(src_ids[i]); src_ids[i] |= (1 << j); src_id_used++; return 32 * i + j; } static inline void rte_src_free_id(u32 id) { int i = id / 32; int j = id % 32; ASSERT((i < src_id_size) && (src_ids[i] & (1 << j))); src_ids[i] &= ~(1 << j); src_id_used--; } HASH_DEFINE_REHASH_FN(RSH, struct rte_src) struct rte_src * rt_find_source(struct proto *p, u32 id) { return HASH_FIND(src_hash, RSH, p, id); } struct rte_src * rt_get_source(struct proto *p, u32 id) { struct rte_src *src = rt_find_source(p, id); if (src) return src; src = sl_alloc(rte_src_slab); src->proto = p; src->private_id = id; src->global_id = rte_src_alloc_id(); src->uc = 0; HASH_INSERT2(src_hash, RSH, rta_pool, src); return src; } void rt_prune_sources(void) { HASH_WALK_FILTER(src_hash, next, src, sp) { if (src->uc == 0) { HASH_DO_REMOVE(src_hash, RSH, sp); rte_src_free_id(src->global_id); sl_free(rte_src_slab, src); } } HASH_WALK_FILTER_END; HASH_MAY_RESIZE_DOWN(src_hash, RSH, rta_pool); } /* * Multipath Next Hop */ static inline uint mpnh_hash(struct mpnh *x) { uint h = 0; for (; x; x = x->next) h ^= ipa_hash(x->gw); return h; } int mpnh__same(struct mpnh *x, struct mpnh *y) { for (; x && y; x = x->next, y = y->next) if (!ipa_equal(x->gw, y->gw) || (x->iface != y->iface) || (x->weight != y->weight)) return 0; return x == y; } static int mpnh_compare_node(struct mpnh *x, struct mpnh *y) { int r; if (!x) return 1; if (!y) return -1; r = ((int) y->weight) - ((int) x->weight); if (r) return r; r = ipa_compare(x->gw, y->gw); if (r) return r; return ((int) x->iface->index) - ((int) y->iface->index); } static inline struct mpnh * mpnh_copy_node(const struct mpnh *src, linpool *lp) { struct mpnh *n = lp_alloc(lp, sizeof(struct mpnh)); n->gw = src->gw; n->iface = src->iface; n->next = NULL; n->weight = src->weight; return n; } /** * mpnh_merge - merge nexthop lists * @x: list 1 * @y: list 2 * @rx: reusability of list @x * @ry: reusability of list @y * @max: max number of nexthops * @lp: linpool for allocating nexthops * * The mpnh_merge() function takes two nexthop lists @x and @y and merges them, * eliminating possible duplicates. The input lists must be sorted and the * result is sorted too. The number of nexthops in result is limited by @max. * New nodes are allocated from linpool @lp. * * The arguments @rx and @ry specify whether corresponding input lists may be * consumed by the function (i.e. their nodes reused in the resulting list), in * that case the caller should not access these lists after that. To eliminate * issues with deallocation of these lists, the caller should use some form of * bulk deallocation (e.g. stack or linpool) to free these nodes when the * resulting list is no longer needed. When reusability is not set, the * corresponding lists are not modified nor linked from the resulting list. */ struct mpnh * mpnh_merge(struct mpnh *x, struct mpnh *y, int rx, int ry, int max, linpool *lp) { struct mpnh *root = NULL; struct mpnh **n = &root; while ((x || y) && max--) { int cmp = mpnh_compare_node(x, y); if (cmp < 0) { *n = rx ? x : mpnh_copy_node(x, lp); x = x->next; } else if (cmp > 0) { *n = ry ? y : mpnh_copy_node(y, lp); y = y->next; } else { *n = rx ? x : (ry ? y : mpnh_copy_node(x, lp)); x = x->next; y = y->next; } n = &((*n)->next); } *n = NULL; return root; } void mpnh_insert(struct mpnh **n, struct mpnh *x) { for (; *n; n = &((*n)->next)) { int cmp = mpnh_compare_node(*n, x); if (cmp < 0) continue; else if (cmp > 0) break; else return; } x->next = *n; *n = x; } int mpnh_is_sorted(struct mpnh *x) { for (; x && x->next; x = x->next) if (mpnh_compare_node(x, x->next) >= 0) return 0; return 1; } static struct mpnh * mpnh_copy(struct mpnh *o) { struct mpnh *first = NULL; struct mpnh **last = &first; for (; o; o = o->next) { struct mpnh *n = sl_alloc(mpnh_slab); n->gw = o->gw; n->iface = o->iface; n->next = NULL; n->weight = o->weight; *last = n; last = &(n->next); } return first; } static void mpnh_free(struct mpnh *o) { struct mpnh *n; while (o) { n = o->next; sl_free(mpnh_slab, o); o = n; } } /* * Extended Attributes */ static inline eattr * ea__find(ea_list *e, unsigned id) { eattr *a; int l, r, m; while (e) { if (e->flags & EALF_BISECT) { l = 0; r = e->count - 1; while (l <= r) { m = (l+r) / 2; a = &e->attrs[m]; if (a->id == id) return a; else if (a->id < id) l = m+1; else r = m-1; } } else for(m=0; mcount; m++) if (e->attrs[m].id == id) return &e->attrs[m]; e = e->next; } return NULL; } /** * ea_find - find an extended attribute * @e: attribute list to search in * @id: attribute ID to search for * * Given an extended attribute list, ea_find() searches for a first * occurrence of an attribute with specified ID, returning either a pointer * to its &eattr structure or %NULL if no such attribute exists. */ eattr * ea_find(ea_list *e, unsigned id) { eattr *a = ea__find(e, id & EA_CODE_MASK); if (a && (a->type & EAF_TYPE_MASK) == EAF_TYPE_UNDEF && !(id & EA_ALLOW_UNDEF)) return NULL; return a; } /** * ea_walk - walk through extended attributes * @s: walk state structure * @id: start of attribute ID interval * @max: length of attribute ID interval * * Given an extended attribute list, ea_walk() walks through the list looking * for first occurrences of attributes with ID in specified interval from @id to * (@id + @max - 1), returning pointers to found &eattr structures, storing its * walk state in @s for subsequent calls. * * The function ea_walk() is supposed to be called in a loop, with initially * zeroed walk state structure @s with filled the initial extended attribute * list, returning one found attribute in each call or %NULL when no other * attribute exists. The extended attribute list or the arguments should not be * modified between calls. The maximum value of @max is 128. */ eattr * ea_walk(struct ea_walk_state *s, uint id, uint max) { ea_list *e = s->eattrs; eattr *a = s->ea; eattr *a_max; max = id + max; if (a) goto step; for (; e; e = e->next) { if (e->flags & EALF_BISECT) { int l, r, m; l = 0; r = e->count - 1; while (l < r) { m = (l+r) / 2; if (e->attrs[m].id < id) l = m + 1; else r = m; } a = e->attrs + l; } else a = e->attrs; step: a_max = e->attrs + e->count; for (; a < a_max; a++) if ((a->id >= id) && (a->id < max)) { int n = a->id - id; if (BIT32_TEST(s->visited, n)) continue; BIT32_SET(s->visited, n); if ((a->type & EAF_TYPE_MASK) == EAF_TYPE_UNDEF) continue; s->eattrs = e; s->ea = a; return a; } else if (e->flags & EALF_BISECT) break; } return NULL; } /** * ea_get_int - fetch an integer attribute * @e: attribute list * @id: attribute ID * @def: default value * * This function is a shortcut for retrieving a value of an integer attribute * by calling ea_find() to find the attribute, extracting its value or returning * a provided default if no such attribute is present. */ int ea_get_int(ea_list *e, unsigned id, int def) { eattr *a = ea_find(e, id); if (!a) return def; return a->u.data; } static inline void ea_do_sort(ea_list *e) { unsigned n = e->count; eattr *a = e->attrs; eattr *b = alloca(n * sizeof(eattr)); unsigned s, ss; /* We need to use a stable sorting algorithm, hence mergesort */ do { s = ss = 0; while (s < n) { eattr *p, *q, *lo, *hi; p = b; ss = s; *p++ = a[s++]; while (s < n && p[-1].id <= a[s].id) *p++ = a[s++]; if (s < n) { q = p; *p++ = a[s++]; while (s < n && p[-1].id <= a[s].id) *p++ = a[s++]; lo = b; hi = q; s = ss; while (lo < q && hi < p) if (lo->id <= hi->id) a[s++] = *lo++; else a[s++] = *hi++; while (lo < q) a[s++] = *lo++; while (hi < p) a[s++] = *hi++; } } } while (ss); } static inline void ea_do_prune(ea_list *e) { eattr *s, *d, *l, *s0; int i = 0; /* Discard duplicates and undefs. Do you remember sorting was stable? */ s = d = e->attrs; l = e->attrs + e->count; while (s < l) { s0 = s++; while (s < l && s->id == s[-1].id) s++; /* s0 is the most recent version, s[-1] the oldest one */ if ((s0->type & EAF_TYPE_MASK) != EAF_TYPE_UNDEF) { *d = *s0; d->type = (d->type & ~EAF_ORIGINATED) | (s[-1].type & EAF_ORIGINATED); d++; i++; } } e->count = i; } /** * ea_sort - sort an attribute list * @e: list to be sorted * * This function takes a &ea_list chain and sorts the attributes * within each of its entries. * * If an attribute occurs multiple times in a single &ea_list, * ea_sort() leaves only the first (the only significant) occurrence. */ void ea_sort(ea_list *e) { while (e) { if (!(e->flags & EALF_SORTED)) { ea_do_sort(e); ea_do_prune(e); e->flags |= EALF_SORTED; } if (e->count > 5) e->flags |= EALF_BISECT; e = e->next; } } /** * ea_scan - estimate attribute list size * @e: attribute list * * This function calculates an upper bound of the size of * a given &ea_list after merging with ea_merge(). */ unsigned ea_scan(ea_list *e) { unsigned cnt = 0; while (e) { cnt += e->count; e = e->next; } return sizeof(ea_list) + sizeof(eattr)*cnt; } /** * ea_merge - merge segments of an attribute list * @e: attribute list * @t: buffer to store the result to * * This function takes a possibly multi-segment attribute list * and merges all of its segments to one. * * The primary use of this function is for &ea_list normalization: * first call ea_scan() to determine how much memory will the result * take, then allocate a buffer (usually using alloca()), merge the * segments with ea_merge() and finally sort and prune the result * by calling ea_sort(). */ void ea_merge(ea_list *e, ea_list *t) { eattr *d = t->attrs; t->flags = 0; t->count = 0; t->next = NULL; while (e) { memcpy(d, e->attrs, sizeof(eattr)*e->count); t->count += e->count; d += e->count; e = e->next; } } /** * ea_same - compare two &ea_list's * @x: attribute list * @y: attribute list * * ea_same() compares two normalized attribute lists @x and @y and returns * 1 if they contain the same attributes, 0 otherwise. */ int ea_same(ea_list *x, ea_list *y) { int c; if (!x || !y) return x == y; ASSERT(!x->next && !y->next); if (x->count != y->count) return 0; for(c=0; ccount; c++) { eattr *a = &x->attrs[c]; eattr *b = &y->attrs[c]; if (a->id != b->id || a->flags != b->flags || a->type != b->type || ((a->type & EAF_EMBEDDED) ? a->u.data != b->u.data : !adata_same(a->u.ptr, b->u.ptr))) return 0; } return 1; } static inline ea_list * ea_list_copy(ea_list *o) { ea_list *n; unsigned i, len; if (!o) return NULL; ASSERT(!o->next); len = sizeof(ea_list) + sizeof(eattr) * o->count; n = mb_alloc(rta_pool, len); memcpy(n, o, len); n->flags |= EALF_CACHED; for(i=0; icount; i++) { eattr *a = &n->attrs[i]; if (!(a->type & EAF_EMBEDDED)) { unsigned size = sizeof(struct adata) + a->u.ptr->length; struct adata *d = mb_alloc(rta_pool, size); memcpy(d, a->u.ptr, size); a->u.ptr = d; } } return n; } static inline void ea_free(ea_list *o) { int i; if (o) { ASSERT(!o->next); for(i=0; icount; i++) { eattr *a = &o->attrs[i]; if (!(a->type & EAF_EMBEDDED)) mb_free(a->u.ptr); } mb_free(o); } } static int get_generic_attr(eattr *a, byte **buf, int buflen UNUSED) { if (a->id == EA_GEN_IGP_METRIC) { *buf += bsprintf(*buf, "igp_metric"); return GA_NAME; } return GA_UNKNOWN; } void ea_format_bitfield(struct eattr *a, byte *buf, int bufsize, const char **names, int min, int max) { byte *bound = buf + bufsize - 32; u32 data = a->u.data; int i; for (i = min; i < max; i++) if ((data & (1u << i)) && names[i]) { if (buf > bound) { strcpy(buf, " ..."); return; } buf += bsprintf(buf, " %s", names[i]); data &= ~(1u << i); } if (data) bsprintf(buf, " %08x", data); return; } static inline void opaque_format(struct adata *ad, byte *buf, uint size) { byte *bound = buf + size - 10; uint i; for(i = 0; i < ad->length; i++) { if (buf > bound) { strcpy(buf, " ..."); return; } if (i) *buf++ = ' '; buf += bsprintf(buf, "%02x", ad->data[i]); } *buf = 0; return; } static inline void ea_show_int_set(struct cli *c, struct adata *ad, int way, byte *pos, byte *buf, byte *end) { int i = int_set_format(ad, way, 0, pos, end - pos); cli_printf(c, -1012, "\t%s", buf); while (i) { i = int_set_format(ad, way, i, buf, end - buf - 1); cli_printf(c, -1012, "\t\t%s", buf); } } static inline void ea_show_ec_set(struct cli *c, struct adata *ad, byte *pos, byte *buf, byte *end) { int i = ec_set_format(ad, 0, pos, end - pos); cli_printf(c, -1012, "\t%s", buf); while (i) { i = ec_set_format(ad, i, buf, end - buf - 1); cli_printf(c, -1012, "\t\t%s", buf); } } static inline void ea_show_lc_set(struct cli *c, struct adata *ad, byte *pos, byte *buf, byte *end) { int i = lc_set_format(ad, 0, pos, end - pos); cli_printf(c, -1012, "\t%s", buf); while (i) { i = lc_set_format(ad, i, buf, end - buf - 1); cli_printf(c, -1012, "\t\t%s", buf); } } /** * ea_show - print an &eattr to CLI * @c: destination CLI * @e: attribute to be printed * * This function takes an extended attribute represented by its &eattr * structure and prints it to the CLI according to the type information. * * If the protocol defining the attribute provides its own * get_attr() hook, it's consulted first. */ void ea_show(struct cli *c, eattr *e) { struct protocol *p; int status = GA_UNKNOWN; struct adata *ad = (e->type & EAF_EMBEDDED) ? NULL : e->u.ptr; byte buf[CLI_MSG_SIZE]; byte *pos = buf, *end = buf + sizeof(buf); if (p = attr_class_to_protocol[EA_PROTO(e->id)]) { pos += bsprintf(pos, "%s.", p->name); if (p->get_attr) status = p->get_attr(e, pos, end - pos); pos += strlen(pos); } else if (EA_PROTO(e->id)) pos += bsprintf(pos, "%02x.", EA_PROTO(e->id)); else status = get_generic_attr(e, &pos, end - pos); if (status < GA_NAME) pos += bsprintf(pos, "%02x", EA_ID(e->id)); if (status < GA_FULL) { *pos++ = ':'; *pos++ = ' '; switch (e->type & EAF_TYPE_MASK) { case EAF_TYPE_INT: bsprintf(pos, "%u", e->u.data); break; case EAF_TYPE_OPAQUE: opaque_format(ad, pos, end - pos); break; case EAF_TYPE_IP_ADDRESS: bsprintf(pos, "%I", *(ip_addr *) ad->data); break; case EAF_TYPE_ROUTER_ID: bsprintf(pos, "%R", e->u.data); break; case EAF_TYPE_AS_PATH: as_path_format(ad, pos, end - pos); break; case EAF_TYPE_BITFIELD: bsprintf(pos, "%08x", e->u.data); break; case EAF_TYPE_INT_SET: ea_show_int_set(c, ad, 1, pos, buf, end); return; case EAF_TYPE_EC_SET: ea_show_ec_set(c, ad, pos, buf, end); return; case EAF_TYPE_LC_SET: ea_show_lc_set(c, ad, pos, buf, end); return; case EAF_TYPE_UNDEF: default: bsprintf(pos, "", e->type); } } cli_printf(c, -1012, "\t%s", buf); } /** * ea_dump - dump an extended attribute * @e: attribute to be dumped * * ea_dump() dumps contents of the extended attribute given to * the debug output. */ void ea_dump(ea_list *e) { int i; if (!e) { debug("NONE"); return; } while (e) { debug("[%c%c%c]", (e->flags & EALF_SORTED) ? 'S' : 's', (e->flags & EALF_BISECT) ? 'B' : 'b', (e->flags & EALF_CACHED) ? 'C' : 'c'); for(i=0; icount; i++) { eattr *a = &e->attrs[i]; debug(" %02x:%02x.%02x", EA_PROTO(a->id), EA_ID(a->id), a->flags); if (a->type & EAF_TEMP) debug("T"); debug("=%c", "?iO?I?P???S?????" [a->type & EAF_TYPE_MASK]); if (a->type & EAF_ORIGINATED) debug("o"); if (a->type & EAF_EMBEDDED) debug(":%08x", a->u.data); else { int j, len = a->u.ptr->length; debug("[%d]:", len); for(j=0; ju.ptr->data[j]); } } if (e = e->next) debug(" | "); } } /** * ea_hash - calculate an &ea_list hash key * @e: attribute list * * ea_hash() takes an extended attribute list and calculated a hopefully * uniformly distributed hash value from its contents. */ inline uint ea_hash(ea_list *e) { u32 h = 0; int i; if (e) /* Assuming chain of length 1 */ { for(i=0; icount; i++) { struct eattr *a = &e->attrs[i]; h ^= a->id; if (a->type & EAF_EMBEDDED) h ^= a->u.data; else { struct adata *d = a->u.ptr; int size = d->length; byte *z = d->data; while (size >= 4) { h ^= *(u32 *)z; z += 4; size -= 4; } while (size--) h = (h >> 24) ^ (h << 8) ^ *z++; } } h ^= h >> 16; h ^= h >> 6; h &= 0xffff; } return h; } /** * ea_append - concatenate &ea_list's * @to: destination list (can be %NULL) * @what: list to be appended (can be %NULL) * * This function appends the &ea_list @what at the end of * &ea_list @to and returns a pointer to the resulting list. */ ea_list * ea_append(ea_list *to, ea_list *what) { ea_list *res; if (!to) return what; res = to; while (to->next) to = to->next; to->next = what; return res; } /* * rta's */ static uint rta_cache_count; static uint rta_cache_size = 32; static uint rta_cache_limit; static uint rta_cache_mask; static rta **rta_hash_table; static void rta_alloc_hash(void) { rta_hash_table = mb_allocz(rta_pool, sizeof(rta *) * rta_cache_size); if (rta_cache_size < 32768) rta_cache_limit = rta_cache_size * 2; else rta_cache_limit = ~0; rta_cache_mask = rta_cache_size - 1; } static inline uint rta_hash(rta *a) { return (((uint) (uintptr_t) a->src) ^ ipa_hash(a->gw) ^ mpnh_hash(a->nexthops) ^ ea_hash(a->eattrs)) & 0xffff; } static inline int rta_same(rta *x, rta *y) { return (x->src == y->src && x->source == y->source && x->scope == y->scope && x->cast == y->cast && x->dest == y->dest && x->flags == y->flags && x->igp_metric == y->igp_metric && ipa_equal(x->gw, y->gw) && ipa_equal(x->from, y->from) && x->iface == y->iface && x->hostentry == y->hostentry && mpnh_same(x->nexthops, y->nexthops) && ea_same(x->eattrs, y->eattrs)); } static rta * rta_copy(rta *o) { rta *r = sl_alloc(rta_slab); memcpy(r, o, sizeof(rta)); r->uc = 1; r->nexthops = mpnh_copy(o->nexthops); r->eattrs = ea_list_copy(o->eattrs); return r; } static inline void rta_insert(rta *r) { uint h = r->hash_key & rta_cache_mask; r->next = rta_hash_table[h]; if (r->next) r->next->pprev = &r->next; r->pprev = &rta_hash_table[h]; rta_hash_table[h] = r; } static void rta_rehash(void) { uint ohs = rta_cache_size; uint h; rta *r, *n; rta **oht = rta_hash_table; rta_cache_size = 2*rta_cache_size; DBG("Rehashing rta cache from %d to %d entries.\n", ohs, rta_cache_size); rta_alloc_hash(); for(h=0; hnext; rta_insert(r); } mb_free(oht); } /** * rta_lookup - look up a &rta in attribute cache * @o: a un-cached &rta * * rta_lookup() gets an un-cached &rta structure and returns its cached * counterpart. It starts with examining the attribute cache to see whether * there exists a matching entry. If such an entry exists, it's returned and * its use count is incremented, else a new entry is created with use count * set to 1. * * The extended attribute lists attached to the &rta are automatically * converted to the normalized form. */ rta * rta_lookup(rta *o) { rta *r; uint h; ASSERT(!(o->aflags & RTAF_CACHED)); if (o->eattrs) { if (o->eattrs->next) /* Multiple ea_list's, need to merge them */ { ea_list *ml = alloca(ea_scan(o->eattrs)); ea_merge(o->eattrs, ml); o->eattrs = ml; } ea_sort(o->eattrs); } h = rta_hash(o); for(r=rta_hash_table[h & rta_cache_mask]; r; r=r->next) if (r->hash_key == h && rta_same(r, o)) return rta_clone(r); r = rta_copy(o); r->hash_key = h; r->aflags = RTAF_CACHED; rt_lock_source(r->src); rt_lock_hostentry(r->hostentry); rta_insert(r); if (++rta_cache_count > rta_cache_limit) rta_rehash(); return r; } void rta__free(rta *a) { ASSERT(rta_cache_count && (a->aflags & RTAF_CACHED)); rta_cache_count--; *a->pprev = a->next; if (a->next) a->next->pprev = a->pprev; a->aflags = 0; /* Poison the entry */ rt_unlock_hostentry(a->hostentry); rt_unlock_source(a->src); mpnh_free(a->nexthops); ea_free(a->eattrs); sl_free(rta_slab, a); } rta * rta_do_cow(rta *o, linpool *lp) { rta *r = lp_alloc(lp, sizeof(rta)); memcpy(r, o, sizeof(rta)); r->aflags = 0; r->uc = 0; return r; } /** * rta_dump - dump route attributes * @a: attribute structure to dump * * This function takes a &rta and dumps its contents to the debug output. */ void rta_dump(rta *a) { static char *rts[] = { "RTS_DUMMY", "RTS_STATIC", "RTS_INHERIT", "RTS_DEVICE", "RTS_STAT_DEV", "RTS_REDIR", "RTS_RIP", "RTS_OSPF", "RTS_OSPF_IA", "RTS_OSPF_EXT1", "RTS_OSPF_EXT2", "RTS_BGP", "RTS_PIPE", "RTS_BABEL" }; static char *rtc[] = { "", " BC", " MC", " AC" }; static char *rtd[] = { "", " DEV", " HOLE", " UNREACH", " PROHIBIT" }; debug("p=%s uc=%d %s %s%s%s h=%04x", a->src->proto->name, a->uc, rts[a->source], ip_scope_text(a->scope), rtc[a->cast], rtd[a->dest], a->hash_key); if (!(a->aflags & RTAF_CACHED)) debug(" !CACHED"); debug(" <-%I", a->from); if (a->dest == RTD_ROUTER) debug(" ->%I", a->gw); if (a->dest == RTD_DEVICE || a->dest == RTD_ROUTER) debug(" [%s]", a->iface ? a->iface->name : "???" ); if (a->eattrs) { debug(" EA: "); ea_dump(a->eattrs); } } /** * rta_dump_all - dump attribute cache * * This function dumps the whole contents of route attribute cache * to the debug output. */ void rta_dump_all(void) { rta *a; uint h; debug("Route attribute cache (%d entries, rehash at %d):\n", rta_cache_count, rta_cache_limit); for(h=0; hnext) { debug("%p ", a); rta_dump(a); debug("\n"); } debug("\n"); } void rta_show(struct cli *c, rta *a, ea_list *eal) { static char *src_names[] = { "dummy", "static", "inherit", "device", "static-device", "redirect", "RIP", "OSPF", "OSPF-IA", "OSPF-E1", "OSPF-E2", "BGP", "pipe" }; static char *cast_names[] = { "unicast", "broadcast", "multicast", "anycast" }; int i; cli_printf(c, -1008, "\tType: %s %s %s", src_names[a->source], cast_names[a->cast], ip_scope_text(a->scope)); if (!eal) eal = a->eattrs; for(; eal; eal=eal->next) for(i=0; icount; i++) ea_show(c, &eal->attrs[i]); } /** * rta_init - initialize route attribute cache * * This function is called during initialization of the routing * table module to set up the internals of the attribute cache. */ void rta_init(void) { rta_pool = rp_new(&root_pool, "Attributes"); rta_slab = sl_new(rta_pool, sizeof(rta)); mpnh_slab = sl_new(rta_pool, sizeof(struct mpnh)); rta_alloc_hash(); rte_src_init(); } /* * Documentation for functions declared inline in route.h */ #if 0 /** * rta_clone - clone route attributes * @r: a &rta to be cloned * * rta_clone() takes a cached &rta and returns its identical cached * copy. Currently it works by just returning the original &rta with * its use count incremented. */ static inline rta *rta_clone(rta *r) { DUMMY; } /** * rta_free - free route attributes * @r: a &rta to be freed * * If you stop using a &rta (for example when deleting a route which uses * it), you need to call rta_free() to notify the attribute cache the * attribute is no longer in use and can be freed if you were the last * user (which rta_free() tests by inspecting the use count). */ static inline void rta_free(rta *r) { DUMMY; } #endif bird-1.6.3/nest/locks.h0000644000103200001440000000324013027054563013666 0ustar feelausers/* * BIRD Object Locks * * (c) 1999 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_LOCKS_H_ #define _BIRD_LOCKS_H_ #include "lib/resource.h" #include "lib/event.h" /* * The object locks are used for controlling exclusive access * to various physical resources like UDP ports on specific devices. * When you want to access such resource, you ask for a object lock * structure, fill in specification of the object and your function * you want to have called when the object is available and invoke * olock_acquire() afterwards. When the object becomes free, the lock * manager calls your function. To free the object lock, just call rfree * on its resource. */ struct object_lock { resource r; ip_addr addr; /* Identification of a object: IP address */ uint type; /* ... object type (OBJLOCK_xxx) */ uint port; /* ... port number */ uint inst; /* ... instance ID */ struct iface *iface; /* ... interface */ void (*hook)(struct object_lock *); /* Called when the lock succeeds */ void *data; /* User data */ /* ... internal to lock manager, don't touch ... */ node n; /* Node in list of olocks */ int state; /* OLOCK_STATE_xxx */ list waiters; /* Locks waiting for the same resource */ }; struct object_lock *olock_new(pool *); void olock_acquire(struct object_lock *); void olock_init(void); #define OBJLOCK_UDP 1 /* UDP port */ #define OBJLOCK_TCP 2 /* TCP port */ #define OBJLOCK_IP 3 /* IP protocol */ #define OLOCK_STATE_FREE 0 #define OLOCK_STATE_LOCKED 1 #define OLOCK_STATE_WAITING 2 #define OLOCK_STATE_EVENT 3 /* waiting for unlock processing */ #endif bird-1.6.3/nest/cmds.h0000644000103200001440000000067313027054563013510 0ustar feelausers/* * BIRD Internet Routing Daemon -- CLI Commands Which Don't Fit Anywhere Else * * (c) 2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ struct sym_show_data { int type; /* Symbols type to show */ struct symbol *sym; }; struct f_inst; void cmd_show_status(void); void cmd_show_symbols(struct sym_show_data *sym); void cmd_show_memory(void); void cmd_eval(struct f_inst *expr); bird-1.6.3/nest/a-path.c0000644000103200001440000002370613027054563013731 0ustar feelausers/* * BIRD -- Path Operations * * (c) 2000 Martin Mares * (c) 2000 Pavel Machek * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "nest/bird.h" #include "nest/route.h" #include "nest/attrs.h" #include "lib/resource.h" #include "lib/unaligned.h" #include "lib/string.h" #include "filter/filter.h" // static inline void put_as(byte *data, u32 as) { put_u32(data, as); } // static inline u32 get_as(byte *data) { return get_u32(data); } #define put_as put_u32 #define get_as get_u32 #define BS 4 struct adata * as_path_prepend(struct linpool *pool, struct adata *olda, u32 as) { struct adata *newa; if (olda->length && olda->data[0] == AS_PATH_SEQUENCE && olda->data[1] < 255) /* Starting with sequence => just prepend the AS number */ { int nl = olda->length + BS; newa = lp_alloc(pool, sizeof(struct adata) + nl); newa->length = nl; newa->data[0] = AS_PATH_SEQUENCE; newa->data[1] = olda->data[1] + 1; memcpy(newa->data + BS + 2, olda->data + 2, olda->length - 2); } else /* Create new path segment */ { int nl = olda->length + BS + 2; newa = lp_alloc(pool, sizeof(struct adata) + nl); newa->length = nl; newa->data[0] = AS_PATH_SEQUENCE; newa->data[1] = 1; memcpy(newa->data + BS + 2, olda->data, olda->length); } put_as(newa->data + 2, as); return newa; } int as_path_convert_to_old(struct adata *path, byte *dst, int *new_used) { byte *src = path->data; byte *src_end = src + path->length; byte *dst_start = dst; u32 as; int i, n; *new_used = 0; while (src < src_end) { n = src[1]; *dst++ = *src++; *dst++ = *src++; for(i=0; i 0xFFFF) { as = AS_TRANS; *new_used = 1; } put_u16(dst, as); src += 4; dst += 2; } } return dst - dst_start; } int as_path_convert_to_new(struct adata *path, byte *dst, int req_as) { byte *src = path->data; byte *src_end = src + path->length; byte *dst_start = dst; u32 as; int i, t, n; while ((src < src_end) && (req_as > 0)) { t = *src++; n = *src++; if (t == AS_PATH_SEQUENCE) { if (n > req_as) n = req_as; req_as -= n; } else // t == AS_PATH_SET req_as--; *dst++ = t; *dst++ = n; for(i=0; idata; byte *e = p + path->length; byte *end = buf + size - 16; int sp = 1; int l, isset; while (p < e) { if (buf > end) { strcpy(buf, " ..."); return; } isset = (*p++ == AS_PATH_SET); l = *p++; if (isset) { if (!sp) *buf++ = ' '; *buf++ = '{'; sp = 0; } while (l-- && buf <= end) { if (!sp) *buf++ = ' '; buf += bsprintf(buf, "%u", get_as(p)); p += BS; sp = 0; } if (isset) { *buf++ = ' '; *buf++ = '}'; sp = 0; } } *buf = 0; } int as_path_getlen(struct adata *path) { return as_path_getlen_int(path, BS); } int as_path_getlen_int(struct adata *path, int bs) { int res = 0; u8 *p = path->data; u8 *q = p+path->length; int len; while (pdata; u8 *q = p+path->length; int len; while (pdata; u8 *q = p+path->length; u32 res = 0; int len; while (pdata; if ((path->length == 0) || (p[0] != AS_PATH_SEQUENCE) || (p[1] == 0)) return 0; else { *last_as = get_as(p+2); return 1; } } int as_path_contains(struct adata *path, u32 as, int min) { u8 *p = path->data; u8 *q = p+path->length; int num = 0; int i, n; while (pdata; u8 *q = p+path->length; int i, n; while (plength; u8 *p = path->data; u8 *q = path->data + len; u8 *d, *d2; int i, bt, sn, dn; u8 buf[len]; d = buf; while (p 0) { /* Nonempty block, set block header and advance */ d[0] = bt; d[1] = dn; d = d2; } } uint nl = d - buf; if (nl == path->length) return path; struct adata *res = lp_alloc(pool, sizeof(struct adata) + nl); res->length = nl; memcpy(res->data, buf, nl); return res; } struct pm_pos { u8 set; u8 mark; union { char *sp; u32 asn; } val; }; static int parse_path(struct adata *path, struct pm_pos *pos) { u8 *p = path->data; u8 *q = p + path->length; struct pm_pos *opos = pos; int i, len; while (p < q) switch (*p++) { case AS_PATH_SET: pos->set = 1; pos->mark = 0; pos->val.sp = p; len = *p; p += 1 + BS * len; pos++; break; case AS_PATH_SEQUENCE: len = *p++; for (i = 0; i < len; i++) { pos->set = 0; pos->mark = 0; pos->val.asn = get_as(p); p += BS; pos++; } break; default: bug("as_path_match: Invalid path component"); } return pos - opos; } static int pm_match(struct pm_pos *pos, u32 asn, u32 asn2) { u32 gas; if (! pos->set) return ((pos->val.asn >= asn) && (pos->val.asn <= asn2)); u8 *p = pos->val.sp; int len = *p++; int i; for (i = 0; i < len; i++) { gas = get_as(p + i * BS); if ((gas >= asn) && (gas <= asn2)) return 1; } return 0; } static void pm_mark(struct pm_pos *pos, int i, int plen, int *nl, int *nh) { int j; if (pos[i].set) pos[i].mark = 1; for (j = i + 1; (j < plen) && pos[j].set && (! pos[j].mark); j++) pos[j].mark = 1; pos[j].mark = 1; /* We are going downwards, therefore every mark is new low and just the first mark is new high */ *nl = i + (pos[i].set ? 0 : 1); if (*nh < 0) *nh = j; } /* AS path matching is nontrivial. Because AS path can * contain sets, it is not a plain wildcard matching. A set * in an AS path is interpreted as it might represent any * sequence of AS numbers from that set (possibly with * repetitions). So it is also a kind of a pattern, * more complicated than a path mask. * * The algorithm for AS path matching is a variant * of nondeterministic finite state machine, where * positions in AS path are states, and items in * path mask are input for that finite state machine. * During execution of the algorithm we maintain a set * of marked states - a state is marked if it can be * reached by any walk through NFSM with regard to * currently processed part of input. When we process * next part of mask, we advance each marked state. * We start with marked first position, when we * run out of marked positions, we reject. When * we process the whole mask, we accept if final position * (auxiliary position after last real position in AS path) * is marked. */ int as_path_match(struct adata *path, struct f_path_mask *mask) { struct pm_pos pos[2048 + 1]; int plen = parse_path(path, pos); int l, h, i, nh, nl; u32 val = 0; u32 val2 = 0; /* l and h are bound of interval of positions where are marked states */ pos[plen].set = 0; pos[plen].mark = 0; l = h = 0; pos[0].mark = 1; while (mask) { /* We remove this mark to not step after pos[plen] */ pos[plen].mark = 0; switch (mask->kind) { case PM_ASTERISK: for (i = l; i <= plen; i++) pos[i].mark = 1; h = plen; break; case PM_ASN: /* Define single ASN as ASN..ASN - very narrow interval */ val2 = val = mask->val; goto step; case PM_ASN_EXPR: val2 = val = f_eval_asn((struct f_inst *) mask->val); goto step; case PM_ASN_RANGE: val = mask->val; val2 = mask->val2; goto step; case PM_QUESTION: step: nh = nl = -1; for (i = h; i >= l; i--) if (pos[i].mark) { pos[i].mark = 0; if ((mask->kind == PM_QUESTION) || pm_match(pos + i, val, val2)) pm_mark(pos, i, plen, &nl, &nh); } if (nh < 0) return 0; h = nh; l = nl; break; } mask = mask->next; } return pos[plen].mark; } bird-1.6.3/nest/rt-roa.c0000644000103200001440000002360413027054563013760 0ustar feelausers/* * BIRD -- Route Origin Authorization * * * Can be freely distributed and used under the terms of the GNU GPL. */ #undef LOCAL_DEBUG #include "nest/bird.h" #include "nest/route.h" #include "nest/cli.h" #include "lib/lists.h" #include "lib/resource.h" #include "lib/event.h" #include "lib/string.h" #include "conf/conf.h" pool *roa_pool; static slab *roa_slab; /* Slab of struct roa_item */ static list roa_table_list; /* List of struct roa_table */ struct roa_table *roa_table_default; /* The first ROA table in the config */ static inline int src_match(struct roa_item *it, byte src) { return !src || it->src == src; } /** * roa_add_item - add a ROA entry * @t: ROA table * @prefix: prefix of the ROA entry * @pxlen: prefix length of the ROA entry * @maxlen: max length field of the ROA entry * @asn: AS number field of the ROA entry * @src: source of the ROA entry (ROA_SRC_*) * * The function adds a new ROA entry to the ROA table. If the same ROA * is already in the table, nothing is added. @src field is used to * distinguish different sources of ROAs. */ void roa_add_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src) { struct roa_node *n = fib_get(&t->fib, &prefix, pxlen); // if ((n->items == NULL) && (n->n.x0 != ROA_INVALID)) // t->cached_items--; struct roa_item *it; for (it = n->items; it; it = it->next) if ((it->maxlen == maxlen) && (it->asn == asn) && src_match(it, src)) return; it = sl_alloc(roa_slab); it->asn = asn; it->maxlen = maxlen; it->src = src; it->next = n->items; n->items = it; } /** * roa_delete_item - delete a ROA entry * @t: ROA table * @prefix: prefix of the ROA entry * @pxlen: prefix length of the ROA entry * @maxlen: max length field of the ROA entry * @asn: AS number field of the ROA entry * @src: source of the ROA entry (ROA_SRC_*) * * The function removes a specified ROA entry from the ROA table and * frees it. If @src field is not ROA_SRC_ANY, only entries from * that source are considered. */ void roa_delete_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src) { struct roa_node *n = fib_find(&t->fib, &prefix, pxlen); if (!n) return; struct roa_item *it, **itp; for (itp = &n->items; it = *itp; itp = &it->next) if ((it->maxlen == maxlen) && (it->asn == asn) && src_match(it, src)) break; if (!it) return; *itp = it->next; sl_free(roa_slab, it); // if ((n->items == NULL) && (n->n.x0 != ROA_INVALID)) // t->cached_items++; } /** * roa_flush - flush a ROA table * @t: ROA table * @src: source of ROA entries (ROA_SRC_*) * * The function removes and frees ROA entries from the ROA table. If * @src is ROA_SRC_ANY, all entries in the table are removed, * otherwise only all entries from that source are removed. */ void roa_flush(struct roa_table *t, byte src) { struct roa_item *it, **itp; struct roa_node *n; FIB_WALK(&t->fib, fn) { n = (struct roa_node *) fn; itp = &n->items; while (it = *itp) if (src_match(it, src)) { *itp = it->next; sl_free(roa_slab, it); } else itp = &it->next; } FIB_WALK_END; // TODO add cleanup of roa_nodes } /* byte roa_check(struct roa_table *t, ip_addr prefix, byte pxlen, u32 asn) { struct roa_node *n = fib_find(&t->fib, &prefix, pxlen); if (n && n->n.x0 == ROA_UNKNOWN) return ROA_UNKNOWN; if (n && n->n.x0 == ROA_VALID && asn == n->cached_asn) return ROA_VALID; byte rv = roa_match(t, n, prefix, pxlen, asn); if (rv != ROA_INVALID) { if (!n) { if (t->cached_items >= t->cached_items_max) n = fib_get(&t->fib, &prefix, pxlen); t->cached_items++; } n->cached_asn = asn; n->n.x0 = rv; } return rv; } */ /** * roa_check - check validity of route origination in a ROA table * @t: ROA table * @prefix: network prefix to check * @pxlen: length of network prefix * @asn: AS number of network prefix * * Implements RFC 6483 route validation for the given network * prefix. The procedure is to find all candidate ROAs - ROAs whose * prefixes cover the give network prefix. If there is no candidate * ROA, return ROA_UNKNOWN. If there is a candidate ROA with matching * ASN and maxlen field greater than or equal to the given prefix * length, return ROA_VALID. Otherwise return ROA_INVALID. If caller * cannot determine origin AS, 0 could be used (in that case ROA_VALID * cannot happen). */ byte roa_check(struct roa_table *t, ip_addr prefix, byte pxlen, u32 asn) { struct roa_node *n; ip_addr px; byte anything = 0; int len; for (len = pxlen; len >= 0; len--) { px = ipa_and(prefix, ipa_mkmask(len)); n = fib_find(&t->fib, &px, len); if (!n) continue; struct roa_item *it; for (it = n->items; it; it = it->next) { anything = 1; if ((it->maxlen >= pxlen) && (it->asn == asn) && asn) return ROA_VALID; } } return anything ? ROA_INVALID : ROA_UNKNOWN; } static void roa_node_init(struct fib_node *fn) { struct roa_node *n = (struct roa_node *) fn; n->items = NULL; } static inline void roa_populate(struct roa_table *t) { struct roa_item_config *ric; for (ric = t->cf->roa_items; ric; ric = ric->next) roa_add_item(t, ric->prefix, ric->pxlen, ric->maxlen, ric->asn, ROA_SRC_CONFIG); } static void roa_new_table(struct roa_table_config *cf) { struct roa_table *t; t = mb_allocz(roa_pool, sizeof(struct roa_table)); fib_init(&t->fib, roa_pool, sizeof(struct roa_node), 0, roa_node_init); t->name = cf->name; t->cf = cf; cf->table = t; add_tail(&roa_table_list, &t->n); roa_populate(t); } struct roa_table_config * roa_new_table_config(struct symbol *s) { struct roa_table_config *rtc = cfg_allocz(sizeof(struct roa_table_config)); cf_define_symbol(s, SYM_ROA, rtc); rtc->name = s->name; add_tail(&new_config->roa_tables, &rtc->n); return rtc; } /** * roa_add_item_config - add a static ROA entry to a ROA table configuration * * Arguments are self-explanatory. The first is the ROA table config, rest * are specifying the ROA entry. */ void roa_add_item_config(struct roa_table_config *rtc, ip_addr prefix, byte pxlen, byte maxlen, u32 asn) { struct roa_item_config *ric = cfg_allocz(sizeof(struct roa_item_config)); ric->prefix = prefix; ric->pxlen = pxlen; ric->maxlen = maxlen; ric->asn = asn; ric->next = rtc->roa_items; rtc->roa_items = ric; } /** * roa_init - initialize ROA tables * * This function is called during BIRD startup. It initializes * the ROA table module. */ void roa_init(void) { roa_pool = rp_new(&root_pool, "ROA tables"); roa_slab = sl_new(roa_pool, sizeof(struct roa_item)); init_list(&roa_table_list); } void roa_preconfig(struct config *c) { init_list(&c->roa_tables); } /** * roa_commit - commit new ROA table configuration * @new: new configuration * @old: original configuration or %NULL if it's boot time config * * Scan differences between @old and @new configuration and modify the * ROA tables according to these changes. If @new defines a previously * unknown table, create it, if it omits a table existing in @old, * delete it (there are no references, only indirect through struct * roa_table_config). If it exists in both configurations, update the * configured ROA entries. */ void roa_commit(struct config *new, struct config *old) { struct roa_table_config *cf; struct roa_table *t; if (old) WALK_LIST(t, roa_table_list) { struct symbol *sym = cf_find_symbol(new, t->name); if (sym && sym->class == SYM_ROA) { /* Found old table in new config */ cf = sym->def; cf->table = t; t->name = cf->name; t->cf = cf; /* Reconfigure it */ roa_flush(t, ROA_SRC_CONFIG); roa_populate(t); } else { t->cf->table = NULL; /* Free it now */ roa_flush(t, ROA_SRC_ANY); rem_node(&t->n); fib_free(&t->fib); mb_free(t); } } /* Add new tables */ WALK_LIST(cf, new->roa_tables) if (! cf->table) roa_new_table(cf); roa_table_default = EMPTY_LIST(new->roa_tables) ? NULL : ((struct roa_table_config *) HEAD(new->roa_tables))->table; } static void roa_show_node(struct cli *c, struct roa_node *rn, int len, u32 asn) { struct roa_item *ri; for (ri = rn->items; ri; ri = ri->next) if ((ri->maxlen >= len) && (!asn || (ri->asn == asn))) cli_printf(c, -1019, "%I/%d max %d as %u", rn->n.prefix, rn->n.pxlen, ri->maxlen, ri->asn); } static void roa_show_cont(struct cli *c) { struct roa_show_data *d = c->rover; struct fib *fib = &d->table->fib; struct fib_iterator *it = &d->fit; struct roa_node *rn; unsigned max = 32; FIB_ITERATE_START(fib, it, f) { rn = (struct roa_node *) f; if (!max--) { FIB_ITERATE_PUT(it, f); return; } if ((d->mode == ROA_SHOW_ALL) || net_in_net(rn->n.prefix, rn->n.pxlen, d->prefix, d->pxlen)) roa_show_node(c, rn, 0, d->asn); } FIB_ITERATE_END(f); cli_printf(c, 0, ""); c->cont = c->cleanup = NULL; } static void roa_show_cleanup(struct cli *c) { struct roa_show_data *d = c->rover; /* Unlink the iterator */ fit_get(&d->table->fib, &d->fit); } void roa_show(struct roa_show_data *d) { struct roa_node *rn; ip_addr px; int len; switch (d->mode) { case ROA_SHOW_ALL: case ROA_SHOW_IN: FIB_ITERATE_INIT(&d->fit, &d->table->fib); this_cli->cont = roa_show_cont; this_cli->cleanup = roa_show_cleanup; this_cli->rover = d; break; case ROA_SHOW_PX: rn = fib_find(&d->table->fib, &d->prefix, d->pxlen); if (rn) { roa_show_node(this_cli, rn, 0, d->asn); cli_msg(0, ""); } else cli_msg(-8001, "Network not in table"); break; case ROA_SHOW_FOR: for (len = d->pxlen; len >= 0; len--) { px = ipa_and(d->prefix, ipa_mkmask(len)); rn = fib_find(&d->table->fib, &px, len); if (!rn) continue; roa_show_node(this_cli, rn, 0, d->asn); } cli_msg(0, ""); break; } } bird-1.6.3/nest/rt-dev.c0000644000103200001440000000720513027054563013754 0ustar feelausers/* * BIRD -- Direct Device Routes * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Direct * * The Direct protocol works by converting all ifa_notify() events it receives * to rte_update() calls for the corresponding network. */ #undef LOCAL_DEBUG #include "nest/bird.h" #include "nest/iface.h" #include "nest/protocol.h" #include "nest/route.h" #include "nest/rt-dev.h" #include "conf/conf.h" #include "lib/resource.h" #include "lib/string.h" static void dev_ifa_notify(struct proto *p, unsigned c, struct ifa *ad) { struct rt_dev_config *P = (void *) p->cf; if (!EMPTY_LIST(P->iface_list) && !iface_patt_find(&P->iface_list, ad->iface, ad->iface->addr)) /* Empty list is automagically treated as "*" */ return; if (ad->flags & IA_SECONDARY) return; if (ad->scope <= SCOPE_LINK) return; if (c & IF_CHANGE_DOWN) { net *n; DBG("dev_if_notify: %s:%I going down\n", ad->iface->name, ad->ip); n = net_find(p->table, ad->prefix, ad->pxlen); if (!n) { DBG("dev_if_notify: device shutdown: prefix not found\n"); return; } /* Use iface ID as local source ID */ struct rte_src *src = rt_get_source(p, ad->iface->index); rte_update2(p->main_ahook, n, NULL, src); } else if (c & IF_CHANGE_UP) { rta *a; net *n; rte *e; DBG("dev_if_notify: %s:%I going up\n", ad->iface->name, ad->ip); if (P->check_link && !(ad->iface->flags & IF_LINK_UP)) return; /* Use iface ID as local source ID */ struct rte_src *src = rt_get_source(p, ad->iface->index); rta a0 = { .src = src, .source = RTS_DEVICE, .scope = SCOPE_UNIVERSE, .cast = RTC_UNICAST, .dest = RTD_DEVICE, .iface = ad->iface }; a = rta_lookup(&a0); n = net_get(p->table, ad->prefix, ad->pxlen); e = rte_get_temp(a); e->net = n; e->pflags = 0; rte_update2(p->main_ahook, n, e, src); } } static void dev_if_notify(struct proto *p, uint c, struct iface *iface) { struct rt_dev_config *cf = (void *) p->cf; if (c & (IF_CHANGE_UP | IF_CHANGE_DOWN)) return; if ((c & IF_CHANGE_LINK) && cf->check_link) { uint ac = (iface->flags & IF_LINK_UP) ? IF_CHANGE_UP : IF_CHANGE_DOWN; struct ifa *a; WALK_LIST(a, iface->addrs) dev_ifa_notify(p, ac, a); } } static struct proto * dev_init(struct proto_config *c) { struct proto *p = proto_new(c, sizeof(struct proto)); p->if_notify = dev_if_notify; p->ifa_notify = dev_ifa_notify; return p; } static int dev_reconfigure(struct proto *p, struct proto_config *new) { struct rt_dev_config *o = (struct rt_dev_config *) p->cf; struct rt_dev_config *n = (struct rt_dev_config *) new; return iface_patts_equal(&o->iface_list, &n->iface_list, NULL) && (o->check_link == n->check_link); } static void dev_copy_config(struct proto_config *dest, struct proto_config *src) { struct rt_dev_config *d = (struct rt_dev_config *) dest; struct rt_dev_config *s = (struct rt_dev_config *) src; /* * We copy iface_list as ifaces can be shared by more direct protocols. * Copy suffices to be is shallow, because new nodes can be added, but * old nodes cannot be modified (although they contain internal lists). */ cfg_copy_list(&d->iface_list, &s->iface_list, sizeof(struct iface_patt)); d->check_link = s->check_link; } struct protocol proto_device = { .name = "Direct", .template = "direct%d", .preference = DEF_PREF_DIRECT, .config_size = sizeof(struct rt_dev_config), .init = dev_init, .reconfigure = dev_reconfigure, .copy_config = dev_copy_config }; bird-1.6.3/nest/iface.c0000644000103200001440000004276013027054563013627 0ustar feelausers/* * BIRD -- Management of Interfaces and Neighbor Cache * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Interfaces * * The interface module keeps track of all network interfaces in the * system and their addresses. * * Each interface is represented by an &iface structure which carries * interface capability flags (%IF_MULTIACCESS, %IF_BROADCAST etc.), * MTU, interface name and index and finally a linked list of network * prefixes assigned to the interface, each one represented by * struct &ifa. * * The interface module keeps a `soft-up' state for each &iface which * is a conjunction of link being up, the interface being of a `sane' * type and at least one IP address assigned to it. */ #undef LOCAL_DEBUG #include "nest/bird.h" #include "nest/iface.h" #include "nest/protocol.h" #include "nest/cli.h" #include "lib/resource.h" #include "lib/string.h" #include "conf/conf.h" static pool *if_pool; list iface_list; /** * ifa_dump - dump interface address * @a: interface address descriptor * * This function dumps contents of an &ifa to the debug output. */ void ifa_dump(struct ifa *a) { debug("\t%I, net %I/%-2d bc %I -> %I%s%s%s\n", a->ip, a->prefix, a->pxlen, a->brd, a->opposite, (a->flags & IF_UP) ? "" : " DOWN", (a->flags & IA_PRIMARY) ? "" : " SEC", (a->flags & IA_PEER) ? "PEER" : ""); } /** * if_dump - dump interface * @i: interface to dump * * This function dumps all information associated with a given * network interface to the debug output. */ void if_dump(struct iface *i) { struct ifa *a; debug("IF%d: %s", i->index, i->name); if (i->flags & IF_SHUTDOWN) debug(" SHUTDOWN"); if (i->flags & IF_UP) debug(" UP"); else debug(" DOWN"); if (i->flags & IF_ADMIN_UP) debug(" LINK-UP"); if (i->flags & IF_MULTIACCESS) debug(" MA"); if (i->flags & IF_BROADCAST) debug(" BC"); if (i->flags & IF_MULTICAST) debug(" MC"); if (i->flags & IF_LOOPBACK) debug(" LOOP"); if (i->flags & IF_IGNORE) debug(" IGN"); if (i->flags & IF_TMP_DOWN) debug(" TDOWN"); debug(" MTU=%d\n", i->mtu); WALK_LIST(a, i->addrs) { ifa_dump(a); ASSERT((a != i->addr) == !(a->flags & IA_PRIMARY)); } } /** * if_dump_all - dump all interfaces * * This function dumps information about all known network * interfaces to the debug output. */ void if_dump_all(void) { struct iface *i; debug("Known network interfaces:\n"); WALK_LIST(i, iface_list) if_dump(i); debug("Router ID: %08x\n", config->router_id); } static inline unsigned if_what_changed(struct iface *i, struct iface *j) { unsigned c; if (((i->flags ^ j->flags) & ~(IF_UP | IF_SHUTDOWN | IF_UPDATED | IF_ADMIN_UP | IF_LINK_UP | IF_TMP_DOWN | IF_JUST_CREATED)) || i->index != j->index) return IF_CHANGE_TOO_MUCH; c = 0; if ((i->flags ^ j->flags) & IF_UP) c |= (i->flags & IF_UP) ? IF_CHANGE_DOWN : IF_CHANGE_UP; if ((i->flags ^ j->flags) & IF_LINK_UP) c |= IF_CHANGE_LINK; if (i->mtu != j->mtu) c |= IF_CHANGE_MTU; return c; } static inline void if_copy(struct iface *to, struct iface *from) { to->flags = from->flags | (to->flags & IF_TMP_DOWN); to->mtu = from->mtu; } static inline void ifa_send_notify(struct proto *p, unsigned c, struct ifa *a) { if (p->ifa_notify) { if (p->debug & D_IFACES) log(L_TRACE "%s < %s address %I/%d on interface %s %s", p->name, (a->flags & IA_PRIMARY) ? "primary" : "secondary", a->prefix, a->pxlen, a->iface->name, (c & IF_CHANGE_UP) ? "added" : "removed"); p->ifa_notify(p, c, a); } } static void ifa_notify_change_(unsigned c, struct ifa *a) { struct proto *p; DBG("IFA change notification (%x) for %s:%I\n", c, a->iface->name, a->ip); WALK_LIST(p, active_proto_list) ifa_send_notify(p, c, a); } static inline void ifa_notify_change(unsigned c, struct ifa *a) { if (c & IF_CHANGE_DOWN) neigh_ifa_update(a); ifa_notify_change_(c, a); if (c & IF_CHANGE_UP) neigh_ifa_update(a); } static inline void if_send_notify(struct proto *p, unsigned c, struct iface *i) { if (p->if_notify) { if (p->debug & D_IFACES) log(L_TRACE "%s < interface %s %s", p->name, i->name, (c & IF_CHANGE_UP) ? "goes up" : (c & IF_CHANGE_DOWN) ? "goes down" : (c & IF_CHANGE_MTU) ? "changes MTU" : (c & IF_CHANGE_LINK) ? "changes link" : (c & IF_CHANGE_CREATE) ? "created" : "sends unknown event"); p->if_notify(p, c, i); } } static void if_notify_change(unsigned c, struct iface *i) { struct proto *p; struct ifa *a; if (i->flags & IF_JUST_CREATED) { i->flags &= ~IF_JUST_CREATED; c |= IF_CHANGE_CREATE | IF_CHANGE_MTU; } DBG("Interface change notification (%x) for %s\n", c, i->name); #ifdef LOCAL_DEBUG if_dump(i); #endif if (c & IF_CHANGE_DOWN) neigh_if_down(i); if (c & IF_CHANGE_DOWN) WALK_LIST(a, i->addrs) { a->flags = (i->flags & ~IA_FLAGS) | (a->flags & IA_FLAGS); ifa_notify_change_(IF_CHANGE_DOWN, a); } WALK_LIST(p, active_proto_list) if_send_notify(p, c, i); if (c & IF_CHANGE_UP) WALK_LIST(a, i->addrs) { a->flags = (i->flags & ~IA_FLAGS) | (a->flags & IA_FLAGS); ifa_notify_change_(IF_CHANGE_UP, a); } if (c & IF_CHANGE_UP) neigh_if_up(i); if ((c & (IF_CHANGE_UP | IF_CHANGE_DOWN | IF_CHANGE_LINK)) == IF_CHANGE_LINK) neigh_if_link(i); } static unsigned if_recalc_flags(struct iface *i, unsigned flags) { if ((flags & (IF_SHUTDOWN | IF_TMP_DOWN)) || !(flags & IF_ADMIN_UP) || !i->addr) flags &= ~IF_UP; else flags |= IF_UP; return flags; } static void if_change_flags(struct iface *i, unsigned flags) { unsigned of = i->flags; i->flags = if_recalc_flags(i, flags); if ((i->flags ^ of) & IF_UP) if_notify_change((i->flags & IF_UP) ? IF_CHANGE_UP : IF_CHANGE_DOWN, i); } /** * if_delete - remove interface * @old: interface * * This function is called by the low-level platform dependent code * whenever it notices an interface disappears. It is just a shorthand * for if_update(). */ void if_delete(struct iface *old) { struct iface f = {}; strncpy(f.name, old->name, sizeof(f.name)-1); f.flags = IF_SHUTDOWN; if_update(&f); } /** * if_update - update interface status * @new: new interface status * * if_update() is called by the low-level platform dependent code * whenever it notices an interface change. * * There exist two types of interface updates -- synchronous and asynchronous * ones. In the synchronous case, the low-level code calls if_start_update(), * scans all interfaces reported by the OS, uses if_update() and ifa_update() * to pass them to the core and then it finishes the update sequence by * calling if_end_update(). When working asynchronously, the sysdep code * calls if_update() and ifa_update() whenever it notices a change. * * if_update() will automatically notify all other modules about the change. */ struct iface * if_update(struct iface *new) { struct iface *i; unsigned c; WALK_LIST(i, iface_list) if (!strcmp(new->name, i->name)) { new->addr = i->addr; new->flags = if_recalc_flags(new, new->flags); c = if_what_changed(i, new); if (c & IF_CHANGE_TOO_MUCH) /* Changed a lot, convert it to down/up */ { DBG("Interface %s changed too much -- forcing down/up transition\n", i->name); if_change_flags(i, i->flags | IF_TMP_DOWN); rem_node(&i->n); new->addr = i->addr; memcpy(&new->addrs, &i->addrs, sizeof(i->addrs)); memcpy(i, new, sizeof(*i)); i->flags &= ~IF_UP; /* IF_TMP_DOWN will be added later */ goto newif; } if_copy(i, new); if (c) if_notify_change(c, i); i->flags |= IF_UPDATED; return i; } i = mb_alloc(if_pool, sizeof(struct iface)); memcpy(i, new, sizeof(*i)); init_list(&i->addrs); newif: init_list(&i->neighbors); i->flags |= IF_UPDATED | IF_TMP_DOWN; /* Tmp down as we don't have addresses yet */ add_tail(&iface_list, &i->n); return i; } void if_start_update(void) { struct iface *i; struct ifa *a; WALK_LIST(i, iface_list) { i->flags &= ~IF_UPDATED; WALK_LIST(a, i->addrs) a->flags &= ~IF_UPDATED; } } void if_end_partial_update(struct iface *i) { if (i->flags & IF_TMP_DOWN) if_change_flags(i, i->flags & ~IF_TMP_DOWN); } void if_end_update(void) { struct iface *i; struct ifa *a, *b; WALK_LIST(i, iface_list) { if (!(i->flags & IF_UPDATED)) if_change_flags(i, (i->flags & ~IF_ADMIN_UP) | IF_SHUTDOWN); else { WALK_LIST_DELSAFE(a, b, i->addrs) if (!(a->flags & IF_UPDATED)) ifa_delete(a); if_end_partial_update(i); } } } void if_flush_ifaces(struct proto *p) { if (p->debug & D_EVENTS) log(L_TRACE "%s: Flushing interfaces", p->name); if_start_update(); if_end_update(); } /** * if_feed_baby - advertise interfaces to a new protocol * @p: protocol to feed * * When a new protocol starts, this function sends it a series * of notifications about all existing interfaces. */ void if_feed_baby(struct proto *p) { struct iface *i; struct ifa *a; if (!p->if_notify && !p->ifa_notify) /* shortcut */ return; DBG("Announcing interfaces to new protocol %s\n", p->name); WALK_LIST(i, iface_list) { if_send_notify(p, IF_CHANGE_CREATE | ((i->flags & IF_UP) ? IF_CHANGE_UP : 0), i); if (i->flags & IF_UP) WALK_LIST(a, i->addrs) ifa_send_notify(p, IF_CHANGE_CREATE | IF_CHANGE_UP, a); } } /** * if_find_by_index - find interface by ifindex * @idx: ifindex * * This function finds an &iface structure corresponding to an interface * of the given index @idx. Returns a pointer to the structure or %NULL * if no such structure exists. */ struct iface * if_find_by_index(unsigned idx) { struct iface *i; WALK_LIST(i, iface_list) if (i->index == idx && !(i->flags & IF_SHUTDOWN)) return i; return NULL; } /** * if_find_by_name - find interface by name * @name: interface name * * This function finds an &iface structure corresponding to an interface * of the given name @name. Returns a pointer to the structure or %NULL * if no such structure exists. */ struct iface * if_find_by_name(char *name) { struct iface *i; WALK_LIST(i, iface_list) if (!strcmp(i->name, name)) return i; return NULL; } struct iface * if_get_by_name(char *name) { struct iface *i; if (i = if_find_by_name(name)) return i; /* No active iface, create a dummy */ i = mb_allocz(if_pool, sizeof(struct iface)); strncpy(i->name, name, sizeof(i->name)-1); i->flags = IF_SHUTDOWN; init_list(&i->addrs); init_list(&i->neighbors); add_tail(&iface_list, &i->n); return i; } struct ifa *kif_choose_primary(struct iface *i); static int ifa_recalc_primary(struct iface *i) { struct ifa *a = kif_choose_primary(i); if (a == i->addr) return 0; if (i->addr) i->addr->flags &= ~IA_PRIMARY; if (a) { a->flags |= IA_PRIMARY; rem_node(&a->n); add_head(&i->addrs, &a->n); } i->addr = a; return 1; } void ifa_recalc_all_primary_addresses(void) { struct iface *i; WALK_LIST(i, iface_list) { if (ifa_recalc_primary(i)) if_change_flags(i, i->flags | IF_TMP_DOWN); } } static inline int ifa_same(struct ifa *a, struct ifa *b) { return ipa_equal(a->ip, b->ip) && ipa_equal(a->prefix, b->prefix) && a->pxlen == b->pxlen; } /** * ifa_update - update interface address * @a: new interface address * * This function adds address information to a network * interface. It's called by the platform dependent code during * the interface update process described under if_update(). */ struct ifa * ifa_update(struct ifa *a) { struct iface *i = a->iface; struct ifa *b; WALK_LIST(b, i->addrs) if (ifa_same(b, a)) { if (ipa_equal(b->brd, a->brd) && ipa_equal(b->opposite, a->opposite) && b->scope == a->scope && !((b->flags ^ a->flags) & IA_PEER)) { b->flags |= IF_UPDATED; return b; } ifa_delete(b); break; } #ifndef IPV6 if ((i->flags & IF_BROADCAST) && !ipa_nonzero(a->brd)) log(L_ERR "Missing broadcast address for interface %s", i->name); #endif b = mb_alloc(if_pool, sizeof(struct ifa)); memcpy(b, a, sizeof(struct ifa)); add_tail(&i->addrs, &b->n); b->flags = (i->flags & ~IA_FLAGS) | (a->flags & IA_FLAGS); if (ifa_recalc_primary(i)) if_change_flags(i, i->flags | IF_TMP_DOWN); if (b->flags & IF_UP) ifa_notify_change(IF_CHANGE_CREATE | IF_CHANGE_UP, b); return b; } /** * ifa_delete - remove interface address * @a: interface address * * This function removes address information from a network * interface. It's called by the platform dependent code during * the interface update process described under if_update(). */ void ifa_delete(struct ifa *a) { struct iface *i = a->iface; struct ifa *b; WALK_LIST(b, i->addrs) if (ifa_same(b, a)) { rem_node(&b->n); if (b->flags & IF_UP) { b->flags &= ~IF_UP; ifa_notify_change(IF_CHANGE_DOWN, b); } if (b->flags & IA_PRIMARY) { if_change_flags(i, i->flags | IF_TMP_DOWN); ifa_recalc_primary(i); } mb_free(b); return; } } u32 if_choose_router_id(struct iface_patt *mask UNUSED6, u32 old_id UNUSED6) { #ifndef IPV6 struct iface *i; struct ifa *a, *b; b = NULL; WALK_LIST(i, iface_list) { if (!(i->flags & IF_ADMIN_UP) || (i->flags & IF_SHUTDOWN)) continue; WALK_LIST(a, i->addrs) { if (a->flags & IA_SECONDARY) continue; if (a->scope <= SCOPE_LINK) continue; /* Check pattern if specified */ if (mask && !iface_patt_match(mask, i, a)) continue; /* No pattern or pattern matched */ if (!b || ipa_to_u32(a->ip) < ipa_to_u32(b->ip)) b = a; } } if (!b) return 0; u32 id = ipa_to_u32(b->ip); if (id != old_id) log(L_INFO "Chosen router ID %R according to interface %s", id, b->iface->name); return id; #else return 0; #endif } /** * if_init - initialize interface module * * This function is called during BIRD startup to initialize * all data structures of the interface module. */ void if_init(void) { if_pool = rp_new(&root_pool, "Interfaces"); init_list(&iface_list); neigh_init(if_pool); } /* * Interface Pattern Lists */ int iface_patt_match(struct iface_patt *ifp, struct iface *i, struct ifa *a) { struct iface_patt_node *p; WALK_LIST(p, ifp->ipn_list) { char *t = p->pattern; int pos = p->positive; if (t) { if (*t == '-') { t++; pos = !pos; } if (!patmatch(t, i->name)) continue; } if (p->pxlen == 0) return pos; if (!a) continue; if (ipa_in_net(a->ip, p->prefix, p->pxlen)) return pos; if ((a->flags & IA_PEER) && ipa_in_net(a->opposite, p->prefix, p->pxlen)) return pos; continue; } return 0; } struct iface_patt * iface_patt_find(list *l, struct iface *i, struct ifa *a) { struct iface_patt *p; WALK_LIST(p, *l) if (iface_patt_match(p, i, a)) return p; return NULL; } static int iface_plists_equal(struct iface_patt *pa, struct iface_patt *pb) { struct iface_patt_node *x, *y; x = HEAD(pa->ipn_list); y = HEAD(pb->ipn_list); while (x->n.next && y->n.next) { if ((x->positive != y->positive) || (!x->pattern && y->pattern) || /* This nasty lines where written by me... :-( Feela */ (!y->pattern && x->pattern) || ((x->pattern != y->pattern) && strcmp(x->pattern, y->pattern)) || !ipa_equal(x->prefix, y->prefix) || (x->pxlen != y->pxlen)) return 0; x = (void *) x->n.next; y = (void *) y->n.next; } return (!x->n.next && !y->n.next); } int iface_patts_equal(list *a, list *b, int (*comp)(struct iface_patt *, struct iface_patt *)) { struct iface_patt *x, *y; x = HEAD(*a); y = HEAD(*b); while (x->n.next && y->n.next) { if (!iface_plists_equal(x, y) || (comp && !comp(x, y))) return 0; x = (void *) x->n.next; y = (void *) y->n.next; } return (!x->n.next && !y->n.next); } /* * CLI commands. */ static void if_show_addr(struct ifa *a) { byte opp[STD_ADDRESS_P_LENGTH + 16]; if (ipa_nonzero(a->opposite)) bsprintf(opp, ", opposite %I", a->opposite); else opp[0] = 0; cli_msg(-1003, "\t%I/%d (%s%s, scope %s)", a->ip, a->pxlen, (a->flags & IA_PRIMARY) ? "Primary" : (a->flags & IA_SECONDARY) ? "Secondary" : "Unselected", opp, ip_scope_text(a->scope)); } void if_show(void) { struct iface *i; struct ifa *a; char *type; WALK_LIST(i, iface_list) { if (i->flags & IF_SHUTDOWN) continue; cli_msg(-1001, "%s %s (index=%d)", i->name, (i->flags & IF_UP) ? "up" : "DOWN", i->index); if (!(i->flags & IF_MULTIACCESS)) type = "PtP"; else type = "MultiAccess"; cli_msg(-1004, "\t%s%s%s Admin%s Link%s%s%s MTU=%d", type, (i->flags & IF_BROADCAST) ? " Broadcast" : "", (i->flags & IF_MULTICAST) ? " Multicast" : "", (i->flags & IF_ADMIN_UP) ? "Up" : "Down", (i->flags & IF_LINK_UP) ? "Up" : "Down", (i->flags & IF_LOOPBACK) ? " Loopback" : "", (i->flags & IF_IGNORE) ? " Ignored" : "", i->mtu); if (i->addr) if_show_addr(i->addr); WALK_LIST(a, i->addrs) if (a != i->addr) if_show_addr(a); } cli_msg(0, ""); } void if_show_summary(void) { struct iface *i; byte addr[STD_ADDRESS_P_LENGTH + 16]; cli_msg(-2005, "interface state address"); WALK_LIST(i, iface_list) { if (i->addr) bsprintf(addr, "%I/%d", i->addr->ip, i->addr->pxlen); else addr[0] = 0; cli_msg(-1005, "%-9s %-5s %s", i->name, (i->flags & IF_UP) ? "up" : "DOWN", addr); } cli_msg(0, ""); } bird-1.6.3/nest/cmds.c0000644000103200001440000000477513027054563013512 0ustar feelausers/* * BIRD Internet Routing Daemon -- CLI Commands Which Don't Fit Anywhere Else * * (c) 2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "nest/bird.h" #include "nest/protocol.h" #include "nest/route.h" #include "nest/cli.h" #include "conf/conf.h" #include "nest/cmds.h" #include "lib/string.h" #include "lib/resource.h" #include "filter/filter.h" extern int shutting_down; extern int configuring; void cmd_show_status(void) { byte tim[TM_DATETIME_BUFFER_SIZE]; cli_msg(-1000, "BIRD " BIRD_VERSION); tm_format_datetime(tim, &config->tf_base, now); cli_msg(-1011, "Router ID is %R", config->router_id); cli_msg(-1011, "Current server time is %s", tim); tm_format_datetime(tim, &config->tf_base, boot_time); cli_msg(-1011, "Last reboot on %s", tim); tm_format_datetime(tim, &config->tf_base, config->load_time); cli_msg(-1011, "Last reconfiguration on %s", tim); graceful_restart_show_status(); if (shutting_down) cli_msg(13, "Shutdown in progress"); else if (configuring) cli_msg(13, "Reconfiguration in progress"); else cli_msg(13, "Daemon is up and running"); } void cmd_show_symbols(struct sym_show_data *sd) { int pos = 0; struct symbol *sym = sd->sym; if (sym) cli_msg(1010, "%-8s\t%s", sym->name, cf_symbol_class_name(sym)); else { while (sym = cf_walk_symbols(config, sym, &pos)) { if (sd->type && (sym->class != sd->type)) continue; cli_msg(-1010, "%-8s\t%s", sym->name, cf_symbol_class_name(sym)); } cli_msg(0, ""); } } static void print_size(char *dsc, size_t val) { char *px = " kMG"; int i = 0; while ((val >= 10000) && (i < 3)) { val = (val + 512) / 1024; i++; } cli_msg(-1018, "%-17s %4u %cB", dsc, (unsigned) val, px[i]); } extern pool *rt_table_pool; extern pool *rta_pool; extern pool *roa_pool; extern pool *proto_pool; void cmd_show_memory(void) { cli_msg(-1018, "BIRD memory usage"); print_size("Routing tables:", rmemsize(rt_table_pool)); print_size("Route attributes:", rmemsize(rta_pool)); print_size("ROA tables:", rmemsize(roa_pool)); print_size("Protocols:", rmemsize(proto_pool)); print_size("Total:", rmemsize(&root_pool)); cli_msg(0, ""); } void cmd_eval(struct f_inst *expr) { struct f_val v = f_eval(expr, this_cli->parser_pool); if (v.type == T_RETURN) { cli_msg(8008, "runtime error"); return; } buffer buf; LOG_BUFFER_INIT(buf); val_format(v, &buf); cli_msg(23, "%s", buf.start); } bird-1.6.3/nest/rt-table.c0000644000103200001440000020276213027054563014272 0ustar feelausers/* * BIRD -- Routing Tables * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Routing tables * * Routing tables are probably the most important structures BIRD uses. They * hold all the information about known networks, the associated routes and * their attributes. * * There are multiple routing tables (a primary one together with any * number of secondary ones if requested by the configuration). Each table * is basically a FIB containing entries describing the individual * destination networks. For each network (represented by structure &net), * there is a one-way linked list of route entries (&rte), the first entry * on the list being the best one (i.e., the one we currently use * for routing), the order of the other ones is undetermined. * * The &rte contains information specific to the route (preference, protocol * metrics, time of last modification etc.) and a pointer to a &rta structure * (see the route attribute module for a precise explanation) holding the * remaining route attributes which are expected to be shared by multiple * routes in order to conserve memory. */ #undef LOCAL_DEBUG #include "nest/bird.h" #include "nest/route.h" #include "nest/protocol.h" #include "nest/cli.h" #include "nest/iface.h" #include "lib/resource.h" #include "lib/event.h" #include "lib/string.h" #include "conf/conf.h" #include "filter/filter.h" #include "lib/string.h" #include "lib/alloca.h" pool *rt_table_pool; static slab *rte_slab; static linpool *rte_update_pool; static list routing_tables; static byte *rt_format_via(rte *e); static void rt_free_hostcache(rtable *tab); static void rt_notify_hostcache(rtable *tab, net *net); static void rt_update_hostcache(rtable *tab); static void rt_next_hop_update(rtable *tab); static inline int rt_prune_table(rtable *tab); static inline void rt_schedule_gc(rtable *tab); static inline void rt_schedule_prune(rtable *tab); static inline struct ea_list * make_tmp_attrs(struct rte *rt, struct linpool *pool) { struct ea_list *(*mta)(struct rte *rt, struct linpool *pool); mta = rt->attrs->src->proto->make_tmp_attrs; return mta ? mta(rt, pool) : NULL; } /* Like fib_route(), but skips empty net entries */ static net * net_route(rtable *tab, ip_addr a, int len) { ip_addr a0; net *n; while (len >= 0) { a0 = ipa_and(a, ipa_mkmask(len)); n = fib_find(&tab->fib, &a0, len); if (n && rte_is_valid(n->routes)) return n; len--; } return NULL; } static void rte_init(struct fib_node *N) { net *n = (net *) N; N->flags = 0; n->routes = NULL; } /** * rte_find - find a route * @net: network node * @src: route source * * The rte_find() function returns a route for destination @net * which is from route source @src. */ rte * rte_find(net *net, struct rte_src *src) { rte *e = net->routes; while (e && e->attrs->src != src) e = e->next; return e; } /** * rte_get_temp - get a temporary &rte * @a: attributes to assign to the new route (a &rta; in case it's * un-cached, rte_update() will create a cached copy automatically) * * Create a temporary &rte and bind it with the attributes @a. * Also set route preference to the default preference set for * the protocol. */ rte * rte_get_temp(rta *a) { rte *e = sl_alloc(rte_slab); e->attrs = a; e->flags = 0; e->pref = a->src->proto->preference; return e; } rte * rte_do_cow(rte *r) { rte *e = sl_alloc(rte_slab); memcpy(e, r, sizeof(rte)); e->attrs = rta_clone(r->attrs); e->flags = 0; return e; } /** * rte_cow_rta - get a private writable copy of &rte with writable &rta * @r: a route entry to be copied * @lp: a linpool from which to allocate &rta * * rte_cow_rta() takes a &rte and prepares it and associated &rta for * modification. There are three possibilities: First, both &rte and &rta are * private copies, in that case they are returned unchanged. Second, &rte is * private copy, but &rta is cached, in that case &rta is duplicated using * rta_do_cow(). Third, both &rte is shared and &rta is cached, in that case * both structures are duplicated by rte_do_cow() and rta_do_cow(). * * Note that in the second case, cached &rta loses one reference, while private * copy created by rta_do_cow() is a shallow copy sharing indirect data (eattrs, * nexthops, ...) with it. To work properly, original shared &rta should have * another reference during the life of created private copy. * * Result: a pointer to the new writable &rte with writable &rta. */ rte * rte_cow_rta(rte *r, linpool *lp) { if (!rta_is_cached(r->attrs)) return r; rte *e = rte_cow(r); rta *a = rta_do_cow(r->attrs, lp); rta_free(e->attrs); e->attrs = a; return e; } static int /* Actually better or at least as good as */ rte_better(rte *new, rte *old) { int (*better)(rte *, rte *); if (!rte_is_valid(old)) return 1; if (!rte_is_valid(new)) return 0; if (new->pref > old->pref) return 1; if (new->pref < old->pref) return 0; if (new->attrs->src->proto->proto != old->attrs->src->proto->proto) { /* * If the user has configured protocol preferences, so that two different protocols * have the same preference, try to break the tie by comparing addresses. Not too * useful, but keeps the ordering of routes unambiguous. */ return new->attrs->src->proto->proto > old->attrs->src->proto->proto; } if (better = new->attrs->src->proto->rte_better) return better(new, old); return 0; } static int rte_mergable(rte *pri, rte *sec) { int (*mergable)(rte *, rte *); if (!rte_is_valid(pri) || !rte_is_valid(sec)) return 0; if (pri->pref != sec->pref) return 0; if (pri->attrs->src->proto->proto != sec->attrs->src->proto->proto) return 0; if (mergable = pri->attrs->src->proto->rte_mergable) return mergable(pri, sec); return 0; } static void rte_trace(struct proto *p, rte *e, int dir, char *msg) { log(L_TRACE "%s %c %s %I/%d %s", p->name, dir, msg, e->net->n.prefix, e->net->n.pxlen, rt_format_via(e)); } static inline void rte_trace_in(uint flag, struct proto *p, rte *e, char *msg) { if (p->debug & flag) rte_trace(p, e, '>', msg); } static inline void rte_trace_out(uint flag, struct proto *p, rte *e, char *msg) { if (p->debug & flag) rte_trace(p, e, '<', msg); } static rte * export_filter_(struct announce_hook *ah, rte *rt0, rte **rt_free, ea_list **tmpa, linpool *pool, int silent) { struct proto *p = ah->proto; struct filter *filter = ah->out_filter; struct proto_stats *stats = ah->stats; ea_list *tmpb = NULL; rte *rt; int v; rt = rt0; *rt_free = NULL; if (!tmpa) tmpa = &tmpb; *tmpa = make_tmp_attrs(rt, pool); v = p->import_control ? p->import_control(p, &rt, tmpa, pool) : 0; if (v < 0) { if (silent) goto reject; stats->exp_updates_rejected++; if (v == RIC_REJECT) rte_trace_out(D_FILTERS, p, rt, "rejected by protocol"); goto reject; } if (v > 0) { if (!silent) rte_trace_out(D_FILTERS, p, rt, "forced accept by protocol"); goto accept; } v = filter && ((filter == FILTER_REJECT) || (f_run(filter, &rt, tmpa, pool, FF_FORCE_TMPATTR) > F_ACCEPT)); if (v) { if (silent) goto reject; stats->exp_updates_filtered++; rte_trace_out(D_FILTERS, p, rt, "filtered out"); goto reject; } accept: if (rt != rt0) *rt_free = rt; return rt; reject: /* Discard temporary rte */ if (rt != rt0) rte_free(rt); return NULL; } static inline rte * export_filter(struct announce_hook *ah, rte *rt0, rte **rt_free, ea_list **tmpa, int silent) { return export_filter_(ah, rt0, rt_free, tmpa, rte_update_pool, silent); } static void do_rt_notify(struct announce_hook *ah, net *net, rte *new, rte *old, ea_list *tmpa, int refeed) { struct proto *p = ah->proto; struct proto_stats *stats = ah->stats; /* * First, apply export limit. * * Export route limits has several problems. Because exp_routes * counter is reset before refeed, we don't really know whether * limit is breached and whether the update is new or not. Therefore * the number of really exported routes may exceed the limit * temporarily (routes exported before and new routes in refeed). * * Minor advantage is that if the limit is decreased and refeed is * requested, the number of exported routes really decrease. * * Second problem is that with export limits, we don't know whether * old was really exported (it might be blocked by limit). When a * withdraw is exported, we announce it even when the previous * update was blocked. This is not a big issue, but the same problem * is in updating exp_routes counter. Therefore, to be consistent in * increases and decreases of exp_routes, we count exported routes * regardless of blocking by limits. * * Similar problem is in handling updates - when a new route is * received and blocking is active, the route would be blocked, but * when an update for the route will be received later, the update * would be propagated (as old != NULL). Therefore, we have to block * also non-new updates (contrary to import blocking). */ struct proto_limit *l = ah->out_limit; if (l && new) { if ((!old || refeed) && (stats->exp_routes >= l->limit)) proto_notify_limit(ah, l, PLD_OUT, stats->exp_routes); if (l->state == PLS_BLOCKED) { stats->exp_routes++; /* see note above */ stats->exp_updates_rejected++; rte_trace_out(D_FILTERS, p, new, "rejected [limit]"); new = NULL; if (!old) return; } } if (new) stats->exp_updates_accepted++; else stats->exp_withdraws_accepted++; /* Hack: We do not decrease exp_routes during refeed, we instead reset exp_routes at the start of refeed. */ if (new) stats->exp_routes++; if (old && !refeed) stats->exp_routes--; if (p->debug & D_ROUTES) { if (new && old) rte_trace_out(D_ROUTES, p, new, "replaced"); else if (new) rte_trace_out(D_ROUTES, p, new, "added"); else if (old) rte_trace_out(D_ROUTES, p, old, "removed"); } if (!new) p->rt_notify(p, ah->table, net, NULL, old, NULL); else if (tmpa) { ea_list *t = tmpa; while (t->next) t = t->next; t->next = new->attrs->eattrs; p->rt_notify(p, ah->table, net, new, old, tmpa); t->next = NULL; } else p->rt_notify(p, ah->table, net, new, old, new->attrs->eattrs); } static void rt_notify_basic(struct announce_hook *ah, net *net, rte *new0, rte *old0, int refeed) { struct proto *p = ah->proto; struct proto_stats *stats = ah->stats; rte *new = new0; rte *old = old0; rte *new_free = NULL; rte *old_free = NULL; ea_list *tmpa = NULL; if (new) stats->exp_updates_received++; else stats->exp_withdraws_received++; /* * This is a tricky part - we don't know whether route 'old' was * exported to protocol 'p' or was filtered by the export filter. * We try to run the export filter to know this to have a correct * value in 'old' argument of rte_update (and proper filter value) * * FIXME - this is broken because 'configure soft' may change * filters but keep routes. Refeed is expected to be called after * change of the filters and with old == new, therefore we do not * even try to run the filter on an old route, This may lead to * 'spurious withdraws' but ensure that there are no 'missing * withdraws'. * * This is not completely safe as there is a window between * reconfiguration and the end of refeed - if a newly filtered * route disappears during this period, proper withdraw is not * sent (because old would be also filtered) and the route is * not refeeded (because it disappeared before that). */ if (new) new = export_filter(ah, new, &new_free, &tmpa, 0); if (old && !refeed) old = export_filter(ah, old, &old_free, NULL, 1); if (!new && !old) { /* * As mentioned above, 'old' value may be incorrect in some race conditions. * We generally ignore it with the exception of withdraw to pipe protocol. * In that case we rather propagate unfiltered withdraws regardless of * export filters to ensure that when a protocol is flushed, its routes are * removed from all tables. Possible spurious unfiltered withdraws are not * problem here as they are ignored if there is no corresponding route at * the other end of the pipe. We directly call rt_notify() hook instead of * do_rt_notify() to avoid logging and stat counters. */ #ifdef CONFIG_PIPE if ((p->proto == &proto_pipe) && !new0 && (p != old0->sender->proto)) p->rt_notify(p, ah->table, net, NULL, old0, NULL); #endif return; } do_rt_notify(ah, net, new, old, tmpa, refeed); /* Discard temporary rte's */ if (new_free) rte_free(new_free); if (old_free) rte_free(old_free); } static void rt_notify_accepted(struct announce_hook *ah, net *net, rte *new_changed, rte *old_changed, rte *before_old, int feed) { // struct proto *p = ah->proto; struct proto_stats *stats = ah->stats; rte *r; rte *new_best = NULL; rte *old_best = NULL; rte *new_free = NULL; rte *old_free = NULL; ea_list *tmpa = NULL; /* Used to track whether we met old_changed position. If before_old is NULL old_changed was the first and we met it implicitly before current best route. */ int old_meet = old_changed && !before_old; /* Note that before_old is either NULL or valid (not rejected) route. If old_changed is valid, before_old have to be too. If old changed route was not valid, caller must use NULL for both old_changed and before_old. */ if (new_changed) stats->exp_updates_received++; else stats->exp_withdraws_received++; /* First, find the new_best route - first accepted by filters */ for (r=net->routes; rte_is_valid(r); r=r->next) { if (new_best = export_filter(ah, r, &new_free, &tmpa, 0)) break; /* Note if we walked around the position of old_changed route */ if (r == before_old) old_meet = 1; } /* * Second, handle the feed case. That means we do not care for * old_best. It is NULL for feed, and the new_best for refeed. * For refeed, there is a hack similar to one in rt_notify_basic() * to ensure withdraws in case of changed filters */ if (feed) { if (feed == 2) /* refeed */ old_best = new_best ? new_best : (rte_is_valid(net->routes) ? net->routes : NULL); else old_best = NULL; if (!new_best && !old_best) return; goto found; } /* * Now, we find the old_best route. Generally, it is the same as the * new_best, unless new_best is the same as new_changed or * old_changed is accepted before new_best. * * There are four cases: * * - We would find and accept old_changed before new_best, therefore * old_changed is old_best. In remaining cases we suppose this * is not true. * * - We found no new_best, therefore there is also no old_best and * we ignore this withdraw. * * - We found new_best different than new_changed, therefore * old_best is the same as new_best and we ignore this update. * * - We found new_best the same as new_changed, therefore it cannot * be old_best and we have to continue search for old_best. */ /* First case */ if (old_meet) if (old_best = export_filter(ah, old_changed, &old_free, NULL, 1)) goto found; /* Second case */ if (!new_best) return; /* Third case, we use r instead of new_best, because export_filter() could change it */ if (r != new_changed) { if (new_free) rte_free(new_free); return; } /* Fourth case */ for (r=r->next; rte_is_valid(r); r=r->next) { if (old_best = export_filter(ah, r, &old_free, NULL, 1)) goto found; if (r == before_old) if (old_best = export_filter(ah, old_changed, &old_free, NULL, 1)) goto found; } /* Implicitly, old_best is NULL and new_best is non-NULL */ found: do_rt_notify(ah, net, new_best, old_best, tmpa, (feed == 2)); /* Discard temporary rte's */ if (new_free) rte_free(new_free); if (old_free) rte_free(old_free); } static struct mpnh * mpnh_merge_rta(struct mpnh *nhs, rta *a, linpool *pool, int max) { struct mpnh nh = { .gw = a->gw, .iface = a->iface }; struct mpnh *nh2 = (a->dest == RTD_MULTIPATH) ? a->nexthops : &nh; return mpnh_merge(nhs, nh2, 1, 0, max, pool); } rte * rt_export_merged(struct announce_hook *ah, net *net, rte **rt_free, ea_list **tmpa, linpool *pool, int silent) { // struct proto *p = ah->proto; struct mpnh *nhs = NULL; rte *best0, *best, *rt0, *rt, *tmp; best0 = net->routes; *rt_free = NULL; if (!rte_is_valid(best0)) return NULL; best = export_filter_(ah, best0, rt_free, tmpa, pool, silent); if (!best || !rte_is_reachable(best)) return best; for (rt0 = best0->next; rt0; rt0 = rt0->next) { if (!rte_mergable(best0, rt0)) continue; rt = export_filter_(ah, rt0, &tmp, NULL, pool, 1); if (!rt) continue; if (rte_is_reachable(rt)) nhs = mpnh_merge_rta(nhs, rt->attrs, pool, ah->proto->merge_limit); if (tmp) rte_free(tmp); } if (nhs) { nhs = mpnh_merge_rta(nhs, best->attrs, pool, ah->proto->merge_limit); if (nhs->next) { best = rte_cow_rta(best, pool); best->attrs->dest = RTD_MULTIPATH; best->attrs->nexthops = nhs; } } if (best != best0) *rt_free = best; return best; } static void rt_notify_merged(struct announce_hook *ah, net *net, rte *new_changed, rte *old_changed, rte *new_best, rte*old_best, int refeed) { // struct proto *p = ah->proto; rte *new_best_free = NULL; rte *old_best_free = NULL; rte *new_changed_free = NULL; rte *old_changed_free = NULL; ea_list *tmpa = NULL; /* We assume that all rte arguments are either NULL or rte_is_valid() */ /* This check should be done by the caller */ if (!new_best && !old_best) return; /* Check whether the change is relevant to the merged route */ if ((new_best == old_best) && !refeed) { new_changed = rte_mergable(new_best, new_changed) ? export_filter(ah, new_changed, &new_changed_free, NULL, 1) : NULL; old_changed = rte_mergable(old_best, old_changed) ? export_filter(ah, old_changed, &old_changed_free, NULL, 1) : NULL; if (!new_changed && !old_changed) return; } if (new_best) ah->stats->exp_updates_received++; else ah->stats->exp_withdraws_received++; /* Prepare new merged route */ if (new_best) new_best = rt_export_merged(ah, net, &new_best_free, &tmpa, rte_update_pool, 0); /* Prepare old merged route (without proper merged next hops) */ /* There are some issues with running filter on old route - see rt_notify_basic() */ if (old_best && !refeed) old_best = export_filter(ah, old_best, &old_best_free, NULL, 1); if (new_best || old_best) do_rt_notify(ah, net, new_best, old_best, tmpa, refeed); /* Discard temporary rte's */ if (new_best_free) rte_free(new_best_free); if (old_best_free) rte_free(old_best_free); if (new_changed_free) rte_free(new_changed_free); if (old_changed_free) rte_free(old_changed_free); } /** * rte_announce - announce a routing table change * @tab: table the route has been added to * @type: type of route announcement (RA_OPTIMAL or RA_ANY) * @net: network in question * @new: the new route to be announced * @old: the previous route for the same network * @new_best: the new best route for the same network * @old_best: the previous best route for the same network * @before_old: The previous route before @old for the same network. * If @before_old is NULL @old was the first. * * This function gets a routing table update and announces it * to all protocols that acccepts given type of route announcement * and are connected to the same table by their announcement hooks. * * Route announcement of type %RA_OPTIMAL si generated when optimal * route (in routing table @tab) changes. In that case @old stores the * old optimal route. * * Route announcement of type %RA_ANY si generated when any route (in * routing table @tab) changes In that case @old stores the old route * from the same protocol. * * For each appropriate protocol, we first call its import_control() * hook which performs basic checks on the route (each protocol has a * right to veto or force accept of the route before any filter is * asked) and adds default values of attributes specific to the new * protocol (metrics, tags etc.). Then it consults the protocol's * export filter and if it accepts the route, the rt_notify() hook of * the protocol gets called. */ static void rte_announce(rtable *tab, unsigned type, net *net, rte *new, rte *old, rte *new_best, rte *old_best, rte *before_old) { if (!rte_is_valid(new)) new = NULL; if (!rte_is_valid(old)) old = before_old = NULL; if (!rte_is_valid(new_best)) new_best = NULL; if (!rte_is_valid(old_best)) old_best = NULL; if (!old && !new) return; if (type == RA_OPTIMAL) { if (new) new->attrs->src->proto->stats.pref_routes++; if (old) old->attrs->src->proto->stats.pref_routes--; if (tab->hostcache) rt_notify_hostcache(tab, net); } struct announce_hook *a; WALK_LIST(a, tab->hooks) { ASSERT(a->proto->export_state != ES_DOWN); if (a->proto->accept_ra_types == type) if (type == RA_ACCEPTED) rt_notify_accepted(a, net, new, old, before_old, 0); else if (type == RA_MERGED) rt_notify_merged(a, net, new, old, new_best, old_best, 0); else rt_notify_basic(a, net, new, old, 0); } } static inline int rte_validate(rte *e) { int c; net *n = e->net; if ((n->n.pxlen > BITS_PER_IP_ADDRESS) || !ip_is_prefix(n->n.prefix,n->n.pxlen)) { log(L_WARN "Ignoring bogus prefix %I/%d received via %s", n->n.prefix, n->n.pxlen, e->sender->proto->name); return 0; } c = ipa_classify_net(n->n.prefix); if ((c < 0) || !(c & IADDR_HOST) || ((c & IADDR_SCOPE_MASK) <= SCOPE_LINK)) { log(L_WARN "Ignoring bogus route %I/%d received via %s", n->n.prefix, n->n.pxlen, e->sender->proto->name); return 0; } if ((e->attrs->dest == RTD_MULTIPATH) && !mpnh_is_sorted(e->attrs->nexthops)) { log(L_WARN "Ignoring unsorted multipath route %I/%d received via %s", n->n.prefix, n->n.pxlen, e->sender->proto->name); return 0; } return 1; } /** * rte_free - delete a &rte * @e: &rte to be deleted * * rte_free() deletes the given &rte from the routing table it's linked to. */ void rte_free(rte *e) { if (rta_is_cached(e->attrs)) rta_free(e->attrs); sl_free(rte_slab, e); } static inline void rte_free_quick(rte *e) { rta_free(e->attrs); sl_free(rte_slab, e); } static int rte_same(rte *x, rte *y) { return x->attrs == y->attrs && x->flags == y->flags && x->pflags == y->pflags && x->pref == y->pref && (!x->attrs->src->proto->rte_same || x->attrs->src->proto->rte_same(x, y)); } static inline int rte_is_ok(rte *e) { return e && !rte_is_filtered(e); } static void rte_recalculate(struct announce_hook *ah, net *net, rte *new, struct rte_src *src) { struct proto *p = ah->proto; struct rtable *table = ah->table; struct proto_stats *stats = ah->stats; static struct tbf rl_pipe = TBF_DEFAULT_LOG_LIMITS; rte *before_old = NULL; rte *old_best = net->routes; rte *old = NULL; rte **k; k = &net->routes; /* Find and remove original route from the same protocol */ while (old = *k) { if (old->attrs->src == src) { /* If there is the same route in the routing table but from * a different sender, then there are two paths from the * source protocol to this routing table through transparent * pipes, which is not allowed. * * We log that and ignore the route. If it is withdraw, we * ignore it completely (there might be 'spurious withdraws', * see FIXME in do_rte_announce()) */ if (old->sender->proto != p) { if (new) { log_rl(&rl_pipe, L_ERR "Pipe collision detected when sending %I/%d to table %s", net->n.prefix, net->n.pxlen, table->name); rte_free_quick(new); } return; } if (new && rte_same(old, new)) { /* No changes, ignore the new route */ if (!rte_is_filtered(new)) { stats->imp_updates_ignored++; rte_trace_in(D_ROUTES, p, new, "ignored"); } rte_free_quick(new); return; } *k = old->next; break; } k = &old->next; before_old = old; } if (!old) before_old = NULL; if (!old && !new) { stats->imp_withdraws_ignored++; return; } int new_ok = rte_is_ok(new); int old_ok = rte_is_ok(old); struct proto_limit *l = ah->rx_limit; if (l && !old && new) { u32 all_routes = stats->imp_routes + stats->filt_routes; if (all_routes >= l->limit) proto_notify_limit(ah, l, PLD_RX, all_routes); if (l->state == PLS_BLOCKED) { /* In receive limit the situation is simple, old is NULL so we just free new and exit like nothing happened */ stats->imp_updates_ignored++; rte_trace_in(D_FILTERS, p, new, "ignored [limit]"); rte_free_quick(new); return; } } l = ah->in_limit; if (l && !old_ok && new_ok) { if (stats->imp_routes >= l->limit) proto_notify_limit(ah, l, PLD_IN, stats->imp_routes); if (l->state == PLS_BLOCKED) { /* In import limit the situation is more complicated. We shouldn't just drop the route, we should handle it like it was filtered. We also have to continue the route processing if old or new is non-NULL, but we should exit if both are NULL as this case is probably assumed to be already handled. */ stats->imp_updates_ignored++; rte_trace_in(D_FILTERS, p, new, "ignored [limit]"); if (ah->in_keep_filtered) new->flags |= REF_FILTERED; else { rte_free_quick(new); new = NULL; } /* Note that old && !new could be possible when ah->in_keep_filtered changed in the recent past. */ if (!old && !new) return; new_ok = 0; goto skip_stats1; } } if (new_ok) stats->imp_updates_accepted++; else if (old_ok) stats->imp_withdraws_accepted++; else stats->imp_withdraws_ignored++; skip_stats1: if (new) rte_is_filtered(new) ? stats->filt_routes++ : stats->imp_routes++; if (old) rte_is_filtered(old) ? stats->filt_routes-- : stats->imp_routes--; if (table->config->sorted) { /* If routes are sorted, just insert new route to appropriate position */ if (new) { if (before_old && !rte_better(new, before_old)) k = &before_old->next; else k = &net->routes; for (; *k; k=&(*k)->next) if (rte_better(new, *k)) break; new->next = *k; *k = new; } } else { /* If routes are not sorted, find the best route and move it on the first position. There are several optimized cases. */ if (src->proto->rte_recalculate && src->proto->rte_recalculate(table, net, new, old, old_best)) goto do_recalculate; if (new && rte_better(new, old_best)) { /* The first case - the new route is cleary optimal, we link it at the first position */ new->next = net->routes; net->routes = new; } else if (old == old_best) { /* The second case - the old best route disappeared, we add the new route (if we have any) to the list (we don't care about position) and then we elect the new optimal route and relink that route at the first position and announce it. New optimal route might be NULL if there is no more routes */ do_recalculate: /* Add the new route to the list */ if (new) { new->next = net->routes; net->routes = new; } /* Find a new optimal route (if there is any) */ if (net->routes) { rte **bp = &net->routes; for (k=&(*bp)->next; *k; k=&(*k)->next) if (rte_better(*k, *bp)) bp = k; /* And relink it */ rte *best = *bp; *bp = best->next; best->next = net->routes; net->routes = best; } } else if (new) { /* The third case - the new route is not better than the old best route (therefore old_best != NULL) and the old best route was not removed (therefore old_best == net->routes). We just link the new route after the old best route. */ ASSERT(net->routes != NULL); new->next = net->routes->next; net->routes->next = new; } /* The fourth (empty) case - suboptimal route was removed, nothing to do */ } if (new) new->lastmod = now; /* Log the route change */ if (p->debug & D_ROUTES) { if (new_ok) rte_trace(p, new, '>', new == net->routes ? "added [best]" : "added"); else if (old_ok) { if (old != old_best) rte_trace(p, old, '>', "removed"); else if (rte_is_ok(net->routes)) rte_trace(p, old, '>', "removed [replaced]"); else rte_trace(p, old, '>', "removed [sole]"); } } /* Propagate the route change */ rte_announce(table, RA_ANY, net, new, old, NULL, NULL, NULL); if (net->routes != old_best) rte_announce(table, RA_OPTIMAL, net, net->routes, old_best, NULL, NULL, NULL); if (table->config->sorted) rte_announce(table, RA_ACCEPTED, net, new, old, NULL, NULL, before_old); rte_announce(table, RA_MERGED, net, new, old, net->routes, old_best, NULL); if (!net->routes && (table->gc_counter++ >= table->config->gc_max_ops) && (table->gc_time + table->config->gc_min_time <= now)) rt_schedule_gc(table); if (old_ok && p->rte_remove) p->rte_remove(net, old); if (new_ok && p->rte_insert) p->rte_insert(net, new); if (old) rte_free_quick(old); } static int rte_update_nest_cnt; /* Nesting counter to allow recursive updates */ static inline void rte_update_lock(void) { rte_update_nest_cnt++; } static inline void rte_update_unlock(void) { if (!--rte_update_nest_cnt) lp_flush(rte_update_pool); } static inline void rte_hide_dummy_routes(net *net, rte **dummy) { if (net->routes && net->routes->attrs->source == RTS_DUMMY) { *dummy = net->routes; net->routes = (*dummy)->next; } } static inline void rte_unhide_dummy_routes(net *net, rte **dummy) { if (*dummy) { (*dummy)->next = net->routes; net->routes = *dummy; } } /** * rte_update - enter a new update to a routing table * @table: table to be updated * @ah: pointer to table announce hook * @net: network node * @p: protocol submitting the update * @src: protocol originating the update * @new: a &rte representing the new route or %NULL for route removal. * * This function is called by the routing protocols whenever they discover * a new route or wish to update/remove an existing route. The right announcement * sequence is to build route attributes first (either un-cached with @aflags set * to zero or a cached one using rta_lookup(); in this case please note that * you need to increase the use count of the attributes yourself by calling * rta_clone()), call rte_get_temp() to obtain a temporary &rte, fill in all * the appropriate data and finally submit the new &rte by calling rte_update(). * * @src specifies the protocol that originally created the route and the meaning * of protocol-dependent data of @new. If @new is not %NULL, @src have to be the * same value as @new->attrs->proto. @p specifies the protocol that called * rte_update(). In most cases it is the same protocol as @src. rte_update() * stores @p in @new->sender; * * When rte_update() gets any route, it automatically validates it (checks, * whether the network and next hop address are valid IP addresses and also * whether a normal routing protocol doesn't try to smuggle a host or link * scope route to the table), converts all protocol dependent attributes stored * in the &rte to temporary extended attributes, consults import filters of the * protocol to see if the route should be accepted and/or its attributes modified, * stores the temporary attributes back to the &rte. * * Now, having a "public" version of the route, we * automatically find any old route defined by the protocol @src * for network @n, replace it by the new one (or removing it if @new is %NULL), * recalculate the optimal route for this destination and finally broadcast * the change (if any) to all routing protocols by calling rte_announce(). * * All memory used for attribute lists and other temporary allocations is taken * from a special linear pool @rte_update_pool and freed when rte_update() * finishes. */ void rte_update2(struct announce_hook *ah, net *net, rte *new, struct rte_src *src) { struct proto *p = ah->proto; struct proto_stats *stats = ah->stats; struct filter *filter = ah->in_filter; ea_list *tmpa = NULL; rte *dummy = NULL; rte_update_lock(); if (new) { new->sender = ah; stats->imp_updates_received++; if (!rte_validate(new)) { rte_trace_in(D_FILTERS, p, new, "invalid"); stats->imp_updates_invalid++; goto drop; } if (filter == FILTER_REJECT) { stats->imp_updates_filtered++; rte_trace_in(D_FILTERS, p, new, "filtered out"); if (! ah->in_keep_filtered) goto drop; /* new is a private copy, i could modify it */ new->flags |= REF_FILTERED; } else { tmpa = make_tmp_attrs(new, rte_update_pool); if (filter && (filter != FILTER_REJECT)) { ea_list *old_tmpa = tmpa; int fr = f_run(filter, &new, &tmpa, rte_update_pool, 0); if (fr > F_ACCEPT) { stats->imp_updates_filtered++; rte_trace_in(D_FILTERS, p, new, "filtered out"); if (! ah->in_keep_filtered) goto drop; new->flags |= REF_FILTERED; } if (tmpa != old_tmpa && src->proto->store_tmp_attrs) src->proto->store_tmp_attrs(new, tmpa); } } if (!rta_is_cached(new->attrs)) /* Need to copy attributes */ new->attrs = rta_lookup(new->attrs); new->flags |= REF_COW; } else { stats->imp_withdraws_received++; if (!net || !src) { stats->imp_withdraws_ignored++; rte_update_unlock(); return; } } recalc: rte_hide_dummy_routes(net, &dummy); rte_recalculate(ah, net, new, src); rte_unhide_dummy_routes(net, &dummy); rte_update_unlock(); return; drop: rte_free(new); new = NULL; goto recalc; } /* Independent call to rte_announce(), used from next hop recalculation, outside of rte_update(). new must be non-NULL */ static inline void rte_announce_i(rtable *tab, unsigned type, net *net, rte *new, rte *old, rte *new_best, rte *old_best) { rte_update_lock(); rte_announce(tab, type, net, new, old, new_best, old_best, NULL); rte_update_unlock(); } static inline void rte_discard(rte *old) /* Non-filtered route deletion, used during garbage collection */ { rte_update_lock(); rte_recalculate(old->sender, old->net, NULL, old->attrs->src); rte_update_unlock(); } /* Check rtable for best route to given net whether it would be exported do p */ int rt_examine(rtable *t, ip_addr prefix, int pxlen, struct proto *p, struct filter *filter) { net *n = net_find(t, prefix, pxlen); rte *rt = n ? n->routes : NULL; if (!rte_is_valid(rt)) return 0; rte_update_lock(); /* Rest is stripped down export_filter() */ ea_list *tmpa = make_tmp_attrs(rt, rte_update_pool); int v = p->import_control ? p->import_control(p, &rt, &tmpa, rte_update_pool) : 0; if (v == RIC_PROCESS) v = (f_run(filter, &rt, &tmpa, rte_update_pool, FF_FORCE_TMPATTR) <= F_ACCEPT); /* Discard temporary rte */ if (rt != n->routes) rte_free(rt); rte_update_unlock(); return v > 0; } /** * rt_refresh_begin - start a refresh cycle * @t: related routing table * @ah: related announce hook * * This function starts a refresh cycle for given routing table and announce * hook. The refresh cycle is a sequence where the protocol sends all its valid * routes to the routing table (by rte_update()). After that, all protocol * routes (more precisely routes with @ah as @sender) not sent during the * refresh cycle but still in the table from the past are pruned. This is * implemented by marking all related routes as stale by REF_STALE flag in * rt_refresh_begin(), then marking all related stale routes with REF_DISCARD * flag in rt_refresh_end() and then removing such routes in the prune loop. */ void rt_refresh_begin(rtable *t, struct announce_hook *ah) { net *n; rte *e; FIB_WALK(&t->fib, fn) { n = (net *) fn; for (e = n->routes; e; e = e->next) if (e->sender == ah) e->flags |= REF_STALE; } FIB_WALK_END; } /** * rt_refresh_end - end a refresh cycle * @t: related routing table * @ah: related announce hook * * This function starts a refresh cycle for given routing table and announce * hook. See rt_refresh_begin() for description of refresh cycles. */ void rt_refresh_end(rtable *t, struct announce_hook *ah) { int prune = 0; net *n; rte *e; FIB_WALK(&t->fib, fn) { n = (net *) fn; for (e = n->routes; e; e = e->next) if ((e->sender == ah) && (e->flags & REF_STALE)) { e->flags |= REF_DISCARD; prune = 1; } } FIB_WALK_END; if (prune) rt_schedule_prune(t); } /** * rte_dump - dump a route * @e: &rte to be dumped * * This functions dumps contents of a &rte to debug output. */ void rte_dump(rte *e) { net *n = e->net; debug("%-1I/%2d ", n->n.prefix, n->n.pxlen); debug("KF=%02x PF=%02x pref=%d lm=%d ", n->n.flags, e->pflags, e->pref, now-e->lastmod); rta_dump(e->attrs); if (e->attrs->src->proto->proto->dump_attrs) e->attrs->src->proto->proto->dump_attrs(e); debug("\n"); } /** * rt_dump - dump a routing table * @t: routing table to be dumped * * This function dumps contents of a given routing table to debug output. */ void rt_dump(rtable *t) { rte *e; net *n; struct announce_hook *a; debug("Dump of routing table <%s>\n", t->name); #ifdef DEBUGGING fib_check(&t->fib); #endif FIB_WALK(&t->fib, fn) { n = (net *) fn; for(e=n->routes; e; e=e->next) rte_dump(e); } FIB_WALK_END; WALK_LIST(a, t->hooks) debug("\tAnnounces routes to protocol %s\n", a->proto->name); debug("\n"); } /** * rt_dump_all - dump all routing tables * * This function dumps contents of all routing tables to debug output. */ void rt_dump_all(void) { rtable *t; WALK_LIST(t, routing_tables) rt_dump(t); } static inline void rt_schedule_prune(rtable *tab) { rt_mark_for_prune(tab); ev_schedule(tab->rt_event); } static inline void rt_schedule_gc(rtable *tab) { if (tab->gc_scheduled) return; tab->gc_scheduled = 1; ev_schedule(tab->rt_event); } static inline void rt_schedule_hcu(rtable *tab) { if (tab->hcu_scheduled) return; tab->hcu_scheduled = 1; ev_schedule(tab->rt_event); } static inline void rt_schedule_nhu(rtable *tab) { if (tab->nhu_state == 0) ev_schedule(tab->rt_event); /* state change 0->1, 2->3 */ tab->nhu_state |= 1; } static void rt_prune_nets(rtable *tab) { struct fib_iterator fit; int ncnt = 0, ndel = 0; #ifdef DEBUGGING fib_check(&tab->fib); #endif FIB_ITERATE_INIT(&fit, &tab->fib); again: FIB_ITERATE_START(&tab->fib, &fit, f) { net *n = (net *) f; ncnt++; if (!n->routes) /* Orphaned FIB entry */ { FIB_ITERATE_PUT(&fit, f); fib_delete(&tab->fib, f); ndel++; goto again; } } FIB_ITERATE_END(f); DBG("Pruned %d of %d networks\n", ndel, ncnt); tab->gc_counter = 0; tab->gc_time = now; tab->gc_scheduled = 0; } static void rt_event(void *ptr) { rtable *tab = ptr; if (tab->hcu_scheduled) rt_update_hostcache(tab); if (tab->nhu_state) rt_next_hop_update(tab); if (tab->prune_state) if (!rt_prune_table(tab)) { /* Table prune unfinished */ ev_schedule(tab->rt_event); return; } if (tab->gc_scheduled) { rt_prune_nets(tab); rt_prune_sources(); // FIXME this should be moved to independent event } } void rt_setup(pool *p, rtable *t, char *name, struct rtable_config *cf) { bzero(t, sizeof(*t)); fib_init(&t->fib, p, sizeof(net), 0, rte_init); t->name = name; t->config = cf; init_list(&t->hooks); if (cf) { t->rt_event = ev_new(p); t->rt_event->hook = rt_event; t->rt_event->data = t; t->gc_time = now; } } /** * rt_init - initialize routing tables * * This function is called during BIRD startup. It initializes the * routing table module. */ void rt_init(void) { rta_init(); rt_table_pool = rp_new(&root_pool, "Routing tables"); rte_update_pool = lp_new(rt_table_pool, 4080); rte_slab = sl_new(rt_table_pool, sizeof(rte)); init_list(&routing_tables); } static int rt_prune_step(rtable *tab, int *limit) { struct fib_iterator *fit = &tab->prune_fit; DBG("Pruning route table %s\n", tab->name); #ifdef DEBUGGING fib_check(&tab->fib); #endif if (tab->prune_state == RPS_NONE) return 1; if (tab->prune_state == RPS_SCHEDULED) { FIB_ITERATE_INIT(fit, &tab->fib); tab->prune_state = RPS_RUNNING; } again: FIB_ITERATE_START(&tab->fib, fit, fn) { net *n = (net *) fn; rte *e; rescan: for (e=n->routes; e; e=e->next) if (e->sender->proto->flushing || (e->flags & REF_DISCARD)) { if (*limit <= 0) { FIB_ITERATE_PUT(fit, fn); return 0; } rte_discard(e); (*limit)--; goto rescan; } if (!n->routes) /* Orphaned FIB entry */ { FIB_ITERATE_PUT(fit, fn); fib_delete(&tab->fib, fn); goto again; } } FIB_ITERATE_END(fn); #ifdef DEBUGGING fib_check(&tab->fib); #endif tab->prune_state = RPS_NONE; return 1; } /** * rt_prune_table - prune a routing table * @tab: a routing table for pruning * * This function scans the routing table @tab and removes routes belonging to * flushing protocols, discarded routes and also stale network entries, in a * similar fashion like rt_prune_loop(). Returns 1 when all such routes are * pruned. Contrary to rt_prune_loop(), this function is not a part of the * protocol flushing loop, but it is called from rt_event() for just one routing * table. * * Note that rt_prune_table() and rt_prune_loop() share (for each table) the * prune state (@prune_state) and also the pruning iterator (@prune_fit). */ static inline int rt_prune_table(rtable *tab) { int limit = 512; return rt_prune_step(tab, &limit); } /** * rt_prune_loop - prune routing tables * * The prune loop scans routing tables and removes routes belonging to flushing * protocols, discarded routes and also stale network entries. Returns 1 when * all such routes are pruned. It is a part of the protocol flushing loop. */ int rt_prune_loop(void) { int limit = 512; rtable *t; WALK_LIST(t, routing_tables) if (! rt_prune_step(t, &limit)) return 0; return 1; } void rt_preconfig(struct config *c) { struct symbol *s = cf_get_symbol("master"); init_list(&c->tables); c->master_rtc = rt_new_table(s); } /* * Some functions for handing internal next hop updates * triggered by rt_schedule_nhu(). */ static inline int rta_next_hop_outdated(rta *a) { struct hostentry *he = a->hostentry; if (!he) return 0; if (!he->src) return a->dest != RTD_UNREACHABLE; return (a->iface != he->src->iface) || !ipa_equal(a->gw, he->gw) || (a->dest != he->dest) || (a->igp_metric != he->igp_metric) || !mpnh_same(a->nexthops, he->src->nexthops); } static inline void rta_apply_hostentry(rta *a, struct hostentry *he) { a->hostentry = he; a->iface = he->src ? he->src->iface : NULL; a->gw = he->gw; a->dest = he->dest; a->igp_metric = he->igp_metric; a->nexthops = he->src ? he->src->nexthops : NULL; } static inline rte * rt_next_hop_update_rte(rtable *tab UNUSED, rte *old) { rta a; memcpy(&a, old->attrs, sizeof(rta)); rta_apply_hostentry(&a, old->attrs->hostentry); a.aflags = 0; rte *e = sl_alloc(rte_slab); memcpy(e, old, sizeof(rte)); e->attrs = rta_lookup(&a); return e; } static inline int rt_next_hop_update_net(rtable *tab, net *n) { rte **k, *e, *new, *old_best, **new_best; int count = 0; int free_old_best = 0; old_best = n->routes; if (!old_best) return 0; for (k = &n->routes; e = *k; k = &e->next) if (rta_next_hop_outdated(e->attrs)) { new = rt_next_hop_update_rte(tab, e); *k = new; rte_announce_i(tab, RA_ANY, n, new, e, NULL, NULL); rte_trace_in(D_ROUTES, new->sender->proto, new, "updated"); /* Call a pre-comparison hook */ /* Not really an efficient way to compute this */ if (e->attrs->src->proto->rte_recalculate) e->attrs->src->proto->rte_recalculate(tab, n, new, e, NULL); if (e != old_best) rte_free_quick(e); else /* Freeing of the old best rte is postponed */ free_old_best = 1; e = new; count++; } if (!count) return 0; /* Find the new best route */ new_best = NULL; for (k = &n->routes; e = *k; k = &e->next) { if (!new_best || rte_better(e, *new_best)) new_best = k; } /* Relink the new best route to the first position */ new = *new_best; if (new != n->routes) { *new_best = new->next; new->next = n->routes; n->routes = new; } /* Announce the new best route */ if (new != old_best) { rte_announce_i(tab, RA_OPTIMAL, n, new, old_best, NULL, NULL); rte_trace_in(D_ROUTES, new->sender->proto, new, "updated [best]"); } /* FIXME: Better announcement of merged routes */ rte_announce_i(tab, RA_MERGED, n, new, old_best, new, old_best); if (free_old_best) rte_free_quick(old_best); return count; } static void rt_next_hop_update(rtable *tab) { struct fib_iterator *fit = &tab->nhu_fit; int max_feed = 32; if (tab->nhu_state == 0) return; if (tab->nhu_state == 1) { FIB_ITERATE_INIT(fit, &tab->fib); tab->nhu_state = 2; } FIB_ITERATE_START(&tab->fib, fit, fn) { if (max_feed <= 0) { FIB_ITERATE_PUT(fit, fn); ev_schedule(tab->rt_event); return; } max_feed -= rt_next_hop_update_net(tab, (net *) fn); } FIB_ITERATE_END(fn); /* state change 2->0, 3->1 */ tab->nhu_state &= 1; if (tab->nhu_state > 0) ev_schedule(tab->rt_event); } struct rtable_config * rt_new_table(struct symbol *s) { /* Hack that allows to 'redefine' the master table */ if ((s->class == SYM_TABLE) && (s->def == new_config->master_rtc)) return s->def; struct rtable_config *c = cfg_allocz(sizeof(struct rtable_config)); cf_define_symbol(s, SYM_TABLE, c); c->name = s->name; add_tail(&new_config->tables, &c->n); c->gc_max_ops = 1000; c->gc_min_time = 5; return c; } /** * rt_lock_table - lock a routing table * @r: routing table to be locked * * Lock a routing table, because it's in use by a protocol, * preventing it from being freed when it gets undefined in a new * configuration. */ void rt_lock_table(rtable *r) { r->use_count++; } /** * rt_unlock_table - unlock a routing table * @r: routing table to be unlocked * * Unlock a routing table formerly locked by rt_lock_table(), * that is decrease its use count and delete it if it's scheduled * for deletion by configuration changes. */ void rt_unlock_table(rtable *r) { if (!--r->use_count && r->deleted) { struct config *conf = r->deleted; DBG("Deleting routing table %s\n", r->name); r->config->table = NULL; if (r->hostcache) rt_free_hostcache(r); rem_node(&r->n); fib_free(&r->fib); rfree(r->rt_event); mb_free(r); config_del_obstacle(conf); } } /** * rt_commit - commit new routing table configuration * @new: new configuration * @old: original configuration or %NULL if it's boot time config * * Scan differences between @old and @new configuration and modify * the routing tables according to these changes. If @new defines a * previously unknown table, create it, if it omits a table existing * in @old, schedule it for deletion (it gets deleted when all protocols * disconnect from it by calling rt_unlock_table()), if it exists * in both configurations, leave it unchanged. */ void rt_commit(struct config *new, struct config *old) { struct rtable_config *o, *r; DBG("rt_commit:\n"); if (old) { WALK_LIST(o, old->tables) { rtable *ot = o->table; if (!ot->deleted) { struct symbol *sym = cf_find_symbol(new, o->name); if (sym && sym->class == SYM_TABLE && !new->shutdown) { DBG("\t%s: same\n", o->name); r = sym->def; r->table = ot; ot->name = r->name; ot->config = r; if (o->sorted != r->sorted) log(L_WARN "Reconfiguration of rtable sorted flag not implemented"); } else { DBG("\t%s: deleted\n", o->name); ot->deleted = old; config_add_obstacle(old); rt_lock_table(ot); rt_unlock_table(ot); } } } } WALK_LIST(r, new->tables) if (!r->table) { rtable *t = mb_alloc(rt_table_pool, sizeof(struct rtable)); DBG("\t%s: created\n", r->name); rt_setup(rt_table_pool, t, r->name, r); add_tail(&routing_tables, &t->n); r->table = t; } DBG("\tdone\n"); } static inline void do_feed_baby(struct proto *p, int type, struct announce_hook *h, net *n, rte *e) { rte_update_lock(); if (type == RA_ACCEPTED) rt_notify_accepted(h, n, e, NULL, NULL, p->refeeding ? 2 : 1); else if (type == RA_MERGED) rt_notify_merged(h, n, NULL, NULL, e, p->refeeding ? e : NULL, p->refeeding); else rt_notify_basic(h, n, e, p->refeeding ? e : NULL, p->refeeding); rte_update_unlock(); } /** * rt_feed_baby - advertise routes to a new protocol * @p: protocol to be fed * * This function performs one pass of advertisement of routes to a newly * initialized protocol. It's called by the protocol code as long as it * has something to do. (We avoid transferring all the routes in single * pass in order not to monopolize CPU time.) */ int rt_feed_baby(struct proto *p) { struct announce_hook *h; struct fib_iterator *fit; int max_feed = 256; if (!p->feed_ahook) /* Need to initialize first */ { if (!p->ahooks) return 1; DBG("Announcing routes to new protocol %s\n", p->name); p->feed_ahook = p->ahooks; fit = p->feed_iterator = mb_alloc(p->pool, sizeof(struct fib_iterator)); goto next_hook; } fit = p->feed_iterator; again: h = p->feed_ahook; FIB_ITERATE_START(&h->table->fib, fit, fn) { net *n = (net *) fn; rte *e = n->routes; if (max_feed <= 0) { FIB_ITERATE_PUT(fit, fn); return 0; } /* XXXX perhaps we should change feed for RA_ACCEPTED to not use 'new' */ if ((p->accept_ra_types == RA_OPTIMAL) || (p->accept_ra_types == RA_ACCEPTED) || (p->accept_ra_types == RA_MERGED)) if (rte_is_valid(e)) { if (p->export_state != ES_FEEDING) return 1; /* In the meantime, the protocol fell down. */ do_feed_baby(p, p->accept_ra_types, h, n, e); max_feed--; } if (p->accept_ra_types == RA_ANY) for(e = n->routes; e; e = e->next) { if (p->export_state != ES_FEEDING) return 1; /* In the meantime, the protocol fell down. */ if (!rte_is_valid(e)) continue; do_feed_baby(p, RA_ANY, h, n, e); max_feed--; } } FIB_ITERATE_END(fn); p->feed_ahook = h->next; if (!p->feed_ahook) { mb_free(p->feed_iterator); p->feed_iterator = NULL; return 1; } next_hook: h = p->feed_ahook; FIB_ITERATE_INIT(fit, &h->table->fib); goto again; } /** * rt_feed_baby_abort - abort protocol feeding * @p: protocol * * This function is called by the protocol code when the protocol * stops or ceases to exist before the last iteration of rt_feed_baby() * has finished. */ void rt_feed_baby_abort(struct proto *p) { if (p->feed_ahook) { /* Unlink the iterator and exit */ fit_get(&p->feed_ahook->table->fib, p->feed_iterator); p->feed_ahook = NULL; } } static inline unsigned ptr_hash(void *ptr) { uintptr_t p = (uintptr_t) ptr; return p ^ (p << 8) ^ (p >> 16); } static inline unsigned hc_hash(ip_addr a, rtable *dep) { return (ipa_hash(a) ^ ptr_hash(dep)) & 0xffff; } static inline void hc_insert(struct hostcache *hc, struct hostentry *he) { uint k = he->hash_key >> hc->hash_shift; he->next = hc->hash_table[k]; hc->hash_table[k] = he; } static inline void hc_remove(struct hostcache *hc, struct hostentry *he) { struct hostentry **hep; uint k = he->hash_key >> hc->hash_shift; for (hep = &hc->hash_table[k]; *hep != he; hep = &(*hep)->next); *hep = he->next; } #define HC_DEF_ORDER 10 #define HC_HI_MARK *4 #define HC_HI_STEP 2 #define HC_HI_ORDER 16 /* Must be at most 16 */ #define HC_LO_MARK /5 #define HC_LO_STEP 2 #define HC_LO_ORDER 10 static void hc_alloc_table(struct hostcache *hc, unsigned order) { uint hsize = 1 << order; hc->hash_order = order; hc->hash_shift = 16 - order; hc->hash_max = (order >= HC_HI_ORDER) ? ~0U : (hsize HC_HI_MARK); hc->hash_min = (order <= HC_LO_ORDER) ? 0U : (hsize HC_LO_MARK); hc->hash_table = mb_allocz(rt_table_pool, hsize * sizeof(struct hostentry *)); } static void hc_resize(struct hostcache *hc, unsigned new_order) { struct hostentry **old_table = hc->hash_table; struct hostentry *he, *hen; uint old_size = 1 << hc->hash_order; uint i; hc_alloc_table(hc, new_order); for (i = 0; i < old_size; i++) for (he = old_table[i]; he != NULL; he=hen) { hen = he->next; hc_insert(hc, he); } mb_free(old_table); } static struct hostentry * hc_new_hostentry(struct hostcache *hc, ip_addr a, ip_addr ll, rtable *dep, unsigned k) { struct hostentry *he = sl_alloc(hc->slab); he->addr = a; he->link = ll; he->tab = dep; he->hash_key = k; he->uc = 0; he->src = NULL; add_tail(&hc->hostentries, &he->ln); hc_insert(hc, he); hc->hash_items++; if (hc->hash_items > hc->hash_max) hc_resize(hc, hc->hash_order + HC_HI_STEP); return he; } static void hc_delete_hostentry(struct hostcache *hc, struct hostentry *he) { rta_free(he->src); rem_node(&he->ln); hc_remove(hc, he); sl_free(hc->slab, he); hc->hash_items--; if (hc->hash_items < hc->hash_min) hc_resize(hc, hc->hash_order - HC_LO_STEP); } static void rt_init_hostcache(rtable *tab) { struct hostcache *hc = mb_allocz(rt_table_pool, sizeof(struct hostcache)); init_list(&hc->hostentries); hc->hash_items = 0; hc_alloc_table(hc, HC_DEF_ORDER); hc->slab = sl_new(rt_table_pool, sizeof(struct hostentry)); hc->lp = lp_new(rt_table_pool, 1008); hc->trie = f_new_trie(hc->lp, sizeof(struct f_trie_node)); tab->hostcache = hc; } static void rt_free_hostcache(rtable *tab) { struct hostcache *hc = tab->hostcache; node *n; WALK_LIST(n, hc->hostentries) { struct hostentry *he = SKIP_BACK(struct hostentry, ln, n); rta_free(he->src); if (he->uc) log(L_ERR "Hostcache is not empty in table %s", tab->name); } rfree(hc->slab); rfree(hc->lp); mb_free(hc->hash_table); mb_free(hc); } static void rt_notify_hostcache(rtable *tab, net *net) { struct hostcache *hc = tab->hostcache; if (tab->hcu_scheduled) return; if (trie_match_prefix(hc->trie, net->n.prefix, net->n.pxlen)) rt_schedule_hcu(tab); } static int if_local_addr(ip_addr a, struct iface *i) { struct ifa *b; WALK_LIST(b, i->addrs) if (ipa_equal(a, b->ip)) return 1; return 0; } static u32 rt_get_igp_metric(rte *rt) { eattr *ea = ea_find(rt->attrs->eattrs, EA_GEN_IGP_METRIC); if (ea) return ea->u.data; rta *a = rt->attrs; #ifdef CONFIG_OSPF if ((a->source == RTS_OSPF) || (a->source == RTS_OSPF_IA) || (a->source == RTS_OSPF_EXT1)) return rt->u.ospf.metric1; #endif #ifdef CONFIG_RIP if (a->source == RTS_RIP) return rt->u.rip.metric; #endif /* Device routes */ if ((a->dest != RTD_ROUTER) && (a->dest != RTD_MULTIPATH)) return 0; return IGP_METRIC_UNKNOWN; } static int rt_update_hostentry(rtable *tab, struct hostentry *he) { rta *old_src = he->src; int pxlen = 0; /* Reset the hostentry */ he->src = NULL; he->gw = IPA_NONE; he->dest = RTD_UNREACHABLE; he->igp_metric = 0; net *n = net_route(tab, he->addr, MAX_PREFIX_LENGTH); if (n) { rte *e = n->routes; rta *a = e->attrs; pxlen = n->n.pxlen; if (a->hostentry) { /* Recursive route should not depend on another recursive route */ log(L_WARN "Next hop address %I resolvable through recursive route for %I/%d", he->addr, n->n.prefix, pxlen); goto done; } if (a->dest == RTD_DEVICE) { if (if_local_addr(he->addr, a->iface)) { /* The host address is a local address, this is not valid */ log(L_WARN "Next hop address %I is a local address of iface %s", he->addr, a->iface->name); goto done; } /* The host is directly reachable, use link as a gateway */ he->gw = he->link; he->dest = RTD_ROUTER; } else { /* The host is reachable through some route entry */ he->gw = a->gw; he->dest = a->dest; } he->src = rta_clone(a); he->igp_metric = rt_get_igp_metric(e); } done: /* Add a prefix range to the trie */ trie_add_prefix(tab->hostcache->trie, he->addr, MAX_PREFIX_LENGTH, pxlen, MAX_PREFIX_LENGTH); rta_free(old_src); return old_src != he->src; } static void rt_update_hostcache(rtable *tab) { struct hostcache *hc = tab->hostcache; struct hostentry *he; node *n, *x; /* Reset the trie */ lp_flush(hc->lp); hc->trie = f_new_trie(hc->lp, sizeof(struct f_trie_node)); WALK_LIST_DELSAFE(n, x, hc->hostentries) { he = SKIP_BACK(struct hostentry, ln, n); if (!he->uc) { hc_delete_hostentry(hc, he); continue; } if (rt_update_hostentry(tab, he)) rt_schedule_nhu(he->tab); } tab->hcu_scheduled = 0; } static struct hostentry * rt_get_hostentry(rtable *tab, ip_addr a, ip_addr ll, rtable *dep) { struct hostentry *he; if (!tab->hostcache) rt_init_hostcache(tab); uint k = hc_hash(a, dep); struct hostcache *hc = tab->hostcache; for (he = hc->hash_table[k >> hc->hash_shift]; he != NULL; he = he->next) if (ipa_equal(he->addr, a) && (he->tab == dep)) return he; he = hc_new_hostentry(hc, a, ll, dep, k); rt_update_hostentry(tab, he); return he; } void rta_set_recursive_next_hop(rtable *dep, rta *a, rtable *tab, ip_addr *gw, ip_addr *ll) { rta_apply_hostentry(a, rt_get_hostentry(tab, *gw, *ll, dep)); } /* * CLI commands */ static byte * rt_format_via(rte *e) { rta *a = e->attrs; /* Max text length w/o IP addr and interface name is 16 */ static byte via[STD_ADDRESS_P_LENGTH+sizeof(a->iface->name)+16]; switch (a->dest) { case RTD_ROUTER: bsprintf(via, "via %I on %s", a->gw, a->iface->name); break; case RTD_DEVICE: bsprintf(via, "dev %s", a->iface->name); break; case RTD_BLACKHOLE: bsprintf(via, "blackhole"); break; case RTD_UNREACHABLE: bsprintf(via, "unreachable"); break; case RTD_PROHIBIT: bsprintf(via, "prohibited"); break; case RTD_MULTIPATH: bsprintf(via, "multipath"); break; default: bsprintf(via, "???"); } return via; } static void rt_show_rte(struct cli *c, byte *ia, rte *e, struct rt_show_data *d, ea_list *tmpa) { byte from[STD_ADDRESS_P_LENGTH+8]; byte tm[TM_DATETIME_BUFFER_SIZE], info[256]; rta *a = e->attrs; int primary = (e->net->routes == e); int sync_error = (e->net->n.flags & KRF_SYNC_ERROR); void (*get_route_info)(struct rte *, byte *buf, struct ea_list *attrs); struct mpnh *nh; tm_format_datetime(tm, &config->tf_route, e->lastmod); if (ipa_nonzero(a->from) && !ipa_equal(a->from, a->gw)) bsprintf(from, " from %I", a->from); else from[0] = 0; get_route_info = a->src->proto->proto->get_route_info; if (get_route_info || d->verbose) { /* Need to normalize the extended attributes */ ea_list *t = tmpa; t = ea_append(t, a->eattrs); tmpa = alloca(ea_scan(t)); ea_merge(t, tmpa); ea_sort(tmpa); } if (get_route_info) get_route_info(e, info, tmpa); else bsprintf(info, " (%d)", e->pref); cli_printf(c, -1007, "%-18s %s [%s %s%s]%s%s", ia, rt_format_via(e), a->src->proto->name, tm, from, primary ? (sync_error ? " !" : " *") : "", info); for (nh = a->nexthops; nh; nh = nh->next) cli_printf(c, -1007, "\tvia %I on %s weight %d", nh->gw, nh->iface->name, nh->weight + 1); if (d->verbose) rta_show(c, a, tmpa); } static void rt_show_net(struct cli *c, net *n, struct rt_show_data *d) { rte *e, *ee; byte ia[STD_ADDRESS_P_LENGTH+8]; struct ea_list *tmpa; struct announce_hook *a = NULL; int first = 1; int pass = 0; bsprintf(ia, "%I/%d", n->n.prefix, n->n.pxlen); if (d->export_mode) { if (! d->export_protocol->rt_notify) return; a = proto_find_announce_hook(d->export_protocol, d->table); if (!a) return; } for (e = n->routes; e; e = e->next) { if (rte_is_filtered(e) != d->filtered) continue; d->rt_counter++; d->net_counter += first; first = 0; if (pass) continue; ee = e; rte_update_lock(); /* We use the update buffer for filtering */ tmpa = make_tmp_attrs(e, rte_update_pool); /* Special case for merged export */ if ((d->export_mode == RSEM_EXPORT) && (d->export_protocol->accept_ra_types == RA_MERGED)) { rte *rt_free; e = rt_export_merged(a, n, &rt_free, &tmpa, rte_update_pool, 1); pass = 1; if (!e) { e = ee; goto skip; } } else if (d->export_mode) { struct proto *ep = d->export_protocol; int ic = ep->import_control ? ep->import_control(ep, &e, &tmpa, rte_update_pool) : 0; if (ep->accept_ra_types == RA_OPTIMAL || ep->accept_ra_types == RA_MERGED) pass = 1; if (ic < 0) goto skip; if (d->export_mode > RSEM_PREEXPORT) { /* * FIXME - This shows what should be exported according to current * filters, but not what was really exported. 'configure soft' * command may change the export filter and do not update routes. */ int do_export = (ic > 0) || (f_run(a->out_filter, &e, &tmpa, rte_update_pool, FF_FORCE_TMPATTR) <= F_ACCEPT); if (do_export != (d->export_mode == RSEM_EXPORT)) goto skip; if ((d->export_mode == RSEM_EXPORT) && (ep->accept_ra_types == RA_ACCEPTED)) pass = 1; } } if (d->show_protocol && (d->show_protocol != e->attrs->src->proto)) goto skip; if (f_run(d->filter, &e, &tmpa, rte_update_pool, FF_FORCE_TMPATTR) > F_ACCEPT) goto skip; d->show_counter++; if (d->stats < 2) rt_show_rte(c, ia, e, d, tmpa); ia[0] = 0; skip: if (e != ee) { rte_free(e); e = ee; } rte_update_unlock(); if (d->primary_only) break; } } static void rt_show_cont(struct cli *c) { struct rt_show_data *d = c->rover; #ifdef DEBUGGING unsigned max = 4; #else unsigned max = 64; #endif struct fib *fib = &d->table->fib; struct fib_iterator *it = &d->fit; FIB_ITERATE_START(fib, it, f) { net *n = (net *) f; if (d->running_on_config && d->running_on_config != config) { cli_printf(c, 8004, "Stopped due to reconfiguration"); goto done; } if (d->export_protocol && (d->export_protocol->export_state == ES_DOWN)) { cli_printf(c, 8005, "Protocol is down"); goto done; } if (!max--) { FIB_ITERATE_PUT(it, f); return; } rt_show_net(c, n, d); } FIB_ITERATE_END(f); if (d->stats) cli_printf(c, 14, "%d of %d routes for %d networks", d->show_counter, d->rt_counter, d->net_counter); else cli_printf(c, 0, ""); done: c->cont = c->cleanup = NULL; } static void rt_show_cleanup(struct cli *c) { struct rt_show_data *d = c->rover; /* Unlink the iterator */ fit_get(&d->table->fib, &d->fit); } void rt_show(struct rt_show_data *d) { net *n; /* Default is either a master table or a table related to a respective protocol */ if (!d->table && d->export_protocol) d->table = d->export_protocol->table; if (!d->table && d->show_protocol) d->table = d->show_protocol->table; if (!d->table) d->table = config->master_rtc->table; /* Filtered routes are neither exported nor have sensible ordering */ if (d->filtered && (d->export_mode || d->primary_only)) cli_msg(0, ""); if (d->pxlen == 256) { FIB_ITERATE_INIT(&d->fit, &d->table->fib); this_cli->cont = rt_show_cont; this_cli->cleanup = rt_show_cleanup; this_cli->rover = d; } else { if (d->show_for) n = net_route(d->table, d->prefix, d->pxlen); else n = net_find(d->table, d->prefix, d->pxlen); if (n) rt_show_net(this_cli, n, d); if (d->rt_counter) cli_msg(0, ""); else cli_msg(8001, "Network not in table"); } } /* * Documentation for functions declared inline in route.h */ #if 0 /** * net_find - find a network entry * @tab: a routing table * @addr: address of the network * @len: length of the network prefix * * net_find() looks up the given network in routing table @tab and * returns a pointer to its &net entry or %NULL if no such network * exists. */ static inline net *net_find(rtable *tab, ip_addr addr, unsigned len) { DUMMY; } /** * net_get - obtain a network entry * @tab: a routing table * @addr: address of the network * @len: length of the network prefix * * net_get() looks up the given network in routing table @tab and * returns a pointer to its &net entry. If no such entry exists, it's * created. */ static inline net *net_get(rtable *tab, ip_addr addr, unsigned len) { DUMMY; } /** * rte_cow - copy a route for writing * @r: a route entry to be copied * * rte_cow() takes a &rte and prepares it for modification. The exact action * taken depends on the flags of the &rte -- if it's a temporary entry, it's * just returned unchanged, else a new temporary entry with the same contents * is created. * * The primary use of this function is inside the filter machinery -- when * a filter wants to modify &rte contents (to change the preference or to * attach another set of attributes), it must ensure that the &rte is not * shared with anyone else (and especially that it isn't stored in any routing * table). * * Result: a pointer to the new writable &rte. */ static inline rte * rte_cow(rte *r) { DUMMY; } #endif bird-1.6.3/nest/bfd.h0000644000103200001440000000217613027054563013315 0ustar feelausers/* * BIRD -- Bidirectional Forwarding Detection (BFD) * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_NBFD_H_ #define _BIRD_NBFD_H_ #include "lib/lists.h" #include "lib/resource.h" struct bfd_session; struct bfd_request { resource r; node n; ip_addr addr; ip_addr local; struct iface *iface; void (*hook)(struct bfd_request *); void *data; struct bfd_session *session; u8 state; u8 diag; u8 old_state; u8 down; }; #define BFD_STATE_ADMIN_DOWN 0 #define BFD_STATE_DOWN 1 #define BFD_STATE_INIT 2 #define BFD_STATE_UP 3 #ifdef CONFIG_BFD struct bfd_request * bfd_request_session(pool *p, ip_addr addr, ip_addr local, struct iface *iface, void (*hook)(struct bfd_request *), void *data); static inline void cf_check_bfd(int use UNUSED) { } #else static inline struct bfd_request * bfd_request_session(pool *p, ip_addr addr, ip_addr local, struct iface *iface, void (*hook)(struct bfd_request *), void *data) { return NULL; } static inline void cf_check_bfd(int use) { if (use) cf_error("BFD not available"); } #endif /* CONFIG_BFD */ #endif /* _BIRD_NBFD_H_ */ bird-1.6.3/nest/proto-hooks.c0000644000103200001440000002633113027054563015040 0ustar feelausers/* * BIRD -- Documentation for Protocol Hooks (dummy source file) * * (c) 2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Protocol hooks * * Each protocol can provide a rich set of hook functions referred to by pointers * in either the &proto or &protocol structure. They are called by the core whenever * it wants the protocol to perform some action or to notify the protocol about * any change of its environment. All of the hooks can be set to %NULL which means * to ignore the change or to take a default action. */ /** * preconfig - protocol preconfiguration * @p: a routing protocol * @c: new configuration * * The preconfig() hook is called before parsing of a new configuration. */ void preconfig(struct protocol *p, struct config *c) { DUMMY; } /** * postconfig - instance post-configuration * @c: instance configuration * * The postconfig() hook is called for each configured instance after * parsing of the new configuration is finished. */ void postconfig(struct proto_config *c) { DUMMY; } /** * init - initialize an instance * @c: instance configuration * * The init() hook is called by the core to create a protocol instance * according to supplied protocol configuration. * * Result: a pointer to the instance created */ struct proto *init(struct proto_config *c) { DUMMY; } /** * reconfigure - request instance reconfiguration * @p: an instance * @c: new configuration * * The core calls the reconfigure() hook whenever it wants to ask the * protocol for switching to a new configuration. If the reconfiguration * is possible, the hook returns 1. Otherwise, it returns 0 and the core * will shut down the instance and start a new one with the new configuration. * * After the protocol confirms reconfiguration, it must no longer keep any * references to the old configuration since the memory it's stored in can * be re-used at any time. */ int reconfigure(struct proto *p, struct proto_config *c) { DUMMY; } /** * dump - dump protocol state * @p: an instance * * This hook dumps the complete state of the instance to the * debug output. */ void dump(struct proto *p) { DUMMY; } /** * dump_attrs - dump protocol-dependent attributes * @e: a route entry * * This hook dumps all attributes in the &rte which belong to this * protocol to the debug output. */ void dump_attrs(rte *e) { DUMMY; } /** * start - request instance startup * @p: protocol instance * * The start() hook is called by the core when it wishes to start * the instance. Multitable protocols should lock their tables here. * * Result: new protocol state */ int start(struct proto *p) { DUMMY; } /** * shutdown - request instance shutdown * @p: protocol instance * * The stop() hook is called by the core when it wishes to shut * the instance down for some reason. * * Returns: new protocol state */ int shutdown(struct proto *p) { DUMMY; } /** * cleanup - request instance cleanup * @p: protocol instance * * The cleanup() hook is called by the core when the protocol became * hungry/down, i.e. all protocol ahooks and routes are flushed. * Multitable protocols should unlock their tables here. */ void cleanup(struct proto *p) { DUMMY; } /** * get_status - get instance status * @p: protocol instance * @buf: buffer to be filled with the status string * * This hook is called by the core if it wishes to obtain an brief one-line user friendly * representation of the status of the instance to be printed by the accept_ra_types specifies which kind of route announcements * protocol wants to receive. */ void rt_notify(struct proto *p, net *net, rte *new, rte *old, ea_list *attrs) { DUMMY; } /** * neigh_notify - notify instance about neighbor status change * @neigh: a neighbor cache entry * * The neigh_notify() hook is called by the neighbor cache whenever * a neighbor changes its state, that is it gets disconnected or a * sticky neighbor gets connected. */ void neigh_notify(neighbor *neigh) { DUMMY; } /** * make_tmp_attrs - convert embedded attributes to temporary ones * @e: route entry * @pool: linear pool to allocate attribute memory in * * This hook is called by the routing table functions if they need * to convert the protocol attributes embedded directly in the &rte * to temporary extended attributes in order to distribute them * to other protocols or to filters. make_tmp_attrs() creates * an &ea_list in the linear pool @pool, fills it with values of the * temporary attributes and returns a pointer to it. */ ea_list *make_tmp_attrs(rte *e, struct linpool *pool) { DUMMY; } /** * store_tmp_attrs - convert temporary attributes to embedded ones * @e: route entry * @attrs: temporary attributes to be converted * * This hook is an exact opposite of make_tmp_attrs() -- it takes * a list of extended attributes and converts them to attributes * embedded in the &rte corresponding to this protocol. * * You must be prepared for any of the attributes being missing * from the list and use default values instead. */ void store_tmp_attrs(rte *e, ea_list *attrs) { DUMMY; } /** * import_control - pre-filtering decisions on route import * @p: protocol instance the route is going to be imported to * @e: the route in question * @attrs: extended attributes of the route * @pool: linear pool for allocation of all temporary data * * The import_control() hook is called as the first step of a exporting * a route from a routing table to the protocol instance. It can modify * route attributes and force acceptance or rejection of the route regardless * of user-specified filters. See rte_announce() for a complete description * of the route distribution process. * * The standard use of this hook is to reject routes having originated * from the same instance and to set default values of the protocol's metrics. * * Result: 1 if the route has to be accepted, -1 if rejected and 0 if it * should be passed to the filters. */ int import_control(struct proto *p, rte **e, ea_list **attrs, struct linpool *pool) { DUMMY; } /** * rte_recalculate - prepare routes for comparison * @table: a routing table * @net: a network entry * @new: new route for the network * @old: old route for the network * @old_best: old best route for the network (may be NULL) * * This hook is called when a route change (from @old to @new for a * @net entry) is propagated to a @table. It may be used to prepare * routes for comparison by rte_better() in the best route * selection. @new may or may not be in @net->routes list, * @old is not there. * * Result: 1 if the ordering implied by rte_better() changes enough * that full best route calculation have to be done, 0 otherwise. */ int rte_recalculate(struct rtable *table, struct network *net, struct rte *new, struct rte *old, struct rte *old_best) { DUMMY; } /** * rte_better - compare metrics of two routes * @new: the new route * @old: the original route * * This hook gets called when the routing table contains two routes * for the same network which have originated from different instances * of a single protocol and it wants to select which one is preferred * over the other one. Protocols usually decide according to route metrics. * * Result: 1 if @new is better (more preferred) than @old, 0 otherwise. */ int rte_better(rte *new, rte *old) { DUMMY; } /** * rte_same - compare two routes * @e1: route * @e2: route * * The rte_same() hook tests whether the routes @e1 and @e2 belonging * to the same protocol instance have identical contents. Contents of * &rta, all the extended attributes and &rte preference are checked * by the core code, no need to take care of them here. * * Result: 1 if @e1 is identical to @e2, 0 otherwise. */ int rte_same(rte *e1, rte *e2) { DUMMY; } /** * rte_insert - notify instance about route insertion * @n: network * @e: route * * This hook is called whenever a &rte belonging to the instance * is accepted for insertion to a routing table. * * Please avoid using this function in new protocols. */ void rte_insert(net *n, rte *e) { DUMMY; } /** * rte_remove - notify instance about route removal * @n: network * @e: route * * This hook is called whenever a &rte belonging to the instance * is removed from a routing table. * * Please avoid using this function in new protocols. */ void rte_remove(net *n, rte *e) { DUMMY; } bird-1.6.3/nest/rt-fib.c0000644000103200001440000003155513027054563013743 0ustar feelausers/* * BIRD -- Forwarding Information Base -- Data Structures * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Forwarding Information Base * * FIB is a data structure designed for storage of routes indexed by their * network prefixes. It supports insertion, deletion, searching by prefix, * `routing' (in CIDR sense, that is searching for a longest prefix matching * a given IP address) and (which makes the structure very tricky to implement) * asynchronous reading, that is enumerating the contents of a FIB while other * modules add, modify or remove entries. * * Internally, each FIB is represented as a collection of nodes of type &fib_node * indexed using a sophisticated hashing mechanism. * We use two-stage hashing where we calculate a 16-bit primary hash key independent * on hash table size and then we just divide the primary keys modulo table size * to get a real hash key used for determining the bucket containing the node. * The lists of nodes in each bucket are sorted according to the primary hash * key, hence if we keep the total number of buckets to be a power of two, * re-hashing of the structure keeps the relative order of the nodes. * * To get the asynchronous reading consistent over node deletions, we need to * keep a list of readers for each node. When a node gets deleted, its readers * are automatically moved to the next node in the table. * * Basic FIB operations are performed by functions defined by this module, * enumerating of FIB contents is accomplished by using the FIB_WALK() macro * or FIB_ITERATE_START() if you want to do it asynchronously. */ #undef LOCAL_DEBUG #include "nest/bird.h" #include "nest/route.h" #include "lib/string.h" #define HASH_DEF_ORDER 10 #define HASH_HI_MARK *4 #define HASH_HI_STEP 2 #define HASH_HI_MAX 16 /* Must be at most 16 */ #define HASH_LO_MARK /5 #define HASH_LO_STEP 2 #define HASH_LO_MIN 10 static void fib_ht_alloc(struct fib *f) { f->hash_size = 1 << f->hash_order; f->hash_shift = 16 - f->hash_order; if (f->hash_order > HASH_HI_MAX - HASH_HI_STEP) f->entries_max = ~0; else f->entries_max = f->hash_size HASH_HI_MARK; if (f->hash_order < HASH_LO_MIN + HASH_LO_STEP) f->entries_min = 0; else f->entries_min = f->hash_size HASH_LO_MARK; DBG("Allocating FIB hash of order %d: %d entries, %d low, %d high\n", f->hash_order, f->hash_size, f->entries_min, f->entries_max); f->hash_table = mb_alloc(f->fib_pool, f->hash_size * sizeof(struct fib_node *)); } static inline void fib_ht_free(struct fib_node **h) { mb_free(h); } static inline unsigned fib_hash(struct fib *f, ip_addr *a) { return ipa_hash(*a) >> f->hash_shift; } static void fib_dummy_init(struct fib_node *dummy UNUSED) { } /** * fib_init - initialize a new FIB * @f: the FIB to be initialized (the structure itself being allocated by the caller) * @p: pool to allocate the nodes in * @node_size: node size to be used (each node consists of a standard header &fib_node * followed by user data) * @hash_order: initial hash order (a binary logarithm of hash table size), 0 to use default order * (recommended) * @init: pointer a function to be called to initialize a newly created node * * This function initializes a newly allocated FIB and prepares it for use. */ void fib_init(struct fib *f, pool *p, unsigned node_size, unsigned hash_order, fib_init_func init) { if (!hash_order) hash_order = HASH_DEF_ORDER; f->fib_pool = p; f->fib_slab = sl_new(p, node_size); f->hash_order = hash_order; fib_ht_alloc(f); bzero(f->hash_table, f->hash_size * sizeof(struct fib_node *)); f->entries = 0; f->entries_min = 0; f->init = init ? : fib_dummy_init; } static void fib_rehash(struct fib *f, int step) { unsigned old, new, oldn, newn, ni, nh; struct fib_node **n, *e, *x, **t, **m, **h; old = f->hash_order; oldn = f->hash_size; new = old + step; m = h = f->hash_table; DBG("Re-hashing FIB from order %d to %d\n", old, new); f->hash_order = new; fib_ht_alloc(f); t = n = f->hash_table; newn = f->hash_size; ni = 0; while (oldn--) { x = *h++; while (e = x) { x = e->next; nh = fib_hash(f, &e->prefix); while (nh > ni) { *t = NULL; ni++; t = ++n; } *t = e; t = &e->next; } } while (ni < newn) { *t = NULL; ni++; t = ++n; } fib_ht_free(m); } /** * fib_find - search for FIB node by prefix * @f: FIB to search in * @a: pointer to IP address of the prefix * @len: prefix length * * Search for a FIB node corresponding to the given prefix, return * a pointer to it or %NULL if no such node exists. */ void * fib_find(struct fib *f, ip_addr *a, int len) { struct fib_node *e = f->hash_table[fib_hash(f, a)]; while (e && (e->pxlen != len || !ipa_equal(*a, e->prefix))) e = e->next; return e; } /* int fib_histogram(struct fib *f) { log(L_WARN "Histogram dump start %d %d", f->hash_size, f->entries); int i, j; struct fib_node *e; for (i = 0; i < f->hash_size; i++) { j = 0; for (e = f->hash_table[i]; e != NULL; e = e->next) j++; if (j > 0) log(L_WARN "Histogram line %d: %d", i, j); } log(L_WARN "Histogram dump end"); } */ /** * fib_get - find or create a FIB node * @f: FIB to work with * @a: pointer to IP address of the prefix * @len: prefix length * * Search for a FIB node corresponding to the given prefix and * return a pointer to it. If no such node exists, create it. */ void * fib_get(struct fib *f, ip_addr *a, int len) { uint h = ipa_hash(*a); struct fib_node **ee = f->hash_table + (h >> f->hash_shift); struct fib_node *g, *e = *ee; u32 uid = h << 16; while (e && (e->pxlen != len || !ipa_equal(*a, e->prefix))) e = e->next; if (e) return e; #ifdef DEBUGGING if (len < 0 || len > BITS_PER_IP_ADDRESS || !ip_is_prefix(*a,len)) bug("fib_get() called for invalid address"); #endif while ((g = *ee) && g->uid < uid) ee = &g->next; while ((g = *ee) && g->uid == uid) { ee = &g->next; uid++; } if ((uid >> 16) != h) log(L_ERR "FIB hash table chains are too long"); // log (L_WARN "FIB_GET %I %x %x", *a, h, uid); e = sl_alloc(f->fib_slab); e->prefix = *a; e->pxlen = len; e->next = *ee; e->uid = uid; *ee = e; e->readers = NULL; f->init(e); if (f->entries++ > f->entries_max) fib_rehash(f, HASH_HI_STEP); return e; } /** * fib_route - CIDR routing lookup * @f: FIB to search in * @a: pointer to IP address of the prefix * @len: prefix length * * Search for a FIB node with longest prefix matching the given * network, that is a node which a CIDR router would use for routing * that network. */ void * fib_route(struct fib *f, ip_addr a, int len) { ip_addr a0; void *t; while (len >= 0) { a0 = ipa_and(a, ipa_mkmask(len)); t = fib_find(f, &a0, len); if (t) return t; len--; } return NULL; } static inline void fib_merge_readers(struct fib_iterator *i, struct fib_node *to) { if (to) { struct fib_iterator *j = to->readers; if (!j) { /* Fast path */ to->readers = i; i->prev = (struct fib_iterator *) to; } else { /* Really merging */ while (j->next) j = j->next; j->next = i; i->prev = j; } while (i && i->node) { i->node = NULL; i = i->next; } } else /* No more nodes */ while (i) { i->prev = NULL; i = i->next; } } /** * fib_delete - delete a FIB node * @f: FIB to delete from * @E: entry to delete * * This function removes the given entry from the FIB, * taking care of all the asynchronous readers by shifting * them to the next node in the canonical reading order. */ void fib_delete(struct fib *f, void *E) { struct fib_node *e = E; uint h = fib_hash(f, &e->prefix); struct fib_node **ee = f->hash_table + h; struct fib_iterator *it; while (*ee) { if (*ee == e) { *ee = e->next; if (it = e->readers) { struct fib_node *l = e->next; while (!l) { h++; if (h >= f->hash_size) break; else l = f->hash_table[h]; } fib_merge_readers(it, l); } sl_free(f->fib_slab, e); if (f->entries-- < f->entries_min) fib_rehash(f, -HASH_LO_STEP); return; } ee = &((*ee)->next); } bug("fib_delete() called for invalid node"); } /** * fib_free - delete a FIB * @f: FIB to be deleted * * This function deletes a FIB -- it frees all memory associated * with it and all its entries. */ void fib_free(struct fib *f) { fib_ht_free(f->hash_table); rfree(f->fib_slab); } void fit_init(struct fib_iterator *i, struct fib *f) { unsigned h; struct fib_node *n; i->efef = 0xff; for(h=0; hhash_size; h++) if (n = f->hash_table[h]) { i->prev = (struct fib_iterator *) n; if (i->next = n->readers) i->next->prev = i; n->readers = i; i->node = n; return; } /* The fib is empty, nothing to do */ i->prev = i->next = NULL; i->node = NULL; } struct fib_node * fit_get(struct fib *f, struct fib_iterator *i) { struct fib_node *n; struct fib_iterator *j, *k; if (!i->prev) { /* We are at the end */ i->hash = ~0 - 1; return NULL; } if (!(n = i->node)) { /* No node info available, we are a victim of merging. Try harder. */ j = i; while (j->efef == 0xff) j = j->prev; n = (struct fib_node *) j; } j = i->prev; if (k = i->next) k->prev = j; j->next = k; i->hash = fib_hash(f, &n->prefix); return n; } void fit_put(struct fib_iterator *i, struct fib_node *n) { struct fib_iterator *j; i->node = n; if (j = n->readers) j->prev = i; i->next = j; n->readers = i; i->prev = (struct fib_iterator *) n; } void fit_put_next(struct fib *f, struct fib_iterator *i, struct fib_node *n, uint hpos) { if (n = n->next) goto found; while (++hpos < f->hash_size) if (n = f->hash_table[hpos]) goto found; /* We are at the end */ i->prev = i->next = NULL; i->node = NULL; return; found: fit_put(i, n); } #ifdef DEBUGGING /** * fib_check - audit a FIB * @f: FIB to be checked * * This debugging function audits a FIB by checking its internal consistency. * Use when you suspect somebody of corrupting innocent data structures. */ void fib_check(struct fib *f) { uint i, ec, lo, nulls; ec = 0; for(i=0; ihash_size; i++) { struct fib_node *n; lo = 0; for(n=f->hash_table[i]; n; n=n->next) { struct fib_iterator *j, *j0; uint h0 = ipa_hash(n->prefix); if (h0 < lo) bug("fib_check: discord in hash chains"); lo = h0; if ((h0 >> f->hash_shift) != i) bug("fib_check: mishashed %x->%x (order %d)", h0, i, f->hash_order); j0 = (struct fib_iterator *) n; nulls = 0; for(j=n->readers; j; j=j->next) { if (j->prev != j0) bug("fib_check: iterator->prev mismatch"); j0 = j; if (!j->node) nulls++; else if (nulls) bug("fib_check: iterator nullified"); else if (j->node != n) bug("fib_check: iterator->node mismatch"); } ec++; } } if (ec != f->entries) bug("fib_check: invalid entry count (%d != %d)", ec, f->entries); } #endif #ifdef TEST #include "lib/resource.h" struct fib f; void dump(char *m) { uint i; debug("%s ... order=%d, size=%d, entries=%d\n", m, f.hash_order, f.hash_size, f.hash_size); for(i=0; inext) { debug("%04x %04x %p %I/%2d", i, ipa_hash(n->prefix), n, n->prefix, n->pxlen); for(j=n->readers; j; j=j->next) debug(" %p[%p]", j, j->node); debug("\n"); } } fib_check(&f); debug("-----\n"); } void init(struct fib_node *n) { } int main(void) { struct fib_node *n; struct fib_iterator i, j; ip_addr a; int c; log_init_debug(NULL); resource_init(); fib_init(&f, &root_pool, sizeof(struct fib_node), 4, init); dump("init"); a = ipa_from_u32(0x01020304); n = fib_get(&f, &a, 32); a = ipa_from_u32(0x02030405); n = fib_get(&f, &a, 32); a = ipa_from_u32(0x03040506); n = fib_get(&f, &a, 32); a = ipa_from_u32(0x00000000); n = fib_get(&f, &a, 32); a = ipa_from_u32(0x00000c01); n = fib_get(&f, &a, 32); a = ipa_from_u32(0xffffffff); n = fib_get(&f, &a, 32); dump("fill"); fit_init(&i, &f); dump("iter init"); fib_rehash(&f, 1); dump("rehash up"); fib_rehash(&f, -1); dump("rehash down"); next: c = 0; FIB_ITERATE_START(&f, &i, z) { if (c) { FIB_ITERATE_PUT(&i, z); dump("iter"); goto next; } c = 1; debug("got %p\n", z); } FIB_ITERATE_END(z); dump("iter end"); fit_init(&i, &f); fit_init(&j, &f); dump("iter init 2"); n = fit_get(&f, &i); dump("iter step 2"); fit_put(&i, n->next); dump("iter step 3"); a = ipa_from_u32(0xffffffff); n = fib_get(&f, &a, 32); fib_delete(&f, n); dump("iter step 3"); return 0; } #endif bird-1.6.3/nest/Doc0000644000103200001440000000024613027054563013035 0ustar feelausersH Core S rt-fib.c S rt-table.c S rt-attr.c D proto.sgml S proto.c S proto-hooks.c S iface.c S neighbor.c S cli.c S locks.c # rt-dev.c documented in Protocols chapter bird-1.6.3/nest/a-set.c0000644000103200001440000002302213027054563013557 0ustar feelausers/* * BIRD -- Set/Community-list Operations * * (c) 2000 Martin Mares * (c) 2000 Pavel Machek * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "nest/bird.h" #include "nest/route.h" #include "nest/attrs.h" #include "lib/resource.h" #include "lib/string.h" /** * int_set_format - format an &set for printing * @set: set attribute to be formatted * @way: style of format (0 for router ID list, 1 for community list) * @from: starting position in set * @buf: destination buffer * @size: size of buffer * * This function takes a set attribute and formats it. @way specifies * the style of format (router ID / community). @from argument can be * used to specify the first printed value for the purpose of printing * untruncated sets even with smaller buffers. If the output fits in * the buffer, 0 is returned, otherwise the position of the first not * printed item is returned. This value can be used as @from argument * in subsequent calls. If truncated output suffices, -1 can be * instead used as @from, in that case " ..." is eventually added at * the buffer to indicate truncation. */ int int_set_format(struct adata *set, int way, int from, byte *buf, uint size) { u32 *z = (u32 *) set->data; byte *end = buf + size - 24; int from2 = MAX(from, 0); int to = set->length / 4; int i; for (i = from2; i < to; i++) { if (buf > end) { if (from < 0) strcpy(buf, " ..."); else *buf = 0; return i; } if (i > from2) *buf++ = ' '; if (way) buf += bsprintf(buf, "(%d,%d)", z[i] >> 16, z[i] & 0xffff); else buf += bsprintf(buf, "%R", z[i]); } *buf = 0; return 0; } int ec_format(byte *buf, u64 ec) { u32 type, key, val; char tbuf[16], *kind; type = ec >> 48; switch (type & 0xf0ff) { case EC_RT: kind = "rt"; break; case EC_RO: kind = "ro"; break; default: kind = tbuf; bsprintf(kind, "unknown 0x%x", type); } switch (ec >> 56) { /* RFC 4360 3.1. Two-Octet AS Specific Extended Community */ case 0x00: case 0x40: key = (ec >> 32) & 0xFFFF; val = ec; return bsprintf(buf, "(%s, %u, %u)", kind, key, val); /* RFC 4360 3.2. IPv4 Address Specific Extended Community */ case 0x01: case 0x41: key = ec >> 16; val = ec & 0xFFFF; return bsprintf(buf, "(%s, %R, %u)", kind, key, val); /* RFC 5668 4-Octet AS Specific BGP Extended Community */ case 0x02: case 0x42: key = ec >> 16; val = ec & 0xFFFF; return bsprintf(buf, "(%s, %u, %u)", kind, key, val); /* Generic format for unknown kinds of extended communities */ default: key = ec >> 32; val = ec; return bsprintf(buf, "(generic, 0x%x, 0x%x)", key, val); } } int ec_set_format(struct adata *set, int from, byte *buf, uint size) { u32 *z = int_set_get_data(set); byte *end = buf + size - 64; int from2 = MAX(from, 0); int to = int_set_get_size(set); int i; for (i = from2; i < to; i += 2) { if (buf > end) { if (from < 0) strcpy(buf, " ..."); else *buf = 0; return i; } if (i > from2) *buf++ = ' '; buf += ec_format(buf, ec_get(z, i)); } *buf = 0; return 0; } int lc_format(byte *buf, lcomm lc) { return bsprintf(buf, "(%u, %u, %u)", lc.asn, lc.ldp1, lc.ldp2); } int lc_set_format(struct adata *set, int from, byte *buf, uint bufsize) { u32 *d = (u32 *) set->data; byte *end = buf + bufsize - 64; int from2 = MAX(from, 0); int to = set->length / 4; int i; for (i = from2; i < to; i += 3) { if (buf > end) { if (from < 0) strcpy(buf, "..."); else buf[-1] = 0; return i; } buf += bsprintf(buf, "(%u, %u, %u)", d[i], d[i+1], d[i+2]); *buf++ = ' '; } if (i != from2) buf--; *buf = 0; return 0; } int int_set_contains(struct adata *list, u32 val) { if (!list) return 0; u32 *l = (u32 *) list->data; int len = int_set_get_size(list); int i; for (i = 0; i < len; i++) if (*l++ == val) return 1; return 0; } int ec_set_contains(struct adata *list, u64 val) { if (!list) return 0; u32 *l = int_set_get_data(list); int len = int_set_get_size(list); u32 eh = ec_hi(val); u32 el = ec_lo(val); int i; for (i=0; i < len; i += 2) if (l[i] == eh && l[i+1] == el) return 1; return 0; } int lc_set_contains(struct adata *list, lcomm val) { if (!list) return 0; u32 *l = int_set_get_data(list); int len = int_set_get_size(list); int i; for (i = 0; i < len; i += 3) if (lc_match(l, i, val)) return 1; return 0; } struct adata * int_set_prepend(struct linpool *pool, struct adata *list, u32 val) { struct adata *res; int len; if (int_set_contains(list, val)) return list; len = list ? list->length : 0; res = lp_alloc(pool, sizeof(struct adata) + len + 4); res->length = len + 4; if (list) memcpy(res->data + 4, list->data, list->length); * (u32 *) res->data = val; return res; } struct adata * int_set_add(struct linpool *pool, struct adata *list, u32 val) { struct adata *res; int len; if (int_set_contains(list, val)) return list; len = list ? list->length : 0; res = lp_alloc(pool, sizeof(struct adata) + len + 4); res->length = len + 4; if (list) memcpy(res->data, list->data, list->length); * (u32 *) (res->data + len) = val; return res; } struct adata * ec_set_add(struct linpool *pool, struct adata *list, u64 val) { if (ec_set_contains(list, val)) return list; int olen = list ? list->length : 0; struct adata *res = lp_alloc(pool, sizeof(struct adata) + olen + 8); res->length = olen + 8; if (list) memcpy(res->data, list->data, list->length); u32 *l = (u32 *) (res->data + olen); l[0] = ec_hi(val); l[1] = ec_lo(val); return res; } struct adata * lc_set_add(struct linpool *pool, struct adata *list, lcomm val) { if (lc_set_contains(list, val)) return list; int olen = list ? list->length : 0; struct adata *res = lp_alloc(pool, sizeof(struct adata) + olen + LCOMM_LENGTH); res->length = olen + LCOMM_LENGTH; if (list) memcpy(res->data, list->data, list->length); lc_put((u32 *) (res->data + olen), val); return res; } struct adata * int_set_del(struct linpool *pool, struct adata *list, u32 val) { if (!int_set_contains(list, val)) return list; struct adata *res; res = lp_alloc(pool, sizeof(struct adata) + list->length - 4); res->length = list->length - 4; u32 *l = int_set_get_data(list); u32 *k = int_set_get_data(res); int len = int_set_get_size(list); int i; for (i = 0; i < len; i++) if (l[i] != val) *k++ = l[i]; return res; } struct adata * ec_set_del(struct linpool *pool, struct adata *list, u64 val) { if (!ec_set_contains(list, val)) return list; struct adata *res; res = lp_alloc(pool, sizeof(struct adata) + list->length - 8); res->length = list->length - 8; u32 *l = int_set_get_data(list); u32 *k = int_set_get_data(res); int len = int_set_get_size(list); u32 eh = ec_hi(val); u32 el = ec_lo(val); int i; for (i=0; i < len; i += 2) if (! (l[i] == eh && l[i+1] == el)) { *k++ = l[i]; *k++ = l[i+1]; } return res; } struct adata * lc_set_del(struct linpool *pool, struct adata *list, lcomm val) { if (!lc_set_contains(list, val)) return list; struct adata *res; res = lp_alloc(pool, sizeof(struct adata) + list->length - LCOMM_LENGTH); res->length = list->length - LCOMM_LENGTH; u32 *l = int_set_get_data(list); u32 *k = int_set_get_data(res); int len = int_set_get_size(list); int i; for (i=0; i < len; i += 3) if (! lc_match(l, i, val)) k = lc_copy(k, l+i); return res; } struct adata * int_set_union(struct linpool *pool, struct adata *l1, struct adata *l2) { if (!l1) return l2; if (!l2) return l1; struct adata *res; int len = int_set_get_size(l2); u32 *l = int_set_get_data(l2); u32 tmp[len]; u32 *k = tmp; int i; for (i = 0; i < len; i++) if (!int_set_contains(l1, l[i])) *k++ = l[i]; if (k == tmp) return l1; len = (k - tmp) * 4; res = lp_alloc(pool, sizeof(struct adata) + l1->length + len); res->length = l1->length + len; memcpy(res->data, l1->data, l1->length); memcpy(res->data + l1->length, tmp, len); return res; } struct adata * ec_set_union(struct linpool *pool, struct adata *l1, struct adata *l2) { if (!l1) return l2; if (!l2) return l1; struct adata *res; int len = int_set_get_size(l2); u32 *l = int_set_get_data(l2); u32 tmp[len]; u32 *k = tmp; int i; for (i = 0; i < len; i += 2) if (!ec_set_contains(l1, ec_get(l, i))) { *k++ = l[i]; *k++ = l[i+1]; } if (k == tmp) return l1; len = (k - tmp) * 4; res = lp_alloc(pool, sizeof(struct adata) + l1->length + len); res->length = l1->length + len; memcpy(res->data, l1->data, l1->length); memcpy(res->data + l1->length, tmp, len); return res; } struct adata * lc_set_union(struct linpool *pool, struct adata *l1, struct adata *l2) { if (!l1) return l2; if (!l2) return l1; struct adata *res; int len = int_set_get_size(l2); u32 *l = int_set_get_data(l2); u32 tmp[len]; u32 *k = tmp; int i; for (i = 0; i < len; i += 3) if (!lc_set_contains(l1, lc_get(l, i))) k = lc_copy(k, l+i); if (k == tmp) return l1; len = (k - tmp) * 4; res = lp_alloc(pool, sizeof(struct adata) + l1->length + len); res->length = l1->length + len; memcpy(res->data, l1->data, l1->length); memcpy(res->data + l1->length, tmp, len); return res; } bird-1.6.3/nest/route.h0000644000103200001440000005675013027054563013727 0ustar feelausers/* * BIRD Internet Routing Daemon -- Routing Table * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_ROUTE_H_ #define _BIRD_ROUTE_H_ #include "lib/lists.h" #include "lib/resource.h" #include "lib/timer.h" #include "nest/protocol.h" struct protocol; struct proto; struct symbol; struct filter; struct cli; /* * Generic data structure for storing network prefixes. Also used * for the master routing table. Currently implemented as a hash * table. * * Available operations: * - insertion of new entry * - deletion of entry * - searching for entry by network prefix * - asynchronous retrieval of fib contents */ struct fib_node { struct fib_node *next; /* Next in hash chain */ struct fib_iterator *readers; /* List of readers of this node */ byte pxlen; byte flags; /* User-defined */ byte x0, x1; /* User-defined */ u32 uid; /* Unique ID based on hash */ 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]; struct fib_node *node; /* Or NULL if freshly merged */ uint hash; }; typedef void (*fib_init_func)(struct fib_node *); struct fib { pool *fib_pool; /* Pool holding all our data */ slab *fib_slab; /* Slab holding all fib nodes */ struct fib_node **hash_table; /* Node hash table */ uint hash_size; /* Number of hash table entries (a power of two) */ uint hash_order; /* Binary logarithm of hash_size */ uint hash_shift; /* 16 - hash_log */ uint entries; /* Number of entries */ uint entries_min, entries_max; /* Entry count limits (else start rehashing) */ fib_init_func init; /* Constructor */ }; void fib_init(struct fib *, pool *, unsigned node_size, unsigned hash_order, fib_init_func init); 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 */ void *fib_route(struct fib *, ip_addr, int); /* Longest-match routing lookup */ void fib_delete(struct fib *, void *); /* Remove fib entry */ void fib_free(struct fib *); /* Destroy the fib */ 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 *); void fit_put_next(struct fib *f, struct fib_iterator *i, struct fib_node *n, uint hpos); #define FIB_WALK(fib, z) do { \ struct fib_node *z, **ff = (fib)->hash_table; \ uint count = (fib)->hash_size; \ while (count--) \ for(z = *ff++; z; z=z->next) #define FIB_WALK_END } while (0) #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); \ uint count = (fib)->hash_size; \ uint hpos = (it)->hash; \ for(;;) { \ if (!z) \ { \ if (++hpos >= count) \ break; \ z = (fib)->hash_table[hpos]; \ continue; \ } #define FIB_ITERATE_END(z) z = z->next; } } while(0) #define FIB_ITERATE_PUT(it, z) fit_put(it, z) #define FIB_ITERATE_PUT_NEXT(it, fib, z) fit_put_next(fib, it, z, hpos) #define FIB_ITERATE_UNLINK(it, fib) fit_get(fib, it) /* * 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). * * Each of the RTE's contains variable data (the preference and protocol-dependent * metrics) and a pointer to a route attribute block common for many routes). * * It's guaranteed that there is at most one RTE for every (prefix,proto) pair. */ struct rtable_config { node n; char *name; struct rtable *table; struct proto_config *krt_attached; /* Kernel syncer attached to this table */ int gc_max_ops; /* Maximum number of operations before GC is run */ int gc_min_time; /* Minimum time between two consecutive GC runs */ byte sorted; /* Routes of network are sorted according to rte_better() */ }; typedef struct rtable { node n; /* Node in list of all tables */ struct fib fib; char *name; /* Name of this table */ list hooks; /* List of announcement hooks */ int pipe_busy; /* Pipe loop detection */ int use_count; /* Number of protocols using this table */ struct hostcache *hostcache; struct rtable_config *config; /* Configuration of this table */ 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. */ struct event *rt_event; /* Routing table event */ int gc_counter; /* Number of operations since last GC */ bird_clock_t gc_time; /* Time of last GC */ byte gc_scheduled; /* GC is scheduled */ byte prune_state; /* Table prune state, 1 -> scheduled, 2-> running */ byte hcu_scheduled; /* Hostcache update is scheduled */ byte nhu_state; /* Next Hop Update state */ struct fib_iterator prune_fit; /* Rtable prune FIB iterator */ struct fib_iterator nhu_fit; /* Next Hop Update FIB iterator */ } rtable; #define RPS_NONE 0 #define RPS_SCHEDULED 1 #define RPS_RUNNING 2 typedef struct network { struct fib_node n; /* FIB flags reserved for kernel syncer */ struct rte *routes; /* Available routes for this network */ } net; struct hostcache { 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; linpool *lp; /* Linpool for trie */ struct f_trie *trie; /* Trie of prefixes that might affect hostentries */ list hostentries; /* List of all hostentries */ byte update_hostcache; }; struct hostentry { node ln; 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 */ struct rtable *tab; /* Dependent table, part of key */ struct hostentry *next; /* Next in hash chain */ unsigned hash_key; /* Hash key */ unsigned uc; /* Use count */ struct rta *src; /* Source rta entry */ ip_addr gw; /* Chosen next hop */ byte dest; /* Chosen route destination type (RTD_...) */ u32 igp_metric; /* Chosen route IGP metric */ }; typedef struct rte { struct rte *next; net *net; /* Network this RTE belongs to */ struct announce_hook *sender; /* Announce hook used to send the route to the routing table */ struct rta *attrs; /* Attributes of this route */ byte flags; /* Flags (REF_...) */ byte pflags; /* Protocol-specific flags */ word pref; /* Route preference */ bird_clock_t lastmod; /* Last modified */ union { /* Protocol-dependent data (metrics etc.) */ #ifdef CONFIG_RIP struct { struct iface *from; /* Incoming iface */ u8 metric; /* RIP metric */ u16 tag; /* External route tag */ } rip; #endif #ifdef CONFIG_OSPF struct { u32 metric1, metric2; /* OSPF Type 1 and Type 2 metrics */ u32 tag; /* External route tag */ u32 router_id; /* Router that originated this route */ } ospf; #endif #ifdef CONFIG_BGP struct { u8 suppressed; /* Used for deterministic MED comparison */ } bgp; #endif #ifdef CONFIG_BABEL struct { u16 metric; /* Babel metric */ u64 router_id; /* Babel router id */ } babel; #endif 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 seen; /* Seen during last scan */ u8 best; /* Best route in network, propagated to core */ u32 metric; /* Kernel metric */ } krt; } u; } rte; #define REF_COW 1 /* Copy this rte on write */ #define REF_FILTERED 2 /* Route is rejected by import filter */ #define REF_STALE 4 /* Route is stale in a refresh cycle */ #define REF_DISCARD 8 /* Route is scheduled for discard */ /* Route is valid for propagation (may depend on other flags in the future), accepts NULL */ static inline int rte_is_valid(rte *r) { return r && !(r->flags & REF_FILTERED); } /* Route just has REF_FILTERED flag */ static inline int rte_is_filtered(rte *r) { return !!(r->flags & REF_FILTERED); } /* Types of route announcement, also used as flags */ #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 */ #define RA_MERGED 4 /* Announcement of optimal route merged with next ones */ /* 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 */ struct config; void rt_init(void); void rt_preconfig(struct config *); void rt_commit(struct config *new, struct config *old); void rt_lock_table(rtable *); void rt_unlock_table(rtable *); void rt_setup(pool *, rtable *, char *, struct rtable_config *); 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); } rte *rte_find(net *net, struct rte_src *src); rte *rte_get_temp(struct rta *); 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); } int rt_examine(rtable *t, ip_addr prefix, int pxlen, struct proto *p, struct filter *filter); rte *rt_export_merged(struct announce_hook *ah, net *net, rte **rt_free, struct ea_list **tmpa, linpool *pool, int silent); void rt_refresh_begin(rtable *t, struct announce_hook *ah); void rt_refresh_end(rtable *t, struct announce_hook *ah); void rte_dump(rte *); void rte_free(rte *); rte *rte_do_cow(rte *); static inline rte * rte_cow(rte *r) { return (r->flags & REF_COW) ? rte_do_cow(r) : r; } rte *rte_cow_rta(rte *r, linpool *lp); void rt_dump(rtable *); void rt_dump_all(void); int rt_feed_baby(struct proto *p); void rt_feed_baby_abort(struct proto *p); int rt_prune_loop(void); struct rtable_config *rt_new_table(struct symbol *s); 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; } struct rt_show_data { ip_addr prefix; unsigned pxlen; rtable *table; struct filter *filter; int verbose; struct fib_iterator fit; struct proto *show_protocol; struct proto *export_protocol; int export_mode, primary_only, filtered; struct config *running_on_config; int net_counter, rt_counter, show_counter; int stats, show_for; }; void rt_show(struct rt_show_data *); /* 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 */ /* * 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. */ /* Multipath next-hop */ struct mpnh { ip_addr gw; /* Next hop */ struct iface *iface; /* Outgoing interface */ struct mpnh *next; byte weight; }; 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 */ }; typedef struct rta { struct rta *next, **pprev; /* Hash chain */ struct rte_src *src; /* Route source that created the route */ unsigned uc; /* Use count */ byte source; /* Route source (RTS_...) */ byte scope; /* Route scope (SCOPE_... -- see ip.h) */ byte cast; /* Casting type (RTC_...) */ byte dest; /* Route destination type (RTD_...) */ byte flags; /* Route flags (RTF_...), now unused */ byte aflags; /* Attribute cache flags (RTAF_...) */ u16 hash_key; /* Hash over important fields */ u32 igp_metric; /* IGP metric to next hop (for iBGP routes) */ ip_addr gw; /* Next hop */ ip_addr from; /* Advertising router */ struct hostentry *hostentry; /* Hostentry for recursive next-hops */ struct iface *iface; /* Outgoing interface */ struct mpnh *nexthops; /* Next-hops for multipath routes */ struct ea_list *eattrs; /* Extended Attribute chain */ } rta; #define RTS_DUMMY 0 /* Dummy route to be removed soon */ #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_OSPF 7 /* OSPF route */ #define RTS_OSPF_IA 8 /* OSPF inter-area route */ #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 */ #define RTS_BABEL 13 /* Babel route */ #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 */ #define RTD_MULTIPATH 5 /* Multipath route (nexthops != NULL) */ #define RTD_NONE 6 /* Invalid RTD */ /* 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 */ #define RTAF_CACHED 1 /* This is a cached rta */ #define IGP_METRIC_UNKNOWN 0x80000000 /* Default igp_metric used when no other protocol-specific metric is availabe */ /* Route has regular, reachable nexthop (i.e. not RTD_UNREACHABLE and like) */ static inline int rte_is_reachable(rte *r) { uint d = r->attrs->dest; return (d == RTD_ROUTER) || (d == RTD_DEVICE) || (d == RTD_MULTIPATH); } /* * Extended Route Attributes */ typedef struct eattr { word id; /* EA_CODE(EAP_..., protocol-dependent ID) */ byte flags; /* Protocol-dependent flags */ byte type; /* Attribute type and several flags (EAF_...) */ union { u32 data; struct adata *ptr; /* Attribute data elsewhere */ } u; } eattr; #define EAP_GENERIC 0 /* Generic attributes */ #define EAP_BGP 1 /* BGP attributes */ #define EAP_RIP 2 /* RIP */ #define EAP_OSPF 3 /* OSPF */ #define EAP_KRT 4 /* Kernel route attributes */ #define EAP_BABEL 5 /* Babel attributes */ #define EAP_MAX 6 #define EA_CODE(proto,id) (((proto) << 8) | (id)) #define EA_PROTO(ea) ((ea) >> 8) #define EA_ID(ea) ((ea) & 0xff) #define EA_GEN_IGP_METRIC EA_CODE(EAP_GENERIC, 0) #define EA_CODE_MASK 0xffff #define EA_ALLOW_UNDEF 0x10000 /* ea_find: allow EAF_TYPE_UNDEF */ #define EA_BIT(n) ((n) << 24) /* Used in bitfield accessors */ #define EAF_TYPE_MASK 0x1f /* Mask with this to get type */ #define EAF_TYPE_INT 0x01 /* 32-bit unsigned integer number */ #define EAF_TYPE_OPAQUE 0x02 /* Opaque byte string (not filterable) */ #define EAF_TYPE_IP_ADDRESS 0x04 /* IP address */ #define EAF_TYPE_ROUTER_ID 0x05 /* Router ID (IPv4 address) */ #define EAF_TYPE_AS_PATH 0x06 /* BGP AS path (encoding per RFC 1771:4.3) */ #define EAF_TYPE_BITFIELD 0x09 /* 32-bit embedded bitfield */ #define EAF_TYPE_INT_SET 0x0a /* Set of u32's (e.g., a community list) */ #define EAF_TYPE_EC_SET 0x0e /* Set of pairs of u32's - ext. community list */ #define EAF_TYPE_LC_SET 0x12 /* Set of triplets of u32's - large community list */ #define EAF_TYPE_UNDEF 0x1f /* `force undefined' entry */ #define EAF_EMBEDDED 0x01 /* Data stored in eattr.u.data (part of type spec) */ #define EAF_VAR_LENGTH 0x02 /* Attribute length is variable (part of type spec) */ #define EAF_ORIGINATED 0x40 /* The attribute has originated locally */ #define EAF_TEMP 0x80 /* A temporary attribute (the one stored in the tmp attr list) */ struct adata { uint length; /* Length of data */ byte data[0]; }; static inline int adata_same(struct adata *a, struct adata *b) { return (a->length == b->length && !memcmp(a->data, b->data, a->length)); } typedef struct ea_list { struct ea_list *next; /* In case we have an override list */ byte flags; /* Flags: EALF_... */ byte rfu; word count; /* Number of attributes */ eattr attrs[0]; /* Attribute definitions themselves */ } ea_list; #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 */ 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); 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 */ }; eattr *ea_find(ea_list *, unsigned ea); eattr *ea_walk(struct ea_walk_state *s, uint id, uint max); int ea_get_int(ea_list *, unsigned ea, int def); void ea_dump(ea_list *); void ea_sort(ea_list *); /* Sort entries in all sub-lists */ unsigned ea_scan(ea_list *); /* How many bytes do we need for merged ea_list */ void ea_merge(ea_list *from, ea_list *to); /* Merge sub-lists to allocated buffer */ int ea_same(ea_list *x, ea_list *y); /* Test whether two ea_lists are identical */ uint ea_hash(ea_list *e); /* Calculate 16-bit hash value */ ea_list *ea_append(ea_list *to, ea_list *what); void ea_format_bitfield(struct eattr *a, byte *buf, int bufsize, const char **names, int min, int max); 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); } struct mpnh *mpnh_merge(struct mpnh *x, struct mpnh *y, int rx, int ry, int max, linpool *lp); void mpnh_insert(struct mpnh **n, struct mpnh *y); int mpnh_is_sorted(struct mpnh *x); void rta_init(void); rta *rta_lookup(rta *); /* Get rta equivalent to this one, uc++ */ static inline int rta_is_cached(rta *r) { return r->aflags & RTAF_CACHED; } static inline rta *rta_clone(rta *r) { r->uc++; return r; } void rta__free(rta *r); static inline void rta_free(rta *r) { if (r && !--r->uc) rta__free(r); } rta *rta_do_cow(rta *o, linpool *lp); static inline rta * rta_cow(rta *r, linpool *lp) { return rta_is_cached(r) ? rta_do_cow(r, lp) : r; } void rta_dump(rta *); void rta_dump_all(void); void rta_show(struct cli *, rta *, ea_list *); void rta_set_recursive_next_hop(rtable *dep, rta *a, rtable *tab, ip_addr *gw, ip_addr *ll); /* * 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 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. If the hostentry has zero use count, * the entry is removed before dep is referenced. * * The protocol responsible for routes with recursive next hops should hold a * lock for a 'source' table governing that routes (argument tab to * rta_set_recursive_next_hop()), because its routes reference hostentries * (through rta) related to the governing table. When all such routes are * removed, rtas are immediately removed achieving zero uc. Then the 'source' * table lock could be immediately released, although hostentries may still * exist - they will be freed together with the 'source' table. */ 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--; } extern struct protocol *attr_class_to_protocol[EAP_MAX]; /* * Default protocol preferences */ #define DEF_PREF_DIRECT 240 /* Directly connected */ #define DEF_PREF_STATIC 200 /* Static route */ #define DEF_PREF_OSPF 150 /* OSPF intra-area, inter-area and type 1 external routes */ #define DEF_PREF_BABEL 130 /* Babel */ #define DEF_PREF_RIP 120 /* RIP */ #define DEF_PREF_BGP 100 /* BGP */ #define DEF_PREF_PIPE 70 /* Routes piped from other tables */ #define DEF_PREF_INHERITED 10 /* Routes inherited from other routing daemons */ /* * 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); #endif bird-1.6.3/nest/config.Y0000644000103200001440000005117413027054563014012 0ustar feelausers/* * BIRD -- Core Configuration * * (c) 1998--2000 Martin Mares * (c) 2004 Ondrej Filip * * Can be freely distributed and used under the terms of the GNU GPL. */ CF_HDR #include "nest/rt-dev.h" #include "nest/password.h" #include "nest/cmds.h" #include "lib/lists.h" #include "lib/mac.h" CF_DEFINES static struct proto_config *this_proto; static struct iface_patt *this_ipatt; static struct iface_patt_node *this_ipn; static struct roa_table_config *this_roa_table; static list *this_p_list; static struct password_item *this_p_item; static int password_id; static void iface_patt_check(void) { struct iface_patt_node *pn; WALK_LIST(pn, this_ipatt->ipn_list) if (!pn->pattern || pn->pxlen) cf_error("Interface name/mask expected, not IP prefix"); } static inline void reset_passwords(void) { this_p_list = NULL; } static inline list * get_passwords(void) { list *rv = this_p_list; this_p_list = NULL; return rv; } #define DIRECT_CFG ((struct rt_dev_config *) this_proto) CF_DECLS CF_KEYWORDS(ROUTER, ID, PROTOCOL, TEMPLATE, PREFERENCE, DISABLED, DEBUG, ALL, OFF, DIRECT) CF_KEYWORDS(INTERFACE, IMPORT, EXPORT, FILTER, NONE, TABLE, STATES, ROUTES, FILTERS) CF_KEYWORDS(RECEIVE, LIMIT, ACTION, WARN, BLOCK, RESTART, DISABLE, KEEP, FILTERED) CF_KEYWORDS(PASSWORD, FROM, PASSIVE, TO, ID, EVENTS, PACKETS, PROTOCOLS, INTERFACES) CF_KEYWORDS(ALGORITHM, KEYED, HMAC, MD5, SHA1, SHA256, SHA384, SHA512) CF_KEYWORDS(PRIMARY, STATS, COUNT, FOR, COMMANDS, PREEXPORT, NOEXPORT, GENERATE, ROA) CF_KEYWORDS(LISTEN, BGP, V6ONLY, DUAL, ADDRESS, PORT, PASSWORDS, DESCRIPTION, SORTED) CF_KEYWORDS(RELOAD, IN, OUT, MRTDUMP, MESSAGES, RESTRICT, MEMORY, IGP_METRIC, CLASS, DSCP) CF_KEYWORDS(GRACEFUL, RESTART, WAIT, MAX, FLUSH, AS) CF_ENUM(T_ENUM_RTS, RTS_, DUMMY, STATIC, INHERIT, DEVICE, STATIC_DEVICE, REDIRECT, RIP, OSPF, OSPF_IA, OSPF_EXT1, OSPF_EXT2, BGP, PIPE, BABEL) CF_ENUM(T_ENUM_SCOPE, SCOPE_, HOST, LINK, SITE, ORGANIZATION, UNIVERSE, UNDEFINED) CF_ENUM(T_ENUM_RTC, RTC_, UNICAST, BROADCAST, MULTICAST, ANYCAST) CF_ENUM(T_ENUM_RTD, RTD_, ROUTER, DEVICE, BLACKHOLE, UNREACHABLE, PROHIBIT, MULTIPATH) CF_ENUM(T_ENUM_ROA, ROA_, UNKNOWN, VALID, INVALID) %type idval %type imexport %type rtable %type optsym %type r_args %type roa_args %type roa_table_arg %type sym_args %type proto_start echo_mask echo_size debug_mask debug_list debug_flag mrtdump_mask mrtdump_list mrtdump_flag export_mode roa_mode limit_action tab_sorted tos password_algorithm %type proto_patt proto_patt2 %type limit_spec CF_GRAMMAR /* Setting of router ID */ CF_ADDTO(conf, rtrid) rtrid: ROUTER ID idval ';' { new_config->router_id = $3; } | ROUTER ID FROM iface_patt ';' { new_config->router_id_from = this_ipatt; } ; idval: NUM { $$ = $1; } | '(' term ')' { $$ = f_eval_int($2); } | RTRID | IPA { #ifndef IPV6 $$ = ipa_to_u32($1); #else cf_error("Router IDs must be entered as hexadecimal numbers or IPv4 addresses in IPv6 version"); #endif } | SYM { if ($1->class == (SYM_CONSTANT | T_INT) || $1->class == (SYM_CONSTANT | T_QUAD)) $$ = SYM_VAL($1).i; #ifndef IPV6 else if ($1->class == (SYM_CONSTANT | T_IP)) $$ = ipa_to_u32(SYM_VAL($1).px.ip); #endif else cf_error("Number or IPv4 address constant expected"); } ; CF_ADDTO(conf, listen) listen: LISTEN BGP listen_opts ';' ; listen_opts: /* Nothing */ | listen_opts listen_opt ; listen_opt: ADDRESS ipa { new_config->listen_bgp_addr = $2; } | PORT expr { new_config->listen_bgp_port = $2; } | V6ONLY { new_config->listen_bgp_flags = 0; } | DUAL { new_config->listen_bgp_flags = 1; } ; CF_ADDTO(conf, gr_opts) gr_opts: GRACEFUL RESTART WAIT expr ';' { new_config->gr_wait = $4; } ; /* Creation of routing tables */ tab_sorted: { $$ = 0; } | SORTED { $$ = 1; } ; CF_ADDTO(conf, newtab) newtab: TABLE SYM tab_sorted { struct rtable_config *cf; cf = rt_new_table($2); cf->sorted = $3; } ; CF_ADDTO(conf, roa_table) roa_table_start: ROA TABLE SYM { this_roa_table = roa_new_table_config($3); }; roa_table_opts: /* empty */ | roa_table_opts ROA prefix MAX NUM AS NUM ';' { roa_add_item_config(this_roa_table, $3.addr, $3.len, $5, $7); } ; roa_table: roa_table_start | roa_table_start '{' roa_table_opts '}' ; /* Definition of protocols */ CF_ADDTO(conf, proto) proto_start: PROTOCOL { $$ = SYM_PROTO; } | TEMPLATE { $$ = SYM_TEMPLATE; } ; proto_name: /* EMPTY */ { struct symbol *s = cf_default_name(this_proto->protocol->template, &this_proto->protocol->name_counter); s->class = this_proto->class; s->def = this_proto; this_proto->name = s->name; } | SYM { cf_define_symbol($1, this_proto->class, this_proto); this_proto->name = $1->name; } | FROM SYM { struct symbol *s = cf_default_name(this_proto->protocol->template, &this_proto->protocol->name_counter); s->class = this_proto->class; s->def = this_proto; this_proto->name = s->name; if (($2->class != SYM_TEMPLATE) && ($2->class != SYM_PROTO)) cf_error("Template or protocol name expected"); proto_copy_config(this_proto, $2->def); } | SYM FROM SYM { cf_define_symbol($1, this_proto->class, this_proto); this_proto->name = $1->name; if (($3->class != SYM_TEMPLATE) && ($3->class != SYM_PROTO)) cf_error("Template or protocol name expected"); proto_copy_config(this_proto, $3->def); } ; proto_item: /* EMPTY */ | PREFERENCE expr { if ($2 < 0 || $2 > 0xFFFF) cf_error("Invalid preference"); this_proto->preference = $2; } | DISABLED bool { this_proto->disabled = $2; } | DEBUG debug_mask { this_proto->debug = $2; } | MRTDUMP mrtdump_mask { this_proto->mrtdump = $2; } | IMPORT imexport { this_proto->in_filter = $2; } | EXPORT imexport { this_proto->out_filter = $2; } | RECEIVE LIMIT limit_spec { this_proto->rx_limit = $3; } | IMPORT LIMIT limit_spec { this_proto->in_limit = $3; } | EXPORT LIMIT limit_spec { this_proto->out_limit = $3; } | IMPORT KEEP FILTERED bool { this_proto->in_keep_filtered = $4; } | TABLE rtable { this_proto->table = $2; } | ROUTER ID idval { this_proto->router_id = $3; } | DESCRIPTION text { this_proto->dsc = $2; } ; imexport: FILTER filter { $$ = $2; } | where_filter | ALL { $$ = FILTER_ACCEPT; } | NONE { $$ = FILTER_REJECT; } ; limit_action: /* default */ { $$ = PLA_DISABLE; } | ACTION WARN { $$ = PLA_WARN; } | ACTION BLOCK { $$ = PLA_BLOCK; } | ACTION RESTART { $$ = PLA_RESTART; } | ACTION DISABLE { $$ = PLA_DISABLE; } ; limit_spec: expr limit_action { struct proto_limit *l = cfg_allocz(sizeof(struct proto_limit)); l->limit = $1; l->action = $2; $$ = l; } | OFF { $$ = NULL; } ; rtable: SYM { if ($1->class != SYM_TABLE) cf_error("Table name expected"); $$ = $1->def; } ; CF_ADDTO(conf, debug_default) debug_default: DEBUG PROTOCOLS debug_mask { new_config->proto_default_debug = $3; } | DEBUG COMMANDS expr { new_config->cli_debug = $3; } ; /* MRTDUMP PROTOCOLS is in systep/unix/config.Y */ /* Interface patterns */ iface_patt_node_init: /* EMPTY */ { struct iface_patt_node *ipn = cfg_allocz(sizeof(struct iface_patt_node)); add_tail(&this_ipatt->ipn_list, NODE ipn); this_ipn = ipn; } ; iface_patt_node_body: TEXT { this_ipn->pattern = $1; this_ipn->prefix = IPA_NONE; this_ipn->pxlen = 0; } | prefix_or_ipa { this_ipn->pattern = NULL; this_ipn->prefix = $1.addr; this_ipn->pxlen = $1.len; } | TEXT prefix_or_ipa { this_ipn->pattern = $1; this_ipn->prefix = $2.addr; this_ipn->pxlen = $2.len; } ; iface_negate: { this_ipn->positive = 1; } | '-' { this_ipn->positive = 0; } ; iface_patt_node: iface_patt_node_init iface_negate iface_patt_node_body ; iface_patt_list: iface_patt_node | iface_patt_list ',' iface_patt_node ; /* For name/mask-only iface patterns */ iface_patt_list_nopx: iface_patt_list { iface_patt_check(); } iface_patt_init: { /* Generic this_ipatt init */ this_ipatt = cfg_allocz(sizeof(struct iface_patt)); init_list(&this_ipatt->ipn_list); } ; iface_patt: iface_patt_init iface_patt_list ; tos: CLASS expr { $$ = $2 & 0xfc; if (($2 < 0) || ($2 > 255)) cf_error("TX class must be in range 0-255"); } | DSCP expr { $$ = ($2 & 0x3f) << 2; if (($2 < 0) || ($2 > 63)) cf_error("TX DSCP must be in range 0-63"); } ; /* Direct device route protocol */ CF_ADDTO(proto, dev_proto '}') dev_proto_start: proto_start DIRECT { this_proto = proto_config_new(&proto_device, $1); init_list(&DIRECT_CFG->iface_list); } ; dev_proto: dev_proto_start proto_name '{' | dev_proto proto_item ';' | dev_proto dev_iface_patt ';' | dev_proto CHECK LINK bool ';' { DIRECT_CFG->check_link = $4; } ; dev_iface_init: /* EMPTY */ { this_ipatt = cfg_allocz(sizeof(struct iface_patt)); add_tail(&DIRECT_CFG->iface_list, NODE this_ipatt); init_list(&this_ipatt->ipn_list); } ; dev_iface_patt: INTERFACE dev_iface_init iface_patt_list ; /* Debug flags */ debug_mask: ALL { $$ = ~0; } | OFF { $$ = 0; } | '{' debug_list '}' { $$ = $2; } ; debug_list: debug_flag | debug_list ',' debug_flag { $$ = $1 | $3; } ; debug_flag: STATES { $$ = D_STATES; } | ROUTES { $$ = D_ROUTES; } | FILTERS { $$ = D_FILTERS; } | INTERFACES { $$ = D_IFACES; } | EVENTS { $$ = D_EVENTS; } | PACKETS { $$ = D_PACKETS; } ; /* MRTDump flags */ mrtdump_mask: ALL { $$ = ~0; } | OFF { $$ = 0; } | '{' mrtdump_list '}' { $$ = $2; } ; mrtdump_list: mrtdump_flag | mrtdump_list ',' mrtdump_flag { $$ = $1 | $3; } ; mrtdump_flag: STATES { $$ = MD_STATES; } | MESSAGES { $$ = MD_MESSAGES; } ; /* Password lists */ password_list: PASSWORDS '{' password_items '}' | password_item ; password_items: /* empty */ | password_item ';' password_items ; password_item: password_item_begin '{' password_item_params '}' | password_item_begin ; password_item_begin: PASSWORD text { if (!this_p_list) { this_p_list = cfg_alloc(sizeof(list)); init_list(this_p_list); password_id = 1; } this_p_item = cfg_alloc(sizeof (struct password_item)); this_p_item->password = $2; this_p_item->length = strlen($2); this_p_item->genfrom = 0; this_p_item->gento = TIME_INFINITY; this_p_item->accfrom = 0; this_p_item->accto = TIME_INFINITY; this_p_item->id = password_id++; this_p_item->alg = ALG_UNDEFINED; add_tail(this_p_list, &this_p_item->n); } ; password_item_params: /* empty */ { } | GENERATE FROM datetime ';' password_item_params { this_p_item->genfrom = $3; } | GENERATE TO datetime ';' password_item_params { this_p_item->gento = $3; } | ACCEPT FROM datetime ';' password_item_params { this_p_item->accfrom = $3; } | ACCEPT TO datetime ';' password_item_params { this_p_item->accto = $3; } | FROM datetime ';' password_item_params { this_p_item->genfrom = this_p_item->accfrom = $2; } | TO datetime ';' password_item_params { this_p_item->gento = this_p_item->accto = $2; } | ID expr ';' password_item_params { this_p_item->id = $2; if ($2 <= 0) cf_error("Password ID has to be greated than zero."); } | ALGORITHM password_algorithm ';' password_item_params { this_p_item->alg = $2; } ; password_algorithm: KEYED MD5 { $$ = ALG_MD5; } | KEYED SHA1 { $$ = ALG_SHA1; } | KEYED SHA256 { $$ = ALG_SHA256; } | KEYED SHA384 { $$ = ALG_SHA384; } | KEYED SHA512 { $$ = ALG_SHA512; } | HMAC MD5 { $$ = ALG_HMAC_MD5; } | HMAC SHA1 { $$ = ALG_HMAC_SHA1; } | HMAC SHA256 { $$ = ALG_HMAC_SHA256; } | HMAC SHA384 { $$ = ALG_HMAC_SHA384; } | HMAC SHA512 { $$ = ALG_HMAC_SHA512; } ; /* Core commands */ CF_CLI_HELP(SHOW, ..., [[Show status information]]) CF_CLI(SHOW STATUS,,, [[Show router status]]) { cmd_show_status(); } ; CF_CLI(SHOW MEMORY,,, [[Show memory usage]]) { cmd_show_memory(); } ; CF_CLI(SHOW PROTOCOLS, proto_patt2, [ | \"\"], [[Show routing protocols]]) { proto_apply_cmd($3, proto_cmd_show, 0, 0); } ; CF_CLI(SHOW PROTOCOLS ALL, proto_patt2, [ | \"\"], [[Show routing protocol details]]) { proto_apply_cmd($4, proto_cmd_show, 0, 1); } ; optsym: SYM | /* empty */ { $$ = NULL; } ; CF_CLI(SHOW INTERFACES,,, [[Show network interfaces]]) { if_show(); } ; CF_CLI(SHOW INTERFACES SUMMARY,,, [[Show summary of network interfaces]]) { if_show_summary(); } ; CF_CLI_HELP(SHOW ROUTE, ..., [[Show routing table]]) CF_CLI(SHOW ROUTE, r_args, [[[|for |for ] [table ] [filter |where ] [all] [primary] [filtered] [(export|preexport|noexport)

] [protocol

] [stats|count]]], [[Show routing table]]) { rt_show($3); } ; r_args: /* empty */ { $$ = cfg_allocz(sizeof(struct rt_show_data)); $$->pxlen = 256; $$->filter = FILTER_ACCEPT; } | r_args prefix { $$ = $1; if ($$->pxlen != 256) cf_error("Only one prefix expected"); $$->prefix = $2.addr; $$->pxlen = $2.len; } | r_args FOR prefix_or_ipa { $$ = $1; if ($$->pxlen != 256) cf_error("Only one prefix expected"); $$->prefix = $3.addr; $$->pxlen = $3.len; $$->show_for = 1; } | r_args TABLE SYM { $$ = $1; if ($3->class != SYM_TABLE) cf_error("%s is not a table", $3->name); $$->table = ((struct rtable_config *)$3->def)->table; } | r_args FILTER filter { $$ = $1; if ($$->filter != FILTER_ACCEPT) cf_error("Filter specified twice"); $$->filter = $3; } | r_args where_filter { $$ = $1; if ($$->filter != FILTER_ACCEPT) cf_error("Filter specified twice"); $$->filter = $2; } | r_args ALL { $$ = $1; $$->verbose = 1; } | r_args PRIMARY { $$ = $1; $$->primary_only = 1; } | r_args FILTERED { $$ = $1; $$->filtered = 1; } | r_args export_mode SYM { struct proto_config *c = (struct proto_config *) $3->def; $$ = $1; if ($$->export_mode) cf_error("Protocol specified twice"); if ($3->class != SYM_PROTO || !c->proto) cf_error("%s is not a protocol", $3->name); $$->export_mode = $2; $$->export_protocol = c->proto; $$->running_on_config = c->proto->cf->global; } | r_args PROTOCOL SYM { struct proto_config *c = (struct proto_config *) $3->def; $$ = $1; if ($$->show_protocol) cf_error("Protocol specified twice"); if ($3->class != SYM_PROTO || !c->proto) cf_error("%s is not a protocol", $3->name); $$->show_protocol = c->proto; $$->running_on_config = c->proto->cf->global; } | r_args STATS { $$ = $1; $$->stats = 1; } | r_args COUNT { $$ = $1; $$->stats = 2; } ; export_mode: PREEXPORT { $$ = RSEM_PREEXPORT; } | EXPORT { $$ = RSEM_EXPORT; } | NOEXPORT { $$ = RSEM_NOEXPORT; } ; CF_CLI_HELP(SHOW ROA, ..., [[Show ROA table]]) CF_CLI(SHOW ROA, roa_args, [ | in | for ] [as ] [table ], [[Show ROA table]]) { roa_show($3); } ; roa_args: /* empty */ { $$ = cfg_allocz(sizeof(struct roa_show_data)); $$->mode = ROA_SHOW_ALL; $$->table = roa_table_default; if (roa_table_default == NULL) cf_error("No ROA table defined"); } | roa_args roa_mode prefix { $$ = $1; if ($$->mode != ROA_SHOW_ALL) cf_error("Only one prefix expected"); $$->prefix = $3.addr; $$->pxlen = $3.len; $$->mode = $2; } | roa_args AS NUM { $$ = $1; $$->asn = $3; } | roa_args TABLE SYM { $$ = $1; if ($3->class != SYM_ROA) cf_error("%s is not a ROA table", $3->name); $$->table = ((struct roa_table_config *)$3->def)->table; } ; roa_mode: { $$ = ROA_SHOW_PX; } | IN { $$ = ROA_SHOW_IN; } | FOR { $$ = ROA_SHOW_FOR; } ; CF_CLI_HELP(SHOW SYMBOLS, ..., [[Show all known symbolic names]]) CF_CLI(SHOW SYMBOLS, sym_args, [table|filter|function|protocol|template|roa|], [[Show all known symbolic names]]) { cmd_show_symbols($3); } ; sym_args: /* empty */ { $$ = cfg_allocz(sizeof(struct sym_show_data)); } | sym_args TABLE { $$ = $1; $$->type = SYM_TABLE; } | sym_args FUNCTION { $$ = $1; $$->type = SYM_FUNCTION; } | sym_args FILTER { $$ = $1; $$->type = SYM_FILTER; } | sym_args PROTOCOL { $$ = $1; $$->type = SYM_PROTO; } | sym_args TEMPLATE { $$ = $1; $$->type = SYM_TEMPLATE; } | sym_args ROA { $$ = $1; $$->type = SYM_ROA; } | sym_args SYM { $$ = $1; $$->sym = $2; } ; roa_table_arg: /* empty */ { if (roa_table_default == NULL) cf_error("No ROA table defined"); $$ = roa_table_default; } | TABLE SYM { if ($2->class != SYM_ROA) cf_error("%s is not a ROA table", $2->name); $$ = ((struct roa_table_config *)$2->def)->table; } ; CF_CLI_HELP(ADD, roa ..., [[Add ROA record]]) CF_CLI(ADD ROA, prefix MAX NUM AS NUM roa_table_arg, max as [table ], [[Add ROA record]]) { if (! cli_access_restricted()) { roa_add_item($8, $3.addr, $3.len, $5, $7, ROA_SRC_DYNAMIC); cli_msg(0, ""); } }; CF_CLI_HELP(DELETE, roa ..., [[Delete ROA record]]) CF_CLI(DELETE ROA, prefix MAX NUM AS NUM roa_table_arg, max as [table ], [[Delete ROA record]]) { if (! cli_access_restricted()) { roa_delete_item($8, $3.addr, $3.len, $5, $7, ROA_SRC_DYNAMIC); cli_msg(0, ""); } }; CF_CLI_HELP(FLUSH, roa [table ], [[Removes all dynamic ROA records]]) CF_CLI(FLUSH ROA, roa_table_arg, [table ], [[Removes all dynamic ROA records]]) { if (! cli_access_restricted()) { roa_flush($3, ROA_SRC_DYNAMIC); cli_msg(0, ""); } }; CF_CLI_HELP(DUMP, ..., [[Dump debugging information]]) CF_CLI(DUMP RESOURCES,,, [[Dump all allocated resource]]) { rdump(&root_pool); cli_msg(0, ""); } ; CF_CLI(DUMP SOCKETS,,, [[Dump open sockets]]) { sk_dump_all(); cli_msg(0, ""); } ; CF_CLI(DUMP EVENTS,,, [[Dump event log]]) { io_log_dump(); cli_msg(0, ""); } ; CF_CLI(DUMP INTERFACES,,, [[Dump interface information]]) { if_dump_all(); cli_msg(0, ""); } ; CF_CLI(DUMP NEIGHBORS,,, [[Dump neighbor cache]]) { neigh_dump_all(); cli_msg(0, ""); } ; CF_CLI(DUMP ATTRIBUTES,,, [[Dump attribute cache]]) { rta_dump_all(); cli_msg(0, ""); } ; CF_CLI(DUMP ROUTES,,, [[Dump routing table]]) { rt_dump_all(); cli_msg(0, ""); } ; CF_CLI(DUMP PROTOCOLS,,, [[Dump protocol information]]) { protos_dump_all(); cli_msg(0, ""); } ; CF_CLI(EVAL, term, , [[Evaluate an expression]]) { cmd_eval($2); } ; CF_CLI_HELP(ECHO, ..., [[Control echoing of log messages]]) CF_CLI(ECHO, echo_mask echo_size, (all | off | { debug|trace|info|remote|warning|error|auth [, ...] }) [], [[Control echoing of log messages]]) { cli_set_log_echo(this_cli, $2, $3); cli_msg(0, ""); } ; echo_mask: ALL { $$ = ~0; } | OFF { $$ = 0; } | '{' log_mask_list '}' { $$ = $2; } ; echo_size: /* empty */ { $$ = 4096; } | NUM { if ($1 < 256 || $1 > 65536) cf_error("Invalid log buffer size"); $$ = $1; } ; CF_CLI(DISABLE, proto_patt, | \"\" | all, [[Disable protocol]]) { proto_apply_cmd($2, proto_cmd_disable, 1, 0); } ; CF_CLI(ENABLE, proto_patt, | \"\" | all, [[Enable protocol]]) { proto_apply_cmd($2, proto_cmd_enable, 1, 0); } ; CF_CLI(RESTART, proto_patt, | \"\" | all, [[Restart protocol]]) { proto_apply_cmd($2, proto_cmd_restart, 1, 0); } ; CF_CLI(RELOAD, proto_patt, | \"\" | all, [[Reload protocol]]) { proto_apply_cmd($2, proto_cmd_reload, 1, CMD_RELOAD); } ; CF_CLI(RELOAD IN, proto_patt, | \"\" | all, [[Reload protocol (just imported routes)]]) { proto_apply_cmd($3, proto_cmd_reload, 1, CMD_RELOAD_IN); } ; CF_CLI(RELOAD OUT, proto_patt, | \"\" | all, [[Reload protocol (just exported routes)]]) { proto_apply_cmd($3, proto_cmd_reload, 1, CMD_RELOAD_OUT); } ; CF_CLI_HELP(DEBUG, ..., [[Control protocol debugging via BIRD logs]]) CF_CLI(DEBUG, proto_patt debug_mask, ( | \"\" | all) (all | off | { states|routes|filters|interfaces|events|packets [, ...] }), [[Control protocol debugging via BIRD logs]]) { proto_apply_cmd($2, proto_cmd_debug, 1, $3); } ; CF_CLI_HELP(MRTDUMP, ..., [[Control protocol debugging via MRTdump files]]) CF_CLI(MRTDUMP, proto_patt mrtdump_mask, ( | \"\" | all) (all | off | { states|messages [, ...] }), [[Control protocol debugging via MRTdump format]]) { proto_apply_cmd($2, proto_cmd_mrtdump, 1, $3); } ; CF_CLI(RESTRICT,,,[[Restrict current CLI session to safe commands]]) { this_cli->restricted = 1; cli_msg(16, "Access restricted"); } ; proto_patt: SYM { $$.ptr = $1; $$.patt = 0; } | ALL { $$.ptr = NULL; $$.patt = 1; } | TEXT { $$.ptr = $1; $$.patt = 1; } ; proto_patt2: SYM { $$.ptr = $1; $$.patt = 0; } | { $$.ptr = NULL; $$.patt = 1; } | TEXT { $$.ptr = $1; $$.patt = 1; } ; CF_ADDTO(dynamic_attr, IGP_METRIC { $$ = f_new_dynamic_attr(EAF_TYPE_INT, T_INT, EA_GEN_IGP_METRIC); }) CF_CODE CF_END bird-1.6.3/nest/mrtdump.h0000644000103200001440000000077213027054563014252 0ustar feelausers/* * BIRD -- MRTdump handling * * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef MRTDUMP_H #define MRTDUMP_H #include "nest/protocol.h" /* MRTDump values */ #define MRTDUMP_HDR_LENGTH 12 /* MRTdump types */ #define BGP4MP 16 /* MRTdump subtypes */ #define BGP4MP_MESSAGE 1 #define BGP4MP_MESSAGE_AS4 4 #define BGP4MP_STATE_CHANGE_AS4 5 /* implemented in sysdep */ void mrt_dump_message(struct proto *p, u16 type, u16 subtype, byte *buf, u32 len); #endif bird-1.6.3/nest/rt-dev.h0000644000103200001440000000052113027054563013753 0ustar feelausers/* * BIRD -- Direct Device Routes * * (c) 1998--1999 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_RT_DEV_H_ #define _BIRD_RT_DEV_H_ struct rt_dev_config { struct proto_config c; list iface_list; /* list of struct iface_patt */ int check_link; }; #endif bird-1.6.3/nest/neighbor.c0000644000103200001440000002431013027054563014344 0ustar feelausers/* * BIRD -- Neighbor Cache * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Neighbor cache * * Most routing protocols need to associate their internal state data with * neighboring routers, check whether an address given as the next hop * attribute of a route is really an address of a directly connected host * and which interface is it connected through. Also, they often need to * be notified when a neighbor ceases to exist or when their long awaited * neighbor becomes connected. The neighbor cache is there to solve all * these problems. * * The neighbor cache maintains a collection of neighbor entries. Each * entry represents one IP address corresponding to either our directly * connected neighbor or our own end of the link (when the scope of the * address is set to %SCOPE_HOST) together with per-neighbor data belonging to a * single protocol. * * Active entries represent known neighbors and are stored in a hash * table (to allow fast retrieval based on the IP address of the node) and * two linked lists: one global and one per-interface (allowing quick * processing of interface change events). Inactive entries exist only * when the protocol has explicitly requested it via the %NEF_STICKY * flag because it wishes to be notified when the node will again become * a neighbor. Such entries are enqueued in a special list which is walked * whenever an interface changes its state to up. * * When a neighbor event occurs (a neighbor gets disconnected or a sticky * inactive neighbor becomes connected), the protocol hook neigh_notify() * is called to advertise the change. */ #undef LOCAL_DEBUG #include "nest/bird.h" #include "nest/iface.h" #include "nest/protocol.h" #include "lib/resource.h" #define NEIGH_HASH_SIZE 256 static slab *neigh_slab; static list sticky_neigh_list, neigh_hash_table[NEIGH_HASH_SIZE]; static inline uint neigh_hash(struct proto *p, ip_addr *a) { return (p->hash_key ^ ipa_hash(*a)) & (NEIGH_HASH_SIZE-1); } static int if_connected(ip_addr *a, struct iface *i, struct ifa **ap) { struct ifa *b; if (!(i->flags & IF_UP)) { *ap = NULL; return -1; } WALK_LIST(b, i->addrs) { *ap = b; if (ipa_equal(*a, b->ip)) return SCOPE_HOST; if (b->flags & IA_PEER) { if (ipa_equal(*a, b->opposite)) return b->scope; } else { if (ipa_in_net(*a, b->prefix, b->pxlen)) { #ifndef IPV6 if ((b->pxlen < (BITS_PER_IP_ADDRESS - 1)) && (ipa_equal(*a, b->prefix) || /* Network address */ ipa_equal(*a, b->brd))) /* Broadcast */ { *ap = NULL; return -1; } #endif return b->scope; } } } *ap = NULL; return -1; } /** * neigh_find - find or create a neighbor entry. * @p: protocol which asks for the entry. * @a: pointer to IP address of the node to be searched for. * @flags: 0 or %NEF_STICKY if you want to create a sticky entry. * * Search the neighbor cache for a node with given IP address. If * it's found, a pointer to the neighbor entry is returned. If no * such entry exists and the node is directly connected on * one of our active interfaces, a new entry is created and returned * to the caller with protocol-dependent fields initialized to zero. * If the node is not connected directly or *@a is not a valid unicast * IP address, neigh_find() returns %NULL. */ neighbor * neigh_find(struct proto *p, ip_addr *a, unsigned flags) { return neigh_find2(p, a, NULL, flags); } neighbor * neigh_find2(struct proto *p, ip_addr *a, struct iface *ifa, unsigned flags) { neighbor *n; int class, scope = -1; uint h = neigh_hash(p, a); struct iface *i; struct ifa *addr; WALK_LIST(n, neigh_hash_table[h]) /* Search the cache */ if (n->proto == p && ipa_equal(*a, n->addr) && (!ifa || (ifa == n->iface))) return n; class = ipa_classify(*a); if (class < 0) /* Invalid address */ return NULL; if (((class & IADDR_SCOPE_MASK) == SCOPE_HOST) || (((class & IADDR_SCOPE_MASK) == SCOPE_LINK) && (ifa == NULL)) || !(class & IADDR_HOST)) return NULL; /* Bad scope or a somecast */ if (ifa) { scope = if_connected(a, ifa, &addr); flags |= NEF_BIND; if ((scope < 0) && (flags & NEF_ONLINK)) scope = class & IADDR_SCOPE_MASK; } else WALK_LIST(i, iface_list) if ((scope = if_connected(a, i, &addr)) >= 0) { ifa = i; break; } /* scope < 0 means i don't know neighbor */ /* scope >= 0 implies ifa != NULL */ if ((scope < 0) && !(flags & NEF_STICKY)) return NULL; n = sl_alloc(neigh_slab); n->addr = *a; if (scope >= 0) { add_tail(&neigh_hash_table[h], &n->n); add_tail(&ifa->neighbors, &n->if_n); } else { add_tail(&sticky_neigh_list, &n->n); scope = -1; } n->iface = ifa; n->ifa = addr; n->proto = p; n->data = NULL; n->aux = 0; n->flags = flags; n->scope = scope; return n; } /** * neigh_dump - dump specified neighbor entry. * @n: the entry to dump * * This functions dumps the contents of a given neighbor entry * to debug output. */ void neigh_dump(neighbor *n) { debug("%p %I ", n, n->addr); if (n->iface) debug("%s ", n->iface->name); else debug("[] "); debug("%s %p %08x scope %s", n->proto->name, n->data, n->aux, ip_scope_text(n->scope)); if (n->flags & NEF_STICKY) debug(" STICKY"); debug("\n"); } /** * neigh_dump_all - dump all neighbor entries. * * This function dumps the contents of the neighbor cache to * debug output. */ void neigh_dump_all(void) { neighbor *n; int i; debug("Known neighbors:\n"); WALK_LIST(n, sticky_neigh_list) neigh_dump(n); for(i=0; iiface = i; n->ifa = a; n->scope = scope; add_tail(&i->neighbors, &n->if_n); rem_node(&n->n); add_tail(&neigh_hash_table[neigh_hash(n->proto, &n->addr)], &n->n); DBG("Waking up sticky neighbor %I\n", n->addr); if (n->proto->neigh_notify && n->proto->core_state != FS_FLUSHING) n->proto->neigh_notify(n); } static void neigh_down(neighbor *n) { DBG("Flushing neighbor %I on %s\n", n->addr, n->iface->name); rem_node(&n->if_n); if (! (n->flags & NEF_BIND)) n->iface = NULL; n->ifa = NULL; n->scope = -1; if (n->proto->neigh_notify && n->proto->core_state != FS_FLUSHING) n->proto->neigh_notify(n); rem_node(&n->n); if (n->flags & NEF_STICKY) { add_tail(&sticky_neigh_list, &n->n); /* Respawn neighbor if there is another matching prefix */ struct iface *i; struct ifa *a; int scope; if (!n->iface) WALK_LIST(i, iface_list) if ((scope = if_connected(&n->addr, i, &a)) >= 0) { neigh_up(n, i, scope, a); return; } } else sl_free(neigh_slab, n); } /** * neigh_if_up: notify neighbor cache about interface up event * @i: interface in question * * Tell the neighbor cache that a new interface became up. * * The neighbor cache wakes up all inactive sticky neighbors with * addresses belonging to prefixes of the interface @i. */ void neigh_if_up(struct iface *i) { struct ifa *a; neighbor *n, *next; int scope; WALK_LIST_DELSAFE(n, next, sticky_neigh_list) if ((!n->iface || n->iface == i) && ((scope = if_connected(&n->addr, i, &a)) >= 0)) neigh_up(n, i, scope, a); } /** * neigh_if_down - notify neighbor cache about interface down event * @i: the interface in question * * Notify the neighbor cache that an interface has ceased to exist. * * It causes all entries belonging to neighbors connected to this interface * to be flushed. */ void neigh_if_down(struct iface *i) { node *x, *y; WALK_LIST_DELSAFE(x, y, i->neighbors) neigh_down(SKIP_BACK(neighbor, if_n, x)); } /** * neigh_if_link - notify neighbor cache about interface link change * @i: the interface in question * * Notify the neighbor cache that an interface changed link state. * All owners of neighbor entries connected to this interface are * notified. */ void neigh_if_link(struct iface *i) { node *x, *y; WALK_LIST_DELSAFE(x, y, i->neighbors) { neighbor *n = SKIP_BACK(neighbor, if_n, x); if (n->proto->neigh_notify && n->proto->core_state != FS_FLUSHING) n->proto->neigh_notify(n); } } /** * neigh_ifa_update: notify neighbor cache about interface address add or remove event * @a: interface address in question * * Tell the neighbor cache that an address was added or removed. * * The neighbor cache wakes up all inactive sticky neighbors with * addresses belonging to prefixes of the interface belonging to @ifa * and causes all unreachable neighbors to be flushed. */ void neigh_ifa_update(struct ifa *a) { struct iface *i = a->iface; node *x, *y; /* Remove all neighbors whose scope has changed */ WALK_LIST_DELSAFE(x, y, i->neighbors) { struct ifa *aa; neighbor *n = SKIP_BACK(neighbor, if_n, x); if (if_connected(&n->addr, i, &aa) != n->scope) neigh_down(n); } /* Wake up all sticky neighbors that are reachable now */ neigh_if_up(i); } static inline void neigh_prune_one(neighbor *n) { if (n->proto->proto_state != PS_DOWN) return; rem_node(&n->n); if (n->scope >= 0) rem_node(&n->if_n); sl_free(neigh_slab, n); } /** * neigh_prune - prune neighbor cache * * neigh_prune() examines all neighbor entries cached and removes those * corresponding to inactive protocols. It's called whenever a protocol * is shut down to get rid of all its heritage. */ void neigh_prune(void) { neighbor *n; node *m; int i; DBG("Pruning neighbors\n"); for(i=0; i * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_BIRD_H_ #define _BIRD_BIRD_H_ #include "sysdep/config.h" #include "lib/birdlib.h" #include "lib/ip.h" #endif bird-1.6.3/nest/proto.c0000644000103200001440000012723613027054563013725 0ustar feelausers/* * BIRD -- Protocols * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #undef LOCAL_DEBUG #include "nest/bird.h" #include "nest/protocol.h" #include "lib/resource.h" #include "lib/lists.h" #include "lib/event.h" #include "lib/string.h" #include "conf/conf.h" #include "nest/route.h" #include "nest/iface.h" #include "nest/cli.h" #include "filter/filter.h" pool *proto_pool; static list protocol_list; static list proto_list; #define PD(pr, msg, args...) do { if (pr->debug & D_STATES) { log(L_TRACE "%s: " msg, pr->name , ## args); } } while(0) list active_proto_list; static list inactive_proto_list; static list initial_proto_list; static list flush_proto_list; static struct proto *initial_device_proto; static event *proto_flush_event; static timer *proto_shutdown_timer; static timer *gr_wait_timer; #define GRS_NONE 0 #define GRS_INIT 1 #define GRS_ACTIVE 2 #define GRS_DONE 3 static int graceful_restart_state; static u32 graceful_restart_locks; static char *p_states[] = { "DOWN", "START", "UP", "STOP" }; static char *c_states[] = { "HUNGRY", "???", "HAPPY", "FLUSHING" }; static void proto_flush_loop(void *); static void proto_shutdown_loop(struct timer *); static void proto_rethink_goal(struct proto *p); static void proto_want_export_up(struct proto *p); static void proto_fell_down(struct proto *p); static char *proto_state_name(struct proto *p); static void proto_relink(struct proto *p) { list *l = NULL; switch (p->core_state) { case FS_HUNGRY: l = &inactive_proto_list; break; case FS_HAPPY: l = &active_proto_list; break; case FS_FLUSHING: l = &flush_proto_list; break; default: ASSERT(0); } rem_node(&p->n); add_tail(l, &p->n); } static void proto_log_state_change(struct proto *p) { if (p->debug & D_STATES) { char *name = proto_state_name(p); if (name != p->last_state_name_announced) { p->last_state_name_announced = name; PD(p, "State changed to %s", proto_state_name(p)); } } else p->last_state_name_announced = NULL; } /** * proto_new - create a new protocol instance * @c: protocol configuration * @size: size of protocol data structure (each protocol instance is represented by * a structure starting with generic part [struct &proto] and continued * with data specific to the protocol) * * When a new configuration has been read in, the core code starts * initializing all the protocol instances configured by calling their * init() hooks with the corresponding instance configuration. The initialization * code of the protocol is expected to create a new instance according to the * configuration by calling this function and then modifying the default settings * to values wanted by the protocol. */ void * proto_new(struct proto_config *c, unsigned size) { struct protocol *pr = c->protocol; struct proto *p = mb_allocz(proto_pool, size); p->cf = c; p->debug = c->debug; p->mrtdump = c->mrtdump; p->name = c->name; p->preference = c->preference; p->disabled = c->disabled; p->proto = pr; p->table = c->table->table; p->hash_key = random_u32(); c->proto = p; return p; } static void proto_init_instance(struct proto *p) { /* Here we cannot use p->cf->name since it won't survive reconfiguration */ p->pool = rp_new(proto_pool, p->proto->name); p->attn = ev_new(p->pool); p->attn->data = p; if (graceful_restart_state == GRS_INIT) p->gr_recovery = 1; if (! p->proto->multitable) rt_lock_table(p->table); } extern pool *rt_table_pool; /** * proto_add_announce_hook - connect protocol to a routing table * @p: protocol instance * @t: routing table to connect to * @stats: per-table protocol statistics * * This function creates a connection between the protocol instance @p and the * routing table @t, making the protocol hear all changes in the table. * * The announce hook is linked in the protocol ahook list. Announce hooks are * allocated from the routing table resource pool and when protocol accepts * routes also in the table ahook list. The are linked to the table ahook list * and unlinked from it depending on export_state (in proto_want_export_up() and * proto_want_export_down()) and they are automatically freed after the protocol * is flushed (in proto_fell_down()). * * Unless you want to listen to multiple routing tables (as the Pipe protocol * does), you needn't to worry about this function since the connection to the * protocol's primary routing table is initialized automatically by the core * code. */ struct announce_hook * proto_add_announce_hook(struct proto *p, struct rtable *t, struct proto_stats *stats) { struct announce_hook *h; DBG("Connecting protocol %s to table %s\n", p->name, t->name); PD(p, "Connected to table %s", t->name); h = mb_allocz(rt_table_pool, sizeof(struct announce_hook)); h->table = t; h->proto = p; h->stats = stats; h->next = p->ahooks; p->ahooks = h; if (p->rt_notify && (p->export_state != ES_DOWN)) add_tail(&t->hooks, &h->n); return h; } /** * proto_find_announce_hook - find announce hooks * @p: protocol instance * @t: routing table * * Returns pointer to announce hook or NULL */ struct announce_hook * proto_find_announce_hook(struct proto *p, struct rtable *t) { struct announce_hook *a; for (a = p->ahooks; a; a = a->next) if (a->table == t) return a; return NULL; } static void proto_link_ahooks(struct proto *p) { struct announce_hook *h; if (p->rt_notify) for(h=p->ahooks; h; h=h->next) add_tail(&h->table->hooks, &h->n); } static void proto_unlink_ahooks(struct proto *p) { struct announce_hook *h; if (p->rt_notify) for(h=p->ahooks; h; h=h->next) rem_node(&h->n); } static void proto_free_ahooks(struct proto *p) { struct announce_hook *h, *hn; for(h = p->ahooks; h; h = hn) { hn = h->next; mb_free(h); } p->ahooks = NULL; p->main_ahook = NULL; } /** * proto_config_new - create a new protocol configuration * @pr: protocol the configuration will belong to * @class: SYM_PROTO or SYM_TEMPLATE * * Whenever the configuration file says that a new instance * of a routing protocol should be created, the parser calls * proto_config_new() to create a configuration entry for this * instance (a structure staring with the &proto_config header * containing all the generic items followed by protocol-specific * ones). Also, the configuration entry gets added to the list * of protocol instances kept in the configuration. * * The function is also used to create protocol templates (when class * SYM_TEMPLATE is specified), the only difference is that templates * are not added to the list of protocol instances and therefore not * initialized during protos_commit()). */ void * proto_config_new(struct protocol *pr, int class) { struct proto_config *c = cfg_allocz(pr->config_size); if (class == SYM_PROTO) add_tail(&new_config->protos, &c->n); c->global = new_config; c->protocol = pr; c->name = pr->name; c->preference = pr->preference; c->class = class; c->out_filter = FILTER_REJECT; c->table = c->global->master_rtc; c->debug = new_config->proto_default_debug; c->mrtdump = new_config->proto_default_mrtdump; return c; } /** * proto_copy_config - copy a protocol configuration * @dest: destination protocol configuration * @src: source protocol configuration * * Whenever a new instance of a routing protocol is created from the * template, proto_copy_config() is called to copy a content of * the source protocol configuration to the new protocol configuration. * Name, class and a node in protos list of @dest are kept intact. * copy_config() protocol hook is used to copy protocol-specific data. */ void proto_copy_config(struct proto_config *dest, struct proto_config *src) { node old_node; int old_class; char *old_name; if (dest->protocol != src->protocol) cf_error("Can't copy configuration from a different protocol type"); if (dest->protocol->copy_config == NULL) cf_error("Inheriting configuration for %s is not supported", src->protocol->name); DBG("Copying configuration from %s to %s\n", src->name, dest->name); /* * Copy struct proto_config here. Keep original node, class and name. * protocol-specific config copy is handled by protocol copy_config() hook */ old_node = dest->n; old_class = dest->class; old_name = dest->name; memcpy(dest, src, sizeof(struct proto_config)); dest->n = old_node; dest->class = old_class; dest->name = old_name; dest->protocol->copy_config(dest, src); } /** * protos_preconfig - pre-configuration processing * @c: new configuration * * This function calls the preconfig() hooks of all routing * protocols available to prepare them for reading of the new * configuration. */ void protos_preconfig(struct config *c) { struct protocol *p; init_list(&c->protos); DBG("Protocol preconfig:"); WALK_LIST(p, protocol_list) { DBG(" %s", p->name); p->name_counter = 0; if (p->preconfig) p->preconfig(p, c); } DBG("\n"); } /** * protos_postconfig - post-configuration processing * @c: new configuration * * This function calls the postconfig() hooks of all protocol * instances specified in configuration @c. The hooks are not * called for protocol templates. */ void protos_postconfig(struct config *c) { struct proto_config *x; struct protocol *p; DBG("Protocol postconfig:"); WALK_LIST(x, c->protos) { DBG(" %s", x->name); p = x->protocol; if (p->postconfig) p->postconfig(x); } DBG("\n"); } extern struct protocol proto_unix_iface; static struct proto * proto_init(struct proto_config *c) { struct protocol *p = c->protocol; struct proto *q = p->init(c); q->proto_state = PS_DOWN; q->core_state = FS_HUNGRY; q->export_state = ES_DOWN; q->last_state_change = now; add_tail(&initial_proto_list, &q->n); if (p == &proto_unix_iface) initial_device_proto = q; add_tail(&proto_list, &q->glob_node); PD(q, "Initializing%s", q->disabled ? " [disabled]" : ""); return q; } int proto_reconfig_type; /* Hack to propagate type info to pipe reconfigure hook */ static int proto_reconfigure(struct proto *p, struct proto_config *oc, struct proto_config *nc, int type) { /* If the protocol is DOWN, we just restart it */ if (p->proto_state == PS_DOWN) return 0; /* If there is a too big change in core attributes, ... */ if ((nc->protocol != oc->protocol) || (nc->disabled != p->disabled) || (nc->table->table != oc->table->table)) return 0; p->debug = nc->debug; p->mrtdump = nc->mrtdump; proto_reconfig_type = type; /* Execute protocol specific reconfigure hook */ if (! (p->proto->reconfigure && p->proto->reconfigure(p, nc))) return 0; DBG("\t%s: same\n", oc->name); PD(p, "Reconfigured"); p->cf = nc; p->name = nc->name; p->preference = nc->preference; /* Multitable protocols handle rest in their reconfigure hooks */ if (p->proto->multitable) return 1; /* Update filters and limits in the main announce hook Note that this also resets limit state */ if (p->main_ahook) { struct announce_hook *ah = p->main_ahook; ah->in_filter = nc->in_filter; ah->out_filter = nc->out_filter; ah->rx_limit = nc->rx_limit; ah->in_limit = nc->in_limit; ah->out_limit = nc->out_limit; ah->in_keep_filtered = nc->in_keep_filtered; proto_verify_limits(ah); } /* Update routes when filters changed. If the protocol in not UP, it has no routes and we can ignore such changes */ if ((p->proto_state != PS_UP) || (type == RECONFIG_SOFT)) return 1; int import_changed = ! filter_same(nc->in_filter, oc->in_filter); int export_changed = ! filter_same(nc->out_filter, oc->out_filter); /* We treat a change in preferences by reimporting routes */ if (nc->preference != oc->preference) import_changed = 1; if (import_changed || export_changed) log(L_INFO "Reloading protocol %s", p->name); /* If import filter changed, call reload hook */ if (import_changed && ! (p->reload_routes && p->reload_routes(p))) { /* Now, the protocol is reconfigured. But route reload failed and we have to do regular protocol restart. */ log(L_INFO "Restarting protocol %s", p->name); p->disabled = 1; p->down_code = PDC_CF_RESTART; proto_rethink_goal(p); p->disabled = 0; proto_rethink_goal(p); return 1; } if (export_changed) proto_request_feeding(p); return 1; } /** * protos_commit - commit new protocol configuration * @new: new configuration * @old: old configuration or %NULL if it's boot time config * @force_reconfig: force restart of all protocols (used for example * when the router ID changes) * @type: type of reconfiguration (RECONFIG_SOFT or RECONFIG_HARD) * * Scan differences between @old and @new configuration and adjust all * protocol instances to conform to the new configuration. * * When a protocol exists in the new configuration, but it doesn't in the * original one, it's immediately started. When a collision with the other * running protocol would arise, the new protocol will be temporarily stopped * by the locking mechanism. * * When a protocol exists in the old configuration, but it doesn't in the * new one, it's shut down and deleted after the shutdown completes. * * When a protocol exists in both configurations, the core decides * whether it's possible to reconfigure it dynamically - it checks all * the core properties of the protocol (changes in filters are ignored * if type is RECONFIG_SOFT) and if they match, it asks the * reconfigure() hook of the protocol to see if the protocol is able * to switch to the new configuration. If it isn't possible, the * protocol is shut down and a new instance is started with the new * configuration after the shutdown is completed. */ void protos_commit(struct config *new, struct config *old, int force_reconfig, int type) { struct proto_config *oc, *nc; struct proto *p, *n; struct symbol *sym; DBG("protos_commit:\n"); if (old) { WALK_LIST(oc, old->protos) { p = oc->proto; sym = cf_find_symbol(new, oc->name); if (sym && sym->class == SYM_PROTO && !new->shutdown) { /* Found match, let's check if we can smoothly switch to new configuration */ /* No need to check description */ nc = sym->def; nc->proto = p; /* We will try to reconfigure protocol p */ if (! force_reconfig && proto_reconfigure(p, oc, nc, type)) continue; /* Unsuccessful, we will restart it */ if (!p->disabled && !nc->disabled) log(L_INFO "Restarting protocol %s", p->name); else if (p->disabled && !nc->disabled) log(L_INFO "Enabling protocol %s", p->name); else if (!p->disabled && nc->disabled) log(L_INFO "Disabling protocol %s", p->name); p->down_code = nc->disabled ? PDC_CF_DISABLE : PDC_CF_RESTART; p->cf_new = nc; } else if (!new->shutdown) { log(L_INFO "Removing protocol %s", p->name); p->down_code = PDC_CF_REMOVE; p->cf_new = NULL; } else /* global shutdown */ { p->down_code = PDC_CMD_SHUTDOWN; p->cf_new = NULL; } p->reconfiguring = 1; config_add_obstacle(old); proto_rethink_goal(p); } } WALK_LIST(nc, new->protos) if (!nc->proto) { if (old) /* Not a first-time configuration */ log(L_INFO "Adding protocol %s", nc->name); proto_init(nc); } DBG("\tdone\n"); DBG("Protocol start\n"); /* Start device protocol first */ if (initial_device_proto) { proto_rethink_goal(initial_device_proto); initial_device_proto = NULL; } /* Determine router ID for the first time - it has to be here and not in global_commit() because it is postponed after start of device protocol */ if (!config->router_id) { config->router_id = if_choose_router_id(config->router_id_from, 0); if (!config->router_id) die("Cannot determine router ID, please configure it manually"); } /* Start all other protocols */ WALK_LIST_DELSAFE(p, n, initial_proto_list) proto_rethink_goal(p); } static void proto_rethink_goal(struct proto *p) { struct protocol *q; byte goal; if (p->reconfiguring && p->core_state == FS_HUNGRY && p->proto_state == PS_DOWN) { struct proto_config *nc = p->cf_new; DBG("%s has shut down for reconfiguration\n", p->name); p->cf->proto = NULL; config_del_obstacle(p->cf->global); rem_node(&p->n); rem_node(&p->glob_node); mb_free(p); if (!nc) return; p = proto_init(nc); } /* Determine what state we want to reach */ if (p->disabled || p->reconfiguring) goal = PS_DOWN; else goal = PS_UP; q = p->proto; if (goal == PS_UP) /* Going up */ { if (p->proto_state == PS_DOWN && p->core_state == FS_HUNGRY) { DBG("Kicking %s up\n", p->name); PD(p, "Starting"); proto_init_instance(p); proto_notify_state(p, (q->start ? q->start(p) : PS_UP)); } } else /* Going down */ { if (p->proto_state == PS_START || p->proto_state == PS_UP) { DBG("Kicking %s down\n", p->name); PD(p, "Shutting down"); proto_notify_state(p, (q->shutdown ? q->shutdown(p) : PS_DOWN)); } } } /** * DOC: Graceful restart recovery * * Graceful restart of a router is a process when the routing plane (e.g. BIRD) * restarts but both the forwarding plane (e.g kernel routing table) and routing * neighbors keep proper routes, and therefore uninterrupted packet forwarding * is maintained. * * BIRD implements graceful restart recovery by deferring export of routes to * protocols until routing tables are refilled with the expected content. After * start, protocols generate routes as usual, but routes are not propagated to * them, until protocols report that they generated all routes. After that, * graceful restart recovery is finished and the export (and the initial feed) * to protocols is enabled. * * When graceful restart recovery need is detected during initialization, then * enabled protocols are marked with @gr_recovery flag before start. Such * protocols then decide how to proceed with graceful restart, participation is * voluntary. Protocols could lock the recovery by proto_graceful_restart_lock() * (stored in @gr_lock flag), which means that they want to postpone the end of * the recovery until they converge and then unlock it. They also could set * @gr_wait before advancing to %PS_UP, which means that the core should defer * route export to that protocol until the end of the recovery. This should be * done by protocols that expect their neigbors to keep the proper routes * (kernel table, BGP sessions with BGP graceful restart capability). * * The graceful restart recovery is finished when either all graceful restart * locks are unlocked or when graceful restart wait timer fires. * */ static void graceful_restart_done(struct timer *t); /** * graceful_restart_recovery - request initial graceful restart recovery * * Called by the platform initialization code if the need for recovery * after graceful restart is detected during boot. Have to be called * before protos_commit(). */ void graceful_restart_recovery(void) { graceful_restart_state = GRS_INIT; } /** * graceful_restart_init - initialize graceful restart * * When graceful restart recovery was requested, the function starts an active * phase of the recovery and initializes graceful restart wait timer. The * function have to be called after protos_commit(). */ void graceful_restart_init(void) { if (!graceful_restart_state) return; log(L_INFO "Graceful restart started"); if (!graceful_restart_locks) { graceful_restart_done(NULL); return; } graceful_restart_state = GRS_ACTIVE; gr_wait_timer = tm_new(proto_pool); gr_wait_timer->hook = graceful_restart_done; tm_start(gr_wait_timer, config->gr_wait); } /** * graceful_restart_done - finalize graceful restart * @t: unused * * When there are no locks on graceful restart, the functions finalizes the * graceful restart recovery. Protocols postponing route export until the end of * the recovery are awakened and the export to them is enabled. All other * related state is cleared. The function is also called when the graceful * restart wait timer fires (but there are still some locks). */ static void graceful_restart_done(struct timer *t UNUSED) { struct proto *p; node *n; log(L_INFO "Graceful restart done"); graceful_restart_state = GRS_DONE; WALK_LIST2(p, n, proto_list, glob_node) { if (!p->gr_recovery) continue; /* Resume postponed export of routes */ if ((p->proto_state == PS_UP) && p->gr_wait) { proto_want_export_up(p); proto_log_state_change(p); } /* Cleanup */ p->gr_recovery = 0; p->gr_wait = 0; p->gr_lock = 0; } graceful_restart_locks = 0; } void graceful_restart_show_status(void) { if (graceful_restart_state != GRS_ACTIVE) return; cli_msg(-24, "Graceful restart recovery in progress"); cli_msg(-24, " Waiting for %d protocols to recover", graceful_restart_locks); cli_msg(-24, " Wait timer is %d/%d", tm_remains(gr_wait_timer), config->gr_wait); } /** * proto_graceful_restart_lock - lock graceful restart by protocol * @p: protocol instance * * This function allows a protocol to postpone the end of graceful restart * recovery until it converges. The lock is removed when the protocol calls * proto_graceful_restart_unlock() or when the protocol is stopped. * * The function have to be called during the initial phase of graceful restart * recovery and only for protocols that are part of graceful restart (i.e. their * @gr_recovery is set), which means it should be called from protocol start * hooks. */ void proto_graceful_restart_lock(struct proto *p) { ASSERT(graceful_restart_state == GRS_INIT); ASSERT(p->gr_recovery); if (p->gr_lock) return; p->gr_lock = 1; graceful_restart_locks++; } /** * proto_graceful_restart_unlock - unlock graceful restart by protocol * @p: protocol instance * * This function unlocks a lock from proto_graceful_restart_lock(). It is also * automatically called when the lock holding protocol went down. */ void proto_graceful_restart_unlock(struct proto *p) { if (!p->gr_lock) return; p->gr_lock = 0; graceful_restart_locks--; if ((graceful_restart_state == GRS_ACTIVE) && !graceful_restart_locks) tm_start(gr_wait_timer, 0); } /** * protos_dump_all - dump status of all protocols * * This function dumps status of all existing protocol instances to the * debug output. It involves printing of general status information * such as protocol states, its position on the protocol lists * and also calling of a dump() hook of the protocol to print * the internals. */ void protos_dump_all(void) { struct proto *p; struct announce_hook *a; debug("Protocols:\n"); WALK_LIST(p, active_proto_list) { debug(" protocol %s state %s/%s\n", p->name, p_states[p->proto_state], c_states[p->core_state]); for (a = p->ahooks; a; a = a->next) { debug("\tTABLE %s\n", a->table->name); if (a->in_filter) debug("\tInput filter: %s\n", filter_name(a->in_filter)); if (a->out_filter != FILTER_REJECT) debug("\tOutput filter: %s\n", filter_name(a->out_filter)); } if (p->disabled) debug("\tDISABLED\n"); else if (p->proto->dump) p->proto->dump(p); } WALK_LIST(p, inactive_proto_list) debug(" inactive %s: state %s/%s\n", p->name, p_states[p->proto_state], c_states[p->core_state]); WALK_LIST(p, initial_proto_list) debug(" initial %s\n", p->name); WALK_LIST(p, flush_proto_list) debug(" flushing %s\n", p->name); } /** * proto_build - make a single protocol available * @p: the protocol * * After the platform specific initialization code uses protos_build() * to add all the standard protocols, it should call proto_build() for * all platform specific protocols to inform the core that they exist. */ void proto_build(struct protocol *p) { add_tail(&protocol_list, &p->n); if (p->attr_class) { ASSERT(!attr_class_to_protocol[p->attr_class]); attr_class_to_protocol[p->attr_class] = p; } } /* FIXME: convert this call to some protocol hook */ extern void bfd_init_all(void); /** * protos_build - build a protocol list * * This function is called during BIRD startup to insert * all standard protocols to the global protocol list. Insertion * of platform specific protocols (such as the kernel syncer) * is in the domain of competence of the platform dependent * startup code. */ void protos_build(void) { init_list(&protocol_list); init_list(&proto_list); init_list(&active_proto_list); init_list(&inactive_proto_list); init_list(&initial_proto_list); init_list(&flush_proto_list); proto_build(&proto_device); #ifdef CONFIG_RADV proto_build(&proto_radv); #endif #ifdef CONFIG_RIP proto_build(&proto_rip); #endif #ifdef CONFIG_STATIC proto_build(&proto_static); #endif #ifdef CONFIG_OSPF proto_build(&proto_ospf); #endif #ifdef CONFIG_PIPE proto_build(&proto_pipe); #endif #ifdef CONFIG_BGP proto_build(&proto_bgp); #endif #ifdef CONFIG_BFD proto_build(&proto_bfd); bfd_init_all(); #endif #ifdef CONFIG_BABEL proto_build(&proto_babel); #endif proto_pool = rp_new(&root_pool, "Protocols"); proto_flush_event = ev_new(proto_pool); proto_flush_event->hook = proto_flush_loop; proto_shutdown_timer = tm_new(proto_pool); proto_shutdown_timer->hook = proto_shutdown_loop; } static void proto_feed_more(void *P) { struct proto *p = P; if (p->export_state != ES_FEEDING) return; DBG("Feeding protocol %s continued\n", p->name); if (rt_feed_baby(p)) { DBG("Feeding protocol %s finished\n", p->name); p->export_state = ES_READY; proto_log_state_change(p); if (p->feed_end) p->feed_end(p); } else { p->attn->hook = proto_feed_more; ev_schedule(p->attn); /* Will continue later... */ } } static void proto_feed_initial(void *P) { struct proto *p = P; if (p->export_state != ES_FEEDING) return; DBG("Feeding protocol %s\n", p->name); if_feed_baby(p); proto_feed_more(P); } static void proto_schedule_feed(struct proto *p, int initial) { DBG("%s: Scheduling meal\n", p->name); p->export_state = ES_FEEDING; p->refeeding = !initial; p->attn->hook = initial ? proto_feed_initial : proto_feed_more; ev_schedule(p->attn); if (p->feed_begin) p->feed_begin(p, initial); } /* * Flushing loop is responsible for flushing routes and protocols * after they went down. It runs in proto_flush_event. At the start of * one round, protocols waiting to flush are marked in * proto_schedule_flush_loop(). At the end of the round (when routing * table flush is complete), marked protocols are flushed and a next * round may start. */ static int flush_loop_state; /* 1 -> running */ static void proto_schedule_flush_loop(void) { struct proto *p; struct announce_hook *h; if (flush_loop_state) return; flush_loop_state = 1; WALK_LIST(p, flush_proto_list) { p->flushing = 1; for (h=p->ahooks; h; h=h->next) rt_mark_for_prune(h->table); } ev_schedule(proto_flush_event); } static void proto_flush_loop(void *unused UNUSED) { struct proto *p; if (! rt_prune_loop()) { /* Rtable pruning is not finished */ ev_schedule(proto_flush_event); return; } rt_prune_sources(); again: WALK_LIST(p, flush_proto_list) if (p->flushing) { /* This will flush interfaces in the same manner like rt_prune_all() flushes routes */ if (p->proto == &proto_unix_iface) if_flush_ifaces(p); DBG("Flushing protocol %s\n", p->name); p->flushing = 0; p->core_state = FS_HUNGRY; proto_relink(p); proto_log_state_change(p); if (p->proto_state == PS_DOWN) proto_fell_down(p); goto again; } /* This round finished, perhaps there will be another one */ flush_loop_state = 0; if (!EMPTY_LIST(flush_proto_list)) proto_schedule_flush_loop(); } /* Temporary hack to propagate restart to BGP */ int proto_restart; static void proto_shutdown_loop(struct timer *t UNUSED) { struct proto *p, *p_next; WALK_LIST_DELSAFE(p, p_next, active_proto_list) if (p->down_sched) { proto_restart = (p->down_sched == PDS_RESTART); p->disabled = 1; proto_rethink_goal(p); if (proto_restart) { p->disabled = 0; proto_rethink_goal(p); } } } static inline void proto_schedule_down(struct proto *p, byte restart, byte code) { /* Does not work for other states (even PS_START) */ ASSERT(p->proto_state == PS_UP); /* Scheduled restart may change to shutdown, but not otherwise */ if (p->down_sched == PDS_DISABLE) return; p->down_sched = restart ? PDS_RESTART : PDS_DISABLE; p->down_code = code; tm_start_max(proto_shutdown_timer, restart ? 2 : 0); } /** * proto_request_feeding - request feeding routes to the protocol * @p: given protocol * * Sometimes it is needed to send again all routes to the * protocol. This is called feeding and can be requested by this * function. This would cause protocol export state transition * to ES_FEEDING (during feeding) and when completed, it will * switch back to ES_READY. This function can be called even * when feeding is already running, in that case it is restarted. */ void proto_request_feeding(struct proto *p) { ASSERT(p->proto_state == PS_UP); /* Do nothing if we are still waiting for feeding */ if (p->export_state == ES_DOWN) return; /* If we are already feeding, we want to restart it */ if (p->export_state == ES_FEEDING) { /* Unless feeding is in initial state */ if (p->attn->hook == proto_feed_initial) return; rt_feed_baby_abort(p); } /* FIXME: This should be changed for better support of multitable protos */ struct announce_hook *ah; for (ah = p->ahooks; ah; ah = ah->next) proto_reset_limit(ah->out_limit); /* Hack: reset exp_routes during refeed, and do not decrease it later */ p->stats.exp_routes = 0; proto_schedule_feed(p, 0); proto_log_state_change(p); } static const char * proto_limit_name(struct proto_limit *l) { const char *actions[] = { [PLA_WARN] = "warn", [PLA_BLOCK] = "block", [PLA_RESTART] = "restart", [PLA_DISABLE] = "disable", }; return actions[l->action]; } /** * proto_notify_limit: notify about limit hit and take appropriate action * @ah: announce hook * @l: limit being hit * @dir: limit direction (PLD_*) * @rt_count: the number of routes * * The function is called by the route processing core when limit @l * is breached. It activates the limit and tooks appropriate action * according to @l->action. */ void proto_notify_limit(struct announce_hook *ah, struct proto_limit *l, int dir, u32 rt_count) { const char *dir_name[PLD_MAX] = { "receive", "import" , "export" }; const byte dir_down[PLD_MAX] = { PDC_RX_LIMIT_HIT, PDC_IN_LIMIT_HIT, PDC_OUT_LIMIT_HIT }; struct proto *p = ah->proto; if (l->state == PLS_BLOCKED) return; /* For warning action, we want the log message every time we hit the limit */ if (!l->state || ((l->action == PLA_WARN) && (rt_count == l->limit))) log(L_WARN "Protocol %s hits route %s limit (%d), action: %s", p->name, dir_name[dir], l->limit, proto_limit_name(l)); switch (l->action) { case PLA_WARN: l->state = PLS_ACTIVE; break; case PLA_BLOCK: l->state = PLS_BLOCKED; break; case PLA_RESTART: case PLA_DISABLE: l->state = PLS_BLOCKED; if (p->proto_state == PS_UP) proto_schedule_down(p, l->action == PLA_RESTART, dir_down[dir]); break; } } void proto_verify_limits(struct announce_hook *ah) { struct proto_limit *l; struct proto_stats *stats = ah->stats; u32 all_routes = stats->imp_routes + stats->filt_routes; l = ah->rx_limit; if (l && (all_routes > l->limit)) proto_notify_limit(ah, l, PLD_RX, all_routes); l = ah->in_limit; if (l && (stats->imp_routes > l->limit)) proto_notify_limit(ah, l, PLD_IN, stats->imp_routes); l = ah->out_limit; if (l && (stats->exp_routes > l->limit)) proto_notify_limit(ah, l, PLD_OUT, stats->exp_routes); } static void proto_want_core_up(struct proto *p) { ASSERT(p->core_state == FS_HUNGRY); if (!p->proto->multitable) { p->main_source = rt_get_source(p, 0); rt_lock_source(p->main_source); /* Connect protocol to routing table */ p->main_ahook = proto_add_announce_hook(p, p->table, &p->stats); p->main_ahook->in_filter = p->cf->in_filter; p->main_ahook->out_filter = p->cf->out_filter; p->main_ahook->rx_limit = p->cf->rx_limit; p->main_ahook->in_limit = p->cf->in_limit; p->main_ahook->out_limit = p->cf->out_limit; p->main_ahook->in_keep_filtered = p->cf->in_keep_filtered; proto_reset_limit(p->main_ahook->rx_limit); proto_reset_limit(p->main_ahook->in_limit); proto_reset_limit(p->main_ahook->out_limit); } p->core_state = FS_HAPPY; proto_relink(p); } static void proto_want_export_up(struct proto *p) { ASSERT(p->core_state == FS_HAPPY); ASSERT(p->export_state == ES_DOWN); proto_link_ahooks(p); proto_schedule_feed(p, 1); /* Sets ES_FEEDING */ } static void proto_want_export_down(struct proto *p) { ASSERT(p->export_state != ES_DOWN); /* Need to abort feeding */ if (p->export_state == ES_FEEDING) rt_feed_baby_abort(p); p->export_state = ES_DOWN; p->stats.exp_routes = 0; proto_unlink_ahooks(p); } static void proto_want_core_down(struct proto *p) { ASSERT(p->core_state == FS_HAPPY); ASSERT(p->export_state == ES_DOWN); p->core_state = FS_FLUSHING; proto_relink(p); proto_schedule_flush_loop(); if (!p->proto->multitable) { rt_unlock_source(p->main_source); p->main_source = NULL; } } static void proto_falling_down(struct proto *p) { p->gr_recovery = 0; p->gr_wait = 0; if (p->gr_lock) proto_graceful_restart_unlock(p); } static void proto_fell_down(struct proto *p) { DBG("Protocol %s down\n", p->name); u32 all_routes = p->stats.imp_routes + p->stats.filt_routes; if (all_routes != 0) log(L_ERR "Protocol %s is down but still has %d routes", p->name, all_routes); bzero(&p->stats, sizeof(struct proto_stats)); proto_free_ahooks(p); if (! p->proto->multitable) rt_unlock_table(p->table); if (p->proto->cleanup) p->proto->cleanup(p); proto_rethink_goal(p); } /** * proto_notify_state - notify core about protocol state change * @p: protocol the state of which has changed * @ps: the new status * * Whenever a state of a protocol changes due to some event internal * to the protocol (i.e., not inside a start() or shutdown() hook), * it should immediately notify the core about the change by calling * proto_notify_state() which will write the new state to the &proto * structure and take all the actions necessary to adapt to the new * state. State change to PS_DOWN immediately frees resources of protocol * and might execute start callback of protocol; therefore, * it should be used at tail positions of protocol callbacks. */ void proto_notify_state(struct proto *p, unsigned ps) { unsigned ops = p->proto_state; unsigned cs = p->core_state; unsigned es = p->export_state; DBG("%s reporting state transition %s/%s -> */%s\n", p->name, c_states[cs], p_states[ops], p_states[ps]); if (ops == ps) return; p->proto_state = ps; p->last_state_change = now; switch (ps) { case PS_START: ASSERT(ops == PS_DOWN || ops == PS_UP); ASSERT(cs == FS_HUNGRY || cs == FS_HAPPY); if (es != ES_DOWN) proto_want_export_down(p); break; case PS_UP: ASSERT(ops == PS_DOWN || ops == PS_START); ASSERT(cs == FS_HUNGRY || cs == FS_HAPPY); ASSERT(es == ES_DOWN); if (cs == FS_HUNGRY) proto_want_core_up(p); if (!p->gr_wait) proto_want_export_up(p); break; case PS_STOP: ASSERT(ops == PS_START || ops == PS_UP); p->down_sched = 0; if (es != ES_DOWN) proto_want_export_down(p); if (cs == FS_HAPPY) proto_want_core_down(p); proto_falling_down(p); break; case PS_DOWN: p->down_code = 0; p->down_sched = 0; if (es != ES_DOWN) proto_want_export_down(p); if (cs == FS_HAPPY) proto_want_core_down(p); if (ops != PS_STOP) proto_falling_down(p); neigh_prune(); // FIXME convert neighbors to resource? rfree(p->pool); p->pool = NULL; if (cs == FS_HUNGRY) /* Shutdown finished */ { proto_log_state_change(p); proto_fell_down(p); return; /* The protocol might have ceased to exist */ } break; default: bug("%s: Invalid state %d", p->name, ps); } proto_log_state_change(p); } /* * CLI Commands */ static char * proto_state_name(struct proto *p) { #define P(x,y) ((x << 4) | y) switch (P(p->proto_state, p->core_state)) { case P(PS_DOWN, FS_HUNGRY): return "down"; case P(PS_START, FS_HUNGRY): case P(PS_START, FS_HAPPY): return "start"; case P(PS_UP, FS_HAPPY): switch (p->export_state) { case ES_DOWN: return "wait"; case ES_FEEDING: return "feed"; case ES_READY: return "up"; default: return "???"; } case P(PS_STOP, FS_HUNGRY): case P(PS_STOP, FS_FLUSHING): return "stop"; case P(PS_DOWN, FS_FLUSHING): return "flush"; default: return "???"; } #undef P } static void proto_show_stats(struct proto_stats *s, int in_keep_filtered) { if (in_keep_filtered) cli_msg(-1006, " Routes: %u imported, %u filtered, %u exported, %u preferred", s->imp_routes, s->filt_routes, s->exp_routes, s->pref_routes); else cli_msg(-1006, " Routes: %u imported, %u exported, %u preferred", s->imp_routes, s->exp_routes, s->pref_routes); cli_msg(-1006, " Route change stats: received rejected filtered ignored accepted"); cli_msg(-1006, " Import updates: %10u %10u %10u %10u %10u", s->imp_updates_received, s->imp_updates_invalid, s->imp_updates_filtered, s->imp_updates_ignored, s->imp_updates_accepted); cli_msg(-1006, " Import withdraws: %10u %10u --- %10u %10u", s->imp_withdraws_received, s->imp_withdraws_invalid, s->imp_withdraws_ignored, s->imp_withdraws_accepted); cli_msg(-1006, " Export updates: %10u %10u %10u --- %10u", s->exp_updates_received, s->exp_updates_rejected, s->exp_updates_filtered, s->exp_updates_accepted); cli_msg(-1006, " Export withdraws: %10u --- --- --- %10u", s->exp_withdraws_received, s->exp_withdraws_accepted); } void proto_show_limit(struct proto_limit *l, const char *dsc) { if (!l) return; cli_msg(-1006, " %-16s%d%s", dsc, l->limit, l->state ? " [HIT]" : ""); cli_msg(-1006, " Action: %s", proto_limit_name(l)); } void proto_show_basic_info(struct proto *p) { // cli_msg(-1006, " Table: %s", p->table->name); cli_msg(-1006, " Preference: %d", p->preference); cli_msg(-1006, " Input filter: %s", filter_name(p->cf->in_filter)); cli_msg(-1006, " Output filter: %s", filter_name(p->cf->out_filter)); if (graceful_restart_state == GRS_ACTIVE) cli_msg(-1006, " GR recovery: %s%s", p->gr_lock ? " pending" : "", p->gr_wait ? " waiting" : ""); proto_show_limit(p->cf->rx_limit, "Receive limit:"); proto_show_limit(p->cf->in_limit, "Import limit:"); proto_show_limit(p->cf->out_limit, "Export limit:"); if (p->proto_state != PS_DOWN) proto_show_stats(&p->stats, p->cf->in_keep_filtered); } void proto_cmd_show(struct proto *p, uint verbose, int cnt) { byte buf[256], tbuf[TM_DATETIME_BUFFER_SIZE]; /* First protocol - show header */ if (!cnt) cli_msg(-2002, "name proto table state since info"); buf[0] = 0; if (p->proto->get_status) p->proto->get_status(p, buf); tm_format_datetime(tbuf, &config->tf_proto, p->last_state_change); cli_msg(-1002, "%-8s %-8s %-8s %-5s %-10s %s", p->name, p->proto->name, p->table->name, proto_state_name(p), tbuf, buf); if (verbose) { if (p->cf->dsc) cli_msg(-1006, " Description: %s", p->cf->dsc); if (p->cf->router_id) cli_msg(-1006, " Router ID: %R", p->cf->router_id); if (p->proto->show_proto_info) p->proto->show_proto_info(p); else proto_show_basic_info(p); cli_msg(-1006, ""); } } void proto_cmd_disable(struct proto *p, uint arg UNUSED, int cnt UNUSED) { if (p->disabled) { cli_msg(-8, "%s: already disabled", p->name); return; } log(L_INFO "Disabling protocol %s", p->name); p->disabled = 1; p->down_code = PDC_CMD_DISABLE; proto_rethink_goal(p); cli_msg(-9, "%s: disabled", p->name); } void proto_cmd_enable(struct proto *p, uint arg UNUSED, int cnt UNUSED) { if (!p->disabled) { cli_msg(-10, "%s: already enabled", p->name); return; } log(L_INFO "Enabling protocol %s", p->name); p->disabled = 0; proto_rethink_goal(p); cli_msg(-11, "%s: enabled", p->name); } void proto_cmd_restart(struct proto *p, uint arg UNUSED, int cnt UNUSED) { if (p->disabled) { cli_msg(-8, "%s: already disabled", p->name); return; } log(L_INFO "Restarting protocol %s", p->name); p->disabled = 1; p->down_code = PDC_CMD_RESTART; proto_rethink_goal(p); p->disabled = 0; proto_rethink_goal(p); cli_msg(-12, "%s: restarted", p->name); } void proto_cmd_reload(struct proto *p, uint dir, int cnt UNUSED) { if (p->disabled) { cli_msg(-8, "%s: already disabled", p->name); return; } /* If the protocol in not UP, it has no routes */ if (p->proto_state != PS_UP) return; log(L_INFO "Reloading protocol %s", p->name); /* re-importing routes */ if (dir != CMD_RELOAD_OUT) { if (! (p->reload_routes && p->reload_routes(p))) { cli_msg(-8006, "%s: reload failed", p->name); return; } /* * Should be done before reload_routes() hook? * Perhaps, but these hooks work asynchronously. */ if (!p->proto->multitable) { proto_reset_limit(p->main_ahook->rx_limit); proto_reset_limit(p->main_ahook->in_limit); } } /* re-exporting routes */ if (dir != CMD_RELOAD_IN) proto_request_feeding(p); cli_msg(-15, "%s: reloading", p->name); } void proto_cmd_debug(struct proto *p, uint mask, int cnt UNUSED) { p->debug = mask; } void proto_cmd_mrtdump(struct proto *p, uint mask, int cnt UNUSED) { p->mrtdump = mask; } static void proto_apply_cmd_symbol(struct symbol *s, void (* cmd)(struct proto *, uint, int), uint arg) { if (s->class != SYM_PROTO) { cli_msg(9002, "%s is not a protocol", s->name); return; } cmd(((struct proto_config *)s->def)->proto, arg, 0); cli_msg(0, ""); } static void proto_apply_cmd_patt(char *patt, void (* cmd)(struct proto *, uint, int), uint arg) { int cnt = 0; node *nn; WALK_LIST(nn, proto_list) { struct proto *p = SKIP_BACK(struct proto, glob_node, nn); if (!patt || patmatch(patt, p->name)) cmd(p, arg, cnt++); } if (!cnt) cli_msg(8003, "No protocols match"); else cli_msg(0, ""); } void proto_apply_cmd(struct proto_spec ps, void (* cmd)(struct proto *, uint, int), int restricted, uint arg) { if (restricted && cli_access_restricted()) return; if (ps.patt) proto_apply_cmd_patt(ps.ptr, cmd, arg); else proto_apply_cmd_symbol(ps.ptr, cmd, arg); } struct proto * proto_get_named(struct symbol *sym, struct protocol *pr) { struct proto *p, *q; if (sym) { if (sym->class != SYM_PROTO) cf_error("%s: Not a protocol", sym->name); p = ((struct proto_config *)sym->def)->proto; if (!p || p->proto != pr) cf_error("%s: Not a %s protocol", sym->name, pr->name); } else { p = NULL; WALK_LIST(q, active_proto_list) if (q->proto == pr) { if (p) cf_error("There are multiple %s protocols running", pr->name); p = q; } if (!p) cf_error("There is no %s protocol running", pr->name); } return p; } bird-1.6.3/nest/cli.c0000644000103200001440000002417013027054563013322 0ustar feelausers/* * BIRD Internet Routing Daemon -- Command-Line Interface * * (c) 1999--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Command line interface * * This module takes care of the BIRD's command-line interface (CLI). * The CLI exists to provide a way to control BIRD remotely and to inspect * its status. It uses a very simple textual protocol over a stream * connection provided by the platform dependent code (on UNIX systems, * it's a UNIX domain socket). * * Each session of the CLI consists of a sequence of request and replies, * slightly resembling the FTP and SMTP protocols. * Requests are commands encoded as a single line of text, replies are * sequences of lines starting with a four-digit code followed by either * a space (if it's the last line of the reply) or a minus sign (when the * reply is going to continue with the next line), the rest of the line * contains a textual message semantics of which depends on the numeric * code. If a reply line has the same code as the previous one and it's * a continuation line, the whole prefix can be replaced by a single * white space character. * * Reply codes starting with 0 stand for `action successfully completed' messages, * 1 means `table entry', 8 `runtime error' and 9 `syntax error'. * * Each CLI session is internally represented by a &cli structure and a * resource pool containing all resources associated with the connection, * so that it can be easily freed whenever the connection gets closed, not depending * on the current state of command processing. * * The CLI commands are declared as a part of the configuration grammar * by using the |CF_CLI| macro. When a command is received, it is processed * by the same lexical analyzer and parser as used for the configuration, but * it's switched to a special mode by prepending a fake token to the text, * so that it uses only the CLI command rules. Then the parser invokes * an execution routine corresponding to the command, which either constructs * the whole reply and returns it back or (in case it expects the reply will be long) * it prints a partial reply and asks the CLI module (using the @cont hook) * to call it again when the output is transferred to the user. * * The @this_cli variable points to a &cli structure of the session being * currently parsed, but it's of course available only in command handlers * not entered using the @cont hook. * * TX buffer management works as follows: At cli.tx_buf there is a * list of TX buffers (struct cli_out), cli.tx_write is the buffer * currently used by the producer (cli_printf(), cli_alloc_out()) and * cli.tx_pos is the buffer currently used by the consumer * (cli_write(), in system dependent code). The producer uses * cli_out.wpos ptr as the current write position and the consumer * uses cli_out.outpos ptr as the current read position. When the * producer produces something, it calls cli_write_trigger(). If there * is not enough space in the current buffer, the producer allocates * the new one. When the consumer processes everything in the buffer * queue, it calls cli_written(), tha frees all buffers (except the * first one) and schedules cli.event . * */ #include "nest/bird.h" #include "nest/cli.h" #include "conf/conf.h" #include "lib/string.h" pool *cli_pool; static byte * cli_alloc_out(cli *c, int size) { struct cli_out *o; if (!(o = c->tx_write) || o->wpos + size > o->end) { if (!o && c->tx_buf) o = c->tx_buf; else { o = mb_alloc(c->pool, sizeof(struct cli_out) + CLI_TX_BUF_SIZE); if (c->tx_write) c->tx_write->next = o; else c->tx_buf = o; o->wpos = o->outpos = o->buf; o->end = o->buf + CLI_TX_BUF_SIZE; } c->tx_write = o; if (!c->tx_pos) c->tx_pos = o; o->next = NULL; } o->wpos += size; return o->wpos - size; } /** * cli_printf - send reply to a CLI connection * @c: CLI connection * @code: numeric code of the reply, negative for continuation lines * @msg: a printf()-like formatting string. * * This function send a single line of reply to a given CLI connection. * In works in all aspects like bsprintf() except that it automatically * prepends the reply line prefix. * * Please note that if the connection can be already busy sending some * data in which case cli_printf() stores the output to a temporary buffer, * so please avoid sending a large batch of replies without waiting * for the buffers to be flushed. * * If you want to write to the current CLI output, you can use the cli_msg() * macro instead. */ void cli_printf(cli *c, int code, char *msg, ...) { va_list args; byte buf[CLI_LINE_SIZE]; int cd = code; int errcode; int size, cnt; if (cd < 0) { cd = -cd; if (cd == c->last_reply) size = bsprintf(buf, " "); else size = bsprintf(buf, "%04d-", cd); errcode = -8000; } else if (cd == CLI_ASYNC_CODE) { size = 1; buf[0] = '+'; errcode = cd; } else { size = bsprintf(buf, "%04d ", cd); errcode = 8000; } c->last_reply = cd; va_start(args, msg); cnt = bvsnprintf(buf+size, sizeof(buf)-size-1, msg, args); va_end(args); if (cnt < 0) { cli_printf(c, errcode, ""); return; } size += cnt; buf[size++] = '\n'; memcpy(cli_alloc_out(c, size), buf, size); } static void cli_copy_message(cli *c) { byte *p, *q; uint cnt = 2; if (c->ring_overflow) { byte buf[64]; int n = bsprintf(buf, "<%d messages lost>\n", c->ring_overflow); c->ring_overflow = 0; memcpy(cli_alloc_out(c, n), buf, n); } p = c->ring_read; while (*p) { cnt++; p++; if (p == c->ring_end) p = c->ring_buf; ASSERT(p != c->ring_write); } c->async_msg_size += cnt; q = cli_alloc_out(c, cnt); *q++ = '+'; p = c->ring_read; do { *q = *p++; if (p == c->ring_end) p = c->ring_buf; } while (*q++); c->ring_read = p; q[-1] = '\n'; } static void cli_hello(cli *c) { cli_printf(c, 1, "BIRD " BIRD_VERSION " ready."); c->cont = NULL; } static void cli_free_out(cli *c) { struct cli_out *o, *p; if (o = c->tx_buf) { o->wpos = o->outpos = o->buf; while (p = o->next) { o->next = p->next; mb_free(p); } } c->tx_write = c->tx_pos = NULL; c->async_msg_size = 0; } void cli_written(cli *c) { cli_free_out(c); ev_schedule(c->event); } static byte *cli_rh_pos; static uint cli_rh_len; static int cli_rh_trick_flag; struct cli *this_cli; static int cli_cmd_read_hook(byte *buf, uint max, UNUSED int fd) { if (!cli_rh_trick_flag) { cli_rh_trick_flag = 1; buf[0] = '!'; return 1; } if (max > cli_rh_len) max = cli_rh_len; memcpy(buf, cli_rh_pos, max); cli_rh_pos += max; cli_rh_len -= max; return max; } static void cli_command(struct cli *c) { struct config f; int res; if (config->cli_debug > 1) log(L_TRACE "CLI: %s", c->rx_buf); bzero(&f, sizeof(f)); f.mem = c->parser_pool; cf_read_hook = cli_cmd_read_hook; cli_rh_pos = c->rx_buf; cli_rh_len = strlen(c->rx_buf); cli_rh_trick_flag = 0; this_cli = c; lp_flush(c->parser_pool); res = cli_parse(&f); if (!res) cli_printf(c, 9001, f.err_msg); } static void cli_event(void *data) { cli *c = data; int err; while (c->ring_read != c->ring_write && c->async_msg_size < CLI_MAX_ASYNC_QUEUE) cli_copy_message(c); if (c->tx_pos) ; else if (c->cont) c->cont(c); else { err = cli_get_command(c); if (!err) return; if (err < 0) cli_printf(c, 9000, "Command too long"); else cli_command(c); } cli_write_trigger(c); } cli * cli_new(void *priv) { pool *p = rp_new(cli_pool, "CLI"); cli *c = mb_alloc(p, sizeof(cli)); bzero(c, sizeof(cli)); c->pool = p; c->priv = priv; c->event = ev_new(p); c->event->hook = cli_event; c->event->data = c; c->cont = cli_hello; c->parser_pool = lp_new(c->pool, 4096); c->rx_buf = mb_alloc(c->pool, CLI_RX_BUF_SIZE); ev_schedule(c->event); return c; } void cli_kick(cli *c) { if (!c->cont && !c->tx_pos) ev_schedule(c->event); } static list cli_log_hooks; static int cli_log_inited; void cli_set_log_echo(cli *c, uint mask, uint size) { if (c->ring_buf) { mb_free(c->ring_buf); c->ring_buf = c->ring_end = c->ring_read = c->ring_write = NULL; rem_node(&c->n); } c->log_mask = mask; if (mask && size) { c->ring_buf = mb_alloc(c->pool, size); c->ring_end = c->ring_buf + size; c->ring_read = c->ring_write = c->ring_buf; add_tail(&cli_log_hooks, &c->n); c->log_threshold = size / 8; } c->ring_overflow = 0; } void cli_echo(uint class, byte *msg) { unsigned len, free, i, l; cli *c; byte *m; if (!cli_log_inited || EMPTY_LIST(cli_log_hooks)) return; len = strlen(msg) + 1; WALK_LIST(c, cli_log_hooks) { if (!(c->log_mask & (1 << class))) continue; if (c->ring_read <= c->ring_write) free = (c->ring_end - c->ring_buf) - (c->ring_write - c->ring_read + 1); else free = c->ring_read - c->ring_write - 1; if ((len > free) || (free < c->log_threshold && class < (unsigned) L_INFO[0])) { c->ring_overflow++; continue; } if (c->ring_read == c->ring_write) ev_schedule(c->event); m = msg; l = len; while (l) { if (c->ring_read <= c->ring_write) i = c->ring_end - c->ring_write; else i = c->ring_read - c->ring_write; if (i > l) i = l; memcpy(c->ring_write, m, i); m += i; l -= i; c->ring_write += i; if (c->ring_write == c->ring_end) c->ring_write = c->ring_buf; } } } /* Hack for scheduled undo notification */ extern cli *cmd_reconfig_stored_cli; void cli_free(cli *c) { cli_set_log_echo(c, 0, 0); if (c->cleanup) c->cleanup(c); if (c == cmd_reconfig_stored_cli) cmd_reconfig_stored_cli = NULL; rfree(c->pool); } /** * cli_init - initialize the CLI module * * This function is called during BIRD startup to initialize * the internal data structures of the CLI module. */ void cli_init(void) { cli_pool = rp_new(&root_pool, "CLI"); init_list(&cli_log_hooks); cli_log_inited = 1; } bird-1.6.3/nest/cli.h0000644000103200001440000000425413027054563013330 0ustar feelausers/* * BIRD Internet Routing Daemon -- Command-Line Interface * * (c) 1999--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_CLI_H_ #define _BIRD_CLI_H_ #include "lib/resource.h" #include "lib/event.h" #define CLI_RX_BUF_SIZE 4096 #define CLI_TX_BUF_SIZE 4096 #define CLI_MAX_ASYNC_QUEUE 4096 #define CLI_MSG_SIZE 500 #define CLI_LINE_SIZE 512 struct cli_out { struct cli_out *next; byte *wpos, *outpos, *end; byte buf[0]; }; typedef struct cli { node n; /* Node in list of all log hooks */ pool *pool; void *priv; /* Private to sysdep layer */ byte *rx_buf, *rx_pos, *rx_aux; /* sysdep */ struct cli_out *tx_buf, *tx_pos, *tx_write; event *event; void (*cont)(struct cli *c); void (*cleanup)(struct cli *c); void *rover; /* Private to continuation routine */ int last_reply; int restricted; /* CLI is restricted to read-only commands */ struct linpool *parser_pool; /* Pool used during parsing */ byte *ring_buf; /* Ring buffer for asynchronous messages */ byte *ring_end, *ring_read, *ring_write; /* Pointers to the ring buffer */ uint ring_overflow; /* Counter of ring overflows */ uint log_mask; /* Mask of allowed message levels */ uint log_threshold; /* When free < log_threshold, store only important messages */ uint async_msg_size; /* Total size of async messages queued in tx_buf */ } cli; extern pool *cli_pool; extern struct cli *this_cli; /* Used during parsing */ #define CLI_ASYNC_CODE 10000 /* Functions to be called by command handlers */ void cli_printf(cli *, int, char *, ...); #define cli_msg(x...) cli_printf(this_cli, x) void cli_set_log_echo(cli *, uint mask, uint size); /* Functions provided to sysdep layer */ cli *cli_new(void *); void cli_init(void); void cli_free(cli *); void cli_kick(cli *); void cli_written(cli *); void cli_echo(uint class, byte *msg); static inline int cli_access_restricted(void) { if (this_cli && this_cli->restricted) return (cli_printf(this_cli, 8007, "Access denied"), 1); else return 0; } /* Functions provided by sysdep layer */ void cli_write_trigger(cli *); int cli_get_command(cli *); #endif bird-1.6.3/nest/password.h0000644000103200001440000000171113027054563014416 0ustar feelausers/* * BIRD -- Password handling * * (c) 1999 Pavel Machek * (c) 2004 Ondrej Filip * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef PASSWORD_H #define PASSWORD_H #include "lib/timer.h" struct password_item { node n; char *password; /* Key data, null terminated */ uint length; /* Key length, without null */ uint id; /* Key ID */ uint alg; /* MAC algorithm */ bird_clock_t accfrom, accto, genfrom, gento; }; extern struct password_item *last_password_item; struct password_item *password_find(list *l, int first_fit); struct password_item *password_find_by_id(list *l, uint id); struct password_item *password_find_by_value(list *l, char *pass, uint size); static inline int password_verify(struct password_item *p1, char *p2, uint size) { char buf[size]; strncpy(buf, p1->password, size); return !memcmp(buf, p2, size); } uint max_mac_length(list *l); #endif bird-1.6.3/nest/Makefile0000644000103200001440000000026313027054563014044 0ustar feelauserssource=rt-table.c rt-fib.c rt-attr.c rt-roa.c proto.c iface.c rt-dev.c password.c cli.c locks.c cmds.c neighbor.c \ a-path.c a-set.c root-rel=../ dir-name=nest include ../Rules bird-1.6.3/nest/locks.c0000644000103200001440000001161513027054563013666 0ustar feelausers/* * BIRD Object Locks * * (c) 1999 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Object locks * * The lock module provides a simple mechanism for avoiding conflicts between * various protocols which would like to use a single physical resource (for * example a network port). It would be easy to say that such collisions can * occur only when the user specifies an invalid configuration and therefore * he deserves to get what he has asked for, but unfortunately they can also * arise legitimately when the daemon is reconfigured and there exists (although * for a short time period only) an old protocol instance being shut down and a new one * willing to start up on the same interface. * * The solution is very simple: when any protocol wishes to use a network port * or some other non-shareable resource, it asks the core to lock it and it doesn't * use the resource until it's notified that it has acquired the lock. * * Object locks are represented by &object_lock structures which are in turn a * kind of resource. Lockable resources are uniquely determined by resource type * (%OBJLOCK_UDP for a UDP port etc.), IP address (usually a broadcast or * multicast address the port is bound to), port number, interface and optional * instance ID. */ #undef LOCAL_DEBUG #include "nest/bird.h" #include "lib/resource.h" #include "nest/locks.h" #include "nest/iface.h" static list olock_list; static event *olock_event; static inline int olock_same(struct object_lock *x, struct object_lock *y) { return x->type == y->type && x->iface == y->iface && x->port == y->port && x->inst == y->inst && ipa_equal(x->addr, y->addr); } static void olock_free(resource *r) { struct object_lock *q, *l = (struct object_lock *) r; node *n; DBG("olock: Freeing %p\n", l); switch (l->state) { case OLOCK_STATE_FREE: break; case OLOCK_STATE_LOCKED: case OLOCK_STATE_EVENT: rem_node(&l->n); n = HEAD(l->waiters); if (n->next) { DBG("olock: -> %p becomes locked\n", n); q = SKIP_BACK(struct object_lock, n, n); rem_node(n); add_tail_list(&q->waiters, &l->waiters); q->state = OLOCK_STATE_EVENT; add_head(&olock_list, n); ev_schedule(olock_event); } break; case OLOCK_STATE_WAITING: rem_node(&l->n); break; default: ASSERT(0); } } static void olock_dump(resource *r) { struct object_lock *l = (struct object_lock *) r; static char *olock_states[] = { "free", "locked", "waiting", "event" }; debug("(%d:%s:%I:%d:%d) [%s]\n", l->type, (l->iface ? l->iface->name : "?"), l->addr, l->port, l->inst, olock_states[l->state]); if (!EMPTY_LIST(l->waiters)) debug(" [wanted]\n"); } static struct resclass olock_class = { "ObjLock", sizeof(struct object_lock), olock_free, olock_dump, NULL, NULL, }; /** * olock_new - create an object lock * @p: resource pool to create the lock in. * * The olock_new() function creates a new resource of type &object_lock * and returns a pointer to it. After filling in the structure, the caller * should call olock_acquire() to do the real locking. */ struct object_lock * olock_new(pool *p) { struct object_lock *l = ralloc(p, &olock_class); l->state = OLOCK_STATE_FREE; init_list(&l->waiters); return l; } /** * olock_acquire - acquire a lock * @l: the lock to acquire * * This function attempts to acquire exclusive access to the non-shareable * resource described by the lock @l. It returns immediately, but as soon * as the resource becomes available, it calls the hook() function set up * by the caller. * * When you want to release the resource, just rfree() the lock. */ void olock_acquire(struct object_lock *l) { node *n; struct object_lock *q; WALK_LIST(n, olock_list) { q = SKIP_BACK(struct object_lock, n, n); if (olock_same(q, l)) { l->state = OLOCK_STATE_WAITING; add_tail(&q->waiters, &l->n); DBG("olock: %p waits\n", l); return; } } DBG("olock: %p acquired immediately\n", l); l->state = OLOCK_STATE_EVENT; add_head(&olock_list, &l->n); ev_schedule(olock_event); } static void olock_run_event(void *unused UNUSED) { node *n; struct object_lock *q; DBG("olock: Processing events\n"); for(;;) { n = HEAD(olock_list); if (!n->next) break; q = SKIP_BACK(struct object_lock, n, n); if (q->state != OLOCK_STATE_EVENT) break; DBG("olock: %p locked\n", q); q->state = OLOCK_STATE_LOCKED; rem_node(&q->n); add_tail(&olock_list, &q->n); q->hook(q); } } /** * olock_init - initialize the object lock mechanism * * This function is called during BIRD startup. It initializes * all the internal data structures of the lock module. */ void olock_init(void) { DBG("olock: init\n"); init_list(&olock_list); olock_event = ev_new(&root_pool); olock_event->hook = olock_run_event; } bird-1.6.3/nest/iface.h0000644000103200001440000001246413027054563013632 0ustar feelausers/* * BIRD Internet Routing Daemon -- Network Interfaces * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_IFACE_H_ #define _BIRD_IFACE_H_ #include "lib/lists.h" extern list iface_list; struct proto; struct pool; struct ifa { /* Interface address */ node n; struct iface *iface; /* Interface this address belongs to */ ip_addr ip; /* IP address of this host */ ip_addr prefix; /* Network prefix */ unsigned pxlen; /* Prefix length */ ip_addr brd; /* Broadcast address */ ip_addr opposite; /* Opposite end of a point-to-point link */ unsigned scope; /* Interface address scope */ unsigned flags; /* Analogous to iface->flags */ }; struct iface { node n; char name[16]; unsigned flags; unsigned mtu; unsigned index; /* OS-dependent interface index */ list addrs; /* Addresses assigned to this interface */ struct ifa *addr; /* Primary address */ list neighbors; /* All neighbors on this interface */ }; #define IF_UP 1 /* IF_ADMIN_UP and IP address known */ #define IF_MULTIACCESS 2 #define IF_BROADCAST 4 #define IF_MULTICAST 8 #define IF_SHUTDOWN 0x10 /* Interface disappeared */ #define IF_LOOPBACK 0x20 #define IF_IGNORE 0x40 /* Not to be used by routing protocols (loopbacks etc.) */ #define IF_ADMIN_UP 0x80 /* Administrative up (e.g. IFF_UP in Linux) */ #define IF_LINK_UP 0x100 /* Link available (e.g. IFF_LOWER_UP in Linux) */ #define IA_PRIMARY 0x10000 /* This address is primary */ #define IA_SECONDARY 0x20000 /* This address has been reported as secondary by the kernel */ #define IA_PEER 0x40000 /* A peer/ptp address */ #define IA_HOST 0x80000 /* A host/loopback address */ #define IA_FLAGS 0xff0000 /* * There are three kinds of addresses in BIRD: * - Standard (prefix-based) addresses, these may define ifa.opposite (for /30 or /31). * - Peer/ptp addresses, without common prefix for ifa.ip and ifa.opposite. * ifa.opposite is defined and ifa.prefix/pxlen == ifa.opposite/32 (for simplicity). * - Host addresses, with ifa.prefix/pxlen == ifa.ip/32 (or /128). * May be considered a special case of standard addresses. * * Peer addresses (AFAIK) do not exist in IPv6. Linux also supports generalized peer * addresses (with pxlen < 32 and ifa.ip outside prefix), we do not support that. */ #define IF_JUST_CREATED 0x10000000 /* Send creation event as soon as possible */ #define IF_TMP_DOWN 0x20000000 /* Temporary shutdown due to interface reconfiguration */ #define IF_UPDATED 0x40000000 /* Touched in last scan */ /* Interface change events */ #define IF_CHANGE_UP 1 #define IF_CHANGE_DOWN 2 #define IF_CHANGE_MTU 4 #define IF_CHANGE_CREATE 8 /* Seen this interface for the first time */ #define IF_CHANGE_LINK 0x10 #define IF_CHANGE_TOO_MUCH 0x40000000 /* Used internally */ void if_init(void); void if_dump(struct iface *); void if_dump_all(void); void ifa_dump(struct ifa *); void if_show(void); void if_show_summary(void); struct iface *if_update(struct iface *); void if_delete(struct iface *old); struct ifa *ifa_update(struct ifa *); void ifa_delete(struct ifa *); void if_start_update(void); void if_end_partial_update(struct iface *); void if_end_update(void); void if_flush_ifaces(struct proto *p); void if_feed_baby(struct proto *); struct iface *if_find_by_index(unsigned); struct iface *if_find_by_name(char *); struct iface *if_get_by_name(char *); void ifa_recalc_all_primary_addresses(void); /* The Neighbor Cache */ typedef struct neighbor { node n; /* Node in global neighbor list */ node if_n; /* Node in per-interface neighbor list */ ip_addr addr; /* Address of the neighbor */ struct ifa *ifa; /* Ifa on related iface */ struct iface *iface; /* Interface it's connected to */ struct proto *proto; /* Protocol this belongs to */ void *data; /* Protocol-specific data */ unsigned aux; /* Protocol-specific data */ unsigned flags; int scope; /* Address scope, -1 for unreachable sticky neighbors, SCOPE_HOST when it's our own address */ } neighbor; #define NEF_STICKY 1 #define NEF_ONLINK 2 #define NEF_BIND 4 /* Used internally for neighbors bound to an iface */ neighbor *neigh_find(struct proto *, ip_addr *, unsigned flags); neighbor *neigh_find2(struct proto *p, ip_addr *a, struct iface *ifa, unsigned flags); static inline int neigh_connected_to(struct proto *p, ip_addr *a, struct iface *i) { neighbor *n = neigh_find(p, a, 0); return n && n->iface == i; } void neigh_dump(neighbor *); void neigh_dump_all(void); void neigh_prune(void); void neigh_if_up(struct iface *); void neigh_if_down(struct iface *); void neigh_if_link(struct iface *); void neigh_ifa_update(struct ifa *); void neigh_init(struct pool *); /* * Interface Pattern Lists */ struct iface_patt_node { node n; int positive; byte *pattern; ip_addr prefix; int pxlen; }; struct iface_patt { node n; list ipn_list; /* A list of struct iface_patt_node */ /* Protocol-specific data follow after this structure */ }; int iface_patt_match(struct iface_patt *ifp, struct iface *i, struct ifa *a); struct iface_patt *iface_patt_find(list *l, struct iface *i, struct ifa *a); int iface_patts_equal(list *, list *, int (*)(struct iface_patt *, struct iface_patt *)); u32 if_choose_router_id(struct iface_patt *mask, u32 old_id); #endif bird-1.6.3/nest/proto.sgml0000644000103200001440000001071613027054563014437 0ustar feelausers Routing protocols Introduction

The routing protocols are the bird's heart and a fine amount of code is dedicated to their management and for providing support functions to them. (-: Actually, this is the reason why the directory with sources of the core code is called When talking about protocols, one need to distinguish between A protocol is represented by a Each instance has its own The protocol hooks are described in the next chapter, for more information about configuration of protocols, please refer to the configuration chapter and also to the description of the Protocol states

As startup and shutdown of each protocol are complex processes which can be affected by lots of external events (user's actions, reconfigurations, behavior of neighboring routers etc.), we have decided to supervise them by a pair of simple state machines -- the protocol state machine and a core state machine.

The

Unless the protocol is in the At any time, the core code can ask the protocol to shut itself down by calling its stop() hook.

The Functions of the protocol module

The protocol module provides the following functions: bird-1.6.3/nest/protocol.h0000644000103200001440000004340313027054563014421 0ustar feelausers/* * BIRD Internet Routing Daemon -- Protocols * * (c) 1998--2000 Martin Mares * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_PROTOCOL_H_ #define _BIRD_PROTOCOL_H_ #include "lib/lists.h" #include "lib/resource.h" #include "lib/timer.h" #include "conf/conf.h" struct iface; struct ifa; struct rtable; struct rte; struct neighbor; struct rta; struct network; struct proto_config; struct config; struct proto; struct event; struct ea_list; struct eattr; struct symbol; /* * Routing Protocol */ struct protocol { node n; char *name; char *template; /* Template for automatic generation of names */ int name_counter; /* Counter for automatic name generation */ int attr_class; /* Attribute class known to this protocol */ int multitable; /* Protocol handles all announce hooks itself */ uint preference; /* Default protocol preference */ uint config_size; /* Size of protocol config */ void (*preconfig)(struct protocol *, struct config *); /* Just before configuring */ void (*postconfig)(struct proto_config *); /* After configuring each instance */ struct proto * (*init)(struct proto_config *); /* Create new instance */ int (*reconfigure)(struct proto *, struct proto_config *); /* Try to reconfigure instance, returns success */ void (*dump)(struct proto *); /* Debugging dump */ void (*dump_attrs)(struct rte *); /* Dump protocol-dependent attributes */ int (*start)(struct proto *); /* Start the instance */ int (*shutdown)(struct proto *); /* Stop the instance */ void (*cleanup)(struct proto *); /* Called after shutdown when protocol became hungry/down */ void (*get_status)(struct proto *, byte *buf); /* Get instance status (for `show protocols' command) */ void (*get_route_info)(struct rte *, byte *buf, struct ea_list *attrs); /* Get route information (for `show route' command) */ int (*get_attr)(struct eattr *, byte *buf, int buflen); /* ASCIIfy dynamic attribute (returns GA_*) */ void (*show_proto_info)(struct proto *); /* Show protocol info (for `show protocols all' command) */ void (*copy_config)(struct proto_config *, struct proto_config *); /* Copy config from given protocol instance */ }; void protos_build(void); void proto_build(struct protocol *); void protos_preconfig(struct config *); void protos_postconfig(struct config *); void protos_commit(struct config *new, struct config *old, int force_restart, int type); void protos_dump_all(void); #define GA_UNKNOWN 0 /* Attribute not recognized */ #define GA_NAME 1 /* Result = name */ #define GA_FULL 2 /* Result = both name and value */ /* * Known protocols */ extern struct protocol proto_device, proto_radv, proto_rip, proto_static, proto_ospf, proto_pipe, proto_bgp, proto_bfd, proto_babel; /* * Routing Protocol Instance */ struct proto_config { node n; struct config *global; /* Global configuration data */ struct protocol *protocol; /* Protocol */ struct proto *proto; /* Instance we've created */ char *name; char *dsc; int class; /* SYM_PROTO or SYM_TEMPLATE */ u32 debug, mrtdump; /* Debugging bitfields, both use D_* constants */ unsigned preference, disabled; /* Generic parameters */ int in_keep_filtered; /* Routes rejected in import filter are kept */ u32 router_id; /* Protocol specific router ID */ struct rtable_config *table; /* Table we're attached to */ struct filter *in_filter, *out_filter; /* Attached filters */ struct proto_limit *rx_limit; /* Limit for receiving routes from protocol (relevant when in_keep_filtered is active) */ struct proto_limit *in_limit; /* Limit for importing routes from protocol */ struct proto_limit *out_limit; /* Limit for exporting routes to protocol */ /* Check proto_reconfigure() and proto_copy_config() after changing struct proto_config */ /* Protocol-specific data follow... */ }; /* Protocol statistics */ struct proto_stats { /* Import - from protocol to core */ u32 imp_routes; /* Number of routes successfully imported to the (adjacent) routing table */ u32 filt_routes; /* Number of routes rejected in import filter but kept in the routing table */ u32 pref_routes; /* Number of routes that are preferred, sum over all routing tables */ u32 imp_updates_received; /* Number of route updates received */ u32 imp_updates_invalid; /* Number of route updates rejected as invalid */ u32 imp_updates_filtered; /* Number of route updates rejected by filters */ u32 imp_updates_ignored; /* Number of route updates rejected as already in route table */ u32 imp_updates_accepted; /* Number of route updates accepted and imported */ u32 imp_withdraws_received; /* Number of route withdraws received */ u32 imp_withdraws_invalid; /* Number of route withdraws rejected as invalid */ u32 imp_withdraws_ignored; /* Number of route withdraws rejected as already not in route table */ u32 imp_withdraws_accepted; /* Number of route withdraws accepted and processed */ /* Export - from core to protocol */ u32 exp_routes; /* Number of routes successfully exported to the protocol */ u32 exp_updates_received; /* Number of route updates received */ u32 exp_updates_rejected; /* Number of route updates rejected by protocol */ u32 exp_updates_filtered; /* Number of route updates rejected by filters */ u32 exp_updates_accepted; /* Number of route updates accepted and exported */ u32 exp_withdraws_received; /* Number of route withdraws received */ u32 exp_withdraws_accepted; /* Number of route withdraws accepted and processed */ }; struct proto { node n; /* Node in *_proto_list */ node glob_node; /* Node in global proto_list */ struct protocol *proto; /* Protocol */ struct proto_config *cf; /* Configuration data */ struct proto_config *cf_new; /* Configuration we want to switch to after shutdown (NULL=delete) */ pool *pool; /* Pool containing local objects */ struct event *attn; /* "Pay attention" event */ char *name; /* Name of this instance (== cf->name) */ u32 debug; /* Debugging flags */ u32 mrtdump; /* MRTDump flags */ unsigned preference; /* Default route preference */ byte accept_ra_types; /* Which types of route announcements are accepted (RA_OPTIMAL or RA_ANY) */ byte disabled; /* Manually disabled */ byte proto_state; /* Protocol state machine (PS_*, see below) */ byte core_state; /* Core state machine (FS_*, see below) */ byte export_state; /* Route export state (ES_*, see below) */ byte reconfiguring; /* We're shutting down due to reconfiguration */ byte refeeding; /* We are refeeding (valid only if export_state == ES_FEEDING) */ byte flushing; /* Protocol is flushed in current flush loop round */ byte gr_recovery; /* Protocol should participate in graceful restart recovery */ byte gr_lock; /* Graceful restart mechanism should wait for this proto */ byte gr_wait; /* Route export to protocol is postponed until graceful restart */ byte down_sched; /* Shutdown is scheduled for later (PDS_*) */ byte down_code; /* Reason for shutdown (PDC_* codes) */ byte merge_limit; /* Maximal number of nexthops for RA_MERGED */ u32 hash_key; /* Random key used for hashing of neighbors */ bird_clock_t last_state_change; /* Time of last state transition */ char *last_state_name_announced; /* Last state name we've announced to the user */ struct proto_stats stats; /* Current protocol statistics */ /* * General protocol hooks: * * if_notify Notify protocol about interface state changes. * ifa_notify Notify protocol about interface address changes. * rt_notify Notify protocol about routing table updates. * neigh_notify Notify protocol about neighbor cache events. * make_tmp_attrs Construct ea_list from private attrs stored in rte. * store_tmp_attrs Store private attrs back to the rte. * import_control Called as the first step of the route importing process. * It can construct a new rte, add private attributes and * decide whether the route shall be imported: 1=yes, -1=no, * 0=process it through the import filter set by the user. * reload_routes Request protocol to reload all its routes to the core * (using rte_update()). Returns: 0=reload cannot be done, * 1= reload is scheduled and will happen (asynchronously). * feed_begin Notify protocol about beginning of route feeding. * feed_end Notify protocol about finish of route feeding. */ void (*if_notify)(struct proto *, unsigned flags, struct iface *i); void (*ifa_notify)(struct proto *, unsigned flags, struct ifa *a); void (*rt_notify)(struct proto *, struct rtable *table, struct network *net, struct rte *new, struct rte *old, struct ea_list *attrs); void (*neigh_notify)(struct neighbor *neigh); struct ea_list *(*make_tmp_attrs)(struct rte *rt, struct linpool *pool); void (*store_tmp_attrs)(struct rte *rt, struct ea_list *attrs); int (*import_control)(struct proto *, struct rte **rt, struct ea_list **attrs, struct linpool *pool); int (*reload_routes)(struct proto *); void (*feed_begin)(struct proto *, int initial); void (*feed_end)(struct proto *); /* * Routing entry hooks (called only for routes belonging to this protocol): * * rte_recalculate Called at the beginning of the best route selection * rte_better Compare two rte's and decide which one is better (1=first, 0=second). * rte_same Compare two rte's and decide whether they are identical (1=yes, 0=no). * rte_mergable Compare two rte's and decide whether they could be merged (1=yes, 0=no). * rte_insert Called whenever a rte is inserted to a routing table. * rte_remove Called whenever a rte is removed from the routing table. */ int (*rte_recalculate)(struct rtable *, struct network *, struct rte *, struct rte *, struct rte *); int (*rte_better)(struct rte *, struct rte *); int (*rte_same)(struct rte *, struct rte *); int (*rte_mergable)(struct rte *, struct rte *); void (*rte_insert)(struct network *, struct rte *); void (*rte_remove)(struct network *, struct rte *); struct rtable *table; /* Our primary routing table */ struct rte_src *main_source; /* Primary route source */ struct announce_hook *main_ahook; /* Primary announcement hook */ struct announce_hook *ahooks; /* Announcement hooks for this protocol */ struct fib_iterator *feed_iterator; /* Routing table iterator used during protocol feeding */ struct announce_hook *feed_ahook; /* Announce hook we currently feed */ /* Hic sunt protocol-specific data */ }; struct proto_spec { void *ptr; int patt; }; #define PDS_DISABLE 1 /* Proto disable scheduled */ #define PDS_RESTART 2 /* Proto restart scheduled */ #define PDC_CF_REMOVE 0x01 /* Removed in new config */ #define PDC_CF_DISABLE 0x02 /* Disabled in new config */ #define PDC_CF_RESTART 0x03 /* Restart due to reconfiguration */ #define PDC_CMD_DISABLE 0x11 /* Result of disable command */ #define PDC_CMD_RESTART 0x12 /* Result of restart command */ #define PDC_CMD_SHUTDOWN 0x13 /* Result of global shutdown */ #define PDC_RX_LIMIT_HIT 0x21 /* Route receive limit reached */ #define PDC_IN_LIMIT_HIT 0x22 /* Route import limit reached */ #define PDC_OUT_LIMIT_HIT 0x23 /* Route export limit reached */ void *proto_new(struct proto_config *, unsigned size); void *proto_config_new(struct protocol *, int class); void proto_copy_config(struct proto_config *dest, struct proto_config *src); void proto_request_feeding(struct proto *p); static inline void proto_copy_rest(struct proto_config *dest, struct proto_config *src, unsigned size) { memcpy(dest + 1, src + 1, size - sizeof(struct proto_config)); } void graceful_restart_recovery(void); void graceful_restart_init(void); void graceful_restart_show_status(void); void proto_graceful_restart_lock(struct proto *p); void proto_graceful_restart_unlock(struct proto *p); #define DEFAULT_GR_WAIT 240 void proto_show_limit(struct proto_limit *l, const char *dsc); void proto_show_basic_info(struct proto *p); void proto_cmd_show(struct proto *, uint, int); void proto_cmd_disable(struct proto *, uint, int); void proto_cmd_enable(struct proto *, uint, int); void proto_cmd_restart(struct proto *, uint, int); void proto_cmd_reload(struct proto *, uint, int); void proto_cmd_debug(struct proto *, uint, int); void proto_cmd_mrtdump(struct proto *, uint, int); void proto_apply_cmd(struct proto_spec ps, void (* cmd)(struct proto *, uint, int), int restricted, uint arg); struct proto *proto_get_named(struct symbol *, struct protocol *); #define CMD_RELOAD 0 #define CMD_RELOAD_IN 1 #define CMD_RELOAD_OUT 2 static inline u32 proto_get_router_id(struct proto_config *pc) { return pc->router_id ? pc->router_id : pc->global->router_id; } extern list active_proto_list; /* * Each protocol instance runs two different state machines: * * [P] The protocol machine: (implemented inside protocol) * * DOWN ----> START * ^ | * | V * STOP <---- UP * * States: DOWN Protocol is down and it's waiting for the core * requesting protocol start. * START Protocol is waiting for connection with the rest * of the network and it's not willing to accept * packets. When it connects, it goes to UP state. * UP Protocol is up and running. When the network * connection breaks down or the core requests * protocol to be terminated, it goes to STOP state. * STOP Protocol is disconnecting from the network. * After it disconnects, it returns to DOWN state. * * In: start() Called in DOWN state to request protocol startup. * Returns new state: either UP or START (in this * case, the protocol will notify the core when it * finally comes UP). * stop() Called in START, UP or STOP state to request * protocol shutdown. Returns new state: either * DOWN or STOP (in this case, the protocol will * notify the core when it finally comes DOWN). * * Out: proto_notify_state() -- called by protocol instance when * it does any state transition not covered by * return values of start() and stop(). This includes * START->UP (delayed protocol startup), UP->STOP * (spontaneous shutdown) and STOP->DOWN (delayed * shutdown). */ #define PS_DOWN 0 #define PS_START 1 #define PS_UP 2 #define PS_STOP 3 void proto_notify_state(struct proto *p, unsigned state); /* * [F] The feeder machine: (implemented in core routines) * * HUNGRY ----> FEEDING * ^ | * | V * FLUSHING <---- HAPPY * * States: HUNGRY Protocol either administratively down (i.e., * disabled by the user) or temporarily down * (i.e., [P] is not UP) * FEEDING The protocol came up and we're feeding it * initial routes. [P] is UP. * HAPPY The protocol is up and it's receiving normal * routing updates. [P] is UP. * FLUSHING The protocol is down and we're removing its * routes from the table. [P] is STOP or DOWN. * * Normal lifecycle of a protocol looks like: * * HUNGRY/DOWN --> HUNGRY/START --> HUNGRY/UP --> * FEEDING/UP --> HAPPY/UP --> FLUSHING/STOP|DOWN --> * HUNGRY/STOP|DOWN --> HUNGRY/DOWN * * Sometimes, protocol might switch from HAPPY/UP to FEEDING/UP * if it wants to refeed the routes (for example BGP does so * as a result of received ROUTE-REFRESH request). */ #define FS_HUNGRY 0 #define FS_FEEDING 1 /* obsolete */ #define FS_HAPPY 2 #define FS_FLUSHING 3 #define ES_DOWN 0 #define ES_FEEDING 1 #define ES_READY 2 /* * Debugging flags */ #define D_STATES 1 /* [core] State transitions */ #define D_ROUTES 2 /* [core] Routes passed by the filters */ #define D_FILTERS 4 /* [core] Routes rejected by the filters */ #define D_IFACES 8 /* [core] Interface events */ #define D_EVENTS 16 /* Protocol events */ #define D_PACKETS 32 /* Packets sent/received */ #ifndef PARSER #define TRACE(flags, msg, args...) \ do { if (p->p.debug & flags) log(L_TRACE "%s: " msg, p->p.name , ## args ); } while(0) #endif /* * MRTDump flags */ #define MD_STATES 1 /* Protocol state changes (BGP4MP_MESSAGE_AS4) */ #define MD_MESSAGES 2 /* Protocol packets (BGP4MP_MESSAGE_AS4) */ /* * Known unique protocol instances as referenced by config routines */ extern struct proto_config *cf_dev_proto; /* * Protocol limits */ #define PLD_RX 0 /* Receive limit */ #define PLD_IN 1 /* Import limit */ #define PLD_OUT 2 /* Export limit */ #define PLD_MAX 3 #define PLA_WARN 1 /* Issue log warning */ #define PLA_BLOCK 2 /* Block new routes */ #define PLA_RESTART 4 /* Force protocol restart */ #define PLA_DISABLE 5 /* Shutdown and disable protocol */ #define PLS_INITIAL 0 /* Initial limit state after protocol start */ #define PLS_ACTIVE 1 /* Limit was hit */ #define PLS_BLOCKED 2 /* Limit is active and blocking new routes */ struct proto_limit { u32 limit; /* Maximum number of prefixes */ byte action; /* Action to take (PLA_*) */ byte state; /* State of limit (PLS_*) */ }; void proto_notify_limit(struct announce_hook *ah, struct proto_limit *l, int dir, u32 rt_count); void proto_verify_limits(struct announce_hook *ah); static inline void proto_reset_limit(struct proto_limit *l) { if (l) l->state = PLS_INITIAL; } /* * Route Announcement Hook */ struct announce_hook { node n; struct rtable *table; struct proto *proto; struct filter *in_filter; /* Input filter */ struct filter *out_filter; /* Output filter */ struct proto_limit *rx_limit; /* Receive limit (for in_keep_filtered) */ struct proto_limit *in_limit; /* Input limit */ struct proto_limit *out_limit; /* Output limit */ struct proto_stats *stats; /* Per-table protocol statistics */ struct announce_hook *next; /* Next hook for the same protocol */ int in_keep_filtered; /* Routes rejected in import filter are kept */ }; struct announce_hook *proto_add_announce_hook(struct proto *p, struct rtable *t, struct proto_stats *stats); struct announce_hook *proto_find_announce_hook(struct proto *p, struct rtable *t); #endif bird-1.6.3/filter/0000755000103200001440000000000013027054563012717 5ustar feelausersbird-1.6.3/filter/test.conf20000644000103200001440000000273713027054563014640 0ustar feelausers/* * This is an example configuration file. */ # Yet another comment router id 62.168.0.1; define xyzzy = (120+10); protocol device { # disabled; # interface "eth*", "ppp*"; } protocol direct { } protocol kernel { disabled; # learn; # Learn all routes from the kernel # scan time 10; # Scan kernel tables every 10 seconds } protocol static { # disabled; import filter { print "ahoj"; print source; if source = RTS_STATIC then { print "It is from static"; } print from; from = 1.2.3.4; print from; print scope; scope = SCOPE_HOST; print scope; if !(scope ~ [ SCOPE_HOST, SCOPE_SITE ]) then { print "Failed in test"; quitbird; } preference = 15; print preference; preference = 29; print preference; rip_metric = 1; print rip_metric; rip_metric = rip_metric + 5; print rip_metric; bgp_community = - empty - ; print "nazdar"; bgp_community = add(bgp_community, (1,2)); print "cau"; bgp_community = add(bgp_community, (2,3)); bgp_community.add((4,5)); print "community = ", bgp_community; bgp_community.delete((2,3)); print "community = ", bgp_community; bgp_community.empty; print "community = ", bgp_community; print "done"; }; route 0.0.0.0/0 via 195.113.31.113; route 62.168.0.0/25 reject; route 1.2.3.4/32 via 195.113.31.124; # route 10.0.0.0/8 reject; # route 10.1.1.0:255.255.255.0 via 62.168.0.3; # route 10.1.2.0:255.255.255.0 via 62.168.0.3; # route 10.1.3.0:255.255.255.0 via 62.168.0.4; # route 10.2.0.0/24 via "arc0"; export all; } bird-1.6.3/filter/test.conf0000644000103200001440000004253013027054563014551 0ustar feelausers /* * This is an example configuration file. * FIXME: add all examples from docs here. */ # Yet another comment router id 62.168.0.1; define xyzzy = (120+10); define '1a-a1' = (20+10); define one = 1; define ten = 10; define p23 = (2, 3); define ip1222 = 1.2.2.2; function onef(int a) { return 1; } function 'mkpair-a'(int a) { return (1, a); } function mktrip(int a) { return (a, 2*a, 3*a); } function mkpath(int a; int b) { return [= a b 3 2 1 =]; } function callme(int arg1; int arg2) int local1; int local2; int i; { printn "Function callme called arguments ", arg1, " and ", arg2, ": " ; i = arg2; case arg1 { 11, 1, 111: printn "jedna, "; printn "jedna"; (one+onef(2)): printn "dva, "; printn "jeste jednou dva"; (2+one) .. 5: if arg2 < 3 then printn "tri az pet"; else: printn "neco jineho"; } print; } function fifteen() { print "fifteen called"; return 15; } roa table rl { roa 10.110.0.0/16 max 16 as 1000; roa 10.120.0.0/16 max 24 as 1000; roa 10.130.0.0/16 max 24 as 2000; roa 10.130.128.0/18 max 24 as 3000; } function test_roa() { # cannot be tested in __startup(), sorry print "Testing ROA"; print "Should be true: ", roa_check(rl, 10.10.0.0/16, 1000) = ROA_UNKNOWN, " ", roa_check(rl, 10.0.0.0/8, 1000) = ROA_UNKNOWN, " ", roa_check(rl, 10.110.0.0/16, 1000) = ROA_VALID, " ", roa_check(rl, 10.110.0.0/16, 2000) = ROA_INVALID, " ", roa_check(rl, 10.110.32.0/20, 1000) = ROA_INVALID, " ", roa_check(rl, 10.120.32.0/20, 1000) = ROA_VALID; print "Should be true: ", roa_check(rl, 10.120.32.0/20, 2000) = ROA_INVALID, " ", roa_check(rl, 10.120.32.32/28, 1000) = ROA_INVALID, " ", roa_check(rl, 10.130.130.0/24, 1000) = ROA_INVALID, " ", roa_check(rl, 10.130.130.0/24, 2000) = ROA_VALID, " ", roa_check(rl, 10.130.30.0/24, 3000) = ROA_INVALID, " ", roa_check(rl, 10.130.130.0/24, 3000) = ROA_VALID; } function path_test() bgpmask pm1; bgpmask pm2; bgppath p2; clist l; clist l2; eclist el; eclist el2; lclist ll; lclist ll2; { print "Entering path test..."; pm1 = / 4 3 2 1 /; pm2 = [= 3..6 3 2 1..2 =]; print "Testing path masks: ", pm1, " ", pm2; p2 = prepend( + empty +, 1 ); p2 = prepend( p2, 2 ); p2 = prepend( p2, 3 ); p2 = prepend( p2, 4 ); print "Testing path: (4 3 2 1) = ", p2; print "Should be true: ", p2 ~ pm1, " ", p2 ~ pm2, " ", 3 ~ p2, " ", p2 ~ [2, 10..20], " ", p2 ~ [4, 10..20]; print "4 = ", p2.len; p2 = prepend( p2, 5 ); print "Testing path: (5 4 3 2 1) = ", p2; print "Should be false: ", p2 ~ pm1, " ", p2 ~ pm2, " ", 10 ~ p2, " ", p2 ~ [8, ten..(2*ten)], " ", p2 ~ [= 1..4 4 3 2 1 =], " ", p2 ~ [= 5 4 4..100 2 1 =]; print "Should be true: ", p2 ~ / ? 4 3 2 1 /, " ", p2, " ", / ? 4 3 2 1 /; print "Should be true: ", p2 ~ [= * 4 3 * 1 =], " ", p2, " ", [= * 4 3 * 1 =]; print "Should be true: ", p2 ~ [= 5..6 4..10 1..3 1..3 1..65536 =]; print "Should be true: ", p2 ~ [= (3+2) (2*2) 3 2 1 =], " ", p2 ~ mkpath(5, 4); print "Should be true: ", p2.len = 5, " ", p2.first = 5, " ", p2.last = 1; print "Should be true: ", pm1 = [= 4 3 2 1 =], " ", pm1 != [= 4 3 1 2 =], " ", pm2 = [= 3..6 3 2 1..2 =], " ", pm2 != [= 3..6 3 2 1..3 =], " ", [= 1 2 (1+2) =] = [= 1 2 (1+2) =], " ", [= 1 2 (1+2) =] != [= 1 2 (2+1) =]; print "5 = ", p2.len; print "Delete 3: ", delete(p2, 3); print "Filter 1-3: ", filter(p2, [1..3]); pm1 = [= 1 2 * 3 4 5 =]; p2 = prepend( + empty +, 5 ); p2 = prepend( p2, 4 ); p2 = prepend( p2, 3 ); p2 = prepend( p2, 3 ); p2 = prepend( p2, 2 ); p2 = prepend( p2, 1 ); print "Should be true: ", p2 ~ pm1, " ", p2, " ", pm1; print "Delete 3: ", delete(p2, 3); print "Delete 4-5: ", delete(p2, [4..5]); l = - empty -; print "Should be false in this special case: ", l ~ [(*,*)]; l = add( l, (one,2) ); print "Should be always true: ", l ~ [(*,*)]; l = add( l, (2,one+2) ); print "Community list (1,2) (2,3) ", l; print "Should be true: ", (2,3) ~ l, " ", l ~ [(1,*)], " ", l ~ [p23]," ", l ~ [(2,2..3)], " ", l ~ [(1,1..2)], " ", l ~ [(1,1)..(1,2)]; l = add( l, (2,5) ); l = add( l, (5,one) ); l = add( l, (6,one) ); l = add( l, (one,one) ); l = delete( l, [(5,1),(6,one),(one,1)] ); l = delete( l, [(5,one),(6,one)] ); l = filter( l, [(1,*)] ); print "Community list (1,2) ", l; print "Should be false: ", (2,3) ~ l, " ", l ~ [(2,*)], " ", l ~ [(one,3..6)]; print "Should be always true: ", l ~ [(*,*)]; l = add( l, (3,one) ); l = add( l, (one+one+one,one+one) ); l = add( l, (3,3) ); l = add( l, (3,4) ); l = add( l, (3,5) ); l2 = filter( l, [(3,*)] ); l = delete( l, [(3,2..4)] ); print "Community list (1,2) (3,1) (3,5) ", l, " len: ", l.len; l = add( l, (3,2) ); l = add( l, (4,5) ); print "Community list (1,2) (3,1) (3,5) (3,2) (4,5) ", l, " len: ", l.len; print "Should be true: ", l ~ [(*,2)], " ", l ~ [(*,5)], " ", l ~ [(*, one)]; print "Should be false: ", l ~ [(*,3)], " ", l ~ [(*,(one+6))], " ", l ~ [(*, (one+one+one))]; l = delete( l, [(*,(one+onef(3)))] ); l = delete( l, [(*,(4+one))] ); print "Community list (3,1) ", l; l = delete( l, [(*,(onef(5)))] ); print "Community list empty ", l; l2 = add( l2, (3,6) ); l = filter( l2, [(3,1..4)] ); l2 = filter( l2, [(3,3..6)] ); print "clist A (1..4): ", l; print "clist B (3..6): ", l2; print "clist A union B: ", add( l2, l ); print "clist A isect B: ", filter( l, l2 ); print "clist A \ B: ", delete( l, l2 ); el = -- empty --; el = add(el, (rt, 10, 20)); el = add(el, (ro, 10.20.30.40, 100)); el = add(el, (ro, 11.21.31.41.mask(16), 200)); print "EC list (rt, 10, 20) (ro, 10.20.30.40, 100) (ro, 11.21.0.0, 200):"; print el; print "EC len: ", el.len; el = delete(el, (rt, 10, 20)); el = delete(el, (rt, 10, 30)); el = add(el, (unknown 2, ten, 1)); el = add(el, (unknown 5, ten, 1)); el = add(el, (rt, ten, one+one)); el = add(el, (rt, 10, 3)); el = add(el, (rt, 10, 4)); el = add(el, (rt, 10, 5)); el = add(el, (generic, 0x2000a, 3*ten)); el = delete(el, [(rt, 10, 2..ten)]); print "EC list (ro, 10.20.30.40, 100) (ro, 11.21.0.0, 200) (rt, 10, 1) (unknown 0x5, 10, 1) (rt, 10, 30):"; print el; el = filter(el, [(rt, 10, *)]); print "EC list (rt, 10, 1) (rt, 10, 30): ", el; print "Testing EC list, true: ", (rt, 10, 1) ~ el, " ", el ~ [(rt, 10, ten..40)]; print "Testing EC list, false: ", (rt, 10, 20) ~ el, " ", (ro, 10.20.30.40, 100) ~ el, " ", el ~ [(rt, 10, 35..40)], " ", el ~ [(ro, 10, *)]; el = add(el, (rt, 10, 40)); el2 = filter(el, [(rt, 10, 20..40)] ); el2 = add(el2, (rt, 10, 50)); print "eclist A (1,30,40): ", el; print "eclist B (30,40,50): ", el2; print "eclist A union B: ", add( el2, el ); print "eclist A isect B: ", filter( el, el2 ); print "eclist A \ B: ", delete( el, el2 ); ll = --- empty ---; ll = add(ll, (ten, 20, 30)); ll = add(ll, (1000, 2000, 3000)); ll = add(ll, mktrip(100000)); print "LC list (10, 20, 30) (1000, 2000, 3000) (100000, 200000, 300000):"; print ll; print "LC len: ", el.len; print "Should be true: ", mktrip(1000) ~ ll, " ", ll ~ [(5,10,15), (10,20,30)], " ", ll ~ [(10,15..25,*)], " ", ll ~ [(ten, *, *)]; print "Should be false: ", mktrip(100) ~ ll, " ", ll ~ [(5,10,15), (10,21,30)], " ", ll ~ [(10,21..25,*)], " ", ll ~ [(11, *, *)]; print "LC filtered: ", filter(ll, [(5..15, *, *), (100000, 500..500000, *)]); ll = --- empty ---; ll = add(ll, (10, 10, 10)); ll = add(ll, (20, 20, 20)); ll = add(ll, (30, 30, 30)); ll2 = --- empty ---; ll2 = add(ll2, (20, 20, 20)); ll2 = add(ll2, (30, 30, 30)); ll2 = add(ll2, (40, 40, 40)); print "lclist A (10,20,30): ", ll; print "lclist B (20,30,40): ", ll2; print "lclist A union B: ", add(ll, ll2); print "lclist A isect B: ", filter(ll, ll2); print "lclist A \ B: ", delete(ll, ll2); # test_roa(); } function bla() { print "fifteen called"; return 15; } define four=4; define onetwo=1.2.3.4; function __test1() { if source ~ [ RTS_BGP, RTS_STATIC ] then { # ospf_metric1 = 65535; # ospf_metric2 = 1000; ospf_tag = 0x12345678; accept; } reject; } function __test2() { if source ~ [ RTS_BGP, RTS_STATIC ] then { # ospf_metric1 = 65535; # ospf_metric2 = 1000; ospf_tag = 0x12345678; accept; } reject; } function test_pxset(prefix set pxs) { print pxs; print " must be true: ", 10.0.0.0/8 ~ pxs, ",", 10.0.0.0/10 ~ pxs, ",", 10.0.0.0/12 ~ pxs, ",", 20.0.0.0/24 ~ pxs, ",", 20.0.40.0/24 ~ pxs, ",", 20.0.0.0/26 ~ pxs, ",", 20.0.100.0/26 ~ pxs, ",", 20.0.0.0/28 ~ pxs, ",", 20.0.255.0/28 ~ pxs; print " must be false: ", 10.0.0.0/7 ~ pxs, ",", 10.0.0.0/13 ~ pxs, ",", 10.0.0.0/16 ~ pxs, ",", 20.0.0.0/16 ~ pxs, ",", 20.0.0.0/23 ~ pxs, ",", 20.0.0.0/29 ~ pxs, ",", 11.0.0.0/10 ~ pxs, ",", 20.1.0.0/26 ~ pxs; } function test_undef(int a) int b; { if a = 3 then b = 4; print "Defined: ", a, " ", b, " ", defined(b); } define is1 = [ one, (2+1), (6-one), 8, 11, 15, 17, 19]; define is2 = [(17+2), 17, 15, 11, 8, 5, 3, 2]; define is3 = [5, 17, 2, 11, 8, 15, 3, 19]; define pxs2 = [ 10.0.0.0/16{8,12}, 20.0.0.0/16{24,28} ]; define ecs2 = [(rt, ten, (one+onef(0))*10), (ro, 100000, 100..200), (rt, 12345, *)]; function __startup() int i; bool b; prefix px; ip p; pair pp; quad qq; ec cc; int set is; pair set ps; ec set ecs; ip set ips; prefix set pxs; string st; { print "1a-a1 = 30: ", '1a-a1'; print "Testing filter language:"; i = four; i = 12*100 + 60/2 + i; i = ( i + 0 ); print " arithmetics: 1234 = ", i; printn " if statements "; print "what happens here?"; printn "."; if (i = 4) then { print "*** FAIL: if 0"; quitbird; } else printn "."; # if !(i = 3) then { print "*** FAIL: if 0"; quitbird; } else printn "."; if 1234 = i then printn "."; else { print "*** FAIL: if 1 else"; } # if 1 <= 1 then printn "."; else { print "*** FAIL: test 3"; } if 1234 < 1234 then { print "*** FAIL: test 4"; quitbird; } else print "ok"; is = [ 2, 3, 4, 7..11 ]; print "must be true: ", 1 = 1, " ", 1 != (0,1), " ", 1 != "a", " ", +empty+ = +empty+, " ", -empty- = -empty-, " ", --empty-- = --empty-- , " ", [1,4..10,20] = [1,4..10,20] , " ", [ 10.0.0.0/8{ 15 , 17 } ] = [ 10.0.0.0/8{ 15 , 17 } ]; print "must be false: ", 1 != 1, " ", 1 = (0,1), " ", 1 = "a", " ", +empty+ = -empty-, " ", -empty- = --empty--, " ", --empty-- = +empty+ , " ", [1,2] = [1,3], " ", [ 10.0.0.0/8{ 15 , 17 } ] = [ 11.0.0.0/8{ 15 , 17 } ]; print " must be true: ", 1.2.0.0/16 ~ [ 1.0.0.0/8{ 15 , 17 } ]; print " data types; must be true: ", 1.2.3.4 = 1.2.3.4, ",", 1 ~ [1,2,3], ",", 5 ~ [1..20], ",", 10 ~ is, ",", 2 ~ [ 1, 2, 3 ], ",", 5 ~ [ 4 .. 7 ], ",", 1.2.3.4 ~ [ 1.2.3.3..1.2.3.5 ], ",", 1.2.3.4 ~ 1.0.0.0/8, ",", 1.0.0.0/8 ~ 1.0.0.0/8, ",", 1.0.0.0/8 ~ [ 1.0.0.0/8+ ]; print " must be true: ", true && true, ",", true || false, ",", ! false && ! false && true, ",", 1 < 2 && 1 != 3, ",", true && true && ! false, ",", true || 1+"a", ",", !(false && 1+"a"); print " must be true: ", defined(1), ",", defined(1.2.3.4), ",", 1 != 2, ",", 1 <= 2; print " data types: must be false: ", 1 ~ [ 2, 3, 4 ], ",", 5 ~ is, ",", 1.2.3.4 ~ [ 1.2.3.3, 1.2.3.5 ], ",", (1,2) > (2,2), ",", (1,1) > (1,1), ",", 1.0.0.0/9 ~ [ 1.0.0.0/8- ], ",", 1.2.0.0/17 ~ [ 1.0.0.0/8{ 15 , 16 } ], ",", true && false; print " must be true: ", 1 ~ is1, " ", 3 ~ is1, " ", 5 ~ is1; print " must be true: ", (one+2) ~ is1, " ", 2 ~ is2, " ", 2 ~ is3; print " must be false: ", 4 ~ is1, " ", 4 ~ is2, " ", 4 ~ is3; print " must be false: ", 10 ~ is1, " ", 10 ~ is2, " ", 10 ~ is3; print " must be true: ", 15 ~ is1, " ", 15 ~ is2, " ", 15 ~ is3; print " must be false: ", 18 ~ is1, " ", 18 ~ is2, " ", 18 ~ is3; print " must be true: ", 19 ~ is1, " ", 19 ~ is2, " ", 19 ~ is3; print " must be false: ", 20 ~ is1, " ", 20 ~ is2, " ", 20 ~ is3; px = 1.2.0.0/18; print "Testing prefixes: 1.2.0.0/18 = ", px; print " must be true: ", 192.168.0.0/16 ~ 192.168.0.0/16, " ", 192.168.0.0/17 ~ 192.168.0.0/16, " ", 192.168.254.0/24 ~ 192.168.0.0/16; print " must be false: ", 192.168.0.0/15 ~ 192.168.0.0/16, " ", 192.160.0.0/17 ~ 192.168.0.0/16; p = 127.1.2.3; print "Testing mask : 127.0.0.0 = ", p.mask(8); pp = (1, 2); print "Testing pairs: (1,2) = ", (1,2), " = ", pp, " = ", (1,1+1), " = ", 'mkpair-a'(2); print " must be true: ", (1,2) = (1,1+1); print "Testing enums: ", RTS_DUMMY, " ", RTS_STATIC, " ", ", true: ", RTS_STATIC ~ [RTS_STATIC, RTS_DEVICE], ", false: ", RTS_BGP ~ [RTS_STATIC, RTS_DEVICE]; ps = [(1,(one+one)), (3,4)..(4,8), (5,*), (6,3..6)]; print "Pair set: ", ps; print "Testing pair set, true: ", pp ~ ps, " ", (3,5) ~ ps, " ", (4,1) ~ ps, " ", (5,4) ~ ps, " ", (5,65535) ~ ps, " ", (6,4) ~ ps, " ", (3, 10000) ~ ps; print "Testing pair set, false: ", (3,3) ~ ps, " ", (4,9) ~ ps, " ", (4,65535) ~ ps, " ", (6,2) ~ ps, " ", (6,6+one) ~ ps, " ", ((one+6),2) ~ ps, " ", (1,1) ~ ps; ps = [(20..150, 200..300), (50100..50200, 1000..50000), (*, 5+5)]; print "Pair set: .. too long .."; print "Testing pair set, true: ", (100,200) ~ ps, " ", (150,300) ~ ps, " ", (50180,1200) ~ ps, " ", (50110,49000) ~ ps, " ", (0,10) ~ ps, " ", (64000,10) ~ ps; print "Testing pair set, false: ", (20,199) ~ ps, " ", (151,250) ~ ps, " ", (50050,2000) ~ ps, " ", (50150,50050) ~ ps, " ", (10,9) ~ ps, " ", (65535,11) ~ ps ; qq = 1.2.3.4; print "Testinq quad: 1.2.3.4 = ", qq, ", true: ", qq = 1.2.3.4, " ", qq ~ [1.2.3.4, 5.6.7.8], ", false: ", qq = 4.3.2.1, " ", qq ~ [1.2.1.1, 1.2.3.5]; cc = (rt, 12345, 200000); print "Testing EC: (rt, 12345, 200000) = ", cc; print "Testing EC: (ro, 100000, 20000) = ", (ro, 100000, 20000); print "Testing EC: (rt, 10.20.30.40, 20000) = ", (rt, 10.20.30.40, 20000); print " true: ", cc = (rt, 12345, 200000), " ", cc < (rt, 12345, 200010), ", false: ", cc = (rt, 12346, 200000), " ", cc = (ro, 12345, 200000), " ", cc > (rt, 12345, 200010); ecs = [(rt, ten, (one+onef(0))*10), (ro, 100000, 100..200), (rt, 12345, *)]; print "EC set: ", ecs; print "EC set: ", ecs2; print "Testing EC set, true: ", (rt, 10, 20) ~ ecs, " ", (ro, 100000, 100) ~ ecs, " ", (ro, 100000, 200) ~ ecs, " ", (rt, 12345, 0) ~ ecs, " ", cc ~ ecs, " ", (rt, 12345, 4000000) ~ ecs; print "Testing EC set, false: ", (ro, 10, 20) ~ ecs, " ", (rt, 10, 21) ~ ecs, " ", (ro, 100000, 99) ~ ecs, " ", (ro, 12345, 10) ~ ecs, " ", (rt, 12346, 0) ~ ecs, " ", (ro, 0.1.134.160, 150) ~ ecs; st = "Hello"; print "Testing string: ", st, " true: ", st ~ "Hell*", " false: ", st ~ "ell*"; b = true; print "Testing bool: ", b, ", ", !b; if ( b = true ) then print "Testing bool comparison b = true: ", b; else { print "*** FAIL: TRUE test failed" ; quitbird; } ips = [ 1.1.1.0 .. 1.1.1.255, ip1222]; print "Testing IP sets: "; print ips; print " must be true: ", 1.1.1.0 ~ ips, ",", 1.1.1.100 ~ ips, ",", 1.2.2.2 ~ ips; print " must be false: ", 1.1.0.255 ~ ips, ",", 1.1.2.0 ~ ips, ",", 1.2.2.3 ~ ips, ",", 192.168.1.1 ~ ips; pxs = [ 1.2.0.0/16, 1.4.0.0/16+]; print "Testing prefix sets: "; print pxs; print " must be true: ", 1.2.0.0/16 ~ pxs, ",", 1.4.0.0/16 ~ pxs, ",", 1.4.0.0/18 ~ pxs, ",", 1.4.0.0/32 ~ pxs; print " must be false: ", 1.1.0.0/16 ~ pxs, ",", 1.3.0.0/16 ~ pxs, ",", 1.2.0.0/15 ~ pxs, ",", 1.2.0.0/17 ~ pxs, ",", 1.2.0.0/32 ~ pxs, ",", 1.4.0.0/15 ~ pxs; test_pxset(pxs2); test_pxset([ 10.0.0.0/16{8,12}, 20.0.0.0/16{24,28} ]); print "What will this do? ", [ 1, 2, 1, 1, 1, 3, 4, 1, 1, 1, 5 ]; print "Testing functions..."; callme ( 1, 2 ); callme ( 2, 2 ); callme ( 2, 2 ); callme ( 3, 2 ); callme ( 4, 4 ); callme ( 7, 2 ); i = fifteen(); print "Testing function calls: 15 = ", i; path_test(); print "1.2.3.4 = ", onetwo; i = 4200000000; print "4200000000 = ", i, " false: ", i = 4200000000, " ", i > 4100000000, " false: ", i > 4250000000; test_undef(2); test_undef(3); test_undef(2); print "Testing include"; include "test.conf.inc"; print "done"; quitbird; # print "*** FAIL: this is unreachable"; } filter testf int j; { print "Heya, filtering route to ", net.ip, " prefixlen ", net.len, " source ", source; print "This route was from ", from; j = 7; j = 17; if rip_metric > 15 then { reject "RIP Metric is more than infinity"; } rip_metric = 14; unset(rip_metric); accept "ok I take that"; } eval __startup(); bird-1.6.3/filter/test.conf.inc0000644000103200001440000000012213027054563015310 0ustar feelausers print "Entering include"; print "Should be 2: ", 1+1; print "Leaving include"; bird-1.6.3/filter/trie.c0000644000103200001440000002141713027054563014033 0ustar feelausers/* * Filters: Trie for prefix sets * * Copyright 2009 Ondrej Zajicek * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Trie for prefix sets * * We use a (compressed) trie to represent prefix sets. Every node * in the trie represents one prefix (&addr/&plen) and &plen also * indicates the index of the bit in the address that is used to * branch at the node. If we need to represent just a set of * prefixes, it would be simple, but we have to represent a * set of prefix patterns. Each prefix pattern consists of * &ppaddr/&pplen and two integers: &low and &high, and a prefix * &paddr/&plen matches that pattern if the first MIN(&plen, &pplen) * bits of &paddr and &ppaddr are the same and &low <= &plen <= &high. * * We use a bitmask (&accept) to represent accepted prefix lengths * at a node. As there are 33 prefix lengths (0..32 for IPv4), but * there is just one prefix of zero length in the whole trie so we * have &zero flag in &f_trie (indicating whether the trie accepts * prefix 0.0.0.0/0) as a special case, and &accept bitmask * represents accepted prefix lengths from 1 to 32. * * There are two cases in prefix matching - a match when the length * of the prefix is smaller that the length of the prefix pattern, * (&plen < &pplen) and otherwise. The second case is simple - we * just walk through the trie and look at every visited node * whether that prefix accepts our prefix length (&plen). The * first case is tricky - we don't want to examine every descendant * of a final node, so (when we create the trie) we have to propagate * that information from nodes to their ascendants. * * Suppose that we have two masks (M1 and M2) for a node. Mask M1 * represents accepted prefix lengths by just the node and mask M2 * represents accepted prefix lengths by the node or any of its * descendants. Therefore M2 is a bitwise or of M1 and children's * M2 and this is a maintained invariant during trie building. * Basically, when we want to match a prefix, we walk through the trie, * check mask M1 for our prefix length and when we came to * final node, we check mask M2. * * There are two differences in the real implementation. First, * we use a compressed trie so there is a case that we skip our * final node (if it is not in the trie) and we came to node that * is either extension of our prefix, or completely out of path * In the first case, we also have to check M2. * * Second, we really need not to maintain two separate bitmasks. * Checks for mask M1 are always larger than &applen and we need * just the first &pplen bits of mask M2 (if trie compression * hadn't been used it would suffice to know just $applen-th bit), * so we have to store them together in &accept mask - the first * &pplen bits of mask M2 and then mask M1. * * There are four cases when we walk through a trie: * * - we are in NULL * - we are out of path (prefixes are inconsistent) * - we are in the wanted (final) node (node length == &plen) * - we are beyond the end of path (node length > &plen) * - we are still on path and keep walking (node length < &plen) * * The walking code in trie_match_prefix() is structured according to * these cases. */ #include "nest/bird.h" #include "lib/string.h" #include "conf/conf.h" #include "filter/filter.h" /** * f_new_trie - allocates and returns a new empty trie * @lp: linear pool to allocate items from * @node_size: node size to be used (&f_trie_node and user data) */ struct f_trie * f_new_trie(linpool *lp, uint node_size) { struct f_trie * ret; ret = lp_allocz(lp, sizeof(struct f_trie) + node_size); ret->lp = lp; ret->node_size = node_size; return ret; } static inline struct f_trie_node * new_node(struct f_trie *t, int plen, ip_addr paddr, ip_addr pmask, ip_addr amask) { struct f_trie_node *n = lp_allocz(t->lp, t->node_size); n->plen = plen; n->addr = paddr; n->mask = pmask; n->accept = amask; return n; } static inline void attach_node(struct f_trie_node *parent, struct f_trie_node *child) { parent->c[ipa_getbit(child->addr, parent->plen) ? 1 : 0] = child; } /** * trie_add_prefix * @t: trie to add to * @px: prefix address * @plen: prefix length * @l: prefix lower bound * @h: prefix upper bound * * Adds prefix (prefix pattern) @px/@plen to trie @t. @l and @h are lower * and upper bounds on accepted prefix lengths, both inclusive. * 0 <= l, h <= 32 (128 for IPv6). * * Returns a pointer to the allocated node. The function can return a pointer to * an existing node if @px and @plen are the same. If px/plen == 0/0 (or ::/0), * a pointer to the root node is returned. */ void * trie_add_prefix(struct f_trie *t, ip_addr px, int plen, int l, int h) { if (l == 0) t->zero = 1; else l--; if (h < plen) plen = h; ip_addr amask = ipa_xor(ipa_mkmask(l), ipa_mkmask(h)); ip_addr pmask = ipa_mkmask(plen); ip_addr paddr = ipa_and(px, pmask); struct f_trie_node *o = NULL; struct f_trie_node *n = t->root; while(n) { ip_addr cmask = ipa_and(n->mask, pmask); if (ipa_compare(ipa_and(paddr, cmask), ipa_and(n->addr, cmask))) { /* We are out of path - we have to add branching node 'b' between node 'o' and node 'n', and attach new node 'a' as the other child of 'b'. */ int blen = ipa_pxlen(paddr, n->addr); ip_addr bmask = ipa_mkmask(blen); ip_addr baddr = ipa_and(px, bmask); /* Merge accept masks from children to get accept mask for node 'b' */ ip_addr baccm = ipa_and(ipa_or(amask, n->accept), bmask); struct f_trie_node *a = new_node(t, plen, paddr, pmask, amask); struct f_trie_node *b = new_node(t, blen, baddr, bmask, baccm); attach_node(o, b); attach_node(b, n); attach_node(b, a); return a; } if (plen < n->plen) { /* We add new node 'a' between node 'o' and node 'n' */ amask = ipa_or(amask, ipa_and(n->accept, pmask)); struct f_trie_node *a = new_node(t, plen, paddr, pmask, amask); attach_node(o, a); attach_node(a, n); return a; } if (plen == n->plen) { /* We already found added node in trie. Just update accept mask */ n->accept = ipa_or(n->accept, amask); return n; } /* Update accept mask part M2 and go deeper */ n->accept = ipa_or(n->accept, ipa_and(amask, n->mask)); /* n->plen < plen and plen <= 32 (128) */ o = n; n = n->c[ipa_getbit(paddr, n->plen) ? 1 : 0]; } /* We add new tail node 'a' after node 'o' */ struct f_trie_node *a = new_node(t, plen, paddr, pmask, amask); attach_node(o, a); return a; } /** * trie_match_prefix * @t: trie * @px: prefix address * @plen: prefix length * * Tries to find a matching prefix pattern in the trie such that * prefix @px/@plen matches that prefix pattern. Returns 1 if there * is such prefix pattern in the trie. */ int trie_match_prefix(struct f_trie *t, ip_addr px, int plen) { ip_addr pmask = ipa_mkmask(plen); ip_addr paddr = ipa_and(px, pmask); if (plen == 0) return t->zero; int plentest = plen - 1; struct f_trie_node *n = t->root; while(n) { ip_addr cmask = ipa_and(n->mask, pmask); /* We are out of path */ if (ipa_compare(ipa_and(paddr, cmask), ipa_and(n->addr, cmask))) return 0; /* Check accept mask */ if (ipa_getbit(n->accept, plentest)) return 1; /* We finished trie walk and still no match */ if (plen <= n->plen) return 0; /* Choose children */ n = n->c[(ipa_getbit(paddr, n->plen)) ? 1 : 0]; } return 0; } static int trie_node_same(struct f_trie_node *t1, struct f_trie_node *t2) { if ((t1 == NULL) && (t2 == NULL)) return 1; if ((t1 == NULL) || (t2 == NULL)) return 0; if ((t1->plen != t2->plen) || (! ipa_equal(t1->addr, t2->addr)) || (! ipa_equal(t1->accept, t2->accept))) return 0; return trie_node_same(t1->c[0], t2->c[0]) && trie_node_same(t1->c[1], t2->c[1]); } /** * trie_same * @t1: first trie to be compared * @t2: second one * * Compares two tries and returns 1 if they are same */ int trie_same(struct f_trie *t1, struct f_trie *t2) { return (t1->zero == t2->zero) && trie_node_same(t1->root, t2->root); } static void trie_node_format(struct f_trie_node *t, buffer *buf) { if (t == NULL) return; if (ipa_nonzero(t->accept)) buffer_print(buf, "%I/%d{%I}, ", t->addr, t->plen, t->accept); trie_node_format(t->c[0], buf); trie_node_format(t->c[1], buf); } /** * trie_format * @t: trie to be formatted * @buf: destination buffer * * Prints the trie to the supplied buffer. */ void trie_format(struct f_trie *t, buffer *buf) { buffer_puts(buf, "["); if (t->zero) buffer_print(buf, "%I/%d, ", IPA_NONE, 0); trie_node_format(t->root, buf); if (buf->pos == buf->end) return; /* Undo last separator */ if (buf->pos[-1] != '[') buf->pos -= 2; buffer_puts(buf, "]"); } bird-1.6.3/filter/Doc0000644000103200001440000000004613027054563013347 0ustar feelausersH Filters S filter.c S tree.c S trie.cbird-1.6.3/filter/tree.c0000644000103200001440000000701313027054563014023 0ustar feelausers/* * Filters: utility functions * * Copyright 1998 Pavel Machek * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "lib/alloca.h" #include "nest/bird.h" #include "conf/conf.h" #include "filter/filter.h" /** * find_tree * @t: tree to search in * @val: value to find * * Search for given value in the tree. I relies on fact that sorted tree is populated * by &f_val structures (that can be compared by val_compare()). In each node of tree, * either single value (then t->from==t->to) or range is present. * * Both set matching and |switch() { }| construction is implemented using this function, * thus both are as fast as they can be. */ struct f_tree * find_tree(struct f_tree *t, struct f_val val) { if (!t) return NULL; if ((val_compare(t->from, val) != 1) && (val_compare(t->to, val) != -1)) return t; if (val_compare(t->from, val) == -1) return find_tree(t->right, val); else return find_tree(t->left, val); } static struct f_tree * build_tree_rec(struct f_tree **buf, int l, int h) { struct f_tree *n; int pos; if (l >= h) return NULL; pos = (l+h)/2; n = buf[pos]; n->left = build_tree_rec(buf, l, pos); n->right = build_tree_rec(buf, pos+1, h); return n; } static int tree_compare(const void *p1, const void *p2) { return val_compare((* (struct f_tree **) p1)->from, (* (struct f_tree **) p2)->from); } /** * build_tree * @from: degenerated tree (linked by @tree->left) to be transformed into form suitable for find_tree() * * Transforms degenerated tree into balanced tree. */ struct f_tree * build_tree(struct f_tree *from) { struct f_tree *tmp, *root; struct f_tree **buf; int len, i; if (from == NULL) return NULL; len = 0; for (tmp = from; tmp != NULL; tmp = tmp->left) len++; if (len <= 1024) buf = alloca(len * sizeof(struct f_tree *)); else buf = xmalloc(len * sizeof(struct f_tree *)); /* Convert a degenerated tree into an sorted array */ i = 0; for (tmp = from; tmp != NULL; tmp = tmp->left) buf[i++] = tmp; qsort(buf, len, sizeof(struct f_tree *), tree_compare); root = build_tree_rec(buf, 0, len); if (len > 1024) xfree(buf); return root; } struct f_tree * f_new_tree(void) { struct f_tree * ret; ret = cfg_alloc(sizeof(struct f_tree)); ret->left = ret->right = NULL; ret->from.type = ret->to.type = T_VOID; ret->from.val.i = ret->to.val.i = 0; ret->data = NULL; return ret; } /** * same_tree * @t1: first tree to be compared * @t2: second one * * Compares two trees and returns 1 if they are same */ int same_tree(struct f_tree *t1, struct f_tree *t2) { if ((!!t1) != (!!t2)) return 0; if (!t1) return 1; if (val_compare(t1->from, t2->from)) return 0; if (val_compare(t1->to, t2->to)) return 0; if (!same_tree(t1->left, t2->left)) return 0; if (!same_tree(t1->right, t2->right)) return 0; if (!i_same(t1->data, t2->data)) return 0; return 1; } static void tree_node_format(struct f_tree *t, buffer *buf) { if (t == NULL) return; tree_node_format(t->left, buf); val_format(t->from, buf); if (val_compare(t->from, t->to) != 0) { buffer_puts(buf, ".."); val_format(t->to, buf); } buffer_puts(buf, ", "); tree_node_format(t->right, buf); } void tree_format(struct f_tree *t, buffer *buf) { buffer_puts(buf, "["); tree_node_format(t, buf); if (buf->pos == buf->end) return; /* Undo last separator */ if (buf->pos[-1] != '[') buf->pos -= 2; buffer_puts(buf, "]"); } bird-1.6.3/filter/config.Y0000644000103200001440000006652613027054563014335 0ustar feelausers/* * BIRD - filters * * Copyright 1998--2000 Pavel Machek * * Can be freely distributed and used under the terms of the GNU GPL. * FIXME: priority of ! should be lower */ CF_HDR CF_DEFINES #define P(a,b) ((a << 8) | b) static inline u32 pair(u32 a, u32 b) { return (a << 16) | b; } static inline u32 pair_a(u32 p) { return p >> 16; } static inline u32 pair_b(u32 p) { return p & 0xFFFF; } /* * Sets and their items are during parsing handled as lists, linked * through left ptr. The first item in a list also contains a pointer * to the last item in a list (right ptr). For convenience, even items * are handled as one-item lists. Lists are merged by f_merge_items(). */ static int f_valid_set_type(int type) { switch (type) { case T_INT: case T_PAIR: case T_QUAD: case T_ENUM: case T_IP: case T_EC: case T_LC: return 1; default: return 0; } } static inline struct f_tree * f_new_item(struct f_val from, struct f_val to) { struct f_tree *t = f_new_tree(); t->right = t; t->from = from; t->to = to; return t; } static inline struct f_tree * f_merge_items(struct f_tree *a, struct f_tree *b) { if (!a) return b; a->right->left = b; a->right = b->right; b->right = NULL; return a; } static inline struct f_tree * f_new_pair_item(int fa, int ta, int fb, int tb) { check_u16(fa); check_u16(ta); check_u16(fb); check_u16(tb); if ((ta < fa) || (tb < fb)) cf_error( "From value cannot be higher that To value in pair sets"); struct f_tree *t = f_new_tree(); t->right = t; t->from.type = t->to.type = T_PAIR; t->from.val.i = pair(fa, fb); t->to.val.i = pair(ta, tb); return t; } static inline struct f_tree * f_new_pair_set(int fa, int ta, int fb, int tb) { check_u16(fa); check_u16(ta); check_u16(fb); check_u16(tb); if ((ta < fa) || (tb < fb)) cf_error( "From value cannot be higher that To value in pair sets"); struct f_tree *lst = NULL; int i; for (i = fa; i <= ta; i++) lst = f_merge_items(lst, f_new_pair_item(i, i, fb, tb)); return lst; } #define CC_ALL 0xFFFF #define EC_ALL 0xFFFFFFFF #define LC_ALL 0xFFFFFFFF static struct f_tree * f_new_ec_item(u32 kind, u32 ipv4_used, u32 key, u32 vf, u32 vt) { u64 fm, to; if (ipv4_used || (key >= 0x10000)) { check_u16(vf); if (vt == EC_ALL) vt = 0xFFFF; else check_u16(vt); } if (kind == EC_GENERIC) { fm = ec_generic(key, vf); to = ec_generic(key, vt); } else if (ipv4_used) { fm = ec_ip4(kind, key, vf); to = ec_ip4(kind, key, vt); } else if (key < 0x10000) { fm = ec_as2(kind, key, vf); to = ec_as2(kind, key, vt); } else { fm = ec_as4(kind, key, vf); to = ec_as4(kind, key, vt); } struct f_tree *t = f_new_tree(); t->right = t; t->from.type = t->to.type = T_EC; t->from.val.ec = fm; t->to.val.ec = to; return t; } static struct f_tree * f_new_lc_item(u32 f1, u32 t1, u32 f2, u32 t2, u32 f3, u32 t3) { struct f_tree *t = f_new_tree(); t->right = t; t->from.type = t->to.type = T_LC; t->from.val.lc = (lcomm) {f1, f2, f3}; t->to.val.lc = (lcomm) {t1, t2, t3}; return t; } static inline struct f_inst * f_generate_empty(struct f_inst *dyn) { struct f_inst *e = f_new_inst(); e->code = 'E'; switch (dyn->aux & EAF_TYPE_MASK) { case EAF_TYPE_AS_PATH: e->aux = T_PATH; break; case EAF_TYPE_INT_SET: e->aux = T_CLIST; break; case EAF_TYPE_EC_SET: e->aux = T_ECLIST; break; case EAF_TYPE_LC_SET: e->aux = T_LCLIST; break; default: cf_error("Can't empty that attribute"); } dyn->code = P('e','S'); dyn->a1.p = e; return dyn; } static inline struct f_inst * f_generate_dpair(struct f_inst *t1, struct f_inst *t2) { struct f_inst *rv; if ((t1->code == 'c') && (t2->code == 'c')) { if ((t1->aux != T_INT) || (t2->aux != T_INT)) cf_error( "Can't operate with value of non-integer type in pair constructor"); check_u16(t1->a2.i); check_u16(t2->a2.i); rv = f_new_inst(); rv->code = 'c'; rv->aux = T_PAIR; rv->a2.i = pair(t1->a2.i, t2->a2.i); } else { rv = f_new_inst(); rv->code = P('m', 'p'); rv->a1.p = t1; rv->a2.p = t2; } return rv; } static inline struct f_inst * f_generate_ec(u16 kind, struct f_inst *tk, struct f_inst *tv) { struct f_inst *rv; int c1 = 0, c2 = 0, ipv4_used = 0; u32 key = 0, val2 = 0; if (tk->code == 'c') { c1 = 1; if (tk->aux == T_INT) { ipv4_used = 0; key = tk->a2.i; } else if (tk->aux == T_QUAD) { ipv4_used = 1; key = tk->a2.i; } else cf_error("Can't operate with key of non-integer/IPv4 type in EC constructor"); } #ifndef IPV6 /* IP->Quad implicit conversion */ else if (tk->code == 'C') { c1 = 1; struct f_val *val = tk->a1.p; if (val->type == T_INT) { ipv4_used = 0; key = val->val.i; } else if (val->type == T_QUAD) { ipv4_used = 1; key = val->val.i; } else if (val->type == T_IP) { ipv4_used = 1; key = ipa_to_u32(val->val.px.ip); } else cf_error("Can't operate with key of non-integer/IPv4 type in EC constructor"); } #endif if (tv->code == 'c') { if (tv->aux != T_INT) cf_error("Can't operate with value of non-integer type in EC constructor"); c2 = 1; val2 = tv->a2.i; } if (c1 && c2) { u64 ec; if (kind == EC_GENERIC) { ec = ec_generic(key, val2); } else if (ipv4_used) { check_u16(val2); ec = ec_ip4(kind, key, val2); } else if (key < 0x10000) { ec = ec_as2(kind, key, val2); } else { check_u16(val2); ec = ec_as4(kind, key, val2); } NEW_F_VAL; rv = f_new_inst(); rv->code = 'C'; rv->a1.p = val; val->type = T_EC; val->val.ec = ec; } else { rv = f_new_inst(); rv->code = P('m','c'); rv->aux = kind; rv->a1.p = tk; rv->a2.p = tv; } return rv; } static inline struct f_inst * f_generate_lc(struct f_inst *t1, struct f_inst *t2, struct f_inst *t3) { struct f_inst *rv; if ((t1->code == 'c') && (t2->code == 'c') && (t3->code == 'c')) { if ((t1->aux != T_INT) || (t2->aux != T_INT) || (t3->aux != T_INT)) cf_error( "LC - Can't operate with value of non-integer type in tuple constructor"); rv = f_new_inst(); rv->code = 'C'; NEW_F_VAL; rv->a1.p = val; val->type = T_LC; val->val.lc = (lcomm) { t1->a2.i, t2->a2.i, t3->a2.i }; } else { rv = cfg_allocz(sizeof(struct f_inst3)); rv->lineno = ifs->lino; rv->code = P('m','l'); rv->a1.p = t1; rv->a2.p = t2; INST3(rv).p = t3; } return rv; } CF_DECLS CF_KEYWORDS(FUNCTION, PRINT, PRINTN, UNSET, RETURN, ACCEPT, REJECT, ERROR, QUITBIRD, INT, BOOL, IP, PREFIX, PAIR, QUAD, EC, LC, SET, STRING, BGPMASK, BGPPATH, CLIST, ECLIST, LCLIST, IF, THEN, ELSE, CASE, TRUE, FALSE, RT, RO, UNKNOWN, GENERIC, FROM, GW, NET, MASK, PROTO, SOURCE, SCOPE, CAST, DEST, IFNAME, IFINDEX, PREFERENCE, LEN, DEFINED, ADD, DELETE, CONTAINS, RESET, PREPEND, FIRST, LAST, LAST_NONAGGREGATED, MATCH, ROA_CHECK, EMPTY, FILTER, WHERE, EVAL) %nonassoc THEN %nonassoc ELSE %type term block cmds cmds_int cmd function_body constant constructor print_one print_list var_list var_listn dynamic_attr static_attr function_call symbol bgp_path_expr %type filter filter_body where_filter %type type break_command ec_kind %type cnum %type pair_item ec_item lc_item set_item switch_item set_items switch_items switch_body %type fprefix_set %type set_atom switch_atom fprefix fprefix_s fipa %type decls declsn one_decl function_params %type bgp_path bgp_path_tail1 bgp_path_tail2 CF_GRAMMAR CF_ADDTO(conf, filter_def) filter_def: FILTER SYM { $2 = cf_define_symbol($2, SYM_FILTER, NULL); cf_push_scope( $2 ); } filter_body { $2->def = $4; $4->name = $2->name; DBG( "We have new filter defined (%s)\n", $2->name ); cf_pop_scope(); } ; CF_ADDTO(conf, filter_eval) filter_eval: EVAL term { f_eval_int($2); } ; type: INT { $$ = T_INT; } | BOOL { $$ = T_BOOL; } | IP { $$ = T_IP; } | PREFIX { $$ = T_PREFIX; } | PAIR { $$ = T_PAIR; } | QUAD { $$ = T_QUAD; } | EC { $$ = T_EC; } | LC { $$ = T_LC; } | STRING { $$ = T_STRING; } | BGPMASK { $$ = T_PATH_MASK; } | BGPPATH { $$ = T_PATH; } | CLIST { $$ = T_CLIST; } | ECLIST { $$ = T_ECLIST; } | LCLIST { $$ = T_LCLIST; } | type SET { switch ($1) { case T_INT: case T_PAIR: case T_QUAD: case T_EC: case T_LC: case T_IP: $$ = T_SET; break; case T_PREFIX: $$ = T_PREFIX_SET; break; default: cf_error( "You can't create sets of this type." ); } } ; one_decl: type SYM { struct f_val * val = cfg_alloc(sizeof(struct f_val)); val->type = T_VOID; $2 = cf_define_symbol($2, SYM_VARIABLE | $1, val); DBG( "New variable %s type %x\n", $2->name, $1 ); $2->aux2 = NULL; $$=$2; } ; /* Decls with ';' at the end */ decls: /* EMPTY */ { $$ = NULL; } | one_decl ';' decls { $$ = $1; $$->aux2 = $3; } ; /* Declarations that have no ';' at the end. */ declsn: one_decl { $$ = $1; } | one_decl ';' declsn { $$ = $1; $$->aux2 = $3; } ; filter_body: function_body { struct filter *f = cfg_alloc(sizeof(struct filter)); f->name = NULL; f->root = $1; $$ = f; } ; filter: SYM { if ($1->class != SYM_FILTER) cf_error("No such filter."); $$ = $1->def; } | filter_body ; where_filter: WHERE term { /* Construct 'IF term THEN ACCEPT; REJECT;' */ struct filter *f = cfg_alloc(sizeof(struct filter)); struct f_inst *i, *acc, *rej; acc = f_new_inst(); /* ACCEPT */ acc->code = P('p',','); acc->a1.p = NULL; acc->a2.i = F_ACCEPT; rej = f_new_inst(); /* REJECT */ rej->code = P('p',','); rej->a1.p = NULL; rej->a2.i = F_REJECT; i = f_new_inst(); /* IF */ i->code = '?'; i->a1.p = $2; i->a2.p = acc; i->next = rej; f->name = NULL; f->root = i; $$ = f; } ; function_params: '(' declsn ')' { DBG( "Have function parameters\n" ); $$=$2; } | '(' ')' { $$=NULL; } ; function_body: decls '{' cmds '}' { if ($1) { /* Prepend instruction to clear local variables */ $$ = f_new_inst(); $$->code = P('c','v'); $$->a1.p = $1; $$->next = $3; } else $$ = $3; } ; CF_ADDTO(conf, function_def) function_def: FUNCTION SYM { DBG( "Beginning of function %s\n", $2->name ); $2 = cf_define_symbol($2, SYM_FUNCTION, NULL); cf_push_scope($2); } function_params function_body { $2->def = $5; $2->aux2 = $4; DBG("Hmm, we've got one function here - %s\n", $2->name); cf_pop_scope(); } ; /* Programs */ /* Hack: $$ of cmds_int is the last node. $$->next of cmds_int is temporary used for the first node */ cmds: /* EMPTY */ { $$ = NULL; } | cmds_int { $$ = $1->next; $1->next = NULL; } ; cmds_int: cmd { $$ = $1; $1->next = $1; } | cmds_int cmd { $$ = $2; $2->next = $1->next ; $1->next = $2; } ; block: cmd { $$=$1; } | '{' cmds '}' { $$=$2; } ; /* * Complex types, their bison value is struct f_val */ fipa: IPA %prec PREFIX_DUMMY { $$.type = T_IP; $$.val.px.ip = $1; } ; /* * Set constants. They are also used in switch cases. We use separate * nonterminals for switch (set_atom/switch_atom, set_item/switch_item ...) * to elude a collision between symbol (in expr) in set_atom and symbol * as a function call in switch case cmds. */ set_atom: NUM { $$.type = T_INT; $$.val.i = $1; } | RTRID { $$.type = T_QUAD; $$.val.i = $1; } | fipa { $$ = $1; } | ENUM { $$.type = pair_a($1); $$.val.i = pair_b($1); } | '(' term ')' { $$ = f_eval($2, cfg_mem); if (!f_valid_set_type($$.type)) cf_error("Set-incompatible type"); } | SYM { if (!cf_symbol_is_constant($1)) cf_error("%s: constant expected", $1->name); if (!f_valid_set_type(SYM_TYPE($1))) cf_error("%s: set-incompatible type", $1->name); $$ = *(struct f_val *)($1->def); } ; switch_atom: NUM { $$.type = T_INT; $$.val.i = $1; } | '(' term ')' { $$.type = T_INT; $$.val.i = f_eval_int($2); } | RTRID { $$.type = T_QUAD; $$.val.i = $1; } | fipa { $$ = $1; } | ENUM { $$.type = pair_a($1); $$.val.i = pair_b($1); } ; cnum: term { $$ = f_eval_int($1); } pair_item: '(' cnum ',' cnum ')' { $$ = f_new_pair_item($2, $2, $4, $4); } | '(' cnum ',' cnum DDOT cnum ')' { $$ = f_new_pair_item($2, $2, $4, $6); } | '(' cnum ',' '*' ')' { $$ = f_new_pair_item($2, $2, 0, CC_ALL); } | '(' cnum DDOT cnum ',' cnum ')' { $$ = f_new_pair_set($2, $4, $6, $6); } | '(' cnum DDOT cnum ',' cnum DDOT cnum ')' { $$ = f_new_pair_set($2, $4, $6, $8); } | '(' cnum DDOT cnum ',' '*' ')' { $$ = f_new_pair_item($2, $4, 0, CC_ALL); } | '(' '*' ',' cnum ')' { $$ = f_new_pair_set(0, CC_ALL, $4, $4); } | '(' '*' ',' cnum DDOT cnum ')' { $$ = f_new_pair_set(0, CC_ALL, $4, $6); } | '(' '*' ',' '*' ')' { $$ = f_new_pair_item(0, CC_ALL, 0, CC_ALL); } | '(' cnum ',' cnum ')' DDOT '(' cnum ',' cnum ')' { $$ = f_new_pair_item($2, $8, $4, $10); } ; ec_kind: RT { $$ = EC_RT; } | RO { $$ = EC_RO; } | UNKNOWN NUM { $$ = $2; } | GENERIC { $$ = EC_GENERIC; } ; ec_item: '(' ec_kind ',' cnum ',' cnum ')' { $$ = f_new_ec_item($2, 0, $4, $6, $6); } | '(' ec_kind ',' cnum ',' cnum DDOT cnum ')' { $$ = f_new_ec_item($2, 0, $4, $6, $8); } | '(' ec_kind ',' cnum ',' '*' ')' { $$ = f_new_ec_item($2, 0, $4, 0, EC_ALL); } ; lc_item: '(' cnum ',' cnum ',' cnum ')' { $$ = f_new_lc_item($2, $2, $4, $4, $6, $6); } | '(' cnum ',' cnum ',' cnum DDOT cnum ')' { $$ = f_new_lc_item($2, $2, $4, $4, $6, $8); } | '(' cnum ',' cnum ',' '*' ')' { $$ = f_new_lc_item($2, $2, $4, $4, 0, LC_ALL); } | '(' cnum ',' cnum DDOT cnum ',' '*' ')' { $$ = f_new_lc_item($2, $2, $4, $6, 0, LC_ALL); } | '(' cnum ',' '*' ',' '*' ')' { $$ = f_new_lc_item($2, $2, 0, LC_ALL, 0, LC_ALL); } | '(' cnum DDOT cnum ',' '*' ',' '*' ')' { $$ = f_new_lc_item($2, $4, 0, LC_ALL, 0, LC_ALL); } | '(' '*' ',' '*' ',' '*' ')' { $$ = f_new_lc_item(0, LC_ALL, 0, LC_ALL, 0, LC_ALL); } | '(' cnum ',' cnum ',' cnum ')' DDOT '(' cnum ',' cnum ',' cnum ')' { $$ = f_new_lc_item($2, $10, $4, $12, $6, $14); } ; set_item: pair_item | ec_item | lc_item | set_atom { $$ = f_new_item($1, $1); } | set_atom DDOT set_atom { $$ = f_new_item($1, $3); } ; switch_item: pair_item | ec_item | lc_item | switch_atom { $$ = f_new_item($1, $1); } | switch_atom DDOT switch_atom { $$ = f_new_item($1, $3); } ; set_items: set_item | set_items ',' set_item { $$ = f_merge_items($1, $3); } ; switch_items: switch_item | switch_items ',' switch_item { $$ = f_merge_items($1, $3); } ; fprefix_s: IPA '/' NUM %prec '/' { if (($3 < 0) || ($3 > MAX_PREFIX_LENGTH) || !ip_is_prefix($1, $3)) cf_error("Invalid network prefix: %I/%d.", $1, $3); $$.type = T_PREFIX; $$.val.px.ip = $1; $$.val.px.len = $3; } ; fprefix: fprefix_s { $$ = $1; } | fprefix_s '+' { $$ = $1; $$.val.px.len |= LEN_PLUS; } | fprefix_s '-' { $$ = $1; $$.val.px.len |= LEN_MINUS; } | fprefix_s '{' NUM ',' NUM '}' { if (! ((0 <= $3) && ($3 <= $5) && ($5 <= MAX_PREFIX_LENGTH))) cf_error("Invalid prefix pattern range: {%d, %d}.", $3, $5); $$ = $1; $$.val.px.len |= LEN_RANGE | ($3 << 16) | ($5 << 8); } ; fprefix_set: fprefix { $$ = f_new_trie(cfg_mem, sizeof(struct f_trie_node)); trie_add_fprefix($$, &($1.val.px)); } | fprefix_set ',' fprefix { $$ = $1; trie_add_fprefix($$, &($3.val.px)); } ; switch_body: /* EMPTY */ { $$ = NULL; } | switch_body switch_items ':' cmds { /* Fill data fields */ struct f_tree *t; for (t = $2; t; t = t->left) t->data = $4; $$ = f_merge_items($1, $2); } | switch_body ELSECOL cmds { struct f_tree *t = f_new_tree(); t->from.type = t->to.type = T_VOID; t->right = t; t->data = $3; $$ = f_merge_items($1, t); } ; /* CONST '(' expr ')' { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_INT; $$->a2.i = $3; } */ bgp_path_expr: symbol { $$ = $1; } | '(' term ')' { $$ = $2; } ; bgp_path: PO bgp_path_tail1 PC { $$ = $2; } | '/' bgp_path_tail2 '/' { $$ = $2; } ; bgp_path_tail1: NUM bgp_path_tail1 { $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_ASN; $$->val = $1; } | NUM DDOT NUM bgp_path_tail1 { $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $4; $$->kind = PM_ASN_RANGE; $$->val = $1; $$->val2 = $3; } | '*' bgp_path_tail1 { $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_ASTERISK; } | '?' bgp_path_tail1 { $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_QUESTION; } | bgp_path_expr bgp_path_tail1 { $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_ASN_EXPR; $$->val = (uintptr_t) $1; } | { $$ = NULL; } ; bgp_path_tail2: NUM bgp_path_tail2 { $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_ASN; $$->val = $1; } | '?' bgp_path_tail2 { $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_ASTERISK; } | { $$ = NULL; } ; constant: NUM { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_INT; $$->a2.i = $1; } | TRUE { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_BOOL; $$->a2.i = 1; } | FALSE { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_BOOL; $$->a2.i = 0; } | TEXT { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_STRING; $$->a2.p = $1; } | fipa { NEW_F_VAL; $$ = f_new_inst(); $$->code = 'C'; $$->a1.p = val; *val = $1; } | fprefix_s {NEW_F_VAL; $$ = f_new_inst(); $$->code = 'C'; $$->a1.p = val; *val = $1; } | RTRID { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_QUAD; $$->a2.i = $1; } | '[' set_items ']' { DBG( "We've got a set here..." ); $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_SET; $$->a2.p = build_tree($2); DBG( "ook\n" ); } | '[' fprefix_set ']' { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_PREFIX_SET; $$->a2.p = $2; } | ENUM { $$ = f_new_inst(); $$->code = 'c'; $$->aux = $1 >> 16; $$->a2.i = $1 & 0xffff; } | bgp_path { NEW_F_VAL; $$ = f_new_inst(); $$->code = 'C'; val->type = T_PATH_MASK; val->val.path_mask = $1; $$->a1.p = val; } ; constructor: '(' term ',' term ')' { $$ = f_generate_dpair($2, $4); } | '(' ec_kind ',' term ',' term ')' { $$ = f_generate_ec($2, $4, $6); } | '(' term ',' term ',' term ')' { $$ = f_generate_lc($2, $4, $6); } ; /* * Maybe there are no dynamic attributes defined by protocols. * For such cases, we force the dynamic_attr list to contain * at least an invalid token, so it is syntantically correct. */ CF_ADDTO(dynamic_attr, INVALID_TOKEN { $$ = NULL; }) rtadot: /* EMPTY, we are not permitted RTA. prefix */ ; function_call: SYM '(' var_list ')' { struct symbol *sym; struct f_inst *inst = $3; if ($1->class != SYM_FUNCTION) cf_error("You can't call something which is not a function. Really."); DBG("You are calling function %s\n", $1->name); $$ = f_new_inst(); $$->code = P('c','a'); $$->a1.p = inst; $$->a2.p = $1->def; sym = $1->aux2; while (sym || inst) { if (!sym || !inst) cf_error("Wrong number of arguments for function %s.", $1->name); DBG( "You should pass parameter called %s\n", sym->name); inst->a1.p = sym; sym = sym->aux2; inst = inst->next; } } ; symbol: SYM { $$ = f_new_inst(); switch ($1->class & 0xff00) { case SYM_CONSTANT: $$->code = 'C'; break; case SYM_VARIABLE: $$->code = 'V'; break; default: cf_error("%s: variable expected.", $1->name); } $$->a1.p = $1->def; $$->a2.p = $1->name; } static_attr: FROM { $$ = f_new_inst(); $$->aux = T_IP; $$->a2.i = SA_FROM; $$->a1.i = 1; } | GW { $$ = f_new_inst(); $$->aux = T_IP; $$->a2.i = SA_GW; $$->a1.i = 1; } | NET { $$ = f_new_inst(); $$->aux = T_PREFIX; $$->a2.i = SA_NET; } | PROTO { $$ = f_new_inst(); $$->aux = T_STRING; $$->a2.i = SA_PROTO; } | SOURCE { $$ = f_new_inst(); $$->aux = T_ENUM_RTS; $$->a2.i = SA_SOURCE; } | SCOPE { $$ = f_new_inst(); $$->aux = T_ENUM_SCOPE; $$->a2.i = SA_SCOPE; $$->a1.i = 1; } | CAST { $$ = f_new_inst(); $$->aux = T_ENUM_RTC; $$->a2.i = SA_CAST; } | DEST { $$ = f_new_inst(); $$->aux = T_ENUM_RTD; $$->a2.i = SA_DEST; $$->a1.i = 1; } | IFNAME { $$ = f_new_inst(); $$->aux = T_STRING; $$->a2.i = SA_IFNAME; } | IFINDEX { $$ = f_new_inst(); $$->aux = T_INT; $$->a2.i = SA_IFINDEX; } ; term: '(' term ')' { $$ = $2; } | term '+' term { $$ = f_new_inst(); $$->code = '+'; $$->a1.p = $1; $$->a2.p = $3; } | term '-' term { $$ = f_new_inst(); $$->code = '-'; $$->a1.p = $1; $$->a2.p = $3; } | term '*' term { $$ = f_new_inst(); $$->code = '*'; $$->a1.p = $1; $$->a2.p = $3; } | term '/' term { $$ = f_new_inst(); $$->code = '/'; $$->a1.p = $1; $$->a2.p = $3; } | term AND term { $$ = f_new_inst(); $$->code = '&'; $$->a1.p = $1; $$->a2.p = $3; } | term OR term { $$ = f_new_inst(); $$->code = '|'; $$->a1.p = $1; $$->a2.p = $3; } | term '=' term { $$ = f_new_inst(); $$->code = P('=','='); $$->a1.p = $1; $$->a2.p = $3; } | term NEQ term { $$ = f_new_inst(); $$->code = P('!','='); $$->a1.p = $1; $$->a2.p = $3; } | term '<' term { $$ = f_new_inst(); $$->code = '<'; $$->a1.p = $1; $$->a2.p = $3; } | term LEQ term { $$ = f_new_inst(); $$->code = P('<','='); $$->a1.p = $1; $$->a2.p = $3; } | term '>' term { $$ = f_new_inst(); $$->code = '<'; $$->a1.p = $3; $$->a2.p = $1; } | term GEQ term { $$ = f_new_inst(); $$->code = P('<','='); $$->a1.p = $3; $$->a2.p = $1; } | term '~' term { $$ = f_new_inst(); $$->code = '~'; $$->a1.p = $1; $$->a2.p = $3; } | term NMA term { $$ = f_new_inst(); $$->code = P('!','~'); $$->a1.p = $1; $$->a2.p = $3; } | '!' term { $$ = f_new_inst(); $$->code = '!'; $$->a1.p = $2; } | DEFINED '(' term ')' { $$ = f_new_inst(); $$->code = P('d','e'); $$->a1.p = $3; } | symbol { $$ = $1; } | constant { $$ = $1; } | constructor { $$ = $1; } | PREFERENCE { $$ = f_new_inst(); $$->code = 'P'; } | rtadot static_attr { $$ = $2; $$->code = 'a'; } | rtadot dynamic_attr { $$ = $2; $$->code = P('e','a'); } | term '.' IP { $$ = f_new_inst(); $$->code = P('c','p'); $$->a1.p = $1; $$->aux = T_IP; } | term '.' LEN { $$ = f_new_inst(); $$->code = 'L'; $$->a1.p = $1; } | term '.' MASK '(' term ')' { $$ = f_new_inst(); $$->code = P('i','M'); $$->a1.p = $1; $$->a2.p = $5; } | term '.' FIRST { $$ = f_new_inst(); $$->code = P('a','f'); $$->a1.p = $1; } | term '.' LAST { $$ = f_new_inst(); $$->code = P('a','l'); $$->a1.p = $1; } | term '.' LAST_NONAGGREGATED { $$ = f_new_inst(); $$->code = P('a','L'); $$->a1.p = $1; } /* Communities */ /* This causes one shift/reduce conflict | rtadot dynamic_attr '.' ADD '(' term ')' { } | rtadot dynamic_attr '.' DELETE '(' term ')' { } | rtadot dynamic_attr '.' CONTAINS '(' term ')' { } | rtadot dynamic_attr '.' RESET{ } */ | '+' EMPTY '+' { $$ = f_new_inst(); $$->code = 'E'; $$->aux = T_PATH; } | '-' EMPTY '-' { $$ = f_new_inst(); $$->code = 'E'; $$->aux = T_CLIST; } | '-' '-' EMPTY '-' '-' { $$ = f_new_inst(); $$->code = 'E'; $$->aux = T_ECLIST; } | '-' '-' '-' EMPTY '-' '-' '-' { $$ = f_new_inst(); $$->code = 'E'; $$->aux = T_LCLIST; } | PREPEND '(' term ',' term ')' { $$ = f_new_inst(); $$->code = P('A','p'); $$->a1.p = $3; $$->a2.p = $5; } | ADD '(' term ',' term ')' { $$ = f_new_inst(); $$->code = P('C','a'); $$->a1.p = $3; $$->a2.p = $5; $$->aux = 'a'; } | DELETE '(' term ',' term ')' { $$ = f_new_inst(); $$->code = P('C','a'); $$->a1.p = $3; $$->a2.p = $5; $$->aux = 'd'; } | FILTER '(' term ',' term ')' { $$ = f_new_inst(); $$->code = P('C','a'); $$->a1.p = $3; $$->a2.p = $5; $$->aux = 'f'; } | ROA_CHECK '(' SYM ')' { $$ = f_generate_roa_check($3, NULL, NULL); } | ROA_CHECK '(' SYM ',' term ',' term ')' { $$ = f_generate_roa_check($3, $5, $7); } /* | term '.' LEN { $$->code = P('P','l'); } */ /* function_call is inlined here */ | SYM '(' var_list ')' { struct symbol *sym; struct f_inst *inst = $3; if ($1->class != SYM_FUNCTION) cf_error("You can't call something which is not a function. Really."); DBG("You are calling function %s\n", $1->name); $$ = f_new_inst(); $$->code = P('c','a'); $$->a1.p = inst; $$->a2.p = $1->def; sym = $1->aux2; while (sym || inst) { if (!sym || !inst) cf_error("Wrong number of arguments for function %s.", $1->name); DBG( "You should pass parameter called %s\n", sym->name); inst->a1.p = sym; sym = sym->aux2; inst = inst->next; } } ; break_command: QUITBIRD { $$ = F_QUITBIRD; } | ACCEPT { $$ = F_ACCEPT; } | REJECT { $$ = F_REJECT; } | ERROR { $$ = F_ERROR; } | PRINT { $$ = F_NOP; } | PRINTN { $$ = F_NONL; } ; print_one: term { $$ = f_new_inst(); $$->code = 'p'; $$->a1.p = $1; $$->a2.p = NULL; } ; print_list: /* EMPTY */ { $$ = NULL; } | print_one { $$ = $1; } | print_one ',' print_list { if ($1) { $1->next = $3; $$ = $1; } else $$ = $3; } ; var_listn: term { $$ = f_new_inst(); $$->code = 's'; $$->a1.p = NULL; $$->a2.p = $1; $$->next = NULL; } | term ',' var_listn { $$ = f_new_inst(); $$->code = 's'; $$->a1.p = NULL; $$->a2.p = $1; $$->next = $3; } ; var_list: /* EMPTY */ { $$ = NULL; } | var_listn { $$ = $1; } ; cmd: IF term THEN block { $$ = f_new_inst(); $$->code = '?'; $$->a1.p = $2; $$->a2.p = $4; } | IF term THEN block ELSE block { struct f_inst *i = f_new_inst(); i->code = '?'; i->a1.p = $2; i->a2.p = $4; $$ = f_new_inst(); $$->code = '?'; $$->a1.p = i; $$->a2.p = $6; } | SYM '=' term ';' { $$ = f_new_inst(); DBG( "Ook, we'll set value\n" ); if (($1->class & ~T_MASK) != SYM_VARIABLE) cf_error( "You may set only variables." ); $$->code = 's'; $$->a1.p = $1; $$->a2.p = $3; } | RETURN term ';' { $$ = f_new_inst(); DBG( "Ook, we'll return the value\n" ); $$->code = 'r'; $$->a1.p = $2; } | rtadot dynamic_attr '=' term ';' { $$ = $2; $$->code = P('e','S'); $$->a1.p = $4; } | rtadot static_attr '=' term ';' { $$ = $2; if (!$$->a1.i) cf_error( "This static attribute is read-only."); $$->code = P('a','S'); $$->a1.p = $4; } | PREFERENCE '=' term ';' { $$ = f_new_inst(); $$->code = P('P','S'); $$->a1.p = $3; } | UNSET '(' rtadot dynamic_attr ')' ';' { $$ = $4; $$->aux = EAF_TYPE_UNDEF | EAF_TEMP; $$->code = P('e','S'); $$->a1.p = NULL; } | break_command print_list ';' { $$ = f_new_inst(); $$->code = P('p',','); $$->a1.p = $2; $$->a2.i = $1; } | function_call ';' { $$ = $1; } | CASE term '{' switch_body '}' { $$ = f_new_inst(); $$->code = P('S','W'); $$->a1.p = $2; $$->a2.p = build_tree( $4 ); } | rtadot dynamic_attr '.' EMPTY ';' { $$ = f_generate_empty($2); } | rtadot dynamic_attr '.' PREPEND '(' term ')' ';' { $$ = f_generate_complex( P('A','p'), 'x', $2, $6 ); } | rtadot dynamic_attr '.' ADD '(' term ')' ';' { $$ = f_generate_complex( P('C','a'), 'a', $2, $6 ); } | rtadot dynamic_attr '.' DELETE '(' term ')' ';' { $$ = f_generate_complex( P('C','a'), 'd', $2, $6 ); } | rtadot dynamic_attr '.' FILTER '(' term ')' ';' { $$ = f_generate_complex( P('C','a'), 'f', $2, $6 ); } ; CF_END bird-1.6.3/filter/filter.h0000644000103200001440000001263513027054563014364 0ustar feelausers/* * BIRD Internet Routing Daemon -- Filters * * (c) 1999 Pavel Machek * * Can be freely distributed and used under the terms of the GNU GPL. */ #ifndef _BIRD_FILT_H_ #define _BIRD_FILT_H_ #include "lib/resource.h" #include "lib/ip.h" #include "nest/route.h" #include "nest/attrs.h" struct f_inst { /* Instruction */ struct f_inst *next; /* Structure is 16 bytes, anyway */ u16 code; u16 aux; union { int i; void *p; } a1; union { int i; void *p; } a2; int lineno; }; #define arg1 a1.p #define arg2 a2.p /* Not enough fields in f_inst for three args used by roa_check() */ struct f_inst_roa_check { struct f_inst i; struct roa_table_config *rtc; }; struct f_inst3 { struct f_inst i; union { int i; void *p; } a3; }; #define INST3(x) (((struct f_inst3 *) x)->a3) struct f_prefix { ip_addr ip; int len; #define LEN_MASK 0xff #define LEN_PLUS 0x1000000 #define LEN_MINUS 0x2000000 #define LEN_RANGE 0x4000000 /* If range then prefix must be in range (len >> 16 & 0xff, len >> 8 & 0xff) */ }; struct f_val { int type; union { uint i; u64 ec; lcomm lc; /* ip_addr ip; Folded into prefix */ struct f_prefix px; char *s; struct f_tree *t; struct f_trie *ti; struct adata *ad; struct f_path_mask *path_mask; } val; }; struct filter { char *name; struct f_inst *root; }; struct f_inst *f_new_inst(void); struct f_inst *f_new_dynamic_attr(int type, int f_type, int code); /* Type as core knows it, type as filters know it, and code of dynamic attribute */ struct f_tree *f_new_tree(void); struct f_inst *f_generate_complex(int operation, int operation_aux, struct f_inst *dyn, struct f_inst *argument); struct f_inst *f_generate_roa_check(struct symbol *sym, struct f_inst *prefix, struct f_inst *asn); struct f_tree *build_tree(struct f_tree *); struct f_tree *find_tree(struct f_tree *t, struct f_val val); int same_tree(struct f_tree *t1, struct f_tree *t2); void tree_format(struct f_tree *t, buffer *buf); struct f_trie *f_new_trie(linpool *lp, uint node_size); void *trie_add_prefix(struct f_trie *t, ip_addr px, int plen, int l, int h); int trie_match_prefix(struct f_trie *t, ip_addr px, int plen); int trie_same(struct f_trie *t1, struct f_trie *t2); void trie_format(struct f_trie *t, buffer *buf); void fprefix_get_bounds(struct f_prefix *px, int *l, int *h); static inline void trie_add_fprefix(struct f_trie *t, struct f_prefix *px) { int l, h; fprefix_get_bounds(px, &l, &h); trie_add_prefix(t, px->ip, px->len & LEN_MASK, l, h); } static inline int trie_match_fprefix(struct f_trie *t, struct f_prefix *px) { return trie_match_prefix(t, px->ip, px->len & LEN_MASK); } struct ea_list; struct rte; int f_run(struct filter *filter, struct rte **rte, struct ea_list **tmp_attrs, struct linpool *tmp_pool, int flags); struct f_val f_eval_rte(struct f_inst *expr, struct rte **rte, struct linpool *tmp_pool); struct f_val f_eval(struct f_inst *expr, struct linpool *tmp_pool); uint f_eval_int(struct f_inst *expr); u32 f_eval_asn(struct f_inst *expr); char *filter_name(struct filter *filter); int filter_same(struct filter *new, struct filter *old); int i_same(struct f_inst *f1, struct f_inst *f2); int val_compare(struct f_val v1, struct f_val v2); int val_same(struct f_val v1, struct f_val v2); void val_format(struct f_val v, buffer *buf); #define F_NOP 0 #define F_NONL 1 #define F_ACCEPT 2 /* Need to preserve ordering: accepts < rejects! */ #define F_REJECT 3 #define F_ERROR 4 #define F_QUITBIRD 5 #define FILTER_ACCEPT NULL #define FILTER_REJECT ((void *) 1) /* Type numbers must be in 0..0xff range */ #define T_MASK 0xff /* Internal types */ /* Do not use type of zero, that way we'll see errors easier. */ #define T_VOID 1 /* User visible types, which fit in int */ #define T_INT 0x10 #define T_BOOL 0x11 #define T_PAIR 0x12 /* Notice that pair is stored as integer: first << 16 | second */ #define T_QUAD 0x13 /* Put enumerational types in 0x30..0x3f range */ #define T_ENUM_LO 0x30 #define T_ENUM_HI 0x3f #define T_ENUM_RTS 0x30 #define T_ENUM_BGP_ORIGIN 0x31 #define T_ENUM_SCOPE 0x32 #define T_ENUM_RTC 0x33 #define T_ENUM_RTD 0x34 #define T_ENUM_ROA 0x35 /* new enums go here */ #define T_ENUM_EMPTY 0x3f /* Special hack for atomic_aggr */ #define T_ENUM T_ENUM_LO ... T_ENUM_HI /* Bigger ones */ #define T_IP 0x20 #define T_PREFIX 0x21 #define T_STRING 0x22 #define T_PATH_MASK 0x23 /* mask for BGP path */ #define T_PATH 0x24 /* BGP path */ #define T_CLIST 0x25 /* Community list */ #define T_EC 0x26 /* Extended community value, u64 */ #define T_ECLIST 0x27 /* Extended community list */ #define T_LC 0x28 /* Large community value, lcomm */ #define T_LCLIST 0x29 /* Large community list */ #define T_RETURN 0x40 #define T_SET 0x80 #define T_PREFIX_SET 0x81 #define SA_FROM 1 #define SA_GW 2 #define SA_NET 3 #define SA_PROTO 4 #define SA_SOURCE 5 #define SA_SCOPE 6 #define SA_CAST 7 #define SA_DEST 8 #define SA_IFNAME 9 #define SA_IFINDEX 10 struct f_tree { struct f_tree *left, *right; struct f_val from, to; void *data; }; struct f_trie_node { ip_addr addr, mask, accept; int plen; struct f_trie_node *c[2]; }; struct f_trie { linpool *lp; int zero; uint node_size; struct f_trie_node root[0]; /* Root trie node follows */ }; #define NEW_F_VAL struct f_val * val; val = cfg_alloc(sizeof(struct f_val)); #define FF_FORCE_TMPATTR 1 /* Force all attributes to be temporary */ #endif bird-1.6.3/filter/test6.conf0000644000103200001440000001166313027054563014642 0ustar feelausers/* * This is an example configuration file. * FIXME: add all examples from docs here. */ # Yet another comment router id 62.168.0.1; define xyzzy = (120+10); function callme(int arg1; int arg2) int local1; int local2; int i; { printn "Function callme called arguments ", arg1, " and ", arg2, ":" ; i = arg2; case arg1 { 2: print "dva"; print "jeste jednou dva"; 3 .. 5: print "tri az pet"; else: print "neco jineho"; } } function fifteen() { print "fifteen called"; return 15; } function paths() bgpmask pm1; bgpmask pm2; bgppath p2; clist l; { pm1 = / 4 3 2 1 /; pm2 = [= 4 3 2 1 =]; print "Testing path masks: ", pm1, " ", pm2; p2 = prepend( + empty +, 1 ); p2 = prepend( p2, 2 ); p2 = prepend( p2, 3 ); p2 = prepend( p2, 4 ); print "Testing paths: ", p2; print "Should be true: ", p2 ~ pm1, " ", p2 ~ pm2; print "4 = ", p2.len; p2 = prepend( p2, 5 ); print "Should be false: ", p2 ~ pm1, " ", p2 ~ pm2; print "Should be true: ", p2 ~ / ? 4 3 2 1 /, " ", p2, " ", / ? 4 3 2 1 /; print "Should be true: ", p2 ~ [= * 4 3 * 1 =], " ", p2, " ", [= * 4 3 * 1 =]; print "5 = ", p2.len; pm1 = [= 1 2 * 3 4 5 =]; p2 = prepend( + empty +, 5 ); p2 = prepend( p2, 4 ); p2 = prepend( p2, 3 ); p2 = prepend( p2, 3 ); p2 = prepend( p2, 2 ); p2 = prepend( p2, 1 ); print "Should be true: ", p2 ~ pm1, " ", p2, " ", pm1; l = - empty -; l = add( l, (1,2) ); l = add( l, (2,3) ); print "Community list (1,2) (2,3) ", l; print "Should be true: ", (2,3) ~ l; l = delete( l, (2,3) ); print "Community list (1,2) ", l; print "Should be false: ", (2,3) ~ l; } function bla() { print "fifteen called"; return 15; } define four=4; function test_pxset(prefix set pxs) { print " must be true: ", 1000::/8 ~ pxs, ",", 1000::/10 ~ pxs, ",", 1000::/12 ~ pxs, ",", 2000::/24 ~ pxs, ",", 2000:4000::/24 ~ pxs, ",", 2000::/26 ~ pxs, ",", 2000:8000::/26 ~ pxs, ",", 2000::/28 ~ pxs, ",", 2000:FFF0::/28 ~ pxs; print " must be false: ", 1000::/7 ~ pxs, ",", 1000::/13 ~ pxs, ",", 1000::/16 ~ pxs, ",", 2000::/16 ~ pxs, ",", 2000::/23 ~ pxs, ",", 2000::/29 ~ pxs, ",", 1100::/10 ~ pxs, ",", 2010::/26 ~ pxs; } function __startup() int i; bool b; prefix px; ip p; pair pp; int set is; prefix set pxs; string s; { print "Testing filter language:"; i = four; i = 12*100 + 60/2 + i; i = ( i + 0 ); print " arithmetics: 1234 = ", i; printn " if statements "; print "what happens here?"; printn "."; if (i = 4) then { print "*** FAIL: if 0"; quitbird; } else printn "."; # if !(i = 3) then { print "*** FAIL: if 0"; quitbird; } else printn "."; if 1234 = i then printn "."; else { print "*** FAIL: if 1 else"; } # if 1 <= 1 then printn "."; else { print "*** FAIL: test 3"; } if 1234 < 1234 then { print "*** FAIL: test 4"; quitbird; } else print "ok"; is = [ 2, 3, 4, 7..11 ]; print " must be true: ", 1180::/16 ~ [ 1100::/8{ 15 , 17 } ]; print " data types; must be true: ", 12::34 = 12::34, ",", 1 ~ [1,2,3], ",", 5 ~ [1..20], ",", 10 ~ is, ",", 2 ~ [ 1, 2, 3 ], ",", 5 ~ [ 4 .. 7 ], ",", 12::34 ~ [ 12::33..12::35 ], ",", 1020::34 ~ 1000::/8, ",", 1000::/8 ~ 1000::/8, ",", 1000::/8 ~ [ 1000::/8+ ]; print " must be true: ", true && true, ",", true || false; # print " must be true: ", defined(1), ",", defined(1.2.3.4), ",", 1 != 2, ",", 1 <= 2; print " data types: must be false: ", 1 ~ [ 2, 3, 4 ], ",", 5 ~ is, ",", 12::34 ~ [ 12::33, 12::35 ], ",", (1,2) > (2,2), ",", (1,1) > (1,1), ",", 1000::/9 ~ [ 1000::/8- ], ",", 1000::/17 ~ [ 1000::/8{ 15 , 16 } ], ",", true && false; px = 1020::/18; print "Testing prefixes: 1020::/18 = ", px; p = 1234:5678::; print "Testing mask : 1200:: = ", p.mask(8); pp = (1, 2); print "Testing pairs: (1,2) = ", (1,2), " = ", pp; print "Testing enums: ", RTS_DUMMY, " ", RTS_STATIC; s = "Hello"; print "Testing string: ", s, " true: ", s ~ "Hell*", " false: ", s ~ "ell*"; b = true; print "Testing bool: ", b, ", ", !b; pxs = [ 1102::/16, 1104::/16+]; print "Testing prefix sets: "; print pxs; print " must be true: ", 1102::/16 ~ pxs, ",", 1104::/16 ~ pxs, ",", 1104::/18 ~ pxs, ",", 1104::/32 ~ pxs; print " must be false: ", 1101::/16 ~ pxs, ",", 1103::/16 ~ pxs, ",", 1102::/15 ~ pxs, ",", 1102::/17 ~ pxs, ",", 1102::/32 ~ pxs, ",", 1104::/15 ~ pxs; test_pxset([ 1000::/16{8,12}, 2000::/16{24,28} ]); print "What will this do? ", [ 1, 2, 1, 1, 1, 3, 4, 1, 1, 1, 5 ]; print "Testing functions..."; # callme ( 1, 2 ); callme ( 2, 2 ); callme ( 2, 2 ); callme ( 3, 2 ); callme ( 4, 2 ); callme ( 7, 2 ); i = fifteen(); print "Testing function calls: 15 = ", i; paths(); print "done"; quitbird; # print "*** FAIL: this is unreachable"; } filter testf int j; { print "Heya, filtering route to ", net.ip, " prefixlen ", net.len, " source ", source; print "This route was from ", from; j = 7; j = 17; if rip_metric > 15 then { reject "RIP Metric is more than infinity"; } rip_metric = 14; unset(rip_metric); accept "ok I take that"; } eval __startup();bird-1.6.3/filter/f-util.c0000644000103200001440000000355313027054563014271 0ustar feelausers/* * Filters: utility functions * * Copyright 1998 Pavel Machek * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "nest/bird.h" #include "conf/conf.h" #include "filter/filter.h" #define P(a,b) ((a<<8) | b) struct f_inst * f_new_inst(void) { struct f_inst * ret; ret = cfg_alloc(sizeof(struct f_inst)); ret->code = ret->aux = 0; ret->arg1 = ret->arg2 = ret->next = NULL; ret->lineno = ifs->lino; return ret; } struct f_inst * f_new_dynamic_attr(int type, int f_type UNUSED, int code) { /* FIXME: Remove the f_type parameter? */ struct f_inst *f = f_new_inst(); f->aux = type; f->a2.i = code; return f; } /* * Generate set_dynamic( operation( get_dynamic(), argument ) ) */ struct f_inst * f_generate_complex(int operation, int operation_aux, struct f_inst *dyn, struct f_inst *argument) { struct f_inst *set_dyn = f_new_inst(), *oper = f_new_inst(), *get_dyn = dyn; *set_dyn = *get_dyn; get_dyn->code = P('e','a'); oper->code = operation; oper->aux = operation_aux; oper->a1.p = get_dyn; oper->a2.p = argument; set_dyn->code = P('e','S'); set_dyn->a1.p = oper; return set_dyn; } struct f_inst * f_generate_roa_check(struct symbol *sym, struct f_inst *prefix, struct f_inst *asn) { struct f_inst_roa_check *ret = cfg_allocz(sizeof(struct f_inst_roa_check)); ret->i.code = P('R','C'); ret->i.lineno = ifs->lino; ret->i.arg1 = prefix; ret->i.arg2 = asn; /* prefix == NULL <-> asn == NULL */ if ((sym->class != SYM_ROA) || ! sym->def) cf_error("%s is not a ROA table", sym->name); ret->rtc = sym->def; return &ret->i; } char * filter_name(struct filter *filter) { if (!filter) return "ACCEPT"; else if (filter == FILTER_REJECT) return "REJECT"; else if (!filter->name) return "(unnamed)"; else return filter->name; } bird-1.6.3/filter/Makefile0000644000103200001440000000012613027054563014356 0ustar feelauserssource=f-util.c filter.c tree.c trie.c root-rel=../ dir-name=filter include ../Rules bird-1.6.3/filter/filter.c0000644000103200001440000013062713027054563014361 0ustar feelausers/* * Filters: utility functions * * Copyright 1998 Pavel Machek * * Can be freely distributed and used under the terms of the GNU GPL. * */ /** * DOC: Filters * * You can find sources of the filter language in |filter/| * directory. File |filter/config.Y| contains filter grammar and basically translates * the source from user into a tree of &f_inst structures. These trees are * later interpreted using code in |filter/filter.c|. * * A filter is represented by a tree of &f_inst structures, one structure per * "instruction". Each &f_inst contains @code, @aux value which is * usually the data type this instruction operates on and two generic * arguments (@a1, @a2). Some instructions contain pointer(s) to other * instructions in their (@a1, @a2) fields. * * Filters use a &f_val structure for their data. Each &f_val * contains type and value (types are constants prefixed with %T_). Few * of the types are special; %T_RETURN can be or-ed with a type to indicate * that return from a function or from the whole filter should be * forced. Important thing about &f_val's is that they may be copied * with a simple |=|. That's fine for all currently defined types: strings * are read-only (and therefore okay), paths are copied for each * operation (okay too). */ #undef LOCAL_DEBUG #include "nest/bird.h" #include "lib/lists.h" #include "lib/resource.h" #include "lib/socket.h" #include "lib/string.h" #include "lib/unaligned.h" #include "nest/route.h" #include "nest/protocol.h" #include "nest/iface.h" #include "nest/attrs.h" #include "conf/conf.h" #include "filter/filter.h" #define P(a,b) ((a<<8) | b) #define CMP_ERROR 999 static struct adata * adata_empty(struct linpool *pool, int l) { struct adata *res = lp_alloc(pool, sizeof(struct adata) + l); res->length = l; return res; } static void pm_format(struct f_path_mask *p, buffer *buf) { buffer_puts(buf, "[= "); while (p) { switch(p->kind) { case PM_ASN: buffer_print(buf, "%u ", p->val); break; case PM_QUESTION: buffer_puts(buf, "? "); break; case PM_ASTERISK: buffer_puts(buf, "* "); break; case PM_ASN_RANGE: buffer_print(buf, "%u..%u ", p->val, p->val2); break; case PM_ASN_EXPR: buffer_print(buf, "%u ", f_eval_asn((struct f_inst *) p->val)); break; } p = p->next; } buffer_puts(buf, "=]"); } static inline int uint_cmp(uint i1, uint i2) { return (int)(i1 > i2) - (int)(i1 < i2); } static inline int u64_cmp(u64 i1, u64 i2) { return (int)(i1 > i2) - (int)(i1 < i2); } static inline int lcomm_cmp(lcomm v1, lcomm v2) { if (v1.asn != v2.asn) return (v1.asn > v2.asn) ? 1 : -1; if (v1.ldp1 != v2.ldp1) return (v1.ldp1 > v2.ldp1) ? 1 : -1; if (v1.ldp2 != v2.ldp2) return (v1.ldp2 > v2.ldp2) ? 1 : -1; return 0; } /** * val_compare - compare two values * @v1: first value * @v2: second value * * Compares two values and returns -1, 0, 1 on <, =, > or CMP_ERROR on * error. Tree module relies on this giving consistent results so * that it can be used for building balanced trees. */ int val_compare(struct f_val v1, struct f_val v2) { int rc; if (v1.type != v2.type) { if (v1.type == T_VOID) /* Hack for else */ return -1; if (v2.type == T_VOID) return 1; #ifndef IPV6 /* IP->Quad implicit conversion */ if ((v1.type == T_QUAD) && (v2.type == T_IP)) return uint_cmp(v1.val.i, ipa_to_u32(v2.val.px.ip)); if ((v1.type == T_IP) && (v2.type == T_QUAD)) return uint_cmp(ipa_to_u32(v1.val.px.ip), v2.val.i); #endif debug( "Types do not match in val_compare\n" ); return CMP_ERROR; } switch (v1.type) { case T_VOID: return 0; case T_ENUM: case T_INT: case T_BOOL: case T_PAIR: case T_QUAD: return uint_cmp(v1.val.i, v2.val.i); case T_EC: return u64_cmp(v1.val.ec, v2.val.ec); case T_LC: return lcomm_cmp(v1.val.lc, v2.val.lc); case T_IP: return ipa_compare(v1.val.px.ip, v2.val.px.ip); case T_PREFIX: if (rc = ipa_compare(v1.val.px.ip, v2.val.px.ip)) return rc; return uint_cmp(v1.val.px.len, v2.val.px.len); case T_STRING: return strcmp(v1.val.s, v2.val.s); default: return CMP_ERROR; } } static int pm_same(struct f_path_mask *m1, struct f_path_mask *m2) { while (m1 && m2) { if (m1->kind != m2->kind) return 0; if (m1->kind == PM_ASN_EXPR) { if (!i_same((struct f_inst *) m1->val, (struct f_inst *) m2->val)) return 0; } else { if ((m1->val != m2->val) || (m1->val2 != m2->val2)) return 0; } m1 = m1->next; m2 = m2->next; } return !m1 && !m2; } /** * val_same - compare two values * @v1: first value * @v2: second value * * Compares two values and returns 1 if they are same and 0 if not. * Comparison of values of different types is valid and returns 0. */ int val_same(struct f_val v1, struct f_val v2) { int rc; rc = val_compare(v1, v2); if (rc != CMP_ERROR) return !rc; if (v1.type != v2.type) return 0; switch (v1.type) { case T_PATH_MASK: return pm_same(v1.val.path_mask, v2.val.path_mask); case T_PATH: case T_CLIST: case T_ECLIST: case T_LCLIST: return adata_same(v1.val.ad, v2.val.ad); case T_SET: return same_tree(v1.val.t, v2.val.t); case T_PREFIX_SET: return trie_same(v1.val.ti, v2.val.ti); default: bug("Invalid type in val_same(): %x", v1.type); } } void fprefix_get_bounds(struct f_prefix *px, int *l, int *h) { *l = *h = px->len & LEN_MASK; if (px->len & LEN_MINUS) *l = 0; else if (px->len & LEN_PLUS) *h = MAX_PREFIX_LENGTH; else if (px->len & LEN_RANGE) { *l = 0xff & (px->len >> 16); *h = 0xff & (px->len >> 8); } } static int clist_set_type(struct f_tree *set, struct f_val *v) { switch (set->from.type) { case T_PAIR: v->type = T_PAIR; return 1; case T_QUAD: #ifndef IPV6 case T_IP: #endif v->type = T_QUAD; return 1; break; default: v->type = T_VOID; return 0; } } static inline int eclist_set_type(struct f_tree *set) { return set->from.type == T_EC; } static inline int lclist_set_type(struct f_tree *set) { return set->from.type == T_LC; } static int clist_match_set(struct adata *clist, struct f_tree *set) { if (!clist) return 0; struct f_val v; if (!clist_set_type(set, &v)) return CMP_ERROR; u32 *l = (u32 *) clist->data; u32 *end = l + clist->length/4; while (l < end) { v.val.i = *l++; if (find_tree(set, v)) return 1; } return 0; } static int eclist_match_set(struct adata *list, struct f_tree *set) { if (!list) return 0; if (!eclist_set_type(set)) return CMP_ERROR; struct f_val v; u32 *l = int_set_get_data(list); int len = int_set_get_size(list); int i; v.type = T_EC; for (i = 0; i < len; i += 2) { v.val.ec = ec_get(l, i); if (find_tree(set, v)) return 1; } return 0; } static int lclist_match_set(struct adata *list, struct f_tree *set) { if (!list) return 0; if (!lclist_set_type(set)) return CMP_ERROR; struct f_val v; u32 *l = int_set_get_data(list); int len = int_set_get_size(list); int i; v.type = T_LC; for (i = 0; i < len; i += 3) { v.val.lc = lc_get(l, i); if (find_tree(set, v)) return 1; } return 0; } static struct adata * clist_filter(struct linpool *pool, struct adata *list, struct f_val set, int pos) { if (!list) return NULL; int tree = (set.type == T_SET); /* 1 -> set is T_SET, 0 -> set is T_CLIST */ struct f_val v; if (tree) clist_set_type(set.val.t, &v); else v.type = T_PAIR; int len = int_set_get_size(list); u32 *l = int_set_get_data(list); u32 tmp[len]; u32 *k = tmp; u32 *end = l + len; while (l < end) { v.val.i = *l++; /* pos && member(val, set) || !pos && !member(val, set), member() depends on tree */ if ((tree ? !!find_tree(set.val.t, v) : int_set_contains(set.val.ad, v.val.i)) == pos) *k++ = v.val.i; } uint nl = (k - tmp) * sizeof(u32); if (nl == list->length) return list; struct adata *res = adata_empty(pool, nl); memcpy(res->data, tmp, nl); return res; } static struct adata * eclist_filter(struct linpool *pool, struct adata *list, struct f_val set, int pos) { if (!list) return NULL; int tree = (set.type == T_SET); /* 1 -> set is T_SET, 0 -> set is T_CLIST */ struct f_val v; int len = int_set_get_size(list); u32 *l = int_set_get_data(list); u32 tmp[len]; u32 *k = tmp; int i; v.type = T_EC; for (i = 0; i < len; i += 2) { v.val.ec = ec_get(l, i); /* pos && member(val, set) || !pos && !member(val, set), member() depends on tree */ if ((tree ? !!find_tree(set.val.t, v) : ec_set_contains(set.val.ad, v.val.ec)) == pos) { *k++ = l[i]; *k++ = l[i+1]; } } uint nl = (k - tmp) * sizeof(u32); if (nl == list->length) return list; struct adata *res = adata_empty(pool, nl); memcpy(res->data, tmp, nl); return res; } static struct adata * lclist_filter(struct linpool *pool, struct adata *list, struct f_val set, int pos) { if (!list) return NULL; int tree = (set.type == T_SET); /* 1 -> set is T_SET, 0 -> set is T_CLIST */ struct f_val v; int len = int_set_get_size(list); u32 *l = int_set_get_data(list); u32 tmp[len]; u32 *k = tmp; int i; v.type = T_LC; for (i = 0; i < len; i += 3) { v.val.lc = lc_get(l, i); /* pos && member(val, set) || !pos && !member(val, set), member() depends on tree */ if ((tree ? !!find_tree(set.val.t, v) : lc_set_contains(set.val.ad, v.val.lc)) == pos) k = lc_copy(k, l+i); } uint nl = (k - tmp) * sizeof(u32); if (nl == list->length) return list; struct adata *res = adata_empty(pool, nl); memcpy(res->data, tmp, nl); return res; } /** * val_in_range - implement |~| operator * @v1: element * @v2: set * * Checks if @v1 is element (|~| operator) of @v2. */ static int val_in_range(struct f_val v1, struct f_val v2) { if ((v1.type == T_PATH) && (v2.type == T_PATH_MASK)) return as_path_match(v1.val.ad, v2.val.path_mask); if ((v1.type == T_INT) && (v2.type == T_PATH)) return as_path_contains(v2.val.ad, v1.val.i, 1); if (((v1.type == T_PAIR) || (v1.type == T_QUAD)) && (v2.type == T_CLIST)) return int_set_contains(v2.val.ad, v1.val.i); #ifndef IPV6 /* IP->Quad implicit conversion */ if ((v1.type == T_IP) && (v2.type == T_CLIST)) return int_set_contains(v2.val.ad, ipa_to_u32(v1.val.px.ip)); #endif if ((v1.type == T_EC) && (v2.type == T_ECLIST)) return ec_set_contains(v2.val.ad, v1.val.ec); if ((v1.type == T_LC) && (v2.type == T_LCLIST)) return lc_set_contains(v2.val.ad, v1.val.lc); if ((v1.type == T_STRING) && (v2.type == T_STRING)) return patmatch(v2.val.s, v1.val.s); if ((v1.type == T_IP) && (v2.type == T_PREFIX)) return ipa_in_net(v1.val.px.ip, v2.val.px.ip, v2.val.px.len); if ((v1.type == T_PREFIX) && (v2.type == T_PREFIX)) return net_in_net(v1.val.px.ip, v1.val.px.len, v2.val.px.ip, v2.val.px.len); if ((v1.type == T_PREFIX) && (v2.type == T_PREFIX_SET)) return trie_match_fprefix(v2.val.ti, &v1.val.px); if (v2.type != T_SET) return CMP_ERROR; /* With integrated Quad<->IP implicit conversion */ if ((v1.type == v2.val.t->from.type) || ((IP_VERSION == 4) && (v1.type == T_QUAD) && (v2.val.t->from.type == T_IP))) return !!find_tree(v2.val.t, v1); if (v1.type == T_CLIST) return clist_match_set(v1.val.ad, v2.val.t); if (v1.type == T_ECLIST) return eclist_match_set(v1.val.ad, v2.val.t); if (v1.type == T_LCLIST) return lclist_match_set(v1.val.ad, v2.val.t); if (v1.type == T_PATH) return as_path_match_set(v1.val.ad, v2.val.t); return CMP_ERROR; } /* * val_format - format filter value */ void val_format(struct f_val v, buffer *buf) { char buf2[1024]; switch (v.type) { case T_VOID: buffer_puts(buf, "(void)"); return; case T_BOOL: buffer_puts(buf, v.val.i ? "TRUE" : "FALSE"); return; case T_INT: buffer_print(buf, "%u", v.val.i); return; case T_STRING: buffer_print(buf, "%s", v.val.s); return; case T_IP: buffer_print(buf, "%I", v.val.px.ip); return; case T_PREFIX: buffer_print(buf, "%I/%d", v.val.px.ip, v.val.px.len); return; case T_PAIR: buffer_print(buf, "(%u,%u)", v.val.i >> 16, v.val.i & 0xffff); return; case T_QUAD: buffer_print(buf, "%R", v.val.i); return; case T_EC: ec_format(buf2, v.val.ec); buffer_print(buf, "%s", buf2); return; case T_LC: lc_format(buf2, v.val.lc); buffer_print(buf, "%s", buf2); return; case T_PREFIX_SET: trie_format(v.val.ti, buf); return; case T_SET: tree_format(v.val.t, buf); return; case T_ENUM: buffer_print(buf, "(enum %x)%u", v.type, v.val.i); return; case T_PATH: as_path_format(v.val.ad, buf2, 1000); buffer_print(buf, "(path %s)", buf2); return; case T_CLIST: int_set_format(v.val.ad, 1, -1, buf2, 1000); buffer_print(buf, "(clist %s)", buf2); return; case T_ECLIST: ec_set_format(v.val.ad, -1, buf2, 1000); buffer_print(buf, "(eclist %s)", buf2); return; case T_LCLIST: lc_set_format(v.val.ad, -1, buf2, 1000); buffer_print(buf, "(lclist %s)", buf2); return; case T_PATH_MASK: pm_format(v.val.path_mask, buf); return; default: buffer_print(buf, "[unknown type %x]", v.type); return; } } static struct rte **f_rte; static struct rta *f_old_rta; static struct ea_list **f_tmp_attrs; static struct linpool *f_pool; static struct buffer f_buf; static int f_flags; static inline void f_rte_cow(void) { *f_rte = rte_cow(*f_rte); } /* * rta_cow - prepare rta for modification by filter */ static void f_rta_cow(void) { if (!rta_is_cached((*f_rte)->attrs)) return; /* Prepare to modify rte */ f_rte_cow(); /* Store old rta to free it later, it stores reference from rte_cow() */ f_old_rta = (*f_rte)->attrs; /* * Get shallow copy of rta. Fields eattrs and nexthops of rta are shared * with f_old_rta (they will be copied when the cached rta will be obtained * at the end of f_run()), also the lock of hostentry is inherited (we * suppose hostentry is not changed by filters). */ (*f_rte)->attrs = rta_do_cow((*f_rte)->attrs, f_pool); } static struct tbf rl_runtime_err = TBF_DEFAULT_LOG_LIMITS; #define runtime(x) do { \ log_rl(&rl_runtime_err, L_ERR "filters, line %d: %s", what->lineno, x); \ res.type = T_RETURN; \ res.val.i = F_ERROR; \ return res; \ } while(0) #define ARG(x,y) \ x = interpret(what->y); \ if (x.type & T_RETURN) \ return x; #define ONEARG ARG(v1, a1.p) #define TWOARGS ARG(v1, a1.p) \ ARG(v2, a2.p) #define TWOARGS_C TWOARGS \ if (v1.type != v2.type) \ runtime( "Can't operate with values of incompatible types" ); #define ACCESS_RTE \ do { if (!f_rte) runtime("No route to access"); } while (0) #define BITFIELD_MASK(what) \ (1u << (what->a2.i >> 24)) /** * interpret * @what: filter to interpret * * Interpret given tree of filter instructions. This is core function * of filter system and does all the hard work. * * Each instruction has 4 fields: code (which is instruction code), * aux (which is extension to instruction code, typically type), * arg1 and arg2 - arguments. Depending on instruction, arguments * are either integers, or pointers to instruction trees. Common * instructions like +, that have two expressions as arguments use * TWOARGS macro to get both of them evaluated. * * &f_val structures are copied around, so there are no problems with * memory managment. */ static struct f_val interpret(struct f_inst *what) { struct symbol *sym; struct f_val v1, v2, res, *vp; unsigned u1, u2; int i; u32 as; res.type = T_VOID; if (!what) return res; switch(what->code) { case ',': TWOARGS; break; /* Binary operators */ case '+': TWOARGS_C; switch (res.type = v1.type) { case T_VOID: runtime( "Can't operate with values of type void" ); case T_INT: res.val.i = v1.val.i + v2.val.i; break; default: runtime( "Usage of unknown type" ); } break; case '-': TWOARGS_C; switch (res.type = v1.type) { case T_VOID: runtime( "Can't operate with values of type void" ); case T_INT: res.val.i = v1.val.i - v2.val.i; break; default: runtime( "Usage of unknown type" ); } break; case '*': TWOARGS_C; switch (res.type = v1.type) { case T_VOID: runtime( "Can't operate with values of type void" ); case T_INT: res.val.i = v1.val.i * v2.val.i; break; default: runtime( "Usage of unknown type" ); } break; case '/': TWOARGS_C; switch (res.type = v1.type) { case T_VOID: runtime( "Can't operate with values of type void" ); case T_INT: if (v2.val.i == 0) runtime( "Mother told me not to divide by 0" ); res.val.i = v1.val.i / v2.val.i; break; default: runtime( "Usage of unknown type" ); } break; case '&': case '|': ARG(v1, a1.p); if (v1.type != T_BOOL) runtime( "Can't do boolean operation on non-booleans" ); if (v1.val.i == (what->code == '|')) { res.type = T_BOOL; res.val.i = v1.val.i; break; } ARG(v2, a2.p); if (v2.type != T_BOOL) runtime( "Can't do boolean operation on non-booleans" ); res.type = T_BOOL; res.val.i = v2.val.i; break; case P('m','p'): TWOARGS; if ((v1.type != T_INT) || (v2.type != T_INT)) runtime( "Can't operate with value of non-integer type in pair constructor" ); u1 = v1.val.i; u2 = v2.val.i; if ((u1 > 0xFFFF) || (u2 > 0xFFFF)) runtime( "Can't operate with value out of bounds in pair constructor" ); res.val.i = (u1 << 16) | u2; res.type = T_PAIR; break; case P('m','c'): { TWOARGS; int check, ipv4_used; u32 key, val; if (v1.type == T_INT) { ipv4_used = 0; key = v1.val.i; } else if (v1.type == T_QUAD) { ipv4_used = 1; key = v1.val.i; } #ifndef IPV6 /* IP->Quad implicit conversion */ else if (v1.type == T_IP) { ipv4_used = 1; key = ipa_to_u32(v1.val.px.ip); } #endif else runtime("Can't operate with key of non-integer/IPv4 type in EC constructor"); if (v2.type != T_INT) runtime("Can't operate with value of non-integer type in EC constructor"); val = v2.val.i; /* XXXX */ res.type = T_EC; if (what->aux == EC_GENERIC) { check = 0; res.val.ec = ec_generic(key, val); } else if (ipv4_used) { check = 1; res.val.ec = ec_ip4(what->aux, key, val); } else if (key < 0x10000) { check = 0; res.val.ec = ec_as2(what->aux, key, val); } else { check = 1; res.val.ec = ec_as4(what->aux, key, val); } if (check && (val > 0xFFFF)) runtime("Can't operate with value out of bounds in EC constructor"); break; } case P('m','l'): { TWOARGS; /* Third argument hack */ struct f_val v3 = interpret(INST3(what).p); if (v3.type & T_RETURN) return v3; if ((v1.type != T_INT) || (v2.type != T_INT) || (v3.type != T_INT)) runtime( "Can't operate with value of non-integer type in LC constructor" ); res.type = T_LC; res.val.lc = (lcomm) { v1.val.i, v2.val.i, v3.val.i }; break; } /* Relational operators */ #define COMPARE(x) \ TWOARGS; \ i = val_compare(v1, v2); \ if (i==CMP_ERROR) \ runtime( "Can't compare values of incompatible types" ); \ res.type = T_BOOL; \ res.val.i = (x); \ break; #define SAME(x) \ TWOARGS; \ i = val_same(v1, v2); \ res.type = T_BOOL; \ res.val.i = (x); \ break; case P('!','='): SAME(!i); case P('=','='): SAME(i); case '<': COMPARE(i==-1); case P('<','='): COMPARE(i!=1); case '!': ONEARG; if (v1.type != T_BOOL) runtime( "Not applied to non-boolean" ); res = v1; res.val.i = !res.val.i; break; case '~': TWOARGS; res.type = T_BOOL; res.val.i = val_in_range(v1, v2); if (res.val.i == CMP_ERROR) runtime( "~ applied on unknown type pair" ); res.val.i = !!res.val.i; break; case P('!','~'): TWOARGS; res.type = T_BOOL; res.val.i = val_in_range(v1, v2); if (res.val.i == CMP_ERROR) runtime( "!~ applied on unknown type pair" ); res.val.i = !res.val.i; break; case P('d','e'): ONEARG; res.type = T_BOOL; res.val.i = (v1.type != T_VOID); break; /* Set to indirect value, a1 = variable, a2 = value */ case 's': ARG(v2, a2.p); sym = what->a1.p; vp = sym->def; if ((sym->class != (SYM_VARIABLE | v2.type)) && (v2.type != T_VOID)) { #ifndef IPV6 /* IP->Quad implicit conversion */ if ((sym->class == (SYM_VARIABLE | T_QUAD)) && (v2.type == T_IP)) { vp->type = T_QUAD; vp->val.i = ipa_to_u32(v2.val.px.ip); break; } #endif runtime( "Assigning to variable of incompatible type" ); } *vp = v2; break; /* some constants have value in a2, some in *a1.p, strange. */ case 'c': /* integer (or simple type) constant, string, set, or prefix_set */ res.type = what->aux; if (res.type == T_PREFIX_SET) res.val.ti = what->a2.p; else if (res.type == T_SET) res.val.t = what->a2.p; else if (res.type == T_STRING) res.val.s = what->a2.p; else res.val.i = what->a2.i; break; case 'V': case 'C': res = * ((struct f_val *) what->a1.p); break; case 'p': ONEARG; val_format(v1, &f_buf); break; case '?': /* ? has really strange error value, so we can implement if ... else nicely :-) */ ONEARG; if (v1.type != T_BOOL) runtime( "If requires boolean expression" ); if (v1.val.i) { ARG(res,a2.p); res.val.i = 0; } else res.val.i = 1; res.type = T_BOOL; break; case '0': debug( "No operation\n" ); break; case P('p',','): ONEARG; if (what->a2.i == F_NOP || (what->a2.i != F_NONL && what->a1.p)) log_commit(*L_INFO, &f_buf); switch (what->a2.i) { case F_QUITBIRD: die( "Filter asked me to die" ); case F_ACCEPT: /* Should take care about turning ACCEPT into MODIFY */ case F_ERROR: case F_REJECT: /* FIXME (noncritical) Should print complete route along with reason to reject route */ res.type = T_RETURN; res.val.i = what->a2.i; return res; /* We have to return now, no more processing. */ case F_NONL: case F_NOP: break; default: bug( "unknown return type: Can't happen"); } break; case 'a': /* rta access */ { ACCESS_RTE; struct rta *rta = (*f_rte)->attrs; res.type = what->aux; switch (what->a2.i) { case SA_FROM: res.val.px.ip = rta->from; break; case SA_GW: res.val.px.ip = rta->gw; break; case SA_NET: res.val.px.ip = (*f_rte)->net->n.prefix; res.val.px.len = (*f_rte)->net->n.pxlen; break; case SA_PROTO: res.val.s = rta->src->proto->name; break; case SA_SOURCE: res.val.i = rta->source; break; case SA_SCOPE: res.val.i = rta->scope; break; case SA_CAST: res.val.i = rta->cast; break; case SA_DEST: res.val.i = rta->dest; break; case SA_IFNAME: res.val.s = rta->iface ? rta->iface->name : ""; break; case SA_IFINDEX: res.val.i = rta->iface ? rta->iface->index : 0; break; default: bug("Invalid static attribute access (%x)", res.type); } } break; case P('a','S'): ACCESS_RTE; ONEARG; if (what->aux != v1.type) runtime( "Attempt to set static attribute to incompatible type" ); f_rta_cow(); { struct rta *rta = (*f_rte)->attrs; switch (what->a2.i) { case SA_FROM: rta->from = v1.val.px.ip; break; case SA_GW: { ip_addr ip = v1.val.px.ip; neighbor *n = neigh_find(rta->src->proto, &ip, 0); if (!n || (n->scope == SCOPE_HOST)) runtime( "Invalid gw address" ); rta->dest = RTD_ROUTER; rta->gw = ip; rta->iface = n->iface; rta->nexthops = NULL; rta->hostentry = NULL; } break; case SA_SCOPE: rta->scope = v1.val.i; break; case SA_DEST: i = v1.val.i; if ((i != RTD_BLACKHOLE) && (i != RTD_UNREACHABLE) && (i != RTD_PROHIBIT)) runtime( "Destination can be changed only to blackhole, unreachable or prohibit" ); rta->dest = i; rta->gw = IPA_NONE; rta->iface = NULL; rta->nexthops = NULL; rta->hostentry = NULL; break; default: bug("Invalid static attribute access (%x)", res.type); } } break; case P('e','a'): /* Access to extended attributes */ ACCESS_RTE; { eattr *e = NULL; u16 code = what->a2.i; if (!(f_flags & FF_FORCE_TMPATTR)) e = ea_find((*f_rte)->attrs->eattrs, code); if (!e) e = ea_find((*f_tmp_attrs), code); if ((!e) && (f_flags & FF_FORCE_TMPATTR)) e = ea_find((*f_rte)->attrs->eattrs, code); if (!e) { /* A special case: undefined int_set looks like empty int_set */ if ((what->aux & EAF_TYPE_MASK) == EAF_TYPE_INT_SET) { res.type = T_CLIST; res.val.ad = adata_empty(f_pool, 0); break; } /* The same special case for ec_set */ if ((what->aux & EAF_TYPE_MASK) == EAF_TYPE_EC_SET) { res.type = T_ECLIST; res.val.ad = adata_empty(f_pool, 0); break; } /* The same special case for lc_set */ if ((what->aux & EAF_TYPE_MASK) == EAF_TYPE_LC_SET) { res.type = T_LCLIST; res.val.ad = adata_empty(f_pool, 0); break; } /* Undefined value */ res.type = T_VOID; break; } switch (what->aux & EAF_TYPE_MASK) { case EAF_TYPE_INT: res.type = T_INT; res.val.i = e->u.data; break; case EAF_TYPE_ROUTER_ID: res.type = T_QUAD; res.val.i = e->u.data; break; case EAF_TYPE_OPAQUE: res.type = T_ENUM_EMPTY; res.val.i = 0; break; case EAF_TYPE_IP_ADDRESS: res.type = T_IP; struct adata * ad = e->u.ptr; res.val.px.ip = * (ip_addr *) ad->data; break; case EAF_TYPE_AS_PATH: res.type = T_PATH; res.val.ad = e->u.ptr; break; case EAF_TYPE_BITFIELD: res.type = T_BOOL; res.val.i = !!(e->u.data & BITFIELD_MASK(what)); break; case EAF_TYPE_INT_SET: res.type = T_CLIST; res.val.ad = e->u.ptr; break; case EAF_TYPE_EC_SET: res.type = T_ECLIST; res.val.ad = e->u.ptr; break; case EAF_TYPE_LC_SET: res.type = T_LCLIST; res.val.ad = e->u.ptr; break; case EAF_TYPE_UNDEF: res.type = T_VOID; break; default: bug("Unknown type in e,a"); } } break; case P('e','S'): ACCESS_RTE; ONEARG; { struct ea_list *l = lp_alloc(f_pool, sizeof(struct ea_list) + sizeof(eattr)); u16 code = what->a2.i; l->next = NULL; l->flags = EALF_SORTED; l->count = 1; l->attrs[0].id = code; l->attrs[0].flags = 0; l->attrs[0].type = what->aux | EAF_ORIGINATED; switch (what->aux & EAF_TYPE_MASK) { case EAF_TYPE_INT: if (v1.type != T_INT) runtime( "Setting int attribute to non-int value" ); l->attrs[0].u.data = v1.val.i; break; case EAF_TYPE_ROUTER_ID: #ifndef IPV6 /* IP->Quad implicit conversion */ if (v1.type == T_IP) { l->attrs[0].u.data = ipa_to_u32(v1.val.px.ip); break; } #endif /* T_INT for backward compatibility */ if ((v1.type != T_QUAD) && (v1.type != T_INT)) runtime( "Setting quad attribute to non-quad value" ); l->attrs[0].u.data = v1.val.i; break; case EAF_TYPE_OPAQUE: runtime( "Setting opaque attribute is not allowed" ); break; case EAF_TYPE_IP_ADDRESS: if (v1.type != T_IP) runtime( "Setting ip attribute to non-ip value" ); int len = sizeof(ip_addr); struct adata *ad = lp_alloc(f_pool, sizeof(struct adata) + len); ad->length = len; (* (ip_addr *) ad->data) = v1.val.px.ip; l->attrs[0].u.ptr = ad; break; case EAF_TYPE_AS_PATH: if (v1.type != T_PATH) runtime( "Setting path attribute to non-path value" ); l->attrs[0].u.ptr = v1.val.ad; break; case EAF_TYPE_BITFIELD: if (v1.type != T_BOOL) runtime( "Setting bit in bitfield attribute to non-bool value" ); { /* First, we have to find the old value */ eattr *e = NULL; if (!(f_flags & FF_FORCE_TMPATTR)) e = ea_find((*f_rte)->attrs->eattrs, code); if (!e) e = ea_find((*f_tmp_attrs), code); if ((!e) && (f_flags & FF_FORCE_TMPATTR)) e = ea_find((*f_rte)->attrs->eattrs, code); u32 data = e ? e->u.data : 0; if (v1.val.i) l->attrs[0].u.data = data | BITFIELD_MASK(what); else l->attrs[0].u.data = data & ~BITFIELD_MASK(what);; } break; case EAF_TYPE_INT_SET: if (v1.type != T_CLIST) runtime( "Setting clist attribute to non-clist value" ); l->attrs[0].u.ptr = v1.val.ad; break; case EAF_TYPE_EC_SET: if (v1.type != T_ECLIST) runtime( "Setting eclist attribute to non-eclist value" ); l->attrs[0].u.ptr = v1.val.ad; break; case EAF_TYPE_LC_SET: if (v1.type != T_LCLIST) runtime( "Setting lclist attribute to non-lclist value" ); l->attrs[0].u.ptr = v1.val.ad; break; case EAF_TYPE_UNDEF: if (v1.type != T_VOID) runtime( "Setting void attribute to non-void value" ); l->attrs[0].u.data = 0; break; default: bug("Unknown type in e,S"); } if (!(what->aux & EAF_TEMP) && (!(f_flags & FF_FORCE_TMPATTR))) { f_rta_cow(); l->next = (*f_rte)->attrs->eattrs; (*f_rte)->attrs->eattrs = l; } else { l->next = (*f_tmp_attrs); (*f_tmp_attrs) = l; } } break; case 'P': ACCESS_RTE; res.type = T_INT; res.val.i = (*f_rte)->pref; break; case P('P','S'): ACCESS_RTE; ONEARG; if (v1.type != T_INT) runtime( "Can't set preference to non-integer" ); if (v1.val.i > 0xFFFF) runtime( "Setting preference value out of bounds" ); f_rte_cow(); (*f_rte)->pref = v1.val.i; break; case 'L': /* Get length of */ ONEARG; res.type = T_INT; switch(v1.type) { case T_PREFIX: res.val.i = v1.val.px.len; break; case T_PATH: res.val.i = as_path_getlen(v1.val.ad); break; case T_CLIST: res.val.i = int_set_get_size(v1.val.ad); break; case T_ECLIST: res.val.i = ec_set_get_size(v1.val.ad); break; case T_LCLIST: res.val.i = lc_set_get_size(v1.val.ad); break; default: runtime( "Prefix, path, clist or eclist expected" ); } break; case P('c','p'): /* Convert prefix to ... */ ONEARG; if (v1.type != T_PREFIX) runtime( "Prefix expected" ); res.type = what->aux; switch(res.type) { /* case T_INT: res.val.i = v1.val.px.len; break; Not needed any more */ case T_IP: res.val.px.ip = v1.val.px.ip; break; default: bug( "Unknown prefix to conversion" ); } break; case P('a','f'): /* Get first ASN from AS PATH */ ONEARG; if (v1.type != T_PATH) runtime( "AS path expected" ); as = 0; as_path_get_first(v1.val.ad, &as); res.type = T_INT; res.val.i = as; break; case P('a','l'): /* Get last ASN from AS PATH */ ONEARG; if (v1.type != T_PATH) runtime( "AS path expected" ); as = 0; as_path_get_last(v1.val.ad, &as); res.type = T_INT; res.val.i = as; break; case P('a','L'): /* Get last ASN from non-aggregated part of AS PATH */ ONEARG; if (v1.type != T_PATH) runtime( "AS path expected" ); res.type = T_INT; res.val.i = as_path_get_last_nonaggregated(v1.val.ad); break; case 'r': ONEARG; res = v1; res.type |= T_RETURN; return res; case P('c','a'): /* CALL: this is special: if T_RETURN and returning some value, mask it out */ ONEARG; res = interpret(what->a2.p); if (res.type == T_RETURN) return res; res.type &= ~T_RETURN; break; case P('c','v'): /* Clear local variables */ for (sym = what->a1.p; sym != NULL; sym = sym->aux2) ((struct f_val *) sym->def)->type = T_VOID; break; case P('S','W'): ONEARG; { struct f_tree *t = find_tree(what->a2.p, v1); if (!t) { v1.type = T_VOID; t = find_tree(what->a2.p, v1); if (!t) { debug( "No else statement?\n"); break; } } /* It is actually possible to have t->data NULL */ res = interpret(t->data); if (res.type & T_RETURN) return res; } break; case P('i','M'): /* IP.MASK(val) */ TWOARGS; if (v2.type != T_INT) runtime( "Integer expected"); if (v1.type != T_IP) runtime( "You can mask only IP addresses" ); { ip_addr mask = ipa_mkmask(v2.val.i); res.type = T_IP; res.val.px.ip = ipa_and(mask, v1.val.px.ip); } break; case 'E': /* Create empty attribute */ res.type = what->aux; res.val.ad = adata_empty(f_pool, 0); break; case P('A','p'): /* Path prepend */ TWOARGS; if (v1.type != T_PATH) runtime("Can't prepend to non-path"); if (v2.type != T_INT) runtime("Can't prepend non-integer"); res.type = T_PATH; res.val.ad = as_path_prepend(f_pool, v1.val.ad, v2.val.i); break; case P('C','a'): /* (Extended) Community list add or delete */ TWOARGS; if (v1.type == T_PATH) { struct f_tree *set = NULL; u32 key = 0; int pos; if (v2.type == T_INT) key = v2.val.i; else if ((v2.type == T_SET) && (v2.val.t->from.type == T_INT)) set = v2.val.t; else runtime("Can't delete non-integer (set)"); switch (what->aux) { case 'a': runtime("Can't add to path"); case 'd': pos = 0; break; case 'f': pos = 1; break; default: bug("unknown Ca operation"); } if (pos && !set) runtime("Can't filter integer"); res.type = T_PATH; res.val.ad = as_path_filter(f_pool, v1.val.ad, set, key, pos); } else if (v1.type == T_CLIST) { /* Community (or cluster) list */ struct f_val dummy; int arg_set = 0; uint n = 0; if ((v2.type == T_PAIR) || (v2.type == T_QUAD)) n = v2.val.i; #ifndef IPV6 /* IP->Quad implicit conversion */ else if (v2.type == T_IP) n = ipa_to_u32(v2.val.px.ip); #endif else if ((v2.type == T_SET) && clist_set_type(v2.val.t, &dummy)) arg_set = 1; else if (v2.type == T_CLIST) arg_set = 2; else runtime("Can't add/delete non-pair"); res.type = T_CLIST; switch (what->aux) { case 'a': if (arg_set == 1) runtime("Can't add set"); else if (!arg_set) res.val.ad = int_set_add(f_pool, v1.val.ad, n); else res.val.ad = int_set_union(f_pool, v1.val.ad, v2.val.ad); break; case 'd': if (!arg_set) res.val.ad = int_set_del(f_pool, v1.val.ad, n); else res.val.ad = clist_filter(f_pool, v1.val.ad, v2, 0); break; case 'f': if (!arg_set) runtime("Can't filter pair"); res.val.ad = clist_filter(f_pool, v1.val.ad, v2, 1); break; default: bug("unknown Ca operation"); } } else if (v1.type == T_ECLIST) { /* Extended community list */ int arg_set = 0; /* v2.val is either EC or EC-set */ if ((v2.type == T_SET) && eclist_set_type(v2.val.t)) arg_set = 1; else if (v2.type == T_ECLIST) arg_set = 2; else if (v2.type != T_EC) runtime("Can't add/delete non-ec"); res.type = T_ECLIST; switch (what->aux) { case 'a': if (arg_set == 1) runtime("Can't add set"); else if (!arg_set) res.val.ad = ec_set_add(f_pool, v1.val.ad, v2.val.ec); else res.val.ad = ec_set_union(f_pool, v1.val.ad, v2.val.ad); break; case 'd': if (!arg_set) res.val.ad = ec_set_del(f_pool, v1.val.ad, v2.val.ec); else res.val.ad = eclist_filter(f_pool, v1.val.ad, v2, 0); break; case 'f': if (!arg_set) runtime("Can't filter ec"); res.val.ad = eclist_filter(f_pool, v1.val.ad, v2, 1); break; default: bug("unknown Ca operation"); } } else if (v1.type == T_LCLIST) { /* Large community list */ int arg_set = 0; /* v2.val is either LC or LC-set */ if ((v2.type == T_SET) && lclist_set_type(v2.val.t)) arg_set = 1; else if (v2.type == T_LCLIST) arg_set = 2; else if (v2.type != T_LC) runtime("Can't add/delete non-lc"); res.type = T_LCLIST; switch (what->aux) { case 'a': if (arg_set == 1) runtime("Can't add set"); else if (!arg_set) res.val.ad = lc_set_add(f_pool, v1.val.ad, v2.val.lc); else res.val.ad = lc_set_union(f_pool, v1.val.ad, v2.val.ad); break; case 'd': if (!arg_set) res.val.ad = lc_set_del(f_pool, v1.val.ad, v2.val.lc); else res.val.ad = lclist_filter(f_pool, v1.val.ad, v2, 0); break; case 'f': if (!arg_set) runtime("Can't filter lc"); res.val.ad = lclist_filter(f_pool, v1.val.ad, v2, 1); break; default: bug("unknown Ca operation"); } } else runtime("Can't add/delete to non-[e|l]clist"); break; case P('R','C'): /* ROA Check */ if (what->arg1) { TWOARGS; if ((v1.type != T_PREFIX) || (v2.type != T_INT)) runtime("Invalid argument to roa_check()"); as = v2.val.i; } else { ACCESS_RTE; v1.val.px.ip = (*f_rte)->net->n.prefix; v1.val.px.len = (*f_rte)->net->n.pxlen; /* We ignore temporary attributes, probably not a problem here */ /* 0x02 is a value of BA_AS_PATH, we don't want to include BGP headers */ eattr *e = ea_find((*f_rte)->attrs->eattrs, EA_CODE(EAP_BGP, 0x02)); if (!e || e->type != EAF_TYPE_AS_PATH) runtime("Missing AS_PATH attribute"); as_path_get_last(e->u.ptr, &as); } struct roa_table_config *rtc = ((struct f_inst_roa_check *) what)->rtc; if (!rtc->table) runtime("Missing ROA table"); res.type = T_ENUM_ROA; res.val.i = roa_check(rtc->table, v1.val.px.ip, v1.val.px.len, as); break; default: bug( "Unknown instruction %d (%c)", what->code, what->code & 0xff); } if (what->next) return interpret(what->next); return res; } #undef ARG #define ARG(x,y) \ if (!i_same(f1->y, f2->y)) \ return 0; #define ONEARG ARG(v1, a1.p) #define TWOARGS ARG(v1, a1.p) \ ARG(v2, a2.p) #define A2_SAME if (f1->a2.i != f2->a2.i) return 0; /* * i_same - function that does real comparing of instruction trees, you should call filter_same from outside */ int i_same(struct f_inst *f1, struct f_inst *f2) { if ((!!f1) != (!!f2)) return 0; if (!f1) return 1; if (f1->aux != f2->aux) return 0; if (f1->code != f2->code) return 0; if (f1 == f2) /* It looks strange, but it is possible with call rewriting trickery */ return 1; switch(f1->code) { case ',': /* fall through */ case '+': case '-': case '*': case '/': case '|': case '&': case P('m','p'): case P('m','c'): case P('!','='): case P('=','='): case '<': case P('<','='): TWOARGS; break; case '!': ONEARG; break; case '~': TWOARGS; break; case P('d','e'): ONEARG; break; case P('m','l'): TWOARGS; if (!i_same(INST3(f1).p, INST3(f2).p)) return 0; break; case 's': ARG(v2, a2.p); { struct symbol *s1, *s2; s1 = f1->a1.p; s2 = f2->a1.p; if (strcmp(s1->name, s2->name)) return 0; if (s1->class != s2->class) return 0; } break; case 'c': switch (f1->aux) { case T_PREFIX_SET: if (!trie_same(f1->a2.p, f2->a2.p)) return 0; break; case T_SET: if (!same_tree(f1->a2.p, f2->a2.p)) return 0; break; case T_STRING: if (strcmp(f1->a2.p, f2->a2.p)) return 0; break; default: A2_SAME; } break; case 'C': if (!val_same(* (struct f_val *) f1->a1.p, * (struct f_val *) f2->a1.p)) return 0; break; case 'V': if (strcmp((char *) f1->a2.p, (char *) f2->a2.p)) return 0; break; case 'p': case 'L': ONEARG; break; case '?': TWOARGS; break; case '0': case 'E': break; case P('p',','): ONEARG; A2_SAME; break; case 'P': case 'a': A2_SAME; break; case P('e','a'): A2_SAME; break; case P('P','S'): case P('a','S'): case P('e','S'): ONEARG; A2_SAME; break; case 'r': ONEARG; break; case P('c','p'): ONEARG; break; case P('c','a'): /* Call rewriting trickery to avoid exponential behaviour */ ONEARG; if (!i_same(f1->a2.p, f2->a2.p)) return 0; f2->a2.p = f1->a2.p; break; case P('c','v'): break; /* internal instruction */ case P('S','W'): ONEARG; if (!same_tree(f1->a2.p, f2->a2.p)) return 0; break; case P('i','M'): TWOARGS; break; case P('A','p'): TWOARGS; break; case P('C','a'): TWOARGS; break; case P('a','f'): case P('a','l'): case P('a','L'): ONEARG; break; case P('R','C'): TWOARGS; /* Does not really make sense - ROA check resuls may change anyway */ if (strcmp(((struct f_inst_roa_check *) f1)->rtc->name, ((struct f_inst_roa_check *) f2)->rtc->name)) return 0; break; default: bug( "Unknown instruction %d in same (%c)", f1->code, f1->code & 0xff); } return i_same(f1->next, f2->next); } /** * f_run - run a filter for a route * @filter: filter to run * @rte: route being filtered, may be modified * @tmp_attrs: temporary attributes, prepared by caller or generated by f_run() * @tmp_pool: all filter allocations go from this pool * @flags: flags * * If filter needs to modify the route, there are several * posibilities. @rte might be read-only (with REF_COW flag), in that * case rw copy is obtained by rte_cow() and @rte is replaced. If * @rte is originally rw, it may be directly modified (and it is never * copied). * * The returned rte may reuse the (possibly cached, cloned) rta, or * (if rta was modificied) contains a modified uncached rta, which * uses parts allocated from @tmp_pool and parts shared from original * rta. There is one exception - if @rte is rw but contains a cached * rta and that is modified, rta in returned rte is also cached. * * Ownership of cached rtas is consistent with rte, i.e. * if a new rte is returned, it has its own clone of cached rta * (and cached rta of read-only source rte is intact), if rte is * modified in place, old cached rta is possibly freed. */ int f_run(struct filter *filter, struct rte **rte, struct ea_list **tmp_attrs, struct linpool *tmp_pool, int flags) { if (filter == FILTER_ACCEPT) return F_ACCEPT; if (filter == FILTER_REJECT) return F_REJECT; int rte_cow = ((*rte)->flags & REF_COW); DBG( "Running filter `%s'...", filter->name ); f_rte = rte; f_old_rta = NULL; f_tmp_attrs = tmp_attrs; f_pool = tmp_pool; f_flags = flags; LOG_BUFFER_INIT(f_buf); struct f_val res = interpret(filter->root); if (f_old_rta) { /* * Cached rta was modified and f_rte contains now an uncached one, * sharing some part with the cached one. The cached rta should * be freed (if rte was originally COW, f_old_rta is a clone * obtained during rte_cow()). * * This also implements the exception mentioned in f_run() * description. The reason for this is that rta reuses parts of * f_old_rta, and these may be freed during rta_free(f_old_rta). * This is not the problem if rte was COW, because original rte * also holds the same rta. */ if (!rte_cow) (*f_rte)->attrs = rta_lookup((*f_rte)->attrs); rta_free(f_old_rta); } if (res.type != T_RETURN) { log_rl(&rl_runtime_err, L_ERR "Filter %s did not return accept nor reject. Make up your mind", filter->name); return F_ERROR; } DBG( "done (%u)\n", res.val.i ); return res.val.i; } /* TODO: perhaps we could integrate f_eval(), f_eval_rte() and f_run() */ struct f_val f_eval_rte(struct f_inst *expr, struct rte **rte, struct linpool *tmp_pool) { struct ea_list *tmp_attrs = NULL; f_rte = rte; f_old_rta = NULL; f_tmp_attrs = &tmp_attrs; f_pool = tmp_pool; f_flags = 0; LOG_BUFFER_INIT(f_buf); /* Note that in this function we assume that rte->attrs is private / uncached */ struct f_val res = interpret(expr); /* Hack to include EAF_TEMP attributes to the main list */ (*rte)->attrs->eattrs = ea_append(tmp_attrs, (*rte)->attrs->eattrs); return res; } struct f_val f_eval(struct f_inst *expr, struct linpool *tmp_pool) { f_flags = 0; f_tmp_attrs = NULL; f_rte = NULL; f_pool = tmp_pool; LOG_BUFFER_INIT(f_buf); return interpret(expr); } uint f_eval_int(struct f_inst *expr) { /* Called independently in parse-time to eval expressions */ struct f_val res = f_eval(expr, cfg_mem); if (res.type != T_INT) cf_error("Integer expression expected"); return res.val.i; } u32 f_eval_asn(struct f_inst *expr) { /* Called as a part of another interpret call, therefore no log_reset() */ struct f_val res = interpret(expr); return (res.type == T_INT) ? res.val.i : 0; } /** * filter_same - compare two filters * @new: first filter to be compared * @old: second filter to be compared, notice that this filter is * damaged while comparing. * * Returns 1 in case filters are same, otherwise 0. If there are * underlying bugs, it will rather say 0 on same filters than say * 1 on different. */ int filter_same(struct filter *new, struct filter *old) { if (old == new) /* Handle FILTER_ACCEPT and FILTER_REJECT */ return 1; if (old == FILTER_ACCEPT || old == FILTER_REJECT || new == FILTER_ACCEPT || new == FILTER_REJECT) return 0; return i_same(new->root, old->root); } bird-1.6.3/proto/0000755000103200001440000000000013027054563012575 5ustar feelausersbird-1.6.3/proto/babel/0000755000103200001440000000000013027054563013642 5ustar feelausersbird-1.6.3/proto/babel/packets.c0000644000103200001440000006647013027054563015455 0ustar feelausers/* * BIRD -- The Babel protocol * * Copyright (c) 2015--2016 Toke Hoiland-Jorgensen * * Can be freely distributed and used under the terms of the GNU GPL. * * This file contains the packet and TLV handling code for the protocol. */ #include "babel.h" struct babel_pkt_header { u8 magic; u8 version; u16 length; } PACKED; struct babel_tlv { u8 type; u8 length; u8 value[0]; } PACKED; struct babel_tlv_ack_req { u8 type; u8 length; u16 reserved; u16 nonce; u16 interval; } PACKED; struct babel_tlv_ack { u8 type; u8 length; u16 nonce; } PACKED; struct babel_tlv_hello { u8 type; u8 length; u16 reserved; u16 seqno; u16 interval; } PACKED; struct babel_tlv_ihu { u8 type; u8 length; u8 ae; u8 reserved; u16 rxcost; u16 interval; u8 addr[0]; } PACKED; struct babel_tlv_router_id { u8 type; u8 length; u16 reserved; u64 router_id; } PACKED; struct babel_tlv_next_hop { u8 type; u8 length; u8 ae; u8 reserved; u8 addr[0]; } PACKED; struct babel_tlv_update { u8 type; u8 length; u8 ae; u8 flags; u8 plen; u8 omitted; u16 interval; u16 seqno; u16 metric; u8 addr[0]; } PACKED; struct babel_tlv_route_request { u8 type; u8 length; u8 ae; u8 plen; u8 addr[0]; } PACKED; struct babel_tlv_seqno_request { u8 type; u8 length; u8 ae; u8 plen; u16 seqno; u8 hop_count; u8 reserved; u64 router_id; u8 addr[0]; } PACKED; #define BABEL_FLAG_DEF_PREFIX 0x80 #define BABEL_FLAG_ROUTER_ID 0x40 struct babel_parse_state { struct babel_proto *proto; struct babel_iface *ifa; ip_addr saddr; ip_addr next_hop; u64 router_id; /* Router ID used in subsequent updates */ u8 def_ip6_prefix[16]; /* Implicit IPv6 prefix in network order */ u8 def_ip4_prefix[4]; /* Implicit IPv4 prefix in network order */ u8 router_id_seen; /* router_id field is valid */ u8 def_ip6_prefix_seen; /* def_ip6_prefix is valid */ u8 def_ip4_prefix_seen; /* def_ip4_prefix is valid */ }; enum parse_result { PARSE_SUCCESS, PARSE_ERROR, PARSE_IGNORE, }; struct babel_write_state { u64 router_id; u8 router_id_seen; // ip_addr next_hop; }; #define DROP(DSC,VAL) do { err_dsc = DSC; err_val = VAL; goto drop; } while(0) #define DROP1(DSC) do { err_dsc = DSC; goto drop; } while(0) #define LOG_PKT(msg, args...) \ log_rl(&p->log_pkt_tbf, L_REMOTE "%s: " msg, p->p.name, args) #define FIRST_TLV(p) ((struct babel_tlv *) (((struct babel_pkt_header *) p) + 1)) #define NEXT_TLV(t) ((struct babel_tlv *) (((byte *) t) + TLV_LENGTH(t))) #define TLV_LENGTH(t) (t->type == BABEL_TLV_PAD1 ? 1 : t->length + sizeof(struct babel_tlv)) #define TLV_OPT_LENGTH(t) (t->length + sizeof(struct babel_tlv) - sizeof(*t)) #define TLV_HDR(tlv,t,l) ({ tlv->type = t; tlv->length = l - sizeof(struct babel_tlv); }) #define TLV_HDR0(tlv,t) TLV_HDR(tlv, t, tlv_data[t].min_length) #define BYTES(n) ((((uint) n) + 7) / 8) static inline u16 get_time16(const void *p) { u16 v = get_u16(p) / BABEL_TIME_UNITS; return MAX(1, v); } static inline void put_time16(void *p, u16 v) { put_u16(p, v * BABEL_TIME_UNITS); } static inline ip6_addr get_ip6_px(const void *p, uint plen) { ip6_addr addr = IPA_NONE; memcpy(&addr, p, BYTES(plen)); return ip6_ntoh(addr); } static inline void put_ip6_px(void *p, ip6_addr addr, uint plen) { addr = ip6_hton(addr); memcpy(p, &addr, BYTES(plen)); } static inline ip6_addr get_ip6_ll(const void *p) { return ip6_build(0xfe800000, 0, get_u32(p+0), get_u32(p+4)); } static inline void put_ip6_ll(void *p, ip6_addr addr) { put_u32(p+0, _I2(addr)); put_u32(p+4, _I3(addr)); } /* * TLV read/write functions */ static int babel_read_ack_req(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static int babel_read_hello(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static int babel_read_ihu(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static int babel_read_router_id(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static int babel_read_next_hop(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static int babel_read_update(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static int babel_read_route_request(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static int babel_read_seqno_request(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static uint babel_write_ack(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len); static uint babel_write_hello(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len); static uint babel_write_ihu(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len); static uint babel_write_update(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len); static uint babel_write_route_request(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len); static uint babel_write_seqno_request(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len); struct babel_tlv_data { u8 min_length; int (*read_tlv)(struct babel_tlv *hdr, union babel_msg *m, struct babel_parse_state *state); uint (*write_tlv)(struct babel_tlv *hdr, union babel_msg *m, struct babel_write_state *state, uint max_len); void (*handle_tlv)(union babel_msg *m, struct babel_iface *ifa); }; static const struct babel_tlv_data tlv_data[BABEL_TLV_MAX] = { [BABEL_TLV_ACK_REQ] = { sizeof(struct babel_tlv_ack_req), babel_read_ack_req, NULL, babel_handle_ack_req }, [BABEL_TLV_ACK] = { sizeof(struct babel_tlv_ack), NULL, babel_write_ack, NULL }, [BABEL_TLV_HELLO] = { sizeof(struct babel_tlv_hello), babel_read_hello, babel_write_hello, babel_handle_hello }, [BABEL_TLV_IHU] = { sizeof(struct babel_tlv_ihu), babel_read_ihu, babel_write_ihu, babel_handle_ihu }, [BABEL_TLV_ROUTER_ID] = { sizeof(struct babel_tlv_router_id), babel_read_router_id, NULL, NULL }, [BABEL_TLV_NEXT_HOP] = { sizeof(struct babel_tlv_next_hop), babel_read_next_hop, NULL, NULL }, [BABEL_TLV_UPDATE] = { sizeof(struct babel_tlv_update), babel_read_update, babel_write_update, babel_handle_update }, [BABEL_TLV_ROUTE_REQUEST] = { sizeof(struct babel_tlv_route_request), babel_read_route_request, babel_write_route_request, babel_handle_route_request }, [BABEL_TLV_SEQNO_REQUEST] = { sizeof(struct babel_tlv_seqno_request), babel_read_seqno_request, babel_write_seqno_request, babel_handle_seqno_request }, }; static int babel_read_ack_req(struct babel_tlv *hdr, union babel_msg *m, struct babel_parse_state *state) { struct babel_tlv_ack_req *tlv = (void *) hdr; struct babel_msg_ack_req *msg = &m->ack_req; msg->type = BABEL_TLV_ACK_REQ; msg->nonce = get_u16(&tlv->nonce); msg->interval = get_time16(&tlv->interval); msg->sender = state->saddr; if (!msg->interval) return PARSE_ERROR; return PARSE_SUCCESS; } static uint babel_write_ack(struct babel_tlv *hdr, union babel_msg *m, struct babel_write_state *state UNUSED, uint max_len UNUSED) { struct babel_tlv_ack *tlv = (void *) hdr; struct babel_msg_ack *msg = &m->ack; TLV_HDR0(tlv, BABEL_TLV_ACK); put_u16(&tlv->nonce, msg->nonce); return sizeof(struct babel_tlv_ack); } static int babel_read_hello(struct babel_tlv *hdr, union babel_msg *m, struct babel_parse_state *state) { struct babel_tlv_hello *tlv = (void *) hdr; struct babel_msg_hello *msg = &m->hello; msg->type = BABEL_TLV_HELLO; msg->seqno = get_u16(&tlv->seqno); msg->interval = get_time16(&tlv->interval); msg->sender = state->saddr; return PARSE_SUCCESS; } static uint babel_write_hello(struct babel_tlv *hdr, union babel_msg *m, struct babel_write_state *state UNUSED, uint max_len UNUSED) { struct babel_tlv_hello *tlv = (void *) hdr; struct babel_msg_hello *msg = &m->hello; TLV_HDR0(tlv, BABEL_TLV_HELLO); put_u16(&tlv->seqno, msg->seqno); put_time16(&tlv->interval, msg->interval); return sizeof(struct babel_tlv_hello); } static int babel_read_ihu(struct babel_tlv *hdr, union babel_msg *m, struct babel_parse_state *state) { struct babel_tlv_ihu *tlv = (void *) hdr; struct babel_msg_ihu *msg = &m->ihu; msg->type = BABEL_TLV_IHU; msg->ae = tlv->ae; msg->rxcost = get_u16(&tlv->rxcost); msg->interval = get_time16(&tlv->interval); msg->addr = IPA_NONE; msg->sender = state->saddr; if (msg->ae >= BABEL_AE_MAX) return PARSE_IGNORE; // We handle link-local IPs. In every other case, the addr field will be 0 but // validation will succeed. The handler takes care of these cases. if (msg->ae == BABEL_AE_IP6_LL) { if (TLV_OPT_LENGTH(tlv) < 8) return PARSE_ERROR; msg->addr = ipa_from_ip6(get_ip6_ll(&tlv->addr)); } return PARSE_SUCCESS; } static uint babel_write_ihu(struct babel_tlv *hdr, union babel_msg *m, struct babel_write_state *state UNUSED, uint max_len) { struct babel_tlv_ihu *tlv = (void *) hdr; struct babel_msg_ihu *msg = &m->ihu; if (ipa_is_link_local(msg->addr) && max_len < sizeof(struct babel_tlv_ihu) + 8) return 0; TLV_HDR0(tlv, BABEL_TLV_IHU); put_u16(&tlv->rxcost, msg->rxcost); put_time16(&tlv->interval, msg->interval); if (!ipa_is_link_local(msg->addr)) { tlv->ae = BABEL_AE_WILDCARD; return sizeof(struct babel_tlv_ihu); } put_ip6_ll(&tlv->addr, msg->addr); tlv->ae = BABEL_AE_IP6_LL; hdr->length += 8; return sizeof(struct babel_tlv_ihu) + 8; } static int babel_read_router_id(struct babel_tlv *hdr, union babel_msg *m UNUSED, struct babel_parse_state *state) { struct babel_tlv_router_id *tlv = (void *) hdr; state->router_id = get_u64(&tlv->router_id); state->router_id_seen = 1; return PARSE_IGNORE; } /* This is called directly from babel_write_update() */ static uint babel_write_router_id(struct babel_tlv *hdr, u64 router_id, struct babel_write_state *state, uint max_len UNUSED) { struct babel_tlv_router_id *tlv = (void *) hdr; /* We still assume that first min_length bytes are available and zeroed */ TLV_HDR0(tlv, BABEL_TLV_ROUTER_ID); put_u64(&tlv->router_id, router_id); state->router_id = router_id; state->router_id_seen = 1; return sizeof(struct babel_tlv_router_id); } static int babel_read_next_hop(struct babel_tlv *hdr, union babel_msg *m UNUSED, struct babel_parse_state *state) { struct babel_tlv_next_hop *tlv = (void *) hdr; switch (tlv->ae) { case BABEL_AE_WILDCARD: return PARSE_ERROR; case BABEL_AE_IP4: /* TODO */ return PARSE_IGNORE; case BABEL_AE_IP6: if (TLV_OPT_LENGTH(tlv) < sizeof(ip6_addr)) return PARSE_ERROR; state->next_hop = ipa_from_ip6(get_ip6(&tlv->addr)); return PARSE_IGNORE; case BABEL_AE_IP6_LL: if (TLV_OPT_LENGTH(tlv) < 8) return PARSE_ERROR; state->next_hop = ipa_from_ip6(get_ip6_ll(&tlv->addr)); return PARSE_IGNORE; default: return PARSE_IGNORE; } return PARSE_IGNORE; } static int babel_read_update(struct babel_tlv *hdr, union babel_msg *m, struct babel_parse_state *state) { struct babel_tlv_update *tlv = (void *) hdr; struct babel_msg_update *msg = &m->update; msg->type = BABEL_TLV_UPDATE; msg->interval = get_time16(&tlv->interval); msg->seqno = get_u16(&tlv->seqno); msg->metric = get_u16(&tlv->metric); /* Length of received prefix data without omitted part */ int len = BYTES(tlv->plen) - (int) tlv->omitted; u8 buf[16] = {}; if ((len < 0) || ((uint) len > TLV_OPT_LENGTH(tlv))) return PARSE_ERROR; switch (tlv->ae) { case BABEL_AE_WILDCARD: if (tlv->plen > 0) return PARSE_ERROR; msg->wildcard = 1; break; case BABEL_AE_IP4: /* TODO */ return PARSE_IGNORE; case BABEL_AE_IP6: if (tlv->plen > MAX_PREFIX_LENGTH) return PARSE_ERROR; /* Cannot omit data if there is no saved prefix */ if (tlv->omitted && !state->def_ip6_prefix_seen) return PARSE_ERROR; /* Merge saved prefix and received prefix parts */ memcpy(buf, state->def_ip6_prefix, tlv->omitted); memcpy(buf + tlv->omitted, tlv->addr, len); msg->plen = tlv->plen; msg->prefix = ipa_from_ip6(get_ip6(buf)); if (tlv->flags & BABEL_FLAG_DEF_PREFIX) { put_ip6(state->def_ip6_prefix, msg->prefix); state->def_ip6_prefix_seen = 1; } if (tlv->flags & BABEL_FLAG_ROUTER_ID) { state->router_id = ((u64) _I2(msg->prefix)) << 32 | _I3(msg->prefix); state->router_id_seen = 1; } break; case BABEL_AE_IP6_LL: /* ??? */ return PARSE_IGNORE; default: return PARSE_IGNORE; } /* Update must have Router ID, unless it is retraction */ if (!state->router_id_seen && (msg->metric != BABEL_INFINITY)) { DBG("Babel: No router ID seen before update\n"); return PARSE_ERROR; } msg->router_id = state->router_id; msg->next_hop = state->next_hop; msg->sender = state->saddr; return PARSE_SUCCESS; } static uint babel_write_update(struct babel_tlv *hdr, union babel_msg *m, struct babel_write_state *state, uint max_len) { struct babel_tlv_update *tlv = (void *) hdr; struct babel_msg_update *msg = &m->update; uint len0 = 0; /* * When needed, we write Router-ID TLV before Update TLV and return size of * both of them. There is enough space for the Router-ID TLV, because * sizeof(struct babel_tlv_router_id) == sizeof(struct babel_tlv_update). * * Router ID is not used for retractions, so do not us it in such case. */ if ((msg->metric < BABEL_INFINITY) && (!state->router_id_seen || (msg->router_id != state->router_id))) { len0 = babel_write_router_id(hdr, msg->router_id, state, max_len); tlv = (struct babel_tlv_update *) NEXT_TLV(tlv); } uint len = sizeof(struct babel_tlv_update) + BYTES(msg->plen); if (len0 + len > max_len) return 0; memset(tlv, 0, sizeof(struct babel_tlv_update)); TLV_HDR(tlv, BABEL_TLV_UPDATE, len); if (msg->wildcard) { tlv->ae = BABEL_AE_WILDCARD; tlv->plen = 0; } else { tlv->ae = BABEL_AE_IP6; tlv->plen = msg->plen; put_ip6_px(tlv->addr, msg->prefix, msg->plen); } put_time16(&tlv->interval, msg->interval); put_u16(&tlv->seqno, msg->seqno); put_u16(&tlv->metric, msg->metric); return len0 + len; } static int babel_read_route_request(struct babel_tlv *hdr, union babel_msg *m, struct babel_parse_state *state UNUSED) { struct babel_tlv_route_request *tlv = (void *) hdr; struct babel_msg_route_request *msg = &m->route_request; msg->type = BABEL_TLV_ROUTE_REQUEST; switch (tlv->ae) { case BABEL_AE_WILDCARD: /* Wildcard requests must have plen 0 */ if (tlv->plen > 0) return PARSE_ERROR; msg->full = 1; return PARSE_SUCCESS; case BABEL_AE_IP4: /* TODO */ return PARSE_IGNORE; case BABEL_AE_IP6: if (tlv->plen > MAX_PREFIX_LENGTH) return PARSE_ERROR; if (TLV_OPT_LENGTH(tlv) < BYTES(tlv->plen)) return PARSE_ERROR; msg->plen = tlv->plen; msg->prefix = get_ip6_px(tlv->addr, tlv->plen); return PARSE_SUCCESS; case BABEL_AE_IP6_LL: return PARSE_ERROR; default: return PARSE_IGNORE; } return PARSE_IGNORE; } static uint babel_write_route_request(struct babel_tlv *hdr, union babel_msg *m, struct babel_write_state *state UNUSED, uint max_len) { struct babel_tlv_route_request *tlv = (void *) hdr; struct babel_msg_route_request *msg = &m->route_request; uint len = sizeof(struct babel_tlv_route_request) + BYTES(msg->plen); if (len > max_len) return 0; TLV_HDR(tlv, BABEL_TLV_ROUTE_REQUEST, len); if (msg->full) { tlv->ae = BABEL_AE_WILDCARD; tlv->plen = 0; } else { tlv->ae = BABEL_AE_IP6; tlv->plen = msg->plen; put_ip6_px(tlv->addr, msg->prefix, msg->plen); } return len; } static int babel_read_seqno_request(struct babel_tlv *hdr, union babel_msg *m, struct babel_parse_state *state) { struct babel_tlv_seqno_request *tlv = (void *) hdr; struct babel_msg_seqno_request *msg = &m->seqno_request; msg->type = BABEL_TLV_SEQNO_REQUEST; msg->seqno = get_u16(&tlv->seqno); msg->hop_count = tlv->hop_count; msg->router_id = get_u64(&tlv->router_id); msg->sender = state->saddr; if (tlv->hop_count == 0) return PARSE_ERROR; switch (tlv->ae) { case BABEL_AE_WILDCARD: return PARSE_ERROR; case BABEL_AE_IP4: /* TODO */ return PARSE_IGNORE; case BABEL_AE_IP6: if (tlv->plen > MAX_PREFIX_LENGTH) return PARSE_ERROR; if (TLV_OPT_LENGTH(tlv) < BYTES(tlv->plen)) return PARSE_ERROR; msg->plen = tlv->plen; msg->prefix = get_ip6_px(tlv->addr, tlv->plen); return PARSE_SUCCESS; case BABEL_AE_IP6_LL: return PARSE_ERROR; default: return PARSE_IGNORE; } return PARSE_IGNORE; } static uint babel_write_seqno_request(struct babel_tlv *hdr, union babel_msg *m, struct babel_write_state *state UNUSED, uint max_len) { struct babel_tlv_seqno_request *tlv = (void *) hdr; struct babel_msg_seqno_request *msg = &m->seqno_request; uint len = sizeof(struct babel_tlv_seqno_request) + BYTES(msg->plen); if (len > max_len) return 0; TLV_HDR(tlv, BABEL_TLV_SEQNO_REQUEST, len); tlv->ae = BABEL_AE_IP6; tlv->plen = msg->plen; put_u16(&tlv->seqno, msg->seqno); tlv->hop_count = msg->hop_count; put_u64(&tlv->router_id, msg->router_id); put_ip6_px(tlv->addr, msg->prefix, msg->plen); return len; } static inline int babel_read_tlv(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state) { if ((hdr->type <= BABEL_TLV_PADN) || (hdr->type >= BABEL_TLV_MAX) || !tlv_data[hdr->type].read_tlv) return PARSE_IGNORE; if (TLV_LENGTH(hdr) < tlv_data[hdr->type].min_length) return PARSE_ERROR; memset(msg, 0, sizeof(*msg)); return tlv_data[hdr->type].read_tlv(hdr, msg, state); } static uint babel_write_tlv(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len) { if ((msg->type <= BABEL_TLV_PADN) || (msg->type >= BABEL_TLV_MAX) || !tlv_data[msg->type].write_tlv) return 0; if (tlv_data[msg->type].min_length > max_len) return 0; memset(hdr, 0, tlv_data[msg->type].min_length); return tlv_data[msg->type].write_tlv(hdr, msg, state, max_len); } /* * Packet RX/TX functions */ static int babel_send_to(struct babel_iface *ifa, ip_addr dest) { sock *sk = ifa->sk; struct babel_pkt_header *hdr = (void *) sk->tbuf; int len = get_u16(&hdr->length) + sizeof(struct babel_pkt_header); DBG("Babel: Sending %d bytes to %I\n", len, dest); return sk_send_to(sk, len, dest, 0); } /** * babel_write_queue - Write a TLV queue to a transmission buffer * @ifa: Interface holding the transmission buffer * @queue: TLV queue to write (containing internal-format TLVs) * * This function writes a packet to the interface transmission buffer with as * many TLVs from the &queue as will fit in the buffer. It returns the number of * bytes written (NOT counting the packet header). The function is called by * babel_send_queue() and babel_send_unicast() to construct packets for * transmission, and uses per-TLV helper functions to convert the * internal-format TLVs to their wire representations. * * The TLVs in the queue are freed after they are written to the buffer. */ static uint babel_write_queue(struct babel_iface *ifa, list *queue) { struct babel_proto *p = ifa->proto; struct babel_write_state state = {}; if (EMPTY_LIST(*queue)) return 0; byte *pos = ifa->sk->tbuf; byte *end = pos + ifa->tx_length; struct babel_pkt_header *pkt = (void *) pos; pkt->magic = BABEL_MAGIC; pkt->version = BABEL_VERSION; pkt->length = 0; pos += sizeof(struct babel_pkt_header); struct babel_msg_node *msg; WALK_LIST_FIRST(msg, *queue) { if (pos >= end) break; int len = babel_write_tlv((struct babel_tlv *) pos, &msg->msg, &state, end - pos); if (!len) break; pos += len; rem_node(NODE msg); sl_free(p->msg_slab, msg); } uint plen = pos - (byte *) pkt; put_u16(&pkt->length, plen - sizeof(struct babel_pkt_header)); return plen; } void babel_send_queue(void *arg) { struct babel_iface *ifa = arg; while ((babel_write_queue(ifa, &ifa->msg_queue) > 0) && (babel_send_to(ifa, IP6_BABEL_ROUTERS) > 0)); } static inline void babel_kick_queue(struct babel_iface *ifa) { /* * Only schedule send event if there is not already data in the socket buffer. * Otherwise we may overwrite the data already in the buffer. */ if ((ifa->sk->tpos == ifa->sk->tbuf) && !ev_active(ifa->send_event)) ev_schedule(ifa->send_event); } /** * babel_send_unicast - send a single TLV via unicast to a destination * @msg: TLV to send * @ifa: Interface to send via * @dest: Destination of the TLV * * This function is used to send a single TLV via unicast to a designated * receiver. This is used for replying to certain incoming requests, and for * sending unicast requests to refresh routes before they expire. */ void babel_send_unicast(union babel_msg *msg, struct babel_iface *ifa, ip_addr dest) { struct babel_proto *p = ifa->proto; struct babel_msg_node *msgn = sl_alloc(p->msg_slab); list queue; msgn->msg = *msg; init_list(&queue); add_tail(&queue, NODE msgn); babel_write_queue(ifa, &queue); babel_send_to(ifa, dest); /* We could overwrite waiting packet here, we may have to kick TX queue */ if (!EMPTY_LIST(ifa->msg_queue)) babel_kick_queue(ifa); } /** * babel_enqueue - enqueue a TLV for transmission on an interface * @msg: TLV to enqueue (in internal TLV format) * @ifa: Interface to enqueue to * * This function is called to enqueue a TLV for subsequent transmission on an * interface. The transmission event is triggered whenever a TLV is enqueued; * this ensures that TLVs will be transmitted in a timely manner, but that TLVs * which are enqueued in rapid succession can be transmitted together in one * packet. */ void babel_enqueue(union babel_msg *msg, struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; struct babel_msg_node *msgn = sl_alloc(p->msg_slab); msgn->msg = *msg; add_tail(&ifa->msg_queue, NODE msgn); babel_kick_queue(ifa); } /** * babel_process_packet - process incoming data packet * @pkt: Pointer to the packet data * @len: Length of received packet * @saddr: Address of packet sender * @ifa: Interface packet was received on. * * This function is the main processing hook of incoming Babel packets. It * checks that the packet header is well-formed, then processes the TLVs * contained in the packet. This is done in two passes: First all TLVs are * parsed into the internal TLV format. If a TLV parser fails, processing of the * rest of the packet is aborted. * * After the parsing step, the TLV handlers are called for each parsed TLV in * order. */ static void babel_process_packet(struct babel_pkt_header *pkt, int len, ip_addr saddr, struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; struct babel_tlv *tlv; struct babel_msg_node *msg; list msgs; int res; int plen = sizeof(struct babel_pkt_header) + get_u16(&pkt->length); byte *pos; byte *end = (byte *)pkt + plen; struct babel_parse_state state = { .proto = p, .ifa = ifa, .saddr = saddr, .next_hop = saddr, }; if ((pkt->magic != BABEL_MAGIC) || (pkt->version != BABEL_VERSION)) { TRACE(D_PACKETS, "Strange packet from %I via %s - magic %d version %d", saddr, ifa->iface->name, pkt->magic, pkt->version); return; } if (plen > len) { LOG_PKT("Bad packet from %I via %s - %s (%u)", saddr, ifa->iface->name, "length mismatch", plen); return; } TRACE(D_PACKETS, "Packet received from %I via %s", saddr, ifa->iface->name); init_list(&msgs); /* First pass through the packet TLV by TLV, parsing each into internal data structures. */ for (tlv = FIRST_TLV(pkt); (byte *)tlv < end; tlv = NEXT_TLV(tlv)) { /* Ugly special case */ if (tlv->type == BABEL_TLV_PAD1) continue; /* The end of the common TLV header */ pos = (byte *)tlv + sizeof(struct babel_tlv); if ((pos > end) || (pos + tlv->length > end)) { LOG_PKT("Bad TLV from %I via %s type %d pos %d - framing error", saddr, ifa->iface->name, tlv->type, (byte *)tlv - (byte *)pkt); break; } msg = sl_alloc(p->msg_slab); res = babel_read_tlv(tlv, &msg->msg, &state); if (res == PARSE_SUCCESS) { add_tail(&msgs, NODE msg); } else if (res == PARSE_IGNORE) { DBG("Babel: Ignoring TLV of type %d\n", tlv->type); sl_free(p->msg_slab, msg); } else /* PARSE_ERROR */ { LOG_PKT("Bad TLV from %I via %s type %d pos %d - parse error", saddr, ifa->iface->name, tlv->type, (byte *)tlv - (byte *)pkt); sl_free(p->msg_slab, msg); break; } } /* Parsing done, handle all parsed TLVs */ WALK_LIST_FIRST(msg, msgs) { if (tlv_data[msg->msg.type].handle_tlv) tlv_data[msg->msg.type].handle_tlv(&msg->msg, ifa); rem_node(NODE msg); sl_free(p->msg_slab, msg); } } static void babel_err_hook(sock *sk, int err) { struct babel_iface *ifa = sk->data; struct babel_proto *p = ifa->proto; log(L_ERR "%s: Socket error on %s: %M", p->p.name, ifa->iface->name, err); /* FIXME: Drop queued TLVs here? */ } static void babel_tx_hook(sock *sk) { struct babel_iface *ifa = sk->data; DBG("Babel: TX hook called (iface %s, src %I, dst %I)\n", sk->iface->name, sk->saddr, sk->daddr); babel_send_queue(ifa); } static int babel_rx_hook(sock *sk, uint len) { struct babel_iface *ifa = sk->data; struct babel_proto *p = ifa->proto; const char *err_dsc = NULL; uint err_val = 0; if (sk->lifindex != ifa->iface->index) return 1; DBG("Babel: RX hook called (iface %s, src %I, dst %I)\n", sk->iface->name, sk->faddr, sk->laddr); /* Silently ignore my own packets */ if (ipa_equal(ifa->iface->addr->ip, sk->faddr)) return 1; if (!ipa_is_link_local(sk->faddr)) DROP1("wrong src address"); if (sk->fport != ifa->cf->port) DROP("wrong src port", sk->fport); if (len < sizeof(struct babel_pkt_header)) DROP("too short", len); if (sk->flags & SKF_TRUNCATED) DROP("truncated", len); babel_process_packet((struct babel_pkt_header *) sk->rbuf, len, sk->faddr, ifa); return 1; drop: LOG_PKT("Bad packet from %I via %s - %s (%u)", sk->faddr, sk->iface->name, err_dsc, err_val); return 1; } int babel_open_socket(struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; sock *sk; sk = sk_new(ifa->pool); sk->type = SK_UDP; sk->sport = ifa->cf->port; sk->dport = ifa->cf->port; sk->iface = ifa->iface; sk->rx_hook = babel_rx_hook; sk->tx_hook = babel_tx_hook; sk->err_hook = babel_err_hook; sk->data = ifa; sk->tos = ifa->cf->tx_tos; sk->priority = ifa->cf->tx_priority; sk->ttl = 1; sk->flags = SKF_LADDR_RX; if (sk_open(sk) < 0) goto err; if (sk_setup_multicast(sk) < 0) goto err; if (sk_join_group(sk, IP6_BABEL_ROUTERS) < 0) goto err; ifa->sk = sk; return 1; err: sk_log_error(sk, p->p.name); rfree(sk); return 0; } bird-1.6.3/proto/babel/babel.c0000644000103200001440000015502213027054563015060 0ustar feelausers/* * BIRD -- The Babel protocol * * Copyright (c) 2015--2016 Toke Hoiland-Jorgensen * * Can be freely distributed and used under the terms of the GNU GPL. * * This file contains the main routines for handling and sending TLVs, as * well as timers and interaction with the nest. */ /** * DOC: The Babel protocol * * Babel (RFC6126) is a loop-avoiding distance-vector routing protocol that is * robust and efficient both in ordinary wired networks and in wireless mesh * networks. * * The Babel protocol keeps state for each neighbour in a &babel_neighbor * struct, tracking received Hello and I Heard You (IHU) messages. A * &babel_interface struct keeps hello and update times for each interface, and * a separate hello seqno is maintained for each interface. * * For each prefix, Babel keeps track of both the possible routes (with next hop * and router IDs), as well as the feasibility distance for each prefix and * router id. The prefix itself is tracked in a &babel_entry struct, while the * possible routes for the prefix are tracked as &babel_route entries and the * feasibility distance is maintained through &babel_source structures. * * The main route selection is done in babel_select_route(). This is called when * an entry is updated by receiving updates from the network or when modified by * internal timers. It performs feasibility checks on the available routes for * the prefix and selects the one with the lowest metric to be announced to the * core. */ #include #include "babel.h" #define OUR_ROUTE(r) (r->neigh == NULL) /* * Is one number greater or equal than another mod 2^16? This is based on the * definition of serial number space in RFC 1982. Note that arguments are of * uint type to avoid integer promotion to signed integer. */ static inline int ge_mod64k(uint a, uint b) { return (u16)(a - b) < 0x8000; } static void babel_dump_entry(struct babel_entry *e); static void babel_dump_route(struct babel_route *r); static void babel_select_route(struct babel_entry *e); static void babel_send_route_request(struct babel_entry *e, struct babel_neighbor *n); static void babel_send_wildcard_request(struct babel_iface *ifa); static int babel_cache_seqno_request(struct babel_proto *p, ip_addr prefix, u8 plen, u64 router_id, u16 seqno); static void babel_trigger_iface_update(struct babel_iface *ifa); static void babel_trigger_update(struct babel_proto *p); static void babel_send_seqno_request(struct babel_entry *e); static inline void babel_kick_timer(struct babel_proto *p); static inline void babel_iface_kick_timer(struct babel_iface *ifa); /* * Functions to maintain data structures */ static void babel_init_entry(struct fib_node *n) { struct babel_entry *e = (void *) n; e->proto = NULL; e->selected_in = NULL; e->selected_out = NULL; e->updated = now; init_list(&e->sources); init_list(&e->routes); } static inline struct babel_entry * babel_find_entry(struct babel_proto *p, ip_addr prefix, u8 plen) { return fib_find(&p->rtable, &prefix, plen); } static struct babel_entry * babel_get_entry(struct babel_proto *p, ip_addr prefix, u8 plen) { struct babel_entry *e = fib_get(&p->rtable, &prefix, plen); e->proto = p; return e; } static struct babel_source * babel_find_source(struct babel_entry *e, u64 router_id) { struct babel_source *s; WALK_LIST(s, e->sources) if (s->router_id == router_id) return s; return NULL; } static struct babel_source * babel_get_source(struct babel_entry *e, u64 router_id) { struct babel_proto *p = e->proto; struct babel_source *s = babel_find_source(e, router_id); if (s) return s; s = sl_alloc(p->source_slab); s->router_id = router_id; s->expires = now + BABEL_GARBAGE_INTERVAL; s->seqno = 0; s->metric = BABEL_INFINITY; add_tail(&e->sources, NODE s); return s; } static void babel_expire_sources(struct babel_entry *e) { struct babel_proto *p = e->proto; struct babel_source *n, *nx; WALK_LIST_DELSAFE(n, nx, e->sources) { if (n->expires && n->expires <= now) { rem_node(NODE n); sl_free(p->source_slab, n); } } } static struct babel_route * babel_find_route(struct babel_entry *e, struct babel_neighbor *n) { struct babel_route *r; WALK_LIST(r, e->routes) if (r->neigh == n) return r; return NULL; } static struct babel_route * babel_get_route(struct babel_entry *e, struct babel_neighbor *nbr) { struct babel_proto *p = e->proto; struct babel_route *r = babel_find_route(e, nbr); if (r) return r; r = sl_alloc(p->route_slab); memset(r, 0, sizeof(*r)); r->e = e; add_tail(&e->routes, NODE r); if (nbr) { r->neigh = nbr; r->expires = now + BABEL_GARBAGE_INTERVAL; add_tail(&nbr->routes, NODE &r->neigh_route); } return r; } static void babel_flush_route(struct babel_route *r) { struct babel_proto *p = r->e->proto; DBG("Babel: Flush route %I/%d router_id %lR neigh %I\n", r->e->n.prefix, r->e->n.pxlen, r->router_id, r->neigh ? r->neigh->addr : IPA_NONE); rem_node(NODE r); if (r->neigh) rem_node(&r->neigh_route); if (r->e->selected_in == r) r->e->selected_in = NULL; if (r->e->selected_out == r) r->e->selected_out = NULL; sl_free(p->route_slab, r); } static void babel_expire_route(struct babel_route *r) { struct babel_proto *p = r->e->proto; struct babel_entry *e = r->e; TRACE(D_EVENTS, "Route expiry timer for %I/%d router-id %lR fired", e->n.prefix, e->n.pxlen, r->router_id); if (r->metric < BABEL_INFINITY) { r->metric = BABEL_INFINITY; r->expires = now + r->expiry_interval; } else { babel_flush_route(r); } } static void babel_refresh_route(struct babel_route *r) { if (!OUR_ROUTE(r) && (r == r->e->selected_in)) babel_send_route_request(r->e, r->neigh); r->refresh_time = 0; } static void babel_expire_routes(struct babel_proto *p) { struct babel_entry *e; struct babel_route *r, *rx; struct fib_iterator fit; FIB_ITERATE_INIT(&fit, &p->rtable); loop: FIB_ITERATE_START(&p->rtable, &fit, n) { e = (struct babel_entry *) n; int changed = 0; WALK_LIST_DELSAFE(r, rx, e->routes) { if (r->refresh_time && r->refresh_time <= now) babel_refresh_route(r); if (r->expires && r->expires <= now) { babel_expire_route(r); changed = 1; } } if (changed) { /* * We have to restart the iteration because there may be a cascade of * synchronous events babel_select_route() -> nest table change -> * babel_rt_notify() -> p->rtable change, invalidating hidden variables. */ FIB_ITERATE_PUT(&fit, n); babel_select_route(e); goto loop; } babel_expire_sources(e); /* Remove empty entries */ if (EMPTY_LIST(e->sources) && EMPTY_LIST(e->routes)) { FIB_ITERATE_PUT(&fit, n); fib_delete(&p->rtable, e); goto loop; } } FIB_ITERATE_END(n); } static struct babel_neighbor * babel_find_neighbor(struct babel_iface *ifa, ip_addr addr) { struct babel_neighbor *nbr; WALK_LIST(nbr, ifa->neigh_list) if (ipa_equal(nbr->addr, addr)) return nbr; return NULL; } static struct babel_neighbor * babel_get_neighbor(struct babel_iface *ifa, ip_addr addr) { struct babel_neighbor *nbr = babel_find_neighbor(ifa, addr); if (nbr) return nbr; nbr = mb_allocz(ifa->pool, sizeof(struct babel_neighbor)); nbr->ifa = ifa; nbr->addr = addr; nbr->txcost = BABEL_INFINITY; init_list(&nbr->routes); add_tail(&ifa->neigh_list, NODE nbr); return nbr; } static void babel_flush_neighbor(struct babel_neighbor *nbr) { struct babel_proto *p = nbr->ifa->proto; node *n; TRACE(D_EVENTS, "Flushing neighbor %I", nbr->addr); WALK_LIST_FIRST(n, nbr->routes) { struct babel_route *r = SKIP_BACK(struct babel_route, neigh_route, n); struct babel_entry *e = r->e; int selected = (r == e->selected_in); babel_flush_route(r); if (selected) babel_select_route(e); } rem_node(NODE nbr); mb_free(nbr); } static void babel_expire_ihu(struct babel_neighbor *nbr) { nbr->txcost = BABEL_INFINITY; } static void babel_expire_hello(struct babel_neighbor *nbr) { nbr->hello_map <<= 1; if (nbr->hello_cnt < 16) nbr->hello_cnt++; if (!nbr->hello_map) babel_flush_neighbor(nbr); } static void babel_expire_neighbors(struct babel_proto *p) { struct babel_iface *ifa; struct babel_neighbor *nbr, *nbx; WALK_LIST(ifa, p->interfaces) { WALK_LIST_DELSAFE(nbr, nbx, ifa->neigh_list) { if (nbr->ihu_expiry && nbr->ihu_expiry <= now) babel_expire_ihu(nbr); if (nbr->hello_expiry && nbr->hello_expiry <= now) babel_expire_hello(nbr); } } } /* * Best route selection */ /* * From the RFC (section 3.5.1): * * a route advertisement carrying the quintuple (prefix, plen, router-id, seqno, * metric) is feasible if one of the following conditions holds: * * - metric is infinite; or * * - no entry exists in the source table indexed by (id, prefix, plen); or * * - an entry (prefix, plen, router-id, seqno', metric') exists in the source * table, and either * - seqno' < seqno or * - seqno = seqno' and metric < metric'. */ static inline int babel_is_feasible(struct babel_source *s, u16 seqno, u16 metric) { return !s || (metric == BABEL_INFINITY) || (seqno > s->seqno) || ((seqno == s->seqno) && (metric < s->metric)); } static u16 babel_compute_rxcost(struct babel_neighbor *n) { struct babel_iface *ifa = n->ifa; u8 cnt, missed; u16 map=n->hello_map; if (!map) return BABEL_INFINITY; cnt = u32_popcount(map); // number of bits set missed = n->hello_cnt-cnt; if (ifa->cf->type == BABEL_IFACE_TYPE_WIRELESS) { /* ETX - Appendix 2.2 in the RFC. beta = prob. of successful transmission. rxcost = BABEL_RXCOST_WIRELESS/beta Since: beta = 1-missed/n->hello_cnt = cnt/n->hello_cnt Then: rxcost = BABEL_RXCOST_WIRELESS * n->hello_cnt / cnt */ if (!cnt) return BABEL_INFINITY; return BABEL_RXCOST_WIRELESS * n->hello_cnt / cnt; } else { /* k-out-of-j selection - Appendix 2.1 in the RFC. */ DBG("Babel: Missed %d hellos from %I\n", missed, n->addr); /* Link is bad if more than half the expected hellos were lost */ return (missed > n->hello_cnt/2) ? BABEL_INFINITY : ifa->cf->rxcost; } } static u16 babel_compute_cost(struct babel_neighbor *n) { struct babel_iface *ifa = n->ifa; u16 rxcost = babel_compute_rxcost(n); if (rxcost == BABEL_INFINITY) return rxcost; else if (ifa->cf->type == BABEL_IFACE_TYPE_WIRELESS) { /* ETX - Appendix 2.2 in the RFC */ return (MAX(n->txcost, BABEL_RXCOST_WIRELESS) * rxcost)/BABEL_RXCOST_WIRELESS; } else { /* k-out-of-j selection - Appendix 2.1 in the RFC. */ return n->txcost; } } /* Simple additive metric - Appendix 3.1 in the RFC */ static u16 babel_compute_metric(struct babel_neighbor *n, uint metric) { metric += babel_compute_cost(n); return MIN(metric, BABEL_INFINITY); } /** * babel_announce_rte - announce selected route to the core * @p: Babel protocol instance * @e: Babel route entry to announce * * This function announces a Babel entry to the core if it has a selected * incoming path, and retracts it otherwise. If the selected entry has infinite * metric, the route is announced as unreachable. */ static void babel_announce_rte(struct babel_proto *p, struct babel_entry *e) { struct babel_route *r = e->selected_in; if (r) { net *n = net_get(p->p.table, e->n.prefix, e->n.pxlen); rta A = { .src = p->p.main_source, .source = RTS_BABEL, .scope = SCOPE_UNIVERSE, .cast = RTC_UNICAST, .dest = r->metric == BABEL_INFINITY ? RTD_UNREACHABLE : RTD_ROUTER, .flags = 0, .from = r->neigh->addr, .iface = r->neigh->ifa->iface, }; if (r->metric < BABEL_INFINITY) A.gw = r->next_hop; rta *a = rta_lookup(&A); rte *rte = rte_get_temp(a); rte->u.babel.metric = r->metric; rte->u.babel.router_id = r->router_id; rte->net = n; rte->pflags = 0; rte_update(&p->p, n, rte); } else { /* Retraction */ net *n = net_find(p->p.table, e->n.prefix, e->n.pxlen); rte_update(&p->p, n, NULL); } } /** * babel_select_route - select best route for given route entry * @e: Babel entry to select the best route for * * Select the best feasible route for a given prefix among the routes received * from peers, and propagate it to the nest. This just selects the feasible * route with the lowest metric. * * If no feasible route is available for a prefix that previously had a route * selected, a seqno request is sent to try to get a valid route. In the * meantime, the route is marked as infeasible in the nest (to blackhole packets * going to it, as per the RFC). * * If no feasible route is available, and no previous route is selected, the * route is removed from the nest entirely. */ static void babel_select_route(struct babel_entry *e) { struct babel_proto *p = e->proto; struct babel_route *r, *cur = e->selected_in; /* try to find the best feasible route */ WALK_LIST(r, e->routes) if (!OUR_ROUTE(r) && /* prevent propagating our own routes back to core */ (!cur || r->metric < cur->metric) && babel_is_feasible(babel_find_source(e, r->router_id), r->seqno, r->advert_metric)) cur = r; if (cur && !OUR_ROUTE(cur) && ((!e->selected_in && cur->metric < BABEL_INFINITY) || (e->selected_in && cur->metric < e->selected_in->metric))) { TRACE(D_EVENTS, "Picked new route for prefix %I/%d: router id %lR metric %d", e->n.prefix, e->n.pxlen, cur->router_id, cur->metric); e->selected_in = cur; e->updated = now; babel_announce_rte(p, e); } else if (!cur || cur->metric == BABEL_INFINITY) { /* Couldn't find a feasible route. If we have a selected route, that means it just became infeasible; so set it's metric to infinite and install it (as unreachable), then send a seqno request. babel_build_rte() will set the unreachable flag if the metric is BABEL_INFINITY.*/ if (e->selected_in) { TRACE(D_EVENTS, "Lost feasible route for prefix %I/%d", e->n.prefix, e->n.pxlen); e->selected_in->metric = BABEL_INFINITY; e->updated = now; babel_send_seqno_request(e); babel_announce_rte(p, e); /* Section 3.6 of the RFC forbids an infeasible from being selected. This is cleared after announcing the route to the core to make sure an unreachable route is propagated first. */ e->selected_in = NULL; } else { /* No route currently selected, and no new one selected; this means we don't have a route to this destination anymore (and were probably called from an expiry timer). Remove the route from the nest. */ TRACE(D_EVENTS, "Flushing route for prefix %I/%d", e->n.prefix, e->n.pxlen); e->selected_in = NULL; e->updated = now; babel_announce_rte(p, e); } } } /* * Functions to send replies */ static void babel_send_ack(struct babel_iface *ifa, ip_addr dest, u16 nonce) { struct babel_proto *p = ifa->proto; union babel_msg msg = {}; TRACE(D_PACKETS, "Sending ACK to %I with nonce %d", dest, nonce); msg.type = BABEL_TLV_ACK; msg.ack.nonce = nonce; babel_send_unicast(&msg, ifa, dest); } static void babel_build_ihu(union babel_msg *msg, struct babel_iface *ifa, struct babel_neighbor *n) { struct babel_proto *p = ifa->proto; msg->type = BABEL_TLV_IHU; msg->ihu.addr = n->addr; msg->ihu.rxcost = babel_compute_rxcost(n); msg->ihu.interval = ifa->cf->ihu_interval; TRACE(D_PACKETS, "Sending IHU for %I with rxcost %d interval %d", msg->ihu.addr, msg->ihu.rxcost, msg->ihu.interval); } static void babel_send_ihu(struct babel_iface *ifa, struct babel_neighbor *n) { union babel_msg msg = {}; babel_build_ihu(&msg, ifa, n); babel_send_unicast(&msg, ifa, n->addr); } static void babel_send_ihus(struct babel_iface *ifa) { struct babel_neighbor *n; WALK_LIST(n, ifa->neigh_list) { union babel_msg msg = {}; babel_build_ihu(&msg, ifa, n); babel_enqueue(&msg, ifa); } } static void babel_send_hello(struct babel_iface *ifa, u8 send_ihu) { struct babel_proto *p = ifa->proto; union babel_msg msg = {}; msg.type = BABEL_TLV_HELLO; msg.hello.seqno = ifa->hello_seqno++; msg.hello.interval = ifa->cf->hello_interval; TRACE(D_PACKETS, "Sending hello on %s with seqno %d interval %d", ifa->ifname, msg.hello.seqno, msg.hello.interval); babel_enqueue(&msg, ifa); if (send_ihu) babel_send_ihus(ifa); } static void babel_send_route_request(struct babel_entry *e, struct babel_neighbor *n) { struct babel_proto *p = e->proto; struct babel_iface *ifa = n->ifa; union babel_msg msg = {}; TRACE(D_PACKETS, "Sending route request for %I/%d to %I", e->n.prefix, e->n.pxlen, n->addr); msg.type = BABEL_TLV_ROUTE_REQUEST; msg.route_request.prefix = e->n.prefix; msg.route_request.plen = e->n.pxlen; babel_send_unicast(&msg, ifa, n->addr); } static void babel_send_wildcard_request(struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; union babel_msg msg = {}; TRACE(D_PACKETS, "Sending wildcard route request on %s", ifa->ifname); msg.type = BABEL_TLV_ROUTE_REQUEST; msg.route_request.full = 1; babel_enqueue(&msg, ifa); } static void babel_send_seqno_request(struct babel_entry *e) { struct babel_proto *p = e->proto; struct babel_route *r = e->selected_in; struct babel_iface *ifa = NULL; struct babel_source *s = NULL; union babel_msg msg = {}; s = babel_find_source(e, r->router_id); if (!s || !babel_cache_seqno_request(p, e->n.prefix, e->n.pxlen, r->router_id, s->seqno + 1)) return; TRACE(D_PACKETS, "Sending seqno request for %I/%d router-id %lR seqno %d", e->n.prefix, e->n.pxlen, r->router_id, s->seqno + 1); msg.type = BABEL_TLV_SEQNO_REQUEST; msg.seqno_request.plen = e->n.pxlen; msg.seqno_request.seqno = s->seqno + 1; msg.seqno_request.hop_count = BABEL_INITIAL_HOP_COUNT; msg.seqno_request.router_id = r->router_id; msg.seqno_request.prefix = e->n.prefix; WALK_LIST(ifa, p->interfaces) babel_enqueue(&msg, ifa); } static void babel_unicast_seqno_request(struct babel_route *r) { struct babel_entry *e = r->e; struct babel_proto *p = e->proto; struct babel_iface *ifa = r->neigh->ifa; struct babel_source *s = NULL; union babel_msg msg = {}; s = babel_find_source(e, r->router_id); if (!s || !babel_cache_seqno_request(p, e->n.prefix, e->n.pxlen, r->router_id, s->seqno + 1)) return; TRACE(D_PACKETS, "Sending seqno request for %I/%d router-id %lR seqno %d", e->n.prefix, e->n.pxlen, r->router_id, s->seqno + 1); msg.type = BABEL_TLV_SEQNO_REQUEST; msg.seqno_request.plen = e->n.pxlen; msg.seqno_request.seqno = s->seqno + 1; msg.seqno_request.hop_count = BABEL_INITIAL_HOP_COUNT; msg.seqno_request.router_id = r->router_id; msg.seqno_request.prefix = e->n.prefix; babel_send_unicast(&msg, ifa, r->neigh->addr); } /** * babel_send_update - send route table updates * @ifa: Interface to transmit on * @changed: Only send entries changed since this time * * This function produces update TLVs for all entries changed since the time * indicated by the &changed parameter and queues them for transmission on the * selected interface. During the process, the feasibility distance for each * transmitted entry is updated. */ static void babel_send_update(struct babel_iface *ifa, bird_clock_t changed) { struct babel_proto *p = ifa->proto; FIB_WALK(&p->rtable, n) { struct babel_entry *e = (void *) n; struct babel_route *r = e->selected_out; if (!r) continue; /* Our own seqno might have changed, in which case we update the routes we originate. */ if ((r->router_id == p->router_id) && (r->seqno < p->update_seqno)) { r->seqno = p->update_seqno; e->updated = now; } /* Skip routes that weren't updated since 'changed' time */ if (e->updated < changed) continue; TRACE(D_PACKETS, "Sending update for %I/%d router-id %lR seqno %d metric %d", e->n.prefix, e->n.pxlen, r->router_id, r->seqno, r->metric); union babel_msg msg = {}; msg.type = BABEL_TLV_UPDATE; msg.update.plen = e->n.pxlen; msg.update.interval = ifa->cf->update_interval; msg.update.seqno = r->seqno; msg.update.metric = r->metric; msg.update.prefix = e->n.prefix; msg.update.router_id = r->router_id; babel_enqueue(&msg, ifa); /* Update feasibility distance for redistributed routes */ if (!OUR_ROUTE(r)) { struct babel_source *s = babel_get_source(e, r->router_id); s->expires = now + BABEL_GARBAGE_INTERVAL; if ((msg.update.seqno > s->seqno) || ((msg.update.seqno == s->seqno) && (msg.update.metric < s->metric))) { s->seqno = msg.update.seqno; s->metric = msg.update.metric; } } } FIB_WALK_END; } static void babel_trigger_iface_update(struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; /* Interface not active or already scheduled */ if (!ifa->up || ifa->want_triggered) return; TRACE(D_EVENTS, "Scheduling triggered updates for %s seqno %d", ifa->iface->name, p->update_seqno); ifa->want_triggered = now; babel_iface_kick_timer(ifa); } /* Sends and update on all interfaces. */ static void babel_trigger_update(struct babel_proto *p) { if (p->triggered) return; struct babel_iface *ifa; WALK_LIST(ifa, p->interfaces) babel_trigger_iface_update(ifa); p->triggered = 1; } /* A retraction is an update with an infinite metric */ static void babel_send_retraction(struct babel_iface *ifa, ip_addr prefix, int plen) { struct babel_proto *p = ifa->proto; union babel_msg msg = {}; TRACE(D_PACKETS, "Sending retraction for %I/%d seqno %d", prefix, plen, p->update_seqno); msg.type = BABEL_TLV_UPDATE; msg.update.plen = plen; msg.update.interval = ifa->cf->update_interval; msg.update.seqno = p->update_seqno; msg.update.metric = BABEL_INFINITY; msg.update.prefix = prefix; babel_enqueue(&msg, ifa); } static void babel_send_wildcard_retraction(struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; union babel_msg msg = {}; TRACE(D_PACKETS, "Sending wildcard retraction on %s", ifa->ifname); msg.type = BABEL_TLV_UPDATE; msg.update.wildcard = 1; msg.update.interval = ifa->cf->update_interval; msg.update.seqno = p->update_seqno; msg.update.metric = BABEL_INFINITY; babel_enqueue(&msg, ifa); } /* * TLV handler helpers */ /* Update hello history according to Appendix A1 of the RFC */ static void babel_update_hello_history(struct babel_neighbor *n, u16 seqno, u16 interval) { /* * Compute the difference between expected and received seqno (modulo 2^16). * If the expected and received seqnos are within 16 of each other, the modular * difference is going to be less than 16 for one of the directions. Otherwise, * the values differ too much, so just reset the state. */ u16 delta = ((uint) seqno - (uint) n->next_hello_seqno); if (delta == 0) { /* Do nothing */ } else if (delta <= 16) { /* Sending node decreased interval; fast-forward */ n->hello_map <<= delta; n->hello_cnt = MIN(n->hello_cnt + delta, 16); } else if (delta >= 0xfff0) { u8 diff = (0xffff - delta); /* Sending node increased interval; undo history */ n->hello_map >>= diff; n->hello_cnt = (diff < n->hello_cnt) ? n->hello_cnt - diff : 0; } else { /* Note state reset - flush entries */ n->hello_map = n->hello_cnt = 0; } /* Current entry */ n->hello_map = (n->hello_map << 1) | 1; n->next_hello_seqno = seqno+1; if (n->hello_cnt < 16) n->hello_cnt++; n->hello_expiry = now + BABEL_HELLO_EXPIRY_FACTOR(interval); } static void babel_expire_seqno_requests(struct babel_proto *p) { struct babel_seqno_request *n, *nx; WALK_LIST_DELSAFE(n, nx, p->seqno_cache) { if ((n->updated + BABEL_SEQNO_REQUEST_EXPIRY) <= now) { rem_node(NODE n); sl_free(p->seqno_slab, n); } } } /* * Checks the seqno request cache for a matching request and returns failure if * found. Otherwise, a new entry is stored in the cache. */ static int babel_cache_seqno_request(struct babel_proto *p, ip_addr prefix, u8 plen, u64 router_id, u16 seqno) { struct babel_seqno_request *r; WALK_LIST(r, p->seqno_cache) { if (ipa_equal(r->prefix, prefix) && (r->plen == plen) && (r->router_id == router_id) && (r->seqno == seqno)) return 0; } /* no entries found */ r = sl_alloc(p->seqno_slab); r->prefix = prefix; r->plen = plen; r->router_id = router_id; r->seqno = seqno; r->updated = now; add_tail(&p->seqno_cache, NODE r); return 1; } static void babel_forward_seqno_request(struct babel_entry *e, struct babel_msg_seqno_request *in, ip_addr sender) { struct babel_proto *p = e->proto; struct babel_route *r; TRACE(D_PACKETS, "Forwarding seqno request for %I/%d router-id %lR seqno %d", e->n.prefix, e->n.pxlen, in->router_id, in->seqno); WALK_LIST(r, e->routes) { if ((r->router_id == in->router_id) && !OUR_ROUTE(r) && !ipa_equal(r->neigh->addr, sender)) { if (!babel_cache_seqno_request(p, e->n.prefix, e->n.pxlen, in->router_id, in->seqno)) return; union babel_msg msg = {}; msg.type = BABEL_TLV_SEQNO_REQUEST; msg.seqno_request.plen = in->plen; msg.seqno_request.seqno = in->seqno; msg.seqno_request.hop_count = in->hop_count-1; msg.seqno_request.router_id = in->router_id; msg.seqno_request.prefix = e->n.prefix; babel_send_unicast(&msg, r->neigh->ifa, r->neigh->addr); return; } } } /* * TLV handlers */ void babel_handle_ack_req(union babel_msg *m, struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; struct babel_msg_ack_req *msg = &m->ack_req; TRACE(D_PACKETS, "Handling ACK request nonce %d interval %d", msg->nonce, msg->interval); babel_send_ack(ifa, msg->sender, msg->nonce); } void babel_handle_hello(union babel_msg *m, struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; struct babel_msg_hello *msg = &m->hello; TRACE(D_PACKETS, "Handling hello seqno %d interval %d", msg->seqno, msg->interval); struct babel_neighbor *n = babel_get_neighbor(ifa, msg->sender); babel_update_hello_history(n, msg->seqno, msg->interval); if (ifa->cf->type == BABEL_IFACE_TYPE_WIRELESS) babel_send_ihu(ifa, n); } void babel_handle_ihu(union babel_msg *m, struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; struct babel_msg_ihu *msg = &m->ihu; /* Ignore IHUs that are not about us */ if ((msg->ae != BABEL_AE_WILDCARD) && !ipa_equal(msg->addr, ifa->addr)) return; TRACE(D_PACKETS, "Handling IHU rxcost %d interval %d", msg->rxcost, msg->interval); struct babel_neighbor *n = babel_get_neighbor(ifa, msg->sender); n->txcost = msg->rxcost; n->ihu_expiry = now + BABEL_IHU_EXPIRY_FACTOR(msg->interval); } /** * babel_handle_update - handle incoming route updates * @m: Incoming update TLV * @ifa: Interface the update was received on * * This function is called as a handler for update TLVs and handles the updating * and maintenance of route entries in Babel's internal routing cache. The * handling follows the actions described in the Babel RFC, and at the end of * each update handling, babel_select_route() is called on the affected entry to * optionally update the selected routes and propagate them to the core. */ void babel_handle_update(union babel_msg *m, struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; struct babel_msg_update *msg = &m->update; struct babel_neighbor *nbr; struct babel_entry *e; struct babel_source *s; struct babel_route *r; node *n; int feasible; TRACE(D_PACKETS, "Handling update for %I/%d with seqno %d metric %d", msg->prefix, msg->plen, msg->seqno, msg->metric); nbr = babel_find_neighbor(ifa, msg->sender); if (!nbr) { DBG("Babel: Haven't heard from neighbor %I; ignoring update.\n", msg->sender); return; } if (msg->router_id == p->router_id) { DBG("Babel: Ignoring update for our own router ID.\n"); return; } /* * RFC section 3.5.4: * * When a Babel node receives an update (id, prefix, seqno, metric) from a * neighbour neigh with a link cost value equal to cost, it checks whether it * already has a routing table entry indexed by (neigh, id, prefix). * * If no such entry exists: * * o if the update is unfeasible, it is ignored; * * o if the metric is infinite (the update is a retraction), the update is * ignored; * * o otherwise, a new route table entry is created, indexed by (neigh, id, * prefix), with seqno equal to seqno and an advertised metric equal to the * metric carried by the update. * * If such an entry exists: * * o if the entry is currently installed and the update is unfeasible, then * the behaviour depends on whether the router-ids of the two entries match. * If the router-ids are different, the update is treated as though it were * a retraction (i.e., as though the metric were FFFF hexadecimal). If the * router-ids are equal, the update is ignored; * * o otherwise (i.e., if either the update is feasible or the entry is not * currently installed), then the entry's sequence number, advertised * metric, metric, and router-id are updated and, unless the advertised * metric is infinite, the route's expiry timer is reset to a small multiple * of the Interval value included in the update. */ /* Retraction */ if (msg->metric == BABEL_INFINITY) { if (msg->wildcard) { /* * Special case: This is a retraction of all prefixes announced by this * neighbour (see second-to-last paragraph of section 4.4.9 in the RFC). */ WALK_LIST(n, nbr->routes) { r = SKIP_BACK(struct babel_route, neigh_route, n); r->metric = BABEL_INFINITY; babel_select_route(r->e); } } else { e = babel_find_entry(p, msg->prefix, msg->plen); if (!e) return; /* The route entry indexed by neighbour */ r = babel_find_route(e, nbr); if (!r) return; r->metric = BABEL_INFINITY; babel_select_route(e); } /* Done with retractions */ return; } e = babel_get_entry(p, msg->prefix, msg->plen); r = babel_find_route(e, nbr); /* the route entry indexed by neighbour */ s = babel_find_source(e, msg->router_id); /* for feasibility */ feasible = babel_is_feasible(s, msg->seqno, msg->metric); if (!r) { if (!feasible) return; r = babel_get_route(e, nbr); r->advert_metric = msg->metric; r->router_id = msg->router_id; r->metric = babel_compute_metric(nbr, msg->metric); r->next_hop = msg->next_hop; r->seqno = msg->seqno; } else if (r == r->e->selected_in && !feasible) { /* * Route is installed and update is infeasible - we may lose the route, * so send a unicast seqno request (section 3.8.2.2 second paragraph). */ babel_unicast_seqno_request(r); if (msg->router_id == r->router_id) return; /* Treat as retraction */ r->metric = BABEL_INFINITY; } else { /* Last paragraph above - update the entry */ r->advert_metric = msg->metric; r->metric = babel_compute_metric(nbr, msg->metric); r->next_hop = msg->next_hop; r->router_id = msg->router_id; r->seqno = msg->seqno; r->expiry_interval = BABEL_ROUTE_EXPIRY_FACTOR(msg->interval); r->expires = now + r->expiry_interval; if (r->expiry_interval > BABEL_ROUTE_REFRESH_INTERVAL) r->refresh_time = now + r->expiry_interval - BABEL_ROUTE_REFRESH_INTERVAL; /* If the route is not feasible at this point, it means it is from another neighbour than the one currently selected; so send a unicast seqno request to try to get a better route (section 3.8.2.2 last paragraph). */ if (!feasible) babel_unicast_seqno_request(r); } babel_select_route(e); } void babel_handle_route_request(union babel_msg *m, struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; struct babel_msg_route_request *msg = &m->route_request; /* RFC 6126 3.8.1.1 */ /* Wildcard request - full update on the interface */ if (msg->full) { TRACE(D_PACKETS, "Handling wildcard route request"); ifa->want_triggered = 1; return; } TRACE(D_PACKETS, "Handling route request for %I/%d", msg->prefix, msg->plen); /* Non-wildcard request - see if we have an entry for the route. If not, send a retraction, otherwise send an update. */ struct babel_entry *e = babel_find_entry(p, msg->prefix, msg->plen); if (!e) { babel_send_retraction(ifa, msg->prefix, msg->plen); } else { babel_trigger_iface_update(ifa); e->updated = now; } } void babel_handle_seqno_request(union babel_msg *m, struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; struct babel_msg_seqno_request *msg = &m->seqno_request; /* RFC 6126 3.8.1.2 */ TRACE(D_PACKETS, "Handling seqno request for %I/%d router-id %lR seqno %d hop count %d", msg->prefix, msg->plen, msg->router_id, msg->seqno, msg->hop_count); /* Ignore if we have no such entry or entry has infinite metric */ struct babel_entry *e = babel_find_entry(p, msg->prefix, msg->plen); if (!e || !e->selected_out || (e->selected_out->metric == BABEL_INFINITY)) return; /* Trigger update on incoming interface if we have a selected route with different router id or seqno no smaller than requested */ struct babel_route *r = e->selected_out; if ((r->router_id != msg->router_id) || ge_mod64k(r->seqno, msg->seqno)) { babel_trigger_iface_update(ifa); e->updated = now; return; } /* Seqno is larger; check if we own the router id */ if (msg->router_id == p->router_id) { /* Ours; update seqno and trigger global update */ p->update_seqno++; babel_trigger_update(p); } else { /* Not ours; forward if TTL allows it */ if (msg->hop_count > 1) babel_forward_seqno_request(e, msg, msg->sender); } } /* * Babel interfaces */ /** * babel_iface_timer - Babel interface timer handler * @t: Timer * * This function is called by the per-interface timer and triggers sending of * periodic Hello's and both triggered and periodic updates. Periodic Hello's * and updates are simply handled by setting the next_{hello,regular} variables * on the interface, and triggering an update (and resetting the variable) * whenever 'now' exceeds that value. * * For triggered updates, babel_trigger_iface_update() will set the * want_triggered field on the interface to a timestamp value. If this is set * (and the next_triggered time has passed; this is a rate limiting mechanism), * babel_send_update() will be called with this timestamp as the second * parameter. This causes updates to be send consisting of only the routes that * have changed since the time saved in want_triggered. * * Mostly when an update is triggered, the route being modified will be set to * the value of 'now' at the time of the trigger; the >= comparison for * selecting which routes to send in the update will make sure this is included. */ static void babel_iface_timer(timer *t) { struct babel_iface *ifa = t->data; struct babel_proto *p = ifa->proto; bird_clock_t hello_period = ifa->cf->hello_interval; bird_clock_t update_period = ifa->cf->update_interval; if (now >= ifa->next_hello) { babel_send_hello(ifa, (ifa->cf->type == BABEL_IFACE_TYPE_WIRELESS || ifa->hello_seqno % BABEL_IHU_INTERVAL_FACTOR == 0)); ifa->next_hello += hello_period * (1 + (now - ifa->next_hello) / hello_period); } if (now >= ifa->next_regular) { TRACE(D_EVENTS, "Sending regular updates on %s", ifa->ifname); babel_send_update(ifa, 0); ifa->next_regular += update_period * (1 + (now - ifa->next_regular) / update_period); ifa->want_triggered = 0; p->triggered = 0; } else if (ifa->want_triggered && (now >= ifa->next_triggered)) { TRACE(D_EVENTS, "Sending triggered updates on %s", ifa->ifname); babel_send_update(ifa, ifa->want_triggered); ifa->next_triggered = now + MIN(5, update_period / 2 + 1); ifa->want_triggered = 0; p->triggered = 0; } bird_clock_t next_event = MIN(ifa->next_hello, ifa->next_regular); tm_start(ifa->timer, ifa->want_triggered ? 1 : (next_event - now)); } static inline void babel_iface_kick_timer(struct babel_iface *ifa) { if (ifa->timer->expires > (now + 1)) tm_start(ifa->timer, 1); } static void babel_iface_start(struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; TRACE(D_EVENTS, "Starting interface %s", ifa->ifname); ifa->next_hello = now + (random() % ifa->cf->hello_interval) + 1; ifa->next_regular = now + (random() % ifa->cf->update_interval) + 1; ifa->next_triggered = now + MIN(5, ifa->cf->update_interval / 2 + 1); ifa->want_triggered = 0; /* We send an immediate update (below) */ tm_start(ifa->timer, 1); ifa->up = 1; babel_send_hello(ifa, 0); babel_send_wildcard_retraction(ifa); babel_send_wildcard_request(ifa); babel_send_update(ifa, 0); /* Full update */ } static void babel_iface_stop(struct babel_iface *ifa) { struct babel_proto *p = ifa->proto; struct babel_neighbor *nbr; struct babel_route *r; node *n; TRACE(D_EVENTS, "Stopping interface %s", ifa->ifname); /* * Rather than just flushing the neighbours, we set the metric of their routes * to infinity. This allows us to keep the neighbour hello state for when the * interface comes back up. The routes will also be kept until they expire. */ WALK_LIST(nbr, ifa->neigh_list) { WALK_LIST(n, nbr->routes) { r = SKIP_BACK(struct babel_route, neigh_route, n); r->metric = BABEL_INFINITY; r->expires = now + r->expiry_interval; babel_select_route(r->e); } } tm_stop(ifa->timer); ifa->up = 0; } static inline int babel_iface_link_up(struct babel_iface *ifa) { return !ifa->cf->check_link || (ifa->iface->flags & IF_LINK_UP); } static void babel_iface_update_state(struct babel_iface *ifa) { int up = ifa->sk && babel_iface_link_up(ifa); if (up == ifa->up) return; if (up) babel_iface_start(ifa); else babel_iface_stop(ifa); } static void babel_iface_update_buffers(struct babel_iface *ifa) { if (!ifa->sk) return; uint mtu = MAX(BABEL_MIN_MTU, ifa->iface->mtu); uint rbsize = ifa->cf->rx_buffer ?: mtu; uint tbsize = ifa->cf->tx_length ?: mtu; rbsize = MAX(rbsize, tbsize); sk_set_rbsize(ifa->sk, rbsize); sk_set_tbsize(ifa->sk, tbsize); ifa->tx_length = tbsize - BABEL_OVERHEAD; } static struct babel_iface* babel_find_iface(struct babel_proto *p, struct iface *what) { struct babel_iface *ifa; WALK_LIST (ifa, p->interfaces) if (ifa->iface == what) return ifa; return NULL; } static void babel_iface_locked(struct object_lock *lock) { struct babel_iface *ifa = lock->data; struct babel_proto *p = ifa->proto; if (!babel_open_socket(ifa)) { log(L_ERR "%s: Cannot open socket for %s", p->p.name, ifa->iface->name); return; } babel_iface_update_buffers(ifa); babel_iface_update_state(ifa); } static void babel_add_iface(struct babel_proto *p, struct iface *new, struct babel_iface_config *ic) { struct babel_iface *ifa; TRACE(D_EVENTS, "Adding interface %s", new->name); pool *pool = rp_new(p->p.pool, new->name); ifa = mb_allocz(pool, sizeof(struct babel_iface)); ifa->proto = p; ifa->iface = new; ifa->cf = ic; ifa->pool = pool; ifa->ifname = new->name; add_tail(&p->interfaces, NODE ifa); struct ifa *addr; WALK_LIST(addr, new->addrs) if (ipa_is_link_local(addr->ip)) ifa->addr = addr->ip; if (ipa_zero(ifa->addr)) log(L_WARN "%s: Cannot find link-local addr on %s", p->p.name, new->name); init_list(&ifa->neigh_list); ifa->hello_seqno = 1; ifa->timer = tm_new_set(ifa->pool, babel_iface_timer, ifa, 0, 0); init_list(&ifa->msg_queue); ifa->send_event = ev_new(ifa->pool); ifa->send_event->hook = babel_send_queue; ifa->send_event->data = ifa; struct object_lock *lock = olock_new(ifa->pool); lock->type = OBJLOCK_UDP; lock->addr = IP6_BABEL_ROUTERS; lock->port = ifa->cf->port; lock->iface = ifa->iface; lock->hook = babel_iface_locked; lock->data = ifa; olock_acquire(lock); } static void babel_remove_iface(struct babel_proto *p, struct babel_iface *ifa) { TRACE(D_EVENTS, "Removing interface %s", ifa->iface->name); struct babel_neighbor *n; WALK_LIST_FIRST(n, ifa->neigh_list) babel_flush_neighbor(n); rem_node(NODE ifa); rfree(ifa->pool); /* contains ifa itself, locks, socket, etc */ } static void babel_if_notify(struct proto *P, unsigned flags, struct iface *iface) { struct babel_proto *p = (void *) P; struct babel_config *cf = (void *) P->cf; if (iface->flags & IF_IGNORE) return; if (flags & IF_CHANGE_UP) { struct babel_iface_config *ic = (void *) iface_patt_find(&cf->iface_list, iface, iface->addr); /* we only speak multicast */ if (!(iface->flags & IF_MULTICAST)) return; if (ic) babel_add_iface(p, iface, ic); return; } struct babel_iface *ifa = babel_find_iface(p, iface); if (!ifa) return; if (flags & IF_CHANGE_DOWN) { babel_remove_iface(p, ifa); return; } if (flags & IF_CHANGE_MTU) babel_iface_update_buffers(ifa); if (flags & IF_CHANGE_LINK) babel_iface_update_state(ifa); } static int babel_reconfigure_iface(struct babel_proto *p, struct babel_iface *ifa, struct babel_iface_config *new) { struct babel_iface_config *old = ifa->cf; /* Change of these options would require to reset the iface socket */ if ((new->port != old->port) || (new->tx_tos != old->tx_tos) || (new->tx_priority != old->tx_priority)) return 0; TRACE(D_EVENTS, "Reconfiguring interface %s", ifa->iface->name); ifa->cf = new; if (ifa->next_hello > (now + new->hello_interval)) ifa->next_hello = now + (random() % new->hello_interval) + 1; if (ifa->next_regular > (now + new->update_interval)) ifa->next_regular = now + (random() % new->update_interval) + 1; if ((new->tx_length != old->tx_length) || (new->rx_buffer != old->rx_buffer)) babel_iface_update_buffers(ifa); if (new->check_link != old->check_link) babel_iface_update_state(ifa); if (ifa->up) babel_iface_kick_timer(ifa); return 1; } static void babel_reconfigure_ifaces(struct babel_proto *p, struct babel_config *cf) { struct iface *iface; WALK_LIST(iface, iface_list) { if (! (iface->flags & IF_UP)) continue; struct babel_iface *ifa = babel_find_iface(p, iface); struct babel_iface_config *ic = (void *) iface_patt_find(&cf->iface_list, iface, NULL); if (ifa && ic) { if (babel_reconfigure_iface(p, ifa, ic)) continue; /* Hard restart */ log(L_INFO "%s: Restarting interface %s", p->p.name, ifa->iface->name); babel_remove_iface(p, ifa); babel_add_iface(p, iface, ic); } if (ifa && !ic) babel_remove_iface(p, ifa); if (!ifa && ic) babel_add_iface(p, iface, ic); } } /* * Debugging and info output functions */ static void babel_dump_source(struct babel_source *s) { debug("Source router_id %lR seqno %d metric %d expires %d\n", s->router_id, s->seqno, s->metric, s->expires ? s->expires-now : 0); } static void babel_dump_route(struct babel_route *r) { debug("Route neigh %I if %s seqno %d metric %d/%d router_id %lR expires %d\n", r->neigh ? r->neigh->addr : IPA_NONE, r->neigh ? r->neigh->ifa->ifname : "(none)", r->seqno, r->advert_metric, r->metric, r->router_id, r->expires ? r->expires-now : 0); } static void babel_dump_entry(struct babel_entry *e) { struct babel_source *s; struct babel_route *r; debug("Babel: Entry %I/%d:\n", e->n.prefix, e->n.pxlen); WALK_LIST(s,e->sources) { debug(" "); babel_dump_source(s); } WALK_LIST(r,e->routes) { debug(" "); if (r == e->selected_out) debug("*"); if (r == e->selected_in) debug("+"); babel_dump_route(r); } } static void babel_dump_neighbor(struct babel_neighbor *n) { debug("Neighbor %I txcost %d hello_map %x next seqno %d expires %d/%d\n", n->addr, n->txcost, n->hello_map, n->next_hello_seqno, n->hello_expiry ? n->hello_expiry - now : 0, n->ihu_expiry ? n->ihu_expiry - now : 0); } static void babel_dump_iface(struct babel_iface *ifa) { struct babel_neighbor *n; debug("Babel: Interface %s addr %I rxcost %d type %d hello seqno %d intervals %d %d\n", ifa->ifname, ifa->addr, ifa->cf->rxcost, ifa->cf->type, ifa->hello_seqno, ifa->cf->hello_interval, ifa->cf->update_interval); WALK_LIST(n, ifa->neigh_list) { debug(" "); babel_dump_neighbor(n); } } static void babel_dump(struct proto *P) { struct babel_proto *p = (struct babel_proto *) P; struct babel_iface *ifa; debug("Babel: router id %lR update seqno %d\n", p->router_id, p->update_seqno); WALK_LIST(ifa, p->interfaces) babel_dump_iface(ifa); FIB_WALK(&p->rtable, n) { babel_dump_entry((struct babel_entry *) n); } FIB_WALK_END; } static void babel_get_route_info(rte *rte, byte *buf, ea_list *attrs UNUSED) { buf += bsprintf(buf, " (%d/%d) [%lR]", rte->pref, rte->u.babel.metric, rte->u.babel.router_id); } static int babel_get_attr(eattr *a, byte *buf, int buflen UNUSED) { switch (a->id) { case EA_BABEL_METRIC: bsprintf(buf, "metric: %d", a->u.data); return GA_FULL; case EA_BABEL_ROUTER_ID: { u64 rid = 0; memcpy(&rid, a->u.ptr->data, sizeof(u64)); bsprintf(buf, "router_id: %lR", rid); return GA_FULL; } default: return GA_UNKNOWN; } } void babel_show_interfaces(struct proto *P, char *iff) { struct babel_proto *p = (void *) P; struct babel_iface *ifa = NULL; struct babel_neighbor *nbr = NULL; if (p->p.proto_state != PS_UP) { cli_msg(-1023, "%s: is not up", p->p.name); cli_msg(0, ""); return; } cli_msg(-1023, "%s:", p->p.name); cli_msg(-1023, "%-10s %-6s %7s %6s %6s", "Interface", "State", "RX cost", "Nbrs", "Timer"); WALK_LIST(ifa, p->interfaces) { if (iff && !patmatch(iff, ifa->iface->name)) continue; int nbrs = 0; WALK_LIST(nbr, ifa->neigh_list) nbrs++; int timer = MIN(ifa->next_regular, ifa->next_hello) - now; cli_msg(-1023, "%-10s %-6s %7u %6u %6u", ifa->iface->name, (ifa->up ? "Up" : "Down"), ifa->cf->rxcost, nbrs, MAX(timer, 0)); } cli_msg(0, ""); } void babel_show_neighbors(struct proto *P, char *iff) { struct babel_proto *p = (void *) P; struct babel_iface *ifa = NULL; struct babel_neighbor *n = NULL; struct babel_route *r = NULL; if (p->p.proto_state != PS_UP) { cli_msg(-1024, "%s: is not up", p->p.name); cli_msg(0, ""); return; } cli_msg(-1024, "%s:", p->p.name); cli_msg(-1024, "%-25s %-10s %6s %6s %10s", "IP address", "Interface", "Metric", "Routes", "Next hello"); WALK_LIST(ifa, p->interfaces) { if (iff && !patmatch(iff, ifa->iface->name)) continue; WALK_LIST(n, ifa->neigh_list) { int rts = 0; WALK_LIST(r, n->routes) rts++; int timer = n->hello_expiry - now; cli_msg(-1024, "%-25I %-10s %6u %6u %10u", n->addr, ifa->iface->name, n->txcost, rts, MAX(timer, 0)); } } cli_msg(0, ""); } void babel_show_entries(struct proto *P) { struct babel_proto *p = (void *) P; struct babel_entry *e = NULL; struct babel_source *s = NULL; struct babel_route *r = NULL; char ipbuf[STD_ADDRESS_P_LENGTH+5]; char ridbuf[ROUTER_ID_64_LENGTH+1]; if (p->p.proto_state != PS_UP) { cli_msg(-1025, "%s: is not up", p->p.name); cli_msg(0, ""); return; } cli_msg(-1025, "%s:", p->p.name); cli_msg(-1025, "%-29s %-23s %6s %5s %7s %7s", "Prefix", "Router ID", "Metric", "Seqno", "Expires", "Sources"); FIB_WALK(&p->rtable, n) { e = (struct babel_entry *) n; r = e->selected_in ? e->selected_in : e->selected_out; int srcs = 0; WALK_LIST(s, e->sources) srcs++; bsprintf(ipbuf, "%I/%u", e->n.prefix, e->n.pxlen); if (r) { if (r->router_id == p->router_id) bsprintf(ridbuf, "%s", ""); else bsprintf(ridbuf, "%lR", r->router_id); int time = r->expires ? r->expires - now : 0; cli_msg(-1025, "%-29s %-23s %6u %5u %7u %7u", ipbuf, ridbuf, r->metric, r->seqno, MAX(time, 0), srcs); } else { cli_msg(-1025, "%-29s %-44s %7u", ipbuf, "", srcs); } } FIB_WALK_END; cli_msg(0, ""); } /* * Babel protocol glue */ /** * babel_timer - global timer hook * @t: Timer * * This function is called by the global protocol instance timer and handles * expiration of routes and neighbours as well as pruning of the seqno request * cache. */ static void babel_timer(timer *t) { struct babel_proto *p = t->data; babel_expire_routes(p); babel_expire_seqno_requests(p); babel_expire_neighbors(p); } static inline void babel_kick_timer(struct babel_proto *p) { if (p->timer->expires > (now + 1)) tm_start(p->timer, 1); } static struct ea_list * babel_prepare_attrs(struct linpool *pool, ea_list *next, uint metric, u64 router_id) { struct ea_list *l = lp_alloc(pool, sizeof(struct ea_list) + 2*sizeof(eattr)); struct adata *rid = lp_alloc(pool, sizeof(struct adata) + sizeof(u64)); rid->length = sizeof(u64); memcpy(&rid->data, &router_id, sizeof(u64)); l->next = next; l->flags = EALF_SORTED; l->count = 2; l->attrs[0].id = EA_BABEL_METRIC; l->attrs[0].flags = 0; l->attrs[0].type = EAF_TYPE_INT | EAF_TEMP; l->attrs[0].u.data = metric; l->attrs[1].id = EA_BABEL_ROUTER_ID; l->attrs[1].flags = 0; l->attrs[1].type = EAF_TYPE_OPAQUE | EAF_TEMP; l->attrs[1].u.ptr = rid; return l; } static int babel_import_control(struct proto *P, struct rte **rt, struct ea_list **attrs, struct linpool *pool) { struct babel_proto *p = (void *) P; /* Prepare attributes with initial values */ if ((*rt)->attrs->source != RTS_BABEL) *attrs = babel_prepare_attrs(pool, NULL, 0, p->router_id); return 0; } static struct ea_list * babel_make_tmp_attrs(struct rte *rt, struct linpool *pool) { return babel_prepare_attrs(pool, NULL, rt->u.babel.metric, rt->u.babel.router_id); } static void babel_store_tmp_attrs(struct rte *rt, struct ea_list *attrs) { rt->u.babel.metric = ea_get_int(attrs, EA_BABEL_METRIC, 0); } /* * babel_rt_notify - core tells us about new route (possibly our own), * so store it into our data structures. */ static void babel_rt_notify(struct proto *P, struct rtable *table UNUSED, struct network *net, struct rte *new, struct rte *old UNUSED, struct ea_list *attrs UNUSED) { struct babel_proto *p = (void *) P; struct babel_entry *e; struct babel_route *r; if (new) { /* Update */ e = babel_get_entry(p, net->n.prefix, net->n.pxlen); if (new->attrs->src->proto != P) { r = babel_get_route(e, NULL); r->seqno = p->update_seqno; r->router_id = p->router_id; r->metric = 0; /* FIXME: should be selectable */ } else r = e->selected_in; if (r != e->selected_out) { e->selected_out = r; e->updated = now; babel_trigger_update(p); } } else { /* Withdraw */ e = babel_find_entry(p, net->n.prefix, net->n.pxlen); if (!e || !e->selected_out) return; if (OUR_ROUTE(e->selected_out)) { /* * We originate this route, so set its metric to infinity and set an * expiry time. This causes a retraction to be sent, and later the route * to be flushed once the hold time has passed. */ e->selected_out->metric = BABEL_INFINITY; e->selected_out->expires = now + BABEL_HOLD_TIME; e->updated = now; babel_trigger_update(p); } else { /* * This is a route originating from someone else that was lost; presumably * because an export filter was updated to filter it. This means we can't * set the metric to infinity (it would be overridden on subsequent * updates from the peer originating the route), so just clear the * exported route. * * This causes peers to expire the route after a while (like if we just * shut down), but it's the best we can do in these circumstances; and * since export filters presumably aren't updated that often this is * acceptable. */ e->selected_out = NULL; } } } static int babel_rte_better(struct rte *new, struct rte *old) { return new->u.babel.metric < old->u.babel.metric; } static int babel_rte_same(struct rte *new, struct rte *old) { return ((new->u.babel.router_id == old->u.babel.router_id) && (new->u.babel.metric == old->u.babel.metric)); } static struct proto * babel_init(struct proto_config *cfg) { struct proto *P = proto_new(cfg, sizeof(struct babel_proto)); P->accept_ra_types = RA_OPTIMAL; P->if_notify = babel_if_notify; P->rt_notify = babel_rt_notify; P->import_control = babel_import_control; P->make_tmp_attrs = babel_make_tmp_attrs; P->store_tmp_attrs = babel_store_tmp_attrs; P->rte_better = babel_rte_better; P->rte_same = babel_rte_same; return P; } static int babel_start(struct proto *P) { struct babel_proto *p = (void *) P; struct babel_config *cf = (void *) P->cf; fib_init(&p->rtable, P->pool, sizeof(struct babel_entry), 0, babel_init_entry); init_list(&p->interfaces); p->timer = tm_new_set(P->pool, babel_timer, p, 0, 1); tm_start(p->timer, 2); p->update_seqno = 1; p->router_id = proto_get_router_id(&cf->c); p->route_slab = sl_new(P->pool, sizeof(struct babel_route)); p->source_slab = sl_new(P->pool, sizeof(struct babel_source)); p->msg_slab = sl_new(P->pool, sizeof(struct babel_msg_node)); p->seqno_slab = sl_new(P->pool, sizeof(struct babel_seqno_request)); init_list(&p->seqno_cache); p->log_pkt_tbf = (struct tbf){ .rate = 1, .burst = 5 }; return PS_UP; } static inline void babel_iface_shutdown(struct babel_iface *ifa) { if (ifa->sk) { babel_send_wildcard_retraction(ifa); babel_send_queue(ifa); } } static int babel_shutdown(struct proto *P) { struct babel_proto *p = (void *) P; struct babel_iface *ifa; TRACE(D_EVENTS, "Shutdown requested"); WALK_LIST(ifa, p->interfaces) babel_iface_shutdown(ifa); return PS_DOWN; } static int babel_reconfigure(struct proto *P, struct proto_config *c) { struct babel_proto *p = (void *) P; struct babel_config *new = (void *) c; TRACE(D_EVENTS, "Reconfiguring"); p->p.cf = c; babel_reconfigure_ifaces(p, new); babel_trigger_update(p); babel_kick_timer(p); return 1; } struct protocol proto_babel = { .name = "Babel", .template = "babel%d", .attr_class = EAP_BABEL, .preference = DEF_PREF_BABEL, .config_size = sizeof(struct babel_config), .init = babel_init, .dump = babel_dump, .start = babel_start, .shutdown = babel_shutdown, .reconfigure = babel_reconfigure, .get_route_info = babel_get_route_info, .get_attr = babel_get_attr }; bird-1.6.3/proto/babel/Doc0000644000103200001440000000002613027054563014270 0ustar feelausersS babel.c S packets.c bird-1.6.3/proto/babel/config.Y0000644000103200001440000001000213027054563015232 0ustar feelausers/* * BIRD -- Babel Configuration * * Copyright (c) 2015-2016 Toke Hoiland-Jorgensen * * Can be freely distributed and used under the terms of the GNU GPL. */ CF_HDR #include "proto/babel/babel.h" #include "nest/iface.h" CF_DEFINES #define BABEL_CFG ((struct babel_config *) this_proto) #define BABEL_IFACE ((struct babel_iface_config *) this_ipatt) CF_DECLS CF_KEYWORDS(BABEL, METRIC, RXCOST, HELLO, UPDATE, INTERVAL, PORT, WIRED, WIRELESS, RX, TX, BUFFER, LENGTH, CHECK, LINK, BABEL_METRIC) CF_GRAMMAR CF_ADDTO(proto, babel_proto) babel_proto_start: proto_start BABEL { this_proto = proto_config_new(&proto_babel, $1); init_list(&BABEL_CFG->iface_list); }; babel_proto_item: proto_item | INTERFACE babel_iface ; babel_proto_opts: /* empty */ | babel_proto_opts babel_proto_item ';' ; babel_proto: babel_proto_start proto_name '{' babel_proto_opts '}'; babel_iface_start: { this_ipatt = cfg_allocz(sizeof(struct babel_iface_config)); add_tail(&BABEL_CFG->iface_list, NODE this_ipatt); init_list(&this_ipatt->ipn_list); BABEL_IFACE->port = BABEL_PORT; BABEL_IFACE->type = BABEL_IFACE_TYPE_WIRED; BABEL_IFACE->tx_tos = IP_PREC_INTERNET_CONTROL; BABEL_IFACE->tx_priority = sk_priority_control; BABEL_IFACE->check_link = 1; }; babel_iface_finish: { if (BABEL_IFACE->type == BABEL_IFACE_TYPE_WIRELESS) { if (!BABEL_IFACE->hello_interval) BABEL_IFACE->hello_interval = BABEL_HELLO_INTERVAL_WIRELESS; if (!BABEL_IFACE->rxcost) BABEL_IFACE->rxcost = BABEL_RXCOST_WIRELESS; } else { if (!BABEL_IFACE->hello_interval) BABEL_IFACE->hello_interval = BABEL_HELLO_INTERVAL_WIRED; if (!BABEL_IFACE->rxcost) BABEL_IFACE->rxcost = BABEL_RXCOST_WIRED; } /* Make sure we do not overflow the 16-bit centisec fields */ if (!BABEL_IFACE->update_interval) BABEL_IFACE->update_interval = MIN_(BABEL_IFACE->hello_interval*BABEL_UPDATE_INTERVAL_FACTOR, BABEL_MAX_INTERVAL); BABEL_IFACE->ihu_interval = MIN_(BABEL_IFACE->hello_interval*BABEL_IHU_INTERVAL_FACTOR, BABEL_MAX_INTERVAL); }; babel_iface_item: | PORT expr { BABEL_IFACE->port = $2; if (($2<1) || ($2>65535)) cf_error("Invalid port number"); } | RXCOST expr { BABEL_IFACE->rxcost = $2; if (($2<1) || ($2>65535)) cf_error("Invalid rxcost"); } | HELLO INTERVAL expr { BABEL_IFACE->hello_interval = $3; if (($3<1) || ($3>BABEL_MAX_INTERVAL)) cf_error("Invalid hello interval"); } | UPDATE INTERVAL expr { BABEL_IFACE->update_interval = $3; if (($3<1) || ($3>BABEL_MAX_INTERVAL)) cf_error("Invalid update interval"); } | TYPE WIRED { BABEL_IFACE->type = BABEL_IFACE_TYPE_WIRED; } | TYPE WIRELESS { BABEL_IFACE->type = BABEL_IFACE_TYPE_WIRELESS; } | RX BUFFER expr { BABEL_IFACE->rx_buffer = $3; if (($3<256) || ($3>65535)) cf_error("RX buffer must be in range 256-65535"); } | TX LENGTH expr { BABEL_IFACE->tx_length = $3; if (($3<256) || ($3>65535)) cf_error("TX length must be in range 256-65535"); } | TX tos { BABEL_IFACE->tx_tos = $2; } | TX PRIORITY expr { BABEL_IFACE->tx_priority = $3; } | CHECK LINK bool { BABEL_IFACE->check_link = $3; } ; babel_iface_opts: /* empty */ | babel_iface_opts babel_iface_item ';' ; babel_iface_opt_list: /* empty */ | '{' babel_iface_opts '}' ; babel_iface: babel_iface_start iface_patt_list_nopx babel_iface_opt_list babel_iface_finish; CF_ADDTO(dynamic_attr, BABEL_METRIC { $$ = f_new_dynamic_attr(EAF_TYPE_INT | EAF_TEMP, T_INT, EA_BABEL_METRIC); }) CF_CLI_HELP(SHOW BABEL, ..., [[Show information about Babel protocol]]); CF_CLI(SHOW BABEL INTERFACES, optsym opttext, [] [\"\"], [[Show information about Babel interfaces]]) { babel_show_interfaces(proto_get_named($4, &proto_babel), $5); }; CF_CLI(SHOW BABEL NEIGHBORS, optsym opttext, [] [\"\"], [[Show information about Babel neighbors]]) { babel_show_neighbors(proto_get_named($4, &proto_babel), $5); }; CF_CLI(SHOW BABEL ENTRIES, optsym opttext, [], [[Show information about Babel prefix entries]]) { babel_show_entries(proto_get_named($4, &proto_babel)); }; CF_CODE CF_END bird-1.6.3/proto/babel/babel.h0000644000103200001440000001667213027054563015074 0ustar feelausers/* * BIRD -- The Babel protocol * * Copyright (c) 2015--2016 Toke Hoiland-Jorgensen * * Can be freely distributed and used under the terms of the GNU GPL. * * This file contains the data structures used by Babel. */ #ifndef _BIRD_BABEL_H_ #define _BIRD_BABEL_H_ #include "nest/bird.h" #include "nest/cli.h" #include "nest/iface.h" #include "nest/route.h" #include "nest/protocol.h" #include "nest/locks.h" #include "lib/resource.h" #include "lib/lists.h" #include "lib/socket.h" #include "lib/string.h" #include "lib/timer.h" #ifndef IPV6 #error "The Babel protocol only speaks IPv6" #endif #define EA_BABEL_METRIC EA_CODE(EAP_BABEL, 0) #define EA_BABEL_ROUTER_ID EA_CODE(EAP_BABEL, 1) #define BABEL_MAGIC 42 #define BABEL_VERSION 2 #define BABEL_PORT 6696 #define BABEL_INFINITY 0xFFFF #define BABEL_HELLO_INTERVAL_WIRED 4 /* Default hello intervals in seconds */ #define BABEL_HELLO_INTERVAL_WIRELESS 4 #define BABEL_UPDATE_INTERVAL_FACTOR 4 #define BABEL_IHU_INTERVAL_FACTOR 3 #define BABEL_IHU_EXPIRY_FACTOR(X) ((X)*3/2) /* 1.5 */ #define BABEL_HELLO_EXPIRY_FACTOR(X) ((X)*3/2) /* 1.5 */ #define BABEL_ROUTE_EXPIRY_FACTOR(X) ((X)*7/2) /* 3.5 */ #define BABEL_ROUTE_REFRESH_INTERVAL 2 /* Seconds before route expiry to send route request */ #define BABEL_HOLD_TIME 10 /* Expiry time for our own routes */ #define BABEL_RXCOST_WIRED 96 #define BABEL_RXCOST_WIRELESS 256 #define BABEL_INITIAL_HOP_COUNT 255 #define BABEL_MAX_SEND_INTERVAL 5 #define BABEL_TIME_UNITS 100 /* On-wire times are counted in centiseconds */ #define BABEL_SEQNO_REQUEST_EXPIRY 60 #define BABEL_GARBAGE_INTERVAL 300 /* Max interval that will not overflow when carried as 16-bit centiseconds */ #define BABEL_MAX_INTERVAL (0xFFFF/BABEL_TIME_UNITS) #define BABEL_OVERHEAD (SIZE_OF_IP_HEADER+UDP_HEADER_LENGTH) #define BABEL_MIN_MTU (512 + BABEL_OVERHEAD) enum babel_tlv_type { BABEL_TLV_PAD1 = 0, BABEL_TLV_PADN = 1, BABEL_TLV_ACK_REQ = 2, BABEL_TLV_ACK = 3, BABEL_TLV_HELLO = 4, BABEL_TLV_IHU = 5, BABEL_TLV_ROUTER_ID = 6, BABEL_TLV_NEXT_HOP = 7, BABEL_TLV_UPDATE = 8, BABEL_TLV_ROUTE_REQUEST = 9, BABEL_TLV_SEQNO_REQUEST = 10, /* extensions - not implemented BABEL_TLV_TS_PC = 11, BABEL_TLV_HMAC = 12, BABEL_TLV_SS_UPDATE = 13, BABEL_TLV_SS_REQUEST = 14, BABEL_TLV_SS_SEQNO_REQUEST = 15, */ BABEL_TLV_MAX }; enum babel_iface_type { /* In practice, UNDEF and WIRED give equivalent behaviour */ BABEL_IFACE_TYPE_UNDEF = 0, BABEL_IFACE_TYPE_WIRED = 1, BABEL_IFACE_TYPE_WIRELESS = 2, BABEL_IFACE_TYPE_MAX }; enum babel_ae_type { BABEL_AE_WILDCARD = 0, BABEL_AE_IP4 = 1, BABEL_AE_IP6 = 2, BABEL_AE_IP6_LL = 3, BABEL_AE_MAX }; struct babel_config { struct proto_config c; list iface_list; /* Patterns configured -- keep it first; see babel_reconfigure why */ }; struct babel_iface_config { struct iface_patt i; u16 rxcost; u8 type; u8 check_link; uint port; u16 hello_interval; u16 ihu_interval; u16 update_interval; u16 rx_buffer; /* RX buffer size, 0 for MTU */ u16 tx_length; /* TX packet length limit (including headers), 0 for MTU */ int tx_tos; int tx_priority; }; struct babel_proto { struct proto p; timer *timer; struct fib rtable; list interfaces; /* Interfaces we really know about (struct babel_iface) */ u64 router_id; u16 update_seqno; /* To be increased on request */ u8 triggered; /* For triggering global updates */ slab *route_slab; slab *source_slab; slab *msg_slab; slab *seqno_slab; list seqno_cache; /* Seqno requests in the cache (struct babel_seqno_request) */ struct tbf log_pkt_tbf; /* TBF for packet messages */ }; struct babel_iface { node n; struct babel_proto *proto; struct iface *iface; struct babel_iface_config *cf; u8 up; pool *pool; char *ifname; sock *sk; ip_addr addr; int tx_length; list neigh_list; /* List of neighbors seen on this iface (struct babel_neighbor) */ list msg_queue; u16 hello_seqno; /* To be increased on each hello */ bird_clock_t next_hello; bird_clock_t next_regular; bird_clock_t next_triggered; bird_clock_t want_triggered; timer *timer; event *send_event; }; struct babel_neighbor { node n; struct babel_iface *ifa; ip_addr addr; u16 txcost; u8 hello_cnt; u16 hello_map; u16 next_hello_seqno; /* expiry timers */ bird_clock_t hello_expiry; bird_clock_t ihu_expiry; list routes; /* Routes this neighbour has sent us (struct babel_route) */ }; struct babel_source { node n; u64 router_id; u16 seqno; u16 metric; bird_clock_t expires; }; struct babel_route { node n; node neigh_route; struct babel_entry *e; struct babel_neighbor *neigh; u16 seqno; u16 advert_metric; u16 metric; u64 router_id; ip_addr next_hop; bird_clock_t refresh_time; bird_clock_t expires; u16 expiry_interval; }; struct babel_entry { struct fib_node n; struct babel_proto *proto; struct babel_route *selected_in; struct babel_route *selected_out; bird_clock_t updated; list sources; /* Source entries for this prefix (struct babel_source). */ list routes; /* Routes for this prefix (struct babel_route) */ }; /* Stores forwarded seqno requests for duplicate suppression. */ struct babel_seqno_request { node n; ip_addr prefix; u8 plen; u64 router_id; u16 seqno; bird_clock_t updated; }; /* * Internal TLV messages */ struct babel_msg_ack_req { u8 type; u16 nonce; u16 interval; ip_addr sender; }; struct babel_msg_ack { u8 type; u16 nonce; }; struct babel_msg_hello { u8 type; u16 seqno; u16 interval; ip_addr sender; }; struct babel_msg_ihu { u8 type; u8 ae; u16 rxcost; u16 interval; ip_addr addr; ip_addr sender; }; struct babel_msg_update { u8 type; u8 wildcard; u8 plen; u16 interval; u16 seqno; u16 metric; ip_addr prefix; u64 router_id; ip_addr next_hop; ip_addr sender; }; struct babel_msg_route_request { u8 type; u8 full; u8 plen; ip_addr prefix; }; struct babel_msg_seqno_request { u8 type; u8 plen; u16 seqno; u8 hop_count; u64 router_id; ip_addr prefix; ip_addr sender; }; union babel_msg { u8 type; struct babel_msg_ack_req ack_req; struct babel_msg_ack ack; struct babel_msg_hello hello; struct babel_msg_ihu ihu; struct babel_msg_update update; struct babel_msg_route_request route_request; struct babel_msg_seqno_request seqno_request; }; struct babel_msg_node { node n; union babel_msg msg; }; /* babel.c */ void babel_handle_ack_req(union babel_msg *msg, struct babel_iface *ifa); void babel_handle_ack(union babel_msg *msg, struct babel_iface *ifa); void babel_handle_hello(union babel_msg *msg, struct babel_iface *ifa); void babel_handle_ihu(union babel_msg *msg, struct babel_iface *ifa); void babel_handle_router_id(union babel_msg *msg, struct babel_iface *ifa); void babel_handle_update(union babel_msg *msg, struct babel_iface *ifa); void babel_handle_route_request(union babel_msg *msg, struct babel_iface *ifa); void babel_handle_seqno_request(union babel_msg *msg, struct babel_iface *ifa); void babel_show_interfaces(struct proto *P, char *iff); void babel_show_neighbors(struct proto *P, char *iff); void babel_show_entries(struct proto *P); /* packets.c */ void babel_enqueue(union babel_msg *msg, struct babel_iface *ifa); void babel_send_unicast(union babel_msg *msg, struct babel_iface *ifa, ip_addr dest); int babel_open_socket(struct babel_iface *ifa); void babel_send_queue(void *arg); #endif bird-1.6.3/proto/babel/Makefile0000644000103200001440000000012313027054563015276 0ustar feelauserssource=babel.c packets.c root-rel=../../ dir-name=proto/babel include ../../Rules bird-1.6.3/proto/radv/0000755000103200001440000000000013027054563013531 5ustar feelausersbird-1.6.3/proto/radv/packets.c0000644000103200001440000002313213027054563015330 0ustar feelausers/* * BIRD -- RAdv Packet Processing * * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include "radv.h" struct radv_ra_packet { u8 type; u8 code; u16 checksum; u8 current_hop_limit; u8 flags; u16 router_lifetime; u32 reachable_time; u32 retrans_timer; }; #define OPT_RA_MANAGED 0x80 #define OPT_RA_OTHER_CFG 0x40 #define OPT_PREFIX 3 #define OPT_MTU 5 #define OPT_RDNSS 25 #define OPT_DNSSL 31 struct radv_opt_prefix { u8 type; u8 length; u8 pxlen; u8 flags; u32 valid_lifetime; u32 preferred_lifetime; u32 reserved; ip_addr prefix; }; #define OPT_PX_ONLINK 0x80 #define OPT_PX_AUTONOMOUS 0x40 struct radv_opt_mtu { u8 type; u8 length; u16 reserved; u32 mtu; }; struct radv_opt_rdnss { u8 type; u8 length; u16 reserved; u32 lifetime; ip_addr servers[]; }; struct radv_opt_dnssl { u8 type; u8 length; u16 reserved; u32 lifetime; char domain[]; }; static struct radv_prefix_config default_prefix = { .onlink = 1, .autonomous = 1, .valid_lifetime = DEFAULT_VALID_LIFETIME, .preferred_lifetime = DEFAULT_PREFERRED_LIFETIME }; static struct radv_prefix_config * radv_prefix_match(struct radv_iface *ifa, struct ifa *a) { struct proto *p = &ifa->ra->p; struct radv_config *cf = (struct radv_config *) (p->cf); struct radv_prefix_config *pc; if (a->scope <= SCOPE_LINK) return NULL; WALK_LIST(pc, ifa->cf->pref_list) if ((a->pxlen >= pc->pxlen) && ipa_in_net(a->prefix, pc->prefix, pc->pxlen)) return pc; WALK_LIST(pc, cf->pref_list) if ((a->pxlen >= pc->pxlen) && ipa_in_net(a->prefix, pc->prefix, pc->pxlen)) return pc; return &default_prefix; } static int radv_prepare_rdnss(struct radv_iface *ifa, list *rdnss_list, char **buf, char *bufend) { struct radv_rdnss_config *rcf = HEAD(*rdnss_list); while(NODE_VALID(rcf)) { struct radv_rdnss_config *rcf_base = rcf; struct radv_opt_rdnss *op = (void *) *buf; int max_i = (bufend - *buf - sizeof(struct radv_opt_rdnss)) / sizeof(ip_addr); int i = 0; if (max_i < 1) goto too_much; op->type = OPT_RDNSS; op->reserved = 0; if (rcf->lifetime_mult) op->lifetime = htonl(rcf->lifetime_mult * ifa->cf->max_ra_int); else op->lifetime = htonl(rcf->lifetime); while(NODE_VALID(rcf) && (rcf->lifetime == rcf_base->lifetime) && (rcf->lifetime_mult == rcf_base->lifetime_mult)) { if (i >= max_i) goto too_much; op->servers[i] = rcf->server; ipa_hton(op->servers[i]); i++; rcf = NODE_NEXT(rcf); } op->length = 1+2*i; *buf += 8 * op->length; } return 0; too_much: log(L_WARN "%s: Too many RA options on interface %s", ifa->ra->p.name, ifa->iface->name); return -1; } int radv_process_domain(struct radv_dnssl_config *cf) { /* Format of domain in search list is bfd_neigh_local %type bfd_neigh_multihop bfd_auth_type CF_GRAMMAR CF_ADDTO(proto, bfd_proto) bfd_proto_start: proto_start BFD { this_proto = proto_config_new(&proto_bfd, $1); init_list(&BFD_CFG->patt_list); init_list(&BFD_CFG->neigh_list); if (bfd_cf) cf_error("Only one BFD instance allowed"); bfd_cf = BFD_CFG; }; bfd_proto_item: proto_item | INTERFACE bfd_iface | MULTIHOP bfd_multihop | NEIGHBOR bfd_neighbor ; bfd_proto_opts: /* empty */ | bfd_proto_opts bfd_proto_item ';' ; bfd_proto: bfd_proto_start proto_name '{' bfd_proto_opts '}'; bfd_iface_start: { this_ipatt = cfg_allocz(sizeof(struct bfd_iface_config)); add_tail(&BFD_CFG->patt_list, NODE this_ipatt); init_list(&this_ipatt->ipn_list); BFD_IFACE->min_rx_int = BFD_DEFAULT_MIN_RX_INT; BFD_IFACE->min_tx_int = BFD_DEFAULT_MIN_TX_INT; BFD_IFACE->idle_tx_int = BFD_DEFAULT_IDLE_TX_INT; BFD_IFACE->multiplier = BFD_DEFAULT_MULTIPLIER; reset_passwords(); }; bfd_iface_finish: { BFD_IFACE->passwords = get_passwords(); if (!BFD_IFACE->auth_type != !BFD_IFACE->passwords) log(L_WARN "Authentication and password options should be used together"); if (BFD_IFACE->passwords) { struct password_item *pass; WALK_LIST(pass, *BFD_IFACE->passwords) { if (pass->alg) cf_error("Password algorithm option not available in BFD protocol"); pass->alg = bfd_auth_type_to_hash_alg[BFD_IFACE->auth_type]; } } }; bfd_iface_item: INTERVAL expr_us { BFD_IFACE->min_rx_int = BFD_IFACE->min_tx_int = $2; } | MIN RX INTERVAL expr_us { BFD_IFACE->min_rx_int = $4; } | MIN TX INTERVAL expr_us { BFD_IFACE->min_tx_int = $4; } | IDLE TX INTERVAL expr_us { BFD_IFACE->idle_tx_int = $4; } | MULTIPLIER expr { BFD_IFACE->multiplier = $2; } | PASSIVE bool { BFD_IFACE->passive = $2; } | AUTHENTICATION bfd_auth_type { BFD_IFACE->auth_type = $2; } | password_list {} ; bfd_auth_type: NONE { $$ = BFD_AUTH_NONE; } | SIMPLE { $$ = BFD_AUTH_SIMPLE; } | KEYED MD5 { $$ = BFD_AUTH_KEYED_MD5; } | KEYED SHA1 { $$ = BFD_AUTH_KEYED_SHA1; } | METICULOUS KEYED MD5 { $$ = BFD_AUTH_METICULOUS_KEYED_MD5; } | METICULOUS KEYED SHA1 { $$ = BFD_AUTH_METICULOUS_KEYED_SHA1; } ; bfd_iface_opts: /* empty */ | bfd_iface_opts bfd_iface_item ';' ; bfd_iface_opt_list: /* empty */ | '{' bfd_iface_opts '}' ; bfd_iface: bfd_iface_start iface_patt_list_nopx bfd_iface_opt_list bfd_iface_finish; bfd_multihop: bfd_iface_start bfd_iface_opt_list bfd_iface_finish { BFD_CFG->multihop = BFD_IFACE; }; bfd_neigh_iface: /* empty */ { $$ = NULL; } | '%' SYM { $$ = if_get_by_name($2->name); } | DEV text { $$ = if_get_by_name($2); } ; bfd_neigh_local: /* empty */ { $$ = IPA_NONE; } | LOCAL ipa { $$ = $2; } ; bfd_neigh_multihop: /* empty */ { $$ = 0; } | MULTIHOP bool { $$ = $2; } ; bfd_neighbor: ipa bfd_neigh_iface bfd_neigh_local bfd_neigh_multihop { this_bfd_neighbor = cfg_allocz(sizeof(struct bfd_neighbor)); add_tail(&BFD_CFG->neigh_list, NODE this_bfd_neighbor); BFD_NEIGHBOR->addr = $1; BFD_NEIGHBOR->local = $3; BFD_NEIGHBOR->iface = $2; BFD_NEIGHBOR->multihop = $4; if ($4 && $2) cf_error("Neighbor cannot set both interface and multihop"); if ($4 && ipa_zero($3)) cf_error("Multihop neighbor requires specified local address"); }; CF_CLI_HELP(SHOW BFD, ..., [[Show information about BFD protocol]]); CF_CLI(SHOW BFD SESSIONS, optsym, [], [[Show information about BFD sessions]]) { bfd_show_sessions(proto_get_named($4, &proto_bfd)); }; CF_CODE CF_END bird-1.6.3/proto/bfd/bfd.c0000644000103200001440000007007613027054563014241 0ustar feelausers/* * BIRD -- Bidirectional Forwarding Detection (BFD) * * Can be freely distributed and used under the terms of the GNU GPL. */ /** * DOC: Bidirectional Forwarding Detection * * The BFD protocol is implemented in three files: |bfd.c| containing the * protocol logic and the protocol glue with BIRD core, |packets.c| handling BFD * packet processing, RX, TX and protocol sockets. |io.c| then contains generic * code for the event loop, threads and event sources (sockets, microsecond * timers). This generic code will be merged to the main BIRD I/O code in the * future. * * The BFD implementation uses a separate thread with an internal event loop for * handling the protocol logic, which requires high-res and low-latency timing, * so it is not affected by the rest of BIRD, which has several low-granularity * hooks in the main loop, uses second-based timers and cannot offer good * latency. The core of BFD protocol (the code related to BFD sessions, * interfaces and packets) runs in the BFD thread, while the rest (the code * related to BFD requests, BFD neighbors and the protocol glue) runs in the * main thread. * * BFD sessions are represented by structure &bfd_session that contains a state * related to the session and two timers (TX timer for periodic packets and hold * timer for session timeout). These sessions are allocated from @session_slab * and are accessible by two hash tables, @session_hash_id (by session ID) and * @session_hash_ip (by IP addresses of neighbors). Slab and both hashes are in * the main protocol structure &bfd_proto. The protocol logic related to BFD * sessions is implemented in internal functions bfd_session_*(), which are * expected to be called from the context of BFD thread, and external functions * bfd_add_session(), bfd_remove_session() and bfd_reconfigure_session(), which * form an interface to the BFD core for the rest and are expected to be called * from the context of main thread. * * Each BFD session has an associated BFD interface, represented by structure * &bfd_iface. A BFD interface contains a socket used for TX (the one for RX is * shared in &bfd_proto), an interface configuration and reference counter. * Compared to interface structures of other protocols, these structures are not * created and removed based on interface notification events, but according to * the needs of BFD sessions. When a new session is created, it requests a * proper BFD interface by function bfd_get_iface(), which either finds an * existing one in &iface_list (from &bfd_proto) or allocates a new one. When a * session is removed, an associated iface is discharged by bfd_free_iface(). * * BFD requests are the external API for the other protocols. When a protocol * wants a BFD session, it calls bfd_request_session(), which creates a * structure &bfd_request containing approprite information and an notify hook. * This structure is a resource associated with the caller's resource pool. When * a BFD protocol is available, a BFD request is submitted to the protocol, an * appropriate BFD session is found or created and the request is attached to * the session. When a session changes state, all attached requests (and related * protocols) are notified. Note that BFD requests do not depend on BFD protocol * running. When the BFD protocol is stopped or removed (or not available from * beginning), related BFD requests are stored in @bfd_wait_list, where waits * for a new protocol. * * BFD neighbors are just a way to statically configure BFD sessions without * requests from other protocol. Structures &bfd_neighbor are part of BFD * configuration (like static routes in the static protocol). BFD neighbors are * handled by BFD protocol like it is a BFD client -- when a BFD neighbor is * ready, the protocol just creates a BFD request like any other protocol. * * The protocol uses a new generic event loop (structure &birdloop) from |io.c|, * which supports sockets, timers and events like the main loop. Timers * (structure &timer2) are new microsecond based timers, while sockets and * events are the same. A birdloop is associated with a thread (field @thread) * in which event hooks are executed. Most functions for setting event sources * (like sk_start() or tm2_start()) must be called from the context of that * thread. Birdloop allows to temporarily acquire the context of that thread for * the main thread by calling birdloop_enter() and then birdloop_leave(), which * also ensures mutual exclusion with all event hooks. Note that resources * associated with a birdloop (like timers) should be attached to the * independent resource pool, detached from the main resource tree. * * There are two kinds of interaction between the BFD core (running in the BFD * thread) and the rest of BFD (running in the main thread). The first kind are * configuration calls from main thread to the BFD thread (like bfd_add_session()). * These calls are synchronous and use birdloop_enter() mechanism for mutual * exclusion. The second kind is a notification about session changes from the * BFD thread to the main thread. This is done in an asynchronous way, sesions * with pending notifications are linked (in the BFD thread) to @notify_list in * &bfd_proto, and then bfd_notify_hook() in the main thread is activated using * bfd_notify_kick() and a pipe. The hook then processes scheduled sessions and * calls hooks from associated BFD requests. This @notify_list (and state fields * in structure &bfd_session) is protected by a spinlock in &bfd_proto and * functions bfd_lock_sessions() / bfd_unlock_sessions(). * * There are few data races (accessing @p->p.debug from TRACE() from the BFD * thread and accessing some some private fields of %bfd_session from * bfd_show_sessions() from the main thread, but these are harmless (i hope). * * TODO: document functions and access restrictions for fields in BFD structures. * * Supported standards: * - RFC 5880 - main BFD standard * - RFC 5881 - BFD for IP links * - RFC 5882 - generic application of BFD * - RFC 5883 - BFD for multihop paths */ #include "bfd.h" #define HASH_ID_KEY(n) n->loc_id #define HASH_ID_NEXT(n) n->next_id #define HASH_ID_EQ(a,b) a == b #define HASH_ID_FN(k) k #define HASH_IP_KEY(n) n->addr #define HASH_IP_NEXT(n) n->next_ip #define HASH_IP_EQ(a,b) ipa_equal(a,b) #define HASH_IP_FN(k) ipa_hash32(k) static list bfd_proto_list; static list bfd_wait_list; const char *bfd_state_names[] = { "AdminDown", "Down", "Init", "Up" }; static void bfd_session_set_min_tx(struct bfd_session *s, u32 val); static struct bfd_iface *bfd_get_iface(struct bfd_proto *p, ip_addr local, struct iface *iface); static void bfd_free_iface(struct bfd_iface *ifa); static inline void bfd_notify_kick(struct bfd_proto *p); /* * BFD sessions */ static void bfd_session_update_state(struct bfd_session *s, uint state, uint diag) { struct bfd_proto *p = s->ifa->bfd; uint old_state = s->loc_state; int notify; if (state == old_state) return; TRACE(D_EVENTS, "Session to %I changed state from %s to %s", s->addr, bfd_state_names[old_state], bfd_state_names[state]); bfd_lock_sessions(p); s->loc_state = state; s->loc_diag = diag; notify = !NODE_VALID(&s->n); if (notify) add_tail(&p->notify_list, &s->n); bfd_unlock_sessions(p); if (state == BFD_STATE_UP) bfd_session_set_min_tx(s, s->ifa->cf->min_tx_int); if (old_state == BFD_STATE_UP) bfd_session_set_min_tx(s, s->ifa->cf->idle_tx_int); if (notify) bfd_notify_kick(p); } static void bfd_session_update_tx_interval(struct bfd_session *s) { u32 tx_int = MAX(s->des_min_tx_int, s->rem_min_rx_int); u32 tx_int_l = tx_int - (tx_int / 4); // 75 % u32 tx_int_h = tx_int - (tx_int / 10); // 90 % s->tx_timer->recurrent = tx_int_l; s->tx_timer->randomize = tx_int_h - tx_int_l; /* Do not set timer if no previous event */ if (!s->last_tx) return; /* Set timer relative to last tx_timer event */ tm2_set(s->tx_timer, s->last_tx + tx_int_l); } static void bfd_session_update_detection_time(struct bfd_session *s, int kick) { btime timeout = (btime) MAX(s->req_min_rx_int, s->rem_min_tx_int) * s->rem_detect_mult; if (kick) s->last_rx = current_time(); if (!s->last_rx) return; tm2_set(s->hold_timer, s->last_rx + timeout); } static void bfd_session_control_tx_timer(struct bfd_session *s, int reset) { // if (!s->opened) goto stop; if (s->passive && (s->rem_id == 0)) goto stop; if (s->rem_demand_mode && !s->poll_active && (s->loc_state == BFD_STATE_UP) && (s->rem_state == BFD_STATE_UP)) goto stop; if (s->rem_min_rx_int == 0) goto stop; /* So TX timer should run */ if (reset || !tm2_active(s->tx_timer)) { s->last_tx = 0; tm2_start(s->tx_timer, 0); } return; stop: tm2_stop(s->tx_timer); s->last_tx = 0; } static void bfd_session_request_poll(struct bfd_session *s, u8 request) { /* Not sure about this, but doing poll in this case does not make sense */ if (s->rem_id == 0) return; s->poll_scheduled |= request; if (s->poll_active) return; s->poll_active = s->poll_scheduled; s->poll_scheduled = 0; bfd_session_control_tx_timer(s, 1); } static void bfd_session_terminate_poll(struct bfd_session *s) { u8 poll_done = s->poll_active & ~s->poll_scheduled; if (poll_done & BFD_POLL_TX) s->des_min_tx_int = s->des_min_tx_new; if (poll_done & BFD_POLL_RX) s->req_min_rx_int = s->req_min_rx_new; s->poll_active = s->poll_scheduled; s->poll_scheduled = 0; /* Timers are updated by caller - bfd_session_process_ctl() */ } void bfd_session_process_ctl(struct bfd_session *s, u8 flags, u32 old_tx_int, u32 old_rx_int) { if (s->poll_active && (flags & BFD_FLAG_FINAL)) bfd_session_terminate_poll(s); if ((s->des_min_tx_int != old_tx_int) || (s->rem_min_rx_int != old_rx_int)) bfd_session_update_tx_interval(s); bfd_session_update_detection_time(s, 1); /* Update session state */ int next_state = 0; int diag = BFD_DIAG_NOTHING; switch (s->loc_state) { case BFD_STATE_ADMIN_DOWN: return; case BFD_STATE_DOWN: if (s->rem_state == BFD_STATE_DOWN) next_state = BFD_STATE_INIT; else if (s->rem_state == BFD_STATE_INIT) next_state = BFD_STATE_UP; break; case BFD_STATE_INIT: if (s->rem_state == BFD_STATE_ADMIN_DOWN) next_state = BFD_STATE_DOWN, diag = BFD_DIAG_NEIGHBOR_DOWN; else if (s->rem_state >= BFD_STATE_INIT) next_state = BFD_STATE_UP; break; case BFD_STATE_UP: if (s->rem_state <= BFD_STATE_DOWN) next_state = BFD_STATE_DOWN, diag = BFD_DIAG_NEIGHBOR_DOWN; break; } if (next_state) bfd_session_update_state(s, next_state, diag); bfd_session_control_tx_timer(s, 0); if (flags & BFD_FLAG_POLL) bfd_send_ctl(s->ifa->bfd, s, 1); } static void bfd_session_timeout(struct bfd_session *s) { struct bfd_proto *p = s->ifa->bfd; TRACE(D_EVENTS, "Session to %I expired", s->addr); s->rem_state = BFD_STATE_DOWN; s->rem_id = 0; s->rem_min_tx_int = 0; s->rem_min_rx_int = 1; s->rem_demand_mode = 0; s->rem_detect_mult = 0; s->rx_csn_known = 0; s->poll_active = 0; s->poll_scheduled = 0; bfd_session_update_state(s, BFD_STATE_DOWN, BFD_DIAG_TIMEOUT); bfd_session_control_tx_timer(s, 1); } static void bfd_session_set_min_tx(struct bfd_session *s, u32 val) { /* Note that des_min_tx_int <= des_min_tx_new */ if (val == s->des_min_tx_new) return; s->des_min_tx_new = val; /* Postpone timer update if des_min_tx_int increases and the session is up */ if ((s->loc_state != BFD_STATE_UP) || (val < s->des_min_tx_int)) { s->des_min_tx_int = val; bfd_session_update_tx_interval(s); } bfd_session_request_poll(s, BFD_POLL_TX); } static void bfd_session_set_min_rx(struct bfd_session *s, u32 val) { /* Note that req_min_rx_int >= req_min_rx_new */ if (val == s->req_min_rx_new) return; s->req_min_rx_new = val; /* Postpone timer update if req_min_rx_int decreases and the session is up */ if ((s->loc_state != BFD_STATE_UP) || (val > s->req_min_rx_int)) { s->req_min_rx_int = val; bfd_session_update_detection_time(s, 0); } bfd_session_request_poll(s, BFD_POLL_RX); } struct bfd_session * bfd_find_session_by_id(struct bfd_proto *p, u32 id) { return HASH_FIND(p->session_hash_id, HASH_ID, id); } struct bfd_session * bfd_find_session_by_addr(struct bfd_proto *p, ip_addr addr) { return HASH_FIND(p->session_hash_ip, HASH_IP, addr); } static void bfd_tx_timer_hook(timer2 *t) { struct bfd_session *s = t->data; s->last_tx = current_time(); bfd_send_ctl(s->ifa->bfd, s, 0); } static void bfd_hold_timer_hook(timer2 *t) { bfd_session_timeout(t->data); } static u32 bfd_get_free_id(struct bfd_proto *p) { u32 id; for (id = random_u32(); 1; id++) if (id && !bfd_find_session_by_id(p, id)) break; return id; } static struct bfd_session * bfd_add_session(struct bfd_proto *p, ip_addr addr, ip_addr local, struct iface *iface) { birdloop_enter(p->loop); struct bfd_iface *ifa = bfd_get_iface(p, local, iface); struct bfd_session *s = sl_alloc(p->session_slab); bzero(s, sizeof(struct bfd_session)); s->addr = addr; s->ifa = ifa; s->loc_id = bfd_get_free_id(p); HASH_INSERT(p->session_hash_id, HASH_ID, s); HASH_INSERT(p->session_hash_ip, HASH_IP, s); /* Initialization of state variables - see RFC 5880 6.8.1 */ s->loc_state = BFD_STATE_DOWN; s->rem_state = BFD_STATE_DOWN; s->des_min_tx_int = s->des_min_tx_new = ifa->cf->idle_tx_int; s->req_min_rx_int = s->req_min_rx_new = ifa->cf->min_rx_int; s->rem_min_rx_int = 1; s->detect_mult = ifa->cf->multiplier; s->passive = ifa->cf->passive; s->tx_csn = random_u32(); s->tx_timer = tm2_new_init(p->tpool, bfd_tx_timer_hook, s, 0, 0); s->hold_timer = tm2_new_init(p->tpool, bfd_hold_timer_hook, s, 0, 0); bfd_session_update_tx_interval(s); bfd_session_control_tx_timer(s, 1); init_list(&s->request_list); s->last_state_change = now; TRACE(D_EVENTS, "Session to %I added", s->addr); birdloop_leave(p->loop); return s; } /* static void bfd_open_session(struct bfd_proto *p, struct bfd_session *s, ip_addr local, struct iface *ifa) { birdloop_enter(p->loop); s->opened = 1; bfd_session_control_tx_timer(s); birdloop_leave(p->loop); } static void bfd_close_session(struct bfd_proto *p, struct bfd_session *s) { birdloop_enter(p->loop); s->opened = 0; bfd_session_update_state(s, BFD_STATE_DOWN, BFD_DIAG_PATH_DOWN); bfd_session_control_tx_timer(s); birdloop_leave(p->loop); } */ static void bfd_remove_session(struct bfd_proto *p, struct bfd_session *s) { ip_addr ip = s->addr; /* Caller should ensure that request list is empty */ birdloop_enter(p->loop); /* Remove session from notify list if scheduled for notification */ /* No need for bfd_lock_sessions(), we are already protected by birdloop_enter() */ if (NODE_VALID(&s->n)) rem_node(&s->n); bfd_free_iface(s->ifa); rfree(s->tx_timer); rfree(s->hold_timer); HASH_REMOVE(p->session_hash_id, HASH_ID, s); HASH_REMOVE(p->session_hash_ip, HASH_IP, s); sl_free(p->session_slab, s); TRACE(D_EVENTS, "Session to %I removed", ip); birdloop_leave(p->loop); } static void bfd_reconfigure_session(struct bfd_proto *p, struct bfd_session *s) { birdloop_enter(p->loop); struct bfd_iface_config *cf = s->ifa->cf; u32 tx = (s->loc_state == BFD_STATE_UP) ? cf->min_tx_int : cf->idle_tx_int; bfd_session_set_min_tx(s, tx); bfd_session_set_min_rx(s, cf->min_rx_int); s->detect_mult = cf->multiplier; s->passive = cf->passive; bfd_session_control_tx_timer(s, 0); birdloop_leave(p->loop); TRACE(D_EVENTS, "Session to %I reconfigured", s->addr); } /* * BFD interfaces */ static struct bfd_iface_config bfd_default_iface = { .min_rx_int = BFD_DEFAULT_MIN_RX_INT, .min_tx_int = BFD_DEFAULT_MIN_TX_INT, .idle_tx_int = BFD_DEFAULT_IDLE_TX_INT, .multiplier = BFD_DEFAULT_MULTIPLIER }; static inline struct bfd_iface_config * bfd_find_iface_config(struct bfd_config *cf, struct iface *iface) { struct bfd_iface_config *ic; ic = iface ? (void *) iface_patt_find(&cf->patt_list, iface, NULL) : cf->multihop; return ic ? ic : &bfd_default_iface; } static struct bfd_iface * bfd_get_iface(struct bfd_proto *p, ip_addr local, struct iface *iface) { struct bfd_iface *ifa; WALK_LIST(ifa, p->iface_list) if (ipa_equal(ifa->local, local) && (ifa->iface == iface)) return ifa->uc++, ifa; struct bfd_config *cf = (struct bfd_config *) (p->p.cf); struct bfd_iface_config *ic = bfd_find_iface_config(cf, iface); ifa = mb_allocz(p->tpool, sizeof(struct bfd_iface)); ifa->local = local; ifa->iface = iface; ifa->cf = ic; ifa->bfd = p; ifa->sk = bfd_open_tx_sk(p, local, iface); ifa->uc = 1; add_tail(&p->iface_list, &ifa->n); return ifa; } static void bfd_free_iface(struct bfd_iface *ifa) { if (!ifa || --ifa->uc) return; if (ifa->sk) { sk_stop(ifa->sk); rfree(ifa->sk); } rem_node(&ifa->n); mb_free(ifa); } static void bfd_reconfigure_iface(struct bfd_proto *p, struct bfd_iface *ifa, struct bfd_config *nc) { struct bfd_iface_config *nic = bfd_find_iface_config(nc, ifa->iface); ifa->changed = !!memcmp(nic, ifa->cf, sizeof(struct bfd_iface_config)); /* This should be probably changed to not access ifa->cf from the BFD thread */ birdloop_enter(p->loop); ifa->cf = nic; birdloop_leave(p->loop); } /* * BFD requests */ static void bfd_request_notify(struct bfd_request *req, u8 state, u8 diag) { u8 old_state = req->state; if (state == old_state) return; req->state = state; req->diag = diag; req->old_state = old_state; req->down = (old_state == BFD_STATE_UP) && (state == BFD_STATE_DOWN); if (req->hook) req->hook(req); } static int bfd_add_request(struct bfd_proto *p, struct bfd_request *req) { struct bfd_session *s = bfd_find_session_by_addr(p, req->addr); u8 state, diag; if (!s) s = bfd_add_session(p, req->addr, req->local, req->iface); rem_node(&req->n); add_tail(&s->request_list, &req->n); req->session = s; bfd_lock_sessions(p); state = s->loc_state; diag = s->loc_diag; bfd_unlock_sessions(p); bfd_request_notify(req, state, diag); return 1; } static void bfd_submit_request(struct bfd_request *req) { node *n; WALK_LIST(n, bfd_proto_list) if (bfd_add_request(SKIP_BACK(struct bfd_proto, bfd_node, n), req)) return; rem_node(&req->n); add_tail(&bfd_wait_list, &req->n); req->session = NULL; bfd_request_notify(req, BFD_STATE_ADMIN_DOWN, 0); } static void bfd_take_requests(struct bfd_proto *p) { node *n, *nn; WALK_LIST_DELSAFE(n, nn, bfd_wait_list) bfd_add_request(p, SKIP_BACK(struct bfd_request, n, n)); } static void bfd_drop_requests(struct bfd_proto *p) { node *n; HASH_WALK(p->session_hash_id, next_id, s) { /* We assume that p is not in bfd_proto_list */ WALK_LIST_FIRST(n, s->request_list) bfd_submit_request(SKIP_BACK(struct bfd_request, n, n)); } HASH_WALK_END; } static struct resclass bfd_request_class; struct bfd_request * bfd_request_session(pool *p, ip_addr addr, ip_addr local, struct iface *iface, void (*hook)(struct bfd_request *), void *data) { struct bfd_request *req = ralloc(p, &bfd_request_class); /* Hack: self-link req->n, we will call rem_node() on it */ req->n.prev = req->n.next = &req->n; req->addr = addr; req->local = local; req->iface = iface; bfd_submit_request(req); req->hook = hook; req->data = data; return req; } static void bfd_request_free(resource *r) { struct bfd_request *req = (struct bfd_request *) r; struct bfd_session *s = req->session; rem_node(&req->n); /* Remove the session if there is no request for it. Skip that if inside notify hooks, will be handled by bfd_notify_hook() itself */ if (s && EMPTY_LIST(s->request_list) && !s->notify_running) bfd_remove_session(s->ifa->bfd, s); } static void bfd_request_dump(resource *r) { struct bfd_request *req = (struct bfd_request *) r; debug("(code %p, data %p)\n", req->hook, req->data); } static struct resclass bfd_request_class = { "BFD request", sizeof(struct bfd_request), bfd_request_free, bfd_request_dump, NULL, NULL }; /* * BFD neighbors */ static void bfd_neigh_notify(struct neighbor *nb) { struct bfd_proto *p = (struct bfd_proto *) nb->proto; struct bfd_neighbor *n = nb->data; if (!n) return; if ((nb->scope > 0) && !n->req) { ip_addr local = ipa_nonzero(n->local) ? n->local : nb->ifa->ip; n->req = bfd_request_session(p->p.pool, n->addr, local, nb->iface, NULL, NULL); } if ((nb->scope <= 0) && n->req) { rfree(n->req); n->req = NULL; } } static void bfd_start_neighbor(struct bfd_proto *p, struct bfd_neighbor *n) { n->active = 1; if (n->multihop) { n->req = bfd_request_session(p->p.pool, n->addr, n->local, NULL, NULL, NULL); return; } struct neighbor *nb = neigh_find2(&p->p, &n->addr, n->iface, NEF_STICKY); if (!nb) { log(L_ERR "%s: Invalid remote address %I%J", p->p.name, n->addr, n->iface); return; } if (nb->data) { log(L_ERR "%s: Duplicate neighbor %I", p->p.name, n->addr); return; } n->neigh = nb; nb->data = n; if (nb->scope > 0) bfd_neigh_notify(nb); else TRACE(D_EVENTS, "Waiting for %I%J to become my neighbor", n->addr, n->iface); } static void bfd_stop_neighbor(struct bfd_proto *p UNUSED, struct bfd_neighbor *n) { if (n->neigh) n->neigh->data = NULL; n->neigh = NULL; rfree(n->req); n->req = NULL; } static inline int bfd_same_neighbor(struct bfd_neighbor *x, struct bfd_neighbor *y) { return ipa_equal(x->addr, y->addr) && ipa_equal(x->local, y->local) && (x->iface == y->iface) && (x->multihop == y->multihop); } static void bfd_reconfigure_neighbors(struct bfd_proto *p, struct bfd_config *new) { struct bfd_config *old = (struct bfd_config *) (p->p.cf); struct bfd_neighbor *on, *nn; WALK_LIST(on, old->neigh_list) { WALK_LIST(nn, new->neigh_list) if (bfd_same_neighbor(nn, on)) { nn->neigh = on->neigh; if (nn->neigh) nn->neigh->data = nn; nn->req = on->req; nn->active = 1; return; } bfd_stop_neighbor(p, on); } WALK_LIST(nn, new->neigh_list) if (!nn->active) bfd_start_neighbor(p, nn); } /* * BFD notify socket */ /* This core notify code should be replaced after main loop transition to birdloop */ int pipe(int pipefd[2]); void pipe_drain(int fd); void pipe_kick(int fd); static int bfd_notify_hook(sock *sk, uint len UNUSED) { struct bfd_proto *p = sk->data; struct bfd_session *s; list tmp_list; u8 state, diag; node *n, *nn; pipe_drain(sk->fd); bfd_lock_sessions(p); init_list(&tmp_list); add_tail_list(&tmp_list, &p->notify_list); init_list(&p->notify_list); bfd_unlock_sessions(p); WALK_LIST_FIRST(s, tmp_list) { bfd_lock_sessions(p); rem_node(&s->n); state = s->loc_state; diag = s->loc_diag; bfd_unlock_sessions(p); /* FIXME: convert to btime and move to bfd_session_update_state() */ s->last_state_change = now; s->notify_running = 1; WALK_LIST_DELSAFE(n, nn, s->request_list) bfd_request_notify(SKIP_BACK(struct bfd_request, n, n), state, diag); s->notify_running = 0; /* Remove the session if all requests were removed in notify hooks */ if (EMPTY_LIST(s->request_list)) bfd_remove_session(p, s); } return 0; } static inline void bfd_notify_kick(struct bfd_proto *p) { pipe_kick(p->notify_ws->fd); } static void bfd_noterr_hook(sock *sk, int err) { struct bfd_proto *p = sk->data; log(L_ERR "%s: Notify socket error: %m", p->p.name, err); } static void bfd_notify_init(struct bfd_proto *p) { int pfds[2]; sock *sk; int rv = pipe(pfds); if (rv < 0) die("pipe: %m"); sk = sk_new(p->p.pool); sk->type = SK_MAGIC; sk->rx_hook = bfd_notify_hook; sk->err_hook = bfd_noterr_hook; sk->fd = pfds[0]; sk->data = p; if (sk_open(sk) < 0) die("bfd: sk_open failed"); p->notify_rs = sk; /* The write sock is not added to any event loop */ sk = sk_new(p->p.pool); sk->type = SK_MAGIC; sk->fd = pfds[1]; sk->data = p; sk->flags = SKF_THREAD; if (sk_open(sk) < 0) die("bfd: sk_open failed"); p->notify_ws = sk; } /* * BFD protocol glue */ void bfd_init_all(void) { init_list(&bfd_proto_list); init_list(&bfd_wait_list); } static struct proto * bfd_init(struct proto_config *c) { struct proto *p = proto_new(c, sizeof(struct bfd_proto)); p->neigh_notify = bfd_neigh_notify; return p; } static int bfd_start(struct proto *P) { struct bfd_proto *p = (struct bfd_proto *) P; struct bfd_config *cf = (struct bfd_config *) (P->cf); p->loop = birdloop_new(); p->tpool = rp_new(NULL, "BFD thread root"); pthread_spin_init(&p->lock, PTHREAD_PROCESS_PRIVATE); p->session_slab = sl_new(P->pool, sizeof(struct bfd_session)); HASH_INIT(p->session_hash_id, P->pool, 8); HASH_INIT(p->session_hash_ip, P->pool, 8); init_list(&p->iface_list); init_list(&p->notify_list); bfd_notify_init(p); add_tail(&bfd_proto_list, &p->bfd_node); birdloop_enter(p->loop); p->rx_1 = bfd_open_rx_sk(p, 0); p->rx_m = bfd_open_rx_sk(p, 1); birdloop_leave(p->loop); bfd_take_requests(p); struct bfd_neighbor *n; WALK_LIST(n, cf->neigh_list) bfd_start_neighbor(p, n); birdloop_start(p->loop); return PS_UP; } static int bfd_shutdown(struct proto *P) { struct bfd_proto *p = (struct bfd_proto *) P; struct bfd_config *cf = (struct bfd_config *) (P->cf); rem_node(&p->bfd_node); birdloop_stop(p->loop); struct bfd_neighbor *n; WALK_LIST(n, cf->neigh_list) bfd_stop_neighbor(p, n); bfd_drop_requests(p); /* FIXME: This is hack */ birdloop_enter(p->loop); rfree(p->tpool); birdloop_leave(p->loop); birdloop_free(p->loop); return PS_DOWN; } static int bfd_reconfigure(struct proto *P, struct proto_config *c) { struct bfd_proto *p = (struct bfd_proto *) P; // struct bfd_config *old = (struct bfd_config *) (P->cf); struct bfd_config *new = (struct bfd_config *) c; struct bfd_iface *ifa; birdloop_mask_wakeups(p->loop); WALK_LIST(ifa, p->iface_list) bfd_reconfigure_iface(p, ifa, new); HASH_WALK(p->session_hash_id, next_id, s) { if (s->ifa->changed) bfd_reconfigure_session(p, s); } HASH_WALK_END; bfd_reconfigure_neighbors(p, new); birdloop_unmask_wakeups(p->loop); return 1; } /* Ensure one instance */ struct bfd_config *bfd_cf; static void bfd_preconfig(struct protocol *P UNUSED, struct config *c UNUSED) { bfd_cf = NULL; } static void bfd_copy_config(struct proto_config *dest, struct proto_config *src UNUSED) { struct bfd_config *d = (struct bfd_config *) dest; // struct bfd_config *s = (struct bfd_config *) src; /* We clean up patt_list and neigh_list, neighbors and ifaces are non-sharable */ init_list(&d->patt_list); init_list(&d->neigh_list); } void bfd_show_sessions(struct proto *P) { byte tbuf[TM_DATETIME_BUFFER_SIZE]; struct bfd_proto *p = (struct bfd_proto *) P; uint state, diag UNUSED; u32 tx_int, timeout; const char *ifname; if (p->p.proto_state != PS_UP) { cli_msg(-1020, "%s: is not up", p->p.name); cli_msg(0, ""); return; } cli_msg(-1020, "%s:", p->p.name); cli_msg(-1020, "%-25s %-10s %-10s %-10s %8s %8s", "IP address", "Interface", "State", "Since", "Interval", "Timeout"); HASH_WALK(p->session_hash_id, next_id, s) { /* FIXME: this is thread-unsafe, but perhaps harmless */ state = s->loc_state; diag = s->loc_diag; ifname = (s->ifa && s->ifa->iface) ? s->ifa->iface->name : "---"; tx_int = s->last_tx ? (MAX(s->des_min_tx_int, s->rem_min_rx_int) TO_MS) : 0; timeout = (MAX(s->req_min_rx_int, s->rem_min_tx_int) TO_MS) * s->rem_detect_mult; state = (state < 4) ? state : 0; tm_format_datetime(tbuf, &config->tf_proto, s->last_state_change); cli_msg(-1020, "%-25I %-10s %-10s %-10s %3u.%03u %3u.%03u", s->addr, ifname, bfd_state_names[state], tbuf, tx_int / 1000, tx_int % 1000, timeout / 1000, timeout % 1000); } HASH_WALK_END; cli_msg(0, ""); } struct protocol proto_bfd = { .name = "BFD", .template = "bfd%d", .config_size = sizeof(struct bfd_config), .init = bfd_init, .start = bfd_start, .shutdown = bfd_shutdown, .reconfigure = bfd_reconfigure, .preconfig = bfd_preconfig, .copy_config = bfd_copy_config, }; bird-1.6.3/proto/bfd/io.c0000644000103200001440000003213213027054563014104 0ustar feelausers/* * BIRD -- I/O and event loop * * Can be freely distributed and used under the terms of the GNU GPL. */ #include #include #include #include #include #include #include #include #include #include "nest/bird.h" #include "proto/bfd/io.h" #include "lib/buffer.h" #include "lib/heap.h" #include "lib/lists.h" #include "lib/resource.h" #include "lib/event.h" #include "lib/socket.h" struct birdloop { pool *pool; pthread_t thread; pthread_mutex_t mutex; btime last_time; btime real_time; u8 use_monotonic_clock; u8 stop_called; u8 poll_active; u8 wakeup_masked; int wakeup_fds[2]; BUFFER(timer2 *) timers; list event_list; list sock_list; uint sock_num; BUFFER(sock *) poll_sk; BUFFER(struct pollfd) poll_fd; u8 poll_changed; u8 close_scheduled; }; /* * Current thread context */ static pthread_key_t current_loop_key; static inline struct birdloop * birdloop_current(void) { return pthread_getspecific(current_loop_key); } static inline void birdloop_set_current(struct birdloop *loop) { pthread_setspecific(current_loop_key, loop); } static inline void birdloop_init_current(void) { pthread_key_create(¤t_loop_key, NULL); } /* * Time clock */ static void times_update_alt(struct birdloop *loop); static void times_init(struct birdloop *loop) { struct timespec ts; int rv; rv = clock_gettime(CLOCK_MONOTONIC, &ts); if (rv < 0) { log(L_WARN "Monotonic clock is missing"); loop->use_monotonic_clock = 0; loop->last_time = 0; loop->real_time = 0; times_update_alt(loop); return; } if ((ts.tv_sec < 0) || (((s64) ts.tv_sec) > ((s64) 1 << 40))) log(L_WARN "Monotonic clock is crazy"); loop->use_monotonic_clock = 1; loop->last_time = ((s64) ts.tv_sec S) + (ts.tv_nsec / 1000); loop->real_time = 0; } static void times_update_pri(struct birdloop *loop) { struct timespec ts; int rv; rv = clock_gettime(CLOCK_MONOTONIC, &ts); if (rv < 0) die("clock_gettime: %m"); btime new_time = ((s64) ts.tv_sec S) + (ts.tv_nsec / 1000); if (new_time < loop->last_time) log(L_ERR "Monotonic clock is broken"); loop->last_time = new_time; loop->real_time = 0; } static void times_update_alt(struct birdloop *loop) { struct timeval tv; int rv; rv = gettimeofday(&tv, NULL); if (rv < 0) die("gettimeofday: %m"); btime new_time = ((s64) tv.tv_sec S) + tv.tv_usec; btime delta = new_time - loop->real_time; if ((delta < 0) || (delta > (60 S))) { if (loop->real_time) log(L_WARN "Time jump, delta %d us", (int) delta); delta = 100 MS; } loop->last_time += delta; loop->real_time = new_time; } static void times_update(struct birdloop *loop) { if (loop->use_monotonic_clock) times_update_pri(loop); else times_update_alt(loop); } btime current_time(void) { return birdloop_current()->last_time; } /* * Wakeup code for birdloop */ static void pipe_new(int *pfds) { int rv = pipe(pfds); if (rv < 0) die("pipe: %m"); if (fcntl(pfds[0], F_SETFL, O_NONBLOCK) < 0) die("fcntl(O_NONBLOCK): %m"); if (fcntl(pfds[1], F_SETFL, O_NONBLOCK) < 0) die("fcntl(O_NONBLOCK): %m"); } void pipe_drain(int fd) { char buf[64]; int rv; try: rv = read(fd, buf, 64); if (rv < 0) { if (errno == EINTR) goto try; if (errno == EAGAIN) return; die("wakeup read: %m"); } if (rv == 64) goto try; } void pipe_kick(int fd) { u64 v = 1; int rv; try: rv = write(fd, &v, sizeof(u64)); if (rv < 0) { if (errno == EINTR) goto try; if (errno == EAGAIN) return; die("wakeup write: %m"); } } static inline void wakeup_init(struct birdloop *loop) { pipe_new(loop->wakeup_fds); } static inline void wakeup_drain(struct birdloop *loop) { pipe_drain(loop->wakeup_fds[0]); } static inline void wakeup_do_kick(struct birdloop *loop) { pipe_kick(loop->wakeup_fds[1]); } static inline void wakeup_kick(struct birdloop *loop) { if (!loop->wakeup_masked) wakeup_do_kick(loop); else loop->wakeup_masked = 2; } /* * Events */ static inline uint events_waiting(struct birdloop *loop) { return !EMPTY_LIST(loop->event_list); } static inline void events_init(struct birdloop *loop) { init_list(&loop->event_list); } static void events_fire(struct birdloop *loop) { times_update(loop); ev_run_list(&loop->event_list); } void ev2_schedule(event *e) { struct birdloop *loop = birdloop_current(); if (loop->poll_active && EMPTY_LIST(loop->event_list)) wakeup_kick(loop); if (e->n.next) rem_node(&e->n); add_tail(&loop->event_list, &e->n); } /* * Timers */ #define TIMER_LESS(a,b) ((a)->expires < (b)->expires) #define TIMER_SWAP(heap,a,b,t) (t = heap[a], heap[a] = heap[b], heap[b] = t, \ heap[a]->index = (a), heap[b]->index = (b)) static inline uint timers_count(struct birdloop *loop) { return loop->timers.used - 1; } static inline timer2 *timers_first(struct birdloop *loop) { return (loop->timers.used > 1) ? loop->timers.data[1] : NULL; } static void tm2_free(resource *r) { timer2 *t = (timer2 *) r; tm2_stop(t); } static void tm2_dump(resource *r) { timer2 *t = (timer2 *) r; debug("(code %p, data %p, ", t->hook, t->data); if (t->randomize) debug("rand %d, ", t->randomize); if (t->recurrent) debug("recur %d, ", t->recurrent); if (t->expires) debug("expires in %d ms)\n", (t->expires - current_time()) TO_MS); else debug("inactive)\n"); } static struct resclass tm2_class = { "Timer", sizeof(timer2), tm2_free, tm2_dump, NULL, NULL }; timer2 * tm2_new(pool *p) { timer2 *t = ralloc(p, &tm2_class); t->index = -1; return t; } void tm2_set(timer2 *t, btime when) { struct birdloop *loop = birdloop_current(); uint tc = timers_count(loop); if (!t->expires) { t->index = ++tc; t->expires = when; BUFFER_PUSH(loop->timers) = t; HEAP_INSERT(loop->timers.data, tc, timer2 *, TIMER_LESS, TIMER_SWAP); } else if (t->expires < when) { t->expires = when; HEAP_INCREASE(loop->timers.data, tc, timer2 *, TIMER_LESS, TIMER_SWAP, t->index); } else if (t->expires > when) { t->expires = when; HEAP_DECREASE(loop->timers.data, tc, timer2 *, TIMER_LESS, TIMER_SWAP, t->index); } if (loop->poll_active && (t->index == 1)) wakeup_kick(loop); } void tm2_start(timer2 *t, btime after) { tm2_set(t, current_time() + MAX(after, 0)); } void tm2_stop(timer2 *t) { if (!t->expires) return; struct birdloop *loop = birdloop_current(); uint tc = timers_count(loop); HEAP_DELETE(loop->timers.data, tc, timer2 *, TIMER_LESS, TIMER_SWAP, t->index); BUFFER_POP(loop->timers); t->index = -1; t->expires = 0; } static void timers_init(struct birdloop *loop) { BUFFER_INIT(loop->timers, loop->pool, 4); BUFFER_PUSH(loop->timers) = NULL; } static void timers_fire(struct birdloop *loop) { btime base_time; timer2 *t; times_update(loop); base_time = loop->last_time; while (t = timers_first(loop)) { if (t->expires > base_time) return; if (t->recurrent) { btime when = t->expires + t->recurrent; if (when <= loop->last_time) when = loop->last_time + t->recurrent; if (t->randomize) when += random() % (t->randomize + 1); tm2_set(t, when); } else tm2_stop(t); t->hook(t); } } /* * Sockets */ static void sockets_init(struct birdloop *loop) { init_list(&loop->sock_list); loop->sock_num = 0; BUFFER_INIT(loop->poll_sk, loop->pool, 4); BUFFER_INIT(loop->poll_fd, loop->pool, 4); loop->poll_changed = 1; /* add wakeup fd */ } static void sockets_add(struct birdloop *loop, sock *s) { add_tail(&loop->sock_list, &s->n); loop->sock_num++; s->index = -1; loop->poll_changed = 1; if (loop->poll_active) wakeup_kick(loop); } void sk_start(sock *s) { struct birdloop *loop = birdloop_current(); sockets_add(loop, s); } static void sockets_remove(struct birdloop *loop, sock *s) { rem_node(&s->n); loop->sock_num--; if (s->index >= 0) loop->poll_sk.data[s->index] = NULL; s->index = -1; loop->poll_changed = 1; /* Wakeup moved to sk_stop() */ } void sk_stop(sock *s) { struct birdloop *loop = birdloop_current(); sockets_remove(loop, s); if (loop->poll_active) { loop->close_scheduled = 1; wakeup_kick(loop); } else close(s->fd); s->fd = -1; } static inline uint sk_want_events(sock *s) { return (s->rx_hook ? POLLIN : 0) | ((s->ttx != s->tpos) ? POLLOUT : 0); } /* FIXME: this should be called from sock code static void sockets_update(struct birdloop *loop, sock *s) { if (s->index >= 0) loop->poll_fd.data[s->index].events = sk_want_events(s); } */ static void sockets_prepare(struct birdloop *loop) { BUFFER_SET(loop->poll_sk, loop->sock_num + 1); BUFFER_SET(loop->poll_fd, loop->sock_num + 1); struct pollfd *pfd = loop->poll_fd.data; sock **psk = loop->poll_sk.data; int i = 0; node *n; WALK_LIST(n, loop->sock_list) { sock *s = SKIP_BACK(sock, n, n); ASSERT(i < loop->sock_num); s->index = i; *psk = s; pfd->fd = s->fd; pfd->events = sk_want_events(s); pfd->revents = 0; pfd++; psk++; i++; } ASSERT(i == loop->sock_num); /* Add internal wakeup fd */ *psk = NULL; pfd->fd = loop->wakeup_fds[0]; pfd->events = POLLIN; pfd->revents = 0; loop->poll_changed = 0; } static void sockets_close_fds(struct birdloop *loop) { struct pollfd *pfd = loop->poll_fd.data; sock **psk = loop->poll_sk.data; int poll_num = loop->poll_fd.used - 1; int i; for (i = 0; i < poll_num; i++) if (psk[i] == NULL) close(pfd[i].fd); loop->close_scheduled = 0; } int sk_read(sock *s, int revents); int sk_write(sock *s); static void sockets_fire(struct birdloop *loop) { struct pollfd *pfd = loop->poll_fd.data; sock **psk = loop->poll_sk.data; int poll_num = loop->poll_fd.used - 1; times_update(loop); /* Last fd is internal wakeup fd */ if (pfd[poll_num].revents & POLLIN) wakeup_drain(loop); int i; for (i = 0; i < poll_num; pfd++, psk++, i++) { int e = 1; if (! pfd->revents) continue; if (pfd->revents & POLLNVAL) die("poll: invalid fd %d", pfd->fd); if (pfd->revents & POLLIN) while (e && *psk && (*psk)->rx_hook) e = sk_read(*psk, 0); e = 1; if (pfd->revents & POLLOUT) while (e && *psk) e = sk_write(*psk); } } /* * Birdloop */ static void * birdloop_main(void *arg); struct birdloop * birdloop_new(void) { /* FIXME: this init should be elsewhere and thread-safe */ static int init = 0; if (!init) { birdloop_init_current(); init = 1; } pool *p = rp_new(NULL, "Birdloop root"); struct birdloop *loop = mb_allocz(p, sizeof(struct birdloop)); loop->pool = p; pthread_mutex_init(&loop->mutex, NULL); times_init(loop); wakeup_init(loop); events_init(loop); timers_init(loop); sockets_init(loop); return loop; } void birdloop_start(struct birdloop *loop) { int rv = pthread_create(&loop->thread, NULL, birdloop_main, loop); if (rv) die("pthread_create(): %M", rv); } void birdloop_stop(struct birdloop *loop) { pthread_mutex_lock(&loop->mutex); loop->stop_called = 1; wakeup_do_kick(loop); pthread_mutex_unlock(&loop->mutex); int rv = pthread_join(loop->thread, NULL); if (rv) die("pthread_join(): %M", rv); } void birdloop_free(struct birdloop *loop) { rfree(loop->pool); } void birdloop_enter(struct birdloop *loop) { /* TODO: these functions could save and restore old context */ pthread_mutex_lock(&loop->mutex); birdloop_set_current(loop); } void birdloop_leave(struct birdloop *loop) { /* TODO: these functions could save and restore old context */ birdloop_set_current(NULL); pthread_mutex_unlock(&loop->mutex); } void birdloop_mask_wakeups(struct birdloop *loop) { pthread_mutex_lock(&loop->mutex); loop->wakeup_masked = 1; pthread_mutex_unlock(&loop->mutex); } void birdloop_unmask_wakeups(struct birdloop *loop) { pthread_mutex_lock(&loop->mutex); if (loop->wakeup_masked == 2) wakeup_do_kick(loop); loop->wakeup_masked = 0; pthread_mutex_unlock(&loop->mutex); } static void * birdloop_main(void *arg) { struct birdloop *loop = arg; timer2 *t; int rv, timeout; birdloop_set_current(loop); pthread_mutex_lock(&loop->mutex); while (1) { events_fire(loop); timers_fire(loop); times_update(loop); if (events_waiting(loop)) timeout = 0; else if (t = timers_first(loop)) timeout = (tm2_remains(t) TO_MS) + 1; else timeout = -1; if (loop->poll_changed) sockets_prepare(loop); loop->poll_active = 1; pthread_mutex_unlock(&loop->mutex); try: rv = poll(loop->poll_fd.data, loop->poll_fd.used, timeout); if (rv < 0) { if (errno == EINTR || errno == EAGAIN) goto try; die("poll: %m"); } pthread_mutex_lock(&loop->mutex); loop->poll_active = 0; if (loop->close_scheduled) sockets_close_fds(loop); if (loop->stop_called) break; if (rv) sockets_fire(loop); timers_fire(loop); } loop->stop_called = 0; pthread_mutex_unlock(&loop->mutex); return NULL; } bird-1.6.3/proto/bfd/Makefile0000644000103200001440000000012413027054563014765 0ustar feelauserssource=bfd.c packets.c io.c root-rel=../../ dir-name=proto/bfd include ../../Rules bird-1.6.3/configure0000755000103200001440000062467413027054665013367 0ustar feelausers#! /bin/sh # From configure.in Id. # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.69. # # # Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc. # # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # Use a proper internal environment variable to ensure we don't fall # into an infinite loop, continuously re-executing ourselves. if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then _as_can_reexec=no; export _as_can_reexec; # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 as_fn_exit 255 fi # We don't want this to propagate to other subprocesses. { _as_can_reexec=; unset _as_can_reexec;} if test "x$CONFIG_SHELL" = x; then as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi " as_required="as_fn_return () { (exit \$1); } as_fn_success () { as_fn_return 0; } as_fn_failure () { as_fn_return 1; } as_fn_ret_success () { return 0; } as_fn_ret_failure () { return 1; } exitcode=0 as_fn_success || { exitcode=1; echo as_fn_success failed.; } as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : else exitcode=1; echo positional parameters were not saved. fi test x\$exitcode = x0 || exit 1 test -x / || exit 1" as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1 test \$(( 1 + 1 )) = 2 || exit 1" if (eval "$as_required") 2>/dev/null; then : as_have_required=yes else as_have_required=no fi if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_found=false for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. as_found=: case $as_dir in #( /*) for as_base in sh bash ksh sh5; do # Try only shells that exist, to save several forks. as_shell=$as_dir/$as_base if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : CONFIG_SHELL=$as_shell as_have_required=yes if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : break 2 fi fi done;; esac as_found=false done $as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : CONFIG_SHELL=$SHELL as_have_required=yes fi; } IFS=$as_save_IFS if test "x$CONFIG_SHELL" != x; then : export CONFIG_SHELL # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 exit 255 fi if test x$as_have_required = xno; then : $as_echo "$0: This script requires a shell more modern than all" $as_echo "$0: the shells that I found on your system." if test x${ZSH_VERSION+set} = xset ; then $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" $as_echo "$0: be upgraded to zsh 4.3.4 or later." else $as_echo "$0: Please tell bug-autoconf@gnu.org about your system, $0: including any error possibly output before this $0: message. Then install a modern shell, or manually run $0: the script under such a shell if you do have one." fi exit 1 fi fi fi SHELL=${CONFIG_SHELL-/bin/sh} export SHELL # Unset more variables known to interfere with behavior of common tools. CLICOLOR_FORCE= GREP_OPTIONS= unset CLICOLOR_FORCE GREP_OPTIONS ## --------------------- ## ## M4sh Shell Functions. ## ## --------------------- ## # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits as_lineno_1=$LINENO as_lineno_1a=$LINENO as_lineno_2=$LINENO as_lineno_2a=$LINENO eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } # If we had to re-execute with $CONFIG_SHELL, we're ensured to have # already done that, so ensure we don't try to do so again and fall # in an infinite loop. This has already happened in practice. _as_can_reexec=no; export _as_can_reexec # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" test -n "$DJDIR" || exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= # Identity of this package. PACKAGE_NAME= PACKAGE_TARNAME= PACKAGE_VERSION= PACKAGE_STRING= PACKAGE_BUGREPORT= PACKAGE_URL= ac_unique_file="conf/confbase.Y" # Factoring default headers for most tests. ac_includes_default="\ #include #ifdef HAVE_SYS_TYPES_H # include #endif #ifdef HAVE_SYS_STAT_H # include #endif #ifdef STDC_HEADERS # include # include #else # ifdef HAVE_STDLIB_H # include # endif #endif #ifdef HAVE_STRING_H # if !defined STDC_HEADERS && defined HAVE_MEMORY_H # include # endif # include #endif #ifdef HAVE_STRINGS_H # include #endif #ifdef HAVE_INTTYPES_H # include #endif #ifdef HAVE_STDINT_H # include #endif #ifdef HAVE_UNISTD_H # include #endif" ac_subst_vars='LTLIBOBJS LIBOBJS CLIENT_LIBS CLIENT EGREP GREP protocols iproutedir sysdep_dirs RANLIB INSTALL_DATA INSTALL_SCRIPT INSTALL_PROGRAM CPP host_os host_vendor host_cpu host build_os build_vendor build_cpu build OBJEXT EXEEXT ac_ct_CC CPPFLAGS LDFLAGS CFLAGS CC CONTROL_SOCKET CONFIG_FILE SUFFIX runtimedir srcdir_rel_mf exedir objdir M4 BISON FLEX target_alias host_alias build_alias LIBS ECHO_T ECHO_N ECHO_C DEFS mandir localedir libdir psdir pdfdir dvidir htmldir infodir docdir oldincludedir includedir localstatedir sharedstatedir sysconfdir datadir datarootdir libexecdir sbindir bindir program_transform_name prefix exec_prefix PACKAGE_URL PACKAGE_BUGREPORT PACKAGE_STRING PACKAGE_VERSION PACKAGE_TARNAME PACKAGE_NAME PATH_SEPARATOR SHELL' ac_subst_files='' ac_user_opts=' enable_option_checking enable_debug enable_memcheck enable_client enable_ipv6 enable_pthreads with_suffix with_sysconfig with_protocols with_sysinclude with_runtimedir with_iproutedir ' ac_precious_vars='build_alias host_alias target_alias FLEX BISON M4 CC CFLAGS LDFLAGS LIBS CPPFLAGS CPP' # Initialize some variables set by options. ac_init_help= ac_init_version=false ac_unrecognized_opts= ac_unrecognized_sep= # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *=) ac_optarg= ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=\$ac_optarg ;; -without-* | --without-*) ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) as_fn_error $? "unrecognized option: \`$ac_option' Try \`$0 --help' for more information" ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. case $ac_envvar in #( '' | [0-9]* | *[!_$as_cr_alnum]* ) as_fn_error $? "invalid variable name: \`$ac_envvar'" ;; esac eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}" ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` as_fn_error $? "missing argument to $ac_option" fi if test -n "$ac_unrecognized_opts"; then case $enable_option_checking in no) ;; fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;; *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; esac fi # Check all directory arguments for consistency. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var # Remove trailing slashes. case $ac_val in */ ) ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` eval $ac_var=\$ac_val;; esac # Be sure to have absolute directory names. case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val" done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || as_fn_error $? "working directory cannot be determined" test "X$ac_ls_di" = "X$ac_pwd_ls_di" || as_fn_error $? "pwd does not report name of working directory" # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$as_myself" || $as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_myself" : 'X\(//\)[^/]' \| \ X"$as_myself" : 'X\(//\)$' \| \ X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_myself" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir" fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg" pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures this package to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking ...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/PACKAGE] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF System types: --build=BUILD configure for building on BUILD [guessed] --host=HOST cross-compile to build programs to run on HOST [BUILD] _ACEOF fi if test -n "$ac_init_help"; then cat <<\_ACEOF Optional Features: --disable-option-checking ignore unrecognized --enable/--with options --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --enable-debug enable internal debugging routines (default: disabled) --enable-memcheck check memory allocations when debugging (default: enabled) --enable-client enable building of BIRD client (default: enabled) --enable-ipv6 enable building of IPv6 version (default: disabled) --enable-pthreads enable POSIX threads support (default: detect) Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-suffix=STRING use specified suffix for BIRD files (default: 6 for IPv6 version) --with-sysconfig=FILE use specified BIRD system configuration file --with-protocols=LIST include specified routing protocols (default: all) --with-sysinclude=PATH search for system includes on specified place --with-runtimedir=PATH path for runtime files (default: $(localstatedir)/run) --with-iproutedir=PATH path to iproute2 config files (default: /etc/iproute2) Some influential environment variables: FLEX location of the Flex program BISON location of the Bison program M4 location of the M4 program CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory CPP C preprocessor Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to the package provider. _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF configure generated by GNU Autoconf 2.69 Copyright (C) 2012 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi ## ------------------------ ## ## Autoconf initialization. ## ## ------------------------ ## # ac_fn_c_try_compile LINENO # -------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_compile # ac_fn_c_try_link LINENO # ----------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || test -x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_link # ac_fn_c_try_cpp LINENO # ---------------------- # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } > conftest.i && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_cpp # ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists and can be compiled using the include files in # INCLUDES, setting the cache variable VAR accordingly. ac_fn_c_check_header_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_compile # ac_fn_c_check_header_mongrel LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists, giving a warning if it cannot be compiled using # the include files in INCLUDES and setting the cache variable VAR # accordingly. ac_fn_c_check_header_mongrel () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if eval \${$3+:} false; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } else # Is the header compilable? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 usability" >&5 $as_echo_n "checking $2 usability... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_header_compiler=yes else ac_header_compiler=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_compiler" >&5 $as_echo "$ac_header_compiler" >&6; } # Is the header present? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 presence" >&5 $as_echo_n "checking $2 presence... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include <$2> _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : ac_header_preproc=yes else ac_header_preproc=no fi rm -f conftest.err conftest.i conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_preproc" >&5 $as_echo "$ac_header_preproc" >&6; } # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in #(( yes:no: ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&5 $as_echo "$as_me: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; no:yes:* ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: present but cannot be compiled" >&5 $as_echo "$as_me: WARNING: $2: present but cannot be compiled" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: check for missing prerequisite headers?" >&5 $as_echo "$as_me: WARNING: $2: check for missing prerequisite headers?" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: see the Autoconf documentation" >&5 $as_echo "$as_me: WARNING: $2: see the Autoconf documentation" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&5 $as_echo "$as_me: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else eval "$3=\$ac_header_compiler" fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_mongrel # ac_fn_c_try_run LINENO # ---------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. Assumes # that executables *can* be run. ac_fn_c_try_run () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { ac_try='./conftest$ac_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then : ac_retval=0 else $as_echo "$as_me: program exited with status $ac_status" >&5 $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=$ac_status fi rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_run # ac_fn_c_compute_int LINENO EXPR VAR INCLUDES # -------------------------------------------- # Tries to find the compile-time value of EXPR in a program that includes # INCLUDES, setting VAR accordingly. Returns whether the value could be # computed ac_fn_c_compute_int () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if test "$cross_compiling" = yes; then # Depending upon the size, compute the lo and hi bounds. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) >= 0)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_lo=0 ac_mid=0 while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) <= $ac_mid)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=$ac_mid; break else as_fn_arith $ac_mid + 1 && ac_lo=$as_val if test $ac_lo -le $ac_mid; then ac_lo= ac_hi= break fi as_fn_arith 2 '*' $ac_mid + 1 && ac_mid=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) < 0)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=-1 ac_mid=-1 while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) >= $ac_mid)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_lo=$ac_mid; break else as_fn_arith '(' $ac_mid ')' - 1 && ac_hi=$as_val if test $ac_mid -le $ac_hi; then ac_lo= ac_hi= break fi as_fn_arith 2 '*' $ac_mid && ac_mid=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done else ac_lo= ac_hi= fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext # Binary search between lo and hi bounds. while test "x$ac_lo" != "x$ac_hi"; do as_fn_arith '(' $ac_hi - $ac_lo ')' / 2 + $ac_lo && ac_mid=$as_val cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) <= $ac_mid)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=$ac_mid else as_fn_arith '(' $ac_mid ')' + 1 && ac_lo=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done case $ac_lo in #(( ?*) eval "$3=\$ac_lo"; ac_retval=0 ;; '') ac_retval=1 ;; esac else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 static long int longval () { return $2; } static unsigned long int ulongval () { return $2; } #include #include int main () { FILE *f = fopen ("conftest.val", "w"); if (! f) return 1; if (($2) < 0) { long int i = longval (); if (i != ($2)) return 1; fprintf (f, "%ld", i); } else { unsigned long int i = ulongval (); if (i != ($2)) return 1; fprintf (f, "%lu", i); } /* Do not output a trailing newline, as this causes \r\n confusion on some platforms. */ return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : echo >>conftest.val; read $3 config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by $as_me, which was generated by GNU Autoconf 2.69. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. $as_echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; 2) as_fn_append ac_configure_args1 " '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi as_fn_append ac_configure_args " '$ac_arg'" ;; esac done done { ac_configure_args0=; unset ac_configure_args0;} { ac_configure_args1=; unset ac_configure_args1;} # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo $as_echo "## ---------------- ## ## Cache variables. ## ## ---------------- ##" echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo $as_echo "## ----------------- ## ## Output variables. ## ## ----------------- ##" echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then $as_echo "## ------------------- ## ## File substitutions. ## ## ------------------- ##" echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then $as_echo "## ----------- ## ## confdefs.h. ## ## ----------- ##" echo cat confdefs.h echo fi test "$ac_signal" != 0 && $as_echo "$as_me: caught signal $ac_signal" $as_echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h $as_echo "/* confdefs.h */" > confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_URL "$PACKAGE_URL" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer an explicitly selected file to automatically selected ones. ac_site_file1=NONE ac_site_file2=NONE if test -n "$CONFIG_SITE"; then # We do not want a PATH search for config.site. case $CONFIG_SITE in #(( -*) ac_site_file1=./$CONFIG_SITE;; */*) ac_site_file1=$CONFIG_SITE;; *) ac_site_file1=./$CONFIG_SITE;; esac elif test "x$prefix" != xNONE; then ac_site_file1=$prefix/share/config.site ac_site_file2=$prefix/etc/config.site else ac_site_file1=$ac_default_prefix/share/config.site ac_site_file2=$ac_default_prefix/etc/config.site fi for ac_site_file in "$ac_site_file1" "$ac_site_file2" do test "x$ac_site_file" = xNONE && continue if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 $as_echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" \ || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "failed to load site script $ac_site_file See \`config.log' for more details" "$LINENO" 5; } fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special files # actually), so we avoid doing that. DJGPP emulates it as a regular file. if test /dev/null != "$cache_file" && test -f "$cache_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 $as_echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 $as_echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then # differences in whitespace do not lead to failure. ac_old_val_w=`echo x $ac_old_val` ac_new_val_w=`echo x $ac_new_val` if test "$ac_old_val_w" != "$ac_new_val_w"; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 $as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} ac_cache_corrupted=: else { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 $as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} eval $ac_var=\$ac_old_val fi { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 $as_echo "$as_me: former value: \`$ac_old_val'" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 $as_echo "$as_me: current value: \`$ac_new_val'" >&2;} fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) as_fn_append ac_configure_args " '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 $as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 fi ## -------------------- ## ## Main body of script. ## ## -------------------- ## ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_aux_dir= for ac_dir in tools "$srcdir"/tools; do if test -f "$ac_dir/install-sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install-sh -c" break elif test -f "$ac_dir/install.sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install.sh -c" break elif test -f "$ac_dir/shtool"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/shtool install -c" break fi done if test -z "$ac_aux_dir"; then as_fn_error $? "cannot find install-sh, install.sh, or shtool in tools \"$srcdir\"/tools" "$LINENO" 5 fi # These three variables are undocumented and unsupported, # and are intended to be withdrawn in a future Autoconf release. # They can cause serious problems if a builder's source tree is in a directory # whose full name contains unusual characters. ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var. ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var. ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var. # Check whether --enable-debug was given. if test "${enable_debug+set}" = set; then : enableval=$enable_debug; else enable_debug=no fi # Check whether --enable-memcheck was given. if test "${enable_memcheck+set}" = set; then : enableval=$enable_memcheck; else enable_memcheck=yes fi # Check whether --enable-client was given. if test "${enable_client+set}" = set; then : enableval=$enable_client; else enable_client=yes fi # Check whether --enable-ipv6 was given. if test "${enable_ipv6+set}" = set; then : enableval=$enable_ipv6; else enable_ipv6=no fi # Check whether --enable-pthreads was given. if test "${enable_pthreads+set}" = set; then : enableval=$enable_pthreads; else enable_pthreads=try fi # Check whether --with-suffix was given. if test "${with_suffix+set}" = set; then : withval=$with_suffix; given_suffix="yes" fi # Check whether --with-sysconfig was given. if test "${with_sysconfig+set}" = set; then : withval=$with_sysconfig; fi # Check whether --with-protocols was given. if test "${with_protocols+set}" = set; then : withval=$with_protocols; else with_protocols="all" fi # Check whether --with-sysinclude was given. if test "${with_sysinclude+set}" = set; then : withval=$with_sysinclude; fi # Check whether --with-runtimedir was given. if test "${with_runtimedir+set}" = set; then : withval=$with_runtimedir; runtimedir="$with_runtimedir" else runtimedir="\$(localstatedir)/run" fi # Check whether --with-iproutedir was given. if test "${with_iproutedir+set}" = set; then : withval=$with_iproutedir; given_iproutedir="yes" fi if test "$srcdir" = . ; then # Building in current directory => create obj directory holding all objects objdir=obj mkdir -p obj srcdir_rel=.. makefiles="Makefile:tools/Makefile-top.in obj/Makefile:tools/Makefile.in obj/Rules:tools/Rules.in" exedir=.. else # Building in separate directory objdir=. srcdir_rel=$srcdir makefiles="Makefile:tools/Makefile.in Rules:tools/Rules.in" exedir=. fi case $srcdir_rel in /*) srcdir_rel_mf=$srcdir_rel ;; *) srcdir_rel_mf="\$(root-rel)$srcdir_rel" ;; esac if test "$enable_ipv6" = yes ; then ip=ipv6 SUFFIX=6 proto_radv=radv else ip=ipv4 SUFFIX="" fi if test "$given_suffix" = yes ; then SUFFIX="$with_suffix" fi if test "$enable_debug" = yes ; then CONFIG_FILE="bird$SUFFIX.conf" CONTROL_SOCKET="bird$SUFFIX.ctl" else CONFIG_FILE="\$(sysconfdir)/bird$SUFFIX.conf" CONTROL_SOCKET="$runtimedir/bird$SUFFIX.ctl" fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "no acceptable C compiler found in \$PATH See \`config.log' for more details" "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5 $as_echo_n "checking whether the C compiler works... " >&6; } ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` # The possible output files: ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*" ac_rmfiles= for ac_file in $ac_files do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; * ) ac_rmfiles="$ac_rmfiles $ac_file";; esac done rm -f $ac_rmfiles if { { ac_try="$ac_link_default" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link_default") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. # So ignore a value of `no', otherwise this would lead to `EXEEXT = no' # in a Makefile. We should not override ac_cv_exeext if it was cached, # so that the user can short-circuit this test for compilers unknown to # Autoconf. for ac_file in $ac_files '' do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; then :; else ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` fi # We set ac_cv_exeext here because the later test for it is not # safe: cross compilers may not add the suffix if given an `-o' # argument, so we may need to know it at that point already. # Even if this section looks crufty: it has the advantage of # actually working. break;; * ) break;; esac done test "$ac_cv_exeext" = no && ac_cv_exeext= else ac_file='' fi if test -z "$ac_file"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "C compiler cannot create executables See \`config.log' for more details" "$LINENO" 5; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5 $as_echo_n "checking for C compiler default output file name... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5 $as_echo "$ac_file" >&6; } ac_exeext=$ac_cv_exeext rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5 $as_echo_n "checking for suffix of executables... " >&6; } if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` break;; * ) break;; esac done else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of executables: cannot compile and link See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest conftest$ac_cv_exeext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5 $as_echo "$ac_cv_exeext" >&6; } rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { FILE *f = fopen ("conftest.out", "w"); return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF ac_clean_files="$ac_clean_files conftest.out" # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5 $as_echo_n "checking whether we are cross compiling... " >&6; } if test "$cross_compiling" != yes; then { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if { ac_try='./conftest$ac_cv_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details" "$LINENO" 5; } fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5 $as_echo "$cross_compiling" >&6; } rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5 $as_echo_n "checking for suffix of object files... " >&6; } if ${ac_cv_objext+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : for ac_file in conftest.o conftest.obj conftest.*; do test -f "$ac_file" || continue; case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of object files: cannot compile See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5 $as_echo "$ac_cv_objext" >&6; } OBJEXT=$ac_cv_objext ac_objext=$OBJEXT { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if ${ac_cv_c_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if ${ac_cv_prog_cc_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if ${ac_cv_prog_cc_c89+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include struct stat; /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for library containing clock_gettime" >&5 $as_echo_n "checking for library containing clock_gettime... " >&6; } if ${ac_cv_search_clock_gettime+:} false; then : $as_echo_n "(cached) " >&6 else ac_func_search_save_LIBS=$LIBS cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char clock_gettime (); int main () { return clock_gettime (); ; return 0; } _ACEOF for ac_lib in '' c rt posix4; do if test -z "$ac_lib"; then ac_res="none required" else ac_res=-l$ac_lib LIBS="-l$ac_lib $ac_func_search_save_LIBS" fi if ac_fn_c_try_link "$LINENO"; then : ac_cv_search_clock_gettime=$ac_res fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext if ${ac_cv_search_clock_gettime+:} false; then : break fi done if ${ac_cv_search_clock_gettime+:} false; then : else ac_cv_search_clock_gettime=no fi rm conftest.$ac_ext LIBS=$ac_func_search_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_search_clock_gettime" >&5 $as_echo "$ac_cv_search_clock_gettime" >&6; } ac_res=$ac_cv_search_clock_gettime if test "$ac_res" != no; then : test "$ac_res" = "none required" || LIBS="$ac_res $LIBS" else as_fn_error $? "Function clock_gettime not available." "$LINENO" 5 fi # Make sure we can run config.sub. $SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 || as_fn_error $? "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5 $as_echo_n "checking build system type... " >&6; } if ${ac_cv_build+:} false; then : $as_echo_n "(cached) " >&6 else ac_build_alias=$build_alias test "x$ac_build_alias" = x && ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"` test "x$ac_build_alias" = x && as_fn_error $? "cannot guess build type; you must specify one" "$LINENO" 5 ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5 $as_echo "$ac_cv_build" >&6; } case $ac_cv_build in *-*-*) ;; *) as_fn_error $? "invalid value of canonical build" "$LINENO" 5;; esac build=$ac_cv_build ac_save_IFS=$IFS; IFS='-' set x $ac_cv_build shift build_cpu=$1 build_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: build_os=$* IFS=$ac_save_IFS case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5 $as_echo_n "checking host system type... " >&6; } if ${ac_cv_host+:} false; then : $as_echo_n "(cached) " >&6 else if test "x$host_alias" = x; then ac_cv_host=$ac_cv_build else ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5 $as_echo "$ac_cv_host" >&6; } case $ac_cv_host in *-*-*) ;; *) as_fn_error $? "invalid value of canonical host" "$LINENO" 5;; esac host=$ac_cv_host ac_save_IFS=$IFS; IFS='-' set x $ac_cv_host shift host_cpu=$1 host_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: host_os=$* IFS=$ac_save_IFS case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac # Store this value because ac_test_CFLAGS is overwritten by AC_PROG_CC if test "$ac_test_CFLAGS" != set ; then bird_cflags_default=yes fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "no acceptable C compiler found in \$PATH See \`config.log' for more details" "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if ${ac_cv_c_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if ${ac_cv_prog_cc_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if ${ac_cv_prog_cc_c89+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include struct stat; /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -z "$GCC" ; then as_fn_error $? "This program requires the GNU C Compiler." "$LINENO" 5 fi # Enable threads by default just in Linux and FreeBSD #if test "$enable_pthreads" = try ; then # case "$host_os" in # (linux* | freebsd* | openbsd* | netbsd* ) enable_pthreads=try ;; # (*) enable_pthreads=no ;; # esac #fi if test "$enable_pthreads" != no ; then bird_tmp_cflags="$CFLAGS" CFLAGS="$CFLAGS -pthread" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether POSIX threads are available" >&5 $as_echo_n "checking whether POSIX threads are available... " >&6; } if ${bird_cv_lib_pthreads+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { pthread_t pt; pthread_create(&pt, NULL, NULL, NULL); pthread_spinlock_t lock; pthread_spin_lock(&lock); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : bird_cv_lib_pthreads=yes else bird_cv_lib_pthreads=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $bird_cv_lib_pthreads" >&5 $as_echo "$bird_cv_lib_pthreads" >&6; } CFLAGS="$bird_tmp_cflags" if test "$bird_cv_lib_pthreads" = yes ; then $as_echo "#define USE_PTHREADS 1" >>confdefs.h CFLAGS="$CFLAGS -pthread" LDFLAGS="$LDFLAGS -pthread" proto_bfd=bfd elif test "$enable_pthreads" = yes ; then as_fn_error $? "POSIX threads not available." "$LINENO" 5 fi if test "$enable_pthreads" = try ; then enable_pthreads="$bird_cv_lib_pthreads" fi fi if test "$bird_cflags_default" = yes ; then bird_tmp_cflags="$CFLAGS" CFLAGS="-Wall -Wno-pointer-sign" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether CC supports -Wno-pointer-sign" >&5 $as_echo_n "checking whether CC supports -Wno-pointer-sign... " >&6; } if ${bird_cv_c_option_wno_pointer_sign+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : bird_cv_c_option_wno_pointer_sign=yes else bird_cv_c_option_wno_pointer_sign=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $bird_cv_c_option_wno_pointer_sign" >&5 $as_echo "$bird_cv_c_option_wno_pointer_sign" >&6; } CFLAGS="$bird_tmp_cflags" bird_tmp_cflags="$CFLAGS" CFLAGS="-Wall -Wextra -Wno-missing-field-initializers" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether CC supports -Wno-missing-field-initializers" >&5 $as_echo_n "checking whether CC supports -Wno-missing-field-initializers... " >&6; } if ${bird_cv_c_option_wno_missing_init+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : bird_cv_c_option_wno_missing_init=yes else bird_cv_c_option_wno_missing_init=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $bird_cv_c_option_wno_missing_init" >&5 $as_echo "$bird_cv_c_option_wno_missing_init" >&6; } CFLAGS="$bird_tmp_cflags" bird_tmp_cflags="$CFLAGS" CFLAGS=" -fno-strict-aliasing" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether CC supports -fno-strict-aliasing" >&5 $as_echo_n "checking whether CC supports -fno-strict-aliasing... " >&6; } if ${bird_cv_c_option_fno_strict_aliasing+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : bird_cv_c_option_fno_strict_aliasing=yes else bird_cv_c_option_fno_strict_aliasing=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $bird_cv_c_option_fno_strict_aliasing" >&5 $as_echo "$bird_cv_c_option_fno_strict_aliasing" >&6; } CFLAGS="$bird_tmp_cflags" bird_tmp_cflags="$CFLAGS" CFLAGS=" -fno-strict-overflow" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether CC supports -fno-strict-overflow" >&5 $as_echo_n "checking whether CC supports -fno-strict-overflow... " >&6; } if ${bird_cv_c_option_fno_strict_overflow+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : bird_cv_c_option_fno_strict_overflow=yes else bird_cv_c_option_fno_strict_overflow=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $bird_cv_c_option_fno_strict_overflow" >&5 $as_echo "$bird_cv_c_option_fno_strict_overflow" >&6; } CFLAGS="$bird_tmp_cflags" CFLAGS="$CFLAGS -Wall -Wextra -Wstrict-prototypes -Wno-parentheses" if test "$bird_cv_c_option_wno_pointer_sign" = yes ; then CFLAGS="$CFLAGS -Wno-pointer-sign" fi if test "$bird_cv_c_option_wno_missing_init" = yes ; then CFLAGS="$CFLAGS -Wno-missing-field-initializers" fi if test "$bird_cv_c_option_fno_strict_aliasing" = yes ; then CFLAGS="$CFLAGS -fno-strict-aliasing" fi if test "$bird_cv_c_option_fno_strict_overflow" = yes ; then CFLAGS="$CFLAGS -fno-strict-overflow" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking CFLAGS" >&5 $as_echo_n "checking CFLAGS... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CFLAGS" >&5 $as_echo "$CFLAGS" >&6; } ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5 $as_echo_n "checking how to run the C preprocessor... " >&6; } # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if ${ac_cv_prog_CPP+:} false; then : $as_echo_n "(cached) " >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5 $as_echo "$CPP" >&6; } ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details" "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. # Reject install programs that cannot install multiple files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5 $as_echo_n "checking for a BSD-compatible install... " >&6; } if test -z "$INSTALL"; then if ${ac_cv_path_install+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in #(( ./ | .// | /[cC]/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else rm -rf conftest.one conftest.two conftest.dir echo one > conftest.one echo two > conftest.two mkdir conftest.dir if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" && test -s conftest.one && test -s conftest.two && test -s conftest.dir/conftest.one && test -s conftest.dir/conftest.two then ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi fi done done ;; esac done IFS=$as_save_IFS rm -rf conftest.one conftest.two conftest.dir fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5 $as_echo "$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. set dummy ${ac_tool_prefix}ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi RANLIB=$ac_cv_prog_RANLIB if test -n "$RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RANLIB" >&5 $as_echo "$RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_RANLIB"; then ac_ct_RANLIB=$RANLIB # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_RANLIB"; then ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_RANLIB="ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB if test -n "$ac_ct_RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB" >&5 $as_echo "$ac_ct_RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_RANLIB" = x; then RANLIB=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac RANLIB=$ac_ct_RANLIB fi else RANLIB="$ac_cv_prog_RANLIB" fi # Extract the first word of "flex", so it can be a program name with args. set dummy flex; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_FLEX+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$FLEX"; then ac_cv_prog_FLEX="$FLEX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_FLEX="flex" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi FLEX=$ac_cv_prog_FLEX if test -n "$FLEX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $FLEX" >&5 $as_echo "$FLEX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi # Extract the first word of "bison", so it can be a program name with args. set dummy bison; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_BISON+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$BISON"; then ac_cv_prog_BISON="$BISON" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_BISON="bison" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi BISON=$ac_cv_prog_BISON if test -n "$BISON"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $BISON" >&5 $as_echo "$BISON" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi for ac_prog in gm4 m4 do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_M4+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$M4"; then ac_cv_prog_M4="$M4" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_M4="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi M4=$ac_cv_prog_M4 if test -n "$M4"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $M4" >&5 $as_echo "$M4" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$M4" && break done test -z "$FLEX" && as_fn_error $? "Flex is missing." "$LINENO" 5 test -z "$BISON" && as_fn_error $? "Bison is missing." "$LINENO" 5 test -z "$M4" && as_fn_error $? "M4 is missing." "$LINENO" 5 # Check for GNU $M4 case `"$M4" --version 2>&1` in *GNU*) ;; *) as_fn_error $? "Provided M4 is not GNU M4." "$LINENO" 5;; esac if test -n "$with_sysconfig" -a "$with_sysconfig" != no ; then if test -f $with_sysconfig ; then sysdesc=$with_sysconfig else sysdesc=$srcdir/sysdep/cf/$with_sysconfig if ! test -f $sysdesc ; then sysdesc=$sysdesc.h fi fi elif test -f sysconfig.h ; then sysdesc=sysconfig else case "$ip:$host_os" in ipv6:linux*) sysdesc=linux-v6 default_iproutedir="/etc/iproute2" ;; ipv4:linux*) sysdesc=linux default_iproutedir="/etc/iproute2" ;; ipv6:netbsd*) sysdesc=bsd-v6 CPPFLAGS="$CPPFLAGS -I/usr/pkg/include" LDFLAGS="$LDFLAGS -L/usr/pkg/lib -R/usr/pkg/lib" ;; ipv4:netbsd*) sysdesc=bsd CPPFLAGS="$CPPFLAGS -I/usr/pkg/include" LDFLAGS="$LDFLAGS -L/usr/pkg/lib -R/usr/pkg/lib" ;; ipv6:freebsd*) sysdesc=bsd-v6 ;; ipv4:freebsd*) sysdesc=bsd ;; ipv6:dragonfly*) sysdesc=bsd-v6 ;; ipv4:dragonfly*) sysdesc=bsd ;; ipv6:kfreebsd*) sysdesc=bsd-v6 ;; ipv4:kfreebsd*) sysdesc=bsd ;; ipv6:openbsd*) sysdesc=bsd-v6 ;; ipv4:openbsd*) sysdesc=bsd ;; *) as_fn_error $? "Cannot determine correct system configuration. Please use --with-sysconfig to set it manually." "$LINENO" 5 ;; esac sysdesc=$srcdir/sysdep/cf/$sysdesc.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking which OS configuration should we use" >&5 $as_echo_n "checking which OS configuration should we use... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $sysdesc" >&5 $as_echo "$sysdesc" >&6; } if ! test -f $sysdesc ; then as_fn_error $? "The system configuration file is missing." "$LINENO" 5 fi sysname=`echo $sysdesc | sed 's/\.h$//'` cat >>confdefs.h <<_ACEOF #define SYSCONF_INCLUDE "$sysdesc" _ACEOF { $as_echo "$as_me:${as_lineno-$LINENO}: checking system-dependent directories" >&5 $as_echo_n "checking system-dependent directories... " >&6; } sysdep_dirs="`sed <$sysdesc '/^Link: /!d;s/^Link: \(.*\)$/\1/' | tr '\012' ' '` lib" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $sysdep_dirs" >&5 $as_echo "$sysdep_dirs" >&6; } if test "$with_iproutedir" = no ; then with_iproutedir= ; fi if test -n "$given_iproutedir" then iproutedir=$with_iproutedir else iproutedir=$default_iproutedir fi all_protocols="$proto_bfd bgp ospf pipe $proto_radv rip static" if test "$ip" = ipv6 ; then all_protocols="$all_protocols babel" fi all_protocols=`echo $all_protocols | sed 's/ /,/g'` if test "$with_protocols" = all ; then with_protocols="$all_protocols" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking protocols" >&5 $as_echo_n "checking protocols... " >&6; } protocols=`echo "$with_protocols" | sed 's/,/ /g'` if test "$protocols" = no ; then protocols= ; fi for a in $protocols ; do if ! test -f $srcdir/proto/$a/Makefile ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: failed" >&5 $as_echo "failed" >&6; } as_fn_error $? "Requested protocol $a not found." "$LINENO" 5 fi cat >>confdefs.h <<_ACEOF #define CONFIG_`echo $a | tr 'a-z' 'A-Z'` 1 _ACEOF done { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5 $as_echo "ok" >&6; } case $sysdesc in */linux*|*/linux-v6*) ac_fn_c_check_header_compile "$LINENO" "linux/rtnetlink.h" "ac_cv_header_linux_rtnetlink_h" " #include #include " if test "x$ac_cv_header_linux_rtnetlink_h" = xyes; then : else as_fn_error $? "Appropriate version of Linux kernel headers not found." "$LINENO" 5 fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5 $as_echo_n "checking for grep that handles long lines and -e... " >&6; } if ${ac_cv_path_GREP+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$GREP"; then ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_GREP" || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_GREP"; then as_fn_error $? "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_GREP=$GREP fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5 $as_echo "$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5 $as_echo_n "checking for egrep... " >&6; } if ${ac_cv_path_EGREP+:} false; then : $as_echo_n "(cached) " >&6 else if echo a | $GREP -E '(a|b)' >/dev/null 2>&1 then ac_cv_path_EGREP="$GREP -E" else if test -z "$EGREP"; then ac_path_EGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in egrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_EGREP" || continue # Check for GNU ac_path_EGREP and select it if it is found. # Check for GNU $ac_path_EGREP case `"$ac_path_EGREP" --version 2>&1` in *GNU*) ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'EGREP' >> "conftest.nl" "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_EGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_EGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_EGREP"; then as_fn_error $? "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_EGREP=$EGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5 $as_echo "$ac_cv_path_EGREP" >&6; } EGREP="$ac_cv_path_EGREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if ${ac_cv_header_stdc+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi # On IRIX 5.3, sys/types and inttypes.h are conflicting. for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ inttypes.h stdint.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default " if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done ac_fn_c_check_header_mongrel "$LINENO" "syslog.h" "ac_cv_header_syslog_h" "$ac_includes_default" if test "x$ac_cv_header_syslog_h" = xyes; then : $as_echo "#define HAVE_SYSLOG 1" >>confdefs.h fi ac_fn_c_check_header_mongrel "$LINENO" "alloca.h" "ac_cv_header_alloca_h" "$ac_includes_default" if test "x$ac_cv_header_alloca_h" = xyes; then : $as_echo "#define HAVE_ALLOCA_H 1" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether 'struct sockaddr' has sa_len" >&5 $as_echo_n "checking whether 'struct sockaddr' has sa_len... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include int main () { static struct sockaddr sa; int i = sizeof(sa.sa_len); ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } $as_echo "#define HAVE_SIN_LEN /**/" >>confdefs.h else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether byte ordering is bigendian" >&5 $as_echo_n "checking whether byte ordering is bigendian... " >&6; } if ${ac_cv_c_bigendian+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_c_bigendian=unknown # See if we're dealing with a universal compiler. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifndef __APPLE_CC__ not a universal capable compiler #endif typedef int dummy; _ACEOF if ac_fn_c_try_compile "$LINENO"; then : # Check for potential -arch flags. It is not universal unless # there are at least two -arch flags with different values. ac_arch= ac_prev= for ac_word in $CC $CFLAGS $CPPFLAGS $LDFLAGS; do if test -n "$ac_prev"; then case $ac_word in i?86 | x86_64 | ppc | ppc64) if test -z "$ac_arch" || test "$ac_arch" = "$ac_word"; then ac_arch=$ac_word else ac_cv_c_bigendian=universal break fi ;; esac ac_prev= elif test "x$ac_word" = "x-arch"; then ac_prev=arch fi done fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_c_bigendian = unknown; then # See if sys/param.h defines the BYTE_ORDER macro. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include int main () { #if ! (defined BYTE_ORDER && defined BIG_ENDIAN \ && defined LITTLE_ENDIAN && BYTE_ORDER && BIG_ENDIAN \ && LITTLE_ENDIAN) bogus endian macros #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : # It does; now see whether it defined to BIG_ENDIAN or not. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include int main () { #if BYTE_ORDER != BIG_ENDIAN not big endian #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_bigendian=yes else ac_cv_c_bigendian=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi if test $ac_cv_c_bigendian = unknown; then # See if defines _LITTLE_ENDIAN or _BIG_ENDIAN (e.g., Solaris). cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { #if ! (defined _LITTLE_ENDIAN || defined _BIG_ENDIAN) bogus endian macros #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : # It does; now see whether it defined to _BIG_ENDIAN or not. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { #ifndef _BIG_ENDIAN not big endian #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_bigendian=yes else ac_cv_c_bigendian=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi if test $ac_cv_c_bigendian = unknown; then # Compile a test program. if test "$cross_compiling" = yes; then : # Try to guess by grepping values from an object file. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ short int ascii_mm[] = { 0x4249, 0x4765, 0x6E44, 0x6961, 0x6E53, 0x7953, 0 }; short int ascii_ii[] = { 0x694C, 0x5454, 0x656C, 0x6E45, 0x6944, 0x6E61, 0 }; int use_ascii (int i) { return ascii_mm[i] + ascii_ii[i]; } short int ebcdic_ii[] = { 0x89D3, 0xE3E3, 0x8593, 0x95C5, 0x89C4, 0x9581, 0 }; short int ebcdic_mm[] = { 0xC2C9, 0xC785, 0x95C4, 0x8981, 0x95E2, 0xA8E2, 0 }; int use_ebcdic (int i) { return ebcdic_mm[i] + ebcdic_ii[i]; } extern int foo; int main () { return use_ascii (foo) == use_ebcdic (foo); ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : if grep BIGenDianSyS conftest.$ac_objext >/dev/null; then ac_cv_c_bigendian=yes fi if grep LiTTleEnDian conftest.$ac_objext >/dev/null ; then if test "$ac_cv_c_bigendian" = unknown; then ac_cv_c_bigendian=no else # finding both strings is unlikely to happen, but who knows? ac_cv_c_bigendian=unknown fi fi fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $ac_includes_default int main () { /* Are we little or big endian? From Harbison&Steele. */ union { long int l; char c[sizeof (long int)]; } u; u.l = 1; return u.c[sizeof (long int) - 1] == 1; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ac_cv_c_bigendian=no else ac_cv_c_bigendian=yes fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_bigendian" >&5 $as_echo "$ac_cv_c_bigendian" >&6; } case $ac_cv_c_bigendian in #( yes) $as_echo "#define CPU_BIG_ENDIAN 1" >>confdefs.h ;; #( no) $as_echo "#define CPU_LITTLE_ENDIAN 1" >>confdefs.h ;; #( universal) $as_echo "#define AC_APPLE_UNIVERSAL_BUILD 1" >>confdefs.h ;; #( *) as_fn_error $? "Cannot determine CPU endianity." "$LINENO" 5 ;; esac # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of char" >&5 $as_echo_n "checking size of char... " >&6; } if ${ac_cv_sizeof_char+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (char))" "ac_cv_sizeof_char" "$ac_includes_default"; then : else if test "$ac_cv_type_char" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (char) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_char=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_char" >&5 $as_echo "$ac_cv_sizeof_char" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_CHAR $ac_cv_sizeof_char _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of short int" >&5 $as_echo_n "checking size of short int... " >&6; } if ${ac_cv_sizeof_short_int+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (short int))" "ac_cv_sizeof_short_int" "$ac_includes_default"; then : else if test "$ac_cv_type_short_int" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (short int) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_short_int=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_short_int" >&5 $as_echo "$ac_cv_sizeof_short_int" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_SHORT_INT $ac_cv_sizeof_short_int _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of int" >&5 $as_echo_n "checking size of int... " >&6; } if ${ac_cv_sizeof_int+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (int))" "ac_cv_sizeof_int" "$ac_includes_default"; then : else if test "$ac_cv_type_int" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (int) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_int=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_int" >&5 $as_echo "$ac_cv_sizeof_int" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_INT $ac_cv_sizeof_int _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of long int" >&5 $as_echo_n "checking size of long int... " >&6; } if ${ac_cv_sizeof_long_int+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (long int))" "ac_cv_sizeof_long_int" "$ac_includes_default"; then : else if test "$ac_cv_type_long_int" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (long int) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_long_int=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_long_int" >&5 $as_echo "$ac_cv_sizeof_long_int" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_LONG_INT $ac_cv_sizeof_long_int _ACEOF # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of long long int" >&5 $as_echo_n "checking size of long long int... " >&6; } if ${ac_cv_sizeof_long_long_int+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (long long int))" "ac_cv_sizeof_long_long_int" "$ac_includes_default"; then : else if test "$ac_cv_type_long_long_int" = yes; then { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "cannot compute sizeof (long long int) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_long_long_int=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_long_long_int" >&5 $as_echo "$ac_cv_sizeof_long_long_int" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_LONG_LONG_INT $ac_cv_sizeof_long_long_int _ACEOF for size in 1 2 4 8; do bits=`expr $size "*" 8` { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $bits-bit type" >&5 $as_echo_n "checking for $bits-bit type... " >&6; } if test $ac_cv_sizeof_int = $size ; then res=int elif test $ac_cv_sizeof_char = $size ; then res=char elif test $ac_cv_sizeof_short_int = $size ; then res="short int" elif test $ac_cv_sizeof_long_int = $size ; then res="long int" elif test $ac_cv_sizeof_long_long_int = $size ; then res="long long int" else { $as_echo "$as_me:${as_lineno-$LINENO}: result: not found" >&5 $as_echo "not found" >&6; } as_fn_error $? "Cannot find $bits-bit integer type." "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $res" >&5 $as_echo "$res" >&6; } cat >>confdefs.h <<_ACEOF #define INTEGER_$bits $res _ACEOF done { $as_echo "$as_me:${as_lineno-$LINENO}: checking usual alignment of structures" >&5 $as_echo_n "checking usual alignment of structures... " >&6; } if ${bird_cv_c_struct_align+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : bird_cv_c_struct_align=16 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include struct { char x; long int y; } ary[2]; int main(void) { FILE *f = fopen("conftestresult", "w"); if (!f) return 10; fprintf(f, "%d", sizeof(ary)/2); fclose(f); exit(0); } _ACEOF if ac_fn_c_try_run "$LINENO"; then : bird_cv_c_struct_align=`cat conftestresult` else { $as_echo "$as_me:${as_lineno-$LINENO}: result: test program failed" >&5 $as_echo "test program failed" >&6; } as_fn_error $? "Cannot determine structure alignment" "$LINENO" 5 fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $bird_cv_c_struct_align" >&5 $as_echo "$bird_cv_c_struct_align" >&6; } cat >>confdefs.h <<_ACEOF #define CPU_STRUCT_ALIGN $bird_cv_c_struct_align _ACEOF { $as_echo "$as_me:${as_lineno-$LINENO}: checking characteristics of time_t" >&5 $as_echo_n "checking characteristics of time_t... " >&6; } if ${bird_cv_type_time_t+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : bird_cv_type_time_t="32-bit signed" else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include int main(void) { FILE *f = fopen("conftestresult", "w"); if (!f) return 10; fprintf(f, "%d-bit ", sizeof(time_t)*CHAR_BIT); if ((time_t) -1 > 0) fprintf(f, "un"); fprintf(f, "signed"); fclose(f); exit(0); } _ACEOF if ac_fn_c_try_run "$LINENO"; then : bird_cv_type_time_t=`cat conftestresult` else { $as_echo "$as_me:${as_lineno-$LINENO}: result: test program failed" >&5 $as_echo "test program failed" >&6; } as_fn_error $? "Cannot determine time_t size and signedness." "$LINENO" 5 fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $bird_cv_type_time_t" >&5 $as_echo "$bird_cv_type_time_t" >&6; } case "$bird_cv_type_time_t" in *64-bit*) $as_echo "#define TIME_T_IS_64BIT 1" >>confdefs.h ;; esac case "$bird_cv_type_time_t" in *unsigned*) ;; *) $as_echo "#define TIME_T_IS_SIGNED 1" >>confdefs.h ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for struct ip_mreqn" >&5 $as_echo_n "checking for struct ip_mreqn... " >&6; } if ${bird_cv_struct_ip_mreqn+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { struct ip_mreqn x; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : bird_cv_struct_ip_mreqn=yes else bird_cv_struct_ip_mreqn=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $bird_cv_struct_ip_mreqn" >&5 $as_echo "$bird_cv_struct_ip_mreqn" >&6; } if test "$bird_cv_struct_ip_mreqn" = yes ; then $as_echo "#define HAVE_STRUCT_IP_MREQN 1" >>confdefs.h fi if test "$enable_debug" = yes ; then $as_echo "#define DEBUGGING 1" >>confdefs.h if test "$enable_memcheck" = yes ; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dmalloc_debug in -ldmalloc" >&5 $as_echo_n "checking for dmalloc_debug in -ldmalloc... " >&6; } if ${ac_cv_lib_dmalloc_dmalloc_debug+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldmalloc $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dmalloc_debug (); int main () { return dmalloc_debug (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dmalloc_dmalloc_debug=yes else ac_cv_lib_dmalloc_dmalloc_debug=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dmalloc_dmalloc_debug" >&5 $as_echo "$ac_cv_lib_dmalloc_dmalloc_debug" >&6; } if test "x$ac_cv_lib_dmalloc_dmalloc_debug" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBDMALLOC 1 _ACEOF LIBS="-ldmalloc $LIBS" fi if test $ac_cv_lib_dmalloc_dmalloc_debug != yes ; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for malloc in -lefence" >&5 $as_echo_n "checking for malloc in -lefence... " >&6; } if ${ac_cv_lib_efence_malloc+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lefence $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char malloc (); int main () { return malloc (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_efence_malloc=yes else ac_cv_lib_efence_malloc=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_efence_malloc" >&5 $as_echo "$ac_cv_lib_efence_malloc" >&6; } if test "x$ac_cv_lib_efence_malloc" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBEFENCE 1 _ACEOF LIBS="-lefence $LIBS" fi fi fi fi CLIENT= CLIENT_LIBS= if test "$enable_client" = yes ; then CLIENT=birdc { $as_echo "$as_me:${as_lineno-$LINENO}: checking for add_history in -lhistory" >&5 $as_echo_n "checking for add_history in -lhistory... " >&6; } if ${ac_cv_lib_history_add_history+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lhistory $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char add_history (); int main () { return add_history (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_history_add_history=yes else ac_cv_lib_history_add_history=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_history_add_history" >&5 $as_echo "$ac_cv_lib_history_add_history" >&6; } if test "x$ac_cv_lib_history_add_history" = xyes; then : CLIENT_LIBS="-lhistory" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for tgetent in -lncurses" >&5 $as_echo_n "checking for tgetent in -lncurses... " >&6; } if ${ac_cv_lib_ncurses_tgetent+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lncurses $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char tgetent (); int main () { return tgetent (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_ncurses_tgetent=yes else ac_cv_lib_ncurses_tgetent=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_ncurses_tgetent" >&5 $as_echo "$ac_cv_lib_ncurses_tgetent" >&6; } if test "x$ac_cv_lib_ncurses_tgetent" = xyes; then : USE_TERMCAP_LIB=-lncurses else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for tgetent in -lcurses" >&5 $as_echo_n "checking for tgetent in -lcurses... " >&6; } if ${ac_cv_lib_curses_tgetent+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lcurses $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char tgetent (); int main () { return tgetent (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_curses_tgetent=yes else ac_cv_lib_curses_tgetent=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_curses_tgetent" >&5 $as_echo "$ac_cv_lib_curses_tgetent" >&6; } if test "x$ac_cv_lib_curses_tgetent" = xyes; then : USE_TERMCAP_LIB=-lcurses else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for tgetent in -ltinfow" >&5 $as_echo_n "checking for tgetent in -ltinfow... " >&6; } if ${ac_cv_lib_tinfow_tgetent+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ltinfow $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char tgetent (); int main () { return tgetent (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_tinfow_tgetent=yes else ac_cv_lib_tinfow_tgetent=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_tinfow_tgetent" >&5 $as_echo "$ac_cv_lib_tinfow_tgetent" >&6; } if test "x$ac_cv_lib_tinfow_tgetent" = xyes; then : USE_TERMCAP_LIB=-ltinfow else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for tgetent in -ltinfo" >&5 $as_echo_n "checking for tgetent in -ltinfo... " >&6; } if ${ac_cv_lib_tinfo_tgetent+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ltinfo $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char tgetent (); int main () { return tgetent (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_tinfo_tgetent=yes else ac_cv_lib_tinfo_tgetent=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_tinfo_tgetent" >&5 $as_echo "$ac_cv_lib_tinfo_tgetent" >&6; } if test "x$ac_cv_lib_tinfo_tgetent" = xyes; then : USE_TERMCAP_LIB=-ltinfo else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for tgetent in -ltermcap" >&5 $as_echo_n "checking for tgetent in -ltermcap... " >&6; } if ${ac_cv_lib_termcap_tgetent+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ltermcap $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char tgetent (); int main () { return tgetent (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_termcap_tgetent=yes else ac_cv_lib_termcap_tgetent=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_termcap_tgetent" >&5 $as_echo "$ac_cv_lib_termcap_tgetent" >&6; } if test "x$ac_cv_lib_termcap_tgetent" = xyes; then : USE_TERMCAP_LIB=-ltermcap else as_fn_error $? "The client requires ncurses library. Either install the library or use --disable-client to compile without the client." "$LINENO" 5 fi fi fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for rl_callback_read_char in -lreadline" >&5 $as_echo_n "checking for rl_callback_read_char in -lreadline... " >&6; } if ${ac_cv_lib_readline_rl_callback_read_char+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lreadline $USE_TERMCAP_LIB $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char rl_callback_read_char (); int main () { return rl_callback_read_char (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_readline_rl_callback_read_char=yes else ac_cv_lib_readline_rl_callback_read_char=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_readline_rl_callback_read_char" >&5 $as_echo "$ac_cv_lib_readline_rl_callback_read_char" >&6; } if test "x$ac_cv_lib_readline_rl_callback_read_char" = xyes; then : CLIENT_LIBS="-lreadline $CLIENT_LIBS $USE_TERMCAP_LIB" else as_fn_error $? "The client requires GNU readline library 2.1 or newer. Either install the library or use --disable-client to compile without the client." "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for rl_crlf in -lreadline" >&5 $as_echo_n "checking for rl_crlf in -lreadline... " >&6; } if ${ac_cv_lib_readline_rl_crlf+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lreadline $USE_TERMCAP_LIB $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char rl_crlf (); int main () { return rl_crlf (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_readline_rl_crlf=yes else ac_cv_lib_readline_rl_crlf=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_readline_rl_crlf" >&5 $as_echo "$ac_cv_lib_readline_rl_crlf" >&6; } if test "x$ac_cv_lib_readline_rl_crlf" = xyes; then : $as_echo "#define HAVE_RL_CRLF 1" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for rl_ding in -lreadline" >&5 $as_echo_n "checking for rl_ding in -lreadline... " >&6; } if ${ac_cv_lib_readline_rl_ding+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lreadline $USE_TERMCAP_LIB $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char rl_ding (); int main () { return rl_ding (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_readline_rl_ding=yes else ac_cv_lib_readline_rl_ding=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_readline_rl_ding" >&5 $as_echo "$ac_cv_lib_readline_rl_ding" >&6; } if test "x$ac_cv_lib_readline_rl_ding" = xyes; then : $as_echo "#define HAVE_RL_DING 1" >>confdefs.h fi fi mkdir -p $objdir/sysdep ac_config_headers="$ac_config_headers $objdir/sysdep/autoconf.h:sysdep/autoconf.h.in" ac_config_commands="$ac_config_commands merge" ac_config_files="$ac_config_files $makefiles" cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then if test "x$cache_file" != "x/dev/null"; then { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} if test ! -f "$cache_file" || test -h "$cache_file"; then cat confcache >"$cache_file" else case $cache_file in #( */* | ?:*) mv -f confcache "$cache_file"$$ && mv -f "$cache_file"$$ "$cache_file" ;; #( *) mv -f confcache "$cache_file" ;; esac fi fi else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' DEFS=-DHAVE_CONFIG_H ac_libobjs= ac_ltlibobjs= U= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`$as_echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs : "${CONFIG_STATUS=./config.status}" ac_write_fail=0 ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 $as_echo "$as_me: creating $CONFIG_STATUS" >&6;} as_write_fail=0 cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 ## ----------------------------------- ## ## Main body of $CONFIG_STATUS script. ## ## ----------------------------------- ## _ASEOF test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Save the log message, to keep $0 and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by $as_me, which was generated by GNU Autoconf 2.69. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac case $ac_config_headers in *" "*) set x $ac_config_headers; shift; ac_config_headers=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" config_headers="$ac_config_headers" config_commands="$ac_config_commands" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 ac_cs_usage="\ \`$as_me' instantiates files and other configuration actions from templates according to the current configuration. Unless the files and actions are specified as TAGs, all are instantiated by default. Usage: $0 [OPTION]... [TAG]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit --config print configuration, then exit -q, --quiet, --silent do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE --header=FILE[:TEMPLATE] instantiate the configuration header FILE Configuration files: $config_files Configuration headers: $config_headers Configuration commands: $config_commands Report bugs to the package provider." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ config.status configured by $0, generated by GNU Autoconf 2.69, with options \\"\$ac_cs_config\\" Copyright (C) 2012 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' INSTALL='$INSTALL' test -n "\$AWK" || AWK=awk _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # The default lists apply if the user does not specify any file. ac_need_defaults=: while test $# != 0 do case $1 in --*=?*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; --*=) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg= ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) $as_echo "$ac_cs_version"; exit ;; --config | --confi | --conf | --con | --co | --c ) $as_echo "$ac_cs_config"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; '') as_fn_error $? "missing file argument" ;; esac as_fn_append CONFIG_FILES " '$ac_optarg'" ac_need_defaults=false;; --header | --heade | --head | --hea ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append CONFIG_HEADERS " '$ac_optarg'" ac_need_defaults=false;; --he | --h) # Conflict between --help and --header as_fn_error $? "ambiguous option: \`$1' Try \`$0 --help' for more information.";; --help | --hel | -h ) $as_echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) as_fn_error $? "unrecognized option: \`$1' Try \`$0 --help' for more information." ;; *) as_fn_append ac_config_targets " $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 if \$ac_cs_recheck; then set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion shift \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 CONFIG_SHELL='$SHELL' export CONFIG_SHELL exec "\$@" fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX $as_echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # # INIT-COMMANDS # srcdir=$srcdir srcdir_rel=$srcdir_rel objdir=$objdir sysdep_dirs="$sysdep_dirs" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "$objdir/sysdep/autoconf.h") CONFIG_HEADERS="$CONFIG_HEADERS $objdir/sysdep/autoconf.h:sysdep/autoconf.h.in" ;; "merge") CONFIG_COMMANDS="$CONFIG_COMMANDS merge" ;; "$makefiles") CONFIG_FILES="$CONFIG_FILES $makefiles" ;; *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= ac_tmp= trap 'exit_status=$? : "${ac_tmp:=$tmp}" { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status ' 0 trap 'as_fn_exit 1' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5 ac_tmp=$tmp # Set up the scripts for CONFIG_FILES section. # No need to generate them if there are no CONFIG_FILES. # This happens for instance with `./config.status config.h'. if test -n "$CONFIG_FILES"; then ac_cr=`echo X | tr X '\015'` # On cygwin, bash can eat \r inside `` if the user requested igncr. # But we know of no other shell where ac_cr would be empty at this # point, so we can use a bashism as a fallback. if test "x$ac_cr" = x; then eval ac_cr=\$\'\\r\' fi ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then ac_cs_awk_cr='\\r' else ac_cs_awk_cr=$ac_cr fi echo 'BEGIN {' >"$ac_tmp/subs1.awk" && _ACEOF { echo "cat >conf$$subs.awk <<_ACEOF" && echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && echo "_ACEOF" } >conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'` ac_delim='%!_!# ' for ac_last_try in false false false false false :; do . ./conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` if test $ac_delim_n = $ac_delim_num; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done rm -f conf$$subs.sh cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK && _ACEOF sed -n ' h s/^/S["/; s/!.*/"]=/ p g s/^[^!]*!// :repl t repl s/'"$ac_delim"'$// t delim :nl h s/\(.\{148\}\)..*/\1/ t more1 s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ p n b repl :more1 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t nl :delim h s/\(.\{148\}\)..*/\1/ t more2 s/["\\]/\\&/g; s/^/"/; s/$/"/ p b :more2 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t delim ' >$CONFIG_STATUS || ac_write_fail=1 rm -f conf$$subs.awk cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACAWK cat >>"\$ac_tmp/subs1.awk" <<_ACAWK && for (key in S) S_is_set[key] = 1 FS = "" } { line = $ 0 nfields = split(line, field, "@") substed = 0 len = length(field[1]) for (i = 2; i < nfields; i++) { key = field[i] keylen = length(key) if (S_is_set[key]) { value = S[key] line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) len += length(value) + length(field[++i]) substed = 1 } else len += 1 + keylen } print line } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" else cat fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \ || as_fn_error $? "could not setup config files machinery" "$LINENO" 5 _ACEOF # VPATH may cause trouble with some makes, so we remove sole $(srcdir), # ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=[ ]*/{ h s/// s/^/:/ s/[ ]*$/:/ s/:\$(srcdir):/:/g s/:\${srcdir}:/:/g s/:@srcdir@:/:/g s/^:*// s/:*$// x s/\(=[ ]*\).*/\1/ G s/\n// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 fi # test -n "$CONFIG_FILES" # Set up the scripts for CONFIG_HEADERS section. # No need to generate them if there are no CONFIG_HEADERS. # This happens for instance with `./config.status Makefile'. if test -n "$CONFIG_HEADERS"; then cat >"$ac_tmp/defines.awk" <<\_ACAWK || BEGIN { _ACEOF # Transform confdefs.h into an awk script `defines.awk', embedded as # here-document in config.status, that substitutes the proper values into # config.h.in to produce config.h. # Create a delimiter string that does not exist in confdefs.h, to ease # handling of long lines. ac_delim='%!_!# ' for ac_last_try in false false :; do ac_tt=`sed -n "/$ac_delim/p" confdefs.h` if test -z "$ac_tt"; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_HEADERS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done # For the awk script, D is an array of macro values keyed by name, # likewise P contains macro parameters if any. Preserve backslash # newline sequences. ac_word_re=[_$as_cr_Letters][_$as_cr_alnum]* sed -n ' s/.\{148\}/&'"$ac_delim"'/g t rset :rset s/^[ ]*#[ ]*define[ ][ ]*/ / t def d :def s/\\$// t bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3"/p s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2"/p d :bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3\\\\\\n"\\/p t cont s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2\\\\\\n"\\/p t cont d :cont n s/.\{148\}/&'"$ac_delim"'/g t clear :clear s/\\$// t bsnlc s/["\\]/\\&/g; s/^/"/; s/$/"/p d :bsnlc s/["\\]/\\&/g; s/^/"/; s/$/\\\\\\n"\\/p b cont ' >$CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 for (key in D) D_is_set[key] = 1 FS = "" } /^[\t ]*#[\t ]*(define|undef)[\t ]+$ac_word_re([\t (]|\$)/ { line = \$ 0 split(line, arg, " ") if (arg[1] == "#") { defundef = arg[2] mac1 = arg[3] } else { defundef = substr(arg[1], 2) mac1 = arg[2] } split(mac1, mac2, "(") #) macro = mac2[1] prefix = substr(line, 1, index(line, defundef) - 1) if (D_is_set[macro]) { # Preserve the white space surrounding the "#". print prefix "define", macro P[macro] D[macro] next } else { # Replace #undef with comments. This is necessary, for example, # in the case of _POSIX_SOURCE, which is predefined and required # on some systems where configure will not decide to define it. if (defundef == "undef") { print "/*", prefix defundef, macro, "*/" next } } } { print } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 as_fn_error $? "could not setup config headers machinery" "$LINENO" 5 fi # test -n "$CONFIG_HEADERS" eval set X " :F $CONFIG_FILES :H $CONFIG_HEADERS :C $CONFIG_COMMANDS" shift for ac_tag do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$ac_tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;; esac case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac as_fn_append ac_file_inputs " '$ac_f'" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input='Generated from '` $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' `' by configure.' if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 $as_echo "$as_me: creating $ac_file" >&6;} fi # Neutralize special characters interpreted by sed in replacement strings. case $configure_input in #( *\&* | *\|* | *\\* ) ac_sed_conf_input=`$as_echo "$configure_input" | sed 's/[\\\\&|]/\\\\&/g'`;; #( *) ac_sed_conf_input=$configure_input;; esac case $ac_tag in *:-:* | *:-) cat >"$ac_tmp/stdin" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;; esac _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= ac_sed_dataroot=' /datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p' case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 $as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_sed_extra="$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s|@configure_input@|$ac_sed_conf_input|;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@top_build_prefix@&$ac_top_build_prefix&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t s&@INSTALL@&$ac_INSTALL&;t t $ac_datarootdir_hack " eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$ac_tmp/subs.awk" \ >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5 test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' \ "$ac_tmp/out"`; test -z "$ac_out"; } && { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&5 $as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&2;} rm -f "$ac_tmp/stdin" case $ac_file in -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";; *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";; esac \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; :H) # # CONFIG_HEADER # if test x"$ac_file" != x-; then { $as_echo "/* $configure_input */" \ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" } >"$ac_tmp/config.h" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 if diff "$ac_file" "$ac_tmp/config.h" >/dev/null 2>&1; then { $as_echo "$as_me:${as_lineno-$LINENO}: $ac_file is unchanged" >&5 $as_echo "$as_me: $ac_file is unchanged" >&6;} else rm -f "$ac_file" mv "$ac_tmp/config.h" "$ac_file" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 fi else $as_echo "/* $configure_input */" \ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" \ || as_fn_error $? "could not create -" "$LINENO" 5 fi ;; :C) { $as_echo "$as_me:${as_lineno-$LINENO}: executing $ac_file commands" >&5 $as_echo "$as_me: executing $ac_file commands" >&6;} ;; esac case $ac_file$ac_mode in "merge":C) export CPP="$CPP" $srcdir/tools/mergedirs $srcdir $srcdir_rel $objdir $sysdep_dirs ;; esac done # for ac_tag as_fn_exit 0 _ACEOF ac_clean_files=$ac_clean_files_save test $ac_write_fail = 0 || as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5 # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || as_fn_exit 1 fi if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} fi rm -f $objdir/sysdep/paths.h cat >&6 < "/usr/bin/nsgmls", "SGMLSASP" => "/usr/bin/sgmlsasp", "GROFF" => "/usr/bin/groff", "GROFFMACRO" => "-ms", "AWK" => "/usr/share/linuxdoc-tools/awkwhich" }; $ENV{"SGML_CATALOG_FILES"} = "sbase/dtd/catalog"; require "./LinuxDocTools.pm"; &LinuxDocTools::init; my @FileList = LinuxDocTools::process_options ("txt", @ARGV); for my $curfile (@FileList) { LinuxDocTools::process_file ($curfile); } exit 0; bird-1.6.3/doc/bird.pdf0000644000103200001440000123226613027054676013633 0ustar feelausers%PDF-1.5 %ÐÔÅØ 141 0 obj << /Length 473 /Filter /FlateDecode >> stream xÚ•T]kÛ0}÷¯ÐÛ$˜5ë[†1BéZ:(ÛŠ÷Ò±áȉÓDλ…ýúI–Ó…à²öE–®Î½ç\û\` pÓó¢Ê>\ h¥¤T Ðk $ÁBKP-ÁOxqsw‰rFüq°þÝ!î9¼Ú¥E¿ª/Ùç*û‘P¯dJç%– Ô»,¹Ô D™Þ‚&ûžX5(q)©üÇÉ–J$ίnéíå\hxÕní>’µä$QÁǘôqB¨„Šë# ±Hh·fálÿÔù\ÿ™©ª(–ú9éSBè³¢åñþ}P©Kø Q M\ãb·Iü­©ãqm或TÿOþ3Ó>ª7v»ê§yéBaªù¥ßß·.êUqoóRe¯–ºÛ¼¬‘+L òF“!äœ8Pç„àRL†¹7(n¢Sj”‡¯<÷ÂÇZ–¯îâ`\ßšU·¨}ãGëŒK0î™ÂÕ GlÌÎÝCNûË /0ä¡ÆyBVë6ŽcpÙ¡> stream xÚíšKWÛ8Ç÷| /E\½K249Lá9gY8AŸ11GQè™o_9²\ˆRÀÁ˜´R ûwÿ{¯Ar™€dvšu2?ú0…2A c Ñdþ5( g0ãT$ó‹äKúGµa˜e”šõèßùŸvÀD×ÛÔ/Îgv#™I†X½HÆgR4›ÀÑX"šžº=t5Ûõb³4…ÝÝmèþ¥„0”!í›íñOwNÂ3Œx2†$ƒÍ‘™=„Ò¿¯rcÄ8-ÖõJÒÉéùÉýc¿Œ%i6S]ˆ”¯ql/Ë΄ Ò˜·´]pµeÜ…„H§«µÉ˲X]:TûAhmè÷»Y¯ƒxÒnàœoV«Éðˆâ5ø†Ï™.n‹R]ªuFÈÀz¸¾Ké#´vRbMN’ŒÉCŽ!r‰ñx±ÍˆÕ¦NT§Ú¾r'HjòE¹Kv'M²ƒÓ$jÓäLçKõuS:/×Ê~œÚ˜¬M†¹xÓÈû´ì}nΞc8Ø £­áXuö€är£óGµ?ØHpk$VÁ!áœ]÷*8{‘@°¨žz3þ´¬¤ô´¼¨š•Õ"oºº©Q Bbï|·ë{£ÖŸp›¹+ã|iY=*&Ïò"ÙCÐ%.èž«ëÊ(—©—•¯iËàKYF öÁþ¬’µ·ùæ=a@ÝQÓ¢4J¯ÞúÉÙfÔ‰;†Hc`%“„Ö$!ë5h×Or“»N†©©ýc¡ñ4Tÿr(\oµªÛKw¤æcý_7[ßRVªU:`ÅlèeòË C #2_X×ÍOKçok£mhÜè=¾Pô™AàPß•²E²rXrcô¦ÅÂ~Å(8$ æž¹RÚ‰ÚuÝM0Qn¶…kå+€‘ä1ž„ öÐbNv6e‰¶¶,yX}"|°úd­úœä —Ë°>e1õ c?ÝF7¬U£“i8©Á¿Â¤æ}¸=éˆÍËÑÉì, ¾œÅ9 6Þ›—¤'ê¶Xª_ÓáÞv»zšª'…VË`ŒÂ±Œ8†G;‚óö“Ò«P’@ŒYôµFÆ:"ã¾æø|6 ‡à8æªa°‰ŽØ„ŸƒMs,h‹½x 3N²î!$¬ã¸‘eÒ7dŽ/nƒæ‹€ï5 Ü—&]}»]í4(„¤ïÜ5œv…¼Ï&7Å2äG"¸aÀ‘æʼ}˜gYnÖáô§åFùÁ-7޶ܦ#«Š6õ(Ãuh¿ÕýØJÿö€ˆ¶ÔŸ½t«ûùgy”i Ä$½®<¶+UÞ„9—D8½ÀiþŒ õ?F- 3ĉvóî—?ξ0vµ endstream endobj 2 0 obj << /Type /ObjStm /N 100 /First 800 /Length 1658 /Filter /FlateDecode >> stream xÚµYÛnÜ6}×WÌcòB‰äðìv¶h`èÅðÃz­Ø‹lV†V›¶ß3\®Ñܤ¦l(‘ÃÃ3g†7YSCŽlCžØS¢I7”˜´%m¥ˇÅãÐöJ¿¤W¯ª›¡ïîvËaÕmèåÖÛ6·(}°ÿõa1ÐjK'—§£ö怿ëõjs?ÝÅî»\î6›ÿdÏ{û7ýêãjÝÞ·Û¯XÜ-tŽo»Ý@=þ“†Åíú«½c˜ƒÛçýbÙ¾Û­©oáO?ŒŒT¼xÝmÞ­îwýbBYû‘°WÎ×ÝíbMÝ£ToG{؃PÝÐ-»±>'Š´—í‡nhiÙ ·õˆ½ÛÛŸ­Öx#ã¾Ó]wp÷t1,høû±G/®þòØBùn‚ ?…*»·zðÙõC_/‘D--†¡_Ýâi¼/´†‡¶Ç8‹¡ýÐn†±øOc6ïšž,nÛõ¨aóäìtÔ¬¨xrþfÔ¬èwÚ~\-ÛQË¢ÙéªGÕ¨eñûǶßLøŠ¦WoÎFíbQrõ8Î1•¸ß}»)†ãêè•+„{µ uxJÃåz·˜Íá쳤*ýÙõïGÍËE;ä5ïC‡NíúñËNײ…6tIõÙj¸‘^GGUýsŽê7‹û¶ªe¦ä¼Å>-–U}Ùn»]¿l·y“ÍU?·w«ÅI÷]K…K˜ÂØæ#kÓM¤²gó2Ê¿Gÿí÷?pžQ8Ô4ˆ^¢Ín½¾ù¦¡aN%ë>µ<YÏd?Äξw-æóàþY8°•lÕ/bó àjLÃåU;Ð5”8=£úmû×@O#}]¢è¿(òÿ‘¨>Þl: ^çc‹P’S˾4¥´¥äRºRúR†RÆRî”3Ⱦ,x¾àù‚ç ž/x¾àù‚ç ž/x¡à…‚ ^(x¡à…‚ ^(x¡à…‚ ^,x±àÅ=ÞgÈ:UõÕîvÈï?­6ï«ú¤ëïÚ>+ÝÜÔ?Ôõëk_$6XŽ®%ÙpZ‹Šœ¯¼SAÎÛ wt0;¦ñcÔ,,FGþ…Æ(/,bTr“Àå@¹o°øüx6'±Ë);1J\E‚âIf~Á(—iÀILdq <ÁÃÎÏÃEÅÂÃc§À<ö>)3©ÏÇ£$©·¬,ÒÃ4A%LÏX<ŒMÒgˆŠ1Êàb)ÉÑàjƒk­Òß`ñùazN5ødZã²ä¡JãGŘ?5\„r] IaAvɨäG¥°Ï0_qiTr×—uC.!ª8ÅbþÄpΪ”[·\O=«0EÃΟÈÇå{O£dtÜ(ŸâhbÌ?W²Q6mj0Wq1ÇR:¾¡¸ÙCÂÉ*/,Jz6² Ž/\îò“CÀ>&Ÿá 2"#O­™â1†²·ØÈd!Çþj¼ èùW vZüÇBÎÊ% ^2ÖOðàùyØ þcÆâjUŒW—IϦ«bÖSU¾”Y£šI~öIkSÂbäôÔçv|ƒõ³«a±§$¨€¿j HY,§ã§ÿ “Ö†"ÈÇW Ëçp¬!Îù'­u( 't7Icþ9kÙäÜÄ} 75-;&yÌ?g­‰â¿Üq•¿Re'yÌ?g­fñ?ëp'³˜Ãv2MŸfË?L£\Ç endstream endobj 196 0 obj << /Length 3374 /Filter /FlateDecode >> stream xÚ½kܶñ»Å~‹¸Ýê-­¿q\×æq8_¢ir%Þ®b-µ%Ç—_ßy‘’îdAá|ZrH‡óžÑ†›ã&ܼ}Êï«ûyí7q¸Ëó8ÛÜ?lÊxWnŠ<Úee¾¹¯7?ßœÔeÐýÕ6)² zyµÍÂ0¸1WI }à(¨Çjh:sõŸû¿¾(Ý%i#¾p³MÃ]&Œ,ÚEWÛ(Š³à§“gcù÷ÕÍÝkFQnö»}ç‚ N`&ÔÜŸ4ì³À¨³Œþ‹¿â1á‚_U £jÛGœå2Ú•q<ž`eêÆyöÐõ3Œ<¼¡ýð~£†Üuãà¼VúÜ™¯vWÛ4É‚oõð•å+õ ‰Šª¶³ÀIx#>+Švû,ãgµÀHØÞ½‡Ikàw ×&ipÖÊð¥íž¬"/^ ÷‹%ï@_±ÎÞ8ßeÅvÒn¼ƒŸ®Ê4Ðm{d‡Á¯ò\NyÏà 'uÁ‡ÙFÕöWN¢@Õ0zd°þxiUctíЩ˜*E¼££†‘Š¸ &qá6‚E\[Š !N\Èô­¼vÁzá5óôÏwHõÈ€^Ÿõ’îec g¦ºñ¯ðŽ4 ^nÿfÑïIãÆxÚ‡ÁÝU¡KÉ.KÊ™ˆ²(n%yIº?—¾;öêÌ  dñ°‹Âm«éµ»ËGç°¹×¼rìXë`8t‚¡±U7I»ghcÔœ»³fQ3öë©©t’)q­ºaY:òÐ…tˆÄ„ÉOàòGÐu@C°8F÷Ã˜î‡ dê0b·H“. Å‚Ì6ãZ\²"#%´y7°s‚-½–Y²z´³RàL3œœ‘b°@Ý퇔Gär`÷|)_ó ßDÕµÈT0›"ÊI¿u\Jã”冃Zh*-Ðãq vCd«¾fÀEÑ2;¬A‰º»WÏ@ ´Ò8ÖV1º´ yÂëwÓo××(+â;ˆÚÜXy侀DJ”¦pó ^7=ÌÐÉã"aÄ+"ÀR„@x×Jµ<6)ÞóLŒsLUw>ãËGÓTj\¿¢Xi¤‘mE ³îíA&y™az”›ZÛ-^'aŒQ—3Ô¡GâXspLˆyØ{Y‡136tï…ÁRåq =$LœÉ–ÞA“FÒwxèØ2º¶;>ÊÅ‹ bfV1gY¹˜ a<ÉÔ® PQöBZœ€µE©©Ö]†æL2‚ š!ëN‚o:[ÙóÀ Û‘prÖCßTìfp¥[-›)BÈ€tTpFÁ‘·2²˜  X°°œÄ™WŒšÔ²Ú³P\€yú\uZ˜´xç {jÈ­xˆ¬±ºe Yu.Jj01Ê%¢ŽBDÄäKb§4(’ " QV|5.>'.¶Ä4Þ(ð›¶öN§WÍVL” Jòœßœäku è XI–ÆÁw`á¼D ,Á;­æ¡WuÂ!©Ž+8EyŒk]“ùÔn*NÀïŽñÚƒ­Æ^ ÖõgoùÊÁ'y¯ÂÁ°RuhZH‚H0€ÛZ¥97ÌDR1öXNÁ3굫üAñÄNÙ÷pðœ;©…7¯edÇYIƒßçäzL©4­iS¥ÏzN©41$ªÀ\¼9zÓ»B!+DßéÒý®©Ô¶¼‡ÂP˜út †ö‘B è¹êpï1Ùñ¡­ë¡“9o~>Ö¬«Þ'‚–Å0•í¾ü•·&ú©Ç!Þh^Í—R7ƒ½µÊðã1lJ„úÔeF+©ºH¥Dt¥Ý„èäØ(-_þW­výqÐÆ6à|Ö²ÕóóAó*¾(Ί)ËrB³’2jZõW÷âQ[Ëpf³·â¤1H%÷é91FÌZÙ†St>Ñ>ø´Gð‹ëÅm¾a7¸4Ò§kD‹ºâ‰¹BØ— c…X›ÎcmºÛ§éfC’’ÆR<93³4ra–ßÖa¸@ƒr]“™õR·„S•yÄ~Žª-ß±ö»°Èÿ8UÒÚ¡¹´bò’]I“ºPôiðyÖ+é«àµèÅ9и:€·(ÉkŠ^þÕ[à§ëU~qBïæ º1ÏŠ>ÐêíS¯>ĉ?ÌÊ2˜¾CŸ¨íàøˆŒuªø¦éí°¢xw!§ˆ‚Û7bÉ|x“ä½%û?ÙíôâëZZµCcµëËZ^ãol\ù,_ÿ’ —¼þCÓKÞt\Ȇž2ÒS§?Nõðü#HÊ)β2™JIͲ„ Ù d\üx ð ›Å*ÞœHR"GJÜÀ>ÛÙ>rëO`6 ÁëmÛÆÈÅ‹êX¨œ G ˈ£{†?H ì—}ÆÒß.˜LÓ}mÂ2ltlY~J$íü’|°ÝÃÀÝ^O9—s!E"‰+o1ÔX VHÇ«#e:Àº¹Õyi0³¥ð¶ósqÀù¿¨]!­8Ƴ rÔ8øe$·ètÝ Ÿh¡@ .’àÙ#Ò"¥ÆT+H,80ÝÐ<<òÃ¥LiêË^¦êk~–)d˜´!Äž;V©uŽ (É|—YÝ>̯I'º?Ýø{ÊDZ÷¤ PÕŒýÁ›[?ÏhÉþá›ÎŒìÐzM“€æósE&]ù”þ@xž(æsUI’™Pí—.b¾’0MSzJ=Å!‡=ŽÊy6ïôȵ¹ˆz¶>}É„Ô*Ì%µÚ/* Ê[%q¨%W­µ”3®[%™±ûÚåÓpj~)(½ŸJ”bõEð„ÁbJ˜oO´Ï6•û^ö ”JâFËàG#uToÁøeçm¯Ž£¦É>øæ7ík[¸àN_ÆC UøŠÆ);óÍP§ c½pïüwB–¿€ŽìøÛìÍà³\³ˆÂ|(v]£ u¶o£×°Ñø\Ë+˜|›˜‡$¿ööûeÀIÉ$øE´ðmSAñ ?]ý,LÌ…™åóÂfä°àwöE2Ë9~Á/—l0ÀNÄÿçùe„åAÅ̦ÏÞ¼¢F™ëõ#169 c ¿å˜5~\g¼ ±í!…'üÆ»œ”"tíjù D×ËS¤¹ ÄWï^_3ä{=À„Ç“Ïõ¦}%;©N×Ì„áÔϺ0ä+„,lóQ3påqß‚(œžº±•*æ0}”NWÚø©ÑŠ÷«G½ì?4.“þz{¹¼_¼|=¶ªwe)úi¥‹}‘WP‘'©Æ±ÁÀŽåvœ»ü1.–®üš[Y`D¼mùGj£u¼2™!Öº¥›–e Äè‹Âr–ä¹xH$Iyg¤=o®Á.-׫5yÔ|BR#ý:xëÞÿ£Çüÿ’-†³ €¬iP†><á”>•¡+˜Â_n4Oø_+0`âˆ? âѵM¹ôéâ}(­S\à4†Y‚sÇ¢Õv¡Æ‹ªª•˜ÈÆe¾üéO” ê"òn·óßK¦]œD»,ÜC0Êvq(ª”,öüíþÅÿÇ›î endstream endobj 219 0 obj << /Length 1902 /Filter /FlateDecode >> stream xÚ½XK“œ6¾ï¯à¦jÑ /Wå;vÖ‡ÄqÖUI99° ™!Ë°»ö¯O·Z˜YìõlªrBV«Ÿ_·ð­ã;o.þ¹àðõî¤K$óÏ2§Ø_|üËwJØyëøLd©s¯éöŽˆSøÖÎo¿^üp}±~øNƲ8ˆëå²,ŒœëÒùèr°•—f½júaåq7¯ëªÙ®¼0 ݮ޿Zýuývý:qqÈ|Ž÷h).|#òú5Ï.X(â‰=Kí p×Â]<ˆôµ‡+“è Wúp¤Žc:þK³ò„nŽŸÈU+îJ”½Í*HÝv?ü|õ;úOý ÷D|_ ;Z}óó”òiuÛ·=˜ íʃY[÷4ÿÓü7/_^Ó8SyâŽCU÷¸šî^ØA~«/€CÜHÞ”tòÞPµ¡¬&s€PoÎYoiãxaºý®ëÇ.Û¢ô8É{"yÿ‰F¸ÂÝG^š¼„33' KE¶Xät'[m³©¶£’G"W€jrIT½îEàa£ÒÑ]E$ë±Wëº-òz-‡b}S©’á­Kgpóq€xG¢›(ûc1ÜŽpG»EÞà<ÔK:¤z°88Äô\i-¡çídÝ=¾7ËXœq{ ƒ¯ØÊ.Íi^W½Yh7´ìÿô¹0àF7TmÓ3L .Üë$Â}KG·ÚwÚÑ­rj–e#{¢È•|± šÇA¹ÒòÈŽž'›ü¦–^ÕÝÅK– a»ßU*fN±¦Oö4¹«ºÔù‹3TPd yCó«wÀ](ÇTjÎIÕ— rà* ­ ž‡©ëuªÚòðûo„,Œ˜yùà »%$éXHZÌulyŠðØ4}]mw:÷ëO˜¥™Ûï!‚¥¢ e!Žäƒ,ÆmAóèÆE\© =ƈÌMQj7KÂÆ £ƒû:…âJäñ°˜ÿ,I³CT<ª '€² G‘ñ%»¤,H Z@¤„>7æ-¿b'%óã㜠$ÝKy3nIó½ìû|+³u¡ÇS®±€ƒ™´h•Ü&4åb[!æR¿z2(ÈG:tH î†P.¬Ì°T·è‰íyR·Û™ò[J*PÔâ¨Óþ'Pè˜JML‰/…OH2bn ¥TêfÙœéLãžð‘{ÄsÏöI÷lu´c÷Ì4vù@‚¢-^AE¥FQv†¾‘ƒÝ+&–Ö›C=ì3tÝ]ž6Kg8 ¬z(¦€j¼ÁR7!)õø_Ógˆ\«”‡˜§gÀ-ÜʭѸ~‰à‡dÖ8 òΠ’GS¬sÓþÏÏžúõÐTÅáD?ݦ[/zA ´QžäTd0ªY©……{ÝAàËè–¨ËJÇ[õÉ2± Ç%q^hºK¹ÉÇÚ†yM¡/Œ=ŒÐÜÕý £7ÎO-Ês¯å¦J¢.mívÆ}§Èû!MêÝ ¹‰ëî…‘À;rª¶>Î}ÈáyRm©ËŒ™ŸNÍR¿À"„2XŠQû^Dì Y”&w:Uµª(Š¡køzD†AÌ¢à4$ÏMœ¿G|!„ðxìr¥A! M`ÀZ1u0;Ä Œ)V>T¸,Š¹û^£jhÿnEn^†¼êéûYb;çª ­,ÞE­DDm$²ç Û »ñKúÍ€Ó6Ÿõû#ö1eeV‹Í¾Ýp#š‰:Âl‹õîI¸>­£©ûî ®{EccàoCr#}¡d>ÈY#-€å«Çýý¹Ð@?¯¢á¬À?ߟny×Õ&3· ÚýÍX“PJÂAŒ i§Dшƒ?'6ƒÍMû õÏptÅVDW¬µaa«×Oq Àz–Ïtõ D2wNç½ÎuÀAŽŸ”=ADO&D?"¤RN¥ §uò>Žt¾iÒº’ô')ˆÅÓ¸[-™ !'‚s:ð8®ïrµ†>ÉtáÃÂó úêŒÇßÖ„ x ái>>é_0½:ÏY¥j»>ßUµ4ݹ˜ºó…nj´å̆ìÿÚSÙx÷îÌ/“ÿÔM úC©Ìãlö+†Ñ£ßò˜¿7§¿÷PÓ¬ÉNž77ÔFýj0dºì·êvÞ¥‰éÉ@yb˜•ôoÚAäçEѪҼ+&&¶ÌàßT¶ø[óÇë‹< ÎÌ endstream endobj 274 0 obj << /Length 1490 /Filter /FlateDecode >> stream xÚ­Ë’Ó8ðž¯ðÑ¡&ëá×f j‹b—Ü€ƒ&ö$Úuì`Ù Süüv«%Ç΄½,'É­~¿Dû(‰~_}]q8“ˆG…`E”— ãe펫O_’¨‚—wQÂTYD𤋮€³‰>®þ\½Ú®nïD•¬ÌDmÉJ™FÛ*ús¦ØzS”*þЯ7<6ßLSïk»þ²}w{WÌhU&Y‘»#Lc•xEoïxqŤÊ"oöFäÀANÂ@)û¹ ˆ@Ã,#¢Woÿz}³Þ(•ÅÚâ™Æš>ûnL»'X¥ëc×"b®âÑÖÕÖhÕ·µ(âº× OAzEŒºÓzCƒéÚ5-Á?'iÒ˜1Al=œEÎägñ ï›Ú«×z¾£=ãêµÈãG´ 䜕©íœôŠ!YƒÉâ’•Y¼]È+ƒºé¦yZ*F;eé|7žÇÆÒY¯wãà ƒ/Ò.ýØz„G3<Œäv}NN±Žy?Ì•öèGº=ÑÇ=9,Pv­¿½šôf ª+v¸ìhÑNUÆÛòHxÜ×»îx¬ÛÊY‘𰘤À ˜N|Ö“júžL íЛ‹­{ǸBÌ€| 9KA)%Kó)×7ãó,åPw7W˜dPeùÄbÿ!D<ñ¶õæô@ ït°ÐGœœ€NÝÈ ÊJfKßÎÒ@ŠsÉ1—ÎQà…à+È{ }šÅ÷ã@øÆ#ºä<èvïê f°„¾ï DÉ—=Ɖ^ß¾&‹|ë–¾ÇvQƒð)¤?¢*P̸ŠBtWHWrèÓ¢fã÷õF ~:é{ÓZ²H>"ôõ ÄÁþí@·Þ¡~ªÑô¨¢žë0i`n ë·—\#|³5kY(& öY ±H/ûµœõkÁÊ¢\vìyŠÈ"g®È‰¾#¾³}.S%%9ÿ2ìRä ŸžJñø}7ÔÞ«.AÑ ÃÁƒvPcÐ3†¾kp¥»ù¼%¦?…Ó‹Á–<‹w}­]öJž†^óÐa˜ð•„ÁKx%é€TõÝÉ·õêA%e5rœ€¶Ÿ®öô…צ&”  (RyÎf:ÑëQÞNº€"”²û:ÎÚ|Å^¤p‹Å '6ǴÚüçŒG`K端éB6u½'êðT®/°‰=DŽ˜¿DòL^ԛ̔¯[|ÃÄÆÉŠwÝÒ«î÷£S¥ˆz zÞâxS>áÿÙ'K 0º“k¹˜MÄöèæâ}LSÅ tžEMi Ã<鯩À%Ëy´Ý}W==WCr¨ qn×™sŸ Ë $Êx7Øq5_¹î^´^7íSX †;Î"œõ#F’º2;ŸÅrò7<èÝ®'×`±f\±P¥ ê.è~oúê¹}"a¥àÃD…±Š Xs4ö:@â[Sù…Çz½N§æ‰p¡ÖFA€‹ïéøH1¼!8¹0{&Ï2&a\øÇ­ ˜¹Gªg`ÊÐvC?è‚âè9»¬†éÍê£g7)ˆS (¯øS¤Š•I:÷çîŠC¡;å2 ¹ @Ö¡½ANº·(=È^h¾y1¯À;3_Ú|÷¡&Å}—IpoÁÃ׶µÆ ¿ñà‹“'e PÖß¡µ¸Ð†g¤lìÖ>ºÐÚ€7ã!ÎGÈÈeâ7;ܬà–ÇÅ727%+¯êÔwÙµ¦¶= iàŽóÚˆmå€7ÛaàðzðHÉN¥¤¼ÂgNÏo_·¸È7Ž£ŒkíZƒÿúA8dmè iÜãÍe¢;ÒAãÆ_éÞkÖ˜û^÷O¸u{]N‹Ÿ•KSCjøI!UÈN9/RžÇ  ¸]É¡¸Iw‘Õ.ËŠ0DáåÚ]ò™d^_H²œ%0dS˜é*Uÿg!É–¨ÔqÁWY –”¿Bd™²$/—"_„R?/dlñGNÐé_6èú endstream endobj 191 0 obj << /Type /ObjStm /N 100 /First 883 /Length 1436 /Filter /FlateDecode >> stream xÚµXÛn7}߯àcòÂ%çÂKap¸ Іm ?8Žš¤M%CV´_Ÿ3ëXŽcÉ"´ÜÝ3Ã3‡Š9¹àbÎ.rµ8Ê„kuŠ‹%8Å5ºTðßíž]Õˆ+ä‚ý€#•!Á CeŒÔãbvQR ?¸Ï\\¶yí½MH@׊AGÁž†4P0)¹0½°} ?†Ëö£ŽbLàÕÀÙ‘é P1€#ntÄÍO9¡Pì}ÄkQC¡TC¡² ²©‡@J¦9ƒôÓE6P†P©É&vTa&ôÕb ’ã`ï >03q4ÚT00;©b`vrpLf'Ç”¡7ÌF€ƒdq,Á0Ð#’Í" ø1f0ŸðD¡9™¸@s2qæx0q³š3ÂJÍÅfÇS.æeæjÁ4\4ƒ® ‡XÒ˜8¢.ÁÈ#E$2 wJ4qe'ALWuÂ&® ³]3“84‹Í®Ð,ÈQ]Q‡¤hŠ%hNæºÍÉÄáOI&ž 9Ã%ˆ“84—Iš§ C ¥Zæ ekèA0¥–ŒÌÈNÙ‚`§>¦¬N͵РdúàO8·Z ``Ö`©˜5XA*æŒi ™/±†T©{{Ãøòß‹™÷çóÅj?¼ZM÷?¿›ÿ=ŒOË׳åIÀº §ãOã‹ñÙIœn†ñhv¾r'5ùlîÁs²E½ZìBõ11`ûnoÏÇnüqñráÆçîÑ%ß-æ’Ý“'>Ýx`Ay¬%E|F<¨ªGVïàQúóÈdöÃÁ+‚{T†?pãËÙ§•;½íªÃ³7³a|ݳùꪬÛ82‡\.>,Ïg—Óž:=úeöúÝÙÓÅ'7¹PQC¬¼AÆTøæðl  P¯àS.1¹õFÉÚ »žn Ö¦èÀ4×ÑaEÕBqÇn‚jŠÝ¹[mSAUÑ`UõKÀ§xû{{Ó ãþ¡ñxüõè…}½]­.~Ç?úÿf¯–g~±|óxKí¦…ÍÄç kZÂX¡ØÌJëÊï‚ÓÌÏg«ñb¹ø ]Žÿ,WogXý:qâ=V›2l3’³Oh71b¹æd*pi_¤¢ íé‰ÔHÓ>Ñ)(õQ:#1;º¸$ºö©èŠDâçû"‰moG¢ ŠüPà–ê{Spñ;v/7¶}”ï)ÅÖ„SŠ­ã}@)¾±ÕŽEM{Ò-à½cRÙó†:°‰6#ÂS»‘ 4“vEj­^ˆû"‘; GŒ$¼TJ“NAûÑäù&d ‹ç" >´DI‘"öÿC'äõüR¬Çlq€dñÇöNÈ5ìª-váŒëS’^È5J¾É~”wû³§òzz¶S ´Xeΰ½k ›{i KE•Ò^È5F‹ÆMv!³SÓjmB^ œ4ìï‰Ýj))"Û ¹& v®m ÁWö‡['äšÎx¥)µìVµöB^ˆè0µ¶¬‚˜p, Ô ¹&€3?sËêƩ‹¤^È5Š>”»jÁzM=[z²6àMO¶åüíQGyâ»ÝÚC´,w´LßÙ en;ÒÝÞÛ ÝEnkÐî S*›só{РõEjÅŠ_!?ÝøÁ endstream endobj 286 0 obj << /Length 3089 /Filter /FlateDecode >> stream xÚÍY[¯Û¸~ϯð[}€X‘D]·O›v¤EÛ =EQtûÀ#Ѷ6²äRR²§ýó)ÉV²] ôŦÈ9œë7£pwÚ…»·/BùýøâÕ›¨ÜÅaeqº{<îŠ8(vyi‘íëÝß÷¿9ëëhìÃAåé>þæá†áþÛ'xŽöý4ò¼…QÓøaÔO­þñø»WoŠ]”YœáÞáî ’ Œeã×ï>üöá—Ùþ¬ô‘åÿKoeÆŸ—þZø|nª‡8ߟå ýûç›m–“]?òîïÉþÃsÇÛؾkþejÙ¼Ï|äŸþÌ3q'x'ÚÛî!âQË$º«7XJéôN  ¢((Ó”eГ\sOBÄ Ê‹™A|`‹ƒ8Ë â[Fó2Ï÷ãÙÈÞ߇i8Ÿ†'`‰‰Þ7×å WÛ=Lûªoá­(eýw‹ó¥ª VÏW}‡T£nº5/´Í ÷é[2øØõøâ爔¢ýÍG'Iº<Ú-á0ÁÓØwà…þø îì ¬:Y^”e’ì1X_ó©ß‡Q~óÎÒVióDÛ™‘8ÄŸÞ~„3‹xí[Û$?âDbm^>a‘X…'žöGR6 P!{]×Ö BNÖ„ƒëê”Öt'R9Œÿí6<èЈ¦ îùDz4r"žþŸšqfæÂZ” –ŠÉ¾tmüUÛÑ ÿùxXöÍÓºz‘‚s¯`-JÓüœrÑÃG´·¯éðÀ9Dð§?_‡ Å£±¦«Ì’ûÄiÍ[×/È»÷rq¯f8ßI‘N·<æø!f,ömÍ “«—Ã/© ‘íþ.!ׇs?¹;€åÑ’¶µÓ€¨äÊÎÎvÜåÝÕÙ\ÿ‡Ûf?ÿ¶.Œâ…ÇÑ6O›\º\z1iǤnÛcÃ/©‡ú¹Ó0HÃÑš7x®)bt”$àñI²ŽWA^ÈÁÞ ^¹”…3>aâÅ­ÛINR´ùAM»»œ8Nûc@Zôt‚%„&Ãs ?q´2œpÈ°!ÃÔ /2ZIží³L¹ÃŽ¶¿xî7-4ÿ§ÁáËkb_á‹®äR›ª©‰óBmú"À]U½­HHƒéËì‹hveÌ+”» ¾ WýÕˆ¼ ØÛ¡²nù=8ÅX9Ç¡#å,fødµ²F Ö„g6F¸øÛCN7mùJ¥%,ŸÌx“b‹.ò¿Ç”·^á Öç×i`WcÓãUÏVDÌÔÉÂ=nßB€l;¶^/õÀh©P ôbôMÊ€•“쾈/NåQÒBf–#–øOd•)4suz´æ`C:ÑÍ…™®›ã³7‚-Ì >+ößvNž†ARx7?^Éu[Þy® ƒ\%³çòUàø„r\ÃPêú8ðœä^_õÀvcq´ä*"&ñB @âŠÃ^þÏ2±RÊ“ÅÖÍTYQ:†›ËW®¾ªâÿêjô¢,È’hKÖ¨´ŒM¶t¿Ì÷ý•K¼~hF™ªkÈPA=˜î_ÏfýÖ¢ØFz gu|:12"=ÓÊšHx^»•YòžàSM­æ— á¶Á .AÏŸXŠaÂàÉöº®4W„ð̧”¬F$¤Ô´ˆ˜¹Ã?0·t¹Å;"Ž’Í¥jyt“w@ oÂ*Lªçí6\eº²KiºS&–—Å{fbÒä½YÌ:Îb'.Ϙ"GL12.÷ìýžg=2¥ndzD ˜ü‚qk䧻+ÁçÂlŽç€úYRž¬ƒ+‚mͧÃ߉W˜†qëƳ6Uˆù¢qdé~è1ó%ª¼Ë|Ocò2Á .˜§^¤¯ÞÄjYîYP¤Þ­Þ7×-<ñì¤w­áÍTp';x<Ã4E½&§gÈÂf-a¥änʈU•‹&¤ì(¢[·Æ›r@6R9=¹‘ZDtNÌwéæ/ÃD6!EË $I l†!)‹Fxøzý@—Hýë Ý¥¾!ƒCö}O™HªÅ Lµø¿Lê°qê°1 îí¸Õþõ$;5²Ó¶ÞoÍ B®©7‚n@VòÞ•r6Õ”‚á_CxüôBƒ 0ÔG!×C KºP’ˆn!b$\Ñ^G~‚ÂêÑp:>i,J÷@,”hÝ`J<Öº×/Wr±/× ‡Úø†v‹°Päj¶¬ç ^C°#‘ä" 錩ÙûK)ra§Œ'k„˜$³Z¿0 —¾×¨Êó ˜u5ˆÔµ¶Ï÷J8‘§êN©Ìçθ²8Z'–×o±‘«´À-ÝGeɲ›«ÒýœÛY?“~`öUsq ö*Zfjñ<¢æò!9ŠêK¤æÔôsË{ä>ñÑ|Rô]{KJ¹ëÊŒIôf(fµfûE ÊÌ÷ `eh^rƒŸÙ„EʲXAÊ6M‡Æ­Ç†aÔ¢ͽdsbÄàÚ1™³œü«6¡² ,<¬Á“°• ×ÅnH§`Æ^_ÆA:×”³dkI×òaûPù=úƒ¾jÓå.j¤{A48…Å}óDR|ä7¡V\Åî¨YëªpißÔ™Ê 2¯‚ʄݼæ9ß;Ë)øhÛ }·e §°¡G5¨¤;¹R9ÉöhºÞuÃj¾ª´ZNR!¹Æ!l=®šaÜ#¶sKpÙõ÷¦‹›tjKıW;¼þ™µm·ëý4TèÂKÞù2_ n†¯ÞAÍ>5 Ò8¿q)$Ý•‡¶T…;µ’£¥{ 0¥‚‰ƒä'”‹FÓ€ïa鳊ɔfuˆD%~ÃP ~¼àïhi–’ê;Àˆâ­Õ•9N­|“ ¦·ªx?Vð$1Pð”É9q&§Å89A8rqe~o"êe²²z8Sºü kV2NõH?Z~C‚×ÜÇ<:W8¡Š§®â¨LQ{V¨K¨QZ±xdBÄ“os[†-¬˜¨ZC»Ãî@m Ô¥:˜Ûœ¡Zø<@)gÑË+je„ uÎ:JxÃô@x“·¼^éip{™Þ£÷0Y¶Ä%í«ýµÕ¼B±>0Äh‚`ŒÅv¦åU'Ë[³dÎÆg/Ò…âÀuI+,ø“”š,ÓÑW"¤YsÔ3‘‚Ã:’°Í$¾á@}~\ÍETo!à µã,¸0Mâë†?ÜÈb«`bÆ›–?ÞB Tò-’}ÈžPty² å`Ú™Z¦õ¦Œ›5ÿk^»¾¾†ôráÁ|ß&Ϧ½òH“dò•‚7&Ï‚ƒ]"ó\¡¯l\Óõ‡qîáøÇ11Ì ~ÑDÏ%Ì´C°Öær%¯†ãü(úÂ#öÎÂy§Lú !Š¼s&ü™ š±¨õT®`n®úĦòÊ‹Ô½òinyÈWáÖÔ'ÃÄÀwcyx«`@ÅXŸƒL¹æerÒŒNXKj.QØÍ–ÓgÕGÞÓÏäýŸš^N’gWFÜ‘[¼ÀLCˆ”Naê­ÆÑÁunD@h°ä—ùÇ¡üeLÍ™¬ùçÔXWb¬ºÊ’Mªù©¤F˜®¢h;Î…F5Yú†Í‰Çg.8­Á å"µÅÜ°œ¯ð{}¢pæ ‘ÒO}·ðR©»ô¹ª¹ü—Âù›sƒ­"ë á÷61ºÈð˜{»Wg~· "‰‚"ò(ððá>9F!QŽ X}ƒ´ UF†8 , 3M¶¢ùîñÅOf> endstream endobj 302 0 obj << /Length 3239 /Filter /FlateDecode >> stream xÚ­ÙrãÆñÝ_Á’º–³˜Çú)^_rU—W~HÙ~€H„ J«¤òïékp´Iü"ÎÑÓÓÓw7ä/v ñÝg¾ü~uûÙÛouº0¾Š"c·ÛEbT²ˆ#­l-n7‹_½÷ûìØåÍrÄÖ Þ-WÖ÷½÷uõ›¯Ãݩɺ¢®–¿ßþ@˜t¨‚02ˆÉ_¬B_ù~Àh¥—+­õnªe ½®©¥ö6§õ€!Y¤*L$çM3!ã«›Ÿ¿^®LyE˿랆|Ã+§¶¨v<Ìø§Ë?vçÐL1-âJ™«å*4©÷ËcÏíµ]Öt§ã˜¥Ñèú&Ï6­<8ѱÒA t½Çfiµ—ã Ú#hª8IðÛ¼[¿½+š2·—¼ˆ#åÇÖAÿæ[ÿT•yKd›ƒø¬À^•ZË@Ý>Ÿ¹VÇÊ¡C´Z_^Ô6qëúpȪ _{eQå<ªÌC£8ðwW<,}9°Ùj`©µ±÷DŽ ÕÞ”÷Èü‰'wÈ[O°¯—0ÞgÕ.—‹³ŽOmÞ\ËuMþSÞv¨Æ÷Š-¯>!Îú$7Ô„uSlåáÉôNE©™2Ì)€úV4Ç KÄX„óÚbWe%Y5ð±èösLB•=O?Ü|÷ý/?]rˆ ã Þ0ò¢s¨K¹.Ûüqj;!¨î c°*ä÷ÔíÀz·B9XĤ‘£\7 –XàpY8°Î]¾/X&Ì=FÊœq/+ËAW¢ D0™ø›•÷¼Mœ¢5ጊŠ÷²Šç`ºyÕ¢V±fà1gøçi™ž"zÀQ Ò27Û+½ŽÄO@ÊJÚ öÖä†Rq‘ÅØmÒò Ù†€ÿ´ÅáXÊRÛ5¤Gi„ÌŒó{ñҡí„hímkçKÉUmxõŽ£¥sxck¬DoŒ:àìõŠC-,¢%:öʼc»ÇEŽj0è 0qaØ DrÅ1$õ®~Ö&¸B34Ú»"ø'Çî~ùnw´WÈS¹¹á›‡¸¬ca-ìæÕº¬‰0áèƒôž DCú3÷j¶øx]÷9Rl-Q0U÷œ#Ty‰lÐׂ¤Û9-Ü’‚ç8ñŽUùÈ?6÷}jƒŠÜ»-Œ fÀˆ8/Axb,Úçå6>l†¥ » :óJ2­Ÿo~âíZò¦Œ2ÅWHÉ›-lA¼­OÕ†dÚ—†î÷Ç m"€tR÷#ŽïÊúŽªD`¥d±#;3®³ŽGÑñ´q„ÍtÂXùñ(l¡‹¤à9SaD*ꆫ3*Æ‘p±ÒÎÆíž›.˜Ú@¾zè«C\Zgþh[3Í­ôW §ð‰ánŒf'‰sçÎ/ߤÓX…ºÔ·ÅøIc:Ã@E‘ú§r#w•mÍ×õM… PGoÖY³¡¶Ž¡šw!Àw ù0¬²Ž# º)†4püŒ7ü–óbJ„·áR¥pfyÜgBV55×9Í&o¤’¸ueë!ûXPwp²ÉÝ^ð¶|(‘?Ö+ßø 4r…á¹´¨HdNŽ?)ö΀Øç³ËG.0¬g8aƒÁ(TÃŒù!ùCUw¼*= O·2×8®J‰~·ØTÔK¦¢…Ž°¡,TvDjYïž7)mõ§‹™ËYù8Nÿ˜ëî©8êÓÍö©í)ûu¸rB]«4íK»gè‚7븧ë÷ÿ›®ô®éÝã:£@¸³Wutßé( ’²•¬ËB®_f-z‡KäQ @þîäî%—db¶ §Šù²›UjûŽ¢uút/.BÝ×f;4K\ÝSuúÐC‘ê"ØNÊ݊׉ZÞ¡,ºÀƬ$¬ Mï}zîMZ5>Tª£Ð%4DŠAžÛ¹F“¯Œî!@Z³xHµÍkrï;Óø»p÷ë›WÊRjaªt½¤‰Úª(ÕéNÙ“ª¡Wîêðå*Ž"ÊPWõAí µ›æsÛ¼Ì×Ô7 “ÜcÛõ5V˜$»Œ÷\—[i­ \u§Ñáîä× tˆjù7È/¦ŒI;™3nré€Ç¤éi}É \ÐìN£¾âa1ž»Zv¨¡í-3ñ©;ž:éR„qâ½/3"‚b.B@Ìy7§;!XoØ˱¨¶õ¬’¦F=çK4Øêííû1k*‰†g½ëHECÔ~ÏH“Ϻ›6¬ªÚÌ=+UÀÔÞh².+_CÄEðup 8ˤÿtêx^J«‰26à+ä¤ùÚ¹×@ÈÎ%éT€›üî4Ó¨ØFjL¤š=—‰LOÜ›Y?`Õðh6àùkz›z¤Ž?ÞÓ·,p½º>!€{©Ã;÷•4hõ‘³ XßgG±¬8q…²™ÈH=Ò£B3ÆBsî&T24R±ÄëfÞPiY%_¸49œIê>’¦5SiÂüP´’ßìéƒÁCAZ`µ„&íh`èÌ¥zó0:VÉàñ²“ûГLãshz?,yž¤éŒxbÝ7„ ¨pMÀS““YÏŠ?0*\ò¬’]èÁánÝcÅ™ö|ª¬t~5¤¨1Q`®¬CáØ€ŠÒÛ¢!é®äë Lbv¨1:Ôí“lט%âˆ[f8’:öœ£¨ÒAÏ-t©soJ‚hH.*‡»æ_ðûPœ힧C"0‚¡Úµ pe.Zi’áê¼è‘ ýæ!û|ÌNûN|A>p…ÔáÙKš ±roÞ‡ÃÿE:Œ½ ÅiW·/ek)†Ôè“Ó€z»}5nÿ1›”LR>*1æò;úœ|29Òèyϧg7Û¢¤÷ ¢IŒzѨÕñLf~2®ü!¯º?áqÇl}Ÿwí É›|àÿó’·çRó ±àwÎ>pQjŽz¿s ³42'i9’†ßé'ZÅE‚<Š¥‚Z@=ëL‚D…C¢ü\†Ô!%D“26¤ï.`¿ü骿¾Í×\Òõä°KÍnŠwȃWl;¦úYã–ÿ±˜ûŸ’žeû<¦:îèŸJšû7²áYbò¾æ0ÐÔÔQW‰“ƒÃ–ÇãOÿ4¯«Š9ÐòæÖ>èÄ.6ÛÆB‚˜>ÖjOó"§<×Ê÷]¹BðS“›¢u;‚Í 3Ùó¾ØíóÆ5´–)_tŠóvj'=òþ½±×¹^ Ã%ÜàùÇqÀzþTØÇÀ­àr!Æ—vf<ùæö³ÿÈŠú endstream endobj 330 0 obj << /Length 3520 /Filter /FlateDecode >> stream xÚ½]Û6ò}…‘—ȇ˜%êë€{h6ØŠæ’‡´Z[¶ÕÈ’+ÉÙìýú›/R’WÞÝ´½b5E‡ä|Ïþb·ðï®~»Òðë/ô" TºH2_é,[¬WŸ~ñùçÂW&KwwX˜8…ßjññê_Won®^ÿø‹Leq/n¶K¨²0ZÜlŸ¼Pj¹J3㽫šÛ|¹Ò^µ\…iè5ǾlênùËÍ?_ÿŽ˜8T¾ÆeCŠW¾ìØþÂÂáhÎÊNZ t†-cL(ŒALû‡ˆˆvð{ÛhâoÏ ªCïÍõ‡·# í{ŸæeU‘fá„¿çvΦ¸ioWîÀâÓïÆ.<"˜ãœwŸw¬.ZÊ‚$ /aAÖYÛµ9)ï©Ê[8´î™•èŽH׊uSoºWüõߢmxüPäµàß”™!ÅJÊ’ëX­µã ý³ù>üÓß +"s‡¶'ïB¢òbFHL¢üÄùj8¶©ÀD²¨œ-Æ€_[Ð ¸?Ng„)H|ïÇKVn6'8ðIŒf5Îdq†Á-(v¢7²_²Šá˜5ÕØ>':Á|Ëö™?kˆ‘–ØKcŸ€.óž¿Ý’ û¶EÞŸZ»‘ö‚\Ö Ã8×}&I|–o×í ¿ŽmÓ7ë¦êø¶, 4¿˜©4t±Ý¯3Œ T;ÏÙl·sX"gŽ·¿Î:à@eI梺Ün7ƒ)Ô*Lƒ§¶ãö{(º.ßrÄO¯fD4Æ ND•R383¥cçƒ~yò€»Ç„7S¥Ã9é%õÇ »bÞ°L€ìtSðãX–°CBsqÑ‹9ý |ˆõÐYQx÷A3t`eÍ+H€`À,Ûð…e±H¸üÄÚX?ôŒ 0ˆC0±,Û²×:Ã.0±vÛ#[ANŠÎ!ÒàU£ÀsI Ä>_ÀŠ¢­›“%ð`£´e;kª@;¶®qŽƒçÐ ExTt °þY þÝ‚©ÅäLnÒt „°ö?ÈøæÄ ë\˜S.ˆhlÔ–³¹B_$fž1‰(e‚‹üfËÞ2?Òúßjk¶§šÄâ’W˜òpF^3e†üÔ ¦H }Döä-ý?tҙܔ/cÕól7±c»“,Àû ©ŠcÄO Uðç U` 1Nž#T–5\¨,¦‰P=n-¬Pa6BØ96BÝÔȾݩ%#ƒ Þu V N0NeË]lšd*ÿ±·ëdSÿÞõŒÔ¯´ÂÄSª]P¤ V:šS¤IЪ4rš]|=¶¸Rb|NMŒïC&B™«Ñ ¦ìKª7úú¤ú¾Ó§Jööùg)6R?í˜`­keNq8blÎFDFEÉGƒí"Ô™ˆ ìÎ"aw{íIÂlë÷vŠ.ؠ•UA—šK)Ž!2# ¬ Zöh‰èCmT {>\¿—UZFôæÝ{‘Nì}sÏ¿—JcþíÎÔÜZY)>“· ’*EœoryŽžËû;«ä)gõWûªøÏðUú¯òU{ÑS…š Äðs¦½Ø5ÈJHÖÂú-üºì·Òh,,x¢ÂðÜm!Zv[£mIr¦“‘Û¯ uú·Gn‹fNÜy¨òG?;3èËB8_FⶰyVK×¹-¼PHtð{üV˜xïÏi8ÚwüÉ54\ý?N\½Gð†‹‘; „›ÓQfq}øÐÈdgÐñãýµ£s‰ ¨HÓpJ«®<”UÞV÷bl Z’ÕÔÖ®²ñv rC»rg˜îªbйñ¤Òc¨Ï©óÀR’ È}ÄzƒoûëˆH9"!gŒ*Pmq2¡»cí–‹§0téªLûZ™Ì‰ó`_&¼U6Ä5c猨ió¸žÔžÜClpg{é°[”²õwr894‡¢Œ•8‚Í…%A¤Œ+ŒÆžÉ¨ÀÏÄÔ¦T¯•®n$Ù+ñ¶Âî«ÇFÊô0úÓÇ÷?pk"H»9“)m²iá|lYO–~ØÜ’0õ³— * œ)ûÇ“Y>’1 k¿Ê0Yt1Àx‹#§5ïŽÈ…H†¢\Cö ÁÈ0H\'^Ï¿Èn ¿J‰Õ䚸½—¯Ê×Ô9H8åæš‚Õçíà-ÞwW'Y‹®·1¾ÛKGÇY´øÚAL(í" b5§|]¹)ø."EL,3±žÄ뚃´@Âœu` ºòveú¢-×Ü?¦[Ç“os6—Ð$½¨×4©_¿.l8û"xmë $WßߌLQöÄ©òÃo&ÂÑ›‰@ei6}51yï`RÄh…ËÔ0þÆ›ãÂ<¥‘õ¦ÎªìzÙû–÷>‚Ìvh|ˆö²±â” f¨Í ž„ʯEm‹…‘‡ovd±û½µð¢¢â¡±`̆–¦ßr¹UuÖ1šô²Ûs®$׊÷t3"yXÕ½”ÒŽ}$ð­—Á-r¯å¸¶œ‹L"Ðæ¡xýþ‹áªo¾ÙX­}<þ&S»H%w.éð¥dJv#ØýVI£·Ã9wܑƵÕfuâÏ}§ºüͪtòsºZËñ t.n‘•xUÊìðºé$9;Œ4µ ç‰vƒ/»9]´dɈ,@Ä(Æ5yΟj€ÿ"Ñ+¥V¸eíÑCëÚ"º‚%)À’ 5¡™,Ê$éØÉ?uS¯Üõí­¼´á!÷|f ö«½k~$cwÏVì!ZëW¶”-×xtWb_\ ã’ò$ gÞ7`C!ùüÃRJ¿œBÓåÒêi\¾Õ`øCâtÈ»Ïs‰ ØŸ! Áèò§Òqc(y_ç®Y}åël¸Ëº|16-\<÷bì¢ âEâù³÷4Ãê ¾u°d¦Go¹ïŸ‘\’ 'üK& H ñÛI!my0àRb’5 \ö—דØq´ÂƒÉ¾wÌ{|÷%¯Cð ÀÌà +‰&‰¹’¿ùñXA’s‹Ò&‘w=8À:‰­‘|sGSW"¸«4 í-ß{·v'nîû«Å'^k¬XÖº‹#`ÓqâiÍvûå>?ÜÎ6EŸ—ôh€¿ºµµ¥; y¸]='VW™tÃåæàœŠ¯}QoìóZ¦ÊOÖ0¿ã±z`t’(ëXò`¡·¢òä³3/s®QŠ†‡0V£ŽøNdæêKƒ“++8ÍLð–XŸcÝ€oxTÍt(}^Þ¾áwh±¬b¬§ïÐbÍyh¬ÏsçØç Õ 0ÀªΦ´'æ穼ŠÏ; ¡ùæÝ{—àd‘=ªØfîéOÀÙr§Ý±»v?#`ô²ÆD‚ŠÃøì$ awƒjÞó@)ðk›aNhñBPƒ÷oF)+©oÝéøH B¹iÅ ‡-v‡Õùfþ¤×7Šþ$òBÎïÎ-ɘÔ~èé$S\Ò¿®¹‡|%µ|òMñŠŸ% ¤;—³0S&=Í«ù Ø ÷à¹,7„¡~h Ð"BÂï™ áÈ>—½3mȱ(ñ¸H$NB ¯×ű/Ú±à#›ÙÇüÿˆxc, endstream endobj 377 0 obj << /Length 3911 /Filter /FlateDecode >> stream xÚ•Z[Û¶~ß_a,PÔbF¼H¢òp€¤ÛiQ$'Yà Hû µéµYr%9›ôן©›éÝÄERäp8—o†Œ÷‹hñËÕ?WžÑ‚/´`z‘fãY¶Ø®>þ-¶Ðòë"b*Ó‹Ûï°P‰†g¹øpõß«W·WÏ_‹h‘±,ÉâvçG‘,“ñâv»ø¸”L²ÕZgjù®Y­ù²îêÕZòå¦.á©Õ²>vE]µ«¿n}þZÆR‰dÇÙì@ö¸Šድ’šq.k‘Â'’:åÕFÍäòÍ»Ï –LTUfCsئ?£8º;uÔj>¯Dº4½uéö¹kßä­y¶Z«H/_½yCÍ+¡—õ©ÜRŸ|³1Çn:¯\65ÌÁ—ÝRǺ*¿Âì’±üpÚàä{j¼[­aT³ÏqðÏEÝàza­kÎY;nÚ™sNªåÖìòS‰KI¤Ã³.·¦¡"-­iÝÒ±qGO\ ›ðöQŽx¿ŠeQ“gL7ù}“oÌîû‹xÙ˜¶Ë›Ž^ò¢£äéhÎc%©ßÂêt¸[ÅÀ“f6÷xÛ×(ƒ Ÿ®ûæÔÕ=È2ÈÀ¦ÆljË>ü3Íו–ËgÔÏítz@¶½-½îê† (Øâ¾½7ÕÆPq-Á… í!ÉòØXa†o6V²Ë6VÅÑòv_¸ÁI¸©{^––¸‡6´³V-¢tÙI6Åî+ÕäøÐ0ïÁÔVl¡Žˆ†B·7T ¥§ÃÒ©Ùzl 5Ø%ºAH˜ · ¨(ª­ù3âª*:SºŠMßÖãÇ¢ekÔá–ê6yUÕnXËGí¥ïÞ°ÐroHv_ÔZ ‘H·°ŠjÛ~¿l"w€)‡Ü $jŸq©ÆJ²DÇ^ ÿ¦“áK‰µkESu>’âL+ùÔH½ùºCED,ü›é)ë{Zßu@ÛDÂx,|WâŒ(c&eæû]Ó€Cê³$ë,‹ƒWò) ZÃ3!ù”.ñ4]=f$D*™ÖÉT¨HïT”ôz‡å‘ÞÙw^|N5Íö¤*_P§QœTD&›¶ygž£¬Ñë©5[*Ýá n²®¶x»w=Q­š¶só4÷§ƒ±ZÒÍiÁŽ¦ 9}±Áo÷ø _O }]ƒ„Ùš¶w,øæÕËÈ|"á,°¬ÿƨ?žºg!qã)KÂú9‘q&â™±´f)†Û»¥7K<‰¸Ô—Í ÝT9P™éG¨äY åø\û'|DŽ'|$ÚÜðÖÊcU f¾¡:7¿ë‹”&W‹3=6gssÍ’Ù^äKNS»qk™fŒG±6¡!PpË‘±Y¬³Ë6l¸Û*ý˜©R*²Äâ3§‡8,·á,ŸZ,†@IÆÒ¬·GðÉ5a¡DtvN ¶Tô2Ž.wÖfÁÏZcó$ÈœžvØ4I?ßù4‰°;ð„fØš./Ê–€cÀ¸j¦ã8`¤9ŸúÎûíþOˆ-0ûÀ'X F¯ÁÿO÷úÚñ5`s¾CRò@ï{H‹hóáŸ5Øhq ZjÀ¿Ú‚w©ûµí°£` siÖµT$è«—vž¼uníÀæè§%¥CáÞ罯 3*ÇI´Þ Ѱ¹kZ+d™,dK° D0Æ‹€bfœÅ"”®&ß[ÖAAU Ä?b¬¢8UN½ùð–ÞuqªBçt.U:8ÝÛò]2˵‰Hˆÿ€ßú÷ß×77Ծ߿8^´Vî¨ÆGEÂ=’!žDé”3.’Á® ¤%®Rf|îã¶Ô>ÒÒ© ‹‹Ò~õ×?¼&^ýp{0 KN…x¬(>c¼Ý­€¾(K&¶éωàÏ«=x‘÷P*mˆ}ì®`í Vy®áRêïSëêH°›Û˜ÞžYþòL³8–SþânÍvGù •ÉmiШÄoNG*[Å„§ˆ¨Û¾>5®›U%åà (AŸüÚ…×ãv+s~~RZ7Û OÃ÷=»<ˆl,Á¨|*îƒ(¹ôÏÜÅNÅVÖOaÃIs ’’eB¿Fɱ»žŠ(ŠŒþáu@œRÍÔ`R™u02ÓäÙœc{õÿÔGâÏPÀ}¢@¤‰Ûqì Ȧ¾U*UƴȦ.“¯ÌGË„#¿%‹Õ#oB“«Œd?x( ìÐ*«¯€vŠM^Ú£s©.«r‘\:D{Û­?³ÎŸRªû>¿€¥È¸œ›Ïyyé̸—(óåøèÕ Î„Š§ ø™ò¡å äÃY¶ûÂß5˜h;5â¦ÅL†3’oºq–¯Og ¦ÐÕÎÀ,Ìæob¨þ^ËÔ°ÀR³|¯1´€ùS6%™°Áýïšéݤ4¾|7 ¤CöÄ»×h ìy  ýƒ¨ùm ª@ÓåÕÆÞ+ ¬ÐÞ&¢6'sØ»ÂÕÜŸC-9=îNÕxx:˜ÖžR”ê$Y~¨fÜno*¡ýÙúÂ'á[O ÿ¨ÞUié>Õs8_[o*Ó›g.à¦;#ÖÙÑU(›¿`˜ÛÎÚ=÷®×èrÝ ©ú£6{¸ÓM]^~rÒÔÐjè²Ì0¦œèöjvyŠqZÜwS¦Áó,™éQøàH±6ä6²tœÇlÁÜmöæLÅ}Ä9¾ €»'SÒ<êµ6:KÇ* ^…5YφÇÉCèåƒb}1ª ¹Ç„iÝÓöÕ´A“ ê##É¢ PÅ îÔÏA;Ë@[QÕÕú_ÓÔÞ¥döäz"nÞ RåLh_S5ܲJ ¥jÄ3x¡p}ëz™—ÀÊGàe·{*»æ^<Ü—©êÀ fÉ¿_HN)óR5e¬Í¸  l- ;2¡¦6ËÃQ €Ö¢u10¼(\1˜†—þä.Ëןá{'q8v#§5Mtì(þ¤pGLèʟܘN…£½¿öâ´>ÀDž>*ÆìwÏg4 ×mQú {€ Lî C~ßãõëºWù˾b˜”IÎûHo¨Ç$Qò¯ö¬h^ݛَðç>ŇWOn®Ý S!‡ÉW£ËK8DYT®º ö™f—o‚øí!9*ž-+c¶¤ØÜ]Ÿ€Ê®>y‡o_­ˆ@Á 0‚M¾0º/rã9o»!GV˜]Ø„jòØ8§½¶‰÷ ÀŸ’Žv†’«ÙXRä”Á¯ÃøÀ™Û©Ðø'¬ÿ3!Ç» endstream endobj 283 0 obj << /Type /ObjStm /N 100 /First 872 /Length 1377 /Filter /FlateDecode >> stream xÚ­XQo7 ~÷¯Ðc;`:Q¤Di0 ¤-²Ø€"ImA²Ôí‚vá¸h÷ï÷Q©/uâ¦jvNtwŸ>~¤(Šw±D\Ôè$ºX’#Nø¯.²ýð¤à²8Ž@•ê8Vƒ“€g•œà³‹Îbe—bŵ¸¤„ÿÉe2\v9§.W°â§l°â´€¶VW¢YW²8䪆Ã(crDà2"ðp ÀÂw"¨8d a ðº9 [u$2 DgLàóOÈ™"ŠI0B™ 9Á.Hƒi€ð,hÉÀBiÓÁS”g#ª6=ÂB͸lº…2Øô(˜ñˆ€B¸ØBF£…Qa°ÇÄÌàIX fðdóÁ“3lÙz)ÜfÎ$ز•S¬³­n³E»XxÄ Q,¶<š±ìPf± %è‘4ÃX @ÆbÞ*ôˆ‰‹Æc‘q[L¥M·™íO"³—flRĦ'¶™&0§hÀœlzÂ/·éÀe&\dŸ0Aá[-O8ƒ‰2³ä–)ªM·‹jÖ-"Õă9jôŠ….' S10 "£…Ñ—(+Œ¥/+¦K0Ëì$Ù2©8ɦ\RL\BÚãÄIE:0B,mݱ«R°¤+ØI7ŸÏ†çî4‚.¸#7üþÇŸHz_\ªÑ[*-?¼{w6{ò¤!WË›ÏÝpØR*\Ï9DÂaM®Ç-éêç Ë®xÍ †áåzuq¼Ø¸S7¼|~膓ŧÉOþ}¿Àƒó·‹Ùð †ËÍÒ#ÛôÙp´¸Z}X_,®Ú~l·~[¼¾<ºúäNMHªÉGx]„|©g°v¾¤55[+ælI7ÎJ‚³%dÌÙõõ6°EE5ùŠw Y}Fîv ûÜC™Rò)õPJOˆÜ¤È ¾ N‰Díó)×I‘¨îˆRG1+@ÐvÈ‘7»fgsììšV}·¨ä¨hSm!ñö²Úþ[%õÖ²³ðÆsúúÚÞ·…ö ¿²…ö ‰¼"lßFæT}¡4)G´ï’Ùõ5öD·æeZ${;§;d‰§B¢«òŠ– ééS¡Zô^µN…Ü ˆ8bèñ‹%©K@r+€$úzR…"Š-ËTÈQ€ÕÛ.Ú‚„ùÀžÒø•j¸S4Z9Ü)±<¤4Ëå Œ§­K6I·,·ç³áøÃ_›výëåòŸÙðtµ~½X7 áløex1<;¥vaš.à stXdùKÖ[zEJY¼Fî ðØ ?¯NV±t…™—«åýûc‹ÍËk_ï³Üf…fÔn÷ƒ¯+²%pž 9 ˆI”;hsÍ>~˯~äV@ÖâyOo³‡6‰ç:p4ÏâeO³¸‡5„U¦Bn¤|Ž=ná= gòdÈQ€äý‡Ó]ZŽš¦BŽH|%î¡ äC¤©[xÉó{H®ž„¦BŽyJ=¸T/2pì”<$ô°xUÒTȱ;¨è6{Xcbìl™ 9ÚgTážHµ`¡t*äØ”à)÷ìlkcì‹ÇDÈQÎDûÜñ½ß&v»‡/ûŠ Z Õ;­„¦ÿÙJ|þ*cßx&l)‹Jt‚>_Ðå&ìg­¶¯ÅÇtGQøˆbGÇ>ÃX G7½Œúö}̱Ï^Š.×¾§¡ |6úÒ\æófa8hƇãáÕÑ û=ú{³yÿÓ0|üøѯß\üˆðnVk¿Z¿.—oVîe)áñn磹ó•uØZ&ì{½|rlfp˜ë¾w¢;´+V£>ù¨º4ó endstream endobj 414 0 obj << /Length 3839 /Filter /FlateDecode >> stream xÚí[[ܶ~÷¯ô%ZÀËH¢nÌ[Ý6´M“-‚Âñƒv¤™‘W#M$׋üùžuîzE ôe‡âåð<—ïrýÍ~ão¾{ñë‹~ýM°ÉB•mRã«À˜ÍöøâÍ[S@Ë÷_E&ÛÜS¿ã&J2ø­7?½øÇ‹W7/¾þ6ô7F™$L67;KE+£ãÍM±yãi¥ÕÕuf"ï‡îê:ðÚ¡½ºÖ·mkøÍ"¯= UÛôWoo¾ÿúÛlF+Š3åëf#B]^ø¹ýôlеu¦P©ylQÞž÷W×q{y]óTA4Ÿ+U~ªíTï¸Ç‚p¨Òdä¥ÝíD‚X%&‰ìT‚P™ÔØ.ýeï ¤¥³ðcìd¶Cמ?‡Î¸¬]Ueç$”¨$x>CUtvùÖÉT*íëgÓ*ß—ÍðwÊ·w%")xóR¦sÆRëÈöWJ9H$±íòö£B°_ÈìR¾¯µm1zsÊÄ¢/?•èEä{§ŽT%ÌDU ŠÄx_5{þÍõŠ’Ä{½ãÚ¼¿»‚Aeñ¿C¯Ì·Waê–TSoKÚ(”«ž·ù)¿­K¡Oﾫ†qÒ¡ƒcåâ±ìû|_öÜ+¿%² Šü]ñ¡ÁÂë»GæÚî;§ó’xáäBÝî¹ð‹û÷Õpà~[P”}Û=¸TJkåÒÂì]Ø’0QA<Ê Ðp×@þu•ià™çÜæ OWÂÄeÇ•]ùë¹ìþ8uUƒ àýÀ®­SÍÁEz”ñÑæÌY  K-ù¦9p[ñlxk±¦VÚ¦~ÍŠ" ólq"´h3cØUdõáDBD´ ®/ër;”Å7¶ÁzÇ&tY§9ã­û¸¶1'ky¥¹·ÈÊ!oö–<_Ç}Ë; Åóé%.6ôŠ+T”áû†j$ÜáH‡~hO§q\9lžðKÇ aŸ`)“sû¹Xi¤Âéˆx¥Yj»S¹üÀÚ…++¸J¤J|2‚ùÃZÔ0s U’§5^°eT”^²U”C^ÕÂW‹’œe^‡{w¦S€¯_ü B¢´u.ï©h2Ík+¾4^R³ÜÇTQ-º5 —ïÉJqG‘ó^>Å&mˆ'Û°ÿ¡Ÿ(Ä.ϱ:Ö Ì–û÷GãBš¼~W\f$©ulp’8ÉÖ.érw#XI”ŽíÕZã8:¶óÈ*VN›§u,\Ý•Û²â•ÜtKV[iDr¾ ´Qìý¹Üåçzø¿§ðhµògKåñ1~Lgʆ™>vCq>žž_äwŸþ;À׈+&/ø(°HpÀ3€Eò…€EÅ*Ó±XD~¼X¬úëèoø °Î:Î÷-’Ä¿lF¸€¿9ÿÀV6EÞüu[59xj*ƒÈsš7añÅJðñ bˆTÃ}*´X4¤k.à0Ùе¸¢®Z‘ÇÆ"/‚‹‚À»A—Qr£¬Œ‡l[Ö™Ž4ZïÈ-6ÝU– ¬YpŠ •PÁõ”Ò™¸§Z6P8‘ žm¹cqÁAÚ¬N[ÈtK#a£CÅ&•›X>#LÁ¯[vùÜ»°­Yê"VÊûº½Ík— Ç€ûõ¨ V—/C5_Åñ(àŒK_òö÷e¹XÌò} Ú¸¢@•¬ Mª‚,YîÑëáО÷è[^9:R(NG p7虜¯ŽUwÒ»½è<Ý2XËñ9r¼Ä“™sÁ!( 8ÿÀ#‘«dòc™7,¹‹eòOC—Ýäòy’9hÁô¶¾^žàÖn’6#Xa¿o Ï¢ŸŒ÷ê» úKr.Ï™ÒÉ¢"¿h¾5 ö=“çy`B|X·|؆ksCŽÉª¶Ô‘ P~˜\N½roóE[bäÍ|ïïéyç²L¥ÙÊ>®M zÅ¢±3~6­x×þ|:q´ÓI êk4ê+T<°sþ‡™ÍÀhÇÞ¤*\aê"~~ýÃûfŒ3//Šî*Ùëû§œC˜*mÒ¥ÔÜ(ŒSe.S8„…ÉœÀǹ§Ž9x£1¸T>ƒ®« é'F…ÊvMX®d4£Àë¹ôÇcLÑçBdáã ™ #ý£S9llU|úaTÇñ瀗T3‚—¦mJ•e|ú•U¢Æ!”§¹iò£s2ˆüðÙ,/&{<)´s°ø* fa7G,®[”Õöx»àBai¬‚4œàÁ;§ÁV` mÇ{PòÒµ1 P·ä¤üp²Šƒ²ÿTÆ&ô•†Ðk¡-ð±¢Fô>CK‹{u/µ‡òÈ¥s«tØt0‰áhî`ô= ¥å¥|fK¥Ñi:7¿´ý­,Ob29a¬A1” ¥¥4IH`f÷8VRuÆš4D—±Š³tsT§ 8-@´HÂÅ¿7 7×á,¯ß8´7Õ*œ|js>Þ4râ?@^qül‰y;šö­Ìž‹5Åû¼kSÐa%Ïžâ¶n·w¿+¥· Ó•tÁàº'Tégãô¢êQ;ß>™€î—ɺ¦ÄŒ]Maþ`nö°B„‹r´œèˆý\Òù‡ŠÓCGÎ24òŒvcBd"Ù_ÌWJrBr\œ„Yæ+Hr1‘c™–!¬AdÑ]Ù/Î¥ÏJ–9ú3_+J‡!¿“$=}Þli$a÷ e˃¿‡j Û¾Äûý JÔg‹ÙÞ{5^ñÉhRl#7~Æ^Q›`Ú¯jÙì·XcÉ Û¼+päMy…ÙÕÒ ëcY¶œ°~É]/ŒEp©o> )äf©ç.ýÍYé‹Û ¹€ã¯ºâcp­,?¡/é*ÎQ’•ƒ<2hÄ[n°-ldAPälîäc„[¹¾ØX·é‘ʘŸ8[WÛj¨$_³J +ÖêGlõÞ™¤Iâö¤ÐÌ]Òc‚è,qÚÚz—/˜× ¢ý¹#M£ë6—(È^èˆÁYß»\Zõ,ñh¯B~w0û*‹ƒUŠrjåóÜE¦¢É|w‘~¶»HÿCî"ýRî"û4wá®W)ˆ”Q²N×Ü îÛäh±VÜÖ.ܶî"µ¶¸ãžô>Ä’ì/æ+¸Uâ¤Ô^6BÕZSRÉ|3cy¼vë«Ê¾ßо÷šl—žo¡rõ±%ƒåª{µ%D•’]\ÏF*NסæL .t-]K/ï´ï[kÚWPsþ6ª 78Ò­Ö€Rûi ÄhAàâ‘¢3~’Ø\Åà#bÌ­Çf¹L¡‹a WáŒã1Ö¢Cõ$¡µ“a‡{nPj8¨iÓÃÔ:ÔBº³T„“8†V îvéT­X¹g¤À ¢¶kICñ²–H£¤ã‰a Š¹Œ ªÀ›çgû;w6X‘6~ •M—j°‹ü–J~‘!i‡PTN¡[Æ¡›ð!jµ´I’NÇû*Ž'½_çvâ—.}á4~(LÇátۉ׳Xcþ}<¦^vf‹YNòÏ”;¶’L}š©ä˜ãdéÅg†ÌÆ7 Òy¼sœsew.–»;,`Ö­¶£F°A_3É{ä’Xn|0tB®0o÷˜;Å`' ¾˜7 6ËÒl{IjíÿÎôÓ™âcª\SÁQÎb¯,›I?~‰*Bžû#h’t'9‚ŒMƒ} æ¸uSå‡úݾ¼ÆÛ÷YjŸ‰Ù‚™Ÿ=c›Gyrªä"YÙ¢j ,¬£s¶[ÇÔ”mªìª£8æ¼Æ,?í„pn =ÚEò’4߆§p®G"Öö ])µàhêL;H…À‡CN·•=Fêß H)?æÄ>Q"!^mܘc«Ë*&ä죀Ñ~ç]EÖ‰`Çm9&ßìô£W‰éUa;¦÷:\ö~O©l³¶û˜Dë?.«I! ºã_¬(53€gÄ[Л8®¨öMÛÙÖ]š•ëffRcÞº]mP‡åºo]=/g:3ÃøL4ŸW)Q¹*J|&šCøc‡\sÅ‚gê±ã_ÞâD_¾vLJ:¤¨a>øŠS3:A%Ç#O#&t}@Ô(µâœäæD®`ÙþÕ,³Ø«§HÖ_‰Ôp²äÓ_*ðuÓÇ.¾í‹€ÇN$Q`†—ò§¶i¾j=æÄ£åû ‘ìVTƾ–i®éƾh¸¤ÿxó|ñ_=¹yño#â‰X endstream endobj 449 0 obj << /Length 3249 /Filter /FlateDecode >> stream xÚíËrÜ6ò®¯˜Ò‰“a|;§Ø²SN¥v½‘ªv«¨Ž† g8&9–ô÷Ûnð ɱ{ÚÐhô Ý ÊÕýJ®~¾ø|¡à+Wj•j‘®’L •e«Íáâ÷Orµ…‘_VR„Yºz0ó«0Ná[­n.þuñæöâÕ{-W™Èb¯nwK ² ZÝnW¿{ÄÚO³Ðûج}åÕ]½öåmê ¾ièÕ§®¬íúÓí/¯Þ§#\a” $°›A¤N¹LùÊ·ã¾N`M@³n÷ESâ ðrj„^[|YëÔ+š¼¢»¥íöyGàû’æQ¯-ÜãZy-6Z«'j=”ÝžZ3³éòr ÖScªocN]µ¯'äß‚ÑY%œ"qÓ)ÊcW4»G:ò~÷?qƒ>—Ä,•Œ9ŸŠLE–Y‡¼ý‹&M¶Ñš©tIØzÜK¤AªíüS³Ž€H>:RH•ÙÉë•­Ž…Šz´B¶L¨8!S2’=ᙲ3wŽí”ZõÛ‘ð]Ìu’ý–?>ω8SßDþ’ì)’{Š)ÙŸfê3¶_g©Hu´ò•YÄ–wsýuÞ”(±Õ= ½œ>mÑQ£ÞÑ·<®AYYíxn}¤ïþܠeì©Ûí jX%OÙšÝƨ}‡ñeE^Þ[FFv-koG~;¡~Ñá‚C “Äû Y‚¦3>5L):˜’˃lŠÜP+îš'^},Ë Ädæ™óÂw[´›¦¼3oñÛòxOÍüø,¶SÞAÿˆg ô_ŒøˆÔØ™Žƒò:˜Kàÿ±-Û‰‰2::@sê’'û|^/F>mc}Úhú¦ÊÏmÁ8þ{#ÇwÊXÄÞ–F{V™½àn`¾ºB@ìy¯-=Vj—Œ<§®ñR¦eœ3d¡XbyüµGrÉ|_T•_•õî;³çØ›ìøs{QòŽ6‚ƒ‘þt0Ê^6Ô<æ‡BôûG"µ—ÎO( lüÿDÀÒ¢O}K²ŽDÐrÇHºñ²Ô. Q‡˜,Éf‹«:eá5‚ó22Þ*¤ ñxFùïË#dLÒáÐ3%Ò´¿Süå XÀÃW¤Î=Ù¨ûÈ+?È¡ÔÌ9•3h”- Åã¦:o‹-FKï#N%VÍg‚¢K¶0ºÚ¢5¨KUì:¿«ý¦¼ß\á4äâ:·N÷/¼þ8³+ø²èöòòŠ:>ö~°½Ë.\²Æ·øèØ|±ŠœâŽÀC„¬ˆÇ-G,(ÇúèÃ8¸èÚ©Êivîõ¥™Íœ0âÎ"c¼¨­&V9ÿ¼ùøþ‹¦6í“®Q]2¹Í—ÆÛó‰¼cÝt)»â¸5Æ‘…#/88xð!·Ú `pGF¼yyäM Ž\ e63äØF]\±cBˬÂÖæÞˆX÷#£ÜP‘H&dQ8óšŠfvá{÷…ƒaÀÔ’“QAyH­<ùšhdýLCÆ[,óKÆ°Øá½H *âmpk»mŠ¶%èÔ}(kÓ0b¹E½~k˜bŒÁºÔÑöÆ;dÞ; ý±ëï- D rÐ8·vüaoîê) Ó@{<4é:ñÁaÕ•§Š½uŽ+øÐÀÖÖÛlTÏ¥ C%(&óZ4ZŸÞóž:M˜Òt¸Õax“sƒ]%u˜0÷P7 ëʃ¡šØÀ0¹Pb0Ü»¸§ƒG°S8Ø1öbâÚ,vÙä-±Cq°y_¹¹Gb„nÛ´Mœ¸pæòli8° ‡Y^È 'Ûo÷'!—×Rø”rø” ç«QÉ Á[–<éMÎb¨Ð/À…ðæýõ ]—àÀ:£—cøo?m¿0f².}øH©ÃäµwçŽ):Ò,DFQ**îàsÙÙZ=!¾õ|^Þ8‰Câæ–/o ö9@{¾ká¸À=ⲟE"DjÂëëb—ƒm½¦ÀnwÌòî1?€ùQZºÌFÇSçWá—Ž|& „ÖÑ, {!ŸéžNŒï®©ó-(s÷£m Yñ‚¸Ò¤Pd©²¶ 3‘$ñÃø!¸¨¶Ëñr UL&.=‚PKñkîel á;FÄë«pè™J¥‰È²íˆ‚8ægS%#{ß.-ˆ#Tª@'w"—(U¢E,Õ÷ÈòÔ\RŒ´€8ókRÔ/H1a0ŠDÁ0c+ÅÀJ‹û(¦[$TáEÃÉ(ŒÍÂPcT:LESö?#^ œÊ'\-¡â`Z‡p Ô‘BHô’X}•iÀ– %ä+²H-PPÅ6jˆPMs‹™ ]b&4æÌŒ51†(T•5 {ÇÍ,ƒÐåŒxŸãܾȆh¶>3 ›0ÝFAàAwM} ï:=ã “û6‘3_bHÇb 1ëÛèÿÜþ_r›²«) —ƒÇ*‘`­ÉÄ5ÈÁ5HëäÒ5Hâ/&#lÒ5TkÐ;Ø(ŽH4$̦.B·b£xÃqKæ„ã–Í‹eÏ•ŠÁ?‰L"&¼Ù{žGbDðmëpÀ!dòaïzþty2‘ •ám»9=W·íï…ãùðRM¼]ÍTŒã@Ôl>B»]*Êv¡¹~X¯ÏpÁJ{·k|?¸yu}óê­9¸$Õ–:%ïa‚?øî‹|[4–ˆáës9Ä}îîëÓ¢{œPò Ë<å&)£ŠÓ8G_žÙ!9ÆR–É 6õpk}¡Ÿò±a`®®¢ÂšÝ”Ñ5v±AZzWÌKuÐî‘£ŠØ„Ûuó›¢Ê»á ç×3¢j´7 ºÏo íŒÃÄû·û•P²W½‘§ÓÇöž”8ðÄ{o1ERL%æJ 11hÌ™»˜K_G9L6ÕÒ—BõPJ“CPåa_WÜ´ŠÆZ† ft‡¾Ânbü¢Á1p†w˜ÛSÈ®„ŽfÁ¸‰¢ùÒ§>IjüiMnú‰÷îí?¨AÒ†Fy„$ÔfõQ?Ç^ÑDdKÓžåƒõÜM°‰9úýÔªO’ŒŒÔƒã€‹HH]K_N… õçÙ¤—x¶šÕ£»¾¡ï`¹‰ÉþÈs‚kŒÕ,î×A ¦ÒÙô‡FÇtaŸ§ÊÇ´yo$¯oÞ~¤qù0ܧÏÛ›˜ü½þøÔ”uSvOg£Ç ÿ¦3 0"LœîEœ©v:Sm)4*f˜y ÕzäRÏ\{#¢Éo˜J pVŽö;˜»î‰:#w½}Mª?ÝuîË3bÒnZ0vd®¤Ï›Øð ““Aÿö?øÕÞçsq6uñŸ†{ž%üˆß_éÂ??ÒÊvRAÛ)Ö·:š5±‹K{ uQÁöåý¾ íW æÓÂà¤üRVŽû°Ö‘~Ÿ2žÀi=€›|þñØäg½.žð™—Ö`kë|AÏ’¯³RdZõuV=»·¹&ÿLË™Ð!Ï>£ª¿õŒŠÉz0ÏüϨAd Úð1¬å[!ñ((„ÕaÞPG ú‚ªÛ‡¦Èº´eIwk ïÚîÁPE[lc¸ÐfÇmm6²O'sX¡¤òƒJ‡Í:ã7ÿ3˜èqýSg 4x Ý/áéÁ„_ôV¥Ì[Õ ³”Û çUu´¼Ð;.í|êNxé/KÅ®Gˆ-ànÙŸ¦“·o¤È¼ k¾áÐ<ÒÐÀbâl¯WRümà”cù„Á¿ÃÞyž‘$j eOCWOÓ"0Ib ö=ª™¬ðEh8+ÍÙèR̸2 0*3§£2sÆEZäª2´¸ö‹ Ž<‰ªÇsBŽµòÞüÌ£{c©¨U[»ü&¤PÉÇöžÙU+J¢Ù?+æ% áìuÝ~9´„kG„Ù,Jh+óJÏ"Fh[zšh¦oæ™…%>üÌÀ\2¿C‘ä«!$ˆFwák åæþ&2ÿ511#w”XwLžXzBLì¢!`3L³?_FÒC(Çr\ ;Ùðc’ù{ÕäÏ1j,|7¾ Þù|Õ|ÓßZÛ¯þ$ôrxw˜Š§bûp$IJQ[ÅЙ¡5Ê}p¯lŽczØÑzŸà¿/àËL’Æ_ñú7~ãJz…–ù=RöÚ¼5Ðv—ó-ÆU؇D'‘*“$.Èä”écŽØï»Û‹ÿ˜jQv endstream endobj 483 0 obj << /Length 1150 /Filter /FlateDecode >> stream xÚÍWKsÛ6¾ëWpr¢fB/¾rK›ºN:žº•nI4 ‰løPIÊ®þ}wP"mZ£fœL}0(ìâÛÅ:[‡:¿.þ^0©Ãœˆ“È cJX;iµøô…:H>:”È8r´^åÈ ‚±tV‹??­o®8ub¹‚²ô¢Xº·íÒcnÓ7KO07mJ#é6»¾hênùeýñÍU4Â’~D¨ÁšbUÔzîxRÂs<Âa´Š^UˆOݢƑ¹}®Ž¨d™WUÞþ4‰=•&Œ§T¾¾~{sóvµš)lœƒó¤Êø)sÏQ"€ZË—£DÀ¡²é>u*„n™txæ…´ŒÀ9Ì:Ž¦l 90bVö¨.H3ˆÆÉŒ¸øPY'iªvý%Gê‡ÆÏ©À{S&¡ŒÁ½õß Ô8–ç˜è‡Äâ’HÊ‹"és"Ãÿ _"ç‰(9"ò€Okû*oÚ>Oê鎗ª·÷­ÀkïÚ¦ÏçìsJ8 fî®'¥0„}V íÙm‰uÞ'˜šjò²òÊáq' f“Tœã1l1æìåÁ|ùÑ”Çß7°»'! àv;=ΤϥaQ†„†Þq<„ÃÌù£ÂRn›¶ès{(>SŸš¯¯ê€ï1ü¬2ߦHŽ…˜ÒàøÒþkf/XÖ÷ý°Ë6ƒ8eÔs€G‹y5â,'‚~#÷ƒD¸XÂ@^¼å "´-/ŒèCw3dc¿|â3æÉcH¯êLæÐo oîȼ¹¡Æ¥OPMœïs»pZËQô€@Z–¶‡]ßlÛd‡Á›µ#ñU¨åªNîJ•‘¹îÅzNOb¸|t“ýQ¼Ó}‚ª³Îè+Ôz “fB·NôÔޡŸnÍ]'pæ÷ÕíÕ=7“…µm¼¦îoê /¬Ì»yï›)> stream xÚ­WËn7¼ÏWð ¸ì'I@ð!6t `(>$|œEÀ Iœ¿OõH;’ EH<Ìg¶úÝÓEJÓT’4Kj¸yj·šˆ;î-Q%Ü{b’$½$6À:ÞHuN¢Xwü×x‘®IòÚòÝ“Qü_“YÈ·d¸¤÷äZ’JòÆI¡ª2D ¥êŽ;§VÚ¢ER3ÀŠ¦Ög©Kà<õÚq‡›… øY\°è‰OJ … Õ°€ß ÿI˜%¼Ñ0GŽ…ÃU‚£À@,ôØ ô¸ÀÌ7ØbFN¶pQuØ‚.jTehn!ÎÐÜt$ƒú*Í}G* þWA.Kˆ !¹a] ¤WE°qË,}Q1,P)O,«xÅbo‰#8…ÖGfYC¥aSøƒ‹-Ä‘qöWhöJ‹¢ê\C\¡¹†8\Q!Uhî%£D¹¡Ð¢îx­RJd5ªŠ´"ϸ¨Â„i&_ÂxŠÍ“j©†Ö …èh25T(R¢ŠVSˆ…?…þ ®bŽC³G6P3Ykf‘µÍ5J‰ŒH W£ýÖZÔèî(e]±‡«k-jtLˆ×µ©lÑñG-*p´Š×è†J¯âQÎxjkÍð£Q*x§ÑÌaP#×;ß•“,''ËîC:‡“øÚÎÒî÷?þDËÖ\ÑË^;îœ.¿ýúyy÷î(¸qnÉ…rƒç/#‘¹ì0>€dÏ•y©­fF1'!á#a™uHm„ß'7ód™†¢“_Ð’$wåYȃ«Ü=»•«ædS‘Þr±‘æcm ¾¬½OERE™Ú4ä!ù„껩|ϵÎBn0ÆÕÐ& ¥×O¯.oÓÉIÚ÷aƯ"§p“ûn‘ Zºòļ­€~ï(øõðЃ×Ú}¼¾úòÛþ6§Ýǧi÷iÿã6m>|ú÷Û\ü½_vïáÏþòöjìTΖÝÙþæêûõ—ýÍÊUë«_÷ýsñËÕtþZ·Ì¶iŒÏ°vq AG+ü!%Aœ[JÔ"%ÅŽ'ÀCEÀ8¹Wþ9ønpwÎ`ÎYÈæ°Œ=͈ÚB: yp›ŠìUÔš—\g!7¢Ä:—QÍ]dr£Þs!P‹íF&¯³›晚¨EkÇFtòàvWYuÄaH •`¹9@hi-ì¥s&!7^æ’©Œ8@Ö²¼4^Æ‘5à+ˆCЀZô¶öiȃ½e«ýDò„;Xåµt¡ý]Üi|]h{”%ú ]<F:+Fu›‹tÍer£5匭æ€Ú +“6‚4=zÆ9‚ÿ©HØÄ9y©5ËŸ†“Cœعû‡ÀÜl$"œSßs$wìF‡t–`È‘,I&¡YÈm<›ÏÏÔr׬Íf!·ñ\q)Cj¥ æjùÀ”ÍGÔRE±h¤$ÈÕ¹HÂqÄur*9üÏ)ãµäÐä94z#94> stream xÚÝZKÛȾï¯öb µù~ì%ˆ7qâE6kس@‚](±%ѦH…MÚ+äϧª«ºùjfÖ3A€œÔì.VwU}õè¢ÜÕaå®þòË¿¯n¿yùÚËV¾+âØV·ûUê‹t•ÄžˆÒxu[¬~q¾?æçN¶ëMDNøÝz¹®óNžšNÒÜ®©×çtmS­?ÜþðòuºÊDû1òsW› ®ÏÌþ¹N§éáÅ8pvyMƒ^!«8tº£ä¥ætÊëbS•5/íªRÖk?u:ÚÄF»xqcvÓ»l˶ØÝ=‹Ÿ‰$ñ Q×ÐV]^}¢-¾”Ý‘æršhûº^{NYèùÕ›wDñ=pí'N_—»¼+–¤Tô[4æܽâבëÝ“o¼,IÀÀY ˆ]· Ï0®keøùïoþ¼½6<åeMc’¢v¨­OxHÙѯnäöu%•¢gMqÌëƒ,h‚5à¥ÚwO뻑ð=»ýFÝ= ˆØ4gV ð>”Ÿq;Yó Ø††[8nâ4ã­IÙÒ+-= hÀé š'ð4«" ©Foõ+Yb¥øICg­2Ùî›öD3ª<+~)ß¡úÔQ=é—˜“¬ó- õð²(h¾ÙómÓ±]šJݬ7¡Ø“Õ@‰è¢‘†&áØàN_´\îT Ïë(vò¶lz<@Jñì‹7ˆ7wÄ= ²#2Í~-oýÔ6}gI;8¿¤ù_]/¬Àû5@ày‹ï\ˆÌ¬ñnMK$¹úÄœ"#òäm[ áß<ô­LRçm‹ˆ¼‹¶™Ä¸ ¶ ‚C-Gù‚@bŽ]y’<ÂýƒÌ9H¦kjŽ-0>Êê g £Ôù‰»bO„™ÝnÓ.B?õ3CAÐ Þ-z€PWŒO”px5§ÐG×–»Îž8SiHÁ/k7@WßxNU‚KI‘KÜÄ_Ž%ãU{ÆÏO¦ªÍ«ŠÐXòW{ÕѨ•y±]]ð1y.b(L¼,{X}q¢’åS6»ÚÓ””FJmTÒUB²‹§º‚\shó@ðò ­ L=K ZÀ!ib¨ …gse […Y¦Ï‚õ^^aQ3Uy8R¦³ªÆÎhHL&&8c>#ZCUã/iG¹°È’sâD%¹¤T?  dŠ&J](•O© ,‹¼eˆ†zÖ :>j·AyU>SUÒò G>£„šõï§``oNeQr6õc®Z€Õ±T]Ó^&³1”_Š–Oe]žòŠf ÉI]ÈzW²³û` (ù5pÛ}Ïoíu†®|[Wà;5/Kž·“´ Ò T¤ìyÚ%À|.Û¦6àQ:µ@ÁL@A€½ƒml¬P™ð"o®“²)öùC#>ÿ¢z€íåÓÔÄ©KikÚ’J.ÞWC‹IâÅÒN¡ÝäÑ¡¡ l»Ëy©ÿû"‰­‡×ýi©à…b%ÊæuH¥ì“y>˜K1á:O’9;%«ý‚ÄÓ¦þƒë€Ü. ‚]ì=|¬x~¬%oDœy¿³v»ÇÙC0|ày÷•X»©_ªq‰dÚ:ãÒöoïÿ8ŠpŽøK¿nÚÞØ'wtÌ—¥À[æ­ó!Ú’3ßW:Y[ž¯4þß æ'Ý_Þ½y;ïq`ƒ\Gïg2È£.0¡ˆÝøyíñûî“Þcí7‹¾êó•jôýðF™ÿK”979=Å*È Ü]·DŒñ/|¾hüþ‹è5Òè.ãP<¥n¶û‚•$•¢ÀvMMY&‚$~>5e©ˆCÿ>=•ØGš¨ƒ/h‰QGè¼zÍm[#À“r9m‡Ž }ó»›P§ŠXJ¨XØ„º/«!¡†W?Š]ãc#¶i¬_KñÁ£9™ÖçÓ9uòt®°Š}2§¶É—ªµI¡ðq)ìUöÈgD›n—‰$ËM? D˜D_ß=×½°Ëië*óa Ü_b5PËb|3 ÌÇ(]ªŒ¿˜"rÑçf…ˤ½l¾ÿ B¶¦…Œ-ûn'ì‡f+<¤ðZ\ÑÇv){…Lˆþ|ûͪZW< endstream endobj 564 0 obj << /Length 3760 /Filter /FlateDecode >> stream xÚíZK“㶾ϯPùªj‡&ˆY9ÙqœZbÇ;©Tj½ŽD¸+‘2Iyvþ}ºÑx43Ç·\$ÏF£ûë­VÙêo7¿Þ0øÏVlUäi±Òe–²²\mŽ7ï?d«-´ü°ÊRQ«GÓ︪€ÿÃêÝÍ?n¾½»ùúûbU¦¥ÊÕên·’"K ®až–\®î¶«÷ ëw?ÜdvI÷ÿõ÷9Ÿ ½²H3{›k¨ä4vØwë[™Ë¤ïÎcMÅ÷ïw]ÿ'ýú{¦'s”"eBÁìfì©_K–Ô¿dL|¶Å¤s.R]”®óÇÈtyª•vÞþD=fD3–ªœ¹.,ycu¨#ó fš»Þcd>‘æR.§Û5‡±î#óÉ<噟oÙ£LYØÁÇÈ‚³->îë>F7g)/r×k™FNùîèþ%“YýùÔõcŒ2¤]¼š´S__jÎÖkS®CÛÑL@{‘©§èfõôÌ¡/+S,¸‰(¥ü÷§¾»Mw¸¶Œxi™%K#1™ªÒwìNcÓµCd:ž§ŒóÙUœ*ñ-ËdZˆr¾™wûn h£Èu²éZükú¨¶Ûá¿J*úD•mÚª#¥0õ(÷8·õ®:FêGsèdÜ×Tq¬šÖNßÚª®_ô™L^cµÁÉ÷õÖöêæTÕÃi} êÍØü†=Ì#h¿ÊI\‡¡eåÍú–skV#•šÿ!Óà›ë¦§â±ûfc;Uí–jqó¸!,oª¡¦fÜIDn”{%¨V’¦§‚—1þÃc3Òîi^¢‘'v§­‘zS…³¹µÉÀ¼¾¹Çí¤$×¹ÊÈQdZ Zãßë‚'ÝFd¶€{Édâ™Ú잨©ŠH«.Ò"€î%BOwv È½Ä6;Zç ÷áV\㉓ R žv;õM¨¶Öc .;¬¬è;PŽ„l¨­­Gw\­ÿ”‚ìp™¼½$B&ç5K`j–DP±T|p툡&H™qŽ…yç=Bj™€$ºŽ}MÕÁJâíŒM;Œu…{B$ïœÑÞ4PÜ A j»ñbiG¢ñ‚]Êç"óÈ¢(8AcŠàÔÕ€á’ù0ñjú4J¡¬G‡ÐTgHéÀ0U$n²i]sô"bÈ„ª]ß©£Ý©*<¥ÚETM „ž´mµð7°¢v°‰W¯ÈMá!ÿR±±(¨D*¹ºbÀ¹3à&–0Ü»Tûñ<Œ7ÁEBÛ­ó¼!¦áÒç|©î1/”œM⊫q÷\ÉO€F÷–œ21>c„ X‘|ûöçï°T’ÄÆi8÷fŸ¬ aeÎÝ­OôåôÇõòLb$‹C·7"gØ»{Gsž&=ðÉL%r êm$\Ìtªu1ϸðÐ8D6°#:_ gðÁ¿Ùξ>ZÆ€x1¶ÈX]·än$/CÜ€¦$Û2•¥œ;W± ÌqñK#fŽA«eñ C´†|«qˆøiEªƒiFÛèœüz†eÀ¯Ì3ÍØJlF^`ƒušMX¦¨f3PÑ"\ÁD®e§]ŒÖG°TÚ™­E*J=Ÿ½¨vð…ß5†½€”=Ú²ö\(y+à Q0ÂĨkÇA(½¶éÎm¢ò2Au­”½™*"Ø«)kñÛ®\LWø˜€lºHŠÍÝoV)3.!Tæò2?]]OÒ-²}Ï'¦y–f¬|.Ÿ‰ÁBq-+Èþ˜¿8‡KlMsï.»Y /úóíùWÝB–Xþ™T)øâ©ÈØÕTi–ÇR¥%B𿢿Ÿ±íGüù†*\F3ËçéÒÌ%;ÐYšOes ä˜õƒkmŠZÝT¢ VÜX™Mb‘ cÓxDaäP¤HÙ$Kþ|03ĶÆíÏòi‚nÉ2-x!`ÆY—jŒ)±É&Êå‰X.ODsyº$|‚!Ÿ ë|ÒešØÿï ¸*ÿˆanô]rN¸äœ´™Z(,¶VÕìÁðok©&éÐÀá5PG½ͶrA1È1R$Ü6¶»t>v™#õ$=†­&Сþ#:ž4ibø”icŒÜÒ½Em?íM‚âÙqP´ùpe}}Å'ìb.n™¡–Ì°$æ~úíÖøÆ&'¹H‹lxU‡ŽOGÎnúåäÞAÒµ2´vî5Š´—HÐÔ¶®Ý®Å{¨¢êìzØt)} #她~:UÕH,X¹GˆÀNFæÄäôpÉÍšûYãš1×ÀÍ&ý6¸XÞ…¹%’ûkµÞû—È[/9ä‹]£gÍ¼È E"ÿø<Ȥ9Ê©K 8g?ï[™wy˜£0õV¹IÙ›FÚ.@*‰¥Pœ¼NRIÝØ;¿0°?ZâV‚.ðzíZ¼º\—Á9˜™"óÙ/ùS²T½p)L²>3‰¹D,¥`,yQÃÞÞý¬aQi FŠM¡55ßH´‹Nû¦š¸Åúó©éý»?ÆðºysÜíÍåöYa>}ú¶Ãâj)<Ïé!‘A¤`kï²U–|:܃:²Ã6羯}B+áM)~еDN©m¬íÚ–{ÀlGBÓ"8¥ˆÝ ú‡kÆÃwnMÛ #×õöÅÙ{›6ãÜ«†i2¬ôR™[Á†ú_Ï(ؘР{¢woI¿¥w Q;·ÛîRÎ4DùRÎ&„„B/Á)ë@?zzá8Œwa’ÍÛàõú p„ÚËÿžwú,Œg™ôå9šëzvÅgò“Ì"¡)°,.‹æq²á.u°ð„ ëîÀŒe2÷eÓ»?.@x.º—nÚïfƒ“×ðÀŠø?icÊ‘©òäP Έ_ *4Ï€¾‰ Ð{áb›ué©(|ß»Gž´ârå`ZÓçiÈl=«]¬¥òç9æþÿzwóîÃá° endstream endobj 508 0 obj << /Type /ObjStm /N 100 /First 872 /Length 1132 /Filter /FlateDecode >> stream xÚ½˜Ën7E÷ýüɪâ¼H íŽI/{0¤@’çïsª•i9ÎÄ!äFƒfÏܺ¼õ Yí5¤ ½ÍšI¾Qsš‘`2+èµNeV”~qóN‹8† .ÕדR2†ÕªËÅÅrx®–^‡ÃO?ÿz‰=4+1õpóñÇ·Ë‹g9µØX M4&bóUð#kN1#}'äI@)RH´µÕ(U÷Bn¬G!‘´ªQIÕNÈM@©Ñ÷» Ú\bM²ò$À†ÆšgPÃÑ··›€Z"…8C«=úzÞ ¹ »Íà ŠÉfVùg~± /ooÂÅE8\ú¹Àæ´Ú\ú©aYâ…ÏãËz°´Ó‹ú®¾¾@wxuwûîÇãC¸ ‡W//ÃáÍñÓCØfzóÇïG~¸þõ¸¾gÖãÍÃ=ÇRvóåðúxûñîÝñ~Ý/ׯ~8¾ÿíú»ÛOáÊUÙ°XØÕºæØÇ[f»¾ƒ‚T=2> stream xÚµYMsœ8¾Ï¯ rbª< ñuÍî&•=lí&¾y}Aðf`˜8yýÛ­nã±dO!µZÝO·žžS8žóaõïJÂÓs¤“ø"qâÔ2Ml¿º¹õœ¾üîxB¥‰ó`Çí%ð¬œÏ«¿Vï®Woß'N*ÒÈœë­*O$A r‘¡s;7® ׷׿¯<^ÒÙ¨ 2ÎÆaf@£>n×›@¦n¿3Ô¨t×c+q³¦þÛ“ª8¶º/›š>gk?qwº.xø¾ëŽ^ºfÛ_AÓ÷OòŽuÞ°¼µŸ¦&nɳtÕ5§ùb½QÊs¯w¦e åZº<´©«oCkÐ×|ALÅýÛÓ²WhØüFJ‘†l–»#n/‰Ý²¦g×ìQT’¸Ýa½AQY‰ûÎès¦;ÓQóagjÉ‹¶º¢O­yl-ÛýïÑt}G³t ;ᵊ’$ðÀr¿7y©{c÷ßí4 jpô÷ÕùÒÎÈäA€sÁÒ½iY&õ‚Å:jikÙ@¹Ý}yÀ=Ǯɩ§§- Q;>²£ 'vã¸=}¾Ó÷b†»·ïý`Õ¯DêE 9ôaj¶Û–`9X1ôC7ۙ잚7oPØÛ÷2žÈH•*é4yJ—Š„‰‹ÍÊÐÄÙâ ¬•ÃÄ7·gŠNC ,+…s2 •HëÛ8足>õç>•cüÐ)…Ñ‘ª„Òµ¦…gÝpÇqVb$„€èÙ+úºmZ–mÃÐغ/k^£ûVc¯³¾Ìfzú#Ìa”ÙkƒpôeFàë2/{ÿá³eð0>@>š}M;+´ÉW€—4µ¾<&Õdt (?x쟟ú"Žâa@^vO ŠD$Ÿ” ZˆZÝö à %jÄP­÷K«Áe,_¼ÚÈC@ßðý€×=Dt½ l¤N½YPeÉQWÕÅÀˆ|áÅÑ3¿Y^4/XHXÄBç`Q}› ôÚ¦ol ΚjHe0«ÎÉÃ+bóÏ^÷ œ¹Û3@íH>iÒéöPÃPØÁc‹I_ø^xf²¹¸w‚Ü zw9:”ï‹T%óüØšªÁÄc3bY/yؼØÅͱ¿]°‘ ú/ÁöËCò)lËŸ îGÚsØFjäÇçIŸ¬¯"…ÀŇnl‹¯pc®ŠÂ)pU&uOöF×MkͦÜçhÚžûÀ5†¿oÛfO-{OWJ†•Ô$&¬‚u> _JîæëdA{~µfkÚÖð11¬íž'¢x&ñRx2¥rÇ…À.ëÇé ö ¡„Ï…W”D¸.†—JOAz@ÖÅŠÁ¡Ó4ç#wÜDÖì÷ã©h9( ÄìÔ–Y?˜¶ŽÆÛøpnľ?·!qO›è€÷1Û³§_è>Ùij¸™˜FK1º(„¨'é×;«”7ÕÔcMá9ÒìÛÒS‡–¹tØs"Šçì4fH‚,‹i<‹'Fâ ÄçÙØó'P÷õ‡"0ÐàCñUèš[á±ûGCUZBâöÍÖ’14% áשk¬-½ÁFýŽ†Œéª£wJ“Øx„9†'¯Ú£“ÞÐ}K±ây"ôãgR¿ “çR˜ÈçR?ÔÈSÿtOeQ7í >©©  Õ<)  ¬GÇ´üª&oê Äbœ2ñèg ã#/ýîã'ί|°P¹_‡"æîX,ÑßY!uhmÑ € %ÐÕRѤDè¥gäjΧTï“;/å”R¯ªBlŽ¹õÔsÍv» ’h”ž £í2Ó›£ ž®S™e}¯œq[Û’Nù¶ùbêþ'lì ³{ƒ÷]¶T¹Zâþ±ƒBˆ‘©ÑX[Ý>ë¸â¥bÏV³Øû¥¡óª¥:x5$ìóêSÙ`‚Ff'B]¼þr+?"D{ÀqÓÛlÑñq |_½Ø_]CvþaÇ—5h«—•zeUiÏæ»f*^üŠ:­:~÷D¼L­ä'Û ÛÀFw n~93=« µ°'LÃw³„¿n~·6^ÜÖšï?rÝk¾ríÛcÖóìø¦¶9»§µ™¿oA`Ó‡cÿWqÙ®¹”xíýדxgybžx«Òþ•fm”©²gßøf•îºå¸JDt:Š¥ ùAŽºÜ,©â uº9º;L»éÊÿ-]2‡Þôåòs‹Ä‹/ä&å{®¡j ±®Å4>«;dêîå¬.ìÕþÎih]@ƒ«MUÖÜ3d{ûÙVJµÿúôaåÜLÖÂi–mÍ-ÝØ5‘@žŒb7FE,sņ&ÕÈ•çûX(Ù©ßá/ºzêvkt#ðõö¢o„¯Â³KN¾?ò?•G˜(ÓtØg®ôðüízõ°÷D endstream endobj 637 0 obj << /Length 2633 /Filter /FlateDecode >> stream xÚµYYÛÈ~Ÿ_!ì‹)Àâ²yÓFxuà<‰3ycÀ‘ZRg(RËcÆ“Eþ{êêIqÖF€¼Œú(VW}]W׫Ã*Xýñ&ߟno~ü ŠUøi&«Ûý*ý|•¥ÊOòtu»[}öÞËs¯Ûõ&Ê/y³Þ$Aà}0¬uë/·"*ö£8 ‘C°ÚÄžøj½Q*L¼õ:R^ß6ÀJy»aÛ›¦fùªð‹4Låû0‚™ÿÓÇOXoÂ<ó¶@æ^_šºÃ•Ô+y£3§s¥y|n›C[žN¦>0MUÖ‡¡þ…Gcn˜ÎˆMÓðàÞ~øN/'ÅÇ5–ÄÂk•§±qæ'¼Ã@ ,LÀàœ( á°Úi Œ*¡Œ ‚±ŸÀìXÊײ{„‚F·Ó/*Óõ<¢¨Ä»°*ªxþ¸N 嵆үý˜Âê…3ç ±Ïë<ö0E™äiw6!]tplÇüùÜ€âèu‰£ÔOÕ,ë,gé&sxær¬%‘sHu”ƒ3®Ò´¬ºzÆ%ÿP­Í/ƒ–kuIC"vî '…maëØÜQJØ`s6qÀòÒú+ìl b?O ýóyP–‰ j ñ@Œý"pöíBªöc—¨Ï¥iE€'*pÅr? ³™'”œ”€:ŒèCí4¢R“V0mj/ §ÀÆØ´¨îQ‚_ÍMŠ¾ßb.…«æ Ö¡„l8¤âq®ƒB=¾¨½¦ üP¹<×õe¯Oºî»nIè«HYÒÃ5†€q®.Õió³há!x„ñÕÑ |SÈ’.I ¤`pðÈ)¹œ'´È|9©ŸÍ¯ª\0‹$È~Ã*È/ ¥AèýcG‡à1Äq¨>Î<ìô#¹UKwŒ ¬Þ×Þ¯s±C¯8"ƒz…³=ðmNg¾ýâÌ… sà%ç±0¶µ/.·åVË”G¯¯J?»ü‹†¡þ†A¡„= ÆÓŒ÷t4Î¥ l1òL:½*Y“G½Ué*`B±¬tðÀ'}cß—:(æ—C„î`ß ÷Ö+‘ìÉìCc+þ§í´Þ|p–•ïòµ«ãå­^DðŠ:˶ôè…%÷TÅ †Ô5¼Þ±†Ç‘Kqa{»†ßä°~,qãQ”ÀÍ^¾m5Ÿ¢- *ÅI ÓH{oÓ¢õ  zø;Ri›ËA-Pž›oQ¤WÞt«ÕRDNƒ 5À•kìƒà+jü=ÑË;0Œ¶ =¿ãq‡dÀh÷Ì#á<Ç·Æ!ç“$ƒN Éâ“Þm‡í"1r”·ÌÕ=R9AÊWc}—Ô• oÉ«öA¦flŠÿ{In…࢜®ZjãÀ¹×¼’´µyÕ4w‚È÷–é¶-3ùxRÛ&ã‚1|¡¶ÅΖRKZ<™þx7¾y«Üm^©øM±Ïí5—o‰ûºôïõå2±/Æ=­Ä{ÿšç“¢QÚuÜ"ÃGζ‚ÉN–÷T¯âÆr¨ŠÀ@÷#œÅÙjl—Ï*xHQ£/¡ž % «}ÓŠØ0ò„ª¸¶ë» j–,~3ñ,.O†œ'¹Áèt_‰sw §…ów%'àŸº£|&Ñ<¬á©*›…$úˆK°ïSUüu8rDܱüß¿YjðrI\…ÞfýìíÅtɾ½ùåVjÅ…ŸÃ­©,ö³¢XmO7Ÿ¿«l‚åúQ‘¯žˆô´Š b=[­þvóWîJOý2l‘Ä*VR¥Z_Aq–çêj²ÐLÆw3C‰5?•ã3OZÝ­lpô¬†ËõD~ æ1¹ŸQãí¥7 H‘^º!Ä©²‡Œ+¸>ë¯çö˵Jaî—”J'HÒ4üDeV­¼¶¡\Îgk]lc‘›f°³o›“$xüž>o±ÖâW‚ÎqŒÞÓ¥3'S•RTØêã=·Ë <@Á©ÒëÖŸMt6^¥'IS%or¥#µ.¸s)GJZÝ_¼iôW~•_¥ÑWýK‰à¯ÌÖôó¤,ÙðV¸Dز´.µB¤I§Bn`ó›W Ùö™wøŽ©ž·±óÅgãª;›ßü \7ò€.«®±”Ò€G^CßœÊÞ ß?3a߸cìcw‚õРxP^EÆ„-L*xrû´uãô=!럾1žhŸ)8 8TІ6Ô?\ˆö!VÅÑ7”‰gŽªYæŽ}GrÄhòÌÀ›ÎRïã^tÁÇ0þ '%+ÔLjNZôj[ªè`ìv„ÖkD‘Ûü-[’ /!xH0OÇ,9–aW7vJxõ›-Þ Ø"5µ0#È´a‚¾<ÿ+ ¦dC#Ê¡[LÁià'©Kݱy’Æë€ÃqgfÖ 7NÇ d!¨e¾*.MŽGA,½õ@Ç:^ÀôÎ4ÛÊ\.,Žþ×Ipù× C›¤jÖ¬ët×¹¨v2‡ã(ä½P»N+ÖU~€m§«b«Ò äÅÿ¶T– endstream endobj 657 0 obj << /Length 3340 /Filter /FlateDecode >> stream xÚµZëoܸÿî¿b{(P¹õÒ|éåË]Û4¹Cš6ùRäòAÞÕz…h¥=‰Û-š¿½3’’ve;ðá`¤FÔð13¿ypùâfÁ?žýr& å ±È$ËiΙÈóÅjwöá#_¬áÍO Îtž-ní¸ÝB'´õâÝÙ?Ï^¾?»üAòEÎòD&‹÷ÏE±\Å‹÷ëŇ(f’/³\G¯Î—"*Lq¾T™ŠÌ¹’ÑýdTöçßÿtùC6â¤ãŒq•Â\–HqÈwë>najôñRKi¿^ʈŠxì‹Ïeý—ëÃÍÕ—Ëëª[ÿþ|Ë8böaEËžZ$±•©qV˜a)Ëc·¥—oþõŠFqÔíÊb}Ïæ†#«ïiP¿moÝðö`ÊÉèÄmÔòdü2;_êF®ËÏôIi¶n®ëª+WFГTWR|¤þÏ<æRshÄÜRD3!SœÉK%Ï—Rp>Ì`M-~ípâÃä˜}ÝþJÞœ¤íþyî£Ù‘^ì»rSÝ}ï&þ`ŠëÚ½{auSÕ¦ìyÈE]ûvEwÿ‘1öœ'ø/5Õ†Z1=~¡¦)“Õ¶l¨W¬VåÞ|Kÿ›Õ©ß\&Ö|E¾š)Hkƒ*Í’4H €å+B4F„b`2 `’¸É^«s™E[ŸçÑçóvßU$:¤Íš:e¨a·00‰ŠúàFm‹ž:«!©3Eu.¢†ÆüWM È•h½líc[—EÓ_À8bjp )oˆ0è‰Á°;â°s“]IªfÕîö…©Â²o+³=Z÷ÌI· rP¥”•‰ÙŸtTõD5-µ ÚŸ‘ . ï‘ÒèaÓµ;ú´’öf`C"ºqÇq[ºü(T6â#èE‰ ºpêѶõÑð±|¥f9O¦Úú~k7ÄSÚÑÑã5¬!F² òDb¨J"ª ½[Ñ dŽgAÇB”¶©ïG níù!è Ûªäd‡ í=“éå©â¢Ö¦±ƒ:qÊHäLð0fSÔý£„‰XøA Z%¤éøüQ‘Ā෗àöR:Ÿ4r/e€÷+ë—«rK™kÆu<Õ¼CïÔ jæÎ#cÙਾNö'ÍÂzS˜rGÖaúG•i™¤,–V“ÍáHÕ˜¯Õ¨x¢QRD¾E’<º)›`¾Eí†ÃîˆpŒZóè9â×P{húê¦)×ô¤äµUDɧBøi!¬d¨¯Rc½@ìCyçf^ù)]k­ÚÞ´ˆ,8–õ–^Y3ŸAŽ¯Ç!4=OR ÁîNFÿ ;é~æ"nÉ8–ßð«‚fK¢¦5ô=AVi›O¸Ïríýû<Ón[ÞáÃ×ó©Å—håµ„ß ©ô©.¡GQÁhú{’VqGsЖ’趫LI¤myW¬A¾VÐ+ðÖ5 ŒüqTbÚìH÷EÕ=K µH"ßÔX^¶×n¨¥;ã>Ô³G÷”KòŠ©uvà˜¬ö€ƒ!„hœÑÇVØ™Â!R†ã grØãnQn-I«ØÍüw8åp+,FÙ Ÿß–7$"‘2‰Ô Ì`Dc©ýZrÍÒXzÉ£ D ¹ˆ“4óÁÉT 1€‡RèÌA nê¾ØùÞ=9J«Dþ”ì:ê¾¥ÞõxÑ ¿k·£–V¿j›ü€5Q¬ ‚Uá0ݤ^´pE"™ÌŽ·è8:ˆ+ìŽ ü3€BWö}ÓÁ¦uÑ(ün_ÏÙ˜ÈbIÅä ÿ$/ŠùóS KÄxðãž)u yœÊ/‡bý,C‘¹Š¨•xžø¸nAEÖÔ·|íK4¤¸h Ï—0zCòÂÊ ÛÎãÁ:ª¼ˆ‚¡ S¢w4øÍ+ÇËFwøјgâ‚?áŽÔŒl٭ȳ±="«iØA{̼=ÎQA’ ? ã”EtÐ ʘ < …Å™‘“ëi$žEx!z< `Y'¼¬êŠ@žžÞ¼ý¬©W¬×¨”OáiùHKÀxªææyz“–1·z ÏÍö­vÄÜù¨¢+Vf*3FØ°€›ÅO ßiZúö·ktï&4îÍŽ‚Ñuµ¹Mq´_YC-xR™^o§KLj/I  ³/z·ãvDsÈ3¸„²læ4dshVá%²ë1Ayà–»…çí)uê‰D'•¡ô†€?ÔC0ç%w„‚©,`‡[Ó¾«‚öÃLýÁ'i'KrØÀÓ5`xE·öO^À¹5-øªo} )¨”ò(urÛé ã03±ÖÊKvÃfö˜ÂÓ°~wA™ðï¾s逢ä‹9n,Õùp§,g: Ó}ÿ‹ìëY<¹ŠÙˆ˜%ù“ËxÌx\&ÕØ_`t›dÑõÁБߣ%Ùx0±jÿGÿ¹‚¤ )lЖˆÙt $r4ŸÞ¼s €oêƒà/ùUPSˆ§©å€cY<eè Ò­Ì|CcË2®-\5Ç­ûÖûùf&óÑ‚I‘b²ü¿®×*bQÛ Ö²+ Ùm+£²Ëœõz'ƒ ¾xÕüòTæh]¼å<2†]$ÒVí¡Æ˜Piu€n]§=O¥8é{CË·îÎzjü¡+—`pÄMQÁ¡97ã†o˺vŒÄÔ5ôO¢+1àq¾ÓF_È„Â3äÐÏLü5Ë©+ªöÏ‹ëy|ßj®]À ï¶-ž/’ "ô°Âº¤þ›·îyP ®ã,zU:VÍÚ#ŽliÓ|$ üUu¹4Õ.Pô67;pE­[M. ¥ê52ñIç\¼a‹U *\'–¼e3O¤Ùý*ˆ*ªH!Íîh ¥í%qcÂöÒ8¥MÃû6¸A~f°U ]È];îUCï|ì…ýÁ5àHJ-ÆÏmê“R€õ!¡•ë㚟ZTÂ! àÐvsö)™àaȦ\ñ+u¥¯®JOô4¼†˜M`p \Ö¬|Ö Ê±ß[´€nUEɬžÚôܲtÎÔPEÚý§á4Dú ãn»ùÂUçd9Ù]ÆtNµu{'™vÙÚäqf¯ª½;7ÆVL¦ùT¤¸gûíÁÉGr;6;ºëÍÌnçŒçéÉvJy"ø^ÈËúãj¨’¢J"a‚¿kgõ$+ x ¦˜‚¡ŒÖBûwî:€*øsÅ5ÍxX_ˆæ»Cù8øi*‘•5ì¥ÈóPŸˆI¡–…µjlšräè»OD„E Àîp®UoáÙ˜¦³¶œè¬ñASíý”G]67f‹¸1åÛé«¡‚¡uˆŽ€cò¡81Ñ#Tl|æ°2lqu3¸Ó8|q9ÃsLíïê²™UMÉGq!ä"àÒTÑsˆíÔo·@$êîl/„†(QÒg[ö8}gZ…Bï Ÿ„r@iî…ÈiN,^âe5W\äËòpRŒ¼üt¥K 6©¹: ·U¸sÊ`5wsH6¥Îòl-?KmD¢Cˆ,óãR[B1qñÀ€”CêÁæÅÎY.ÅXìÀïh¡} iÄÓn-ûPòÀS‚þÑÉ4üz1\˜.9³Kf.·ÒàÝò£ÜjÞÔøNÑ oEb÷3µdѸe}¤a´ .ÃaZFŸ—«çÝ?©$ò­ +Óàv©\ÔÕ(=­lªP$T®HíúK¹$zùã[ê€ZA˜ç¿€ ÎÖ±MEœ‰<®X/u¬èB¥aFQˆ\¹ÔbX|¢ñ.bÜ× *E ˆ(3W]ƒ–êD¶7Ý+’¨bC ‰ñ! ¦ÒÏZ%$”y2.G>3AÙ?U]¥©ä8?NÌ?•÷³A’-ô5—Ï6Ÿ™³aÀš'£1v^P‘ðÖ‚âL|ŠW‰Ùé9‚TɱÅØC§Æ~2‘fP7Š¬bˆ Ô‘Y“fcô5ЇŠ&B¾p8™½T¶]βÁKuí,ÂFmÉ;Tˆ¥ÿe…-õˆft;—Gƒà<ºêÆ–è¨FëóŽª %]¬bpNˆˆ#aÖ]áxºz°Œ\}·ïéZI£ë8*I@Äųô¨4µ™ÍòYš&'ÚšM5¡î© æŒËu¨t‡AäŽÓd0e•¦“K§ òd\ã;C¬‡tµ'ŠuÍ©÷’iÀD }²UR¼&Œ!${Wíªºèül0Sº?ñÓ½þ[O/Wþ¦:#'8ý1Ê€Àb¸”!X”ËR×]  „1Y¤ËMeE;wŽøé,{\àrò§å¡bñ´üÊžgSÙ\r §µß¾~ö#$ò endstream endobj 690 0 obj << /Length 4163 /Filter /FlateDecode >> stream xÚ½˒ܶñ®¯˜[¸Ò „_v|mÙ‘Ë•(‘IÉ>pg¸»Œg†k’£•rÈ·§ €Ü][Vj¥"Þh4ú¾º^ñÕ÷O~}"àËWbUHV¬ò’3Q–«íáÉ»Ÿùj=?¬8Óe±º3ã+ðݯÞ<ùû“¯ß>yþä«’•™ÌVo¯Ü*Š•*]½Ý­Þ%)“ìbS”:ùöb#’j¨.6ªPÉp¡dòñ*2©û‹Ÿßþðü»b²’N ÆU{™eDCžp ·ûÂöj2iãfmdŠæî·ÁÜp©YɳÕFV¦æ·7M±Ñ¼Hè[&U{€WI½mª}óŸzGô}´]4ðÔûΖZºú¶«ûúˆcêúúû×Ô·¯ºk;q‹Hjv:6´4u½¿HÓ¤ÚŸêšåíH ŸÑôý©î‚H5¤Ü“ø_Ð…ÀæÍDÁwÍ„[ŒÊAvnÛë#è>¬ `ÂSG„ë©å öÁ®($´Ì“7õ`W2òGõ$7ì2­ÊêxÝråLmOÔedn«ÞnBùàVmOÇ•/OuDØ&ÓÿÕ³u²k®PÔ£ƒUl-¦ò:Œ|ÇT?¿¡$SÜß²ÚôBä«’0Û];ÓþB;í›_.6y™,ݼwV|YÑ%í7e,§ÒÏõ ˜”^=Ø¿°gõ¸SNl+µ}]£´“Ú ðt‰—y‹ªX‘†°éY€­•sE³#YÖUÇëº'AGº-n»ªH;°9Ò—¨Ê]dÊ ]Z‚½ûµC™rM›R—0À^®C‚CïA²È㥞kà§qµ 3Æs/n Òp}¯ë°B"–äñ»«íP¬ØŽ›5v‰á¦¨´­ú ÉK&òÐàqà-Ƙ«fiªÒø ?,ãùä¼-¼Hþe‹ô¢(k´T:EÁB¿Bž¡¨RðÕše,õÜ`t=®nðY_ ùÙúáy÷*5£z0-ñ :8¨¡aU‚)„Ò0¾HN曺§ϼZAŽˆP ˆ‡Â#¤bì2j=ä©Çr@ßœaœÂ™°Ðà­w¬Xë‰*FÂÁ·¢ÈDÈïe‘Ò2•ÝŸ¶È87T;Û—¸gÀõõû 9Ù ³Š™ï…Ü ÊÌì\¦Ži©b ‚>guÖ5æ¥èx@`Ø¡rv;Tùrc{cO}h»ábǾ!'½+pJ_ÆÍF™, IíéZ3&h ‹,°è`Ó &ÌÉàÔç[傉p'>î´vôÈY^ž›²b:Ò~l•g­ŒÁq·bÆHçW,ŸI‚™ÖõÈ0$Þmk ‹_~ƒº€L, Ã"Ôäô>¶†D#'ÂØt“w ­I -öR€òrŠ·npf½w›À„Z<_)A.yÄ·]ŒåTÄ›=Ú³=ÔC†Æ™ô-O^N@7‹Ú2›qGWÿzj:r]Ej9 –ž`:5 D…ù‚e"Œ+ÃÑSçö,4Ú4jªhGâr(€„À2&X1p‡wÎ÷w€U= ð?Rë©?Q¸+7†oß»ë‡úkê!ñoŠ¤ ðâÍ_{ïû““ƒ5Pá к”¾–uné›<=B%¤Gh˜Ð#Ô,=Ú…ð ‹|¢µSÓõ½e²z p×ìwÛªÛšNÙ¬ØÑ\Ñôöh§£°®÷»X@¶@CôÊä5š%˜³ÆÀÎóIÔ ×ØÒHC €:ºAj2;Ø¥(…Úk^|bÅmŒú̈ÊuTV¢ãΩ¯èè~F)¦ê~>,[ÚÀÑ1ì¤8p^BçÌ&u~·5`›÷ì1Ìt0t ÅÓซÇÌÇéKâFrý0"—ÎYäŒólW N{ÛêÑfçD9ØSE&C&òä­Áì·mm,BÇÂ,T£]¨Æ0Lp&sV…*G5aV;î¨ð£m@WÉfá¦<ùËD¶¬p‹5vÊHÁÚ;*D∀¼ÜÛ&RÁs§°vûVÆìQÆzê­w ¥—\µ¼«ÀÒ°þŠõ”¬¿dxGëäMK½ÞÅÅ (ð€…Ú£‘ŽØ‡A2 Ï ½óˆúf7‚w°K; 桨9HLžƒÓ/S¦œHÙÕW J$*A_‰/cØ™ŽÂ€ÖW™#%:4p~iÙÝ®ÿ2&ÎH¸coûè¢õv6®ÇIÆ¥e© 5ìÿŠ>ïüÁ=sQ¶™´>…¿ë)~Ö“Ž‚t݉L2XùüŸej­G?E¯‹YwJ^æ¤%[+ƲYcÎXiýÑ{ «¡óêuÏõ°g#ª@‰ì©ù·ó9ítŽ dþÖ™dvT©r¦„$ð)z¤Á 4ïðDµõ¡¶íƉ©©<}­ùŒzú±nÌ‹B Ý…tpì®õ‘+¬ÉhÖó6Œ©’_SˆÄèê`PekÕ;myM@EQâùÏeîŸÀ{œ8»…QYc¼ì†j·ëð â(æƒû=zÓÏ#k¦lT´·öõ1ˆ'{Ü÷*+Çðè¾½‹i22c¸j½Š™Ý4×7±(:a^Ÿ]GB0‰˜˜Ø™Ê“×îZÎ÷½ùÍ­ˆA®YZ>‡€Á˜ã¤˜P~Ì¡È]5V!øÖ#ÝàÝ[º‰l$8ªçrWþàÊš1–¤ºqç},öÁÒ<}üuG€$½ïªáê&O&W„<ôŒìãxE:÷)ð1Y9hñ‘¦9;.ÓJ-DÔ‚‰%ñÍN¼4R*+íä)à}ÁOnEˆz5FðcB¹ÌÎÈàžeŒ]P¹`_‰·Õžšâ[ä9ezNÕBv>ˆŽ-Ãrí‰Ñ*ì`­ð‰ei­b¶ÖH¿ÅâZ× ù‚Žëm{¬NX|ï™gæ8~¯S‚j|XEñ*hèÁùî¯>ÆbŸ)Ë2u&C â×o>õ(—O® XË—'Ü‹¼šJ¾‰èäVÉä±0îÙ:úÖ$íª†Ì…tæ\Àn:?ÃEŠö‚?èô•#QƱb-bлD+û}Ó"6Ì;1XÕ…vHªú-¤šerö&Šn|±°ï£§ 굶†µÖ¯ì×vÎÖRãÛ;ö†+Ž4èBÐä'›ç|øŒhû|ÖÂ>úpò–2< a_` ëÿ›ïoµÔÕß´ÙDGOMÆÓÃÁ#¦fM /"ò‹•ã#Ùý†Œ’,éoÐjÑØÓãSγ*¦´šR»ÁÈxhd¥㪺3ŸÃQ–ƃö§ÚXu¬¤ôLÝwb)™õãó‡hÜr ü°_ÆÛƒª|4n¬HOc2Êuì1$ ƒ)“„ŠÐha’æ± q˜²j““”‰DIúRd"“É«×ïáV5U( ÝBÁ8ãœç¥Kå¬yè8æÖ5‚W9ÖŽé~¡aÀ–DzaþN·NÑ”Åïgá€þsöéÔô°o|(Àò’n°¥?]Ý#ìl“L“)ù:Èâ·põ&úÆ6yŠïé(•=ˆ‘dþ¤qŽOù;ŸçHsmè×M¹–¯£®Â4Sä1û<äL™w@çÇ"¶0ãοYäæXt;ãƒ@OƒœÃÊÿ±g¬3bGlˆs®\­?¹d„cíÚP:ÇËÝñT–ÀºÅ…ïpäP¹4†f˜¾^€Ù¢‹…tpû²¤þPa†E,ÜE‹³LÆñïyábZ®þÌy\ÃÆ?üÙ†X@s0Œ³GÓ¤ÈÖRÇÖ <†ë?s&…_'’µ(JÓ¸/mRX˜$¡r nž éT„ç 7±¨ dÚ’Hš£ î;-â^_¡X6¾†Èß¿#ÄGíZJ&µG¤ZÞ5å^rBŠžY—¨'( <ãÈV)ÜêȺšýÿ"ÇãLŒ1»›¶¯ÇDT.gÆÑhIʲ4†¬Ùí5fa+ŠsüŠ ¿e‘A]j%-pgÄŒO¸E E r–*õÑûƒK~Ñ‹‰^ÞCô“<Ò<׈œ’\‡‰ÂÖ×U·Û×½m3Éy0öÕk;$-tÚç@è˜\Œ))Kµt14WsX6VV*T7©Àð•zõæ@iŒ&š—[`ø2ý\ÉÍbâhär”":pû1‡93h­Ý–J’Ç…‘Ç=õ!B´ ©.Øä £*Ԉ陱LÈ Mâì À JÎì@\iÉþß Z/î‘ÏB‚T”Å£IU¤k‘.RMS1qº“IÄ·²S,‘J6J}wÒð°L Bƒå¬ç@\O[3éÁDŽYÒÊ7M¿m7=¥wšlF> ãcí¾\Až¹î©àþ¾ ˜×ö½Ìjoë2B@SYFg‰ž9Ÿ$3AžBšØ T;æëWÿø–JÑß™OSæ&PFä¦|èÏ£ôï±3d§¸1_'+R¹«àSç£;åpPDÚã}¶ÁùÉ Úχ |?ÕèÏ D¡@(ðwâf£ÍòÞKød®Pò“‰èD(ü¹Eþ Â$Ë?ð{±<<ûKû³¥ºsX|šžÛ_fa»°1xNæÔâZéò‘8%Íc ÍlM”²o.1€·o†Æä?À L²`%µ›yî·KÔaÓ·;ê£WÊ#uM<2Û{’ÐÉE˜æŽÒ›NzÏ/ûö`s#ºöä2&@pv LðñM—Ým¶ƒõþPULw5 iÑóá˜q²m º)ÏÃ$ñ4&WÓ7ª-ºb¶Ö7øs®X¾ÄË·OþEŽßú endstream endobj 601 0 obj << /Type /ObjStm /N 100 /First 874 /Length 1253 /Filter /FlateDecode >> stream xÚÅXKk$7¾÷¯Ð1ÉA­R=$YØN ,k61>8Þ!˜,3ÁØüû|ÕÞiÛ;“XÌ6ÉaºçÓWOUI­µ…´¥ ŠB-r Ü0r "%d2Œ²VŒ8ùªX2Ƹ–A[ ‚u†ÿ¤PPÃXgIðó÷9&ŒªŒ%´T1ÖÐ4M˜ÙF)Pâ2&+ QÆR‚Jdà$Ž¾˜_ IТ¨bvLŤ8¦’ ~$–)ä[³ Dd0»,ƒÙ|y³Ÿ€¹¸!ÌÅæ s æRÆ`®µ©áÉÌ­Ãr‚RÆðcRwÞPÄdr¹†œáW¥™¸šÝrn!K¦Á$ab$€hRL2&^ÈG\p ÁÌV …\0QCRis0Ãy¹V€]xƒÕ¦`n!e4À*˜¨k¬˜xI@ˆ¼!#ØÓÁ`3´3K˜Tü…8\Æâ|ÈVçƒ!¬5ñäv±³¢ËVŒô*ä`H(nº°&¬@BuÓ‘f\]8šìVsó¨!s%yÎÅÄcAXÁÙ…àCr!ù­xê2£"w³K¯„]z͘xÐá"&`_^Á,¾¼‚Y]ylQ—ŽŠg¢!.R؆££a|Îv¤ð.ŒïùÕ“;0r.Ñów}÷ñãùðâÅ^pÍ~ Ž©ºr«@n ôž6k‰{ÈTc‚óžGbFF¤Bn"¶È]ªRÎQ„–BÎ $‰H‹§àãÍú6…ñlاӪc*çÏÇ^ÀÜŸ¼hÔé ãÛëÍåÉê6œ…ñí›ã0ž®>݆™üô¯?Wøãâ÷Õ0¾† Õúöåf’2ŒïV7›»ëËÕÍT¦W?¯>\]¼Ú| giê3²e!Övi× @%§{øËõzƳ©–»J_HžþÆ“»ßn§çŸ®Ö ã«Íõ‡Õõ$!?Œ?Ž¯Ïhzp.a ¶UDC‰¾_”c‚ÍÜZ¬¢@½œ| èQž§Í‚ƒb女Y#ITpRo¼r¾²+RP{ µœº*À>àCÑ÷/’-=[ô·ÿ**¶Ûí÷âŸt€Zì9Wð endstream endobj 713 0 obj << /Length 4143 /Filter /FlateDecode >> stream xÚÍÛŽã¶õ}¿Â}ª'ÝaÄ›H%‚Mš ¶AŠÝ-’þZd«‚¹ÈW/oÉ ©W/·«ך vum µþëÕ5_—}yu-­\÷WR¬îáE¬«îêç—ß}üµARÚ²LXËáy’ù}‡',/G“®Ã¬ka SÒÜW·÷÷e70]L(VdùêšsVh¿ñ/¾ù6ûvs]k×ÑPÈõ~×õÔÑÜøǾ©›Csô»‡®¯Ô®¯„]øûêê~«¶ÌÀÖÿº„4G·)ë?{°oÚ]_…µúª-÷Ýt½þ.l©G¸ˆNìÁ¾¼«ÚÊo p|8úäŒ]õë•ÛI¹‡q6ŒÌºÚ ­vW@/ÿ¡ñ Û²oZ\SÂŽkzzüvŸ¹aÔ¬Pœü†Lˆf˜±Ììf×RϸA*f2FµUlk¿‹þ®¢-þ”qÕ:Š@ï³ßSã§LgÃNT¹£ÝÞB˜uÓÒW˜£9ÍÛùÃÎ99—ÓÙÀž?œoyr¬X9cÆxü<=û2…Q0e°ãf^@M×ÛM5Œ8EˆrC™eR¿.´d²x7\<ùêåHq%˜Èõ*/SêT“É‘&“ŒËS]6^Œ+ÍT¦$¸nêòö¶­n˾Ú&Ê™äú­)p èu êxµ©¯GKyflýT§ÜŒê2Ÿæ9ãyñ6´Y~øyBŽ/š‚$ÐœV‹0Fz?µÎà²Þ&qàa=`n†Ï“â»pz%Öÿ®Ú[ Ù7ÔÓ{åM§#áSÝÐ{yß6÷í®ìý ÃSrãttU¿•‡û}pC_ ÙÐáM´6Óë}¹«ý*eMH,,ãÖNõí³0&— w{jTûêP³öeGOZ*—#­–“ĺŽG ®¼¸æÄ" ÿ5ðÆ·7'#ý¶qÝzëz4=}R¸÷a´×§ zI ~§› £2Ës³Ê µÒï# ]‹L;PRå’Æki4ËŠÂÁO:”ÎV’üð"wì‚ õ =o¡ÒBë­8°ŒŸ^Ö`>éÐÇ.ØÅÇ꺪NŠƒPbAÙTõ­£ì 3fUç9Ëù‚ª0ʼnŸú_\çLMÇ}[Ý»!ë&UœY%OÖœÅÃÓp0‡ùÏ’óU6è''gç² žx‚û%Ê’Œx’Ÿ/ Œ(„:Yz –ƒ}ÃÒ¥f°/ÁØyùÀÂ<ãc%êÀ¥ÉÞVÝqߧI„æ̪ ¶ ‡új†DÙb‰D‘/æhÄ—ˆ¤—ˆ$³aÚ0ž:+ÀGÝStp_Ö›Ðïøžiòq!™à—ɧì@ß›¶9¸Øš!eJO\¢d6ÓN) Ð"%á…(ézG”œ ã#ј;À@¸¨öʺ†Z^‹yÃ_H#¦FËnÐIAKWÝV-u8Ëñ[Fþ ôôweO­MÙU¡Ï5òiAß"á…È  —ïò¨†ÉsîM¡AÆôed2 á°Á²­Â²Ð:TÓèŒzÁÐf§¸´@~ÎN ¤R` E> ”nv{øþ¿%²`™ÑçisOJhxRBË“ÒÎ’å1/ôe ˜GZ{RâjŽ”Шß“ $ô:JÂsÊÈv–´9¬q0CÛ<ÒÖÁú–U,å/Ÿ<Ž2’7ç]ÄImK%Ó.T‰åàùwå!8 ]ba NsôЉLKö›]ðW¿¢‡ZµC’F˜É™Qo% p"Zxb‹^ôàÌ9§h”ò ˜ˆb~.Y4”Ÿ/,ô‚¢—÷òBP×æo'PŸ&8œ5@Ù æÕY6èh÷ÒÝ5@ˆI¡ŠÝŠóÝôeö±ça .š9—öhQ%qhŠ‹†S0 '†uˆI8‡msìƒAÓÀ^…<1h}ßî^û*¦A(ò±_‚³² ôæÀ|¯nïÏcny¾ÒÔ#L~4¯¥eVwzО“P¬œc€:RJ­_ì»}Ùî}¸ƒçÐ L%`wúônBRÒ:úŸ§<8‰Ùã4u•Ø:už—À-§¼”ؤSEÙúë+«(× éók.~ƒ98Q¶â~YÙ¢gr® ‡­˜÷Ò¶à{åJ9P0Á%m«X •K/‘=$> ”b|ãî„.uX’2påòâ%` †òœ“v˜;?cJy£&úè¢"°Üâ¥o•ÇÝ”‡ ~¶µq …ó-? ´(˜…£'É ®¶ N"à‹xYVИMWc¬(­o îÄB)4™ìtF͵ªßÀ)ëº]S»ñœœAüBñ*¶F¹gê˜68 ¡ôz³oœ‰óÓÜÙiŸ“\é=ØG ZÁÔhŸ±0jXÁS0¿^iîX° °4’ß*oKB5ëa‰L3‚i”£jå¤F±£¼€|;Ž»03žÛQÁÕ(¬;e utÉ øÖ–õmEÛ×ãí“m¹h}¢gVŒ2•'“Œé‰õGO“‰,[:°YF²² kùPú’ÄžþtÐjö[R»ˆÇmŒ¶Áü¹¯!À€èBлµ¡ˆñà>¦ó úWÌÀU¥ßÜøOÃví –èpw6÷>$6?§þq”Áþè²Ï88è2úõ6®Zÿvã—TáËà°žÿº#š:1¥‹ÏÒsù0¡‘A6Õ½ŸIÈÃïèÕûÝ/WTqÀ –©¨ ³;?}ç'8ÎÄoCˆ/‡Æ½mwXª¶ˆ?.œ‡GëoL7O^-ö8VÆƳ2è_¡Õ®w49å8ùËŠ¸¦¤ZÕ±” Â(ôwmç +mŽ˜ãºÚfìz§* 7S˜ÜÃë×ÇrÛ…&/ÞvU:!÷F%F0üE ¬á!öü5‡sˆ§%òli«nñ¨Ýì&w#Ìøn„îF8¶»x3³ZBa€[Ã… % ùö% AÎj@Š©¨M¾LÖJF›J×€4³zZ`(·sÙ…i予†¥ ÐR®c®¶}0Øj™9²gã™Ù1B™llá %;©¼9RH9.}™„VDokµÈãŠu(#¿[* c­/'%˜Ü.‚4¥wR+.TªVŒwà«ÿO_¼$³te8_¾,`¢ ŠÊ¿”¡FÊ?ÜêWƒ&P<kwßûYTàp ÆÊàZ í®R2—õbÐòp‚ã*е4'9¶‰ZP^-ȱZØÑ QàÒjÓ/îD,–Í SÖ\Ò¼–x£Ýç§æ·iï¼ÀiÑü1*&UXÆ›ãbR3cÒâ˨fî\«TÍÜ‚;½…åxüBH›3®Å‡8–¼X/‡hS-y™Ù$LC\LÊåο>us÷6*ŽãèP÷éÎØö$9>ŸËuðËõžK–)½™bpò>×õñ¦;X•v%vhLk=$þ`„×ÔP2tÉë~'ÙÏê]ÒŸ_„¡fÐy–ô¤]oé¯\…9Í8b—K SÞ| Ý„:–ÿ@·•ÿŽTB ®Û¥Î°€-ßKØAë—ñ¶Ær³8Æ¥W ïJtN«P:ÏîUB„«dÂYöŽº\Ê z¾úÒwŒrÜñ«K|:ò©Xüè­-èûS?£l¹t°¿yV¾Íð,1-•¼T“üDÅNù”eR>‚Ms9¬”äw.@üíø{ÊÕSöœ¥áO¿'•ž‰qñ©‹v·»×T3'—z¦P‹_¢êN¼®?wÓȪßø üá_aà²z3\ ¼„o᎜òœ!eªV¡ˆ3Æ?<ÛÛcøÛG÷ö¥Œý»ós/ÌÊÐÿñYÒƒ$Y9MŽÓG¶œcƒÊ•ÿÑÞV43]G Q^Œmž¯Ÿvw_"BuVøc…­µ~Œ=¬AÄÝn›T¡"ÉZ'ð×ÒäAÄM¸øk7þŠ/<Ÿ;Bš±ˆ¾‡Ó‹¸DܤD:D˜™è*¼³Œç¢x„Ó>à9Ïã?n“2^Ä ñ³2nã]À”Œ»Û¬¹”'ÊIÈ:‰Ñœ\»ËHç²-Ïd[‘l›A¶ý-0Èö~$ÛjtÿõyB¶ÕèŸ4'²­¢lÛ3ÙOð€þx{Å endstream endobj 748 0 obj << /Length 4120 /Filter /FlateDecode >> stream xÚµ]“Û¶ñý~…⇠/9Á¤Ót&IãÄIj»¶ÛNÇñO¢îhK¢BR±=ä·w»à—pwÉØ}9 ¸ßØ/àâÅÕ"^|wöË™„ßx!Y"²…Íc!ó|±Ú½|/Öðæ‡E,tž-Þºu»…N3øÝ.žŸýãìëg÷&ñ"yš¤‹E‰\™Å‹õâed„çË,×Ñ“ÃùR%QÙ]Ý´ç¯^üpÿa6úV›LÄÊt÷aã’³˜)½ÿPæ ©…Òi‚«—~ù2±BõØΗR&†°É›±Åð!™¦ôá‹ëò|©mýK½íʆž¶ÅþêX\ñ»öx¨‰ê¦kijUïvõžÆÕþ<É¢®¼ò_׸:›Ò¨‰QÂƹgùçØÄŸ_,/>»¸C‘±Õ~ùÅùÒHŠ¦$Ì×e[†Ð¤‰˜à(>ÿ—Ÿ¯Ë-˜Ô 0 Ȫ>E²Ô2Ö¤ ¿È¡ûò€RŠO†!rL'h2ïÙûK‰V÷¬Ü*‰EžH¿ò¯wúò2,iDš÷`ÀµL£Ÿê«jUlA·z¢ã ä"£–æ«ýj{\—ôpÜÍ{fѾîh% KÚXÄy/ùONi2"Q#mJB’¦Q±_†+ ¬øï>ý4À+lôt ˜èìáÖÍœp©Ç®Cö„½~"Ü€W!`y>g®ª‰Píxã,–*S"IÌÔ¼z)«TÝÈx¬×áï· ô"´}@.=ÝŸü~ƒääTt*ÕÑÌ¡5Dཪ¥H)‚_©¢r[îxÓŠzC¿½oËڛ{»¤WUG«bO—$Ez8¶åšAì§HmÄ:Uã @G3žŒ}mO SK‹TÛ©Vºk‡3ŽÚbÇ£¿}ϴÔ!;jÊîØì«ý¯jŽ¼¾ÚÐ"‡EØ &IŒ1ø#š-ª=ñ£&Hž„«êW\SòC‚ž ±Åö›¦€Ør\ Ø2TØh#ìP©4µËÑϾ}1ª8•Ö"ƒL73aŒžjTt*!ռ윤xkAé@)/àÕu¹B‡S{•ŠT&£ÔÞÊ,zÔOå»bIË­˜J##i€˜ŠË- Á™Ö5‰¶åꕸ}³ð£Ï •¥È´šÚó‡ùPk.£TgjRþ.^Â|‚ sN6¦ÄßìkÏö„]Ÿr¶ÐÑìÈ__ôìõüTßVCIþ¸SÖ Ãrê¹û×¹”2úê§G1ç>ƺ)檠7}ê"ôL;´´nXŹvª™úБMœ*36Ž'ƒJUêC”‰a&³’QlÞV±æRB÷I ˜¨­w<5Ñ$•âñ$Ö´4syäW{ÆH= ØѨ¯'±µ¢ŒO5 ‡óøÜe61»®Ü¯©ÓÑÒTÞ°¾Ä“Íjþ £Ïs!%H³µÙ‡øy'"'Š ŒÍÿ?žþ"gÚÛ94çv&ƒ¡´GØ,¿œ_P´¡FªÄ>ÙŸ‹>˜ R”°.J`R¹ÝÖ.À·œ@Ö”?¶}³mó~”~Nj\å«g¥ÉH`‚ |Óò‹‘ón³:mуJ…´ $< •û½æý7ª(,Oë-X&êË[úõln+lÒ3oÜ—ÇeÇܹ MøVáB9ô¸ÀVÑW¬+LŸÚ™VE[2ž·Uß® dÜÏßs;ꦂ”»»Ü{ôXâ€òe*d’yÝR;inC“¦ô%Zdíþ€‰ÃjLC‰^¾ckmÛ*رόÈeœÈ>€,zLo+‡g·áÈDm] áÅ_P{¾Ü¶ehƒNòïàä>1J‰¾GËɸ‚"âHjpmQœ=öôŒû×ÂÓoªÜ—‚x þlâøF”bx„Ü–N5|yG¦3õ€S­'$Ï@86‡[†»Õ:™Iêv;ùYŠ áÇ >ËÄúäêÕÔ÷U›MÊ\¤IŽx2÷"ªömWb9­ µÝµQQYaЦ¹IO1!ÉÇš(ä³!‡ƒ¼Áä³ÉißX5«m†èPì nùàCŸÓ#!õ®ê ,gä6´¤»í(ðQ ”xfŸAÿ€ùrÈ?ŒÉÍ &Û^Ô•#ͱ 6zsê'&ÑKBa”Í!—ïÊÔ=ë r»5jàmô9æ_òfßq‚,¿ ™àÃ%i¨fÚ> éLËö”»Èpªf5V3"¿µÕ®Ú =`0Æ_ -8¢Ú GOÑŠvUlÝñX6 +¸ XvK¨xòáØp ìgî àtû€ËÊfnp–Š‰dpÜhêP¦îýu€<ìíí»@ŸD©€)­ðˆ_ˆÿÑ z–̲>‰ Zb†W £SåBCÍ7Á9É a£ëè%ýNÙƒ’0Ø1J? U&ÖöíÝ’0°²D~œ°½2ð%7JâU(™†˜?Xôƒp@N^>m±´]Ña«6Tº@õ 3=KP^Ò“%‰qô*`Ï“¾%¨€T³ÉM„‚Å2±äkÙϺçbÓ•M€¾Ü •¦wú—täü Ù‡ |À8æðø³|˜Áâ ç2òuÎLàÙOvž¡m¹éhÔVëRŽN˜°§"·³!¿ã¢“tbMÉc$¶£V~Ð]½[Qÿ 'GL»<_ŸôѺ Ã¥Gw*€çžqÞ—K®GÊD0ˆ žó….Täà)ôÌ@oªÒµŒÿ~ÜvÕaËsjáih<#b° ´æ0¾Ù€ýNŠ'¬õ± ùà> Ú V*‘ iÐUS l¤SKÌ4N÷›†ëÂÇÄ:‘ ±}z¾í Ü{Iê[]êDãðéB(–všMµ˜;$¶wý……¤WæP–®oܽ ló»Šûò]Œ±©ˆ‡Úì.’&D0††w†Æ3ÙaXŸ‘¸rô&ÄVÞ­€<,Ȫö>³.…â|,²0»& h`|^u¢ ,­oð~‚tž§ÔbÒlŒÅ€•j„Nƒ®ä$£û¾ôk+žò¸½HÜ<8†oÑI¨»Õ _šÏ¶”šN\R¦Ê&w¸x-’!…·*ÆgBÃÕÈi{N‚ÛµRÿM\¹: ¢ërÍ•¤Ñ¬4F%ScLЊCSAuÃ{ÝÛúÞ§Óè×Å àþÒí÷ª÷røäÝQðÛ½/B‡£Ê‡dú5!r®›’tŒrSýZÎà¥cS:]X1¾SÁß/CRù̓ÆN”ìÍÀ}+¥iô%ýTL¶UÄ<¾'î»##mP};A;¦Ø]ôø¼Ž—ÿ›ƹ4 j$roõqÏs»>*õåE é·`¿O¥ÜêË|«Ïp«ïŸha”뺦º„Ç»/åâÁŽ_ÉÅ'Ú¼ð [·ZUÝö==Š–n¸Á¸ wŽv1¾7ƒßuôK·äpñj©™Ƀ•îùõ±åïF—²FЈ_Mç±M…]çz*ô€vêet€ ×¯ø£wOŽAOÃ-)÷ÒSçÏî[P ?¡5áÕ‘»½¹ž 9ÙIžŠçâJFO\“¼ÌKWTžB4Y•þNN §Á¿´4ÓýRŠZ¹™š¼pæýUü~œµ»C0 i{é3 lã™ÃD¢ƒÁÆŽ“¨Àp®Š†N~°£ï{#»Cç¯ aëÜ]ªèj3]‚Yº^ ðí ÜE'îÄ·Ü"_à·³­> Ow¬@ÌǤo”Ý ôX}Kã."O|âã“ÛCŽ¢úóöQjÐÛ7tOóÊa'gÏÊb½¬÷àz2ñšæ󒳞4m¦âÐùœk€E+ñš<0.M'U­ð–y“ø–"ä1ze°ÖØr”ãÞÁ¼Æ¦ÕM¬êCy›øÀ§3wïêX£÷±/¹ðí;Z I”®ŽÿòÔ‰Ê^·Gp.‚†?òL$¶Wóóož<ý6pj­¨ÏR‘%ꃮ )BLRšð1î÷Ož¿$d)¤~CW mÙqܶ4ÞÒÅ÷( —”8ÑT¼âvJè~¹Ä®ˆ–w°m€û1¸6`™Í&\ÿôèñÁÜHø1|Øß endstream endobj 774 0 obj << /Length 3460 /Filter /FlateDecode >> stream xÚ½Ùvâ8ö=_Á£9§QY›eõ9ó¤¨.zª’ ¡úLo˜à.°iÛT*?÷J²ÁÆ! ô¼ÄB–¥»oºñ{÷=¿÷ÓÙßgž~öBFžÒ>¡Z÷¦«³ßÿô{3xósÏ'B‡½³nÕAÏeïöì?g“³w˜ßÓD,èMæÕ.œh.{“YïwO’€ô¡Þu¹ˆóþ€‡Â+ʨŒWqÚçÌ+‹þŸ“Ÿß}w¶2$>WpÙƒQ\ræ; {Á9¡œöLÁ7Ü®šg°»PÂ+YÛaÑPo݇u^ ©4l%áÉܱ£ÉpŸn ¨-dZ”Î:àg>QJ>~Hl}ðCA8UMð¯Ç?_~;ŸŒ®¯öÑaÍýšUë<ùÖ—ÒÙ±y¶)ãÂñ±Ù‚øí€R¢¥<ˆ4åΕ=%a48iÊ ˜0[ù€¼9öËÕè—áø¶ƒo¤¢²0 Cï~™ÝEËå#þÒÞ·¤Hî–±}eQÍL{“ERØ5QYæÉݦt«ªé4+ÝDŠb^Æù:Ëxf'ïú v|1¿·#$¨ùx¥Õ:xxnëM‚÷J€ó&…Ë soå_q´åÎæ‰ú¸` B±}1‹çÑfYÚ–çË{g¨ƒƒ4~èغèybŠgd^ø”ø §‚%ò”Ÿù¡ÙÊسܧ`*xiغw@zvå9à„I°|&q?IÒ²ËP…„ Zm ŸÇyœNãÖþ Å# ¥MNÞl¿3Îæ–èeÅ+C}Ã@áýÒ9°*™µ8ç˜åî€v9’K÷å¾ôoc÷Úí-¼)Jë"Z—±ãydeŽÜž¤÷î³Ô£ °=HC&ˆöGB‡f²î¢ (¯_[úyž­ÐŽúD7I7i(·(=,‹U Õ¼O-÷k9’eyrŸ¤‘ÑU#ýy9vÁ‹±»xnWñwÇ‚E¶¶0¯#ƒØWü—Åê3»`SlYe,V½À¾/Ùféð¬mSùÜ5ÊgÊŒ¼šÇØF`ŸÜ7ñJ­)˜¯§‰1ˆÏžbu­6VQøVQ쾈Ö4[Ú)+ ª% ¢Ô’à(;Û™¬ÖVò–lK:Ž£Ù KÁu@´õzJÅéfÕeG5 Àƒ;:Ù&?hMàÕ‚ÀÊIâÃ"B¹ ƒšÊ‘¦,®0(3#02Ô eSñq… Uö'ð©wƒR’ÎOâÛ­ ú± !ð]2ÔFãÉmG(¤CPÞ“ÛJ}œ_ DIf¶ `+sèû/Ÿ?ÿÚÊAà%kë݈=º> 9; èbz ßN €»Ü‡SÂCöìA—~HXxÐ%ÈŸh}tõq8M:@GÈ‚úç³ i:‘  [>蔄”Aûü¨€2 ™n¥|áDgøËèrøú+ qÉžöPÂqAö­ì4Ïe`Á)Îeêhûþo4c âLªO»[+Uöñðýh<¼œ<B¾ z. {Dët<ô\„DiÚ‚~t³8…35=ð,4'\ƒ…V¬ øõí͇ ‡±#F€¹ …:ä‚Ã8”Ý·N (‘§¡—„ §ŽÎ;øìÉg¡5ø„“˜Sé3ð â%Ô’ =?É©hÄiK-†ÿÐ'¤‹žÚÉhžÄÁVJèC„£hÀ—žâT öM6º±·h%DïaxØõiI¨ O8Xüj@~ñÓ› áó€30'‚ž„Ï Ì ¤çMÀoF7÷ˆ*B~8Èfæ…ô$‡p:áÉÏ/†Ÿž²ÙË*/ ²®è¥iT”/M“*5v dG¥)L¯ë|˜¦Xr¹ÉsÈqÁ²O½Ç® Z¾Ü¾+Üb’€QCËäÇÑ…`@k€¨a ë¢×åùmWœ­aQ³Ä‹È¦Y¾ÂlmT'ø‚‡Dhu ðĆ—Mð?ù4ýsàcÊåƒî|I¡¡j‚~õk7ðრi«è,—e%SÂ6E–ª ]`æ›r“» L]p¾Ë³h†Êüƒ+n£fn–ebܬ5EsS¨4…öÇí+ÍX›tÏ ÿ§J4³øÕ–gÒ27”ÚJw‹ãë/“á¸Ã† #j íT+m½³F’âm#âš‚ÅŽ±žÀà~´»3¥°,¯?±EãÎÈËVhÜZ‘ßû§#?¡(aJ"òí|ˆŽgÓ’HÁš7xÔÞZ!ʈ#þF²à/a©òfIOËåã`š¥)ŒP=ñu'øÐ7‚ï»/f!=àR–ñ˜Ò§ ^‘J•]z»zs>ù¸OP|ÆùIj#²ŽÊ…#ÃVÏ:ÝxGw!^à ´aì$ü‡­(sªqñéüò߯?uˆ€„í©hyxÙa*`Ò¨¸|«.Ê)’¥3xŠËfI15wì—Š0f?0}× ÈÁ%ø¥ I/WãáùåÇó‹Nz(“tö«¾>¿àÈNz øW{ðߌ¯?Ž.ºÊ¢h`Ã'˜i®|Ô3±Äon†9–×yØtÆÛ[¶ëŽ™¹3F±ÜÀ(Oc·è!)v4ºü|cG‹ÌúUæmÒ<ŽÜ=¡­úÃä»öúh¶JÒ¤(sЪoFôŒLÁ›už-’»Ä]¢PÐG€ .Šè¾á­/Á¡#N~Séñ„ƒ"½G5Nÿ®º§4~Þ]\uFê'éügœN °­‚²ã’;AXÀÌVŒ²gUùE!ánnÚ¥z>‡tŒ|1œÖ€þ ê> e-½ ¼`„ùÏø&ÕI0@W¥ƒ& ´«»/LS9¤½ÂèÜëo>“¹¹¾|ÝÕ畽ñ •áiÃBœØ”÷™ hàWÝ{2¦öÂNz·IúÕ¾­›8`Œ¡à2±.ÂÎÜ-¥YdË”Kø~­ùx} ‘•»ò3‚yVšmúÌŒÎaÐtºz]w °5®þæ Á™ÃA›ÙWQQ¸;ÞÄ^Úã:kÁð5f…àÚ+²Îh7 ÞçÇ^t¥¶gC®’:`±WŒWk[8°ÓNÌ+zàä¦êDÀ_UG‘±Ü`ˆP´a¼1cyE—J2OÒYüýu-*#ó œi»SðiDÐLÔ"ˆ¿Ú"(¨ðn‹2^á{ŒšÅÕÊYåŽö¶¶/p}×~Ÿ#Gw\¼m™U¾‰#ÛáÕÈN­¢Ò u‚YÂ=BðC—ˆ.2ÃþߌÆ=%J%…w–Ü/\Â…S[7…¿™‡Ùœý® ¼š‚†aú.W™ÕxÑ’Ø@õ7CÓ¹b×'îT+’[˜µØJZkŽ­Nàë À‹`uR4ëBwÇ–ðÝL“ç‘Yõkdô~ÝhSˆ>ãå4ø‘£âl»Þ8Lßa¿ŠA§‡,3ÅëZÖÕ•¢¥—­‘‹¦°¦ån“ þ,mKŒL§×b'¬YW&Ñ.L‡gáÊÓdþ趴ÐËȶŠí,·þ¶5yœ²2›™Æ@í:qqP{€L3+]8Ä.Æ.EhÚg›eã#µÁžª¦×FRw{ppÖ‘Ö~¸¥ þlø¡®NZˆ+TqdÅzÞ5€‹ÅVe¼ÐÕZ5p2¦ÍVJ7$£ãIàS«‰p2w5fÔ¨HJy£Ò¾@-Ƨe¼¡Q”˜V˜RŽ1oÎM@H¤šìÀÛ Û!hz@Aª²Õ:ªŠiµâZi„™Jf »Ú~U‰`Æ!ÊwJhya o Û0(·y#õ–F^PÊêèÝbfNw‡DË"«zÒªàöVÉž¼m–í+m‹^ü}¯ «ê|µt65Áªûq¯·UTö´ÕÛ*ê¯ù^ù¦hU~ÄL¸ßG›nL eŠ³k˜úW½ñ` rÓ¸Kî8Š¿'Ei‡E¶r¯]jƒ­¦»Þy³C¥%…ý½ÓÒh^W'Íâb í3;—¤öi4 ¦YžÇî˜,µ3 ‡U|Xêü‹ÓYn<5ÕbÅžjlfä[mçÈ#|]ÿÿlB!/­þÿ@Éÿ? ÿ[à­o´ºûæÙriÝ®óD;ÿÊ€bÝìsÅ.¨}f²ÄõÇCÉoòì[”'&ªíÛÁÐ:!û—£‚zò¾ä4?ä<¤!A»I>nô_;X2Y,ï]J¶º~Ûî·UÄì(jGÓi¼v˜Š'»sþê2ƪmHüHH í¿wP§™ÐVÔiï(HÒþyˆzø¿´UF?·˜¸^gNTû­ž®\`ÿQ%3ñ ö0š{=û&w†³NãšÜÖ’p&öjÜ0k"·¹E“9Õ\×ÿÓYÞ endstream endobj 710 0 obj << /Type /ObjStm /N 100 /First 872 /Length 1300 /Filter /FlateDecode >> stream xÚ­XÁn7½ë+xlår8ò08 Œh N€¶†®£¤F)e$ýû¾Y[rË5­îÁ^îîããã ù8+mRЖƒ.ªâ"rŵ2«!SÁÕB.þ¾†Üü} ,)XJkžY¢ Yp6U\9”Tq•PŠãJ(É8ØqÔL&\[0ÍAk 5ñÌ(‡–'èIN ”´ ¡ˆ@I†FqLE£9¦A<ƒ5'4ìššw.b…Ð̪ ¤$â`0Ku0˜ ;ÌÅÀŒHbË`ÖxM>Yc0›wg0[­3c0WïŽùQõî æ†4Q+sCüŒÇää†Fżp“! BC1–ä3ÉÌ„Ñ(>w¼ÊH‰ ÒÁÕ1yÁcð¨5D7dŸ¿!êÙCjªÏ±ÊÕ%`ªK.‚lB²‚®¹b ÂÉC,'W\ W\j`rÅSX‘ûì¹QBóŽá˜ˆ¡‚Ù󮂆'ñÄ#…,žy๠u†Á¹¨c1‚&'ÆŠ)V «OÓ»#ä38›!†ZrL ’|ù€T’i††‰ äƒ".Bøg5a™úz«¾^¡Ò0%WFûWAû#+"ȘacˆŒÝÁ\Æî`.>cˆõEÜÀ¬Þ»J|û˜o,$|vp0^†ŸG oÂðëo¿£sô…®WŸ>Ξ=Û ¤dÑ7 â=Cÿ ®9ú–ãèÛm"äF€V‚…ó8­JÚ3~©%¤§Y4jî¼E¤º)µE¥N–Òú82WŽR{f”™"vy’Ôb‘.dFªêdÈMæa¶iªµÚžÀ£åbÂpäîí4v9‚XxÜu;»òÍ \ ƹ¹¯Â0nn`͘߀{x½ZžÏ×á$ ¯_…áíüë:l‡}û÷ç9^œ}œÏ†0_¬/áVã(³áÍüryµ:Ÿ_ŽÞ;>úeþþâìùòk8q‰¥•›ÅŒ{ù£­@?–~?Òn£@ïÿ;ÀÇöÿ]ÖqWKŠ”¥™9*S*´õ QNÄ”­YòNCÙd…º9E?G¢‰j=:aóÑ+‹$t2óTÈMêqHb™ÔZÁôý\¹ 8'˜{Öc•–Ü+÷ÔR»™¢—¥#³¶ˆ²¦ ÷mÖÅ™:ëTÈ­§Â©ô€ûEëÊ~r+ ×ÈÚ³VkŠIdOà“MýÖÇ÷µn©÷¬ûú0xªu‡‹ÅŒ'c•í’¾y|?ž/Wïç«‘2? ¯†¸Átê"ΡÞÝÞ?ˆª½‰=ÊVMQRv|õÇ”ÃÏ‹¿†Ãƒƒq€áð|}±\ Çû7¯üï»?×ëÏ?×/_âêÃù˜Íz¹ŠËÕÇábña9àj/þ"ÿ•§Í±øXÙyxíú†3‡K²À!vT]÷‘J-6•I‘¨Ž¢JžéQ© wlÖ%©†xÖi‘ðÑ–mR$×SšiˆR23*ø®È?‰ã®+žîâš{²Iˆ§íø&ÙykÌ­s‰•H»Šý­ÆbíÉ6lêüo<ý¶¸jß×íMî¹½åÿY¨wêw€×µ7ª_ÍS!·ÅΑX{h*Ô÷Cn?þêêÒ#@ •í.×Þ¹P®ÌZ˜O…Ü È¥u |Y$ž ¹ý høf¦þcI¥¼òp±æ endstream endobj 822 0 obj << /Length 564 /Filter /FlateDecode >> stream xÚTMs›0½ó+t3EÑ Mo™6æÒ6%'×Çȶ:;âößwAÂëéI«ÕÛÝ·o¡h‹(ú½F VŠRœ(”kJ˜Öh½KŠJ¸yD”H­ÐiðÛ#™)X+ô=úÝÑݧHñ ›E-RT”hS’‘8QZâ/íθ8Jâ¦]µfoêXpÜ6ñ²x¼{P™*BE Î{—ˆ†¤Çb‹É£d|•ðŒÂ¿u¦í\íC°|â.2’1>†0¿ŽndžPÂÉi6¬: ¥=ýêçúzŽÈ©³ËÆöÀŒ8ê7¯;ç€ ®pëo6]½ní¡~wá8Ú½ÙÔeãw«vt´÷<Æ À¬G%åιTP/O¡^°ñPïÑÙº åÊi)a)kùé=fpœäƒlþÂüG.¡$9#-®€¤ÜÃ}OUª$BÈ0! Wg÷åMP ¢VA™ñÕ2›žZ…·ö­?B߆cØ4 4§y©P»ÆlºÊßîW¶®~÷ûŸv¶2Þ\š—n»µõÖP&«Ö¸¦Hr èûV´$L²k«‹zåYuoqšá•³+¨!ïeÖgR•˜PQ}hýRØÛƶGE‰àŠ=Ÿ‡ I+[›Ûò‚.êaœ&òzílûb]y£ çg“¨E¬@ö!¹ ýûÏOˆß>ƒ‰aÏz>íL• ѳ÷æÐ`ã •ð%WÿD‹èFÆQ7 endstream endobj 837 0 obj << /Length 2165 /Filter /FlateDecode >> stream xڵˎÛFòî¯|¢€Í7E¯áCìxá °kZ$@’C‹lIŒ)’é&=66ù÷­9$ÅO{uWWUW×»8Þæ¼ñ6æÉïw‡g/ÞùÙ&ðÜ$ âÍá´Ùî~“&¾ï“Í¡Øüì¼¹¨¶Óf» ÓØI^nw±ç9LÓ5ò¼©ìö×Ã?ˆ‘¹a”ÈÈÛì"Ïõ¼¹$®¿Ýù~;ß©#êêÌw³8È‚vû‘l$|_o¬3|oÑç]ÙÔÌc¿ÉÜ, ’ƒçÆaĽÝQÊ÷{¼—ö­Ùú½€ð †þâÅòùÀÊÛ|Ú «ž»ï¶€þ†‘?H™ ÀÀçÓÒò¯âŸŠojÚBŸñOSe}æó¢´ªs½£wáÓô݈՚…ȉÓ]T7¿Ñ4ÇÞ LÕ/ô/žŸä¥®‘}‡b£ªHõbiÖOÓ]¶`º½SÖø›:!•ùÊÐûÒè‚—µî×=½Ä|² ¥ 虢ÒVŽ¯Ú^ÖÉÝí.I2±SJv"6B˜7 œ¶ëUU‰(¬¨A0[^ÛJϯ.;;{hÌmZö£È…va±Øa;Ï#Ý!lí9•‚‹l Pè“ê+ÁAÅѹg¶w1X§éÏF·ÍU¯â {ˇ,]cmy¬4©œµ˜KAÜV^—+«‘S‚|°ðˆf>cÿx)Ik)„Ö…Á,Tð`átˆBVI1 •@À{sÔ×'Þb •®vï0a$ T͹2d1@a;7(a^úþÃçˆWìI@ „A €Ùi¤ ‰&ð³x‡UW=á°¢«Î¨ÚŠ¾M‡±KòB–zÿñ-3i¶4äxÀ<í*@ËhM=œÊõS±m´àí,ïi!å Ýµ A°3çŸ #--¡¿tº¶à1r«Â$¶ê3uÏŠ"Ï9ö(…ŸÉíþ~x(€fâ–gÓùh|–åKi…Ë}IɉAŽ+Z¥…EEö™±²Ì¢·”É&dó7zš~åQ÷eU±gK†ŒgŒÆhÞŽÜÒUgmÑ´+ÞOÕñ¦ŠÆýÂåé¢o<‘ Kùe½cÞ3q$:dUµÅK£3ÇéJi ±¢¥1Òøf‘N¾Ugµ0õÀ?Û1,ƒjrIß9WÍQ ÚMÖB„¦û"†j•éxy2Í•1 Z=p ^™Øs:¹n Cð ÃÇ3+Ø;\…ìÈ(R§,õZtÖ=5UEyâžÜUÏ”dEŒ¡åI‰sR¹PÞ&jÊ“_Îjÿðûâ]N4& úÐݧËDO"ŸŠÁpGuÔ²üùU éêõ¯¼û½'òÝ},»DÄW‹}«:ØׯoØ„óbß}mTÒÿÊôë¿­©Ò|ÉŒ8"¨ûëQ›uÄ‹FUIöYUO êÛBuú/“µyŠLÝFÊ+eí…ÍÛLj’9QkÊÆ”Ý×'Üc„äØŸNèÂO¬Òõ3é7 ò‹Î? MYËê•…<œ_„b7³¶Ðý9=[8ÔŸóv7xì~é(ÜúqfŠ&.n}¾Çø¿1Æ,7MÒaì§×ÎÓ&:?‰ær.ÜtD¸†|)½\^bœjÁâJéÂ|ŒQ×ùUÈ`žIái?JW‹Ì £‰˜Ôi`UN&X ¾–aÊhfIÖ…Y^±:­ù‹®JlË°8ÙÐ9gÐÙa%ô†é=ô™x*†ð1a}ÞƱC šàôRž!“.™+>¬5œ"µtý½––Ñfox_Í ÞEQ[Š@uÂÉp­Ã¦n(yú ‡ôxUX¾qKr÷WÔ¡tû†Ñ±;ÂßçôÊç¼i‡Î-F £¶qQAbrQžÀùWÍ ‡‘w³´NU$N-~›ýÐüñŽL)’B£q·öxVµ?´x ×÷‡ŸÂA‹«ß¡q.ÙGÛ®¼Žm6¹¬íºü½× bÃÐEéᆆ¡®¶}'·ÉµØžt¦Ì…ˆúNâ8I k˜9óiÿ¬‹µLØŒó*ÀÞššt?×-X!†ÓÃxºx‚¤…ƒÕÙ¨B¦9Ü‚Å•xñˆ/ÀßáÄî¢k^ͬH3… %qŽ²†Š;,í0L×Ü @>ÆÖšÖWi/¡ùQ×}û¢hPq÷c³)R—öÊ”$sc3]1Í? B·À$E±ó–cýåJ £ÔÍÒhšH‹Û^/€Î0ö$w‘fg wa–¹^èƒ>2w³Zω>õ2nâg¨S¥pÐpê%k)<ô“•´ú±˜Ž?þÄ¿ÜtàŠ9EYz^fÒÎÃ!¹ŒA€pñ>XGýŽ„OÁGܹâªå…›@‚íõÀË5’ª5Zq„Bƒ¨×²¼à(¡¿tµyzë~¹i8úUç[ðÜ,˜¸8VŽ…Qq‚«Ø¿ÈÛ²dèÍÂQ£Û¼‰ç;ùtFÉöqO pþHž¶Ö,Þº]ºw#ÐìÓÜ.Ý8ÊææxS&ièêDþ $ˆâ‹L~òm¨ä™¼ ìï+Òt¬ä#5d‡‡ZA±_9eg½›Ï€VCÉ-ìh¬ÓÄJÑåQEGnFq7Ñój{}«è}è&û'+zï¦éÿCÑ8ÿŸúªâ/©œh ß Šœk±µE¬6¯ò:СxÞÌÍ%Æÿºzi ¹Uç<c[¿}‡¦ÿ™5Ý ŠW“føÐ÷âÚBÌåÝà€ü÷ÛÓ-Mó¢f`0~øÔƒ’æ’áKH4ù¦9~»xœÁêI’IžPÂÂN&nÉúyæ±á}ùi?Á§Î›¹™ åE®Å ÿ}xòy'gHßžýù”“ endstream endobj 868 0 obj << /Length 2481 /Filter /FlateDecode >> stream xڵ˒ÛÆñ¾_ÁÚ\ÀD„ð&aUÞh¥’+)+ÚMr]©!0$ÆƃÆÚÝÄþ÷ô €¥£(©œ0ÓÓÓÓÓïx«ãÊ[½½úéʇ¯·òW»ÀÝ­¶©çúiºÊª«ß{«V¾Yyn”îV„W­¢dßruwõç«›û«—oo•ºi$«ûÃ@%tÓ0^Ýç«Nâîz³K#çæÍëõ÷÷ß¼|³›lˆâë…[ IØA„(Wž°7|á”p²i3ìÚ[†¼·{\oâ v²RYË'ùÑô(ßÝEÁpÒŒ1£¸[º!ä6;] xnøŸ£2^èÔš¦5Ý“PÚNùÙºÞ6ë¾Ú¯cßÑíLsim@?Q’¬6¾ï¦±Hø¾ÐV¯7‘:Í©3MmybOkK¾“™ÃB§+÷~½ƒ w/_›ï@Y‰Í(3X6™Î¿G]ëVul7©„´…4œÏ}í( ªŒ¡F)6FˆÐá{hÕ±Ò5è±í;h6Iâ@˜½`gIœº!×u=fš}t;øuòÌ&a l’×Àc2@ôÐp°zX8[= Oͦ[’á„íçNà½p›b;ì¾p¯éYÀ¸íÂðW b'—N‰„_äÓÀ6q‚ííY¡³ÅLýã%/غq8z}0]Vü;7 Ñÿ\5ˆ"Çê„$’âT¨6Àk¨V Ä£ƒá ¦²8Ü×ëÐwº®5ûAèsW&¡’ȷΣ»GÍ™Ãw~èmÇ£¦ÖV.ûL›(LÜÄ_³QªRãÔï %»UõQä 8òŬ¤225)olX†¦ ‰ã0FÏ¿hRÞscŠÄ˜nñÒš†‰V<ôM×dM)­é€†ÿ$_‘žtî0õ˜[ñÛo¯Ÿm ñÓIð ¦W„¸¹„ùË«‹^º8ô¡Tµwýb2ó¿‡R[ûêRø.tY6ŒG§~R"ÿ"gícÖ ÷!XÖÿ|³N¼ë3ÝÔgÄß0W”8ª¤c-rPŒµNÐ}GÅæ_ñäoìhÇ¡@ƒiÈîIBœ‚úALv 胶éÛA¿çχû»¿¿¾ýë»?Ürm°Ÿþì–›¯onÿˆ;¦±p¥_ÎŽ¹a”pî@ c×Ø…(Ž>>Q= A ³ÝùIË—ïjJ4ØÃ7ï3ªæ?›nLB¸¨Ò I7Ô9´’…szJAøkÝ1"fs\JëTÝÀ—ºÄPw‰B—ÁÆÛ‹Ið/x˜IÇêE“fà–,ä —¯<£äMËRwRõDb‡ó6T 쥴Ԝ¬`Ö×cɪJdÂ÷Á¨¬œÆ¥„‡a”ŽÝ,9xµÒÔ ²ä„Ï_4=Ú«<²–^H#[˜5)H ¯,Žeo 7ŸÅ³r4©_Fw¦vuîÎ\󌛸1Î?Û´ãîRB¡>d4ti¶³<£Ç]øVw±ç‰¨«Ë¥3”@Å<®ŒDìðÄ°%Ù&έDÀ´8'‘#•@A‡© 'ûy”DÐIñkÒR"Rªø(„j]Ke<‚¿]c£&ïs”[~ LÆ¥sÕ¯'eÿà8ƒ" ñ’­,[«  “ÌÚFš€Å;äØ;È)Ôºñ“p0ˆáœm§—©£ž‰§üPäaõ\ç¥à2âÈVc³é‹Çþ ONú£…<dÐþò;þ¨… ®Äå³Ð<|`ø©×V£î¿\_àpÜ/•Üпü éò endstream endobj 819 0 obj << /Type /ObjStm /N 100 /First 868 /Length 1371 /Filter /FlateDecode >> stream xÚ­XÛn7}×Wð1)P.çBrXœn´@`§@[F)$ýûžÙZR\Û5+ïƒL.÷Ì™ ‡œY×&!…Ú4hƃU %7Œ5PUŒ˜ Æ8[°”‚$ÁHA f‰ƒXÖTÏ`ƒœ¥2ä,• a¬¡ŒrÊ(×Bq}Ð uF0¤Fþ“™¨röy0˜b¤¡)Ö(‡f 5%?ÁÎ4JZ ¼VÆÄe™àŠÛÂHj™k …„qƤ€”Ý.OVƒ'L‚YTÌ’0©Àà*ô¥Z0x…ÌLÀÓ’¿’À &¸æ‘ Ìê  * K ‹,>( Y3° °6ðÂ"ÎâàŒIup \Ü­˜¸ Mû` æê>€‚«œÁìY³¹ÌòÌ2˜[®c˜%¹x.˜Œâ“QÜ‚‡ 7L\ú„± †=v툢ˆ‹ÁDufE1ñ0ë Ÿø&0ç ¥pI*r°*hpMAöΰ‘š<>P¬”lfØL%ÒFiÌØ”Åy*&ˆµUóD!t /Hu ¯&€aT]›‚¤¯ù!pqsqíð_‹§²T«§ˆ™§öxL´âÁGõ4± î‰5hhcÎBCËyvp0^†ÓZý¨‡á—_ó|ÕÏ…Xô”\|úðálöìÙ`ãh8IáæTÈÚ46xõ0­ŠDFÐ'Bn  ‘–´RkTÓ©$·¨¸ò:h™bi:rk@Œ=elÖÄHnѦF’F?º#ÉJ´Ò|ª)úA›¹ >©E?Ù´§P›&Bn D ë\£ØÅ&´/òh¹X‡ƒƒ0yÅÂu5ÊûìŸ9{}º&;òªŠúrý€Bˆ«îúew©?€{x½Z^œÌ×á4 ¯_…áÍüË:lÕ¾ùëã/ÎßÏgà ˜0_¬¯`%»øl8ž_-?­.æWc—~š¿½<¾üN}!7\cÍ£hí ÚÎW ^ã¾ ƒ×úm4GoTÚÛyp¸Ù†Zrlw¤ì ðÜš9&›¸U”I­K=¥HFS!7”–"çÒA[J‰šh_äãÒðñ™'õVæIÞ'ó†ÃÅb ÆÓ±ás“þ¥y|?ž/Woç«‘2 ? ¯†x@yæF\Àz¿°J`©¨hžÑlG"oŽ%æìªO>ý¾çðãåâÏáðà`Ô0^¬/—‹ádøùø•ÿžü±^ün>þWï.¾…;ëå*.Wï‡ËŻ倵B\žÂʯ¶ mënÛè?ŽÍ à˜`gFrRj,*=H¢X©v ‹µHzÒ"sž™Q¸jiÓ"+ú&"¢+ïAJ‰Òº´ãº¨ÂHa†G2r×y#ÖCËâG“§Bn `ª±QOF!ï¢\M„ÜöU#’ÚrÏu½r× qíŠW\y*ä®JÑ¿u¦Å©*¼/pW„n46÷¡]ݹQ‘ö-BÅn¡R[„Æ•ñkúþbt]HÂXIî®M4>ljSÖQ—ÐÌøÆàâA:7o—ði°Ã1Ž'aø~ùf°O®æc]ú&²ÐÓ°+63„P•Ü|0g|[£o»¶ëÙáYRjg¯ø5ðÁ^ñkðuÝk°–¦Bn ÀµJR:h‹i”»ÎÓ~Èm·ˆÎN´ËìS¾«òï‡Üà÷Dδ b]ÈŠÈ=Ne.‘Kí@jƒ½Ü“Šf¯Z°PÔžäc­1—61’c¦3™ÍÏá# úê:(%©+š·½ø endstream endobj 900 0 obj << /Length 2354 /Filter /FlateDecode >> stream xÚÝXK“Ûƾï¯@ùV-±fðJTªÒ:^•œÄV¬Må°Ö†KX 㱫­Øÿ=ý ´J|Ê…œééîéé×|׺·\ëõůü»–gž[Qâ:^’XÙþâî½kå°ò½å::‰­GâÛ[:Œá¿´Þ]üãâúöâêÆw­ÄIB?´n·£å$*°nsëÎßY­ãDÛ×7Y½¿ýþê&žè v\Jâöd¹pÅr™¬gV.nëá~ÇD“c\ˆõ16j‰ìzɦ4LúçþˆV]aî‡vL|XõY$ss•a;à *¶_•Øì‘\‘£™½Œ´Ç±JQñÜWHÂ[ˆílE`Ü×]ÏÊêj±~g™5fÜÐ?–Ú"wWm7)»G/™ÈµN½—o©Ó´N%c!IžªtO=æ]=´™Å“²Y:ç°Gm:¡iÁaZ‡ö߸„†²åS×sÞIy hÜ ÛÓX+Ût(E·X³)džãM¦L;3>Z/¹M¬÷õ!CÐbœ¶rr¡TãD¨o^ýð Gš]”Ä9S1PĈ]'^à¯Ã PßTkíŠ-³>¡\=ðäñ-ôŽLt4-˜P£[6ÇÊìX€ã‚\Y½o u7E ¾ oÅʾ\L—Ò¤D.㲋˜¯&P,HœÐMF$v‡Ì® >W•é¯ŠæAõœïn'°ÑñEÚ ýØm'ÀQM€£r@ßØCœ8:>¢j’ÂóûÛ“>v†±!|× ”žv×_h€®‡Ä®è¨7Ë>-*jW0®·ÌAe åX@j6Ô]aQ®³usþSì hQÛçËgæˆtsPåI‹êz7Þ„l3Ø'IAÕqH¨:–› Gxó†ÄÖü:˜Ža{ .†Á±÷¥%!b e€n®À×6¶#¤²¦`âÜQÙ¶­÷<¢^Lè"$0n_(Ü™[{È¿Á2§gŽJÆSঠ`ÍÔ¼há%C ¦T0%;`ZȲ€û<¶‘NØ].4º‚§ü±+•Äñ<Ë ÍéàÀx’h¿>І©EF.ç‡Hb×B¶‹îXc­±ž{åÃÈg¯.$J«ŒciãñáQ…p# ñYXš…S{qè„7fÙ¾«›…ç«v"W/š·#¤ÿC7ÚDˆ‡2BÅSÛ¨DåÓu#çÿ™vrŽ¯ïø5¬¾9à_‚‘L¾ àêáf€ žš\œÑtóP;¡7ï‹ýBÏò•sìmP,œå€yª%ߌ"üf„;íRÙ’ƒŒÈV,ägQ²Ã·\‚;až}rBÂUý§…3ø¡KÁ +€Ôç‘€†;‰{Ò:Q§§-‹èúe©Ù;Qxˆè~ItczÏÖ1t I1SAÏ ï¨~Çï;L:¸f[¸ ±s*tÿøFÌäO@TùôM­ÐP=Åâ’zª#ˆÍ¼xùqB„CÐÇç9oäÏ«€@¬Ûœzµ&AêÆ«Ê ãpJ˜ ÷-ËBNäÌîãÿ)F ´Å7yðÑ[/ȇÕFƒ»JÌË÷<û7¢='Öþ釋Ãm‰Œ/NæðŒ€yõòL:½xí!+^`Q½üóR£Ù£Ç§ýÈÿ_/Ù­d‘—æ¿¥ ¾) .±B¥pŠ#ÅÃèÆŠ;Û-ëäOkÇÏj(Pò{6sGŸÜžÍ~·7@Êzè$>˜'#y²Ïƒßº]ê-jÃ3=Bj3ë7/zó±ùÍW°~2mÆìË?éVÑ{o*ÓR;D>FʼCÔO3¶üE‘4Ë  Ž¯Ùe*òù=ä´ÏÔ»¬k½Tv¿ym)¡ Xþ¯þ¿tðÅ‚þŒ¿ÏÚ÷w·ÿ”) endstream endobj 920 0 obj << /Length 3169 /Filter /FlateDecode >> stream xÚ½˒ܶñ¾_1åK8U»Á7—Š-•]G‘öવ³›CŽIή÷O¿€!9܇WNÄ£Ñh4ú «ÛU°zwñÇ…‚o°R«<ôóUV¾*ŠUµ¿¸ù¬60óÓ*ðã"_ÝÜ~§9|ëÕÇ‹_¼¹¾xõ6 V…_¤aººÞZ,‘_DÉêz³ºñR?ô×Wy{oÞ~¿þtýÓ«·ùhAœä~e€’ ÃA.!°G#à«(Gú’ÕU˜Á`ÄkmnwŸÛn}•„‰÷9¼æÖÍFßqë›ïL3èn[Vúõ7Ÿd¶n«²>­±Ãûc=˜]{™þÞ Õîõ§¿#]««Xùy®®”ò‹DNøŸ É@d ôE¾ Ï»½ùô*( ý(ˆìéëDyåà ÃNN¥~šÅöærJü´PÄ÷ý4…¯ÒÄ‚|$ñ£H¶KÛ~¨B ÑÓ6ý¦(ó£ÔQ|;»Ú±\)à„*â)glÖaîYî]Eqèmô¯ŠÃ[ÒPY×í:̼{î-{¸BX­+³}àK(u¶(0§û~„¬ï[ZW™rÐØ ð±B’¤g„¾õ•òºµò˜LåY\ÍÆRØ QûW<0rØ”[µŒ­¬Wq˜>‚=†“ÒÑ2f*ƒ éŠçä sYzµ®£Žw·¢ì@NoÜLX<ä¢â× €M¥™§ôSWµû}+”òžÜ&¾b£äÏFÉjä$÷úª3#ðv;áEbUfrñHèõ‚–y?·ƒL »rà–å`Wv8’“,0Œf™ØÑ5ܦ5*fŠ¦˜1gšfj<–ÞDùQXXÀ™ˆ ~þ!“vèZ¤ŽÈ®ûK6/‘ ý0M§Ì@» ÂS¸%9.á¡{â5nΘpÇ7±¹Ñr8‚pÔÝ ´‹âÇ÷øÍÑ„ƒH:¨³³€mŽ‚D"Pe¶cæB„¹  ¨Øq3Ü–!Øn±óPo~£¯f©WK”»DY†´ç±çsçÍmôVbèð5ÁìÒeÀ<ÛÂ~` “C<ΊãZqëbИãùóÌ;6r‘ã½Ü­à¨é‰b´œ¦ì—Âí±u†“Åq"1%KƔؚ°úx'ãÞ ÔÄhOï„¥4’|ãI·À2èLú8‡üèŽz¶AÅh™òl~}ŠÛËnp¿dé?¢—¸.ÔA9YÀVøQæ¬ûÔO3~H@£E—VçÛ§Ý]Ꙇ öÝ¢™ú»Áìõ“ÆrÐ4[°å±Š!øíA¦0,Q`È0F¸[' ]¦.?›Ú ¢ôJá>|9íPtù©ƒA2Í-OBB³ãÖYΉKXãGX⓼ãüg¤àÛ"a4S±{áE ì ²q»¤ò|:00”;!ê0³ÀCIf’=Å€Ç(%¥IQn¢º¬Âm¥©bÉ3JH‹x(NæwºKfwIH•‰&r^’Óµ5'‘´»°ÚgþHìÃQðå‚„Æè×OÅÞHHgÇ'œéþäpb*\cqÁôðyˆ“l¼!ážÅ+?O]‚ºÜk©€ˆ­‡+Ž:×NŽzTè…Œý"Àö RÍص˜:[¦p•=œ¶Êøš íVàvºgr¥ ¢ “|)2è­#¿Õ™|EgÙµ|=Ï#?Í“—êy‚qc1%Z¸§’÷P{¦¶¼çQö@ $¶ç{øð CHfì’%65z3·¶3.Q,ïø-QM›öØTä4`„n¿’’a{ÉÃ*Š¨`±äÆ~¼˜«HÚa^0µÙ›ax-„W“›e݇V·ºÑ”ÍÆÑ]uRbœñ¿ßsDñ-öbO¼xßÿ¢3üÿD'Ìc':Ø>åH/O°f(DÁÑë_øëB4—„å%,â±¼ Ôˆs¬|'DÊ–¿£;Á.§& ü5%´znó$M‘Ui”¤”Õ¹éK?‰ò3Ó×½Äô%E~²«…°^åZ3gjb”Û˜N¥6¦£…¬q©xðú( V­î¤R %ÝZ4ÖôAl¡¢tU>žÐÑšãáR”YxozQ3—èÈÕõS‘mPœoHs^ìY²qzï¨êm6eH1ËÏJ8WÉ@bØçt²H`—X”òeDN•2÷ õb¥L±dQœ½î´Ý†Òâ‚­)‰•Ã¡#ÖŒ ¬¢Š1Î ] êšVHÿØå‹Fáª]hi¤ˆÉóÎmÓvl8`ä7ƒïe'zJþ4­:sEÆQ¬QcúÞÒ;ÏÎNOà³d©Üô®„c±ËÉkŽ’× ” _=ªºì8¯ƒ›œ“È$°O|„„žø …r!kK v±½G ±L!. LÅOcØt%Ú L¤;©Þ QBœ.åKïR6Ó¾ åL<ìb\›|y8{(ÝÝÒÿò?ÂYAûÑgöÔ/¢Ùûâ;ò(J éœdù8ÁRkæ!Ç•ÜO76Ü­ØÜžÇt¦¸ŒÒ´ê-ó6›™#t¯ƒT:o¸V‚S×Xì:ó^ˆº•w‹N[#Ï ®'c)w£}~œ•0>+Fa|0)mcŸ ë ‰¸ð¬ û±èøÁ“Ç÷RÑäƒix{]6²#K8áßÉâ®=’Ráà†iæPÁBÓCAVØl懞ØG\0p÷(åkë%Þ•6ǃèÈðÛ¯u8ßm×îg©¢°—4À0_ÏÝÆôȸ¯xÖ*€¾Œ­r£ÝnœÇåÝ¡±ãgyYÀK£ð"D9-=аþŠ‘Ä¢ÞËé+ È[m#̵ÁµãÏÒÃ; »,ä¯áIoö‡úK¹ò_2kîü„> stream xÚ­Ërã¸ñî¯PÍe©ÔˆË'HVNãG¼[Ù8cßfçI°„˜"5|ØãJí¿§_ (™òŽ«rF£ÑÝè'Ì6³`öéâÛEß`ÎòÈÏgYøaQÌV»‹/_ƒÙV~~Rä³GÂÛ͕÷œÝ\üûâòöâçQ0+üBEjv{ç¨Ä~§³Ûõ싧üØŸ/ò"ñ.?]Ï¿ÞþúóÇ|´!Is?ˆ3 IØQ†(°ç¾pJ<Ú´p»QÀ˜÷ê¾Ûšª³+ÝÙºš/Ò(õ¾ì ú²îÛ¯ ¹7OfÍÃÝ:e†ÂdD<îÓ(rý‡QŽÎüŒ´@íV‡GL ¸³Ðó¡_¤¢•wÀ_äÂó<ʽßIy«z¾àÚ0šm}¿xæ™jB ¨«ùkô Ély¶Ÿ‡žž/B€÷øc:¸¥2ïv+TWÍÓ¾«7ÞoíJ(7uc»íŽÙpç2'ú•sÿù>åAÝ ô ù‘€ãÈ슣ػùÇ»E|$Ièý^w†¡ÝVwn$ #8EFâ(½ìv¨#„ÝÁÉ‚[òà~8î ä—-ià¶Ô•·¬sÓÜé•Œð-ÂÂi}U3B£[ÇYÍßÝ\<X±ÀÄL{Ÿ¯®çyì½åÙãÖ4xdœx¶c‰_Í`¹ÐfÌg¨1Z¬÷h ¤¨Ä»ÆݶÈRݬ… &jnQ¦§ù¼Ø«j9°E˼ÎQ&Ë2O¬tÓ!–œqï2¦~‘°ˆh8Ï!,ü$øàoÏ}=M|Çóaž*àÖjÇ]\쌮Z&b8:±Sµæ[oª•áÝU¿Ãß%K×Ò¶Õª1ºEëE8ÙnÃdùÚy¶×Î{àbº·¤‘E–øatlë[[â1YNöeÛ1–º%ža8˜Ï >ñf•hX…©f‘êLZ6Õ,y–{r™ “h Øí­Lù“©L®ñ$æå±õüã4óSæG®0õUœ»BRPF¾ŠNâ]ýGÆt+hkrI]g6ÚÆ´¶í4‰…älðm̾ÔH[ÜBw܉£ÔwLa§üä¶}ë­ó»]í<‚Ǿï4{ÖqÄ>N/Qâ ‰{t@p>No$qdcÝD~ æÝ™ïÝ”·(ȃ߼”8°4¥Ž£Ì\øÊ‚BC!.£PŸý(F0¤'+‘Ël"ãP”ÐlÌ92iö€Bö$ÔDÙ(g°NÎZ›Nƒk¬Ý¬]5v¿˜JŽ°œ"U¸ rÇRÆ,!DΛPpúÑÁ˜yäyéQøÙ€‡QϤ¨‰Ù±ÛR/Kቾ—ß kMÝq²^Õ¥ˆ@±Üéàº;Ù/ç´¦4«TC>¡é±N–lÑ"Æ~~(™NÊžgbfÊOå°‡{Š]]¥ˆ7Ê2¾Øx1c®".g !@(™-âJ°Øy`û`!¸Æ‡ïz·/ÍÔq1Xwøi, †t jd[Þ‰³ý—”÷š''‘×V’ÂÅ+M·ýÛ›g›âãM;+Åaó¿DåA˱Q Õaû÷©jâÆ~:†«qßH7<<¤ÅSB×òª4To6®oqaÍ,QºWPªƒ„TÜÃRCíN9=9•‚;|9¦#HË•Lî견©Î'›[9¥Õ;5}i† ͈̔àœÉ ©`™fP‰Ý³rãŒzž(Υɩ!*p"¹o%L;sh D©œ±Þá²`…«Ÿº´«'A•F[2‘˜èzcw½ >'úaZ–Ǫt›¶kìÊ%ÕS±¥†e5ÆC‹­ÆtbRŒ 7”h×lˆMg[Òð štÖµÔ×´BW¯Vf/+ºZ9œý«ÀÞyUØí°œRxM†òÚŽLŠM }}g¤",¸¨Ô–Ö&Î ô€ê;A RWõ;‚·Omg©àþû®£†“Ú™ec ëì¨,ÄͲéÝ V–>? m/1Ô ªæé^7Ý1#lËÙø–I„© |ĺ L{TÇ*´ÞJoFöˆ0Vö â`—8Û%t[ ”\Þ•ì'¶ñ»v…7ïBtéÅ‚¨¯,´·<Õbi…ÐDŸË ¨ãw7¿³'dý<ÄT ÎïãW#œ‘žÉäzjå;£èjcÚ½Ÿ`ði øTºäµƒZ"40ÏvAîtþì`"éìa»®™ãÃìÉ““$ Íi®Iâà4u •uFž'Ø#¤íÉgðí,bƒD(½ôÐc ~?_]‹"ÞeÝWkŠö¸6„Yœ`(À/Ù#âJBâÄH$ïÆ0@Ý#&Ú2Óc”Ç¢~2ènÊz‰*òˆäÞ³ìF¸ž¾é0°1!¶ziKÛ¹¸ +G×…”ùºpD- ]€ã%Š”ƒ1ÖôèpŠ¹@ƒê"t@ywó“‘]ô…hœMc§Ÿ98Éã—ÙèáË…ÄƬ-†îeßYûpôIOBcë½:8kć‰Áqhƒ õò´@þ2~D®ÁÖBàˆa+ ODÝQÀSJv©ô<`Üóhôh\a¤®‚P“7‚=¨5X“@(b*å²JÁT¨ðÚˆlÃOî`÷ÌàGÛnmfKÁEJÞoI—58‹ñMºÆz€.Ÿ±5éï½ñ}œY4#––²d © Èeáe ŠÑƒæF^|´T(TºqÏ/¥"oÙ7›ÒV¶öœÃ—wˆá†ÏtÃsº?²ÑɆMìÃÂ83k)A»Lñp 0/9¬Õ{~꽩\~õù=`‡€Ñï%Iñ5‡TˆaèžË\Ò“eRd(^Œ0ÊDˆu#ßšg”Àá»6˜Ö*#`[ÉÿÃt?s£ß.f_ãóGðFO¢ìøoA¢$JܶõQF> stream xÚÅYYo9~÷¯h °H5னRÝ™§dr¬gv'ÞÄÀ.ɃÜ-»×Ñ#UÇñ¿_R¤êèn;ÉÃfa$%QuüHª£E¼ˆàïþQë÷³hq ß·g%^”",E…qU-ÖÍÙÇOÑb#¿-¢0­ÊŽãki^·^|8û×ÙË«³ŸßˆhQ…U.òÅÕ—’„U’-®6‹A&árUViðòíåòÓÕo?¿)'Ò¬ £¤‘Ž[”ÈrØòbåyW¢€ù ÍÈòÜÏ¡#íÏ(‹C$a§aL¬o–etf¹JD\\~Îϱ™º'ÒÞ*K­~«¨a{Ùn¤ÙP¯YŠ"Ø×½Þ™®ï–°`ÝÕ8–êK¯Z«»–ElÔŸQœ¶Š§êöñƒ}tïß,EüJìi‘G§r«ÀnˆAîvµöÂq/þL<¼^wf£ÛÛáâ°ÊX%ÀþÔ^ÚKáö‘¥Ùá ‡¤É¸Z`º„e’(ŒâQññ†~ßí{¼Ñ" ¬ªÕº‡{¢®Ù×péGf¢DfIJ²ÐtVi”¼õ2P¶}Ö#% ¶¯í3þ§ˆ"[ì<Ы›]Íê^ƒÒS!ÛÑ©fn3®wƒv‚É~Q^w3,Bý]¯Y³:&ÒeÓÁåÓ²¸g55²'êÅM·xÀ8¸×ý–ZnƒØ°²áÖΨeT»æ¾4®!Iýk´hl4a–u‡÷ð…ùÑŠXöÃLD¸ûj”»Ã^1ßhN4­›mM7pw]]wh5÷X¬o;§jò¼.œ t1Ó»[/½2Š}ÇØž¨h#Nky oh¢QixI?]³•ô?ÑÝ,Ë€¹-ñiÞ9þlеî𦜄}ÍÂ{<+5×xI[2ÉΪ“§&;@?Ù ¶¼ ¿]Î< <+x@X•¦à€«¢ ÁpCÅÁœ©¹–GÕKg/´Û(nƒlŒ·F­¾Ý*¼wÿCš7ö/'f‡Ì²ºqOn~E[YÅUXñÿróvÛ™~Øý‹DÝÉ~ûÃ6x@…«ƒ©ßê–µ;"”¡Ñ×Ä–Œ–0PƉéÑD #äÈx qðÃŽÅWœµÛÒý’¼‹?/3ÀÃzÏZ@„DVPOð´ðçÎúEóÔWÚ®nt+ûÎüX+²´3£ÖJÓ³&>kICêå “#v- HŽ¤^( @Êñ9ØèSñö5ûiÉ·!]јê¬Y_=ã„à´Ûc*ô0YÊüx 9F€ï0Ošvñj>6È“Öz¯­ö8>9úa´€ÔQ~” ΃ ÊH tzy]«oË0'méÛ HPeÔ¨•2…(*4”t–à Aë¶î®ª¡ÝªÞÅiþÛã$„lO ÞhÊ‚"¼#*4SŠ9"‘¥2¿á šE²Çá]Sì™çßµàgH/ââ’÷°Ùe­ß’·wí¥wÇR;ÜžH1¹É"”/Ò@hÒØ"*1þñú?WÎ[^_M*5!À¤ªt‘&9T6¥Z2)ÕDX•Õ¼X›Ú—Uê9YXÑ6ÿþî’j'·¼³8ÜÖ†OwNÕn, t-qª/ J¡wáçaJí ûd莇ó[h½ø°B8*\båV1hÒh­|A=UXÊåa;>¬fÀ‹"(¸à†!”(êê¦k‘TvÄ`ô_zØv;K-—ãcc06h“¹CÃ˽k)­eêVižu¢¸Q;•XǸ¢™ìãT™æ¬7«‚ÝÞì†s•ä™Œ&oš‡‡š™a]Ø2ûÅûWçÄ 4Ržio÷²vHÄ®eY#R•ˆMÈ™7ÄA×$% {ñ•yI‰3dŸ½ô¹òz[°ßXi&Œ°¿v-Ö·{#]Ñö5T}-ÔÉ8†(˜±“g±W„àfЀ¼¡sÞ€T§oœ×2« Fñl†/R 1d•EQpµu*ÈÐè9‚H´ªç±òF¸ïZ¯h”®’äøÕÕ« LñÚ5‹€Ì¶….£vêQ;võ² $±úþúZ— ¶§ÞäãàÆt µäÁ~N)ã h­¦ud²½e’{» si-{¨C=Å Wbù$…~5¾ö0Óå™Ë\¡€¹0y®Eä:Ìj÷Ú©ÂrHøwqáÍc¦eÿ}}uö_ø¯µ± endstream endobj 893 0 obj << /Type /ObjStm /N 100 /First 889 /Length 1639 /Filter /FlateDecode >> stream xÚÍYÛŽ·}Ÿ¯à£ l²®¬`a@¶¡Ä@’$öAY!ÆŽ±AÎßçTÏÅ^ËŠÛ;½€d÷ëÆ"{˜•VFDé=ÐJ!S´Z„ ­kù¿·Q¢õ¬h©„Z.½õüCᶉ¦”7CGGg$x”N”`ÌFÞJôV:w€{GGÆCgÌ’…î,’;$+%)ÈQK0äØ`t0ÅÀÌA‚7ÀõÀj„¥µ\i¡Þcè¨l‚ÈᣠˆQ 3@Œ[!ÆÐàŽŽ:THzê’E!‡!Yr84CÊŽ$«Ç&ð@6‡dƒ®ƒ!Ù¡‰À4ä9\ Ùs¸@òÈáX) >Ê„@rXb¬pëІ8: †2ÐÝB¢0tWB:9\{aÊáÀ1åÚ13´Ð5sWE'® …oB! ÇHVh+’5ÉÃÒl°g8äxêÐ0WZ8¬i°QÂR¸ˆÀÔS‰ºmrâiÈ’4~˜mžÃGQJoŠuV/d©ú˜ýL ¦àÀ¼U‡…ìΠ }C –­#=ÆÓ‘’ášž’Þ I3†¦SƒÆHï†j££‰õb;ÐñÁQŒr¡neE‚ ñAÅ8õŒNêÛñFRß°¦iê®ja³¡I¹oÄ›««Íôtw»/WWezJÌÐÊ3<À½AêÐO÷ÅïðÐÓ…Çé>'8> @5>ùd3}y·»y¾Ý——eúòó§ez±ýa_®7ø+§}ñßï·øãÕ·ÛÍô(lo÷o”óô›éÙöÍîíÝÍöÍhó«¿m¿~ýêÓÝåeb4´Œ2¤×טíÕD@‹v€?¹½ÝAâË9$¥L'‡ÖŽí÷ÏÍã6Ó§»»¯·wóTízúËôÅôØ×Iî«âÞ+ÆIªÀMX½ÂÅÙª0PÏßþk‰Ó__ßþgzru5ËŸžÜì_ïn§çÓߟ}‘¿þ½ßÿ§iz÷î]½ûææXä~wWwwßN¯o¿ÙMx§c´Áña4¥ eïTjbR¬v¤½2Ï~Ï¡5\N<•©vXêqxòÃy"!WCØ{ëµg*¢Qñg@BY™&ý„æçåens¤ýãŸ_•¿/£¼¿Ü¾ýî»ë©¦WFUïë"L„l°&™µö¶2’tvùHøžÐ}êˆêȽ ˆ?lÕ«"%±.R¡Oä±{Èß¼7ü¸ü|oøq×xèÞ@ïí Y \´7dÍöá=àÊeŽå_Î }~8çšœ¼qÕÌ =jCè]‘ĸ'³6Ÿ—éÏ»»K|ôf;§†?Têþq¹ïY0œ$úáx¿iSQÏu•Ç I<ô£ã.YÇ·Q%oüõ™i¯ê›l\käíKãL“•1ë#е ŒŽÍ]‘ZO4e0öZyšNrÑ™kf9”·’G8Æ'ÒëÒ¼ÄèdHõy‘9ÓLÐ!BsÄWDJ¨RåDSqhñ°Ç ©fãþQÞ‰/º"º<ï,ïàèÿƒ§FrÔÁ¶icTœƒ×Bž‚y¾â¾D,ç…âX‚$ M— óRõ—J«÷Y˜ó$cGÈÏë"q^oKÌ”Á䱄'¡XÑWEΛŽÑºHµ5}(òwõY$ì½b8äÂb8ŽÅìñ&0¿ Ú~Qq›IÇ#G0燾Sö íÊä÷³ßyU¨ŠoêÅ]¥?49¯Ç`k‡æg[é^ó+¡#¶|ø#íÍÿÅ°¯” endstream endobj 1031 0 obj << /Length 3783 /Filter /FlateDecode >> stream xÚ­Évã6òî¯Ðmä÷,†H‚œ9¥§§“ÎËËdß:9Ð"%1¦H…K;þû© ÜĶ;IŸ€P¨½èoŽóÍÍï7 ¾þFmbíÅ›øžJ’Íþ|óáW“ÁÈwß ’xóDóΛ Šá[n~¾ùßÍ›û›¯Þi“xI¤£ÍýÁa1^bÂÍ}¶ù°<ãÝîâ$ؾùæÇÛ_ï¿ûê]gPWó7½\nw0˜§ \,Ôöþ$SÒVTiW|ÄÕ,ZY³èúÚLîo"ë…±v÷?÷eWœêË¡< S}銺òpHi/ õf§”—„Bö·ù!\ÿÄÛ¼JÊ `Ü•Ùæø"±Ùz3š/¸Ó—ø`˜ÇÜ…:Ü~àÓ*;YjÏøÆ·êÏ·¡ÚæÍ ŒçëÀMýuq˜) vð¢VrÓˆü»®~ñUpì$¸ ¶g$þp@cCâ<jó¶Âq‡¾)OªòâxÂ¥ô¼D$œuJ;n-³4³¢É÷]ù̽}]Uùþv§¶Ý­ÂgWÛ Àao¿Þïû&ír˜Û;X‡€•ØóSÒKúó'lO´‘3áá5û6pqàow’¡ýH ™²v-¿ÿ‘¤YÖQ˜Õ¼MËcUÝ1üœvƒpü©èN<’˜<3¸ÄÕv»OKYžw8Êâ×<2°íÞzkþyÁ@…tÂ@MNˆÀSŠ3œx!_§ B`“§Œ Ù^æx“º? úö¹íò³L¯û®¨ŽŒ¨Ã5ðvQ³dãŒ+ÉF`ÑÊŠUÉàjV)Ç×Ì2×r½sóf¤p¾³@³wÈ8øp  ‘»íÈÝ!îÆê4ú¶ü… ëó9¯2ä­Pðÿ¸”ž Æþ~*B4ñ$™¹î‘tÄàßd‚uñ6| 5¾vÂÿeöW@áÚÈSz¦Eœ™’Єž²‰›•6Ç.Mú… NžVÜ¥:"EÐ"EßVû¾8<ËÈI&ºþ<ÊQÞð@}à/¼FË­_üÐq³²…Æýý÷0¢<îýPw9ko¤1¾žë4Q:¡“lh¬Ÿè¡fq³ƒ¸µ<Š§É³cÞâæ **^r÷’’4‡Ì7øÝ×½˜¿ì_‰`ÄË=Ô\¡e•ƒٶۚѱ’…GÆô‘X¡¬i#7ióKŠ 1ãî«F©«œ ÊgÞܱùbŠ˜OQÄE`¦¼‰H~5YìðÓÖÑ8ëꞬcð¬c ƒ^ÚF')×ÒÆ^7®-./Ù½Ðxa,-<Ê,’H‡ +ߘ•¯ãQBqðIdÛΪ`Ø”ti\Våt "õ‚ @¹ï˔ĔQW²<ô©`–k_m/Ø~:l¯à<1È«æ`þHòìS‹5<µG#„Úª?§Ê>1{éæáœ^Þf8ív` Ù™~眪®þ|"RÎÄF.\©6//0€eB¦¯IãÖ$ çÏ…ºt‚lÿ@;cë[ò‘ ‘v]S€ï,3è‘M‚>- 9éöçV3ÖòMW´2ŸÉ† Ò ²·c B4¼bp_þ%VXè‚«5Xb$¼Ž,ÌÍ3i¢âÆï ×±Ãº[u…ŽZÌû™--Ø­ßÍžÉG¼ë`=ò&_l8Ub„{p3üQqa{töü˜µºÜ+.*ðòÒìŽe¶,]`" '¨ú€]Ä.Ÿ‹z;zFÂC¾/Û– yf¦CÄAÆI¼&+€ \xDdÄvÉñ0 4Eí…ƒC€q[rj‘7Êi9×1`‚ ’$ñŒœ=úmÅÓž†4k\”:â}8þl,űª›ü%Ó§|Ÿ4æìYEAøô­‹ñ¦úËìäXJ:ìÞÿø1âIm}λâœKìE.mÍo’•@ëÛÎÅ~9¯;–õ…5tØ&MqXçrhæÙfëÎð)%ö–8ÆЮ¸óð€ÄmÈQØuGÁ6)il”Eõ¸›KO(EœôöÂ_-˜\Œn"_t*N• ”Ú£ŒJ/oÅy¤ãAC ñ‹!Îxóþ§·³Fî†Ó°`*AD¤Á8Oîiƃ¨geÍ—–ƒ:ø¸.öqÍ¥!ßý¾™/Î ”õQ@ìO=jÖŽ¯täÙD_ëÑEhx± ¯. †ÃøÔ &ä<ŒèÌÐá¤`39ªèËéQRà¡#Ðø3ZŒ¯þƨŒ:(+ù¡v¬ ­³L»âñHbNh Íù]í0Ð3ïkÉ1pm½Âµh}†$Ϋò¾*‡Ã ùð|"Ï‹Œ¤27îð•§}»¢=„‘ò†ýІûHŸ1M¸¸EâƒÙˆÁ6Úø}YäÕJ¶)°žo†F:¹°¾š368i+çɘ†Ü)Ú5nôc/ âW¹QyfÌuËÎâËíÓÞí7Â)†,‚g¯gÿG3I=  Êjk=kƒ¹:L\TðLÚ-û‚];ø€g`&|ûî–»[G໧ô™É?MöÍÜ#k<­Ã×Ü£€¥oÚâã‹ðº/$qì±ò`¦êže†’¹ÂGÐ$uÅZn^)íéQÍŸ®U/Šƒ KùÅùœgEÚI„CÜBICa±dâ°i3”IöõùÒ³ý¨Ø%€ÏlÖ ÙB Â<ôáÈ¡Ðî'%®ÐÇ9”"pI°,r™I‘ kNË2×t·Pq!1…š„d×›Ó'öKì‰iN?™ï¹Z*‚°Ózo*×ѳÊÆù? sí) ‘4¨e^™8ƇÝÄÅÂg›•d›ýááý[šrfåÒe3„‹XÝpKF)ï€IŽÙg>¸~õ…“²úê ¤Õ™vòàñÿÆ ( «Š aŠÌ‹¯®‚سJ‰MA¼ãp¾ç꫃2ÒÉ ÚÙi2Œìg“-Rœ¿…*€Fj˜˜atÞð£se+Ró: 9Ÿ {³Oœø‰œÍôj¡)âçÄá‰Å7Å\ jlUÇjŠ´yd¼À,Ì䙽çŒòòvðhâÈY.JÖÞ²N&ÕïÊT¤½á;Q4°úõþ3·¹\`·ïÉ»€ׇ€>GÙ€ËJØ”£~DwKÂr ¢@M(ÀW:ú †Ö šŸ/ÁЈÉêÏáç/°'óótËuv½(üdqÙ„#~mjå.€*$ÐZ\BˆÌ¶ÌÙ²—?Ha£bSÍÁ_$yƒ(,¯ [4e=èî†íe…x-ˆýÃw¶S`ŸPáBS9†¤‚†$f]úz`'.÷a†K‚\‰vÉI»¬Õâ¬Tyã¤X ¨wó°¢—¤£\Þ§sÎWçX劓ÚmNßg.½»b€©Ò‡.™‰À%û‚!‡'é‚ê›^¤27™é…˜ \øÄ5„àÞ¡éIôhz`hòhØ¥SŽ‚‰’JJ9§ OŽé\ÊeŒŸÿÞœ·Ôcõ;ðÕýã§nfÿ°;–—Ö‰* Tâò7Šëhœ r…É)žºÌ0@ó† I¤rG0¹ãæjýŽÛ“| Î&Bø 6/óµ;rµ¨¤t— 8¿‰¡hñ±à,˜âêMhó®§:›u,4¦ÿ` ì†á’EhÖD¢,³}+ÔÍiW°–%TÙFmÔE-ýôÍÍæŸÂ%M,“xHwÍÿ'âÉè¤â±Äd‹+‰«BG“€eŠ^+íCðmÇ`†ßnd:§ž¸þnøõ&1þ£WCù>!jààjŸÅ0“Ý^‰nŒö‚HÍÛâ(U¶}¯þð“ž_ŒYÀð˜daÚ¾J™p 2Hä„"ŸI•QER¡„ù-^`†R†ìx”Xê˜ÖÊIbª :Ö£âàŠ|ý©R¡¬ÙŸòý£¤ò‹êqþ˜þ-HÌþôÒ À#GÚÎ9^d“Ðüç49*‡Æ ¬ÄÑ¡“P p'@)©ÖQÕ ¼Rù%´zûþÀcRv¿cïHò(ïv:é¹,ü'ö«ã¬b§m+ùÖ‚9€ qYöEµc%9UñvØÂ"Ìø×_ËéÏ ïHl$ ÐÝüƒî…UbÍß¾º”ýñ˜g’|èZX V3?ÅzüQM–®•¶\”ÍTà‰~ bÕo ’Ê$QJ oãœ'£ØãH;×á<¸?T°½O+q6üÉo3Б_[Œ?T¹Ô•¦ñ·ÃŸ…Ô›VòÍß(i=²Ο§è^å|ã%ñÂc¾WáÀ÷Ðd¾•ðæÝ[†Ìr÷ ¢Ä~+ùf °DϼòœKðTí™'°rVÃ߆vúwB‡—‘"4Ç ÊÕâquZ”ü›#t²¼cÇŸ×$(V+Fl"dc²:ˆG«ŠE_ú­µ˜À§âÑU D÷acõC+§ÆESy†ÎãÃ@)΀Ü4ˆG·ÚH ªŽÒx…,¦z§ÕìÝ¢–ÿ’ê‰[ endstream endobj 1066 0 obj << /Length 3578 /Filter /FlateDecode >> stream xÚ­ZIwÜ6¾ëWô‘zc1\À-7/qÆIœxlÍ›yÏÉj¢»sélKʯŸÚ’-Jã,—n €BÕW…ƒÍ~l¾½øí"„ÿ`nòÈÏ7YøaQl¶ÍÅÇ_‚M -ßm_ùæ–ú5•æð_o>\üëâÅõÅW¯£`SøE¥›ëåûEœl®ËÍG/õcÿò*/”÷âÛw—¿\÷Õë|6@%¹Ä°¤Þq€].YÞæJűÆáæ*Ê`L̽tùù2I=Ý^F™7ê½¹¼Šåu;üOÎõ¾4=“¸IyÞ·Õx*eDÝ!‡ÛË(÷¸§òJ3šíXu-«Æ ÜR i«³äºÓU}ê ì3 rïÇnöãAÜóÅëWL:öÝØ]^Á„ۮƽÂ>¯ÂÐ/‘—®hãØ;hœ86B¸¡q†+Û®ý9Õæ-Ÿ1i0F¤‡Úïåd߃?#\ÅB¼iÜÏAañašy‘‚ZhùYAÀØÝeèÁ:B¯çFìz€aJ)ï•ÙéS=~µÄ+«AßÔ¦ô³ªÄ³“¿Š”_)ìh‘ì~kb”àܧ¾ïYcÂl60M(”՘ᶷ‡³‰æ*äy.RNyÔ¿é³ÈûöúÃ[,…$aÃ6ñicK߃¤¼÷¯QM^ò08çè(É7ÃL÷¦5½®«ßMÉ-××?pA6ˆ<ï¹oc¶¨ÝVCƒ§€ú”³%¢òÀ™ ÌAïuÕ#7 GRV­nÓ­èÖQoq¾O¤ïÈFÅ)h/AʼnWíÛ®¯Ú=×z³5Õgê\2e…AæZQzŒ&hþÞèºFÓB˜C‹%…:zw¸ä̃ Yö _J—yŒ›aþ¸¥þ“,¡ïx«¦¯ï±(¿J–ÒÊž‡ó.@Tª`s‚ÿÉœ bZÒX¬Àdí¼G‡ûÂêP•„ØcÇ$ÍmÜÅ ˜ 7;î=ñ!m^˜A”Æ~…V1€¹B§©Å… Ûr…+ØT%éÓ€iVÛ üúq˜Û~Ýí}­õ„&›«¸P~¨¥XE^ÏVæŽ ?ʾhê0*–S#´ÞpèNu)e«$VÉv÷Ü0Ó&à$T`ßPŸ W=Ìæx…hîd0+’Xù°ô½é[ÇGp §£XV?²8råÇà"ÒèÍo§ €ñ/H¼ÀUÀÓÕS/òÁ ªpˆ3oÞ}&œ}†› ¹=Y¶§³ö^}ÍCÕn ëí4½î;éã@DŠÉ]‹¢á—¢È»T$öKa g„Ê>p…&e,™Â'&ÞÛW ô œDÕV‹1…£À?C ˆ˜ü%^/£cƒÎQœ'gG扣RqáýçK&h—¹O®¢åÉA“™0Ü£i†gkq )ÄBÈ­[™œºC™ÁŒŸÌ Tƈ\ñCŒq±TMu»ª$­„]V²¹“ìÓjS$~Zœ©Í| ¥}¤aôåÁ È)#œÙçO˜"\ôBV¸r²·¾¸k®_ŠÏbÊà ½7\Æ®gYH4H¨„}ÝÝ蚉žõáK=ꈘi1±w{¨8ÊY;ø-ÇÑäš±¢·[PYÒ«Ò6Û%®qb¬Æª®ÆÊ \Eí6þŽ7SËé9j®ho¦d߼ţf¡µðqÁZf§‹”0¾Òâ4‘\ÉP*+´rÉC'¬E(ú®Ñ(öº¾g6–ÜbÅÅçÀعî%.ùÙT%]|ÎâacƒI´D)S¸$ü?‘ŒqF„Cj±i#W ÿ ¯ä2#¸¼¥` Ë‹ŽÝ291èƒX(ÆÊã Ü¡•©·¨¢Dk4>)]>¿YÝÍ£“x¦*4á¤*X­dÖcov¦ïÑ7\%Edos¸;t›k7¶i#*Ëìcq:c•å¼ÃÌî)dXØ´«ËÃãǶ k#D ¡95*‘c¿×èäzcÀø}¦¼Ã!3!“-á•màá©HÍl*`2\˜„M+ˆ&ß‹e²ÛHÍj,áY·NºýhFÂ*Zrá'‰ÈZÙI4¿U‚öL!:6¡êÒmÅØFÎC—¶k¯^ã-%Äæþg|~õÙ¬¹üÐÏÕAïÔ/âô F&Çž*qÓ©sPrj¡6´“š¦jq5ÞU ª :ˆ!!6w§qß¹XFËœŒ&¡ã8ÄÖã4 ¢Ë®Yæ¯iÌñ¥,GñÛ Cci$^œ­†3³Õ@¨ÆþZÚÎF|¼2‡Ž¹3ÿÀ1Š.ô=߬¶ueÚñ‰crƒg{}aC^rßÉU5 –“À†:ÉŒ°p1oÓ-b/‰[4Õþ€¢º!0°´fì㉽šØ»Ð…ÖO°ð7Ƕ“€N?H¥Z u³Ø"—‚ÁÛ zw@²ì/Àýax2#“Ó­s!à÷²eÀ¶™D¦œ8]“zt ¬O‡­éUÉÉÁÿ„umêW&`™ÂøZ'GLh%Y±,¹dy0½Œ³!9!±yœ-*öîz5رRŽŠÀ«Fþ? ‚°\AGpñ&ÑlvLÉÿZÚ4ÿ-ùbn0* ïæ$3°ÿÄ’l ùëž#w,7S»5*.Ž„8·+³r~0ôž­a1ÌGǘ`Ú¤!P¦dL,r›LA¸? ‚L”i  C‰H$m™Ž%+ tЖkÓÐy§3!a{E¾tý¥³¬»ÑÎ8L£d+çê@ìSËÁ‘€ÁÁT½5`Ë¡NÀBP#¶¡ÂæqJ¿Zšãîb/ÂÝrq1'¼iVÑÁÑ ³Ä«[4È÷Ï Èð!6J(§–XíK0«Ö¶9zê²ÂÂØÛ'g4rÞ6 кä[Ïíd,v’bš$—I2™$?ƒÙ(ðž»!˜ë|di•ðç«ïÚŒæXë­‹ìÖ4ˆO±È%=ƒ¥Æ .}ÃBÁb‹€ i*Øù û#7l1w”³=è–ÞI€"é•jRuÇ 'U/0×ÙTµ–uP$©m$ 2±b. ª-qúI€Ù¯@ÂÚL”)» ü8ÜGzÉÀL@˜)V,,Âc&u7CW›‘­ò±Tvt©(¬„yŸç43óT0úCI—W‡Ž<÷ö|ø%9²(Ož¾è.ƒ»K»AÌêUŸ$U5PÂY(ò¹c‰—•`~¾ÀŽ©¸®gß '#Á¸D0ãMÒÁ:Æþø¿zIÀz¦ &•˜BÓ\“ýÿæúâR-´ endstream endobj 1106 0 obj << /Length 3552 /Filter /FlateDecode >> stream xÚ­ZY“Û6~Ÿ_¡·åTY ðÜ7;¶SÎVå°gk’Ò‹#¨XùZ‡öÍxz4ÝíIuäG¶½Šî0žLƒ+ vÕmèr–GØrj76ö¦\©?Ó‘Ì®Ú?K l–„{Ê?ÕÑf†~ Nŧê„k'¨¼F*°ˆ,ÕqC»ç¯\ÚNLõ—~è¹T5ü¥ëâ&ü†Þ¹Ž¶©¤³ bÞdÞ ž´äAûVîÌÎTO¸!#M];¦Çû‡1ÿ:šëu÷À¼R¨ç¶•ð8–;hjOçÚ ¦~æz‰;Aq²«žq’väá=ì –Óôcg˜nEô¼ÝwFVd œà©j»Õñ>Þ#6â@Dûö„C5H8¡ãâÉ Ýa{¯Í¾ëáïX‹¼€;üÄAÓò K¦cr¿NiÁk¶–0Wè¯øJU¶*òó 3M ‹Lƒ÷v¿UÌ<—¢»è¬Haº˜% r?›1£ÎîŽWË.5o›Áªˆ!KÁx¹H浃Ò9ˆv5T$ñ@•­`Ñ|"8ÍÁ€¨8%0£¶s×rm­Œ™ëí„»ÎXñ²¬¼e1p·ŒÔ»¤k4g¦¾B5±ËX/¸O'#û熥´k·.ñoª?M‰ì¹þò1T'Z4 ˆñÆ?øt ì=“å`ùÍŠÜÌ«áEØ#2_uâm7p˯AÕpɲ@+3ÐBÐŒ2j„$sõc®v¬Ñ@n÷Ó-¶M_õƒivÏ(c®“V°j„4~À“¾/ºg®âG"E•ba;^¸`uškÂ~,ûåÔp—I”ñ-aÛû¹;l´§S`õý<Ñ{iªàý‹Ð² þ¸±¥ÜÁÞ¿ÅE¿ui½ÊÃlm'ñè^¶:Y(eÏuÚ+n9ŠT²)ðíÌ£é[ÙåwªÞ,L´"cd%éNPÍå}מ¸D¢…ÆT‡#Ž [Œu2ïl}‹î.ï4 ½7 0c‡X…ÁtÃáò†Ã/¿aêœô»ï—èQÏŒ}» %‹ã̧s 2;pM@ûP5<ŽÌu³2x4åÈRe§YhÖ ×¾ÀhÃÐËVJG“áÌ&TÞ‘AM'òˆžÄê’•²#-×h:4ÙXb,·Ë4­WâP2­»ª9\íg –dxë¯A#X8çÙ؉‹çV—ŒÔËшIƒÊ«wï_c)]ïIºB?rôb´cçⱪÓ¹1«ŒËŒg^ÐJv¦D–vHj#4Sï‡Å`—‘ƒ[s‰+ïKØp9rI‹ËiÊ\•“Ì,ÏŽK@ÌÇ}Ç‹† 75³º²mV¶=öÚæëÍð¡+vf?ÖÖú‚ tƒÃúf™Ÿ‡ñ­ñ…nÑÒ+N)ln¿»üf?M&#^\ŠÎ|Ά瑯ÒhƒìêT#–ëÔB]Mb„P'îJªí¡zîÓ u×ý•n«3VõÜëRØ¥7슮”…-u¡†%SЖÁ‚‰©U“T߀±Sç/ÇÊ‚„V®ÜgÚ?Ôεñ ¦>þÂþX3¶F¨‰0B‰·òƒÎuÑH3¡ý²¿ÃŽÀ¦¨Ùàìj(vƒÿY œvNŽ¥*ºÂäÏ€©(ykC5¢ÎbmV¬©éd,æVýIº ¨kóTäç÷ìY`¥êûÑ"²M« ð´l-»¶žQÉuÀÕеȴ÷n`wíX…Á€‡b¤Áæ±AÉù^Ï`Q²0 ;O½äÄ%ÃrŽ ᢊ’¼C\ö¥ˆ€¹™ŽøŽ£¦«tœdºX•¦¸ð=›Kë‘œ¼465íÈÆÉÉHg/ dkGœàjŽ¡‡,FŠ DžꦬºË•éÔ)ŸÒ ™QænZ{~@à-(6¿9zrut²+«Áž_EFLD‡¤òÉ*êT±mŠ#a8HŒá(Šº¼i&sÆVuC«ŠP€-Õ<÷BÎqžåžœŠcx³ÁJ\Ì÷„ 0b°¯¯˜¡-C¹aÇLyBå±Í‹âd?´¤cÐ óI¦c‚ûV"ôÛ4±mºy‹²0œP\-ê¾eó *ŒØr»BôZ‹ß»Ž¯Wž«Û“€vý¿ì2U0šsÅÇaì³iÅ„Ô}zœ”úKûøar#?p`¼'¥r^•È·+•V9gˆ´H)$¦ g¹™urÖ$£Áó–\¸|¤EèR·„*·á|pkÊ]Ú{áü feT®° "Œî<Öqr›t‚%GG­çx„š[þBØ„gz¬+tÓ°[!i†œâMîcO ‰Ø­GBi e`˵uÖiØ” ÓáRÀ”öB¸„¹7 ÄeÿõW5°çsgDÊ .> {ÑÿQØÉ—íÿᛢ3­s/ÌóôÆz Nœ‘;ÙÃsDŒŸ¸âpW0×`SqPfoTxʆíºÞ~lXȦã]P2¬±Qëêã`å`I¶.p ¶€šÄ±Ž^^«,”ø]‹_J¡×:Gj¼œŠzá`eMF”zoï3;E ±X97‘b¹ˆmÒuÏS4WðøådÑêXY]Âg¯WÅCBA¤+4qº(ÐZikl^S%âÆ’NÀùn\t:»òÞIϽ2(M^Žïy>Î7ÊŠx+/ÛöÃÝÂöž¹\²Âá=ãeBÅn…Aìg±ZkéGÔò²ƒ…«—$ñÖVêDà r¥6ÍDÊëƒ<á¿ÙZg>·¢Œ}­òòò6&—ÖBZo!X…M:#Ù¼()?a= ËmRíBA:²î(ÏÀvûЈ•d‘Zën‚ëiÍÙâ·¶ôëE`•³¿ev’úy}9¯#íY¶¾šöòwr"í ðBo~ùšŸoº!iN;®æ®è~’Èæ ç7J…á]ƒ’”MƇä½-à[%ç³,çÐÞ¢&·U”Kº cdXUÞ_¡¶€P5›3®ð¿ °øM¡¬Ê\K¥ðÈóå8¼ ;ó»ÙIy~öR¤ZMM8Îa:‹a0§3½q$p]’îÏ’%B͇yîíM1ŒóˉøìÇeÉâÅ*Õ0OƦ^¬2|—¯E§• œ5ZìK6> stream xÚÍYmo7þž_á¥R½ö¼Ù®"¤J‹ÔJQB¥¶ˆ44*ºC—CÐßg|wK!lÂJmÄ…ÙÝÇ3dzóri%‡Z+!>)¥@©ºir5r³¸ K¿£Ar¿cAT](AZ9€PƒrWØ‚–!§`”]ÈÁŒ] P’¯ÊŠ8ÊJí` µÛÊj1Jh¹Bs®¡m—·-…œÈyvÝ@gKø•» 8CGk¸¢Ž`,`ñU„õb®„±ÀÁc‰/õõV]1R|Yb°)’ï¯v Us³ŒË–|…«o݃“­9e/ a÷³¯€!ÊN#‰B*ÎO,€¨lwE¤]_ Ä©kiÄ@=qw˜â¸ÄI&… )î)… íûUØPs}8%²ì¬6L]Ô“µ®6Š8+…R]ŸÁF% ½Z\ F­&Ø œû.©¦êZæm8XlÔWb¦ûgÇÍœNRsÍV=\‹5HÕq%!2Ø€K„zÀá—p÷KaHêÖ@H$õ§G·‹ã©®¹À†r ZúSØ°ìO+l˜ lTØ(ýÜp(RúŽ@CJ÷K…Ê}lÔÚŸÂF£þÔƒÞü`R=¬!!ì݈ÆÁ -Cêq…ÕÜÏ .QêüJ_S¼;ÛH6HýÜð‚ªt~¸TñsÃ!UíZ`· ®†'¿Y„áh¹\m†«õ‹ÅúiÂ;žž ?‡‡¸€êgÃéâ|ž6ŽX]¸Ææ&¹ÅâuŒ…uöö 4?],ÿŽ»þáè|s±ZgÃ/§ýóÍŸ›Í›ï‡áÝ»wqýòü»Å‹‹ÍjWëWÃÅòåjÀ=ë{÷ïàŸÓ|ÓØh §aøõ·ßq6±†š,Â-Ë·¯_?û°€Å8 ÎlV¤ïifÇ>•`qz3Ò4GbXZÚò$¤D‚+0]§lGRŠžoFrµ˜ñ~M@ZŽdS¬3+vÞæB" Ä’»'È™(¢~ÝÃÉzu~¶@Þ ÃÉ£ã0> stream xÚ½YI“Ûƾϯà-˜ª!Œ½Ü¬h)ÛQ9‘¦’ƒìCÐ$QÂB (ýû¼­±p03¦ªâ ÙýzÅ{ß[ÛÛì7ÞæÝÍ7>ü{“nºQ™çúY¶Éë›O¿{›F~Þxn”¥›3Í«7Q’µùxóï›W÷7?¼ ¼MæfIlîwv—ÐÍÂxs_l>9‰º·Û4‹œWïþuûûýÏ?¼Mg ¢8u½PÁ–4; pÊ'׳ÿpJ8[´µ«¶bÈk»ö4˜ÛmÄNUÖåÀ‡ùj¶0 \•Dö°æT?ÜƾcºÅ¡Ë nCå¦qºÙú¾›ÅòQ÷8(H3§Ö_ËZWÐÉ<§¹ RçTãïãÆ4«Ýñ?Ý°çÉÃAv\ñɸP9†;e}¤nÛ ¦`Ò®kk^6Ø;»vhé¼¼­€×Qè9?í.& sp fQËžÿÍ×ܘÂwÈ`Ââci( œüvë;msë;¡öPB†p#šRµ½Á¡‚ûçr8pKÓÌxÒµ!"pþÉ7Yl€‹OpD×à§r†ê›Ì¨•© 1™Ø»éž¥¼€G…®˜‚…ÀÀ€8ÊžÆ#ðsüÈ&%¼DçÌ <¤3ý »á1ØUèAlO!Q…€%üöÐóœöÈ{K†h}[ötSÈðÀ ô;s¬tŽ\AêŠAÊÝíEË?¼»Ù|â•„­Ô!Öà‹ÙEæJ«pÒo^ìáâ~¢߃ž/_ñÚìô©þ=Ø1Ò–¶òÍ DÑQî…Ò-™Dnæ%° h,+Ê^?T¢âz7 za“ µ"Tß‹Ü6~÷Æü𜪫ÌUË›þ÷€Û†QLø £D#ÉþM“·'«éH@DN@¿‘É•¨¨®и“ÝF¤EmÒ5œVöeaÓwØÍ„ À`™)Kà: À®É…¬OC[ë¡äWÔš°‚èÎxsM²‡ÞŽ® ú`ü/ê²)û¡ÓEšúÍó£¯Üä[ÀرCÙƒ˜jîךÍ"]4ñEs¼@¯…Â+!Jwh«‚!0”µYA@¸¡^gïÁ¥„Ù îq{P˜ŒÿÊéMÞ6EÏDâüŸñK5Z°˜0ðLf(ŒjþûŘ£®Ê/8×ð”Úô½ÞË lá‘ ¦Ó·S,`â[âeà!Àp´+›½Ýb£mÕú œÊ d2.;…a3aøc£áPï;3Úc&±µÇ–€,)÷؃x2¾Z$©CPÇ!sÎð!ˆœÈÎ6:Þ,ˆ<ž2q:åŽGåÌLxµö™Ì9€+©. ó\Vß1,°ÖynŽOø;EÖÿtdd¾ˆÑ,o’\‡Ñ$sƒhé€þƒÊ¥«~ J)ä•øØÂ{teEÕËFÅ9ÂWâqVŽ¤ƒX Ü¡åa.dd/#-‡5dZ¡+ðï¹Çv ·E€­‰±m.lNg0CÒ—Û8!.™‰/Ì ã~®ígQ^ó¬HUêFq|HãУlù¡¯MecÃ0õØöÀo¦HŒ” õmÜ8 lX™Ì8»)âÐ!XÀÿ€SÈð·L@ËaòÓ0Ù% ^š* ¡¬ðp”ð8Nç¦<Sç×Ff‡²+.N=¬ÊS ‰~^ïĶ±H àÙ·ç.sCu¥Â©ÈÔÓÂAC! œLtD«&n³T`d´ËJk6Øû GgÛõâ¥õ0˜ú8ÌíVdù°âac'^Üîzà/xÜ™¡ûKx,~ v³ÐÜ¥Á^F0KSºîhå5o´ÓeeŠïâfäøÁwÁ¬„‘ÈÂ3Ýüf¦¡›¤ñŸJNÂÐõ¦ ãn-$rƒ+¢LA®-óBÂZÒ]0Ö¯*àŒx>RÌôÆIj®'@¼Ð´^hdÕüw©2° l`ub§.ƒnX2Ý<Þ ½3còc {{Çð);%‘é0Gù+«¦énsWR@O¬œ×| Ó7dÝñHiL=cŠñX’Ÿº*ͬ¨þDî“.RŸÀUc>ËÑò­A+²~r5,à…&Bæ}î ( ߃ ÿD‡‹.à“$R¼»°\sÌb¯O£sÁ÷VÍWM#¡e)Œ„RÙØÌê·æÃÈÎcìBùLjÇeLSÄ6&žÜrßë-ãL“ÁäìÍðWD{ïçZ(ÅÇA‹3¤Œ †õð€Ž:×2Áª™b5CÚJÀLÏ 2q¾Ò<˜šµ¨¹ËÑ;¥„½Ö'C1"ö·’EÇÝZ¦Ë­Uu¼ì=m@ç L}WMΨlrÂÛ³p[OTcDÈŽÔ÷°ÜÁ/GIÞ¶¿ŸÿR™òåºÅZ‰òMÃö/›·õQweߊ¥x ƒº ¶*Ó쇃¨ò™‹¤¹yYŒžs&,Äz.ë×çº-º?:c·›çZˆÆÛ²¶m®×½Ú/°2Vn†W°2p“@-•md¥wÁJè+½Èyÿæ5 –èÊ®ób]Rq²ù’!ÞÄ;!Uq†.îv5l‚›ÅÒ¹—lxž-,ÓŽ&7bº ¦PEaÅŸ%–]L7æðdÑ?~¤À\T&‘8–¨±#×àd»SÅmLÄñ4ˆÄ¢Ì˜‚}Ð:R£±BBßÖ´aÆ%Œ~X܉¥{‡ åm…Ë>ú~íãLÖ˜*¢QÂF1JâeÕ è+NnqŠÿüÈÃü­í©)4F¼H’dKØ‘Oþ Ì+·U\:Vhâ½ ü„,¾}Á˜¯»ÕÀƒAGâôQQÈB‹*þLü@Ó ùñ%€"•%ß–¡ÑëZZøÅøx=£ÿD]W¤ë¾”:ýh¶pÐÈÙY q ˜|)Ûn¬ §sÆWWú,T ðœëb±Ê/ú×—õ}Å·’]‹¼ÔêfDå>ÑMÑÕ¾í άy”ÄìaÑqKÍ/¥9[ÞÓŠž§jîÎÍö×ý3í Ùû—²8a;^J6£pÁyíßI"ZH'­ ©[m#_ßæ'θiÒ_¢Z*…`-…80è=Ç— #’òÓødÄ™¥Ã‰`úþk–Bá݇ÖöôÉ>dz­='ÐwžŸÚYð–à3ãixò+T>Æ7Çñu ÖCsóWUt/tY‘£ÅŒ8eð—Ï,üŽúyc[¿ÐC $Þâ´ð’(PþÅ»Š#gåºiÚÁî¼µå5ßûJ ÍGo`DløŸ_ñH©CÓí8’‰ã”-ײšÎVë#%Oˆ•le&/ òBŠ¥‘­,Cƒ=4Fc†ŠŸÆΫŸ>¼¾ã¡é‰C*“= Â¯‡þCŽäP5üHâs®Yãx–†ÏÖ _HV+Ùsu ½I¸^0Ó¹;.Žs<Ã6Î>Â?û"Z¡ùv^0y@œQ]0™+ÿÀ{3:IW€8«Oer/°Ê.…Ô’ÞÊ¤È «P©K—˜(ÔZ%{²Ga&æ9³ÕzñŽT52Õ°ÓYvÐh»‚´·hxΗ.í6ó00sf/La/°ám{´Wƒ†‚'»T®yx ¿ ÏükÅ"÷Ç4›}#d&3L@kÇÔ¹¾?§ª0uRU:VT•&YDEji. ›È3eZ8/R00èh4%ÙÊY•ñ\‹)G?¨ÃeªÄ¡„ .ǹe&s>m:¸V€ð µ¤ÕP{îJãØM¦¢7C€Š ‘E5"#öàuÒÌ¡”|Eñ;Ò¯×Û Áƒ.ÔÁr°ìÀx»”UPíãuâ$6ByôHðJ¹?þ?S‘ˬŽÒóY*‚•|ŒŠuÉ=¼*ð“^†{î’Ü5 nѸb|‹Ôé±WÚÌe|ÁãÌ%˜ô ˜é14X0Ô”ØÙÿ7÷7ÿ%lz- endstream endobj 1188 0 obj << /Length 3511 /Filter /FlateDecode >> stream xÚµZKsã6¾ûW¨r Uqˆ_{s23)g3™lìÝË$UK‹´Å>’÷×o¿@‘’lÇeï‰@hF÷× ‹ÛE°øñìÏ3ß`¡‰ö“Eœ¾JÓź>ûôG°È¡å§EàÛ4YÜQ¿za£¾Õâòìgß_½y¯ƒE꧑ŽW7Ž‹ñS.®òÅ'/ò¿\%©õ¾ÿñ×åW?½yŸLØ0ñKêm v9 dyî ³˜É •µÒ1 ÝvÅMÑ-W¡½¶Ê¡H³©x22‚þ©u³õwå°ÞÌfœ¯ne$Éb¥”Ÿ†²£Ë!kò¬Ë—+“†^×‘×U±ʶájVݶ]9ljîxÝÙçž›†²è…ºÔ±wÏåu[o³®ln¹qî¸éâmRŒŒò®6¥0Y/uâm²æ¶p\7…cº‚¦b“a/eK’€íͶ1´Ø9ņež½gòïAÜmŠ†k̽6Ü1ë ¦_a¹MVq dÄ…›®­¹”—¿Ê0ƒLÜb¯(:˜Dá­òÞ/ãµ²¦¼²²ê¿[®¬ AÆ…œ+îç…+ýýlñ‰üöÙÿÀ£Ã °³†û3qD,Ž·ÅM¶«†¿Á4Öz-®Ô?ÐŒ¹jë§AL€¦E¦93a¼¾ÝƒwW“k¦l,Ô"Vo’Ëf&ÍøÊ^µé”µ~w9©Dñê"?¡õæÔÊi}³«¯—¡òø‚<¤ùaìeç*ó/<—¬Úá«Àkoð«@ï–ÀË`û嶒ï¾–Óß–ýº+ë²É:Xh$„¯h+÷ÛõEÎä|'WÊî’A‡é%ƒQKZ…LúáÝ[¦dÃЕ×;Xœ WçÄM¨Ë¾‡©|>ú·ÐWy70jԇРþŸºE‘Úð5”Y+*]µk¸ÇÓÆŸÄÉ«Lô j³iÑ œRÂÈWá3•0Õ¾ôü¢žóQŽâÅÊ—eŠ ‡Ç*6ê„ò~nIÉÖd þ+o74:Wh °Æ‚蓨ÑP ‚˜Ø»Feš©¬š(cÆŸ¦¸{`~2ºE³.öª ÓÒ4©*ôËØîÓœ&å[ߌ?ÓÐï^z‘ LBN˜(Û®dQmŤr€ËuÃe4ù,FT|Íj¸Ó`‚ Xçò†©Ç3’DT¬‹ò N?®rÝn7\)ÆE “8åš6 ˜Ø/çu’72–Χ¸,.n)(ýŽåÃCdzïÂüfr³UpWܱˆy&¯”¯}!ó4]ÆG–BZ¾¿øí-ÏÀzŸ.x;zfL Åìa‘%S`Ηà×ÝBûcŒÒ ËCYzzFðR¶!¹@µ/d¤dÁþd 8Ê¡'%Ž¼Ë¶–&ÚC@*Rs %1lÚ^:ÔY÷yfÄ!´ën‡;Ñ4ìfz&´MuÞï;®ö,¾‰ ˆøD‘Xf±è¿q2ƒÒ)™é8õc;JåãB“Ý£zwn[\kV=á¦ÐÄØF6ƒkÚf¸º'ýTHNƾ†Ÿ X'©œNÿæ17`ඤæ…îØ~Ú@Ó)à÷ü’¿t²»@¨ë¹%/úµ3÷å5! $“êÙÀå±LfMÛ%vÅÈ›ïÄÀ}îʪ’Þ3I0©£9ëG]ÉI` ,Üö…XõIÙzuÊ ®Û.—¥FdñéËëŠa©ÝP®wUÖqÝ{„Ò‘ñ.¦­³¾à‹*>Ð~l!íÇB9ðw4¼Í·B{DÞÌí%ž8@×Íç{V{_xb«ç—Ï€Z ÊæQ˜Æ3° ›$¾ ^¦½`L 'd¥û8ʲ0.Œ_eÚ¢P¸,³ie½á]ºøãÑ6„H#Ky†Gb-A à‘ØÌ4 ÄÆ@šâp¨fuK`ºìÃhd³ McP D4“ÍQÃB@ù€s·«x˜;¾ËäØ×N÷P.†oÅrËÚÁHfBÉÄþgy^²Ùäöº'¹ƒ½)§8¢ì"h·Ùm68»>Á5Æ, ƒÛJ°K5´1ÏSïð9ê –s3¯¡ÞÀJGéQ:5ûø¨š©Ð·±žŸÂãïÈûÇ;‰ £12 #ÃHËÐÁ÷hÿ…‚º#>D¨;Ïǵçp§é)NÆ:Ä2Ê$wTTÍÑ<®Ne Î/Ù kPЪl0¯£Q[þ’™t¸ô~Ú¦iáXÏòÿdë1‚-èz¨'n ¸·…TéÚ ;Λ´%Ûcî/knØLuP©áŠ{˜ÀN«yâr¡uªê‘uhf÷ë“+Ú1ÅÉÓù^62!ã€=HŽOU"+Ã)h¨=ƒP&¦ «¼ãý·èÄ[åÜÀ~›2&ˆÑbdÅWc7¸aƒìŽéÄÎ'z˜]àb›ë‡Œ'Bù–¿EÓï pÙ ­é6ÕUèáÎÀÆÀeÎ ‡“ÃÉlÍèa[Â0dv¡µ¿lª¯ieÂÉÙ<”Tóy”úƒâÑ4’‡A •"á0\»WÏCpíÕÄ‚4«#Š7 ¼P ÷+íî¹–óÀ)¥8ÕàÆvAËÝ׳[ë¼ ±åÓ8é.ŸH ‚ÆbL D¨@Œ¨ˆD—àØz7;<‘Ôs°g»¾/]”1ƈ¬,VòSÓàôùˆ§hj=æ `ˆ&Ô~¢ôË|Bâ[ˆçU¬8€êÊÛ²y²ƒSŠƒoð‘†úÄ‚ c‡ã˜n§ËÀ@hƒ%Iõ8^R:òõ˜ÅÿøÛÅ¿ AG!láKHìRoH‘²Š€CŒSï°okÆ¥•ó]ŽŽ 7¼A8B¢ ±°íĺQÖŒu¼HE‡‰ü‘ ‡P™'r(èU‰ò} ýö¤$ÆáS’DªÓ…]Hõ2(ùVX¡~дï¤IærÛF¨KbP$a$0Âõh6ÜrŒ ;Ì0œ&ã0ý‰8•GÄ—ÙuEßs—ˆ_ÆÃHƒK›@‚{iÅr)½ÙÔP©é˼8àA˜:L uÂîÄ[VÀAP;|0¾?žld·ç”Æ9%š¬˜ä”H˜£¨Ra2‰K¡B—/LeKH!Ê“mÉç+O¾$áÐë[é‘ÔäH¯gS[dŸÆÇfÌrÒ¥¦,‰ü2®»çëµôceIPñ„°9¹×~ƒ¾ö9ܽsD 'î¨ÄÂ,víÂq†æ5À† 깟hàóãó/m™? Æ´Ná¾CVA¹'¡¶†(÷xÚ ˆJ^eÞ`ù¼··Ý_Ë €+HÂÃÄY«=÷%•´fÏ#u#Y=‹ç¡ºÎºŽÿ¤€MËÄ1¡ç*8zæ>¬”Щç¥ÌW/y/+`ýx¢²ÉËuÆ©+«]0gõ‘ŽŠlÆ71#jZ拼-¡øŠI&É{”?‹'É3I›AyÿªgÇW³ÿW]k3óµÓá&±ûFg ÛîùŠ¿®ÊþÑÔ€•p¡’0qú"4¼_B¬´u9ñºÞ5åpÿ×”.aj ñÏ´|cåÌ"ª«Qr ˜;aC—Q¯z®g}/H°”S„ñòÎcÝ[–MÇl¼MïÝÞšBËä©’ù‡ÀS2²t3ñg›•Ï‚³+XsÙüÉôÙ8â:Z­}ëÉ"·#Ô¶r½frʳ×€Ú@¶c4$ç©™ðÌ·÷î¥NÊ IE«kÊýÑXvú·Ðó»Ù %]?Ì»GJëRløÁ`$0û±'#ø0¼S0Í÷žp9“‡V«ÅµYŠêCMA2ýú4ëØ°\!¶eeÈizOÇÏvÿàÙ­è5 ª a>it[¸˜1šëfðÍ\¡jY1EÛš|ëåvbgˆ»êb«¯]ö5!…ìëÀ·EƒoÏ•ôÎRâWÊhüS"’€‚\z‰®ÊµÊgÉK ªJ†—\û&oéY »ÎóFÅX'ÎñŸ—çÐ-ÆŸÎœ{,|C™-å÷܉ OŒ×S§!<üëŽ0&œRps9È( `¸2êûIyƒò’ Š‡WAÓß‚dN DƒHÌ ÄЉ7]Qäh¥¨‡Ã—we-ŽOkñ©35vòk€ *AVÓ¿ °[ãž²%“i Š7)~õEñÍ,×sÏçŸüµÆÿü¤Y endstream endobj 1137 0 obj << /Type /ObjStm /N 100 /First 992 /Length 1572 /Filter /FlateDecode >> stream xÚÍXïk7ý~…>&…j%ÍIÅœ·ŒBÛà®sIMÃ]8ŸIúß÷înãÔN¬ž—R°ÙÕì›·šÑèicŒÑC­.jq1†àˆ2Œ(N‚Úè4³ÉŽf`<„æŸ Á¬j(dÚ%é V‚Uì'b %1 H©EŠ'»Œx$-(8@³ÅO¸äRÍBp!ÃKø‘\#Ym &@©žÊF@c•ŸkÃCŒÂm ¥Ø(Ლ3ÁÊRˆ‚D°Ä8»ƒÅ Õø»Wl”á—j›*XÌöFT\’MŒêRCFðTgGA2bŠZ"#€U`m«£dÔ"&›R6d‰È”MN(‘Z ¼*qËŒ0,iO WF A ¡6ŠRÚ(b¨M]ÄÐlxŠÙR1²Ø[*b”`ìˆJã‡É¦Òø)bT²ŠµñÓì84~H7m(Õq+•ˆ@Ûlä« ¦S«°L°Š±Bå1YzGX™#«c¶ò‰„"i(ˆ!ÁXeÄ6¼‚ÒòWemerd-†‡¤pn9G ÎÚæ£%&Ä(@® „$´z)X©Í.ÊQ¨½e NØŠ5Vø±Ú59‘æ‡!Ò²"µ=å€(GÑVœJÕêÅ€/aAH±úC=:©ø…•m1¡Ö¤‚,vl} Zaež̆—½Ÿ»áp±X®gÃÓåêõ|õ*`ч³á‡áÅð <› 'ó‹µ{ƒz¤D¥øbË>¯X2¨ _R…Ûéõïk@?^.þZ€áðb}¹\ §ÃÏ'/ìÿÑëõûï†áÇ~õæâÛùëËõrå—«·ÃåâÍrÀ½TcyüäÉ {ðLZ½Í ²za¥ˆ¯:Ÿ’h¦Hû•T}@=ŠfŸ1³¨oýËkœtFQϼ?ÑmæQ°¾ØêÚf^T=úêÿŽ'‡ìÛúä³Xc©˜ß)ib æÐÔèËfßòÖíÑ9¼­MFyê´³©áÍçMÄNÜð˯¿¹®`Ò@fqýîÝÙ—=>_¤m6þm'¸Bü¦÷V“û[£n Þ¼äÙ»Èvpm¸{S‰íb·©Dƒ A¸bs†”et™p7 ¼Û잺áûåË¥Cf]ÍÛŽò‡Œ|ìö—[hœÁŽ5² -Ÿ¬d²}*d×´êKøº°ÈT”Ÿ‘ZÂL“ÌûDÍÿÑÙ­ªAuùb'=dÖŽ8ú\ôë©-t3³m92}ZŽ,_7=Ç­Z!¦sºÇ{£bñvÌuÇA+ôRÒ`En±2¦s9{ª]¸Q±õ•é\?)ÈðXÉ6¥Nç:2À$ä;w¨ÛÀ„S¢Lè:r€v¬©kz¿,Æöt½_·ÝÆú±Ï-“¹Ž8{û²ÒŒNM*Ó¹Žº­Fo?:€êqþÎuä€yîê:Dä•ët®#‡(Øiº8$¼õqèsÕ#æ¡Æ®$GÂy¹o õ¹Žê1A TêÆ&$!îíúý¸·d,å¶d,ú`ÉÈq+‹|E v|^ ØÐpîÛj@'8ƒä.KðBSÊ á!_m{Nö=9¶•sðö— ×XÒ¤ºŒ%þóƒHɽDnzÞ¯‡>Ãm"ûZ¼ó䵧ëýŸOnkl!žÎuÔCªhN]/§{!å>Wœ-¸ö¸Ú÷›©Ë9cÍÓ¹ŽZ„ •#]Àv¸§É> stream xÚ­XÝÜ6ß¿ÂÀ=œÈ(–%!èCÒl‹-‚Ë]w÷ íqë±'þØÍ¢èýí%EÊc{½¹݇É”DR"ù)ÏÙ;žóãŧ ­çH'öEìD‰'d’8ÙñâÃGÏÉaä'Ç:‰{3ïèè0†¶r®/þuñææâå¾ç$" ýй¹µ\”HTàÜäÎ7Zl¶q¢Ý·›­t‹»2+6o~zùCœÀ‘kæÄ •ÔE• <8ß½ªs`žÀÞ,X1.’Á¸5®ao%¶Å©-º‚ô,Ð\9 ]YïyrMq>s^$BC׳Áú ¤àÕ|$¤,µ-öÃY'Ž1ß²ìüu kK²²9IÏýÚ‚ Vß6íÑ~lfλÌyu[žª¢ïè‹œIºÊß•=‘Œ™£ÔŽð€N ƒ³±Nɬ[±ïÜ µÕ[-/§Q‹z0¾ŠzR%pë+ jÕ¨Ëì¿%”ƒ4†=þF„“Q3G¸OCš ßü@ø‘*È¢ä/áŒP0¬¹(Úr_Öiß´+’c) ŸEt¬…Ž¢™è2·ÉÒÕ ê|ã¢PDºÍüäæ`D‚³ôà§;ðµ/D¤Ø‘¬-¸$1#äd‰ºˆÖ`É Èð@ áþÎF³ì9Û L6´ŒÓHzºµéÌÿê-µW+q0ú×ÄNÆ ) 'hU€.fY8g«À)ä?ßp[Øù¿×°''ˆCký×.a%B˜¬B`ÅÒߊ5<Gñ³Ž´ðd4Œ»þ67… CÉU7õÝÔ˜ÊOäÂIÌ ÓF‚¹êp*!^½íˆJ£ž5¿éž]ØÀ0`îe:^DÓ¹rîî8èÊ9^³FeßÍ5XñSãÅàY-à|‹hy䪂0X&ññgžÎä)eKX%¸¡TIp}Myª€>©Ø’§¶é›¬©Î>l:¿›íh Þ³¨ÈªÆ NÂkÛ0ð<ïêžû7"þ»+x5'(Òži¯¯©­‡ãnýèê¢Üvxþ8OBH!=¼Õ[H×: Aº£VøûÎÙ!Ör‡ãPõå¡9áttæ‚ÓMçþPfê–,\´3|G•p£·ð]­ÞÛÅçSÓ2LÜ–•ñW:åù™ý‡g°gE×ÖV\†0åÔ$£Ô\fyK³ºfh3f÷5?ß\ÿr}óúæê{úî{²BØ°:—aM]qÎÝõi_f¬úìÓ:0Ÿ×]WîYBc-sÎäW üð—q‚HóËWüW{êÀ“XªâïÕšI­ä¶/oKHÑ+«}YãÅgÏ÷”ölת¨÷Ð_Ñ…Yí˜AšßÀ•r+³ò ·¦Ã½ç·¥%_k ÜëYÿ1ª~7 -6ÞljµžŠNËL bXgv>©íÚº4ËŠS?°0åk§Ü¿‚ÏiÕ«ÕÏ~–Y3u[°?d·Ýc(бA<…9>à®už¶ùãh°lŸ<”?Î`¬…Ò!1"(×^"Ç·D†á·O¼#ÂÖ|_¡½öñãæc=aÖ˜oƒÅ”“ #Édkq;é‰Ò7ø0ÏÀ¤ËÈ–CÄ¥l™`X(ánìiJNŠ®þ;³ÜuÑhÆq*/X ¬§籜Õbf„ HéŠö‹št6KÖŒ{$r0ºûn)S Ko¯F,)°´ij.c¨j†ž¾ëÂÔJ¦^lÚßì*ª‚ÚÛ4£B ø·ÍqvÝj÷7ªKë¢:ß Z°M/?c8à{ŽÕ :çJ¿ªï:~­RnV¶ÙpDw˨þx0š 4Œ³Kw¯ïÍP™÷)A©Lñ䣆Æè´`æ>'±¾ÝJmj,²öXÛ·ö¨=ð\…´:6ŸçÍö™a!´³å姡´µ¦9ôhvèjåеyNÀ±Ýø:9&@º¦u4¼ÉÊ­…xÙ=JàÓÊjrä-Ó"0"Çã÷ölø`¾Ü{ó¬¨ËR¾¯úòÈ 9ðy~à å¥3âý&.§âO¤À~‰w´H‘ýV{¾±¬ö$˜“Lüࣳ^áUð´3©áu 2¯2OåÀ’žµPO8˜EâÌd´Ók„ »ïk"uÜ™1ä±-O½·ÏÐO[+§éK󤛯zÞ,z“¥HÂÜb@÷ÑžK¹9¾`On5Û¦n†®â§9¼ã:|SŠÜƒIm]šã ž`Û/tó7Àw¤Ëð¯IŒ]-Ç#ûÄg¼´#±O}+w#•*ȈA™èEJ›€Dü¤{~ÑoÊœHà·CG 3dž* a Ú#ÏlìÃènµtO ¤ Xe Ï‹ÛR^¦DrÉ߬øY7CŸ|Ÿ|–«T¦ÚÄ® endstream endobj 1257 0 obj << /Length 2891 /Filter /FlateDecode >> stream xÚ­YIwÛF¾ëWðyóDhìñÉÙŽóæ%K7Ð"1‹%½¼ùï©­±²s˜ Ù]½UWW}µÀÙì7ÎæÃÅ.ü;w+;ÞD‰c»I²ÉŽŸ¿8›F~Ù8¶ŸÄ›GšwÜøa ÿåææâßW·¯ß+g“ØI¨ÂÍí½Ùų/ØÜæ›ÏVhöv'¾u½Ý¹VÑè¬Û~¹ýåõûx²ÎbÛñ"Ø™yN¹p„Kó‡y“E;³j§" z¼öÔÇ´yÞîXŸùïŸèF“ÕAdžgN<¦íOš¡4c3éïöee7å؉Rfâ©Ù®¥ÿã¸þÓì&ó[ï"l³s]; D`ï·;VŠ¾Uén«bëq«"«n˜XTHëtsŸfš§Ò–ǺÑ<«;¤ÓêJOv‹p·Øì'å[×ÊݶøB—@Œëêã§k^3ìÜÕüŸáêv`“Vv–#à,á¿;è#™õr#ó@ Éìî° (‹ïûÖ< çùV®ïÓ¾ì.±ç SØÊðÄCÄ<¸VË#p.7JýTdõ¾IO‡"KËò™Éí'C.Íë:Hs‘uZ>ØmP+쟆ÿÀN|—ù¿=-òïZõ©+êŠÛpVMR—1”#þ·'¡ÎŠûg¦<§$\îž½ífؤ-u_æܾãݸ#òiµáA¤ü7܆x%©Galýº8på‰äxûyêXÇ­cÚ ïçÖ‘Ä6¬Á8æ6¡Ûp EUÆÍO¾×M£ñª*a ¹ª«ÝpnQí™:°ˆ·‚7D‹ÂUdk6Ø^ìì ê¹À(Ç3ÓøE )o¼Ùy}1 åLd}«sP`?åô½ÈÂÛƒ6mÇ}2lµac˜z(ömæ± t•Ñ“QÑå¼p┹'î9ÆÅß‚8<¦&HE#¶“¬¦©‡˜1^ª’éýTfRvA"±ý)'áBÊO$cßñmoš.õ×mZ€xÀogÌÔ=* šó\Ypä _‘8Ã×vnê‚Òˆ¬±C8J¬,…CìL\‹`hƒ©âL¸îîŠ:Œý;ìFkåçÃöÄ€´òíÄ éß1.õ-‚aä ‚s¸Ö_‹L3ñÔÔû‚¬.y8ç¾n«:ž´×^N–ó#=s§©ûŽ$ç…Ì77à ‡oóuË×;[Ÿv]SÜá`¨À»§ôx*…;jí¾GÑ‚&­ Z)žìA ¿,øŒ(ÚŸþN4â-„Fr!‘`Ì‹Ä°ý'qá£=¨9+m†ªƒsºâ(³]ç 4¢(°þÁ„›qÒAæ•ÑUî×÷^½ë,8z¥»ƒ#1›(Û cÛµÝ7ß]h&;¶óÚ ßˆY®ÜçJÉÆ›õCEQJÊ l'q‡Å…¯_1e7K™ùÐÏôPP ‡Rè´E!ë†g`ЂdóLØfÅäñ{ž±½{žq('h"Ô· ºhäØÑ…j+›dYÝähé+’f¨âôÑD(Ìåžx\ŸÌ¤Èùlo˜YêÝTºä¯Eº›ÛæM;Ž±@¦# ú¶;yß ¬?zðP‚Ô¡xÂÐ0ݱc"Ò£`w/ÖG¿¹LÉuÊ“ØÑ @Êàjhžy71ïF‡VLãÀ)8*‘PzW²#u­ßn˜ö@‡4•qtåÚ#õm/¥ <¤U^Ò;¸¢A¸NsÐ"˜ÈZ‰Î¸ñLg »¢3@^ÚE×êòžÛmÍÿ³pûš—6ãm1â`ôl-LY£`ŽËTüʵõ‡¬uƒ‹ò|{/p„‹4V*hÌÔ.X8 ù“à÷÷<{¦vLÊÊöj´RØiêáD&QàaV`0ÎÌéUl9ˆÔrœëÒF]™¸AÔ]ßò`X³|N+‚ ûÍÀ`fg' Ž¡·Ø:qüX·¢Oæ2ôLò–¢SÀª4I{¢h> Ãëoßò ¾ï13“ÓŸÜñ¡BrC²"DUêÞì=`6È×àGÖ™r¦òkXJ‰»b¿¥T(95àî|]vø´xÊÕÚ7¨$°t…*ŠÅk€Fú~“`.Þ`ñ—cJ Ya†ZmG@‚M|ŸFsmS<0’M¨‚íßnøÙ°Mao‚vÁÞ¨2 ³æ¸¶È5;„OYŸj4ñÎ|ÂiôÔØ@VñÙúƒä`£ç®µ[3<=ª8Y–ˆ[¦òÕ¡aÀSfsÑ[ø/²V’Ùƒ…3„'´m% °àçÅI𖇼!\}¬„Ä)À씼hÓ“|[J›ÕÅ Ù¥ÉhرR¹¯ËžzLy ñË}u*ûý^çøjò©îš?ÑñDÆû²Ÿ­ó ùFyytS/gg¡8€ Š&Œ³Ë0_ø†ïjhdrÅI™ø,tKÆ“E¾`R"Á1‡M±øÿS+V«µb‘Ç µâpËp1w—6Ù¯.¥÷ã«7ð:‘ªÆïž²²Ïõ¢püöÓ?á¹ÛïTpÏ®óîöâ/²—€‹ endstream endobj 1292 0 obj << /Length 3287 /Filter /FlateDecode >> stream xÚ•Ë’ã¶ñ>_¡›¥*—$ >’“7¶Sk¯c';®lWCbFÌR¤ÂÇÎN¾>ýJ;sF£4ú Å›ÇM¼ùëÍnøÆ›dS¤Q±ÉË8JÊrSo~ù-ÞÔ0òÝ&ŽtYlžï¸ÑYßvóáæï7oïnÞ|›Æ›2*³4ÛÜ=8***Õ~sWo~ÙfQín‹Ro¿·CgÛÝowß½ù¶æè}Å*ª4AeˆrËß|›”›DGJg)bß:ôÛ4ʯ²»M’tÿâ*1L€meO¸;ØÝ­V¥Ã¿Õ:Þž†~êw@x[õjFFëú‰†ûƒ5­´úyjºGGa—l™HDàèy¦¶ïºq²¦æ ýãVýñ¸´¹k*#$`ø©™ŒÐC#ÙÂ>“í°¬eÙRÓ1š`Á‰ñI•{á}g'\à úáã—€Ÿªmƒ'‰÷ÛmÒýp4>w"†¾kþ ›ê; =Ã÷í»|ý… /‡Îdî[+r„—¡ñ#lñ7?Ät`N¶/·oÍ hÛç]¡¶´ÇÔïq´]-TãÚý.T™ó.°™mg>^m&Ü öò=Xn|ÜÑùéú±oºšç> ýQp›£=›í!¸GÄ+Ó@Ú±'¤4ZA~:X˜85¼îþh_:+QÉóíÁ ?Ñ: ©›ÑœäRÍ`k†þïc¸aìü³9žZ‡?[†Ò†0w åMåfΧ7u‹˜Êº óâá1yΕþË´í¾€3”Ÿ›%vdØ=Ïv 7uí4¤v0þÌ£#°±ï,ØvbÈ‘Ú £:$@òƒC}ÇÈxdAR˜4Ï£½Nœ¡jËÝ¥¡IË(–   ¬R Ù*†û¹œq”à n« ó Íc×ã]"³p~”e¹ðL,±W©­©*{šèò”æ;h?Ë0I ^J䯣l=ù¹™æ´õP£ªŒ»RYB–Pe`•Û³áÓÕšfâÖÑ°ŒnÀòäE[*Ú Í«† Ï»oáÞíÌç©EËik0$û4+»’)á­fZt’¬i礦å!¿-ìȶ¨ÉÇO³½ÜÀL;öܪí'Ðö pR7Bh[Mí3£T}×Ao㜣q#´| :¦Ñ.»bšÁòó8“­¼¢=GÓ™G€2ñŠ€í?àœÙ4Úöa¨fä¶áÏÉ #ö‚ôî'A¨ëÁŽ‚ çø5Nôã LèªD×±“埜a‚vÝw_LØ°`[Cü"½ ¹qàM 4¡‹HrdŠùpåè$ –„¸”zµŽC7Èå¦NR²Ú<Œ‡] -JÄxc›ˆ³œóìg6*=²1¤¼J\ª?ƒPô««Å®œ‘C“rå[°O ¼£#BßoÚ|áö¦¡á“ðÓ`Ù…txæ‰Á’4µåK2²ÈbÛA#ºÊ’´âÅð …_4g0¡qO•å:)Ø^ͽyÄ‹¹´´g'wüÛ§^Ñ.ÌnžD*Ù_š]6w·2ŒF/a”w(ã*Á+c3™²ªtœOþ2GõJ¶ ãâæÉ€h1lJ Û—Œ$äy€x‚P¯Cƒ='N q´RL¦#ݸe£‹H²y6¬€Œal`ÔpÌE³ˆ^‘(bAVr$ÖþüÐ0Äj;56 Kp¡LÆ®´é¸Ý59÷L ¡êÙÆQWhƒÑ~fò÷ÈÆé™{ Äí¤}\#-”¡š4\YçÛûª_‡q±éâ`.î(+ÒÆlj{^Y°x ì[qü©!…êèÌ)Ù`k‘Hí|Ú`ƒñAσáî%q††ÑÇaFs”åžîÌEê™Bü2­L²hºGÁJ|˜] Ÿa6G_WÎŒÚþ7ÀOjâ<FÙ¨*÷¬·ð]9C ½k'—æp„±çÐc¿–,èŸÉ‚jîsµç„.€ÂPAÅÛ·˜5Ó@xƒ´fåö&YwÈB}âõ«þ(Pï™.¦—, °úʇ³¨D^«Ø>«í©9ùE±{a›¹ÎA ¥âUÅj)pD‰”8þ⇿ª \rîHÓ8Ú+ÍTNv05¼^a’¨ÐéÊ}·Þö6É¢Rekcz‡ ¼mÅ8ˆ% L $LÂkღ¤žpö²jÉq•f™ ¹xÉoÁ„ܲs„øk? I-^J*0”=ð·‚uBO;“ ðù䥗{›ê¨Œ‘KE68¦Ä(…ª—\Þ§‘Š•ãr7ïw{pÚÃïq:Í#Uæk!¼ã"·ãÍlJ-<ù^Š?Ö ZPbÌ‚©ÀÕåV”¯h(íYå¯à…,êúí¼ž…AR½âœ‚ø­x…|f‘γ5Ó¾éÄ抗a˜§§ç‹ìaRŽRÅäæÂl¬#ðàà„íÃoµT# -fã¿6öH&Š†Ë‰~Ùñdøx-Œ1õ±é@±Á ô†æàò94'5±8sH¤ v**} Ñ"2ãéÐøàÇ8>ÌŨ#i—'`¸ +—¸:&î…”}žý0šÓëåâ¥`%$¹ŠÒTÿÿB¢ H ŠëR¢tqæÃÀÑ[áw£t¹,-¯–Wu@]„AYáT¶Qnß>ó„Ú>·1ܧA±ÈMv+QàBËÛû± SG‘ѵüñ Á²ýŒ•")±p=šÁXOi¨^¡8œr9JÍì,86À¥^êb1J%ÐóV÷/a 7Û•!dÍP·\^È ¿!UÊ-°Ð]J\\‘Ê ¤š×ä+¸®4`""¡ñDØJŸuPÒOÝ-q¹ë‹,ˆèÕ1QÁ/YÈ(Â9¸þš0²dûúJ‚ £ý⇧¡™ÎójŸ F(¯W¤rNòR.+8Ó£,ÊR¿ÎMiÅÅ™.}°-ÝÊÖ¦$[›PìûZ ý¡ŸÛZÀlÄ )ˆ ÉT²ÅRQkqI÷X|”{¡ö÷ÁBç‘%,è"Héú`A˜üÕ§Ý>Ûš¦}){úóæÓÞ1žeÔŠ25:šDȃ¼âjE6Ž+0ל'DIúºû„cæqv™¼çJgÚìÁ~¦T£Ä¸yç>™‰í,HTÊÇ/‚xkXìRÓí‘@ÂðÊ„«Ÿ†¦åÀ {vH¤àŠ4[™¾xòß|qË9s—?åéú=J§zûOŠ%iáUýî{L,u G!œ˜!èìŽ‡Ù‚ç ‡pyì&&kÝÈâ9’Ž¸òRLzO%@.‚ð´5™DR¿^‚·o.7Á0'ÔrEš~µÐL‚†o›:Þ~ÕŽ=¾ÚÁ%;~h•ºG@•\–p˜I.¦vˆÉ¬XkÍx8§c«aÂ)Z7ç„þÒhâÜ)ÛšŸ^>gÁ ¤øÄ8³Ñ ”ž«oØ4’)Û¶1÷hz%H„Ãü>Ù.yNßÔ ê—ç:oß—ü{䶸ˆ"ñÑ"4Ç~*‡J`£G)¿® Éâè<Ýõ‹OpøäðX)‹ùMŽ^Ù°oø³¨³iãèó%ÿü‡Ï†µE}ïÜÃ!ó•´éÎWö?ÏYã‘ÅË“ Uúð]’C ySypmM—÷D÷~}Ë!ægé.˜r=#ú>ÌÃG+éâK•è$ÖI8Óù‘C›oî‚N¤iip— ¸ÍpÏþ<¡‚?O¨(QçŸX½0Bš“AÊŸd^ëâÒ¬‡&Zi°ÐÞª› °îþÍ\üöötÃpJ”žàºþ8ËM íÕ~ígSÙ‡Y‚,ü›áZM¡(¢ò¬$ÿû9›Žâ¸\‹éO¤bà>«æd&üó¾ËF´*üFäÿUXØ¡7Mú3FBUoDáØgö mùw…íä;Twí˵ËpíBÖöÚþì _+'U.õFé.]¢ ú냖"¾Z 4×­ ‚¾ /=£ò^P¸g 8Ì#÷} Ú³dr²€l$fU„´üN^óy µ½jsþÖOÖ•ŒË g)¥KWîk‰’h7cXXZJMKªËÕA|'ßSÑ#q(zî šü?Ù“Øm endstream endobj 1223 0 obj << /Type /ObjStm /N 100 /First 970 /Length 1235 /Filter /FlateDecode >> stream xÚÅXMo7 ½ï¯Ð±íA#R¢(F€|ÀmbÚ>¸Î¢0ìþÒßGMw»®V±ð!1gæéñ‰")i‰S )' %ûßZõ¿(3 ÂW7(0578p-n䓃©„\ú' ÙÊ Fúð6w€¡ÂlA*Ø™S¨ä.˜B3M$h—ÃZé` &ÎÌ-˜9ãu*>>cHj®1³+qí¤®2çY,¬.&œSªY»ËÍFp‘ñ8«Ïð1Ë/øOØ© |Huî¼"P¢*®Ä5Wä_êD\ð¨Ü Æ>‰ò6sblöiZgø²Î"ˆyê,ø€µqÿ’±=’\`õPJ ˆPw%ù,¤`ûXƒÕgÉsíc+˜k[Á¬}*˜UœËËj>¶JàæSVë!ÔÀƺ2ðšvÞ†L WJÖ=àCNæ”B¦¾RÊ°:‡"w¸+Á"eîJ0œ»­°D0 UX]‰ÂGéJÔ<Ý|}0©,¾üŒgQWÐ࣒ó!\¹V—YSÿ ê Áȱ¬ÍàT¹õdoðÑz|XÏñœç3 %Uÿj9ò™ƒ³p—lVV®p—l^%Á…yyµŽk¡è–ÁBä‰)A}Á‚ ÁÂbXæ9é>ªç_NðQ= > stream xÚ½[[wÛÆ~ׯà[ÁÆÞ°‹ô)v.uÒÖn¬6IÎ)D.ED À %žþ÷Îì,@€„)Y‚ý".ö2;;·ýfE³ëY4ûþâ ¿ÑŒÍ ÍL'QÈ’d¶Ü^üò[4[Áȳ(”‰™ÝºyÛ™Œ üæ³÷ÿ¼xuyñò;Í’0‰y<»\·TD˜5»\Í~ â0ç “ÈàG[6ŸÿvùÃËïLoT&Œ„ªnÐ8å"ò¶¿°‘è-Z´«\C§ µ[[]ÛùBqìÒfSÓfL÷Æ<Ô±l7«o³f¹¡iú¦ñŽ§_òl›5#Ô‰vZ±ß^Í l5FQ„ï6þmpÈ¡@LF!ç,L”ä¿ê}šç÷s#‚ó…ˆyPð¸JWó7­|ŒƒªÜ7¶¦¡´²Ô°w;˜¥ƒ²j슺šÒÿn,-¼™ÃR“{ÞU%ÎÚË25*¦‚Ÿ³fãGSji'÷¬¸öéÕœ9ÐdÁ ZŽ]á™,ÛÕžA …ÁaÛHƃ´XaÄúÇ>û0W*Hs êÈs ÑÐpQ‹ž pé #A`§3Orµ¯ßØO2( Ä£ãÀµ-l•6–zËÂÓùöõßßQׯ‘Š€¹4_,Ë£óÄÞ0‘Ï}Þd(3˜Î`¡ôüaSë²¢>›.qò†ž Û Nn玱ÐÖ,¸Üd5Ó¯öµ]ïsO!¼öó6`sÀ+jñ繑%Ù×û]ë›è|²ê“Å_]²ƒû8rÚŠbîͧh8ÜT.‚_|{ÙCG ´É™JTx‚ŽD‰‰c|Ôß”q˜¡#¤#æAH¹¯–öåYD B©G2p §g“xj~dM¿M;5ÛAtÝ™yÁsë—1“~ ê¯Ý}K¦ö{9­/VÖë´XYº‘ýú·Íÿ[FÑâÃn$çN°ÞÑñtÌ¡ûnɹ+ÜŸÇ~]hQ6ǃqvº qÞ[ßùÒ6Ë—ÙÎñ—cºqÊ×ÀÜYíó01ÉPû}- è8ŽN¼òÝ)jâÅ] ØX–Û-]~CíYë^½ÿæ”â´(ÇU%zèzWiíTŽ® §y‰nõ5BÊË7¯½÷+|÷ªìíåÛ;ÙªôºuÈËͱ· dÕ"´à[°+ B`ÃsŽÙQ}\}Š{nfÑ4* µYqùÉþ‰a°3|ædì%"€m©ü64ÉÙ.ô‘íÊÞmiXðóÆÔ{¸!s?¯N·ž|—È6žK Kºãe<ô}¿ áxÜ/L´0™8>F\´;â`5 ‡ÏdÉGËš€¸j´ n]&-MæE`IãÄ P™j*´v•]Ûª"$¯!§øçÞÏ,é·¶Í8w­¼±ÕÃE§ÇÎ{rЗ{æ{M²K ýf'¾`¡0¼åÑɾÈmíiç±Õ¢»åÁR`n™=ü!UC£°v…(蜧1‡B0ïj>Pd»sžÆ$Ä°d& {ž«1ÈÜ¥v¤ò¶ëºzÀÙ ;–ìagÓm˜Òµ´Q cœ–‡»f ÈîÀQœ@¶mýç20>2×ØÜ. €ã| âÐúº.É›JëÈ›v›¿¦5­jFA»O7Ú¨ý1€úæ×=±e½é”úvóœ UŸ)øJ¾Òˆ)‚/’âÆcàʦùöñÁ7þ¸=€üµ%‰j_œ˜d'ÈàuêïJŸãÐþ»JIÛ¸ºJᆌ—4a™§uM7EÓø\2LG|™)ù”¥^–;û¼ k>}½û ½ôc€“èzòAÅm: ‡g§‰¸5ìXuš€Û8ø7b•4ÏV4t€EôLqÑ‚+‰T *Aº¿ÞÐà{ƒûž·íâ6·¿ƒ_{NË­=‹Q VA gw®©ÛÅÓ•?°éÊ:÷»Îª`A/ó™3<ÑÁ›†† t÷ó²B#)-Cúâeme »ÿ“;2ÄúOÔçdmZ„Ñòöbì·ëŠ=9½4”^`oWf3mý;m]攃®¨§ÙP½•q¼Ìc$@´7ÙõÆaè:ØÉ L]ux“F08ãïrH +BÇA³ãU+7÷¾ÙP|ˆáCm‹DNK½pŸÕÝÔyVÜœÞæà•Zt5^ô®„·ÿ6ÝߢO—¥cUj¸èÀÃu^ººr:R=çf&ý-#ÜÐ%`¼…Š°gQúœ -Ä‹ÊgcH¾Ëû.ÙcÇ<#sK|ЃFšç>ãˆTÈ•Æàbùåniw>W_ÙÙ²%Õ÷ÜöâkS\á¤í¦ øë凈|Õº0îÔÒZC >¡g×Ü~à š’"´ÏU»œI+I(Q ª±¹ž”:~»EM‹?]+8¥¼ªÁ:-u¶õO\Ú«¹àÖ6ó{[{I§rÔ iöÕ5¡ïòõ;êl1"èe›ËÑHEì8¨íH»j# *€*âV¾’w,®À;/-£!Æ“ð -‡|¯!ˆ¢cl &Bž2ÅÆA\ãŸ$°tóùLÚ……CÜ’²}FÞ•»,[ã»1[Õ´æ˜Ê)b€IYWmC3(ŒâíB‘NiÅP”{)güjDÇè^šQq’q3ãZ†:y^2qtìH©Ä'ƒÛf*jðÁ8a‡ŒyÄ6Á“¥Ù$Œ+ji†Œ;2ÓpI&z’]5 u¡¾”¸8C ÑjÎ9Ç$G9¿€ZÞ>\yóø9‚žDÙ =0øÇèZ@|Õ$ËÅ_Rb„FN"1aL˜yGÕ4O¶Sq–q)4\âb Æ]9C?J×2æ!$áSl«© Åu^ÏŠ‰P±I8W°]¬NÿVO±Ñ ‚‹£këì:0RNr©Xž…dX41‘šdW­ ìútÉ.òìÙ»ãa,'aã!š~Ÿùº†ü¶ÞŒp?øXê‰Üóæ(1÷\óP&ì1 ç‰ÄzÛ›¢È´ù’"Ø’'Sp¯0U¬‡Ü/oÛᨒpöëç.à:d\OÁ¹àݱzŒ²!·v/|§ØUw+þhy=×·»ˆþ|ÖÛˆÞç<]}ØÖõŠèÑ1“DtDû&yTDŸ`×6¢÷w}ºä°P Äƒ!Bœ€ùË G"«lY­lå?¼@ñPDâ™àÍ–MqnÀleò‹È€Ø&±4Výéb“Ïp8•ØdÄœ·÷ùß”»ÞwσO¶D—çZ­„VÄrî ⇕®"Fj™©(™I>Ihbâ ) ½b’ ¤´èh9öÕ$›bN Àf°é6+ž”èÈ~1xz4 çš…\qþ‘;%áVñIvÅ{„’8ubü{þ¦XîFO§¤.lBOÃy,ÄqžY3½öÌGؘ:”1›‚}!#—EŸ°_}>ö% Gæíú™ìK@ŽÜëûly“.o>ûÆ„†Oâáºÿ(°ÿÑ— RM"7)ŠGr³Ë'ùÛ®„­z¼åb< 9& -MâI6–¤`9¼¿qšçë*½ýN_%¡ù'ßé ÿþ·wévGÿröý¯ý[élK_`â§?eßý\ï+ÿÆ',Sßð¯_Ë›ö›£övïûůóp¢}}-zŸ&º¯ÝGCþ£lÿ×½ òíøŸ\Üßà,Ö_è•ÑØÌÿJbqÌÁÛjðI”{9î„Óþk¾á§’މѿ5¾ ¯1p¿=­ÇFôßi”² endstream endobj 1367 0 obj << /Length 2293 /Filter /FlateDecode >> stream xÚ­XYã6~ï_!`"c.Û2&`“Lg'Y`z·ûmvh‰¶‰ÖáˆTö¿o]”ånMf³Ø‡n“źÈ*~UT‚8øùê·«~ã Š4*‚Í6Ž’í6(›«Ï_â ‚•_‚8Ê·EðH|M¯ ø­ƒÛ«\ýpwõö:ƒm´]§ëànïµdÑ6[wUð9\G›h±,¶yøéöæzñåî—·×ÅD"_Qœm@'±g²\ÅâßË_0—M„—yš’ô2Ý1c§¾s]ÙÕ‹å*]…÷ºoµŒ_,7Åfþ…§7½iTÿÌ“¾œiË´ñ:d›<¼=†´u<»YÀ’rGž]›žVá¿âU ..’ð† e>Å?¿ Æi–]sªõ“°µ¨ÕéÞt=/”Ód ÿ=3Û©íäd`Ôj½ ×Ë¡ï5«b-or= ¯g×ÎEMœ¿~HÙ÷<ÉÈwü­À(H€)ÉaÜêJZ=†ãûÀ~½ >Ç?¯ÑìÌžfé%N “jE! pÞ¨ßÒa;k¥¸ßÆ d3Ðèùÿê6¤EüÚí4üè¾ýjîDkÓÞCœ „X§0èé–sDE÷‘‚Èå‘vL-\=QZ¡ú ‰Å[Aá;“~g!­JtöÈ3¸ÿppŽN®g¾FIvÁ¯e’bæJÁ}VV3±Ò¶ìÍŽÐW)Ä=¸®íšn˜ÅBûlnð(2HE×ñÝéêîð¼(òS4_‡F/‘ë¤zgJû%kH¢jÐóø¨D"8þšJ²Ú”ªfR †äbÀ¬Û‹yº 08oõT2¨ë©91ÓíY|®Þ¨†Ž"ùC×wlx Þ”C-» uþ™†5ÚiQôhFÚQ7VלÐVÔØ u=G¾s”51!;@‡*ËÖ‹KäR,ùÞ‰²»pg&tè™ÜÂ,ËÃð£OŽ§(‚y$øü‘P’zÃCÖƒIæÐœs…ÇTžq°c°ŽSmœhé„DÉ,øEáGͽV¢Ôˆž®¯(&¢½È×/Ιpî³í†¾Ô³YEÖ "HZdáQú‰# Úç@çÇÐ…ã±ãÄ´ ×(*AD ´L‹4ä«Ñ-×¥ózDI#±'ÛFnÌXoÙî{¹ ›x¢¹ Ý-Pó‰BÌ—•‚L‡qN¶ÈKFòãhªŠJ#²u¼6²÷’.™hš,]$Ì9f2꯭ì8Ë·>îè^^`ãŹÞ;5ƸöZ¹¡×ò÷-•ì´Üs¥²&âXí#áŠJ#P¨ÒòPšvh¡é˜*¦r¨Öà¸EÉÀƒnKÕ4݆ŸÚúùBgcZxa×brR-ÎúVS”]C]Wб­ËÙ·¢$ñö1‚ìF5~çF)ݬǤØü_6M¸Œ±Æ%iD@–W—'R„f íuƒ¯[|Û’Ìßt]w”c\*åa}ÍÏÁ?–:Á]“®©ô\ʱª ¿ó‘::®¡êµõ¯Äóóûé’°3pÆ2쨇`Mà+úÊÛ>‹£8ËÎoûTÞö?v->“C¯þ«W=5ª™oáñE#"a¤™Æ]KŒp1Uþ†W±Ì‹0·¯Ù´}E•¸¡væTk^–·'•&{iC°(ÔÖ‰óy"Ï#^.ƒ~VQk@m&ϼ/e\7U4¾ô&Ø{éÈB#Y`h¸Ãzæ™oq€báñÂ]ƒA~_¡Ìåþ_˜GE7Aº½ÄÂ< šŠþYö¹$kƯ%˜[Ýøî嬛ì–e…l#“~\$í¤Á̲×aœp×æ²çÍæÑ ×[–hÙ³]ß©ªT^ºÅÞ¤ÀÞ!êž/Ä·>&ãç² üzöúÃagO{}P©ßûOˆ_ûFÜïËdUdømJÉ7¼ï霎ïßÍå“¡s*å“ ©¼­¡y?ûqкa7ùúÛÿ‘ D¼ÿ–Z]â»`ªŠgŸkÓ7‘þ2+Þ`C ßÇø›{ç—±™êõÉf¯w>k¼…Š;VCsþÎáÉ«œøpwõ"þ¯x endstream endobj 1387 0 obj << /Length 769 /Filter /FlateDecode >> stream xÚµVMsÚ0½ûWhrJ8þÀ`O˜:Ót&—¶Sn”ƒe[ƒ,¹’<„©óß+°ÌW V½`ƒÞ{»+½]áxà›óÇñõÓ>ˆ7ÓÄsý$¨tK¤zåxî8‰Áf+Áxë'¿œŸÎ—¹óøx q“I0ó¬S Ý$ŒÀ<‹û‰;uFq2¾ÿþëÇËÃrþúøŸ0ÆQìzáTkîáa²ƒ8žÉOˇ'àQÆn`LõaËIqkªFQÝ3)aû6“¢Pñü´SÔj#ßw“(êá .Íیե%!¸Ê˜´ % “*.,ò¹KW„µí‹èýõ[ÃjÃÅZ¶°¿{ÄØwãqx®?«ÎÈ[ðn±)HšbÖGgZ¦°÷> ü¦°`þ§DnÌ?lÓ¨/ø{ß9IU¯ô6…[éõ"‡ n«°°€¬ËŠ­²×¯ö¦*ƒ‹ïT»£4…-Ó^dð.àr¨f›†Úm¦E­¦”iUœÒ¡vxßc%̬„‹+­wŠÛ@b16`ÚÍŒš}~cã0â,pJWô[ ZÕY†ÍhY0.JH EŽ›ö@ûg’!SÌrU ¥¥¶•ñÈb%8L”ªYí?+®-Æ÷ŸM¥ªæè›à\ƒqvä²U µÔ“—tü²Zž:þB‚¶6iw¬+Ý«RnÕ†JÔ]&'ùØì6î柫³›ªL4¬J(×6 À¨«òPïMÆ*K-P•&— &y1hW¥L½Ú“õ±eÇ ûïÓÆOœÑí²÷Æ4D¡”M*Q5˜€aض,¬U™"ªƒô!ãF’²¢¸Ab[)ž XõŸ–NM߸f7ïfJ_|ÏwŸ€~˜ÁÅt9fX@eº-¼ì"¤ú×+Éœ“· @„p¥>å”bcH·s†U¾4ß™ 0‚¿½ÈkßÖx‹Í®–itæÉ“%Y@ÿl­(!²Y ¢ÉõÅ0__Œüà«ÿtöÏ·{~;ÿZm%. endstream endobj 1393 0 obj << /Length 2188 /Filter /FlateDecode >> stream xÚ¥]sÛ6ò]¿‚Ó—R3Cüœf2“&õMÒ^/Wû¦N 1æ‡JBv|MþûíbR’éXž{‘»‹Åb¿AßÙ:¾óÅ_‹þ}'p²ÐËœ4÷½ Ï¢Y\ö(ß‹ò̹Ó|%ü×Îåâß‹Ÿ¯//Bßɽ< çjc¥0/g±sU:×nâ¥Þr•å‘û¯ËËÏW^^d;¢8ó|–‚LÍùȲð~ ž0¯Â<ñb? $£=ß~Â=À¿ /ÍÁ­ÛjÝõÃr‡±û·æ‰/‹ÂcÆWr÷úXB2h³¨åV®kAl«9)ßil–v¢à­ìÕž×tB-Û‚^ÉÒœz-ÛAñ¶†Ðî›×ŸÜæä¬JÔuw°aöè^¨ž·C#Õ£œÆwü;±ûŸP—«0anƒ—…kÈ 1ºº»¾Ã¼†¢«‰h•hÉ{³‰JÞ¢(³îZÕ–o „ixpš"ùÞЫn_—´i?ÖR~ò&zAñp¬Â\xÿ úº^à)ŒŒ½\.·|ãÁ²'–ä#H¿ÑÚ+Í„f¹û¦V Õ¶">ìWø_¢®ñxe}´‚t´¡d"÷+ úÃeE¿58ž€îE=Ö|h ²ñ<@ë6JXI½Øˆ¾åÜ¥ñ®Q˜»ƒPhE˜B WïßÑ¿å¿«ºÚÈç•]ÃeûRu;íø®î¶÷DÁr*¼­ÚFq»Q9$4x¹1„Ïh©£pl9ê0;>ÀE‡ÑÛ,NàR;Nm W  ´îš¤cªu”x"µí‘X™-xí*]:†IB+t5¹ÃŸ®¿Á" ®‡¢l $õX˜PE—‘=r<ªÄŠ®ÕÜ圑$äŒújׂ×5a¦`ádAÀa¡C&}ÆašÄâ0îï–—+ I+G_=˜ƒ—ŒPôŠFeÆ•ƒ"npF!J1×%ùˆ”¤RY 4J ÷—xÈ Ëd|V™ôŸQ%5µ_S…Äâ/ú'«äÓ j®PR`1°q€04(¼ëvß C%Ç€Ú€ &9z–e”o@ZSðЂÓ]Ãný ãTOxä‡d{˜ö,@0ËJèVÙž(‘ú\ÌŽ£$g>ë=z* ¡¶áÛÎà9¾tÎh¼÷¥¡ÁÌ’èùêMKhŒÕÛ‹\ÄL,"ZÑzðn„‰úÒèa»<YRg«ÔåÙð/’zW3wµ"²ÀèJ)Ån;3'¤Ô‡PUI­*à´ª UE¿é¼,9 !ë„;+ŽZÜJ{Åtêò¶…GK¡/¤¹íØ’ºE-x?ê1óÇj­-‰BÚÙ!¸Ó¼CjDîo—o<Â^ qÎl“ÒlÃÜ$ÏÒ“ÙFã½ ý ÅeýœD~Ö¼c£P73Ù&^gÎ8Fñi暦3‡ºïÐpˆàÑp¨ÛTkšú§]íw¦›nÆ.Ƈ1© ×sÄÛà¤ù×Y‚€é=˜²±-oj˜ÜôkÐÊ*£Ÿé3q µzLÅAo·fÍûÞŒ\è¡ØOÜ«e“Qm–j5eúTä¾ýø˜ †©å¹é ,†›¨b‚áF?1è®­…re…qE"ìM%q—¶¹FS‹€XÁöfä‚9:; ™—çù‰·O†éØ@ŠqicôÊfHyF°ÏŸÍEÑ잌թӜˆdÐÂ̲]׿“<”Æ/ Â[¬—qàÚw,‘y>ä‘aýüÝñˆ}~ùSŽ?;å„/PO,4~ Ú  ¾šˆ+ ©§p`Ÿ¾= ö—·ÿüHx=Rþ…ߪw¥ÇâgdšÞ%\U8˜Ñ]ù´·Yì^î)'fGI͛҈æOhþDˆ’!¼”8á„é8:–QJ…ôTc6uãfà ð1fR¹Ÿ©~o¤ŒžÇ[Ì` š¡ÀëÃ+çG¥§‡ }ñ™Û¡ÀI’Ù ÅO§ ÅÏ0Ý: ™R0ÐZO#À=yyso8‰@a©1VÚa³ÕˆÖ,à×´ÁÞìØV|·ÓÎœ©‡ÔP?L¡½c.ðóýüÇ<À/(UMȌɋ°”—æ1þ~ChÑò5Nàz¢¥©ô¸$c!˜>Œ}Õ\ic‘Hž_%ÑoÍóÌ úÂhæûIæÁèqþx3/ŽòÙÆÎ&p˜Î%0À˜ÀajÐöáX£8¢GÅ5aÌ& Ð;¦‹ýÉó|d퇗0—Ø zži šëq”™˜EØÒ ›Ñ‡ ¤¡gkJ_|>níe€d¿êœø&„C’Äx*݇V }pÛXk1fr(µX’V¦áÑ“-Ò|²…>_mMŸ2üD@©![­pæ›÷îèZûÿËÕ♓ endstream endobj 1326 0 obj << /Type /ObjStm /N 100 /First 974 /Length 1385 /Filter /FlateDecode >> stream xÚµXMo7½ëWðØÊ%烅ÀI`4@ q ´5|p%5H,Ãé¿ïÊ’HnYi{Ðjv÷ñÍpfÈnä]p‘CqÂö_]©øöLˆ.f5Q4%1Aœ ‡ Žµ“ãªtÅž€·4puJ¦à47öè@ —Ô”»Œ‡Äe±á¤.W€ —Âf*®6fÆãÐlfXŠÙhG»eÆ‹˜M1ãBÑ43 ”L5›ÚÐÆÚ ±ÛFZMÃ10 À’í…€TÉFth²¦<3\ #iKªåž4Û0èÈ¥)‹Â:ÃJ6>…ŽE®ÉægRƧpvh®PTŠ(Ú´X¤lÌš²¹i”:àSâ`–bÒÔTrŠjó1F¬g‰É6K“…6·ÐVšwSA”c{[!©=Cü)i~äƒç©q&‡1æÇ”ÌxD‚[*1r‰m.,\ÍxÌ.4ãák8©©¨–SPÁÊ4™Ž)š(âµÃæµÃ‘f¼vx‚ŽÜ²®@Gi*`®Í>dŠ’m'È!ÓQP› ¦´\'ÚÆVŒH-D5Aj!‚á’[ˆ \²ÅŽ+X2†E `)–["¤‚p@§“JÉž1$›‘q°| )$ÄRr1 R†$¥@²… ÁÖ‘e7,·e,p¬Âå“ét2¼tçX-‹ú~ùõ7WÈÃ@ao°ùíÇ“gÏöCNŸ¡^H}Exþ½&Žä\=tcÜï‘b=ÄHQOX#£A·6hðÔgB^àÑ c=Ĥɧ”ǃnmàâ­ƒ8&ñX4ãA76`ø@]Ž¡úѧ‹ùÊM§n8µÝK® 9µ…©÷²íØ0Ö7¨ „ßý[«¹Ý€nx½\\ÍVîÜ ¯_žºáíìóÊm5½ýëÓ /.?Ì&à hÍW7¶/7æÉðfv³¸]^ÍnÖ{u{öÓìÝõåóÅgwnviUOX¦E¢/õú.— ± þÑä­n>LxWB¨]7}ܸ?'Ûè_ÐÍ©)oûn4%o[[TÔ—Ønáñ '˜¿sˆ=ĪÎ-ãA·6põµÏ„@ÞêóhÐmu(âc¬=Ä’°†¡[è}µd1ŠYá2tkC(ÞJy1NŸ©Œ ¥‚}¹vy—H¼¢-êÆàu¹¬¯¥+ÅÐ c¥ÉØP¬_‘46ËÁšÁC¡%䩪ñEq9¸„¤¼[B’TB†“ù|ÒóõéÀÌj‡¾2£!'ÃóÅòÝlÙØÃÅðÃðjx´³fЦ‘·Åú],7A7N¬ge‹Pg·¿¯À8üx=ÿs8™Nÿprµº^̇³áç7¯ì÷Í«Õ§ï‡áîîÎ/ß_}‡y­K¿X~®çïžö-l<ÌLÉÙ'³6f*ÖÄÿÃNÅAó‘-Õp(Û¦šÕ¾§ëõcä}U‹>Ç<64<Ñ3îBqjòªÒUE_×ÅŠ£•§(cC‘ù8a å èÞJrΊ{wñ£ qÊá(•êy_o½údo· ¥âsÑ#7ÑöͲgß,ztë]RGëýßæ{ð+ïNq}.:ª4Ü{¾}>9¦4êi-ö­ ùX¬Ï+¸gtf8þ±Ž¹éF-|xqˆ!ÁI¹KÑ‘ “ÑP²¢AcšÐb}]*õV‡ÇÈû]L¼}¦ ºí‡9úûˆÑŒÅÂãA¾Uk— 8T{I2tkþuCLZQ~G„>|²ºR1¶ÿº·Ý~²Á91„."£å9ú7²·š- endstream endobj 1416 0 obj << /Length 2743 /Filter /FlateDecode >> stream xÚÍYKsÛ8¾ûWèHWE €uL*“YOMe³kWíaf´IÜH¤—¤âñ¿Ÿ~eæáì¶tÐh¼º¿~Éj¿JV?_ýç*…ÿd•® +»Iât³YmOW¿ý‘¬*ùe•ÄfS¬‰ï´2yÿÇÕíÕ?®ÞÞ]½~¯’Õ&Þä*_Ýíü*:ÞèluW­~‹òØÆ×ëbc¢¿ß~|ýÇÝ/¯ßÁ “q¢-¬Iì&E–«DηZ­ãT§«µ²0G3×éZÑù8Ôåp¸^¥£î:ÚóàzîÖ þ«h88&ôåÉ1éñZ٨ИPÊœÎíÏDzcbG‹ÁÑmª¢œ¬WÕ}ytÕ+èš,r®kÊc8‡Û»®=ñ²Uý{’j×Á°ç€÷ƒ»­Ó4Þd"¤_oßÀ4­uTv&:W®ªŒö0˜FpÕ²ƒQætŸq]< ²Ô;™pOLéÜCçzÙ½GeE ¶*×uSuÛÄ|¹wnW‚yøóu–Gåñ,›Ör¢¦g <è@»keâM’Ãm¦ä¶pÇ’Ú€Wåqš¥uu±nšu+“‰ sžpw 3m@GnG]UÃdÂSðD{¬?ØÚד¡ëYÒèæS~O²Ä/Uƒ„Ñàö®c¾¶“™Âsóñ³‘íª Ð#dõõ©”a‰'æZ™Éì„¢n &7ïàiÌ’¿;ˆ*Nm/:ªO×k¸DÛ ¥€Íƒªœ«mÔÿ}¹Å{|º‡‰6jY/K–7•i-?ê-®`² °{âÑVïæ;k4YýIïéœr†mÛ4n `9”úá|ÿœŒS!2NT{@°s΀ ÙŸ;G£ ‹‡øØÂëãÿxzæ?: MD~´ ¸ïO£{@ïdQn4íÀ Ø>kY ´|…Æ5«²ïÃçêe£7Ǿ]BL>JÒK¦½—ÉT´E7B@…Τ à9:ÙíÀHÝ0‘÷ÄíɃ‘ÞÉ4%õLkÊظÈ7Þªýyž…Çyª<›ÀVL<º²b"…‰Üøs@ óá|[»Ñ ·¯Ñgî¹_ -‘Öî…DN· ãÜ“<;f:ÖÍ'ì.H€X•Cy_ö½±Î¹Œ€‰ÇÅÒçXWŒ8ËT6Fè SÏ¡ŠÜ˜ï7u£ã¤(æG¦jp!Õ)âló™Î&66ólSjëEAF‹ò"AWÐBKÛØÀŽ€y²£bŒ-8™Á ÆÿǶ¡ÇfFTXÉ)­Ou9šÅÌ{Óø±’õ¶Î¡P·f.Š-¨ytáµ—c~ƒ¢~ÁQ ÏVFWï±Út³h «„w ‡)Ž…eÈXÅȹ±­f.KÌËÀ•/€‹lã[àjΧ—"KrDC9"(žÅÝyA ßÝäÞN$K@)¹;Éh^¦@Q€C$M3ft¸@S1iÌ8°3Ö… ¤ ì åÌKºËN9MÀ½ÿw&7U b·:Vê»Å^Ä:]2èµN¹fHU ºT¢ƒ&iþGôV2M覯„}ºè[¥ìtîeMWK¹ íR߇1¿Rêwü"‡â?ˆu]½9Ó»» ùÜÝh|ö MS‰U½ç4”¼Ï¶Þ=1•ñ¦Æ»@‹ð¦Xh*šš„&Oq´ÂÅÑ]…G7)'ˆjVð)ƒ“-O¶~rÊËód&aVðÅRô_0è,¹Šmn¢tîG@‡ßx³(lœÛ9¤}ZÝv PÎlœiýýáI«8Wv1ÕÓ‡Ñê2…QaI9ÕŠ…/,BÔ¬¨I)Á7R(5Þ"^ž˜<é΀¦W¥pGÊ]u*EÇò[—äµRØãyÚwËY›ß=e ¾h¨˜.¯™/H°u‘‚!›¤`ø>HÎ ŒAÎ\ø°ö|).¥—íÄä¯i[ÊÓ3øtʨj¼$ ôÞ+ÕÖ7ç‘O 7–Gû²«(Iè}z‹Qu7/ÝZy†sœKlÇÇ]óìq7{', ·FË‚¼ð¾>ÖÃRÝ•&›¸˜Þþ¿á¹ ØM§‹S*êY´T>Zb#”Œ²ãñü›ﮓì©èZjY¿w¨À~¬jý‚ÙN{\ÞÒŸÁ; ÎÐ?f6­Ç<Íêè½µº‡~Ž›1—GŒñ êãEq½p³À›Q0—Ü|0?Ö7<¶Ý§^0aÂZÜB–9zÀÝ"jb•Žß z7,¬’q:Uôû¯Á*KâLÍMö@¨Å5šD\£¯èró‘ÿAü{þNE¸^Ãu+NÀ!Yjªó ÕùÌç3 6P\ëouU9™ò¢HM®åFTªÔi¸],­f‰žÖ#_x¥ï_®Å1üŸi1[Ö"²øÄ0cFf¢S#:åöŽ‚•1äˆIÏÖŽzf+À¯ç‹ òöfLmeQð‚âž«›ŸÆÜì)ìò…Î̬×Om|¤¦ƒ-.Ï™)Ì;”âlðÆ?RW%¢Ü¿¼šÂZ£qÃ7ßâºë,¥÷ óç@t'éæ›0Sój{Éíhë)Õû*Ô6r´‹8tËïr/,˜j!ŸuM¡xØ^S‘MãÂ(JF )¹.W·ãôñ δ1E{r…ÿƒ|g£ðâÓÅéÊ/|FšyËùÖVÛ¸Oб‰ÿÄjÇO¬ØêyLºe70’˽Е§$›ŽOIÐ Ÿ’ úPm0½(bmP$ÑÛ›¾cö½k~·\ú$Æenš^ꂉÄöNʺW] JþJzàÞCWËcÜ—‘/¾Rº5K‹ˆ¨RίñKr·+·ŽIŒªDñ –Õ+˱õÓ…¦¤JcBðúÿŸî®þDîÒ‰ endstream endobj 1458 0 obj << /Length 3079 /Filter /FlateDecode >> stream xÚ½Ûvœ8òÝ_ÑxOÌ€'›ÉŽg/3çìž=™<àFn3¡¡è$þû­›tãÄž3Ù·(I¥RÝ«äh³ÛD›¿\ü÷"†ßhoræSDa\›íþâÝûhSÁÌO›(ÔE¾ùDëöåðÛln.þyñòíÅw¯U´)Â"SÙæíÃ’„E’nÞV›wAšðò*/tðóÍ/¯/ß¿ýé»×ùl‡Nó0J à¤åZá’‹HèÛ\é$ ã$Þ\){^E¨®’¨Z[ïî/UÜ^^Áß®^ÀDœe[ñŠ²:Ýu=l¹Å-÷‚¢k¯}½/û‡sÄéO—„ðƒ ©ªÞt-þæ½¼Šƒ2 ì2„¸ºÅ™ÑöwåÖtb‚·÷µCrk@×…«^ÅqX¤Â³²i:¢W&:ñ Ü©\2ä™H¥ïñxËS'·xþÐw‡rWŽ¶âU·8ýÀs#“£¾;ÂI¡§- ͤý0ÝÖÄpÁa,Û­Å/Å4TðÀH®Hc`àÀëJ©0šH5Âp~ªG9eWÄiÛòöLŒ?•,=ôö×(ÖŸ…ŽwŒ÷VŽ$v!awn½gÇ\_V(Œ¦ÐøÃ^°m#*¡gÒ“Hf +ªX;¿¯«Ê¶çvèPG©[U Öã`+R\ rú ²>¨“VWö®<6£LÎh?cÖÀ3bzÁáèLuˆ5 Y˜ÅÅRS¿Æ4ÓÁ¿ïYHÉãìß™»çpÜ“Ý»…(Lµ``Ev ïsÏN×6þÚæLd‚a¼/eeÙ“R€ oWlňM™%wÜÌšRù’%çÞ„LJ%3™‘XuêüLíÅ“‰E³C³¼ß].C‚Ig€Hx¼-Æ“óoÎÂËJÄÅ °Zâî=$»h%ö5œàCÙ{kûX÷ã±lË2úŸÇÒÿ\æàdŽ@= Ú–-Ò™nÝ=ð…ý¶Å ñ²)ôâ’ëW %ù €Ô‹×Íu‚@¢W5 X¨RZÞ[Ø,èêQ6ü{ Í송¾m ê±"!['Ê´È‹!=0c…ÝŽxäejØѦÎØrB5‚$€Q…V—Á­s—ˆƒôm`D¤¥´“ãf¤íÅ/5`(‹5¤p(œž''½Í’yÒÈ€ó+D7/ )º•+5p Ōߤý‚Ñ2Åb9#ÿ°q£¿‚õo^#­æÅYª‹óÄ’3e¾¸ŒÌfÄ V¦È ©l 2¤ì¡¢=¤ÅÉ9÷ÐcŒš1Wc`ŒN#Ò:—Vn»*~–î®g[ÑÁ³²rD“ïí3‘¸)o{©Jƒ¦n?¬ jˆÂ‡šºZ‹˜‡™?2eO Fª³ô$—ø—÷'FîD#ÎkSIÓyìÒåÔe»Ë麢­x e¹¹_þÍ‘]ÝÕ"èOì@³ÈGM_Q‡[öÖ¤„k©TR˜¡G1‰#’•qá¡äœr$­¦u)ùgìËv˜™!-í½ÃPvÏÓà…Ûnd¨· ZÒòö«8»Jtü­þp9m#©œ«Å™=,2©¹^¤ ½:²“{Á™Ä¥n>’"û<6%3†ÇÃëžÉ` TðZ0ð4«ˆð> €X>Ö{((|Y†Sgn´˜U„” õ‹Ë^¿žoÜÛnWLPeaœÆ'&ø¨……J§KZn–yœ„v0›ÃQ²p:˜\zè½ûzË®v^u£SÇ5g¿ÖPºò|¼ÄPÓí2ш£ç§ß® ù"K×öþ™\¹v½;.k‹S+—L§*Ž…dD8hêa´íI‰Òú¦ƒbG¤Ÿ£[ å a5‚UOXÛV.ã÷¶iºg°½íž¯‰tÆ ß“8LrõDUÌBm²¯©¢6fÊŠåÍÉáì`·][ w5UuÖ¶<ƒÜâ¢>Peqïtí¡-w3Ÿf^ZÊ”ÁS¾ÀTÛNr.9¯"¸Ácʽ]sï«qk­HÐiÅ2‘ä~”(až$¼TFÌzÈ€C´šolu‡®iþ/ŽHú±+úIøM'%@à‰VœñJ€{P (J€Ã=WY¤ áZOèý:ï¶ >9ä/ÿþ=CN„®–3%înK%ú2ê-Eþ}½2R¦IòDI%*Ì”yJÌð®ÑËH â¯DFÜr]3Tj»:ª¡0æ’v¹PslÅa¶Ü"Æ…³5vójõÈÄ"¼d=Î äQ槿Ã>úºëëña…óÚ„‘y*ç• cŸ9ˆ¾üŒZ¦#ªê@³±]Ÿ{ä\¥>Pmª±#¿¥¾,ŽëãN é6Ü…T’ÛÁž° æ@+_Ù¡ÞµÜGÃo$µÆ9ŠV|)’!¦ó&'Æù^IË×úþTg ²f»¹E¨b̃™ð?Ðcæ3ƒ!b©8òZJþ wÇv+%2~’ûȤ7ŽÐ攃8ÿ­nr> .r%¬Â~o@\€í"x‰ì|Â’mìN¯7\î0uÜÎ ˆ“ß%&H ö ò²Ãêprˆb’“ÒóÆœ œ‹$Op XÉ!4 ¯wõ-õ®¤û“ˆŸoŸÊú[ä®ßߑ껺e?bUàŸnNÚ§üI²!²¯ô1aš\Ùq?ùy‡r‡xæÎøHÞáÈâÄ#Ö^œŒ‚›¸ýX7˜VDYý‰f»}À–Ã3ü–þÓ ¿ã$ A-ý;ŒÅVH¿;/º è…/º¾,ñØ€³t)òÊ–7" .k¿I’§–<–4)§zÆóÌ>YëqÝZßGDÀ”@ÃÇÞ'øu×w{Y„?‘ ÿF:ÕœU·kùpìVžÝ•¥7ê”CµŠgòe”0q L,Ÿ$FšÂS J‹M¼"áº%Çr–ó9`²Á“O^`ËPWîÑÕ'¤gy/‚ÐÚçûR˜?ÐGd %É"!^I`\y§N"ë .[èIÍŠ6ø˜é |‰žà"Á²Â¯ê‰*€íSÃÍëɹ4êif†¥ œ¤IgÍ'·g!«8ÌL|Z |Eš\U,‹\Ä©êý³jXm(æso²êŸŒÝ?£Ÿ\m+&&^ \Ó~¥½‡ññßMÎQjH¸´yÊɃ–þ @Y*Œå_Vü$)ÀéÅ'm ¤þB‡õë½ e¤8ñ“˜4ê" ^Þ¼‚A^ÃÃ0Ú=jNªŠ kHIp…´ÈΑBñ¶¼¼~óŠ!ó¾>…˼ÇÙÑ6 å`[ˆåáÀÿ N_ÿÂ@ÿo%„óÖ²B ™fùBFÑžÔƒsÎaTd™ëd«|súʆ ŽÙ½åôäʼn÷SȯÆ9}TÇ—ÉÂ7uëÐ}ŒCÆD^^dwlÊ~ýUQR é-êT1¹i2Ó ú¤›Á´ðŠ.—r´§Õ,Ã2Á“![¸Ånªê¡¼å¥‰ÿwûÿÀ|€ ‰¥ØóÛ€ªÛºq™$§y¤¸i¼"$ÿHZ¤Ëß)2iª¦mKz>Ãq="ë’ˆ›Ü¸jŽ™‚{ððCU!=×qË6\GjÐè8rn¯ðOÈüÑÛ}'0ºÔ­u/”´öóÈ£}‰OÁo]¿02÷ûÃÛ‹ÿ˜<× endstream endobj 1500 0 obj << /Length 3359 /Filter /FlateDecode >> stream xÚµÙ’ã¶ñ}¾Bo–ª,šx=zËq².ïzœ¤*eû#B½$¡ð˜ÙÙ¯O_à%Îx6q^D Ñ¾!wsÚ¸›¿Þüûƃ¯»ñ6‰ï$›8u/M7‡êæ—ßÜM#?l\G¥Éæ‘ðªŠø–›7?ß¼¹»ùæ{ßݤNùÑæîhW œ47wùæ—mäÄÎnŸ¤jûÓ‡Ûïw¿ÝýðÍ÷Éd† Ç bX“ÐU€(7®Ð·Ù« p¼ÀÛìýæŒÕèRg­ÞíƒÄÛf-»³îw{?Ùês¶ƒÏCa?e9CàαÎY}Ò9&ñö§šG~,jë?q·}j;]µ_C/ ÆÝÌ¥+ŒÌ(„”¢A va´ÍhNfYZÍ…Ih²q2|áèpì½ç9i(ü«M½¿4E•5O€ÀyÞè¶Õ¸R xK—ÎrÁaâ`´Ñ§¾Ì†^ñÅ™ñ®2˜\ÌÞWNêF@ À|¡¦^„~¸½ïGÝðmzñdVè;ØÛ¬ûj±E2Û!v‚4–óF<åîL' ƒ‘±¡‚Ó•©~”±Î0¼>Šã“ŒÐÑ¡ÑŸ5#™#Cîû_]/ÐMËà~wºÛ{[óø‘$—Œ„âãηºXch«ð¾¨O(*nÔÂ"²]~¹}{6})[XÉ[¹èûât¢ÉpmÈ#ßY•}‚»/,kr$¼u’®'ÎÉnD¥ÂíÍõ1ëKÄ`Î ÌY8ª³ª8¿E”@Ö`×\нÖ:×ù°T'£kÇ‚mÔ'žlA#B¸Ë^s÷ Œe“;ã­âlÒK<É?w‰âÙ$w3iõ"ωbß ÈüI_?uTàh÷’jB8Ãòj궸Ç3(_‰µ†FûTs>ИºøÌÖÜWbÄ¡þã¾íÈCa?Ϻì>£`»D6LSœ ´ ×vºþx"üK‚ö<ö"ë…,æÄ$¯œc©za:š»È˜;™ÏÌátº½ûŸÚ!ÐØû7(4ï€æoyM\]á3àÓZèñ˜¤'}5^*èŽà-Ó2…i}ƒÇ¢ƒ€¹{ήÊêl¡cÇï¥Ñg~¡¹–æöbŠº3ô»bp“À‰’ð îÊ^ºËKæÖPEóÞrØÂJ¹ïÌ^dµ‚¬Ô[a(BÑÒ²¯‚6aºÛßûVæøüa-’9‘¥ÁèŒÖ{Ã`Ò*ÜRÎhñkùŽqmËpCi×f•8¦ÝåÊu’+¼û}AuGƒB²~.(Ø>#J †– ¤Ì p[Tx^ŒÍK’ c…Á#˜. $O0 º{_í ©¾d›€qíšpÚBËT< JuìK†±ÚáIjÒ&ÜÜ4«¼T¼(ÞÞv·Ü(0Ø"-H®¼ Ý Vøv=øÖ²µ^"ŽÀcr4Š dekïh'ÌÜÑ2ðƒ™eok/bÎ÷¦$¢ýC{’˼[«X\q3Ú'ƒIx6Oÿ–‰y°©A5_rß¿y÷-.ÍÉÿbjS¿z%‰“zá«C¯ú¾Ê^4‘Ç‹l c'áóakõ¾<Œ–TèY•°?Ž§É4(ÿÂÆèñ±G93ž³ÛŽ7[øh;ó3ä¾ý!øŠ ”ÚÀ·´aÁ Z‘Ÿ€¤,Ë6mW-ý!»d÷Nu…&qóÓí³‰½?—ékÛøµ(#Ï‚ èAE$¥; ¾8¨¸‹Íq‘.%e—O6ªâ)áiCZ—‚#\µ~)?(¬`ÛrŽDXìË4“k› a…ï%}Rt/ñ OíR‘ÀrP€G×!¸ Aþçë;Õ £Éç<«ç¦N2_áZ«}k;Qš,ÊÌP8Sðý¯¢³€Ôo{7¸?žÇbÄ9¸€žÁñеJ‹ÐÁ'/ù — ñK-kœ-M.kL¶³‹%+’À§Y‹-rJÕ¿ü9˜rðñTh•ú([yh”º²y¡Bg0)ËÚïà¶ÃJ5Y¡¡(# ²uèƒY*šùvC0BÀzQ¾•S‡W²¸vÚs&º’>ˆLÅiL þO+õJ#EÖâ8+–KW2†@>S'»+k9mÎM‹Ù…¸¨‰¶MÃctÜ<Ÿã?~y¹gIñ°Í¸Ñö— ¾ü¨°(%.Ô­…ûp~QŸ`W|ƒ™–Hv=—ª/òÖ ­ä`Çk†ÉDË®0þ´¨]ŽN ¡ÿƒ=<“¬IafmúúÀé©ŒîK)È“ÕàÛÛ‡ˆ[òDÂ7øò5Cc°ú4«)¥¼ õ³-ܵ̕‚gê¡Io‡ê’œ”L…+òíÚ«vE ðîÖ.~•¹6¯¥B" ,l0Þõu©\é6 ¬L"›„%L»Âj€Å'ðR)kAƒÓWë  ·”Šã-¥ó2!5y!«\ƈvüžjé¡')$~Å CS^> Åœ"b,àÝíú¶+‡‹£×σc5_®km×h`ž çZ¦œæ¿ZËâÔYo1lòÔ¶eò5 [nê¯0€Ý€p.g”3—°IQ+×X±CizNi2¹.„]‰3Vz“ÄV"pc$Ú†…0ÇkD Ì(×H$Ð5â Ä¯8ܬÕòåVñZ®…)ü¿Ý#¸Çr½Ä:½Â8qT¾þÃrútq‡õÚs$ÿé<[ï.‡ÓئY_4Péõ¢RˆX¼»+'pÇ e™³ùÍLârêë>ýH /FÉõ“XËð¬á Ûc¾A#„SÝû³2#]=b¢Ìì=å;© W#:HEKÃe|Ï—ÁξÑB{í¯ˆbøk+ ° ½î aÍ÷Ǭ=Ãòdµ‰ŠN¸Ö$õ€îõ#Jü ㋇Ð[¢ÆRB„Z±f¸)5~ø¿pc\éHhfʔͲÈK Y°‡ÖÔyhB˼CËÂüiyHêjV ·v×a7º,2Œ……Á¤Š“)¡TS0¤hÙÔû5;Ñvà ³O«ñÂc)ºbÒªûŒ£®Xþ_& Ö¾Œ¾ 0ŽaÑQV_[I§©Õ¥Ô³—CÊJ£é# öé¹j×i­PƒÙåè®ÊÚ+¦*ÂI½ÞT±“„ÉkL•ï¸Iòz«§ñóV%—V…Rt—™ý@eÊhÂîز›ì_)pvA ‡ _;[ÉÈj™Eèô†[ʈ¤åpƒN’,¬Š8Ò ®ß™Èâ6!&HC)WÕÒû£%DÚ õY7‚8‹X\ä€ëI»ÃÑ4l…. ¼í›Eݪé¾r“éÊ×dœ‘¦¥_FhÅa4SÞ¿ÊþðAŽ{ò.…D„ dFñðüOžß“åŸ@VíâãYKÌá»âÒ?3 }¾+ûBðPdD0gq.j†Ø š+54wkÖ´ÃW¡zêµê9n0üIå*à‰Ýhû/|G4=oiE ÛVÞ‘äNJ¯ƒrÛï_înþŠ=hE endstream endobj 1413 0 obj << /Type /ObjStm /N 100 /First 976 /Length 1347 /Filter /FlateDecode >> stream xÚÅX]k\7}ß_¡Ç¤P]iF3’ÊpÜZ¶ m\g“š†½a½&é¿ï¹{Ótý¡ºúàeî½Gg¾¥‘cŠä‚‹\£KêbŠb&dG)™P•ö©:¦‚ãLÀ¢hŸˆ\[Eì$ÐBr’XœÔV§L&d§¹}*.ƒBuYMW¢9º"l¹RM³«É˜9¹ZÄÞà'4ƒ€Av1ÂtHøµqÁ0 Æ‘ðHÉìLPKÕ¬Iøa§}\"T4¿É~’)j¾Zt$šI ô"Ë4˜Fªm™¬Å,|Èl+:r¶æS‰:"ÀE^®ÙX$9ŠÍRG7áGX)5½p†ì¤©š%Gbn%eH¥áÀ¢d:@OšÍKUG9¶µÈkóW-±Át(tsË\¥ÒÒƒ¨Z`¨f‹ZfÇŒÁæ :²8FÈíBãË•KdM¹Uñ”·J(R6« 9¶Jƒ©C :n lK«„˜µUj-:2™ÕJ´å …¤šH7—V¥:j°:jè¨ÐQ«ùúØ,@ˆSÈ-—x©±T‡º·b@âQžÑ$”?Œ1‰ªLLJZ©àõÁ H`nkÁ,S Gm˜IA™‡ø3~aûŠ>E ËM"6í+t«5Aj¡",–ËÅðÒ¢…­­ÜðÓÏ¿XoøleÕæ8t²!±¥«"qà£÷f„îlÀ>ë{H1kðµ¯+ú “ ˆƒôuñYx>èÎB=ä¾¾ $¹ö•Nt²q¨]¾Q,Øøh>èdBØ$»z>æä)é|Ðéh;ËlG#0…áœøO礔ýsRôQçäp°^ =½3ͬ6ešð3r1_ÿºmÏß_®_ ÏÇ͛զ) gÃwëáÅilfß<ÃàãÆÅV[0»b\ñ6è`Ø÷¹šQ-šÇnøv<²ñä +/ÇõWžb~jºÍ’ÛT#!.Nª ûîN£ð˜0Àk¸œMÞ4g†ƒå²išöáxøñè•ý=ùm»ýðÍ0|üøÑoÞ^|oÇ7ï†ËõÛqÀ;œ|õégC[EIþ\QIî<þŽ¼œØG¢M(§ù ÓñŒ56™wãŠãmBï€J%¯9ÏNr4¶öWiС“ wžû{ĸvx»HÌNòŒÚÖ>î }xšØ'¾sDx$ôáibwMoÿ,˜ :Ù âí®ÖCŒZc:Ù@ì•»l ‚MŠÊ|Ðé(׌­¿‹¾ÕJóA'W®ÐeC¬7ˆ<tš&Jð±o߉v‘¢8t²Õ3óÿ~Ù—ö‡˜ZþÕ#¼Ù¯µ÷²ÿòÞ3÷qȇ/û{¼Z1ŸÄ¡ÓYŽY‹Cì"Ž æ4t:Ñ+ÚC+hUÎe>èÃÇó1z'˜< ú'Ao$6 endstream endobj 1539 0 obj << /Length 3311 /Filter /FlateDecode >> stream xÚµZIwÛF¾ëWðå½gÂhì8ʱ=qfœh"¾7'h’aa°HÖ¿Om…„5Ö¼™ Ñè®^ªºê«¯t6‡³ùÛÕŸW žÎFmb׎7QâØ*I6Yuõåg“CËÏÇö“xóDrÕÆcx–›»«^½Û]½ýè:›ÄNB7ÜìöfÏN¼`³Ë7_¬ÐŽìëmœøÖ¯w·¯ÿØýüöc<ëá±íxŒIâ¾"WŽ¬o³õ=ÏVžÚlÝúx,Õœú¢©¯·~XC]ê®Ãrl=_»‘Õ üRiݳH×TšKYSÒ¾¸/Ê¢¿v±UŸÚæþZY%H)«’ÁZ]¦½ÎY¢oäy,¤¹èºA£j®²Þë}:”=7<^•–ƒLiäkaß´¨"¨·UÊN±ÓP׸ ¡Âßûë-üêg÷<Ϻío±à[eQ?to¸ò%uÇ MÔíSÑÁŠæöƒíñfÆÞº¾8!Ì u®Ìœuöp½ Ü€†ç-RѬ[Ùç™-꞊>;žM3ßÒ­çÚ¡‰~!÷ú´õì…îaý¾¯¬”+Ži›?¡*i«¹†VÁÂ=ìw§Õ'2LÓò¾@õ½ÙE(ÿzBŠËduxö险–j22m¦Bo¨»"×mŠÞ[9®õ¯£‘MÏW“]zâè´íÖvW©íƒºV #yà‘7§FoôÜÐÊÒ{t4lÀUbÕPŸÊápÐ9*€Û SÔº8'ghZ‘%3QçªÒy*Ÿe`Q‡¼†ºÕi†C§)aMʦ6]akê¤yÞRpy ¤÷üDY*û4“"ê]àÈFP¯SœA…cŸ§cSŠ(Ú–ôD¡Ú>°Ü©Õ¿;ÊÿÊHƒË¬š§ô€ˆFõëS&æ‘hâ®0aÌ ME–K o[Ñ8o‹Gr˜ÖVËÑv0€Ð­:~Í~ÖMÏrEu*u¥Ù¿¸±÷:í‡V“[øZ Ð -ðµè̸¯äû}¾¼®껃 ;–¡KÀ½õ>‡2çâÐi.¼ûøž °SX°YSrUÚɳ–gþXtMûÌo•ÎÐ Ži]Ï©¸eïdx(KDÑX]Ê>Õšw~œˆ½I‹rhe•¹îuÆa¾²ëNŽ†’#@ÁTï>ýöžë´†SÇ唤6·u'#gZ8–Mì±K-ãÖ9ú–;>È„E/R9"•¥fD?÷ ÃÄÚ¡Û­(y¤ÝH<ÞÄÅÝ çcŸMš›)fA/|oS–MUz¨‹~È¥Gٌ͒îdo–è‹JËì…̞ᶥäEðÆ#{fÓP×µ~iz™BbJhøíŒ÷Åâ}CiÙI”²êˆ½TH‚åÀMŸÌ›Kníˆ h‰äGíAˆÒoÀJ¾¬d"+\XxTY®/ˆFcƒ "\CÊÝ%4ø á4øÿ4ô}É1´EÿÌo_Vð"òl×õ/ñÄü9N¸väÆFìß,±Xðµdè¿òŒ˜rþx‰;ĉíøþ€v»`GŒ¬x>Ö’aŠL|°åñhE踾m†¾¨SÓˆ\2ؾm*Õ»!ÔvB@Šö”iq‰XB¤^F¸Ÿ-qèÆÉP™ÿuƒÚCǺH£€^ðÜa5#±ËX åó @T—™¥!v =­zQPLH;c6n8ºÎRÆ{Þ™ùÉìP‘ë¬3Ÿó iÔZ˜^X*懈 IÎ9£°‚ÄÚs[!ÂuSo{ÈÒ˜3Ò’ëHƒd±=±@JÄSFgS‚[¹™õ*ÞdÜú$ž¶äJ1,‘E´LèÅ P+jŠÛ-H€9´`-i)ÉÔó -%ÐiA¯½&‹@'Y'ÈHFÊP´ý@ªó‰:<ÃL¹-°Jmž˜u@i\”MÝ”ø<ù‹²ˆäA  :”ŸŠ²äR§1[aI–¥ÅÖ’ÿv¦éðƶ†*¶µpÖÃBB «!Ç&€µuƒz`4Qi#õz,JXgÝÌØ5€’è6}ff„_¦]'W!¹,jÔfŽ÷rnZð€³´(Û Íh)†Å¸X;]¼>(ÖlÐÑÈ+­ðAîZžÏ¡b\ËÒ¶-´à_Ìu̬{SËè¥æ¶Ä[D&•X¿-éÄÅ42H)•ì›0š’§q‘çÜ&„ÕµŠCM“ßɯ)â¤ß:ƒ³å(vFëáÎT4€ÜÕÕEW-“&ç_2“!:}G7¾Ãyþg·Â^œ”‹Ø¯šüdæYÞÿ&$²öùÔ7‡6=‹ì{½BÜë†È©¢qmÏmæ; (Ò%„/Õãm3T|<€&=s7_ùZ’ÍŽ‰¯3˵Œw™©…°*µiyÀ„z¬–+ét N¯9Âx8ŒcÜ6¬©W(¶ÄILr™&º —°oä@ ÄqÄ—P^Bá«úŒ¼Õ EÝ8žaÈ-wªæ:«LÀ÷ZîbøŽ[È PûwÍ_*ò-Ñ$¶¦–æøü>t æ»<Ö°Wr™INà‹ñùÓç¬ÿq{÷Ó$`{Ö-VÎBW¤ù3Ì@‘5Ýxk‹Õqn|,R.нµdצ}ÀÓ)L‚7LØ«ÿFÀÓç<¨'Xþs(úé3s=àºá|~jGî“J Âá½”ã_ŠJ ·|a@÷[â^˜¥WÚ÷s‡o_è„‚â?¬})rmÏ¿õÀV|Z…@˜FŸþá%ºäû¶:'Çw‹ÀÄ$àÆÄXÜ8:Ãj¬av‚"äRXu‰Âhz7±î ܼ@fq¤Å,gì'˜Øk8²W¬GöŠð…eÖ³•…3æŠ"Â\·kÞWÒY±]ñÜ7íÚ)j¹wû•ÝUŽíNGX<_Ž¢b[ùã)êðÒæÂY< –{{ƒWKJŽÝPà‹/µþ1,d‡çâ_¶ãëOi#+ÝuéA‹<åxþòî³LÅß”uÛõÔù*éÉ)6åy´à)I¡/%‘õ‘díl¾x˜æ"P¡Sª‡‰õIr,£«L‹Ÿ:·ã=W)É¿j®;šùÕì0ÎÞ¬~Ùæ»O7Š¬.£ÁeÜËíÖ6ô K=CK®ñº®ßàKÌ7ØXôKa`ß]y#¥ˆ"Î!ØRM笗KS´ Œ]Aôgü!Ðé–ӷȺ /«°‰²€É:Yg%(ù6 °öP6÷æ† ʶòJ ˜vœD\ yU|ÅžbɆMê.BÛslÇó¦?Z@šT  ùæÚ—éÛâžÎ‰d–í:vàù‹|tB ÕÍÁŠî–¹~¢Cç˜Jdl9t|˜hÆì:³­Sù3öõÍ·$¤+7,‘Si˜'[¹KS¶R|í Æðm_á§HB+¸ÿÖ÷\f ðlÓú@‰/|Õ‹%Åúk©@†@^Fiÿ™›Øà ðÄtä¾Mix9šcïÌWtD”Dg:RJíŸOšKêRéðÙtâÿœçUÏVqüò¸îå¸!~¨ &c’R7+ão} ™^|Np¦i¬þ£ql»P’éøß1!ÿ1§å¿)à;ßçbiáL+J»‘ÄÉë<Éq†•ñ"[yáš/µs¿¡]t®]Zòg beRW6õ/Ö±ÌÔ$Y3s›§Móü°»ú Ù7±º endstream endobj 1580 0 obj << /Length 1449 /Filter /FlateDecode >> stream xÚ­W[oÛ6~÷¯ü2y¨Þ$J)öRô‚Ö­~늂‘h[«-y³ÔúßwxQ"+Œ M¤P‡çòOp´ŽpônöÏŒÀG$Ê)Ê#Q`DŠ"*w³OŸqTÁ—_#Œx‘G7Önñ,‡ç6ú8ûcöj9»xKqT "£Y´\ ^*X-«èSœ!I^ðø÷Þ.>/½x›vð4G˜ ðiÍyjLfØçîÙÈ8¬*`‘¹=;¥»º\$)Mãvåžú°WîÜ™gˆ¦dÙv‹„¦"–Í‚ŠøàÌÂÒ¥„öu£U×È­sïƒß‹!rÄÓt؃^3Tp6¼”Óœ Lljß÷Jâ¼Lž MÝhò¸×m§*Sݸ5©Áõ‚ÄW×ZòH˜(PžÓ(ŒŠÔ³¡í÷+Ûà7Ë÷æˆAÒ"划lJ?6¢C„M xT>ˆçºÂDŒQTË2”Ý5öE Œ¥9 ¡y‡" 4£,§G( |‡bV8aÍ¢ø„AÄž¶Ð1Æ?:hP„Ž>»ãwÂ)‹ß¯\U‡ÍãöÚ—½‡g«²^\ñWv¡Õgàbôî[ÛlãeÛ58ï L˜“Éà õÇ×½ªìƒlÂqŸßÈÒ¤a‚ä,V߆fþêZ¹}-eã^ä¶o‡¥®;øÅý!Р‚¦§D @UðHкIžÓ Zˆ]…?ê¢j¹¾ß’ƒ`ÝÒöfS‘°t4¥¹£ÉU­ý§ÆØiµV[¸Y$ö‘ØxSxo·QÍ€³kwÛi£ÍÚ÷¥ˆÐImÀÇ$Ö­yâ¸55ìܘÌ—}×jÛ˜¸l·ýKXdÜGu7u¯Œù X# LÚm¨œµê›Ÿ´s*ÿ„©Ò¹¶+&t ÉÙ uÓוòyl”³°×•÷·“漚w9xÜnóñrãw®Úë(=ðÐÔ™¹:O‘ˆS”§)D¸îÙ4âüyLႺÂ)µ¡ Ä…Ûœäâ‡ÄÍSÄà¨Å­«sá&ÈÇÂÉ ËT„ÏÓ.½ížæR3ßlÛÌÂØHVÿÖ* bo›mõÆôðÖÔm¿p+ÒæÜXù꾚ƒÀ/7·‰Ü6Òî‚eKnBà.Çé„ÜJV‰U38F9_«•¼Þj'[n÷Tó)=Çø€I”1-ÒgI >µŒ+\dÇšoo·_ü¨€á'8‘ éʦ Ê$bâLIŒÂàȲQÐ  ¸G%•—ƒÏ_hÖ€‘ë)µ3 …™FÀ‰H˜¹ØÝ„ËAZø}óMîö[u4Ã>0ËBµ Å(eܹ±2 ç‡5“}ûíà”ȼÿgùÆ Êùd°êV%IsV¶»½¡·1>(˱yS]—_ýäò2¤V à ÞÎbUoíišŸ^Ä>Õ°TG@ÿ¹üøåÕ»~f²·Äi_¦ð/ÃÕ?a`°Y–j¯Ý§$äñ{hW§þVep—Gá{8œjÏ dÏBcæú•P™+½ùy~nSÙöB‚ilÔvÛz‹4h±ï궫õáì²ÝɦßÕ>œ}m´‘ºn}ûÚð<ZöýMÛU¾b)åüTw‚>¦°í÷û'Áö@½¡JÊî°×íº“{“UÐU9?wkonßZ5ª“Ú§}'ç”&˜ƒ&`64ÿãKœÍOðÞÓ®Ýy'D$˜'þôz‰ÁO:²]šlüîÍNúoúd9÷>¦o¨*µz4Tô©P Seê«—˜]Rò$¨Œ:†Š\2~ïG@•zªgÐ_v%~ýƒ^{}}5¹ž }œÈÓö€zV< OÜÁÀtûÚ?èÉ—DŒ²"_Pôä-¨µð-®«J5çn–{÷< 6ÿ·n·K endstream endobj 1589 0 obj << /Length 2384 /Filter /FlateDecode >> stream xÚXK“Ü6¾Ï¯Påâî-·"’zÖž6ëdË©¼ñÜ’Ô§›kµÔ‘ÔOmí_€©GkœT*‘ àdœ‚(ø×ÃïþQ ‚\†yQ(Š"¨.¿ü5ŒüDa\äÁ³å»qšÃ¿ >>üûá»Ç‡oQP„E*ÓàñÉIQa¡’à±~Ù¥aîyï>˜ýAì®ûƒ;½ÿíñÇoÈgSã$#•p;/N‘å!bEa5c>(•‡*‘ÁAf@T4Ç´£îŸÊJï‰LvßʾŠ¾¡Î[¦éoLú/®Ä"Ìc„‹„•_®,£íÚcß•uUãß-´d-oãY·£©ÊÑt­Ÿ¤—Ì)1coªñ^2Q^ô°¹Äsi˜CÈh“ãÚ5 qÄÛ µ.kb¨º[ËÒòMÖV›ÓùØõÓä’Q2i‚R¡ fݘ“96ÛÆÏùåæÒ ‰lÈakéÿÍÇÔ_[Ë$HŠ"q¨âTÎRø’0*„‡3 X€­ÌÊ8ÏJ³óÀ0™@/Ÿ‚@ð¼÷íf}gg×·Êâæ.PB&*& gd)ZVæ;î^û½ØucgiU×uÐýç=2 Ô/ÝŸ~i?QëH²Fd~¶3tK#@ʈÔ¡ïn£iO0r)ÑW/ÔyÆv×¢žiiíŽõhÙW€ ù—Àš—°ÝÌw»žþ$+s²`àZþ~[ÏÚ#ƒþû5ó|aèm¹Ê«žÏÅ"Cwí õÚÊ¿˜qð¹‘G\J„6g;¦ Ci6aŠbZ¶ƒVÏcÈÆjÁZ%øaGÏÚô<§‡¹-7¡0t·ãÎ: MÛ¡D9¢Žà¹8W»÷O4°ÄÝ|Ê2€0G$2ö¼È ™Á¢GªJ_G°C%Vë–ÈtD€¹ÌÆZYî@º5¼ô¹Ä>uÌlñ œCyÙ<8\|ðÆ£•qBðÆXãˆñص‡ƒRS,Õú©¼5sæÜBï.Š†.;AcÂl¼Â[61-B.¡Cnuñr(z„\ãFv4ýÉN¿P‡€‡9àѱ²TÒoÁfØ–r[æbàdÁ”•R(]rBc>í]zñQæC 3n3mÐö؈qH‚4¥ÛuKè±iï~öž5Ïtæë³±¡ÍÀã5!‹qM $ZÔ"4Û¨jÙKËÂLª¥)vGÁgSášgb¹xŸH¬É.f¤&†Å0P›6CÝçY(òx½Ê`ÀUDô­–¡œ  7,õ‚õÌ<­ª‚dÒ°NOk7Cèr…úäh3’'ÞR(˜‘ÿECÛ1a¸Nz°;‚]M ú™(®ö|HîÅN¯bŠYË–G_³!wò\¶'·×•Y\„Rä®B¹tõF#ãPÂýy0šÜÁxP™ ãTÜ*Žf'}GiSócЕ­ÝðdäçÏ°¾í£ Ô–h+¬Ø]zâYÍ2÷µ+á–ÛãSºzõÝ+‰?x÷’EgÞ3«'®ð«Oÿ1d.*s½¼.Þ]'}ˆøûäü1r¶‹³ìÛÓr¡üÎÞ>ãêzº¼ÊnÆŪÜ_ÃÖÑ¡8:þa«ÝEâÏ=Sãâ–&ld†U‰Šs…0•ýeëÁæo6–>»ÙÌ·Æý¿|ø?÷šM endstream endobj 1615 0 obj << /Length 1517 /Filter /FlateDecode >> stream xÚÕÛŽÛDô=_a‰‡:¢ñÎŒ/‰Ui+ÚŠ ‰…äm»ªœd’ ul3¶›.¾sæŒo‰—](<ð’™9÷»O˜³w˜óvòË„ÃÉî,„·pæ1óx;›ãäöŽ9[À¼s˜Ä çdèŽN-àLåäÇÉ«Õäê`NìÅ‘ˆœÕ®‘â{±:«­sëFÞ›Îqàި錻ÅtæsWNïVï®Þ,z¬A¸ð˜?á†/˜#É„YC¯ÞðØáÜ‹ÃP õ¬!Ÿ‰9ˆð;ehá"t_NŽE:¢ˆóB? žïeõ¬œÎÄ"v7yVª­ÔøZ¸ u^WŠÝÓAm¦báèYJý ŸÒò'ÍIÖx¸ym}. ;‚U(â„?9¶ê=ã¾Ô2C`eeÖUžåǼ¶:Êû²’Çò9¼b° éÛE’õ è?ºL±#—ÁÏLn*¹…\°È­r::Êz]ÊŠî(Ég¡«À”¹ ¦ï’ zÛÇsÏ1ÁÂ=$hÐ'•í ©ª†Í¸›ÑC~•kzY»Ô'ebroÍʶ¤è¤J¬ Ã”»­ØÆöº´F 5#.çG-¾ï^/ñ L¶ðбÆÎÝ ½.ˆbÄ T™Å&F'@L$ð¬«d/ ÛÀÈoD¢tã78g]BVM¬¡mq §G³Ábþ4§Æ£Ÿæ8È-É ògÞgRíkG†&à†ÇϘW$?¹®,qšŽÒÀúvIó/öáìGgÿá@žŠyl4Jâ¿ŒRôÔ(ª]Õù|¤ênä *¬R_4ÍCQîû¿SiÕ°öRç}T;¢È¤eûƒŽ[i~vµøú®\Yç1LßÆá2\µðv½ä­ÌS®?–—Êáòîcõ gçz:$½_žƒgœ'ÚJ/a;ÛÈ—?­–^áÇm(êû~ê<XÈl‹B8.÷£2ao•EÕ¯ÿάsòg˜5c\M¥=Z©d3|R6Å?ʦøŸgS<%››ÈëÕäO:¹áÀ endstream endobj 1533 0 obj << /Type /ObjStm /N 100 /First 976 /Length 1346 /Filter /FlateDecode >> stream xÚ½XËn[7Ýë+¸l»àå<8$#@p[ ‚Ø‹´†®#F©° ýûž¡"Á¶”˜µ/º°O?M?O¯Ï¨?8ãKœŒ"#Œè£ÜZD¡1¶Øšö²»÷$L?®O××óÝ 6^­W¿wÇÍÂ=9Zñ2—£÷5tM$ŠP-CÇ·ˆüYh>&”,:“è•š¸ÆÇ|!ö?N¸´iÕ¨ìmŽ‘hÂHÔÅǘ”»L<«|LÚeJ M†PÜÏ¿{Èžª%sLu6ä6§‹hLèÑz­j”C%è©Ð-3¸SmHñ×ÊàS¡[1⌚±êÃrªšº› Å”dD1ÑècÑlÐ-‘¬ )f <rÇ ‚lH¯TÔT ¹›L EÍC좳AŽöã}"Ö\çƒ>6Ðû•™ç‰ÈG§£}½>ò B6Ä–Ír¬„ážkàÂCU~ÞôUÓþôUꓦ¯»®(w'UúV£,gÚ¢hÆ3C uÁ_cG ˜SšŽA3JØÃTÿÏ<Ç5¢kyö5Öáy§îuDŒõÐ{ç3¡˜à² AsB Ô!(²¹:U+xãjsCQ(¸éÌPá:3”­Å|0=ö¡Ù;! A…£Õ2t×Zü€ÆèbKš¹{íFéI2¤—,G*e Š˜mC7Fþf˜†‘X£ÿœ6WA›ÿ÷¼fï•:#yn©óŸÇ:Ö}doCÞ0$A3²—dJȳöä¿$µlÝ endstream endobj 1628 0 obj << /Length 3105 /Filter /FlateDecode >> stream xÚÍZK“ܶ¾ï¯˜#·JCÁGr’l+%Çq9’ªruà1³”8ä˜ä¬$§üßÓ/¾¹Ú¤*•ÊA; Ðhî¯P°;í‚Ý_n~»QðìÔ.Ñ~²‹ÓÀWiº;œoÞv9Œü¸ ü0MvŸ‰î¼ £~ËÝÛ›¿ß¼|wóü•v©ŸF:Ú½;ö\ŒŸ»{—ïÞ{‘Ÿú·û$ ½7/n÷ÊËn?¼ûñù«d2+´‰˜øÒ”0A’›@öK˜ ñÞ˜Ä7Vïö:†NÃsþÀ)@¾WÊO­¬Ý¸îÐý™†ö¡ò“ÐÌ þ˜Ži‹&Ÿ¿RéN…¾ #Í‹GðÏúA:œ¥´…Óõ'ồ-i _É(%S^W·Fy]Sßîá7¿º¢®ÖÒAoMÈÞÝ; OS^Z‰wiê˜èÄ;Ô%w-eÿçKy«<‡WpvÕ-Ðv­GäõQxÖ×Î5܇ìu칦+Z×ÏiŸÝ‚´¬÷ù¾8`ǽ,Ó8žtm].+ ë®ßïë_"îjaiWº¶]šÈ=»g©~ Txº6´QТÐÂE§Êkh¯-´®Ê¹õk`\[§W4;]ˬᡮ8;n|×<ÜZëe¥p©…0“ïLødUû™e!ŒjçáÆývu-Š¶ƒÕ•ÌÙß––^2’ä'üã:¼·˜WÀ_B:LB…ÏÊuHöÿÔͧ„bmŒ:Ñ:¦Øä\p/]F—Þ]ÖÂýÑXQëæÜëtdwp€ØéÊ7ÿ”r+Y¹¹îDá;ÿ$ÛÊx±²h7ÎJ§78Aç¥qxû_\‹"E­ ¢¹Öi¸7ØÎl¿Áè¾nI rm4o­bŽ)ˆC<ãÈó”ÕÉ*Y•sƒ·ÂœêV8d<–»cv-7Mz‹Šïåë7ߣB2ÐÑÊ°ÏŠ†óø-ãî3$x(jé΄4'iU¬'!ê7C(Ãû§]ßúëÍî=Mxó }Çäa©æ —)Ûš[lÎ0öýÏo¹Ç}é\Õ‚úÈVŽM}þöêá°ú†x"D‹½xþ#ÈjðfDV-ÈúÝ:þL% À“6 “ØnÝ™QÃ:z‡2=€RßØô¢/º^†±É = 0ãáÔ FÇì +Ïx‚ò›Ä ±AÁ|ð¶6•/Ê,6ú§oùXOèèóCQõ›ãkˆ'¤Vû&0½ë¾ÜZ0ÈEè3¶&ò£8ìiß?Û`§¬¥ª'ñ}ƒ xÐÈö$„Iø(“ãÖ2¯•î)ê KqÍÉľ‰†Ÿ2›jÔ^$TΕùõâju°º8èj/l܇âøc”P\Ç Ò5ø©ŠÌ&m‚ß)8Â'*4–Ñ°/dj!{@ö0ØE&4sŸ¡È¡ã7¬ ^fv²¡oãið Ö=1:ñÐzoQ"24'‰Aß0ð˜¥I,‘É„äh.°`¨¢ØSŠ/Î=ü`”Cr—æ#'œ¬¤S´¦öÐŽ3¾|‚Y¤Ä€ útïÀw,¾lhêû¨e—ClxCÕËàþ·J›¤`½j®³¿Œ8cíJ]m(n½$}’WÊ3+YÎJŒJÅãäþ©ƒ´rÁU rîý=ºÆ õ^~åéâI£^«Ÿä!4Ûò0ÄCƒÖ´ÙYZðÁ¯ %ëPG§üyV[œÈçÒÜzÁc¦Ä¨ùZ{¯nÉ)ÌJ—õ‹_ã’ñzÉg(Û`Ü:l<·¨NsÊ­O/D(F€@ƒ=\Éà%–}E'ƒ¬b`eòÍQ>40ʧx<ô^yvUóÐ|c82ñ[~j+xÍAŸ4¬&3©â,cz>Ý}oÞ‘uã9à„?ý,ÈÉÂ¥¾k³ò«ØEPG©€â0þp°åÐ>•õÆ ÚX¾`Î5`¿F RœÏá¤Öäæ<±®HÇŒâl_²¦“ñã¸@<ú-‡t¢œ;b–L'á„Z^ Dí|‘1h'æ'IZÌaƒ}úÀ=]Ïù4m·Ç9=ÂŽ¯¥Ã[ŽSðX®¸<.(ÙaŸ¾b´'¡zÌÒ/8> ßI»màwô‡íÙ퓆[ïEËcîË…#LǨ’›ÀƒÀŠºÚ™ºÚ•®[Q`»²9òïÀj3þ‡-ÄÅe¬ôíõ®¢ð]à‘™9 Nöi$\5fÑ;ÝýàÅ›¼j7“òM¢Ÿtsê¿êæ,³váæÞ@\üM&XÛ|0¦–ø) ¿YFjDÈ?ìä°Å¦‰Y#èǤópãצ-Øyqè8¥Åz95ÙEWŸ\0 õß»¢á9ß2÷䧂1ÒVJ5ØÛº2ÇP ;+‡&’5_Ñ=¡¯áL¯'-ú¹”bO&<îkħŽ¿ ”Œ€‘1*m„î@å'ÁpýS%‰UÌ¿)têi§wk¬¯‚A[ºûLöòñÝ„|ÌÅÉiÃp/€ê€FǾNì\Šã­b‡ÞßÀ±­ÃäP­”'T"â0`Ïq…œQ ×2ëäâ…S¯ƒa°ÅæL¹þWáÉ¢‡ÖèÂ'Ie±µr›=r@úž2Ä«dº&±;Ü/ÅeÐ;‰ËL²žF¥À–IyÇ5ûæx\hsб\wÃŒûï¨>eb¾óS2µA`”O˪‡þ8JB^ëjúJ§sUÝ[m½²Æ"ØJQµ­ãå;T´‡}±Je–0ª¢ÔOÒ9Œâªåÿ3Œ¢ÿ„€±Váx£$Ôü»€Ñ˜ñ$`4ƒUœ} ˜ÈÇe)¼Œò(ûË0àã]¨)ŒÆŒÆ#ŒÆÁ$DÄÙ›húSÁEÕ-Xƒ«×fÕ¦âÓ‰oãÔÄ(¨œG|v#‚ °aÌL0 ÎW¡ EØÀÙ¾ …®¡™‡‘B=ñdÑœ…fU²-b؃’)$ú:0åD­vû’Étžbߦ÷&|ÌC>Dõ©I6ˆÒÚ·jõÔ<w àæ²b£ ùù¤’ľwô‘QýÙÇa8:g¡´ÖRDH±z¯BÑÂOO ¢§hQRèšât…]ŸLžª©) &ÑðJ.«‚ôšÓkZ(Õ@jœ\å¬x Š$‘+G´^}b’™·Lñ»“ŠÕ¿x?|É›áçƃæk|õ0PÑÍwnÔ´~Ýã”M’ÇnÙH·¯­fÄ£1öôfš"5}äÌ™îÑTÀâ!æmñ]⊠kA_?ªË1Á*`?M}gÎÖÖ&~h“¹˜úcR}4 ìS²1»Ð±e‡¼ñ”øà ~¡GGý«}'‘¯ãd žcN Q}É ÒbøØ &ï·ÍS ÅxV;YHMRiøýlv—ñì¿UP,è²Jèù[Pãðt•íT5F- e^Ø|Æžá%9áZ7öeü3VJaŒé¶ÝTŠùD<îèÒ¨oËî(Ë劷ŸŽ1ÝCVO²ã“áJúhOÅ/ÕI<Á4,êxwó/®¤ endstream endobj 1657 0 obj << /Length 2400 /Filter /FlateDecode >> stream xڽɖÛÆñ>_#è'Bº±ùæX–—g)ÊÌ(Y Ñ$€³äëSÕU…lÍQl^ÐKuuuíUôã;?_ýû*€¯ïNz©“d¾d™³Ú]}úì;ìüæøžÌRçAÃí§ð­œ›«\ýíöêõÛÐw2/‹Ãع],ÂËDäÜÎ'7ö2o±L3é^ÿ°Xnq¿ø|ûÛë·é䔌RÏ àÕGd† W>Óè,¥^ g&pFÔª©ÿð¹9´ªX,…Hܼ#Ô¡˜àŽ‘üu§ê®ìË{uJD€"6€ë¦e¤øIÝ}«ð¶ÇW8Í܇m¹ÜÕ"LÜ-Á=à¸9ÀjUБU~è óCß,€ú¢S÷×!@\¸ÀÔU´X(¸x•÷ÚP¥îñ:Uã3œeøÀp/‹˜ñ­Ú5 Àt¿ tÀzÀCée~¬¿¾áæ¯5‚õª]ç+}·t»½&Y­J$yE‹Í¾/›ºû~&¡#–ûŒ:$Ô»üq±ŒÂÈmsú–5ÜsŸW$ƒ ™êðâ42BPûö袩Ė 6I’ÍŸý±îšª\•Ä²nmpó‚¸Ñöe§vÀ>x_ßñ^«hÐ)âÍÊš¿m«6‡*gL}¹Sqî~Ån^uÈjPùÈÏÜÛmÉ؉o|ÁžDLŒU Ño!ð«\jIùü´˜‰v$ˆJÕ›^ëžp›5}EÇÂ;¡êÕ°®A;ªXt@§”Òýç"T´ g€ÕA“sb ä2H}_ŠÜ7jªþ{Bûþs:1(]k!Ëj‡ÔüešÁÂðÓQ~b@0`$–#ßaaà;œÕ|×ÐyO#+ÛAl‡ý ÛEì¾;t|îŽL&Y¥r³/è¼.æ » ¦ªÂo¯%Iì;‹K c/Š—ø‚yNÙš¤žŒ°î¼Ñ¾e ŽoÐPòb`zDFðZ|žÀ¼Äÿ‚žS@NÒOÆGX¨*²¨]zb$í%µƒø$ Ø©«RÂ&,ô¨.O4eÇßã’Ž&J±±ŽK -€& -L¬èè@½Gˆ{âï@9ŸwVqŠËM;¯ó ¸àSŽÊÀKe8䇲_mŸãi„ˆ­¦Œ®Ï˜òIÀ"ç%!T+°ffÈì…×»ms¨à™M9V ÷Í/?~¸iÌY€„(mZ´ªë)p0Ï‘«[¬›‹Y×¹¨•púÜX˜C"”Éó™(è~:'ÄDʉ8>õ‡¸:0'ÌD L,h¬9(jÃA\Ĭ¿Å¨A[õ#¾#>ÒbYówÌX‹‡ûf6Weý…¸¼ë6=M m­¾âÕÓÔË‚¯~\‰H/5 ŸŽz3ó4<ñ"aÉwŽñ%ÓfÏçgÓJð+©´eDÂ'â¨*h«™QhàÀ‹¡ )0B žŸEX£ L8šð™|M½ Df°êÔiß3akºóú‡)> C0Ü L(¥¡¢^ˆEwrDR¼‚Ï eœÐ)­@¡v°ft aúÖ ÃÓ½ˆì<¤Â}‹&ÐX5$µåžïßBòÃÀfpH±&`£³ÝpÇóúç+瓦¥oËÍFÍ o¡Pö@%$w®L)®ê&š¾—$ñsI© ·j+y£Øóå7¼¯lýNHô³3Ù5VO:3ï^pæAä¥Úf¾æö­Z+pî+ÎøªæYNë}Àã ˆÙÄî%“…*J¨™O‰À©8Ïs°ç\Bˆ)ú¿'ñ½)õg!òÚ4 âÄAÓ<Ÿ<ŠÆÑXJ÷ùÖ˜ÍûsâÔå!¹-ê®3"[Yûo1²ò‚ŠS$^ñò#¾$”±ÛÔÕŽð:¦ðN½ÃŽsìE/çlÅé€^¿ysCX Ýœ¯KÝ›¦]]ºã^OÙ,Íð"ÿ‚Øý;æy[î™îC©S$õŠr>N«4 áØTÍ¡UwãŽaq­Gĉ@rC(xºQh‘¸?rPU×Ðh,ñiJ¼@BÀJQvTeá„Ù‚Cj_à¦4ÿ˜n$6¾‡f?.­éHÍ(§rÑWÐ#0)îgÏ°<ø¬j²n.¯PK«?QM㉚j‹×jª -þûE¥Y‚F|þÝtòæ"ž¶ŽúÁœè°áÆäÊšE^0þ/f·ÒtþgW:†‡Ña‰¡!;þ#ô•vÕ$¼¥Y:ÿ'çÿ Æ}ùaNdwÎßCüÏS÷¥Ü[Æ^´ !ñ¬™(& .ü›£¢ü«›v¨¦ÏY?Ñ µõq´áÖ£Ø|Ї˜ ± }œÌ|9šCÆ3Rg¾`ØëCEc­>8Øå_°þ³˜™z\)æ6Ô‰.Çu‹'9Õ CtÆ5ŠYX>Ñ‚.h°Ú(È=}Æ•hêÆUUgÞ‰Â2…7¼o°ÝŒ0Ì«ˆ/@dÛRÀü0CWó­U«òâÉšÎFv´o©p þÈÍ ³ÆÊtÍÞ´cD5lÕ“itM&ÑU xl:øÕ6C˜Ž‡ÿÇäPöØÜ<ïFšïO·WÿåŽ Ä endstream endobj 1713 0 obj << /Length 2209 /Filter /FlateDecode >> stream xÚ½YÝsÛ6×_ÁI_¨N…H‚ÎS[7½t:™\â>¹y`DÈâT"}$eÇÓéÿ~»XðK‚l§—ëÀXì×oòà&àÁÏ‹ÿ,|y 1¤g"Ë‚õ~qý‘Œüp¦2Ü[¾}  ß]ðañïÅW‹—¯#d,K¢$¸Úô«H–É8¸*‚ë0a[®t¦Â÷ß/W",î–¯~yùZOf©X3.SX×N‰9²,¸“±ÿÂVr2iÕÏZE)tJš[W»²úƒ¶é„]&,Q¿E{_vëíl›¹H+!XÊûÍbw–«mÙ.W2ÍÂú¶+ëŠèöv¹ŠthÖåï\(ã8î·¦Ûš†Ûºí\ÿ>_Fiø@CkˆV"rÐ.Ötek ê»m ®ü™Z›Ú-êŽjéÂt¦Ù—UŽb¾c…—f“vÝžN8;Ƀݤ=RÀ\¿‘b™ÕôaÎË]]ÕûúÐzT§,–òù*–K¢Ô«b%GmUœÎT ½£Š¡Ñ«HT±¶*†©R1'*†¾‰ŠUäTŒûvygv¦u ãé­­×u…ì7‡¦W¸J%(|åÓµ³ÂJ)…zO¿Hïn»|W‚¨q‡»rcºro<H5S°«3€ù|ÛÓl}X^÷,×­©Ú²+ï̘óx½ÔæÇöñјJ$“Úkp¡Fƒ é‹)à "ç·Ôï<æe?É€]Šº nk4ô=5vuu3ÎÉ7õ»êR„n¹Æ¬MyÛ96ô}ÿý¸ä”yâ4Ð*+p›}ÞŸ:Ú™7¸º[ÆIˆÖüO˜…%3Ì’Úç^èŸQš†oÞÑ7/ŠÜ‚Íu^ñ‰Ôå˜Ú¶¼©ú©yå!H‚-·DuÛ¼{t‹¼q«‚PmYÉãäE ªëvtYjÌרúmþig :ÅCNC{“WhÎL;sf³ÝÖ ·ª©†³¶‚¾A{vQ¾^j°“×ÍSðËRŽü|ꕱ`\©ž‘œ ¢D ³ŒsgDÈæÆAåûŸÁ5 )oP¶©ÏÛ¡Ì:Ù-H)’4TˆY½AÖÓ,j®¾!WÛ,¡A_¨.I¾Š®'eXPZÃ¥¾óXð˜É眗3™ ç­jöh2š³£\Öژƺæù(˘L“¯šÔóòQú¼|¤“\xR,Æ„´'!Aï ¦œÔ“pÞ,'Aǘ“ ár’›Óç$»°[kLH(І¾CBÃVÆ|[¬±Zêº1•€²]…/mšzO¬n?> EhÚ’ä3(Äí(WAZÀÕAKx„‰©1û¼¬†…Ék,¡„È•þÈ…T0–>Ï•ã8; ]«'BOì Ý•Lãâ¨ìó…²ÓyÔ 5‹ZEQ»­M{6f䂱¿4j¡Vˆ$Ó° <‰hôýåÛh÷¹Û®©“Õ^<øÜ-éÊêÊW%™èeB\‚C¢‹œ¹ŒE"ö—|é¤äK}‡•!âôZR%‡]:„S»©¦qÚI'á¹[t€Il\õ—†{äC–·;7†Áì¶tÅ åJ‘ \½gÔ“½Z·Ù›ŽØàßvpœwuó@¦À B‡ÙÚÜ>œF–qdgò¶sv«ŒÏ‡dÆâ!Éö†Ò3–êh&´"çé‚ Êr1¤ä¦¨ZÏšQè:ÀMa“FUR1ühq‹Ž,³9¢ båzJþèñ7-Y¢OÊÛsÉn‡išÍ¹Z”Œ·‹(‰0]Šðä†\6-ZÂJ‡Ô¿±Aù×8]ð!9«‘iõ—äøD›Rƒü‘ºG–õ®4¶;'“C‰‰xÑ€‡C̈²0ƒþ‰_« ø¢8 ×,éNeY*ú:£Fí1ÇÁ ÌçA‘ˆØèAhNAâXzYPmÓí§áÙ ±ñV@œ¥jÜ7ÿLÕäô-+ÐܤN…±§!†0e¾­;CYjA%G%›«œ¡þìM®Ý%Yº+—i¨¥o¾këž™‚>ŽmI øZÐÀ½++Dè×nÌt’Ž±gAÈWŒM¨[uŽÁ»MY §m]iŽ$ø–VÞá>@å+àwT3ÙK&”Ê峡f‡¾¡f§!JÓˆMóÔ©â#<•Äö­O\0!ã¿kéx´´;“‚š1™Cõׯ„¢˜‹ÚÖCO=N=I{¡’“*©}XŠKeœÐÓš¼¡{µI^4NˆBï¢0×(t(ôô l¢^.Ú¤u»Xô„^ÿåùÿžSMu-¨ZþMEÝ}EM$£@ã9€Žþ¥Üó<‡½²<3 ž)g6€§{ýÄ)è‰"Ä°ÃÖ~fãÃ6Æ'Ä=¤â-Ç l?¡¤[Ú‹.<@h6 ‰ŠK”·ÀwIÑäIm&3]^îZçq} ¤« ·ù¾÷Æ–z6¸‰ËŒ§Ô¶.6瓺Š™H¼~™“zê10ÎçXåͱLŒòÿ[ŽGÌRfäï!åE˜z—rüU «ÿô9ßcŠxƉ‰›Û·÷>QwõºÞõâwDýiªÓ*š§{”M¾vñóÂtÛèÅÉ$y\ÉŸSˆmůð.šßPûµMDHmÀiê;t@lÑSRûºq4õ–:wÈoú§—ÓÂ.‰äÃ.¿Ñ…ÉËýøî.!½¿x0ߪx9/Ýq..^ò§Î>ù @ëo6¯ˆrr|¨é[¸oU»ÃãL(&7%>nº®êˆ7ïúrëtÇ¿^yÆ’Ù‚­dp!=gÓo_€©N)ßöÒ™^£§fBÕT[’ß³ÙTçâ‚_þ /D$hSé³êLQ³-B‹xúÒûšŠE+)Õg½/BÝõ¤Ÿ#> stream xÚÅX]oT7}ß_áG¨T_Û3㱫)€Ò"µJ@j内FE»h³úï{Æ›½$lo¸mã½Ç3ÇžÏ{cNÑs$Ç„ÿ“ºHÙr©Tرà×LìrûEœÖ®®R´GÁUµ_lbžÅ`ÛOÉÅ’I@Df“ð4–¦¶Â2m”pˆF‚ €š„›† æ2ƒ„%W³oÔ…L³©—búX6§€dª²ýð¡¡éƒ ƒ0–Z±Ì‚m¥ñ(-EaC`£6~UUÛÕd—B4-)RÛË.¥Üö—8˜]OÜhä©.G—¤ÝYN”a#ãªs´Û€‚dKHâ’†+âIdÎ ©6}°QšÝ ¥˜>…šl‡ÂFͶC“£làb)47*;ŠÁN¤©yÇ¢Øø©:JŸHj'ÒꈒíÀÅ5~0IÜøØ`16¸ñ+°!_ )¦¥ÀFnüàx²#@‚ í)lhãWa£4~p-•æ¼ ¥TØ@ÜQµÊ6ªš˜Dhçš!5/TuŒ°3©@2çåZ!‚Ž“…†Éø)‚‹)!t5X.? ˆ}6-`ƒ¥í€ ®í)lˆ…cF q;¥Fh±#´0ãbù¢PÀ5·§ì$‚ ä‡DnO3$‹bEH¢†+Ô‚a&dQ¬p€E±â¨ÂÅš$‹bD6¬¯V³ƒƒÙðØ"µ~ì†_ûÝ•ä‹C"zEp.Þ½ys6{ð A–‹µ;8pÑy'h{Ž ,7²…<ü´YX}ÀŸ- axºZžŸÌ×îÔ O¹áÙüÃÚÊŸýývŽ/^ÏgÃ#š/Ö—–HÅöφãùåòÝê|~¹I®öÛ/ó—/.?¸S£"U|B”Ž¾Ô3Ø{±‚Ëú´Á.K(=Ý$½Ñj¥k#ÐVH›³|B¬í —«—óU³ΆŸ†'Ã#,à™3£xŽÃ!><ÃRÕ[¦(®‰–Cñ9ÀNÞý±†Êáç‹Å_ÃáÁA30ž¯/–‹ádx~üÄþîý¹^¿ýaÞ¿ïW¯Î¿ÇQ×Ë•_®^‹WË¿qÉñ>HÞ§¤êJÜO‘èÿ/ðÌ1ä»ó,ð&²M hZr¦EwÍ…ù¿âyeÄ5+·ÓŽm±¥>¿£®({µúLÙWÔZ8ÍøwØRéÄ ?.Ÿ-òðÞ弑þΧ¨÷ÝG&-EÑuÇeAŠ–ç73tÙ’£ŠOeŸPè; (ñÕ¬™“·œì€J)^À=P8¡ ÷@¹úŠžÝE¦§$ÓAc@Œ£wHHˆí®›e„Wšºå€^åÑÛ»£dHîŠDDæé [ºDírš¦_½Ý­â$(“ÚÅ8¥ˆ”¦ƒŽPóléPÑüÃݾ}ûZ«þ¤‰ÛÐɺ]`ø åÛ:ºènGÙ«£k(;]ø m{ïòÍh7 c:¡¼bH,>ØPJÖ&åËå;¢1íÔoÉ×\¿T¿o [¥eöAxjh‘¢N݆+a,õ(ÆÛ†žºå`}$ÜZÆw“x ÀÉ #ÄL껆À(¶e:èØI0mP×õ æTæ2t¤ Œy¸K/ö;t¤Ãg†ŠÅx óJi:èØOÕ¦•>’à4š:r ö5tùïŽh’“!Ç6]#ºi×õR–ÏŒLw„Ž¥ºêálÜ—?}б£ã¸/+l\‘¾ŠÞ½>ÙHîº`W4ÓtÐë“j‡¨ÌÓÿ†Dˆ•éÛóG&o_©zôöwÕ[¡{Ï}igîÓ¿uî³ohí»}B›tÌ-—2^,ª}&‰ê©ËPCi¿ðÛ¨H‚ɬhæHÜØöSTźÿ,j_ û¾%Ü@Žó"¼ÞVÄo ¯ÆÑàãm÷®Ð‘CÂ+2åÅ}:}õp{@Çù-BìRœÔ×N]Ð3&¡ëé?µóÑÐ endstream endobj 1754 0 obj << /Length 1781 /Filter /FlateDecode >> stream xÚ•X[oÔ8~Ÿ_±d$rŸÒB—¬´bÛJûŸ€Ï’¤’,öÎâæC¯[ÝèÁÎϲ8óõzý|~–.`ù SÎ5ÿ¶ºç²Tº]«Í`$jôÎÒ((ÒÄ;‹¢ Ìœñÿ=§³ôÁ•¢ˆ©fÕZ§*ÃèYxþªxÅIúìY‚æ$_ì4_nµq:×Ú4£ü{qþçå呆; þ¥ã)Ûjµ–½j$ãš¡vjÐ'òÞ~Ïâèçàñó wå“îb"Þ¥þ¹Ë$y8}‰•n„jôH,« ÒÍ£#¿Ü~=@Þg:ŸÅ'YÀY•^”IšÇœŠ9üeAXîó|lÖ1Ï‘ƒäº%ƒÝC9–·í<‰üÞ@žÂïj¨z¥Û»Å‚" KRqµ‡%qI¡6B¿3ºñ¯tͤaŠÚjFZÝ£-V¢®åÊ ‘¶çXC§ï•¬¤Ó•å_ÁÇV5]í,¨ø ŸÞJ㎥¨æ`Ô–wF½4¼^-V•°½ #OróÔSy¡ (g©6Û9è\’fmœ­Z)Û‹¶’–·,$Û ieœŸçÄxí$ªžO+ÑòÂå…¿…–Ʊÿ÷Vºáî.Ƚ•ÂØcõ'ÚÛyäë~;2œñdÊdR¹ðU[Ù€vÀ’Êbw&Ú/¼ÉL=—|‹k¼Eû¯Ž`…/0Nˆ_éVŽêø×ÈÍP ãô±vinæY¾´$/ÁD4ú›Äȇ¡53c¶1çÉM§.ºáü¡Ô„: ¯Ì˜8bY“ð"s'Tê_ã©”ïzYתݰ€1r¼s^Çe¿=ã)“´î”’qÚ¨jE=îêÁÁ#SÁUý©v;/2ªÌ—ùt>] J A‰U‘/¨"5ÖÁ‰-÷Ë ˆQÃÌwÑýuÍ cr‹ÞI¤k!í I»ó5øH‘¿3ðc¥­¢Þ2'Õ%¸ñ±ÃDÓ9k¨R)ÞÜuZÎÕ¼K±Ü7×­æD¡‡ WûZPQ9¦¡ÝÕ)& ÕjÂ]‘¤%’+±ôÕªF}•¼³ Â…-ס\çÂe¥NzÊ«C~Y€_¦JÄ¥ál¯ÐŸÒZa %RH 00wmKVb°‘\ÐÈÁœ…oköÜ(Ïþù ùm ¼³BæÌ c'˜LÆ}”;·ä¾©Ðä;};ÈgHç‡wû$Rƒ؈/ªÒ˜z„÷…M‚ª*Iý-4m*ÅSQ´¼Â ¢SìÝÕCw…¦›&^½½8ÇËe>a@wëþÔÍŠïp1óÔ ”<è^{ãꈻxƒ÷zÍ|Q˜GÓ'?@Ñ“]NßÄ»`±0B¥Yr¿Xʬ"ÿ‘ØÈ¿À;ïMÆñ¬ï‘͵Æ.a†ÊÜv½ÞÑa[!ÌÂð¨M°W•‡èÁÎÄ8¦EOY6S—s‰ËúŸÖ^‘'Í-ÇiO:|ŽŽ4Žøº$¨çß­°Ì x_kw€8Ò-ŒçX;TŸšÂŸ´> IJN@rgd(¼A®a÷6E/­®eO}3…a´?,Xð|¯êšeû«ãriáœâ¤ÛF0ØY¹Ø·Žà;SqÂ`r0Çn*~­©½Á7šxÐ<Ìcpá¢pâqÄg)†Ò*š|p‡_ 5àny‹yÁ ¦a†äx´e’îÜcXÊ:¤ž¼äHZI÷F ŸßEä7šæì<ÝÛ;Ê›ÈÍ(nö«aÎ:%Û¹wD¡²*8*»ï|Iã×Kœáø M—¤ûá“Q/>¼hE#_~ºóýŸæðÔþ–q/Ú¡YJóròËLVþÂ~V}µ}éTÕð ÷Ç>=Ÿ.˜ |²ïDûöåw¿9Ý ÂSÖ,nôêà+[áÜüm7hOrtÂZu#¯9‰«•‘ãÇþ ÕM£ºÝ?¦ u7º)Šòœþð-ž”e»zt34?õuÄßkf§•F¢ž‡\®ÚÊêšq_¥ÑຕèèýÿîÂ`€|sÔF˜¥ØܯçNýv5û,Äý endstream endobj 1771 0 obj << /Length 2062 /Filter /FlateDecode >> stream xÚ¥XÝoã¸Ï_aÜ“ Ä:’ú°´=ÜÃöîŠ=à€t7mrûÀH´­®Dù$z³A·ÿ{g8#Yò*¹E€ˆ3Ãá|üfh±Ú¯ÄêoW\IøŠ•\e*ÌVÛ\„2ÏWEsu÷Q¬JØùu%Â8ÏVž®YÅißzõáêïWoo¯¾ÿE‰Uæ©JW·»AJæQ²º-WwAJ®7Yïßݬ?Þþúý/Ù„#N²PD[éÉ…$W‚õñÑ„xEY%jµQ[XŒˆÇÍq½IT<˜jp4þÁžš{ÓýøÂ6R†yÂZ9WUoŠSW¹Gæé*W€ÇO¿ÒÇ}¡okëÇeiLPԺￖ}q|N…tÎtìªv¢ÁsZwÌrÚíL÷’k2CmìÞ^ÀPLñ‰y*ûéÒ* úäƺªÐ®j-1ØÖš¯ÇZWÖ™/îkÑ=]»ïôñP‹BŽ`·‡¶+‰ý»íÇïͶLJ³ÿx†X†YͨÊóå—ï±7ÖtÚ¢Ûum3œPÂê¥2‹L®}‹. st¯:eÊòül£Ê}™¾õÃóÀ‰ Ñ'óhتM™Ìf²Õ´œí]¼dK%éÓ›Q?½™H5ê*éN›¥˜øïK÷ÔÅÞ ¡“R€£8UvWYLhur;»m(¶Ñ€u˜ˆëDÊsÌ›âãF©P¦Û¹ Lm ׯ7‘’ä ʪwÚ–ùPÕ5ýi­²À UV-F H*Z&( ëaþÙSuƒ†–,ÍúºE²"ó*ˆàvTÝìô©vK8ª”QT¨a2 Ÿ­à‘\€g$¬©tR(¾õŠ‚•ÈÁ+vD6©p«²ì®®šÊ-H‹Ò0•jÙÇ—£P¨d ýø\HعenÞ[´Gß(̓ŠÚ¸¨Ðï†)â¤#’÷ïÖÜÐd¡kôPÆ*iß3Ð!ËÏýí†ÖÌ']oŠ¶w´Ö pfuÔî€9HL]{r¦Ç'I|8HuX¬ržeÅî N=©ãM,ðBæ‚®ç¨ëtM eÕAª€uX"Ý(æ¬AÓ»Êúêu +ÀBõ€û¤‚;\°ôºáÞ¿@c¶Íñ´†\48)aä/¾TaÁN`„4Íر؎þ‹E~èÛaÄéiîZ¢>{x÷È”´A!éWiþR‘CZ°<ÿ÷$¦cŽ ±PPí‘Ϭ,kh -xïðÞ>.Ýsùšò”cF”¹è‘^ßצôïv´l¬¾»Õ£¯™œ¡Á˸q°Lž[àÿ l\º$û6¿FbÄð#&·v@n—°`q½ N&ašà†á‚˜*À&@Hü¤ÝÒ1"TgT¢xë$EÛ0JG÷ÏBXBæñÜùï|| Ölà@.@œ„°4àHæÁ~Ã8PõgyÌí‘N!¦UŒ"~ÊuPŒE*ã"%ä`K@ %à2'¸dK¢áBæ4Ƽg¢9œ Ѩ}š›¥€Ÿ#nAaÇ&öAž@Á6lJ|ku{~t½‡þ᎒cf·YƒqçÑæz€@h)Y·hQµ¦ñv9M“]ÛÑ 4p³ÚßÚgU_t•' ©Õò`ÚÊ\zýe·³ËÆÉožK4Á¢‰nŒëÀ}/¨ŸÏÆ  ·>y¿)‹*ËFXUÙv¡,"@;:ÕY#âÜ—)\˜ùªòà_¾á®&jLßó’) DZ¬¤jÎépCKƒptc ‘µ=ª< *×Ï4\A_H€ž-:£}­ŒUriËQµQDQ"ò†@1D¹;uƒ]PO9Eeú¾²{°ÀV&Á?×Y’ªr¿y—< †i˜Géàa¼5 m¤dÃa_,SŽJ)'i“AaÜ]H›TN‹ G±ˆ(éq€Ý…Âò 9u¸Üv#FÁ@ B"¡Þ¼™P^\—øæûØ´±(mù{„’rì*ÿ¨Ä…Ém'Ü4©ìâïWC^>…¯oümçþô‚—ýn#C'‹ñ4éLp|Æé,÷æÁÅütC ¶qÖ‰h/ƒßoô.Ç|ÁÆB±e²)sO }‡§?GN©À}œ(Á&é#’(<Œ4ò©gî ¶›û`øþ|{õ?$ÐM@ endstream endobj 1805 0 obj << /Length 3325 /Filter /FlateDecode >> stream xÚµZK“ܶ¾ï¯˜ò‰[¥¡I‚ÏÜ¢ÈvÙ‰SŽ´d°$f†‡œð±+ùק_àk¸+m%¾ Æ«îþºowÜy»nþsãÃ×Ûù»4pÓ]’y®Ÿe»ü|óþƒ·+ å§ç†Yº{¤~ç]§ð­vïnþuóúîæÛïo—¹YÄ»»ƒE¹™ŠvwÅî½»¾çÞîÓ,tÞþøË퇻Ÿ¾ý>£ÔõTsR÷Ha—Oø³_XFÍíí¨}QñØÓveSßî£ r|^Êçk%®—(»ÔïÜc1qà&ñÈK°`eÉö>aánïûnÉ^ïNew»Wžç4—ž8Árg*“÷ÒП nƒÔ± Óñ”¨0t¦¦z5¸¬qtoڃΠœn¨”óýmªœ¦'yð_a9vôÐ7gÝ—¹°3Üצç²>[sÔÄ+ìö¹Øî& §nz.”çKeÎFV/`0Œ€½ê3·ç•îºÃPÉ0X:>âOÓ~dbÛ ½‘yu]páÔtýºY9º½õÃåKÛ\4pj Ønâ{Î?›Þðþ¤eðëß¾Yì#æ}èªjˆœØøt¸Ø7ü½¿Ý£<¸’7õož‡%€”Dz?qé`tt™IÖ†’nepaplmGP$vÑ€‹t` -žJ>#|2²È#k‡ÌÑšÜÈVŠQe¹k8!‰)'Àa4³Üî·üÝBÌ·5tô­*.üæEÞ¥ÒeÍU9w•øöÜ¡ƒÏm„“ð]ÒÕ ì¨h ™³$ ©Ë^Ìigƒæ7±0® ®dhE>N¸!º ëOÙ55‡)໵<ƒl““ ñ8[úi(ÉœFŽÒgßv\á '°AÃX2¯‡ÌÐÁy’` + ;£ V e”6- iþ\t+SpäE'¶Õ…áÍ(±ÊY¤¢³F•lF-³®§[ÓâÑó´÷MxúL‡Ø½£.$ )Ša ¤R7„­}5HEÊÂly$¿P¨Ô›6›€éúð€¥ŸDN¶iô0–â L^¢¾éõx2¢/©¡ÿZù m¦|Lx¸€J=Š ˆdob@ˆ…[˜d#Ð8›ÙÖ$ŒS²-¤¬m Ûθ²/¶]¤•2†ô˜ EÇ^H[í»[ §½ á¤e‚®9Ë0]ðywúhY.…µf3d‹Á1r\G2‘Œ%'Æ_±zÞ¢äÀ²8ßscáð*°'Ín5Fœÿ_u:?™ü#«ô¦m6ô9JÜH©¯×g¸q,ñúíÌ ¿ÖÚ !•xd ™(ª¥º©÷ÄÕX&Õ`¤I#¥€Ç´‹HÉ«Búu§f¨¤eJE R”]!"«M¦$žÂ±Ÿ wW3KB¿7ZÒ†$Ž˜ûY°É,-`÷Ùgä„àK;ÒÀÙœžŠÜÖùïC'1ßs;ŽAr­Ç×ÕºAWâI“ ÷ÿ¬LÃ¥ÐèP›úò¼…Ž1^Œ!\=œïo#0ŠöYJÜ4º ãÖ"”àȳážÎX¸gàW…íè-ðÛ0ÖBF‹^XÓƒˆÂØb%UrªW kˆ!wM)¤ÍåɇFž }œ3Ôr_vºØål´¬(èBe“d“:7[Z9"Ê}y<ŽÁÔ5’(`NsÙ‹àCGy/–9ʹúç…¾Èä¾Nè[ÙܵÐUšˆ©¥1¯N¤1p¸ˆ.¸}‚ÐC/Ñ_š¬…Ÿ²ðgóCHÏi?Ì„A-jÓ„iDEÇÆ]u]7Èé<Å3D-VS’‘⨠yšO—²¥odbP­©D¨2˜êƒ8²‰i¶q!DÂ3•Žçµà+ëÖ0 œô}ed.Ò"ìNÔ—ˆ Õ|¢Œd\þ¨9ü+x€@¶"é;£ãNœÏ[ÛàíuO!NuÀy'¯æ§/WHHøïõÑü¹ ?‰B‘H7ˆRQH$]+$R­Bbß…Bbã¶BÒ´'™Ui“²p©Ú‚™ÖœKȃ2‘ppÞk¥›·DW6néÚD*6Ž"ÁÊü(º‘Ât’ì-àôA.*ùzk’véVàO!!GYÔ­ãï”ÍÉBÜàÛÛß@.x°À°Ülçc#ß5á‰R$>Í6‰P;‰@Ps-~Ý|šF†2r‘?)ŽyŠV‡««i"4ûÎFø:~ðrC1ùùÂVòhÊã©ÿ½µä3Iä|÷·Ÿáž9C¼Q¥L1ƒ“ñxÜ/öäè tÍœˆ9@öq$IÆñ!x";´¦ÒÓU RØóÃXàšè ”XW`| =5—Í{ÔcÃwÆt—;9žÖ+öYD÷o´]•¢(ƒY‡v>Øg¼ôÚ‹pƒY˜þ‹u‚ïƧ{qÔÀÍÆ[O–¹p_ýÖC—0=ÚSÏFáWO•·Ÿ/}slõ¯ žQE?À‰×A„}-¢rŽ8¢u)Œ^Þ±ëbKMýØwã$1SwÝ#ZÊÆ£¾ëOŽbÇþé·˜Ú|Á (ßMÂ`yÕiW&ðÍÖµPà*oDƒ 1VûÜÎl§ož ¯CØQüÅ$?%Ï@êD,NPöÒØ…'Ý0R9ï¬Êa ÿ¢Ñå¿o¸Ù½§™«ÌÙ§vá/0'ðîø¾Dï@Ï›ó™bq(Û‹Øgø"Üë²2Âzaº¼-/ûMõ#®_š–÷Ëtc“ú̵÷/xU[9i>8HŸsÒ˜TúOÓãî‡çŸÓáúwÿ3¼„<ïÀ‚ZÄv¯ YÑ\• pEÐZ!òïå!’+1ÈJ“¼Ú7•L&/[Ø2%Jä1-“Ûc¶éAl”n }”N¸%#¢7³ñ†D´ÇgËœmMógüšß;$óadŽÏý|±ÇiC”›Á ¿Ò:p@"?™Ð`¢¯ $Ôe×Û´x‘Êymr=Ð]?ô¾³<ÐÑ¡0y;û£ )‡ÛzÊzæÅyŒoÁ28ëÁËØ' ï‚!Ë{(m fß…Vb’+Ð+!á³eiß”xOP`I@Û®cÎöáR´€.Ìø| Aø^”ö!œðÑÑ€£´ï/ÙdöHµ4ScVMÿëñícZ–\=¦Áy‰ƒR7> Ü›ÿÀ”Å×7ç<6ýxƒ@â fö (^áðÒ‹«ù­Y7jÿ­#‡ˆ…Š³ÓŽk`…5—`m|OC:!n£‹$?tèÉþ„XrrÏÔ³Ù åüÔM'9Ç™k?©b7öG/õŠÿÈ5òLç‚+—Â6{,É¿Š~%åÚJ¥^ñ ì=æ^ý8ÕÖÿë¾»»ù/ØkI endstream endobj 1747 0 obj << /Type /ObjStm /N 100 /First 972 /Length 1430 /Filter /FlateDecode >> stream xÚÅXÛnG}߯èÇ)=]—,$r‚”H)‰åbbí¢õ"ÈßçT¯wbÀ!£õ0;Î]rßJÎ\ñ«u\óNrsëÞ –[÷† ¶Ä}`Ñ%÷Q-¥>¶ÁòUª–`5a„Åõ¶“ÍGöSüøÚ‹ôíÇ¢äªp>°Û¾9u>øÈÚùà#›óA¤q>LKJu¾»¥oðáÓ‡–úø°¾;&ÖÜGƒ¦>ßÍÜ[kA“LK VõM-xF¾å†íQv–ÈOau ÇP}M-Õ §–ÁªX+w®¥ÅbkÁvÃÂØê;mÄ°: Ž›ú´`Á‡‰³`˜Zu-Ù-øh¥ÀaO”àG '_{CäÔ|DfRa™|íq"®žVuˆÑ,ä|ž¥tÄ“zø6*«¶ÅÑÑbxÎŒ~†ŸùA=Þ8âè…ÕÛׯÏ÷ïÿ÷Pµˆ š I©ÆŠ¹ccF€MáM)V,álнÅO’ˆ•%&œºÿš,¶9¡ûE+ѳÆb))6d…Ù £åØtÒ †Ì•HyÒI`K‘õ£™¬WÛpt†¯“H3}Ì ’‘æk›½¬Èõ'Ì÷úÆóIë7 žlÖ§Ëm8 ÓG'ax¶|¿ £§g¾Yâ‡ç¯–‹á!¼.WÛ+/AêãÃÓåÕúíæbyµ+KýÙ˗Ϭ߇3ו[Ž^ÞL)Z;‡¿ç#ÓñÇ«Õ¤g»bì²z-Þ9í êÆGÂúØÅð`½y±Üté|ø~x<<Ä 2ã¹K¼Àä1#J¥÷ÑP Y¹(†Š¨]×éÛ߶à~¸\ý1uÃñÅör½N‡Ÿž>ö¿¯~ßnß|; ïÞ½‹›—ß`®Ûõ&®7¯†ËÕËõ€g”²ÝƒÊÄrEŒz—t-TÈbþ":qªäpR(&¯ï×:Q`bIòE„&K‡ %FíA)—Ú¢ygQ ÷¼>§P$x¾!´t–  á–Ðÿ¹«šd™š-šNƒr‹Þ±O"ù¡ñEÕdf(úBložšs”:Mœâ=g Ôcšl ”®È}wKÿ3düJŸfüÒîœñ‹}&­_fè‘y{¬S¿c½ÕhÅÛ„Ú^ôœ±U‘ÈHJ Üq_·Ó0|·~¶Xô¯®–=пŽLõ^ø(zkú{?4.zo"wA%¦Z惎­l˜4‰X«ýCZ8:¶²H"­NâM-úÇ€Ù c‡üͬSˆñ¾‰cAsCq¾…t>è83j‘¦2FIAG=t¯Ax…žD, Í5`üûÏâ”c©³!÷ Èj,ÆSx)#ÛQ:jO£“–—œ’êÁл½V(ÖÖîTd,åOŠŒ%¹k‘ñ;3a¼k6ÿ…æ¤d¼ÖûÇMkQÿ­ÆÈ'5Æ?BMë?@îG-¹—¸Ï£ûžé¶(t¯¡ LH'¼6pkóAG ªHš“4d\õ¶¦îPèX™±2M{"¬óAG ”¢jžB¬¦1·:tlŠwí:‰á[¤Î50ó$ bKnóAÇ:^^‰o ÿAC¼Ê endstream endobj 1846 0 obj << /Length 2545 /Filter /FlateDecode >> stream xڵ˒ã¶ñ>_ÁÚK¨ÔŠC|Ú';ëM­“T6;“ÊaíDB"3)“ÐÎ()ÿ{úEŠÔjö'±4~7ä;;ÇwþxóËM_ß œ,ô2'Í}/Ès§Øß¼ÿÙwJXùÑñ½(ÏœGÂÛ;Q’Á·qînþvóýýÍíëÐwr/OÂĹߎT”—«Ø¹/÷nâ·ZgyäÞY½Z®­‹ÕÏ÷?Þ¾Îf£8ó|•iÚGˆrã ›Î:RÊ Tà¬Ãö(Æj;»Z«H¹Å*LÝj¸€Qæ>à)y}Ûõ ô¦@ S˜/ôl ±8ËQ ,i¥b¼ÁX[·;Dn Çu«5nxfb§ûÉ”‘#}gMaë®}‰‰»9.ѹC·Ç£@VÛzS7µÅ[xõ±¶Šı汈·5õ®B7ÄJGÔ^t§û²1#·ÛòücelE¬Á /#S¶a`0űYÈ"×›N½4Mùô׫ ®Ôß}÷æm»Ã;&©{ÿgžœÈdt˜©þjA°º-Uñ-L¥qÇz$ý“û½ùåX÷¤²$D¢ÈFÂ6üàŒÐŸnœ÷ÌÒkDû ýÌ_ZÕ{$;­°€â1`0†*G«Ú¢bŽåé«8qus4×”R‹N(=C¶æq,½yû!bĆ /yTš­Z9Bkµè²í¼Å=ÀÕÌ•Öaäå~,å^ ÎL,Ù§Õ:c·h4˜¹_Íý/ð²(Ý± z)¹>!”Cq¸B%ô½< >GeòòC®íI(¥s~RÏO£±=î7«Ñ_\|BÖ¼¢$Yªâ¾2hÚaºÝpàÁp€/(‡ÂAº=ñ¨Ÿ{R×Ýí«ÝôÎônïÑz ã¤`$çí[¾‡9µ½ Öí®£Øf霦ϑxá¨Ð1rO´è~'!úš,“}š¿´é SDÏ9Ùœ2ÄÜE›}×2Ì‚aÛÚŽZ«ë†ÜFCÑׄ÷¶—1½ØÞæ¸Ý²/”‡žòÕ×)ò€ÊS¹l2*›\$÷ÏWxR5*22‚Aš¡åú_QŒ„ïæxÌ0„ØX2ÄÂÉrV[* Ãò"Äy:§ h1  l{(°$˜ì4§yþPuÇFŽ’@ÈÇmêÝŽ¥q©^[i¸e˜§î^?Õ{Ýð€i"D†˜g˜øfIWIÏÈ#šŸ Ñge F8€`c0â{ M6®Ä*d€äƒG7„ØÒ øŠ@Ýâ‰Öô[]¡¿Üÿ}:ãù¨:™&%š¯7Ã16¦Ýq2ý¿šaäÇ`†+¬wÐqH–˜Í-1ò#¶D\&¢pŽ{^iÈ”Z  3Å-/íLkzmQ™8MbÆùJg.®ŽQ9µâOWËîqó¶×»½aýh©X¢0t!´]ÑÇd®~&¥g>ÆÈ$»*Ç)R9nÍÊñ%l|¸p΄~¶È„>[~Éò™mf$¯D"Á5Îìϳqåj‹ÄýfË+*S<ˆñÕíÃ5ÓK½XM¦7@µWTŸ2;zI˜.™~ƒ®uT© ·0³LUP`=âåu/3Ä£ƒªe“…îÍA*J22œÚŒ à¿Þq.A¸–-Vs0iešÅÝñ¨€Ô[—h³”CÖQ»ÿ¨F܉Ó3_e=胄nÝ 5%çäf¼eÍÜ¥H˜¡ÙC×bXÆQ¡7aø„ï±E·lŽTK¼ÅK>‹R:åRÑYf¸¿7e ÒjNB[îD"½aÿ«Î§ràC iè¡0Ã5»[Fé(ö©êì±3À\ ¡(gžÀ¾ ìɧQ¬iºo,£Sb'i‰ÃiÈ–¡¡ÛËÜÒPHÙ C½PC_ ª¶à{™.;ÆÇhÕ]õþИ1¼°cÙj,•·FÛco¤T~žÿ Žâ±Þ—É&.\-̽,§vÓ÷\5gûn¥ üÚ¾ÞŒ_º0k<¶ª1¨ÚÁøÜ©·©°#©tÒ\¡yMOä¿ùTXÀ“”F£(ZËáj*ÚöÃý¬€)?r"å“©_4ãjÖŒcO|ÙŽÏ àР͈TKÓ¶7Àrqû©ð=^”†Kõ‰tRÙp&me*¡^¥gѤܴévÇ3LlÉòy7Ć;„Êø,žz„ºÝÖíÔ#d϶,èÈh=¸9¬LÜ ËÓ3ˆ,\ÍL1=_¯n±%-x;3èb.´S ¡H2ÅV7ìó*U’r@ŸG€•*qa„ªs"6ÓƒÞ鼟·ŸÛ…ÁnÚ“ïß¼{Å[гrÅ:'4j#•‚šn²g3Ø+€’Ó‹²IWm4”¡ùШE¿ÉHã ñ’(% Ï…~¬sx*›tÎo#àÀð¢ñ@ÑCuÍízòðÉLÏ]µy’8É ¿»Ö¢‹­_ôêg¯PSÿ|}ŸþE‘A¥àŸ¹ú_D$æòžfõî¿ ¡?‰@ ƒ¡½'7HÖ›Ka¶RäNÏVÔ ÁÆǪžÞÛ¯À”Žóœ‘ ÏJ?†çtü-tߟÔeYc…Ž!|@ŽÒÒ Ânñƒpì—œcÌÂjïJú2O˜{羆§åY&¾»s»zG4ÙYèñÍm|›#÷~B1±£Ä÷rÉÆ )ò¾Õ3öMÆÈöMÝJ¤¹ç0|yß/1zPôÒâý/ÈÔj–©#ÉÔ?°pÆ÷ŒÛ¨D²v4>"u¶+ºæì6ü›î$9bq±ÒlŽ;F‚ðüíµ»PH„Ä¡ÅôuW Rxe§ûÞƱõ^ ä‚`2yþØ™ Ö (cýã]è3†„Õ·2ו²aZ©Á¨¬¬üz•§+§üþùSÂNÙô.?{Š>‚½´È;½<ö§ƒív½>€“_©†Ç®¡¾LÑ» &5åúÁœ–|êf‡nÕž‡Õ^ Ó°!Œ“OKaÖð¶n,úæŒô¡ŸÂð F÷~!uQ˜Ã§¯®ö¥äõ3ä× 3{ùõìi‘§¢„= ½C·Íþ}»Ã–¾¸^+L±9óG|‚ÉÇ(z£áÔüïöw–'ñU_ŽØÔô¶JÍeäC§B/­Ý*Fîø)\Qƒø ñkGN°—㊳3PxÀw …i²w ÖèR2 þÍÅŽ¦ùî(ô¯†½±öGœh* ÞkŽé@ô„‘ßV²d|í 8Òâ·ÛZCwP’«p’Þ8?mO”5p²’šŒ(jÙ"½˜ÐøèÉnŽ}н¥J®q– Æÿ‡«a ÿG’(Ñ endstream endobj 1879 0 obj << /Length 3409 /Filter /FlateDecode >> stream xÚÍZIÜƾϯhÌÔ4÷EA.¶#C>8Ž5A²Ô4«»)±ÉÉžÑÀ>o«b‘Í[ŒäD²–WUoùÞR 6‡M°ùîæß7!<ƒM¸)"¿Øäeà‡e¹ÙnÞÿl*èù~øIYliÜi“d<›Í»›¿ß|}wóÕ›(Ø”~™EÙæno¨Ä~§›»jóÞËü0ôo·E™xïFu» ½±ÞÝþr÷ýWo gb’~ç@šf¥)¹ d››­éßF9̉yÔãHE…w¼ÝÆQêU]û刯‰w´´=µê£è£ï.·¸~{ào5ʳixšj+Ó2tÜ´ïz¡¤¤•É‰7ÔíGKvÔ¿ÿ¤Aíkÿ~fÞxìÌNFÝ4vòØÉT=^ú–ÛÎ “{ñDzpø-°¯L…™ W ïÒVº©hd¯î\"ȽzÏÝãQ?ñ›êMWË O8§»ôüõöGî½o`?ÐAÜüˆ{c3”GÞÂà£ÂmòâÜ¢ZlyâáL¤ô®F~ídº€íj¬»–G1[y¯'Ù+1?È×^áÅ#ŽÂ• …©qì š(Á›‡>‘iqŽ¶Ÿ»+½W¨"‘Ê¡zîõSOKÆ4Ž… ÂÄî<€€Ò›M'~È[¾;j”G”Ç,˜(O"eÜ=Î’]t2>¶ºS [V„gTýã…ˆ…tQÒ±àû Ûk¹¦H¼W2„ìML%¹B—=ô¢ŒeéÔ€”ä±#À+PCw>‹8 ƒ™;R®Äx¸r:rwUµd‚A$1hc=‘……VùP·Ã¨•  š)‚ÇB+\¤‰(¿ÿ<ÏâÀÌ ½3˜êÁô/ê¹i¨0¸øÙv#¿J§™§êF|4#S-áš±L÷{µÓs:U‡ó…: ×ÝR [Ò=Ÿd9P+º_ µXººÉ¦^ã [ÈÞžL^NÝIÀu€ì7Å ƒ0|¸ 2çÒ¢¤ÀÏ fs >û¾;-zGá¼ÖB© ®¡âÈN6ÙJƒª*`Ñ0Ÿ¬ XþœcG×%vÕò'7'“ö,Ä-“×2VU@˜®“¢U_pGY"î(Õz-¯äLÈ{d)» ,±Qî`à& -ði8ïç¾%¤è!×µ8õpéeûØø+?Mw¯d\w&ÚèAòbry™uÊWÛxµÊQ ô[ǧË—&Iêýc¸€f<€šó{ZÇ5r't0GÍù¨ØG%öÛE®'x%ˆGI´Pã7ÌYM`¡‡¡}'¬rŽñz+CD;5LŽ"ž¾;ê„­)Äž °ˆ‡¹3!Íý4ŽM ><Öãî¸XÀ Ü!tõ³(Ÿ3ÿ-ž=äƒÿ0PÔÜ×pü,a io1/ máø¸sW´ôFõÑ:ø”±D†ºÒ¢z¡’O³Ø`-ïšeCU=¨³èêW#q„QíPƒŠ€‘pGzÀ°“ÌÛ †€¢v@Fší¹¹¡ ’r’âäðλ˜Mg‚æñHˆˆt0ƒ˜-HHŸ:ìåص’ ¿ç;rC©UG'‹DDó2EséMR"`Ä~Œ°Q#¸Å“˜CÕq·øÖéÜè“žEóÇ[A[t©ZA¢¤É`ï[ŒÖ›ñ5›o&û/ÙÀ6Jü2ÈàD%d£b õáÌv`ƒœ¥!D~XC€4R¿d—Æå ÞÍR!kRŽB2ë[ +Ih¬e 䯿I\•YOU¤ÓÔŒ±| Ä2¶ "½  D½,&¦I!pcuº^E ë:abš9Ú“@ …ÖMR2Åf%âbÓO@/Ü R"‹S6À#P5,¢*gìqì¢ï pçIîz%"tœ„qDìÄC\>ü]@+µ &t­Uqè­:÷·)RxØO¿¤¤€íI˜-”ÔxØ2°Â_›'c»â‡ úœø,7©”ߣ•Bl÷*j/ö ÚoÈÕ»ô0ˆÄE17AÇ_–KLÃÞjyž ÍñcŠæÉÈ*Ùñ0í¦ž!|^Sá+oa[¯)ò¯VDS~™G®hLöº^¿£8ù“Áu¡«,ý8·u.[(xºÛ"Øî »þå:HFŽçX×µö¥s][P…H%Ö!ï1–WH%¡_$º^Nk´J¿Hí὿ßWkGÏü,Œ®Ã–I€i¬f.H®ŸvNÒ÷ýz ”,Ƚä ÊÔ‡eÝøÎÐC“0Ý£Òˆ©D‰ßûfW&‹ºH»¾`æ‚+öÒ„–ƒ 8lh<P é‘Ì«¤G ×½é³Å•Ü‡Ïw¹ÿ#Lü¢nGˆîÿ-@²_’êТF蕸ä"Füz*'š‚:“íÉSAèÚ.ãb eÿÄ`‚ߎ£^vP€ª9˜ç³üŸ‚šÜÓN¦$ ]–Š¡IÖVì3ŽOµTÑxS,‰Ý27ìM@{¨M1˜>©ŽÙ}|†Lþ¸pëe\+c²‰‹¾¹äV&Ö€ÒÏ3ë¦.m¡×Ñ ”“eƘünb-ëûz|I°7ÎæµÔwójá,KÊV ´˜#uÒY7’\]aRÕ“z`>u”Tiª}ƒ`)q…ÀØÞÐ`¶$)’ČقÃS’Gƒ®'¦2T§º­‡õº8&©ŒêÐ!Ó8ƒRoêÞÔDÕô(º.É™!l)%|œªL+"KJP&‹¡Ä®«`49šœ8–\Vxœ‡P|4»¦4×sI€ÿ~ 2 ¬¼}®œó9uõ bî7~³öûe±pèw¤LS‡„÷e~M»îÒTüÊw•ðòõ›oŸ/÷e)!¿1¾XÈ‘R;_ ÜZéQSY›Âñ”k2Ю[ÔÕê=ƒlZzô¬gM1;¾žc{ ²>ŽàñËl,7Ë9 „®˜ {0º,¬ftò©î!4µ;;ǽm)§ƒ)=ð#ôJ„̯ŸGMµmwiwºZM¨H•1]¥F¥T±‡MtpW=pÔ:û§#‰½jÁN8Ï­o÷Ü"‹$,l1b Ö½ªºž Âi¨-ŒN76î®Ê>+§ý¡ÃYIšI"I±°ŸT®ÀOlú®0ÏŠm‹^LÝûñö 0§Ê·v°ñž›fÚçJŠÌ½»Á16µÇ2$BìÁeöÖÊwõP]ÿ´vÊ“f ÷d/hÄ+ƒ¡Èã‹AÊÊœK,Hêæ ¹>´]¯rH´·ŸqlP¡‹$ݪ&¾LÔÓ=Œ`F³+­‡£+ºܬ…"•¦Jï’ cãtwRK‚~>w6UÕ±ÑúPhÀ;ò›âNŽE¹I <£4Õ1Ï=CP|‹»†}©Ûª~¨« 9m1¿:‚”¯¬^®ñÙ‹»é)WâDÉœƒ_éâPˇ’[$±†Ã'Lº·i‰ à0©ÁÁ‹.ÄíÎéñQ¡ÿHîçÊÙ¶—Î}ƒ-^fhSBÄ?núƒüzóÓw7›÷véÙ/+Uç3l=Ìr/Jär›þxpôT´/IFDŽyÑ”Ç<Ü¢õ4íê%€\·Œ\gîq5›ÀC6#wœÂá?IŒ ZJÎèð¼ µg>”öIùž¨Q°¼.†«ýQh$ãTÓðíåÀßÎan‘R¨óÏ8¡#>˜ãŠOÖ’u¤ÞD¸•_Š´PPCÍü½oÈ£À%²1®¡ÿ) MqdŠ¿)¨V›”Fƒ4ÏwŸ†ߥ U|mŠ7â„+©¹ÒLC×i§Â`xv}}À{EVU 3Ô§ºQ=E @ˆX4‘ °`/—³ãúõˆáx”ry(WÂø2Ýêóû3¥Ø+¥ˆéw+{ ð·w?¾1w¢äà,rÎQÅ<ÿeÊ•é endstream endobj 1924 0 obj << /Length 690 /Filter /FlateDecode >> stream xÚÅTMo›@½ó+Vé¬w—ïZ=4M\)R•}K£ ÃÚ cÖÅk'Q•ÿžYv±!¡M¤*$öcfÞÌ›7@ÐôÕúeQX ¢(f8FQB0M”m­Û;‚r°Ü ‚ý$F÷­ßùa k…æÖwëraMfŒ '! ÑbÕ¡x8ñ´ÈÑ­bJ±ãƉoÏeê¸Ô–eæÜ-n&³¸è1&^ÐmT*‹˜2‘ÛÙ]AŒ§½P¹žçÙ8H¾W{ß.R‡ÅöQ½¸¶ÖB[ö;Ô-µ³ò¡¾mK¥lÊ¥BÁ*9$v©©Nuýnw•AÛŸòúv&j³Ö–m¹.TZ©¤…“ØhߪÜôj’E¹ÿ8 Ù­ÐT¯×/Ú>&!Óµì!E&*Ç Xp*Fí·…ûÇ>ƒê)N‚PÇÈt©ªWN@°=M•*pþ ¯¿ˆºæ™4>B¯©^jQ»9_¥‡ÊØU·Ëzmœ[ì®e*©Ñ>+x¶Ñ>UYo !¥äœñs~ä,÷üŒ©T{QWzW®ÎæÆøvc9[í@pûLˆ>KÆ&1(¦†Ý#S}ijºzÉ’¿‘„vYb}ÞBt¹Ke"Ó€t¸ßÎ×CäV,o?Z©aqÏaÄL}lP[øç`f‚—«4¢ÝËÙ• ,QU<7bóƒ_ˆÑ÷20 Î0¶nî—^«ñÀRxO˜oD¬žf…™Çžó“ÞïTµ*t¸§/Ò&#Ó!í9ÒyÚ5$ äoŸÄyGgü©gb#"¼úÁ_/¬gK-ß endstream endobj 1842 0 obj << /Type /ObjStm /N 100 /First 978 /Length 1386 /Filter /FlateDecode >> stream xÚµXÑn[7 }÷Wè±0]‰”(q ¤-²Ø€"imA²Ôí‚vá¸h÷÷;”ëÛf :5ÑlëÞ{txDR"¯c%uÁÅÊÁ%¶ßèªØ/¹hŸÊ¸[² ’£XmI²8ÅÅqn,Õ±ÊâNo5ž]&›ØåíNvRlz WcðÓÚávŒm>¦Di÷pIAn¦(™ÊŒT —M/›Î Á\ÌR†ÈD67ãA³•1-GÓšq™ \3ÀY ¾$l RÏŒ¶¥Ø ±¯h š#lZ€5Ø24µ¹°¡j ¤:ˆ7°(F¥ÀF ð(üAѦÕBŽ( Ù²jçIÁ,1ÛÒâ«ð0‘cÍ”[‹ B¢0Qa¢#˜š7+ŸÙÜ >m¢*X´kæ@¶Üjám+­ˆoܱ ÀÑ"QáuŽj®Òà˜šëAÊÔ\¯ä˜›*eŒÚÒ49N¡=…”ÛSØHjvÕr(™]…\Í.bÂBÈ' °!ð F°Qâ'_s±Ø)RŠkH6‚–=`äaÊ$+kQU—5>dj ÈŠ„¬Ã=|¥húi™(KdŒÌ»F¶I2“ñ!7}±¸”lŸ(¾R’Æ9$Ø€c±p[/œ²¢šÄÒO |»uøª¥¸pælŒÀ§¶'&á4óò2‡f 7‰‹ƒƒÅôÔFã îØM¿þö»«äáTŽžð«÷oßž-=º74†â‹y7&/ÚELµz[×0è^•è ÷iêKÝk@`¼åX1ί::kHê5õGòÇÇ5èÑzµun:¢¶wvsŽ€Æ¶Û)„Ïî›°™>] ±aÛ.@7=߬/N–[wê¦çOÜôbùqëfK/þ~·Äƒó7ËÅôV—«í•gbóÓñòjý~s±¼ÚqíÞ/ËW—ç×Ý©éÊš=á¨CiñUÏ`ï|œÑ;A‹épµZƒôtWcLV«16ø—Œ†\L×›WËMcgÓOÓ³é .°…ÏLЖ‚sÆ£l¸ÂÉ—lg‚ø„Ý_’Àÿ¸“÷lÁ9ý|¹úk:<8h¦Ã‹íåz5L/ŸÙçÁŸÛí»¦éÇ~óúâ{¬l»ÞøõæÍt¹z½žp~ ¡ò6¡ŸŒ¸fåvݱ]ìuçX|ÅY"Š æŒý‚Ó·ö(QÀ¶°Ÿ¸éÇõ‹µCÎ<¸Z6ÑßyâøÐ}VÒÒiŸ–N)#Pf†[ïKdK¼’É#D=HJžÓ@è~›àã¥J± K8 º× ×—®Å eZ7:k°ß˜zˆ³àdAeÝkÈHêZÊbÜ5ÔLÔ$ê‚※ 9ù0º÷Aâ€ã¤ô³U™œÇAç2^pžj×â˜*ѧèJpBérÊŒÏQ‡CíPìJ+žRôÿ)ž¸°[ïWI‹Þ¬¤¥|S%UŠ7*i‘¯Ðo¯KÈ$±wLAM ™ë^¹<Þ¿V—¼xºQ–Jý"Pñkeé²UVoo¦c¡Rª§FCÚE#YGC±­ÃHè\8ŠõºÔCœ“õºÃ³4*ÜÛÐxÅJ£¡E|& Rì?é"FíÊ·v=w„Î"Îéò+6d”qй(ÚíŠ0£ë !ŽƒÎp&Vêr0sñöÁ0謬Aér0UôÖZGC ¾Kÿ9@ûYJ׊ؘAºœ³AË8èü‚Ïtï·ök½Æç.䮽†RºÑk(Ñz/ {Áÿù’y ¹+Ñèf•óh¨ «µ?mîýPâI¯ endstream endobj 1943 0 obj << /Length 1526 /Filter /FlateDecode >> stream xÚµWIwÛ6¾ëW°§ï…÷Å—6I¿tyi_ú’ ’Xs @Zq}g)ÉU]ç‹ 0ƒY¾Yä[;Ë·®W¾ù¾¼Y­_…ú^š†‰u³µòÐË­, ¼$O­›Êú`¿Ú‹a”Êq£,±³+ÇM|ß~Õwe3éºï´óéæg’Ä^§!Jñ-7ö=ßXDæŽab¿vŠØžÆII–wp¢ÀîÕ- É­Â+Ò05"ÂvF‹͸ï§ÝÞqÃ"°_¾y÷#¯4¶''°‡9È5ž„¶h€ÚðzÜK¾^ömÛwÍ=ï&-‘½â꧱îv¼T?ö$±ìý‰ŠQÒHWF¢ë¦9Ñ¥oÍÁV ´Sóî°¯K¤í™ý€ë~j*4m ¯H¶UªE‘]I-Õf¶dj…ß )gˆu;4²•Þeeˆ·³¿aÍ’Ž(ý–¿èÒ+ÔfA5> „·ˆcˆJìùeÔô£dxNcH+ ÓÝ·ƒø<5~}ÿâ™~ì1—Yݾaúõ½ƒXš·Än§äNŒ`2b[tÆA 0ƒñ³h@²C |ò­ A3/*rë@W[+ôŠ¼€Uc½_ýÁýúÉayq’¤Ü+¢ðhÌC( ›"pÁ1€6ĘS±34ê@á抄‘ŽÍ¨Ûû-Q؉§8+#g×z^ÙÀjq[v áõ¿Çp¹A # êBEØLV3†,¯5Ðÿ¹Š>¬¹çaCÅS3L=ÜrÅ1ühSœÅ6€B±™9­vQwæAM^ÄÕfÚ!ó´°ÿ$(N†=ˆ"•\æ“ù1v|¨1…ï!6ºIhf\âÀ**”XÉ)"xì8c1ÉÂÈU›éˆÎÑÅÍ®3wÏ÷y¬iO.²[H™,ÆpN㙬-•`$,U7•±E÷†uhæ` -ù¹VÜò3ÿ1Ç`žZÄâf/pwç°HQ­Àù .|@H½s(uQ57+Óû&Ÿ0¼<)K·ã…wŬšº1M¨:>J”Ú°²~4{1‹½ÑüD«S³M‡z<ÇÂ<¦¾ \Ȩ«õ0m¨J]jT>sÒä-ðo’VBÖ’†Þ³*DÃÄR¢è=oOçYà€1 þÂý žkt„YÁ”Úœˆ†4#£ï (s¥Kš¹1uh?Ž‚ßšCäQg›óhQœ´r-Ž­<2pº§“üé*ˆÇ¸ „ 3žÔfFÙõ˨Y_Wè¼ùÆŒÚ Σ ‚Daj U~Áƒ7y‘åq€ßÌ®ÎæQ|t„V­"6¨8Åâ£a@ÂÅ4ÙÉÙÌ=V6ú  úöÑ2wÆÁSÛÒ•U=öÊëÕî`ÌÌœø½:±)²»º\þ®h¨oÒ˜s†÷§iÁVòônP„‚)Ék^‘WN]½K඼ iž³ó‰ïØ8®{'‚†?¨i’Û 6´òö»GÙ0,> stream xÚŒõTækû g»&㎓mL¶ÝdÝÙ¶›lÛ¶mÛnrM5i&ûmïý<{ïçÿ}k½ïj­ú§WäÄ Êt‚ƶ†@1[':&zFn€°¬#€‘‘…ž‘‘Žœ\ÅÜÉ ø_9¹ÐÁÑÜÖ†û_Â@§™ˆÓ‡¡¬­ @ÊÙ ÀÄ`bçfâàfd032rý×ÐÖ bàbn ¥HÙÚáÈ…míÜÌMÍœ>òü÷@iD`âââ ýÓ h t072°È8™­?2X”mÌNîÿ‚’×ÌÉÉŽ›ÁÕÕ•ÞÀÚ‘ÞÖÁô -ÀÕÜÉ  t:¸PÈXÿCŽ bfîø—BÙÖÄÉÕÀøX™m?\œmŒ€ìeI€¼Ðæ/c™¿ hÿi€‰žéïpÿñþ#¹ÍŸÎFF¶Öv6îæ6¦s+ @^L†ÞÉ͉``cü‡¡•£í‡¿‹¹•á‡ÁŸ¥Ä ÿÃÏÑÈÁÜÎÉ‘ÞÑÜêŽ „ùh³¨±°­µ5ÐÆÉîúDÌ€F}wgøÏp-ml]m<ÿ‹LÌmŒMþ aìlÇ jcnï ”ù͇î™)Ð ÀÆÈÈÈÁÎ Ú€nFf $Pq·þ©dúCüÁÁÛÓÎÖ`òAèmnüøçéhà898½=ÿ­ø_ÇÄ067rMÍmàþ‰þ!šü…?æï`îÐbüX?&ã?é|l˜±­•û?掘ADYYRRŽæ?”ÿV Ùº<éØØtÌlŒ&&vVÇLJ÷ÿÆù»ÿeÿ§TÁÀü?Õý+¢¤‰-€ë/Ýû/—ÿlåΆ ð¿äl?ö ügýµÙ>~1ý>‚?]þÿíþQþ_×ÿÿV$æleõ§žò/ƒÿ½µ¹•û,>öÙÙéã6dm?.Äæÿšªÿ:h![+ãÿ«“t2ø¸AS«¿Ûhî(fî4V0w22ûk‰þ;…àVæ6@[Gó?#ãÿÑ}Üœ‘åÇ£âø1«?UÀ“úß”¢6F¶ÆÜóÇÜ  Üá>FÿØžLGj tûs· ô6¶N.€rÞ[¸?&ÊÎ`üCôb0ýƒ8 Âÿ ÎÅûq0ÄþALñ €Aòô‘AúÄ`ÿq~DQø1”þAQ”ÿF\µüƒ>j1ü}Ä4úýÑEãÁÚ€Ã&1ü5À¿ >²š˜ÿcÀòtù—Çz[g‡Eü01ýd0˜ý ~ð5ÿü(Õê_ð£VëàÇù2Øü“ꃤÍÇØÿ¥ÿ(ÞöoÈúálû?êÚìþQp³û8)Û±gú(î_¥3}çøO¾?Ðø¯ >Ì?Þ£>bþÓ«ûep2sþ«;œ\mÿåðÁÁù_ðƒ¾Ë¿zýÀýŸ‚?”@‡¿¼ÿg­œ>žü?žÿ/þóÿ è4‚[[¶5â ²¨ê|¨Äs¥;œæ[ ?TO¥¢ó\sèr~B‚N¢ªÉ Øv¸LëGÙÜ¥¼X'zõüÙÖÒž Øñìõ¢§4wØ·:‹9ÂÞ³ Õj¯øln¦¨ÓÖ„w|è{ÝY>ì/P sâ2I& [¤ërò˜óSÊyÞ¢JcŽQ…žZCïyôÅ÷tà!^ÅNÖÚ[܃ðnœX Óφ Ç —ç¯E=±fcZMµ·ŸgQôº¹B÷g˜ßXš9~ÑJ2c !WdqŽJ¥n3.aX;â«‚©Ï*>kœãÏ ñ#-¼fuŸ—óo(^ ±ž•"$¢àuÂéÓì|õf§ðù3ý8/²¹mO¸[Tq E4µ¬ÓtF š6|—YS`š¬nXGã—0dx}(ˆÔÓƒ+]e ¸LÑ`úìÍvýÒ§s1{-\ªç¨‚/uëì•H^gkF‚I_b½-I¯šÒ¾ Wqb¼÷¢RùõÏé?ËüÔjíad¤hôæ`,÷àœÞ¾ºH¯åuµaÒd®í£yÕâ%—ƒqO¹ :¡õ¶>SœŠ‰´p‰“ªu= ¸X†9µÒ‹â{yTôhæ›gðdËÕ!ÈK1p>á\ÁÌ¡”I®st/ó!©È.ÈÂr:Kså¡ž; µbƒïCR?xb V&$~+d¦n:ÃZœÒÇ‹ääÖˆm÷ÿm¥Z Ý$™ïåZ†»7iK¡ùC¿g®,§{«ÁÑX(Vœò³•Úñèq~Ö_ŘkQÈ`§0% x]+zÒ Ž,Ù´ž©ãÅZû8 šñ–ãœÐ@iF•2ýEË•t‚ØÚu‹¹ƒ´ÃfÂa—Ì+â}Ní\:1AgÖ³B£Dÿý‰uˆ^<ɽ¹ò`ÃKáYèÔt³ÑõÚвW¬6Þ_®²ÄÄ‚'Ú˜Ÿ4ÖŠ„†ý¬‚ ßì(Æóñ•úqëâ<gVYñ‰¹¸#ÿ¹’âs©MŽ¶~½ŽbDP ÷1ÒÞ÷¶~v+FC®oÖ:W¿h2¬—i%cÇÕ¢ñW 'n”Í“?£Dœ©§yÙ•©Ù+ÇÖ¾¥Þxð`ù\RL1›Ä^tÅœ² ÞCIC™t“né§_-²ýÆP? –dI‰6c™ŠbWƒä¤§{"4ð‚½·T§-áïsú]ï®l"¾ñíÌ3ºy/²%ñ:œ”ËŠ#²wê—ý²ëÑìŽç~.û7´êiÇéTÙ 4Ø Eº»€ŸÃ(ÂÓd)ê9QÛP“4·Ÿ!´|½Ø’dKZÙH¨»k{ÎÖOyk#§“D¢#h;d®M,hãÎÆ»»z&@ï~æŒe‘¸1öß›‘‚Wl;k ¬{﯑,ÂKƉRÃÒ,zŽtŽ†\èûœÜÚ`>•Á^Æ[Šö}µÊ¯)ö6¡§JÁÿh¹ŽM‚ö-æ#*“ÞÇlA´°©‘$qÇÐÁCØiöz èÌ ¸µürlžÕÙ¿v†‚îVùӰ͹Ÿ¯øÛ\]ü(€6íR­Í1Ë£7éåPÐÑ·Qœp!˜×Ȫlør¦™ÐCYX¢Å¼N&ª”"+yÒi¨—HlSgV#wÔÊt|¼Ë2^ç+Õ2„ÃÚ-$ççËö/Û;9¹ú ƒÑоŸ›©PàÚ÷šç£rÄÇ–kÀŠòÁ5}2„¤ÀE¨ÒC ŠFwì²ä@z/›m’KöDÑã*‰ý…_´Ü&§Üªmú…íI›HUÌÛéQnÌÔW~™RòKë¯eç ¢¬½â½{Ÿ˜òL÷ÄÕ#W&vE~Y–¨ñ«ìûùüxY¶amÃ5É”öDr˜ûü©L % ´ò|qᇓ< Ëìw÷=â #Ú]~Í«£'% !ó/׳?‹.Ï6\BÕÄ–´Í,ëlS›«!wP29!ˆ ÀÒ ./©¡z† Âä$q]J¸XÁ<:ÞÃXWî­ý‘6œT"Y§Û†:#kÙÐï¼—Sª”¦‡·«[”…úòÌ)m¯…؆,Œûð·tØ*jµž5°z—±º!ZÝ@t+¡‘½=Ä”h‚ÖH¹_Á€ƒÞ§P̶/_zø€9%,Š ³téŸÝç¶ÏË°s¢Io¥`ÔŒ0ÛßCñ8´ŸƒÑœ®Øª7qX¢ùˆ¢¦;qVÛ!°J‘û—½´”Òwë¾°ùKF¡•g9´Ü"¸¡˜U›¹ï[ªM(Vs„HÂ?¨˜¨$Üb|·ý9æMY nì¨*ùÀw©ó´†"ëµ™g,õ ýµ\ ©BÜݹ…Õ˜e[.f¿Õ“ÓêQ; c9ZÍ©—özy%xÉÇ7óàp P;Ðõ½£>´v»¥ÞWâÿæÓ¯%~|ËjÎ6äô›m›Ó@\N“-«íjŒ¬B[-ÙC3‡³‹ÞI q¸,CÈõ9øÎtß¿“ÍËãkL[£»À^th’E«Ðk7]êuUmÙ©ÄÙÎÑtCøÅ>*´¹Ðí jÈÌ’›ÏÇè¨5C;ÎÒ¯Ñ éÞ¢•!_´VÅÏìèHš¦)%Øà‹ÁHÆt wž_ΡèQ-Mò^Ó–<Ä u ÊÇ’2ÅCÈêÝå>ÚáÇÆ-ÄCSfüÆEí£O>#`‹ÒPBÐgØxê*õ„æÒ¯æÜù„±7¸.†&B!0饷ôF?V™ïbpº£|˜ÂáJ>iɾ/ƒ $¤ádYè +ÚˆÜä§*¡„8séìs¨ˆjVaÙ㪽P˜ úéMZ½}:‹óWi¢o? z4è3êÒ×ÝÕ8ºs¹5JïToø¥úë8uóŠO…óAx| ®%üø¸>“™šà¬•€‹‹¦K9”©/n<[Hcp%>¡™F ¹Ç34„Ñ“äBÖ'Ít³˜ÙÊéÌ—¯ß¨ ‰&ŽØÚòô„.uÌ0¡F·³Ÿj•"È ,_ Ø¶öᵨ üÞ„)Ë K¬ÿÂ׉òk•óª9œ,6;Çø0‚‚”‘hÎö!ÑÉY«qAqjòYTu„{hB›h+ÖÝUôýú¡²f팽½B}% þº"',ây/¹›…?^ ÜòMÊ…ÙߎXcþ6 ³v›íïB€²ÉJìõPøWŽ—µ¨õUýBø:;e~òVs¯‰ˆG'/-˜{LCÞG<Y¾ÇÌy,DZY›&Ü€Y”æ¹rWfÖ-”•à^cà -ªšGhSÖ’<–ã×ïâ vrýäÈIkKþÄið7 J/|Ë;L_Ö±·³oŽÞÔ¯«ÒÅ%i×Fv:¾>iœ¼½û±}©,Ím‡ÌY!äI \rÓWd>±ºý}á`_¬edäö¹îÝÃ~6ôá|;ƒ¬PAÍ©¾P‰ÐóO-ƒ,sufÕ˜°*Ý1—_FÏi´µM"¸’"ë)yàÁhN:SÙïîxžÐïnaXÌö•Ï¶3~(|ÚAŠwƒ¢â„Y8„I _Né?ŒUÔá]´œ4™ðY6Éà³ÏìjÁ¬¨!ÖÜè^’Á›7ê»?¥<äÍ×À‰Å¦Ï:&š•8iCd‘À  .“Š¹íWàxˆO" ŒQ¢i5RÝ­ PQ٥̦"j~•Ö5Þ oì%ùý¦A/=TžCáÅaâº$þŠ³šñ”M¶£6'—×½úfe=ÏnϬ-ùÍw'%²}dªç¬$TÀ€…j.TŽãXŠ£bq—‰£ìpYºÑƒZ”{ûq| Uß–Ü‘}L‰Ÿ‚˽+´\C=EVm­Ö[¸lê‘hj"Ë´ç¸Ì„‚vT{uùòz‡W›aðÌo£Q#ÿS?{¼íÌÅÀ®¸ÞÛ–_î˲õUÁ]]Ç™œ1åÂZVò¥Òó¢ÈRg¶]èýµ Õç3—Öð™Š>Q)5ßi-®ë"°Ð3‡X$0â(àÙÔO£›îüEà¦\`êdÚIeœ‡zñ)iFÃ|<ÔtâÊxÃØH»š8¥ïŽù–Öd‰º ¯@ëñ~_-û ú‰)j$¢Ê¸xÙO´<F9G¶Û5é“8¢kçpºhPöeS=—'08™#Û"ÑšÖá|IªFib_Ó®]hð 2Š÷‡hž÷}©NÓÀDz¼;£am:˜ÁÁÔ¾Ï ,²Ècè^ßë÷¿ Ëìnê?¡ërJ3¥>»S›2$^–®sTž*xÍ1´,F_Õ]¤‹`qF7ªÜ44†IÁ$mƒ9"à£{ï6Q—váK¥Œö¸Çh” {; ()Çv%Û$g£Ž:)5{:™–×çýÊ2—îg[zo©J+ͼ—û€ß“mK0 -}X¦Ð}›îû[Ò´Ÿbûm1Ø”%I¥s±´(V*±nŒ†rq óðf·¡@ Ôoï ®}>¡ÁçpwWTþé<Žz™8£áñ–m}²Æâ¶rf.MUåè1oÑ°Æç€-\§ÁmÕ˜4©æ«nìþ}ƒM 9¶aîØró'ãϹxåö3åïÒmQT­Ÿ ýýVžÊqÃ’š¬Z w¯ðjßIæó›F÷CÈÅÙ;M`©çD¡ŒQ)š‚2éEû^šª¤Ü6#=>ÅýÓ’µàcS&Ù{‡…7yãt¼‰÷4 ¬ª 6ckwƒÒønBÂ& ›ôËÐãTÿ®[}™ZM>†P¶Êi}™VùÊTFO§)—18¼ú”N|\céÁ£á˜FÜ+&ÏD/ÞAGTU¤±M Ã+ñ ¤šs2v2V'™Î&”)CÐ&¸NÉ 9IláåLû&zé4TÚá*„/~ÂñîpVI0Ÿ³­Mà)mÇ™†v˸ƒÌßæƒËP ê­û¾åfü@sÒÀ˜xBBÏgŸ.¼5)ó±ðÐYzA¿˜„Àè—ßX»>»ƒ¯VÖïôè$xË0ÂØÛîJ­œÒnÖ.wpX¾« ù—Éüxv›brÔ+«Ä¡Ôfß×<èÖ¤_Ø„ç¿ÿ¾‡ç ÄÍŠltnnæSÞת‚Àóã"þ¹Y˜çS¢ŽˆH3ãw0è„¥BÅ->¿·ñ"…MqByõÍÖｑ˜ Š]T ^û"ï˜×W§1¡Æ㈴žØý%Ž¢;Т!ºt°0¹bzGZé…Bâã_ÜöÎœG¶tÉc“ßWÂ"y°öQ׶2Z°ÉÿB±Å•¼œc$qUyÂëÿ„ÔC7 QŽ`b—ìkÅKíˆ29,Õ€sÞ™ŸÙm‚»Dmd$ï·ì3ÐŒ¦CÓb ­`ÆIëb,BR–óÆ‘Š6Ôkx&©rÈ…îÃòYyrƒ;O1¿as(SÕF‰MÕ;W5ÏŠ¹œD¾"ÂPÌÅZ1 Œœf 4‘ºÜÊ^‡ÈV$ñЬí¿Ì†c‡ÜÞýÒ²_ãá@cUÔ 2¬þ¥búÍÆÉ>Ÿa"ùhœÁl½}²°)Ž +œ7 Ý+ÀP¢¢®½Ç ý¹“É-JSNúSöwä0žá”E›RbAíØ‚×߯̽ É2å#Ôi׊«dŽÌ§¾! áàH/#‡Ö ¦m[ ¨b{¯G`¹ç¡€.àQR<„'“ךÚÉ“¸ E–¼ÔcÞ&ÂU$Ô×¼ÍI×6bÎãŠl¢Â;¿áÛ«¦BªTO+š(-1"=Ù|V©§Ìøav`è§%\Ií,ݽEÂIãúÐk/çyk®3ÿr˜¨âa½šRÊÆšmLi{>墙ºÛSÇ)ö*LÁ´áRRÈè¶ da«ç]D.æ “«‹½v§«ëÏœ0”Ôqv`+³–ô&Ÿ®`H¹ž’ŸXLáËج¸o] ¼MWýjZfÌø”ûšqØÄ·j¯gÆ™‘÷eÎäÓúäŸW®µêÛs ^Š…é\ iÑ?Û5Êß^j·Ѻ\õT ·„ÕÒ¾q÷<‘iÙ3.i[A¡Ð†„sÛ¬ÅÛí³¯é 9p]€íúQ&ã¥Îz {¡iNŽåQ¬FD;| %·4ŸÎá»"Z†Tº¶¾6U±#J%]ómó’-*À/ALl¿R=|^ÁÚ ü\5Q–ÌåB8/E9el…— Šž×‹ßPÀ¢7çÍ´Ù"³ôî½ "×K®Ž|)Ã[ÕÿÃm(Ç]|0ÎlÛQ ôÂB¸—÷üèû`ÈáÆ{êÜYœKW®Œ Y§ö;q Ñ€Xž<³gIç²Ss7#sGèSµ»<µÔÝî¼ùèR‡Ã©°B±>Q ËÖ£Îq…ÆD2’!•Õ=®´sŒCaµq±3Þi"2D#Q«*A”¶Ÿ‡ƒ+dg>³u(Ò瓪67]XçE¢Ü©ËåÄ×EEp xGM<ÖlÛ! éœzDeÙÝŸHÜNý ·ê˜ªPèyÔ0¾|éQ  ólªúÕ/ö.ô{ˆþ-œm”FÃ7C=‹Vñ$ÂP™eÆMµh:|¬0s™H(Ê?‹ÊKX]9š«ÀºÉ@T&2‘*_Æ•õ¸:ƒœwWnV«‘Ž8û¤?+G~–ã56[UUK‰çá&úZ†c;J®’d;îIªD¤ê-Eô å°ý[ ®–B B4ë/Înd@Æ£¯ÌÜ%#zpEÈ«ŽfC{×Tj1oš1†(ªwÞÌ•ˆ…&DynÁxÁ“¾ëè’Í`½ˆÊá ÙLé©É,±íf¼ëþ´ Ø@mÓà‚S›åõZÿ€àC*Ä"Q,21ª›ó3zæ>Ž]à°!-?,aNÞ¾ä[J°W†õ]hm(ïïüù™€C}ü¡{\ßkÄÑIü8Q–"8e½e¤µh\L"K–^W÷<<&†ä´šÂi‡ZÕ òò y ®¨1•!J^l×S'²IðÈŽ„¯“”f”Z ŸãAÔÛM‹d ÄÁ®Æ» ùI]v\‰–V²ð$†§}VWˆæ…©üï_å³Èékôt&VXd¾uÓ¿{ò¡•cÀ6O°68ÅJþä á9ËO¯`rÊ…ëù͘°å¡ºÎœsk¦8Sq%À"Ô²7¾ ÖR±&‚ȵa숨ÒØ3Rýl|EXwVýÞGÅYî㥥Kˆ¯'K+–u¹ÿ œ¤2?àtô¶¿óNaËöC¤!h®7(±Dã÷5„Wê ×ܵáÒ¼ÔŸ9þieœ´³J%rxøê$égpGäÄMy÷Ì<è•Øù!j€­ÝÃ9>ý±Éc<*û«û¤GYi†6k;)gèì±BB jóðyFJêöÁY"—a”®"£35äaåì^P'óBõX|s–ü—}ƹ¯Ãç*Tþ‹C™Ûw5_‚:ÓA[¤¾Z³¹§9°Ô ­ž*K{C{;ûËwŸÝœbi³ñ¸ÌnËUÜ+’äŠd à„¨ÚȬ)À,©{¾o7‡ þðŠ\B03y€¬¸çàD Àž‡z€ÚôHFç¡¡ñväæõ|é®è¥hI£´ÑlU\Ýæ„xQ äîeÒu©¼ú© ¹ö-ÁœEëLT‚܈|cOY® (ŸS7®´Ä]ùê=‰,§Á(EKäŽïðã]ýÅ¥v­—­(x´ËúpÈ¡o}‘e¡u^\š)ÚíãNÁ±WΤ&å/Kt?w¤~ñû|9{ºa*õcŠè³ÕíÆ|c=¾œj$qCe5ú'¾_öùar¨[bG›”.°›Öªãi‘þÓÛ%JÁ­¥x{7îjòûÐØèõsDù¶‘,ù§†—­ãÞQ‚Óø¾WÔáfìSgXº` úi÷ —O¤@Ic7kÏìºex Æ…;¿za«Î>ô——äà5NOCš©V¨‘}‡­µR>C”óê6@&}×Ȩýs—‰«Z‰´L~én5?ÆZ¶£ú 7–QmˆÑØŸlçºÊÀ+裞hMeW3¸Ï hȘãGÒhU…žw ž8± þì•ÍLÒz]\äÛÔ_—j]i­qŠÒ—Ê›e¾z X*ìÚASz‡ìV/'™²§Ù*åQ&ϼ¸Ê«IË&0Ut´ŽÑ±½½êïô͈’[üf I©`m*S~ E7©´;Kà…"Ç eÑé úܼyX ò¤W+wîhí’=ç]ZÆ‹È¢I­ùý¼'dúH”ôjý7*Îñîx;;êIÛ!gØ5ý^¥À³Üθäh•\Àùãyá½iÒ¬¬úyÐÈ04V²xJ_‚ÙW‘…ý¤ÈãöÁ”dÿpÊvÜÔðß¾–jòß2 \¾6ë-½©‡¾Ò23HW$³ÜƒpG™æ§Ò_#VpV˜ïék¼ãƒhŠte^ãåH÷€7|ÖÈ&fœxÛ—ã]i¨}ž~¢ÑU_¸–Rœr(†ºa¤˜ºÂ§K(š‰5l[pýRZ uKxÌ5ÿuhŽÁFZåpŽW#Ùõ;a%tGó©ºT(xÙ¿¤ ó¸fgÍq6˜%Íkå7“ R·,ÏmŸ7¾E:UV¨ìek(!\ákzÞ+y_å =¶‘þÓÍ7[õ³®=oåL Mù… æ'P„„c#‹‡‰áÞÛÕ•ob¨ÓÕ•n¼Éâˆüð:Ôªz·ñ•cÈrIÊî^Pæ†ÂHú 3¨­¶OÅÛÜ0Æck¢ L’6‘Á‹’‡ª{ã–Ü‹«Ø¯ú™:¯䞥×o&]µ–‘fåò*%N7ÐàßH wh~‘š"ëñ _¢ äåÂE¤5Ô¸.Dfe úrêBï‰JÑ»ÝWqGÒõæ kuNÈß)\Î|Vêyý¶b·Jè)ïë’ŽÅÚˆ |¶B+ ~ÌÈhF¾e Ïÿf}üIà›ÍÞì܈‰ ·,Ä(3õÙS—J9ڢÎsÊZtÒ%FNR=¼HJÿÞ¦½ÁNH˜dàñw³Qžo9A;rܪ2˜Â WÒgÆÍð„ÍÜÇi–9b+,e}„i’µ¹–`-âªWßÎ(õ'A‡™Í_ºŒWËëf½’½zÙᛌ§;våFº9ð’÷g/²“€ô¶—O CÕòâN§’µî5ÑŽÈXS—òÏ:£~qÔkê*±«‘…8Ÿ5²·wÁ¹è¯ëõñäâú-†æŠ¦Vy>¾×dü%H_ —œ€¾$›ÃÖµ•žœY¾ìÕUYºßŽAݨ¸Õùñ[¯×>¸Vn;PõË=€ÁxðÕ±Œv®ß®åÔ•3õÊVè‰ Y‰RÁôçrqÿ&þ¬dœâjÊŒcµç,sšMŠŠä)¯ZÉâG%^ѹ6i„Þlê~ÿ»à˜ÈZ9˹yÐxrÀM;‹ÑùÑkÇeÇ²ÿ^,É â²þ=:ý4ÙÜhÝå,þArO§¨×ÍIͦM…÷ᵧŠÿKÔl¦Â(ßvŒ¤~BÊ ”˜<ù»†‘á9çVrnžÁè ŸC†W–Œaéx’3fkü½—©Rf¥.3ŸhZ28-”ª§Ï%—àlü}Tñj»s禉Ý?¡ýC"éÑ¿[ö5Z{ ÌÁm²aoN(I'‚–R³•ÒV§æÖÈø…©«š5 Œu—XNJŽºêÞyx»ÑŠ’ÁÉâÕl/ß61„ß9«8ñvay’~ýýUaO¦‹pÁåM²’.,E¯Ï‘fLJÁ¯@í žúÚžB;K"»”êcß6ñÕ@®¡×㵋Gý<Ód•½@Œx=h°ïÐ:Êž`“¼$áP'ˆŠxâÓe'žÂÏ;Ù²‚óBSÄÉzè2ƒÛ´°åO6ÏÇ&wÛUE_0'—-‡{]QƒU*k§m"µÝu¡8­Øé»Û”æµ;gÜÈU>Å2Ô¡¨Ú3 ²ù_\Ãù¨ÌM"Ö³ÚÄ”wÜX¿e0ÍiŒe\2áyŠ(-–6É©»ÏŽ–9öÉV±²ˆÅqˆ½K»[v ~… ’ÓCÝS$Ôꓦ“äNÊôPxOáÝ<®Ø˜ OuQIƒ‡ÜcZ¼Ô$]DlÜùlÛx{ô€AP±43Â%G´wÞÆ…á+ó_­€PSŒBø©ü]ŽÐž½ D›ê91qÓX“Z`(LÁÎx)ÏMÞë½¾Cz~ý¾ÎÀúyÒ’m {F½•!•†)œâ2Ò<€»18ÚI9ƒ•ÅÜ*¤šò‹-ѯ‚Ñ  0´ô‰{-Œ¦Äû~‘|Ì=Ð|‚í‰CÒ¡9kõÆÁøÝ’s¥³Ëfc­ßz€ÔuÅÑ_Ïõ§Êƒ° ö‘ã< Ô<ˆ2ðœŸù•³pÈ2ÀBÑÔ„“„‚Ú›TDßÓŒø”^N;BnzÙuŒè®ö}4>àÌõŽ¥<Ý¿ü\º>“¸ÛÖ›¼ Lí÷eW ãmsƒ—"$z*µÂœá@£íw]l­Â cÚÌPªM§)úÚ RŽ>½LÌ€AŸŸÈ^·a>¨1Ífâ;ƒ:Ï4NôíSŒŒÃuÛ‹椦nƺ=¶â isÆI–áÃÛ%,zZ¸px”ìâ’Û‘ðªBÿR •%ýnæl~JR ôÊ€æóª)Ü™}õZ ö;–¥c/oÕ4å ^ô6ç'ŒæèI–~¯$"@|³NÄM2.¼šH»ò›ýWùXŸ¾´Qî/L®PøGPÏ!ÄuMS“¾íEî*À6¼Ó”Öœˆð›¦…¢¼¨:ª"®8<§2?$Ä_Ê;«Ç8ƒU(:É6×êBWü ¡·GK•lP¢\œå«ÊŠ›ëNYÛ÷áFÁÊ™Y{º«u,¢ˆVÑ\ߵݥY²¡ í{º 9P·”‚X¢›=(Co#X ·®2N÷½4MÛž àLœ£»±Pû# ¶ Žž=»”€M<¿ÜdæÚ;íéìïöE]$°"qÀ°@‡àÇÜEÉAw$x¤¥Ü¾"¶ ±°»3yÇ&Ãú™I«hFö1#Åó{ôÏ¿M®r¤Øö Sor2õ1–3'¡…GRqµÛ­YÚ/VJUBº!‹¾`Ò¿6aãK¡¦ÄIj7«䯽Œ¯g‚ÕÅöÅiØø ¡ÐˆvÙ›yE~§’œF fP©ÌYí©cÝÜÿÓ—µ%5¸¥O5m¡m0ΔJT0$/ò`Öâ}ÉÄ-e15øL”Á³KÓš®‰îe,/ëRÙŸ#í‡cLLÅö&&ŒÂ½NâÝ–„Ò„*Ds*ûð”?d §~ «‹Vô\qÆÐqï*%®&MFë'Ã÷+:¶³¾`;ÙWËÃÌZʯ® Š`*Õ%Ì`ÓOo²×•Áè›8¢UiRiRÈ,,¬HmûWo©bO²š*X:Çn´ö×}Ãï‘En£ ÀÓtä(„ƒ‹ë̉a>ÙªæÄÑœîIgÏK·[ýdß±m6H¥°/¿–d] 9¹8ÍÒ€b8U¼²lLä¯Å†i4áÛþ˜ø/@$Ž‘敦½ ž3¢GÏ<±å™xç¯fu¦±ÖÅp<¡º ~ˆl lÞBliÏßFÝ(_W圅tºðú ¡³û’«’uä@,©êx:füº­VðücyK§SrÌXɆ¢²£®y¬+¸ô4`i{$S®ÞÂ^¤8-~xä`ÖÃÂùæ1ö”TcÀ&Ú.ʵœW-œÃŸRãô_àO`ÒŽ=!–ª…·Ò,ÏèÚihœÎT%ÀeUfFvÙ‚0iƒfC¸Þß0)“@xZÿªHŽy¸'©dXŠ.ÂÈ¡ìs^Á­¡Ô–c”Òm+—D±—ç(=gö†ö9@ÌÎ"uK¨.#D¡P»Þ“µCÃ}àÙãÎô†‹w!4W€b¾Dûø5½i¡K‡8;c¡ù/2öäí§ƒ–c^ÒE§%déŽVJ«·¿b âŒY×÷N´ùóY*V±:Û3¦±5âižÂÌ`ÿ<ÒYmÃ\pŒâGþѲy\AE¤Üf?3 ‰©‰p°ÙLÁLq=mèÈŸº…00º»Ùzë ¾ÊÖ©éŽ*&ó2_rcs°4Ó3àÓïKÙƒ”Ô¥µ_` |ZBŸ5ås­Kï†zô42-ì+œ4Þ`Æ']é> ¶ùY XÞGà%Þ+¦¢~š=1ôÌÕ…ìÀ†q0¦ÏL×$‰Ñ4‹£®.3T±žXU\ÜÙ<‘Ò¯7€ÆzêÄÀoÔ~ª^V¬€5»VÚht'ð“JÑNîG+|b°Â's¿ ÔP¬£ wAæ…‘DÅÛG7ÿží·˜øVÑŒ‰lÉå §rñOnr a!Á ¢„rw*kXLy+÷݉¸$÷üÇÄÔØ~ñŽœt2éóYãºX\=+I0º‰L/1˜à:éUÕ´n"•CÊÏE!ʤßZOäŸñw'”&ª²ÄØw7glÔÄ5è®ø»”Ï"ÊC°+bˆ¸uWH+2lšž|ÍUŠjúd$#3MÚdØFí&›ÕŸm~5Ì«y—$âŽOC¬7cŒ«§Ú–ü6‘ ¹U!qÐËù<âÍÁ!-±€Î™•‡ð©ÇKqPo—¬—~‚ªž7•Ö‹gÁ“ÆDßxÀ¨R\®PW´ÉµÙÿ‹Xùëgž¡V:>éâÔ=l Ùò÷í;ØdDo<ªùÃY¼ôüé÷Í€eóÐüÉ”²â0®‚K20ä-«C]d7h—~þ{ plü‹AcÕjÊ`²HN1¸î 1ÙQ(Æ¿iöùŽ0BÖü˜íüû¶r§Å?{&Y$»çX‚ò¹:µ«.Ñm#÷"Ýò7]L_p¾E‘Dd B­¾Vñ‚aîv×µÚñøßö8!î)Õäéz¹o®fh¸[¬H[Ì4T6å(ó’Ñè~gkú© ag-ªŽÙÌê.¬P†ñe§gµ”Núø>¸'{o‡"P2ýV{]â±ù™¾ÎW03-¸Ž%‰Zoq0TgêIQ‘‹7+Ot/ü]‡ %Ïq8TZ9b^*P4©§§S\ëñ=3ÝCk)ûÊÐÌ ?ö‰–uП™pŠJ«±š…i`ßÃsÁ¸z¡Rh˜@=Y»ÜúJð²1ÅÄSX7BÂü;˜8ã¢FsA#z` wÂÒŽ÷jÔÚz¥x‹S«“îU1K1\Þ˜N(±“}¶v’ÉvõS‡F<áú»<.ÎhgyndQ-E‘†^ÊЊrøÝBeê÷c)fá }¯¡ã‘| =™q†ìÔû¯šÈ0Ö •V/›qcµ|ËncÕ3Šd¾â%'S³ œÖâ}ØßÐåî)Û¹;÷½×2—¥zzêyª‹õ‚,e·k¡Ç¼ˆ‡‡d— y˜ W`@sø/gÄS™7*îJu¡~vw UCÅâ>i§‘AÚ²œ7H€sÅñV{¹õ1@¬¨-«¸ã/˼Ó4°dJ)ßÊ‘ïä©™›C=pKr¼yqG9ï(½r «ð_nîÒrCZA–e}ÁñhôÚvJ«ÈwÝkrœ+ÑE„9Juœ§<Ø4ª7ã9¯þõÈE1.ºÚ*Âr›ºˆ?rÈþSƒh-CÙ0`3¹>³ç˜r¤È‹ÛA9«-Éä´Ha7E펯ÞUí?.PI!ñ2;‹ª+TÄâ‘uÜMrmÁÉëË4”K‡#^úÍ®­Â÷[:iÞÛ Þ×ââüÝr2JÇjæ©é‚væÜágoÙAž‹Ä^wا¥¸`ìÛOÉÔ!vÅ l¯Z˜ ­‹Xlo›Ro»5™wÉÐh·$'•‹¤M; ¶ßâSœbØ<Ñ [`à<ÃlŽ›8 pÈ0-Yvï'ò`ö.ã:b„zƒSí½.?1•‘Ó-¿[]t}²ª[‹H°Íýl…Æ.¬ÞÝýþ@Ö\b”œzØ’Ó›ƒq—zv>˜h*ÅÖ˜C†Lª¦(p‘¥S ©½}hœñléˆasM-¤.ÞÀ4uCÖ1"6„LÆž‡çLÊ¿íÜ#‡KtóÍÐÒ‘z´m›KiMÈbEk”ÍSe¢\7Ö‡‘T~t˜‡Á¨ƒÍ¶âU‡¾– XpjD"­xAŸÊ7¶8ËÇ-¡•ÂÅBmàöºLÓ˜«×r‘l>¯•_¼ßžz: øòK2É]¨ûû¾xI„œû,áåüóêÜLãHcvØ€¢Raó …Ôš@uê6Qæ›Mm{eôh¥Ã Çd–*°ísr Œq©xj•ê.û˜õ,…8ÀܶGöt3må{gµ+­XRªûl(RrT7¯àd\ˆÃ?å?5¾ðFX¹Œ–—ßD°,;Ü·RåI¹hW`Üâ*ÖÅ2»¥US&éÉß®Iº›‚SjÄJŸ{á|7 B«€^³~Ùd#8ÅÒÌá•—ý í¡y7v\WÜ!° `Ï.ýTLþDõ†ÎP¦ÏÌõæk+æÓrYLš–عA.öž°G)h•4;È&£~»U›‹Gƒt|h‹:7]™ÝïíAé(÷ -ñ¬F"që[ñ¶Pî­=y¬´Ü¡ÎƒˆBT.×ÊyÅV úÔi7ói¿—>Ù>ømR9Ø@†ß†Í†@úX«qk#ˆËý]j½Ù¯e:9Ó³À £6æ2QÄù#vIž÷ô[÷ëKµÌlƒëéà@løó|ŠEFâË2Ìò•7í@9B¸KÕß¹Á_žœm²´&9ÎØìb“Ë­„ÎÞ¯ñÉùæõ¾ð òV|✲˜b‰Ëó蠙РÞL‚ÿ™f¦Eë|ŸêòËz„çL6žk¾×Ñ‘¦¾¶ˆloo™9eö {ªP,¬jëx¬Ç¢#fm‚5ým‚‰É«vël>/@’à–»u"·E€Y¾tÇ…«M®}-ÃNôÌ,Ó:Ìý-ŸËŸºåêd*#ÅÙÕ¼×ÕÂUZÖ«=2VµóËdS¬m9 =­4'Õ:]I œŸ±”z„1\¤|z¤˜ÉH‚¨EiôýJ~k)NÃz&VÀ¾­KÏB«ǥܳßÚÄ q'ÉÀ°Š2wsTݨ:eüP7Oôœ(û½oô+)bxa¯ )»'†xܩξw­cuª˜cmŠR^…i|ï•ê\}ËÖ„ˆa.½gLt¥­æ» •Vˆ—í2n‘¼ßs™ºä¦Y`%ØxäNJyzW©.Õ¤QÖû«1½´U]Wº÷„ƒºulïÖ2}#×Ð?—â”-V§\~óÓ9½‰™ÿ–ˆ°ßA(Œ@—:Ûß_õqÎäTr®ßaf—@~¤ÑÀò¡Á¥$¯ ]å¦{³mR-:éf7JT ÷Seü™q‘$ÛlÈ‚ýúƳÝt_3ظpDxæ#±('ûÍV_ß$)k6+âËl7VCY9——']oøXåm€s3?Õ«\Óßgç< “úy±‰+']A/«†ÁÜ Hð%KÔôí=DUèJ—«ÌjUØ}1]ÈxNsì¹)6ºkö•‡‡§WíûùŽÄ?Ë <+P ŠÎsã7nQnÕù4?…©€°ï&xœéOÓúä),äÿ›PÒtí¶¼ˆ~çŠoDµÄHÍs¹ ß~‰¥ÅšçЖP Dê,}Ÿš–ä@Ò@0—Dt"éÅn·QæON'$‹:™¤Sþ_Œ?U@Æ7Xj…<ÊÎ]éVôâZåˆ8 ý|¥a¸ô±6æÊ ÐˆæG#ë}çM_•õ~ƒ4Èß<«m‘ìr,÷‹°jœÙæeîæ׺¨G9(úÍú[|Rk-eDªQ\œý\–=Ä-ilA¡Àé M$ªq£Kz­óÀ+ÊÀ­ä íÕ;i•q}»Õ]Edɸ0EnaâßgJ–’Û«Ïë€ýíÌÄF.(Ï$Ü5“:Y@´K¹Šj˜õÚA³ï×DÕƒµdjhuAþ‘«Øݵ¿ÆKu/G­lÊ÷ˆ9/­2›¥¾<,ò‚o~â—FoÍÚ³mÍ.›qêgAt€ÂF”œØ}Ñ:è©C ‘Z¼i،ن½9Æࢠí2#9-””#Æó«XqM´4"¬{ÊÙ£(ÁÞÿ'I¶ÿ¼(†„ôÎ×CûTšÈY§ô¼Z7)ó¤ï5¿†[j˜lÉãxÙÇ;ºÆã×Tw‹µyv-ªj@O •[Evü°7Š`{]¹å endstream endobj 1968 0 obj << /Length1 2137 /Length2 14858 /Length3 0 /Length 16128 /Filter /FlateDecode >> stream xÚõT%zû çšl7ílÛ¶­©&ìlÛ˜ìf²m[“mN¶k²{;çÁœçÿ}k½ïj­Ý¾n_7~›ŒHQ…NÈØÖ(nkãDÇDÏÈ ‘Ödb02²Ð322Ã’‘©š;Yÿ#‡%S:8šÛÚpÿÃBÄhàô!5pú0”³µH;[˜XLìÜLÜŒŒfFF®ÿÚ:pD \Ìrôi[ #,™ˆ­»ƒ¹©™ÓGžÿ|PQ˜¸¸8hÿvYÌ lrNf@ëŒFV[#s “ûÿ„ ä5sr²ãf`puu¥7°v¤·u0姢¸š;™”Ž@ 1à/Êykà¿©ÑÃ’TÍÌÿ¥P±5qr5p>VæF@Çgc à#;@EJ `´ù—±ì¿ hÿn€‰žé¿áþíýW s›¿ ŒŒl­í lÜÍmL&æV@€‚¸,½“›-ÀÀÆø/C+GÛs+ÿK7ˆ ) >þ›Ÿ£‘ƒ¹“#½£¹Õ_þ óÑf1c[kk “#ì_õ‰š;>úîÎðïáZÚغÚxþ™˜Û›üEÃØÙŽAÍÆÜÞ(%úo›ì™)Ð ÀÆÈÈÈÁÎÚ€nFf %Pu·þ­dúKüÁÁÛÓÎÖ`òAèmnüøëéhà898½=ÿ©ø_ËÄ067rMÍm`ÿDÿMþ…?æï`îÐaüX?&ã_ÿý¦û±aƶ6VîÌÿ1ƒ°¤†¢š8Í¿)ÿW),lëð¤ccÐ1³1˜˜X¸lŒïÿóßü‡ýßREóWÇø'¢”‰-€ë_$>º÷".ÿÞ ÊŸ à3ÈÛ~ì3@ùgý¿0²1}|0ý>‚¿]þÿíþ_Qþ_×ÿÿV$îleõ·žò_ÿ?zks+÷[|ì³³ÓÇmÈÙ~\ˆÍÿ5Õþë …m­Œÿ¯NÊÉàãB„lL­þÛFsGqs7 ±¢¹“‘Ù¿–è?SønenT´u4ÿëÁÐ112þÝÇÍY~<*Ž³ú[ü8©ÿM)fcdkü×í1³±  Üa?Œ™ àÉôq¤Æ@·¿wÀ@ocëôáø ç 0±u€ýk¢ìl¡¿DÿBìËõqDþ NƒèÄ`û/â`0ˆÿAL‰?ˆÀ õ}ä“ùƒ>¢(üq~DQüƒ˜ ÊÐG•?è£2ÿ"®dð}Ôiø}d0ú/bûÐÙZ}4û?’¿zÎ`üøQ;ðýG?þ5î?e™ü!ó?ö,A—øKoëìðÿÓ@VƒÙ?àG{Ìÿ?˜Yþ~”oõøÁÍúdú`ò‡Û‡«ÍÇ ýCÿAÍö¿õÃÙöÔ¥ÚýQ0·û8OÛô†é£Ö0aú¨ÕñO¾¿Ðø >Ì?Þ¶?1ÿtòã-`p2sþ£Yœ\mÿáðÁÁùðƒ¾Ë?à×LâÃûɘ?»ÿ¡óáêtøWìÿ9 #g‡—¿Ÿ¸ëúþû— tÁ./ØñYÔµ?T á¹ÒíMðÍ’íiü ¢ó\vèp~B„N¢ªJØp¸Jþ‰¼º#Fy+¸BøêyÒRÚš Ôöìõ¢§<½×»4…90™"T×Oð ŸNUpßëÕÞKÝß¼´Kš,ÛÞ™Q1íÁµO­®¿ô×XÈžÒ~» ÜKé ]”Zäÿ¢9²ÃŒylb(':jÔK7¤¹Û»YÔ¬ÉwBé8XïÓ(–OíMæèÇyµrUfÇnRmlð[Ô±irOáÃdi¬EÏâÂéˆB½…&þ${Ö¢®eÞÒÑÉ­Qì#}‘R¤é#¥m2áá#+•¬NlÔì:Ž¢™W&ý3õñﾂqK̆9N:=žng`¿½''%l`2unTµÎøU§@ð‡I F˜Ìˆ²x ¾žej T¢¾[òƒâ•DMƒÉXŒÕlHwy ¾÷Êgž ¬èñî? ƒm.Ú«î9-—ꧣS-¸¥{l FežÃI˜Ur«uOú3„ QÆÊå@lƒj9ªŠ ò“Ãr)p›CMoŠî ¸'ê§Kf¾ÁW Ç{MK•NKê¹~“Cª,›’ˆŠ^0e”±h$äu‡ÑM]wIÓc²/VÎðþPÅ‘>%nàrÀ¦Ä)—ÄÈL†ß$IãoÒ¶è¹3Ën ù¡öæZõþ{ö¥ž4v·wjûË–†<½H¥úÌ— ùý}ü쎟Í,(ˆsBWVúÈŽ=%r!ŠM÷¥pÑî&*îÅ[ ]†›(ã½_¹œ ì¢î·‡b«å¨dùœÍJ¢çf†D'–sZ{ç"ôŠ¼±›š !»»ç`wéŠ'<Ô¨Ç}f)?ð¹Û‘,pÅ ôØS⛆n#D\اOœÆ0rk-ÅÌsÁþ^ŠK™€Ê«Íξ”Ê&ók.µt–ÆãE¢#‡”ªÛ×A«áBY7ÐuRoìto²¢“.'ª‹jÓU%÷T¦Ìi¬È$Û5TÁŸç67æø¨:ß\.(œÔ1aÄ•=úãû¤‘s°æ@F­ÎtõCÓòµÒŒ–ª‹cí³ô³Tâ rZöÙêCžAYµaÙÀÄn¤î54ÝÉw"Ìuq_æ餎gsO™a,¤X¼Š<Ë1ï~cs¨”¹æÎÃÞ­ËzÚ¬è÷Ù|3ÊF]”ûú©x3 È„KŸ_ñ¸ÊF<¿ä®‚riÿZRãè=Ö„vN ˜ 4öä#Ž% 3±n}MÊ÷Øù‡Д\¸EXÆl ¼¹ëš¬¥mlhD1—ðš"iPÕbŸ¥ï¢Ë:›¿,Íéjæ c·&®¯L{Y¶¢nžÃãÖÂo ãÇ·æ¸Kj–m}®\ÒÎñ©´º}¼-Gm3NaÊçfð˜Ñ¢Âv¬zGå *MÐ\Bs±¨{:“”¢¬N$*·8@ˆxÁ@Ýíi¶öË~#ÌH×'ù @B}Úw¹·`p˜š_IÔ&PD¦b­6Y Q°ÓÔÿæä`KÖ‰QÖ&å5ËYwýÑAøû™UQ-ÑÕÌ°ËWò‘Å\Ì;( A©ÀúÔã>Iã”`ö\G,›Õ-¸ÏÎC™Aãñ‘îS›±¾ä~C‚µYB)Ð䊢½Ùï@Ç>­©†>cA„Ñ_-÷žà´ƒ¼tï­Ðô'W:bÖ:Òõþ™–ü|$•@Aj °v±°*'ýa:éŽÄA8C‚‰¼Ð¼kmã˜Ë³ÐäØÚˆ˜>~7ù³’Üu»GðÂŒ Y¿e…3þë¬YÛ¨›Ù“ìâ ÜnižKiš/Ö°„øÒ8ÏìØ#?-qТ¬ý¹ˆ¡äá_Egzt:.‡f쮞BHF¼|ë•.ÞicHŠ "03Ôá^ŽB‹ßOMdhn*˜ˆü+¢ŠTlóûw|H¢|õQ¨Ct 2¾˜_aÙåÛÕ‡]s]ÎÚ¬$ãIµÌ7¬!ÚnÌßf‹ <^ÑN³[NÂ5¢" *Æ˾Æx•ß‘ØA³wÉD!Ê*jŽnx"fi‡ÍÜ{¿ûŸQ‘aÉ.ɘ(0#­Uúoo(åçêÕb«èêï¾Y‘WÎðÊe-–V˜ü­›µ’g³ðë\Ót‰T]ÏÎ5°ÝÎ4èVõÆ·»¬ GÍ%F²Ž¡ ˜ªÒP:Üå.¸/Áû‘aòrÔ­Õòæç²&×&âs Epy c‰¶ÈcúãDÙ«ÛÂÇNº·_:°Ò ËוRXóOO0垊“1çAÒÅ]}‡.€lѺW¾õÚÝŠãŸí†@£ ª†c ‚†‘&d(èÀñúa'0PJ#VïY$¼ TAq(RWrblºI†ôøÁbf²(²éÒš!üÖýVÅ:]åTc«D¥Œ*áµÖ?õzBzöïP]ïlºa®Tlj«”wܘ‰~¾Bòí$\1‹¼úEŠ¿H»uÍŸµŠ{m{$ó}…X2c² q)Ð\ÆÔyK8‚ß&ë&A9É1‘Y£p•¨%õðŠ®xb \E·“¤òmA+¼¹¯Åï߈-4!Û4Á_åp—ŽÅªêO3æe_ˆ‰N©M°iÒˆ@Õ„Ââ&GÀàiXP»wÜ8’³“àu½]‡ó}Û!B{~…Nv.ÀŠ0ÌmfHØèª[%H*Þ)ùòÕpkgžôί“j\ –¡÷ž+š7ÍMX ùød™£’>›­d[¸qGY RWÀe@Œ­N„¶CNà†Âdº_tRnÿÃ2‰/9ä4’ ÍÔUÕ¾&©sQ™º+nÞªâ"8“g~Ôèz0ãNòjœúösô"™ÌqdÃ'í 8ð1ìaV—2úb–{ïÊ€¹5_`muÕ38{oG"k!F°–{ Ǫü©ßÑ`Ÿóp¹S¢uF=ܤíF¥=gµó¤`L ”÷kËy4Àù­.Ýõ &”„· ég/øû-[øÅFKgŠ ×4äתïîþ âÇ?‚Öízë™?£·$ôyKQ¯×c ‹Lò» ¤*èƒB¶³~G}áÞNª1;ÈV× bjœQ¿|4¤ $•±g46Œ5Àm=ÅyËZ7a•Ð+·Œ§ô<èç^……Iix[×¥J7-â&ùÏ `Ôd½Œ™ ß;Ò Näú†? è78¦e¨ÔbeÐ8»›ƒÖüžsxk!«¿gÁy1E.È*X Ï•ó^úU<Ä’%j9dö5êK–ƒ³1ÿÆož{ó!<ýÎó0 X[qýé#Ë[ù´¹ˆB›¯¹O.‹óTÌ©I¿RâwIIÎا=ß.`^ʶ+¿ˆ»ÜªjÀuùYÃ’¹Aê˜ÖÏ!Ÿ[°û ŠÀÍa¬ÇÇëYZ‰Ô^¸#µ®’á¿RM‘Ù4jÌ‹§+0€ Ë!§¸Wø£Ïø\kÛwœ•¬šKåû“f‰Œª¦Q»–öë>—$SÝšg‚:±j§%«ƒÌéZï…ù«Ï‚Ä­(<'øûUÞ¶S™‚˜¿µÀ^‘ÑI« dë˜T«jrÌ1Ðã…bFøèA|£½7ã¸à”Ëe<ÆÿäqÈŽ3V·eñfíàr›¦xM‚ÀŸ cèçvÕ¶£ßV8*ÛÛÜ—ç^RšX}3Ɇ4­,Èàir¢$òÛ»Ìx¤fhñÎgiǡ œµí5k:ö¶-ÒD1϶é̯Kn–F‚öâ9»>Ã/ O³¥ñá‹a†°éÔã1‹ƒ:ï™·3éP¸iÇðùÆÝð­ ¬OÅëu>i²žöB_@”gÌH©"¸=äU¤e×Üñ-ô2ûã @cð?SͨNùLÉhƒ a<)2BÆ@I+búPòûpm“÷¬»ôlë½ÃBvRu„j²àñ™ËÏÈ#/Õ–E1An/¸@1­šºø±²×qøKÞÅaž½]7Èß¼öXän+°w /w®½ïå·D:åˆ_¹_í×íÝþ&¿ð¼vUÒ¡Ñ—ŽÏµo†¥iÙ„»Ø±¶¡Ý°³3‘‚·†+V– ¨Rƒ¨¨×B¬âü™ú ŒUœ÷ž!ƒΧۗ/LTÚ%/à'~q@±(DgÙíÉ«8ôó»À)ƒar½È–M;uàÎUj::g8áª<’³¾jÆq*S#§EdÇYñºRÃ9¬Õa,ñ|hÛÛ÷¼Ñ¯ÃÿXn«ŒvnÊÛ«bå;Á±éäõ2DôŒNGTå±È&—·ós×IPÑVÓ6©r®{š¼ép^Ã]9Í—ë®ØÌ$m#Ü^£Síìë9‹¬’Õs–¿}¤‚@Ä¢ ¬oæ~§ºT„UÒþÔIu+ ðßBÖ lú±é€/‹ÕÔMñDÈ2Êýµ@ˆC$ÆG“FÿG§2‰Ä®zŸ“n¸èº1Bg=ѧF¿mjç È_7†»XÕ?ªñNÊ´¦Ï kåë³É®§qLa@®†pÕ4ÉÍÆ¿±Ç.)t\?mÎiL0×è­`?Ä‚"zHT½Ìå³g&Ê^_ÝM:ôUÞ‰—ùŸéM¿Þá ³KÀ¾'}~2ÖÖg–°Êyt¾M;m’5'ŽÉ+a+/ÚE{å¥ôºo=ºX¹¼DfTc€^¯4IŒR«Õ–_þ#:¡ˆý ¨¢‹@­×¢¶dÚCãéÐ/×]ì¶Q?Ϊ斺[pÅ~r‚HÌë Ï !šÔ¹ úqhêdÃ#G€B£jP°·I ?KÜJ3\À‘úˆDÕo{g#ìøAÈÉÔÁ 5isßeãtö ÄÅÙz£UŠ+å¬sG¨Db&4)š©@cN쯸´¼¦ªå™×r–a¯\Ô³ëêÝ'^Jõ¶—':#S§*óöl\m7_pÓƒŸøL¤<ÀW<‡,7¨~J‘œ窓ðá£1˜è0ÈaxZ i£¬‡}‡í™}wà*5kžÚ'Øγé˜!ƒ“ñá]uû±íìn Oò[É‹sÊæ‘4YG¿0àgEë›kH˜šNœñÁÙ‰RgÊÛºI}ôTƒ+÷ÚÉ("¹î¡\+Ou{Üí˶žÜÏ÷g ã–[Yü"v¢Z²Ï2ëv›q´©;6v=˜Ÿe}4Di¼GŒ5$Ø+kÝ™  ËС5Y!e$ jIúÎ9¦Xæé0‘‘ãX‰m&„’¥¯—Qñ ’¶1xè}@cDeæAGWm´ §xò\ Ý®ÛO0‰^‚~j0X'ýéÀû.¶ÙÎät‰.‚å¢ Ë!7I£Ç~¿4yo–ÙßIT¯â+µ)«Ú\ˆðÄì@gƒ]:WE_ñM×°Òŧc‹-ì¦f»Õ#&¯õHa7½¡Å¹}ê„%Ëž’F€®ø&2(eñ†ê$Mý9Ì!9‚í(•¬¡•ªœžŽF³ßx|p¯Á.f'!T^Ÿ7Ãþ/M,èa×G«bá°JoH8ÊÄF§ý¤«~=u!ëÒCƒ=²Ê ݪ::]ùà!ô…‹ÆX .;Ó^]kÙlò×òú3‚i¿ã¯yzYj"av¡þ>÷f¾,LÇ£[³—äÊ^ˆÄà<=ïû^Ó„¿‹œ ûìу µ+H…äý‹fv–ºà|¾SRrÌ(>lOõاØr°qQ· T¶Z… ¥ 2ëûwj5=â 0q1ëz{Q!ú^Šˆ£eôh¦•ühØQ3=YÈ›¡ß“Ó/¬–B¸ÐéUÎQ1,B"{Ï)áÖ2hØ®÷°à_;Âz 3 ½T zº^~\þVslúÂã0[béO“nB´kåžl^¢ª»Ë¿yR¯™ÊØY.nœê)ïpØͦOò8‘øÍ—…йwh 2aÈ.MJìcÙâcŒaÏ…R”ñíŸ.2-„—Ðá_Ï,3”„#¡ÖeñðqKLÇÐa¢P>+ä$ ÷‡ ,ªßB¼wNЂ¼p¶³R"¸:¥£‹á¦#,'7Á¦ÁMÁ€Þ%ÔiŠ›Uφ—öÐãF"‡»MæñÙV‰Wo0ãϵv› ÔxÑËÏWèñLæ`-†j¥í[Éa˜]Uë'(D¸P»‡ ›ëÒfK#œ _CÕè/ú:}*’ oÅTûÃáÊ4ëmm•É;ýjYÖP,#GwŸl+Œy[É{^çÈS:u~ê4Ýè½›Ô„<˜¹ Ú~Õ¶Tâ»ûò‡$cuZ±¥;@W¾dá}4g‰+/?fTŽ…Úän¬ê°›ÂtÛ‡ úBí5–õÄÃUÓ…e¡5Ò`×@ „çi¬ÂÃ;,¹6-…¯Sr‹_Vf¸cø6¶EïwúÓW·1¾ÅoÒÏS nŽE1®¬üõ»à“%§öpüÝÈgmºöI¶_C%Ô¦È[‚â(–¹£L©+#ÜÔ‰8•lªÎ€ê­£mĽâ“uÊóãœIk¸g$hó§Yy'òVX¦Þv˜_Êòq¤áÓW~«3 pBïãëJ±¼†Ê&ó?O%_ÜÍ+G3u‡l(FƒJW©(à…™. =ÞiO?¾Mà§Tè"øñªÔÈ‹ÙÏ!Ûðs·ë´ñœd'ñª×j 7ýñÔ܆گ~F©¬U~0™¾æB©úIÞsX`gÌNð<Ïyn…}ëWþ¥í)–ð“jö¯³­ôKšÃaUÝÄç¶/ˆs™&âE(cæÃ:tZB׳pâ™As§ßØÈ„Jí98à9.Údá<6ç7£N¤ ¶PÓb†<5ðVg#ûº¹RÏ‘ëK`ô=cÇ0R&~ÌÒUÁ€I—–W[Ð$ Ÿ2Bª³kk*%±×7-7’ˆÖ€ÆAù‘Ä7˜NüâÂïííÄèS5„ÎÜEvc9¦ßŒ`™ž¬`wáž±ûeqt/§IvjθK7$âø0ú¾=?Xô<3uÓ§_ˆa LΟ½žU#!öñÃYƒø¶¸bÀή:€2Ž¾„-ó²@Ú2ŠEJ~³mF4¯érÆ횟Yˆƒv!¯Ë7­×L¹ÿyÒVvÖí¨`ÏvÉKµû2%-;%Ù[‘¹I'a`sµKù4šzUÕ:<£×Œ=.¼‹fŸX)CÕ¬ÞðCr’&•çñ/; ]xw+¼jÚYS`WSÉN âHø*WiÁð ÿ™¶®­ª$¿ ­£k»-„<Á¿" k›7ò„ÛÚHQ§HX;5:ÃÞ+©jC4Þú g…Zi‘í†b†)RN¯!ñ I–_g<µ5àPpš@û½{G¾1ÀÕÛY¬$ðHèGõ%E¸ìÕMFÐÌa:‹é¡TR ‘ÀåAùÏ<¹MO T÷µÈ9¶Øî?ÒÕX³‹ ÛÑF6Lh2úœ âÓaÌUÍÛ&«ü1ɱ׋…Ë`é]:k) 0)TÃm›Õl!? b³R@¶ËéµâóÝËÖ–[F ߪŽD‚ Š.I²öLOÑ¡eÞÄÞx¢/hŒÛÃ+‡OÛf0<€Ï׋°CÒNYøU¼(c½ì»Á–ëDáÿÙ<–|»—T†ÓbÝ­\IÝ…Ï>Ô¼Ðå(vdº?ê^3{VGæ$$ñ ·NkXŸ Ž€¤|·s ˆB¨¤ª¬ü¦²„íd^óV¤^¯{`ëMÂY\ÎæűæÕÑpäó44EAáýËúvUm]_ï9í,$"Ë4ßù™mÑI`é-²»K­Ð(›$C·xòýøÕ ²=Æ‚CrÂUÉÁwM>LTÌ© ôF7¤âñÊä˜; 'ƒzÆÎ0‡Þ5³°2ø19GÆRÅ—U°ë¦W쇱öžˆÁQñkPöOk¸¦ hAoÆÌ œ"G¼~={@Šÿ¢Æèžzvtñä”ÏïFžך纪'QÒ½4ŽáŽULõ'j!,j9]±žš³rÿà¯;L8v8‡;z+lÓ5Öµ'ßV&UàøŽ-*§rš~òäÏ€^,!ZZ{B:Y9glphwkÅ/ýH.coc¡´PÄQ+Ö¥ÙQ`ᣰo4ÍaíCÈÑ«ï+¿€dãÚìÈf ô¾ž™vcLNó}d¶KR<ÏWB—¼oå`RŃ¡œ¬ÇòJk&–òN7}Sùáqð•…ù³@œYñn™¡n -¶Ú(­Œ<%â8±PV†Üiñ,¹ÉÀ…FfPHÏáéåuè¥ftàÞ½¯Ÿ ÅáŒl»’ záÉMuÁ´+êpÿ¬»r*É(`Õá|Hô©pða93_?ûŽãd*m’&ÛÊN¥EÓ&IEL¸;ìJ=á½ùzÛ‹R?½só ²…W_EBše&žžzêLǵV+ƒêâ”±L¥]G¨X4*5£Ì ñåEÙ,R¥…yúg1îÂOX+dÁ*ëúÎDË|¬\°A.°‡¯"LfÐ:P`$Li-Dk8µ˜€[Ò–ŸK{– qZÒêLq›ŽåËênîýƒÄûfÛ¸B„‰œ)ïüÐE` @x‹qô‡9ºHöÕâu™W²žv‡„4¨–W¢u1Njuë×°á•rÇ}JüS±°Z+´;Ô“mÉ—¶WÙ¾”'—´©¶ÆïîÜÂZÓln“¾Á»%3¿ì§d†;ëFƒ3Âkáz0 ólŠ¯Å~;«›0žàöÌ/lr+çÝ9;ÑS»lJà U„£ÇÖz÷$ÃáFMñ¯:»,±­nsª†èß©Ù¢Xvî?Î/:›inÄ;ñ`ÅSµuƒÙÑÆ&ê³Â/¥¶û[0p ç/Q/äW÷q0ëìQ9P†ÜXG·@ãU<|AŸ«)æoÂ5î±} âù|]:Ì×âH–‡ æc]ÍÓ‚~æöÄìÑz‚avêAð€ç(–W2yt½PíÞ¾Eô“‰4žÑÀ=Ægx·µtèÔÃ`‡?T UíÅ›BŽÝøw‚êèËà¦Vz´A0ñäÆiªRB«„HðTÓ¯7Å{ ê\Õ0d~fA餞ÈïaÒn‚$–z.Õ— ê¹Û×ìÄDt¼ðÕT¤ ‹¥Ðö- ‹’=å܉5}™†ÁFѯ7Ä„ºî†˜ïÙ%â§÷ÞõÉõí?¹‚µ/zÒò˜¢gF€Ž#²q’)Ïe…†ZTBÛ?T9ïÚ»¹j;§õ‚»{ÔÉ-é;îÚ¦»’µ×88Ì ñÖº£uåbøzHÞ>Þ(H„å]å~ &™_,O¸r_Óu¤R–ÊÁÛ!tó°ÒÏ+efs|%Éî¡äo;÷)ø>wÛ@éÕu‡stH†+Û@<¯T#U¢Ó¯ýâHY ª/ÈÕFþ‹rò«–IC#“<˜ Ht˜9NH¤§åº©Š6’Â8ŽÍ•PƲA˜É F ®â•ëøDñ >dQ´ŠZê'FˆŸN<$ñh‘­É´·ÞNö™Œ—‰v¡4ÀLJŠ¢3S²#ŸwK\cüÃ@ð–׺Ïîå!‚Áô“ÿùY¢òl|V{â½=œµ99 ]DÏècÕÁ½PD––õ2 U‚RÛVdT¬³ dR^_•Ë¼#¯–{uØ÷>*Ö$e4=<~Ï(WŽ Ó¢ku?w¯Ç§’‰$ZÏð´öÜk4ГsWD»t¾yA :ܦ‹3·‰Û*.$݃ÂÓúbòó‚ÞâÞ0;Ù˜ËÐÞ({%2•w v„ñ÷Uèžš×à¢:—Mè~'ΙDúå¨ò;P×\]'8ç4^[PÕÏÏË-JP‡Í»±Mdت¤÷ÇhV«¿‘‹cÁ³ðé %M7R¸Ð¯˜¾O´Õ]°¥ß¨ *Ž zäËt&ÐÇ—3¿ß]ï®dîŽiØ#|£²Šf€`+=/ì­˜`î‹ÚûMÑiýõ¨ûüòìPòý¨î÷FŽ’Kç:m".^©ÿŠ×8¾àänã™eõ™ÉÁK§Á—U_sægÂ;'0)Bã¥9¾a3ÑJvPkΞ“¦â¥ybúðËwÿ”nûô)‡CσRtú *sDZZÚã"hT  —Ê#s’c+VülÜ9aPµX•ØgËÝ8|æûQ./Õd:½³”Rý3kWë!;83Ûn©Çþ½A._›ÒƒÐéOÿù3\†ïÐ1*ÿ«õ,õºèÇ ò’{Uß$:» , oè,e§Ð0‹!‡w¯ (V&Ã*¨Á|¶F—ýÂ(Ìò& !÷„“ ­q)wƈµŒ©¦mùiÖaºpø„ËÒ?0b¨äEiDý…ˆË„o^ÈqXk)M~PÝÁettáÐ_l<ÆBÄGžã=c Sí˜DÐ^`¼†-]üXÛ…è±L.ÉÍ~µ¡!ð~„¡Ž­çð*× °úàÛzú<ß¼AÞ¤!gÞÊàDŸµ (϶AT÷köà ¾õÃâ.ïøe¬ɧsMŠ; »MÎ/ßý: ŒÝ¢<ÓK% öAŠ‡Ô6UœˆE?nøe©üÙ3&Ü<âIþ(è5dZ_™J~q§AìË¡zзѓª‰ðm|;’*CjÆ&BàÚ;é¹H8;DK>·zÅ55‡ÄËØëÞȯèR ÛeΡ '‰}~z¹o”1bô%kt²OÌ’¨qMœ6éàØ|²¬±ÈïbÚm/úÅ#"?ëË°\U#”eI‚„Ñ–(‰-õö6êul/†Éñwü‰­½½j©Š öG±™‹w7·úÞŽ¬¢ä|eETf1õ°ëÄ/XA¡J¡l‹Ð–¶îÜ¥õ²#¦˜g#ZH¾«lJ2ómgñL¸+9\Eµâí©$éÍjÔX³'4DM$–1"À>¼s°_D|ÅÏpV“JÃŒƒ­Çèqƒ9Æú÷bL”é_9ØœÅÏÈš®o 3_4: ¯• ¤ùS("¦ÏôWL8žv}q­@µ›u_½ê)hÌ©Têt RÇ7ùªÓZÏ0¯ì‡xõò­eÉÖÍ胗sÇÏæ)?{ˆi2Ó?æÿ¹Ðî-ÏÿÊÊ‘f Wßzio¼ÿn/ó¸D9”øgÙ'!$[õf$ܼ2†Y¤OÒåÔGT héZ0W×ÐÆ7E”7ö¾åpú„ˆìèÀf¼€¡×u²vô( õhr­Æ5  R䨦=sìYç.=ä[ƒbíuÇ WCiAVs”] ›ª4æ–m¢„…SÙ Ñ™†ˆ¥¼P™ƒ£Ê'„Rá´RÞD—ª"‚½õ=ψemGüŽµU)ȳ_‡­ûDù7ÓKGE]Ö笢®êì¬`‰X’¤Ç·u,’n=¤–Œ¶Ëv¥XíñËÙo¿ÚÜæý_î œêæ›i­Vß(Š 3I=æ}3Ü^Ê,3‚Åjg^Ý‚¸G¬É^àaw>1À\D¥„¸ Ãyª²c×øÒvÝFæ#:PùTÞ4å;äœAáû·=qJNô鋦=]Ê1·üÙ¿ÿ&C¹ìu­ñ…‚=âkÕQæu'8ÒèÕ5Ù…»*DJ¤Õ©­È±òÆ-žP3)éVëD”›¤·’È#î‘ÃÜoЬîäÎÈf7Ó<ìuèÌÞ)9Tø ¯½°ˆ™ñÍ (òÁª¦àÞU¬Ò…Ç?tBŠ»ïü½^Ë\”o×KBŸ`ñ#…æk‹ë*>ɸ¤Ô ƒaà[¿S‹‡Á!@rŠüåÖΧÞcåáçض™u=Íy± ªêÔ«)»öÝ̧™ã¡Ha+Ý-HO˜\÷KªƒÅÍ+3/á¹7¢Óp<Ϻv/ô[ºÎþ'–›w}©2ZâW16$yr¦¡Üçn•ÒØÄúŠ;3R1OßNiîȃè{ ûÅ5K[½yõGRZavP®Š­ÁŽ¶7kR¨em öî#QK¢^7À‹‚)GRZ^Éí­êË–³ ”¾ü´Švd|½í¤e ªÊº´€¿²›[‚Ó¬ÓOŽx³ŸÉèZCá\Þø7NùfUüK%$Í€½¸½àApòó:*†ugot„ z+¨d U­ÌêDx«èº^?<Ñ[ÓÜÈՌ橚“Òg¢Û~Ì(þŸ¸®ª^T‰ãn­¾Á \÷ùt¹Tn»™» ×’ÆjP›ÑqQAÓYu+”.Ñ+X!|½Æ¤i¿Ò¤Ø¿ €ö?¬{âlåŠXŠ¯‰&B ÉpâqWø;/NÚBèNX~÷»·IYì¹F;ÎçUQŠñ,è"ƒ3†Ajé ¯ŒW®Í¹¤ÏJZó› ±~4ïyƒ„î–4{©R‰v¡OpFNy.,ô8©ömÖï«*9˜Ç%P<‡ZâG.æ´åOÜ»I¬V¨ÕÁöÑ)gvä:ñ¦ç*¸¤:$àO÷8Ãhñ@ó½ ;,ær”bÎmnõKíðƒº»;ùmÍ«±±Ãih:2‚¡"æ¡pk©ŠÜ)°UîûMÆÔ1 ÆhºwDžžKVpÈZGð²П¿'Pž÷9±•qÍ@=¿ÝŽ–gg˜Ãë ^!]˜nùñÅë ½è:us–B”îgÊrV¿Ÿ°­$Ò1å½6³;è礟vB•,ÏtÏ¢ £ŽuVb0(ÂxÙ OÚHõRμüL¿McB“¨G£üΦ Ùy¥kdNVÖØ:%s»G©î浚ç/WÒ8<$u•”<Õ+ Ûnøú•s…H)d6¢r+›|ÆÁ)Rsæ´?ûÅÚ¨Í3‡e#°$›ït}P§‘ƒ”™¹ØÒëK #‡5Üâ£Gдp1Ôš£ü ø þ ÃØÃMøÅ "†“ÒË@ž÷´äåWŸ¨™¢]8G§Ö…©NÑ(ɇ‹Ÿèº[æí‡j!­ÆƒÛJR2†û·žtÙqÌÒl/¸Ì‡Á Ê-ó*¼5IÃ`Ät©VÚî­k–B»¦ºi#ÈtlxhEº’kA´âF.]•—*Óý»íÅë½^ SyÅßWâü‚:L…ØnqFkÆ‚5gU%èõ·‹½Q_ªÂ™ä:µ1“«PÃÙ EF‹ƒ Éc÷­»²…“Ÿ†8<×J´Aa %D¡yît„34î6H1’¨@ (öðpx9.¸¯K,×Û}T°›ÁHüblrqì5ºBÈ3T½“àÑØ—ÛM%¯¦’:µÃƒ¾siU‡q;û r†Ð®•g/ýÿ•ò kóíŒz4.`8Ê#æ®)ª*–3ÇØž²Ý^¨“ÒÄôjnŽ<³ÜpôkµF üW òhL"‰o%§ýÂïhÐñ£O» ÇÜ¿­wü£\ß7:ðξn¡7¥ Äôq!*„xR˜!û…‘§7 ¬&ûHtÕ`¡IíÃÕtì~ÓnæW“Þ…ÝöÞÝñKõVB—GüÖI¸{K&\ç|p’©…ŽäóyÐ…ÄM¶Ó$âwšöÊÀSen8°þ'Óêå·N>eÝ2ª]<Æ)´ì[ÉSRÐfŸ Šá÷çw¡ïÏN_RBð.XÔ¦¥I©?óH7Š:õÒôn“tFÆà$ rOW—õ–ÁLAÆð·ïhF°ˆw³esç£Hsk rAœ± ¿…*> stream xÚwTÓ}Û?RÂPI‘f*pÝÝ)’c ±m#é’îTR¥DBR@¥ABBEéx‡z?Ïs?ÿÿ9ï{vÎö»úú|¯Ïõ=¿qÞ¼kįh´ƒ©!X~°H ¨¬«« A aHÀÉi ǺÂþÖ8Mah ‰úe4 ‚ÅëT X¼£.Ôzà  ÁbR`q)(IþíˆDKU p{ ®P ‰€aœÊH”7îè„Å×ùûÈ å‚%%Åïü *ºÁÐp(Ô…``nøŠPˆ+Ð …ðÞÿHÁ-ã„Å¢¤=== n$ÚQŽçÐŽuÂ00´Ìx¨qƒý&à;Á1¿ FH¬' â®p( Á‡<@ØÃÐ@|u ‘¦PCüvÖùípøçp€`ð¿Òý‰¾HGü †@¡H7á G8à®0 ¾šŽÖ {AØ_8B\1H|<Äw…Øá~µª)!x„ða h8 ‹ÀÀ]/0 ^¤Á³*Â^éæC`1€‹þTàhîÞ‚†ë‚@z"|þ–à{‡ öP‚&¸û˜¦Ê¼ ðo# Iˆ Kˆaî@˜ÔI𢀱7 ö˾Pã1øù ( ÌîÃÿ|0‹~óóùOÃ?% ´‡C±@;˜#øwv¼æð[ÆÏ ÷Z€ðôAŸ=YáfD¸zÿÛý׈î©ÝU2åûù_F%%¤Ї_XÈ/$ ‚A"@qüƒß?óüëþFÿK{ÿÓÝdÔD8 %.Pàïo$¨Áýgox€ÿ,¡‡Ääþ7ÿ-A¢ (þ üÞ‚_!ÿ?ò_dù_ùÿß©=puýeçþíðÿØ!npWï?xB?Àâ—C‰_Ä»šÁ~o´.ÌþÀí¿­šX~IŽx¢óƒE@"¿õpŒÜ fŽ…:ý&ÓßÓÀ×p…#`w‘øÅŃþˆß=¨ þrÁàgöÛÁàûk¼2 ¿jÿìCEÚ_줨‚FC¼xJà%Q ¿¼ö0¯_œ X|Ùè€D.-&t¼¸áðÇ€7üÖ€‚®M\(þQ úÆ·ó‹&øVþ–]0˜ ˜œ@B¥ƒ«ƒ[+™=ùW†dH¶ÒÍ…ø‡ ¬É°Ýª£6‹ FÙYSÚÏÕ&»ÀjÖÎmzJî‡9sv|–kØk½EöùÙÕÖÙíâ&Î÷/'ú°Üš l$xb–¢Ä&UŒî&¸ËEÕN.oïØmÄIéûWuçÇDO.º5q­½ÖöÊ’,zIÓ/Ÿ ±Mv}Æ+¢» å~r‹ ZŠ¶ŒHÕ˸¥-ÓzHð¬ Zèíîbíˆ Ôòx´ò#K­*ÝÇ¢"r¹Âtæ鵟¹Å›4>vê´ ›öÝ/æyR«õ¶–·7­nr'µ‹;Ù&9Dƒ¿àŽX©Q3tJiè¼üÕHûéœ0v¢†^¹ÄŒig:\ãõ\Ù'V­°mï©ñΑ…Ÿ´S5-†{‚¹ïè&Èž•.ñ«ã|ãáJØüWe õ²*}φŸCÐÓ×ì™}îq3! ‰4§c¹¢Éàæsjaá«ð´r“k‚uŸ{/ÞÛ÷Á‰œ=ÝimUâšr¯ˆBÄÐDãjf|3 žoßÔBÓ«¢•qžn‹û¾^‹V:½nÈB¿2\‹›è×…Ô£‘R@öœgm‘Á1 ͷʦ—ºÂ÷ØJ ãì Jôò^ïÒ¿íA¶Ù .Ð 9Èó¸7=S)Ôèñ“€ªÞÍÍÌÖ¸iz0h_³>@Ú^äi¾q!夨ԥcºÛPíXÞ™ i>ÜðõËæÑ4¸«.ÀcóžÝr÷;±pŒæqÓ6Wˆ<ìÝûƒxÙ𠇦z™ïÎÚ?q¸4ºîÏqÚìºqXQ¥K.ñwå­Üpè GmÊÇÎøÕ`‹i觯ye>:£›\áíí€~ólÉ¥þ¢…ãƒouórò´S˵Æyûß =3Æ¥al™°¦-€à6yDó+K½÷É×Æk~ÁyaØÕ)ó§AͷĶݱÁ Ç~í4«#I<•¡ÄF†cæÉÞ7hd²0µBÎÉúÖ-‹AÍTœíWbM²›C|äÆcóJ+ž)»!çW@Cœ¥~OPÓ7ì?û8Ñ‹ÈEÒD^¶öT)ú®3ص¿ÖE´Ûß±^Ph«“'C] K³T*u7)²ÂNNØzw÷®Ü*Ó†®¯Ú»r?ßü4FŽÈð²Ð6¾8ö.˜¼¢%åH7bTd‹Ý–bÈn`§>â><‡šj2V‰qÛ uoF`Cì‚fŸëm† YAáÅ}‘sÙ-Ö·èô—ÞÓNÖ¼Ú“U¾–»ïExÒÖ1énæ ßá­ëŠôõx^(Yt£2÷–¤¥–úìÞz†_‘Ø3!?í Ð7ÓJú¡—Ñ—§‹ÅÚý"@Û.J á=g®ßä<æÌ7d>iÜ‹©ì!öò yEë°¬ÆÏ‘y+ÓŽî&wÎEÅÀÐ+]Ó{mݹ ±+Û…bYq_¤lŒTä(}w¾fæÜY‘7ÓÖq4ÌàyU59wÑgéÀJƒ«&ìÁÊ(»µ· ҇ʒ°u.5 î(ÀÓŸ!GqGEòC 1h‚ȯi-Í6»å!—©GôÉÌæÞ.•ä–<8ÍÄǸ&”sUˆî]y3ZrT÷þ#y`ÿ¼Î=ÓûÏí¾ˆ˜çX ‚ :ÓË©Ž»TTß4ïn׉k­?|Òo’Z¹Ÿ¹Ô s=6Ö`éCŒžygvÁLzzÎbB‰g²"‘!ÂìC¾VìÀ «ôåUf\Sà¬^9W2S’ú{°B]¨€ $¡tïˆæ¥a5\GQk€ÉGAmB"×b^î y¬äÞ€jO¿ªG‚5¼œÇÓvÉ.‰?ïUy#½ÞÕ;—Kõʯ6z•Fdé]ǃ¸!ßœcºöH«ž‘툔½Ù’gA›tH«  Iýà É;káÀ(K¨KC/<ÆÃÙòãY9U¢ûóòz}n’6Kþû7£Ùr6µ:<,hƒý¸:VÑýü‡Æ v:~‚rC¢.4_d <ŸêŸ‰Ó‹þ ¿Í,•üáÎSz»òñu½ý7ô”ËWt÷ß÷Þ_’K¾FÝ3|¾reå‡0ïçÛfÙ*kQÛc¾Û97Ô"çû#Ϙ֧t¥mì R´49ê›S:ïõqd w3t_£=Èײ`Hðw˜ "’¼“òB¬æÓ ðqþ˜¿'âåæ3£;$òàXù 2Š ÅñîyoWîGK:—š†±/ó؉¶Lâh¾}Y#og|á¦0ÊKgL'7­ÚDXh¦ïÈ?•2ÑMY©±ŽZe¸Ñ e»Ef‰+8}M%8:ƬêlJâ“ ŽØW%›êœŽŠz›iûâFw–R¿ûNÕc/8+Ù¯‡˜Ê–ã&…§Ú'´ü[V-ª[ëÎÞ Ûžzä¡è “+º¦fÏ3÷>ÓÞãÇ®¥§­W–U á²ßÿˆ.$ȉaÁu®]³¶/í2V# r› 47éGXmx²ï§ïŒÛÀ¨T¯a¯š@E¿¼U^Tˆz„ì¥êõÒQyÛ¦˜Yÿð´[¯ˆõ!P'êk–Cת wÊ£AD^õÔDÖ4|&æùðȳhÌÕÎÉ–˜ OÇè9²J"¶U‹güD¥§ _ö®­•â^¥¬Ä¢ËI(7F9 •žSè FÆ}–jT¢ßNÌ}à PgÎ?Yal »É¾͉ÜUô"¹óÅÜëß•ªOù©]Z^6åô¤¸.îž¼Ôf+w‹šU˜³)PükõCûýæ±v²;†0r·q ¢²˜ö”ÿÀ÷òï¤æ3‰Š§nŠ¸É½ÏYÄö­zÒ·–ÓýHGJZQó-û©×•Õ‹®$ê½Ë­|Ü5ï+ Ô¾üMŒª]qþ`¼×Öv¹ÕYJ‚ðÁýšØ€ó3“"NÞc1fË;õJ«‹‰Sñ2ý+w£9PDÎeí=ëžØ>xɼ¼@ëùxNÃÏqà+“Âî{ÍÙÎ!~O–¯±Ê—·úØÒ*‹+À—ýä>pX×Ò•t¢R™'Ì­羯|R¡•a®‡ ÇùáÜÅôS•ÉÒø¾½eid™¼ßx†ârý ‚SÖr¨>OPÓˆq#à™¿1W LRŠ7\gºr€8½\nž*§KH®¶âéçâ¯3¢ðùkéë«ê²]Ö/œ>nð¸Td6ÁÉ%ìÆâ0Ö7½ÔÏâCÉ(7ôB3îG}s®XR£3žiywõd+ˆÉpºòãT›_ðÑÒ-êFVñ­>$ \'èPݳۊº£\î¾ÓÉzjN»©™ŸÙ3žFŒ~e9]ÿúÑ›óO'†0¤­GÂb3ÚþJþËðxyE–Ã{å¡ë¤UÏ&šÌHöQ¡ã;.¤Oƒ†úóØ©¸'­t—?PS’SÑíÏÄY–¼×O®r~ç-˲[bUdÄqœ=€~ ¸E¢b_)~'t*Fc(B^…Û’h½Mp†ƒòeWUã*š“¶„¬Ð5…R¹Ü¬r¥°µ©»ƒ³5ãÒ{?< ös3ËZçÿQ§»¨8„ÃØbìüâr¢'O;1 t6‰˜AÂÔœ%µð¶`JýÕ×/R]¿EÍ9YªÛÚ]Ú‡°Id4ppÏm÷Y›ÓV¸gÔŽïm-í(“ÜzqîÑÕ¸ç|FM#Ÿ–{<3 È:Ö°**P‚‘jµêe–Ö*yU-ïÚV[ ¥£Y>#¸[x°{F–?½Á?þ(È$Øo'šœ8sêr"¸â3Oº>’„ÌÊ£ Ž}ÛC´ô¥PB“:5Ôòf³§A÷‡ÔXò1âô5Ô(`“Yôæó„œfPrä§)…›)õþË*äc·%¤¯<|²]{¾ƒ!f͵ި”uTþþ4¾6pVþhmóî²tŒUb ÚÿP#±"Bû“¢sgMLù™¸ºã㦴£7ÌR”GJ²’{—ôn2pdò6ˆÅï÷9¡)÷n‘³ÃJ¥×®Œšu ”Øû¨ŸTÓ‡È æÀËõ…1^ðÊHÓçîWâ+^$•QM >;è]òô¶šŸ°ÌšÁ¹»};“ÏøX¨]¼/í³·gÜ$òˆ*´=÷ul±ÞÓ­qªÒV—Í….û¯M'UÙÞ âðB«+4Ð8¡Ýïjó7ÍG'_3…fËo_- #N?Ûè¶ ¯L¼O€>8õn21 tY ŠÃ¿‘ÔõG0¿xØìÛb~w<ÏôU7÷:nndÃÍÇãÕãN=,oîà (JzÕ S…4Öe|Ž?3{C„•³¸¸žD­äh+ñÊáì×j¦KDŠú¹Ü塘7UœÜ3'¨!•i[B\$iü¨H í-ÿÊ»¥]ᛲTw Ö“Rɸ7Ud¤kœ+»úŽç'5WŽ„0t¬OëçOkCÕßêõFB{„Æ6@Ó„Î.‰¿W~l­¬”·µVI';‹Ž±MÙ¦Ëru/㲚mK׃1gk¯%jX¿È¢À)?(¬cÒ¶¯Ñ]§¶½ëotÎ.«={.¯z´ªÍœ™ÉU÷‘¶ä"ç°ø-è5n%ØütÏäI©{I/¡møì@‘¢,ÑD¢§·Ç‹Â\a9ºªZ¸ïêRl§€0àÛ”6ŒFä$Dy‡VÐOÖû±½\Ó^ÿ¨mjtû…ÓbtN2JUªÕ³?;g„^JC‘˜ÛYÚ)«¹·Q¬ÕkûýM’9¡×Ö\ÂzQ—¹èˆÀ”SÉm²f ÆÜIP!´Î¿£‰^«ðÊRhãV`¡”;1}OŸ“·öl홚´Ì½óÜw!?ý;}·_4Ì“SÓî ¢ÛN‹Ø+¶»ì6ZzókO–]K9]q»  ˆ?æs¢Ê]e=mËúÙíUyÕÛ? £É·6]nÏæî&(åûjQðœïjX3“ÒùÝIõ0‘W‘á HÙ²*È<-ø–üò{B駹uõw½Ô‰$ Ækšºû‹ÞQô"‚º¬¾• m·semŘzHIâ±Wi‡$\úÙàO×He쎒³r›.–rÂùؤe¯f«O?|ˆ“ 7B£¸B«9"\ö–ß*,‘Õ¥EAtÂ_§Ü »Ý_ ó=IÛµ«øÄ–Nq«&1RJí÷ÛhÕgã™w·B¥–Œ%OÑÏ%Ì—õª.lî&‰šºú±Èfµ[ö<‘ê”/µbT_r%TÑoá‰%Å¢·5åY/›èŽ&$/cÛ矈铅9+M-IȇÈ^Q!yCÏbñx×[%i²í²›Y‘Íí»(ÈyŠ¯'µ¦íeY'ñ…ô`^ñ he£n ÷)*p­z+¼úJÿiì‘ )ia{ Rp?;ÂDáE‘¼³Ç7HÏ+^¿¥1lsh ³ËöÀè4_ª™vy/šjoŽ9NÑx\dïb†_q÷6•ée[ô¢ÝåÏò'þ©>LçWy¯éš>¾[1ÌÏ'üáf:1Ï]ª“‘²dæõìÒzHV°Š² ¬fì§jõ£EøÉ|±' —n£wLþ=å‚$r»£¥Æ¢>rEÏëÚù€ƒW@–²ø,ò|U±eVW3t˜ ©ÈÙ¡n¿ “•qxºÿ_i¬'òÞç…w9‹I;(Ò|ù+¡:TÄÁ»µÆÄÔ¹ßpþ}ÔÔ„YçÌ:ÇL¡âã…eê|÷Ûr•¢«æ#Û6dÉx¹Å_Hø? ‹»6ºÐÓæšüZ‚ýz={u÷«F'­“†¢Ž<–§ÜÎ1çv+¼ô²¾Øhæ;ÐÑDM7ȵa«²ö-FÆ´Ù“ ´<štð„—=V1h;•¿¤sºæˆú!)ÔW8ó¢Æ¾”ˆJõaâI?W'Ý£¤=ŇušäAµ³üï—¦Œl•¯<w‡gÐËØR PØꆹÑJ¬±™¾m(Ëèw}/¯¯ÏÔ?š72æ•8Jh«ÓÙ|ÕÜ œ@îâŠÌ‚¾À¥zIÍZø¶‰SµkZÚ~N{~~†q3.muz$†žÚØÖIä’2»ÙÕ’\r|^P§c/F¨}9óªÂ‰ð{ËoFzROòéÿr$^/š'3‘ŸãY7´ã9™BF7¤­ÉEŠ]]êêõçI#×O¼xÖkî)úVðÖÀ¢¯Kz 7Œ‘CaNëE«:EãB"[ï^G HwyÛ 5b¼ÎÙµ½r‰ß0[®wè˜|´äKŸh¸SËÚV³¯¦€èƒ[ƒ»ùxl> stream xÚŒöT” Û “J—tHKwww·ôÐ ÝÒ)]‚tw ÒJ‡t#ÝÝyƽ÷»uÿ¿Ö9‹µ†¹î¸î~ž¡ UR¥6µ3J؜陘x¢ò*ÌL&&V&& 5Kgà?b  £“¥ˆçQG ‘3X&fä ¶“·d\l̬ffN&& ÷ÿ íybF®–¦y€Œè„@!jgïáhiná ó¿¯j377'Ý_îa[ £¥‰ oäl´G41²¨Ú™X=þCAÍgáìlÏÃÈèææÆ`dëÄ`çh.@Cp³t¶¨€Ž®@SÀ¯‚ F¶À¿+c@ ¨YX:ý-Wµ3sv3rÀK È ìá2:ÀÁªÒrE{ èoc¹¿ èÿôÀÌÀü/Ý?Þ¿ˆ,A9™˜ØÙÚ<,Aæ3K @QBŽÁÙÝ™`2ýehdãdö7r5²´12ü•¹@BX`.ðŸòœL-íœ,m~•Èø‹Üeq©¨­-äì„ð+?1KG  ¸íŒOÖdçòú˜Y‚LÍ~aêbϨ²tpJ‹ýc!ü–™ìLLLœÜ¬ ènbÁø‹^ÍÃø—’ù—\·—½=À \ÐÛÒ þ‡àådä 8;º½½þTü!03L-MœÆ@sKÂov°hö7ßÑÒ ËÞ=fÓ¯¿¿½¯—©ÈÆã·ù_óe”V•Ó”•{÷wÅÿêDDìÜ^ôlLzv&ó¯%ãñþ/Í¿ ø_ñI•Œ,ÿIîFi™€ûïÀÍû_®ÿ¬õ?'Cøo;ð.Ô¿W_‰ÉüÁüÿùþrùÿ·÷¿XþßVÿÿ&$ábcó—šú/ýÿÚÈÖÒÆãð*»8ƒÏBÞ| ÿkª üû”妖.¶ÿW+íl>a¹Í¿m´t’°tš*Y:›Xü½Cÿ›˜ÞÆT²s²üõ°Ѓötàƒ3±?PœÀ³úKßÓCŠƒLìL ;ÀÈÑÑȸL«? xlÖ@pÿ, ÜcÛ?J÷ï73;ؾÜ?ôàÚí~'v¶û\Œýo5˜ÌüšýgÜlÌÿHÿ;l6pÖöàm²û=>6p#ìm\œþàK~Oêr:ýõÀùŸ•í—ÐÎhjlóÖ‰ãÍÒaåþGú_cæ_cýc(ÌàÿN„ìä´µüï>²ÿ²ºþ1v0‰ø…øoEà†:Ùü¹mÌÌà¬~‡¿S-ô”å—¥é{ ›Ý`Z—? xÄ®@p²nð½Ýÿ€àˆ@ð=ç fò:þê?jGðÿz™‚èø¯L@ ;Ða~Æ΄7Ȫ&¨õö‹0ýÖ(ÿ$Å–ægz¯yÇ6—{”ןhªÒV¯…? t£-mˆS_ -–þ RÔó/š¢È1ΘÆ%{åLOG‹qêŽ:uu=‰‘5öB"÷Áû0ŠµÀKg%únÚs¹\Å©O—ú cx‚ÒKd7IgÖ«¸`éÛœ{_I2]ò=Ã.KZ•¥J¨¡§Úux¾y3û ˆŠàۛ̈́ê’LG2E¬ªƒˆ7ÎÕ¬Ö@¢Ýv3‘åÖk.3«dÂî__SÈÚ~]^µËƒßèoB’›o7º¼5‹û ÍݘiÅ-t×yÒˆ’aKG :5Ò˜ht ®Ÿ¸a‚ù¼ÎDîñ™×ó™˜t¸`{ ‡ Ù³?œE{WÔ*´¯M¡ÏÚ¸a¼| äPx1îH>=Ídz`7L¡ÎIïú˜³C¥Ì[¬› ,e<]«Àf+ñ ‘‹_gŸ;ûN^À&-Ù³5[9®àauÇÇp¬Q¡ÞËž§LºyA?²[çß/ÜË}mº»~]V&¢µg§qwZá&2ýS3(çc»Š_V§“bŠ¤pTáÍÆt¼ñÛ#5WRÛ†TM5þû‘ÎÂG7ºRi1 ª‚yù>Ù=¾ÐóïçÄ zð¾ø a¼jðc©iS¼¥†@JG[Ž¦Hß^„~kÐ6РqöŒ/B ªv›ûÖs ¢göÇÈéÐĹ—M…^[o#€—=2Ú&Ž’tvÃ/õb•Ÿ:2üÙ,¼qEÝM¸v°:mêpõ°Fäíë6V&LÑC)@~ UúŠ\Á;Ì—™„L«uÏ ¡{’˜FþJ'½šÌ+¾à2~½NmHòU1Á0õ}øñíGŽOY?Ü%s”AßËRÃñ6-«(f3Ig'äX pªu3SÑ/7 |iH#Í‚µàLvÑ#à 6ø¦©0ûkb’ÎTÞ(±ŠçÑóT£S¡¯= £È V1ÀÎ÷ֈʌBÈ8—BPöxq¾Šå¨Fxë¯1Þ3Þy0=#5MpÁX2ˆ"1kîF&Ážãv¦Fþ¡êÅßN™otg4qÂЧž/ƒ˜™©ä\Ê _ËžíImÃÝ\úÊ€ÅéJvÐjÅž\]Ý—/i‚x†‚œI؈ÃÙ°ºŸÚ/¸Ü•øؘ§‰.øÇn¥ P‘y9Rš½e]˜÷XRÕE!`-S±k¥œ+j&&½¯=p‰gž}Lˆ)ôVNüôš›·ÙÙ\IuÓ n¤›s¿œ|­zÄú¶mÏ´JTv./s'Ÿ¥ÍT>ãêűŠ›8£wÛ€rÌrH%cÅã¿NÌPû¡-Ë°$‹»?@ÓE‡#9(ëe&ª#"™Ù†@Lä±H.KÒâÈ4©‘\É!­DNnó°w_ÞHŸ€³¦Û‰{0ˆ¸ýŽ‡';fS*š)œ·z“aÃ[é5Ô‰Hý¶yN $ñ*ž .â3D——Êœ]ݱ)3ã|ö”q¯;h4 âô­rL£Ó@(žq]p¯+òvòyfå2=ñÞG£Ÿ–:"†ä–º*ˆµGÈKrr“KËY>S&Ï™üÙpx@†ÊÀÇH(ÖóÉÂo(ä+F 㺆$ø®ü°É¥Ü©»ÕÞš­¥š…Ð\ß ¤ìÌeò—<ãa¥2ZÂ[Îÿp7ÎÄïEàúÞë),U0Å ‰àÁp®›íÞ´¾ìÌ,ìRQšd/<Æ Ë–§:Çbì–øÎà\’¬Äǵ ®YFì#K!%öÙ,ã}Çi¯—ï掇¡½.‰ ¿Ì.^9²´›€…A˜e°Ô”$YwóótÏšXɦáÍÄ1³á— Ã…Ë»ãy²û ÞS:_ÏÚ »–ªÕlwè~¦ÏNè3ýxšÌîcÇS»É«ógÛ¸¨:w «ºô‰ ²÷o=}p“‹ì]Ï»3ˆBâR®çúŠE¸?’cµE+D™ï{KM…ÞÞsAŒ[+„NEÈ~ÌžäÍëÜŸJ°ñ—¸§~…8©p^É»ö³Àô¹¼ûá2¾íq•¶5œï[aΧ¾7AoJ¡: ¹ùê$cEÅ ƒ5ör-ÖÚz)°”F% ì”Úz×'Ð}ÉKcÛÈ&XY[o”¸g¹u¢œ¸C!© 7*ˆ‘4ïx û&¯¾'6½2 DJ×'Ò\¦dasÃ(±ñDÜ&ŸbѯÇ0 ×õ¹Õ¥æí\¶„KæÏä¾om…_Ž>av»8é¬BÓ¦´ð—Ü :]Ú¥a yÅyÌ Â‘ŠŠ’Dxá˜À1húêÔžo3á€׌íƒÍ”>›’ÓOè]WN¥QÊñÙwÀ`4¢Ú¼AúÐä“V˵{Ï0ЛTÿÎlô»§G±k ÉOƒÏÊÁЬKAשV¸WPû­W³¡=ZFy¤\xÓù¶I‹¡¸ænó¤¯àn9·$൅£Ô$ôë/ÝœQÖj"%µZ´ƒ:ì,_Ñ ïÛ?Í0¯Mx&4Â*sLB3¸<-ùwÃ!·+>n8 +ÀÒË!ƒ’"’a V°õ ‚Í1ãë|2±¿ÅðF?*– ]9åöÖw-‘TÅ5"$îÚt(ÛÇ…à—åúNÒt†ÔgÜÕœ3Fñ¾VÅ£BÒoºâÙt†‘©¶ÚÇt/û(NÍ$9È;ÚŒµ¨ì]ò=ÑZªé47“/Ö4·éâïl#'Êœ Õ `ÁOFpˆ›íuøQà/¸1îÉ,ªú®“0O‰¹Ç‡8¥Ê2‚ÈZ&“$¿0ôɆúl²ŽŽ¸8 ¼Åhk¯À.Ë ©ù ÿ@Ó³8·b.•T±¦Ó4YÅæ¥îÝÑ×»ÓsYü S0A:”¤ýépâŽt RnJ{«x2 O–bפ@¼ªñø!_d~Xú=Ÿê+æÀÛ‹Éft ”a]å9‹Rmú­UÇg#v€¼’¶dÉô8/17Lá{˜’ mìˆ`!v¿øåÕ j|„Ûô8ÄŒžÀ†1)«Ð\´ ',G¬÷¥$„m†n…ñ™ªªœ1ëäÊ›^^ʤª·|; ©_α4f›ži† ßs7¤M „T¥(“ø^`[ãa€® ®7þ„zÕ¥¬}F¤­þd4óf]MJ;*ü¾A&Y’„^±Ce&ï4ñzŠDKSýÉûñº®¡Q»·.JÑoj–Âjä;©TûI„¢Ô ÜÀH4‰Á]}ïnhÍè¹oܺL£kJÿû¥·äó¯KQ©D-ýÙSø‚TqŸˆZŽ†¾t %TàfÀ§•×úÑc¦ûš„‡ìÙØiBÖÊSŸÇ¼r„h(z»h8;Òö²Z4dý`åJTiØL%m“ýä»VMºUû˜s5©Ô=x蕘ûJ¼êó ÿ¨½Ñ®>¢ÿœÅ¢5´aFÃqÚ†ýí=R—‹Ç¹ãyÒòÅ'3o‡žwì]>¤OËï§3î n;QÔé* Û³i¶-y¤Î³Ûƒ{©+ €Šþ{DíÏ㯰Ê]v×zé%yÂ~žõzf§IéèQĨ¹ÎuB#{nèã® ‰DyPø)¨­7Ö³òãVj¬ ¶ÚbÊÄßbÓO²ÝYnÌJ -Åú›>Y7ª0¤]=¹Rù}·eÀ QÝèkž·ñx$ÁåLÀÎEÒ¾šýZÑg»W§__%éÂn ™öú¶nž¹ðÕ™1r ñy-jxýaíc5s(ÌàALÀÛþÕ»m³Rsn r¢ûâ>È÷B'òw†sú?š$e¯yÙË^å»}?hÙ”vt8.f5XÕF·t)÷ë^Þì9o›89ü¡íˆ¶G$vu͵`JüZ¥z 쌎t@_K‡I³ÞlTš?Ðl±>Æ­;Uäò§ºƒË-„Þ«&[b¤E¾éf>P¯¨»åAàð=0ÏFš:é¥Õ ]®¨TºÓ¤Îûƒq'yœ§Øúõ±îX·í¨wmOå:<£';½cù}éÌçu6¾óÀN‚ï†.·BPø`ÊI°f–ÂvkS¿é/p3fzL<æ`ö#‡ëV†£þhÏÌëvÃï‚=4"&@Êñܶ<—3 ÂÁð¶ü²3 ô¾åÝç뎺}¢Yû:e êý™ D‹â…Re#¨Sâyñi#B q‡ëˆÄž^n‚²?ïúDÖP`X[LÑm˜”{¼Ü1àT*Øì:ÔòM_ïñ#m<ÖÌ“òàÏbc³àw‹­í+A™vdðQóEêð­žæûæ#F›Ñ±.µÙ)|=o´î=–KËÇ¡îi[¡úͯ_صXÞwDzK¥Žä¦Íž§êw;ÈíjÒ?«]ø ÝÄÇs Ò|Ë¿H‘ÅfB5Ws’íy‰…¨ð1²8?É÷}¿¼sÚ*ô{°æ–ÖºŒ7Ë+IŸ€^{zx÷f¾PKü°( ­Ÿaÿ'içx­Ì¢*'Jç‚6qá.ì‰Õ"2åyá]¤weÛaM-p üWI 9[ä®5ªøjÚèß.âVÊ%¿°ï¦AŒQ]ÞôÜùJà˜jHÊÍнÛÁvÂ*—|Î_Ógl,q¨í¸†´ˆìC-¿»Ó!.÷ +qBb½b¤¦eíÊÏ XÑðiZnÊ·† ¼Ìæ¼øü®iˆÉLHnnÖBõž(u ïÇù¦Ö/Ü¿‹h†ûõ9/>QÉ›6œl²UözòíhœZvŠÄͽÞþÓþT4>4"o |ç‡}€˜^o²”ËÇ‹rßÓøgª eÖ~c^÷·Ñ$¬$ªÃ<¥VÆèG‹Î2q¯s_ŽÓ‰5Vü»ñÜßizÕ*@³~’ÕU÷ÞÏ&ãšÝ®Mw'g\‚N²˜êeI¸^µ‚r—ô¹ÔÔÈå8I§ Ï‘ÐœÄ ÎŽÂ âkU­®e¦j¾rš‹5Í™WþmlfMb 1‹ s_Õ hôUa'艃AnÞOtˆa: âX㢗U7ˆÚˆQ*°À:Ïî©ëSÖÖzõsÎGÏÏÚ?Ù cp$| ÒÜ»¢¡Õ3?DPiÅ×} ’BUŸAãFÔ#I ÚYºxäÐ0x€˜.䦕fòÆž¬Ó#óšÃ‚;aU_ðüv6à²)‘n=<Ÿ|¥´Z?¦)Õê.­ð©wiñÂ,, š¼»¦X«†?RhYQeç¹ ìú UšIÖ3Ó›þÕ|Wm¯uyS߸D³îÕ"u -9 ÒíUùí. VxdÂF°>¦©cE¶g_A%Žc2¯°©´(!c˜¿7½’ÃSoÈæuø)<]– ŸvÄ_–ovY³@uK)b¤R¸T’*°»wéçëøañ–¹q)%Î.œ*â#íMÍú‰ qù¸Ù÷©ý"׳È1 ÞŸ±Pð)7m¯ûlC[èÿ$ÞØ>üâ›÷ýíÂw/ÓB{·‰ "Ë{Ë};8nÇ„u/ç7‡êû ~%ƒ#lÿuj€Ve5{åÝ¢ðE»ü'MEŽRÓo?+ð…Hwf“w…õñ+qvd+—Dx)œ—†g‚[a·Uß5jv!ë6¾É  YJ‰¼5ždB ñ‘¼Cç.%îOQHþ!ÑŠÕy¹ijw{gÑ'6ç)Ú Åª ZßBöÛ¤F±ÐÅ¥D†¯ïË‚°Ìúðü|Ü«u^ üø–>âmeØO⪰õÒ‘(ƒãt™–Ñ]¢¤HrB)«“ÜÓãºéá‰kÔÉ…žWIjBVùô†6Ê‘J\šD¯„¿»F6|†ÒùJ;ÜÖVWÈ’üåøMå·Qm 7ÌÄ>A†NËó%ù¼f¥:u@ƒ¿Pd\ë"ŠLÕG»l.ˆ®##›rÉs ;Üœ…|s}U2²¹,"bê%pФÏýé#ò'µ±ŒŽá¤:,=—Ï3³è˜F?Yz TÕy¡ ½¿»%M¡!§Æ½§Ù÷da+1¹¹þ.ÇF~Ʋ(QýªìÀoÎp½x“¥¼Ì g‰)SzüâdN'°ÅƬésÕ2{ûÉšÞî‘ó±?ò`+åALÞ3æz «FÚ ÖŒ6TĆ«ø6·É§ûêø—íÉŽG<Ú*R­€wfo°-²­·b‡rf tz_lcójÞ9º ÎÃמ˜ÌF߇9¸™+Šh³Ìã É1íÐx±âb6šFí–¬Ðý‡»ªŒ®ÔºŸ]פ"ðùÊ)ȹ$«ØȸŽTq„m¹˜:Ùº©bÏ¿óIl”s1žžIoÉ?Ç6\+Ñ "ʈÁK&’¸)FVCŸ‡h!CßS–ÛøIJî'ßaNN5F™âKV|L´ÞÜ›4$¥ìEÖ¸HÎeÑÀ—Ùb½Ó\’͸£ˆ.6Þ>«ò žÂ’5Ãü2_·õàní9›Y '8Ìý½¶²­`b µµÝÙ"i ú‹kGÓÝ™ø¬÷r&‚Y6Ä´´›-ͽ.ê½Y]ö¢ÿ¹S{î{FÍI7ËXî*Ä•VXõRì…ë=lDgËEîÕ[gÌä¬z„JìRí×÷ô“âvŒû&mÒ($2wŸfW§ßÌ$ó{7ïïÖ¤‹\:ö¥q mç …ˆð¿ -æ¬Âß¿ˆçÐ|Ù? öŒNãЉÇNÝÕšL&Si$EI›ë›´ìŽL¥$Y¤Øæ:Isx+ЦJ¤?)vÓä⡆-' ÛظA| Ü‚²³Ë´!E²#€•¡'Cç2Ø‹ÆƱI¿/DLËóÆF‘±>ÚuI5ä›]0“2QdüˆÙ%¦ÉŒtÔ8ïS»¢_©{±Œ]ή8èby4ì’t¯Z³Š¾Z/È"Àß°‚pÈIŒŸÙè*õ=ÿØSpD Bº{X=ùÀÂä¡©:x°7ûsiG–· ­¦<_N-%ï¬ê½j¹”œ†ìw„[g! ¬„ ZÕ³ â}ùí¾8æÃÒl‹,hn¼äÒ(§Ž™òöƒ­¢¾gr˜Yg?ÄpdJ’©š‘¼eÑ×­_ O\¾s8œ¯vòR…Ç æ'|ÏÝÞe°JS!ï1'ϯNvÎ EÍyn%æL­ `Œ,|ƒ…à•íGÇ䀘Ƿ”¹$q‚¬+ykèÙsa…Ê_8ÆI¸ÐJËJf?»4c›¼ õD[É”•O šVîˆç²tXyíæ_²í®nùI_ ö@Mº"’ßÙè*é£5öHÙ×’vŠ`WgPØ !0\N²Ø4\Ãó£:êåiñYÕל›aÞ-Wqví¸Zeb²¢‚‰,4†©#Xüùþ/1œýän\šú-ªœ#ÞÉŽ_¸ŠµŸÆéu$7ßêr6r=š¼ì¿ý0àU²b+ÅYæýe[ÎUiÕn¦[sÇ"r‹ÝÖú‡iÒ^m?[À&ŸòaªþuÀZlõÛyÇI áw‚ªÒáÆž}Zá˜Â´”²PÑœÔ0z1wqÏ4n?‰/k¢óŽ$+ëAн¦"TcG–3> Ó©ýYÄUJqoÒ¶«¬¶#È/ï&dpªú¦òvy&¦ê¬Ê8?â°»b.ûåš ÖrXÿŠ¬æþ'Tq{ë{Êä‹yE4%ÙàNV^ª…+&ês¨½’¥FóO–BøûJ]Ä?öÊ®O?<®×Úâ ó·[3Ü)™~{¨}rÔ@A؃ °ÒJL^µ®H#(–º{:üfÈô¸x"’Ðö)š^â“*ÏfdÝ_û¼äÖGߎëWРx-x¦_šÃY~k%µŸ’sLÍ{á.˜ z ô./…Và3ë½tÛ :’+H:YÇÑ{ÌH5ðwŸ¦ÞÙn®Øù¨•W‹2Y§tb ”´õAŒ‡"îgØ×OÞ#%Àò™é%ÓÙøÉÇ)ífGå¦Dº~÷ªÆûTî‡vË‘ú“5g"VL9ú,È ×Ê©”‘Êy£*R+ÖÝ*%"™'O™RöM"žÈ[õ™RŒxð¨øµ ·­œË«o ¤>ªµ68g‹H|H¾ã¤®¨R¸ƒŽxžÞ9»÷¤-™z·‹ÍÀpn…G½”džsôó¥Oy·V,„ÑŸKlgrD«ŠÁÈ£ÑüÆeä‘©è'úÔù(-´¿ÞãÏÄZ0“?¯#œ¸G×qyRmM÷æg˜ãŠ;aד!ÿÂÏ{ÿ˜ßÕi¯„u}™M:öÖ,ŸÜ  N:¹±ínª±Fã kB®™ ÝybÞg/"ñ ('ˆ›¼œnz &0·‰òã½QMÁ£*<•ÐÆB"•|‹°ÝÖ7‰äÍ·_mÖ«ó3^¤uöYM1¤M”à€Kj?OÒI:Iˆ%ĘHc(c­yLYA—ØsÝ(%Ò8EÒŸø@$,°A£.¸æéqêvR]©õèÎqï5‹í:¬ ¿¯„™80£OTp `¦oÛ±Ù¿ŒÞƒš[ÿòå|Ü9íâçÂþYO5W†µBŒÑ¦f7Ú‚o çj™¯ð’]ìvw‡Ä”B 5æÏÎo[W)„G|5¸¢ó_:Eï|¨<½…PcfÑš›â9…,>/¶³æsÂÃÌëá2x>oÚ¹Ü*ýôJ/‚Ç€ë2Ý@^ŒÍ‚Òd ñM Ý‘ÕU =Mó%ç¼E!LŒ>½]x¥ñ—ÀHó=í@bo“­èZ\_hjkb@).gpŒ1®³`…ôù&È2 P‚<@]ýÒ†„äFÁp^q¬ª;N£~îoœÙ_ŒÑ»I':q•mc× ½õ‰UáÊ×Â#ÏÇÓ>× 1…‰‡Pæ]ð%…ëÆûuJq#4êy<¢ê»OšϳN¦e¯ÛAð†Î?,åyJ \;™ä5¹`t1%+²Ñ5qÝGiáR UxD ¨k¸½¢–OÝ/ URÊÅso²/Í+¼2J$c-Êú¹eMXêøÚ¥akã3µ: ¼ z™)BG  2C{3é½_ù÷úÝÿúj ¹³ýXUÑÈÝ­a¶¾ø[’¦½C“¸/[¯`ßÜÄ2›ÛF®àÙqIŽßÍ4 óÈDa¸°¢#;;‰ú$gÔbà_XOIì)ÖÉDÝÀ JÊðÍëÂlÙj .•Æ•³ßP`y¸ ¥H—CÍ ‰7.z9ó Á‰üÚ9[åbý(\~˜fD®uÒ7&å¤M•ÅšÎ=f G|¼ å Á0,ýUÔ6‹ß…pv,´"ОJ¦ü4QJÖ³>G"u*÷u9q¥Ë Ú­¥óŽt#87Ø¡}õ:ÉrlJ}8¯Ë‰<'^Æ›ÝÂæ=Å u0×å…ÒWýíA¼Š¶ "|/¡ÞÀλÛuL~QÒbü.l—õZ<öeW§(žÅجßå|ƨŔø¾ˆ ýe±Q>ÔȦ h /.fÄ1Ê Ð>¯[vqׇ› Ìžg†Rs¯v£qô6Ü[nÎÌ+A½¼(óªš_,®Êª+¹CV©ˆj#„JÓõHƱèí&TÿNãÃF‡X9%k½r+L¯K­ÌUÐ Ö‰6‡¤ÿÖÉ9"¯äC!R¡º5ŒÓtMâyêXl̈*cò(Uî@Ô&’òc¤b"Ízú9›gá.îb’>þñǨ (7¦óÆMª rRé–¸P[‡^Mha³ùö°ˆ^.™ê"7ÓâÁÚÐî ‚´°oÚ ’*Wo( Èg\± 6)Y 0÷ ZëË–aÓ‡{•Mx ó.ØÏ˯Ñ¿ÃÊd>Ÿ2Ö½Õi’’þ¸´Ìõ }Çá:â 1,fÓNŠt¸¥«Êu«>—ú-yëji¾Ö¸-[¿sš˜Jr4Àé™áÉ´$ ì³ØÈ÷Ý/ÎÕœ6ÏXëÒ²/ËE<\ÅDO_ˆ ‡û–•²¶^8Uè•ß—~WµgÓ‰až×%™Ž>í´MžoJƒëB5XfŸò"¬ŸiF¼Ðº)dË\X¨øÖùâ垊 Ë@Å›šÆ¦ÂˆÊfçÊx­w~ʈÓÙø-¬g¸íÝ·\¶à*T·µÑ¡'dôZ‡M+ŒCSe¾D\wüÕn ?àÍ.¼ r\;œF“j'’~®+þ¹îøxÛõ'(yž‘‰âÃb^ )ËyÙ+lm&ƒõ\xÎu‰JÔí;"Ï.ìsŠÐ³Ü–uö˜@P+R1Vj¢—ÓÇw«SK|CK<ç gÐ^D’ùkjç|ƒÏd:ÇCò”›ë_õ´‚|9¥uÌøX*¤¸‘Ú£ä^^“Ñ“¦Ø KIŽðªcj¶i¼6Œi@¢‘[Kh‚¸|±$ñC$¤r^D˜ti;fg] «V*IÞ·6S.û±ì„ç?XdÕ'Œãy`m® !-ÜÞ_d2虆ݥ¨ë³™ÈªœJÂiöXy)8«Þ¹²MÐC]^I?X(Óôµ4j0œJLc_Ј¾†Û}†V6OJÎL_¾ÚUQWbjHYA÷ú£  IÆàÏœõ9ÏŽ„ÀHåŨ%²—öä½/ü1 à‡&ͼȋR<ýòêü´SæL¶ $ÉÙO0˜óñáüt¯Q=àá¥òÎÛ¡DêŽø×Ô)§D»–_„5?CØ] {K›ÉX‰äÆ›ii‹ùJhdMBfßO¹˜åôð8$åÝaŸÎ¹KeýØ=Y^ÌåÛ°㻨›²X~rÑc+ cs_v¾xõˆŠmu]KPJ‚kö± nlYÉ='j*Û—4é[ubO‹œU7SÝȤ/(ˆ…¯#£|a_B"£#¤–!ªAê:–Õý‚¶I…lq—Œü½"3©Ýë åÙ £×;œC]Ýÿ`ĶŒŠp­7;žFYŠÖD­óÙ%5¸Êçô­SVu¹™òmÙ¹ºás‘÷‡6Öº=?ÁàÝÄ‹~Ê;ø}üËÉw¥ÎŠq/æüOÓö­Ö­“ÙºÍÕ;Òýf“Q›TæÊuF™Aš”a{e –A ‰,ßnÉ3Sü½_‘¢gÓ, hú»$ û¾©oƒ›lœ;}ã{Wž†-Œ´žo“BÌÑ/F _[ªÄ k¼ü[Rš+~ YÒ¥ß;ñ@2u£—[Òîb™üv(‹â¸Î”ÖÒ>ÂȤvÎj¦¾hU§5=IÍ×ÚŸ‡BËéþ@YÑ“‘ĨßüH SëB,~—$¢özGÙøH.Ôþ»_H s:½.¶ïÍNGmq{±V5Ê» äóQ˥Šî™§œkè‹c’DDB[]Q[š€ÌùâT:·4Q¹Ì£ŒG¡I«Äد<®¼æ%0ƲÅF2yËÖŒ{ø=Ö™>wøÁÜÙGô{‡œjîêxÁ*á U‡ÞTG†6;0˜+>Wΰí&îp¹¹ãP]SìO±â–Yln¤C™™ü("ÆdÄw¥2o" Ù€á÷1»Õ·è±ö µ®ŠFIkº1cÖ|ÝKŸê)ÓMY]uƒ„Í "gbd0”‚íËhþ¬µÅ¨°Â‘o]ÅAôè0ºÉÂàJŸ|]B…ΑR‚½0‰*¦O’»ñ—UûmÃ%þÌù~*À/Ä^]½t †»¹š‚V´i¸b@eC&jv3ÑÔÁÈ(6Ó¯I'@cªZ‰¸ú ÄÚ*ôÞâ‹6GBMÝL ¤ ¤”©è¯Š#ä‰úÛlÇ~IA"_bQaÏéb•Öà{*öo1ÒÛn¹ˆ¯•Lq(ùÆ ƒÊÞ_fðJ¿ô¦ÉâZž¿ÞV2—ñ ¹¸FèÍ»ª l(˜ ú ”ñ_ºHé7Gàçûbc…cg#uð)ODÿÅç¶Ó…§MÈŒžAš0´¯koõ6,²³f°]™àòh™æíõÕàçDS^´.çB‚—•c8îunY¡gÌÂÄdKa]åªÜB¨Û¡^æDež"4Bƒ“—ôÞÙ~o]¨OaÍð›Ÿö‘ÅÝàíÊc?‘½.虑™¨sùH5RÏR]$ëß-þ^€”ß›•`³!x9Äþ¶+x¿hDŒTxâ£JvÏzà0uÞ`_¯„Ø6v¦ŸDšÑ* 3Å.ÊßLT‡Ž¿æ¾Ì¹è©ÙëjnxG‡³Á=ä[­‘˜½z?y¬ûT..²l#f½ÜÜã)ÇšÁ—·…›2‡9ù&ÝNŸš);TÌÊ.>õ¢¢0é^î*÷g¿™`Œ ‰K±òÒ~#ó67úÚ3ù +‹ ´29tÙt&Ú±K‚’/›&^‡ñè˜~*WÞDS††¬ˆˆˆ|ö%\-Žš'èõ×õ–ñÚÞüÉ–b3„âp"ì,ôêÒw«Ý0I04Öc—f~5Ú¤vB}¾#yþ¯VZÞºßc<³º0±XÏ|(têî[%DfŽ0±9äE¹h㵘9:t¾TP„}Ž[ ’öŽ„²ðù]×¢‹.Öuu…­Ó¡«'Þ¤m¸!WRž·ˆ % …'z¦NžM¬^eîtQEh?èFªÖ‰ðÒú}X ?ZOqÆïcú93&b"I ¬*‹œ™[àúi³¥úíÝ1¹ÈØëÑ,?ÓÆE£%‡•GtG¶ˆs…(ï-m¨I‡{{V+KHÞ²1ïÙª”‚]'®?´”(܈½Jµñ³-ïåèG2N)Z‡&@ÔæH™ÁËFÉüqLØ`€ºt+fW^4M€‡FÃ1`wmÍ”Y.¶’Þ$<1Ûò>‡Yoº=ëT6ûgmÝM—Ýn¼¢Fñ75j¢ür¤­ØNcŒ {ˆ1æj.o<ee‡èÙ.éñ–™Åöl.¬­0hkNPÕ‘äu%«i@y»]r¯‰.Bj*ÍÇÈŽ8í¯õ¡a:ò…2­Q‘36zcÛŸ\1ÈMt› Ýö O´¨Jg<ã3ázÙfîPHŠ¯0f”óÕžõã?j>LËAO·eÙ`Ÿä*Ã0ÃÆ‚ÓËS¹ç~Í“jQ°•Ý= ¾¨ŽR¬éÄé–Œáê*×mÝuhòç§zÒÉë Ç׊ˆ´'¢:çé×E‡»Û‘{dd†õD±ì¾[9óèWTŹ¹¹Õû %=ðQ¥8]Ú oÙY¤§ÑqÀa½š“ F2/ÉbÌš-ˆ{}6«XŠ‹9B6}×V´IŽ=B“,æ•ø!…cT0†KY’ß@~ÖA2Ö–·á¾7Qøõóp3%D6: «$åÂ5Š»n„#¶àüKš–2©Ë“ZmDr.ϸ6æ\DÔÜZ§aîb¸œmѼWïO™%4GÉ’ÚÂo§~ä‰G÷±{"‰S…ÞRQå|¤ ñº}ë·ô ÷O%Ñ—_:î ¹Jý"^_E¬É"“DšŸáÍÃûÉ2t­IXÞ«ŽŒ<È´~9UC{?Òµ9Оv ÒOµ8è{¿òæú^¦8_7tc—Ýüx¡›ºLõ¼;ý õUä^ž_äCk~©äE²Ê#£K¹ºOj¤—³rÏ6{Vh»—o—bÆ»üeU)î¾Fž 1˜ofÉ‘>b<¢jÖßM Ê*ÁVÑê›Ê—,›úxk·ÔùÓØ-ùàÐ M0Ö£Ž¬Ä{ éó&è—öB&Á‘¯îF6‚ìDtÞ=­Òu¾7ÏͨwÊW{o ÑìIœ²PÎÀì ñABΟoÓ•»VÙ%%ö‡…lÒ-tÚ:i¦óì¡Ã Ï&ÿ¼Œ¹ôn©©DN@½­—˜ÛL ´ÞŸi—úº˜7YÊb»Ê¹_‚h…Ü4ÂTùÞod™Aè·úô®z—éiÂÀQ¬†Œ^†Óç’£ÓœŸçIÌ1ûK+#׌ê2¿~*­ÖGÆhWŽ4v’qeè¶]™ø±K6"Fb£2Ží‹ÁÅ~¦ÌŽQ›ÞR}£Fç@2+‚oèó•^$°‘×tÉ$`~ ˆžN¸¨?ó•y *ÇÑ•ƒéܼ\!2˜Žõ\ ¢ÀQ‘kÔéµ ÊåE‹7ýóŠÓUç`§«£ós„Èå)£…oÑãD—Mäµ^‡‡sG<ô¹¯þ™+·gË,‡BPEíé§íW/òÊü¢‘ÇŒÙÆ‹õg"rž¦ìF¬ëíKVsIyx]4>Ù˜½Xd÷nf©U©°û§Ï…ëI¥ºÕËL1cu/÷Ôû«²?§B³ó„>d@­èS_‘}ÕåL”âGؽ€ OÞUÂ.ÿ®ÛtSp1[yçw™)ÙT¼Yÿ/ïNÔU€Ã_’Ràº*èEÝÜv±°çšèŒé 4 JCî\µåX • …aw¯ùyî¢þýʲe†ëiú:„5Xn´;Ieø:™:Ô™¦Z0-ûñP%MQƒâPZ8kÏ¢Ñkl3xü‘Åh^ /=Ó=ÐàýÏœT•$Y´a]½-3R;2ãG$vzYàÄ¡ .È4î¿Þhˆ8qæõdú¼¾÷×çÂ…ÓÞ.)e~çÒB5ÐëÊ+hU§JoZþÀ­@l¸ 9—[““\Ï44±^ÏTö3Ìeàž&z¡­;8½çàŒÀ£:Úצ•xÉAR'VÂ:ÛaL9_/ͤŸÐ“ ã”~â»Y7Ç Xµ¸‚þþº"¡¶Ã§å­~ÑÑOÞxq“öâÂòµ!UŠKJ{L#ŸM¯ñ_dqëÔ] c±9 Ši‚=Ôß1ôÑÞg2#Œg&3â¡àM${ëÚõheз+’c§ü´Îaî—/iž—Ê ;|ÄûÔ˜g¿‚þ©Dš Ë[©ò^]V1ØÖCöòñðPŸ@65…ah¹iíýóî|*Ç—‰‚ïœúl²åªjÝTªn7#±’Ç·š&^/Ÿ›=8»°<‘„¸9?WF^ùÒ‹™ùk›XúDÞÕlXS}Å Òg²tS Ô^âm„ÁòS\[kJŸK0D÷byZl>dÔGa&¥mEãó2{µöšµ’hb ŽÙ=ÈY{VñŽ½nk{“bÕÄ %_É)]Åv2‚¼§¯Ï§;茓ùuæøc‘>¬Ûp²thånÁ>‡2ÍÉû-¢œÆé}<ÞOÿ*]S/xÙ§Ûø¾TLWéãLr2•”„¤3éH±Z¶SI²ê° ~[/Ù4o{As„¿ ²›¹^Ab1™,¼uXÚGòÌ ö‚.Ÿ¡©¦SçÜ€%èÄs&ÙÃ|†Eñï:s?º.H¨–§H Ù«N¢¯ßeîUð‘$¨í×OŸPy Ö§ºÃ0½‹¡ú¢ü¾[*•ûp>gÎ^Î>QM¢ARnKW%,„aŽ‘É-˜´j´ SF =¼ûðALÿ@ÖåçÒkÜ“1ù˜ýtÄûûèxGÚoƒéo¹y©Þ ªQkS[^­\¸¦­ÝóI-½ƒGhµ<¾W\ÅønKºÝö„ëþ#ÊVœŽÐæzPUÐÞ|SÞ ²¡¼;žå<ãÔ^ÝŽVí±D!àõónéÎݱ¾rDùéŽöl¬°û¶‡‹vÙÏ0Ö[ŒÇbSqÈÐk7¡¼y¥ƒƒ1ŒËû(•„„—ø”Žt²}?j ÿàW¹Qƒm7ŒíçbÅÜzApþˆ~©ªÒ“KŸàHï[ñKˆ–é-”w™U¡+@—õ¯c¼íÜUÐsì÷3ï¸ÈïTNÄoOebå¹Eegu~ØŽ’Sï7dËEô_îÄד´Z ^'—ßО¶½ ¸‡ª0½²‚¨Çb2'÷BŠƒ¯b¯.¬r jÆ[”å«ÞX­“®LYQ¥pÍ-zBZYDKÑkß!Ý‹Á Wä±*{YCµŽ‚’6q8':[”–~Væ÷/\pä¸B_UOF/vf ®uV:=ŸxovÏ3ÒÍl:zÌü§”,Z1=DÎ]™²yq§ÿOµ!JÞÀ¤¹ ʼn)&ëZZj!Ú5Ô¼E×eQ‹¶™nÊhêr4É:§Èuø,¤FÐJ’W<²^ŸãyK/“ø%ÂthÖwáci|r> +bw3ÃçÝgÖœ­rhuþxc!_fV-·°\²Eô‘É‚8» '¿_ÑY„‡*ò†qv7ôö*v¥2l·3ì«· þX2KU*ü%àŸ¶c*‚[%ƒ­ˆ¼fÃûO«ü{C°ñ9ô›Ž5‡nÖ- 5™€Œ“hÂK¦ºŠ4(nØà¡·’eKJ±C¶*|=ŸŠ ãfÁž,xJzí±‚Ldtb¶>[ܨDø~nðž ¡S5§5­Y ;+îSþ—9‡XÃt.ü¿?ï#Ê»Ž…—ØÁN);+>’MT:a…3‘,¹ó)Sã¹´¼»D¬’s‹ò-RBïÀ© fHЮñ°(À|›]¨&VHK¸äFk÷ùÖ>Ièñ2“¥ŸÀãúÕ9(@í#‹°–Ee™¬I£ßþxòŸÚáe€Ï|XïO*–¢m~M¡_&í~–]w³8?—¦¯ ~F%ÐôäÚvʦ4rnœÃiÕ†»Õ”"Z[e‚§õSI6‘`ÏO¨_ò*— ?,üÈG‚LûŽ“j¨`ËÂS§Úh£Oj•ÖÖÃAQªª”‹õ$L6”Š¯g`z;8¡hÃêü{cÅ¢V¿ ¯5r:A?ÄÆ®jæ½åöVŽ{k}±ù4Åxb€âƒî<²š0#R·Ü¸:™ƒu2î¤-PŠc!z½eºÎbà’2ŒÖyª7Á }3ñ7_¨ÏL³há;c§È“¯h€.#Ò{œÇ•ò'¦Å"ã«}àÞŒ5ÞvKZ ù'Á‹¢K²n=.!¬WçoîFÃ’Ÿì!}éçCˆ^Å|–°ó$þµ%p…Û³O¨žè@Ê1ˆ2&%Œ€®¶|CÛRü´MÃAŸ€ûj9[¹Èì®TŒÉMp|˜S5Ä<’瘳{ˆûUטT÷Ÿ6RO—øÜ~Ä‚eÕ „ñè³À‡6ÕU›zÒÓ‡è(Sû «îr\Pk+æ.6–Âpµ20Hz sDÅE„0‚æÏÍLwt­•@.”¯¥¶ ïÀ%nò0Þ •<6ÄÕÆçÏåa‡—ïê½±$û 3°ôYÉ:t¤ 8©!-Ä«2‘†~¿S‡/â°”ÿv"Dë‹b¾¢PNÇŽ\øJpñf]/Ö ‚Y÷B½¢r¶B7ËfŠêÑV_Ö<Ê7Ügæù"1÷ÈXËûX4Ñk–á\ówŠÚØ®éË ›Š!õ£¸¿)%n=ª§X‡ËjIStâ¼ð¯Y*©mõ%<.´ñßsRÖˆ+ßpu. ø~£Ï—kŸÖ5çwOksÐTÞ+¤#–ðC¤Þ3±N–íE¶9€¶"Ž&Äß ÛúQ¤ÚW2k1RÛ:Ê©š7MÁaîn,w0CëGº7»7ú£é*@±iÙ!:€•äVÌJƒäT¶n#S—{ Ams‰¨ð)ÔðËW¡Gá ¹î»³tVåmÀ—`0¯„° ‹ý3TU¬1 ~=X•+1,ªÎz´ ’ùòÿqÉú7çêتq'h~é5³Û'…ÜèÀÖu_ÅUvñF+mý!íut±OÈ€{BfC'ÉFPjõB0Ô@Éi„EcDúN˜„;Aª°x5H³m³‚pÏ´{éó»qÓÒŒXÁ¦>ì§÷BE‹ÆËŠ³¥/‚{Û«*ÖP±œr›È0jhqÓoòM>l•TåsÌQ&–Œ¾1ñ¤Þöaƒé´g9úÝ짚˜lëÖGavvw»<ׄ°üØtg¿ók®Y4í4~”Â;ÄUPŽ­óXÿ‰ŒÌ»nù¯‹Œ3™Ö™3èp#ƒ_Ïíi„Ñ—‡\kÌp‹§¼Â…úy»[òèhyÜI=Ù`ï%›§M—Þ"H`…-?Ïc´îÎ02”ל/ÜÚ#Ïm¼Qa~ê|3eþ)ŠM©¾ÍÅ$584„†E.âÅXŽL'ci›m¢VçÒµ•Õ¿}¸±¥8ûÛ_©Qòö?P§êÃÿí){½¡4«GMuƒhL²¼¡jzšÈô°çÝœséØSx»¾l‰yÊ€œ~0Ó6£ÿ“sÇæóÎŒö^qFåÿ€¿ f—XÐâ"äO{Æ#9²ë÷ ûhUõdK#0BË4±U  {œ¾Q³Ç¡àIœXW“ýNûaŠÞ¡E¬¥5׬a¨Zç ˜*£NØçµÁL…ßW<ÖÎ[ê8ú^ ¿ÞQck.Ûƒ qÒŒòÈÜskó ¯ÈA/eܲ-‹•Wºß:«K=è²UYg]iòãþúæE¾‚¦¢=IU^‰ž€e.Þ$*>ÄÅ´âŠy¸³Yÿù½¶ímËÁ¶Jùòl¾ÆAÎ@buÍùšmæXÊuê§|‰_/+á?“ò8x#`Ñ*=H;òÉ”¼êEA¢*9D!{vfº£ø:výYwEÉ7ëNÿ­?‹´}VNP¯›¿a[Cz.ž8à3µoº#h¥<.öCÚÄu/š.=„£Á+ÕcŽ´úÁÓGÔ<œjÜ×c«ƒ‹ÉÑÝ©V@ˆª(˜7~B§„l…Ò÷Îó'÷ÖÊ[ßT;’ fÌ]Z¹«Š¬€Šnêä «~TòOØ;M‹êa…\rÇÄ ECªë¤IŒ¼Ó#oôò7Žesÿª2ë‡É6ì+u ½°+ÒcÉt¸UœžI:Ò@ZPëË2žÙbH!ÙËsØé†ÛR=Œ’AEOŒ‹Å4¼ÔøŒ9ÿ½æÈ+t íE}õ54'ŒÔnÿŽ…¯AúiÝÕôÜ ´Lü»}Àc‹*ÎÞÄn¹ßâtÚ-J­u8Šþü ìJ¶ù鬼Ú{ÈU¨‚¤{ó<®Ú¦»JÊvü@ÌRçàŠNK: ÑÑÿÆR`Óê/‘.òP?ˆ¹eœ çŽo ècRNìUÄÒ{JÕ$L¢ÿÌâ§*Åièõûk¥Ãºƒ™ýÇMW¿lý]sFðã8Zñ2k å»,/®ßK”;ÛrG½öÏndMÁE°¨ÈÁm…ô¬ÐsmëPÖÀœ{ýÊÓÃä¼4ü†¾Q*X‰a½•\PÙ˜X$¼Þþ!kH#÷5†$GYØx2 xwŠ%kïGÛ9Ü•á´dæ|FÇ:IÊ_c¼|À&º¹ {ÅÜ›âë8@êbS£)\–Qú»ÖÓDÎ3îà*ˆ)ÁÙdó¼~iV>È`u”1‰“úËŽŠçîØŒeV7‹kY©ïñ_qZ|‹Ð5eÉ$;—E÷=<(ï©“kGL fWý‹£ä¬$FéÒ´þÅM(gU<ÊÀbñfïæoáðHs¦é}êÏuk5.$ )šAÓå¦+Am’_èÙ"ÖÍनþ&»ë“wº'_¤zÏq½xŸjÚBÍü°è’k‰”¬ð>hiá±îc³{„­ùq>4ål§ÝrÅS2uÃÃYž g‰Í jÓ„RuÝj@à秌“ûŽÌÊCÏùëƒe **èÃdúq0Q"„]+Étc~æ&¾¨ÌÃl¾—¸ijM=*h²6a«×*ÜŒV;Q6~”‘¸ØáðÏGÛÔƒ_MôQÇû2Áh鋼[ª\ø/e ­@Àà&^ØMüÀ}¸J‹®Ù¸ÎcÝX9Šû)m£/ ÎÝö–?Èë`‹S¢l+…ÃÖÞªõ²wÈ’–ÃTÉNq¦§¯Ù r²&öCÝ«Ka´Œ¤¾æœ aZú:[njwêÙù0FgE¯ïp±púP…žoÝü8¶ô¾®¬²%h©¿"ÖÌÆ*ÀB§UŸÎt$îÅ=e=‚x· ÍA‚¶íùÑåŠZ拘þUhWG5ºeyvÙ™kŒ½fÐù/"çÐüðñâTø°(¤é{?m3&k丩W1[[Îc·-±_Ñ8T;ªàcÎU^ÓëþÜÿGûSRqTYKÄ1ôSû)H 1ùa¦ÃØ]³b±´ìäíÂyXë&5ýCg?1ëudä¨xBl£p{¬ya™ÊÁgr%÷7 Lßÿ?kíy7{ˆ5î|íOùóTâä8‡ºû&Üdiœž¢9ã¥së~ZÓ§{ª4îdm²WŸõU³=„ m"È Œ¯É§¯1Ù›Á¬‰Å¨CøC jm„+Œäi•vÛ«Üf~Vú!‡ê-Äå/gYx5’õŸ÷ÁÛc.MX˜­Š°(>UÂ<¨¶øÀ°iÞe‚•œ³–ÙžÐFsFŽŽ”H(œe&؃ |‚‰i®Œx¡á~ë’L¿Úè?ä†c¡.,ͬS‚>dµyž¾ê<^ úùY¨ÊÚ­ó.béV§‘¹ÅGc ô¹)T¶ l‘åû b ¦#/¡÷ؾýqwsQÒ'1çpŒFGïÃù¥N«^¦ê@kžWf‹¼¹/ôAPr”å@2ãm ò©ú…†¼“Õ÷ŽEW%Ñ:P6¸ƒ^i>•’¼N…ŸØ°!ô%áȺ­,;ž’X<&p¸½[q/ ¶4×n>¨%Ç•g]Ï!áø]ïƒU\jJv<™Û_ÑWßA·¿&3’W~ôˆ®ÏV}X•~©O:ý)Gˆñ„|!«”µ¼ÈtÓ¾"?5^ª!"”æR[×ÓU¡_¯˜¡ÊnÁ…Œ¹[w9³mX=vꊌøñƾè"i4r}–§êKjã9Û]0!zÐ)2RZ“h†S RNõ]±×ké ηì:g÷‡­HITA×òõJ ¼Êj:ÿ P¨×oýÈÏò¸c•º"<Ÿ©õcN<œÊ"^ŸCc.†µã«e0~<ÒJ žS9­mr³(óÚËžsɺQOš‡Önq'>Ëx<Û¶§c•¬¯¯VXê lø€ÍMØÓîÂõ G«õË£ÆoDШ £õÿR#K=Åß8L4Óü§ªgRfÅ='Áá#¹>Ú²§‡¶¿L bKYsÙ(¨û¡ãÁ­*Nz‰÷سíFÏCÔ2¨á #ÄIo͇bÿøŸNgt¡U*$Ü|†¾30Í^îu¸ˆŠ£ìf¾ow—Fÿ}IŽÁYìn‘8õ§NÌ–wœò>PàŸfņVk ÔŒª/2æýº¿C€œú3· NÞ>®;ÔzÒÄ cA mÆÁd³c-(!?Ý·‹ kF}}8ûcÞv?¶Zebc“7S”îœÆ˾@’C6Nˆ„t…Ͷ—ö/™@”þÔ¡V% ÕòíQUbt’#Ræe©Ì‰ý¨x™³M™àQLåW3êW‚ç=U.ÖX†ª„9¼Ûò=H7Fl¤QŽŒãëßò;àu¼‚I$ph¾֜얧ñaëO#áv+P„ÞÍׇ×N%ÿŽÖÜs¼®ÓHwÜ]°_6•Ë”“¶l(I‹o.4’r¨¹}'¥#*°¶5†Þ©"ªÈÛH“vÓ’¾x9¡ª}?fŒÐ?Ï? ·Â:¡tÅžÔH€šþЧ‘¯’þ¾\ÑŒ²pêÀÕ=¯Öo‹Œ¦( j¯ÉDê`pg¡ã÷ƒ•gÈ-_µæØð"á9¼M‡ð%ì3ž 8D|A¹ß0Ö˜ˆw3áÿ䔋“«u¢Ú ˆ‚ù‚n\Û¥UÊÔÿ”UR-èžI  Š²iJÄhÄCûP$M•V‰žÚóêuŽ`ðÔµ>y#øm#'ÉÈ.ãéCmó ;g€œIÙ‰ÏÙÚ"ÿ^/ø¸ž‹Íàß‹#´ž<à׌¡N‚œÎ›ø^cÑp:»;I*ÉHEE É 3j«ÛÚ±Õ>FÝä~VAm@KØRÎÙX¦MQ-vûY[ˆã…îñ¶˜P`#‰”ÃÖÆT2ie"1÷ž]ZøÛ}µyâ"Ó¿”¥âE3_s ÑžüæjYÖù‹ù!Õ4ôl€¸¥;¹ÜO¼ÂV0]ÇÈÏÌHp+ç}™º 0èŠmï.ŒüS§çá\þ­=÷ý0EýÐ0Cgf”)ŒÖª‡çÍ`J·˜g²[ÿµb0Yªå–bI{~rv gí„ Ka8-"’:Þ7JC—§^d.›)4àÙ˜láys»ý~|‹WåãÕSqppr·ŒU0² ÿ׈Zì…:ÖqùD¾‡q`,Œ²íbNß]õ/,1Êÿv|#^T—îT¸’ŽP @å/9`_…ç5ó¢”fÜ/ÃÚÕêÞ‰ÝÀÑ%•<&†tÀŽì %•O7«Ù¤/jXTÁàУ‡¼c){ÖÏ!è´V¥{×öq2³öC¯µ8C& Û¸¹Â_íT6Ý.(vŸSE™!-od/ÇqM;Q f€’XBš¯f9ì+áïŨû>àDœ6 gýçeJuÄnÆl@oª t:ɺHÕ[õ,ø3d$±UXéJ§·eíø†ÌIÎ4¬:˜°Pïû‰ÿò ¼iŒ÷î¾ð¾ƒ—çâFªjŽ˜ž$ ÜÐßž ¥”}Ç럱ÁC=FAÿû»r¨ü,o¡wùjî™ØÁ !ˆÛ’*ˆQÙ#2c¼ëÎO)±”Òh· €”%£Ø¯±u›~ƒJ øæ<‰n†—[$·Ãf¿ž¾Òk4álš\˜ lëÍñí=º£W 2&ôAWI΀e3|ÓJ9öËqqSþ¼ßÿ‘›½t èŸA>X&%àìqfv˜Q/1/Ü[ø»dñ³P—1‰ý° ŸGƒ„J 2gϼî yHßÛåA¼?~{Gm®Wûíç8*<®ã>¢?õy•û)ôÛ)î{“RȶAÑÊ!¤;/ž¬»cÌW76qú¸„Â)xL¬¹ý*^ÑÛ¾Y¨5ƒs.ã¢èƒ€¸àÌ“ï&Ê«0—ÁÍ8“`ÔY„×–4(¾¸ªtûõ».ʦež  ·§(ïi†P¡ªôë^R8󊶴Éi÷¯J$8êÈJ1wû«ð\` Ä‰ì¢L£³ÎÛÀŽ==F9d#¿"Z/',ŽbÖœæúÝ&bGÉèQcõÞQ}‚úÌF›CpI–éXµº °´:å‚F)Á{.fejÌŠpóC©Õu$ç­íºs,QZ?.²Î [›~C2v¾GÊÛ–äËIÔõBòÄ¢¤™^égŠ2Ò¤=E_7žn%Å(Èé0Ð^·rÌ;]7ìÉÚÆØ(„g“ÓjScfömÑ‹V‚\¥ì¿ƒ¦¢³ ñFzî¦ÌøÄ—ô-’‰ÌŒ¯G,I˜6™ÜíOpªò9€|çk/kï¡KÈU ºñ©$âÅ1h“6/…¦M1Ð6Ük‰èoÙØZŠ3ƒ:kB‚át{ X‹tJÕ[ÀRû (¦D– µçÎ4€rM]¾Aª.ƒ:bŸüÊsá;ßÄ,› ߊབrp ”;$)ô)BR(Ë ˜ü‡¸ þ$„žûìŃ1\[ló*VÊ/eB“uy®¯"áàw5ëÁ$jô ˶Ä(†áî,!µd4ŒUuÔšçq83­j†¾g±Ô¸¹†[‰Bé f½TÁ¸¸znçͽè¬ÓB¹½w“Ðã¬ÐÏ Ø»c#ëŽÓ•ç©¸.u?‘+¹(ý"=1‘JŒ³›if’…mgĤú)DlÏáΆiغ3%Wò'´IÂq'm1]tKR[y=ú*pRXΦl:\n _.r5鱺Œׯ?h®föØÎm9'V,êýðŠü>)#‘ìô‚Ú½}½ÛsÑ˸‚Ø`Í™?”iÓÉ„ l^ >píÅ઺¡¡5ÃË€Ù($žá&¼p±ˆþ£–¡2G{Zçcs³ÏÀ0»eá°=ˆõªõ(Q Î:¶|ÌiäÁxy2=b ´ ”²LBlë°’å1Ç©{3YaŠ°€ F*öjöÝÈøñÔKwIIçSi‘$@m”ùÿ¨EŒåøbG¥„ˆbVåJˆ{Kþ,#Mã¾à—ÁòSŒ<2qýd¹Šî\ÝÂÌ!_htõ¿, ë Z¥'!ôë1–t.0âéÿüåy„‘”͇£ei– q_þ8wbÖl:c»Ã_)äŽ\ù5c·ÕØ 0ÆæC)›Ó[ùP)ó„g5,“,ðº!Åjò²×#„sb¿m4uï–¬½ÕsÝt:>wÝXH%4vœäè¨êáÖéǵÀ=ÇÞ©©ãpÙ‚$ëd·ûGä ÿÿî C Ü­’™ê7T7µŸv†[_ú³Í ›Û ÆádÊÀP^ª ¾¤¥2¸¦a@\W´(ßTªbýº§ÿÍß·RœYÖ0_é˜i#Å D÷ùkå…eÏ…\­/ʵf“,¯‘h,5ù¥c[SÍ”~Ö ÿ“ÛÜDóXiÛ×ÙJ„¡hã.ïçÂ: NÈSNÈq¢–)byj^E§P?6ß £iùO]èOîÑð*FU .#S²C#„ßγ3©Àÿº™PYÝQ:ïðæž0D(±Ds…;’ûµ¶o×9Ï+­m­]>¾Ì¡ Ÿ7\”àþ˜çšüƤDrþå¥`ÁEµ|tP|(äþÜHUŒf¾9t'¬,»xh‰Xp«*ÕTúŒÞéÄ 'ÞÇÌ‚ºœgŠ´yuhĉÂa oæc8~³*Ÿ;d}¦$¹²JU—ëÎÀ/5­éºCܤÄRðr€ÔÚÊü&Ú…+,Ý¢Ám³âN>‹Ûíb¿Ì—1ñXô*xÍ×Vwªe%œ2€ó1ȶ„Qy´)¿h†yÚ寚–ZZ«jè«$ÃÖ¬ð¸c”„µïÉP‘8BÛ˜šØƒÏÍ Œj¶½Oµ6;õ+P.Ï3ƇaØì’P§‹ïßçíc[þ²ViÍCá­¯jƬ c ñÉ…°ö5ÞaÛhΓ7øt|ÖxÜ%®¶3½™ätpK–®AµCøÜGÈý-îðg¶èpŸ¹Y&Kjì@ãÜŸ“«à6Y¡ñåtW€©+C‘%'G\?on"#iË”iâ‘ì±ýÂ\ÿÇþJªS×ü)ÄÖc»†2î‚{2:±Æ‹!"0¾Yj#§È†‚5ò¹> †o­éShµÉ½@us•pNøà Ó¶íŠTS*KdÙØß’ÆWšyï—L¹çv5p»ŽÍ“ÿ°±ä<ê_³ÄJ[ƒfAã_ÊPƒ‰}37½ä§¯Ï©oGæø”š]š·kê€î×Ñô ÐßCeÁý1=áùÏäo.»Er>8Xp+Yó°¾WZå ³üPrË ísâ΋}ò¬CCýöœµòÐúªÿR+¡†¼êzù"L­‘Ä9"{Í|UN™zìmüõä‘W•ßWÐ2ºM—ÄcÏ+x9]hë³[–˜º%,†‰ÒJ&päh[jªfn OsÔ6‡£ÊX2jǺå'PäãÎÛ:ym]ÊÆ“ª† wýÜÿD>tŸW©“ø˜ø~dHlÍ*܃ïÚà–m o©Hʽ>B؇&HúJ'ŽhÎ_lr¿«¯ ¤G¿'jJ˜b- endstream endobj 1974 0 obj << /Length1 1720 /Length2 8450 /Length3 0 /Length 9528 /Filter /FlateDecode >> stream xÚ·P”m6ŒˆtIÇÒ K7HJw÷ ,±K,]Ò]‚¤4RRÒ ’‚ HI7Jw·ø­Oú¼ÿ?ó}sÏì}g^Ç×Ì2ÒjêpJÛÀ¬À 0(œ“‡ ( UÓÑá€@>. ƒ‘Qwÿ-Ç`Ô»¹C`PÑß,dÝÀ 8B&‚# Õ`P€²‡€‡À#(Ê#$ x@‘¿ an¢9'Ä ÆP†AÁ07ˆ=‘çïO‹5+€GDDˆãw€´3Ø b ‚Ô@p{°3"£5È  ³†€á>ÿ Á"n‡»ˆrs{yyqœÝ¹`nv’¬/Ü  v»y‚m¿(ÔAÎ࿨qa0tí!î*t`¶p/€8A¬ÁPw„‹Ôì@dè(©4\ÀÐ?Uÿ4àüUÏ?áþòþýÃdm svA} P;€-Ä ÐPPå‚{Ã9 ¨Í/C“; áòAœ@Vƒ?Ž(Hk@†ñs·vƒ¸ÀݹÜ!N¿8rÿ ƒ(³<ÔFæì †ÂÝ1~Oâ¶FÔ݇û¯æ:Ba^P¿¿‘-jcû‹†‡ ·âêV’ûË!ÂøWf†€@ 0v€½­í¹%Ðõqÿ¡äù%Fpðs¹l4À[0â…áçòànà¿ßÿE<<ˆ5`¶ƒ@1þŽƒmÿĈþ»A¼&@Äøñ€¿ž¾Ìfƒ:ùükþG‹¹ÕŸÉ«±ÿEù¥Œ ÌàÇ)ÈàäDDDB"€€ÿ†ù§“ÿCª ‚üu¸ß*Ama‘?9 Š÷7Ï¿ƒå¯­aü7ƒ: 1Î`Ë¿Óo Z#~xþŸwà—ÿ¿Ñÿåÿ:ýÿ{"'§?ô,üô gˆ“Ï_ˆqö€#VC †Xèÿš€ÿÜg5° ÄÃùµJpbE¤¡vNÿâ®ñÛhBàÖöNÑß}@„w‚@Áš0wȯÀÉþ±tÖŽˆ[ÅÑ­?T`ÄNý7¥<Ôfókùx 771a¼?Ä–Ú€½ÿn7G¸ô¶07Œ_=pËüý‰„Ürÿ !>·Ò?H˜À­ý/âpëþƒD„Ü ‘€Ûúô‹·ÍoÀ þ "ÂÚþ9í~ƒˆ4ö¿A7ä7ˆ8¼Ão‘×ù_ˆØ nèo‘öDäuùò#"¹ æöÛAy¹Ý~ƒˆÜî¿A„ü7ˆ¨€Çð?í±öpsCÜ]¬¢wã?.J0Øl1;³ s¨ k»ª•¦ðâ\ÿ‚¶¼ÚdÔ%gšÎ÷³W}”õlÜUÆÒ¦Št0]s¦Þ%Tcä" íÂfr Ûº]5ñ-®ßW4Ìù«ä•‚¥tÿÕ!&_Ø)/ð™’/8ƒ?ôÛÅððä"JÅó~ɺéÊ7Fàœ<ÅüÕâÀó8Þh+oâÚÆÝ¢§ߟfø>¶ '^ ™5[:E2q`Y=XhÓ®^ Ë¬|µõ^ޘбwt²n—ÕÖ1^¬˜¢„[ ýGÎók0)ª(Å™É _Dj‹¬id= ¸aø–½f·SÝ\h9˃:z¾8Ö¶æl³sÀ¨.\öîâ·&ØÖ>…àr ÊÊhÉÜãñÂ5DoÙtÚµMýÐj½ J; ¢º¯ƒ²jAQ†n½nw±O?¢2•UýÔï 1ûó#ëÆ{ŸGn!ì9m®‹œïä!8µâïÞ¦nO9Œ(„Kg°_» éÏ°ÖwY~Ð —ô—³Þ3"ÞÙõÄþ‚ó“½ÝëÛìÜ–Gý“^Ú€•`-¨ÚñuJÊ^’‡H›RI#RkhEs”ƒrYÖã~Ûk›`Q~G§F÷ñÜ€ þÇ%7) !§ñ?C(lí¼é?{ 3&ëZTÑiNyÝèR‚EÊ}!,¬¡ñRTª¤‘m×T/ 'S¿98–Û3rИ¤±`×÷>Õ! C<Ŧä…ÈVŸ›–|1Ðè6m©äܶ´¼öÝ›5\ÔO.”áKo–‘•v¬IðÆ_ê<ù^ø’xx˜¸¢^:Õ¢”(›‹Ö5µÂQ”Wóîq§ÝëÁ›v f Kðûšñ\¯}Ç×iY#©DóÆ ùÇCéT6ÔE÷\V2GkÊäÒ¹àÔ<±|Wꔌ3»ƒŸÕè’R¿¦… ÃÍíÎß ñzgºaK}‡òŠ °4o[=6óâRnÊ?sœö”ÜÉ|½@Þ4 ±ý"n!´<•†daÒîZ Ì×gd¾n‚’˜ÍwŠHj†“fäÚtÔŒ“½iTvÌšæøQhB¿Š,ÍGtµÝ¿!º:ÏI˜Úǽñ¡A3z óórG”›4qµ»1%Ì|*þa]’ Ø¢`§}^7¤LâÏK鄼‚ºw±“¤Éÿ†#j™¼èB½T/yFTâÚÑ#ëóÕ©A(kÐÒ7·¾Wðlöâ0Ðìì:(âË)I€Sñ7ÝdªÎZÚF¥CÓù‹]WŒõµÐO(æ ´2¬È)2áËÕD0oÚîXöJŽÆa4Ìmç¾4:u#Ÿðg“˜vGR>‚T¡ìí$º?»$ü™þ"ùõ·ý/àgK7É×çÂú:CÏO…ý„(ß <ÔßãÊl~yå\à6B•´WÀ œp@jâ“$ணùT·/¨PÉÄ™Mû`e+4sÙÆ”úÁ·ýn)ÃxÔÃÍø¨$w c9£ 솯ҵۃ ½uŸ‹fb§°;—š…l=߯8#Þ°¦X¨o}ê_Ñ`vOê°ÅUµƒ–YbZø-%€o¨úuÿDinWrµW謥ÍÂ9™GR¥[AúWsvi6–Q×ÀÇ´®íÒÌǯú'6Œ´¿ ÉóÃ.D§Þ}7Ä©xôÎ6ÒhÛÕaX¾*@ ò¦WFˆÈ߶„ÛAñFŽi L*$ñéÚ“¡€€'µUê#)‚Ç…Ž¡÷(íó­+¤z«€¢ê° ª&x fG{ÿ ‰áËQ­—…Js9–¯šHˆ‹5óê}ñO˃k‘‰ZŠe·®žßmhB–/hæòÄuØÓÖÀ;®ÀF]QpÿQ‘7sm¥éu×(¶í}Dzüù(éؽ/ {Lï°»µÜÚO£"ûò‹’>„îÊ>Kt*g¼Ëœ]Hý ¾¸J‰|BåþÄ茫¯ü‹¿rPNcT³½ì‡Dºg˜p¹œP]©³ò´–âföï—Ñ:ס4hgáûLì?óF=¤Ohûd›»o´úÔ"ïΞɴç’aÙÎ ³Ú"iÍ5Ÿ_lD.›t¢vLðýÏÌ:¤w½bïH"q迤a8dŠ|ç|³~,ò°*÷äòk¿Ÿ~ÅvùUIN‚ܱÎQ=6ùPi^O–•5iñG•ñN?¼v0%E9ÿ—ÛYøæŽÞàMÀ’©ÎGŸ¤À; Cˆc²XÝ씶¶ògŸi‡´q°}[±$ …¬,P£%í`7…@þXø¾µL8¼YàA [Dt·mˆ7~É»¤{ìØubÏÏLÛ×ý‡ ÏÚƒng¿)ìÖç ¤ë˜ Æ«dvœß'8å‘Æï¬ÊNW·2l¢âL]q˵4§#Ä2¦4e V¸gXåþød2]Š¹Øjå§ê¯ð#ÙçŠÑx²ú¸Ñ´/ÈS'°¹šn@îß¼®å½¤Â€S/ãè´A_ÈÄ…pyx†EæË£öYæ@;½h˜P¿®v¤anà¯^ÛTMy‡Ìh/Xº=‡(`áOË®÷x:õ>Í)Íp¤_ãY_qY•Üäúî{¹„´¢‚vnw0—NdÝŽÄÓÌ’E6°Ž4¶0T#òZÞñ_äöN䥻°á8÷ÆzsÉöä_š© ßæxiI³­¡+[íG¾Äš:’¦…2òêÕÒUz«È¸TJn»Ÿ”&#?^ö Ý÷·¯ñuwJמµ¾=pHE‚ÎÜ·¥Èv&©ÎE¨B2êb9ÏK—rÄz+¹\hßæ¯óf%žEI>™”`¿¶ (iøŽ"÷ÁrɧS'Q¸ÌòõÈiV‹[z”Z=ÒT‚ߊ-N—$Û…Zõft;_N7†„”;Yø±Ô‡B †°¤V[(Ö3ä%eä&ͤvE²Cx—TíêÓ-±W"X„Éôã÷%ibU ⥌ o´î~H$G¼ ÙS§’óë6ŠÉâéSg† $’¤«K¹ß'YøX_E}þH©c_dëð‘@½ûP– ÑÊæ#íeº`ãÅíØ»­ø„éýªÏNC–38’ëŠ=O‚SKϵï³?æy…fZb4Ç¥ÞíŠÏ8Ìî›E•kžÎ^Öp?`a%SÙÝÈìw¡ï&ê8u‡F{)9pº 7¸ ô‰“—¦ÐÇuØ»E2k­ëרiªmIh ÐÛ sÖŒyyvÐ^K­…c ¯è؉vÄŒœÜrÌ›,quO¶Jî¦W¾²ËQâx§ÐÌͦÌ; ¾§s0FZž\—]cô¿P!ò¼GWKKmŒtö:V=íÖ¾²}ÎQöÐh·ÁÞ3ú¸{ŒòíÄÞñÄ©R™­šãíÏ¢³î(t Vìc ‘À¼öês®ã‚ûg]©[É8ƒüŒÈÔä0¶Ax况Eë{2Í,㟘>zq2(öåçÌhh"a©èTù¾ (¦&4»‡ÁÀÜÉÇyO² iêâb0 BYtߺˆ<ŽA‰ž‘4W sy|6õýó&4¸B¯QV ƒ3oÓ$¢J6²û^¬Å5g"àn©]—ýD¿Kzî`ÁcG¹@ü~¤¯ý"Y†XÇ;Ü‘ê†ÜV(P»œÉÜ+by.zy®5œ/˜$R~±ŠWПÈó¬¨@R{,åÆŸ²cMpu‹æu¸­è†©œ‚róqå‰Æ´(ï÷\“Wn|Aã®Ï¾÷}µ"§`&’uP—w$´ù(Ï–ÕÄêÜÀ}éÎAÛøg¾f®’VNCOá 5oë²ànccæ–ÛÖ¼*Ôµ††{7;ž‹²E0‘&xƒt„²í3`â5¾Ó†d–NF—ðN.¨s\®2Å;fý HŽØᓽÆòIp 3}RÄpî»t4ãϳ­zuƲÂVºÆ*¡Ø̧78µX'oçW–gÊy@eó/ßKʹ•ñ$o8+GªÑŸ"߆ı܌ÉõrnñŒ’;¨÷vëu.6'½þI=©È¬ª,¦‚aDœÅ›C7-ˆ?Y²îÄ1]]Óƒ^U¡ Ï1û(6G5û}—³«Çj80‚ì1¡—Épp¡T…å´°…'A,*“ç#TµÇWQ„—ƒ–ûsä1¤ ¸£³Bvj0v¯p‹ Mûâ×ÃZ’@1rzø(GgÏ9ÚHÏî;›KÒÈðÕº“áÊ#_f÷$^<ä÷h¨à)-%”-æÞ©êsû¼?ŸÖåc°@ýáÉv,½Ð}zXQC…”@2=AãpàÞC?ðž±*‡*ñ%¡Çp0c3Ó1ºõ ¡ÊmµÇ:þ$úÇáaì“äÚŠ£˜7Éêæýk@yF²ÌoòÃ|çuñJÑf2 z£ÒÖò­ ŒŒ³’øYË‘1ÊjWÃÍ—ún=…À™ó"Š¾YGÛÄbf TŒ/ y¥(D3@ÙÅì1&í4¹E´z\ë:­è2LÐ…ôÖ>Pâžgû@Lx鲈€GliÏasÖúMcÍ(,¾¿zCà3jFgUeO°»ÓK4»®Ã¦¥ óÎÝØ“OLÇål rF‚©!³[Ëæ•ëmñ«vzòº™üƒ5ØûÚ²dÖe&­FR]‹hþ/ÔÚtŠ+$FX&cMQS:å‚?æÌã -wdö8éëxìâ‡ÊÐrùjgE 3Ý0Q^êí« .î²ÞÊ äGikÊìå¡n|=CüÃ6Ë2¦J™µsòöí‘Ž«›µÚ[%o,ß‘?ˆH xƒDmZ  ½”©wÏÙF–™5“}cçëzk,Ôz̾MžB›Þ©<~´CÒ÷ÚÌÍ–CR–ÛŸvûmv9‡Æ’\(–¬k‚äôè!é7–ì°ô£Œ·? ÚáQËüåW¤L C¨#NÏSÍK‰I&™Ÿ³RéJil›Îk7¹Çû´ó¬‹Š”mÔÂQ4sWR¨gx Éío°kÝ;R­ºJ“¥Ãæ~jVû Jp Ò/‹ÃÏt}k¥ýÞ²YÙE{šðƒÎFÄpÿìHTøõ•LF$gÇ·ï}7˜_"ŒÃ:uÍL­ÜdׯVWǼùw%/œ¡·œ$ÒÏI)ÆPüèWv*Gv/+ Uày§.• éQñöGE·Û ¶Ó {ËŸi‘ñ”;(±ÀÈÞ4ûMw`Áš×daƒýå(~U@g`÷Påm¯åîQ«Î½Y¥q×ÄÌÖù γy!À“¯xÛQŽŽ-ü§1« VôÔðN<Õ9G/#ÜMÃp%YˆÄŒëC»±cµ>ÕäÙÂ^$»ögDÛFCÆ'³•„H$.èÑêÙ£ßÄÓ®MwPƒÎMò–É3KzXºîÂÍÌ_ò’»òèb%¡Qøø 9×Öõè„‹»KÓ¿6Ö›JD9WûTíþéKþbŽ oDÃÌG¹÷»Vú%þÒNãû¡Èˆøg¦ÏŸÔš¾[û¼WàÁ„œ4S{[²°(k˜ âÉÈì$)ðDEKvèÌŒ‡ã*8¦íä þ¼áöø=R¢¹ãéEPk.¡ÎCz,†GÐöÒOT;vÎÄ!1#í—Oÿ©ðÎíð‘áˆüOôÖÝ”æÆúÍ2cM49,®Çª‡s¼„FGKÊp¹Å"œ‰¾‡ègqƒ·ŒÄ°¹¤6ó‹TÖQ‰÷ۚà \*ÆM›±8_ h %RÕÈ¡¯Û“gê¥j)A¢ÞÚs:ÒW~ÇÛÆg™“¡¬&dÇ ¥|ñcŠl÷ˆ5§ê›Df  ó Ù…òz%À8ˆßcR>ÝdÓ^*㈴ÝV!Æ°ÿ¥bw“Kï ^q®ÜPØÕ¢iÈÌc³'þºB^Ïk´«7°v­Œ9dÜÖdze»vpT˜À4“·¯íÕw(œ_þdâñ”ª}½<ßESHeßTÃÆ^³Þ#GNÏÄ3þ)è^ª¾åè¶.j&dbŸŸNûõŠZlÚ×öRž7·Ì°•p%Lúhì’u­,&9á辶`.ÜmY71TýP•ÂußÑbÍ-÷™ô-ÖbÎþd'nŽÞg ×Ü3CöåYå73fªRðHÛNöœ7DÅh Û¥GíÃöB©8e~þ ¤ôþ,wÏŠhé×I˜öêÇ!ŠÉz¤véö2#”ƒŒïÑ•0ÞµTÃ7>lˆ£{kj•R/šb/C|ù ½ N\i§‰¦õSŸÅ„ÃÀ†5ÊÁ%LÏTTé›= ÄîU&tG<3,zo‹‚Ž¶;¦¬PìQæ]³ùž?åˆ@–q÷Ìh»Úá™ßå8ž®>­øq\»1x?QvYKBÊD§k‚úxÄU6*]¬H5çSÖCwúü›Žg6wW.6cP">š áX,™qþ˜xlßx‹€9|¤‰òG­``±¨]Û‡â>’ ÙGc¤!Ñ'5 =»ÅÁ_œ XÛCwT% ¼;AàJ¾ù“je׺LO†¥âÔŽ·Xá¹`ÑJ¦•þ1WúÀ.û¦*%C*íaº`hKÞ ÞØÆ×ÑO«Êaªõ$Ü”mk´–6\®cò§¦‰Â¶TÄ>]Öž×i!©0}ÃÜ\¿yaÈó0~¢ +ŸÞ –…ÿ 0fÏu…Ô…Ö뾨EU=‡´½Óìà}SÔæJDï5mºË¥bó¥¥qËíÜz¾"íW!ÀTñ3k$áu ŸM8þôf¶‘`ó)Qh> ¤æ)‹°V«4ƒ+¡rëä†UêžjÇój  W–üŠƒÉļÊ‚w›É®%lxÞÓÆ^Émˆ ì Õ‹A¿òΫ*“ICïG{ôÚ­N\Î)ùÅ(…“{Ãæh p>s¢–l…dZ¡úAøŽ¾ÁÈ3¸¢ý Ã2QX™ÝGÝT ìOÒ°åó0—õÙ‡<êèL j9á¬H.”~þbØãÖõw—-Ã[_‘áTòä“6Kšv_£‹`Ùk1±:‘w£ ›¨ÙoIòÑrÚ „|"¾»±ÿA D3ôŠ ?%äe™§'pÙÚ¢ô‹ÇÙõ·Êh·ö è­¹˜ÆÑãKb–Akä;SiÇÇh‹c g…¦~n8sÞÕ3P½.¯+p5¸üÌ !Ý&­€Ð‹—STñó´ô¤‹áDÒ}Ç5v!,”òy}®¶ðÛíÁ>[OšŸò_gãPâœ÷­Çç ,ÖîÔûnOX{† ¾µvP².êp±nhá^‡iÚÔQdÌ ±ËÄã*f…3ô¿› a&+£t!$gõ‘Ýág+MÑåÔß> stream xÚµTTß6,RÒ tÝ0CƒtI£tÃ0ÌÀ 00€4Ý’Ò ÒÝÝ‚ÒÒ)]R ¼è¯ÿß·Öû®»ÖÜûìýì}ÎÞçÙg˜éŸjsËX!,¡ŠnP §®­ ü<@ 63³ÜÅú—›YŠt†#ÄþÅCBÁ.w6y°ËQáPqµ€ø !1°àEÿ""byð ¸@ ‚p€:c3Ë!=pk—»uþú°AØ QQa®ßá{(;ÔÁ.6Pû»!`;€6‡ºxü'›¸‹‹£/¯››ØÞ™´–dç¸Á]lZPg(òÔ ð«d€Øúgi<Ø̸ómÌÅ Œ„î vpÔÁù.ÄÕÁ ŠÜ­ÐVVh:Bþ «ýAàüÙˆôwº?£%‚;üC {G°ƒÜÁƒÛAšŠj<.î.\°ƒÕ/"ØÎq~†Û-ï¿·(Ê<€ï*ü³>gîèâÌã ·ûU#ï¯4wmVp°’CØÛC\œ±íOŽ„BîúîÁûçá>w@¸9xý…`p+د2¬\yuàN®Peù?9w&ìlÖP€   N¨;Ć÷×:ŽÐßNÐ/ó] >^ŽGì® ¨½{a{9ƒ_@.HW¨×¿ÿEØ À qXB­áØÿd¿3Caà»óGÂÝÆÀ;ùÀ_Ïß_¦w ³B8ØyüCÿ}ļZ²úšFŠœ–ü·SVáðâpó ¢ü¢á;àóß47à¯â[Ÿ‚ánøOBe úG wÍû«Ž ƒíÏ©aüw Äœ¡¶ÔoBî~@ÿÏ3ð;äÿOú¿²ü_Õÿ¿;Rtµ³ûígûƒðÿñƒíáv2îäìêr7ꈻqø_ª>ôyV‡ZÁ]íÿ׫ì¾k»¿ wV„»C­žÂ] 6¨è¯s¸Kow€>E8ÃÝ8nø?¾»¡ƒ<¿»UœïNë· z7Sÿ]RÁ‚°ú5||‚B0 öÀÞ)ŒOPປR+¨ûoqxy.w!€»ò|0û×™ xe™þ@"^ù¿‘0ÀûäÄàUþ‰ðÝéð$àÕýýªƒ×ê_ð.ô_ðŽ ÿÞ©”×Éq×ñßý›ð"ÿï‚œÿ…¼®¿áºqE"ﮊߊ½kÕ_ø÷½…ºC!Ø3SÈãW¶•¯š/Êe¨Ü¸×‡1—[ƒ£ {‚]X¦3¼lÔ0“ŸŒ9ÉZX•%<ýRøftÊ›ŠcÿbÄݤã½ÿB¼RºË=…žUÙCîÌË“k(­‚Òú“pBð*ÑAô3 c4cÖXý©Ÿ¯…;ù7K7r®[7Dwö€¼3Búx*—p™´Öû¡†ôLË.ƒ†&„‘Ɖ®:ʺŸ®ï‡Â#Îe›Ã(.=V#’ççûß÷ö$ðg©v• •¼yDAì©BŸ6ÓGAý^¥Îù‹¬à™\‘ᓉõ¼×iíÔ=ÿǨ}©Ò[¤cêŠb;èc‘Ï´}Ïß::7•·¤bö¾Wd’ŒšÑˆë«]zw^¤ôi f…=±5L4ŠÌÒ‰y´G—ݹW[­äîU`ðÈ!ЩÍ¿7ªi{œq:ûêÍšwÜçÓý%ÖûÙÁŒ·y„ØÞZ=fË-ä—´ þZÛiwú}/îA«olâ\€R~E9hH=«š½gèÁ²}I|’×a|º<ÆŸÆž”E á×/¶‹ÖÅ'\R?í§1¶Ô´(ýªËÑ^WÝÌI%sܙﳞN¡Ï¬° ,Ð $ -ÔÕ/ú@7J»š=­TQ´3ê ñ¯‰õeH¥>Ü<è±Æ‚­Ñ+=DÞa]vAöé1cÔÎ[½Uß›=#²à"8¥‰žÞ&uF^EX¾áÍׇGs~Ÿ""%¶^lÒƒHÚcŸêÀ9g`§jÅòUAÌ•Ý×1kÃÙ9Œ¾ô ʳá=6ðÔ³,VòêcU,gŒÉêT¬ KÛ8Ï”`*9Šö¯Åí÷ƒ ˜hñ;÷•Db§äc¡[Ì-÷‘sçmew®‹ˆOM-™¯¾”IÄEu2j¥òÆ™+Þì^&F.&­ !{§t*R¾@¨ŽÍG$Nü÷®Ã^×í<ÈKm"+Âa´Ã®©+üXÜ  ÎÊXKŽ0ØF_ÇÔ_'ÝÖr*¯ßD+é÷/aùžmv•Àe¨Úílã{[ixj‘ÿf«ýÒ¯¶ @ULºåÍ­ZD7aÚZtËØŸëîyÒJye£ðÊ–L ÷ÇÞÈücÂ{òI«€„ræ'xò•+Œ"Œ8‡-s"Æ‚LÝ<¾"žmÁ0+³jå­ˆço¶³¿®Ö¾oËVUìÖÁe\zi±Iæ,[-jvú8aðµº`b ^³Iƒy=Y(¬?ðûCé¯ÃsídHûw_82s@zDUþ-‹– 0©tNüT¦øªçZ[ŽòdBãep¥tDa9àh`,]¼<@àlý¥o¸åó®Ýzz´ù-÷‰ˆ‘È ÙH4, &üôLx_& –\ÑXø¡è†N‰\ø¨M3ÝŽÕÃÐLoóÃïmúc¦ý‰ëæVÆ{Evšó ×ÌÖl{”Çâ±yLb‰ûeüÃ*cVJ\¡hæ3}uÁµr>—¢“H#:ì‡6´äÕe HÇÂ}¿ª' ñ…c´ñª¾ŽkOŽõ¢ð¡ñ´çn¬)’sæ¥÷|±ˆÃ*ó±V©œ¶x2”(ñ$Ì£ì?‚ê‚Ñl0ÇŠ˜ÉƒñÙ”0©\íì=ý>±]¼ f3Û[wn§ _B'osolè$É›÷ʘJ®—7àš¬Lå®ï]X[sÇ{žÉrhk8—`ŠÛõÏ$†[̺¯ã<ª©Ä!婤(ÙzÓÔ`šæãµ4$(r¼¼×shæëݳ/?ïäëzjeCÌzÛJȼ§F… øD+;pE1oÉA­-„Ü¥ä“÷{ÇÉ^PÎþö¡Ë”5ÊŸt,M#ÃÞ‚ çFñ&Jγxó<>o»êb·gò’QY]w!&/£:iŶ7—ûµ£Ý,`’$C»·¨éV±….Vºï˜e½š€{‡o:Õé#Q«C±fëž–3hà®yî—Pºîú¢ƒqWŽIid –5bö¾®]Yå³5=Ž »WqyžÂÔ—r£ÖûDÍÄÞ¢ÒÄMØ—¥Ì,;?¢x¯È²O~Oæ¿Y)<8ÃôÆ_¯_½XtG§‰¬A™_³RÇyðbËqqïê¨më†Ñ£Í®%—§«ùÓ½ëÖx‚ï°äQ“ÊÜ&õrj4Íï\ð¼f òmYô"ï²—ºQ_ Å­â(ñsS¥Ûf?ÎK¾7ŸaŒ= Ø:ábsc$H³¼TQS¿ÖUƒóhþÐj»³\—¦’سã,,f-2ëŠ;èw[…p‹Ÿ7©H¶­!£'‘ܽ䫟Wr§3Î'ì€nñ7 Øî•gôˆ‘Ùf 6⼤Ú/k·ý Íu$$^eý4_rn®ÃßF»_ôqÖ‘/i•ù_\ÑÒk§ÈžRY7@ôÆ„›xSŠšiÒ–µp®|±JœÄÙº}ØEœ£2I“'¤ÜZÞ²þð¥ñn—tU†¸íáÈ3®×A‰6:j‘ɦñ;ŸÐãx‚_ë㣙è?ÓòÖ,+4øPs¦sÕyrJ༦nœövT¹ ×mù1©ö ‚c&±˜qmjf±û˾@‹Pæ<°¸¨™åt-ŒMs`8¡ïÒ$Ç^ aÒ®é âk¹Zâ¾×÷Ü@u¶’ gŒK;*}í(a‰~¼7,jÌ(T‡:Û»é_.³õ³eþ}`SúžðŠåñ"ËË·²*Ûy…5–_t`4µƒ]Óëˆ4yúó lö ‡õ<5‡÷§˜N1²é轧Ž¶§–Þña½YIñ¢€ (Ç›zä_ª·‡ZïñåÒö=‡“G¥oO2Ùaá…ƒ\Ûöé¬ò+ ”ŒXjRbî‘ q”Ю÷Õ«Æ^hœä¾iH¡Ÿ÷Ü'8¼/Œ)“‡0ò«<ŨÉH)¦1\¬biVà¯yõ¢ò”‰‘>ƒ¬*ÅƤÐ=wž4×y„±Næ 6IÛ‹lÜcÓ(! ÙI3!b–,Ô椽r¥o#<䵫9ÁÚǬ´šä,ÎÜ@—"–8­ jÈ +ÅäèÍFÂç`¿ü„±ÌäY.j¬wŽÆší_(&KÓ|WI4ô…Hj‰x”R,i‹jº™ü„ 1ɯÚI5ÌjewMÏ>Z´Œ(Éïxžð1[ç-””P 6ž“’©Õ=¶ZŸe6Q?¨ýL†â2-pË—Q«ª¢š1"ó– Ô»%šˆ™ìPÍý›tª¯ò¦DFË,Éù÷K°=Ù‚ßÇ' g¹E¿šO i¿ªÉ\A€t1+ÆK& ˆPŒ†òQùŸëƒºð=wrh¼ˆ°?Lu(Ša†n>ˆX죈ɿb|Wì•Àj6áÁ`ÕßsòV†ÐùÄU² ˜.~0\ tþ©jÐOt®ò§“5Qé\8Ü\d/}ÊÂ[µ¶ßZNVŠ3ÉOлÉÒm3ï¥|^­•¦ÐmÌåd<@r9sÈ´¯K°¸¼€t§Z•,©-N_Úã-ØX°ÁÀhP¶×},f…Á|âfܤm”èÙÌþ÷ˆvxåc¥rK)H‹ÙŽÞdÇ´TJÙH@¹$/ˆRøæ@Û{UâígYê ï‘;â:©OM¹}+rž¤Ïd=wÔ®Að7:ØU-)¨œÌú{)Và ¢%RÚ ­!°Ûä——gtóø9¥`åiëo¯&⃑ì_oRÐ̽:8ll¦®™Vé¾·í²éØáJ=e¤ìx«Ý!ÿš_Ÿ6™ÿ ÌÝ+ùäõ{k‹LœŸ£¯c³†³ó’½‘sˆ˜” ¾úOü'ö2¸ÅÖ’aõÙ¤÷šV°ˆá +ÛJ;?dÇÕ4Ærü:‡‡<¢(ôÓd7”øbÂê² DÑ:µ,Ó}8¨7{M+ÈÊ"^p‰;N{y_§Høí¡`Õ í¨Ø»$??¥l|™£áâ±hæ-"îAû-ºôÓ֠҇ݦhÛc[+â·A³”áó‡iŽ©÷o‚ Å˜ä€rWhÜoBÔè Ò+|õ Ùôa$¬!3ÐáØÑ2ïÄŠ˜.4ÜãHÛCƒR¥e–ûŸ‰“748:ÚúéF"[² ðˆ^Z¢•$dª‹Õmw› ãhK¿‹¦ûrh‚oùî‚®úZËÜÐð'{›t§€VÏSâîë[¿vH~_JEÙµræúO1éw3´O8AÓùAsx8FæéjmèBÌÔjªãVø¹çX²N/ΰ¯a0XÕ•Ô¡#FòÙó  j¢Ñ&‚“MÉçïk§ô“ú °•YÇÄÞà®~¤#AŽª‚‰ooﵜ/—w³ùÏË´S€÷lx…ÅÏ×]Mk5‰ÉÇ%q*^=G·ãõïAh[R° O#×NÑƬtÈjáÃäÙÅ•Žæ—g 7=mù¢Ÿ}3 7^5}ÔØ}k+Ûçh**MªÚuÁVOmØ~ÂÔ£<’õÎáµ {Ÿ0 ûÒJ­þýºì¥‘¾Pç­ät÷ù(2.²É郢,*ÛSƒ¤ýK|¿ür#úc³H~g« ô¹BæøÈ숃ÈBµ«ÍÍ×W??nƒZ—Ë$£²¬8Ú’>ou`}ø>"çlz5¤e±Ø]ONãP.d 6¯*oVž§F:(²›5™°ä ªÆ'ÍäK>Hüfu¼fÄ-ˆ²ˆ÷óóýWÎz¯]¶ü…Єµ7¯Êú]Ѿt¬Í~û¹C­zO™Ì)YÄ°¾P!7®Çå ³EÈ°y¾Sõç¶)@¹ŸÃíóÌ ïúç"eš3¯êæןŽàa«Ï¤¾îTÜVîõ˜ÍÂÆLf׳ê 3¿†¤M~Õ OøšPRT7ØT-¤ëEÃV[0 Lu)p $ü;X1Y¬QáÞ½±˜V^ù8ÿ›ß:ðës?ZR°"åÇx¤û`$4û#Ùûs—*öôDiR ½à«•¹>®þAÀGlõ J¢î Ç^¦F;¦HcyøЇdêdöBøš‡¬¥à©c/ú/ö®-oäîAÀSá–Ïèj‘±F>A÷~lÁiP©{á˜ÎÀ^;‹j½rÁ%Ò(yBTXá[…ÃÇ%Ôb«±:„úbj~Õ$Ì-œaRÛqu[Kí•“Ì/Ò¼0¦4…k4ä&ëoFYçÅ^˜ó)É¢ûÞœ3úàÛ_ƒ¦æñ‰åR@çF®JU਱¼Â&<5‹/‹2㆑ *òüh»Â…æX+Jº(Åàf‰#«^oÃßÎ.kx¼Á¶ Àì'p&#Ç ž[ºÄí²‡ês€ã>­ø$T‚ß{ŸÜ»Ê..É §1IÝ]ñ¹þ¸Nõ`¹ªÖá饄<#D›rk.½;íÜ]Þ˜{ašRÖoô2³# €¦é 5Ž’e {­#òÐx³Az©ô¨fÉmƒ§Ôô¹`×t‰þUrŒùÀm]Ô5J¼yÂÊ€÷°œh&Rèµ¥À‰òVO™Ì$@¸ù{õpîÚ »ó,œ-8ÏÚi6n§¼¤¡÷Fã§ÂôžyŽM5Æeb&Dê¤&è¡ãª"P˜¡¹"çˆQ¯È÷ähÃ5 VÊœ!Å[3t¤]ÏçR$ßÄãœÆ:ê>¹O=Á€–Œ[û{r“4l™#aD®ÿ‡ÉùÃT7Z€m%¦Òsr”ûÂÓãWPÃ.¬w/¹vr…Ñ•pD¾™hI> s_kÈ8M¾MñW±ÒëÑäæšÁä{ÊÎp!6ÖõTh›îÑÆÌhv†ßB²6·D/Á潤 ª Ä nI2d¶”óVjoÏ}á·:)ð¶J®/ñSñÀëD~ÑŽ³ïÖ.ï–Ï€ÖJ°%éýíuRóÏjôoß6:«Ì ‡Ðv]3È‹BÛ¨…Ç]]æÆ‘n28}‚™%¨S” ¼¦66Ú4GûˆSM8Ô<¼5–`:2Oµ²‚úÅ„)ô€è gêÆ@²ëÃfòÈ¥Ì:$Ïs¦‡tóð› ÞÕ„Ø3ÙòY©¸ï[‹äÐB ¦ƒÒ>í¼]?7O´‰´Ÿ›,D´âÔ&$ÄÞ"gFNñÝj=‡¥hSK‰Î*‰¸pùÁöCß8S>¢ñŸ%Ïžß¿gð¡XbVvÖÇ«„”œҳ› øÙ™>AI#wÐUù½·=D´Ö96=IßcäÝAäöê°ßƇƒMR››˜¯Ä#;F#RÛ`xÓ˜†›-]’‰‚k5'Ðz{q 0@2CtkqL¬q>*Ÿvõ­~JT ~ÀÞ?µê¦Ø•*Ï,õ[Ã+Ý’f:™U\»¸;p†itVÊLÆ`‚U#î)?ϧØ}jží{d ÑdÉýxœ<ÑÎÁ‘sq‹7բżZbC!ly÷×6ŽjM+dTSýwE“ê?K^6·Wwâ—¬òrÚ$QP‰†œË6“¬µ¢ieá×?ɇ[k~ O˪e›v~?M ÆxR@¥ lCyØ N¿· ¥ÿr½š:äB4'æxáF«p( ž“‘ÁôÔ L3M‘=.´¿³½ÔgRÎüµŽâ5­™€ê!c ¥•Œ®m»ÀEŸŽg=ÛCâçþR±›"âœ21Õ$ÚFÆb\¨I7ý9YR‰?¨~åƒõî#T}f#­¤>ŽòÁc Êäá–¥*Ó¤ã3G‘" ßÂ’Q'*ÂÄåÌ®¬º”•dÜ ‰¼E(ZÖn …æºp&ïþjã;é“_&•±þð—¯]'‘£ –ˆ%taLJ´:ÅevPª>Î0"Ïn°P|î›1'l‹óÀÕülÅ.TÂŒAc‡dŠ< „÷O}#ƉZÕ3ºA)bH,M§ÊMcÜl$Ñmäê“àrÓ81.5 H¿{¡ø­âxÐ’/øG¼|Ê28ƒPkû?òaõ endstream endobj 1978 0 obj << /Length1 1467 /Length2 6478 /Length3 0 /Length 7466 /Filter /FlateDecode >> stream xÚx8ÛmÛ¾ÚÔVÔµgBí½©­(U4"!D‚Ħö¬Ú{–Ú£¨Q[kÖ^U«x¬R«Š¢Jû¥ãyß÷yÿÿãø¾#Ç‘üîóZ÷y_çu'G¸9Œî «Ø£ì š($F$”¨éßµ@ ¸(FÊÍm Ç  ã¤ÜæPw4…”ý5w(ƒÅÔÁ¬£> ¸ã€Ä IY”,eþvD¹ËÔÁžp{€¾à E“r«¡\}ÜáŽl¿|~HFFJèW8@Åꇀ‘}0Æê‚­#wQ8ãó|òŽŒ«¬¨¨———Ø-‚rwPäxÁ1Ž(êî µü¤ 0»@ÿP!å˜:ÂÑ¿ wQ0ŒØ À8ŠDcC<öPw¶:எÀЊüí¬÷ÛAðçp пÒý‰þ™Žü †@P.®`¤é€ÁP€¡¦žÆ##í:‚h6ì †#ÀvX‡_[4UŒ`,Ã?üÐw¸+-‚†#~rý™{ÌH{5”‹ ‰A“þÜŸ:Ü Áž»èŸæ:#Q^H¿¿W08Òö“†½‡«¨îæÕQÿヅHÿ9@1  Œ¤¤u@½!Ž¢? ˜ú¸BÁX~®(W K‡A±¤~h°'€q÷€øý§áŸ+R`‡`vP8’ôßÙ±0ö{í¿;Ü`ÄÊþ|ýëÉ«0{áóo÷_-ÕÐз45üCù_FUU”7ÀOXL ,# €@ I€”” àŸyþu³ÿ…áv÷u0@æ7 ìéýMÄó2øþŒ ?àŸ PX=C|ÿ–ÿ ‚}ýŸ‡àWÈÿOû?³ü¯òÿïiz ¿ì|¿þ;ØŽðùãÕ³;ú(ì„ ÿÛõô÷@ëCíá.ÿmÕÁ€±3¢‚tÀê\t[xû7Gk½¡öFp Äñ·–þn¶Ž„¡ÐðŸ÷6 ü/vô ÎØ»mÙ/;Yÿ¬«„ ìŽ ˜„$ìîö!Å*»’ø°³jõþ%q€¨…Á†°0”;éÏÆ‚€’Q;°ûOô †ÜÁ( Ãü,þþÝ×áX{ÆÐßÐ?öñpwÇŽï/a7þ÷ú×]…zC!¤óïP¹0§aíçµ*Ì^›£„+«Ñ –}QžÙ§~ŽzDYZSnªí«o§Í•GL¾óg88ó~ð:'x9M;ƒ£Ñ·®z(\0øõøµ”ÍÅä0.•½Ný)ј•ò¡¾oò½w—áRÝâ[Ï?]u¢·îËì\%§Ti̘'*y»¸-9¸V1C–¨âhÜ­2Zœ8¼¦n¼OU·~ݸû+M‚û¡¨±n~ç}LJ¥¼w0·àM» —Ûª–SÁ‡Rï–óU¿›ÚÒ–=z{ò-îËÖIã§| •ú¨ûˆè”®©ÀuÛg#¬÷ûãX2^Mìõtð¦nyk7^œâÒÚ iÉp†#*›â%ZÕ–úé¢Í¬úÁzí'ÍÄîÝ#°¦“¯d «3¹ÛÁ®6ÛŸ\¿U¸©ªh(yçÂeÄ׫õƒxdüðÉ¢ÌÕÉ¿HÓƒ'CÄÞ!EpaM¤%ÝúÂ]+®ÇÍ1ÔõZ®‡§=,K´­u,¢w|!gxÅ!šÒß<Äßÿ%ja(ùÆGÕUwðhwËúž³zˆ~ a”åí•ÒãˆfêBËø™‘B #C½+±u[±–ëÕ-å(íT?Rƒ÷ãÁÞ®vFÿ6ùùéÅ=vV“,”£’ýÌ–øiÜ“o<)ëvÍôõ¨qMAÏÙ4óì>—TF"ÈÕέ%Å‹Ý|Äa,ž°T¨ lüfŽþî>{}ÀB‰"°ÅyPmhRõÁºÂ%bƒê-¼4L·Âpp*ŽCçzì‹é߶n~1¡þn‹™¾'—Ù5ò9cÀC™ïVF`¤”vúºÙÓ?ÿõ/_ŒÀ⛚e¼ÔÎcioü*f¢¢)L’ö=•²îê5¹zŽóå‰ïäj­C7BÍQõé‹ž­y{IJÝõ)ìr)9u Ãï…Âú×K+;pV~mJÍb˜4Ù'ð4QK+ÆÏ1Vw$e¤˜V¶Ê Ρìp¦¡bCl©èœÙàVÔgzÍgÑ–Øë jû:óAÎÄC½¿%°Å ïÝ23Ò©‡ù鎕¢™ÂÉF-kÚ öE÷<_Ç[´|›ckÖã6,PÞÍÔH¦‘_6â»ólx1Ð3qF¨Ÿ«ÓѬT_é¤~Wi5ÙUà]˜”'Å,ƒÂ¢°®E™¬\d$as(žmºY/ k0ù—D†¶ò‡5W¥¦?LqS„“„i‘]$™ø>£=>†}ô‹œ°¡Vw|"¿Qè—™¹¦š:¼ó.àâUÿ|Z Æ«vì³¼Vk;ð|ú¹²5„M:¹É$åÆÊøášnÔåmgC†ýï•ÊïÌIeïBKF(ÇË œqßf PH»áY-pî]¼›Ûž~€j ±™åzÉ»y|dM-Hßx‰ná {-š°¶fßÅaºÙ&?Æ]­:˜Ÿ¨_¥î¸ËY ¿zéaƒs7šTEâ(SRUz±Ð¹˜iºN\_7ÞÎ>yVNk-J8*à5Ù?¨œ?&ø˜% NqíªsE.®7Lÿ5ãWAnP‚óÉ‘ýµâãa§evÕ ˆ>dc³Ê|acl ´ \že}²­4#D†»d‡)@$g8RI&þ0Œòì¶-%4ù8R/“p`ƒg´ÏaìzFò:ù¬Å]ò¬ýµ\qýý´í®þ Ï96g2ê8úFí$W9&õÁÙu@²ã>(gBöÐ$̺j)ÛÎWKM‰“;ĺTìű]—6*ùd¸ØÄh›ëÃËÙoù;â4nÍmÛóVõlv1 ·4‘½ÃeîpŽ ˆœïbŽ{Ï@æ2^sÿ’©·PBzüÕÉüÈðqã8êÆ©}£mÅùÙ×HimõGb¯ +×iÌ ¯˜yOrÆë&NË1wË‹(í•–ê,èðiùB-CÃ{Ïœ î5Z¾Úל“ßV ¨Oûè\¿ØC´b²Ï·03n#6ÇMÄU¹¼Ús kÉ£üˆðw EM¿Ù+¿Íh¼ÙJWVà“K럿àÉNóIðQBQ>[oŠF#$îí‹y¼$ýþÝYÑêSVú]Ì\8Þ¥64+bÞH­á£§ÁÁ§–dYÉùQ~žu#¨@…!áUlŠ ÿV-ßF‹ùÌç•­²*„Tˆ.ŒùÞ ße÷|Û}…oZœ~¼·‡#,ô%|]7{Rë">1úŠ¾¯oš÷Òë¹æß­~­ÿ¶0å×U Æ¾kS Óý»ÍÇ*«‘UÄQõoVçšU6RZ^w`ucÚWV8¦ÁÞè1ýBÖp£h†§Phy| ¬¤ÇËy!ò&Û¹6ˆ_Š¸,Îùd¢çSuî{pCe¹¼‹†&Ú÷xKº¿Ï¿«XÑþ‡“iÖ“àžFs—é«Œn¥#jCŒ‰Ç‰Ÿæ^µf]“ñ%hÛ4R[íÅçÿü¥Ð´`§äÔ¤›_è\Y9ã´XYHÌŒú2Th=g]ew‹~¿ .¿gü‘Û7lúæ-sEL…Ýâ`oç3üé[Ñ}VÉ·ŠXCÕoi¼ Iru­Ñ¨,ûR·œáùÉÝpÚ~ )…¼^D=…“ ¨aÞ³ýÒ¹¥8О%+0º¬Ç Ã}B×#“ÄNr’dõ£kF’ðO,¨$9ôÔê ì[èvã.š7ñúÎß?Qa]à'AœŽ_¯Ÿ1mO¡îÉLXÔ[¡¸³ûéè£:¼ìʪäP-Ÿû¾Y¬›ãóe³È ÿlœ´[„_%ÌÃva“f1;nFÁg—Sþ ?b³°¿gº% ýz·ÑY2ŸKÙâ66“HY\U‚„j…^+ø;UŠIP« †He™!Kú”VÓ˜>ÇB(òQT³Œ™y°eX˜†1ÉYmÁádñ‚’921vQ=…n¼sq=:¸‰jP®­[K þa{¸£2(^ºfL÷±K•ÍüäסŒFa+}‚“éck%@åv®ŸA-¥„øY±æÃtWýí\ÕÌíì=•²JšÕ·ã‡Ã”ì+¯–'o7Å°E%L€žÁn¾%©:zw·/_òd½€å©{Q©UâÒkχ‘µ7Ö}{ÂpÒè}¦Åõ#Ÿ9¬xg\$  eìúHÊË2†÷㚣™)Úº¬Ä…›Õ¯a ×؆;*DE·¼{£M¤[ù”ççgù’Cš;”{ xt\Òó–ž)Zp¼qI…~RCÐSÜûÁ9e®¦½}ž+ýÖ™a&‘@Þç<ÇÀƒœB´S\ÖÑ'RÒÿ cÐPÜ…{AÕ쬢cÉÏ NØt·ðÃË´yd#SÈBÂÌøž2›8ÖDÞKˆ2åÚÍKž—ƒþò+c}Eégl“Lûµ4?væ+S ÕAMò|x]öÐò™fƒe\9l;qKÛ¾lð–dk5|Z%ÈP¤Àí+}ådÝ@ƒ<·P¼Sà«4¯¾¤`p~­ÃIÎúÄÏÁÎ’O‘s^Z`ûqçà¨s™ø9j-æç= è8Z{½›<^Ýk­åܺ(ˆ¬ƒ9n×þ©ŸFÝPqÏc¯àyÆÕLj.:óÕ-G&LΩ¯3—³3—õíÝ:üC¬¹à¢†ªM ÿ^šòÑðñ7ñÜÓtWv„qÍÓdã™Ñøv«et¢®Çן²˜&»ujNJãÛ~ŸQ¡NêBîÒ¿%úQè¢çÇã+'?Ó•Gìr´n—§oØÍyö™W€þÊÍ"Èôò#Ï<ë|$J¬T.æÂÈŸ7<;i©ÙO]]+<÷¹Å·^ó{Á¯‚™ª”£Ý˜-Gȃ^ñn9m©V V͸?þ¤±òÉ 3¹à`¨ËòÄø×× …L…Ìæ(íØ+‹Cø©¬Å+˜Ò(vfXfp¸ô´Yz˜2?çÉ©Ù?[Í twí`¬ÝpºÊפf¢êŠ‚„£Y1©ûZ¼gkjÒZ]ùñ«ùO ¿çزgQò×Íðµ\d7^××o%m¬#wë÷äiª:S[Ù7ÀiÒ»®÷25òðK¤G··Ž×žå=έ./0{œ^§ùÅì܈³Mw,"B°²}ʲ*E«¬äK=%†Û33gé5È98ɼ¦á³ÔNˆE<|þå@îá ÝÖ• bmÙ†çOW-µYí@ÉkmÚ~Í^¡&6–“YŒB¤O¹4ËÞ¦i«Ï™3)¹ùL¦·Ü0ZæÖTh éèW$¼ü¢ö¨^©ëNh›h’&§¤™H-Pq‹÷Dð½®ñt‘shºrRa7ø3úãò~¨7êŽõêlLjץ¤á’HÀã¼ Ìîp õa¡ùÚpy½`uñ˪êW—¬R1õfè¬çïÊû}¶6‡z“‰LócÕ$.µÜÖÌ{©$F¸â#Ócyükã»bˆ¥.iUlÌIç¥ïÔê{n®ð91`JC×WäŸÇ ‘Ÿ÷³­Ç¬ûŒqGîÝ 7œKdŠr¡‰}W}HbbÕÉ0‘2wºõø;oÈVo;¨švŽâ•\;åaøýÀ\È;>Ù9h|ÒixÄ:íýÌÛlºQ‘øå}ÛEÝå[”´Ê±9¦U)€^ð)'w¿®ÿCcÝ€¿ ߬y¨Gä$GSó]õJˈ\½+mÛ²còT…jt *‘ J”Dñ dN,ZŒ''$:š[²Jݘ”¹»f†c~ '15«â¿* ¥ƒï]8–wà[Ôð†¾8`-¡Ï¡¤ë–7+}1k°(­‡²wZDÏRˆSE*’eÞbfúœ6‰áµHµ§“Ôª;4Ø $δ•öë³>ŠuiÉd¼Þÿ™*¯m6Ž®ØžÉ“ñ±%n¡eÚéwv/”+íÉÇLŽL^£\)M%ÔÍñ^'#J™µ£jÎì×ɪ1¹±c}óFq'rª6Æñ†åÉâ_»T¯‹×‡z Ûð¸^®èôSìüÈ·5$„~ø–”=ƒëÕÊÃa:cÑÞâMýzhPžÒÜëÁ©ÚÆklT{ŽxÖ1%v‡]$WÛv*mwÄä'ÏGÓúñ©ö0,ݵVã9uQŒw ¾—*që'ê„,$Ç”4Îy†FÌ<`jµ[Ÿì9Ò7פJütÖÙ»'£K (  š8ïm:ÇD6Uþh-pªˆ(éñç,møprðŽ4`ЊnZ/Æ17Î’†®ž%!åL·ò=ùw ‘vÒ¡*ï1ÿt Ú{¿X;O^S—z}#rŽ`tß±ôzË}ɉ›á8.BË“Žw…ïݧ‰§À»s“÷eíÙBÙÆ{/ƒÍÜz0¢B6šëÜPbÅh#Ì«Çv"Zá»,=1Ìi³9ùÕÁí» °¦ÑÏ'çÊ©ð}™ÉvÖBïϨ ï¯Ç~ý¼ûfˆ¸Ô5)ïy¥LG’A-M÷J OÔ«6×åQåû¡»o¹žc›TÓ;)2ÏoÜçì 5¦Vûw„ÖŸB ¸1œZéfLNOV* Ã|b1žÞ3²öƉô÷}lo¼0µçL®xf'¸õÚ0ÂzQãý¯¤×Ѻ¤Å 5ª.u]6C"Æב°l>e/kX‰yæp·ÕNà£ÝXæ×l6”*âžU$k†ÙžS5,Mb×<ÉH}/6M›—/†óK7ìnf_³ÊöõOšá‡‚ªg$ÒíMTöòõ…+û%(øÜSì:ŒÚP¼H¬ÙòQþÐ÷£Ålõ‚ø×_ =Úr¿´CyU;©rw|ë!ryäÛO©ÄÂöø‹;pºGq?pfžñz ùÓq(.Š64!x¢5TãÈùnAk^nmoî‰RJ†­ æÆglšEÈŸFóä-9ŠŸ¬)Ý †Ì¬ê=xL}ÿÕVÎu½­ø†Ï5u÷¾D—û¤û:Ä fŸ¬‰Ï³Mâni4 Y}êwxî(t]ëE†àÅ×ÕqP®ü‡¯Æ,o¿7,½`”šO¸åö$ªá€¾h²ùV#ÆAh’CëþŽ—Ϧ°üTÏrÙ†›¸–=¦‹vëëÊ•@YiΞô|߇ñM  ‡ -/ ¡£P[fK’¾bå츔áÑía.fíW”ñh83zÙŸ§×ž}ýAÒFëà‡·†z”Å7C§ƒ)2Z’Ž>à«NÓÄt®;å¶.¿G]R_²ÄlF[ W7PÖXfEèfÚ6WÖG)gö°-KÍ;¡z'ÏqÌj»V…;3òDíè n7#8«×[™ÍÁº ‡×åû1KQ‡§ý8jN{åqðˆH¨}ìÁ~ûq¤È‚Ûçú¹ÅJÿ&ì\Áµ9®3‰ÓÉÈ·ÑÞLí=ŸBÐ9ÇÎ*5w2ZÍJíM§ê¼’е3Wпð x^ ˆ- ©¿JÔ9†¿9yuËikŽCšXØ@8\Ü4T(WD2#Æaäª\Éå–öÒ›’§I–­s6zî÷óÐ'×ËœÎ{G)2WÝDæ.’ÝÛ–¶Ìtú¹^nŒòŠÍ"­é©½øxW}Mý$sТ¾}²Á¦%ˆè^2­sùÚœù©±'WbîFË^c Áv‹üaüRjFEøŒïh<Òì›êÞíýÀº¾ÁI‚þ@®ì¹~š²ú=°Ã"}ÕµQžžM퓺˜o½íÞ /ЯV7$ȶ—ŠÈ%KÅùÁ‚©¬;¨cNEg†’EØV­Êýc;Æ‹kùý9DÎj¶ïcþ—L{¥ endstream endobj 1980 0 obj << /Length1 2300 /Length2 18017 /Length3 0 /Length 19375 /Filter /FlateDecode >> stream xÚŒöP”þ "-ݵHHwwwH‡Ô ,ÝH7Ò’Ò-ÝÝ!-Ý)ÝÝ\~qŽžÿûÎÜ;;³û|¾ÝÏR~T¡6¶1IØX;Ò330ñDåU¥™™LL¬ LL,ª`GKÐèê {°5Ï¢ö  ã+M èø*(oc q²0³˜9x˜9y˜˜,LLÜÿ´±çˆÁÆy€Œ5ÈBÔÆÖÕljæøêç?*#j377'Ýßêa+=Øh :š¬^=-*6F`£ëÿ˜ â3st´åadtqqaZ90ØØ› PÓ\ÀŽfeÈÞd ø+e€Ð ôoj U3°Ã? G =ðJ°¬^Uœ¬Aö€Wïi9€¢-Èúa¹èÿÀÌÀü_sÿjÿelý·2ÐÈÈÆÊhí ¶6˜€-AE 9ÇÏŽt µñ_‚@K›W} 3l 4|ø;t @BX |ÍðßüŒìÁ¶Ž `Ë¿rdüËÌk™Å­Em¬¬@ÖŽÅ'¶½ÖÝ•ñßæZXÛ¸X»ÿ™€­MþJÃØÉ–QÍlç’ûWæ•„ð›f r°311q±p@vÐg#3Æ¿¨ºÚ‚þf2ÿE~ÍÁÓÝÖÆ`òšÈlzýApw:ƒŽöN O÷?ÿ‹˜™Æ`#G€!ÈlðÛú+dò~í¿=ø3àÓëø1˜þúü÷I÷uÂŒm¬-]‹ÿÝbFq9IqeÚSþ/SDÄæ3Àž•@ÏÂÎ`ffap¾>xþ¯ÿVà?ÙÿMýÿÝ¥­MlÜÿ$ñZ½ÿ$âüïdPý»6Ô€ÿõ `ó:Ï Õïñ×abg2zýbþÿ¼«üÿ›ý¿¬ü¿ŽÿÿHÂÉÒòo>Õ?ÿ?| ØÒõ_‰×yvr|Ý y›× ±þ¿¢ Zd v²ú¿\iGàëŽ[›¾Î9=3Û?t°ƒø3Èø#ØÑÈìŸYúO3^}X‚­AmÀÝW-&¦ÿÃ{]=#‹×ÛâðÚ²¿Y ×Íú_¿âÖF6Æ­ ;hotEx€WÄpg~ÝUcÐç¿GÀÈ`mãøªxÍÑ`bcðWc9،‘þAF‘߈À(úqÅþ‹8™Œ¿3€Qò7b0JÿFÜFÅÿ"®W½¿ €Qù7zÕSùØŒªÿEܯ±ÇòÊ:þf¾†fø½ch4²½ž|“?¤XÿKÿg6ÿËxÐ迈ýÕ˜‘åkCþCacû‹beõÛÿ_b4þ¾ºý¶ðZEÐÿx`}uýÚK Õ:¯¹›ü†¯Lþ€1Á¿-þmœìÿÐ~µhú| ÑìwÀ¯M5sµ5Yÿ!ñJÿ_c4ÿ¾–×âøZË?àkþˆüõô0þaù¯Ðm~û~•}}þÁ~Ýö7ûU×öõdý?­acþ—ú¿a{ ÒöõTØü.5ëk¢vN6Ž cCËÿff~eýQ!æׄ~Wð•éðzo³_mÿV~½OŒŽfö ?šø¨£‹Í ¯%rú¾–Èùøš¶Ëí{ÕþÃË«y×?àkIÜ~gùjÉ dÿ«ÿYn#'ûך8þ}…_7ÿ?øï—-ôd„0?ccÄ`^Ðr[!LàBÿk”… ¹ï<ôNcKÏyGÉO”ïî‚5'lN¸cj;ìn ý€¥ð¥ÞB›ÉBoÕ#9Œ{¾¦ÆÄp“ÎcÿþÀAΉe[¶½]Û€ÕÚØû¤AyÀåRh’‡Îîì×tÚž$eCÙÍw³Øu‡ HP£a°¸\\¬HP­Âi­e"•Â“SmÒäçB£GqD{wɽC,ì} Åtàõd‚ý}d[ÙË´}¯»]ø²ã€IŠ­.q܇h*¿Ë–_*C‡aA2Þté­ñs©ó­ieÓ©þ5èÞ$hѵè÷§kðÂß>~ØÐã¥i+l OPÍsceÿPÜUR"‰Á/Ø3/1qPÅð MÖC®rp"VOÕ!!}29n(£î£Ê…û,ó„üP˜¿}$˜N¤•hÓ[Ù"#Ö|ÖRÙo̱R-·¥E ‘‚%ôìø€ÌO=—ЃcìxX’œ…•4üÀØò±q=–ñ¢ò¯¿Ûø>Óf†ù¢¯Gc(L_2¸g¡+$£ˆä,÷Þ­rŸH_X€›mºS÷ÅÓñ¼y]È2¡h\kò*Ý DÁßc1Ûml2ùÔ¸I8ôE÷% š*×í±òü’šh™~ª‘ôH¤V9lŠXâ9–e¡gD(Tšà\=ÄÑåu²**£Ò^UÜSí|E_} ®~O~V¥ŽBòM}^)FðbyŽ⼤”•£Ø)²phÔÀ½ÊÉ+§ªbƒøûfN"÷Uû¯îJ²yþBXCôóÉ’M|ïfdIâI¤úƒ¢Ã-߬©÷²$9è ÷ߊ“@éd…jš¶ÝS¥ÌÅ#hLÞI6ü·¨˜èxLÚTä£{ÓšÎø4áß<Ï[—Á›i>«ñâç1ôI85û²C¹{ÁÊ'»íHõ!¶«®£$\™ç'úàô<­§¼ÕC˜–3û^–ÿ íˆí‰Jš€ÝĤlÛ¡þXw‹¢|uz¨àÊðá–_ßßÙ5A UúüÞˆ/P%º¦=¾~,C×ýù|:!«qÖcTþ˜ìNÒØ«”?WŒs¤ásM4*ZKt“îtaÚöYYH®  Ï÷Š2`ÔßAÕN¨xù(^•Õ"ïRÆ<í™­i:H ¿¯Þ¤ØA‰éIz?avÜÌ÷R©Îɉ^fF–™@F «:6šåˆôFN’Ø4}ªIYù‰5{ÑSÞÈÓ ë<1&÷É7Y²¨\‡ÑlÂÚ^wæs57d:ÇÜ3f¼—üîÛV"rûµqѸúºnY]QŽV¡À)MAx,Ûh*Ô™)’iJîÖQa-q€û}#Y¤ÍyqKú†««N ["WÕÝõ}tº’°Ë%ãÙD>8Ÿn&©)%¢Žƒƒ'RPÅÕžŒ¥þ 2-’öB÷¨­÷‡3viPUøêÁ\Oç³:¿.’Ú;.¯áÑ­õLÀâù-Û—÷0>ì;¼DØí¼æs›2þÏ´·s6é¤a;ÅÔ®± z|pûß^¦ôL,ÕyÎö¤—î©r1ïI&ÌÉ¢ïb0Dq~ÞÛo¡uhe¹u±Æˆáë½'¡zX.v-,._¼w(r Àu,c#f'„•%¼½z´3ÊË.PÏûZà¹ÒßóqqHúó²¸ÙRS?ô1a³¤5©íqŽ'¸¹=ÜÒNêCn¬@(ËýÕ»Äv¸ªaÅ1˸–@y.YÜý[¤OÍC)$6ÙHðMbŽç{À-Y"ŸQï$ÏyÔVnFùy]“£æ·šó–&ç9ô÷£s€n-¢0ó9nR_J#Ë3@k/åWsÑ>£^Ò¤±ºÜ'à Z®Œ[uƒTm\½^ ·ÜEû,²³…U~§Gé/}vâ·D(}e›.|U€aFÓXè¦Ó€©èÞE#8¿ÖGÉ­@S³(Ô`™‘¤üáh‘Ok¦ÎG^¤¯jZ w0WçôôæÒÈ[ðD¯fÒõ±’Š·4‹¥réhÿr˜~îÖ‹ó;N¯.ê•ïȾý÷J¥„Y¦Om©Âòº&ÓšÛ‚uŸu‰ÃÀ·ÉÛ§Öj÷'¾ÙK?ž¨&:Tcðü“G0‘Ìroj\ê†ÁÀ À©ï%Ï{7d¢ô¦üø8°e&ËÔªqUâ’AÞ_p@©ÒNâ˜þ6‚¦ˆ“ìÉÜÅ1Q5ïH}.Ç%µì»ýÈg²¶'ß.ä¶:zo1[¹âÌx̉Àðib¿Œ¿pY2Ü[•w¡xXz ¡Å U3–Ü.¥ð~H¦bù¨Ë¿n}3Y9u‹`©Ó#ú8ç³Æ““°žöÁƒ~ÒÁÏ5k†´9$VOB{©b]Hz——ŸM˜pÛÔ͞`MÒTäãü] Š†Ô€üòѶŽ–jØkíd¬Ý~šW†·1e"xM†¥vÿ§«.óÜ&ÄPvø¦Â}tùVGÂ(_ÓŽÕ¾¾] Z+¿}ûxÖìª"LGGMY'eh9’L˜Ô¿¡Â¼^‘)6È_o"‡?Z¡¦÷˜…€,·žÛ?}7äþÑ°r§ \dÐ GÁ$‹¿vÒÏ°ÙyhÈÕ£š,êJ÷Ëéˆñ Å{„¶¾Tfô‘ž¹&´K=?Y54éE·ÆÂoó[&wëU;Ø튒%À.’”,? óðÄø4£P®Æ¥FoÚ¡§&ýÎ4“Ø‚Îq z§(×ß;ê:·©±žÚe5vEƒ,Ö´c ‰Yî¼O­¤ÌC˜=ížšKô?²`{,¹ó½‚‡†-ª>®_³ÙÜåëì|A=$Üàçÿ…†‘œçœ:óå"õ¢dpuq„ëVýS£þä»}ÄÎ ê½KÐ[~«ë÷?üx^ž˜§"P ë¡Åò¹Ÿp<‡$ ¾@Ï´gº1Ú©ß²ÎV^òﾶ­q«»±ÛâªUŒíÎ_@—àÐd¥tuŽÈõÜdÇGvJ–³³ƒlì–zm1òçvy%žc-Ã:Ç£.ù×ÍŒÎBæ ü£/kúr BAy7Å.Ý ?ÞxJ,kòÂ5Æü=v ëß>¥hÊugz0fž{ËÒb¥¦²Ø­”˜˜ )ùE vÀ¼y`½‹)‡2kÃôÁ%b®TF#;XU˜—bSwöºNô.!Åò˜º†„qåO;WxÓfúœ“Œøô°ßFZeZƒìóÁ¤[Юڥ9Äq6M6[{úÁñæŠf*“Ž â‰zCë+Û×»^·°ñöØíür fÒ„\ˆþ̺Šê ÷¶Nc€x«K ²=sáê¦ýãc†è*D½ôzdǺõe=¦ü °YGô÷évS‘ê‡÷Ó«7'b&·¤k«üa±EJ³Лr¼¨½Z{õ‚JôâÁ¾Ñ¶Z_à0=¤d7\v4ŸüSÒÂhôzýØ=7Þ£@¹éêIq§OÓYTØl—¼…Š=Ë•[€ë@˜‹Ëf…yè6÷]Eñ@HH–ÊÅ$agAÁ°¤øÌÕæi¨ÍÆu ~KgÕ±H(®AªnV} ÷ÓŸ…Õ””n„Ò°XiWï4îÕ[UîÁjÂ'ê9´Ë“±äbž±H-W’W»é ~9”>íõš jXºž¸Áu}qýÞ’´s,úÁ1ç‰ šlK5­Cs–˜[&‹ÃY/LásÝ>mçžw[[È/akoÛ{UÆ™ùJÍ—È©Á¼å¬EÕH:!Uÿ@^—Ä盢)¼oÇÅn-“kØcûn é8èe‹X#~·þÓ+àÖ”Á´9Nâ5[Ú= ÂXغԼ¤^ãG8§‰;£N„ì4†½Ð°¸Ü ƒÐ5”Såž õdé4pK3œ÷Aü;_=îkEó4YÒ|¦†4°;H]„“ ,?¨Êó ©LøD”µZ|ä2Á+i,Ù½ø8 ø¥ Áâ#ËX»¾Ó.Û®ƒ,°JAž45?:;wT)§¢€ÌÞ%Á¿BÒGJ6Ë òœ‰›2­Lx«¯P6£Õ€qµÄƒŸU˜^“·¨£&üØ cÌ'¤ó£f¹ìa]=€W>se”ÝÍñJÞê$±Ü÷Ü*<;W©{à¶êÜí–*Ⱥ^7Ê—¯ŸÈ´ˆ•’þ€.p Ô/¯ÔØ×:…`ÌÅ\’:¥ƒ3 ‰ÓõÖGGz¸9ÃMË->þEµv¸a`[´æ4R±ñSPõ4FÙä-òùOÓ;þ/|§BkÕ,rl}zíÐmÓÖPz\k˜¬§%_7®óù\ë?ÿzT­ÿ’EõùÉÁ `Þ°g¼yûaÙèí¬Ç—iٖ͌ä‘}bç¬_b¿ Äæiê'‚òs„ž×Úý3ìqËHIIŽóàc¾ù\`»‘¥;ž‡;Óv+Õ}øà-L±wØÀæÎf„Ö)¨)î·^áls˜ÜmI3™9Úq l³BÌuQþ( ¾c©éZ8[­ œ áð’ƪîf¿î´“|S¾°Eg}CÙ’“u„Wì±³Õ·u¥Ñ-­‰:É9¦æÕúýJ¿FùäÀÁ9Ô’x©“T_¶Ô‰\ߘñ Ì@µ5ÖÔmÓt|náÝd@»g£mÓ…ûBÒ“Õ¼{l!&¬2E\õ~EÁí7Yod@F+Ø”\`ÉÕOøàV$ÐM¥¼¿”èz壦¯Ý“))˜n=Q*×ü²3{öÖò£U¹/ZÝÛ“Åb[!k:Wï.B¶ì‡È<½ŸRkÓqöüe5,d÷p‘ÐNŽ.Tus€dÎ/½U5›Ãy»³ïšû‚0né$V¬/\uM¤ôŸôxÞ¹J©ÅÂ0.“½§&ž~qlx{ÂP4äSÔA:– v ùœGäî½ä*z¹Œ$jè6Þ†ûµ¾9™·r3â3.>w+ýEö@…ù¼õë– »ÖmY£Ã!g(~ÌX¬NSê=MÇx1=ּ͛šõó…õÓKD–·¬bÁ}¹•2¦Î²4»-KÑ‹]`ÜTHk‘}+¢‹ûi£a¶>Ži°¦ú—лÇòA¤Àë ºwv‰Âƒ]qKPb!{l "ÅNpç›®Ž(ãnº¶¥ñïó"»†c'ʧ—,—>Y.S¦í`⣇({Ei¸ˆæ\ÆÞøžFÁ/O{ª¾0É4¾|…Æ Fðq16=ïcP¨(¢h@sÆùµÜ´¸Øj×ÒÏ|•Q|GEÃøbXU~Æù‡Ë‡‰Þ«Þ’°ë:ÇAÑüê&8×)CðK À£D*QÒ¹UH1ÃÎ+8ÂáÔ·âEŸñçÍ)Ž&´Žz»Nd5žb™ÏS#Vw²µ,…Ú2¸½ÙÏï\øº•ˆôF*ÐÞÏÉ~ž,HåNjúQÃF…=ÝßñÈ(¨a¥:/xKyöOD­¤’ñêjYÅšK³ º¬â^ÞQ=ÀL‰¹÷,TâùâêM@lex£ ¼“šÜ—h3êYPÃ=]™“ì9ÄMœnÔ%àVC•k£s sÄÇËjË›$Z‰ßHÚjfLe^ofêó6ão9á0:êS¶#¶T•élú%e¦ ¤½´á¦Æ=›»ê x¼<¦ J8ìHÞÔ‰-L¥»o¹gb·ðÙFMðœz³ãLØéáÛ†·’,…]oÔb™+ ]nؽ¼é3õ?cÕØîPÆyó pù,žùÎ0ÐäÝ µ»As­ª dï²÷µ/•å› ØÀŒ±G¬cÁêý~‘öŸ|Yy°Í÷÷Ñd˜òÉÄ‹|A‡äÑ G–p^݆ifÝ ý¯ul”p¶j%úBJª„‘gK q¤ 7’ÆwçÌ(’4¤ˆrU~sãÁÀËÔí Xð\S1îÖ…xàÍÕtï ¼U3^É®ãlž¡—Ú§½[²zl€û'`­øY–ùÁâõ3:ñ#XdÛÜÍßí±‘“bVžMäZÌé—}Bnyù¾Ch%æ3¥µ5¡lÒÛZÅ´ÍŒ0"4xƒ¦·Ý³!6S ¤ŒšÄ?…wHùòxê³'\OÆ*ÎX#é‹R¦'ˆüYµjà"^ˆe&€ënÛqV–H<Çd­P úƒQõ¡Ð¹cCFyD™©RË–i÷¤«õ!Ÿá`4 ÂÞ"Ý m l`¶ •[xxPÚfSCO‘YpA—ÿ)OþXþ¤ÒôQÅw“7ç&Ù¸Ÿóh)+#|<½|\5Ó ãj_Fs+:òP¯–¶… †n—·ÉšÌÆ®5F>°Hæi¨<˜5¯CƧ=&&ø‚‹¨rfkæ0èåíó˜*pl“‚Euó+4­J@`Exz|¡âàÖöýÞ<“£|âñ}œ ljz¿ú¦fu¨zt>a÷ÈYÛ•r®/©¿w4õ¶Àëîˆw´ÉØ)àªs'טÖó[¥¸;RšðÕjÓ…ðyÒп6ðhRˆ«Ôd*ìÚòìhšOG¡3wèL®§vT¹OFã±H&ÜU´ÖÍ^ŽCíÉß+×;g¨=y¿Ãy§$=Ô¦å¼o¬íÑ]‰ÓžQG½÷™G3¯nÀZlW£2Ð\øæ Õ…ª=!€çï{á¯Ä:¿²„rýQV0ÜE‹+†ÿBõEº{k-?¶ùF¶ÿœPëFn«Ða¢IuvS*ù;Qˆwj(ò¤YKd™¸ £&ø /k¼Â»aéÚ›÷ØìÍÚ°ˆ?<©/C0È£?½U¤ºZSv—r“ð‰Çé”è6©v]I¯l¬¦œs˜:8³}]=^¥ïÆÆñ4Bñ;üõAåðñ4ßÙæ |µ¢6NE#¢óÓχ¹I•ô篽ëi,#»ˆ›û,HS_¹jfO?·ÿ Gj9pGED¿ÍoŒÂ¦¬r—xÀÇ[ü|¤\Ù;yç mécãƒ*,~¾õ …èPsŠÈÇMSA%ë¬;‚ο*ùÒˎͼU׃ a,ãàz‘{‚ÂZŒdQÿ¤ËG1WÚŽÀ¨OÐÐÝw„MÙ(näð;$TØ U¿)zxèr+#ä¾ó;â “ÍŽ ± ±¯¶ûÖ -Ò‡¹¥Ãfžõ訛BÝw=:Bwüµ+Úåkîö?56³ØßįTñXæãO´º•}®ýãöæhfú­™©FÍŠj#ÆÙ‘¤ù¯Í!ëÁG¾’ G3öu!¯+¾ê§¿ÜðP³:¼è•£³s+xŽÝÖ½ºFuÅô¤®yÔœ¬½¡n’Kšõá(Ÿñ Ý™Ûêj Ž{awñIÐU»rýï7‹ýhÂßBb!1fêü$íè„ð;•»/;<Á|ãÙÑ'–Þh°–MWÛR\ üõxw|0]Hifâ?õ~ËÐàýž“iø×ÃÐ=@iÅʤänRÃ<ã5Þ“)•‚Ò³›e—"‘·­ÏûY¸{ôõ­½œ~„ô?éKú†8â#ÚÑÈÌ~‡Â>mb9j Rº=àíJŒÔép笥eÂpíº mXa°r-ãNá6œ/Ar`#ó&h_$cI¤—dð+¿U¾ú•ïcÛåEÒ†‡æ™ï` O!-#ï\ÏV°ö.Ë_mkæÞÄ~gSTçì7¤XŠCb#ê"Ìñ’!æKV”¤¿çJ6CëÃÄʾLbAT}Ù nèñ(L‘E¸æö6üäcÏþÓÈSÎÄG4µX^ä¢>-‡}Jò=#Ñ5ol"pA_û§ð„Ëg ‹Fû½ÚŠíf"ΕkŒ:„8ÞÇ#^Úo¥ê_Æ|/›qµ‰Q:cj.Ý[?}G5MºDjó”Á+àóiâé­ŠØõGz÷õ…g±=‡e³¶„Œp°l”Q=* 0ãCó¦c5aÁ˜ØàËE®í2Rê6lóSÈbØÔ×,¡Ã§ð3œ%,³D~¼o«+>ðáœ(SbòÞø1³ÔÅœc¬¤idVÍuׂ™4Ì i3ÍNRo¶ô >8B-“—ÁÃaG……fw3xf¥žrÒÐí˜ôO:Rª#mˆ¦”¢3Že|º™nÉd“I[«9?{TÛxsj0µ—žYêŒÙö¨É]$‡Ž…¾c¾¿N!–ý “tDÓ¥ÙÎòPædŒ>¦Êw¬SvÍôÑÔ§ÝÆQDw¡©‘ !²EÖ Ÿg*Å_æ@¾¼òšTDcXwìÚè -Ù9õ V€ õOJN^OµO¨g#Hµe?ÔmiŸÂGâvJKÇoëé‹2sV ¨õ,4n¥íè#’ K< 9Û,$ÅS¡1Þ7ЪҷES™µLâµT‹’µO®×—éføù¹ü;¹¼N¸«w—¿dü#ãUL{¦9H>)e7éÕ¸ò~zþ̘Š$~;'¨ÝÌçµ±~PÊNQ왘êö“óXy¢–=ezù{áÄJôc郆țןÎkÙ€Ö¼ÛbÌ'Ýy¬­l~ÈFÛ<’)ÂZ%‚žìñ2äF5ÏL5•s9ù yú?‡à½ÖÝŶàU=^‷ ûSDþnd»~í.«HwI»~`¦Fæà:\Ò@Ã0Ï>ôiÊ"RN· Äæœú¥Ñqk…E¸Y±"m ‰³®rI´ÒWÃÎà†ú És¿Á_K$Ê&ßöG–lÃm2DÜzõI†žƒ „3#ðu;¡Gs{ß½AE³‡Å·ƒ4t÷E“LIæÂgߤ85ÐÐK¶s4%3G :µ“eD: Œ0].RÍ [ÚC¤»*7òÐøçT›âz†´èu&˜²“~˜…HAŸ€!@#Éùþã3†/»í77ÝNÿð%Š{Í‘|fÊ¥ÙŠ7áÉRP!¹8Ĭá ­Ãe/‹Ñ7ç‘—¾œº© iÝõΔ8”°¯ÄF°äVGLþ%|>ï§`Ù.3*ÉÄN•S`ʉ’.c”Kät½Êµßœ<:“ÖcS ¾¤íƳTL¿¾Ê ¡µb”®ÒŽe%r~ϦüñÎ #ªO@ŽéHß]ƒ²\±wE…3u[R’2>éGÓž¼»àk˜š›Íþ[e”ÁˆfÛGÓiå¸:ºÕR°ßc-phE®»`6âd\ ñÈšŒ ñ\ tôUDòœ dÑ ®¼Qú¶„†=ƒfË'Ò¯ot$oæ/$e˜ßr†¹»,^®O­µ,‡ÖugÃí·Ä˜,½}Š]-^Ò?ÆvÒ ®CF„b¨lçe ±¥æS°ØGˆ!˜Ü0J‹Ikæ”ôQU(cyˆ:n÷“š™­î 3q+á~b8gBfZ9íJò»(v*«~I‹Œ™-Y‰·0Ÿ©âc$|Ï6W|ÁÊáµÄ«¬qá¼É8¸{feåÈ/}醠ÏÊô^Â84¡¢cÐüÞÞL‰oÃÄq2èнZŒÁì%i¥˜³÷¿ 2áF§°©ŒÖÛ ¨°ûHÛ¥ƒ>Qd#ðwV;Õñƒ\»_ûåqîÁÖ¯Ùœðmþ ¢dnØé]«œSâ sq(½'ïñéN*[V s_‹ÆÇt“™ÛVŒÃ^KkœŸ d¸¦óÆ«Åõy@ˆúÌ—uEæëŽcSú¤ØÚÁf1×þÂ4ô‘Sœ6€:•èíP«úº…ÿ¹·8ýðÙ¦N»ZgÜš"‚¿,±¹Â¸¾_±‚¡‘y„Á8ÖJJðè\>6ÑœÎüÂ~ÑüZsÈ·«¬Nl߯”-WÃù(”‚†8+·g$éa¾“ÙÜÑðÎ|Óá<1û@ÖÊ¡S6}æ` þúŽëÁDvãM›>VÑËûg5áùÝšðIN\βš×'ç жX^ ­Û˜ùyŸÄ®bÎ$} ^ úì‡9ºÝA÷èÜ¥&u„ŽÞ«±ÉP˜è3p¨5^ý8Š®±âuø0gªáÔ¬¡[ĤշÁ¬C܆™)iƒ÷‹¸1—õA†ùr=éIŠs1=LK Œ~¤ùo1ÌCz–D®÷Ì"Ò}½Šë6“œ—nR!¶€»"¡T4W¿LœdæÚãˆíõòF¹Û–—Ú´T~½Âà ¢»‘IJâ÷5a(uçT4 C¿ÉEŽ»³ñ3=Êþ ›o°†o}Ó†Cñ>må½ÐÀ}TÙœ¾_)+ ÍÒ¶}¦mgþUQå>ð¾«mT1\½A‰îë¶30¡áÀ(Ûp1ï“6\dO_†¹)ô¬]ëM?š&Ä:í¿ˆ‹´=S‰ÉÇ3nÇŽ4ùH`Pî1šIUµo³I¡C1è$ÜD8µsÿVDàkš }‚QJ†r`4:hËa ¾»ŸÂ¥»]Ó0úN`ì°.¶¸cO·ó–”/S …‹æ ÇÉUtZ_¶mëÑ훽E¼cËÄñ¹¡{9aö':â«cX=³cië8Ø'ÞÛ=5Èý±¼(Ï0Öƒx>VùV$*AÛ3ßÔÂÖÐ G„JK¸äÇBáûÇ/Då(" ªZšëñeÔ©MŠ6# ‚mN‰OËÛˆ©A:±Ùf=z9Š_»"a|¤÷´5%ˆÏ!"X½´‰Qe{‡¤·‘iG³pÄ=­„:„s«É šAi™È¬Ö‘‰Í(æb¢J}"Y(aZ-¡ýíÙô~õžWïêŽ\ý1yùW.3¦»!øx%™ð¨Vmãà†9™‹Z¥œö„ ;†ˆh¶J—Ñλ?Wää û÷Ök¨',O!»~™êõRMçŸwÉv‹Ý¿ÖÆOSÂMUÃ&„ù®©¶L3ðÙä —þIàWà_g‘èd™i¬]¿GéÒfwôsx&§ŒAw"˱ÞTŸ‘»íËØCæýÝ¡ÓWkVJ«óQ¾åTBž,c]• ÜÜ€G¹1µ‚SÁí}z1Ùå*Ø’>\»vÏPŒai°[ÍÒwf*‡«“W:q%ô¼6´LNePô»~Ø0ÂVvÝûTV<]9TÉjï{^RÛóDΉŠÔ–ߦ҃Ý?GÓ“~" ½Iä±mRÌ‹KrçŠ$Ñ}^ÒÛÐpË – íÒëþöÝ´¦ÊaY9õ ~â°‡;G&B‹&b-Ù¾-˜K\9ìRº<µ‡“ÉQ†L´±M1€¹»ÚXæŒøMN0ÀXymÙ«¼§å~Móò’z+üˆGúŠkr8'¶/‚ªºû›Ù LÎòóÅôòŠÜ¦ñÆÂðÙ›7W•Ñúd©d29º”r{ÇE@òº¦ØpËõ í^pBë§6T& I¼îÅ=ɨ4úBy:D9üBz¿âÂ'¸>X.†#Iõ¬p º3Á#Ô´ gÅW}>Xgc7¯Åïß×ÔE–íûÛ·¡>Ib|Žs@ßï²Ý3“˜H7»Ëb avc&ce2v‡‹ËÔ®wù/4MwêS;`ϵ͜NÇí Ül¢t‘#’ó¹9ìHfîNUrLòçÓ…žúI‘Þxá:¨NĹvD«RBPù–Jo–#|CL+kîÞ‚ùpû¶•Ð9<Ênï'¸:ŸUûtÆk«iåÎÙ4¾[È-ôÇPQÎàpfÏZô“ñ¥²qeM…²4‘ðGdžÜá4¡ñg òíã[úÂ.Ýö£ñû–CcÝ]±º±¸}臎W…g)I7bøµ^ºwøq1a€Ä\ ôƒÇIéÇ ®£ŸMî’ì0zzB¿žD‡çeE«)9nj $±^˜v¨¯Ç ±Óåd!'šÓÔKwQã ×7¶æ«¦IÕ!ÜGŸ¢ fÞ/ÃJhÍó÷Á…2À3´…¦ðš1)‘åɬóýá‚8‚Ü2)õ—I_6fúʲ%.A×v6ÍgÃl¢Øh>È ó»Üþµ…»GDz^ª”DŒá;¾wÜ›mô¼Q¢nSNgi><6ÂäU¨Ä9©\5ón¸ÎA'¦w¸´á}ûCzÒ1Ú„ Ë·çX2Q¨é$„ÜŸ‡ÆöÍáå}9¶TH4”NF V¢’±^°C•j¼•?û™—C‹Óù=É«ï—Ϥœ|rZÏðâÒ[קÍ'¦"Šzhb!ÍÂ$Û2©1'l-ëöŵá.¹ºëÄûòFËé9ˆ¼%Ç´ iTáêð„6-Ö0‡ |e¹&R“2Ãp«ú.èn2;éórhŠ²ç}¶É}ó8õBñš]C¸N=Á¼DÞóÛ9 ÚÙ- îšeî¨1aã_ïúâ+zRƒ>CG_ñ{¨Væãfà<ÑŒC¯“j¯W9×êÿèŽÃlÖxv+Ýbýò«Ùô mþÅ{܃ŠÏÅ'¾µå >Ë_2âð\±ÈÓkœ‹uô «î¦ä¥È*žúCbñ–‚ßãe„D–”Í7…e: ›EäNöꟷCN@X³¿‡äm¢¬ªMã>H‹+y6‰ç÷£Î£}ËÆÝfUdÛ. ßÀ<ÅÓ&iÏ£·›3¡kÝ?LÕnS‡¨q7‹â—®=yߙȣhæ˽xéá6õ3r¯Ï”9$™AŽy<܉^<‚ Ç”d `&Å—³¦Å%–ÆŠŒÐ([«´Z€P¬ì$4¡r{¦`(ÊQUçv æ·§š.Ú&POéÓQ©ËÃY²…ÄÖ²vâGšàý¡Ö»±1Ýr!žêYc: }‹³|_ SÍÂç+6œ@V§Ä„°]9ÃZ3$rû6ÕB˜ÈAžá…ôöÍ)Þé²É SªÖ'¥¥÷žûFÇÈC“$3—réIÅ9þʈ¾r^Û}¿J &¥‘i﹆úÚÀpÞuIa±J»ÆÌX™È³„å¬ââ*ÙM&Œöýª‘¢¯ø›Ã4ÏmÓG£DÞ›7⛑ãø˜õÀ” Qx:X,Ý)ˆx}êEÏüè˜ÿ€‹×öQ§¥ŸT‡”P¼Kÿg> +͹ÀQ|¤$TÇ vEÅ@Å"ßCd(Ww£ ý8Î ±¼ÂÒ9õ2=EÎ #¤À"éjm <=ýpðÑŒ ÛdÙÁA¤Ï$)ÊKéî.…ÆM`Ó0Ïç/µ5[Kš¶ H‘¸Ó©ÄD"PåÙ2¦³pà\a†ïÅ•<ÞnÔ~s¸\3hè®s1'ñ6 “÷sã<;…˜U,,\V˜ÆK:è™y¦0JÿJÙqo"ᨼOj=¹ÜQ)À8 ÖJÜ\ýزŠÚÍÆùÉv°5$²ÈSiµ¿BUUB·JÞÇCU¾À¤ù¼õŽ”ï.Ëð oƒ&>LŸ Ïv«Ìò¹Ô«/¤)9ʸ‚šL…E4¼Äß.EÒÒa&‰¼¡ÿÖZô“Ìf¶_º>ß·bð¥ÒƒC%°¥[èØ_Ï·=  "ï¥ ù´»%oöE·‚3«¥3áp¯œûÃÛ Õ$ÇÅÌÔõž@'ÚõÛþê~h®]ôÁÞ‘ÿg¢æz?¯®wyow(µ[Щ¡¤JRsë}ÀAD£S{rD• ï Ü€snz=Kkw_Ôqóg,6n½jJ‘Êñh9…óîÇì;’Á†¡]"Õüˆå§4èÞÂu$~ óºRj‡ŽNp¨ ŠáŠU¦(§¾òî|UÎì}ñ⪌fÙós̬àB…æ.­1­‚.NMü¼2”Iä@B¶zu^“ «:®=3G±®ÐAÖéç¸b?‘‰æ\¨È>#Ú·à´o>ގﯿKL‡eÞ¼“LA¨VM/³WDŠø‘| ÷8æï"E%0N%[}ñb¢?‹/€ì‡Þ?%¡8¤jvx(»¾•h;0œHW1.˜ìü2úóKLtkWâSpÆ>ܵK:n®;å8O‘¬½Mö©ÈÕ67w=ϱNª%‡µƒÇ é¢=–Ã%@/ÜN«Ê®¢¸A ª»+˜[’æUp\ùš šÞG*ø±¬;Ò=$Çt×â>PÊpZØͨÏl'\;³I¿µh=ññ垢 ‹ø|ä'ZÚ‡öãŠ$*æ<ö°Ò묢LKVcƒ¨•nG®Éú(Ø8JSѶŸ‹¾„|l*dnúRº¥nÖQeÔýr_a.£uHá`SpÇ(Ê“D 7ž¾ŒÄ‹eAÊŒÉÍZ;Îrìà,GT¶#½Í-à£U_BŠvÞ¡ìÑÚ•ePŸ¾ )cdz_@!6–¨«©cÛ i:'#äp4[w ÚrL¬t‡B_?¢s(Ê‹, Ô·6ÍÞcÙ53eÓP¹–="Òÿ29´ÑŸFKÅ9WBµØ3 û,B[˜î£;_Þ¯¦Ó…a‚]ŧ£©9jØw7a ò5§uëóûmIµ Geœ*´ñþ¨è€V[žÉÞÔ|­tø|˜5‡âŠ‚vcâ „SÒ•H¿âðn©·qW"GûËÎë¦ÉG\÷›¸¿}rm¶Hlø8óÄTLLó;iè?•å­åGMmHþ®(¤RžZ&?¨A+Û>å¹æéx¸TÔok y“ ›S ïÎÌiâ.k=Ú'AÊ&ŸµÜn¬—s^òäYù}^ÚCÍ£v?&¾6ÝÁT²KD“ïÀC®OçÀ8U§Á¹GE~ÓòÉThiñæWóµ&y\½õQå\èáå®O•à;¡Xh‹éPû:}¶îð™ɽ“±5p¶=F`ÃUç̹–Ç‚éåH`4‹†›%â–Azú)9ªô¤ÝIPÂßò`oÌßùi8âå¹îø/-Íÿ°yÜJšOÔ9SfZúÉ?á»GÑä° ·Ç¨¸(Û†¸ìuù‚,ט¾x*›/hmìaíÃbؾáßgÐù°ñBÄí!A8~Øö³Wv|jf fV9á;¡e<‘]W®¿RwäûÌÓBÄl݉ *Šk:g6K#Q? ÛŸU§Zß•I‹#iвÔ;-šçty  ’¶™´nÅþé*•Úôaý×câ‘G‹ïcu^»®¾u° ë£yÔÔ[Ü2g2ÄÊ2Ö5´à¼¡²À·ùRîB,ƒ0”|@Ðç\~û eŠ‹ÆœGPø¢· SÏ_zÚmŽ9ûÍ ¼æp|% ÓacŸ±ÒîjîïM_²·úcW-Í¥e½–8ŽSÕ(ÅøK9hNäƒë©Å¯Lö%º’÷m$±†Û'SXñ)ç=f7#7Fý×!:#üŶ턄°pïÈ°ùÞ«èyïÏÈ&¤›‰ü|boºkâm#¡²½KÐ!3ÝRÚ_–Ï7ŦmÌ–Üh°q»à{¤N#Z*¢«RðE;²‘&®ùV²^—_Êge¤€ÃGñ#íî§'lµü¹ÉÀÐò‹çe9<&UĶaÛµKï4ºx5£Ñ|Å9DÞÍÁxÁÊ‚Â`BÀI~'õ Gˆy{è~aÀ—÷‡"Vx®ñ:q·×ÒSi÷‘8R$§“âa÷ÕÙw­](*~\j6½•DZ’±‹?ø õ|ô^òêšÆbŒ÷{ç×%æo’Þçd¬2AŒ°j©Š,gCëŽ+ê¾ì+‰º|MÂa H«Q"mý‘.çÂ"JI´kUë˜E‘ÿá=º]¸þÑZÛ÷n{FÒ¿¿t"þgÉaqEo|sáá Ï>Ó`šî6Tµ?ã:.È|ÔšƒLhY76ÃO8À¥ñÐj´Z@3¼ó¦}·O¦Nè$ ?ßÃÌÓÊü K_g‚BŒÒqTö)7,+›+⡇ŒýµYvé S—‘íõå uj>ùÕ»&»üݬÇׂ €€6¢w9 !dŽºûå4e+ _46ù P'?DoØï»2àTÑÝ»8¶™Ä‹.ÚÀ€6ÎñÒ˜;:‚6-mˆŽ˜jУÛûTDÉ=ÒÁWÔöÖé‹ % £‘EΘµ¥~Xˆ¹¢×vØ-Ì8÷ö’^ªEŽöÉ6Ì<”ÚükV…LB‚öÄùšó¤ƒ¯¢kTz“´ŠåHªÄ—onë¾ ²ó¦÷-BB ¤¥¢®ÁmH¨8§\SzŽž?|[fqµ‘x…Œ¸âgÉNƽ,ïÙ²h9Œ} i 2ôGÓ¼ !ã!_6@øöÿ èõûv{ Ì úÕ³ÎÞóê/´È…â‘ –lIõöƒ„éÑ3õ»ù V¥Éi΄f¾²‰^u[ÀÑ“ öv Þ§&šÉ‘ Âe4?Jؼõsܶ44ô]Ús‡/›7Ùø6#Xþ¥ê²-Ñ^4›å< AÙLÅô„"É{ÛcMëyV8´( ÆEMuf'̮Б/zi†·=ƒ{×¼·!µò˜Ül~δfõú‡”â¡hÆ«Kªê·m»ãIé&tr–g˜´›ÂÇ5l=g›oÎÌ3œÉ½º Ã]§*kP`SyígðË „,Øð<ÕCvqè‡%Ò ¦òJÊ’Qm›}JÝILÅŒT½´³L.~åÌX sû}£ST’Õ$Ôúü¾ÝÏ.Xÿ H `äq^JnS‘4¹à²0´~¤ÔlÛBd —CZõmßäCºpUz~Äç%w6ŸUçù2Ö^ ´FÜp2;—3Ô„“/†Ý Šãîˆ`î,òjŒK>ÁkË<,W=ì@\’Þ˜gäòÓ!ú)àŠd€A`…Ëx:Ÿ€ðºR ý'E¸¿ÖGmTw¨}÷e5¸¯§ò¯"2‘)Ú·§¹YëŸôõÑH÷"od-Wê%Ë߯B²¾÷…ïüåÙûðâ@£Ù ½ü¨(è€×us'9Tú[˜ۄ„öj Ø%ŧÖ[ïeêÈa-ô§ÞÝÀXÂ4[ KÅÞÊw–yÜw™Éá} Œ‹!Œƒ·A[Xäï¶B"€f–.‚ÖºöåQn’Ϻ¾¦ÜP«bY‘#Éá!ƒ°[ÿ‚ôÎP÷©ž<Ø^T[f´»ˆÍàŸ Ç'£@Ž²À½!À -à/ôËWô.7cEÓÈÃXæª:‡)«(¢^δ<`˜_Å>[œåú°ƒ¶µé@ù#fÓ,ŒP†‚´b—IÁ¶e»Á°¾K¥gZÆó&3 ÒiŒRwð‹Ii‹›®ÁW¾œª&àg£Žfȱ§nv+¦ež×iÑ‹;éˆaÿ ,tmœäyB5f«xhoõÀáÎ÷Fÿ¶‡;œJÐ!è€lÕ†‚±ßuÊðÛ¹œ/# ÔðÜâÊ>DàrWÐ2[ #Ÿ“€R}s=*Z­iÞ\­ÌY|¶G©#$I@ˆŠ°k«²ßËŒ@¨ñ÷L~?êp9)]™‡›.$aâyûZ¦"ÐYóQŠ‹`FÞ¸X6í¶¸?øž‹ø†á|è•TShæIßEŸ“¨t!|b=,\Ci‚¢ŒB\3¦–ãDê0P†äœ`S u9B2 PÑHeY½üçLN×”³Ü¦Åó+R‡ÄáàCÎ žå)ADF4Â6õn‹\!JÙÃA  *ô¬ ~ˆ®ÏÑ÷+ÿ«í¹a2<ËÌ Ã÷kÅ•¢Ø¿2J€ûgY0i”Ô±Œ!Œ~C9j …ò«'œD!1ËådRC¤0sëaLÂ@i4ÄuŽx2XþIªŸ–(Óco07›ÕØúÉï$c%`èèIl)…@£K Ræf0•XñoÓžº§8ºú¨ãà#2sã‡ûæ¾–ú¶…ÓÇb54¶¢ñ~„¯S²š ˜½xŒUúHQÔþÛÒ§'K0!†É¯ß¶#æІ]~ªvv†ŽÉcçGÓËi™¥\ïõ;¾³Ô]…}Æo^4Š‹„GÃ|V#M¢HŒ9„MÇþ>¥*Ói=äoÞI:׎ jš–æÁø°WJJ§]]={±z¸ÿ-qv6¶(é.,ž”B¾0»óñè ß‹¢d,ßÀÇâK}ñ70½¬+î\oêiâ7?šŸÙG‘å–„…€A6ÁNôþAo³lÀ®¡Ô%ÊTVtàúÓ«=fÌiZËŸèÕ$K¿`™ ,ˆ«c·wF«.Ò»sN·³›%êÊò¨»·¹S”œ…ëÅj£~¹GztÒ®m?Gù7+ExwZö÷ºð÷1- îZ3NjºÏ†M–\¹XaÐ'éµT‰æü¸““]u¡ù˜•ªSÂAwë± d­s]ã!8˜¦ŠwG<„ñ_+ï”C .B-º§òÅÈœ¸=ëN¯Ë万;ç̽”Ç3ƒSÙ%Ñ\°ô´Ñøn­nP³OÌ6Š•Á1/Ë}÷+ÎèFb~† kd¶ÅT7·-ÂbÀÖ²¯I­ªÒÎ-™–w.ÙÛ/u\i†%Ä”!›Â”CåŠ àëÈ"\©VõGÀ¸):GTÅý›¸WW¾± ×L×Ôí>÷PFßÏ Í¿ÁóF[„koh^¸(ÁŸˆËßaùa‰Eƒsígg¨Àäídü¾KµTfB‡âtkU”»a9ŒÎÏ®Iо×Þç 5§\:™Jç¡ÂòŽ5+æå½ø‘½nãºÛ7iǸÀo/¯²,ÁÞ§µúò$’œªùpWqÿ`wV–86S]£vÄþ -Á€§9ß+ïDNKÙMøý¤›YÿLÛƒ[Üi„/v0“òÎpeÈÍ"Ϻ­ ‰¥öˆÏ|ùú>¯Ç«QV€Oß̶Â$ȯLJÿÞÛëböëª!×ùïN»6Ê%« š'ãlógÔ]¡/›m¾Õ,­µÄ)YnÚe ¡û¿¾C4=?Ô(©èÃ(ÆEæ§_¹NvJs¾-éÌ^Q¯¸> stream xÚŒ÷PYÓ càN Øàî\‚»K°ƒ»»— ÁÝÝÝ!¸;ÁÝ=¸ß“™y'™ïÿ«î-ª«»w¯Ö½ŸÉ)Ò ZëE­­hé¸BÒJJŒ f:&8RR%S àÿäp¤*@;{Sk+®?,„ì€z ™°žÈPÚÚ áh`d0²q1²s10˜8ÿghmÇÖs25HÓ$¬­€öp¤BÖ6®v¦Æ& žÿý  0 0rr²Óüu ` ´35гHë9˜-AŒzEkS ƒë\Pð˜88ØpÑÓ;;;ÓéYÚÓYÛóRÒœML @{ Ðð+e€Œž%ðŸÔèàHJ&¦ö+­œõì€ÀÂÔhe:âhe´€ØŠâRY ÕßÆRÐþ)€‘Žñ_wÿœþåÈÔê¯ÃzÖ–6zV®¦VÆ#S @VTŠÎÁÅ geøËPÏÂÞt^ÏIÏÔBOdðWèzQy€(Ãò³7°3µq°§³7µø•#ý/7 2‹X Y[Z­ìá~Å'lj4ÕÝ•þŸæš[Y;[¹ÿ™ZýJÃÐц^ÙÊÔÖ(.ü H÷[f t°200p03€¶ ‹ ý/%Wà_JÆ_bPžî6Ö6#P@OS# 蜻½žà`çôtÿSñ_ÇÈ045pèM­à~{‰FcPÿíL]š  ñc0üúù÷/mЄZ[Y¸þ6ÿ«Åô2Ÿ?)(Pÿ“ò¿JAAk€;- €–‰™ÀÊÌ`ãdxþ×Ë¿ùÿ/÷¿¤rz¦ÿÄö‡?q+#kçß)€j÷¿4œþ™ Š–†ð_kÐ4¿‡_‹•ÁôãÿçøëÈÿ¿ÉÿååÿuøÿoD¢Žé)þ6øÿÑëYšZ¸þcšfGÐfH[ƒöÃêÿšªÿ^gi ¡©£åÿÕŠ;è6DÀÊØâßBšÚ‹šº åL Lþš˜ÿµäÝÂÔ (gmoúë¾Ð220ühå ÌAwŠ=¨Y©€ ú/£ˆ•µá¯ÕcbeèÙÙé¹Â1€æ‹‰•àÎÚQC Ë_£  §³²v€²óYÛÁýj)+€^à—èoÄ üØôB¿€^ø7âЋü‹Øô¢¿#€^ì7bÐú˜ô⿈]ò7±KýF véßÄ.óØeÿE v¹ßħðø#½ÒobWþ@ì*¿ˆ]õ7±«ýF võ'ˆ]ã7Óû1ƒÎéYÚ€öå×Uø?)#ˆJÏÞÀÔw Cà¿r¦_bÐè™Ú›ÿ.4(d=‡ßþAõÿðÒêëÙý!å«o§g´9ü!fýGü÷>þëño±9Ðá?öœÌÿÊÿÏPêÿ"VP0Ö Ùý7–_KËß%ø5Ôô¿sg¥nhmañgÌ ÛŽþw@cLü)Û/½­#èrø× (>ÐP[èYþáT=£ß^@F¦N¸ý¥¶vü“dbü›¤7þõ¢ÿ4¥cò;9PM\mL€VX€d¦@Pðf@Ð4˜ÿAõú¨0¿vû·TÝ?2]íô¿©XA¾¬@wÂï"€¨­-õÝÆÆ„ztè­ òiýÇ)FFP¢6¿Õ ЗÕúÏÂøô¿Ý=(ô a}üaÊö—ÌÔúwY@…µ±pü#1Ð×½íïÄ!G ý_·Þ¿¾Y~ ­€†úô™óáã`dÿÑ&FP%~³±‚Ù-Mÿ;™¬¿l€NôŽäÄôôþ6(;{ ={“?ƒ’ûM z¾èLì€ ¨zÎÖùpü½- ο¾²ì ¬íþlhœþ€ €ÿØUS—? ˆÕõjŸÛï˜AžÜ€vGðŸ‡ÁÀÑÔ?‡¿ÞnЫñ?ü×è4€[˜³6àö7«öo½«Àu¦Ýû8Mº£šHIë¾`×æø€ó²"ÕoÍîFàÛ`7Êò–Å5ÿ"á³ûQS-LPs¬|Ë£ÇÓçh…ɸX}ã¹G5½ø°x´Jü»϶*¾æMङ¶ŽHrÙèwÎ=b.5½ÅK#s;ò»l’ðOÅS´ÊáZ¾3¤Yúi³ØÄдøo©ÐÎ]g®o¦Ñ2Æ_ %¢©á<#˜óÜ5Ö™¾ÞϺ­”*1Ùwâàh`ãC^£L’¹ îÇK¼›w/Ì_û8ŸÎ@I¶6ÒKè1ÜAtÂ¥)%ŽöŽÁÂnSl„ij¥†ÞWí;lꎢ® UµÍÒ<6µ‘³³¨X¶lc~Îî@ìm°µ¡´S$ŒŒ«ûîÆÔµúѵäÑIõ¸¦Û¦Ñ&,Ü&ærƒàŠðs­'†44ÞÕ.G§G®YJI•ûw³ñc›i—]Ŷ¾‘SG$8˜ÜoIÈ(è¹Éõ줃Ñ×Uè,Z°œ-ú`°Z]”šƒ8‹¢ÊKt¶»/,'Y#‰’nÎÎxu®qãùâ¬úh „fÑ'˜¥HI¡4±ì¹sƒÅ’U\wø%– Ëù'[DÁG¥ƒön»>g=¢~0¦®~8úØ°Ï{ 5£‘¤çÝØ Š*sú‰U~q‹G£º/w?7+¨7 Wd4OsxŒ,3B¾›eöö1|:ÛÄÆܨ!XF³,•Kðipèg…h7Ÿ±B’dQvÈhâ´œ_cç+rdiÞÇëâMÍ¼ï± Ú•¼G4¦»4~¸¹ T„WUõûª’ kFO€¥¡Õí4ÏrsâµÈyÞ{¶G¯u|ŸÔ»ž3£ûü<‘¹8ü‰°nÅj7Bçð®Ï9rpZºašÊŲqkW½<c„÷x‘În½4ÊÆÈA¸Óƒ¿d/ã [û¾¢ÝÄc|‚î®@Aju°RrÒ2ÕâFg™LuÙç]ØJ¿;ACöù³¥hÏû•³ü´Ú„ÜÅÙ¤Aæ(QI/q¬À€J‰><¬D6aü^yyBô ê6ª‰1ÎAdÜoªa%›q2Ûç#Î÷œjQ¾xÚ´oi?»óm±üatR‰Ã!¨o÷˜:³Xèó33™;øK6µ*ÙÝ–ôÜ'ñ(CèÖ“Î/}ÃD\üÔÉ›ŠoYƒE ¼?Z™µ3m¶ÍBÏ`ìG93"D<Ýì3ûègˆk¥†v¹6Vs}ÙF4šË*Z> ‹Ý9¼È,42>&í°Ézä1½ ”%  w/Šœ­Fr.yQÜU¦s¿^ OânÖ0uîzÜŠ–ùÎZOG4GŸ ë@}éJ8ÕÈÏ€†?Zx%ÿUˆ.ë>)šò]o#EuÀ÷ñnœ›u%5WÎR`f€:Se~Ème('&Å‹0[—YG .CÎ Žì}eåV×ai´ö­‚BJ±Pž”Në3ç‡+“ j¾~Á#’½å~ÊCþ˜j® Uò]È °Á^±bZ»˜¥¬Ào³Xê¦>PÈþ‚4æi…{d(Þc%"Ä)Ž- êëEºg¼¨“:º`µßʦɡ-“ðá%É‘%7§Éy3PSEÖådh¸¤÷ÝC™Å˜øÙ´2ÖùhÏgu°Ô"È}–ö¯½E±èlM¿¿¹UÇÍøùhá§W\è<² S®l3Z [Vvµ™,ÍY½ýCÂxJß™h3a¤Õ¾ÇwHi*¬L¸RßoKÕ–HÛÛ´/˹%V÷u?· &œ|§[wÝDºAI)R¼ÄêSÐb»>µm4æç×Ûh+7s[¾‰>7ó+òB›à5$ŠP%êŒM»7%!™Ê“¥…ôDzo”àHuÉŽñÜý)°%{¹è„ŽMG%9³;\>õÒ¢;mŠ<Í°¸|f%Þ‰Ì\h~ MJ/0Ü´`%×Ö_±¥‰ÿtC­ÜçèÝ€•‘±ºÕèûùÆÖq” ¡¿jN:¢ýªËøñ`Æ‚ÆúÄ‹ª§-m£¹y¨ˆas7\ÇxZíiì# vLæ.ð~Â^z _—€Š^7쉃âö3 ­Pgj±€âq‘±Ã)C\í釀Y‘ ÔåsÖ‡}d)êYǦ ΗÃï ±Ó„*Âä€n[¢PU«º¢_6%`d‰:K^Üú²ú¿çˆÐQrä¤:èR'ŒY.ƽ-/Côù↡»Käñâ]¦GU>j¸§ CIç Žgb=ÿL@Å™i{êÓ\åSÁ»ç/ƒÙ¯ ÛËÜG8¹ÎŽÜãÃ)ëP¯ÉìqÎjÇyÙdÓ÷ãåñÌÚ7ÕD<[a©Þ¶Ö¯îË'ºÕ±†Îq¸óþˆb¯nô ©ûŸÈÛ5HüCÀ’~HårDä®ìÓ@ þ žû–‡}ͽBÊfõû­ %):ÚƾùÐ2óÿã$%ëÜ'!+OÞW»J÷»w]ʯœ"Ås3båŽÑ,œ‹¼ëºÖ8¶í£ô~¹^H.›ñ‘Š©Fœ„ó¥|jtŽ‚.Fbú"OtΪÜIÖ4°ïò¥ÌÍ%ëÜa8Þ?Ñ€[x”µâúLa#IèQåÌÜ„àw8}X®ç=fW>68ðý^SFÞdÕ(ƒ<‘4Æž¼—¯ºÚWòS¸ðª²ŒP”(ãMÍùºˆÌÂŽæ*†L1Ùý²¶†Xè‹ØÝJ\æ6´‰d-Ûý9ΣÔ@ãÏM0w÷ ƒ†áJûý:¿^Ð%~WŸ/j—x óøë ŒzgÀÙiêÜ»¥|cÁZ (ô…NågÑC‰ >b4MínøÅ7C6c&á?º2Ç:c /•!8|ÆgcݲöVÛ¥ùj| bß=qH†q—_?d©¾’Ž¨Åù_C‘üâz§?Èi³U+ªc˜,8F0'¡@ΦI«DuÂB”1骦K.]÷L _ö¶âdH½DNàCŸQ´±^81ð6áE­€,F¡½G¤ÿ^»IÊç0°Œ á‚Ï„’ƒl“^PÅèËM|,Ñ»f†àºs”ižÞ0H5p·6Æ56ÌÏG_Už5F³ÓMv¶½g’v–* xem `¯Hj‡Æi,KÉQ~ߺ‰kåçÇ Oü:‘ÚáBŠ-Å¡áQºØŽŠ¯Œ«”ð†Xa_>\‰Cr·øÈi¿Ck¬»hÂRïxùö´ÿ­Y’&Žx€/%-Ö÷fK_0c|làižÃcyIl<}uåL‹»ùœUß´SðZ… ¡Ú4F&#×:æjSü –ÂïëX|¤M“·ßŒýC;€šnÉÀQ°OÀК eƒð1¤íCÀ[ÿžcY6§k7ÇÜ(~ý/°a½°¦.µ}+ºvKhdv{xˆHâLJÐh‘8‘‹MŸyQßú"2**¾¹ÃÞQ'9 Ð¥Ìí.»žìÁžçzŠuÚñ UþNM{BT¼\ÉÜå<ÅÌX?ýS¬á[: .¸®Í³’T<ºð ˆÒ\ÛŽâ+^,ïR^7šEw˜Qm»”M6ëò†Àº¦ë¬ÕR‡O±JËBÏãó€o²Ü¶›¾Ú÷$® ‚ÁÖRvˆ>î:ëKIÈ¢w½žT×_Hï©ÂЊ í³±R„ÀeÜ ê[’ ýXżF½t7¦‡Laø3†%xhà¡[Úúönä\;ãzªµÅI¼,ØÔpÏù¬Žk%”~>”Å~ Æç(TßhÀ²jDŸwª¢õEn½{x›îð:å)÷tçЃ™] áRóc~`Zoiƒî–û®ãÊ«&f0.a]ÁéAsWpäS{·Ö¬•_ ŒaÝáKØøϤçLÑ2óÒjøš7?ÛeÍ:ÚÞ—¯-îRרßÏNØIϪ$„Qß%Æ_v­ÃK\¨«\ §pÔw2v=C~bÄâC—®àC'îMÑ/‘ïBÂ;ko22h˜˜Î°«m«€ç1¶ðŠ8KˆfU¯ÿ諸s¡}dÇœëó†uö“ýºßãõ2fß!ýÏÍæ°s¼Ç]ãmï¸ç¬°¹SOr‹oq;ü÷ŸeÅךØqRÆéÝ£t Ü\i íF±]p³ÚFÐØ%Ö&ç.îüç§;okÓŠ¶È3Þ㺹ã4é×åM˜Ëé¿õêóûÇUÕýý.Ô wK|ºŒÈQéKc˜B1É4M_á1}æ¾ Xîñ¦/™H"4GWMRÿ“4¬³òmê1KÂÅšÔuÓü uݵ&*àmuêÛ+éè\ª†4¯fÜN·åfžUW_å]¡ þÀõœ@Ü aíæá5KÇ´À1¶GOÙ:%ý: ÔÙ&¯dÔÏÌ¡*Ùµ§8™Ðµ¸, Ä‘øX¹Õu‡çHHˆEÖ _U»È:0›IÁòï±Ê~ÏÙò·U Ô‹þ‰S±\ö.Ëþ)Œ±4Ï4A¢ëÁü¦§Œ¸Ö›Ä>Ö“ÙdZ­ØÐûm)ýÌ.š cY+rÌÁ§â²r¢wïEfɹñ_±A[©CÞä8—z}‹=¼ÂéÒö{â¬1}¥)þxbyÜ8g›1³ÌØY5ÆÛnòë‰7µ:ù¶È<ãg—Þ]¬bðþ@”ÏQzc:𸄟a ¨-J”ˆÝ LÙ*?;Ù©È.ae¾2‚ŽßËð+6ù²fLŸäÒ’U)3yÒ7­ÌÄ÷ÓXèCÞ·ムœ§º8Œ¤¦ß}o0Mûô­@♂Ü!Œœ¹)Ï­ªøNlnâú‘n°Ã˜lpŒ\_²ÅHä’;•ƒü(é€àâN¦L&B5߆¸œ×“©óÚ8µÚ*ÄÅÕ{á8=è^=_4»V–ùØY~œ{Ãöâ„®¸=§ VŒˆÃæTV f°‘uƒÁG9SˆWû’%µhü—ä™ KË0Ÿä%n‘² ©ÃíÔOeŠ±Ý•UA €×0çwÃøµ;{•-}ÈÅ{H×Õ¸÷I[€ÛŸþŠlHX÷¡»çÀÜÓ®"fpŸ·‚êJÆ(‰PЋÐUžXJYJz‰cÁ~Á%ãF˜)3Æù-3/çjùŸ©â³˜(æÜ× ïζ ¾ÌWfF—ºÉQÉ%(Î+ìRîYÈœ¼û©n6T„áÜæø¹·a ›9ïs‡å÷ôûkÞòW5ŽFW›Ùpäâ°2PÙ-›|ƒè¶fÅI”pC_’§«©Óë³Ðú'ñ'ì²7[ŠØÈ>MÄ qÎYÚ½ñøÎnWv)vOÊôSÂg•¢ÄXL§»§¶Æ«ÂEîZÇGrsuç]׺úƒz€ðp,ñ]c ŸQ;AÂbòš'jSŒÚð¶õ~ðóS*ù&µRЃýÚ+ÃåŽS´=fz(ð Ãnä,1Îtë­ §Œ*~L§_‹£©Á®ý趄3œ†G}Æ¡ÍIÓÐyàùø)â[°Çêõö>î÷ÌÑn¢ê,7ª0?ñ> %Jl¤Pz½b¦èkv Êò}¿èåÆÌPpZkê)cÍá#NWÝñðáž-g;€ˆSƒ ×2 Ý—¼¿²÷d Çq— t~/q裶þÓ”Ù1\B)Å–5Z߃Àëè!†ç€é±“G_À3À7#é}ž”ÚŒ,ÛÞ#= 9„.áøÌEDmGmt!A38æ‡q¸88ɵÍ·×i]WO±ÃüÔwC|”1ËoV/ã“_Ù7$á‰8‡Ú¾Z€Ò-#@X_ŒcÕÍ:;ÁI6ø+ò2hðã·þ”ÖI·ؘ;‹CäQ 6ÔJ"êxõ¯7øPÃ!µ¯óXŠ59E¸3pòÔ0äŸh•ÇJÅëíQÅ•Âggœ~¢-÷ë²aZÌ,H<ÊLolmÎÛàä]À&í¬·>=È×$9¹]ì¥ô~9/\°Dêö‹ôo›ùJTÈ+ô\Î1 º©6F±`û³À[¼Â¤w„„®²CÊ㮦ˆí’qíSÆ…Êw!>vO¹! V¬˜ÌØ^ s qÒýïÇí êé’¾-í?ÛKÑïˆË—–ÄIÐs×·–LßµšTö·nÄuž5ÆÿÉÓ5á­Ðn‹Ï‡z^BþP„¼ ®ø0g->§¢Õ³¤m:§d<¡ùyM£îó±Y ^yÎKknE!¹ ‡3²t0) µ—S8\è±?dãtñY‘÷F¬^¾ ÷¸:ÂWÝK„Ûª±>`Äϳ³"b}ûuS[^šž÷VCøß S˜w»Ã#yUÆ}?¬ó1[IŽî^3ê^–KÞTdCnJp˜3çû1ÁÉÄÔq1 EqË¢ 9óxc Ôðq~ì˜ Ò‹™ÆpÇxxn ­¿!ó”ÚµrLË÷ÆÎcYÊPÑY§¦Ëþ XHâpSÅxHWï98×?Ýe0ùTá¾]ÂÓât|»Ü¸†5â6wÄó? v?0‘³Æ9b½Š]çKœªïçPŸ4”Hâz0Q<—¥r ÐVÇîž›šáÍYÙb€LG½ö&”ËŒiP¥Â×ìK •M?Tôõ=b¨9ð™Õ‹|×ì76×Ù ½£è_Å:öí–Ö“=ÄïíLÖmW Õ»Fq¡òHwƦ@ÐÄ5Þšm˜r;Ùh ±·ðï­Ñض1Z#³9M·X×ôQ…Ÿen« È¥ºÁwhЪ͈¿€©:Õ¸Jé9¥4åÞã‘ÑÌ~‚)ü‚2Yß*¦égpÒƒI[$×éÒXK&Ž†œôz”iú‘y8!sßËOÓLrøÀ;5©]›µ'náTî*wµðd>­Iéç€Úì6é¼Í=ifÇ_q † ÈqŒæž4›¦^*ÁbŽißtNNbGâü´ËNéO¹fI&¥:"?ƒ¸%ÅKYVc|ãÓà8=]OLÜÙújFIy¦Ú„C®|'=tãÇÅŽWqmöÞ2%¡˜¨Ž<ªƒ¹É£—GÓpº]u’‰sdµ¢“dß<È•¡“ íþS$¶·cb„crEpËgQõÃQªý,sŒg7Šï®—ö¸ŒÀó¤×Ù×GÑ–Nó×ÉÉfÛÞ`Òiwàª=ßÃOÔº/ayQœ†Ì¦tÃX•ÖJY"Д´G‡œï¾ |£Ê#¤³ë|Ž¤‘P3(jA‡F{â«{‘’¡ÒôýBa„pI*†»/—?ÑE­|LÔ´@.’À%¬*˜ß,‰Œ8z›Ä0—Ò® ~[®xÔa×Ía|„5Éi«4y^‘"3}¨"î+ñNñاäÀN÷ÓÙK±Á F˜ÑU›Ùai™äTY¨2Sû~¬·C·e ,†ì\nš~mq£¢é°7Ô‰[‰Üã¾¾£í܉‡5PEŽÃ'øโ,aÑ&®©"¶$‹—)öôQµ’œçñÃ{°äTš>¡œžeiÙæ‡Ù•²µàå7ií¾ÞQib½? é–—=¾Þ3Ûj/ì—?l)£åAöQ¡o/8]ݛƋ˜/À‚Çͦﻭœ(­Å-lmm²¾6øD¡Ç¾•~ÈPá Â-²ÕÓöÍæ,ËÆ¿yÓ&Õ—<2B*Æs=„Ÿ4 7ì«U´¬(Ty1Ó¨›5£ø/YÊEû«"ä[1«¼¬%Æc]e¢E‹ô»Él?Š1â S‘Ø‹G3ütI\7ô4` ©-–3Ä Gܾßú‘fåšÿí§8v’<ÃÏ0äµó]ëûåc°oâw1ÄVî5.+¼rدoèF‡¿FÉ8²Ž{|$Ïxä--"ORxmÄx‘¯* °Ý’^-å¨),2Q­ßÖ¦gWJ²¯j;±4(º³%m1ñ™ðqòS„^±§¡Þ5* G¥Còë ûÏÓçÜ:s1äfÄ»O¦r¹R&¯;–iáDß&x¤—¬Ï/sÍ-,Ø;0 ÚU Ë`L:òp¥D¥ûyÁ©-mÚÍÌ’ÚLÌàH±¿ˆ¡i$ø·g-¿µâ&4ÚßíÂ@‘’^zÚdV_ÙÊ:<8kd?CÆ ~¢/ø¢¡zHe£öSo„M:O’}yÛ‚z6ò]¿,þ¢GäM½ŒaåhŠ¬â¼±±LË$ÁàÚ‡;ÝÜ7ÄMpÕø2=\“·||¤WcOèÛôxÙNã[_¼Ô26ÍY!S±ËôB›5nœ;ÌFHPòƒÊèL/ÎÑ<4bòdÒºñL)ÛÀ/ õ£\·Þëä È==Ûȹ»Vã2•P•oò ¢÷I¸õØÝŸ†{•Î„q!lŽÖ?Š™¹¿åÃ&_Ž_ıædûz »ß†£~4›ÛÛ=ˆ‘Ìî¿~d³ßA@èñr=p¿‹¢7§ÀP›3zs¡«ù3! •hý.*€ æ IT‹kñ ˜²„§¶Kí3+­ùzŸ½Lw«‡yªÇz^v+ ­Ä¥8‚Å"©ØŒ~užÌù˜Ù¢Ð`¤…žÞºÍˆã7|Ç-ýV*ZéÎixdQüÃ5Óæ›þ û‰ÖÄÖAí3Ã-Pè]û-Ðb®ý¡×L¢´º‹ Ó€¨èØ2Ò5ÓÕò.u Ó-û,Ÿ€ŠN×/†¦vfø@E³Š7’M˜"ŒG§£Z¡š]ȇæ"ñqIÛÊ?ÐV¥n«%oªF!U˯Ä2k:ˆ” pž¬O-ß°;á !’†еϗîÅ`·ÚæÆD8"t¾‡Qf»èïgÿÊ÷ìÁÅǾþMF'94}­øŒ‚¬Ï½nÔ~»Ákû£U/|FØ«pâ­px,ªØ勪~´¾`5 b*t…j㹞2—Hv¥ªEѼ˜¡êsâF…I2ñ"Õ-9Ú¤6„"ÑÝ."GúáRô™_ÛäXµe¤žW/„{%&F[Ê0eïûÒ£­`ê/òO,ìaçT·£ –Çó9@[Ùh±ã3ʹ”iÄw²(õ†˜+!™=tWÜýÓª7ü5}£‘¼ËÐs¯B¬£ý*˜>‰’v~m]Šy=Kj9DH¹ù‰5ß®’òPTh'•ò`¦7<Í{ã¾WFÉ8¤¯g¹äIH X?·O•!³ìù*±Ä]¨š7,ÏÍì¤\•-‚<)B=Ut¼.C”/+Wì©’Ö~@gòsX`Ÿ—Ö™W‰†0üFßý;´ÔnŒíãbálÌIÊØ|aTh¦>êUò¼.ä› ¢gè¶Hîi¯|¤gðÌBܺ± µtY« ¡ø»Ðå(Í1ÌãÒ#Í}Å’3뉞ݱâï\‡VÇ Âض‹H—hÑì³iëˉóûÀƒ€Ï—ºÜR!Õ{—5ò‡-_‡tÊI¢qq²ÉC¾é{o"/x,¥Fš97Ve38›’Ò#ñ .×Öõ؈z"ͧ“¼MýHgaOhaÀ‰‡‹91¡_ÏQÙ –ѾmmnÀ±b…[’ÓÉnO=›@±À:F,݉»ôžØÛ?ÃQ€Úw’%Y<‘ ˆ­UÜJþŽèñë¨ÁãøçÚTɾ£dKœ<ð®ï_<ñ¾|ãEŽÿÒ“Ä‹ž—ʽÀlTºÓèÿvJ1à¼Ù£õ#™D˜BkJݹ€[9w›Œ¡"5 .|©åÚ1ókWç'—¹ ”ª€”tœ:)°›:°ã¾f+½Ý4$÷=7ùç'ýêˆ:”’Ü;‘ vŒ×Ýî}øÓòØ¥ÄÕ[åo—Ï\:Õ—S…b5÷2©=áOB‡Ž´²-šwÝ”Rï†h6ù\:ºý¢'Œ›u(¢Þj¯ª3E xÝ45.j.xÞ÷žj n9qE–yo@œCøR5xõw)Fl´å¯êïñ”+‡vj´ÏèõU$V/Ž×>f «]õÌSmUOÄ!esóH˜“ÉðHò…À§å¿ôÓQ{Ú[V^’®¯)VÎð©>`ræù?±`¾æDjMˆ§¨ æ¾F”ŒèàXÿ¸æ,c¶Oþ|y!yeìÛÏŽÈÖÛcÖµCf¥ ÷Ñö,/ª#É ‰¶W¼IèÚ§¦x`­\9É…§©œãÂIKÅu_ê„YÞ9èöd½”Ÿz|MíÁ€q~×Õòno* šÙ…mg#g`R™œ(â!¦QuJØ£È*m÷C+-–œ[Pg¬¿ïxûŒ‡Ž¾L³HÓܪ¤C?g¬:ý)Ä=}‹²É;qŽ0ów„‚unEÜjz?É<ÅÍÙ:LY u¾|E{A¬ÆÃìÞ óe•¼Ø—F1¡ˆŠx~bý«H)\išém›×2féB†³rršdÚ”€•ö•‡?œÛNàAá^¨¢¦÷4Æ /›:7A^0CvMÉ¥ Quë –¬ͨѓjú8³EYw±#µÞœûì‡s_0y‘C¤„9ÂnXMl‰/ɤÚÜÊ\x«^b1µÈ€Þ(qƒB‘ƾá’SR¿>Õ‡žæEM¶Bù¤¢„S¥åiÝ3Ÿäн„Ëñ´ˆ7É‚9¡«èøC÷ÁùŠ&vuÝó.ÇÿVfêK2,9÷\{;¼î½¼wµ×î­ÿÑŽkÕVˆï2×ó–Ã7Ýàîpw8¡Æʨ-!~–ÆηH®pá[³m°Î¤ä¤tœ—[ç¸"è`n¥ÔoF>–¶#iæ­$ åŠIs¼•ÅJ%Œ‡˜¾t3¯L='#mÆÀ¯Ñ¼¬’r }n ôe{=U˜O{ @Dîàþ# \@êõ8õŒq/¡Ia5Ö¾vNò–u ù†÷ á¸Qþ«.Œ, )e@*"²-ÒEw°ÅÇc¼ëlÍš†txu¸×ôôwAÄc¦ë>º˼Wî†ô 6ÞÀ¥pz“w F‡Q´a67ÍäQtÝqD—%4÷« cÊ\H"Ž?|‡n³ ^01à P ø¥Fœ…ûx(*Ä/!&Ò1#ú|¼â‚ Ÿ.<÷[VLj„¡jŒ…*8ã)ØÊdSä·Í0Ú½ZF2I0a ):¦¼pÝ8WS”h¢ä¬0ã‚Ê7h< ¾"iGß“í¨8ÓLÑ!«ÕWA âj¾YîT¡ĸ½.~—î†^ÍÓ-Œ}Ö@qLƒXb«2IQÒ [ÍŠ¡9Ð*.­7½zðö^Ñk3ºñÓ„é#ÏÌS½¼mõÐÁµfÁE¾Mç© ÷ÏŸ9°ß ¾'ëìþÎIû§/ê$Þ´˜lÉõ–1UÄ´OJï'R—{Y.c|ß{™5¥¶W^J¿÷£ª“Ñ°¼4li(·k°vbZÚ] ûK5D2z÷xˆqf/Öו´fG.U·4[/V-uFß©,Á†‡´|܈ö¸ö°!ç.Š‚ƒª¹«÷FÆÀPÊŽ'Q³{Œ9ÊÛ9æ+ŽqR±î­;€F^Ÿ\X¡THã ÌDH7¤K€š´Îÿ¨"F#϶´ð|å,_×cºÞ~³ÿø{‡ÈkÜ€ÀÜÒdì*A§Ï]€]ØëgÒ:+$9DëuöÁáÑƈÝqv8çI›hhÌ^7¦àà‚°)TjÝ¡Ýs‡:Ž¬GÒ„ˆ,*í¨>”àªç&oºSé3¾%,í~;ÊȊ„ݔØõóÆ×Iíuƒoí2Bø:gY‰X€ÖÂ弡*ónp‘êÀŒ7F“G÷&Xëfn“Û‹|c²cT¹&Wõ «ÏL!¯³ekK}®ÓmÉIt/¯®Ÿ.oB*YBÊžÌúcôyê°ûsÌG·žŒçê'ì3¼aF&óù˜x>x‰çY Ë?¥’.G¯_ £mÛ%¼¯''r$|‚B‡¯eÅ–Œô E„kA™qWëíb 9ò©»Ð‹ªPuÅ]( 0<³Q†Ð@ÔPéúò¯Äk)Ëú` kÓý€Á$¬&yw^lŠ„Z7mln¤ž¯î=÷´G£0À=°ãq‡¢[Y ÔÓŸ ê'»!O‰ !S[‰ÄÒ¶š ¶‘n)Ú#d×»Æ>5Mm²à‚üB3MD|J‰/€ÿñұʲg^Ìx®:ü3aÔV:N«ûÝœÃ÷ì% ¥o–+šÁø…‡—ÝÜú}–î*,€ˆ±7öKuNÀÓ)‡@n¿ïTtÅàªÝÄkÉ‹[Û8 ›ó‡²6Ém…Õ¶¡L¡Tò‘tÚÒ ©<þ…TÇô´šœÉª—Áž‚÷à«›iûTæ=Ûõ ÝÖlÆ-;§Š˜ß±¸tJä®#_HÙ WÜ@ã)p¢x*“/ÐÁ¤:6ª*j)eeÝàm¥ÿÄ´ñçÄHÚ7¢þ^6Á·í@­2 IJ¹¼Ôjψ«x΢éæF‹†Mí‹6é…™Ì6/£Ý“¢t†´OÈŸµ8»ú5s¸§ì\ídÓ[g%N[ó=NTÊÃðÚCÄÞj•]|€¢æiWÿ–§]º%NWøå+Ë×M]¸€mŸ€ÒsØ7¢SÕ~·QÝŒ¸çÄcjÂÇ‘ÿÖϤéÈóxÀ;jú÷ÊËÐå»»#nTœ© pøšh‰Z¤˜•ûR@Ú[”,cM=Q"|¤áw¯|4ú Æžþcb–¼À+Z–WaIbNæó>v¥•fhC}ß‹?¤øär ‹-ØÕe$ø9ÂNPB¯¿±¹® òª®ü™³ûöÐsÒDÏPúŒµ~õ@¤1}û-I¶éy¡™¡ÛI¬ú§š)%8g5Yë7æ×@™,¢–×çBwvу'rt#¼ªs£˜N†÷/¦à7—9·Zk4¥Õ§y‹N9¾“Ì(${ÅfW^úý/âè[ẻÃ\gx=W®Ò=¤ß°ç~NïR¨¯ùf)‰¦uWt5îпsÊ– ^E•¨xY‹ò@º¼Æ×–WUв~ªˆïVœ,2z$žîYl¿ª{ckg²þ9àM +®Ì×ʼ0Û¥zœáÔ骋Á3û OþjúK~#×°…ïGýáovOöfû ¡ßBèw.´Ó€¢Þ¾W€ÖmOI‡z7Ñ–üJ¯ýŠe`#?ËËÊùæŽû*’Æ468ŽORþ²0º£z8ÖÔFjÿs6…+[?|·|ô÷ÎéÖ-õ;(ïäÚBXy7¦ tý^ÒNKª½;âeÖZx>Š{â0dÚߎ—¿^=µ®9˜×Êž|,î= ïs ï FÖNœ(ÂÕôx;ßÈ %ÞºGüÑêqoÖ‘óÞm‘ÓjŸ2sÙy,ÍØžÇæÒ]%ÀYƒ·ÉçUëº'èR¢€rœ–wöî}Hs÷Lø˜Í~s"ÏÁËWlÉÞìP¤âÍgò@:YÏ]l}˜³Œ™w±… Ü“¾¡ß{à•½ y›(>`XkIÅ‚£î“›hÅQ ø®µ–›éï,rq ‹ÅVŸ»x)2[m·a¥sYcY%,T¦ñq­nhªôÓH犈>HÕú?@L0Fa6ÍW5¬CÜê@„'Yd i0úàgb$K÷~‘R,ZÊ ×ëT‡æÃ^Q×NW·=åÎäˆcŠ;¿&ÎX§—‘Õ4sYã–Ö4 VPt¢èTÎÞceòÇHl¨Ã:©0^¦ úkjG)+10™á).ÕWËØ|î‰êC‰¼^ž?œ¦ß'îÆútªVW¡Ù‚Nß•ŽÅV!÷™&$<5üË1Òçf¡™{çcu£;­k¯®ñ91’ú£éúMZ£.ß8לdb;/×'BˆÌþãunlX4 °¬AšÀT–$$Ñ[$÷¬}Yb{H=ýçßÌvê›ê?:…L•F~;„WyèŸ<§%²êF.a¾¡ÂaYĨ/ؼYõÚìt¥Zº—øfÀd  ¥‰¢W“Âád´cþ±œÒÝJ}4#Ë­Í-¶_娄 AÍm¹Ÿ<ßz°Ø™¦K§¼xæDB 6”Îè,ÆFK£~¸Ò÷EJ¢Ã;Ç<ù*Ü ”9›Ç1 5k†Z°¥ëë‹»ke]…~WçÓ†-Žn ÉUŒ¾½{œ¥…Õº)ÔšX¢p´¥ˆÞrQrÙOÉ°àI0%¡úò¸‡POÍjWŸ$½O‹Â÷¹‰«š¼áΊuóíB'N¼ ‰Éƒˆsès%úêòÉËÒ©gå0áŸ4³g­i!ÚÙ±\E^ÁX‰ËròIRŒXª\²úŸÎ:`¿·®Ïw"•)?¹á|­è¹–˜´Q 1æX N°ªl„dY“‰z»»/iì€Ij¢q_Jô3{ûV–¼¨¶²;¥€­†‘¹|ð}üذٕ£ž¸v)ka(‰¥6¾âÄ‹Å‹ ]L¡¢¢GÛd>òåΧ@’&ö›à ý½Àí>ò¦•Mw<.º†Z&‰­±°RðXú›iÒ績¸6¸UjúÈp ÛEÔadó*vv,<£âàñÙs+W Ù“ÐCæÞÌ ¬N­ŽgÐû.Y¬ã΋F#T@N9 v¨¾ï›E/IÁR2tÚ’kj—{7°ö¾ì´œ@}Íø^dúœ`C|Qü· Ì'hë4ªsØ¡ÞÜù›yÆF1=ÃÁ¢K s[·j¤„žÜ$Œ½H…yd ¨&ÉuOá ÈvË«v ÏÌ5¤…‘´$?­Ì¦½ZÑDIIÿH_t’ óæÐ.¨KàyzÛ@{[q {µý…±)ì`"Ý@UüÔÀV¤’V€"Œ‹ ”£V ú°xz›qN6“`ÓIE÷£Æiz9œŽ¹|–‚ØÛB'˜hM]´ñ¨i{\⺟ü(PG1/ñŒ-ÖQ‡_viâ¹]Wà¥*XïK,wâ\ |i?gßJà°Æ~HWäôN劲Ûb{2IR"ƒËtÊU¦UÛ#98cb2.tEl[ÑxÒ$wùäÿ£m8DªŒ>­Þ›ÉÃÑÐ:pp’\r˜Á\þlÓx™#@µÆù¢7cÐà âRøÝž’åØ#âñ©fDsi‰Rc³;™Ç-–…/ÞåE²~ Ø#cù>'Ñf9\ í¢:³lâ|xõi¿WïTŠŒY%O g|Lá÷;2f¬@•Ò˜{ÄëîÂy úÒòžLÙ X3/Ëõñã…9Œo6`Õ¦Äø …§øà‘õNP½$øW+±Hý,¾'óðÒ˜»3UßÅ“~ü¦EåÜÍBȤ8—§ Ë;úrÄꇟjKË'š©½• Ž x;žˆ·Š,ÉÃ7¿Å¨Óéæ|ÜÆ#æ>!¦1Üht‰ºIegu®†hC p³òP²‰È7Ä0Ra ßò-èÍf# —ÒAá‚$§Õ”¬# ¼o-?mâ0Vã`O›ú\Ä­—]†YŠ£/Û * ŠÏøuTH<ÑeeÁà›¯HA “ß=¬O½?›8»4ŽÃío{ÔìèÅØ7oÒtOo!Z‡Cbä¤üÖ\vvþ=l©>6Ð!.µq³<¥Åœý¾Yký;æîÆ”Ëj ŠÛLH>· ¯Ĭ‰°U—#¶±~„Ù¼¹Rçø‡¡0ÊÝ©--»÷ÆýîoX¶¬ÄO‡×ا?Ä6¯;¢„ a¬ b±ºËÝ~(ŸÈ¯ãK¢TãÑÎ8´\÷¯bï=§NÏ~ÿ¡ï+߶lRá7ߣÌ}ëwî£ †Ñ 7ýµ°—_ݘ<ðÇSøøëóÄ*,³ì×ê·ºZ"@H×ê–œ„Ö›zȯ+Tf©˜íιÎü…;Ô¼UŸSxèQ‰dað š!ˆ9Õª%p1ÑÙû™ýw€s1ö®Öç8Æ€f߃é/öTÇý*?a^0²w£}5ˆ·å–1ƒ×¨¦¥SÔ4äãЊÀ<7˜ïÞzªÒÍ4{ë?yH?Mý˜Ÿ ½’¯ ÝúƳëãÇÛ$‘bãDZ,³2Br4îØîÇÄ‘Õ»9…H±»¥×ì2JSáÜ(i-›:€’I¸¤­š=kƈÚ0ËØoôœsÿ³ú5 ³è¶¼ŠÆêÙoòGä€÷ŠHˆX°³w^;º’`ö Ø5É€#òÄNjò¾LþR‹y€ÇŠ¦˜:+{WšÞT š2ôI‹õ L¥Ðµ“ÌE±“ÊÐèü ‡ë…¥e^eÉ ~nŽ’¸¹æÝßF‡ØI |¢´Ÿ “£}ˆ‰ŽO®Aöpy‘{îïeÎìµen4Ý̿ι–vø†ºX¡ò@/þYªß*ìkþ FõÀha ÌëTN¸wµ¡¦&ŽóëtD°Ý‡ƒg††x¼‹':‰¦ÆuÈ7YoÈÛ #<Q&Û·& àô²óí%®M¶6?­!:®hŠõ°Pß·Õb¶†YßAªÊï°ÜÖ°PFëÝ¥J|S•òª ‘6´µ¨oGêK”U1•í:óFzûîÅלœ| ÆÅ ‰âh!ŽøÚ͈IÎOí#k­¹~v³qå¤)i%Sº>§¸¥DÀ—ɦÝÎA[Té8É— 8!꣗A;Év_8‚à<°+,èáb•W‚±Q¿áüƒ½”´È¥]Rä“¡Ò(=ò£v»Ê¬¿Ñê£P6K’ÛOˆb|àPùúh`úÚÍ·ÊÖF¶ˆôîo“ ÜýÒ–cmØðý²ˆ0WtÍã€ÆR<}4sS¹fä>væ,"2ƒÎ”R_Ÿ‹4›³eî÷E;¯w²…ü]–‚ßÏ\ž©s¦È¬U¦·Éº€¼©àå_®Ú0ˆRGH/sŽyÎwÍ¡ØîÑ=×í¸\ÉÇÐD±)½| qüôÖrËy[?ùŒ"2À‘VmlSfˆŽ55Ÿ¥„€?5@ [”èÔ4²MxŠl6ñÄV~XÖ®÷îÑÞöœªãñU šÈ‰½ª e:•æPC6…vå¿Zìï,r)½¬ºž©˜›lÒºÉÙÊÝ@d;ãš d¢ó'1•ï?í×|ôzß_2²ûÿ­RëKA  ¸3ôæ/X\©ü1hŒ•)uš_€%mÉÜî•jFO¼ùͨsè×ða¬o »ÆsëÏ#}mþøä“]Û¾&Éf±NQÉ´E’,W‡^3îÅSÊé.MԀȳvœïÖúÊç9k-†3A‰ûsbw µL? |u\¼cç;P08û³Ýe@·¹ÂUñ¤Åó#özÇîzæËjt4'Úíe …^[dV3—'µú Õæûƒœg´A>ÆÁŒ½>`—bºÐ¨ÚÎBÓÂeƒÝÀ»uð-j_‰CitŠæì þÛRP¤OĶ¬P:˜»ÐÐÐûiÌœÎÅyƒúüˆö„{ƒF—)h:ò‹*9\u0q¥¾©© Ùo?ÄšøÚAñ†¹ í" >YNÿý¶ü0ëœ,§$øœ‹W(u.À²s­tÛI»ü¦ºláñ¶£rL裨ºÝM®}†±€hŽ`MY¤|×_¯§ÓHï?g ’UÉ%¨“Ž#œ ]碟Lå(8kzРp¾´ 8µÛ²Yyo‰J¶ 68ôÑÔa /$HÁ¤b«\³¯ÞìÊ«]ùó¿8þø? ù…1˜R[ú(õ¶[°a…EC0wqìWêv^Y4°&ó%»£o5†i'O ¬¬{k Dµ†6r`Às ¤€órõòóŠ pYMPÊvv¢ ÿÇçaZõºvZá]—óÚï樢Íàöz»DªQÕ­!Iù7HËUüg¤ž´µ ®îxËôÛ5×;P~ ´ßÒ(G_þomt?_MaÞ=·~ˆÚÎ3Âd²)'%Yéb«Sõ­´°—š’­Äk ćÎRµþš` z}È|xD.%,£8QGï­D¸§eB„ëu˜Ê¥”ERËtF®ºhÄ¡w½A©ñ•Ö´þ@èµÎ`íš¹S1ÿù*!íóØâ¸õ²‹š =;许k§Wì~Ö4‡“Á½53¿ÑLé†dR"‘ÂwÏéi!a•²ÆëZúøîÙ=XzÛc2™r]IAK¸÷®\ŽbgŽ°õL1‡j™)­ƒ‰V­þR{]z=ü°–áîf‘•W#ÖœŸ)º÷Ö6ŸF0r.¤†òa/Œ€%"T ^;c}ìàZ4¼ûk÷ʬ{êŽmæSÀ*’ÿŠ*‹·R±“ 39Ÿ2sMª$&€ËW‚æáåK›¢ÙôÐ1mÒ!qZÒ5ô§@Oµèƒ>CEÅ¿Ɔó!³ê#ªÊ&Í9Ávß—«ÙJ ÞQºã&¢už ,äP†õhåŽl’ðmòÚêÄÈXàk‡Žó†á?.~>’SsÒÈ®²K–tEHÈÓk”ÚƉONoôäÙAWhvŽÐG.E{ø`dÙãâ韭|¹]sbã䯚q2.m>é^’xÝT iÓaÃ&t>!‘ñÂÆ:êðf(‹ºÔÂ8b½ËAÝî ëÕ¹vË%ÑOžº/uƒÝQ¾-RY±@jqÃë¼´x6ž7óãØ»¸Hàw-ldq´´ý:ßãíÖüu“t™‹>縌݀¨Å·')v+öë0&$‹]øÕüÏõµëc yñ‚­’mìŒËà O˜Ä÷˜ÝO¸¶ü”ATîÂÑ/¿óhÀD /µ¢¹³æ+Sfljàm7Ê¡´ j½²à½ƒÆ€.|nÉ´£7fÃ%`‡|Þé]r@/MI1%Q¦|3i׎.¦XGCxˆÅ4…#}9Ÿ&w(ÿóJ‹h˜­­‘½Ó0sÖêWš¶€NñâêÔöô‰Ü UT$Ä!(¥ü!¹™£!L=lƒ7¬²œüÿT¥®Ë¦`Ï u$Û›æ›æšñ¾-éoÚ592±*Asþf 2Hn¥ãv‰–ùÑDmŒD1 —o!Ö´²¨þ{´‹#sh:F·È'0&7uå# ì™0úâÂF“GF—@’æ•Lhãi''åk9,¢±kŠœšóþôe Ç°'^èã:‹ÃöÃìø‚µõ ƒ¥'ÕV”uOë(º¼›;üÀI¯†±:×±ým&XÇÝ oHCØŸgÑ)P‹#!ËÜp¦œ8¸uk¯áÑpîMNj⿼&ŒUÓZ:Дw „¾ï¼<€à°èˆ1¬/¥ûŽÿâ¥åÑÀy™Å›0ÎfFáNŠÞó¥×Br¿2MUf–¶&œ Ž“&þuY5‹4yæ 7ðibÏÄùvÔê³sÏ ïm1éið¥ÙM/p`ÙËh¾OÀC»ÑĬaÞ1YðŸ}ú.ê›~èoÁ)ô{}¯^{LîxÛ$£\æzp™Óî­º¼7²e¶ÔM¿€#ÛÛÝl‚å<¾#ùÎékÐw„`É7|%U å eª›)ØЛÌåbCOÔ_Ánº(ÂyþUˆ}VÕÇ~7Å¥çÏAæàÔGPúiOã)Éœg?ˆO >ºK=]Re…*’6a°¸Ó¶ø±#çé§+uÞ«ôÍ籡³~z´²qùH º `²R‘?8;ð÷—¿¯V(óù‹hî*žá¼É!,/‚^ÉNI^ײ•ŽmŠ¸L L3ø)`— É9AxBâ­~Òš'ã-©Pp:ÃRJ‹ö:†Ö,˜ã"  í»žÇ$ ý»RÝ Fj)Î#O} ¾OÅI*H*³Ô%¼œ%c³âÿ"6{|){“¦ÕC+D¦ä•¾Ü—Ö14Rü4Jþ$ÍkÎZ“Ì÷ëú¾Ýª‡{-;æ  2ðK ‚µFmÅät;´zýÊgŽmÀRjј9:q$s0Ÿâ “£›=çe»ù˜§M¸ÝFÜØ0g¸]LþDIËjƪ»µ‡Î±Ù;œÝ©Z¡¼ˆÿc†øÊ"(ù6&w¿W±| ¶€˜a0/bƒ âü³V–õñ4C©û363ö¬ûO¬&n^|ó¢¬kô(Ãù0¨»ÞJÆ]ÉدŠØ‰>zGÏÇ©÷ëbýø ñÑöwPR€¥áçöÁÒ¼¯90HUy@Ø¡É”“ŠÏµþ(ÀÇþ’_ãË¿‚öƒ@1Ê U[ô©ñåb4ç•‚ùÞÖ#á7”?/雲 Šç º;Éf × 3Õó)“Ù ,JJ¢úÌU3t* /[,!EÒY\~H~¡*œ³eà 0&øKD÷îV ‚'-‚ÙgËøÿL¢ðOù1§sûºŠ„7BĘL`ß $-O$6È à¸ùáO;×Ík»ßІÂ&·x_…bLÝÄ&òðm {º¼Å÷¸ÏȇÚ#ÈdD#ËE²íZ˜à5ª§°Í¬ytyM]D¿UCkµT™¹l•MJ'Ù 9‚fÒôûÄ|´Ï˜>„$›k;e²j•ÃÉßI–"9r˜”q^¦¯ý–¨Êä] Z$6·”ÂÇð [gy÷µ®à f¡åRq{ÅEð£ƒÍ½§æléºƽ„aå:l Ù¥uü­Rõ43 2}mý-Ä©´~ 4¶7¡{N´Yño:å¾ø×ò‹¶ïþúñ”;i?æÊ- §å£ßâ}„× ·¯l>·o9›>ÚZÇdq_&Š~H¼LY¿µšÜibìôXqz¶b'(œþ©r€%90Ñ/±ŸejÊlt E"ÌE ]üîÛ=‡ùýýfâßa|4p>€à©;¾†k}j`_™õMû°0Ú†ÉÊ I!Å—'Ó¼^º±˜§Ò Sß*p{ǯÂÛ@´© |Zr ‚í³ŽAÚÁà)ô—⚎*ž ó3  „~Õ¦ÐFdöº–ßFgæTϱëAšy˜ö˜Ó9Õ#i¨¹‡æ@ýfxÛ{€ƒJú0+Œ™' ººw7Ñ2l1õÈr€¶8³ò¸FI'=ÄIÌ‹åb/èóÙUöæÛöÈ[êÿ.C½ûÙȦö%«z].läé¿A–ª#)Xѹ-$ÚÎCr}⪎Vƒ®è¿³:•¹ÿÉÅ|t(½ð£½ù¿…1ªg‰¼ lRQÇ%.ÁŸç’Ms.Å´öŠ\¬.Ï…K«æ";T®* É8aW¤}?7CÍæÎ æ9‡C„ K£È¾åÁs›‡gYRª1wx¥ë£­ÀyÑž¨žÝXE U.ìÚ³CÇ*Yn3á;<ËfdL—(g‘gˆBƒ¶*¯èðÖƒN|Qòj±ÊŸdúcÅ‘Dª¸¡ð²NY’ñßɘÂÈGÎä ¹XÞJQ’ (œha÷Oºë`x´“õ僚¤üDàÿ”¤ÔU¯€J»e­¹pp]gñ'Ú= :¢SÖªŽGÝ;ε½öǨÜÏ0Šµ Ï/Bìºj7vƒ˜Ï;Cu*ÞóD|9/RÁ‘ÙoÐäÚVx<5iäw, Ū‰tVx[{{ØÓƒ¶©Ûá;t \­LóOgˆk'"• ø±\‡ÑÎYÜY¥¯"¾ c‰`´‘ÈûQØ»n€‡È4¨µÛtxqoxïT!˜Zxà,>æM~µ¶»÷Ÿ×ˆ€Íl1Ñ÷÷ë Õ`H¦Á+Æ:5@BGîÚµ‹•6™røsØb°‹sÔq°bQö†VÍL¯´‡)r6TǦÂQ×t2Y›Qšw‡ ƒƒž.q—-íâ¿îðô¡M«®Ð%°Ù =ß»’Œòg¸ø×:õ—Ú_‘ê mt+XS›DjÛ°Á%”^7÷î\hÝ}2‰SŸFC)É\š}ŒŠÄ"âÜš::HžlzX»ãøz†½_ÄOuc³CV¸Æ ÇŸèüŽªÏêI Ò¢ø8òªüK*×£ùÄ/dh 0% (å|êè6 VDƒ.è=ÕŒT½ö2BµZñ— wÀOˆvN[]ó##Ò‰cö¶Ëz…Ë…–ON ñý¾›Fcsqüê2ÕÇ'¾êîH¤›k² WFkdÍܬcm=¢¯¾ö=UkK8nYr½­#³SÚg²! ²>Ö K€Øر^Ðu“|ªÝŒ=ÝwñQ5KJº¢Iå÷ñл$`\—Q 9J 7îg*ÖúÞŒ"yõÇÒƒbXÒç¸Íº^,|G;œ;ã´›yÊJJ&~—"Ÿ{:å)W8Â1n~û 7iòtNÈ?î£ôÌ:§ã§åNß7¸®Ã€‰¦pq£kìîµb_y÷§V¹NqPi±!ZJÄðû`ÏOV–±ùŽ¾É-Lªž˜œ-h–=ÓaÄ[A«â)ˆxVÅqÕó:–}$[ÄM=èA\ÉfØ}Ëê.‰>_’X¨ BûvÍé’^ªÒ4Kk|ˆÃ®;D’^4ù*¿¡wXv¦uŸŸ·º|'Q¡p굓Ç,T”2ïLÊDÝïËAe¡@fŒ=f|œKQ;kü6ñrš€ñ{ÆZžœA÷E˜m–¸$Æ©õJ\Ž¿©1Ëw nÃ:ó…(ËÓäv¨ hŒå1goØHOw4‡Ö½"‡µéEÎ ˜ endstream endobj 1934 0 obj << /Type /ObjStm /N 100 /First 967 /Length 4090 /Filter /FlateDecode >> stream xÚí[[sI²~÷¯èÇÝ8á®ûmƒØs0àÁ1À°˜`bC¶Ð"K]f˜ýõ›—êîj¹%_ ÎÓF RuuV^¾ÌÊÌ–•Œ®d¥’1•5ð­u=|[])ã*cN|e“ÃI¨¼³8‰U”D“ªäñ–VJ˘ŽØk ¬Ÿ€2,ZER`°.á ÈœÔ8ƒMI@²rÈ"Y ð¸?9`äƒ.ƒBÅì pÀ=JúEäžp‰E8R•D «€ »PiéQ†‹•¶¼#U:y”L hªW•…}8ÓhŒtÞTN£¶@ 3B Pp,ÍJÆ£ Ÿ*ï Ô ª 5Þ‚¶þ€Ô!¢ö!œ¤_HUÔ¤UTUtåFSŤpMV`<0Žˆ:"Z§RÊ*Ř VRjw Ðð3qM…XK«t¥5\I‡p ÄÒ0Xƒ¦2€ªµ—1è*T:¡Ûà6\+ƒSÂÌ4ú=ªC”I蔌Qg ×ÊK„©”4…Ar1â£b )¨GÉòB®Z:sR`¦ìÔbÒg÷á•q¤R`ô¡šb Ôé$îð@‡žÔApHR8  €>*ª1¶Ñ;:®Ác+ ¾Ã Р“Œs¸…hLDø`bAjcœ’è€JV§ñ Že´ÔD8|h¨‰ í4 œfZ ‡­´äP<5Z,'Aüýïw%=^Ì×Õƒ•8Fñ í9Žl<F:3ƒMâårq~Ú¬«÷•xùø¸¯›¯ëªã÷úÏ«nL>5âðnæëžHÚ ^5«ÅfyÞ¬ø”ÒÚóæb:9Z|­Þ£t—\­ÁÑ‚¶éÈ›, ÇÑ?œÏÀô='/T‹’Wž„vÛIÊËÆm©JÜÄÑbyÑ,IùA<'â\€ > Òç`.¸¯öà§Rm ëبjŠßHvº9[Kñl:ÿ">x@ÄÃóõt1§âçW'øùËåd:[/þv6]^nVÍrõófýÇbù¥>ÿ÷_Aµûi磎¤Âk ®ƒcPˆy'Cmo¯ÜçõúêoB ru¯–øßËΦ«õýÕ³ÖÖkPVÏÙTC²úNêÝ_¯dj Y T‚o8àZ8wÀ³ÆÝ^¯£j]mÎhí¼ê]í!¥Cmª-]ÈDu€Ú`1æâ]õƒ±^~ð`á#Ô4ìñ%’ÀiÀ˜„jDEŠÚ€›$© @=íH½Õô´ƒ”¼ÞrÅ'²™d!5ÏJ*k‘+$±äM§ã˜v»>yw§EÖÖ´‚F^aë"¸]µvANU   ÚÀ˜¤Íàj'pg’ˆ˜Odº¤/$‰Þàöˆ„<^c0ð)":›ÃC&-³4‹5÷Å|Û*çZo²oòÂXÞäÕÒÇZv…}‘wvÔLaÚnä›ò.cÅs1 ãàžjêv4 7€8+bסÇvÁÁ"x´3†ö¾’ O.<›¼ÞòÖxÊàц%25Ï{*K׶ (8t³ýÞfÌ ÍÈì2óˆ×lkH [A¶vC„1è”A˜ uBü¡£…ð$ŽY[Bú}a"ÌUu>”½ ÷VäŽÕƒË]" !‘ñ”G{_¡œÒ"gÉßšýDß”ÅJÿâêÀëðÐó {…öu´|ß:ÔÃZš÷Ttâ9k”Õº|w›Îu%t'ŠË‚ X(xɺó\L8û9:¥|7H`¾‰‹Îµì¯)[5ý¬°Ë'G5(W„bn¸!´ªIMü-× Ö0õ;{j Y–³²§š€ëxú)Я€U8̤¡Íæ’vºËµdÇé”Xr a¬(Ó˜)"WQ@—tׄ"KpŠ²ºâr(ðœä 6¾)̱¼kEHæ¶OÓÛŒ™g1²¬’†W‚Eü‚¤òÁ6;l<(C;~Ä\Ìt&x¼=eeM9#œ8nh– ©n‡²¦¤1%ò}±Â-q-Q)mâôù­»Êxwkå\eϱ‡rä¸?­:åè1ínï©ó¡"k ¢ƒX ]v¹ûq±eà ®ð˜³B>¶>ÁÉ¢Ã*[K¼NT¥¡>‘ëŠãØ')ÓÏJª²YsEL÷ õî›ìtÑ—É.÷Æ`ZNRlÁ™S‡õ+H×øÞN*÷”ˆ¯ÑÞ̦ÜLÇp*©;ñ®} è Ýž³ìb^xV>Õ=ì 7¤f CmœáŒÅ)îæ*@sû˜(~°<RðrÈŽF$Zo°Ëw62<ç»ß22ŸÑO/ ûžcCÈ?±A¡´ITØYrŒ$9kAÏX#LMm'YSΠˬ“tØéÈCÚÎ5”Ó¢BëZc ¦-Y¿1ç•åWµ{ z <ÖayÇ;c¨ÃõÅø;Éãfu¾œ^­KþÝäÅäî<>==9yñ?ž½UnÌ&ŸV•eŠ#ú»Á¡óÕ¡Æ3 ¼Åèÿp ®ÎñÏÐ>ˆG“«§ÍôÓg¸Œþ@ ¼w¨ðæÉz2›ž?œš5°?]7—¿`S| ÞæMàkàñy²Äbþ"Š#ñH<Çâq"~?‰—â•8q&ÎÅ…hm§ðï÷F|\l–â“ø,¦b&.Å\̧óF,ÄÆ+qÕ,§‹ ±+±j~oæb5ý*ÖbýyÙ4býÇBlÄïâOñïf¹ø+Û|<MUòô'᯷»A¹ã› äùb¶˜—pŽúåÞþ!¾ŽÃïëé»ã—G¿¬ÏOvŦÑ96¥7ÀjöÁzˆ!ÉÀ]àjT‰ë§e3Y7K1kV«¡aAÞÅ°“Ógo~|†½Úe—•­]2}‹]]¸ø´Óªa´<¥xy&ž‹5ÿ ¸y-~¿@ô¼ïįC“à0]}“5ÄÓÙrrþ¥YÏšëv¾¤°jí|qy9)­™_LVŸEóÛf2ÃØÃÓ>g}~þóê3ÙTükG8â0I0ÍXlŽÑ«Ùf%~¿mšý]ä·ÍbÝ\œÍ˜ˆ®h'Íx‘ÃúrÊj÷¾š¡¾]˜Ogׂ}$܃¾KT¼øáñÛ_ŸCTœžî ¨zø·ˆàÒî¨ÀË[DEˆ;sÈDÄ øþ5x›ïÇœþE^X sÁZl¶l·w±ýÕÑ›Ÿ~=fÛÃŽ ³í”@ã­mw»l÷å‰Û¶ÿ@ÖÿL–O·CdÛÖ;U‹'Ož¿{%÷ôÝ.?ëTâ 4 ßÉÁõÆB.¸_Z³rg8›,éØ6ÝΦžmf³f½eëRø“Ï~xò l}½;…»¶½Ðö;¥poLv\Û²ˆA~ÏLöõ|6¹Ì9lº7oÝ&e Se£Ýåu$ãÄ;Õ¡OOŸ¾"ï¼ÞYˆÀ9 „8ùÂ7J |ƒ—o kýÞeh´]j«ÉüÊÑùtÊYy«2í íÛ:úb1›“ÎßT²z¯-SÛ\s>¶ }åšo.Ï@í駛#Ѽ©˜Ý£zQmæ ÅùbÙì¨%¬{¡¢EðäÑdÕÐßc¯=S âßî£wŽ§Ëՠ®ùÙ¤»no¦ëÏ+~¡ðÎ l÷ã×HwPÀË»+°Ý¹n+Ô¶^ x]Ê7w—¿Õ`^o®Ù¯öûR¾½»üíVæšn[ëK°èPwW`»Ÿ¸¦Àµ4i·îî lùk \AW* K¸x¶*ï¶Q݃¼GØ..׸„Æì B®+€ïA®ðEÈ Ö£â]ÆÈ+~œ^¬ª÷ª}G1¶ï3ò·VüVˆæÓPi¾ÿá^BðÅ6db4 3ÜVV1skY˜å|z?!NñK–ŽSä ËßùMïò7¿s?!Añ›7!¿'2<‘ß­b9‹ßOHL SRù; IÙ7J™'þ¼¢”Ìü¿#K¯IóDë|KgÔ”NêN¢Ü0Êt~'ÖøÌÏÄv’ReU–i]øQ6£§\û® íJÌ+^Ù<Ñß"ª )Õ†… .#BvQÌa¨¢½ÑWf·¨Ú—ŠóûÐíK`{ù t÷[0å#éó©Q9°mŽ½lšâˆÞ'‚]bŒ×­7ZˆdgÉåBÇ(o‡ÌÖ¶Ÿ6ëô«œ1«é˜0ñ{¾b¦¡Û9]cgrµ{ˆ/Õ󴵦ÝørÙüNÿS L³y·éwËñÝ/ðŹŒãÖnºÝÚw§ áùÑ%[ת’íˬ³}‡z[ˆë…è–+ۧ嘆ªÛ¬âžÍÊ—Æj;ÂJõ@+»•°ÓJõ¨+¹‡•¸@¹@ö.~+;`5 ²ZîZÊ’•Œc¬:ØÓÔÓt9zê0O{ OÄåâ©<íÁ;–p§´cv܃u,¡N#HÇè8Ž3íŒ#ÀÆ×÷77ŒÁXž¾8L.vpø O ÂЭFŒ äAîÞéKÈÃ侃Üû=lJÈÇ´ñä^ïaSâïGð÷þ.îfãʸö#aí:TÝ8ª¼s$]‡ª“ûÀ–¸³o«ù? s¯J³øvoz7¥Ún~ÛÁo‡ð›7;b°í7q÷NS"nGï«äV‘¨>¦@_!Í^Äu‚vpâL‰¸83”ÖWÔ­‚:V’úʸU·ƒ¡Ð¬µ—5k3i6ì3·2AQI‡Ž°em+Q}Ý´»7–n­™}É”;¹ Êe§Ê;Z_@ endstream endobj 1988 0 obj << /Type /ObjStm /N 100 /First 1030 /Length 4338 /Filter /FlateDecode >> stream xÚ…œQ«çÈqÅßçSèÑ×`[]Õ]U ÆòLHòü0,C2{Íî äã§ëü=w%žòÂ.º’Z]U§%_·þÇyôcŒ£Í˜Gëëß9ÏC[Ïvt—ÜÃ$Ï™z¸{nôcê™k÷ØeG“nŸÖÖú³ŸhG#rk]Ù›rž«Y¶ÚúÏkKï¹¥‡tÜZZHnCb…·¶ìÐsöOkËU\àŒCÇ:°¶æ¡ÞÖζR˜-¯ÒVmž¶äè«Inéчf¿+Íî=¯ÒÆÑgÇyvŒ6dõ±Â:p^¬YÆ×æ1ܲ791={“vXC̲ ¥‘W=lÌìMúa>ó*+ Gª§ØárÎÕ‡ø±ÀUâpC…d’½­p#ÿ\[íÑìW刎˜U°žýj?"F^EÇ1OË~×ÉSl¬>Vª3…\[qL{mÍc†ç•ûÒc1¯«¶GÆЗ|çªHnêÚ´‰s×°8'Š½jÕòŸÜ\Ê7m±ºêKúU<\lÉÞÏaÕ¦f]ÆêMZÏÆêM´çÅÆêMÆÈsWMU«7™†sWoÚ,c«7]:¯ÞÖYm ”ÈA¦Ž,ÆêM'j¿ Ñz›Ù±­ÞzGõ×[·3»°Õ[–i.yÛ81hlõ6DpîêmtI©ÖHmÃç済°bjv" _½­û$cðÕ›õ‘Ë;ÈÌ2†5Zš…gdk°7?=cðÕ›ËksõæÝS´¼ÍÖ@ÃuWo#“_ŠµÈÊÉyIÏpbõ£cÝ0ëîÂYÅh‚sóv>‘fä},0VosUêÓïÿéwÿñõý¾s=þíÓïþá°×Æ¿~þéË_Þ×#ýñËÿ½/IðÇþpi6¾5k·fë¡â—–ò·Ëüóן~~?âõÇ¿|^Ûë^Âÿøãÿ®f¿éß®þÇÏþòóñŸ¿ú§øÍ¿¿þéýmÉ¥yîñ«þûó_ß¿üôë߶·Ìó¶3÷ÝOû­¼òØ¥ë¤vßÕßÖ!wýiEöõÏ_ß½_NüÓ3Èo‡ÆÛz€Ü/ko‡Ïû.ËqþÚ÷×Ïÿõit¹î8W0m\÷¬sú8Ÿñ]:þ8¢{XUèѯ—ÔŒöÖíªÁ°[·ëÂvÚuÏJh=è®{V>6âÚG¯g}'°XÍg»^p®šµk¨’:_+&«@ÞçuÏ*û5vY­â%<Ço¿œµKVyâ–¨¬ò„Ý:]åY7×uÏ*ϔ۞UžylužoÊ]`ÙëÇYß l•§å»à—+®Fm^ë£gžc·]9ÊÚyÛ•umý›æ¥ZÌ}póí—ÓöÁiÏÁ}Ý:r׸VR-wM½îÊ»"_Ò—]‘»ìÖ0s×ضìûã´}xë ‘k= ¥ó:Ø:nÇvM¡g¡ú¸Jß³Pã¦}ÏÜG?·Á}ÄÖû÷bË:¸]1ë”^â²+ëdízKö¬S>ø/»²Nv«ùºº¼†!Çöñø߉md™î÷äÈ2ù¸ž‘er¿ŽÌ‘eŠÛdd™¢_ë;äûÊeߧ}'¼¬Ó”[,Y§Ù¯¯“äöY§èy„«ªWV—µØ‡eo'QT?ùáýëù5žäò-ýËÞ3_@ƒwŸxÍÀ ÔÉ04ûÉÚ3ø[hUgÇõ„;8 |Àp óÇMú›rMð"™ŒïѤJ'mBãŽè,@ƒh¯g Ð À7?p=€J)’ioÏe.P`° Ø&6(`›Ø €±Ê ÷!YÈJ˜ŒîÞ ÊE €ñ `a¬°ÏOLË&e:Æ6•ƒ0L0¸Ö– éU9Ðë`°Aƒu`VÉ<´i¥ßlÀÞÁ`Ó€½ƒÁ¦{‡o¢† 6 ø:˜7ðuxáiߣI™$ðM¥!³@^_•c¿ŽØ€Ì ü:¢Læî7›”~³|Çd ¾cn’sÜk’%¿ŽÉcü:fñ|F|&e:`ò¨NðUŽà;&?6À¯vò˜¿ÚÉ¿Ú©U2w¿Ù´ô› àkç&ê\i€¯ñb¿Úæ ~µsS0L ŸÕc@ûÛ³I•N‚¯rÌ_k\P€¯±ÝnàWc‡ÚÀ¯Æµ_MŠ öÈ¥÷:( › ¡[±öšŒ×M (°y<¼&æ7K|ÕêÐï~³•­{Myl{g˜°×x†¹^g˜èÕØo6ЫU~ñ=š”é@ö› Økì7°×ú¦ÐP€ýf¾ltS0ЫU~Ñ=šTÉ{ýföûÍì5ö› ôjì7èÕØo6ЫU~ñ=š”é@‚KöÚÆ¥{mãÒ’^7Côjóz5+“yدm °×xú¹{mcÞ€½¶1oÀWÛ˜7à«m\ðÕJ—æ[ãµ­÷ÚÆ¥{mãÒ°ÆZ‚_mcÞÀ¯¶1oàW«¦ŸÝ£I• À×6vàk<ýܾ¶quàWãéç~5ß•¬¦ŸߣI™$àéçtœºyÜ|mãDÁ¯¶±œàWÛXNð«UÓψîѤJàk<ýܾÆÓÏ àk<ýÜÀ¯ÆÓÏ üjsST²š~F|&E:ùÅOK¦µW~Ý À×ØU øÕx®ZÀ¯Æv[À¯6 aî÷¿Ô‹¶ì5véì5ž’`¯±ÙЫÍMURgW- W? Yä±h+õ¢m"”ò ´{ýÜÀ7 <. Wg. Wg. W¯¦ÑåþÚ”zÑV@½Îî]@½Þ6!8°˜€Wo›KA6Õ‰œÚµÊåî6kày}ÂcÐë<‹,€^g¯-`Wç)l»:Ï ØÕ¥xÑÈcÑVêE[ô:Oq  ×yY½ÎÓÈvuž÷Í4•m«€]]f•ÌÝmJ½h+€^gx@¯3¼ ×yzIÀ®ÎT#`W×M:¨¤VϳǢ­Ô‹¶èue ½Î^½Î¶2”2 ØÕÙ ØÕûY%sw›R/Ú  ×7¯@¯ou€^gÀ«oFàÕ™wðê£z¢=m¥^´P¯ó<²€z!o]Ý„öúÜŒÉA^19ÈëÓ3“*™»Û”zÑV€½ÎÃìuFöºmÒLzußôJVæY‹¶R/Ú °×Ù<çÓD;‡ìuöÔzuß´x}ýÇ÷èÕ½z¦=m¥^´`¯`¯³§`¯³yЫ³yЫ³yЫWæY‹¶R/Úæ[Ey:@€½ÎžZ€½ÎžZ@¯›KAöÔzõY=Ó´zÑV@½ÎsÏêõKõúÆ%^}㒯ΓÒùÖ^³Ç¢m=ñ,€^߸g@¯oÜ3 ×7îìê÷ v{»ÆYÌ;ÉcÑVêE[ôƹ Îq`\*mÜÄV9Ù•ç©ì­z]½Á+ú è ¶Û z ¶Û z ¶Û z )„ÑÇ¢­Ö‹¶ ì þ>C½¡›JCöÕit•gdôº9€JªVÉ<´©mØìÓؼ,¡ÀÞ`»­À×`»­À×`»­À×Ðâñ¬Ù ­mÜmuüt £€{ƒQ@½Á(  ×`ÈÛL7ÐkTóèúX´ÕzÑV½Á, ÀÞ˜› ³€‚^ƒY@A¯“Y@A¯³šI×Ç¢­Ö‹¶ ì> stream xÚ…œ»Î&9Eó~Š i¦lŸ‹-!ž"„&fÞ_x!áÏwHZ5nåãíÛ^>5Ýß™Ïûôw®§­±ÖûŒi<´ÇÓyèOÆäa<+¨¼ìiÍOmÚ°S+ž]tªåÓr¼ßöÓÜ/í§ÞzúþÉþãÝ/ïä©=ÝÎ_¼ýé±ÞO»òœƒ'{Æ›çþŒçñìÆÎS>#¼}ÛO“xÏ/Öcïzëz­=f½ñÔ‹F½ý‡Í÷Ô³gÿ ÍÛ<¿ˆgwãü"÷»6·q~±_'‚þ>Ñœzûõ1N½?á'‚ÝéÈA·'Ö‰ û“¹ŸâÙužòI[´±+o•²õäL¢ï³å£=³¿ý™æÔã™a§ž=[´SÏŸõŽS/žÕû©—ϲ–»=<{‰jW^y´·÷Ykñ kÏ“‚õý8N »c{â<îa“Ðöï®øùÙøFÁ~Ü#¿Ã¢)›gŠœº{jµìÔõw?®3¶tíŒè~Ü­õ~ÆaOª­Ø™ »[¨y~¶[ëóLß­÷„㻵=1öDk{D˜†§înmÄ gGº»<¨»µ=9xïVq÷¯¡BìÖ̃»5‹3&±[³d1´=æ;üI»ÉsÎÝÚž‹;Ð$P6¬Ÿ¢4ÃåSïö9Šø/Gý"~øϧ( ÿùÔ ´PÉ€š|ŠÒ€œ ^ @Îçgtbºë€ÿä🠕 øÏ…JÐäK”ä\ðbr¾>;Ð/ᛕá#´@Éÿ|i·Z dM¾Dh8ÎõdƒãF±ÙåàFe€ôÂ$ú ±ôúã¢úkñ XãÜ:FÓw;ÅÅ æï÷/õ«o“¡‡þBàc@ÑdµÀL!¼Àbéb—­8ÁürpÔ/â‡þBàc@Ñ´m”n¢4È‚Œ ÁˆÆE/N€¸-D”ú ¡ý…ÐÇ€þBˆý§‹`\G 0.z±â¶YZè/?ô]CBé!JM!fÀq¡&Ž‹Qœy[ˆ,-øê À¿PMÁ?1õhŠ_)FiÉ @.Š,À é®_Äÿ…xýÿ…z}ø/ä¾@M¡N uâ€\Xa!æm!fi!à¿Pÿ©vð_¨­šÂµ6J«?ä‹ 4o ±J ÿ…Úzø/Ô-ánnŠÐ th,Š¬û ^•…ÀAȆè–ÿ…d h É ‚ÈEWìÔ.b‡þBÀ ¿0è/RûŠøbõ Œ‹T ??‹oï—”âC²z ú ƒþBÀ@¦00. Œ‹ì:¾¬Lâðâÿ ø qúü…8}™Bœ¾Aq1E(άÿòoVmžû…؃ýBì¿Á~!öߦûo@\ˆ«6 .V1}î$ž•I<ƒýbiziziZl5ö¿ËQa@\»“xV&ñ ö ñèû¥nJ°_Ê]¿A)wý†ÓÏWæ¾4ßbÝI<+“x†÷ÊWUš‹Òœj)`Qu9}=8Œõ™ï*â¿ü›•I… h Ø8«eŠ wtœb·øgñŠßI<ÿ?@h=ç¡¿©‡ô7u…™¦.w0N ´ƒq³ø Åï$ž—I<‡þ¦˜w‡þ毴Òb¸dšb¸Œ›b¸Œ›QÌÿ;‰çeÏ¡¿)>Ý¡¿)·åýM1ÜŒV×nqSÜ­ƒq3«øo Q&ñú›òŠCSn¡ú›©ñ£´8k‡ã¦8k‡ãfq íwÏË$žƒ3U<”gÍè:S€¦)~Û¹)·ÐÈÍYx¸;‰çeÏá¿©¶þ›j‹á¿©¶jšjd¹©F›Å§è~'ñ¼Lâ9ü·Ô¬Áºøà¿¥f hZjÖ¹%7¬È­·Ø‚î$ž—I<‡ÿ–š5øo©Yƒÿ–º2¸i5íî¤XµA²öÃüNây™Äc›ùÙ¥{h)ò‹U  i‰U @nu} ò÷ÏÑ_û”I¼€þV×€¿k@ˆ/Ž,`¦%¦Æ-1QÆ­þ!ãNâE™Äã¬è²ýô·Ä‘ô·Ä‘È´ä5À¸5ôÝH6>o?÷ñe/€¿%׬ü-ù¶,€¿%÷¥2-¹/ (nÉ})G{*üË¿Eµyì·Ä~ì·Ä~ì·Ä~À´Ä~·Ä~·Šï ãNâE™Ä ØoIþ'`¿%4`¿%4 ¦%³ÔÅk·Šи“xQ&ñö[rÍ°ß[°ß[Ó[@Ürí’4î$^”I¼€ý–Ѐý–Ѐý–85üg—ûÒâVj1’ÿ'^ÜI¼(“xû-¹¦ Øo¥ŠÒâŠdZâŠ[rßPÜ*üOÜI¼(“xü-¹- ào‰-ÂÒw¹‚iM-Fi1KÆ­â1î$^”I¼€þ–X¯€þ–X¯€þ–Ü!Ì´ä¶0ƒö¾úòyÊ?CdÜi¼(ÓxWÛ¯“¨pr±X‹][–+çÎ.—‘dÃßå2”ìO»|¸l\”¹¼`î×É”gÊ´W¬Yл]®>šË-WÄÑ\½SñZq ܽ(3z´Þåë¥È£¹$å#ærÿy4— °È£yÓ÷ñŠÄüÍ”Q¦õ"ä’˜<’«¡Ì#¹$á#äê€òH.9cF¨gÕ‡ÛY”kbÅÕÍ£¸Z£yWo4âjŽæQ\ÝÑ<ÚYÑ‹;Ãe†/æ‘\­Ð<’«šGr5CóH®nÊ“L[¬#^e’î4_”i¾XGsuIëh®6iÍÕ'­£¹¥u4—«ºXG¼â®.îd_”ɾXGsuEëh®¶hÍűCA³Atñùžðb î„_– ¿|Ï@¸6sB\T¾g ÄFå{B|T¾g ä~&ß3ñù¨È;í—eÚ/ß3¡ÍŸHmþ „Ls6ß.×[ÙŽæòñh¶#^ñõhÞ¹¿,sÙŽærE—íh.wtÙŽæ:EÚÑüWºq4g™íˆWdÀóÎf™Ìv4Kšíh.ž”ƒ­kPýh.V5ûÑ\®ð²ñ ›w0Ë4`ö£¹˜ØìGsq±ÙæbX³ͧvïh.ÿ.Eö#Þú|Xä Ì2˜ýh.¦ÓÐ…%rÍÅËæ8š‹™Íq4—Vsñ–¸|`–ÁGsÉ~ç8šKú;ÁÉÖä¢/¡°Ö^í6š7¹LаµöùV5ï¼`–yA Y×UR¶&æ4aJþÍ2)ï§\Ä[ߘðak­Øhï>ü79øoíu¾& endstream endobj 2189 0 obj << /Type /ObjStm /N 100 /First 1041 /Length 3739 /Filter /FlateDecode >> stream xÚ[»®%·Ì÷+&ô5à«é ŠœÙp`‡†YŒ dÖúÿÍ®súâpšCo° ^Î!»«È™î⃩÷ã<˜ì<Ȫè+^࣌£ Gµ£ ‡ŸB9ˆzóR=Hºz©Tºx©Ôúùi”ltÚì`>ÝF#/ÿ¤^—Z½4šµÊ^]YÅïÊ!£C/ÕC¤4/µCJQ/õCZ‘O£dî¯÷G硤nèPQï™øТÅKrhSï™ôPïÊQHð»zñR;J÷…úQ×aƒÌ©ð^ø<*±?e:ª°÷7þ¬…ÜS–£6òžYj䞎fÈ{æz49Ý?nG+'úëGk§lƒe'‡å<:9a,tt6ïo8ÔÕLJ‡“½š÷'zôî#ÄR;»÷<Àû ŽS°+ý°ªeØÈþTÇpŸ'¹‘Á NÅ(ò(ªâ2Šµ¹mÕQý{ÑžÄ- zG u =é£8ÆžÃØ ¢ kcxˆš H>uÔû-ÃÚ˜J(kcœQÖÆ  8¬ †Ü³2¬1æ%ÄöÆô ®äÐÊ°Æ cT‡5î‚â°Æ¦îÙ˜^$gqºê°&T|Ö„«{V‡5‘æŒUŸÕÚÑlX¼þ+3wLl®æÓþt'ÇT„€¾1¿IOö±iÚ#^Ö”¾ kωن5UÌåa’´`úØ4ÍùmÚ¶Ö†µñ‘vðЇ55 Ö aÆôa­0Fh¼T8/kEÙMŒ¶ôœÕ}X+CØý•mpgL™ñ²•öéÛo?}ó—~ùù·ãï¿ûíç¿|þõ_¿oZÞ|àm|*þz¼ÖW¯/ŵ¾¡žR}G=§zC½\ë‡YÇ9j¿ÿôÍŸ?ÿòùKökúù÷Ÿ¾ûîC9aC“ B}IõŒúšêõ-Õ+ê{ªwl÷(ܳ¹Á(—Dyå’(/ \å”K¢¼:åé×ä‰n@Ô·Kƒ ˆ Î%q^Á¹&Î+8×Äyçš8¯à\Ó|­ ¯œ÷0ܳ¹Á8/‰ó ÎKfœ—ÄysΈÎKš° 䕲ÑÞ. 6 8/‰óÎKâ¼ó’Ýç%qÞÀyM¶¼ºy»Ý³¹Á8¯‰óÎkâ¼;çÉÙÎk⼃óš&lyµn@ô·Kƒ ˆÎk⼃óš8ïà¼fà¼%Î;8oiÂv×ø†{67ØÁç-q>ªÙ’SÎ[âÜÀyKœ8oiÂÈkmÂÞ. 6 œ·Ä¹ó–87pÞ3QKõ=Õê¯o–cÙdƒaÊ·_ØÎ`œã Æ)1Î`œã Æ)1Î`œÒ´dpG÷AžÍ v0@9%Ê”S¢œA9%Ê”§ÄÞ¿öœß-y|n@LY 7Ø€pžTBpžTBpž2ì.àœ3pžRå. Oî3x67ØÁç’Ýç)ÃîÎ%±«Îyz¹œK®yR7 ¦,Ðl@(8—4qœKâ\Á¹&n¡}MáZÎ5‘¥è« ·0”ß. v0À¹fnÁ¹&]`昩ȚëÁy’R‘u+tyeû‚Âä’¸…Âä$7:&'¹Ñ!9É©È)SïŠ\7¯w‘·Kƒ p^“»®0s¼…Â䔿wHENù{‡T䔩wHE®›m™²@o°…É5M(L®8O™z‡T䔩wHEN™z‡Tä¶ùFÕ9ý¨Ûôæ%§ 0¹%Ρ09åïR‘S¦Þ!9eêR‘Ûæ5¢Ú6ý€Àä–(‡Àä–Ñò”¨w(EN‰z‡R䔨»6â]ØæôcûN@_æõ•}É=1}É9%‡Pôe½k=ïiºB(ú‚ß-Š>§}›~@_æ%‹}™eu‡¾\$Š‹ 7ª%«ÅççúÄœ~Ø6ý€¾\|‰ /o ôås&Lõιä$BQr¡(ç&äÙœ~Ø6ý€¾\±ÕQŸ¹5Ô_§ˆkóôcg\µ'ºØÌ&›^lopÀ /%郾”¤ úRRoŠ’rxƒT””ä¢Ðý@À³¹Á"¥þ…)”YÄ@¤Þ1<Š’2{ƒT”Gfb Úå…)I¦¤•~ƒÂ””ô¢¤Þ %­ô´¢ð½R…gsƒ pžõ SÒ*¹¿ò’„ªA,JÊì bQRo‹"ebʽÁ4¦Hš И"Ù]pžruƒXIc ±()‡7ˆEÑûÜžÍ v0ÀyJýýsºxé¡1EÓX””ÙÄ¢¤ÌÞ EëÄ”zƒ hLI;)ša€ó´a‹’r{ƒX””ÛÄ¢”ûµ4x67ØÀPç<9)I(4¦”Ä-Ä¢¤-ƒX”´e`‹R6ߨƒê(/(O ‰)I‡´¢ÔÜ(O)¹‡ógйÁ0å¶K  SRæmP˜’2oƒÂ””y¤¢¤ÌÛ %­‘¤¢lÖÈmÞŒ´²‡ÊSêmP˜’RoƒÂ”ž©å)õöLiÏ!e³Bnóf¤m7# SRŽmP˜’’SƒÂ”´j`Š’òIƒT””O¤¢l”…Í›‘¶ÝŒ4(LMi¨Aaê™Y4Ô§)Øœó\{â×ibB*êf…ÙæÍHÛnF¦æŒ SsV…©9rC+jŽ.Њš¿€ÐŠº{»çÍHÛnF$¦æ™ ‰©™Ýîœ'n!5-ÚÄ¢æ bQybN?¶Kå©9µƒÆÔœÚAcjNí 5¼0ˆEÍ9Ä¢ò&rÏ›‘¶•Ü©é¼†Ë E²©iÙ 5­1Ä¢¦5fƒXÔͳ͛‘¶ÝŒ4hLÍ™(4¦¦5fƒÆÔœ¡B,jZM6ˆEÍ©&Ä¢Ê&^\B÷f3òÞ‰ó8Œ:l"^+½r­tæxgïò2¶ïâ•·YøÃéÇ·‹{wIœGåðî’ ¾ïô’)ÊÑü’¨ŒÊѼ¦æ\½£ùáÇôã[—Ëû˜—þQ9æÃ%Kx¯îòeÉÉ+± l©ú±ßp­~Ý®*=|™~|ëvuV.[É£r°bÉíÑ©%ÿ|ŸÉ=Ÿî—è0j±å{÷j>\™~½ñúq¢g6ÐÞšüZûÈšŸµÿýÇ ·‘°å#gøc+b~4üìïqà sm’ÁÌ¿Pïtéå \íãèÏå¡Ãkõ¦¥¿ÐýcuÿòÐ_ìþ1g_âýî=çHÉçÜn”Ý_;miÔçâÇ›ñúŸ:Ïõ3Ƴ¶|æœkVó³Ç‡¾ÉOÀµá¤¼?¶@W(õý±›µr·>fðÉËgUY>{(@]<{¾‹-äqn¸‡ù|µ:/Í"–´µKÎ|YÎöw‹Éò™Û«Kz:ìÕE*™<Î ÷0;Ü­´1ƒ»Uxù îJ]>sw›–­»=¿aöêîŸ>ÿ4ÚŒ)ü˜hdÏÃB£@Qà(H’høã¯?þáo_~øÏ—aìß?üóçwYØxƃQ¨QhQèQxøÁ癆áÑï”´øû|µ3šRôÁQ(hJî³ÕÑûÅÚëq‚k-zêQ ÏÆ(„GÄkó¶?¯ƒa  $ÏõèQ6kË4¯-½.ô @8€pPËáÐfxôN³5Y  @8¨åðHεË$¡º6 $H$HP+áÑæ°†úœ­ÙbØ$H ‘@¢Á­†Gº™$“–õ#2Ù– 84˜ÕðG7S„çÃ4¾—¿°8Jà(£³%<*›9Âó¶¸ofk%”@RI fKx´9ệ“5y] k5Ô@RI nkx´9J‘¦}1\)B#i ˆ GäH阮ΧKÊëô‡­@¡1.'qÜFbŠ÷¼8´´UæâÕ,Œ¸÷‰8® 1E|‹[=ü¼Æ³65ïø”¾®ˆŠq½‡ã>SD·¸zÃÏ»6k[óÊm}=o¶"&Æm~^¯ñB±íyõei«ÎÇ«.†+"b\‰áç/«Ùž7QÖ¶æóuñ"G8¤‡qµ„ã. Çå¦ÍÇ:Ôj¯Ç9ÂVDCŠh—:F!H¸F›CamN›.†«Šˆ†q!„)âZÜÞ`2ý껜m1\ ãǽ &ûpãI&Ÿç×^Êš®nÀ¼Q~—SÓѨ["‚aœõç8Ü+óÏ‚~õ &Y WCŽ`È!ûâÂÇ f9¿ö$B[ WÃ8òÏqÆŸãP?Çy}ÞП¶ç}ˆS!ba,åq½ç8kÏ|+øbûàví0ÌE8ŒôÌÿg]h±Z÷±.ô?ŃÏ4 endstream endobj 2303 0 obj << /Author()/Title(BIRD User's Guide)/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.13)/Keywords() /CreationDate (D:20161222235453+01'00') /ModDate (D:20161222235453+01'00') /Trapped /False /PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-2.4-1.40.13 (TeX Live 2012/Debian) kpathsea version 6.1.0) >> endobj 2290 0 obj << /Type /ObjStm /N 13 /First 118 /Length 426 /Filter /FlateDecode >> stream xÚ•”MkÜ@ †ïþsL µ=ÒŒF‚(Í­ŸôãTrp Én¨Cÿ}g¼yÁ›µK{{w°ôèÑxM¤æZGdÞùVJ G~ì˜b Á梋Á— N‚•\’ùD2•`Î8UÄm›ú\Æmi­R9ŸcuqQ5ï†ÛÑý ’ù_reHŠ`Ï!¶¾„ëªy?< S®?»Úß¼þ:u¿¦sw6ö7Ó°ß½ª½g>¿®./H‘Ð…BDÀ41½$-»‡#“®Ð`a!°€‰„·iL¶¤åƧ0ˆ@D "X«` ±MXvÉ ‘NY    ‹M˜'ÅMVˆ¼dIH+,X$X$X$¬U1úM–]²4øS–ÂBa¡°PlU1n¿¨°ž~>ŸÔRsVxzÒâ¸&¾lcõÊ[­Øƒá: "ƒˆÅúÿ¬îÇànÿå¾:´áÍþ:Ðf£«~ÌOÏ_™\Óo¿{×¼í¦î~W5Ÿ»»~tÞ·V5Ÿž¦ûaw8J‡£ÝC?¾QóïRòaÛ7ßÇçÂÇ~÷fžÃyVÿ“ÈG endstream endobj 2304 0 obj << /Type /XRef /Index [0 2305] /Size 2305 /W [1 3 1] /Root 2302 0 R /Info 2303 0 R /ID [ ] /Length 5024 /Filter /FlateDecode >> stream xÚÚGˆ-QB€á{n÷Ë9çœó{÷åœsÎ9; )b *…£Xm­Ñ• •QâPà”Uˆƒ2S+ƒ00(Š´âŒP¥öw6ÿ»çôíÎÿŸz·»Ï`0üßp0Â`ú/Lý3( 3ª`.bhn¡9_ŽÁ¸¹íSsŸ §ÁtsûÌ}2œ3ͽ5÷ÑpÌžzª5ãæ>ιææ›{o8æ›[fîáXhn¹¹·†‹`±¹ æÞ.¥Ss…×<ñÚpL}[èV™{e¸V×̽4\«Í4÷Âp ¬5wÍÜsÃu°~j®>nî™áØh§†›`³¹æžn­ÃÁØáEænƒíæö˜{d¸všÛkî¡á.Ømî½¹†{`ê.céss÷ ÷Áþá`¼Ùbîžá8h»†‡`d;†‡áÈp0m¼ßmãplj®ïã–áq81L6ÛÜMÓpjj®>nž5Šm\7< ç çÀ5ÃópÁp.\5¼— ãZ]1¼ ñV¼Ë0,ˆaÆG¹î~#ˆ£Ú#pŽ¹K|õñmÅ÷"®P\º¸¦q±£…¨'z‹B£é˜@l#FkŠ™Åþb˜±Ø˜rl<Æw…íRÆ]fo•qoÙQeÜQöQ÷‘ÝSÎö7ÃÔºÆi–÷±ö…ÁÎoÆ/Ì{¦W9' æ}1~a>Ø$åb°5Ê¥`C”ËÁ6(W‚øËÕY¥î˵ ör=h¼ÜÊ.7ƒ·_n ƒÕÿŸRÊ¥vËJ9¥lËÝ Ör/ìM–A‰åâ“ø½”•Z+O€ÂÊS «ò ¨©<*/€rÊK —R/¥^J•”",ÕYʶTD©ˆR¥"JE”Š(Q*¢TD©ˆR¥"JE”Š(Q¾t1Šj_‡Áæ?ŽK"‹R¥"JE”Š(Q~öSß/ü“kðšx5†ÁþŒÃ1˜ÓaÌ„Y/¥s ^@çÁˆ×ÉE°–„ÁéÓññ\׬€•° VÃX ë`=l„M°¶ÀVØÛaì„]°öÀ^ˆ;þ¸[Ⴧãk9#8 Gà(ƒøm'à$œ‚ÓpÎÂ98à"\‚Ëp®Â5¸7à&Ü‚ÛpîÂ=¸à!<‚ÇðžÂ3x/€ó">ÛxkWr*gWâ[}ïá|„OÀ~á.E€!p^Œñññññññññ…ÿ/ ö â !K þg¸ üX°_°_°_°_¬ ƒ_ý‡ø2¬i±. ¾øgq¨ƒbˆ¡C!†B … 1b(ÄPˆ¡C!†B …Š} Çâ(¢@!B… ($PH @!B… –³8?û¿ñåê ÐA¡ƒB… ($PH @!B… ($PH @!B… ($PÄä]¼±â ⻸öÃàËñ³VÁ~Á~gر߱߱߱߱߱߱߱߱߱߱߱߱߱߱ßÙû: tè$Ð- ƒ¯þi|6ï¼[¿ñ8C§ƒÎU Ónç*б߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߱߉µsèˆïˆïˆïˆïlÉŽýŽýŽýŽýî¦ËÒ éâú݃ßÿj\t:ètÐé ÓA§ƒN:t:ètÐé ÓA§ƒN:t:ètÐÅÛ¹tè>{0„1‡i0fÀL˜³aê?úþZüÞù°æ…ÁŸÿJœ[ a,†%°–ÁrXñƒð*ˆ×@üл|Ô}¹|À}¹ |¬}¹¶Â6Ø;`'ì‚Ý°.ÂÔ§–¿Ü_ß~8#8 Gà(ƒãE„SpÎÀY8çá|‚KaP}#>Çe¸Wá:Ü€›p nø ÷à><€‡ðÃx Ïà9¼€—ð ^Ãx ïà=|€~ˆ>‡Á·7z‘uû5û5û5û5û5û5û5û5û5ûõ˜ ó@5ç5ç5çõâ–7ñá­n½4 ¾?+ٯٯٯٯٯٯٯٯٯã:ì×ñÇöëøC û5û5û5û5û5û5û5û5ûµ:ë}@|}‚êø‘äšýÚÚ×GÂà‡¿_®jÔñ.:¨uPë –@-ZµÌêKÀ~Í~Í~} $P³_³_³_³_³_³_ß÷V\ƒ‡!ÌœŒ¯@µj Ô¨%PK –@-Zµj Ô¨%PK –@ÐiýÙ ÀÆ`¦Át˜3ă90æÁ|X a1,¥° –à X «`u‡~7¾‚°6„µwâp¬‡ °6ÁfØñgØmrÝ·àì aý·âCÅŸW÷Á~8áŒà0£p ŽÃ 8 §à4œ³pÎø—à2\«p ®û9¾ ›!ìøxëÜ…Ûp¢ýðÁcxOá<‡ð^Ákxoá|€ð >‡ð#cž<¥;¥;¥;¥;%* !ÿB¼ û)û)û)û)û)û)û)û)û)û)ûé"@*t©½eýRöS –.áÂ÷ãsˆ!CºÖÀZ@*T©R ¤H%J •@*TC©_Y¤bH‰O÷@üõ„R ¤H%J •@*T©R ¤H%J oA©R ¤H‰O‰O‰O‰O‰O‰O£xM¦7A¢éÔÎÄ·ÿ.„p÷÷âP©,RY¤ŠH‘*"UDªˆT©"RE¤ŠHÅŠ!C*†T ©Òwž2.ñ‡^dCÛ>ÕFúÉpc0Ó`:Ì€™0 fØ ó`>,€…°ÃX Ë`9¬€•°*„ßþÉøZÖÂ8 çଠáǾï²ÖÃØ›`3l­° ¶ÃØ »`7ì½°üšjpürjpüJjpŽÀQ8Çᜄóp.ÂG8ÂÏüW|¹—à2\«p ®Ã ¸ ·à6Ü»pîÃxà1<§ð žÃ x ¯à5¼·í¿‡ ¿$ç Ý Ý‰ELâš~ á˼D‰ $Hâtè ÑA¢œD ‰1$bHĈ!C"†D ‰1$bHVÁjXŠH8O8O8O6º–L-ñ_üO|t't't'–)±jÉæ¾òƒx $H$H ‘@"D‰ $H$H ‘@"D‰ $H$H49 ÚM´›h7ÑF¢D‰1$bHĈ!C"†D ‰1$bHĈ!a¿‰+ù „?úøÞĈ!C"†D ‰1$bHĈ!C"†D ‰Ù&.‰,|^o´Ñh£aµH#F 14bhtÐè ÑA#Fš…!|w~|PKÜL}&üú¯Å¡14bhÄЈ¡C#†F 14bhÄЈ¡qhÄÚ¸4bhÄЈ¡!¾!¾!¾!¾!¾!¾!¾‰¿¢¦»±’ÍÁšñ¥ÅßI³ß°ß°ß°ß°ß°ß°ß°ß°ßßßßßßßßßßßßßßßßßßßè¹qhäÝ<ò«ñ¸tOBøö÷âËe¿!¾!¾!¾!¾!¾!¾!¾!¾!¾!¾!¾!¾ùìA`c0Ó`:Ì€™0 fØ ó`>,€…°‡áÌ–†ð½Çq¸ –à X «`5¬µ°ÖÃØ›`3l­° ¶ÃØ »`7ì½°öÃ8‡`‡!þÖþŒ[Çá܆c!üçOÅWNÁi8 çà<\€‹p .ø ×à:Ü€›p îÁº¯Çç¸ `Êþ´,ê¹?Å…ñ«1†ÇðžÂ3x/à%¼‚×ðÞÂ;xà#|1dSŸ Åsd1†áü¿CYd²Èd‘É"“E&‹L™,2Yd²Èd‘É"“E&‹LÙbXKA ™21dbÈĉ!C&†L ™21dbÈĉ!C&†L ™21dÈ$Y°lW®úv|GŠÈ‘)"SD¦ˆL™"2Edþ(• 8ó§¨L™,2d:Èt‰&C&†L ™21dbÈĉ!C&†L ™21dbÈ—ÝdÚÈîƒ"²X„ú¸¦OÂpûžøŽté ÓA¦ƒL™2d:Èté ÓA¦ƒL™2ô¯W]ï¢Ð³ß³ß³ß³ß³ß³ß³ß³ß³ß³ß³ß³ßû»îÄÙ0|ó¥ø ì÷ì÷Ä÷–®_†'Ưê ×A¯ƒ^½zô:èuÐë ×A¯ƒ^½zôºêÅЋ¡C/†^Ô½+C/‹^½zô:èuÐë ×A¯ƒ^½zôñO’:èuÐë ×AÏo& ¯ýf|3bèÅЋ¡C/†^ = ý•0¼“Ç;+¢WD¯ˆ^ ½z1ôbèÅЋ¡C/†^ }ŒAÞ½ëA¯ƒ^½zô:èuÐë ã/¨Ñï»0|v ¾1ôbèÅЋ¡ÿì~S…Ÿ?5pk Æa:l„©kħÍñ«3`&Ì‚90¦Á<˜ `!,‚Å°–Â2X+`%¬‚Õ°ÖÂ:X`3<…Maø¥ßŠ/h l…m°vÀNØ»aì…}°ÀA8#8 Gà(ƒãÿ }üúÙi8gᜇ p.Áe¸Wá\‡pnÁm¸wá܇ðÁcxb¿Å§|/ü]<.ç”×å%¼‚×cx ïà=|€ð tÐúÞ6ÀÄЊ¡å·UD+V­ÚÙ ƒV­Z ´h%ÐJ •@+Ví²0üß‹ÏÆ~Ë~Ë~Ë~KY»" )‹wC+†V ­&ÛM ˆV­Z ´h%ÐJ •@K|kÛ=a8ñÍø :huÐê ÕA«ƒV­Z´:huÐê ÕA«ƒ6GÐA«ƒV-)­Z´:huÐê ÕA«ƒV­Z´:hï8ÊàR:Š‹x; go|¥ŠhÑ*¢UD«ˆV­"Ú'`k´Ï@mÌB­Z´:huÐê ÕA«ƒV­ÚÏ^Á a œ¬Mƒé0f‚“#g5F]Œæ†áßüx|çdFNJŒæ‡áŸübœsÞb´–€_!œÅ9|3Z+Áyš‘C£5°ÖÁzp däGÆÑ&Ø N¤Œ¶Â6pˆh´œí‚Ýà$ÌÈÑ—‘Ó#ç7F¯á`~­Ž/Ò/G‡Á‡ÅÑQ8NåŒNÀI8§!žCq>gäôÉè<8s2ºNšŒ.ø ýŒœ*9ú2ò§£Ñ-¸ 1†»pîÃxà1¸Œž‚ƒ6#'uF/à%¼r¡ðZ&¢Æ7aø×?ß “S£wà¼Ïè|„O ÷›aü;kã­x®Šý ö'ØŸ`"ž‰§;ÆÂðïnÆ;ǃ;ó ½ŠŸâ¡)â'ˆŸˆ¿;Œ‡°â©+â'ˆŸˆ©8Ÿà|‚ó Î'âÉŸøkÎ'8ŸØ†ßúø”[ÃØ’¿Š·¶…±ÇÇâ­íaì'ÖÅ[;ÂX{ ÞÚÆ~øÝxkW_½'ÞÚÆÿ}¼µ'Œÿââ­x6*žbp"žºÆÿõ˾ZYÎÊ®¨¬Ke]*ëRY—ʺTÖ¥²•]Q9{TY’Ê’Tñ(\<ûfCTÖ¥².•u©¬Ke]*ëRY—ʺTÖ¹²8•Å©,Neq*‹SYœÊâT§²!*¢²!*¢²!*¢²!*¢²!*ï·r¬¢²+*»¶rÒ©²?*¢²!*¢²!*¢²!*¢²!*¢²!*¢²!*¢ae9+ËYYÎʆ¨lˆÊ†¨lˆÊ†¨lˆÊ†¨lˆÊ†¨lˆÊ†¨lˆÊ†¨lˆÊ†¨lˆÊ†¨lˆÊ†¨lˆÊ†¨lˆÊ†¨lˆÊf¯Þ€mPÙ•mPÙ•mPÙÕÔ6˜¹sÆ»¸`c0Ó`:Ì€™0 fØ ó`>,€…°ÃX Ë`9¬€•° VÃX ë`=l€° 6ÃØ Û`;쀰 vÃØ û`?€ƒpFpŽÀQ8ÇᜄSpÎÀY8çá\„Kp®ÀU¸×áÜ„[pîÀ]¸÷á<„GðžÀSxÏἄWðÞÀ[xïá|„O@|>Óæý:ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ9ñ“Sâ×ý7ñ“ÄO?Iü$ñ“ÄO?Iü$ñ“ÄO?IüäÜ0míL=ÊÆEƒÿ¢VdF endstream endobj startxref 335889 %%EOF bird-1.6.3/doc/prog-1.html0000644000103200001440000002124113027054666014176 0ustar feelausers BIRD Programmer's Documentation: BIRD Design Next Previous Contents

1. BIRD Design

1.1 Introduction

This document describes the internal workings of BIRD, its architecture, design decisions and rationale behind them. It also contains documentation on all the essential components of the system and their interfaces.

Routing daemons are complicated things which need to act in real time to complex sequences of external events, respond correctly even to the most erroneous behavior of their environment and still handle enormous amount of data with reasonable speed. Due to all of this, their design is very tricky as one needs to carefully balance between efficiency, stability and (last, but not least) simplicity of the program and it would be possible to write literally hundreds of pages about all of these issues. In accordance to the famous quote of Anton Chekhov "Shortness is a sister of talent", we've tried to write a much shorter document highlighting the most important stuff and leaving the boring technical details better explained by the program source itself together with comments contained therein.

1.2 Design goals

When planning the architecture of BIRD, we've taken a close look at the other existing routing daemons and also at some of the operating systems used on dedicated routers, gathered all important features and added lots of new ones to overcome their shortcomings and to better match the requirements of routing in today's Internet: IPv6, policy routing, route filtering and so on. From this planning, the following set of design goals has arisen:

  • Support all the standard routing protocols and make it easy to add new ones. This leads to modularity and clean separation between the core and the protocols.
  • Support both IPv4 and IPv6 in the same source tree, re-using most of the code. This leads to abstraction of IP addresses and operations on them.
  • Minimize OS dependent code to make porting as easy as possible. Unfortunately, such code cannot be avoided at all as the details of communication with the IP stack differ from OS to OS and they often vary even between different versions of the same OS. But we can isolate such code in special modules and do the porting by changing or replacing just these modules. Also, don't rely on specific features of various operating systems, but be able to make use of them if they are available.
  • Allow multiple routing tables. Easily solvable by abstracting out routing tables and the corresponding operations.
  • Offer powerful route filtering. There already were several attempts to incorporate route filters to a dynamic router, but most of them have used simple sequences of filtering rules which were very inflexible and hard to use for non-trivial filters. We've decided to employ a simple loop-free programming language having access to all the route attributes and being able to modify the most of them.
  • Support easy configuration and re-configuration. Most routers use a simple configuration language designed ad hoc with no structure at all and allow online changes of configuration by using their command-line interface, thus any complex re-configurations are hard to achieve without replacing the configuration file and restarting the whole router. We've decided to use a more general approach: to have a configuration defined in a context-free language with blocks and nesting, to perform all configuration changes by editing the configuration file, but to be able to read the new configuration and smoothly adapt to it without disturbing parts of the routing process which are not affected by the change.
  • Be able to be controlled online. In addition to the online reconfiguration, a routing daemon should be able to communicate with the user and with many other programs (primarily scripts used for network maintenance) in order to make it possible to inspect contents of routing tables, status of all routing protocols and also to control their behavior (disable, enable or reset a protocol without restarting all the others). To achieve this, we implement a simple command-line protocol based on those used by FTP and SMTP (that is textual commands and textual replies accompanied by a numeric code which makes them both readable to a human and easy to recognize in software).
  • Respond to all events in real time. A typical solution to this problem is to use lots of threads to separate the workings of all the routing protocols and also of the user interface parts and to hope that the scheduler will assign time to them in a fair enough manner. This is surely a good solution, but we have resisted the temptation and preferred to avoid the overhead of threading and the large number of locks involved and preferred a event driven architecture with our own scheduling of events. An unpleasant consequence of such an approach is that long lasting tasks must be split to more parts linked by special events or timers to make the CPU available for other tasks as well.

1.3 Architecture

The requirements set above have lead to a simple modular architecture containing the following types of modules:

Core modules

implement the core functions of BIRD: taking care of routing tables, keeping protocol status, interacting with the user using the Command-Line Interface (to be called CLI in the rest of this document) etc.

Library modules

form a large set of various library functions implementing several data abstractions, utility functions and also functions which are a part of the standard libraries on some systems, but missing on other ones.

Resource management modules

take care of resources, their allocation and automatic freeing when the module having requested shuts itself down.

Configuration modules

are fragments of lexical analyzer, grammar rules and the corresponding snippets of C code. For each group of code modules (core, each protocol, filters) there exist a configuration module taking care of all the related configuration stuff.

The filter

implements the route filtering language.

Protocol modules

implement the individual routing protocols.

System-dependent modules

implement the interface between BIRD and specific operating systems.

The client

is a simple program providing an easy, though friendly interface to the CLI.

1.4 Implementation

BIRD has been written in GNU C. We've considered using C++, but we've preferred the simplicity and straightforward nature of C which gives us fine control over all implementation details and on the other hand enough instruments to build the abstractions we need.

The modules are statically linked to produce a single executable file (except for the client which stands on its own).

The building process is controlled by a set of Makefiles for GNU Make, intermixed with several Perl and shell scripts.

The initial configuration of the daemon, detection of system features and selection of the right modules to include for the particular OS and the set of protocols the user has chosen is performed by a configure script generated by GNU Autoconf.

The parser of the configuration is generated by the GNU Bison.

The documentation is generated using SGMLtools with our own DTD and mapping rules which produce both an online version in HTML and a neatly formatted one for printing (first converted from SGML to LaTeX and then processed by TeX and dvips to get a PostScript file).

The comments from C sources which form a part of the programmer's documentation are extracted using a modified version of the kernel-doc tool.

If you want to work on BIRD, it's highly recommended to configure it with a --enable-debug switch which enables some internal consistency checks and it also links BIRD with a memory allocation checking library if you have one (either efence or dmalloc).

Next Previous Contents bird-1.6.3/doc/sgml2latex0000755000103200001440000000157113027054563014213 0ustar feelausers#!/usr/bin/perl # # sgmltools.in # # $Id$ # # SGML-Tools driver. Calls all other SGML-Tools components, contains # configuration information, etcetera. # package main; sub BEGIN { require 5.004; } use strict; use vars qw($prefix $DataDir $BinDir $progs); $prefix = "/usr"; $DataDir = "sbase"; $BinDir = "/usr/bin"; use lib "/usr/share/linuxdoc-tools"; use lib "/usr/perl5"; use lib "/usr/lib/perl5"; use lib "/usr/share/perl5"; $progs = { "NSGMLS" => "/usr/bin/nsgmls", "SGMLSASP" => "/usr/bin/sgmlsasp", "GROFF" => "/usr/bin/groff", "GROFFMACRO" => "-ms", "AWK" => "/usr/share/linuxdoc-tools/awkwhich" }; $ENV{"SGML_CATALOG_FILES"} = "sbase/dtd/catalog"; require "./LinuxDocTools.pm"; &LinuxDocTools::init; my @FileList = LinuxDocTools::process_options ("latex", @ARGV); for my $curfile (@FileList) { LinuxDocTools::process_file ($curfile); } exit 0; bird-1.6.3/doc/prog-3.html0000644000103200001440000003616313027054667014212 0ustar feelausers BIRD Programmer's Documentation: Configuration Next Previous Contents

3. Configuration

3.1 Configuration manager

Configuration of BIRD is complex, yet straightforward. There are three modules taking care of the configuration: config manager (which takes care of storage of the config information and controls switching between configs), lexical analyzer and parser.

The configuration manager stores each config as a config structure accompanied by a linear pool from which all information associated with the config and pointed to by the config structure is allocated.

There can exist up to four different configurations at one time: an active one (pointed to by config), configuration we are just switching from (old_config), one queued for the next reconfiguration (future_config; if there is one and the user wants to reconfigure once again, we just free the previous queued config and replace it with the new one) and finally a config being parsed (new_config). The stored old_config is also used for undo reconfiguration, which works in a similar way. Reconfiguration could also have timeout (using config_timer) and undo is automatically called if the new configuration is not confirmed later. The new config (new_config) and associated linear pool (cfg_mem) is non-NULL only during parsing.

Loading of new configuration is very simple: just call config_alloc() to get a new config structure, then use config_parse() to parse a configuration file and fill all fields of the structure and finally ask the config manager to switch to the new config by calling config_commit().

CLI commands are parsed in a very similar way -- there is also a stripped-down config structure associated with them and they are lex-ed and parsed by the same functions, only a special fake token is prepended before the command text to make the parser recognize only the rules corresponding to CLI commands.

Function

struct config * config_alloc (const byte * name) -- allocate a new configuration

Arguments

const byte * name

name of the config

Description

This function creates new config structure, attaches a resource pool and a linear memory pool to it and makes it available for further use. Returns a pointer to the structure.

Function

int config_parse (struct config * c) -- parse a configuration

Arguments

struct config * c

configuration

Description

config_parse() reads input by calling a hook function pointed to by cf_read_hook and parses it according to the configuration grammar. It also calls all the preconfig and postconfig hooks before, resp. after parsing.

Result

1 if the config has been parsed successfully, 0 if any error has occurred (such as anybody calling cf_error()) and the err_msg field has been set to the error message.

Function

int cli_parse (struct config * c) -- parse a CLI command

Arguments

struct config * c

temporary config structure

Description

cli_parse() is similar to config_parse(), but instead of a configuration, it parses a CLI command. See the CLI module for more information.

Function

void config_free (struct config * c) -- free a configuration

Arguments

struct config * c

configuration to be freed

Description

This function takes a config structure and frees all resources associated with it.

Function

int config_commit (struct config * c, int type, int timeout) -- commit a configuration

Arguments

struct config * c

new configuration

int type

type of reconfiguration (RECONFIG_SOFT or RECONFIG_HARD)

int timeout

timeout for undo (or 0 for no timeout)

Description

When a configuration is parsed and prepared for use, the config_commit() function starts the process of reconfiguration. It checks whether there is already a reconfiguration in progress in which case it just queues the new config for later processing. Else it notifies all modules about the new configuration by calling their commit() functions which can either accept it immediately or call config_add_obstacle() to report that they need some time to complete the reconfiguration. After all such obstacles are removed using config_del_obstacle(), the old configuration is freed and everything runs according to the new one.

When timeout is nonzero, the undo timer is activated with given timeout. The timer is deactivated when config_commit(), config_confirm() or config_undo() is called.

Result

CONF_DONE if the configuration has been accepted immediately, CONF_PROGRESS if it will take some time to switch to it, CONF_QUEUED if it's been queued due to another reconfiguration being in progress now or CONF_SHUTDOWN if BIRD is in shutdown mode and no new configurations are accepted.

Function

int config_confirm (void) -- confirm a commited configuration

Description

When the undo timer is activated by config_commit() with nonzero timeout, this function can be used to deactivate it and therefore confirm the current configuration.

Result

CONF_CONFIRM when the current configuration is confirmed, CONF_NONE when there is nothing to confirm (i.e. undo timer is not active).

Function

int config_undo (void) -- undo a configuration

Description

Function config_undo() can be used to change the current configuration back to stored old_config. If no reconfiguration is running, this stored configuration is commited in the same way as a new configuration in config_commit(). If there is already a reconfiguration in progress and no next reconfiguration is scheduled, then the undo is scheduled for later processing as usual, but if another reconfiguration is already scheduled, then such reconfiguration is removed instead (i.e. undo is applied on the last commit that scheduled it).

Result

CONF_DONE if the configuration has been accepted immediately, CONF_PROGRESS if it will take some time to switch to it, CONF_QUEUED if it's been queued due to another reconfiguration being in progress now, CONF_UNQUEUED if a scheduled reconfiguration is removed, CONF_NOTHING if there is no relevant configuration to undo (the previous config request was config_undo() too) or CONF_SHUTDOWN if BIRD is in shutdown mode and no new configuration changes are accepted.

Function

void order_shutdown (void) -- order BIRD shutdown

Description

This function initiates shutdown of BIRD. It's accomplished by asking for switching to an empty configuration.

Function

void cf_error (char * msg, ... ...) -- report a configuration error

Arguments

char * msg

printf-like format string

... ...

variable arguments

Description

cf_error() can be called during execution of config_parse(), that is from the parser, a preconfig hook or a postconfig hook, to report an error in the configuration.

Function

char * cfg_strdup (const char * c) -- copy a string to config memory

Arguments

const char * c

string to copy

Description

cfg_strdup() creates a new copy of the string in the memory pool associated with the configuration being currently parsed. It's often used when a string literal occurs in the configuration and we want to preserve it for further use.

3.2 Lexical analyzer

The lexical analyzer used for configuration files and CLI commands is generated using the flex tool accompanied by a couple of functions maintaining the hash tables containing information about symbols and keywords.

Each symbol is represented by a symbol structure containing name of the symbol, its lexical scope, symbol class (SYM_PROTO for a name of a protocol, SYM_CONSTANT for a constant etc.) and class dependent data. When an unknown symbol is encountered, it's automatically added to the symbol table with class SYM_VOID.

The keyword tables are generated from the grammar templates using the gen_keywords.m4 script.

Function

void cf_lex_unwind (void) -- unwind lexer state during error

Lexical analyzer

cf_lex_unwind() frees the internal state on IFS stack when the lexical analyzer is terminated by cf_error().

Function

struct symbol * cf_find_symbol (struct config * cfg, byte * c) -- find a symbol by name

Arguments

struct config * cfg

specificed config

byte * c

symbol name

Description

This functions searches the symbol table in the config cfg for a symbol of given name. First it examines the current scope, then the second recent one and so on until it either finds the symbol and returns a pointer to its symbol structure or reaches the end of the scope chain and returns NULL to signify no match.

Function

struct symbol * cf_get_symbol (byte * c) -- get a symbol by name

Arguments

byte * c

symbol name

Description

This functions searches the symbol table of the currently parsed config (new_config) for a symbol of given name. It returns either the already existing symbol or a newly allocated undefined (SYM_VOID) symbol if no existing symbol is found.

Function

struct symbol * cf_define_symbol (struct symbol * sym, int type, void * def) -- define meaning of a symbol

Arguments

struct symbol * sym

symbol to be defined

int type

symbol class to assign

void * def

class dependent data

Description

Defines new meaning of a symbol. If the symbol is an undefined one (SYM_VOID), it's just re-defined to the new type. If it's defined in different scope, a new symbol in current scope is created and the meaning is assigned to it. If it's already defined in the current scope, an error is reported via cf_error().

Result

Pointer to the newly defined symbol. If we are in the top-level scope, it's the same sym as passed to the function.

Function

void cf_lex_init (int is_cli, struct config * c) -- initialize the lexer

Arguments

int is_cli

true if we're going to parse CLI command, false for configuration

struct config * c

configuration structure

Description

cf_lex_init() initializes the lexical analyzer and prepares it for parsing of a new input.

Function

void cf_push_scope (struct symbol * sym) -- enter new scope

Arguments

struct symbol * sym

symbol representing scope name

Description

If we want to enter a new scope to process declarations inside a nested block, we can just call cf_push_scope() to push a new scope onto the scope stack which will cause all new symbols to be defined in this scope and all existing symbols to be sought for in all scopes stored on the stack.

Function

void cf_pop_scope (void) -- leave a scope

Description

cf_pop_scope() pops the topmost scope from the scope stack, leaving all its symbols in the symbol table, but making them invisible to the rest of the config.

Function

char * cf_symbol_class_name (struct symbol * sym) -- get name of a symbol class

Arguments

struct symbol * sym

symbol

Description

This function returns a string representing the class of the given symbol.

3.3 Parser

Both the configuration and CLI commands are analyzed using a syntax driven parser generated by the bison tool from a grammar which is constructed from information gathered from grammar snippets by the gen_parser.m4 script.

Grammar snippets are files (usually with extension .Y) contributed by various BIRD modules in order to provide information about syntax of their configuration and their CLI commands. Each snipped consists of several sections, each of them starting with a special keyword: CF_HDR for a list of #include directives needed by the C code, CF_DEFINES for a list of C declarations, CF_DECLS for bison declarations including keyword definitions specified as CF_KEYWORDS, CF_GRAMMAR for the grammar rules, CF_CODE for auxiliary C code and finally CF_END at the end of the snippet.

To create references between the snippets, it's possible to define multi-part rules by utilizing the CF_ADDTO macro which adds a new alternative to a multi-part rule.

CLI commands are defined using a CF_CLI macro. Its parameters are: the list of keywords determining the command, the list of parameters, help text for the parameters and help text for the command.

Values of enum filter types can be defined using CF_ENUM with the following parameters: name of filter type, prefix common for all literals of this type and names of all the possible values.

Next Previous Contents bird-1.6.3/doc/bird-4.html0000644000103200001440000003006113027054673014150 0ustar feelausers BIRD User's Guide: Remote control Next Previous Contents

4. Remote control

You can use the command-line client birdc to talk with a running BIRD. Communication is done using a bird.ctl UNIX domain socket (unless changed with the -s option given to both the server and the client). The commands can perform simple actions such as enabling/disabling of protocols, telling BIRD to show various information, telling it to show routing table filtered by filter, or asking BIRD to reconfigure. Press ? at any time to get online help. Option -r can be used to enable a restricted mode of BIRD client, which allows just read-only commands (show ...). Option -v can be passed to the client, to make it dump numeric return codes along with the messages. You do not necessarily need to use birdc to talk to BIRD, your own applications could do that, too -- the format of communication between BIRD and birdc is stable (see the programmer's documentation).

There is also lightweight variant of BIRD client called birdcl, which does not support command line editing and history and has minimal dependencies. This is useful for running BIRD in resource constrained environments, where Readline library (required for regular BIRD client) is not available.

Many commands have the name of the protocol instance as an argument. This argument can be omitted if there exists only a single instance.

Here is a brief list of supported functions:

show status

Show router status, that is BIRD version, uptime and time from last reconfiguration.

show interfaces [summary]

Show the list of interfaces. For each interface, print its type, state, MTU and addresses assigned.

show protocols [all]

Show list of protocol instances along with tables they are connected to and protocol status, possibly giving verbose information, if all is specified.

show ospf interface [name] ["interface"]

Show detailed information about OSPF interfaces.

show ospf neighbors [name] ["interface"]

Show a list of OSPF neighbors and a state of adjacency to them.

show ospf state [all] [name]

Show detailed information about OSPF areas based on a content of the link-state database. It shows network topology, stub networks, aggregated networks and routers from other areas and external routes. The command shows information about reachable network nodes, use option all to show information about all network nodes in the link-state database.

show ospf topology [all] [name]

Show a topology of OSPF areas based on a content of the link-state database. It is just a stripped-down version of 'show ospf state'.

show ospf lsadb [global | area id | link] [type num] [lsid id] [self | router id] [name]

Show contents of an OSPF LSA database. Options could be used to filter entries.

show rip interfaces [name] ["interface"]

Show detailed information about RIP interfaces.

show rip neighbors [name] ["interface"]

Show a list of RIP neighbors and associated state.

show static [name]

Show detailed information about static routes.

show bfd sessions [name]

Show information about BFD sessions.

show symbols [table|filter|function|protocol|template|roa|symbol]

Show the list of symbols defined in the configuration (names of protocols, routing tables etc.).

show route [[for] prefix|IP] [table t] [filter f|where c] [(export|preexport|noexport) p] [protocol p] [options]

Show contents of a routing table (by default of the main one or the table attached to a respective protocol), that is routes, their metrics and (in case the all switch is given) all their attributes.

You can specify a prefix if you want to print routes for a specific network. If you use for prefix or IP, you'll get the entry which will be used for forwarding of packets to the given destination. By default, all routes for each network are printed with the selected one at the top, unless primary is given in which case only the selected route is shown.

You can also ask for printing only routes processed and accepted by a given filter (filter name or filter { filter } or matching a given condition (where condition).

The export, preexport and noexport switches ask for printing of routes that are exported to the specified protocol. With preexport, the export filter of the protocol is skipped. With noexport, routes rejected by the export filter are printed instead. Note that routes not exported to the protocol for other reasons (e.g. secondary routes or routes imported from that protocol) are not printed even with noexport.

You can also select just routes added by a specific protocol. protocol p.

If BIRD is configured to keep filtered routes (see import keep filtered option), you can show them instead of routes by using filtered switch.

The stats switch requests showing of route statistics (the number of networks, number of routes before and after filtering). If you use count instead, only the statistics will be printed.

show roa [prefix | in prefix | for prefix] [as num] [table t]

Show contents of a ROA table (by default of the first one). You can specify a prefix to print ROA entries for a specific network. If you use for prefix, you'll get all entries relevant for route validation of the network prefix; i.e., ROA entries whose prefixes cover the network prefix. Or you can use in prefix to get ROA entries covered by the network prefix. You could also use as option to show just entries for given AS.

add roa prefix max num as num [table t]

Add a new ROA entry to a ROA table. Such entry is called dynamic compared to static entries specified in the config file. These dynamic entries survive reconfiguration.

delete roa prefix max num as num [table t]

Delete the specified ROA entry from a ROA table. Only dynamic ROA entries (i.e., the ones added by add roa command) can be deleted.

flush roa [table t]

Remove all dynamic ROA entries from a ROA table.

configure [soft] ["config file"] [timeout [num]]

Reload configuration from a given file. BIRD will smoothly switch itself to the new configuration, protocols are reconfigured if possible, restarted otherwise. Changes in filters usually lead to restart of affected protocols.

If soft option is used, changes in filters does not cause BIRD to restart affected protocols, therefore already accepted routes (according to old filters) would be still propagated, but new routes would be processed according to the new filters.

If timeout option is used, config timer is activated. The new configuration could be either confirmed using configure confirm command, or it will be reverted to the old one when the config timer expires. This is useful for cases when reconfiguration breaks current routing and a router becomes inaccessible for an administrator. The config timeout expiration is equivalent to configure undo command. The timeout duration could be specified, default is 300 s.

configure confirm

Deactivate the config undo timer and therefore confirm the current configuration.

configure undo

Undo the last configuration change and smoothly switch back to the previous (stored) configuration. If the last configuration change was soft, the undo change is also soft. There is only one level of undo, but in some specific cases when several reconfiguration requests are given immediately in a row and the intermediate ones are skipped then the undo also skips them back.

configure check ["config file"]

Read and parse given config file, but do not use it. useful for checking syntactic and some semantic validity of an config file.

enable|disable|restart name|"pattern"|all

Enable, disable or restart a given protocol instance, instances matching the pattern or all instances.

reload [in|out] name|"pattern"|all

Reload a given protocol instance, that means re-import routes from the protocol instance and re-export preferred routes to the instance. If in or out options are used, the command is restricted to one direction (re-import or re-export).

This command is useful if appropriate filters have changed but the protocol instance was not restarted (or reloaded), therefore it still propagates the old set of routes. For example when configure soft command was used to change filters.

Re-export always succeeds, but re-import is protocol-dependent and might fail (for example, if BGP neighbor does not support route-refresh extension). In that case, re-export is also skipped. Note that for the pipe protocol, both directions are always reloaded together (in or out options are ignored in that case).

down

Shut BIRD down.

debug protocol|pattern|all all|off|{ states|routes|filters|events|packets [, ...] }

Control protocol debugging.

dump resources|sockets|interfaces|neighbors|attributes|routes|protocols

Dump contents of internal data structures to the debugging output.

echo all|off|{ list of log classes } [ buffer-size ]

Control echoing of log messages to the command-line output. See log option for a list of log classes.

eval expr

Evaluate given expression.

Next Previous Contents bird-1.6.3/doc/LinuxDocTools.pm0000644000103200001440000004031713027054563015310 0ustar feelausers#! /usr/bin/perl # # LinuxDocTools.pm # # $Id$ # # LinuxDoc-Tools driver core. This contains all the basic functionality # we need to control all other components. # # © Copyright 1996, Cees de Groot. # © Copyright 2000, Taketoshi Sano # # THIS VERSION HAS BEEN HACKED FOR BIRD BY MARTIN MARES # package LinuxDocTools; require 5.004; use strict; =head1 NAME LinuxDocTools - SGML conversion utilities for LinuxDoc DTD. =head1 SYNOPSIS use LinuxDocTools; LinuxDocTools::init; @files = LinuxDocTools::process_options ($0, @ARGV); for $curfile (@files) { LinuxDocTools::process_file ($curfile); } =head1 DESCRIPTION The LinuxDocTools package encapsulates all the functionality offered by LinuxDoc-Tools. It is used, of course, by LinuxDoc-Tools; but the encapsulation should provide for a simple interface for other users as well. =head1 FUNCTIONS =over 4 =cut use DirHandle; use File::Basename; use File::Find; use File::Copy; use FileHandle; use IPC::Open2; use Cwd; use LinuxDocTools::Lang; use LinuxDocTools::Utils qw(process_options usage cleanup trap_signals remove_tmpfiles create_temp); use LinuxDocTools::Vars; sub BEGIN { # # Make sure we're always looking here. Note that "use lib" adds # on the front of the search path, so we first push dist, then # site, so that site is searched first. # use lib "$main::DataDir/dist"; use lib "$main::DataDir/site"; } =item LinuxDocTools::init Takes care of initialization of package-global variables (which are actually defined in L). The package-global variables are I<$global>, a reference to a hash containing numerous settings, I<%Formats>, a hash containing all the formats, and I<%FmtList>, a hash containing the currently active formats for help texts. Apart from this, C also finds all distributed and site-local formatting backends and Cs them. =cut sub init { trap_signals; # # Register the ``global'' pseudoformat. Apart from the global settings, # we also use $global to keep the global variable name space clean; # everything that we need to provide to other modules is stuffed # into $global. # $global = {}; $global->{NAME} = "global"; $global->{HELP} = ""; $global->{OPTIONS} = [ { option => "backend", type => "l", 'values' => [ "html", "info", "latex", "lyx", "rtf", "txt", "check" ], short => "B" }, { option => "papersize", type => "l", 'values' => [ "a4", "letter" ], short => "p" }, { option => "language", type => "l", 'values' => [ @LinuxDocTools::Lang::Languages ], short => "l" }, { option => "charset", type => "l", 'values' => [ "latin", "ascii", "nippon", "euc-kr" ], short => "c" }, { option => "style", type => "s", short => "S" }, { option => "tabsize", type => "i", short => "t" }, # { option => "verbose", type => "f", short => "v" }, { option => "debug", type => "f", short => "d" }, { option => "define", type => "s", short => "D" }, { option => "include", type => "s", short => "i" }, { option => "pass", type => "s", short => "P" } ]; $global->{backend} = "linuxdoc"; $global->{papersize} = "a4"; $global->{language} = "en"; $global->{charset} = "ascii"; $global->{style} = ""; $global->{tabsize} = 8; $global->{verbose} = 0; $global->{define} = ""; $global->{debug} = 0; $global->{include} = ""; $global->{pass} = ""; $global->{InFiles} = []; $Formats{$global->{NAME}} = $global; # All formats we know. $FmtList{$global->{NAME}} = $global; # List of formats for help msgs. # automatic language detection: disabled by default # { # my $lang; # foreach $lang (@LinuxDocTools::Lang::Languages) # { # if (($ENV{"LC_ALL"} =~ /^$lang/i) || # ($ENV{"LC_CTYPE"} =~ /^$lang/i) || # ($ENV{"LANG"} =~ /^$lang/i)) { # $global->{language} = Any2ISO($lang); # } # } # } # # Used when the format is "global" (from sgmlcheck). # $global->{preNSGMLS} = sub { $global->{NsgmlsOpts} .= " -s "; $global->{NsgmlsPrePipe} = "cat $global->{file}"; }; # # Build up the list of formatters. # my $savdir = cwd; my %Locs; chdir "$main::DataDir/dist"; my $dir = new DirHandle("."); die "Unable to read directory $main::DataDir/dist: $!" unless defined($dir); foreach my $fmt (grep(/^fmt_.*\.pl$/, $dir->read())) { $Locs{$fmt} = "dist"; } $dir->close(); chdir "$main::DataDir/site"; $dir = new DirHandle("."); die "Unable to read directory $main::DataDir/site: $!" unless defined($dir); foreach my $fmt (grep(/^fmt_.*\.pl$/, $dir->read())) { $Locs{$fmt} = "site"; } $dir->close(); foreach my $fmt (keys %Locs) { require $fmt; } chdir $savdir; } =item LinuxDocTools::process_options ($0, @ARGV) This function contains all initialization that is bound to the current invocation of LinuxDocTools. It looks in C<$0> to deduce the backend that should be used (ld2txt activates the I backend) and parses the options array. It returns an array of filenames it encountered during option processing. As a side effect, the environment variables I and I are modified. =cut sub process_options { my $progname = shift; my @args = @_; # # Deduce the format from the caller's file name # my ($format, $dummy1, $dummy2) = fileparse ($progname, ""); $global->{myname} = $format; $format =~ s/sgml2*(.*)/$1/; # # check the option "--backend / -B" # if ($format eq "linuxdoc") { my @backends = @args; my $arg; while (@backends) { $arg = shift @backends; if ($arg eq "-B") { $arg = shift @backends; $format = $arg; last; } if ( $arg =~ s/--backend=(.*)/$1/ ) { $format = $arg; last; } } } $format = "global" if $format eq "check"; usage ("") if $format eq "linuxdoc"; $format = "latex2e" if $format eq "latex"; $FmtList{$format} = $Formats{$format} or usage ("$global->{myname}: unknown format"); $global->{format} = $format; # # Parse all the options. # my @files = LinuxDocTools::Utils::process_options (@args); $global->{language} = Any2ISO ($global->{language}); # # check the number of given files $#files > -1 || usage ("no filenames given"); # # Setup the SGML environment. # (Note that Debian package rewrite path to catalog of # iso-entities using debian/rules so that it can use # entities from sgml-data pacakge. debian/rules also # removes iso-entites sub directory after doing make install.) # $ENV{SGML_CATALOG_FILES} .= (defined $ENV{SGML_CATALOG_FILES} ? ":" : "") . "$main::prefix/share/sgml/entities/sgml-iso-entities-8879.1986/catalog"; $ENV{SGML_CATALOG_FILES} .= ":$main::DataDir/linuxdoc-tools.catalog"; $ENV{SGML_CATALOG_FILES} .= ":$main::/etc/sgml.catalog"; if (-f "$main::DataDir/dtd/$format.dcl") { $ENV{SGMLDECL} = "$main::DataDir/dtd/$format.dcl"; } elsif (-f "$main::DataDir/dtd/$global->{style}.dcl") { $ENV{SGMLDECL} = "$main::DataDir/dtd/$global->{style}.dcl"; } elsif (-f "$main::DataDir/dtd/sgml.dcl") { $ENV{SGMLDECL} = "$main::DataDir/dtd/sgml.dcl"; } # # OK. Give the list of files we distilled from the options # back to the caller. # return @files; } =item LinuxDocTools::process_file With all the configuration done, this routine will take a single filename and convert it to the currently active backend format. The conversion is done in a number of steps in tight interaction with the currently active backend (see also L): =over =item 1. Backend: set NSGMLS options and optionally create a pre-NSGMLS pipe. =item 2. Here: Run the preprocessor to handle conditionals. =item 3. Here: Run NSGMLS. =item 4. Backend: run pre-ASP conversion. =item 5. Here: Run SGMLSASP. =item 6. Backend: run post-ASP conversion, generating the output. =back All stages are influenced by command-line settings, currently active format, etcetera. See the code for details. =cut sub process_file { my $file = shift (@_); my $saved_umask = umask; print "Processing file $file\n"; umask 0077; my ($filename, $filepath, $filesuffix) = fileparse ($file, "\.sgml"); my $tmpnam = $filepath . '/' . $filename; $file = $tmpnam . $filesuffix; -f $file || $file =~ /.*.sgml$/ || ($file .= '.sgml'); -f $file || ($file = $tmpnam . '.SGML'); -f $file || die "Cannot find $file\n"; $global->{filename} = $filename; $global->{file} = $file; $global->{filepath} = $filepath; my $tmp = new FileHandle "<$file"; my $dtd; while ( <$tmp> ) { tr/A-Z/a-z/; # check for [close; if ( $global->{debug} ) { print "DTD: " . $dtd . "\n"; } $global->{dtd} = $dtd; # prepare temporary directory my $tmpdir = $ENV{'TMPDIR'} || '/tmp'; $tmpdir = $tmpdir . '/' . 'linuxdoc-dir-' . $$; mkdir ($tmpdir, 0700) || die " - temporary files can not be created, aborted - \n"; my $tmpbase = $global->{tmpbase} = $tmpdir . '/sgmltmp.' . $filename; $ENV{"SGML_SEARCH_PATH"} .= ":$filepath"; # # Set up the preprocessing command. Conditionals have to be # handled here until they can be moved into the DTD, otherwise # a validating SGML parser will choke on them. # # check if output option for latex is pdf or not if ($global->{format} eq "latex2e") { if ($Formats{$global->{format}}{output} eq "pdf") { $global->{define} .= " pdflatex=yes"; } } # my($precmd) = "|sgmlpre output=$global->{format} $global->{define}"; # # You can hack $NsgmlsOpts here, etcetera. # $global->{NsgmlsOpts} .= "-D $main::prefix/share/sgml -D $main::DataDir"; $global->{NsgmlsOpts} .= "-i$global->{include}" if ($global->{include}); $global->{NsgmlsPrePipe} = "NOTHING"; if ( defined $Formats{$global->{format}}{preNSGMLS} ) { $global->{NsgmlsPrePipe} = &{$Formats{$global->{format}}{preNSGMLS}}; } # # Run the prepocessor and nsgmls. # my ($ifile, $writensgmls); if ($global->{NsgmlsPrePipe} eq "NOTHING") { $ifile = new FileHandle $file; } else { $ifile = new FileHandle "$global->{NsgmlsPrePipe}|"; } create_temp("$tmpbase.1"); $writensgmls = new FileHandle "$precmd|$main::progs->{NSGMLS} $global->{NsgmlsOpts} $ENV{SGMLDECL} >\"$tmpbase.1\""; if ($global->{charset} eq "latin") { while (<$ifile>) { # Outline these commands later on - CdG #change latin1 characters to SGML #by Farzad Farid, adapted by Greg Hankins s/À/\À/g; s/Á/\Á/g; s/Â/\Â/g; s/Ã/\Ã/g; s/Ä/\Ä/g; s/Å/\Å/g; s/Æ/\Æ/g; s/Ç/\Ç/g; s/È/\È/g; s/É/\É/g; s/Ê/\Ê/g; s/Ë/\Ë/g; s/Ì/\Ì/g; s/Í/\Í/g; s/Î/\Î/g; s/Ï/\Ï/g; s/Ñ/\Ñ/g; s/Ò/\Ò/g; s/Ó/\Ó/g; s/Ô/\Ô/g; s/Õ/\Õ/g; s/Ö/\Ö/g; s/Ø/\Ø/g; s/Ù/\Ù/g; s/Ú/\Ú/g; s/Û/\Û/g; s/Ü/\Ü/g; s/Ý/\Ý/g; s/Þ/\Þ/g; s/ß/\ß/g; s/à/\à/g; s/á/\á/g; s/â/\â/g; s/ã/\ã/g; s/ä/\ä/g; s/å/\å/g; s/æ/\æ/g; s/ç/\ç/g; s/è/\è/g; s/é/\é/g; s/ê/\ê/g; s/ë/\ë/g; s/ì/\ì/g; s/í/\í/g; s/î/\î/g; s/ï/\ï/g; s/µ/\μ/g; s/ð/\ð/g; s/ñ/\ñ/g; s/ò/\ò/g; s/ó/\ó/g; s/ô/\ô/g; s/õ/\õ/g; s/ö/\ö/g; s/ø/\ø/g; s/ù/\ù/g; s/ú/\ú/g; s/û/\û/g; s/ü/\ü/g; s/ý/\ý/g; s/þ/\þ/g; s/ÿ/\ÿ/g; print $writensgmls $_; } } else { while (<$ifile>) { print $writensgmls $_; } } $ifile->close; $writensgmls->close; # # Special case: if format is global, we're just checking. # $global->{format} eq "global" && cleanup; # # If the output file is empty, something went wrong. # ! -e "$tmpbase.1" and die "can't create file - exiting"; -z "$tmpbase.1" and die "SGML parsing error - exiting"; if ( $global->{debug} ) { print "Nsgmls stage finished.\n"; } # # If a preASP stage is defined, let the format handle it. # # preASP ($inhandle, $outhandle); # my $inpreasp = new FileHandle "<$tmpbase.1"; my $outpreasp = new FileHandle "$tmpbase.2",O_WRONLY|O_CREAT|O_EXCL,0600; if (defined $Formats{$global->{format}}{preASP}) { &{$Formats{$global->{format}}{preASP}}($inpreasp, $outpreasp) == 0 or die "error pre-processing $global->{format}.\n"; } else { copy ($inpreasp, $outpreasp); } $inpreasp->close; $outpreasp->close; ! -e "$tmpbase.2" and die "can't create file - exiting"; if ( $global->{debug} ) { print "PreASP stage finished.\n"; } # # Run sgmlsasp, with an optional style if specified. # # Search order: # - datadir/site// # - datadir/dist// # So we need to fetch the doctype from the intermediate. # # Note: this is a very simplistic check - but as far as I know, # it is correct. Am I right? # my $tmp = new FileHandle "<$tmpbase.2"; my $dtd; while ( ($dtd = <$tmp>) && ! ( $dtd =~ /^\(/) ) { }; $tmp->close; $dtd =~ s/^\(//; $dtd =~ tr/A-Z/a-z/; chop $dtd; $global->{dtd} = $dtd; my $style = ""; if ($global->{style}) { $style = "$main::DataDir/site/$dtd/$global->{format}/$global->{style}mapping"; -r $style or $style = "$main::DataDir/dist/$dtd/$global->{format}/$global->{style}mapping"; } my $mapping = "$main::DataDir/site/$dtd/$global->{format}/mapping"; -r $mapping or $mapping = "$main::DataDir/dist/$dtd/$global->{format}/mapping"; $global->{charset} = "nippon" if ($global->{language} eq "ja"); # # we don't have Korean groff so charset should be latin1. # if ($global->{language} eq "ko") { if ($global->{format} eq "groff") { $global->{charset} = "latin1"; } else { $global->{charset} = "euc-kr"; } } if ($global->{format} eq "groff" or $global->{format} eq "latex2e") { if ($dtd eq "linuxdoctr") { $mapping = "$main::DataDir/dist/$dtd/$global->{format}/tr-mapping"; } } create_temp("$tmpbase.3"); system ("$main::progs->{SGMLSASP} $style $mapping <\"$tmpbase.2\" | expand -$global->{tabsize} >\"$tmpbase.3\""); ! -e "$tmpbase.3" and die "can't create file - exiting"; if ( $global->{debug} ) { print "ASP stage finished.\n"; } # # If a postASP stage is defined, let the format handle it. # It should leave whatever it thinks is right based on $file. # # postASP ($inhandle) # umask $saved_umask; my $inpostasp = new FileHandle "<$tmpbase.3"; if (defined $Formats{$global->{format}}{postASP}) { &{$Formats{$global->{format}}{postASP}}($inpostasp) == 0 or die "error post-processing $global->{format}.\n"; } $inpostasp->close; if ( $global->{debug} ) { print "postASP stage finished.\n"; } # # All done, remove the temporaries. # if( !$global->{debug} ) { remove_tmpfiles($tmpbase); } } =pod =back =head1 SEE ALSO Documentation for various sub-packages of LinuxDocTools. =head1 AUTHOR SGMLTools are written by Cees de Groot, Ccg@cdegroot.comE>, and various SGML-Tools contributors as listed in C. Taketoshi Sano Csano@debian.org> rename to LinuxDocTools. =cut 1; bird-1.6.3/doc/bird-3.html0000644000103200001440000006027713027054673014163 0ustar feelausers BIRD User's Guide: Configuration Next Previous Contents

3. Configuration

3.1 Introduction

BIRD is configured using a text configuration file. Upon startup, BIRD reads prefix/etc/bird.conf (unless the -c command line option is given). Configuration may be changed at user's request: if you modify the config file and then signal BIRD with SIGHUP, it will adjust to the new config. Then there's the client which allows you to talk with BIRD in an extensive way.

In the config, everything on a line after # or inside /* */ is a comment, whitespace characters are treated as a single space. If there's a variable number of options, they are grouped using the { } brackets. Each option is terminated by a ;. Configuration is case sensitive. There are two ways how to name symbols (like protocol names, filter names, constants etc.). You can either use a simple string starting with a letter followed by any combination of letters and numbers (e.g. "R123", "myfilter", "bgp5") or you can enclose the name into apostrophes (') and than you can use any combination of numbers, letters. hyphens, dots and colons (e.g. "'1:strange-name'", "'-NAME-'", "'cool::name'").

Here is an example of a simple config file. It enables synchronization of routing tables with OS kernel, scans for new network interfaces every 10 seconds and runs RIP on all network interfaces found. 

protocol kernel {
        persist;                # Don't remove routes on BIRD shutdown
        scan time 20;           # Scan kernel routing table every 20 seconds
        export all;             # Default is export none
}

protocol device {
        scan time 10;           # Scan interfaces every 10 seconds
}

protocol rip {
        export all;
        import all;
        interface "*";
}

3.2 Global options

include "filename"

This statement causes inclusion of a new file. Filename could also be a wildcard, in that case matching files are included in alphabetic order. The maximal depth is 8. Note that this statement could be used anywhere in the config file, not just as a top-level option.

log "filename"|syslog [name name]|stderr all|{ list of classes }

Set logging of messages having the given class (either all or { error|trace [, ...] } etc.) into selected destination (a file specified as a filename string, syslog with optional name argument, or the stderr output). Classes are: info, warning, error and fatal for messages about local problems, debug for debugging messages, trace when you want to know what happens in the network, remote for messages about misbehavior of remote machines, auth about authentication failures, bug for internal BIRD bugs. You may specify more than one log line to establish logging to multiple destinations. Default: log everything to the system log.

debug protocols all|off|{ states|routes|filters|interfaces|events|packets [, ...] }

Set global defaults of protocol debugging options. See debug in the following section. Default: off.

debug commands number

Control logging of client connections (0 for no logging, 1 for logging of connects and disconnects, 2 and higher for logging of all client commands). Default: 0.

debug latency switch

Activate tracking of elapsed time for internal events. Recent events could be examined using dump events command. Default: off.

debug latency limit time

If debug latency is enabled, this option allows to specify a limit for elapsed time. Events exceeding the limit are logged. Default: 1 s.

watchdog warning time

Set time limit for I/O loop cycle. If one iteration took more time to complete, a warning is logged. Default: 5 s.

watchdog timeout time

Set time limit for I/O loop cycle. If the limit is breached, BIRD is killed by abort signal. The timeout has effective granularity of seconds, zero means disabled. Default: disabled (0).

mrtdump "filename"

Set MRTdump file name. This option must be specified to allow MRTdump feature. Default: no dump file.

mrtdump protocols all|off|{ states|messages [, ...] }

Set global defaults of MRTdump options. See mrtdump in the following section. Default: off.

filter name local variables{ commands }

Define a filter. You can learn more about filters in the following chapter.

function name (parameters) local variables { commands }

Define a function. You can learn more about functions in the following chapter.

protocol rip|ospf|bgp|... [name [from name2]] { protocol options }

Define a protocol instance called name (or with a name like "rip5" generated automatically if you don't specify any name). You can learn more about configuring protocols in their own chapters. When from name2 expression is used, initial protocol options are taken from protocol or template name2 You can run more than one instance of most protocols (like RIP or BGP). By default, no instances are configured.

template rip|bgp|... [name [from name2]] { protocol options }

Define a protocol template instance called name (or with a name like "bgp1" generated automatically if you don't specify any name). Protocol templates can be used to group common options when many similarly configured protocol instances are to be defined. Protocol instances (and other templates) can use templates by using from expression and the name of the template. At the moment templates (and from expression) are not implemented for OSPF protocol.

define constant = expression

Define a constant. You can use it later in every place you could use a value of the same type. Besides, there are some predefined numeric constants based on /etc/iproute2/rt_* files. A list of defined constants can be seen (together with other symbols) using 'show symbols' command.

router id IPv4 address

Set BIRD's router ID. It's a world-wide unique identification of your router, usually one of router's IPv4 addresses. Default: in IPv4 version, the lowest IP address of a non-loopback interface. In IPv6 version, this option is mandatory.

router id from [-] [ "mask" ] [ prefix ] [, ...]

Set BIRD's router ID based on an IP address of an interface specified by an interface pattern. The option is applicable for IPv4 version only. See interface section for detailed description of interface patterns with extended clauses.

listen bgp [address address] [port port] [dual]

This option allows to specify address and port where BGP protocol should listen. It is global option as listening socket is common to all BGP instances. Default is to listen on all addresses (0.0.0.0) and port 179. In IPv6 mode, option dual can be used to specify that BGP socket should accept both IPv4 and IPv6 connections (but even in that case, BIRD would accept IPv6 routes only). Such behavior was default in older versions of BIRD.

graceful restart wait number

During graceful restart recovery, BIRD waits for convergence of routing protocols. This option allows to specify a timeout for the recovery to prevent waiting indefinitely if some protocols cannot converge. Default: 240 seconds.

timeformat route|protocol|base|log "format1" [limit "format2"]

This option allows to specify a format of date/time used by BIRD. The first argument specifies for which purpose such format is used. route is a format used in 'show route' command output, protocol is used in 'show protocols' command output, base is used for other commands and log is used in a log file.

"format1" is a format string using strftime(3) notation (see man strftime for details). limit> and "format2" allow to specify the second format string for times in past deeper than limit seconds. There are few shorthands: iso long is a ISO 8601 datetime format (YYYY-MM-DD hh:mm:ss) that can be also specified using "%F %T". iso short is a variant of ISO 8601 that uses just the time format (hh:mm:ss) for near times (up to 20 hours in the past) and the date format (YYYY-MM-DD) for far times. This is a shorthand for "%T" 72000 "%F".

By default, BIRD uses the iso short format for route and protocol times, and the iso long format for base and log times.

In pre-1.4.0 versions, BIRD used an short, ad-hoc format for route and protocol times, and a iso long similar format (DD-MM-YYYY hh:mm:ss) for base and log. These timeformats could be set by old short and old long compatibility shorthands.

table name [sorted]

Create a new routing table. The default routing table is created implicitly, other routing tables have to be added by this command. Option sorted can be used to enable sorting of routes, see sorted table description for details.

roa table name [ { roa table options ... } ]

Create a new ROA (Route Origin Authorization) table. ROA tables can be used to validate route origination of BGP routes. A ROA table contains ROA entries, each consist of a network prefix, a max prefix length and an AS number. A ROA entry specifies prefixes which could be originated by that AS number. ROA tables could be filled with data from RPKI (RFC 6480) or from public databases like Whois. ROA tables are examined by roa_check() operator in filters.

Currently, there is just one option, roa prefix max num as num, which can be used to populate the ROA table with static ROA entries. The option may be used multiple times. Other entries can be added dynamically by add roa command.

eval expr

Evaluates given filter expression. It is used by us for testing of filters.

3.3 Protocol options

For each protocol instance, you can configure a bunch of options. Some of them (those described in this section) are generic, some are specific to the protocol (see sections talking about the protocols).

Several options use a switch argument. It can be either on, yes or a numeric expression with a non-zero value for the option to be enabled or off, no or a numeric expression evaluating to zero to disable it. An empty switch is equivalent to on ("silence means agreement").

preference expr

Sets the preference of routes generated by this protocol. Default: protocol dependent.

disabled switch

Disables the protocol. You can change the disable/enable status from the command line interface without needing to touch the configuration. Disabled protocols are not activated. Default: protocol is enabled.

debug all|off|{ states|routes|filters|interfaces|events|packets [, ...] }

Set protocol debugging options. If asked, each protocol is capable of writing trace messages about its work to the log (with category trace). You can either request printing of all trace messages or only of the types selected: states for protocol state changes (protocol going up, down, starting, stopping etc.), routes for routes exchanged with the routing table, filters for details on route filtering, interfaces for interface change events sent to the protocol, events for events internal to the protocol and packets for packets sent and received by the protocol. Default: off.

mrtdump all|off|{ states|messages [, ...] }

Set protocol MRTdump flags. MRTdump is a standard binary format for logging information from routing protocols and daemons. These flags control what kind of information is logged from the protocol to the MRTdump file (which must be specified by global mrtdump option, see the previous section). Although these flags are similar to flags of debug option, their meaning is different and protocol-specific. For BGP protocol, states logs BGP state changes and messages logs received BGP messages. Other protocols does not support MRTdump yet.

router id IPv4 address

This option can be used to override global router id for a given protocol. Default: uses global router id.

import all | none | filter name | filter { filter commands } | where filter expression

Specify a filter to be used for filtering routes coming from the protocol to the routing table. all is shorthand for where true and none is shorthand for where false. Default: all.

export filter

This is similar to the import keyword, except that it works in the direction from the routing table to the protocol. Default: none.

import keep filtered switch

Usually, if an import filter rejects a route, the route is forgotten. When this option is active, these routes are kept in the routing table, but they are hidden and not propagated to other protocols. But it is possible to show them using show route filtered. Note that this option does not work for the pipe protocol. Default: off.

import limit [number | off ] [action warn | block | restart | disable]

Specify an import route limit (a maximum number of routes imported from the protocol) and optionally the action to be taken when the limit is hit. Warn action just prints warning log message. Block action discards new routes coming from the protocol. Restart and disable actions shut the protocol down like appropriate commands. Disable is the default action if an action is not explicitly specified. Note that limits are reset during protocol reconfigure, reload or restart. Default: off.

receive limit [number | off ] [action warn | block | restart | disable]

Specify an receive route limit (a maximum number of routes received from the protocol and remembered). It works almost identically to import limit option, the only difference is that if import keep filtered option is active, filtered routes are counted towards the limit and blocked routes are forgotten, as the main purpose of the receive limit is to protect routing tables from overflow. Import limit, on the contrary, counts accepted routes only and routes blocked by the limit are handled like filtered routes. Default: off.

export limit [ number | off ] [action warn | block | restart | disable]

Specify an export route limit, works similarly to the import limit option, but for the routes exported to the protocol. This option is experimental, there are some problems in details of its behavior -- the number of exported routes can temporarily exceed the limit without triggering it during protocol reload, exported routes counter ignores route blocking and block action also blocks route updates of already accepted routes -- and these details will probably change in the future. Default: off.

description "text"

This is an optional description of the protocol. It is displayed as a part of the output of 'show route all' command.

table name

Connect this protocol to a non-default routing table.

There are several options that give sense only with certain protocols:

interface [-] [ "mask" ] [ prefix ] [, ...] [ { option; [...] } ]

Specifies a set of interfaces on which the protocol is activated with given interface-specific options. A set of interfaces specified by one interface option is described using an interface pattern. The interface pattern consists of a sequence of clauses (separated by commas), each clause is a mask specified as a shell-like pattern. Interfaces are matched by their name.

An interface matches the pattern if it matches any of its clauses. If the clause begins with -, matching interfaces are excluded. Patterns are processed left-to-right, thus interface "eth0", -"eth*", "*"; means eth0 and all non-ethernets.

Some protocols (namely OSPFv2 and Direct) support extended clauses that may contain a mask, a prefix, or both of them. An interface matches such clause if its name matches the mask (if specified) and its address matches the prefix (if specified). Extended clauses are used when the protocol handles multiple addresses on an interface independently.

An interface option can be used more times with different interface-specific options, in that case for given interface the first matching interface option is used.

This option is allowed in Babel, BFD, Direct, OSPF, RAdv and RIP protocols, but in OSPF protocol it is used in the area subsection.

Default: none.

Examples:

interface "*" { type broadcast; }; - start the protocol on all interfaces with type broadcast option.

interface "eth1", "eth4", "eth5" { type ptp; }; - start the protocol on enumerated interfaces with type ptp option.

interface -192.168.1.0/24, 192.168.0.0/16; - start the protocol on all interfaces that have address from 192.168.0.0/16, but not from 192.168.1.0/24.

interface -192.168.1.0/24, 192.168.0.0/16; - start the protocol on all interfaces that have address from 192.168.0.0/16, but not from 192.168.1.0/24.

interface "eth*" 192.168.1.0/24; - start the protocol on all ethernet interfaces that have address from 192.168.1.0/24.

tx class|dscp num

This option specifies the value of ToS/DS/Class field in IP headers of the outgoing protocol packets. This may affect how the protocol packets are processed by the network relative to the other network traffic. With class keyword, the value (0-255) is used for the whole ToS/Class octet (but two bits reserved for ECN are ignored). With dscp keyword, the value (0-63) is used just for the DS field in the octet. Default value is 0xc0 (DSCP 0x30 - CS6).

tx priority num

This option specifies the local packet priority. This may affect how the protocol packets are processed in the local TX queues. This option is Linux specific. Default value is 7 (highest priority, privileged traffic).

password "password" [ { password options } ]

Specifies a password that can be used by the protocol as a shared secret key. Password option can be used more times to specify more passwords. If more passwords are specified, it is a protocol-dependent decision which one is really used. Specifying passwords does not mean that authentication is enabled, authentication can be enabled by separate, protocol-dependent authentication option.

This option is allowed in BFD, OSPF and RIP protocols. BGP has also password option, but it is slightly different and described separately. Default: none.

Password option can contain section with some (not necessary all) password sub-options:

id num

ID of the password, (1-255). If it is not used, BIRD will choose ID based on an order of the password item in the interface. For example, second password item in one interface will have default ID 2. ID is used by some routing protocols to identify which password was used to authenticate protocol packets.

generate from "time"

The start time of the usage of the password for packet signing. The format of time is dd-mm-yyyy HH:MM:SS.

generate to "time"

The last time of the usage of the password for packet signing.

accept from "time"

The start time of the usage of the password for packet verification.

accept to "time"

The last time of the usage of the password for packet verification.

from "time"

Shorthand for setting both generate from and accept from.

to "time"

Shorthand for setting both generate to and accept to.

algorithm ( keyed md5 | keyed sha1 | hmac sha1 | hmac sha256 | hmac sha384 | hmac sha512 )

The message authentication algorithm for the password when cryptographic authentication is enabled. The default value depends on the protocol. For RIP and OSPFv2 it is Keyed-MD5 (for compatibility), for OSPFv3 protocol it is HMAC-SHA-256.

Next Previous Contents bird-1.6.3/doc/sgml2html0000755000103200001440000000157013027054563014041 0ustar feelausers#!/usr/bin/perl # # sgmltools.in # # $Id$ # # SGML-Tools driver. Calls all other SGML-Tools components, contains # configuration information, etcetera. # package main; sub BEGIN { require 5.004; } use strict; use vars qw($prefix $DataDir $BinDir $progs); $prefix = "/usr"; $DataDir = "sbase"; $BinDir = "/usr/bin"; use lib "/usr/share/linuxdoc-tools"; use lib "/usr/perl5"; use lib "/usr/lib/perl5"; use lib "/usr/share/perl5"; $progs = { "NSGMLS" => "/usr/bin/nsgmls", "SGMLSASP" => "/usr/bin/sgmlsasp", "GROFF" => "/usr/bin/groff", "GROFFMACRO" => "-ms", "AWK" => "/usr/share/linuxdoc-tools/awkwhich" }; $ENV{"SGML_CATALOG_FILES"} = "sbase/dtd/catalog"; require "./LinuxDocTools.pm"; &LinuxDocTools::init; my @FileList = LinuxDocTools::process_options ("html", @ARGV); for my $curfile (@FileList) { LinuxDocTools::process_file ($curfile); } exit 0; bird-1.6.3/doc/Doc0000644000103200001440000000002213027054563012621 0ustar feelausersD prog-intro.sgml bird-1.6.3/doc/prog-7.html0000644000103200001440000006236613027054667014222 0ustar feelausers BIRD Programmer's Documentation: Library functions Next Previous Contents

7. Library functions

7.1 IP addresses

BIRD uses its own abstraction of IP address in order to share the same code for both IPv4 and IPv6. IP addresses are represented as entities of type ip_addr which are never to be treated as numbers and instead they must be manipulated using the following functions and macros.

Function

char * ip_scope_text (uint scope) -- get textual representation of address scope

Arguments

uint scope

scope (SCOPE_xxx)

Description

Returns a pointer to a textual name of the scope given.

Function

int ipa_equal (ip_addr x, ip_addr y) -- compare two IP addresses for equality

Arguments

ip_addr x

IP address

ip_addr y

IP address

Description

ipa_equal() returns 1 if x and y represent the same IP address, else 0.

Function

int ipa_nonzero (ip_addr x) -- test if an IP address is defined

Arguments

ip_addr x

IP address

Description

ipa_nonzero returns 1 if x is a defined IP address (not all bits are zero), else 0.

The undefined all-zero address is reachable as a IPA_NONE macro.

Function

ip_addr ipa_and (ip_addr x, ip_addr y) -- compute bitwise and of two IP addresses

Arguments

ip_addr x

IP address

ip_addr y

IP address

Description

This function returns a bitwise and of x and y. It's primarily used for network masking.

Function

ip_addr ipa_or (ip_addr x, ip_addr y) -- compute bitwise or of two IP addresses

Arguments

ip_addr x

IP address

ip_addr y

IP address

Description

This function returns a bitwise or of x and y.

Function

ip_addr ipa_xor (ip_addr x, ip_addr y) -- compute bitwise xor of two IP addresses

Arguments

ip_addr x

IP address

ip_addr y

IP address

Description

This function returns a bitwise xor of x and y.

Function

ip_addr ipa_not (ip_addr x) -- compute bitwise negation of two IP addresses

Arguments

ip_addr x

IP address

Description

This function returns a bitwise negation of x.

Function

ip_addr ipa_mkmask (int x) -- create a netmask

Arguments

int x

prefix length

Description

This function returns an ip_addr corresponding of a netmask of an address prefix of size x.

Function

int ipa_masklen (ip_addr x) -- calculate netmask length

Arguments

ip_addr x

IP address

Description

This function checks whether x represents a valid netmask and returns the size of the associate network prefix or -1 for invalid mask.

Function

int ipa_hash (ip_addr x) -- hash IP addresses

Arguments

ip_addr x

IP address

Description

ipa_hash() returns a 16-bit hash value of the IP address x.

Function

void ipa_hton (ip_addr x) -- convert IP address to network order

Arguments

ip_addr x

IP address

Description

Converts the IP address x to the network byte order.

Beware, this is a macro and it alters the argument!

Function

void ipa_ntoh (ip_addr x) -- convert IP address to host order

Arguments

ip_addr x

IP address

Description

Converts the IP address x from the network byte order.

Beware, this is a macro and it alters the argument!

Function

int ipa_classify (ip_addr x) -- classify an IP address

Arguments

ip_addr x

IP address

Description

ipa_classify() returns an address class of x, that is a bitwise or of address type (IADDR_INVALID, IADDR_HOST, IADDR_BROADCAST, IADDR_MULTICAST) with address scope (SCOPE_HOST to SCOPE_UNIVERSE) or -1 (IADDR_INVALID) for an invalid address.

Function

ip4_addr ip4_class_mask (ip4_addr x) -- guess netmask according to address class

Arguments

ip4_addr x

IPv4 address

Description

This function (available in IPv4 version only) returns a network mask according to the address class of x. Although classful addressing is nowadays obsolete, there still live routing protocols transferring no prefix lengths nor netmasks and this function could be useful to them.

Function

u32 ipa_from_u32 (ip_addr x) -- convert IPv4 address to an integer

Arguments

ip_addr x

IP address

Description

This function takes an IPv4 address and returns its numeric representation.

Function

ip_addr ipa_to_u32 (u32 x) -- convert integer to IPv4 address

Arguments

u32 x

a 32-bit integer

Description

ipa_to_u32() takes a numeric representation of an IPv4 address and converts it to the corresponding ip_addr.

Function

int ipa_compare (ip_addr x, ip_addr y) -- compare two IP addresses for order

Arguments

ip_addr x

IP address

ip_addr y

IP address

Description

The ipa_compare() function takes two IP addresses and returns -1 if x is less than y in canonical ordering (lexicographical order of the bit strings), 1 if x is greater than y and 0 if they are the same.

Function

ip_addr ipa_build6 (u32 a1, u32 a2, u32 a3, u32 a4) -- build an IPv6 address from parts

Arguments

u32 a1

part #1

u32 a2

part #2

u32 a3

part #3

u32 a4

part #4

Description

ipa_build() takes a1 to a4 and assembles them to a single IPv6 address. It's used for example when a protocol wants to bind its socket to a hard-wired multicast address.

Function

char * ip_ntop (ip_addr a, char * buf) -- convert IP address to textual representation

Arguments

ip_addr a

IP address

char * buf

buffer of size at least STD_ADDRESS_P_LENGTH

Description

This function takes an IP address and creates its textual representation for presenting to the user.

Function

char * ip_ntox (ip_addr a, char * buf) -- convert IP address to hexadecimal representation

Arguments

ip_addr a

IP address

char * buf

buffer of size at least STD_ADDRESS_P_LENGTH

Description

This function takes an IP address and creates its hexadecimal textual representation. Primary use: debugging dumps.

Function

int ip_pton (char * a, ip_addr * o) -- parse textual representation of IP address

Arguments

char * a

textual representation

ip_addr * o

where to put the resulting address

Description

This function parses a textual IP address representation and stores the decoded address to a variable pointed to by o. Returns 0 if a parse error has occurred, else 0.

7.2 Linked lists

The BIRD library provides a set of functions for operating on linked lists. The lists are internally represented as standard doubly linked lists with synthetic head and tail which makes all the basic operations run in constant time and contain no extra end-of-list checks. Each list is described by a list structure, nodes can have any format as long as they start with a node structure. If you want your nodes to belong to multiple lists at once, you can embed multiple node structures in them and use the SKIP_BACK() macro to calculate a pointer to the start of the structure from a node pointer, but beware of obscurity.

There also exist safe linked lists (slist, snode and all functions being prefixed with s_) which support asynchronous walking very similar to that used in the fib structure.

Function

LIST_INLINE void add_tail (list * l, node * n) -- append a node to a list

Arguments

list * l

linked list

node * n

list node

Description

add_tail() takes a node n and appends it at the end of the list l.

Function

LIST_INLINE void add_head (list * l, node * n) -- prepend a node to a list

Arguments

list * l

linked list

node * n

list node

Description

add_head() takes a node n and prepends it at the start of the list l.

Function

LIST_INLINE void insert_node (node * n, node * after) -- insert a node to a list

Arguments

node * n

a new list node

node * after

a node of a list

Description

Inserts a node n to a linked list after an already inserted node after.

Function

LIST_INLINE void rem_node (node * n) -- remove a node from a list

Arguments

node * n

node to be removed

Description

Removes a node n from the list it's linked in. Afterwards, node n is cleared.

Function

LIST_INLINE void replace_node (node * old, node * new) -- replace a node in a list with another one

Arguments

node * old

node to be removed

node * new

node to be inserted

Description

Replaces node old in the list it's linked in with node new. Node old may be a copy of the original node, which is not accessed through the list. The function could be called with old == new, which just fixes neighbors' pointers in the case that the node was reallocated.

Function

LIST_INLINE void init_list (list * l) -- create an empty list

Arguments

list * l

list

Description

init_list() takes a list structure and initializes its fields, so that it represents an empty list.

Function

LIST_INLINE void add_tail_list (list * to, list * l) -- concatenate two lists

Arguments

list * to

destination list

list * l

source list

Description

This function appends all elements of the list l to the list to in constant time.

7.3 Miscellaneous functions.

Function

int ipsum_verify (void * frag, uint len, ... ...) -- verify an IP checksum

Arguments

void * frag

first packet fragment

uint len

length in bytes

... ...

variable arguments

Description

This function verifies whether a given fragmented packet has correct one's complement checksum as used by the IP protocol.

It uses all the clever tricks described in RFC 1071 to speed up checksum calculation as much as possible.

Result

1 if the checksum is correct, 0 else.

Function

u16 ipsum_calculate (void * frag, uint len, ... ...) -- compute an IP checksum

Arguments

void * frag

first packet fragment

uint len

length in bytes

... ...

variable arguments

Description

This function calculates a one's complement checksum of a given fragmented packet.

It uses all the clever tricks described in RFC 1071 to speed up checksum calculation as much as possible.

Function

u32 u32_mkmask (uint n) -- create a bit mask

Arguments

uint n

number of bits

Description

u32_mkmask() returns an unsigned 32-bit integer which binary representation consists of n ones followed by zeroes.

Function

int u32_masklen (u32 x) -- calculate length of a bit mask

Arguments

u32 x

bit mask

Description

This function checks whether the given integer x represents a valid bit mask (binary representation contains first ones, then zeroes) and returns the number of ones or -1 if the mask is invalid.

Function

u32 u32_log2 (u32 v) -- compute a binary logarithm.

Arguments

u32 v

number

Description

This function computes a integral part of binary logarithm of given integer v and returns it. The computed value is also an index of the most significant non-zero bit position.

Function

int patmatch (byte * p, byte * s) -- match shell-like patterns

Arguments

byte * p

pattern

byte * s

string

Description

patmatch() returns whether given string s matches the given shell-like pattern p. The patterns consist of characters (which are matched literally), question marks which match any single character, asterisks which match any (possibly empty) string of characters and backslashes which are used to escape any special characters and force them to be treated literally.

The matching process is not optimized with respect to time, so please avoid using this function for complex patterns.

Function

int bvsnprintf (char * buf, int size, const char * fmt, va_list args) -- BIRD's vsnprintf()

Arguments

char * buf

destination buffer

int size

size of the buffer

const char * fmt

format string

va_list args

a list of arguments to be formatted

Description

This functions acts like ordinary sprintf() except that it checks available space to avoid buffer overflows and it allows some more

format specifiers

I for formatting of IP addresses (any non-zero width is automatically replaced by standard IP address width which depends on whether we use IPv4 or IPv6; %#I gives hexadecimal format), R for Router / Network ID (u32 value printed as IPv4 address) lR for 64bit Router / Network ID (u64 value printed as eight :-separated octets) and m resp. M for error messages (uses strerror() to translate errno code to message text). On the other hand, it doesn't support floating point numbers.

Result

number of characters of the output string or -1 if the buffer space was insufficient.

Function

int bvsprintf (char * buf, const char * fmt, va_list args) -- BIRD's vsprintf()

Arguments

char * buf

buffer

const char * fmt

format string

va_list args

a list of arguments to be formatted

Description

This function is equivalent to bvsnprintf() with an infinite buffer size. Please use carefully only when you are absolutely sure the buffer won't overflow.

Function

int bsprintf (char * buf, const char * fmt, ... ...) -- BIRD's sprintf()

Arguments

char * buf

buffer

const char * fmt

format string

... ...

variable arguments

Description

This function is equivalent to bvsnprintf() with an infinite buffer size and variable arguments instead of a va_list. Please use carefully only when you are absolutely sure the buffer won't overflow.

Function

int bsnprintf (char * buf, int size, const char * fmt, ... ...) -- BIRD's snprintf()

Arguments

char * buf

buffer

int size

buffer size

const char * fmt

format string

... ...

variable arguments

Description

This function is equivalent to bsnprintf() with variable arguments instead of a va_list.

Function

void * xmalloc (uint size) -- malloc with checking

Arguments

uint size

block size

Description

This function is equivalent to malloc() except that in case of failure it calls die() to quit the program instead of returning a NULL pointer.

Wherever possible, please use the memory resources instead.

Function

void * xrealloc (void * ptr, uint size) -- realloc with checking

Arguments

void * ptr

original memory block

uint size

block size

Description

This function is equivalent to realloc() except that in case of failure it calls die() to quit the program instead of returning a NULL pointer.

Wherever possible, please use the memory resources instead.

7.4 Message authentication codes

MAC algorithms are simple cryptographic tools for message authentication. They use shared a secret key a and message text to generate authentication code, which is then passed with the message to the other side, where the code is verified. There are multiple families of MAC algorithms based on different cryptographic primitives, BIRD implements two MAC families which use hash functions.

The first family is simply a cryptographic hash camouflaged as MAC algorithm. Originally supposed to be (m|k)-hash (message is concatenated with key, and that is hashed), but later it turned out that a raw hash is more practical. This is used for cryptographic authentication in OSPFv2, RIP and BFD.

The second family is the standard HMAC (RFC 2104), using inner and outer hash to process key and message. HMAC (with SHA) is used in advanced OSPF and RIP authentication (RFC 5709, RFC 4822).

Function

void mac_init (struct mac_context * ctx, uint id, const byte * key, uint keylen) -- initialize MAC algorithm

Arguments

struct mac_context * ctx

context to initialize

uint id

MAC algorithm ID

const byte * key

MAC key

uint keylen

MAC key length

Description

Initialize MAC context ctx for algorithm id (e.g., ALG_HMAC_SHA1), with key key of length keylen. After that, message data could be added using mac_update() function.

Function

void mac_update (struct mac_context * ctx, const byte * data, uint datalen) -- add more data to MAC algorithm

Arguments

struct mac_context * ctx

MAC context

const byte * data

data to add

uint datalen

length of data

Description

Push another datalen bytes of data pointed to by data into the MAC algorithm currently in ctx. Can be called multiple times for the same MAC context. It has the same effect as concatenating all the data together and passing them at once.

Function

byte * mac_final (struct mac_context * ctx) -- finalize MAC algorithm

Arguments

struct mac_context * ctx

MAC context

Description

Finish MAC computation and return a pointer to the result. No more mac_update() calls could be done, but the context may be reinitialized later.

Note that the returned pointer points into data in the ctx context. If it ceases to exist, the pointer becomes invalid.

Function

void mac_cleanup (struct mac_context * ctx) -- cleanup MAC context

Arguments

struct mac_context * ctx

MAC context

Description

Cleanup MAC context after computation (by filling with zeros). Not strictly necessary, just to erase sensitive data from stack. This also invalidates the pointer returned by mac_final().

Function

void mac_fill (uint id, const byte * key, uint keylen, const byte * data, uint datalen, byte * mac) -- compute and fill MAC

Arguments

uint id

MAC algorithm ID

const byte * key

secret key

uint keylen

key length

const byte * data

message data

uint datalen

message length

byte * mac

place to fill MAC

Description

Compute MAC for specified key key and message data using algorithm id and copy it to buffer mac. mac_fill() is a shortcut function doing all usual steps for transmitted messages.

Function

int mac_verify (uint id, const byte * key, uint keylen, const byte * data, uint datalen, const byte * mac) -- compute and verify MAC

Arguments

uint id

MAC algorithm ID

const byte * key

secret key

uint keylen

key length

const byte * data

message data

uint datalen

message length

const byte * mac

received MAC

Description

Compute MAC for specified key key and message data using algorithm id and compare it with received mac, return whether they are the same. mac_verify() is a shortcut function doing all usual steps for received messages.

Next Previous Contents bird-1.6.3/doc/bird.sgml0000644000103200001440000055145013027054563014015 0ustar feelausers BIRD User's Guide <author> Ondrej Filip <it/<feela@network.cz>/, Pavel Machek <it/<pavel@ucw.cz>/, Martin Mares <it/<mj@ucw.cz>/, Ondrej Zajicek <it/<santiago@crfreenet.org>/ </author> <abstract> This document contains user documentation for the BIRD Internet Routing Daemon project. </abstract> <!-- Table of contents --> <toc> <!-- Begin the document --> <chapt>Introduction <label id="intro"> <sect>What is BIRD <label id="what-is-bird"> <p>The name `BIRD' is actually an acronym standing for `BIRD Internet Routing Daemon'. Let's take a closer look at the meaning of the name: <p><em/BIRD/: Well, we think we have already explained that. It's an acronym standing for `BIRD Internet Routing Daemon', you remember, don't you? :-) <p><em/Internet Routing/: It's a program (well, a daemon, as you are going to discover in a moment) which works as a dynamic router in an Internet type network (that is, in a network running either the IPv4 or the IPv6 protocol). Routers are devices which forward packets between interconnected networks in order to allow hosts not connected directly to the same local area network to communicate with each other. They also communicate with the other routers in the Internet to discover the topology of the network which allows them to find optimal (in terms of some metric) rules for forwarding of packets (which are called routing tables) and to adapt themselves to the changing conditions such as outages of network links, building of new connections and so on. Most of these routers are costly dedicated devices running obscure firmware which is hard to configure and not open to any changes (on the other hand, their special hardware design allows them to keep up with lots of high-speed network interfaces, better than general-purpose computer does). Fortunately, most operating systems of the UNIX family allow an ordinary computer to act as a router and forward packets belonging to the other hosts, but only according to a statically configured table. <p>A <em/Routing Daemon/ is in UNIX terminology a non-interactive program running on background which does the dynamic part of Internet routing, that is it communicates with the other routers, calculates routing tables and sends them to the OS kernel which does the actual packet forwarding. There already exist other such routing daemons: routed (RIP only), GateD (non-free), <HTMLURL URL="http://www.zebra.org" name="Zebra"> and <HTMLURL URL="http://sourceforge.net/projects/mrt" name="MRTD">, but their capabilities are limited and they are relatively hard to configure and maintain. <p>BIRD is an Internet Routing Daemon designed to avoid all of these shortcomings, to support all the routing technology used in the today's Internet or planned to be used in near future and to have a clean extensible architecture allowing new routing protocols to be incorporated easily. Among other features, BIRD supports: <itemize> <item>both IPv4 and IPv6 protocols <item>multiple routing tables <item>the Border Gateway Protocol (BGPv4) <item>the Routing Information Protocol (RIPv2) <item>the Open Shortest Path First protocol (OSPFv2, OSPFv3) <item>the Router Advertisements for IPv6 hosts <item>a virtual protocol for exchange of routes between different routing tables on a single host <item>a command-line interface allowing on-line control and inspection of status of the daemon <item>soft reconfiguration (no need to use complex online commands to change the configuration, just edit the configuration file and notify BIRD to re-read it and it will smoothly switch itself to the new configuration, not disturbing routing protocols unless they are affected by the configuration changes) <item>a powerful language for route filtering </itemize> <p>BIRD has been developed at the Faculty of Math and Physics, Charles University, Prague, Czech Republic as a student project. It can be freely distributed under the terms of the GNU General Public License. <p>BIRD has been designed to work on all UNIX-like systems. It has been developed and tested under Linux 2.0 to 2.6, and then ported to FreeBSD, NetBSD and OpenBSD, porting to other systems (even non-UNIX ones) should be relatively easy due to its highly modular architecture. <p>BIRD supports either IPv4 or IPv6 protocol, but have to be compiled separately for each one. Therefore, a dualstack router would run two instances of BIRD (one for IPv4 and one for IPv6), with completely separate setups (configuration files, tools ...). <sect>Installing BIRD <label id="install"> <p>On a recent UNIX system with GNU development tools (GCC, binutils, m4, make) and Perl, installing BIRD should be as easy as: <code> ./configure make make install vi /usr/local/etc/bird.conf bird </code> <p>You can use <tt>./configure --help</tt> to get a list of configure options. The most important ones are: <tt/--enable-ipv6/ which enables building of an IPv6 version of BIRD, <tt/--with-protocols=/ to produce a slightly smaller BIRD executable by configuring out routing protocols you don't use, and <tt/--prefix=/ to install BIRD to a place different from <file>/usr/local</file>. <sect>Running BIRD <label id="argv"> <p>You can pass several command-line options to bird: <descrip> <tag><label id="argv-config">-c <m/config name/</tag> use given configuration file instead of <it/prefix/<file>/etc/bird.conf</file>. <tag><label id="argv-debug">-d</tag> enable debug messages and run bird in foreground. <tag><label id="argv-log-file">-D <m/filename of debug log/</tag> log debugging information to given file instead of stderr. <tag><label id="argv-foreground">-f</tag> run bird in foreground. <tag><label id="argv-group">-g <m/group/</tag> use that group ID, see the next section for details. <tag><label id="argv-help">-h, --help</tag> display command-line options to bird. <tag><label id="argv-local">-l</tag> look for a configuration file and a communication socket in the current working directory instead of in default system locations. However, paths specified by options <cf/-c/, <cf/-s/ have higher priority. <tag><label id="argv-parse">-p</tag> just parse the config file and exit. Return value is zero if the config file is valid, nonzero if there are some errors. <tag><label id="argv-pid">-P <m/name of PID file/</tag> create a PID file with given filename. <tag><label id="argv-recovery">-R</tag> apply graceful restart recovery after start. <tag><label id="argv-socket">-s <m/name of communication socket/</tag> use given filename for a socket for communications with the client, default is <it/prefix/<file>/var/run/bird.ctl</file>. <tag><label id="argv-user">-u <m/user/</tag> drop privileges and use that user ID, see the next section for details. <tag><label id="argv-version">--version</tag> display bird version. </descrip> <p>BIRD writes messages about its work to log files or syslog (according to config). <sect>Privileges <label id="privileges"> <p>BIRD, as a routing daemon, uses several privileged operations (like setting routing table and using raw sockets). Traditionally, BIRD is executed and runs with root privileges, which may be prone to security problems. The recommended way is to use a privilege restriction (options <cf/-u/, <cf/-g/). In that case BIRD is executed with root privileges, but it changes its user and group ID to an unprivileged ones, while using Linux capabilities to retain just required privileges (capabilities CAP_NET_*). Note that the control socket is created before the privileges are dropped, but the config file is read after that. The privilege restriction is not implemented in BSD port of BIRD. <p>An unprivileged user (as an argument to <cf/-u/ options) may be the user <cf/nobody/, but it is suggested to use a new dedicated user account (like <cf/bird/). The similar considerations apply for the group option, but there is one more condition -- the users in the same group can use <file/birdc/ to control BIRD. <p>Finally, there is a possibility to use external tools to run BIRD in an environment with restricted privileges. This may need some configuration, but it is generally easy -- BIRD needs just the standard library, privileges to read the config file and create the control socket and the CAP_NET_* capabilities. <chapt>About routing tables <label id="routing-tables"> <p>BIRD has one or more routing tables which may or may not be synchronized with OS kernel and which may or may not be synchronized with each other (see the Pipe protocol). Each routing table contains a list of known routes. Each route consists of: <itemize> <item>network prefix this route is for (network address and prefix length -- the number of bits forming the network part of the address; also known as a netmask) <item>preference of this route <item>IP address of router which told us about this route <item>IP address of router we should forward the packets to using this route <item>other attributes common to all routes <item>dynamic attributes defined by protocols which may or may not be present (typically protocol metrics) </itemize> Routing table maintains multiple entries for a network, but at most one entry for one network and one protocol. The entry with the highest preference is used for routing (we will call such an entry the <it/selected route/). If there are more entries with the same preference and they are from the same protocol, the protocol decides (typically according to metrics). If they aren't, an internal ordering is used to break the tie. You can get the list of route attributes in the Route attributes section. <p>Each protocol is connected to a routing table through two filters which can accept, reject and modify the routes. An <it/export/ filter checks routes passed from the routing table to the protocol, an <it/import/ filter checks routes in the opposite direction. When the routing table gets a route from a protocol, it recalculates the selected route and broadcasts it to all protocols connected to the table. The protocols typically send the update to other routers in the network. Note that although most protocols are interested in receiving just selected routes, some protocols (e.g. the <cf/Pipe/ protocol) receive and process all entries in routing tables (accepted by filters). <p><label id="dsc-table-sorted">Usually, a routing table just chooses a selected route from a list of entries for one network. But if the <cf/sorted/ option is activated, these lists of entries are kept completely sorted (according to preference or some protocol-dependent metric). This is needed for some features of some protocols (e.g. <cf/secondary/ option of BGP protocol, which allows to accept not just a selected route, but the first route (in the sorted list) that is accepted by filters), but it is incompatible with some other features (e.g. <cf/deterministic med/ option of BGP protocol, which activates a way of choosing selected route that cannot be described using comparison and ordering). Minor advantage is that routes are shown sorted in <cf/show route/, minor disadvantage is that it is slightly more computationally expensive. <sect>Graceful restart <label id="graceful-restart"> <p>When BIRD is started after restart or crash, it repopulates routing tables in an uncoordinated manner, like after clean start. This may be impractical in some cases, because if the forwarding plane (i.e. kernel routing tables) remains intact, then its synchronization with BIRD would temporarily disrupt packet forwarding until protocols converge. Graceful restart is a mechanism that could help with this issue. Generally, it works by starting protocols and letting them repopulate routing tables while deferring route propagation until protocols acknowledge their convergence. Note that graceful restart behavior have to be configured for all relevant protocols and requires protocol-specific support (currently implemented for Kernel and BGP protocols), it is activated for particular boot by option <cf/-R/. <chapt>Configuration <label id="config"> <sect>Introduction <label id="config-intro"> <p>BIRD is configured using a text configuration file. Upon startup, BIRD reads <it/prefix/<file>/etc/bird.conf</file> (unless the <tt/-c/ command line option is given). Configuration may be changed at user's request: if you modify the config file and then signal BIRD with <tt/SIGHUP/, it will adjust to the new config. Then there's the client which allows you to talk with BIRD in an extensive way. <p>In the config, everything on a line after <cf/#/ or inside <cf>/* */</cf> is a comment, whitespace characters are treated as a single space. If there's a variable number of options, they are grouped using the <cf/{ }/ brackets. Each option is terminated by a <cf/;/. Configuration is case sensitive. There are two ways how to name symbols (like protocol names, filter names, constants etc.). You can either use a simple string starting with a letter followed by any combination of letters and numbers (e.g. "R123", "myfilter", "bgp5") or you can enclose the name into apostrophes (<cf/'/) and than you can use any combination of numbers, letters. hyphens, dots and colons (e.g. "'1:strange-name'", "'-NAME-'", "'cool::name'"). <p>Here is an example of a simple config file. It enables synchronization of routing tables with OS kernel, scans for new network interfaces every 10 seconds and runs RIP on all network interfaces found. <code> protocol kernel { persist; # Don't remove routes on BIRD shutdown scan time 20; # Scan kernel routing table every 20 seconds export all; # Default is export none } protocol device { scan time 10; # Scan interfaces every 10 seconds } protocol rip { export all; import all; interface "*"; } </code> <sect>Global options <label id="global-opts"> <p><descrip> <tag><label id="opt-include">include "<m/filename/"</tag> This statement causes inclusion of a new file. <m/Filename/ could also be a wildcard, in that case matching files are included in alphabetic order. The maximal depth is 8. Note that this statement could be used anywhere in the config file, not just as a top-level option. <tag><label id="opt-log">log "<m/filename/"|syslog [name <m/name/]|stderr all|{ <m/list of classes/ }</tag> Set logging of messages having the given class (either <cf/all/ or <cf/{ error|trace [, <m/.../] }/ etc.) into selected destination (a file specified as a filename string, syslog with optional name argument, or the stderr output). Classes are: <cf/info/, <cf/warning/, <cf/error/ and <cf/fatal/ for messages about local problems, <cf/debug/ for debugging messages, <cf/trace/ when you want to know what happens in the network, <cf/remote/ for messages about misbehavior of remote machines, <cf/auth/ about authentication failures, <cf/bug/ for internal BIRD bugs. You may specify more than one <cf/log/ line to establish logging to multiple destinations. Default: log everything to the system log. <tag><label id="opt-debug-protocols">debug protocols all|off|{ states|routes|filters|interfaces|events|packets [, <m/.../] }</tag> Set global defaults of protocol debugging options. See <cf/debug/ in the following section. Default: off. <tag><label id="opt-debug-commands">debug commands <m/number/</tag> Control logging of client connections (0 for no logging, 1 for logging of connects and disconnects, 2 and higher for logging of all client commands). Default: 0. <tag><label id="opt-debug-latency">debug latency <m/switch/</tag> Activate tracking of elapsed time for internal events. Recent events could be examined using <cf/dump events/ command. Default: off. <tag><label id="opt-debug-latency-limit">debug latency limit <m/time/</tag> If <cf/debug latency/ is enabled, this option allows to specify a limit for elapsed time. Events exceeding the limit are logged. Default: 1 s. <tag><label id="opt-watchdog-warn">watchdog warning <m/time/</tag> Set time limit for I/O loop cycle. If one iteration took more time to complete, a warning is logged. Default: 5 s. <tag><label id="opt-watchdog-timeout">watchdog timeout <m/time/</tag> Set time limit for I/O loop cycle. If the limit is breached, BIRD is killed by abort signal. The timeout has effective granularity of seconds, zero means disabled. Default: disabled (0). <tag><label id="opt-mrtdump">mrtdump "<m/filename/"</tag> Set MRTdump file name. This option must be specified to allow MRTdump feature. Default: no dump file. <tag><label id="opt-mrtdump-protocols">mrtdump protocols all|off|{ states|messages [, <m/.../] }</tag> Set global defaults of MRTdump options. See <cf/mrtdump/ in the following section. Default: off. <tag><label id="opt-filter">filter <m/name local variables/{ <m/commands/ }</tag> Define a filter. You can learn more about filters in the following chapter. <tag><label id="opt-function">function <m/name/ (<m/parameters/) <m/local variables/ { <m/commands/ }</tag> Define a function. You can learn more about functions in the following chapter. <tag><label id="opt-protocol">protocol rip|ospf|bgp|<m/.../ [<m/name/ [from <m/name2/]] { <m>protocol options</m> }</tag> Define a protocol instance called <cf><m/name/</cf> (or with a name like "rip5" generated automatically if you don't specify any <cf><m/name/</cf>). You can learn more about configuring protocols in their own chapters. When <cf>from <m/name2/</cf> expression is used, initial protocol options are taken from protocol or template <cf><m/name2/</cf> You can run more than one instance of most protocols (like RIP or BGP). By default, no instances are configured. <tag><label id="opt-template">template rip|bgp|<m/.../ [<m/name/ [from <m/name2/]] { <m>protocol options</m> }</tag> Define a protocol template instance called <m/name/ (or with a name like "bgp1" generated automatically if you don't specify any <m/name/). Protocol templates can be used to group common options when many similarly configured protocol instances are to be defined. Protocol instances (and other templates) can use templates by using <cf/from/ expression and the name of the template. At the moment templates (and <cf/from/ expression) are not implemented for OSPF protocol. <tag><label id="opt-define">define <m/constant/ = <m/expression/</tag> Define a constant. You can use it later in every place you could use a value of the same type. Besides, there are some predefined numeric constants based on /etc/iproute2/rt_* files. A list of defined constants can be seen (together with other symbols) using 'show symbols' command. <tag><label id="opt-router-id">router id <m/IPv4 address/</tag> Set BIRD's router ID. It's a world-wide unique identification of your router, usually one of router's IPv4 addresses. Default: in IPv4 version, the lowest IP address of a non-loopback interface. In IPv6 version, this option is mandatory. <tag><label id="opt-router-id-from">router id from [-] [ "<m/mask/" ] [ <m/prefix/ ] [, <m/.../]</tag> Set BIRD's router ID based on an IP address of an interface specified by an interface pattern. The option is applicable for IPv4 version only. See <ref id="proto-iface" name="interface"> section for detailed description of interface patterns with extended clauses. <tag><label id="opt-listen-bgp">listen bgp [address <m/address/] [port <m/port/] [dual]</tag> This option allows to specify address and port where BGP protocol should listen. It is global option as listening socket is common to all BGP instances. Default is to listen on all addresses (0.0.0.0) and port 179. In IPv6 mode, option <cf/dual/ can be used to specify that BGP socket should accept both IPv4 and IPv6 connections (but even in that case, BIRD would accept IPv6 routes only). Such behavior was default in older versions of BIRD. <tag><label id="opt-graceful-restart">graceful restart wait <m/number/</tag> During graceful restart recovery, BIRD waits for convergence of routing protocols. This option allows to specify a timeout for the recovery to prevent waiting indefinitely if some protocols cannot converge. Default: 240 seconds. <tag><label id="opt-timeformat">timeformat route|protocol|base|log "<m/format1/" [<m/limit/ "<m/format2/"]</tag> This option allows to specify a format of date/time used by BIRD. The first argument specifies for which purpose such format is used. <cf/route/ is a format used in 'show route' command output, <cf/protocol/ is used in 'show protocols' command output, <cf/base/ is used for other commands and <cf/log/ is used in a log file. "<m/format1/" is a format string using <it/strftime(3)/ notation (see <it/man strftime/ for details). <m/limit> and "<m/format2/" allow to specify the second format string for times in past deeper than <m/limit/ seconds. There are few shorthands: <cf/iso long/ is a ISO 8601 date/time format (YYYY-MM-DD hh:mm:ss) that can be also specified using <cf/"%F %T"/. <cf/iso short/ is a variant of ISO 8601 that uses just the time format (hh:mm:ss) for near times (up to 20 hours in the past) and the date format (YYYY-MM-DD) for far times. This is a shorthand for <cf/"%T" 72000 "%F"/. By default, BIRD uses the <cf/iso short/ format for <cf/route/ and <cf/protocol/ times, and the <cf/iso long/ format for <cf/base/ and <cf/log/ times. In pre-1.4.0 versions, BIRD used an short, ad-hoc format for <cf/route/ and <cf/protocol/ times, and a <cf/iso long/ similar format (DD-MM-YYYY hh:mm:ss) for <cf/base/ and <cf/log/. These timeformats could be set by <cf/old short/ and <cf/old long/ compatibility shorthands. <tag><label id="opt-table">table <m/name/ [sorted]</tag> Create a new routing table. The default routing table is created implicitly, other routing tables have to be added by this command. Option <cf/sorted/ can be used to enable sorting of routes, see <ref id="dsc-table-sorted" name="sorted table"> description for details. <tag><label id="opt-roa-table">roa table <m/name/ [ { <m/roa table options .../ } ]</tag> Create a new ROA (Route Origin Authorization) table. ROA tables can be used to validate route origination of BGP routes. A ROA table contains ROA entries, each consist of a network prefix, a max prefix length and an AS number. A ROA entry specifies prefixes which could be originated by that AS number. ROA tables could be filled with data from RPKI (<rfc id="6480">) or from public databases like Whois. ROA tables are examined by <cf/roa_check()/ operator in filters. Currently, there is just one option, <cf>roa <m/prefix/ max <m/num/ as <m/num/</cf>, which can be used to populate the ROA table with static ROA entries. The option may be used multiple times. Other entries can be added dynamically by <cf/add roa/ command. <tag><label id="opt-eval">eval <m/expr/</tag> Evaluates given filter expression. It is used by us for testing of filters. </descrip> <sect>Protocol options <label id="protocol-opts"> <p>For each protocol instance, you can configure a bunch of options. Some of them (those described in this section) are generic, some are specific to the protocol (see sections talking about the protocols). <p>Several options use a <m/switch/ argument. It can be either <cf/on/, <cf/yes/ or a numeric expression with a non-zero value for the option to be enabled or <cf/off/, <cf/no/ or a numeric expression evaluating to zero to disable it. An empty <m/switch/ is equivalent to <cf/on/ ("silence means agreement"). <descrip> <tag><label id="proto-preference">preference <m/expr/</tag> Sets the preference of routes generated by this protocol. Default: protocol dependent. <tag><label id="proto-disabled">disabled <m/switch/</tag> Disables the protocol. You can change the disable/enable status from the command line interface without needing to touch the configuration. Disabled protocols are not activated. Default: protocol is enabled. <tag><label id="proto-debug">debug all|off|{ states|routes|filters|interfaces|events|packets [, <m/.../] }</tag> Set protocol debugging options. If asked, each protocol is capable of writing trace messages about its work to the log (with category <cf/trace/). You can either request printing of <cf/all/ trace messages or only of the types selected: <cf/states/ for protocol state changes (protocol going up, down, starting, stopping etc.), <cf/routes/ for routes exchanged with the routing table, <cf/filters/ for details on route filtering, <cf/interfaces/ for interface change events sent to the protocol, <cf/events/ for events internal to the protocol and <cf/packets/ for packets sent and received by the protocol. Default: off. <tag><label id="proto-mrtdump">mrtdump all|off|{ states|messages [, <m/.../] }</tag> Set protocol MRTdump flags. MRTdump is a standard binary format for logging information from routing protocols and daemons. These flags control what kind of information is logged from the protocol to the MRTdump file (which must be specified by global <cf/mrtdump/ option, see the previous section). Although these flags are similar to flags of <cf/debug/ option, their meaning is different and protocol-specific. For BGP protocol, <cf/states/ logs BGP state changes and <cf/messages/ logs received BGP messages. Other protocols does not support MRTdump yet. <tag><label id="proto-router-id">router id <m/IPv4 address/</tag> This option can be used to override global router id for a given protocol. Default: uses global router id. <tag><label id="proto-import">import all | none | filter <m/name/ | filter { <m/filter commands/ } | where <m/filter expression/</tag> Specify a filter to be used for filtering routes coming from the protocol to the routing table. <cf/all/ is shorthand for <cf/where true/ and <cf/none/ is shorthand for <cf/where false/. Default: <cf/all/. <tag><label id="proto-export">export <m/filter/</tag> This is similar to the <cf>import</cf> keyword, except that it works in the direction from the routing table to the protocol. Default: <cf/none/. <tag><label id="proto-import-keep-filtered">import keep filtered <m/switch/</tag> Usually, if an import filter rejects a route, the route is forgotten. When this option is active, these routes are kept in the routing table, but they are hidden and not propagated to other protocols. But it is possible to show them using <cf/show route filtered/. Note that this option does not work for the pipe protocol. Default: off. <tag><label id="proto-import-limit">import limit [<m/number/ | off ] [action warn | block | restart | disable]</tag> Specify an import route limit (a maximum number of routes imported from the protocol) and optionally the action to be taken when the limit is hit. Warn action just prints warning log message. Block action discards new routes coming from the protocol. Restart and disable actions shut the protocol down like appropriate commands. Disable is the default action if an action is not explicitly specified. Note that limits are reset during protocol reconfigure, reload or restart. Default: <cf/off/. <tag><label id="proto-receive-limit">receive limit [<m/number/ | off ] [action warn | block | restart | disable]</tag> Specify an receive route limit (a maximum number of routes received from the protocol and remembered). It works almost identically to <cf>import limit</cf> option, the only difference is that if <cf/import keep filtered/ option is active, filtered routes are counted towards the limit and blocked routes are forgotten, as the main purpose of the receive limit is to protect routing tables from overflow. Import limit, on the contrary, counts accepted routes only and routes blocked by the limit are handled like filtered routes. Default: <cf/off/. <tag><label id="proto-export-limit">export limit [ <m/number/ | off ] [action warn | block | restart | disable]</tag> Specify an export route limit, works similarly to the <cf>import limit</cf> option, but for the routes exported to the protocol. This option is experimental, there are some problems in details of its behavior -- the number of exported routes can temporarily exceed the limit without triggering it during protocol reload, exported routes counter ignores route blocking and block action also blocks route updates of already accepted routes -- and these details will probably change in the future. Default: <cf/off/. <tag><label id="proto-description">description "<m/text/"</tag> This is an optional description of the protocol. It is displayed as a part of the output of 'show route all' command. <tag><label id="proto-table">table <m/name/</tag> Connect this protocol to a non-default routing table. </descrip> <p>There are several options that give sense only with certain protocols: <descrip> <tag><label id="proto-iface">interface [-] [ "<m/mask/" ] [ <m/prefix/ ] [, <m/.../] [ { <m/option/; [<m/.../] } ]</tag> Specifies a set of interfaces on which the protocol is activated with given interface-specific options. A set of interfaces specified by one interface option is described using an interface pattern. The interface pattern consists of a sequence of clauses (separated by commas), each clause is a mask specified as a shell-like pattern. Interfaces are matched by their name. An interface matches the pattern if it matches any of its clauses. If the clause begins with <cf/-/, matching interfaces are excluded. Patterns are processed left-to-right, thus <cf/interface "eth0", -"eth*", "*";/ means eth0 and all non-ethernets. Some protocols (namely OSPFv2 and Direct) support extended clauses that may contain a mask, a prefix, or both of them. An interface matches such clause if its name matches the mask (if specified) and its address matches the prefix (if specified). Extended clauses are used when the protocol handles multiple addresses on an interface independently. An interface option can be used more times with different interface-specific options, in that case for given interface the first matching interface option is used. This option is allowed in Babel, BFD, Direct, OSPF, RAdv and RIP protocols, but in OSPF protocol it is used in the <cf/area/ subsection. Default: none. Examples: <cf>interface "*" { type broadcast; };</cf> - start the protocol on all interfaces with <cf>type broadcast</cf> option. <cf>interface "eth1", "eth4", "eth5" { type ptp; };</cf> - start the protocol on enumerated interfaces with <cf>type ptp</cf> option. <cf>interface -192.168.1.0/24, 192.168.0.0/16;</cf> - start the protocol on all interfaces that have address from 192.168.0.0/16, but not from 192.168.1.0/24. <cf>interface -192.168.1.0/24, 192.168.0.0/16;</cf> - start the protocol on all interfaces that have address from 192.168.0.0/16, but not from 192.168.1.0/24. <cf>interface "eth*" 192.168.1.0/24;</cf> - start the protocol on all ethernet interfaces that have address from 192.168.1.0/24. <tag><label id="proto-tx-class">tx class|dscp <m/num/</tag> This option specifies the value of ToS/DS/Class field in IP headers of the outgoing protocol packets. This may affect how the protocol packets are processed by the network relative to the other network traffic. With <cf/class/ keyword, the value (0-255) is used for the whole ToS/Class octet (but two bits reserved for ECN are ignored). With <cf/dscp/ keyword, the value (0-63) is used just for the DS field in the octet. Default value is 0xc0 (DSCP 0x30 - CS6). <tag><label id="proto-tx-priority">tx priority <m/num/</tag> This option specifies the local packet priority. This may affect how the protocol packets are processed in the local TX queues. This option is Linux specific. Default value is 7 (highest priority, privileged traffic). <tag><label id="proto-pass">password "<m/password/" [ { <m>password options</m> } ]</tag> Specifies a password that can be used by the protocol as a shared secret key. Password option can be used more times to specify more passwords. If more passwords are specified, it is a protocol-dependent decision which one is really used. Specifying passwords does not mean that authentication is enabled, authentication can be enabled by separate, protocol-dependent <cf/authentication/ option. This option is allowed in BFD, OSPF and RIP protocols. BGP has also <cf/password/ option, but it is slightly different and described separately. Default: none. </descrip> <p>Password option can contain section with some (not necessary all) password sub-options: <descrip> <tag><label id="proto-pass-id">id <M>num</M></tag> ID of the password, (1-255). If it is not used, BIRD will choose ID based on an order of the password item in the interface. For example, second password item in one interface will have default ID 2. ID is used by some routing protocols to identify which password was used to authenticate protocol packets. <tag><label id="proto-pass-gen-from">generate from "<m/time/"</tag> The start time of the usage of the password for packet signing. The format of <cf><m/time/</cf> is <tt>dd-mm-yyyy HH:MM:SS</tt>. <tag><label id="proto-pass-gen-to">generate to "<m/time/"</tag> The last time of the usage of the password for packet signing. <tag><label id="proto-pass-accept-from">accept from "<m/time/"</tag> The start time of the usage of the password for packet verification. <tag><label id="proto-pass-accept-to">accept to "<m/time/"</tag> The last time of the usage of the password for packet verification. <tag><label id="proto-pass-from">from "<m/time/"</tag> Shorthand for setting both <cf/generate from/ and <cf/accept from/. <tag><label id="proto-pass-to">to "<m/time/"</tag> Shorthand for setting both <cf/generate to/ and <cf/accept to/. <tag><label id="proto-pass-algorithm">algorithm ( keyed md5 | keyed sha1 | hmac sha1 | hmac sha256 | hmac sha384 | hmac sha512 )</tag> The message authentication algorithm for the password when cryptographic authentication is enabled. The default value depends on the protocol. For RIP and OSPFv2 it is Keyed-MD5 (for compatibility), for OSPFv3 protocol it is HMAC-SHA-256. </descrip> <chapt>Remote control <label id="remote-control"> <p>You can use the command-line client <file>birdc</file> to talk with a running BIRD. Communication is done using a <file/bird.ctl/ UNIX domain socket (unless changed with the <tt/-s/ option given to both the server and the client). The commands can perform simple actions such as enabling/disabling of protocols, telling BIRD to show various information, telling it to show routing table filtered by filter, or asking BIRD to reconfigure. Press <tt/?/ at any time to get online help. Option <tt/-r/ can be used to enable a restricted mode of BIRD client, which allows just read-only commands (<cf/show .../). Option <tt/-v/ can be passed to the client, to make it dump numeric return codes along with the messages. You do not necessarily need to use <file/birdc/ to talk to BIRD, your own applications could do that, too -- the format of communication between BIRD and <file/birdc/ is stable (see the programmer's documentation). <p>There is also lightweight variant of BIRD client called <file/birdcl/, which does not support command line editing and history and has minimal dependencies. This is useful for running BIRD in resource constrained environments, where Readline library (required for regular BIRD client) is not available. <p>Many commands have the <m/name/ of the protocol instance as an argument. This argument can be omitted if there exists only a single instance. <p>Here is a brief list of supported functions: <descrip> <tag><label id="cli-show-status">show status</tag> Show router status, that is BIRD version, uptime and time from last reconfiguration. <tag><label id="cli-show-interfaces">show interfaces [summary]</tag> Show the list of interfaces. For each interface, print its type, state, MTU and addresses assigned. <tag><label id="cli-show-protocols">show protocols [all]</tag> Show list of protocol instances along with tables they are connected to and protocol status, possibly giving verbose information, if <cf/all/ is specified. <tag><label id="cli-show-ospf-iface">show ospf interface [<m/name/] ["<m/interface/"]</tag> Show detailed information about OSPF interfaces. <tag><label id="cli-show-ospf-neighbors">show ospf neighbors [<m/name/] ["<m/interface/"]</tag> Show a list of OSPF neighbors and a state of adjacency to them. <tag><label id="cli-show-ospf-state">show ospf state [all] [<m/name/]</tag> Show detailed information about OSPF areas based on a content of the link-state database. It shows network topology, stub networks, aggregated networks and routers from other areas and external routes. The command shows information about reachable network nodes, use option <cf/all/ to show information about all network nodes in the link-state database. <tag><label id="cli-show-ospf-topology">show ospf topology [all] [<m/name/]</tag> Show a topology of OSPF areas based on a content of the link-state database. It is just a stripped-down version of 'show ospf state'. <tag><label id="cli-show-ospf-lsadb">show ospf lsadb [global | area <m/id/ | link] [type <m/num/] [lsid <m/id/] [self | router <m/id/] [<m/name/] </tag> Show contents of an OSPF LSA database. Options could be used to filter entries. <tag><label id="cli-show-rip-interfaces">show rip interfaces [<m/name/] ["<m/interface/"]</tag> Show detailed information about RIP interfaces. <tag><label id="cli-show-rip-neighbors">show rip neighbors [<m/name/] ["<m/interface/"]</tag> Show a list of RIP neighbors and associated state. <tag><label id="cli-show-static">show static [<m/name/]</tag> Show detailed information about static routes. <tag><label id="cli-show-bfd-sessions">show bfd sessions [<m/name/]</tag> Show information about BFD sessions. <tag><label id="cli-show-symbols">show symbols [table|filter|function|protocol|template|roa|<m/symbol/]</tag> Show the list of symbols defined in the configuration (names of protocols, routing tables etc.). <tag><label id="cli-show-route">show route [[for] <m/prefix/|<m/IP/] [table <m/t/] [filter <m/f/|where <m/c/] [(export|preexport|noexport) <m/p/] [protocol <m/p/] [<m/options/]</tag> Show contents of a routing table (by default of the main one or the table attached to a respective protocol), that is routes, their metrics and (in case the <cf/all/ switch is given) all their attributes. <p>You can specify a <m/prefix/ if you want to print routes for a specific network. If you use <cf>for <m/prefix or IP/</cf>, you'll get the entry which will be used for forwarding of packets to the given destination. By default, all routes for each network are printed with the selected one at the top, unless <cf/primary/ is given in which case only the selected route is shown. <p>You can also ask for printing only routes processed and accepted by a given filter (<cf>filter <m/name/</cf> or <cf>filter { <m/filter/ } </cf> or matching a given condition (<cf>where <m/condition/</cf>). The <cf/export/, <cf/preexport/ and <cf/noexport/ switches ask for printing of routes that are exported to the specified protocol. With <cf/preexport/, the export filter of the protocol is skipped. With <cf/noexport/, routes rejected by the export filter are printed instead. Note that routes not exported to the protocol for other reasons (e.g. secondary routes or routes imported from that protocol) are not printed even with <cf/noexport/. <p>You can also select just routes added by a specific protocol. <cf>protocol <m/p/</cf>. <p>If BIRD is configured to keep filtered routes (see <cf/import keep filtered/ option), you can show them instead of routes by using <cf/filtered/ switch. <p>The <cf/stats/ switch requests showing of route statistics (the number of networks, number of routes before and after filtering). If you use <cf/count/ instead, only the statistics will be printed. <tag><label id="cli-show-roa">show roa [<m/prefix/ | in <m/prefix/ | for <m/prefix/] [as <m/num/] [table <m/t/]</tag> Show contents of a ROA table (by default of the first one). You can specify a <m/prefix/ to print ROA entries for a specific network. If you use <cf>for <m/prefix/</cf>, you'll get all entries relevant for route validation of the network prefix; i.e., ROA entries whose prefixes cover the network prefix. Or you can use <cf>in <m/prefix/</cf> to get ROA entries covered by the network prefix. You could also use <cf/as/ option to show just entries for given AS. <tag><label id="cli-add-roa">add roa <m/prefix/ max <m/num/ as <m/num/ [table <m/t/]</tag> Add a new ROA entry to a ROA table. Such entry is called <it/dynamic/ compared to <it/static/ entries specified in the config file. These dynamic entries survive reconfiguration. <tag><label id="cli-delete-roa">delete roa <m/prefix/ max <m/num/ as <m/num/ [table <m/t/]</tag> Delete the specified ROA entry from a ROA table. Only dynamic ROA entries (i.e., the ones added by <cf/add roa/ command) can be deleted. <tag><label id="cli-flush-roa">flush roa [table <m/t/]</tag> Remove all dynamic ROA entries from a ROA table. <tag><label id="cli-configure">configure [soft] ["<m/config file/"] [timeout [<m/num/]]</tag> Reload configuration from a given file. BIRD will smoothly switch itself to the new configuration, protocols are reconfigured if possible, restarted otherwise. Changes in filters usually lead to restart of affected protocols. If <cf/soft/ option is used, changes in filters does not cause BIRD to restart affected protocols, therefore already accepted routes (according to old filters) would be still propagated, but new routes would be processed according to the new filters. If <cf/timeout/ option is used, config timer is activated. The new configuration could be either confirmed using <cf/configure confirm/ command, or it will be reverted to the old one when the config timer expires. This is useful for cases when reconfiguration breaks current routing and a router becomes inaccessible for an administrator. The config timeout expiration is equivalent to <cf/configure undo/ command. The timeout duration could be specified, default is 300 s. <tag><label id="cli-configure-confirm">configure confirm</tag> Deactivate the config undo timer and therefore confirm the current configuration. <tag><label id="cli-configure-undo">configure undo</tag> Undo the last configuration change and smoothly switch back to the previous (stored) configuration. If the last configuration change was soft, the undo change is also soft. There is only one level of undo, but in some specific cases when several reconfiguration requests are given immediately in a row and the intermediate ones are skipped then the undo also skips them back. <tag><label id="cli-configure-check">configure check ["<m/config file/"]</tag> Read and parse given config file, but do not use it. useful for checking syntactic and some semantic validity of an config file. <tag><label id="cli-enable-disable-restart">enable|disable|restart <m/name/|"<m/pattern/"|all</tag> Enable, disable or restart a given protocol instance, instances matching the <cf><m/pattern/</cf> or <cf/all/ instances. <tag><label id="cli-reload">reload [in|out] <m/name/|"<m/pattern/"|all</tag> Reload a given protocol instance, that means re-import routes from the protocol instance and re-export preferred routes to the instance. If <cf/in/ or <cf/out/ options are used, the command is restricted to one direction (re-import or re-export). This command is useful if appropriate filters have changed but the protocol instance was not restarted (or reloaded), therefore it still propagates the old set of routes. For example when <cf/configure soft/ command was used to change filters. Re-export always succeeds, but re-import is protocol-dependent and might fail (for example, if BGP neighbor does not support route-refresh extension). In that case, re-export is also skipped. Note that for the pipe protocol, both directions are always reloaded together (<cf/in/ or <cf/out/ options are ignored in that case). <tag><label id="cli-down">down</tag> Shut BIRD down. <tag><label id="cli-debug">debug <m/protocol/|<m/pattern/|all all|off|{ states|routes|filters|events|packets [, <m/.../] }</tag> Control protocol debugging. <tag><label id="cli-dump">dump resources|sockets|interfaces|neighbors|attributes|routes|protocols</tag> Dump contents of internal data structures to the debugging output. <tag><label id="cli-echo">echo all|off|{ <m/list of log classes/ } [ <m/buffer-size/ ]</tag> Control echoing of log messages to the command-line output. See <ref id="opt-log" name="log option"> for a list of log classes. <tag><label id="cli-eval">eval <m/expr/</tag> Evaluate given expression. </descrip> <chapt>Filters <label id="filters"> <sect>Introduction <label id="filters-intro"> <p>BIRD contains a simple programming language. (No, it can't yet read mail :-). There are two objects in this language: filters and functions. Filters are interpreted by BIRD core when a route is being passed between protocols and routing tables. The filter language contains control structures such as if's and switches, but it allows no loops. An example of a filter using many features can be found in <file>filter/test.conf</file>. <p>Filter gets the route, looks at its attributes and modifies some of them if it wishes. At the end, it decides whether to pass the changed route through (using <cf/accept/) or whether to <cf/reject/ it. A simple filter looks like this: <code> filter not_too_far int var; { if defined( rip_metric ) then var = rip_metric; else { var = 1; rip_metric = 1; } if rip_metric > 10 then reject "RIP metric is too big"; else accept "ok"; } </code> <p>As you can see, a filter has a header, a list of local variables, and a body. The header consists of the <cf/filter/ keyword followed by a (unique) name of filter. The list of local variables consists of <cf><M>type name</M>;</cf> pairs where each pair defines one local variable. The body consists of <cf> { <M>statements</M> }</cf>. Each <m/statement/ is terminated by a <cf/;/. You can group several statements to a single compound statement by using braces (<cf>{ <M>statements</M> }</cf>) which is useful if you want to make a bigger block of code conditional. <p>BIRD supports functions, so that you don't have to repeat the same blocks of code over and over. Functions can have zero or more parameters and they can have local variables. Recursion is not allowed. Function definitions look like this: <code> function name () int local_variable; { local_variable = 5; } function with_parameters (int parameter) { print parameter; } </code> <p>Unlike in C, variables are declared after the <cf/function/ line, but before the first <cf/{/. You can't declare variables in nested blocks. Functions are called like in C: <cf>name(); with_parameters(5);</cf>. Function may return values using the <cf>return <m/[expr]/</cf> command. Returning a value exits from current function (this is similar to C). <p>Filters are declared in a way similar to functions except they can't have explicit parameters. They get a route table entry as an implicit parameter, it is also passed automatically to any functions called. The filter must terminate with either <cf/accept/ or <cf/reject/ statement. If there's a runtime error in filter, the route is rejected. <p>A nice trick to debug filters is to use <cf>show route filter <m/name/</cf> from the command line client. An example session might look like: <code> pavel@bug:~/bird$ ./birdc -s bird.ctl BIRD 0.0.0 ready. bird> show route 10.0.0.0/8 dev eth0 [direct1 23:21] (240) 195.113.30.2/32 dev tunl1 [direct1 23:21] (240) 127.0.0.0/8 dev lo [direct1 23:21] (240) bird> show route ? show route [<prefix>] [table <t>] [filter <f>] [all] [primary]... bird> show route filter { if 127.0.0.5 ˜ net then accept; } 127.0.0.0/8 dev lo [direct1 23:21] (240) bird> </code> <sect>Data types <label id="data-types"> <p>Each variable and each value has certain type. Booleans, integers and enums are incompatible with each other (that is to prevent you from shooting in the foot). <descrip> <tag><label id="type-bool">bool</tag> This is a boolean type, it can have only two values, <cf/true/ and <cf/false/. Boolean is the only type you can use in <cf/if/ statements. <tag><label id="type-int">int</tag> This is a general integer type. It is an unsigned 32bit type; i.e., you can expect it to store values from 0 to 4294967295. Overflows are not checked. You can use <cf/0x1234/ syntax to write hexadecimal values. <tag><label id="type-pair">pair</tag> This is a pair of two short integers. Each component can have values from 0 to 65535. Literals of this type are written as <cf/(1234,5678)/. The same syntax can also be used to construct a pair from two arbitrary integer expressions (for example <cf/(1+2,a)/). <tag><label id="type-quad">quad</tag> This is a dotted quad of numbers used to represent router IDs (and others). Each component can have a value from 0 to 255. Literals of this type are written like IPv4 addresses. <tag><label id="type-string">string</tag> This is a string of characters. There are no ways to modify strings in filters. You can pass them between functions, assign them to variables of type <cf/string/, print such variables, use standard string comparison operations (e.g. <cf/=, !=, <, >, <=, >=/), but you can't concatenate two strings. String literals are written as <cf/"This is a string constant"/. Additionally matching (<cf/˜, !˜/) operators could be used to match a string value against a shell pattern (represented also as a string). <tag><label id="type-ip">ip</tag> This type can hold a single IP address. Depending on the compile-time configuration of BIRD you are using, it is either an IPv4 or IPv6 address. IP addresses are written in the standard notation (<cf/10.20.30.40/ or <cf/fec0:3:4::1/). You can apply special operator <cf>.mask(<M>num</M>)</cf> on values of type ip. It masks out all but first <cf><M>num</M></cf> bits from the IP address. So <cf/1.2.3.4.mask(8) = 1.0.0.0/ is true. <tag><label id="type-prefix">prefix</tag> This type can hold a network prefix consisting of IP address and prefix length. Prefix literals are written as <cf><m/ipaddress//<m/pxlen/</cf>, or <cf><m>ipaddress</m>/<m>netmask</m></cf>. There are two special operators on prefixes: <cf/.ip/ which extracts the IP address from the pair, and <cf/.len/, which separates prefix length from the pair. So <cf>1.2.0.0/16.len = 16</cf> is true. <tag><label id="type-ec">ec</tag> This is a specialized type used to represent BGP extended community values. It is essentially a 64bit value, literals of this type are usually written as <cf>(<m/kind/, <m/key/, <m/value/)</cf>, where <cf/kind/ is a kind of extended community (e.g. <cf/rt/ / <cf/ro/ for a route target / route origin communities), the format and possible values of <cf/key/ and <cf/value/ are usually integers, but it depends on the used kind. Similarly to pairs, ECs can be constructed using expressions for <cf/key/ and <cf/value/ parts, (e.g. <cf/(ro, myas, 3*10)/, where <cf/myas/ is an integer variable). <tag><label id="type-lc">lc</tag> This is a specialized type used to represent BGP large community values. It is essentially a triplet of 32bit values, where the first value is reserved for the AS number of the issuer, while meaning of remaining parts is defined by the issuer. Literals of this type are written as <cf/(123, 456, 789)/, with any integer values. Similarly to pairs, LCs can be constructed using expressions for its parts, (e.g. <cf/(myas, 10+20, 3*10)/, where <cf/myas/ is an integer variable). <tag><label id="type-set">int|pair|quad|ip|prefix|ec|lc|enum set</tag> Filters recognize four types of sets. Sets are similar to strings: you can pass them around but you can't modify them. Literals of type <cf>int set</cf> look like <cf> [ 1, 2, 5..7 ]</cf>. As you can see, both simple values and ranges are permitted in sets. For pair sets, expressions like <cf/(123,*)/ can be used to denote ranges (in that case <cf/(123,0)..(123,65535)/). You can also use <cf/(123,5..100)/ for range <cf/(123,5)..(123,100)/. You can also use <cf/*/ and <cf/a..b/ expressions in the first part of a pair, note that such expressions are translated to a set of intervals, which may be memory intensive. E.g. <cf/(*,4..20)/ is translated to <cf/(0,4..20), (1,4..20), (2,4..20), ... (65535, 4..20)/. EC sets use similar expressions like pair sets, e.g. <cf/(rt, 123, 10..20)/ or <cf/(ro, 123, *)/. Expressions requiring the translation (like <cf/(rt, *, 3)/) are not allowed (as they usually have 4B range for ASNs). Also LC sets use similar expressions like pair sets. You can use ranges and wildcards, but if one field uses that, more specific (later) fields must be wildcards. E.g., <cf/(10, 20..30, *)/ or <cf/(10, 20, 30..40)/ is valid, while <cf/(10, *, 20..30)/ or <cf/(10, 20..30, 40)/ is not valid. You can also use expressions for int, pair, EC and LC set values. However, it must be possible to evaluate these expressions before daemon boots. So you can use only constants inside them. E.g. <code> define one=1; define myas=64500; int set odds; pair set ps; ec set es; odds = [ one, 2+1, 6-one, 2*2*2-1, 9, 11 ]; ps = [ (1,one+one), (3,4)..(4,8), (5,*), (6,3..6), (7..9,*) ]; es = [ (rt, myas, 3*10), (rt, myas+one, 0..16*16*16-1), (ro, myas+2, *) ]; </code> Sets of prefixes are special: their literals does not allow ranges, but allows prefix patterns that are written as <cf><M>ipaddress</M>/<M>pxlen</M>{<M>low</M>,<M>high</M>}</cf>. Prefix <cf><m>ip1</m>/<m>len1</m></cf> matches prefix pattern <cf><m>ip2</m>/<m>len2</m>{<m>l</m>,<m>h</m>}</cf> if the first <cf>min(len1, len2)</cf> bits of <cf/ip1/ and <cf/ip2/ are identical and <cf>len1 <= ip1 <= len2</cf>. A valid prefix pattern has to satisfy <cf>low <= high</cf>, but <cf/pxlen/ is not constrained by <cf/low/ or <cf/high/. Obviously, a prefix matches a prefix set literal if it matches any prefix pattern in the prefix set literal. There are also two shorthands for prefix patterns: <cf><m/address//<m/len/+</cf> is a shorthand for <cf><m/address//<m/len/{<m/len/,<m/maxlen/}</cf> (where <cf><m/maxlen/</cf> is 32 for IPv4 and 128 for IPv6), that means network prefix <cf><m/address//<m/len/</cf> and all its subnets. <cf><m/address//<m/len/-</cf> is a shorthand for <cf><m/address//<m/len/{0,<m/len/}</cf>, that means network prefix <cf><m/address//<m/len/</cf> and all its supernets (network prefixes that contain it). For example, <cf>[ 1.0.0.0/8, 2.0.0.0/8+, 3.0.0.0/8-, 4.0.0.0/8{16,24} ]</cf> matches prefix <cf>1.0.0.0/8</cf>, all subprefixes of <cf>2.0.0.0/8</cf>, all superprefixes of <cf>3.0.0.0/8</cf> and prefixes <cf/4.X.X.X/ whose prefix length is 16 to 24. <cf>[ 0.0.0.0/0{20,24} ]</cf> matches all prefixes (regardless of IP address) whose prefix length is 20 to 24, <cf>[ 1.2.3.4/32- ]</cf> matches any prefix that contains IP address <cf>1.2.3.4</cf>. <cf>1.2.0.0/16 ˜ [ 1.0.0.0/8{15,17} ]</cf> is true, but <cf>1.0.0.0/16 ˜ [ 1.0.0.0/8- ]</cf> is false. Cisco-style patterns like <cf>10.0.0.0/8 ge 16 le 24</cf> can be expressed in BIRD as <cf>10.0.0.0/8{16,24}</cf>, <cf>192.168.0.0/16 le 24</cf> as <cf>192.168.0.0/16{16,24}</cf> and <cf>192.168.0.0/16 ge 24</cf> as <cf>192.168.0.0/16{24,32}</cf>. <tag><label id="type-enum">enum</tag> Enumeration types are fixed sets of possibilities. You can't define your own variables of such type, but some route attributes are of enumeration type. Enumeration types are incompatible with each other. <tag><label id="type-bgppath">bgppath</tag> BGP path is a list of autonomous system numbers. You can't write literals of this type. There are several special operators on bgppaths: <cf><m/P/.first</cf> returns the first ASN (the neighbor ASN) in path <m/P/. <cf><m/P/.last</cf> returns the last ASN (the source ASN) in path <m/P/. <cf><m/P/.last_nonaggregated</cf> returns the last ASN in the non-aggregated part of the path <m/P/. Both <cf/first/ and <cf/last/ return zero if there is no appropriate ASN, for example if the path contains an AS set element as the first (or the last) part. If the path ends with an AS set, <cf/last_nonaggregated/ may be used to get last ASN before any AS set. <cf><m/P/.len</cf> returns the length of path <m/P/. <cf>prepend(<m/P/,<m/A/)</cf> prepends ASN <m/A/ to path <m/P/ and returns the result. <cf>delete(<m/P/,<m/A/)</cf> deletes all instances of ASN <m/A/ from from path <m/P/ and returns the result. <m/A/ may also be an integer set, in that case the operator deletes all ASNs from path <m/P/ that are also members of set <m/A/. <cf>filter(<m/P/,<m/A/)</cf> deletes all ASNs from path <m/P/ that are not members of integer set <m/A/. I.e., <cf/filter/ do the same as <cf/delete/ with inverted set <m/A/. Statement <cf><m/P/ = prepend(<m/P/, <m/A/);</cf> can be shortened to <cf><m/P/.prepend(<m/A/);</cf> if <m/P/ is appropriate route attribute (for example <cf/bgp_path/). Similarly for <cf/delete/ and <cf/filter/. <tag><label id="type-bgpmask">bgpmask</tag> BGP masks are patterns used for BGP path matching (using <cf>path ˜ [= 2 3 5 * =]</cf> syntax). The masks resemble wildcard patterns as used by UNIX shells. Autonomous system numbers match themselves, <cf/*/ matches any (even empty) sequence of arbitrary AS numbers and <cf/?/ matches one arbitrary AS number. For example, if <cf>bgp_path</cf> is 4 3 2 1, then: <tt>bgp_path ˜ [= * 4 3 * =]</tt> is true, but <tt>bgp_path ˜ [= * 4 5 * =]</tt> is false. BGP mask expressions can also contain integer expressions enclosed in parenthesis and integer variables, for example <tt>[= * 4 (1+2) a =]</tt>. You can also use ranges, for example <tt>[= * 3..5 2 100..200 * =]</tt>. There is also old (deprecated) syntax that uses / .. / instead of [= .. =] and ? instead of *. <tag><label id="type-clist">clist</tag> Clist is similar to a set, except that unlike other sets, it can be modified. The type is used for community list (a set of pairs) and for cluster list (a set of quads). There exist no literals of this type. There are three special operators on clists: <cf><m/C/.len</cf> returns the length of clist <m/C/. <cf>add(<m/C/,<m/P/)</cf> adds pair (or quad) <m/P/ to clist <m/C/ and returns the result. If item <m/P/ is already in clist <m/C/, it does nothing. <m/P/ may also be a clist, in that case all its members are added; i.e., it works as clist union. <cf>delete(<m/C/,<m/P/)</cf> deletes pair (or quad) <m/P/ from clist <m/C/ and returns the result. If clist <m/C/ does not contain item <m/P/, it does nothing. <m/P/ may also be a pair (or quad) set, in that case the operator deletes all items from clist <m/C/ that are also members of set <m/P/. Moreover, <m/P/ may also be a clist, which works analogously; i.e., it works as clist difference. <cf>filter(<m/C/,<m/P/)</cf> deletes all items from clist <m/C/ that are not members of pair (or quad) set <m/P/. I.e., <cf/filter/ do the same as <cf/delete/ with inverted set <m/P/. <m/P/ may also be a clist, which works analogously; i.e., it works as clist intersection. Statement <cf><m/C/ = add(<m/C/, <m/P/);</cf> can be shortened to <cf><m/C/.add(<m/P/);</cf> if <m/C/ is appropriate route attribute (for example <cf/bgp_community/). Similarly for <cf/delete/ and <cf/filter/. <tag><label id="type-eclist">eclist</tag> Eclist is a data type used for BGP extended community lists. Eclists are very similar to clists, but they are sets of ECs instead of pairs. The same operations (like <cf/add/, <cf/delete/ or <cf/˜/ and <cf/!˜/ membership operators) can be used to modify or test eclists, with ECs instead of pairs as arguments. <tag/lclist/ Lclist is a data type used for BGP large community lists. Like eclists, lclists are very similar to clists, but they are sets of LCs instead of pairs. The same operations (like <cf/add/, <cf/delete/ or <cf/˜/ and <cf/!˜/ membership operators) can be used to modify or test lclists, with LCs instead of pairs as arguments. </descrip> <sect>Operators <label id="operators"> <p>The filter language supports common integer operators <cf>(+,-,*,/)</cf>, parentheses <cf/(a*(b+c))/, comparison <cf/(a=b, a!=b, a<b, a>=b)/. Logical operations include unary not (<cf/!/), and (<cf/&&/) and or (<cf/||/). Special operators include (<cf/˜/, <cf/!˜/) for "is (not) element of a set" operation - it can be used on element and set of elements of the same type (returning true if element is contained in the given set), or on two strings (returning true if first string matches a shell-like pattern stored in second string) or on IP and prefix (returning true if IP is within the range defined by that prefix), or on prefix and prefix (returning true if first prefix is more specific than second one) or on bgppath and bgpmask (returning true if the path matches the mask) or on number and bgppath (returning true if the number is in the path) or on bgppath and int (number) set (returning true if any ASN from the path is in the set) or on pair/quad and clist (returning true if the pair/quad is element of the clist) or on clist and pair/quad set (returning true if there is an element of the clist that is also a member of the pair/quad set). <p>There is one operator related to ROA infrastructure - <cf/roa_check()/. It examines a ROA table and does <rfc id="6483"> route origin validation for a given network prefix. The basic usage is <cf>roa_check(<m/table/)</cf>, which checks current route (which should be from BGP to have AS_PATH argument) in the specified ROA table and returns ROA_UNKNOWN if there is no relevant ROA, ROA_VALID if there is a matching ROA, or ROA_INVALID if there are some relevant ROAs but none of them match. There is also an extended variant <cf>roa_check(<m/table/, <m/prefix/, <m/asn/)</cf>, which allows to specify a prefix and an ASN as arguments. <sect>Control structures <label id="control-structures"> <p>Filters support two control structures: conditions and case switches. <p>Syntax of a condition is: <cf>if <M>boolean expression</M> then <m/command1/; else <m/command2/;</cf> and you can use <cf>{ <m/command_1/; <m/command_2/; <M>...</M> }</cf> instead of either command. The <cf>else</cf> clause may be omitted. If the <cf><m>boolean expression</m></cf> is true, <m/command1/ is executed, otherwise <m/command2/ is executed. <p>The <cf>case</cf> is similar to case from Pascal. Syntax is <cf>case <m/expr/ { else: | <m/num_or_prefix [ .. num_or_prefix]/: <m/statement/ ; [ ... ] }</cf>. The expression after <cf>case</cf> can be of any type which can be on the left side of the ˜ operator and anything that could be a member of a set is allowed before <cf/:/. Multiple commands are allowed without <cf/{}/ grouping. If <cf><m/expr/</cf> matches one of the <cf/:/ clauses, statements between it and next <cf/:/ statement are executed. If <cf><m/expr/</cf> matches neither of the <cf/:/ clauses, the statements after <cf/else:/ are executed. <p>Here is example that uses <cf/if/ and <cf/case/ structures: <code> case arg1 { 2: print "two"; print "I can do more commands without {}"; 3 .. 5: print "three to five"; else: print "something else"; } if 1234 = i then printn "."; else { print "not 1234"; print "You need {} around multiple commands"; } </code> <sect>Route attributes <label id="route-attributes"> <p>A filter is implicitly passed a route, and it can access its attributes just like it accesses variables. Attempts to access undefined attribute result in a runtime error; you can check if an attribute is defined by using the <cf>defined( <m>attribute</m> )</cf> operator. One notable exception to this rule are attributes of clist type, where undefined value is regarded as empty clist for most purposes. <descrip> <tag><label id="rta-net"><m/prefix/ net</tag> Network the route is talking about. Read-only. (See the chapter about routing tables.) <tag><label id="rta-scope"><m/enum/ scope</tag> The scope of the route. Possible values: <cf/SCOPE_HOST/ for routes local to this host, <cf/SCOPE_LINK/ for those specific for a physical link, <cf/SCOPE_SITE/ and <cf/SCOPE_ORGANIZATION/ for private routes and <cf/SCOPE_UNIVERSE/ for globally visible routes. This attribute is not interpreted by BIRD and can be used to mark routes in filters. The default value for new routes is <cf/SCOPE_UNIVERSE/. <tag><label id="rta-preference"><m/int/ preference</tag> Preference of the route. Valid values are 0-65535. (See the chapter about routing tables.) <tag><label id="rta-from"><m/ip/ from</tag> The router which the route has originated from. <tag><label id="rta-gw"><m/ip/ gw</tag> Next hop packets routed using this route should be forwarded to. <tag><label id="rta-proto"><m/string/ proto</tag> The name of the protocol which the route has been imported from. Read-only. <tag><label id="rta-source"><m/enum/ source</tag> what protocol has told me about this route. Possible values: <cf/RTS_DUMMY/, <cf/RTS_STATIC/, <cf/RTS_INHERIT/, <cf/RTS_DEVICE/, <cf/RTS_STATIC_DEVICE/, <cf/RTS_REDIRECT/, <cf/RTS_RIP/, <cf/RTS_OSPF/, <cf/RTS_OSPF_IA/, <cf/RTS_OSPF_EXT1/, <cf/RTS_OSPF_EXT2/, <cf/RTS_BGP/, <cf/RTS_PIPE/, <cf/RTS_BABEL/. <tag><label id="rta-cast"><m/enum/ cast</tag> Route type (Currently <cf/RTC_UNICAST/ for normal routes, <cf/RTC_BROADCAST/, <cf/RTC_MULTICAST/, <cf/RTC_ANYCAST/ will be used in the future for broadcast, multicast and anycast routes). Read-only. <tag><label id="rta-dest"><m/enum/ dest</tag> Type of destination the packets should be sent to (<cf/RTD_ROUTER/ for forwarding to a neighboring router, <cf/RTD_DEVICE/ for routing to a directly-connected network, <cf/RTD_MULTIPATH/ for multipath destinations, <cf/RTD_BLACKHOLE/ for packets to be silently discarded, <cf/RTD_UNREACHABLE/, <cf/RTD_PROHIBIT/ for packets that should be returned with ICMP host unreachable / ICMP administratively prohibited messages). Can be changed, but only to <cf/RTD_BLACKHOLE/, <cf/RTD_UNREACHABLE/ or <cf/RTD_PROHIBIT/. <tag><label id="rta-ifname"><m/string/ ifname</tag> Name of the outgoing interface. Sink routes (like blackhole, unreachable or prohibit) and multipath routes have no interface associated with them, so <cf/ifname/ returns an empty string for such routes. Read-only. <tag><label id="rta-ifindex"><m/int/ ifindex</tag> Index of the outgoing interface. System wide index of the interface. May be used for interface matching, however indexes might change on interface creation/removal. Zero is returned for routes with undefined outgoing interfaces. Read-only. <tag><label id="rta-igp-metric"><m/int/ igp_metric</tag> The optional attribute that can be used to specify a distance to the network for routes that do not have a native protocol metric attribute (like <cf/ospf_metric1/ for OSPF routes). It is used mainly by BGP to compare internal distances to boundary routers (see below). It is also used when the route is exported to OSPF as a default value for OSPF type 1 metric. </descrip> <p>There also exist some protocol-specific attributes which are described in the corresponding protocol sections. <sect>Other statements <label id="other-statements"> <p>The following statements are available: <descrip> <tag><label id="assignment"><m/variable/ = <m/expr/</tag> Set variable to a given value. <tag><label id="filter-accept-reject">accept|reject [ <m/expr/ ]</tag> Accept or reject the route, possibly printing <cf><m>expr</m></cf>. <tag><label id="return">return <m/expr/</tag> Return <cf><m>expr</m></cf> from the current function, the function ends at this point. <tag><label id="print">print|printn <m/expr/ [<m/, expr.../]</tag> Prints given expressions; useful mainly while debugging filters. The <cf/printn/ variant does not terminate the line. <tag><label id="quitbird">quitbird</tag> Terminates BIRD. Useful when debugging the filter interpreter. </descrip> <chapt>Protocols <label id="protocols"> <sect>Babel <label id="babel"> <sect1>Introduction <label id="babel-intro"> <p>The Babel protocol (<rfc id="6126">) is a loop-avoiding distance-vector routing protocol that is robust and efficient both in ordinary wired networks and in wireless mesh networks. Babel is conceptually very simple in its operation and "just works" in its default configuration, though some configuration is possible and in some cases desirable. <p>While the Babel protocol is dual stack (i.e., can carry both IPv4 and IPv6 routes over the same IPv6 transport), BIRD presently implements only the IPv6 subset of the protocol. No Babel extensions are implemented, but the BIRD implementation can coexist with implementations using the extensions (and will just ignore extension messages). <p>The Babel protocol implementation in BIRD is currently in alpha stage. <sect1>Configuration <label id="babel-config"> <p>Babel supports no global configuration options apart from those common to all other protocols, but supports the following per-interface configuration options: <code> protocol babel [<name>] { interface <interface pattern> { type <wired|wireless>; rxcost <number>; hello interval <number>; update interval <number>; port <number>; tx class|dscp <number>; tx priority <number>; rx buffer <number>; tx length <number>; check link <switch>; }; } </code> <descrip> <tag><label id="babel-type">type wired|wireless </tag> This option specifies the interface type: Wired or wireless. Wired interfaces are considered more reliable, and so the default hello interval is higher, and a neighbour is considered unreachable after only a small number of "hello" packets are lost. On wireless interfaces, hello packets are sent more often, and the ETX link quality estimation technique is used to compute the metrics of routes discovered over this interface. This technique will gradually degrade the metric of routes when packets are lost rather than the more binary up/down mechanism of wired type links. Default: <cf/wired/. <tag><label id="babel-rxcost">rxcost <m/num/</tag> This specifies the RX cost of the interface. The route metrics will be computed from this value with a mechanism determined by the interface <cf/type/. Default: 96 for wired interfaces, 256 for wireless. <tag><label id="babel-hello">hello interval <m/num/</tag> Interval at which periodic "hello" messages are sent on this interface, in seconds. Default: 4 seconds. <tag><label id="babel-update">update interval <m/num/</tag> Interval at which periodic (full) updates are sent. Default: 4 times the hello interval. <tag><label id="babel-port">port <m/number/</tag> This option selects an UDP port to operate on. The default is to operate on port 6696 as specified in the Babel RFC. <tag><label id="babel-tx-class">tx class|dscp|priority <m/number/</tag> These options specify the ToS/DiffServ/Traffic class/Priority of the outgoing Babel packets. See <ref id="proto-tx-class" name="tx class"> common option for detailed description. <tag><label id="babel-rx-buffer">rx buffer <m/number/</tag> This option specifies the size of buffers used for packet processing. The buffer size should be bigger than maximal size of received packets. The default value is the interface MTU, and the value will be clamped to a minimum of 512 bytes + IP packet overhead. <tag><label id="babel-tx-length">tx length <m/number/</tag> This option specifies the maximum length of generated Babel packets. To avoid IP fragmentation, it should not exceed the interface MTU value. The default value is the interface MTU value, and the value will be clamped to a minimum of 512 bytes + IP packet overhead. <tag><label id="babel-check-link">check link <m/switch/</tag> If set, the hardware link state (as reported by OS) is taken into consideration. When the link disappears (e.g. an ethernet cable is unplugged), neighbors are immediately considered unreachable and all routes received from them are withdrawn. It is possible that some hardware drivers or platforms do not implement this feature. Default: yes. </descrip> <sect1>Attributes <label id="babel-attr"> <p>Babel defines just one attribute: the internal babel metric of the route. It is exposed as the <cf/babel_metric/ attribute and has range from 1 to infinity (65535). <sect1>Example <label id="babel-exam"> <p><code> protocol babel { interface "eth*" { type wired; }; interface "wlan0", "wlan1" { type wireless; hello interval 1; rxcost 512; }; interface "tap0"; # This matches the default of babeld: redistribute all addresses # configured on local interfaces, plus re-distribute all routes received # from other babel peers. export where (source = RTS_DEVICE) || (source = RTS_BABEL); } </code> <sect>BFD <label id="bfd"> <sect1>Introduction <label id="bfd-intro"> <p>Bidirectional Forwarding Detection (BFD) is not a routing protocol itself, it is an independent tool providing liveness and failure detection. Routing protocols like OSPF and BGP use integrated periodic "hello" messages to monitor liveness of neighbors, but detection times of these mechanisms are high (e.g. 40 seconds by default in OSPF, could be set down to several seconds). BFD offers universal, fast and low-overhead mechanism for failure detection, which could be attached to any routing protocol in an advisory role. <p>BFD consists of mostly independent BFD sessions. Each session monitors an unicast bidirectional path between two BFD-enabled routers. This is done by periodically sending control packets in both directions. BFD does not handle neighbor discovery, BFD sessions are created on demand by request of other protocols (like OSPF or BGP), which supply appropriate information like IP addresses and associated interfaces. When a session changes its state, these protocols are notified and act accordingly (e.g. break an OSPF adjacency when the BFD session went down). <p>BIRD implements basic BFD behavior as defined in <rfc id="5880"> (some advanced features like the echo mode or authentication are not implemented), IP transport for BFD as defined in <rfc id="5881"> and <rfc id="5883"> and interaction with client protocols as defined in <rfc id="5882">. <p>Note that BFD implementation in BIRD is currently a new feature in development, expect some rough edges and possible UI and configuration changes in the future. Also note that we currently support at most one protocol instance. <p>BFD packets are sent with a dynamic source port number. Linux systems use by default a bit different dynamic port range than the IANA approved one (49152-65535). If you experience problems with compatibility, please adjust <cf>/proc/sys/net/ipv4/ip_local_port_range</cf> <sect1>Configuration <label id="bfd-config"> <p>BFD configuration consists mainly of multiple definitions of interfaces. Most BFD config options are session specific. When a new session is requested and dynamically created, it is configured from one of these definitions. For sessions to directly connected neighbors, <cf/interface/ definitions are chosen based on the interface associated with the session, while <cf/multihop/ definition is used for multihop sessions. If no definition is relevant, the session is just created with the default configuration. Therefore, an empty BFD configuration is often sufficient. <p>Note that to use BFD for other protocols like OSPF or BGP, these protocols also have to be configured to request BFD sessions, usually by <cf/bfd/ option. <p>Some of BFD session options require <m/time/ value, which has to be specified with the appropriate unit: <m/num/ <cf/s/|<cf/ms/|<cf/us/. Although microseconds are allowed as units, practical minimum values are usually in order of tens of milliseconds. <code> protocol bfd [<name>] { interface <interface pattern> { interval <time>; min rx interval <time>; min tx interval <time>; idle tx interval <time>; multiplier <num>; passive <switch>; authentication none; authentication simple; authentication [meticulous] keyed md5|sha1; password "<text>"; password "<text>" { id <num>; generate from "<date>"; generate to "<date>"; accept from "<date>"; accept to "<date>"; from "<date>"; to "<date>"; }; }; multihop { interval <time>; min rx interval <time>; min tx interval <time>; idle tx interval <time>; multiplier <num>; passive <switch>; }; neighbor <ip> [dev "<interface>"] [local <ip>] [multihop <switch>]; } </code> <descrip> <tag><label id="bfd-iface">interface <m/pattern/ [, <m/.../] { <m/options/ }</tag> Interface definitions allow to specify options for sessions associated with such interfaces and also may contain interface specific options. See <ref id="proto-iface" name="interface"> common option for a detailed description of interface patterns. Note that contrary to the behavior of <cf/interface/ definitions of other protocols, BFD protocol would accept sessions (in default configuration) even on interfaces not covered by such definitions. <tag><label id="bfd-multihop">multihop { <m/options/ }</tag> Multihop definitions allow to specify options for multihop BFD sessions, in the same manner as <cf/interface/ definitions are used for directly connected sessions. Currently only one such definition (for all multihop sessions) could be used. <tag><label id="bfd-neighbor">neighbor <m/ip/ [dev "<m/interface/"] [local <m/ip/] [multihop <m/switch/]</tag> BFD sessions are usually created on demand as requested by other protocols (like OSPF or BGP). This option allows to explicitly add a BFD session to the specified neighbor regardless of such requests. The session is identified by the IP address of the neighbor, with optional specification of used interface and local IP. By default the neighbor must be directly connected, unless the session is configured as multihop. Note that local IP must be specified for multihop sessions. </descrip> <p>Session specific options (part of <cf/interface/ and <cf/multihop/ definitions): <descrip> <tag><label id="bfd-interval">interval <m/time/</tag> BFD ensures availability of the forwarding path associated with the session by periodically sending BFD control packets in both directions. The rate of such packets is controlled by two options, <cf/min rx interval/ and <cf/min tx interval/ (see below). This option is just a shorthand to set both of these options together. <tag><label id="bfd-min-rx-interval">min rx interval <m/time/</tag> This option specifies the minimum RX interval, which is announced to the neighbor and used there to limit the neighbor's rate of generated BFD control packets. Default: 10 ms. <tag><label id="bfd-min-tx-interval">min tx interval <m/time/</tag> This option specifies the desired TX interval, which controls the rate of generated BFD control packets (together with <cf/min rx interval/ announced by the neighbor). Note that this value is used only if the BFD session is up, otherwise the value of <cf/idle tx interval/ is used instead. Default: 100 ms. <tag><label id="bfd-idle-tx-interval">idle tx interval <m/time/</tag> In order to limit unnecessary traffic in cases where a neighbor is not available or not running BFD, the rate of generated BFD control packets is lower when the BFD session is not up. This option specifies the desired TX interval in such cases instead of <cf/min tx interval/. Default: 1 s. <tag><label id="bfd-multiplier">multiplier <m/num/</tag> Failure detection time for BFD sessions is based on established rate of BFD control packets (<cf>min rx/tx interval</cf>) multiplied by this multiplier, which is essentially (ignoring jitter) a number of missed packets after which the session is declared down. Note that rates and multipliers could be different in each direction of a BFD session. Default: 5. <tag><label id="bfd-passive">passive <m/switch/</tag> Generally, both BFD session endpoints try to establish the session by sending control packets to the other side. This option allows to enable passive mode, which means that the router does not send BFD packets until it has received one from the other side. Default: disabled. <tag>authentication none</tag> No passwords are sent in BFD packets. This is the default value. <tag>authentication simple</tag> Every packet carries 16 bytes of password. Received packets lacking this password are ignored. This authentication mechanism is very weak. <tag>authentication [meticulous] keyed md5|sha1</tag> An authentication code is appended to each packet. The cryptographic algorithm is keyed MD5 or keyed SHA-1. Note that the algorithm is common for all keys (on one interface), in contrast to OSPF or RIP, where it is a per-key option. Passwords (keys) are not sent open via network. The <cf/meticulous/ variant means that cryptographic sequence numbers are increased for each sent packet, while in the basic variant they are increased about once per second. Generally, the <cf/meticulous/ variant offers better resistance to replay attacks but may require more computation. <tag>password "<M>text</M>"</tag> Specifies a password used for authentication. See <ref id="dsc-pass" name="password"> common option for detailed description. Note that password option <cf/algorithm/ is not available in BFD protocol. The algorithm is selected by <cf/authentication/ option for all passwords. </descrip> <sect1>Example <label id="bfd-exam"> <p><code> protocol bfd { interface "eth*" { min rx interval 20 ms; min tx interval 50 ms; idle tx interval 300 ms; }; interface "gre*" { interval 200 ms; multiplier 10; passive; }; multihop { interval 200 ms; multiplier 10; }; neighbor 192.168.1.10; neighbor 192.168.2.2 dev "eth2"; neighbor 192.168.10.1 local 192.168.1.1 multihop; } </code> <sect>BGP <label id="bgp"> <p>The Border Gateway Protocol is the routing protocol used for backbone level routing in the today's Internet. Contrary to other protocols, its convergence does not rely on all routers following the same rules for route selection, making it possible to implement any routing policy at any router in the network, the only restriction being that if a router advertises a route, it must accept and forward packets according to it. <p>BGP works in terms of autonomous systems (often abbreviated as AS). Each AS is a part of the network with common management and common routing policy. It is identified by a unique 16-bit number (ASN). Routers within each AS usually exchange AS-internal routing information with each other using an interior gateway protocol (IGP, such as OSPF or RIP). Boundary routers at the border of the AS communicate global (inter-AS) network reachability information with their neighbors in the neighboring AS'es via exterior BGP (eBGP) and redistribute received information to other routers in the AS via interior BGP (iBGP). <p>Each BGP router sends to its neighbors updates of the parts of its routing table it wishes to export along with complete path information (a list of AS'es the packet will travel through if it uses the particular route) in order to avoid routing loops. <p>BIRD supports all requirements of the BGP4 standard as defined in <rfc id="4271"> It also supports the community attributes (<rfc id="1997">), capability negotiation (<rfc id="5492">), MD5 password authentication (<rfc id="2385">), extended communities (<rfc id="4360">), route reflectors (<rfc id="4456">), graceful restart (<rfc id="4724">), multiprotocol extensions (<rfc id="4760">), 4B AS numbers (<rfc id="4893">), and 4B AS numbers in extended communities (<rfc id="5668">). For IPv6, it uses the standard multiprotocol extensions defined in <rfc id="4760"> and applied to IPv6 according to <rfc id="2545">. <sect1>Route selection rules <label id="bgp-route-select-rules"> <p>BGP doesn't have any simple metric, so the rules for selection of an optimal route among multiple BGP routes with the same preference are a bit more complex and they are implemented according to the following algorithm. It starts the first rule, if there are more "best" routes, then it uses the second rule to choose among them and so on. <itemize> <item>Prefer route with the highest Local Preference attribute. <item>Prefer route with the shortest AS path. <item>Prefer IGP origin over EGP and EGP origin over incomplete. <item>Prefer the lowest value of the Multiple Exit Discriminator. <item>Prefer routes received via eBGP over ones received via iBGP. <item>Prefer routes with lower internal distance to a boundary router. <item>Prefer the route with the lowest value of router ID of the advertising router. </itemize> <sect1>IGP routing table <label id="bgp-igp-routing-table"> <p>BGP is mainly concerned with global network reachability and with routes to other autonomous systems. When such routes are redistributed to routers in the AS via BGP, they contain IP addresses of a boundary routers (in route attribute NEXT_HOP). BGP depends on existing IGP routing table with AS-internal routes to determine immediate next hops for routes and to know their internal distances to boundary routers for the purpose of BGP route selection. In BIRD, there is usually one routing table used for both IGP routes and BGP routes. <sect1>Configuration <label id="bgp-config"> <p>Each instance of the BGP corresponds to one neighboring router. This allows to set routing policy and all the other parameters differently for each neighbor using the following configuration parameters: <descrip> <tag><label id="bgp-local">local [<m/ip/] as <m/number/</tag> Define which AS we are part of. (Note that contrary to other IP routers, BIRD is able to act as a router located in multiple AS'es simultaneously, but in such cases you need to tweak the BGP paths manually in the filters to get consistent behavior.) Optional <cf/ip/ argument specifies a source address, equivalent to the <cf/source address/ option (see below). This parameter is mandatory. <tag><label id="bgp-neighbor">neighbor [<m/ip/] [port <m/number/] [as <m/number/]</tag> Define neighboring router this instance will be talking to and what AS it is located in. In case the neighbor is in the same AS as we are, we automatically switch to iBGP. Optionally, the remote port may also be specified. The parameter may be used multiple times with different sub-options (e.g., both <cf/neighbor 10.0.0.1 as 65000;/ and <cf/neighbor 10.0.0.1; neighbor as 65000;/ are valid). This parameter is mandatory. <tag><label id="bgp-iface">interface <m/string/</tag> Define interface we should use for link-local BGP IPv6 sessions. Interface can also be specified as a part of <cf/neighbor address/ (e.g., <cf/neighbor fe80::1234%eth0 as 65000;/). It is an error to use this parameter for non link-local sessions. <tag><label id="bgp-direct">direct</tag> Specify that the neighbor is directly connected. The IP address of the neighbor must be from a directly reachable IP range (i.e. associated with one of your router's interfaces), otherwise the BGP session wouldn't start but it would wait for such interface to appear. The alternative is the <cf/multihop/ option. Default: enabled for eBGP. <tag><label id="bgp-multihop">multihop [<m/number/]</tag> Configure multihop BGP session to a neighbor that isn't directly connected. Accurately, this option should be used if the configured neighbor IP address does not match with any local network subnets. Such IP address have to be reachable through system routing table. The alternative is the <cf/direct/ option. For multihop BGP it is recommended to explicitly configure the source address to have it stable. Optional <cf/number/ argument can be used to specify the number of hops (used for TTL). Note that the number of networks (edges) in a path is counted; i.e., if two BGP speakers are separated by one router, the number of hops is 2. Default: enabled for iBGP. <tag><label id="bgp-source-address">source address <m/ip/</tag> Define local address we should use for next hop calculation and as a source address for the BGP session. Default: the address of the local end of the interface our neighbor is connected to. <tag><label id="bgp-next-hop-self">next hop self</tag> Avoid calculation of the Next Hop attribute and always advertise our own source address as a next hop. This needs to be used only occasionally to circumvent misconfigurations of other routers. Default: disabled. <tag><label id="bgp-next-hop-keep">next hop keep</tag> Forward the received Next Hop attribute even in situations where the local address should be used instead, like when the route is sent to an interface with a different subnet. Default: disabled. <tag><label id="bgp-missing-lladdr">missing lladdr self|drop|ignore</tag> Next Hop attribute in BGP-IPv6 sometimes contains just the global IPv6 address, but sometimes it has to contain both global and link-local IPv6 addresses. This option specifies what to do if BIRD have to send both addresses but does not know link-local address. This situation might happen when routes from other protocols are exported to BGP, or when improper updates are received from BGP peers. <cf/self/ means that BIRD advertises its own local address instead. <cf/drop/ means that BIRD skips that prefixes and logs error. <cf/ignore/ means that BIRD ignores the problem and sends just the global address (and therefore forms improper BGP update). Default: <cf/self/, unless BIRD is configured as a route server (option <cf/rs client/), in that case default is <cf/ignore/, because route servers usually do not forward packets themselves. <tag><label id="bgp-gateway">gateway direct|recursive</tag> For received routes, their <cf/gw/ (immediate next hop) attribute is computed from received <cf/bgp_next_hop/ attribute. This option specifies how it is computed. Direct mode means that the IP address from <cf/bgp_next_hop/ is used if it is directly reachable, otherwise the neighbor IP address is used. Recursive mode means that the gateway is computed by an IGP routing table lookup for the IP address from <cf/bgp_next_hop/. Note that there is just one level of indirection in recursive mode - the route obtained by the lookup must not be recursive itself, to prevent mutually recursive routes. Recursive mode is the behavior specified by the BGP standard. Direct mode is simpler, does not require any routes in a routing table, and was used in older versions of BIRD, but does not handle well nontrivial iBGP setups and multihop. Recursive mode is incompatible with <ref id="dsc-table-sorted" name="sorted tables">. Default: <cf/direct/ for direct sessions, <cf/recursive/ for multihop sessions. <tag><label id="bgp-igp-table">igp table <m/name/</tag> Specifies a table that is used as an IGP routing table. Default: the same as the table BGP is connected to. <tag><label id="bgp-check-link">check link <M>switch</M></tag> BGP could use hardware link state into consideration. If enabled, BIRD tracks the link state of the associated interface and when link disappears (e.g. an ethernet cable is unplugged), the BGP session is immediately shut down. Note that this option cannot be used with multihop BGP. Default: disabled. <tag><label id="bgp-bfd">bfd <M>switch</M></tag> BGP could use BFD protocol as an advisory mechanism for neighbor liveness and failure detection. If enabled, BIRD setups a BFD session for the BGP neighbor and tracks its liveness by it. This has an advantage of an order of magnitude lower detection times in case of failure. Note that BFD protocol also has to be configured, see <ref id="bfd" name="BFD"> section for details. Default: disabled. <tag><label id="bgp-ttl-security">ttl security <m/switch/</tag> Use GTSM (<rfc id="5082"> - the generalized TTL security mechanism). GTSM protects against spoofed packets by ignoring received packets with a smaller than expected TTL. To work properly, GTSM have to be enabled on both sides of a BGP session. If both <cf/ttl security/ and <cf/multihop/ options are enabled, <cf/multihop/ option should specify proper hop value to compute expected TTL. Kernel support required: Linux: 2.6.34+ (IPv4), 2.6.35+ (IPv6), BSD: since long ago, IPv4 only. Note that full (ICMP protection, for example) <rfc id="5082"> support is provided by Linux only. Default: disabled. <tag><label id="bgp-pass">password <m/string/</tag> Use this password for MD5 authentication of BGP sessions (<rfc id="2385">). When used on BSD systems, see also <cf/setkey/ option below. Default: no authentication. <tag><label id="bgp-setkey">setkey <m/switch/</tag> On BSD systems, keys for TCP MD5 authentication are stored in the global SA/SP database, which can be accessed by external utilities (e.g. setkey(8)). BIRD configures security associations in the SA/SP database automatically based on <cf/password/ options (see above), this option allows to disable automatic updates by BIRD when manual configuration by external utilities is preferred. Note that automatic SA/SP database updates are currently implemented only for FreeBSD. Passwords have to be set manually by an external utility on NetBSD and OpenBSD. Default: enabled (ignored on non-FreeBSD). <tag><label id="bgp-passive">passive <m/switch/</tag> Standard BGP behavior is both initiating outgoing connections and accepting incoming connections. In passive mode, outgoing connections are not initiated. Default: off. <tag><label id="bgp-rr-client">rr client</tag> Be a route reflector and treat the neighbor as a route reflection client. Default: disabled. <tag><label id="bgp-rr-cluster-id">rr cluster id <m/IPv4 address/</tag> Route reflectors use cluster id to avoid route reflection loops. When there is one route reflector in a cluster it usually uses its router id as a cluster id, but when there are more route reflectors in a cluster, these need to be configured (using this option) to use a common cluster id. Clients in a cluster need not know their cluster id and this option is not allowed for them. Default: the same as router id. <tag><label id="bgp-rs-client">rs client</tag> Be a route server and treat the neighbor as a route server client. A route server is used as a replacement for full mesh EBGP routing in Internet exchange points in a similar way to route reflectors used in IBGP routing. BIRD does not implement obsoleted <rfc id="1863">, but uses ad-hoc implementation, which behaves like plain EBGP but reduces modifications to advertised route attributes to be transparent (for example does not prepend its AS number to AS PATH attribute and keeps MED attribute). Default: disabled. <tag><label id="bgp-secondary">secondary <m/switch/</tag> Usually, if an export filter rejects a selected route, no other route is propagated for that network. This option allows to try the next route in order until one that is accepted is found or all routes for that network are rejected. This can be used for route servers that need to propagate different tables to each client but do not want to have these tables explicitly (to conserve memory). This option requires that the connected routing table is <ref id="dsc-table-sorted" name="sorted">. Default: off. <tag><label id="bgp-add-paths">add paths <m/switch/|rx|tx</tag> Standard BGP can propagate only one path (route) per destination network (usually the selected one). This option controls the add-path protocol extension, which allows to advertise any number of paths to a destination. Note that to be active, add-path has to be enabled on both sides of the BGP session, but it could be enabled separately for RX and TX direction. When active, all available routes accepted by the export filter are advertised to the neighbor. Default: off. <tag><label id="bgp-allow-local-as">allow local as [<m/number/]</tag> BGP prevents routing loops by rejecting received routes with the local AS number in the AS path. This option allows to loose or disable the check. Optional <cf/number/ argument can be used to specify the maximum number of local ASNs in the AS path that is allowed for received routes. When the option is used without the argument, the check is completely disabled and you should ensure loop-free behavior by some other means. Default: 0 (no local AS number allowed). <tag><label id="bgp-enable-route-refresh">enable route refresh <m/switch/</tag> After the initial route exchange, BGP protocol uses incremental updates to keep BGP speakers synchronized. Sometimes (e.g., if BGP speaker changes its import filter, or if there is suspicion of inconsistency) it is necessary to do a new complete route exchange. BGP protocol extension Route Refresh (<rfc id="2918">) allows BGP speaker to request re-advertisement of all routes from its neighbor. BGP protocol extension Enhanced Route Refresh (<rfc id="7313">) specifies explicit begin and end for such exchanges, therefore the receiver can remove stale routes that were not advertised during the exchange. This option specifies whether BIRD advertises these capabilities and supports related procedures. Note that even when disabled, BIRD can send route refresh requests. Default: on. <tag><label id="bgp-graceful-restart">graceful restart <m/switch/|aware</tag> When a BGP speaker restarts or crashes, neighbors will discard all received paths from the speaker, which disrupts packet forwarding even when the forwarding plane of the speaker remains intact. <rfc id="4724"> specifies an optional graceful restart mechanism to alleviate this issue. This option controls the mechanism. It has three states: Disabled, when no support is provided. Aware, when the graceful restart support is announced and the support for restarting neighbors is provided, but no local graceful restart is allowed (i.e. receiving-only role). Enabled, when the full graceful restart support is provided (i.e. both restarting and receiving role). Note that proper support for local graceful restart requires also configuration of other protocols. Default: aware. <tag><label id="bgp-graceful-restart-time">graceful restart time <m/number/</tag> The restart time is announced in the BGP graceful restart capability and specifies how long the neighbor would wait for the BGP session to re-establish after a restart before deleting stale routes. Default: 120 seconds. <tag><label id="bgp-interpret-communities">interpret communities <m/switch/</tag> <rfc id="1997"> demands that BGP speaker should process well-known communities like no-export (65535, 65281) or no-advertise (65535, 65282). For example, received route carrying a no-adverise community should not be advertised to any of its neighbors. If this option is enabled (which is by default), BIRD has such behavior automatically (it is evaluated when a route is exported to the BGP protocol just before the export filter). Otherwise, this integrated processing of well-known communities is disabled. In that case, similar behavior can be implemented in the export filter. Default: on. <tag><label id="bgp-enable-as4">enable as4 <m/switch/</tag> BGP protocol was designed to use 2B AS numbers and was extended later to allow 4B AS number. BIRD supports 4B AS extension, but by disabling this option it can be persuaded not to advertise it and to maintain old-style sessions with its neighbors. This might be useful for circumventing bugs in neighbor's implementation of 4B AS extension. Even when disabled (off), BIRD behaves internally as AS4-aware BGP router. Default: on. <tag><label id="bgp-enable-extended-messages">enable extended messages <m/switch/</tag> The BGP protocol uses maximum message length of 4096 bytes. This option provides an extension to allow extended messages with length up to 65535 bytes. Default: off. <tag><label id="bgp-capabilities">capabilities <m/switch/</tag> Use capability advertisement to advertise optional capabilities. This is standard behavior for newer BGP implementations, but there might be some older BGP implementations that reject such connection attempts. When disabled (off), features that request it (4B AS support) are also disabled. Default: on, with automatic fallback to off when received capability-related error. <tag><label id="bgp-advertise-ipv4">advertise ipv4 <m/switch/</tag> Advertise IPv4 multiprotocol capability. This is not a correct behavior according to the strict interpretation of <rfc id="4760">, but it is widespread and required by some BGP implementations (Cisco and Quagga). This option is relevant to IPv4 mode with enabled capability advertisement only. Default: on. <tag><label id="bgp-route-limit">route limit <m/number/</tag> The maximal number of routes that may be imported from the protocol. If the route limit is exceeded, the connection is closed with an error. Limit is currently implemented as <cf>import limit <m/number/ action restart</cf>. This option is obsolete and it is replaced by <ref id="proto-import-limit" name="import limit option">. Default: no limit. <tag><label id="bgp-disable-after-error">disable after error <m/switch/</tag> When an error is encountered (either locally or by the other side), disable the instance automatically and wait for an administrator to fix the problem manually. Default: off. <tag><label id="bgp-hold-time">hold time <m/number/</tag> Time in seconds to wait for a Keepalive message from the other side before considering the connection stale. Default: depends on agreement with the neighboring router, we prefer 240 seconds if the other side is willing to accept it. <tag><label id="bgp-startup-hold-time">startup hold time <m/number/</tag> Value of the hold timer used before the routers have a chance to exchange open messages and agree on the real value. Default: 240 seconds. <tag><label id="bgp-keepalive-time">keepalive time <m/number/</tag> Delay in seconds between sending of two consecutive Keepalive messages. Default: One third of the hold time. <tag><label id="bgp-connect-delay-time">connect delay time <m/number/</tag> Delay in seconds between protocol startup and the first attempt to connect. Default: 5 seconds. <tag><label id="bgp-connect-retry-time">connect retry time <m/number/</tag> Time in seconds to wait before retrying a failed attempt to connect. Default: 120 seconds. <tag><label id="bgp-error-wait-time">error wait time <m/number/,<m/number/</tag> Minimum and maximum delay in seconds between a protocol failure (either local or reported by the peer) and automatic restart. Doesn't apply when <cf/disable after error/ is configured. If consecutive errors happen, the delay is increased exponentially until it reaches the maximum. Default: 60, 300. <tag><label id="bgp-error-forget-time">error forget time <m/number/</tag> Maximum time in seconds between two protocol failures to treat them as a error sequence which makes <cf/error wait time/ increase exponentially. Default: 300 seconds. <tag><label id="bgp-path-metric">path metric <m/switch/</tag> Enable comparison of path lengths when deciding which BGP route is the best one. Default: on. <tag><label id="bgp-med-metric">med metric <m/switch/</tag> Enable comparison of MED attributes (during best route selection) even between routes received from different ASes. This may be useful if all MED attributes contain some consistent metric, perhaps enforced in import filters of AS boundary routers. If this option is disabled, MED attributes are compared only if routes are received from the same AS (which is the standard behavior). Default: off. <tag><label id="bgp-deterministic-med">deterministic med <m/switch/</tag> BGP route selection algorithm is often viewed as a comparison between individual routes (e.g. if a new route appears and is better than the current best one, it is chosen as the new best one). But the proper route selection, as specified by <rfc id="4271">, cannot be fully implemented in that way. The problem is mainly in handling the MED attribute. BIRD, by default, uses an simplification based on individual route comparison, which in some cases may lead to temporally dependent behavior (i.e. the selection is dependent on the order in which routes appeared). This option enables a different (and slower) algorithm implementing proper <rfc id="4271"> route selection, which is deterministic. Alternative way how to get deterministic behavior is to use <cf/med metric/ option. This option is incompatible with <ref id="dsc-table-sorted" name="sorted tables">. Default: off. <tag><label id="bgp-igp-metric">igp metric <m/switch/</tag> Enable comparison of internal distances to boundary routers during best route selection. Default: on. <tag><label id="bgp-prefer-older">prefer older <m/switch/</tag> Standard route selection algorithm breaks ties by comparing router IDs. This changes the behavior to prefer older routes (when both are external and from different peer). For details, see <rfc id="5004">. Default: off. <tag><label id="bgp-default-med">default bgp_med <m/number/</tag> Value of the Multiple Exit Discriminator to be used during route selection when the MED attribute is missing. Default: 0. <tag><label id="bgp-default-local-pref">default bgp_local_pref <m/number/</tag> A default value for the Local Preference attribute. It is used when a new Local Preference attribute is attached to a route by the BGP protocol itself (for example, if a route is received through eBGP and therefore does not have such attribute). Default: 100 (0 in pre-1.2.0 versions of BIRD). </descrip> <sect1>Attributes <label id="bgp-attr"> <p>BGP defines several route attributes. Some of them (those marked with `<tt/I/' in the table below) are available on internal BGP connections only, some of them (marked with `<tt/O/') are optional. <descrip> <tag><label id="rta-bgp-path">bgppath bgp_path/</tag> Sequence of AS numbers describing the AS path the packet will travel through when forwarded according to the particular route. In case of internal BGP it doesn't contain the number of the local AS. <tag><label id="rta-bgp-local-pref">int bgp_local_pref/ [I]</tag> Local preference value used for selection among multiple BGP routes (see the selection rules above). It's used as an additional metric which is propagated through the whole local AS. <tag><label id="rta-bgp-med">int bgp_med/ [O]</tag> The Multiple Exit Discriminator of the route is an optional attribute which is used on external (inter-AS) links to convey to an adjacent AS the optimal entry point into the local AS. The received attribute is also propagated over internal BGP links. The attribute value is zeroed when a route is exported to an external BGP instance to ensure that the attribute received from a neighboring AS is not propagated to other neighboring ASes. A new value might be set in the export filter of an external BGP instance. See <rfc id="4451"> for further discussion of BGP MED attribute. <tag><label id="rta-bgp-origin">enum bgp_origin/</tag> Origin of the route: either <cf/ORIGIN_IGP/ if the route has originated in an interior routing protocol or <cf/ORIGIN_EGP/ if it's been imported from the <tt>EGP</tt> protocol (nowadays it seems to be obsolete) or <cf/ORIGIN_INCOMPLETE/ if the origin is unknown. <tag><label id="rta-bgp-next-hop">ip bgp_next_hop/</tag> Next hop to be used for forwarding of packets to this destination. On internal BGP connections, it's an address of the originating router if it's inside the local AS or a boundary router the packet will leave the AS through if it's an exterior route, so each BGP speaker within the AS has a chance to use the shortest interior path possible to this point. <tag><label id="rta-bgp-atomic-aggr">void bgp_atomic_aggr/ [O]</tag> This is an optional attribute which carries no value, but the sole presence of which indicates that the route has been aggregated from multiple routes by some router on the path from the originator. <!-- we don't handle aggregators right since they are of a very obscure type <tag>bgp_aggregator</tag> --> <tag><label id="rta-bgp-community">clist bgp_community/ [O]</tag> List of community values associated with the route. Each such value is a pair (represented as a <cf/pair/ data type inside the filters) of 16-bit integers, the first of them containing the number of the AS which defines the community and the second one being a per-AS identifier. There are lots of uses of the community mechanism, but generally they are used to carry policy information like "don't export to USA peers". As each AS can define its own routing policy, it also has a complete freedom about which community attributes it defines and what will their semantics be. <tag><label id="rta-bgp-ext-community">eclist bgp_ext_community/ [O]</tag> List of extended community values associated with the route. Extended communities have similar usage as plain communities, but they have an extended range (to allow 4B ASNs) and a nontrivial structure with a type field. Individual community values are represented using an <cf/ec/ data type inside the filters. <tag><label id="rta-bgp-large-community">lclist <cf/bgp_large_community/ [O]</tag> List of large community values associated with the route. Large BGP communities is another variant of communities, but contrary to extended communities they behave very much the same way as regular communities, just larger -- they are uniform untyped triplets of 32bit numbers. Individual community values are represented using an <cf/lc/ data type inside the filters. <tag><label id="rta-bgp-originator-id">quad bgp_originator_id/ [I, O]</tag> This attribute is created by the route reflector when reflecting the route and contains the router ID of the originator of the route in the local AS. <tag><label id="rta-bgp-cluster-list">clist bgp_cluster_list/ [I, O]</tag> This attribute contains a list of cluster IDs of route reflectors. Each route reflector prepends its cluster ID when reflecting the route. </descrip> <sect1>Example <label id="bgp-exam"> <p><code> protocol bgp { local as 65000; # Use a private AS number neighbor 198.51.100.130 as 64496; # Our neighbor ... multihop; # ... which is connected indirectly export filter { # We use non-trivial export rules if source = RTS_STATIC then { # Export only static routes # Assign our community bgp_community.add((65000,64501)); # Artificially increase path length # by advertising local AS number twice if bgp_path ~ [= 65000 =] then bgp_path.prepend(65000); accept; } reject; }; import all; source address 198.51.100.14; # Use a non-standard source address } </code> <sect>Device <label id="device"> <p>The Device protocol is not a real routing protocol. It doesn't generate any routes and it only serves as a module for getting information about network interfaces from the kernel. <p>Except for very unusual circumstances, you probably should include this protocol in the configuration since almost all other protocols require network interfaces to be defined for them to work with. <sect1>Configuration <label id="device-config"> <p><descrip> <tag><label id="device-scan-time">scan time <m/number/</tag> Time in seconds between two scans of the network interface list. On systems where we are notified about interface status changes asynchronously (such as newer versions of Linux), we need to scan the list only in order to avoid confusion by lost notification messages, so the default time is set to a large value. <tag><label id="device-primary">primary [ "<m/mask/" ] <m/prefix/</tag> If a network interface has more than one network address, BIRD has to choose one of them as a primary one. By default, BIRD chooses the lexicographically smallest address as the primary one. This option allows to specify which network address should be chosen as a primary one. Network addresses that match <m/prefix/ are preferred to non-matching addresses. If more <cf/primary/ options are used, the first one has the highest preference. If "<m/mask/" is specified, then such <cf/primary/ option is relevant only to matching network interfaces. In all cases, an address marked by operating system as secondary cannot be chosen as the primary one. </descrip> <p>As the Device protocol doesn't generate any routes, it cannot have any attributes. Example configuration looks like this: <p><code> protocol device { scan time 10; # Scan the interfaces often primary "eth0" 192.168.1.1; primary 192.168.0.0/16; } </code> <sect>Direct <label id="direct"> <p>The Direct protocol is a simple generator of device routes for all the directly connected networks according to the list of interfaces provided by the kernel via the Device protocol. <p>The question is whether it is a good idea to have such device routes in BIRD routing table. OS kernel usually handles device routes for directly connected networks by itself so we don't need (and don't want) to export these routes to the kernel protocol. OSPF protocol creates device routes for its interfaces itself and BGP protocol is usually used for exporting aggregate routes. Although there are some use cases that use the direct protocol (like abusing eBGP as an IGP routing protocol), in most cases it is not needed to have these device routes in BIRD routing table and to use the direct protocol. <p>There is one notable case when you definitely want to use the direct protocol -- running BIRD on BSD systems. Having high priority device routes for directly connected networks from the direct protocol protects kernel device routes from being overwritten or removed by IGP routes during some transient network conditions, because a lower priority IGP route for the same network is not exported to the kernel routing table. This is an issue on BSD systems only, as on Linux systems BIRD cannot change non-BIRD route in the kernel routing table. <p>There are just few configuration options for the Direct protocol: <p><descrip> <tag><label id="direct-iface">interface <m/pattern/ [, <m/.../]</tag> By default, the Direct protocol will generate device routes for all the interfaces available. If you want to restrict it to some subset of interfaces or addresses (e.g. if you're using multiple routing tables for policy routing and some of the policy domains don't contain all interfaces), just use this clause. See <ref id="proto-iface" name="interface"> common option for detailed description. The Direct protocol uses extended interface clauses. <tag><label id="direct-check-link">check link <m/switch/</tag> If enabled, a hardware link state (reported by OS) is taken into consideration. Routes for directly connected networks are generated only if link up is reported and they are withdrawn when link disappears (e.g., an ethernet cable is unplugged). Default value is no. </descrip> <p>Direct device routes don't contain any specific attributes. <p>Example config might look like this: <p><code> protocol direct { interface "-arc*", "*"; # Exclude the ARCnets } </code> <sect>Kernel <label id="krt"> <p>The Kernel protocol is not a real routing protocol. Instead of communicating with other routers in the network, it performs synchronization of BIRD's routing tables with the OS kernel. Basically, it sends all routing table updates to the kernel and from time to time it scans the kernel tables to see whether some routes have disappeared (for example due to unnoticed up/down transition of an interface) or whether an `alien' route has been added by someone else (depending on the <cf/learn/ switch, such routes are either ignored or accepted to our table). <p>Unfortunately, there is one thing that makes the routing table synchronization a bit more complicated. In the kernel routing table there are also device routes for directly connected networks. These routes are usually managed by OS itself (as a part of IP address configuration) and we don't want to touch that. They are completely ignored during the scan of the kernel tables and also the export of device routes from BIRD tables to kernel routing tables is restricted to prevent accidental interference. This restriction can be disabled using <cf/device routes/ switch. <p>If your OS supports only a single routing table, you can configure only one instance of the Kernel protocol. If it supports multiple tables (in order to allow policy routing; such an OS is for example Linux), you can run as many instances as you want, but each of them must be connected to a different BIRD routing table and to a different kernel table. <p>Because the kernel protocol is partially integrated with the connected routing table, there are two limitations - it is not possible to connect more kernel protocols to the same routing table and changing route destination (gateway) in an export filter of a kernel protocol does not work. Both limitations can be overcome using another routing table and the pipe protocol. <sect1>Configuration <label id="krt-config"> <p><descrip> <tag><label id="krt-persist">persist <m/switch/</tag> Tell BIRD to leave all its routes in the routing tables when it exits (instead of cleaning them up). <tag><label id="krt-scan-time">scan time <m/number/</tag> Time in seconds between two consecutive scans of the kernel routing table. <tag><label id="krt-learn">learn <m/switch/</tag> Enable learning of routes added to the kernel routing tables by other routing daemons or by the system administrator. This is possible only on systems which support identification of route authorship. <tag><label id="krt-device-routes">device routes <m/switch/</tag> Enable export of device routes to the kernel routing table. By default, such routes are rejected (with the exception of explicitly configured device routes from the static protocol) regardless of the export filter to protect device routes in kernel routing table (managed by OS itself) from accidental overwriting or erasing. <tag><label id="krt-kernel-table">kernel table <m/number/</tag> Select which kernel table should this particular instance of the Kernel protocol work with. Available only on systems supporting multiple routing tables. <tag><label id="krt-metric">metric <m/number/</tag> (Linux) Use specified value as a kernel metric (priority) for all routes sent to the kernel. When multiple routes for the same network are in the kernel routing table, the Linux kernel chooses one with lower metric. Also, routes with different metrics do not clash with each other, therefore using dedicated metric value is a reliable way to avoid overwriting routes from other sources (e.g. kernel device routes). Metric 0 has a special meaning of undefined metric, in which either OS default is used, or per-route metric can be set using <cf/krt_metric/ attribute. Default: 0 (undefined). <tag><label id="krt-graceful-restart">graceful restart <m/switch/</tag> Participate in graceful restart recovery. If this option is enabled and a graceful restart recovery is active, the Kernel protocol will defer synchronization of routing tables until the end of the recovery. Note that import of kernel routes to BIRD is not affected. <tag><label id="krt-merge-paths">merge paths <M>switch</M> [limit <M>number</M>]</tag> Usually, only best routes are exported to the kernel protocol. With path merging enabled, both best routes and equivalent non-best routes are merged during export to generate one ECMP (equal-cost multipath) route for each network. This is useful e.g. for BGP multipath. Note that best routes are still pivotal for route export (responsible for most properties of resulting ECMP routes), while exported non-best routes are responsible just for additional multipath next hops. This option also allows to specify a limit on maximal number of nexthops in one route. By default, multipath merging is disabled. If enabled, default value of the limit is 16. </descrip> <sect1>Attributes <label id="krt-attr"> <p>The Kernel protocol defines several attributes. These attributes are translated to appropriate system (and OS-specific) route attributes. We support these attributes: <descrip> <tag><label id="rta-krt-source">int krt_source/</tag> The original source of the imported kernel route. The value is system-dependent. On Linux, it is a value of the protocol field of the route. See /etc/iproute2/rt_protos for common values. On BSD, it is based on STATIC and PROTOx flags. The attribute is read-only. <tag><label id="rta-krt-metric">int krt_metric/</tag> (Linux) The kernel metric of the route. When multiple same routes are in a kernel routing table, the Linux kernel chooses one with lower metric. Note that preferred way to set kernel metric is to use protocol option <cf/metric/, unless per-route metric values are needed. <tag><label id="rta-krt-prefsrc">ip krt_prefsrc/</tag> (Linux) The preferred source address. Used in source address selection for outgoing packets. Has to be one of the IP addresses of the router. <tag><label id="rta-krt-realm">int krt_realm/</tag> (Linux) The realm of the route. Can be used for traffic classification. <tag><label id="rta-krt-scope">int krt_scope/</tag> (Linux IPv4) The scope of the route. Valid values are 0-254, although Linux kernel may reject some values depending on route type and nexthop. It is supposed to represent `indirectness' of the route, where nexthops of routes are resolved through routes with a higher scope, but in current kernels anything below <it/link/ (253) is treated as <it/global/ (0). When not present, global scope is implied for all routes except device routes, where link scope is used by default. </descrip> <p>In Linux, there is also a plenty of obscure route attributes mostly focused on tuning TCP performance of local connections. BIRD supports most of these attributes, see Linux or iproute2 documentation for their meaning. Attributes <cf/krt_lock_*/ and <cf/krt_feature_*/ have type bool, others have type int. Supported attributes are: <cf/krt_mtu/, <cf/krt_lock_mtu/, <cf/krt_window/, <cf/krt_lock_window/, <cf/krt_rtt/, <cf/krt_lock_rtt/, <cf/krt_rttvar/, <cf/krt_lock_rttvar/, <cf/krt_sstresh/, <cf/krt_lock_sstresh/, <cf/krt_cwnd/, <cf/krt_lock_cwnd/, <cf/krt_advmss/, <cf/krt_lock_advmss/, <cf/krt_reordering/, <cf/krt_lock_reordering/, <cf/krt_hoplimit/, <cf/krt_lock_hoplimit/, <cf/krt_rto_min/, <cf/krt_lock_rto_min/, <cf/krt_initcwnd/, <cf/krt_initrwnd/, <cf/krt_quickack/, <cf/krt_feature_ecn/, <cf/krt_feature_allfrag/ <sect1>Example <label id="krt-exam"> <p>A simple configuration can look this way: <p><code> protocol kernel { export all; } </code> <p>Or for a system with two routing tables: <p><code> protocol kernel { # Primary routing table learn; # Learn alien routes from the kernel persist; # Don't remove routes on bird shutdown scan time 10; # Scan kernel routing table every 10 seconds import all; export all; } protocol kernel { # Secondary routing table table auxtable; kernel table 100; export all; } </code> <sect>OSPF <label id="ospf"> <sect1>Introduction <label id="ospf-intro"> <p>Open Shortest Path First (OSPF) is a quite complex interior gateway protocol. The current IPv4 version (OSPFv2) is defined in <rfc id="2328"> and the current IPv6 version (OSPFv3) is defined in <rfc id="5340"> It's a link state (a.k.a. shortest path first) protocol -- each router maintains a database describing the autonomous system's topology. Each participating router has an identical copy of the database and all routers run the same algorithm calculating a shortest path tree with themselves as a root. OSPF chooses the least cost path as the best path. <p>In OSPF, the autonomous system can be split to several areas in order to reduce the amount of resources consumed for exchanging the routing information and to protect the other areas from incorrect routing data. Topology of the area is hidden to the rest of the autonomous system. <p>Another very important feature of OSPF is that it can keep routing information from other protocols (like Static or BGP) in its link state database as external routes. Each external route can be tagged by the advertising router, making it possible to pass additional information between routers on the boundary of the autonomous system. <p>OSPF quickly detects topological changes in the autonomous system (such as router interface failures) and calculates new loop-free routes after a short period of convergence. Only a minimal amount of routing traffic is involved. <p>Each router participating in OSPF routing periodically sends Hello messages to all its interfaces. This allows neighbors to be discovered dynamically. Then the neighbors exchange theirs parts of the link state database and keep it identical by flooding updates. The flooding process is reliable and ensures that each router detects all changes. <sect1>Configuration <label id="ospf-config"> <p>In the main part of configuration, there can be multiple definitions of OSPF areas, each with a different id. These definitions includes many other switches and multiple definitions of interfaces. Definition of interface may contain many switches and constant definitions and list of neighbors on nonbroadcast networks. <code> protocol ospf <name> { rfc1583compat <switch>; instance id <num>; stub router <switch>; tick <num>; ecmp <switch> [limit <num>]; merge external <switch>; area <id> { stub; nssa; summary <switch>; default nssa <switch>; default cost <num>; default cost2 <num>; translator <switch>; translator stability <num>; networks { <prefix>; <prefix> hidden; } external { <prefix>; <prefix> hidden; <prefix> tag <num>; } stubnet <prefix>; stubnet <prefix> { hidden <switch>; summary <switch>; cost <num>; } interface <interface pattern> [instance <num>] { cost <num>; stub <switch>; hello <num>; poll <num>; retransmit <num>; priority <num>; wait <num>; dead count <num>; dead <num>; secondary <switch>; rx buffer [normal|large|<num>]; tx length <num>; type [broadcast|bcast|pointopoint|ptp| nonbroadcast|nbma|pointomultipoint|ptmp]; link lsa suppression <switch>; strict nonbroadcast <switch>; real broadcast <switch>; ptp netmask <switch>; check link <switch>; bfd <switch>; ecmp weight <num>; ttl security [<switch>; | tx only] tx class|dscp <num>; tx priority <num>; authentication none|simple|cryptographic; password "<text>"; password "<text>" { id <num>; generate from "<date>"; generate to "<date>"; accept from "<date>"; accept to "<date>"; from "<date>"; to "<date>"; algorithm ( keyed md5 | keyed sha1 | hmac sha1 | hmac sha256 | hmac sha384 | hmac sha512 ); }; neighbors { <ip>; <ip> eligible; }; }; virtual link <id> [instance <num>] { hello <num>; retransmit <num>; wait <num>; dead count <num>; dead <num>; authentication none|simple|cryptographic; password "<text>"; password "<text>" { id <num>; generate from "<date>"; generate to "<date>"; accept from "<date>"; accept to "<date>"; from "<date>"; to "<date>"; algorithm ( keyed md5 | keyed sha1 | hmac sha1 | hmac sha256 | hmac sha384 | hmac sha512 ); }; }; }; } </code> <descrip> <tag><label id="ospf-rfc1583compat">rfc1583compat <M>switch</M></tag> This option controls compatibility of routing table calculation with <rfc id="1583">. Default value is no. <tag><label id="ospf-instance-id">instance id <m/num/</tag> When multiple OSPF protocol instances are active on the same links, they should use different instance IDs to distinguish their packets. Although it could be done on per-interface basis, it is often preferred to set one instance ID to whole OSPF domain/topology (e.g., when multiple instances are used to represent separate logical topologies on the same physical network). This option specifies the default instance ID for all interfaces of the OSPF instance. Note that this option, if used, must precede interface definitions. Default value is 0. <tag><label id="ospf-stub-router">stub router <M>switch</M></tag> This option configures the router to be a stub router, i.e., a router that participates in the OSPF topology but does not allow transit traffic. In OSPFv2, this is implemented by advertising maximum metric for outgoing links. In OSPFv3, the stub router behavior is announced by clearing the R-bit in the router LSA. See <rfc id="6987"> for details. Default value is no. <tag><label id="ospf-tick">tick <M>num</M></tag> The routing table calculation and clean-up of areas' databases is not performed when a single link state change arrives. To lower the CPU utilization, it's processed later at periodical intervals of <m/num/ seconds. The default value is 1. <tag><label id="ospf-ecmp">ecmp <M>switch</M> [limit <M>number</M>]</tag> This option specifies whether OSPF is allowed to generate ECMP (equal-cost multipath) routes. Such routes are used when there are several directions to the destination, each with the same (computed) cost. This option also allows to specify a limit on maximum number of nexthops in one route. By default, ECMP is disabled. If enabled, default value of the limit is 16. <tag><label id="ospf-merge-external">merge external <M>switch</M></tag> This option specifies whether OSPF should merge external routes from different routers/LSAs for the same destination. When enabled together with <cf/ecmp/, equal-cost external routes will be combined to multipath routes in the same way as regular routes. When disabled, external routes from different LSAs are treated as separate even if they represents the same destination. Default value is no. <tag><label id="ospf-area">area <M>id</M></tag> This defines an OSPF area with given area ID (an integer or an IPv4 address, similarly to a router ID). The most important area is the backbone (ID 0) to which every other area must be connected. <tag><label id="ospf-stub">stub</tag> This option configures the area to be a stub area. External routes are not flooded into stub areas. Also summary LSAs can be limited in stub areas (see option <cf/summary/). By default, the area is not a stub area. <tag><label id="ospf-nssa">nssa</tag> This option configures the area to be a NSSA (Not-So-Stubby Area). NSSA is a variant of a stub area which allows a limited way of external route propagation. Global external routes are not propagated into a NSSA, but an external route can be imported into NSSA as a (area-wide) NSSA-LSA (and possibly translated and/or aggregated on area boundary). By default, the area is not NSSA. <tag><label id="ospf-summary">summary <M>switch</M></tag> This option controls propagation of summary LSAs into stub or NSSA areas. If enabled, summary LSAs are propagated as usual, otherwise just the default summary route (0.0.0.0/0) is propagated (this is sometimes called totally stubby area). If a stub area has more area boundary routers, propagating summary LSAs could lead to more efficient routing at the cost of larger link state database. Default value is no. <tag><label id="ospf-default-nssa">default nssa <M>switch</M></tag> When <cf/summary/ option is enabled, default summary route is no longer propagated to the NSSA. In that case, this option allows to originate default route as NSSA-LSA to the NSSA. Default value is no. <tag><label id="ospf-default-cost">default cost <M>num</M></tag> This option controls the cost of a default route propagated to stub and NSSA areas. Default value is 1000. <tag><label id="ospf-default-cost2">default cost2 <M>num</M></tag> When a default route is originated as NSSA-LSA, its cost can use either type 1 or type 2 metric. This option allows to specify the cost of a default route in type 2 metric. By default, type 1 metric (option <cf/default cost/) is used. <tag><label id="ospf-translator">translator <M>switch</M></tag> This option controls translation of NSSA-LSAs into external LSAs. By default, one translator per NSSA is automatically elected from area boundary routers. If enabled, this area boundary router would unconditionally translate all NSSA-LSAs regardless of translator election. Default value is no. <tag><label id="ospf-translator-stability">translator stability <M>num</M></tag> This option controls the translator stability interval (in seconds). When the new translator is elected, the old one keeps translating until the interval is over. Default value is 40. <tag><label id="ospf-networks">networks { <m/set/ }</tag> Definition of area IP ranges. This is used in summary LSA origination. Hidden networks are not propagated into other areas. <tag><label id="ospf-external">external { <m/set/ }</tag> Definition of external area IP ranges for NSSAs. This is used for NSSA-LSA translation. Hidden networks are not translated into external LSAs. Networks can have configured route tag. <tag><label id="ospf-stubnet">stubnet <m/prefix/ { <m/options/ }</tag> Stub networks are networks that are not transit networks between OSPF routers. They are also propagated through an OSPF area as a part of a link state database. By default, BIRD generates a stub network record for each primary network address on each OSPF interface that does not have any OSPF neighbors, and also for each non-primary network address on each OSPF interface. This option allows to alter a set of stub networks propagated by this router. Each instance of this option adds a stub network with given network prefix to the set of propagated stub network, unless option <cf/hidden/ is used. It also suppresses default stub networks for given network prefix. When option <cf/summary/ is used, also default stub networks that are subnetworks of given stub network are suppressed. This might be used, for example, to aggregate generated stub networks. <tag><label id="ospf-iface">interface <M>pattern</M> [instance <m/num/]</tag> Defines that the specified interfaces belong to the area being defined. See <ref id="proto-iface" name="interface"> common option for detailed description. In OSPFv2, extended interface clauses are used, because each network prefix is handled as a separate virtual interface. You can specify alternative instance ID for the interface definition, therefore it is possible to have several instances of that interface with different options or even in different areas. For OSPFv2, instance ID support is an extension (<rfc id="6549">) and is supposed to be set per-protocol. For OSPFv3, it is an integral feature. <tag><label id="ospf-virtual-link">virtual link <M>id</M> [instance <m/num/]</tag> Virtual link to router with the router id. Virtual link acts as a point-to-point interface belonging to backbone. The actual area is used as a transport area. This item cannot be in the backbone. Like with <cf/interface/ option, you could also use several virtual links to one destination with different instance IDs. <tag><label id="ospf-cost">cost <M>num</M></tag> Specifies output cost (metric) of an interface. Default value is 10. <tag><label id="ospf-stub-iface">stub <M>switch</M></tag> If set to interface it does not listen to any packet and does not send any hello. Default value is no. <tag><label id="ospf-hello">hello <M>num</M></tag> Specifies interval in seconds between sending of Hello messages. Beware, all routers on the same network need to have the same hello interval. Default value is 10. <tag><label id="ospf-poll">poll <M>num</M></tag> Specifies interval in seconds between sending of Hello messages for some neighbors on NBMA network. Default value is 20. <tag><label id="ospf-retransmit">retransmit <M>num</M></tag> Specifies interval in seconds between retransmissions of unacknowledged updates. Default value is 5. <tag><label id="ospf-priority">priority <M>num</M></tag> On every multiple access network (e.g., the Ethernet) Designated Router and Backup Designated router are elected. These routers have some special functions in the flooding process. Higher priority increases preferences in this election. Routers with priority 0 are not eligible. Default value is 1. <tag><label id="ospf-wait">wait <M>num</M></tag> After start, router waits for the specified number of seconds between starting election and building adjacency. Default value is 4*<m/hello/. <tag><label id="ospf-dead-count">dead count <M>num</M></tag> When the router does not receive any messages from a neighbor in <m/dead count/*<m/hello/ seconds, it will consider the neighbor down. <tag><label id="ospf-dead">dead <M>num</M></tag> When the router does not receive any messages from a neighbor in <m/dead/ seconds, it will consider the neighbor down. If both directives <cf/dead count/ and <cf/dead/ are used, <cf/dead/ has precedence. <tag><label id="ospf-secondary">secondary <M>switch</M></tag> On BSD systems, older versions of BIRD supported OSPFv2 only for the primary IP address of an interface, other IP ranges on the interface were handled as stub networks. Since v1.4.1, regular operation on secondary IP addresses is supported, but disabled by default for compatibility. This option allows to enable it. The option is a transitional measure, will be removed in the next major release as the behavior will be changed. On Linux systems, the option is irrelevant, as operation on non-primary addresses is already the regular behavior. <tag><label id="ospf-rx-buffer">rx buffer <M>num</M></tag> This option allows to specify the size of buffers used for packet processing. The buffer size should be bigger than maximal size of any packets. By default, buffers are dynamically resized as needed, but a fixed value could be specified. Value <cf/large/ means maximal allowed packet size - 65535. <tag><label id="ospf-tx-length">tx length <M>num</M></tag> Transmitted OSPF messages that contain large amount of information are segmented to separate OSPF packets to avoid IP fragmentation. This option specifies the soft ceiling for the length of generated OSPF packets. Default value is the MTU of the network interface. Note that larger OSPF packets may still be generated if underlying OSPF messages cannot be splitted (e.g. when one large LSA is propagated). <tag><label id="ospf-type-bcast">type broadcast|bcast</tag> BIRD detects a type of a connected network automatically, but sometimes it's convenient to force use of a different type manually. On broadcast networks (like ethernet), flooding and Hello messages are sent using multicasts (a single packet for all the neighbors). A designated router is elected and it is responsible for synchronizing the link-state databases and originating network LSAs. This network type cannot be used on physically NBMA networks and on unnumbered networks (networks without proper IP prefix). <tag><label id="ospf-type-ptp">type pointopoint|ptp</tag> Point-to-point networks connect just 2 routers together. No election is performed and no network LSA is originated, which makes it simpler and faster to establish. This network type is useful not only for physically PtP ifaces (like PPP or tunnels), but also for broadcast networks used as PtP links. This network type cannot be used on physically NBMA networks. <tag><label id="ospf-type-nbma">type nonbroadcast|nbma</tag> On NBMA networks, the packets are sent to each neighbor separately because of lack of multicast capabilities. Like on broadcast networks, a designated router is elected, which plays a central role in propagation of LSAs. This network type cannot be used on unnumbered networks. <tag><label id="ospf-type-ptmp">type pointomultipoint|ptmp</tag> This is another network type designed to handle NBMA networks. In this case the NBMA network is treated as a collection of PtP links. This is useful if not every pair of routers on the NBMA network has direct communication, or if the NBMA network is used as an (possibly unnumbered) PtP link. <tag><label id="ospf-link-lsa-suppression">link lsa suppression <m/switch/</tag> In OSPFv3, link LSAs are generated for each link, announcing link-local IPv6 address of the router to its local neighbors. These are useless on PtP or PtMP networks and this option allows to suppress the link LSA origination for such interfaces. The option is ignored on other than PtP or PtMP interfaces. Default value is no. <tag><label id="ospf-strict-nonbroadcast">strict nonbroadcast <m/switch/</tag> If set, don't send hello to any undefined neighbor. This switch is ignored on other than NBMA or PtMP interfaces. Default value is no. <tag><label id="ospf-real-broadcast">real broadcast <m/switch/</tag> In <cf/type broadcast/ or <cf/type ptp/ network configuration, OSPF packets are sent as IP multicast packets. This option changes the behavior to using old-fashioned IP broadcast packets. This may be useful as a workaround if IP multicast for some reason does not work or does not work reliably. This is a non-standard option and probably is not interoperable with other OSPF implementations. Default value is no. <tag><label id="ospf-ptp-netmask">ptp netmask <m/switch/</tag> In <cf/type ptp/ network configurations, OSPFv2 implementations should ignore received netmask field in hello packets and should send hello packets with zero netmask field on unnumbered PtP links. But some OSPFv2 implementations perform netmask checking even for PtP links. This option specifies whether real netmask will be used in hello packets on <cf/type ptp/ interfaces. You should ignore this option unless you meet some compatibility problems related to this issue. Default value is no for unnumbered PtP links, yes otherwise. <tag><label id="ospf-check-link">check link <M>switch</M></tag> If set, a hardware link state (reported by OS) is taken into consideration. When a link disappears (e.g. an ethernet cable is unplugged), neighbors are immediately considered unreachable and only the address of the iface (instead of whole network prefix) is propagated. It is possible that some hardware drivers or platforms do not implement this feature. Default value is no. <tag><label id="ospf-bfd">bfd <M>switch</M></tag> OSPF could use BFD protocol as an advisory mechanism for neighbor liveness and failure detection. If enabled, BIRD setups a BFD session for each OSPF neighbor and tracks its liveness by it. This has an advantage of an order of magnitude lower detection times in case of failure. Note that BFD protocol also has to be configured, see <ref id="bfd" name="BFD"> section for details. Default value is no. <tag><label id="ospf-ttl-security">ttl security [<m/switch/ | tx only]</tag> TTL security is a feature that protects routing protocols from remote spoofed packets by using TTL 255 instead of TTL 1 for protocol packets destined to neighbors. Because TTL is decremented when packets are forwarded, it is non-trivial to spoof packets with TTL 255 from remote locations. Note that this option would interfere with OSPF virtual links. If this option is enabled, the router will send OSPF packets with TTL 255 and drop received packets with TTL less than 255. If this option si set to <cf/tx only/, TTL 255 is used for sent packets, but is not checked for received packets. Default value is no. <tag><label id="ospf-tx-class">tx class|dscp|priority <m/num/</tag> These options specify the ToS/DiffServ/Traffic class/Priority of the outgoing OSPF packets. See <ref id="proto-tx-class" name="tx class"> common option for detailed description. <tag><label id="ospf-ecmp-weight">ecmp weight <M>num</M></tag> When ECMP (multipath) routes are allowed, this value specifies a relative weight used for nexthops going through the iface. Allowed values are 1-256. Default value is 1. <tag><label id="ospf-auth-none">authentication none</tag> No passwords are sent in OSPF packets. This is the default value. <tag><label id="ospf-auth-simple">authentication simple</tag> Every packet carries 8 bytes of password. Received packets lacking this password are ignored. This authentication mechanism is very weak. This option is not available in OSPFv3. <tag><label id="ospf-auth-cryptographic">authentication cryptographic</tag> An authentication code is appended to every packet. The specific cryptographic algorithm is selected by option <cf/algorithm/ for each key. The default cryptographic algorithm for OSPFv2 keys is Keyed-MD5 and for OSPFv3 keys is HMAC-SHA-256. Passwords are not sent open via network, so this mechanism is quite secure. Packets can still be read by an attacker. <tag><label id="ospf-pass">password "<M>text</M>"</tag> Specifies a password used for authentication. See <ref id="proto-pass" name="password"> common option for detailed description. <tag><label id="ospf-neighbors">neighbors { <m/set/ } </tag> A set of neighbors to which Hello messages on NBMA or PtMP networks are to be sent. For NBMA networks, some of them could be marked as eligible. In OSPFv3, link-local addresses should be used, using global ones is possible, but it is nonstandard and might be problematic. And definitely, link-local and global addresses should not be mixed. </descrip> <sect1>Attributes <label id="ospf-attr"> <p>OSPF defines four route attributes. Each internal route has a <cf/metric/. <p>Metric is ranging from 1 to infinity (65535). External routes use <cf/metric type 1/ or <cf/metric type 2/. A <cf/metric of type 1/ is comparable with internal <cf/metric/, a <cf/metric of type 2/ is always longer than any <cf/metric of type 1/ or any <cf/internal metric/. <cf/Internal metric/ or <cf/metric of type 1/ is stored in attribute <cf/ospf_metric1/, <cf/metric type 2/ is stored in attribute <cf/ospf_metric2/. If you specify both metrics only metric1 is used. <p>Each external route can also carry attribute <cf/ospf_tag/ which is a 32-bit integer which is used when exporting routes to other protocols; otherwise, it doesn't affect routing inside the OSPF domain at all. The fourth attribute <cf/ospf_router_id/ is a router ID of the router advertising that route / network. This attribute is read-only. Default is <cf/ospf_metric2 = 10000/ and <cf/ospf_tag = 0/. <sect1>Example <label id="ospf-exam"> <p><code> protocol ospf MyOSPF { rfc1583compat yes; tick 2; export filter { if source = RTS_BGP then { ospf_metric1 = 100; accept; } reject; }; area 0.0.0.0 { interface "eth*" { cost 11; hello 15; priority 100; retransmit 7; authentication simple; password "aaa"; }; interface "ppp*" { cost 100; authentication cryptographic; password "abc" { id 1; generate to "22-04-2003 11:00:06"; accept from "17-01-2001 12:01:05"; algorithm hmac sha384; }; password "def" { id 2; generate to "22-07-2005 17:03:21"; accept from "22-02-2001 11:34:06"; algorithm hmac sha512; }; }; interface "arc0" { cost 10; stub yes; }; interface "arc1"; }; area 120 { stub yes; networks { 172.16.1.0/24; 172.16.2.0/24 hidden; } interface "-arc0" , "arc*" { type nonbroadcast; authentication none; strict nonbroadcast yes; wait 120; poll 40; dead count 8; neighbors { 192.168.120.1 eligible; 192.168.120.2; 192.168.120.10; }; }; }; } </code> <sect>Pipe <label id="pipe"> <sect1>Introduction <label id="pipe-intro"> <p>The Pipe protocol serves as a link between two routing tables, allowing routes to be passed from a table declared as primary (i.e., the one the pipe is connected to using the <cf/table/ configuration keyword) to the secondary one (declared using <cf/peer table/) and vice versa, depending on what's allowed by the filters. Export filters control export of routes from the primary table to the secondary one, import filters control the opposite direction. <p>The Pipe protocol may work in the transparent mode mode or in the opaque mode. In the transparent mode, the Pipe protocol retransmits all routes from one table to the other table, retaining their original source and attributes. If import and export filters are set to accept, then both tables would have the same content. The transparent mode is the default mode. <p>In the opaque mode, the Pipe protocol retransmits optimal route from one table to the other table in a similar way like other protocols send and receive routes. Retransmitted route will have the source set to the Pipe protocol, which may limit access to protocol specific route attributes. This mode is mainly for compatibility, it is not suggested for new configs. The mode can be changed by <tt/mode/ option. <p>The primary use of multiple routing tables and the Pipe protocol is for policy routing, where handling of a single packet doesn't depend only on its destination address, but also on its source address, source interface, protocol type and other similar parameters. In many systems (Linux being a good example), the kernel allows to enforce routing policies by defining routing rules which choose one of several routing tables to be used for a packet according to its parameters. Setting of these rules is outside the scope of BIRD's work (on Linux, you can use the <tt/ip/ command), but you can create several routing tables in BIRD, connect them to the kernel ones, use filters to control which routes appear in which tables and also you can employ the Pipe protocol for exporting a selected subset of one table to another one. <sect1>Configuration <label id="pipe-config"> <p><descrip> <tag><label id="pipe-peer-table">peer table <m/table/</tag> Defines secondary routing table to connect to. The primary one is selected by the <cf/table/ keyword. <tag><label id="pipe-mode">mode opaque|transparent</tag> Specifies the mode for the pipe to work in. Default is transparent. </descrip> <sect1>Attributes <label id="pipe-attr"> <p>The Pipe protocol doesn't define any route attributes. <sect1>Example <label id="pipe-exam"> <p>Let's consider a router which serves as a boundary router of two different autonomous systems, each of them connected to a subset of interfaces of the router, having its own exterior connectivity and wishing to use the other AS as a backup connectivity in case of outage of its own exterior line. <p>Probably the simplest solution to this situation is to use two routing tables (we'll call them <cf/as1/ and <cf/as2/) and set up kernel routing rules, so that packets having arrived from interfaces belonging to the first AS will be routed according to <cf/as1/ and similarly for the second AS. Thus we have split our router to two logical routers, each one acting on its own routing table, having its own routing protocols on its own interfaces. In order to use the other AS's routes for backup purposes, we can pass the routes between the tables through a Pipe protocol while decreasing their preferences and correcting their BGP paths to reflect the AS boundary crossing. <code> table as1; # Define the tables table as2; protocol kernel kern1 { # Synchronize them with the kernel table as1; kernel table 1; } protocol kernel kern2 { table as2; kernel table 2; } protocol bgp bgp1 { # The outside connections table as1; local as 1; neighbor 192.168.0.1 as 1001; export all; import all; } protocol bgp bgp2 { table as2; local as 2; neighbor 10.0.0.1 as 1002; export all; import all; } protocol pipe { # The Pipe table as1; peer table as2; export filter { if net ~ [ 1.0.0.0/8+] then { # Only AS1 networks if preference>10 then preference = preference-10; if source=RTS_BGP then bgp_path.prepend(1); accept; } reject; }; import filter { if net ~ [ 2.0.0.0/8+] then { # Only AS2 networks if preference>10 then preference = preference-10; if source=RTS_BGP then bgp_path.prepend(2); accept; } reject; }; } </code> <sect>RAdv <label id="radv"> <sect1>Introduction <label id="radv-intro"> <p>The RAdv protocol is an implementation of Router Advertisements, which are used in the IPv6 stateless autoconfiguration. IPv6 routers send (in irregular time intervals or as an answer to a request) advertisement packets to connected networks. These packets contain basic information about a local network (e.g. a list of network prefixes), which allows network hosts to autoconfigure network addresses and choose a default route. BIRD implements router behavior as defined in <rfc id="4861"> and also the DNS extensions from <rfc id="6106">. <sect1>Configuration <label id="radv-config"> <p>There are several classes of definitions in RAdv configuration -- interface definitions, prefix definitions and DNS definitions: <descrip> <tag><label id="radv-iface">interface <m/pattern/ [, <m/.../] { <m/options/ }</tag> Interface definitions specify a set of interfaces on which the protocol is activated and contain interface specific options. See <ref id="proto-iface" name="interface"> common options for detailed description. <tag><label id="radv-prefix">prefix <m/prefix/ { <m/options/ }</tag> Prefix definitions allow to modify a list of advertised prefixes. By default, the advertised prefixes are the same as the network prefixes assigned to the interface. For each network prefix, the matching prefix definition is found and its options are used. If no matching prefix definition is found, the prefix is used with default options. Prefix definitions can be either global or interface-specific. The second ones are part of interface options. The prefix definition matching is done in the first-match style, when interface-specific definitions are processed before global definitions. As expected, the prefix definition is matching if the network prefix is a subnet of the prefix in prefix definition. <tag><label id="radv-rdnss">rdnss { <m/options/ }</tag> RDNSS definitions allow to specify a list of advertised recursive DNS servers together with their options. As options are seldom necessary, there is also a short variant <cf>rdnss <m/address/</cf> that just specifies one DNS server. Multiple definitions are cumulative. RDNSS definitions may also be interface-specific when used inside interface options. By default, interface uses both global and interface-specific options, but that can be changed by <cf/rdnss local/ option. dsc-iface <tag><label id="radv-dnssl">dnssl { <m/options/ }</tag> DNSSL definitions allow to specify a list of advertised DNS search domains together with their options. Like <cf/rdnss/ above, multiple definitions are cumulative, they can be used also as interface-specific options and there is a short variant <cf>dnssl <m/domain/</cf> that just specifies one DNS search domain. <tag><label id="radv-trigger">trigger <m/prefix/</tag> RAdv protocol could be configured to change its behavior based on availability of routes. When this option is used, the protocol waits in suppressed state until a <it/trigger route/ (for the specified network) is exported to the protocol, the protocol also returnsd to suppressed state if the <it/trigger route/ disappears. Note that route export depends on specified export filter, as usual. This option could be used, e.g., for handling failover in multihoming scenarios. During suppressed state, router advertisements are generated, but with some fields zeroed. Exact behavior depends on which fields are zeroed, this can be configured by <cf/sensitive/ option for appropriate fields. By default, just <cf/default lifetime/ (also called <cf/router lifetime/) is zeroed, which means hosts cannot use the router as a default router. <cf/preferred lifetime/ and <cf/valid lifetime/ could also be configured as <cf/sensitive/ for a prefix, which would cause autoconfigured IPs to be deprecated or even removed. </descrip> <p>Interface specific options: <descrip> <tag><label id="radv-iface-max-ra-interval">max ra interval <m/expr/</tag> Unsolicited router advertisements are sent in irregular time intervals. This option specifies the maximum length of these intervals, in seconds. Valid values are 4-1800. Default: 600 <tag><label id="radv-iface-min-ra-interval">min ra interval <m/expr/</tag> This option specifies the minimum length of that intervals, in seconds. Must be at least 3 and at most 3/4 * <cf/max ra interval/. Default: about 1/3 * <cf/max ra interval/. <tag><label id="radv-iface-min-delay">min delay <m/expr/</tag> The minimum delay between two consecutive router advertisements, in seconds. Default: 3 <tag><label id="radv-iface-managed">managed <m/switch/</tag> This option specifies whether hosts should use DHCPv6 for IP address configuration. Default: no <tag><label id="radv-iface-other-config">other config <m/switch/</tag> This option specifies whether hosts should use DHCPv6 to receive other configuration information. Default: no <tag><label id="radv-iface-link-mtu">link mtu <m/expr/</tag> This option specifies which value of MTU should be used by hosts. 0 means unspecified. Default: 0 <tag><label id="radv-iface-reachable-time">reachable time <m/expr/</tag> This option specifies the time (in milliseconds) how long hosts should assume a neighbor is reachable (from the last confirmation). Maximum is 3600000, 0 means unspecified. Default 0. <tag><label id="radv-iface-retrans-timer">retrans timer <m/expr/</tag> This option specifies the time (in milliseconds) how long hosts should wait before retransmitting Neighbor Solicitation messages. 0 means unspecified. Default 0. <tag><label id="radv-iface-current-hop-limit">current hop limit <m/expr/</tag> This option specifies which value of Hop Limit should be used by hosts. Valid values are 0-255, 0 means unspecified. Default: 64 <tag><label id="radv-iface-default-lifetime">default lifetime <m/expr/ [sensitive <m/switch/]</tag> This option specifies the time (in seconds) how long (after the receipt of RA) hosts may use the router as a default router. 0 means do not use as a default router. For <cf/sensitive/ option, see <ref id="radv-trigger" name="trigger">. Default: 3 * <cf/max ra interval/, <cf/sensitive/ yes. <tag><label id="radv-iface-default-preference-low">default preference low|medium|high</tag> This option specifies the Default Router Preference value to advertise to hosts. Default: medium. <tag><label id="radv-iface-rdnss-local">rdnss local <m/switch/</tag> Use only local (interface-specific) RDNSS definitions for this interface. Otherwise, both global and local definitions are used. Could also be used to disable RDNSS for given interface if no local definitons are specified. Default: no. <tag><label id="radv-iface-dnssl-local">dnssl local <m/switch/</tag> Use only local DNSSL definitions for this interface. See <cf/rdnss local/ option above. Default: no. </descrip> <p>Prefix specific options <descrip> <tag><label id="radv-prefix-skip">skip <m/switch/</tag> This option allows to specify that given prefix should not be advertised. This is useful for making exceptions from a default policy of advertising all prefixes. Note that for withdrawing an already advertised prefix it is more useful to advertise it with zero valid lifetime. Default: no <tag><label id="radv-prefix-onlink">onlink <m/switch/</tag> This option specifies whether hosts may use the advertised prefix for onlink determination. Default: yes <tag><label id="radv-prefix-autonomous">autonomous <m/switch/</tag> This option specifies whether hosts may use the advertised prefix for stateless autoconfiguration. Default: yes <tag><label id="radv-prefix-valid-lifetime">valid lifetime <m/expr/ [sensitive <m/switch/]</tag> This option specifies the time (in seconds) how long (after the receipt of RA) the prefix information is valid, i.e., autoconfigured IP addresses can be assigned and hosts with that IP addresses are considered directly reachable. 0 means the prefix is no longer valid. For <cf/sensitive/ option, see <ref id="radv-trigger" name="trigger">. Default: 86400 (1 day), <cf/sensitive/ no. <tag><label id="radv-prefix-preferred-lifetime">preferred lifetime <m/expr/ [sensitive <m/switch/]</tag> This option specifies the time (in seconds) how long (after the receipt of RA) IP addresses generated from the prefix using stateless autoconfiguration remain preferred. For <cf/sensitive/ option, see <ref id="radv-trigger" name="trigger">. Default: 14400 (4 hours), <cf/sensitive/ no. </descrip> <p>RDNSS specific options: <descrip> <tag><label id="radv-rdnss-ns">ns <m/address/</tag> This option specifies one recursive DNS server. Can be used multiple times for multiple servers. It is mandatory to have at least one <cf/ns/ option in <cf/rdnss/ definition. <tag><label id="radv-rdnss-lifetime">lifetime [mult] <m/expr/</tag> This option specifies the time how long the RDNSS information may be used by clients after the receipt of RA. It is expressed either in seconds or (when <cf/mult/ is used) in multiples of <cf/max ra interval/. Note that RDNSS information is also invalidated when <cf/default lifetime/ expires. 0 means these addresses are no longer valid DNS servers. Default: 3 * <cf/max ra interval/. </descrip> <p>DNSSL specific options: <descrip> <tag><label id="radv-dnssl-domain">domain <m/address/</tag> This option specifies one DNS search domain. Can be used multiple times for multiple domains. It is mandatory to have at least one <cf/domain/ option in <cf/dnssl/ definition. <tag><label id="radv-dnssl-lifetime">lifetime [mult] <m/expr/</tag> This option specifies the time how long the DNSSL information may be used by clients after the receipt of RA. Details are the same as for RDNSS <cf/lifetime/ option above. Default: 3 * <cf/max ra interval/. </descrip> <sect1>Example <label id="radv-exam"> <p><code> protocol radv { interface "eth2" { max ra interval 5; # Fast failover with more routers managed yes; # Using DHCPv6 on eth2 prefix ::/0 { autonomous off; # So do not autoconfigure any IP }; }; interface "eth*"; # No need for any other options prefix 2001:0DB8:1234::/48 { preferred lifetime 0; # Deprecated address range }; prefix 2001:0DB8:2000::/48 { autonomous off; # Do not autoconfigure }; rdnss 2001:0DB8:1234::10; # Short form of RDNSS rdnss { lifetime mult 10; ns 2001:0DB8:1234::11; ns 2001:0DB8:1234::12; }; dnssl { lifetime 3600; domain "abc.com"; domain "xyz.com"; }; } </code> <sect>RIP <label id="rip"> <sect1>Introduction <label id="rip-intro"> <p>The RIP protocol (also sometimes called Rest In Pieces) is a simple protocol, where each router broadcasts (to all its neighbors) distances to all networks it can reach. When a router hears distance to another network, it increments it and broadcasts it back. Broadcasts are done in regular intervals. Therefore, if some network goes unreachable, routers keep telling each other that its distance is the original distance plus 1 (actually, plus interface metric, which is usually one). After some time, the distance reaches infinity (that's 15 in RIP) and all routers know that network is unreachable. RIP tries to minimize situations where counting to infinity is necessary, because it is slow. Due to infinity being 16, you can't use RIP on networks where maximal distance is higher than 15 hosts. <p>BIRD supports RIPv1 (<rfc id="1058">), RIPv2 (<rfc id="2453">), RIPng (<rfc id="2080">), and RIP cryptographic authentication (<rfc id="4822">). <p>RIP is a very simple protocol, and it has a lot of shortcomings. Slow convergence, big network load and inability to handle larger networks makes it pretty much obsolete. It is still usable on very small networks. <sect1>Configuration <label id="rip-config"> <p>RIP configuration consists mainly of common protocol options and interface definitions, most RIP options are interface specific. <code> protocol rip [<name>] { infinity <number>; ecmp <switch> [limit <number>]; interface <interface pattern> { metric <number>; mode multicast|broadcast; passive <switch>; address <ip>; port <number>; version 1|2; split horizon <switch>; poison reverse <switch>; check zero <switch>; update time <number>; timeout time <number>; garbage time <number>; ecmp weight <number>; ttl security <switch>; | tx only; tx class|dscp <number>; tx priority <number>; rx buffer <number>; tx length <number>; check link <switch>; authentication none|plaintext|cryptographic; password "<text>"; password "<text>" { id <num>; generate from "<date>"; generate to "<date>"; accept from "<date>"; accept to "<date>"; from "<date>"; to "<date>"; algorithm ( keyed md5 | keyed sha1 | hmac sha1 | hmac sha256 | hmac sha384 | hmac sha512 ); }; }; } </code> <descrip> <tag><label id="rip-infinity">infinity <M>number</M></tag> Selects the distance of infinity. Bigger values will make protocol convergence even slower. The default value is 16. <tag><label id="rip-ecmp">ecmp <M>switch</M> [limit <M>number</M>]</tag> This option specifies whether RIP is allowed to generate ECMP (equal-cost multipath) routes. Such routes are used when there are several directions to the destination, each with the same (computed) cost. This option also allows to specify a limit on maximum number of nexthops in one route. By default, ECMP is disabled. If enabled, default value of the limit is 16. <tag><label id="rip-iface">interface <m/pattern/ [, <m/.../] { <m/options/ }</tag> Interface definitions specify a set of interfaces on which the protocol is activated and contain interface specific options. See <ref id="proto-iface" name="interface"> common options for detailed description. </descrip> <p>Interface specific options: <descrip> <tag><label id="rip-iface-metric">metric <m/num/</tag> This option specifies the metric of the interface. When a route is received from the interface, its metric is increased by this value before further processing. Valid values are 1-255, but values higher than infinity has no further meaning. Default: 1. <tag><label id="rip-iface-mode">mode multicast|broadcast</tag> This option selects the mode for RIP to use on the interface. The default is multicast mode for RIPv2 and broadcast mode for RIPv1. RIPng always uses the multicast mode. <tag><label id="rip-iface-passive">passive <m/switch/</tag> Passive interfaces receive routing updates but do not transmit any messages. Default: no. <tag><label id="rip-iface-address">address <m/ip/</tag> This option specifies a destination address used for multicast or broadcast messages, the default is the official RIP (224.0.0.9) or RIPng (ff02::9) multicast address, or an appropriate broadcast address in the broadcast mode. <tag><label id="rip-iface-port">port <m/number/</tag> This option selects an UDP port to operate on, the default is the official RIP (520) or RIPng (521) port. <tag><label id="rip-iface-version">version 1|2</tag> This option selects the version of RIP used on the interface. For RIPv1, automatic subnet aggregation is not implemented, only classful network routes and host routes are propagated. Note that BIRD allows RIPv1 to be configured with features that are defined for RIPv2 only, like authentication or using multicast sockets. The default is RIPv2 for IPv4 RIP, the option is not supported for RIPng, as no further versions are defined. <tag><label id="rip-iface-version-only">version only <m/switch/</tag> Regardless of RIP version configured for the interface, BIRD accepts incoming packets of any RIP version. This option restrict accepted packets to the configured version. Default: no. <tag><label id="rip-iface-split-horizon">split horizon <m/switch/</tag> Split horizon is a scheme for preventing routing loops. When split horizon is active, routes are not regularly propagated back to the interface from which they were received. They are either not propagated back at all (plain split horizon) or propagated back with an infinity metric (split horizon with poisoned reverse). Therefore, other routers on the interface will not consider the router as a part of an independent path to the destination of the route. Default: yes. <tag><label id="rip-iface-poison-reverse">poison reverse <m/switch/</tag> When split horizon is active, this option specifies whether the poisoned reverse variant (propagating routes back with an infinity metric) is used. The poisoned reverse has some advantages in faster convergence, but uses more network traffic. Default: yes. <tag><label id="rip-iface-check-zero">check zero <m/switch/</tag> Received RIPv1 packets with non-zero values in reserved fields should be discarded. This option specifies whether the check is performed or such packets are just processed as usual. Default: yes. <tag><label id="rip-iface-update-time">update time <m/number/</tag> Specifies the number of seconds between periodic updates. A lower number will mean faster convergence but bigger network load. Default: 30. <tag><label id="rip-iface-timeout-time">timeout time <m/number/</tag> Specifies the time interval (in seconds) between the last received route announcement and the route expiration. After that, the network is considered unreachable, but still is propagated with infinity distance. Default: 180. <tag><label id="rip-iface-garbage-time">garbage time <m/number/</tag> Specifies the time interval (in seconds) between the route expiration and the removal of the unreachable network entry. The garbage interval, when a route with infinity metric is propagated, is used for both internal (after expiration) and external (after withdrawal) routes. Default: 120. <tag><label id="rip-iface-ecmp-weight">ecmp weight <m/number/</tag> When ECMP (multipath) routes are allowed, this value specifies a relative weight used for nexthops going through the iface. Valid values are 1-256. Default value is 1. <tag><label id="rip-iface-auth">authentication none|plaintext|cryptographic</tag> Selects authentication method to be used. <cf/none/ means that packets are not authenticated at all, <cf/plaintext/ means that a plaintext password is embedded into each packet, and <cf/cryptographic/ means that packets are authenticated using some cryptographic hash function selected by option <cf/algorithm/ for each key. The default cryptographic algorithm for RIP keys is Keyed-MD5. If you set authentication to not-none, it is a good idea to add <cf>password</cf> section. Default: none. <tag><label id="rip-iface-pass">password "<m/text/"</tag> Specifies a password used for authentication. See <ref id="proto-pass" name="password"> common option for detailed description. <tag><label id="rip-iface-ttl-security">ttl security [<m/switch/ | tx only]</tag> TTL security is a feature that protects routing protocols from remote spoofed packets by using TTL 255 instead of TTL 1 for protocol packets destined to neighbors. Because TTL is decremented when packets are forwarded, it is non-trivial to spoof packets with TTL 255 from remote locations. If this option is enabled, the router will send RIP packets with TTL 255 and drop received packets with TTL less than 255. If this option si set to <cf/tx only/, TTL 255 is used for sent packets, but is not checked for received packets. Such setting does not offer protection, but offers compatibility with neighbors regardless of whether they use ttl security. For RIPng, TTL security is a standard behavior (required by <rfc id="2080">) and therefore default value is yes. For IPv4 RIP, default value is no. <tag><label id="rip-iface-tx-class">tx class|dscp|priority <m/number/</tag> These options specify the ToS/DiffServ/Traffic class/Priority of the outgoing RIP packets. See <ref id="proto-tx-class" name="tx class"> common option for detailed description. <tag><label id="rip-iface-rx-buffer">rx buffer <m/number/</tag> This option specifies the size of buffers used for packet processing. The buffer size should be bigger than maximal size of received packets. The default value is 532 for IPv4 RIP and interface MTU value for RIPng. <tag><label id="rip-iface-tx-length">tx length <m/number/</tag> This option specifies the maximum length of generated RIP packets. To avoid IP fragmentation, it should not exceed the interface MTU value. The default value is 532 for IPv4 RIP and interface MTU value for RIPng. <tag><label id="rip-iface-check-link">check link <m/switch/</tag> If set, the hardware link state (as reported by OS) is taken into consideration. When the link disappears (e.g. an ethernet cable is unplugged), neighbors are immediately considered unreachable and all routes received from them are withdrawn. It is possible that some hardware drivers or platforms do not implement this feature. Default: no. </descrip> <sect1>Attributes <label id="rip-attr"> <p>RIP defines two route attributes: <descrip> <tag><label id="rta-rip-metric">int rip_metric/</tag> RIP metric of the route (ranging from 0 to <cf/infinity/). When routes from different RIP instances are available and all of them have the same preference, BIRD prefers the route with lowest <cf/rip_metric/. When a non-RIP route is exported to RIP, the default metric is 1. <tag><label id="rta-rip-tag">int rip_tag/</tag> RIP route tag: a 16-bit number which can be used to carry additional information with the route (for example, an originating AS number in case of external routes). When a non-RIP route is exported to RIP, the default tag is 0. </descrip> <sect1>Example <label id="rip-exam"> <p><code> protocol rip { debug all; port 1520; period 12; garbage time 60; interface "eth0" { metric 3; mode multicast; }; interface "eth*" { metric 2; mode broadcast; }; authentication cryptographic; password "secret-shared-key" { algorithm hmac sha256; }; import filter { print "importing"; accept; }; export filter { print "exporting"; accept; }; } </code> <sect>Static <label id="static"> <p>The Static protocol doesn't communicate with other routers in the network, but instead it allows you to define routes manually. This is often used for specifying how to forward packets to parts of the network which don't use dynamic routing at all and also for defining sink routes (i.e., those telling to return packets as undeliverable if they are in your IP block, you don't have any specific destination for them and you don't want to send them out through the default route to prevent routing loops). <p>There are five types of static routes: `classical' routes telling to forward packets to a neighboring router, multipath routes specifying several (possibly weighted) neighboring routers, device routes specifying forwarding to hosts on a directly connected network, recursive routes computing their nexthops by doing route table lookups for a given IP, and special routes (sink, blackhole etc.) which specify a special action to be done instead of forwarding the packet. <p>When the particular destination is not available (the interface is down or the next hop of the route is not a neighbor at the moment), Static just uninstalls the route from the table it is connected to and adds it again as soon as the destination becomes adjacent again. <p>There are three classes of definitions in Static protocol configuration -- global options, static route definitions, and per-route options. Usually, the definition of the protocol contains mainly a list of static routes. <p>Global options: <descrip> <tag><label id="static-check-link">check link <m/switch/</tag> If set, hardware link states of network interfaces are taken into consideration. When link disappears (e.g. ethernet cable is unplugged), static routes directing to that interface are removed. It is possible that some hardware drivers or platforms do not implement this feature. Default: off. <tag><label id="static-igp-table">igp table <m/name/</tag> Specifies a table that is used for route table lookups of recursive routes. Default: the same table as the protocol is connected to. </descrip> <p>Route definitions (each may also contain a block of per-route options): <descrip> <tag><label id="static-route-via-ip">route <m/prefix/ via <m/ip/</tag> Static route through a neighboring router. For link-local next hops, interface can be specified as a part of the address (e.g., <cf/via fe80::1234%eth0/). <tag><label id="static-route-via-mpath">route <m/prefix/ multipath via <m/ip/ [weight <m/num/] [bfd <m/switch/] [via <m/.../]</tag> Static multipath route. Contains several nexthops (gateways), possibly with their weights. <tag><label id="static-route-via-iface">route <m/prefix/ via <m/"interface"/</tag> Static device route through an interface to hosts on a directly connected network. <tag><label id="static-route-recursive">route <m/prefix/ recursive <m/ip/</tag> Static recursive route, its nexthop depends on a route table lookup for given IP address. <tag><label id="static-route-drop">route <m/prefix/ blackhole|unreachable|prohibit</tag> Special routes specifying to silently drop the packet, return it as unreachable or return it as administratively prohibited. First two targets are also known as <cf/drop/ and <cf/reject/. </descrip> <p>Per-route options: <descrip> <tag><label id="static-route-bfd">bfd <m/switch/</tag> The Static protocol could use BFD protocol for next hop liveness detection. If enabled, a BFD session to the route next hop is created and the static route is BFD-controlled -- the static route is announced only if the next hop liveness is confirmed by BFD. If the BFD session fails, the static route is removed. Note that this is a bit different compared to other protocols, which may use BFD as an advisory mechanism for fast failure detection but ignores it if a BFD session is not even established. This option can be used for static routes with a direct next hop, or also for for individual next hops in a static multipath route (see above). Note that BFD protocol also has to be configured, see <ref id="bfd" name="BFD"> section for details. Default value is no. <tag><label id="static-route-filter"><m/filter expression/</tag> This is a special option that allows filter expressions to be configured on per-route basis. Can be used multiple times. These expressions are evaluated when the route is originated, similarly to the import filter of the static protocol. This is especially useful for configuring route attributes, e.g., <cf/ospf_metric1 = 100;/ for a route that will be exported to the OSPF protocol. </descrip> <p>Static routes have no specific attributes. <p>Example static config might look like this: <p><code> protocol static { table testable; # Connect to a non-default routing table check link; # Advertise routes only if link is up route 0.0.0.0/0 via 198.51.100.130; # Default route route 10.0.0.0/8 multipath # Multipath route via 198.51.100.10 weight 2 via 198.51.100.20 bfd # BFD-controlled next hop via 192.0.2.1; route 203.0.113.0/24 unreachable; # Sink route route 10.2.0.0/24 via "arc0"; # Secondary network route 192.168.10.0/24 via 198.51.100.100 { ospf_metric1 = 20; # Set extended attribute } route 192.168.10.0/24 via 198.51.100.100 { ospf_metric2 = 100; # Set extended attribute ospf_tag = 2; # Set extended attribute bfd; # BFD-controlled route } } </code> <chapt>Conclusions <label id="conclusion"> <sect>Future work <label id="future-work"> <p>Although BIRD supports all the commonly used routing protocols, there are still some features which would surely deserve to be implemented in future versions of BIRD: <itemize> <item>Opaque LSA's <item>Route aggregation and flap dampening <item>Multipath routes <item>Multicast routing protocols <item>Ports to other systems </itemize> <sect>Getting more help <label id="help"> <p>If you use BIRD, you're welcome to join the bird-users mailing list (<HTMLURL URL="mailto:bird-users@network.cz" name="bird-users@network.cz">) where you can share your experiences with the other users and consult your problems with the authors. To subscribe to the list, visit <HTMLURL URL="http://bird.network.cz/?m_list" name="http://bird.network.cz/?m_list">. The home page of BIRD can be found at <HTMLURL URL="http://bird.network.cz/" name="http://bird.network.cz/">. <p>BIRD is a relatively young system and it probably contains some bugs. You can report any problems to the bird-users list and the authors will be glad to solve them, but before you do so, please make sure you have read the available documentation and that you are running the latest version (available at <HTMLURL URL="ftp://bird.network.cz/pub/bird" name="bird.network.cz:/pub/bird">). (Of course, a patch which fixes the bug is always welcome as an attachment.) <p>If you want to understand what is going inside, Internet standards are a good and interesting reading. You can get them from <HTMLURL URL="ftp://ftp.rfc-editor.org/" name="ftp.rfc-editor.org"> (or a nicely sorted version from <HTMLURL URL="ftp://atrey.karlin.mff.cuni.cz/pub/rfc" name="atrey.karlin.mff.cuni.cz:/pub/rfc">). <p><it/Good luck!/ </book> <!-- LocalWords: GPL IPv GateD BGPv RIPv OSPFv Linux sgml html dvi sgmltools Pavel LocalWords: linuxdoc dtd descrip config conf syslog stderr auth ospf bgp Mbps LocalWords: router's eval expr num birdc ctl UNIX if's enums bool int ip GCC LocalWords: len ipaddress pxlen netmask enum bgppath bgpmask clist gw md eth LocalWords: RTS printn quitbird iBGP AS'es eBGP RFC multiprotocol IGP Machek LocalWords: EGP misconfigurations keepalive pref aggr aggregator BIRD's RTC LocalWords: OS'es AS's multicast nolisten misconfigured UID blackhole MRTD MTU LocalWords: uninstalls ethernets IP binutils ANYCAST anycast dest RTD ICMP rfc LocalWords: compat multicasts nonbroadcast pointopoint loopback sym stats LocalWords: Perl SIGHUP dd mm yy HH MM SS EXT IA UNICAST multihop Discriminator txt LocalWords: proto wildcard Ondrej Filip --> ������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������bird-1.6.3/doc/old/���������������������������������������������������������������������������������0000755�0001032�0000144�00000000000�13027054563�012755� 5����������������������������������������������������������������������������������������������������ustar �feela���������������������������users������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������bird-1.6.3/doc/old/status.tex�����������������������������������������������������������������������0000644�0001032�0000144�00000005477�13027054563�015037� 0����������������������������������������������������������������������������������������������������ustar �feela���������������������������users������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������\input mjmac \hsize=7truein \vsize=9.5truein \language=\czech \chyph \centerline{\Big Projekt BIRD} \bigskip \centerline{\Big\ss (Basic Internet Routing Daemon)} \bigskip \centerline{\large\it zpráva o~stavu projektu ke~dni 10. 11. 1999} \vskip 0.5in \leftline{\Large Obsazení} \noindent\halign{\quad \hfil # & \quad # \hfil \cr Vedoucí projektu: & RNDr. Libor Forst \cr \noalign{\medskip} Úèastníci: & Ondøej Filip \cr & Pavel Machek \cr & Martin Mare¹ \cr } \bigskip \leftline{\Large Specifikace} Cílem projektu je vyvinout program umo¾òující dynamický routing internetovských protokolù (IPv4 a IPv6) pro operaèní systémy kompatibilní s~UNIXem (zejména pak pro Linux). Tento program komunikuje s~ostatními routery v~síti (respektive její èásti, na ní¾ se dynamický routing vztahuje) prostøednictvím standardních protokolù (RIPv2, OSPFv2, BGP4), vymìòuje si s~nimi informace o~topologii sítì a jejích dynamických zmìnách a podle takto zji¹tìné topologie nastavuje routovací tabulky jádra OS. Program dále zaji¹»uje distribuci routovacích informací mezi jednotlivými (jinak na sobì nazávislými) protokoly, pøièem¾ tyto informace umo¾òuje filtrovat podle pravidel specifikovaných v~jednoduchém programovacím jazyku, èím¾ lze mimo jiné realizovat policy-based routing, který je jinak dostupný pouze v~drahých komerèních routerech. Projekt si rovnì¾ klade za cíl vyu¾ít nejnovìj¹ích vymo¾eností moderních UNIXových OS, jako jsou vícenásobné routovací tabulky, netlink apod. Router bude mo¾no za bìhu ovládat prostøednictvím øídících pøíkazù pøedávaných po lokálním socketu. To zahrnuje výpis stavových informací celého systému (routovacích tabulek, topologických map protokolu OSPF, atributových tabulek BGP a jiných údajù nezbytných pro správce sítì) a zejména zmìnu konfigurace bez nutnosti restartu protokolù zmìnami nedotèených. \medskip \leftline{\Large Stav projektu} Po ztrátì jednoho z~èlenù týmu pokraèuje vývoj ponìkud pomalej¹ím tempem ne¾ se pùvodnì oèekávalo, nicménì zadání projektu hodláme splnit v~celém rozsahu a projekt bìhem tohoto ¹kolního roku dokonèit. V~souèasné dobì chybí zejména dokumentace (její nynìj¹í podoba se omezuje výhradnì na~bohaté komentáøe ve~zdrojových textech) a podpora protokolu BGP. \medskip \noindent Stav jednotlivých èástí projektu: \medskip \halign{# \hfil & \qquad \hfil#\cr Building system & 100\% \cr Jádro routeru & 90\% \cr Správa datových struktur & 80\% \cr Podpora IPv4 & 100\% \cr Podpora IPv6 & 70\% \cr Interface na Linux 2.0 & 100\% \cr Interface na Linux 2.2 & 100\% \cr Interface na FreeBSD & 20\% \cr Protokol RIP & 90\% \cr Protokol OSPF pro IPv4 & 40\% \cr Protokol OSPF pro IPv6 & 10\% \cr Protokol BGP & 0\% \cr Interpreter filtrù & 70\% \cr Parser konfigurace & 70\% \cr Dálkové ovládání & 20\% \cr Dokumentace & 0\% \cr Online help & 0\% \cr } \bye �������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������bird-1.6.3/doc/old/banner.tex�����������������������������������������������������������������������0000644�0001032�0000144�00000002146�13027054563�014747� 0����������������������������������������������������������������������������������������������������ustar �feela���������������������������users������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������\input mjmac \language=\czech \chyph \nopagenumbers \centerline{\Big Projekt BIRD} \bigskip \centerline{\Big\ss (Basic Internet Routing Daemon)} \vskip 1in \large\fixfont \parindent=0pt \halign{\quad \hfil # & \quad # \hfil \cr Vedoucí projektu: & RNDr. Libor Forst \cr \noalign{\medskip} Úèastníci: & Leo¹ Bitto \cr & Ondøej Filip \cr & Pavel Machek \cr & Martin Mare¹ \cr & {\I (tímto je projekt obsazen)} \cr \noalign{\medskip} Cíl projektu: & \vtop{\hsize=0.6\hsize Cílem projektu je vyvinout kompletní podporu dynamického routingu Internetovských protokolù (IP a IPv6) pro operaèní systémy kompatibilní s~UNIXem, zejména pak pro Linux. Základní rysy programu: \itemize\ibull \:Podpora pou¾ití obou verzí IP souèasnì na~té¾e síti. \:Komunikace s~okolními routery prostøednictvím protokolù RIPv2, OSPFv2 a BGP4. \:Filtrace routovacích tabulek. \:Mo¾nost re-exportu informací získaných jedním protokolem do~protokolù jiných. \:Vyu¾ití vymo¾eností Linuxového jádra (vícenásobné routovací tabulky, netlink apod.). \:Dynamická rekonfigurovatelnost za bìhu. \:TOS-based routing. \endlist }\cr } \bye ��������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������bird-1.6.3/doc/prog.out�����������������������������������������������������������������������������0000644�0001032�0000144�00000005775�13027054672�013716� 0����������������������������������������������������������������������������������������������������ustar �feela���������������������������users������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������\BOOKMARK [0][-]{chapter.1}{BIRD Design}{}% 1 \BOOKMARK [1][-]{section.1.1}{Introduction}{chapter.1}% 2 \BOOKMARK [1][-]{section.1.2}{Design goals}{chapter.1}% 3 \BOOKMARK [1][-]{section.1.3}{Architecture}{chapter.1}% 4 \BOOKMARK [1][-]{section.1.4}{Implementation}{chapter.1}% 5 \BOOKMARK [0][-]{chapter.2}{Core}{}% 6 \BOOKMARK [1][-]{section.2.1}{Forwarding Information Base}{chapter.2}% 7 \BOOKMARK [1][-]{section.2.2}{Routing tables}{chapter.2}% 8 \BOOKMARK [1][-]{section.2.3}{Route attribute cache}{chapter.2}% 9 \BOOKMARK [1][-]{section.2.4}{Routing protocols}{chapter.2}% 10 \BOOKMARK [1][-]{section.2.5}{Graceful restart recovery}{chapter.2}% 11 \BOOKMARK [1][-]{section.2.6}{Protocol hooks}{chapter.2}% 12 \BOOKMARK [1][-]{section.2.7}{Interfaces}{chapter.2}% 13 \BOOKMARK [1][-]{section.2.8}{Neighbor cache}{chapter.2}% 14 \BOOKMARK [1][-]{section.2.9}{Command line interface}{chapter.2}% 15 \BOOKMARK [1][-]{section.2.10}{Object locks}{chapter.2}% 16 \BOOKMARK [0][-]{chapter.3}{Configuration}{}% 17 \BOOKMARK [1][-]{section.3.1}{Configuration manager}{chapter.3}% 18 \BOOKMARK [1][-]{section.3.2}{Lexical analyzer}{chapter.3}% 19 \BOOKMARK [1][-]{section.3.3}{Parser}{chapter.3}% 20 \BOOKMARK [0][-]{chapter.4}{Filters}{}% 21 \BOOKMARK [1][-]{section.4.1}{Filters}{chapter.4}% 22 \BOOKMARK [1][-]{section.4.2}{Trie for prefix sets}{chapter.4}% 23 \BOOKMARK [0][-]{chapter.5}{Protocols}{}% 24 \BOOKMARK [1][-]{section.5.1}{The Babel protocol}{chapter.5}% 25 \BOOKMARK [1][-]{section.5.2}{Bidirectional Forwarding Detection}{chapter.5}% 26 \BOOKMARK [1][-]{section.5.3}{Border Gateway Protocol}{chapter.5}% 27 \BOOKMARK [1][-]{section.5.4}{Open Shortest Path First \(OSPF\)}{chapter.5}% 28 \BOOKMARK [1][-]{section.5.5}{Pipe}{chapter.5}% 29 \BOOKMARK [1][-]{section.5.6}{Routing Information Protocol \(RIP\)}{chapter.5}% 30 \BOOKMARK [1][-]{section.5.7}{Router Advertisements}{chapter.5}% 31 \BOOKMARK [1][-]{section.5.8}{Static}{chapter.5}% 32 \BOOKMARK [1][-]{section.5.9}{Direct}{chapter.5}% 33 \BOOKMARK [0][-]{chapter.6}{System dependent parts}{}% 34 \BOOKMARK [1][-]{section.6.1}{Introduction}{chapter.6}% 35 \BOOKMARK [1][-]{section.6.2}{Logging}{chapter.6}% 36 \BOOKMARK [1][-]{section.6.3}{Kernel synchronization}{chapter.6}% 37 \BOOKMARK [0][-]{chapter.7}{Library functions}{}% 38 \BOOKMARK [1][-]{section.7.1}{IP addresses}{chapter.7}% 39 \BOOKMARK [1][-]{section.7.2}{Linked lists}{chapter.7}% 40 \BOOKMARK [1][-]{section.7.3}{Miscellaneous functions.}{chapter.7}% 41 \BOOKMARK [1][-]{section.7.4}{Message authentication codes}{chapter.7}% 42 \BOOKMARK [0][-]{chapter.8}{Resources}{}% 43 \BOOKMARK [1][-]{section.8.1}{Introduction}{chapter.8}% 44 \BOOKMARK [1][-]{section.8.2}{Resource pools}{chapter.8}% 45 \BOOKMARK [1][-]{section.8.3}{Memory blocks}{chapter.8}% 46 \BOOKMARK [1][-]{section.8.4}{Linear memory pools}{chapter.8}% 47 \BOOKMARK [1][-]{section.8.5}{Slabs}{chapter.8}% 48 \BOOKMARK [1][-]{section.8.6}{Events}{chapter.8}% 49 \BOOKMARK [1][-]{section.8.7}{Timers}{chapter.8}% 50 \BOOKMARK [1][-]{section.8.8}{Sockets}{chapter.8}% 51 ���bird-1.6.3/doc/slt2001/�����������������������������������������������������������������������������0000755�0001032�0000144�00000000000�13027054563�013304� 5����������������������������������������������������������������������������������������������������ustar �feela���������������������������users������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������bird-1.6.3/doc/slt2001/slt.tex����������������������������������������������������������������������0000644�0001032�0000144�00000032234�13027054563�014634� 0����������������������������������������������������������������������������������������������������ustar �feela���������������������������users������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������\magnification=\magstep1 \input epsf.tex \input mjmac.tex \language=\czech \chyph \hsize=160truemm % A4 with 25mm margins \vsize=247truemm \parindent=2em \nopagenumbers \def\hdr#1{\medskip\leftline{\bf #1}\smallskip} \def\\{\hfil\break} \def\BIRD{{\sc Bird}} \def\inititemize{\vskip 1pt\begingroup \parskip=1pt plus 0.3pt minus 0.1pt \advance\leftskip by 3em \advance\rightskip by 3em \parindent=0pt } %%% Úvod a historie projektu \hdr{Na poèátku bylo vejce aneb Úvodem} \noindent Internet i UNIX jsou na svìtì ji¾ pìkných pár pátkù. Poèítaèe pracující pod nepøeberným mno¾stvím unixovských systémù od nepamìti fungují jako internetové po¹tovní servery, name-servery a men¹í routery. Skoro by se zdálo, ¾e si tyto dva svìty u¾ nemají co nového øíci. V~posledních letech ov¹em výraznì vzrostl výkon bì¾ných PC-èek a objevily se pro nì karty podporující nejrùznìj¹í sí»ové technologie, a~tak se tyto poèítaèe staly vhodnými kandidáty i~pro funkci routerù. Na~mnoha místech tak star¹í PC-èko s~volnì ¹iøitelným softwarem pøedstihlo svého star¹ího a dra¾¹ího komerèního sourozence. Aèkoliv podpora routingu, firewallingu a inteligentní queue management v~jádrech tìchto~OS (a~zejména Linuxu) je ji¾ velice vyspìlá, je¹tì nedávno byly notnì zanedbávány protokoly pro dynamický routing, tradièní unixovskou koncepcí umístìné do~u¾ivatelského prostoru v~podobì routovacích daemonù. Tento nedostatek se pokou¹ela mezi jinými napravit také skupina nad¹encù na~pra¾ské Matematicko-fyzikální fakultì UK, která se rozhodla jako svùj studijní projekt vytvoøit nového routovacího daemona, který by se stal nìèím víc ne¾ jen dùstojným konkurentem komerèních routerù -- nejen kopíroval u¾ známá øe¹ení, ale také pøispìl nìèím novým; na~jedné stranì být stabilním a efektivním programem pro praxi, na~stranì druhé ov¹em i~laboratoøí pro snadné experimentování s~novými my¹lenkami. A~tak se narodil projekt {\it BIRD Internet Routing Daemon} (zkrácenì \BIRD\footnote{$^0$}{Projekt si samozøejmì vyslou¾il nejrùznìj¹í pøezdívky -- od Ptáèete a¾ po~Ptákovinu.}). Pùvodní plány byly smìlé a rozhodné: Vytvoøit nejlep¹ího routovacího daemona na svìtì, který by fungoval na~v¹ech platformách, vy¾adoval minimum strojového èasu a pamìti, podporoval v¹echny routovací protokoly atd., zkrátka sen, jaký má být. Pøeskoème nyní dva roky vývoje\footnote{$^1$}{bìhem nich¾ z~nìkterých po¾adavkù samozøejmì se¹lo -- napøíklad logem projektu se nakonec nestal ptáèek nesoucí v~zobáèku snítku byliny øeèené routa \dots} a podívejme se, co z~toho vze¹lo. %%% Svìt routingu %% v~ti¹tìné verzi pøeskoèíme %%% Co BIRD doká¾e \hdr{Kdy¾ ptáèka lapají, pìknì mu zpívají aneb Feature list} \noindent \BIRD\ dostal od svých sudièek do~vínku mnohé dary: \def\icirc{\raise0.2ex\hbox{$\circ$}} % Signs frequently used for \itemize \itemize\ibull \:Schopnost komunikovat protokoly IPv4 i IPv6. \:Podporu v¹ech základních routovacích protokolù: \itemize\icirc \:RIPv2 (Routing Information Protocol, viz RFC 1723 a 2080)\\ Urèen pro interní routing, dnes významu spí¹e historického.\\ Algoritmus: distance vector (Bellman-Ford).\\ Velmi pomalá konvergence, pou¾itelý pouze pro malièké sítì. \:OSPFv2 (Open Shortest Path First, viz RFC 2328)\\ Urèen pro interní routing, v~souèasné dobì asi nejbì¾nìj¹í.\\ Algoritmus: link state (Dijkstra).\\ Rychlá konvergence, ale velice komplikovaný.\\ Zatím podporujeme pouze pro IPv4. \:BGP4 (Border Gateway Protocol, viz RFC 1771 a 2283)\\ Standardní protokol pro externí routing mezi AS.\\ Rychlá konvergence, mo¾nost administrativní filtrace.\\ Algoritmus: path vector (upravený Bellman-Ford). \endlist \:Propojování protokolù a výmìnu dat mezi nimi. \:Schopnost uplatòovat routing policy -- urèovat, které routovací informace budou od~kterých protokolù pøijímány a do~kterých protokolù vysílány. \:Snadnou konfiguraci a údr¾bu, ale o~tom a¾ pozdìji. \:Modulární architekturu umo¾òující snadné doplòování nových protokolù, filtrù i jednoduché portování na~dal¹í systémy. (Interface k~routovacím slu¾bám jádra je bohu¾el i mezi jednotlivými unixovskými systémy natolik rùznorodý, ¾e dokonce i~Linux 2.0 a Linux 2.2 jsou naprogramovány jako dva odli¹né porty.) \:A v~neposlední øadì kvalitní dokumentaci jak u¾ivatelskou, tak programátorskou (to je vítaný dùsledek bytí ¹kolním projektem). \endlist %%% A jak to v¹echno propojit \hdr{Svìt z~ptaèí perspektivy aneb Jak to v¹echno dát dohromady?} \noindent Hlavním problémem ov¹em není ani tak v¹echny tyto vymo¾enosti naprogramovat a popropojovat, nýbr¾ udìlat to tak, aby z~toho nevznikl neudr¾ovatelný a neefektivní zmatek\footnote{$^2$}{Nádherným pøíkladem je Mendelùv pes, jak ho kdysi nakreslil pan Kantorek.}. Z~toho se zrodil modulární pohled na~svìt routingu a následnì i celá modulární architektura programu: \bigskip \centerline{\epsfxsize=0.9\hsize\epsfbox{../slides/obr5.eps}} \medskip Základem pohledu na~Internet z~na¹í \uv{ptaèí perspektivy} je routovací tabulka. Na~ní jsou pøipojeny jednotlivé routovací protokoly -- jak protokoly reálné, tak i nìkolik virtuálních, jako je napøíklad protokol Kernel zaji¹»ující synchronizaci tabulky s~tabulkou jádra nebo protokol Static generující podle své konfigurace statické smìrování. Ka¾dý z~protokolù posílá do~tabulky polo¾ky pro v¹echny routy, které se na~základì svých informací o~topologii sítì dozvídá. Tabulka pro ka¾dou sí» vybírá na základì preferencí jednotlivých protokolù a jejich metrik optimální smìr a ten oznamuje zpìt protokolùm. V~cestì ov¹em v~obou smìrech stojí filtry, které mohou tok dat regulovat -- nìkteré polo¾ky odmítat, jiné upravovat (napøíklad jim pøenastavovat metriky èi tagy; to se dokonce vztahuje i~na atributy doplòované cílovým protokolem, proto¾e nejprve cílový protokol nastaví implicitní hodnoty svých atributù, pokud je ji¾ polo¾ka neobsahovala, a teprve pak dojde k~filtrování). Routovacích tabulek mù¾e dokonce existovat vícero a pomocí protokolu Pipe si mohou pøeposílat vybrané polo¾ky. Tím mù¾eme zajistit napøíklad routing závislý na~zdrojové adrese èi vstupním interfacu: u~Linuxu 2.2 èi novìj¹ího nakonfigurujeme jádru více routovacích tabulek a ka¾dou z~nich pøipojíme na~jednu tabulku na¹i. \hdr{Ptaèí zpìv aneb User interface} %%% User interface: konfigurace, logging a filtry. Remote control. \noindent Sí» se mìní a s~ní se musí mìnit i konfigurace sí»ových komponent. Ta se pozvolna stala tradièním kamenem úrazu vìt¹iny routerù. U~tohoto kamene se toti¾ scházejí dva odvìcí nepøátelé: snaha o~snadnost a flexibilitu konfigurace a snaha o~nepøetr¾itý provoz sítì. A~jednou sleví ten, podruhé onen -- autoøi nìkterých routerù vsadili na~sílu textových konfiguraèních souborù za~cenu toho, ¾e se po~ka¾dé zmìnì konfigurace musí router restartovat a po~nìjakou dobu neroutuje, jiní zase podøídili non-stop provozu v¹e ostatní a stvoøili konfigurování nepøeberným mno¾stvím online pøíkazù, pomocí nich¾ se nìkteré vìci provádìjí snadno, jiné, na~které autoøi speciální pøíkaz nevymysleli, u¾ obtí¾nìji a je¹tì jiné vy¾adují do~výsledného stavu dospìt postupným provedením mnoha zmìn, co¾ má obvykle za~dùsledek daleko del¹í výpadek ne¾ jaký by byl vznikl reloadem celého routeru. \BIRD\ se sna¾í dosáhnout obojího: pou¾ívá textové konfiguraèní soubory, u¾ivateli tak dává mo¾nost vytváøet konfiguraci víceménì libovolným zpùsobem -- a» ji¾ ruèním editováním, interaktivními programy èi automatickým generováním pomocí scriptù. Po~zmìnì konfigurace je ov¹em schopen si novou verzi souboru pøeèíst, porovnat s~právì pou¾ívanou konfigurací a zmìnám se za bìhu pøízpùsobit (pokud jsou zmìny pøíli¹ velké, mù¾e to zpùsobit restart nìkterého z~protokolù, ale provoz tìch, kterých se zmìna netýkala, to nijak neohrozí). Konfigurace ka¾dého protokolu (lépe øeèeno ka¾dé jeho instance -- protokoly mohou být spu¹tìny nìkolikrát na~rùzných rozhraních èi nad rùznými tabulkami) vypadá pøibli¾nì takto: \verbatim{ protocol bgp TestBGP { # instanci si mù¾eme nazvat local as 65000; # ná¹ AS neighbor 195.39.3.64 as 5588; # sousední AS export all; # posílat budeme v¹echno import filter { # na vstupu nìkteré odmítneme if !(bgp_path ~ / ? 5588 ? /) then reject; if net ~ [ 10.0.0.0/8+, 192.168.0.0/16+ ] then reject; preference = 101; # zbylým nastavíme preferenci accept; # a pøijmeme je }; }} \noindent V¾dy popisuje protokol, jeho parametry, pøipojení k~tabulkám (v~na¹em pøípadì pou¾íváme tabulku implicitní) a nastavení vstupních i~výstupních filtrù. Filtry jsou popisovány jednoduchým procedurálním programovacím jazykem, který má k~dispozici v¹echny informace o~právì zpracovávané polo¾ce, mù¾e se podle nich rozhodovat a libovolnì je mìnit. Díky tomu je mo¾né jednodu¹e zadávat i velice slo¾itá pravidla, definovat si podprogramy sdílené filtry patøícími k~více protokolùm, i~poèítat metriky pro jeden protokol na základì metrik protokolù ostatních. Vítaným pomocníkem pøi odhalování problémù v~sítích je rovnì¾ volitelné logování dùle¾itých událostí a trasování èinnosti protokolù: zde si je mo¾no pro ka¾dý protokol vy¾ádat prakticky cokoliv poèínaje základními informacemi o~bìhu protokolu (pøipojování a odpojování sousedù apod.), pøes výmìnu polo¾ek mezi protokolem, filtry a jeho tabulkou, a konèe detailním výpisem v¹ech pøijatých i odeslaných paketù. Mimo to \BIRD\ disponuje \uv{dálkovým ovládáním} -- jednoduchým pøíkazovým rozhraním, pøes které se mohou pøipojovat rùzní klienti a vydávat jak nìkteré øídící pøíkazy (restarty protokolù, reload konfigurace, pøepínání trasování, \dots), tak po¾adavky na~vypisování stavu routovacích tabulek a protokolù. U~tìchto pøíkazù je mo¾no vyu¾ívat plné síly filtrovacího jazyka, tak¾e chceme-li napøíklad znát v¹echny routy smìrované pomocí BGP na jednoho konkrétního souseda, staèí polo¾it dotaz typu \verbatim{ bird> show route where source=RTS_BGP && gw=62.168.0.1} \noindent a dozvíme se ihned v¹e, co jsme potøebovali. Ladìní filtrù navíc usnadní i~to, ¾e se mù¾eme zeptat na~obsah routovací tabulky z~pohledu nìkterého z~bì¾ících protokolù. %%% BIRD uvnitø %\hdr{Ptaèí anatomie} %% existuje progdoc %%% Netradicni pouziti \hdr{Cesty ta¾ných ptákù aneb Za hranicemi v¹edních dnù} \noindent Hotová modulární implementace routovacího daemona samozøejmì svádí i k~ménì tradiènímu vyu¾ití. Zde se fantazii meze nekladou, autory samé bìhem vývoje napadly napøíklad tyto triky: \itemize\ibull \:{\I multirouter} -- \uv{schizofrenní} zaøízení pracující na rùzných skupinách interfacù jako rùzné routery øídící se rùznými pravidly, le¾ící tøeba i v~rùzných autonomních systémech. To je mo¾no zaøídit patøièným nastavením jádra a buïto více bì¾ícími \BIRD{}y nebo dokonce jedním pracujícím s~nìkolika rùznými routovacími tabulkami. Tak by mohl napøíklad celý pra¾ský NIX bì¾et na jediném routeru (pravda, bì¾né PC by na to nestaèílo), a pøesto by si ka¾dý provider mohl sám urèovat a konfigurovat svou vlastní routovací politiku. \:{\I ¹edá eminence} -- \BIRD\ by ani nemusel bì¾et pøímo na~stroji, který pakety routuje, mohl by také hotové routovací tabulky diktovat nìjakému dedikovanému routeru disponujícím výkonnìj¹ím hardwarem, a tak skloubit ¹pièkovou propustnost \uv{velkého ¾eleza} s~flexibilitou routeru be¾ícího pod unixovským systémem. \:{\I inteligentní mirror} -- aplikace se nemusí zastavovat u~routingu jako takového, mnohdy je mo¾no informace získané z~provozu routeru vyu¾ívat k~dal¹ím úèelùm, napøíklad k~inteligentnímu pøesmìrovávání klientù na~nejbli¾¹í mirror va¹eho archivu. \endlist %%% A co dal? \hdr{Èas ptáèat aneb Co dál?} Pøesto¾e po~úspì¹ném obhájení projektu a prvních nìkolika desítkách spokojených u¾ivatelù (a samozøejmì i~pár opravených chybách) nyní vývoj spí¹e stagnuje, autoøi ji¾ spøádají plány do~budoucnosti, které by mìly \BIRD{}ovi pøinést mimo jiné také routování multicastù, agregaci sí»ových prefixù, OSPFv3 pro IPv6, on-demand linky a porty na~dal¹í systémy. %%% Reference na nás a ostatní routery \hdr{Snù¹ka odkazù na závìr} \noindent {\sc Bird Team} pod vedením RNDr. Libora Forsta ({\I forst@cuni.cz}) tvoøili: $$\vbox{\halign{#\hfil & \quad \it # \hfil & \quad \it # \hfil\cr Ondøej Filip&feela@ipex.cz&http:/$\!$/feela.ipex.cz/\cr Martin Mare¹&mj@ucw.cz&http:/$\!$/atrey.karlin.mff.cuni.cz/\char126mj/\cr Pavel Machek&pavel@ucw.cz&http:/$\!$/atrey.karlin.mff.cuni.cz/\char126pavel/\cr}}$$ Domácí stránku projektu najdete na {\it http:/$\!$/bird.network.cz/,} odtamtud ji¾ vedou odkazy na~aktuální verzi, online dokumentaci i mailing list u¾ivatelù. V¹echna zmiòovaná RFC i mnoho dal¹ích naleznete na {\it http:/$\!$/www.rfc-editor.org/}, první my¹lenky o~vyu¾ívání ptactva v~Internetu sahají a¾ k~RFC~1149. \BIRD\ není na~svìtì sám, má i~pøíbuzné; mezi nimi za zmínku stojí daemoni {\sc GateD} ({\I http:/$\!$/www.gated.org/}), \hbox{\sc Zebra} ({\I http:/$\!$/www.zebra.org/}) a {\sc Mrtd} ({\I http:/$\!$/www.mrtd.net/}). O~IPv6 se bohu¾el zatím jen pí¹e, na~jeho celointernetové nasazení se stále èeká a mezitím pøibývá address-translatorù a dal¹ích zvìrstev. Snad jediná vìt¹í sí» pou¾ívající tento protokol je experimentální virtuální sí» 6-bone (viz {\it http:/$\!$/www.6bone.net/} a odkazy odtamtud). Dotazy a pøipomínky posílejte buïto autorovi nebo celému {\sc Bird Team}u na~adresu {\I bird@bird.network.cz}. \bye ��������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������bird-1.6.3/doc/slt2001/Makefile���������������������������������������������������������������������0000644�0001032�0000144�00000000232�13027054563�014741� 0����������������������������������������������������������������������������������������������������ustar �feela���������������������������users������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������all: slt.dvi slt.dvi: slt.tex csplain slt.tex slt.ps: slt.dvi dvips -o slt.ps -D600 -ta4 slt.dvi clean: rm -f *~ *.log *.tfm *.*pk *.*gf *.ps *.dvi ����������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������bird-1.6.3/doc/kernel-doc���������������������������������������������������������������������������0000755�0001032�0000144�00000062552�13027054563�014162� 0����������������������������������������������������������������������������������������������������ustar �feela���������������������������users������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������#!/usr/bin/perl ## Copyright (c) 1998 Michael Zucchi, All Rights Reserved ## ## ## ## This software falls under the GNU Public License. Please read ## ## the COPYING file for more information ## # # This will read a 'c' file and scan for embedded comments in the # style of gnome comments (+minor extensions - see below). # # Note: This only supports 'c'. # usage: # kerneldoc [ -docbook | -html | -text | -man | -gnome | -bird ] # [ -function funcname [ -function funcname ...] ] c file(s)s > outputfile # or # [ -nofunction funcname [ -function funcname ...] ] c file(s)s > outputfile # # Set output format using one of -docbook -html -text -man -gnome or -bird. Default is man. # # -function funcname # If set, then only generate documentation for the given function(s). All # other functions are ignored. # # -nofunction funcname # If set, then only generate documentation for the other function(s). All # other functions are ignored. Cannot be used with -function together # (yes thats a bug - perl hackers can fix it 8)) # # c files - list of 'c' files to process # # All output goes to stdout, with errors to stderr. # # format of comments. # In the following table, (...)? signifies optional structure. # (...)* signifies 0 or more structure elements # /** # * function_name(:)? (- short description)? # (* @parameterx: (description of parameter x)?)* # (* a blank line)? # * (Description:)? (Description of function)? # * (section header: (section description)? )* # (*)?*/ # # So .. the trivial example would be: # # /** # * my_function # **/ # # If the Description: header tag is ommitted, then there must be a blank line # after the last parameter specification. # e.g. # /** # * my_function - does my stuff # * @my_arg: its mine damnit # * # * Does my stuff explained. # */ # # or, could also use: # /** # * my_function - does my stuff # * @my_arg: its mine damnit # * Description: Does my stuff explained. # */ # etc. # # All descriptions can be multiline, apart from the short function description. # # All descriptive text is further processed, scanning for the following special # patterns, which are highlighted appropriately. # # 'funcname()' - function # '$ENVVAR' - environmental variable # '&struct_name' - name of a structure or a type # '@parameter' - name of a parameter # '%CONST' - name of a constant. # '|code|' - literal string # match expressions used to find embedded type information $type_constant = "\\\%(\\w+)"; $type_func = "(\\w+\\(\\))"; $type_param = "\\\@(\\w+)"; $type_struct = "\\\&(\\w+)"; $type_env = "(\\\$\\w+)"; $type_code = "\\|([^|]*)\\|"; # Output conversion substitutions. # One for each output format # these work fairly well %highlights_html = ( $type_constant, "<i>\$1</i>", $type_func, "<b>\$1</b>", $type_struct, "<i>\$1</i>", $type_param, "<tt><b>\$1</b></tt>" ); $blankline_html = "<p>"; # sgml, docbook format %highlights_sgml = ( $type_constant, "<replaceable class=\"option\">\$1</replaceable>", $type_func, "<function>\$1</function>", $type_struct, "<structname>\$1</structname>", $type_env, "<envar>\$1</envar>", $type_param, "<parameter>\$1</parameter>" ); $blankline_sgml = "</para><para>\n"; # gnome, docbook format %highlights_gnome = ( $type_constant, "<replaceable class=\"option\">\$1</replaceable>", $type_func, "<function>\$1</function>", $type_struct, "<structname>\$1</structname>", $type_env, "<envar>\$1</envar>", $type_param, "<parameter>\$1</parameter>" ); $blankline_gnome = "</para><para>\n"; # bird documentation %highlights_bird = ( $type_constant, "<const/\$1/", $type_func, "<func/\$1/", $type_struct, "<struct/\$1/", $type_param, "<param/\$1/", $type_code, "<tt>\$1</tt>"); $blankline_bird = "<p>"; # these are pretty rough %highlights_man = ( $type_constant, "\\n.I \\\"\$1\\\"\\n", $type_func, "\\n.B \\\"\$1\\\"\\n", $type_struct, "\\n.I \\\"\$1\\\"\\n", $type_param."([\.\, ]*)\n?", "\\n.I \\\"\$1\$2\\\"\\n" ); $blankline_man = ""; # text-mode %highlights_text = ( $type_constant, "\$1", $type_func, "\$1", $type_struct, "\$1", $type_param, "\$1" ); $blankline_text = ""; sub usage { print "Usage: $0 [ -v ] [ -docbook | -html | -text | -man ]\n"; print " [ -function funcname [ -function funcname ...] ]\n"; print " [ -nofunction funcname [ -nofunction funcname ...] ]\n"; print " c source file(s) > outputfile\n"; exit 1; } # read arguments if ($#ARGV==-1) { usage(); } $verbose = 0; $output_mode = "man"; %highlights = %highlights_man; $blankline = $blankline_man; $modulename = "API Documentation"; $function_only = 0; while ($ARGV[0] =~ m/^-(.*)/) { $cmd = shift @ARGV; if ($cmd eq "-html") { $output_mode = "html"; %highlights = %highlights_html; $blankline = $blankline_html; } elsif ($cmd eq "-man") { $output_mode = "man"; %highlights = %highlights_man; $blankline = $blankline_man; } elsif ($cmd eq "-text") { $output_mode = "text"; %highlights = %highlights_text; $blankline = $blankline_text; } elsif ($cmd eq "-docbook") { $output_mode = "sgml"; %highlights = %highlights_sgml; $blankline = $blankline_sgml; } elsif ($cmd eq "-gnome") { $output_mode = "gnome"; %highlights = %highlights_gnome; $blankline = $blankline_gnome; } elsif ($cmd eq "-bird") { $output_mode = "bird"; %highlights = %highlights_bird; $blankline = $blankline_bird; } elsif ($cmd eq "-module") { # not needed for sgml, inherits from calling document $modulename = shift @ARGV; } elsif ($cmd eq "-function") { # to only output specific functions $function_only = 1; $function = shift @ARGV; $function_table{$function} = 1; } elsif ($cmd eq "-nofunction") { # to only output specific functions $function_only = 2; $function = shift @ARGV; $function_table{$function} = 1; } elsif ($cmd eq "-v") { $verbose = 1; } elsif (($cmd eq "-h") || ($cmd eq "--help")) { usage(); } } # generate a sequence of code that will splice in highlighting information # using the s// operator. $dohighlight = ""; foreach $pattern (keys %highlights) { # print "scanning pattern $pattern ($highlights{$pattern})\n"; $dohighlight .= "\$contents =~ s:$pattern:$highlights{$pattern}:gs;\n"; } ## # dumps section contents to arrays/hashes intended for that purpose. # sub dump_section { my $name = shift @_; my $contents = join "\n", @_; if ($name =~ m/$type_constant/) { $name = $1; # print STDERR "constant section '$1' = '$contents'\n"; $constants{$name} = $contents; } elsif ($name =~ m/$type_param/) { # print STDERR "parameter def '$1' = '$contents'\n"; $name = $1; $parameters{$name} = $contents; } else { # print STDERR "other section '$name' = '$contents'\n"; $sections{$name} = $contents; push @sectionlist, $name; } } ## # output function # # parameters, a hash. # function => "function name" # parameterlist => @list of parameters # parameters => %parameter descriptions # sectionlist => @list of sections # sections => %descriont descriptions # sub output_highlight { my $contents = join "\n", @_; my $line; eval $dohighlight; foreach $line (split "\n", $contents) { if ($line eq ""){ print $lineprefix, $blankline; } else { $line =~ s/\\\\\\/\&/g; print $lineprefix, $line; } print "\n"; } } # output in html sub output_html { my %args = %{$_[0]}; my ($parameter, $section); my $count; print "<h2>Function</h2>\n"; print "<i>".$args{'functiontype'}."</i>\n"; print "<b>".$args{'function'}."</b>\n"; print "("; $count = 0; foreach $parameter (@{$args{'parameterlist'}}) { print "<i>".$args{'parametertypes'}{$parameter}."</i> <b>".$parameter."</b>\n"; if ($count != $#{$args{'parameterlist'}}) { $count++; print ", "; } } print ")\n"; print "<h3>Arguments</h3>\n"; print "<dl>\n"; foreach $parameter (@{$args{'parameterlist'}}) { print "<dt><i>".$args{'parametertypes'}{$parameter}."</i> <b>".$parameter."</b>\n"; print "<dd>"; output_highlight($args{'parameters'}{$parameter}); } print "</dl>\n"; foreach $section (@{$args{'sectionlist'}}) { print "<h1>$section</h1>\n"; print "<ul>\n"; output_highlight($args{'sections'}{$section}); print "</ul>\n"; } print "<hr>\n"; } # output in html sub output_intro_html { my %args = %{$_[0]}; my ($parameter, $section); my $count; foreach $section (@{$args{'sectionlist'}}) { print "<h1>$section</h1>\n"; print "<ul>\n"; output_highlight($args{'sections'}{$section}); print "</ul>\n"; } print "<hr>\n"; } # output in sgml DocBook sub output_sgml { my %args = %{$_[0]}; my ($parameter, $section); my $count; my $id; $id = $args{'module'}."-".$args{'function'}; $id =~ s/[^A-Za-z0-9]/-/g; print "<refentry>\n"; print "<refmeta>\n"; print "<refentrytitle><phrase id=\"$id\">".$args{'function'}."</phrase></refentrytitle>\n"; print "</refmeta>\n"; print "<refnamediv>\n"; print " <refname>".$args{'function'}."</refname>\n"; print " <refpurpose>\n"; print " ".$args{'purpose'}."\n"; print " </refpurpose>\n"; print "</refnamediv>\n"; print "<refsynopsisdiv>\n"; print " <title>Synopsis\n"; print " \n"; print " ".$args{'functiontype'}." "; print "".$args{'function'}." "; print "\n"; # print "\n"; # print " Synopsis\n"; # print " \n"; # print " ".$args{'functiontype'}." "; # print "".$args{'function'}." "; # print "\n"; $count = 0; if ($#{$args{'parameterlist'}} >= 0) { foreach $parameter (@{$args{'parameterlist'}}) { print " ".$args{'parametertypes'}{$parameter}; print " $parameter\n"; } } else { print " \n"; } print " \n"; print "\n"; # print "\n"; # print parameters print "\n Arguments\n"; # print "\nArguments\n"; if ($#{$args{'parameterlist'}} >= 0) { print " \n"; foreach $parameter (@{$args{'parameterlist'}}) { print " \n $parameter\n"; print " \n \n"; $lineprefix=" "; output_highlight($args{'parameters'}{$parameter}); print " \n \n \n"; } print " \n"; } else { print " \n None\n \n"; } print "\n"; # print out each section $lineprefix=" "; foreach $section (@{$args{'sectionlist'}}) { print "\n $section\n \n"; # print "\n$section\n"; if ($section =~ m/EXAMPLE/i) { print "\n"; } output_highlight($args{'sections'}{$section}); # print ""; if ($section =~ m/EXAMPLE/i) { print "\n"; } print " \n\n"; } print "\n\n"; } # output in sgml DocBook sub output_intro_sgml { my %args = %{$_[0]}; my ($parameter, $section); my $count; my $id; $id = $args{'module'}; $id =~ s/[^A-Za-z0-9]/-/g; # print out each section $lineprefix=" "; foreach $section (@{$args{'sectionlist'}}) { print "\n $section\n \n"; # print "\n$section\n"; if ($section =~ m/EXAMPLE/i) { print "\n"; } output_highlight($args{'sections'}{$section}); # print ""; if ($section =~ m/EXAMPLE/i) { print "\n"; } print " \n\n"; } print "\n\n"; } # output in sgml DocBook sub output_gnome { my %args = %{$_[0]}; my ($parameter, $section); my $count; my $id; $id = $args{'module'}."-".$args{'function'}; $id =~ s/[^A-Za-z0-9]/-/g; print "\n"; print " ".$args{'function'}."\n"; # print "\n"; # print " Synopsis\n"; print " \n"; print " ".$args{'functiontype'}." "; print "".$args{'function'}." "; print "\n"; $count = 0; if ($#{$args{'parameterlist'}} >= 0) { foreach $parameter (@{$args{'parameterlist'}}) { print " ".$args{'parametertypes'}{$parameter}; print " $parameter\n"; } } else { print " \n"; } print " \n"; # print "\n"; # print "\n"; # print parameters # print "\n Arguments\n"; # if ($#{$args{'parameterlist'}} >= 0) { # print " \n"; # foreach $parameter (@{$args{'parameterlist'}}) { # print " \n $parameter\n"; # print " \n \n"; # $lineprefix=" "; # output_highlight($args{'parameters'}{$parameter}); # print " \n \n \n"; # } # print " \n"; # } else { # print " \n None\n \n"; # } # print "\n"; # print "\n Arguments\n"; if ($#{$args{'parameterlist'}} >= 0) { print " \n"; print "\n"; print "\n"; print "\n"; print "\n"; foreach $parameter (@{$args{'parameterlist'}}) { print " $parameter\n"; print " \n"; $lineprefix=" "; output_highlight($args{'parameters'}{$parameter}); print " \n"; } print " \n"; } else { print " \n None\n \n"; } # print "\n"; # print out each section $lineprefix=" "; foreach $section (@{$args{'sectionlist'}}) { print "\n $section\n"; # print "\n$section\n"; if ($section =~ m/EXAMPLE/i) { print "\n"; } else { } print "\n"; output_highlight($args{'sections'}{$section}); # print ""; print "\n"; if ($section =~ m/EXAMPLE/i) { print "\n"; } else { } print " \n"; } print "\n\n"; } # output in birddoc sub output_bird { my %args = %{$_[0]}; my ($parameter, $section); my $count; print "

".$args{'functiontype'}."\n"; print "".$args{'function'}."\n"; print "("; $count = 0; my $ntyped = 0; foreach $parameter (@{$args{'parameterlist'}}) { if ($args{'parametertypes'}{$parameter} ne "") { print "".$args{'parametertypes'}{$parameter}." "; $ntyped++; } print "".$parameter.""; if ($count != $#{$args{'parameterlist'}}) { $count++; print ", "; } } print ")"; if ($args{'purpose'} ne "") { print " -- "; output_highlight($args{'purpose'}); } print "\n"; if ($ntyped) { print "Arguments\n"; print "

\n"; foreach $parameter (@{$args{'parameterlist'}}) { print "".$args{'parametertypes'}{$parameter}." ".$parameter."\n"; output_highlight($args{'parameters'}{$parameter}); } print "\n"; } foreach $section (@{$args{'sectionlist'}}) { print "$section\n"; print "

\n"; output_highlight($args{'sections'}{$section}); } print "\n"; } # output in birddoc sub output_intro_bird { my %args = %{$_[0]}; my ($parameter, $section); my $count; my $id; $id = $args{'module'}; $id =~ s/[^A-Za-z0-9]/-/g; # print out each section $lineprefix=" "; foreach $section (@{$args{'sectionlist'}}) { print "$section\n

\n"; output_highlight($args{'sections'}{$section}); } print "\n\n"; } ## # output in man sub output_man { my %args = %{$_[0]}; my ($parameter, $section); my $count; print ".TH \"$args{'module'}\" \"$args{'function'}\" \"25 May 1998\" \"API Manual\" LINUX\n"; print ".SH Function\n"; print ".I \"".$args{'functiontype'}."\"\n"; print ".B \"".$args{'function'}."\"\n"; print "(\n"; $count = 0; foreach $parameter (@{$args{'parameterlist'}}) { print ".I \"".$args{'parametertypes'}{$parameter}."\"\n.B \"".$parameter."\"\n"; if ($count != $#{$args{'parameterlist'}}) { $count++; print ",\n"; } } print ")\n"; print ".SH Arguments\n"; foreach $parameter (@{$args{'parameterlist'}}) { print ".IP \"".$args{'parametertypes'}{$parameter}." ".$parameter."\" 12\n"; output_highlight($args{'parameters'}{$parameter}); } foreach $section (@{$args{'sectionlist'}}) { print ".SH \"$section\"\n"; output_highlight($args{'sections'}{$section}); } } sub output_intro_man { my %args = %{$_[0]}; my ($parameter, $section); my $count; print ".TH \"$args{'module'}\" \"$args{'module'}\" \"25 May 1998\" \"API Manual\" LINUX\n"; foreach $section (@{$args{'sectionlist'}}) { print ".SH \"$section\"\n"; output_highlight($args{'sections'}{$section}); } } ## # output in text sub output_text { my %args = %{$_[0]}; my ($parameter, $section); print "Function = ".$args{'function'}."\n"; print " return type: ".$args{'functiontype'}."\n\n"; foreach $parameter (@{$args{'parameterlist'}}) { print " ".$args{'parametertypes'}{$parameter}." ".$parameter."\n"; print " -> ".$args{'parameters'}{$parameter}."\n"; } foreach $section (@{$args{'sectionlist'}}) { print " $section:\n"; print " -> "; output_highlight($args{'sections'}{$section}); } } sub output_intro_text { my %args = %{$_[0]}; my ($parameter, $section); foreach $section (@{$args{'sectionlist'}}) { print " $section:\n"; print " -> "; output_highlight($args{'sections'}{$section}); } } ## # generic output function - calls the right one based # on current output mode. sub output_function { # output_html(@_); eval "output_".$output_mode."(\@_);"; } ## # generic output function - calls the right one based # on current output mode. sub output_intro { # output_html(@_); eval "output_intro_".$output_mode."(\@_);"; } ## # takes a function prototype and spits out all the details # stored in the global arrays/hsahes. sub dump_function { my $prototype = shift @_; $prototype =~ s/^static+ //; $prototype =~ s/^extern+ //; $prototype =~ s/^inline+ //; $prototype =~ s/^__inline__+ //; if ($prototype =~ m/^()([a-zA-Z0-9_~:]+)\s*\(([^\)]*)\)/ || $prototype =~ m/^(\w+)\s+([a-zA-Z0-9_~:]+)\s*\(([^\)]*)\)/ || $prototype =~ m/^(\w+\s*\*)\s*([a-zA-Z0-9_~:]+)\s*\(([^\)]*)\)/ || $prototype =~ m/^(\w+\s+\w+)\s+([a-zA-Z0-9_~:]+)\s*\(([^\)]*)\)/ || $prototype =~ m/^(\w+\s+\w+\s*\*)\s*([a-zA-Z0-9_~:]+)\s*\(([^\)]*)\)/) { $return_type = $1; $function_name = $2; $args = $3; # print STDERR "ARGS = '$args'\n"; foreach $arg (split ',', $args) { # strip leading/trailing spaces $arg =~ s/^\s*//; $arg =~ s/\s*$//; # print STDERR "SCAN ARG: '$arg'\n"; @args = split('\s', $arg); # print STDERR " -> @args\n"; $param = pop @args; # print STDERR " -> @args\n"; if ($param =~ m/^(\*+)(.*)/) { $param = $2; push @args, $1; } $type = join " ", @args; if ($type eq "" && $param eq "...") { $type="..."; $param="..."; $parameters{"..."} = "variable arguments"; } if ($type eq "") { $type=""; $param="void"; $parameters{void} = "no arguments"; } if ($parameters{$param} eq "") { $parameters{$param} = "-- undescribed --"; print STDERR "Warning($lineno): Function parameter '$param' not described in '$function_name'\n"; } push @parameterlist, $param; $parametertypes{$param} = $type; # print STDERR "param = '$param', type = '$type'\n"; } } else { print STDERR "Error($lineno): cannot understand prototype: '$prototype'\n"; return; } if ($function_only==0 || ( $function_only == 1 && defined($function_table{$function_name})) || ( $function_only == 2 && !defined($function_table{$function_name}))) { output_function({'function' => $function_name, 'module' => $modulename, 'functiontype' => $return_type, 'parameterlist' => \@parameterlist, 'parameters' => \%parameters, 'parametertypes' => \%parametertypes, 'sectionlist' => \@sectionlist, 'sections' => \%sections, 'purpose' => $function_purpose }); } } ###################################################################### # main # states # 0 - normal code # 1 - looking for function name # 2 - scanning field start. # 3 - scanning prototype. $state = 0; $section = ""; $doc_special = "\@\%\$\&"; $doc_start = "^/\\*\\*\$"; $doc_end = "\\*/"; $doc_com = "\\s*\\*\\s*"; $doc_func = $doc_com."(\\w+):?"; $doc_sect = $doc_com."([".$doc_special."]?[\\w ]+):(.*)"; $doc_content = $doc_com."(.*)"; $doc_block = $doc_com."DOC:\\s*(.*)?"; %constants = (); %parameters = (); @parameterlist = (); %sections = (); @sectionlist = (); $contents = ""; $section_default = "Description"; # default section $section_intro = "Introduction"; $section = $section_default; $lineno = 0; foreach $file (@ARGV) { if (!open(IN,"<$file")) { print STDERR "Error: Cannot open file $file\n"; next; } while () { $lineno++; if ($state == 0) { if (/$doc_start/o) { $state = 1; # next line is always the function name } } elsif ($state == 1) { # this line is the function name (always) if (/$doc_block/o) { $state = 4; $contents = ""; if ( $1 eq "" ) { $section = $section_intro; } else { $section = $1; } } elsif (/$doc_func/o) { $function = $1; $state = 2; if (/-(.*)/) { $function_purpose = $1; } else { $function_purpose = ""; } if ($verbose) { print STDERR "Info($lineno): Scanning doc for $function\n"; } } else { print STDERR "WARN($lineno): Cannot understand $_ on line $lineno", " - I thought it was a doc line\n"; $state = 0; } } elsif ($state == 2) { # look for head: lines, and include content if (/$doc_sect/o) { $newsection = $1; $newcontents = $2; if ($contents ne "") { # $contents =~ s/\&/\\\\\\amp;/g; $contents =~ s/\/\\\\\\gt;/g; dump_section($section, $contents); $section = $section_default; } $contents = $newcontents; if ($contents ne "") { $contents .= "\n"; } $section = $newsection; } elsif (/$doc_end/) { if ($contents ne "") { # $contents =~ s/\&/\\\\\\amp;/g; $contents =~ s/\/\\\\\\gt;/g; dump_section($section, $contents); $section = $section_default; $contents = ""; } # print STDERR "end of doc comment, looking for prototype\n"; $prototype = ""; $state = 3; } elsif (/$doc_content/) { # miguel-style comment kludge, look for blank lines after # @parameter line to signify start of description if ($1 eq "" && $section =~ m/^@/) { # $contents =~ s/\&/\\\\\\amp;/g; $contents =~ s/\/\\\\\\gt;/g; dump_section($section, $contents); $section = $section_default; $contents = ""; } else { $contents .= $1."\n"; } } else { # i dont know - bad line? ignore. print STDERR "WARNING($lineno): bad line: $_"; } } elsif ($state == 3) { # scanning for function { (end of prototype) if (m#\s*/\*\s+MACDOC\s*#io) { # do nothing } elsif (/([^\{]*)/) { $prototype .= $1; } if (/\{/) { $prototype =~ s@/\*.*?\*/@@gos; # strip comments. $prototype =~ s@[\r\n]+@ @gos; # strip newlines/cr's. $prototype =~ s@^ +@@gos; # strip leading spaces dump_function($prototype); $function = ""; %constants = (); %parameters = (); %parametertypes = (); @parameterlist = (); %sections = (); @sectionlist = (); $prototype = ""; $state = 0; } } elsif ($state == 4) { # Documentation block if (/$doc_block/) { # $contents =~ s/\&/\\\\\\amp;/g; $contents =~ s/\/\\\\\\gt;/g; dump_section($section, $contents); output_intro({'sectionlist' => \@sectionlist, 'sections' => \%sections }); $contents = ""; $function = ""; %constants = (); %parameters = (); %parametertypes = (); @parameterlist = (); %sections = (); @sectionlist = (); $prototype = ""; if ( $1 eq "" ) { $section = $section_intro; } else { $section = $1; } } elsif (/$doc_end/) { # $contents =~ s/\&/\\\\\\amp;/g; $contents =~ s/\/\\\\\\gt;/g; dump_section($section, $contents); output_intro({'sectionlist' => \@sectionlist, 'sections' => \%sections }); $contents = ""; $function = ""; %constants = (); %parameters = (); %parametertypes = (); @parameterlist = (); %sections = (); @sectionlist = (); $prototype = ""; $state = 0; } elsif (/$doc_content/) { if ( $1 eq "" ) { $contents .= "\n"; } else { $contents .= $1 . "\n"; } } } } } bird-1.6.3/doc/prog-8.html0000644000103200001440000006724613027054667014225 0ustar feelausers BIRD Programmer's Documentation: Resources Next Previous Contents

8. Resources

8.1 Introduction

Most large software projects implemented in classical procedural programming languages usually end up with lots of code taking care of resource allocation and deallocation. Bugs in such code are often very difficult to find, because they cause only `resource leakage', that is keeping a lot of memory and other resources which nobody references to.

We've tried to solve this problem by employing a resource tracking system which keeps track of all the resources allocated by all the modules of BIRD, deallocates everything automatically when a module shuts down and it is able to print out the list of resources and the corresponding modules they are allocated by.

Each allocated resource (from now we'll speak about allocated resources only) is represented by a structure starting with a standard header (struct resource) consisting of a list node (resources are often linked to various lists) and a pointer to resclass -- a resource class structure pointing to functions implementing generic resource operations (such as freeing of the resource) for the particular resource type.

There exist the following types of resources:

  • Resource pools (pool)
  • Memory blocks
  • Linear memory pools (linpool)
  • Slabs (slab)
  • Events (event)
  • Timers (timer)
  • Sockets (socket)

8.2 Resource pools

Resource pools (pool) are just containers holding a list of other resources. Freeing a pool causes all the listed resources to be freed as well. Each existing resource is linked to some pool except for a root pool which isn't linked anywhere, so all the resources form a tree structure with internal nodes corresponding to pools and leaves being the other resources.

Example: Almost all modules of BIRD have their private pool which is freed upon shutdown of the module.

Function

pool * rp_new (pool * p, char * name) -- create a resource pool

Arguments

pool * p

parent pool

char * name

pool name (to be included in debugging dumps)

Description

rp_new() creates a new resource pool inside the specified parent pool.

Function

void rmove (void * res, pool * p) -- move a resource

Arguments

void * res

resource

pool * p

pool to move the resource to

Description

rmove() moves a resource from one pool to another.

Function

void rfree (void * res) -- free a resource

Arguments

void * res

resource

Description

rfree() frees the given resource and all information associated with it. In case it's a resource pool, it also frees all the objects living inside the pool.

It works by calling a class-specific freeing function.

Function

void rdump (void * res) -- dump a resource

Arguments

void * res

resource

Description

This function prints out all available information about the given resource to the debugging output.

It works by calling a class-specific dump function.

Function

void * ralloc (pool * p, struct resclass * c) -- create a resource

Arguments

pool * p

pool to create the resource in

struct resclass * c

class of the new resource

Description

This function is called by the resource classes to create a new resource of the specified class and link it to the given pool. Allocated memory is zeroed. Size of the resource structure is taken from the size field of the resclass.

Function

void rlookup (unsigned long a) -- look up a memory location

Arguments

unsigned long a

memory address

Description

This function examines all existing resources to see whether the address a is inside any resource. It's used for debugging purposes only.

It works by calling a class-specific lookup function for each resource.

Function

void resource_init (void) -- initialize the resource manager

Description

This function is called during BIRD startup. It initializes all data structures of the resource manager and creates the root pool.

8.3 Memory blocks

Memory blocks are pieces of contiguous allocated memory. They are a bit non-standard since they are represented not by a pointer to resource, but by a void pointer to the start of data of the memory block. All memory block functions know how to locate the header given the data pointer.

Example: All "unique" data structures such as hash tables are allocated as memory blocks.

Function

void * mb_alloc (pool * p, unsigned size) -- allocate a memory block

Arguments

pool * p

pool

unsigned size

size of the block

Description

mb_alloc() allocates memory of a given size and creates a memory block resource representing this memory chunk in the pool p.

Please note that mb_alloc() returns a pointer to the memory chunk, not to the resource, hence you have to free it using mb_free(), not rfree().

Function

void * mb_allocz (pool * p, unsigned size) -- allocate and clear a memory block

Arguments

pool * p

pool

unsigned size

size of the block

Description

mb_allocz() allocates memory of a given size, initializes it to zeroes and creates a memory block resource representing this memory chunk in the pool p.

Please note that mb_allocz() returns a pointer to the memory chunk, not to the resource, hence you have to free it using mb_free(), not rfree().

Function

void * mb_realloc (void * m, unsigned size) -- reallocate a memory block

Arguments

void * m

memory block

unsigned size

new size of the block

Description

mb_realloc() changes the size of the memory block m to a given size. The contents will be unchanged to the minimum of the old and new sizes; newly allocated memory will be uninitialized. Contrary to realloc() behavior, m must be non-NULL, because the resource pool is inherited from it.

Like mb_alloc(), mb_realloc() also returns a pointer to the memory chunk, not to the resource, hence you have to free it using mb_free(), not rfree().

Function

void mb_free (void * m) -- free a memory block

Arguments

void * m

memory block

Description

mb_free() frees all memory associated with the block m.

8.4 Linear memory pools

Linear memory pools are collections of memory blocks which support very fast allocation of new blocks, but are able to free only the whole collection at once.

Example: Each configuration is described by a complex system of structures, linked lists and function trees which are all allocated from a single linear pool, thus they can be freed at once when the configuration is no longer used.

Function

linpool * lp_new (pool * p, uint blk) -- create a new linear memory pool

Arguments

pool * p

pool

uint blk

block size

Description

lp_new() creates a new linear memory pool resource inside the pool p. The linear pool consists of a list of memory chunks of size at least blk.

Function

void * lp_alloc (linpool * m, uint size) -- allocate memory from a linpool

Arguments

linpool * m

linear memory pool

uint size

amount of memory

Description

lp_alloc() allocates size bytes of memory from a linpool m and it returns a pointer to the allocated memory.

It works by trying to find free space in the last memory chunk associated with the linpool and creating a new chunk of the standard size (as specified during lp_new()) if the free space is too small to satisfy the allocation. If size is too large to fit in a standard size chunk, an "overflow" chunk is created for it instead.

Function

void * lp_allocu (linpool * m, uint size) -- allocate unaligned memory from a linpool

Arguments

linpool * m

linear memory pool

uint size

amount of memory

Description

lp_allocu() allocates size bytes of memory from a linpool m and it returns a pointer to the allocated memory. It doesn't attempt to align the memory block, giving a very efficient way how to allocate strings without any space overhead.

Function

void * lp_allocz (linpool * m, uint size) -- allocate cleared memory from a linpool

Arguments

linpool * m

linear memory pool

uint size

amount of memory

Description

This function is identical to lp_alloc() except that it clears the allocated memory block.

Function

void lp_flush (linpool * m) -- flush a linear memory pool

Arguments

linpool * m

linear memory pool

Description

This function frees the whole contents of the given linpool m, but leaves the pool itself.

8.5 Slabs

Slabs are collections of memory blocks of a fixed size. They support very fast allocation and freeing of such blocks, prevent memory fragmentation and optimize L2 cache usage. Slabs have been invented by Jeff Bonwick and published in USENIX proceedings as `The Slab Allocator: An Object-Caching Kernel Memory Allocator'. Our implementation follows this article except that we don't use constructors and destructors.

When the DEBUGGING switch is turned on, we automatically fill all newly allocated and freed blocks with a special pattern to make detection of use of uninitialized or already freed memory easier.

Example: Nodes of a FIB are allocated from a per-FIB Slab.

Function

slab * sl_new (pool * p, uint size) -- create a new Slab

Arguments

pool * p

resource pool

uint size

block size

Description

This function creates a new Slab resource from which objects of size size can be allocated.

Function

void * sl_alloc (slab * s) -- allocate an object from Slab

Arguments

slab * s

slab

Description

sl_alloc() allocates space for a single object from the Slab and returns a pointer to the object.

Function

void sl_free (slab * s, void * oo) -- return a free object back to a Slab

Arguments

slab * s

slab

void * oo

object returned by sl_alloc()

Description

This function frees memory associated with the object oo and returns it back to the Slab s.

8.6 Events

Events are there to keep track of deferred execution. Since BIRD is single-threaded, it requires long lasting tasks to be split to smaller parts, so that no module can monopolize the CPU. To split such a task, just create an event resource, point it to the function you want to have called and call ev_schedule() to ask the core to run the event when nothing more important requires attention.

You can also define your own event lists (the event_list structure), enqueue your events in them and explicitly ask to run them.

Function

event * ev_new (pool * p) -- create a new event

Arguments

pool * p

resource pool

Description

This function creates a new event resource. To use it, you need to fill the structure fields and call ev_schedule().

Function

void ev_run (event * e) -- run an event

Arguments

event * e

an event

Description

This function explicitly runs the event e (calls its hook function) and removes it from an event list if it's linked to any.

From the hook function, you can call ev_enqueue() or ev_schedule() to re-add the event.

Function

void ev_enqueue (event_list * l, event * e) -- enqueue an event

Arguments

event_list * l

an event list

event * e

an event

Description

ev_enqueue() stores the event e to the specified event list l which can be run by calling ev_run_list().

Function

void ev_schedule (event * e) -- schedule an event

Arguments

event * e

an event

Description

This function schedules an event by enqueueing it to a system-wide event list which is run by the platform dependent code whenever appropriate.

Function

int ev_run_list (event_list * l) -- run an event list

Arguments

event_list * l

an event list

Description

This function calls ev_run() for all events enqueued in the list l.

8.7 Timers

Timers are resources which represent a wish of a module to call a function at the specified time. The platform dependent code doesn't guarantee exact timing, only that a timer function won't be called before the requested time.

In BIRD, time is represented by values of the bird_clock_t type which are integral numbers interpreted as a relative number of seconds since some fixed time point in past. The current time can be read from variable now with reasonable accuracy and is monotonic. There is also a current 'absolute' time in variable now_real reported by OS.

Each timer is described by a timer structure containing a pointer to the handler function (hook), data private to this function (data), time the function should be called at (expires, 0 for inactive timers), for the other fields see timer.h.

Function

timer * tm_new (pool * p) -- create a timer

Arguments

pool * p

pool

Description

This function creates a new timer resource and returns a pointer to it. To use the timer, you need to fill in the structure fields and call tm_start() to start timing.

Function

void tm_start (timer * t, unsigned after) -- start a timer

Arguments

timer * t

timer

unsigned after

number of seconds the timer should be run after

Description

This function schedules the hook function of the timer to be called after after seconds. If the timer has been already started, it's expire time is replaced by the new value.

You can have set the randomize field of t, the timeout will be increased by a random number of seconds chosen uniformly from range 0 .. randomize.

You can call tm_start() from the handler function of the timer to request another run of the timer. Also, you can set the recurrent field to have the timer re-added automatically with the same timeout.

Function

void tm_stop (timer * t) -- stop a timer

Arguments

timer * t

timer

Description

This function stops a timer. If the timer is already stopped, nothing happens.

Function

bird_clock_t tm_parse_datetime (char * x) -- parse a date and time

Arguments

char * x

datetime string

Description

tm_parse_datetime() takes a textual representation of a date and time (dd-mm-yyyy hh:mm:ss) and converts it to the corresponding value of type bird_clock_t.

Function

bird_clock_t tm_parse_date (char * x) -- parse a date

Arguments

char * x

date string

Description

tm_parse_date() takes a textual representation of a date (dd-mm-yyyy) and converts it to the corresponding value of type bird_clock_t.

Function

void tm_format_datetime (char * x, struct timeformat * fmt_spec, bird_clock_t t) -- convert date and time to textual representation

Arguments

char * x

destination buffer of size TM_DATETIME_BUFFER_SIZE

struct timeformat * fmt_spec

specification of resulting textual representation of the time

bird_clock_t t

time

Description

This function formats the given relative time value t to a textual date/time representation (dd-mm-yyyy hh:mm:ss) in real time.

8.8 Sockets

Socket resources represent network connections. Their data structure (socket) contains a lot of fields defining the exact type of the socket, the local and remote addresses and ports, pointers to socket buffers and finally pointers to hook functions to be called when new data have arrived to the receive buffer (rx_hook), when the contents of the transmit buffer have been transmitted (tx_hook) and when an error or connection close occurs (err_hook).

Freeing of sockets from inside socket hooks is perfectly safe.

Function

int sk_setup_multicast (sock * s) -- enable multicast for given socket

Arguments

sock * s

socket

Description

Prepare transmission of multicast packets for given datagram socket. The socket must have defined iface.

Result

0 for success, -1 for an error.

Function

int sk_join_group (sock * s, ip_addr maddr) -- join multicast group for given socket

Arguments

sock * s

socket

ip_addr maddr

multicast address

Description

Join multicast group for given datagram socket and associated interface. The socket must have defined iface.

Result

0 for success, -1 for an error.

Function

int sk_leave_group (sock * s, ip_addr maddr) -- leave multicast group for given socket

Arguments

sock * s

socket

ip_addr maddr

multicast address

Description

Leave multicast group for given datagram socket and associated interface. The socket must have defined iface.

Result

0 for success, -1 for an error.

Function

int sk_setup_broadcast (sock * s) -- enable broadcast for given socket

Arguments

sock * s

socket

Description

Allow reception and transmission of broadcast packets for given datagram socket. The socket must have defined iface. For transmission, packets should be send to brd address of iface.

Result

0 for success, -1 for an error.

Function

int sk_set_ttl (sock * s, int ttl) -- set transmit TTL for given socket

Arguments

sock * s

socket

int ttl

TTL value

Description

Set TTL for already opened connections when TTL was not set before. Useful for accepted connections when different ones should have different TTL.

Result

0 for success, -1 for an error.

Function

int sk_set_min_ttl (sock * s, int ttl) -- set minimal accepted TTL for given socket

Arguments

sock * s

socket

int ttl

TTL value

Description

Set minimal accepted TTL for given socket. Can be used for TTL security. implementations.

Result

0 for success, -1 for an error.

Function

int sk_set_md5_auth (sock * s, ip_addr local, ip_addr remote, struct iface * ifa, char * passwd, int setkey) -- add / remove MD5 security association for given socket

Arguments

sock * s

socket

ip_addr local

IP address of local side

ip_addr remote

IP address of remote side

struct iface * ifa

Interface for link-local IP address

char * passwd

Password used for MD5 authentication

int setkey

Update also system SA/SP database

Description

In TCP MD5 handling code in kernel, there is a set of security associations used for choosing password and other authentication parameters according to the local and remote address. This function is useful for listening socket, for active sockets it may be enough to set s->password field.

When called with passwd != NULL, the new pair is added, When called with passwd == NULL, the existing pair is removed.

Note that while in Linux, the MD5 SAs are specific to socket, in BSD they are stored in global SA/SP database (but the behavior also must be enabled on per-socket basis). In case of multiple sockets to the same neighbor, the socket-specific state must be configured for each socket while global state just once per src-dst pair. The setkey argument controls whether the global state (SA/SP database) is also updated.

Result

0 for success, -1 for an error.

Function

int sk_set_ipv6_checksum (sock * s, int offset) -- specify IPv6 checksum offset for given socket

Arguments

sock * s

socket

int offset

offset

Description

Specify IPv6 checksum field offset for given raw IPv6 socket. After that, the kernel will automatically fill it for outgoing packets and check it for incoming packets. Should not be used on ICMPv6 sockets, where the position is known to the kernel.

Result

0 for success, -1 for an error.

Function

sock * sock_new (pool * p) -- create a socket

Arguments

pool * p

pool

Description

This function creates a new socket resource. If you want to use it, you need to fill in all the required fields of the structure and call sk_open() to do the actual opening of the socket.

The real function name is sock_new(), sk_new() is a macro wrapper to avoid collision with OpenSSL.

Function

int sk_open (sock * s) -- open a socket

Arguments

sock * s

socket

Description

This function takes a socket resource created by sk_new() and initialized by the user and binds a corresponding network connection to it.

Result

0 for success, -1 for an error.

Function

int sk_send (sock * s, unsigned len) -- send data to a socket

Arguments

sock * s

socket

unsigned len

number of bytes to send

Description

This function sends len bytes of data prepared in the transmit buffer of the socket s to the network connection. If the packet can be sent immediately, it does so and returns 1, else it queues the packet for later processing, returns 0 and calls the tx_hook of the socket when the tranmission takes place.

Function

int sk_send_to (sock * s, unsigned len, ip_addr addr, unsigned port) -- send data to a specific destination

Arguments

sock * s

socket

unsigned len

number of bytes to send

ip_addr addr

IP address to send the packet to

unsigned port

port to send the packet to

Description

This is a sk_send() replacement for connection-less packet sockets which allows destination of the packet to be chosen dynamically. Raw IP sockets should use 0 for port.

Function

void io_log_event (void * hook, void * data) -- mark approaching event into event log

Arguments

void * hook

event hook address

void * data

event data address

Description

Store info (hook, data, timestamp) about the following internal event into a circular event log (event_log). When latency tracking is enabled, the log entry is kept open (in event_open) so the duration can be filled later.

Next Previous Contents bird-1.6.3/doc/prog-head.sgml0000644000103200001440000000105313027054563014730 0ustar feelausers BIRD Programmer's Documentation <author> Ondrej Filip <it/<feela@network.cz>/, Pavel Machek <it/<pavel@ucw.cz>/, Martin Mares <it/<mj@ucw.cz>/, Ondrej Zajicek <it/<santiago@crfreenet.org>/ </author> <abstract> This document contains programmer's documentation for the BIRD Internet Routing Daemon project. </abstract> <!-- Table of contents --> <toc> <!-- Begin the document --> �������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������bird-1.6.3/doc/bird-7.html��������������������������������������������������������������������������0000644�0001032�0000144�00000004500�13027054674�014153� 0����������������������������������������������������������������������������������������������������ustar �feela���������������������������users������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN"> <HTML> <HEAD> <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 1.0.9"> <TITLE>BIRD User's Guide: Conclusions Next Previous Contents

7. Conclusions

7.1 Future work

Although BIRD supports all the commonly used routing protocols, there are still some features which would surely deserve to be implemented in future versions of BIRD:

  • Opaque LSA's
  • Route aggregation and flap dampening
  • Multipath routes
  • Multicast routing protocols
  • Ports to other systems

7.2 Getting more help

If you use BIRD, you're welcome to join the bird-users mailing list (bird-users@network.cz) where you can share your experiences with the other users and consult your problems with the authors. To subscribe to the list, visit http://bird.network.cz/?m_list. The home page of BIRD can be found at http://bird.network.cz/.

BIRD is a relatively young system and it probably contains some bugs. You can report any problems to the bird-users list and the authors will be glad to solve them, but before you do so, please make sure you have read the available documentation and that you are running the latest version (available at bird.network.cz:/pub/bird). (Of course, a patch which fixes the bug is always welcome as an attachment.)

If you want to understand what is going inside, Internet standards are a good and interesting reading. You can get them from ftp.rfc-editor.org (or a nicely sorted version from atrey.karlin.mff.cuni.cz:/pub/rfc).

Good luck!

Next Previous Contents bird-1.6.3/doc/birddoc.sty0000777000103200001440000000000013027054646017314 2tex/birddoc.styustar feelausersbird-1.6.3/doc/bird.conf.example0000644000103200001440000001422713027054563015426 0ustar feelausers/* * This is an example configuration file. */ # Yes, even shell-like comments work... # Configure logging #log syslog { debug, trace, info, remote, warning, error, auth, fatal, bug }; #log stderr all; #log "tmp" all; # Override router ID #router id 198.51.100.1; # You can define your own symbols... #define xyzzy = (120+10); #define '1a-a1' = (30+40); # Define a route filter... #filter test_filter { # if net ~ 10.0.0.0/16 then accept; # else reject; #} #filter sink { reject; } #filter okay { accept; } #include "filters.conf"; # Define another routing table #table testable; # Turn on global debugging of all protocols #debug protocols all; # Turn on internal watchdog #watchdog warning 5 s; #watchdog timeout 30 s; # The direct protocol automatically generates device routes to # all network interfaces. Can exist in as many instances as you wish # if you want to populate multiple routing tables with device routes. #protocol direct { # interface "-eth*", "*"; # Restrict network interfaces it works with #} # This pseudo-protocol performs synchronization between BIRD's routing # tables and the kernel. If your kernel supports multiple routing tables # (as Linux 2.2.x does), you can run multiple instances of the kernel # protocol and synchronize different kernel tables with different BIRD tables. protocol kernel { # learn; # Learn all alien routes from the kernel persist; # Don't remove routes on bird shutdown scan time 20; # Scan kernel routing table every 20 seconds # import none; # Default is import all export all; # Default is export none # kernel table 5; # Kernel table to synchronize with (default: main) } # This pseudo-protocol watches all interface up/down events. protocol device { scan time 10; # Scan interfaces every 10 seconds } # Static routes (again, there can be multiple instances, so that you # can disable/enable various groups of static routes on the fly). protocol static { # disabled; # Disable by default # table testable; # Connect to a non-default table # preference 1000; # Default preference of routes # debug { states, routes, filters, interfaces, events, packets }; # debug all; # route 0.0.0.0/0 via 198.51.100.13; # route 198.51.100.0/25 unreachable; # route 10.0.0.0/8 unreachable; # route 10.1.1.0:255.255.255.0 via 198.51.100.3; # route 10.1.2.0:255.255.255.0 via 198.51.100.3; # route 10.1.3.0:255.255.255.0 via 198.51.100.4; # route 10.2.0.0/24 via "arc0"; } # Pipe protocol connects two routing tables... Beware of loops. #protocol pipe { # peer table testable; # Define what routes do we export to this protocol / import from it. # import all; # default is all # export all; # default is none # import none; # If you wish to disable imports # import filter test_filter; # Use named filter # import where source = RTS_DEVICE; # Use explicit filter #} # RIP aka Rest In Pieces... #protocol rip MyRIP { # You can also use an explicit name # preference xyzzy; # debug all; # port 1520; # period 7; # infinity 16; # garbage time 60; # interface "*" { mode broadcast; }; # honor neighbor; # To whom do we agree to send the routing table # honor always; # honor never; # passwords { # password "nazdar"; # }; # authentication none; # import filter { print "importing"; accept; }; # export filter { print "exporting"; accept; }; #} #protocol ospf MyOSPF { # tick 2; # rfc1583compat yes; # area 0.0.0.0 { # stub no; # interface "eth*" { # hello 9; # retransmit 6; # cost 10; # transmit delay 5; # dead count 5; # wait 50; # type broadcast; # authentication simple; # password "pass"; # }; # interface "arc0" { # rx buffer large; # type nonbroadcast; # poll 14; # dead 75; # neighbors { # 10.1.1.2 eligible; # 10.1.1.4; # }; # strict nonbroadcast yes; # }; # interface "xxx0" { # passwords { # password "abc" { # id 1; # generate to "22-04-2003 11:00:06"; # accept to "17-01-2004 12:01:05"; # }; # password "def" { # id 2; # generate from "22-04-2003 11:00:07"; # accept from "17-01-2003 12:01:05"; # }; # }; # authentication cryptographic; # }; # }; # area 20 { # stub 1; # interface "ppp1" { # hello 8; # authentication none; # }; # interface "fr*"; # virtual link 192.168.0.1 { # password "sdsdffsdfg"; # authentication cryptographic; # }; # }; #} #protocol bgp { # disabled; # description "My BGP uplink"; # local as 65000; # neighbor 198.51.100.130 as 64496; # multihop; # hold time 240; # startup hold time 240; # connect retry time 120; # keepalive time 80; # defaults to hold time / 3 # start delay time 5; # How long do we wait before initial connect # error wait time 60, 300;# Minimum and maximum time we wait after an error (when consecutive # # errors occur, we increase the delay exponentially ... # error forget time 300; # ... until this timeout expires) # disable after error; # Disable the protocol automatically when an error occurs # next hop self; # Disable next hop processing and always advertise our local address as nexthop # path metric 1; # Prefer routes with shorter paths (like Cisco does) # default bgp_med 0; # MED value we use for comparison when none is defined # default bgp_local_pref 0; # The same for local preference # source address 198.51.100.14; # What local address we use for the TCP connection # password "secret"; # Password used for MD5 authentication # rr client; # I am a route reflector and the neighor is my client # rr cluster id 1.0.0.1; # Use this value for cluster id instead of my router id # export where source=RTS_STATIC; # export filter { # if source = RTS_STATIC then { # bgp_community = -empty-; bgp_community = add(bgp_community,(65000,5678)); # bgp_origin = 0; # bgp_community = -empty-; bgp_community.add((65000,5678)); # if (65000,64501) ~ bgp_community then # bgp_community.add((0, 1)); # if bgp_path ~ [= 65000 =] then # bgp_path.prepend(65000); # accept; # } # reject; # }; #} # # Template usage example #template bgp rr_client { # disabled; # local as 65000; # multihop; # rr client; # rr cluster id 1.0.0.1; #} # #protocol bgp rr_abcd from rr_client { # neighbor 10.1.4.7 as 65000; #} bird-1.6.3/doc/prog-spell.sed0000644000103200001440000000042213027054563014756 0ustar feelauserss%[^<]*%%g s%[^<]*%%g s%[^<]*%%g s%[^<]*%%g s%/ ]\+/%%g s%/ ]*>%%g s%&[^;]*;%%g bird-1.6.3/doc/prog-foot.sgml0000644000103200001440000000001113027054563014767 0ustar feelausers bird-1.6.3/doc/prog.html0000644000103200001440000001116513027054667014045 0ustar feelausers BIRD Programmer's Documentation Next Previous Contents

BIRD Programmer's Documentation

Ondrej Filip <feela@network.cz>, Pavel Machek <pavel@ucw.cz>, Martin Mares <mj@ucw.cz>, Ondrej Zajicek <santiago@crfreenet.org>

This document contains programmer's documentation for the BIRD Internet Routing Daemon project.

1. BIRD Design

2. Core

3. Configuration

4. Filters

5. Protocols

6. System dependent parts

7. Library functions

8. Resources

Next Previous Contents bird-1.6.3/doc/sbase/0000755000103200001440000000000013027054563013274 5ustar feelausersbird-1.6.3/doc/sbase/dist/0000755000103200001440000000000013027054563014237 5ustar feelausersbird-1.6.3/doc/sbase/dist/fmt_latex2e.pl0000644000103200001440000003617213027054563017017 0ustar feelausers# # fmt_latex2e.pl # # $Id$ # # LaTeX-specific driver stuff # # © Copyright 1996, Cees de Groot # # Support for PDF files: added by Juan Jose Amor, January 2000 # © Copyright 2000, Juan Jose Amor # package LinuxDocTools::fmt_latex2e; use strict; use LinuxDocTools::CharEnts; use LinuxDocTools::Vars; use LinuxDocTools::Lang; use File::Copy; my $latex2e = {}; $latex2e->{NAME} = "latex2e"; $latex2e->{HELP} = <{OPTIONS} = [ { option => "output", type => "l", 'values' => [ "dvi", "tex", "ps", "pdf" ], short => "o" }, { option => "bibtex", type => "f", short => "b" }, { option => "makeindex", type => "f", short => "m" }, { option => "pagenumber", type => "i", short => "n" }, { option => "quick", type => "f", short => "q" }, { option => "dvips", type => "l", 'values' => [ "dvips", "dvi2ps", "jdvi2kps" ], short => "s" }, { option => "latex", type => "l", 'values' => [ "latex", "hlatexp", "platex", "jlatex" ], short => "x" } ]; $latex2e->{output} = "tex"; $latex2e->{pagenumber} = 1; $latex2e->{quick} = 0; $latex2e->{bibtex} = 0; $latex2e->{makeindex} = 0; $latex2e->{latex} = "unknown"; $latex2e->{dvips} = "unknown"; $Formats{$latex2e->{NAME}} = $latex2e; $latex2e->{preNSGMLS} = sub { $global->{NsgmlsOpts} .= " -ifmttex "; # for Japanese jlatex users if ($global->{language} eq "ja" && $latex2e->{latex} eq "unknown") { $latex2e->{latex} = "jlatex"; $latex2e->{dvips} = "dvi2ps"; # for Japanese platex users # $latex2e->{latex} = "platex"; # $latex2e->{dvips} = "dvips"; } # for Korean users if ($global->{language} eq "ko" && $latex2e->{latex} eq "unknown") { $latex2e->{latex} = "hlatexp"; } # default process command $latex2e->{latex} = "latex" if ($latex2e->{latex} eq "unknown"); $latex2e->{dvips} = "dvips" if ($latex2e->{dvips} eq "unknown"); $global->{NsgmlsPrePipe} = "cat $global->{file} "; }; # extra `\\' here for standard `nsgmls' output my %latex2e_escapes; $latex2e_escapes{'#'} = '\\\\#'; $latex2e_escapes{'$'} = '\\\\$'; $latex2e_escapes{'%'} = '\\\\%'; $latex2e_escapes{'&'} = '\\\\&'; $latex2e_escapes{'~'} = '\\\\~{}'; $latex2e_escapes{'_'} = '\\\\_'; $latex2e_escapes{'^'} = '\\\\^{}'; $latex2e_escapes{'\\'} = '\\verb+\\+'; $latex2e_escapes{'{'} = '\\\\{'; $latex2e_escapes{'}'} = '\\\\}'; $latex2e_escapes{'>'} = '{$>$}'; $latex2e_escapes{'<'} = '{$<$}'; # wouldn't happen, but that's what'd be $latex2e_escapes{'|'} = '{$|$}'; my $in_verb; my $remove_comment; # added 2000 Jan 25 by t.sano # passed to `parse_data' below in latex2e_preASP my $latex2e_escape = sub { my ($data) = @_; if (!$in_verb) { # escape special characters $data =~ s|([#\$%&~_^\\{}<>\|])|$latex2e_escapes{$1}|ge; } return ($data); }; # # Translate character entities and escape LaTeX special chars. # $latex2e->{preASP} = sub { my ($infile, $outfile) = @_; # note the conversion of `sdata_dirs' list to an anonymous array to # make a single argument my $tex_char_maps = load_char_maps ('.2tex', [ Text::EntityMap::sdata_dirs() ]); # ASCII char maps are used in the verbatim environment because TeX # ignores all the escapes my $ascii_char_maps = load_char_maps ('.2ab', [ Text::EntityMap::sdata_dirs() ]); $ascii_char_maps = load_char_maps ('.2l1b', [ Text::EntityMap::sdata_dirs() ]) if $global->{charset} eq "latin"; my $char_maps = $tex_char_maps; # used in `latex2e_escape' anonymous sub to switch between escaping # characters from SGML source or not, depending on whether we're in # a VERB or CODE environment or not $in_verb = 0; # switch to remove empty line from TeX source or not, depending # on whether we're in a HEADING or ABSTRACT environment or not $remove_comment = 0; while (<$infile>) { if (/^-/) { my ($str) = $'; chop ($str); $_ = parse_data ($str, $char_maps, $latex2e_escape); if ($remove_comment) { s/(\s+\\n)+//; } print $outfile "-" . $_ . "\n"; } elsif (/^A/) { /^A(\S+) (IMPLIED|CDATA|NOTATION|ENTITY|TOKEN)( (.*))?$/ || die "bad attribute data: $_\n"; my ($name,$type,$value) = ($1,$2,$4); if ($type eq "CDATA") { # CDATA attributes get translated also if ($name eq "URL" or $name eq "ID" or $name eq "CA") { # URL for url.sty is a kind of verbatim... # CA is used in "tabular" element. # Thanks to Evgeny Stambulchik, he posted this fix # on sgml-tools list. 2000 May 17, t.sano my $old_verb = $in_verb; $in_verb = 1; $value = parse_data ($value, $ascii_char_maps, $latex2e_escape); $in_verb = $old_verb; } else { $value = parse_data ($value, $char_maps, $latex2e_escape); } } print $outfile "A$name $type $value\n"; } elsif (/^\((VERB|CODE)/) { print $outfile $_; # going into VERB/CODE section $in_verb = 1; $char_maps = $ascii_char_maps; } elsif (/^\)(VERB|CODE)/) { print $outfile $_; # leaving VERB/CODE section $in_verb = 0; $char_maps = $tex_char_maps; } elsif (/^\((HEADING|ABSTRACT)/) { print $outfile $_; # empty lines (comment in sgml source) do harm # in HEADING or ABSTRACT $remove_comment = 1; } elsif (/^\)(HEADING|ABSTRACT)/) { print $outfile $_; # leaving HEADING or ABSTRACT section $remove_comment = 0; } else { print $outfile $_; } } }; # return the string of the name of the macro for urldef sub latex2e_defnam($) { my ($num) = @_; if ($num > 26*26*26) { die "Too many URLs!\n"; } my $anum = ord("a"); my $defnam = chr ($anum + ($num / 26 / 26)) . chr ($anum + ($num / 26 % 26)) . chr ($anum + ($num % 26)); return ($defnam); }; # # Take the sgmlsasp output, and make something # useful from it. # $latex2e->{postASP} = sub { my $infile = shift; my $filename = $global->{filename}; my $tmplatexdir = $global->{tmpbase} . "-latex-" . $$ . ".dir"; my $tmplatexnam = $tmplatexdir . "/" . $filename; my @epsfiles = (); my @texlines = (); my @urldefines = (); my @urlnames = (); my $urlnum = 0; my $tmpepsf; my $saved_umask = umask; $ENV{TEXINPUTS} .= ":$main::DataDir"; umask 0077; mkdir ($tmplatexdir, 0700) || return -1; # # check epsfile is specified in source file # check nameurl specified in source file # { my $epsf; open SGMLFILE, "<$filename.sgml"; while () { # for epsfile if ( s/^\s*/$1/ ) { s/\s+angle=.*//; s/\s+height=.*//; s/\"//g; $epsf = $_; chop ( $epsf ); push @epsfiles, $epsf; } if ($latex2e->{output} eq "pdf") { if ( s/^\s*/$1/ ) { s/\"//g; $epsf = $_; chop ( $epsf ); push @epsfiles, $epsf; } } } close SGMLFILE; } { my $urlid; my $urlnam; my $urldef; while (<$infile>) { push @texlines, $_; # for nameurl if ( /\\nameurl/ ) { ($urlid, $urlnam) = ($_ =~ /\\nameurl\{(.*)\}\{(.*)\}/); print $urlnum . ": " . $urlid . "\n" if ( $global->{debug} ); $urldef = latex2e_defnam($urlnum) . "url"; s/\\nameurl\{.*\}\{.*\}/{\\em $urlnam} {\\tt \\$urldef}/; push @urlnames, $_; push @urldefines, "\\urldef{\\$urldef} \\url{$urlid}\n"; $urlnum++; } } close $infile; } open OUTFILE, ">$tmplatexnam.tex"; # # Set the correct \documentclass options. # { my $langlit = ISO2English ($global->{language}); $langlit = ($langlit eq 'english') ? "" : ",$langlit"; my $replace = $global->{papersize} . 'paper' . $langlit; my $hlatexopt = ""; $global->{charset} = "nippon" if ($global->{language} eq "ja"); $global->{charset} = "euc-kr" if ($global->{language} eq "ko"); $replace = $global->{papersize} . 'paper' if ($global->{charset} eq "nippon") || ($global->{charset} eq "euc-kr"); while (defined($texlines[0])) { $_ = shift @texlines; if (/^\\documentclass/) { if ($global->{language} ne "en" || $global->{papersize} ne "a4") { s/\\documentclass\[.*\]/\\documentclass\[$replace\]/; } if ($global->{charset} eq "nippon") { if ($latex2e->{latex} eq "platex") { s/{article}/{jarticle}/; } elsif ($latex2e->{latex} eq "jlatex") { s/{article}/{j-article}/; } } $_ = $_ . "\\makeindex\n" if ($latex2e->{makeindex}); } if (/^\\usepackage.epsfig/ && ($global->{charset} eq "euc-kr")) { $hlatexopt = "[noautojosa]" if ($latex2e->{latex} eq "hlatexp"); $_ = $_ . "\\usepackage" . "$hlatexopt" . "{hangul}\n" } if ((/\\usepackage.t1enc/) && (($global->{charset} eq "nippon") || ($global->{charset} eq "euc-kr"))) { s/^/%%/; } if (/%end-preamble/) { if ($latex2e->{pagenumber}) { $_ = $_ . '\setcounter{page}{'. $latex2e->{pagenumber} . "}\n"; } else { $_ = $_ . "\\pagestyle{empty}\n"; } $_ = $_ . $global->{pass} . "\n" if ($global->{pass}); } if (/\\nameurl/ && $latex2e->{output} ne "pdf") { $_ = shift @urlnames; } print OUTFILE; if (/%end-preamble/) { if ($urlnum && $latex2e->{output} ne "pdf") { while (defined($urldefines[0])) { $_ = shift @urldefines; print OUTFILE; } } } } } close OUTFILE; # # LaTeX, dvips, and assorted cleanups. # if ($latex2e->{output} eq "tex") { # comment out, because this backup action is not documented yet. # # if ( -e "$filename.tex" ) { # rename ("$filename.tex", "$filename.tex.back"); # } umask $saved_umask; copy ("$tmplatexnam.tex", "$filename.tex"); if ( ! $global->{debug} ) { unlink ("$tmplatexnam.tex"); rmdir ($tmplatexdir) || return -1; } return 0; } # # Run LaTeX in nonstop mode so it won't prompt & hang on errors. # Suppress the output of LaTeX on all but the last pass, after # references have been resolved. This avoids large numbers of # spurious warnings. # my $current_dir; chop ($current_dir = `pwd`); print $current_dir . "\n" if ( $global->{debug} ); # # copy epsfiles specified in tex file # for my $epsf ( @epsfiles ) { $tmpepsf = $tmplatexdir . "/" . $epsf; print $epsf . " " . $tmpepsf . "\n" if ( $global->{debug} ); copy ("$epsf", "$tmpepsf") or die "can not copy graphics\n"; } # # go to the temporary directory chdir ($tmplatexdir); my ($latexcommand) = "$latex2e->{latex} '\\nonstopmode\\input{$filename.tex}'"; # # We run pdflatex instead of latex if user selected pdf output # if ($latex2e->{output} eq "pdf") { $latexcommand = "pdflatex '\\nonstopmode\\input{$filename.tex}'"; } # # run hlatex if hlatexp is used # for pdf: how about status?(for hlatex and hlatexp) # if ($latex2e->{latex} eq "hlatexp") { #$latex2e->{output} = "ps" if ($latex2e->{output} eq "pdf"); $latexcommand = "hlatex '\\nonstopmode\\input{$filename.tex}'"; } # # We use jlatex for Japanese encoded (euc-jp) characters. # pdf support for Japanese are not yet. use ps for the time being. # if ($global->{charset} eq "nippon") { $latex2e->{output} = "ps" if ($latex2e->{output} eq "pdf"); $latexcommand = "$latex2e->{latex} '\\nonstopmode\\input{$filename.tex}'" } my ($suppress) = $latex2e->{quick} ? "" : ' >/dev/null'; system $latexcommand . $suppress || die "LaTeX problem\n"; $latex2e->{bibtex} && system "bibtex $filename.tex"; $latex2e->{quick} || system $latexcommand . ' >/dev/null'; $latex2e->{quick} || system $latexcommand; if ( ! $global->{debug} ) { my @suffixes = qw(log blg aux toc lof lot dlog bbl out); for my $suf (@suffixes) { unlink "$tmplatexnam.$suf"; } } # # go back to the working directory chdir ($current_dir); # # output dvi file if ($latex2e->{output} eq "dvi") { # comment out, because this backup action is not documented yet. # # if ( -e "$filename.dvi" ) # { # rename ("$filename.dvi", "$filename.dvi.back"); # } umask $saved_umask; copy ("$tmplatexnam.dvi", "$filename.dvi"); if ( $global->{debug} ) { print "Temporary files are in $tmplatexdir\n"; print "Please check there and remove them manually.\n"; } else { unlink ("$tmplatexnam.tex", "$tmplatexnam.dvi"); for my $epsf ( @epsfiles ) { $tmpepsf = $tmplatexdir . "/" . $epsf; print $tmpepsf . "\n" if ( $global->{debug} ); unlink ("$tmpepsf"); } rmdir ($tmplatexdir) || return -1; } return 0; } # # output pdf file if ($latex2e->{output} eq "pdf") { # comment out, because this backup action is not documented yet. # # if ( -e "$filename.pdf" ) # { # rename ("$filename.pdf", "$filename.pdf.back"); # } umask $saved_umask; copy ("$tmplatexnam.pdf", "$filename.pdf"); if ( $global->{debug} ) { print "Temporary files are in $tmplatexdir\n"; print "Please check there and remove them manually.\n"; } else { unlink ("$tmplatexnam.tex", "$tmplatexnam.pdf"); for my $epsf ( @epsfiles ) { $tmpepsf = $tmplatexdir . "/" . $epsf; print $tmpepsf . "\n" if ( $global->{debug} ); unlink ("$tmpepsf"); } rmdir ($tmplatexdir) || return -1; } return 0; } # # convert dvi into ps using dvips command chdir ($tmplatexdir); if ($latex2e->{dvips} eq "dvi2ps") { `dvi2ps -q -o $global->{papersize} -c $tmplatexnam.ps $filename.dvi`; } elsif ($latex2e->{dvips} eq "jdvi2kps") { `jdvi2kps -q -pa $global->{papersize} -o $tmplatexnam.ps $filename.dvi`; } else { `dvips -R -q -t $global->{papersize} -o $tmplatexnam.ps $filename.dvi`; } chdir ($current_dir); # comment out, because this backup action is not documented yet. # # if ( -e "$filename.ps" ) # { # rename ("$filename.ps", "$filename.ps.back"); # } umask $saved_umask; copy ("$tmplatexnam.ps", "$filename.ps"); unlink ("$tmplatexnam.ps"); if ( $global->{debug} ) { print "Temporary files are in $tmplatexdir\n"; print "Please check there and remove them manually.\n"; } else { unlink ("$tmplatexnam.tex", "$tmplatexnam.dvi", "$tmplatexnam.ps"); for my $epsf ( @epsfiles ) { $tmpepsf = $tmplatexdir . "/" . $epsf; print $tmpepsf . "\n" if ( $global->{debug} ); unlink ("$tmpepsf"); } rmdir ($tmplatexdir) || return -1; } return 0; }; 1; bird-1.6.3/doc/sbase/dist/fmt_html.pl0000644000103200001440000001013613027054563016407 0ustar feelausers# # fmt_html.pl # # $Id$ # # HTML-specific driver stuff # # © Copyright 1996, Cees de Groot # package LinuxDocTools::fmt_html; use strict; use LinuxDocTools::CharEnts; use LinuxDocTools::Vars; use LinuxDocTools::FixRef; my $fixref = $LinuxDocTools::FixRef::fixref; use LinuxDocTools::Html2Html; my $html2html = $LinuxDocTools::Html2Html::html2html; my $html = {}; $html->{NAME} = "html"; $html->{HELP} = ""; $html->{OPTIONS} = [ { option => "split", type => "l", 'values' => [ "0", "1", "2" ], short => "s" }, { option => "toc", type => "l", 'values' => [ "0", "1", "2" ], short => "T" }, { option => "dosnames", type => "f", short => "h" }, { option => "imagebuttons", type => "f", short => "I"}, { option => "header", type => "s", short => "H"}, { option => "footer", type => "s", short => "F"} ]; $html->{'split'} = 1; $html->{'toc'} = -1; $html->{dosnames} = 0; $html->{imagebuttons} = 0; $html->{header} = ""; $html->{footer} = ""; $html->{preNSGMLS} = sub { $global->{NsgmlsOpts} .= " -ifmthtml "; $global->{NsgmlsPrePipe} = "cat $global->{file}"; }; $Formats{$html->{NAME}} = $html; # HTML escape sub. this is called-back by `parse_data' below in # `html_preASP' to properly escape `<' and `&' characters coming from # the SGML source. my %html_escapes; $html_escapes{'&'} = '&'; $html_escapes{'<'} = '<'; my $html_escape = sub { my ($data) = @_; # replace the char with it's HTML equivalent $data =~ s|([&<])|$html_escapes{$1}|ge; return ($data); }; # # Translate character entities and escape HTML special chars. # $html->{preASP} = sub { my ($infile, $outfile) = @_; # note the conversion of `sdata_dirs' list to an anonymous array to # make a single argument my $char_maps = load_char_maps ('.2html', [ Text::EntityMap::sdata_dirs() ]); while (<$infile>) { if (/^-/) { my ($str) = $'; chop ($str); print $outfile "-" . parse_data ($str, $char_maps, $html_escape) . "\n"; } elsif (/^A/) { /^A(\S+) (IMPLIED|CDATA|NOTATION|ENTITY|TOKEN)( (.*))?$/ || die "bad attribute data: $_\n"; my ($name,$type,$value) = ($1,$2,$4); if ($type eq "CDATA") { # CDATA attributes get translated also $value = parse_data ($value, $char_maps, $html_escape); } print $outfile "A$name $type $value\n"; } else { print $outfile $_; } } return 0; }; # # Take the sgmlsasp output, and make something # useful from it. # $html->{postASP} = sub { my $infile = shift; my $filename = $global->{filename}; # # Set various stuff as a result of option processing. # my $ext = "html"; $ext = "htm" if $html->{dosnames}; my $img = 0; $img = 1 if $html->{imagebuttons}; # # Bring in file # my @file = <$infile>; # # Find references # &{$fixref->{init}}($html->{'split'}); LINE: foreach (@file) { foreach my $pat (keys %{$fixref->{rules}}) { if (/$pat/) { # Call rule function then skip to next line &{$fixref->{rules}->{$pat}}; next LINE; } } &{$fixref->{defaultrule}}; } &{$fixref->{finish}}; # # Run through html2html, preserving stdout # Also, handle prehtml.sed's tasks # my $filter = ""; # $filter = "|$main::progs->{NKF} -e" if ($global->{language} eq "ja"); open SAVEOUT, ">&STDOUT"; open STDOUT, "$filter>$filename.$ext" or die qq(Cannot open "$filename.$ext"); &{$html2html->{init}}($html->{'split'}, $ext, $img, $filename, $fixref->{filenum}, $fixref->{lrec}, $html->{'header'}, $html->{'footer'}, $html->{'toc'}, $global->{tmpbase}, $global->{debug}); LINE: foreach (@file) { s,

,,g; # remove empty

containers foreach my $pat (keys %{$html2html->{rules}}) { if (/$pat/) { # Call rule function then skip to next line &{$html2html->{rules}->{$pat}}; next LINE; } } &{$html2html->{defaultrule}}; } &{$html2html->{finish}}; close STDOUT; open STDOUT, ">&SAVEOUT"; return 0; }; 1; bird-1.6.3/doc/sbase/dist/birddoc/0000755000103200001440000000000013027054563015645 5ustar feelausersbird-1.6.3/doc/sbase/dist/birddoc/html/0000755000103200001440000000000013027054563016611 5ustar feelausersbird-1.6.3/doc/sbase/dist/birddoc/html/mapping0000644000103200001440000001377613027054563020205 0ustar feelausers % Converts qwertz files to html files ready for fixref and html2html. % % This file is R-Rated because of uglyness. % % -Magnus + "<@@enddoc>" +
+ "<@@enddoc>" + + "<@@enddoc>" + + "<@@enddoc>" + + "<@@enddoc>" + % Manual Pages are expected to be formatted using nroff (or groff), unless % they are included as sections of other qwertz documents. + "<@@title>" + "

" "

" + + "

" "

" " and " + "Thanks " + "

" "

" + "
"
+ "" + + "" + + "

Comment

" + + "

\n" "\n
" + + "

Appendix

" + + "<@@chapt>" + "<@@endchapt>" + + "<@@sect>" + "<@@endsect>" + + "<@@ssect>" + "<@@endssect>" + + "<@@head>" + "<@@head>" + "<@@head>" + "<@@endhead>" +

"

"

"" + "
" + "
    " + + "
" + + "
    " + + "
" + + "
" + + "
" + + "
  • " "
    • " + "
    " "
    " "
    " "
    " "[[ID]]" "[[NOTE] ([ID])]" "" "" + "
    " "
    " + "\"" "\"" + "" + + "" + "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "

    Function

    \n"     "\n" "

    " "

    \n" % url support by HG + "<@@url>[URL]\n" "[NAME]\n" "<@@endurl>" + "[NAME]" "RFC [ID]" % ref modified to have an optional name field + "<@@ref>[ID]\n" "[NAME]\n" "<@@endref>" + + "<@@ref>[ID]" + + "<@@ref>[ID]" + + "" + + "" + "" "" + "" + + "
    \n
    "		+
		+	"
    \n
    " + + "
    "		+
		+	"
    " + + "
    " + + "
    " + + "
    " + + "
    " + % theorems and such + "" + "" + + "" + "" + + "" + "" + + "" + "" + + "" + "" + + "" + "" + "" "" % mathematics + "" + + "" + + "" + + "" + "" "" "" "" "" "" "" "" "" "" "" ""
      "
        "
      "
    " "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" "" % figures
    + "
    " +
    + "
    " + + "" + + "" + + "" + + "" "" + % tables + "
    \n" +
    + "\n" + + "
    \n" +     + "\n" + "" + "" + "" + % slides + "" + + "" + + "" + + "" + % letters + "" + + "" + + "" + + "" + + "" "" + + "" + "" + + "" + "" + % first end definition of name
    + "
    " +
    + "
    " + + "" "" + + "" "" + + "" "" + + "" "" + + "" "" + + "" "" + + "" "" + + "" "" + + "" "" + + "" "" + + "" + + "" + % end of html replacement file bird-1.6.3/doc/sbase/dist/birddoc/groff/0000755000103200001440000000000013027054563016750 5ustar feelausersbird-1.6.3/doc/sbase/dist/birddoc/groff/mapping0000644000103200001440000002676413027054563020345 0ustar feelausers% linuxdoc replacement file % translates into nroff, using ms macros % manpages can be processed using the man macros % does not use neqn for math. % Based on qwertz replacement file by Tom Gordon % linuxdoc mods by mdw % Groff dependencies are few. To port to another roff: % 1. Check and modify, if necessary, font changes. (e.g. In psroff the % same fonts have other names.) % 2. Check the code for including Encapsulated PostScript, generated % for eps elements. % 3. Also make versions of general.grops and math.grops, which are sed % scripts translating character entities into groff character references. + ".nr PS 11\n" % Hacked by mdw ".nr PI 3n\n" ".ds CF \\\\n\%\n" ".ds CH \\&\n" ".ds dR $\n" % dollar, to avoid EQN conflicts % Start with no TOC ".ds printtoc\n" % Footnote style ".nr FF 1\n" % James Clark's trick to prevent unintended paragraph % breaks ".tr \\&\n" % horizontal line ".de hl\n" ".br\n" "\\l'\\\\n(.lu-\\\\n(.iu'\n" "..\n" % paragraph spacing ".if n .nr PD 1v\n" % margins added by mdw ".nr PO 0.25i\n" ".po 0.25i\n" ".nr LL 7.0i\n" ".nr TL 7.0i\n" ".nr HM 0i\n" ".nr FM 0i\n" % Turn off right-margin filling ".na\n" % h is 1 if first paragraph after heading ".nr h 0\n" % initialize heading level ".nr il 1\n" % Number registers for list ".nr bi 0\n" % initialize begin items ".nr ll 0\n" % list level, stores current level ".nr el 0\n" % current enumeration level % Not all list levels are enumerations, as % itemizations can be embedded within enumerations % and vice versa % type of list level is in \n(t\n(ll, where % 0 : itemize, 1 : enumerate, 2: description % enumerator for an enumeration level is in % \n(e\n(el -- i.e. \n(e1=2 means current item of % enumeration level 1 is 2 % context-sensitive paragraph macro % Bug: There's some problem using this to re-start paragraphs after the %     and     , so after verb and code I insert .LP. That's fine % except that is loses indentation when using verb or code inside of a list. ".de Pp\n" ".ie \\\\n(ll>0 \\{\\\n" % within list? ".ie \\\\n(bi=1 \\{\\\n" % first par element of item? ".nr bi 0\n" % reset bi flag % if itemization, mark with a bullet ".if \\\\n(t\\\\n(ll=0 \\{.IP \\\\(bu\\}\n" % itemize % if enumeration: increment and print enumerator % for this enumeration level ".if \\\\n(t\\\\n(ll=1 \\{.IP \\\\n+(e\\\\n(el.\\}\n" % if first par element of descrip, do nothing ".\\}\n" ".el .sp \n" % subsequent par element of item ".\\}\n" ".el \\{\\\n" % not within list ".ie \\\\nh=1 \\{\\\n" % first par after heading ".LP\n" ".nr h 0\n" % reset h flag ".\\}\n" ".el .LP \n" % Changed from .PP, mdw ".\\}\n" ".nh\n" "..\n" % for each level, a number register is created % to store its type and current item number, where % -1=bullet of an itemized list. % Format of list level enumerators ".ds f1 1\n" ".ds f2 a\n" ".ds f3 i\n" ".ds f4 A\n" % Number registers for theorems ".nr def 0\n" ".nr prop 0\n" ".nr lemma 0\n" ".nr coroll 0\n" ".nr proof 0\n" ".nr theorem 0\n" % Reference commands % redefine superscript strings so that refer tags look like [this] ".ds \[. \[\n" ".ds .\] \]\n" % set initial level of headings, in register il
    + ".nr il 0" +
    + ".if '\\*[printtoc]'true' .PX\n" + ".nr il 1" + + ".bp\n" ".rm LH\n.rm RH\n" ".TC" + + ".nr il 1" + + ".rm LH\n.rm RH\n" ".bp\n" ".TC" + + ".nr il -1" + % Hacked up titlepag stuff to look more reasonable. Titles and author % names are now stored in strings, printed by the end of . % Wake up! This uses groff-like long string names. You must use groff % to format this. + ".ds mdwtitle\n" ".ds mdwsubtitle\n" ".ds mdwdate\n" ".de printabstract\n" "..\n" + + "\\*[mdwtitle]\n" ".br\n" ".if !'\\*[mdwsubtitle]'' \\*[mdwsubtitle]\n" ".br\n" ".printauthor\n" ".br\n" "\\*[mdwdate]\n" ".br\n" ".printabstract\n" ".br\n" % + ".TL" + % + ".ds mdwtitle " + % + ".br\n" % ".ft R\n" % ".SM" + % + ".LG" + + ".ds mdwsubtitle " + + ".ds mdwdate " + + ".de printabstract\n" ".LP\n" + ".." + % author needs to be set up as its own macro, fired off from .printtitle. + ".de printauthor" + + ".." + % + ".AU" + % + ".br" + "\\**\n" ".FS" + + ".FE" + + ".br" + % + ".br" + + ".br"
    + ".EH '" "'''" + + ".OH '''" "'" + + "(*" + + "*)" + % New abstract given above --mdw % + ".AB" + % + ".AE" + + ".af H1 A" + % limitation: no list of figures or tables. A table of contents % is always generated for books and reports. Thus these next three tags % are no-ops % For now, no table-of-contents in ASCII output. (Uncomment this if % desired). % + ".ds printtoc true" % + ".bp\n" ".NH \\n(il " + + ".NH 1+\\n(il" + + ".NH 2+\\n(il" + + ".NH 3+\\n(il" + + ".NH 4+\\n(il" + + ".NH 5+\\n(il" + ".ds h " + "\\*h\n" ".XS \\n%\n" "\\*(SN \\*h\n" ".XE\n" ".nr h 1\n" % set heading flag to true

    + ".Pp" +

    + ".nr ll +1\n" % increment list level ".nr t\\n(ll 0\n" % set type of level to itemize + ".nr ll -1\n" % decrement list level + ".nr ll +1\n" % increment list level ".nr el +1\n" % increment enumeration level ".nr t\\n(ll 1\n" % set type of level to enum ".nr e\\n(el 0 1\n" % initialize enumerator ".af e\\n(el \\*(f\\n(el\n" % style of enumerator ".if \\n(ll>1 .RS" + + ".if \\n(ll>1 .RE\n" ".br\n" ".nr el -1\n" % decrement enumeration level ".nr ll -1\n" % decrement list level + ".RS\n" ".nr ll +1\n" % increment list level ".nr t\\n(ll 2\n" % set type of level to descrip + ".nr ll -1\n" % decrement list level ".RE" + % number register bi means "begin item". Used in the .P macro to print % bullets or numbers at beginning of first paragraph of an item. % If bi=1 then the paragraph is the first one of the item. + ".nr bi 1\n.Pp" + + ".IP \"\\fB" "\\fR\"\n" ".nr bi 1" + "" "" "" "" + ".\[\n[ID]\n.\]" + + ".\[\n[ID]\n.\]\n([NOTE])" " (-- " "--)" + "\\*Q" "\\*U" + ".RS\n" ".nr LL \\n(LL-\\n(PI" + + ".nr LL \\n(LL+\\n(PI\n" ".RE" + "\\fI" "\\fP" "\\fB" "\\fR" "\\fI" "\\fR" "\\fR" "\\fR" "\\fI" "\\fR" % Changed by mdw "\\fC" "\\fR" % Added by mdw "\\fI<" ">\\fR" "[NAME] <\\fC[URL]\\fR>" "[NAME]" "``[NAME]''" + "\\#" "\\n" + "\\#" "\\n" "??" + ".\[\n" "$LIST$\n" ".\]" + + ".DS L\n" ".hl\n" ".ft R\n" + + ".hl\n" ".DE\n" ".ft P\n" % ".Pp" + % continue previous paragraph (changed mdw) ".LP" + ".DS L\n" ".ft R\n" + + ".DE\n" ".ft P\n" % ".Pp" + % continue previous paragraph (changed mdw) ".LP" % tscreen added by mdw + ".br\n" ".po 0.75i\n" ".ll 6.0i\n" ".ft C\n" ".LP\n" % Used to be Pp + ".br\n" ".po 0.25i\n" ".ll 7.0i\n" ".ft R\n" % This might not be correct ".LP\n" % Used to be Pp + ".br\n" ".po 0.75i\n" ".ll 6.0i\n" ".nr LL 6.0i\n" ".LP\n" % Used to be Pp + ".br\n" ".po 0.25i\n" ".ll 7.0i\n" ".nr LL 7.0i\n" ".LP\n" % Used to be Pp % theorems and such + ".sp\n" ".nr def \\n\[def\]+1\n" ".B \"Definition \\n\[def\] \"" + + ".ft P\n.sp" + + ".sp\n" ".nr prop \\n\[prop\]+1\n" ".B \"Proposition \\n\[prop\] \"" + + ".ft P\n.sp" + + ".sp\n" ".nr lemma \\n\[lemma\]+1\n" ".B \"Lemma \\n\[lemma\] \"" + + ".ft P\n.sp" + + ".sp\n" ".nr coroll \\n\[coroll\]+1\n" ".B \"Corolloary \\n\[coroll\] \"" + + ".ft P\n.sp" + + ".sp\n" ".nr proof \\n\[proof\]+1\n" ".B \"Proof \\n\[proof\] \"" + + ".ft P\n.sp" + + ".sp\n" ".nr theorem \\n\[theorem\]+1\n" ".B \"Theorem \\n\[theorem\] \"" + + ".ft P\n.sp" + + ".B\n(" ")\n.I" + % mathematics -- this nroff version needs work. + ".DS L" + + ".DE" + + ".DS L" + + ".DE" + "{" "} over " "{" "}" " from {" "}"
      " to {"
    "}" " prod " " int " " sum " % limitation: eqn only does square roots! " sqrt {" "}" + ".TS\n" "center, tab(|) ;\n" "[ca]." + + ".TE" + "\n" "|" " sup {" "}" " sub {" "}" "{" "} under " "{" "} bar " " bold{" "}" "{" "} vec " % limitation: no calligraphic characters, using helvetica italics instead. Is there a better font? "\\fI" "\\fP" " roman }" "}" + ".br" + % figures
    % + ".KF" +
    % + ".KE" + + ".if t .PSPIC [file].ps\n" ".if n .sp 4" + % Are TeX units properly handled by this translation of ph? + ".sp [VSPACE]" + + ".sp\n.ce" + % tables + ".KF\n.R" +
    + ".KE" + + ".TS\n" "center, tab(|) ; \n" "[ca]." + + ".TE" + "\n" + "|" % + "_" + % gregh + ".hl\n" + + ".nr PS 18" + + ".bp\n\\&" + % letters -- replacement for email, using mh format. + ".nf" + + + "From: " + "To: "
    + ".de Ad\n"
    + ".." + " <" ">" + "Subject: " + "Sref: " + "In-Reply-To: " + "cc: " + ".fi\n.LP" + + ".LP" + + ".XP\n" "encl: " + ".LP\np.s." % end of roff replacement file bird-1.6.3/doc/sbase/dist/birddoc/latex2e/0000755000103200001440000000000013027054563017211 5ustar feelausersbird-1.6.3/doc/sbase/dist/birddoc/latex2e/mapping0000644000103200001440000001477613027054563020606 0ustar feelausers % birddoc to LaTeX replacement file % The \relax is there to avoid sgml2latex rewriting the class + "\\relax\\documentclass\[a4paper,10pt,openany,oneside\]{book}\n" "\\usepackage\[colorlinks=true,linkcolor=blue,pdftitle={BIRD User's Guide}\]{hyperref}\n" "\\usepackage{enumitem}\n" "\\usepackage{birddoc}\n" "\\usepackage{qwertz}\n" "\\usepackage{url}\n" "\\usepackage\[latin1\]{inputenc}\n" "\\usepackage{epsfig}\n" "\\usepackage{[OPTS]}\n" "\\pagestyle{headings}%end-preamble\n" + + "\\end{document}" + % Manual Pages are expected to be formatted using nroff (or groff), unless % they are included as sections of other qwertz documents. "\\progdoc" + "\n\n\\begin{document}\n" "\\maketitle\n" + + "\\title{" "}" + "\\\\\n" "{\\large " "}" + + "\\author{" "}" + "\\and " + "\\thanks{" "}" " \\\\\n\\\\" + + "\\date{" "}" + "\\\\ "
    + "\\markboth"
    "{" "}" "{" "}" + % + "\n\n\\begin{verbatim}" + % + "\\end{verbatim}\n\n" + "{\\tt " "}" % Hacked by mdw to use linuxdoc-sgml \abstract{...} + "\\abstract{" "}" + + "\n \\appendix \n" + + "\\tableofcontents" + + "\\listoffigures" + + "\\listoftables" + + "\n\\chapter" + "\n\\section" + "\n\\subsection" + "\n\\subsubsection" + "\n\\paragraph" + "\n\\subparagraph" "{" "}\n\n"

    "\\phantomsection{}"

    "\n\n" + "\\begin{itemize}" + + "\\end{itemize}" + + "\\begin{enumerate}" + + "\\end{enumerate}" + + "\\begin{list}{}{}\n" + + "\\end{list}" + + "\\begin{description}\[style=unboxed\]" + + "\\end{description}" + + "\\item " + "\\phantomsection\\item\[{\\ttfamily " "}\] \\hfil\\break\n" + + "\\item\[ " "\] \\hfil\\break\n" + "\\cite{[ID]" "}" "\\cite\[[NOTE]\]{[ID]" "}" "\\idx{" "}" "\\cdx{" "}" "\\nidx{" "}" "\\ncdx{" "}" % The idea here is to automatically insert soft hyphens after every slash in % the filename, so long filenames will break naturally. The url{} macro is % a kluge but it works, "{\\tt " "}" "\\footnote{" "}" "``" "''" + "\\begin{quotation}\n" + + "\n\\end{quotation}\n\n" + "{\\it " "\\/}" "{\\it " "\\/}" "{\\bf " "}" "{\\it " "\\/}" "{\\sf " "}" "{\\sl " "}" "{\\rm " "}" "{\\tt " "}" "{\\tt " "}" "{\\tt " "}" "{\\it " "\\/}" "{\\tt " "}" "{\\it " "\\/}" "{\\rm " "}" "{\\it " "\\/}" "{\\function " "}\n\n" "\n\\funcsect{" "}" "\\hrule" % Added by mdw "\\cparam{" "}" "\\hyperref\[[ID]\]{[NAME]} (p.\\,\\getpagerefnumber{[ID]})" "\\pageref{[ID]}" %url added by HG "\\href{[URL]}{[NAME]}" "\\href{[URL]}{[NAME]}" "\\href{http://www.rfc-editor.org/info/rfc[ID]}{RFC [ID]}" + "\\bibliographystyle{[STYLE]}\n" "\\bibliography{[FILES]}\n" "\\addbibtoc{}" + % + "\\macro{[ID]}{\\qw[ID]}" % %
    + "\\macro{qwmain}{\\qwmain}" %
    % + "\\par\n" % "\\medbreak\\hrule\\nopagebreak\n" % "\\begin{verbatim}" + % % + "\\end{verbatim}\n" % "\\nopagebreak\\hrule\\medbreak\n" + + "\\par\n" "\\goodbreak{\\birdnarrow\n" "\\begin{verbatim}" + + "\\end{verbatim}\n" "}\\smallbreak\n" + + "\\begin{verbatim}" + + "\\end{verbatim}" + % tscreen added by mdw + "\\begin{tscreen}" + + "\\end{tscreen}" + + "\\begin{quotation}" + + "\\end{quotation}" + % theorems and such + "\\begin{definition}" + "\\end{definition}\n\n" + + "\\begin{proposition}" + + "\\end{proposition}" + + "\\begin{lemma}" + "\\end{lemma}\n\n" + + "\\begin{corollary}" + "\\end{corollary}\n\n" + + "\n{\\noindent{\\bf Proof.} " + + "}" + "\\begin{theorem}" + "\\end{theorem}\n\n" + "\[" "\]" + % mathematics "$" "$" + "\\\[" "\\\]" + + "\\begin{equation}" + + "\\end{equation}\n" + "\\frac" "{" "}" "{" "}" "_{" "}"
      "^{"
    "}" "\\prod" "\\int" "\\sum" "\\sqrt\[[n]\]{" "}" + "\\begin{array}{[ca]}" + + "\\end{array}" + " \\\\ " + " & " "^{" "}" "_{" "}" "\\underline{" "}" "\\overline{" "}" "\\mbox{\\tt " "}" "\\vec{" "}" "{\\cal " "}" "{\\rm " "}" "\\\\ \n" % figures
    + "\\begin{figure}\[[LOC]\]" +
    + "\\end{figure}\n" + + "\\centerline{\\epsfig{file=[FILE],height=[HEIGHT],angle=[ANGLE]}}" + + "\\vspace{[VSPACE]}\n\\par" + + "\\caption{" "}" + % tables + "\\begin{table}\[[LOC]\]" +
    + "\\end{table}" + + "\\begin{center}\n" "\\begin{tabular}{[ca]}" + + "\\end{tabular}\n" "\\end{center}" + "\\\\ " + "& " + "\\hline" + % end of latex replacement file bird-1.6.3/doc/sbase/dist/fmt_txt.pl0000644000103200001440000002177413027054563016274 0ustar feelausers# # fmt_txt.pl # # $Id$ # # TXT-specific driver stuff # # © Copyright 1996, Cees de Groot # package LinuxDocTools::fmt_txt; use strict; use File::Copy; use Text::EntityMap; use LinuxDocTools::CharEnts; use LinuxDocTools::Lang; use LinuxDocTools::Vars; use LinuxDocTools::Utils qw(create_temp); my $txt = {}; $txt->{NAME} = "txt"; $txt->{HELP} = ""; $txt->{OPTIONS} = [ { option => "manpage", type => "f", short => "m" }, { option => "filter", type => "f", short => "f" }, { option => "blanks", type => "i", short => "b" } ]; $txt->{manpage} = 0; $txt->{filter} = 0; $txt->{blanks} = 3; $Formats{$txt->{NAME}} = $txt; # # Set correct NsgmlsOpts # $txt->{preNSGMLS} = sub { if ($txt->{manpage}) { $global->{NsgmlsOpts} .= " -iman "; $global->{charset} = "man"; } else { $global->{NsgmlsOpts} .= " -ifmttxt "; $global->{charset} = "latin1" if $global->{charset} eq "latin"; } # # Is there a cleaner solution than this? Can't do it earlier, # would show up in the help messages... # # the language support ja. # the charset support nippon. # $global->{format} = $global->{charset}; $global->{charset} = "nippon" if $global->{language} eq "ja"; $global->{format} = "groff" if $global->{format} eq "ascii"; $global->{format} = "groff" if $global->{format} eq "nippon"; $global->{format} = "groff" if $global->{format} eq "euc-kr"; $ENV{SGML_SEARCH_PATH} =~ s/txt/$global->{format}/; $Formats{"groff"} = $txt; $Formats{"latin1"} = $txt; $Formats{"man"} = $txt; $global->{NsgmlsPrePipe} = "cat $global->{file} " ; }; # Ascii escape sub. this is called-back by `parse_data' below in # `txt_preASP' to properly escape `\' characters coming from the SGML # source. my $txt_escape = sub { my ($data) = @_; $data =~ s|"|\\\&\"|g; # Insert zero-width space in front of " $data =~ s|^\.|\\&.|; # ditto in front of . at start of line $data =~ s|\\|\\\\|g; # Escape backslashes return ($data); }; # # Run the file through the genertoc utility before sgmlsasp. Not necessary # when producing a manpage. A lot of code from FJM, untested by me. # $txt->{preASP} = sub { my ($infile, $outfile) = @_; my (@toc, @lines); my $char_maps = load_char_maps ('.2tr', [ Text::EntityMap::sdata_dirs() ]); if ( $global->{charset} eq "latin1" ) { $char_maps = load_char_maps ('.2l1tr', [ Text::EntityMap::sdata_dirs() ]); } if ($txt->{manpage}) { while (<$infile>) { if (/^-/) { my ($str) = $'; chop ($str); print $outfile "-" . parse_data ($str, $char_maps, $txt_escape) . "\n"; next; } elsif (/^A/) { /^A(\S+) (IMPLIED|CDATA|NOTATION|ENTITY|TOKEN)( (.*))?$/ || die "bad attribute data: $_\n"; my ($name,$type,$value) = ($1,$2,$4); if ($type eq "CDATA") { # CDATA attributes get translated also $value = parse_data ($value, $char_maps, $txt_escape); } print $outfile "A$name $type $value\n"; next; } # # Default action if not skipped over with next: copy in to out. # print $outfile $_; } return; } # note the conversion of `sdata_dirs' list to an anonymous array to # make a single argument # # Build TOC. The file is read into @lines in the meantime, we need to # traverse it twice. # push (@toc, "(HLINE\n"); push (@toc, ")HLINE\n"); push (@toc, "(P\n"); push (@toc, "-" . Xlat ("Table of Contents") . "\n"); push (@toc, ")P\n"); push (@toc, "(VERB\n"); my (@prevheader, @header); my $appendix = 0; my $nonprint = 0; while (<$infile>) { push (@lines, $_); if (/^\(SECT(.*)/) { @prevheader = @header; @header = @header[0..$1]; if ($appendix == 1) { $header[$1] = "A"; $appendix = 0; } else { $header[$1]++; } } if (/^\(APPEND(.*)/) { $appendix = 1; } if (/^\(HEADING/) { $_ = <$infile>; s/\\n/ /g; push (@lines, $_); chop; s/^-//; $_ = join(".",@header) . " " . $_; s/\(\\[0-9][0-9][0-9]\)/\\\1/g; if (!$#header) { # put a newline before top-level sections unless previous was also # a top level section $_ = "\\n" . $_ unless (!$#prevheader); # put a . and a space after top level sections s/ /. /; ##### $_ = "-" . $_ . "\\n"; $_ = "-" . $_; } else { # subsections get indentation matching hierarchy $_ = "-" . " " x $#header . $_; } # remove tags from a toc s/\)TT//g; s/\(TT//g; s/\)IT//g; s/\(IT//g; s/\)EM//g; s/\(EM//g; s/\)BF//g; s/\(BF//g; s/AID * CDATA.*$//g; s/\)LABEL//g; s/\(LABEL//g; push(@toc, parse_data ($_, $char_maps, $txt_escape)); $_ = <$infile>; while (!/^\)HEADING/) { s/\\n/ /g; #### push(@lines, $_); chop; s/^-//; # remove tags from a toc s/\)TT//g; s/\(TT//g; s/\)IT//g; s/\(IT//g; s/\)EM//g; s/\(EM//g; s/\)BF//g; s/\(BF//g; s/AID * CDATA.*$//g; s/\)LABEL//g; s/\(LABEL//g; # remove NIDX, NCDX from a toc entry if (/^\(NIDX$/ || /^\(NCDX$/) { $nonprint = 1; } if (/^\)NIDX$/ || /^\)NCDX$/) { $nonprint = 1; } # $_ = "-" . $_ . "\\n"; push(@toc, parse_data ($_, $char_maps, $txt_escape)) if (! $nonprint); $_ = <$infile>; } s/\\n/ /g; ### push(@lines, $_); push(@toc, "\\n\n"); } } push (@toc, ")VERB\n"); push (@toc, "(HLINE\n"); push (@toc, ")HLINE\n"); my $inheading = 0; my $tipo = ''; for (@lines) { if ($inheading) { next if (/^\)TT/ || /^\(TT/ || /^\)IT/ || /^\(IT/ || /^\)EM/ || /^\(EM/ || /^\)BF/ || /^\(BF/); if (/^-/) { $tipo .= $' ; chop ($tipo); $tipo .= " " unless $tipo =~ / $/; } else { $tipo =~ s/ $//; if ($tipo) { print $outfile "-" . parse_data ($tipo, $char_maps, $txt_escape) . "\n"; } print $outfile $_; $tipo = ''; } if (/^\)HEADING/) { $inheading = 0; } next; } if (/^\(HEADING/) { # # Go into heading processing mode. # $tipo = ''; $inheading = 1; } if (/^\(TOC/) { print $outfile @toc; next; } if (/^-/) { my ($str) = $'; chop ($str); print $outfile "-" . parse_data ($str, $char_maps, $txt_escape) . "\n"; next; } elsif (/^A/) { /^A(\S+) (IMPLIED|CDATA|NOTATION|ENTITY|TOKEN)( (.*))?$/ || die "bad attribute data: $_\n"; my ($name,$type,$value) = ($1,$2,$4); if ($type eq "CDATA") { # CDATA attributes get translated also $value = parse_data ($value, $char_maps, $txt_escape); } print $outfile "A$name $type $value\n"; next; } # # Default action if not skipped over with next: copy in to out. # print $outfile $_; } }; # # Take the sgmlsasp output, and make something # useful from it. # $txt->{postASP} = sub { my $infile = shift; my ($outfile, $groffout); if ($txt->{manpage}) { $outfile = new FileHandle ">$global->{filename}.man"; } else { create_temp("$global->{tmpbase}.txt.1"); $outfile = new FileHandle "|$main::progs->{GROFF} $global->{pass} -T $global->{charset} -t $main::progs->{GROFFMACRO} >\"$global->{tmpbase}.txt.1\""; } # # Feed $outfile with roff input. # while (<$infile>) { unless (/^\.DS/.../^\.DE/) { s/^[ \t]{1,}(.*)/$1/g; } s/^\.[ \t].*/\\\&$&/g; s/\\fC/\\fR/g; s/^.ft C/.ft R/g; print $outfile $_; } $outfile->close; # # If we were making a manpage, we're done. Otherwise, a little bit # of work is left. # if ($txt->{manpage}) { return 0; } else { $outfile->open (">$global->{filename}.txt"); $groffout = new FileHandle "<$global->{tmpbase}.txt.1"; my $count = 0; if ($txt->{filter}) { while (<$groffout>) { s/[^\cH][^\cH]\cH\cH//g; s/.//g; if ($txt->{blanks}) { $count = &{$txt->{cutblank}}($count, $outfile, $_); } else { print $outfile $_; } } } else { if ($txt->{blanks}) { while (<$groffout>) { $count = &{$txt->{cutblank}}($count, $outfile, $_); } } else { copy ($groffout, $outfile); } } } $groffout->close; $outfile->close; return 0; }; $txt->{cutblank} = sub { my ($num, $out, $in) = @_; if ( $in =~ /^$/ ) { $num++; } else { $num = 0; } if ( $num <= $txt->{blanks} ) { print $out $in; } return ($num); }; 1; bird-1.6.3/doc/sbase/VERSION0000644000103200001440000000000613027054563014340 0ustar feelausers1.0.9 bird-1.6.3/doc/sbase/dtd/0000755000103200001440000000000013027054563014047 5ustar feelausersbird-1.6.3/doc/sbase/dtd/common0000644000103200001440000000547213027054563015272 0ustar feelausers bird-1.6.3/doc/sbase/dtd/isoent0000644000103200001440000000355713027054563015305 0ustar feelausers %ISOdia; %ISOgrk3; %ISOlat1; %ISOnum; %ISOpub; bird-1.6.3/doc/sbase/dtd/birddoc.dtd0000644000103200001440000004226413027054563016162 0ustar feelausers %isoent; ' >

    ' > ' -- formula begin -- > '> "> "> ' -- formula end -- > " > " > ' > "> bird-1.6.3/doc/sbase/dtd/catalog0000644000103200001440000000413313027054563015405 0ustar feelausers-- This is a DTD, but will be read as -*- sgml -*- -- -- ================================================= -- -- $Id$ This is dtd/catalog for SGML-Tools. Initial revision June 23st, 1997, by B. Kreimeier $Log$ Revision 1.1 2000-05-29 12:05:22 mj Renamed the DTD from linuxdoc to birddoc. Pavel, please check whether it builds in your environment as well. Revision 1.7 1998/10/13 12:12:09 cg * Clean up catalog file. (CdG) Revision 1.6 1998/03/09 21:10:14 cg * Removed sgmltool.dtd. (CdG) Revision 1.5 1998/01/08 19:59:54 cg * Add empty line, it gave problems. (CdG) Revision 1.4 1997/12/09 20:56:15 cg * Added html32.dtd (with a modified reference to ISOent) and updated catalog accordingly. You can now do sgmlcheck on HTML files. (CdG) Revision 1.3 1997/07/09 13:27:12 cg * Completely new DTD setup by Bernd (BK). -- -- ================================================= -- -- Revision Comments -- -- BK/97/06/23: added a header, changed for 0.99.12 -- -- ================================================= -- DOCTYPE "BIRDDOC" "birddoc.dtd" -- Linuxdoc96.dtd, frozen orignal Linuxdoc DTD -- DOCTYPE "LINUXDOC" "linuxdoc.dtd" PUBLIC "-//LinuxDoc//DTD LinuxDoc 96//EN" linuxdoc96.dtd -- Linuxdoc97 Strict DTD -- PUBLIC "-//LinuxDoc//DTD LinuxDoc 97//EN" linuxdoc97.dtd -- outdated and shared entities -- ENTITY %common "common" ENTITY %isoent "isoent" ENTITY %deprec96 "deprec96" -- for development and debug, internal use only -- DOCTYPE "QWERTZ" "qwertz.dtd" DOCTYPE "TEST" "test.dtd" -- for SGML validation -- DOCTYPE "HTML" "html32.dtd" PUBLIC "-//W3C//DTD HTML 3.2 Final//EN" html32.dtd -- obsolete -- ENTITY %general "general" -- ================================================= -- -- end of dtd/catalog -- -- Local Variables: mode: sgml End: -- -- ================================================= -- bird-1.6.3/doc/prog-2.html0000644000103200001440000025112513027054667014206 0ustar feelausers BIRD Programmer's Documentation: Core Next Previous Contents

    2. Core

    2.1 Forwarding Information Base

    FIB is a data structure designed for storage of routes indexed by their network prefixes. It supports insertion, deletion, searching by prefix, `routing' (in CIDR sense, that is searching for a longest prefix matching a given IP address) and (which makes the structure very tricky to implement) asynchronous reading, that is enumerating the contents of a FIB while other modules add, modify or remove entries.

    Internally, each FIB is represented as a collection of nodes of type fib_node indexed using a sophisticated hashing mechanism. We use two-stage hashing where we calculate a 16-bit primary hash key independent on hash table size and then we just divide the primary keys modulo table size to get a real hash key used for determining the bucket containing the node. The lists of nodes in each bucket are sorted according to the primary hash key, hence if we keep the total number of buckets to be a power of two, re-hashing of the structure keeps the relative order of the nodes.

    To get the asynchronous reading consistent over node deletions, we need to keep a list of readers for each node. When a node gets deleted, its readers are automatically moved to the next node in the table.

    Basic FIB operations are performed by functions defined by this module, enumerating of FIB contents is accomplished by using the FIB_WALK() macro or FIB_ITERATE_START() if you want to do it asynchronously.

    Function

    void fib_init (struct fib * f, pool * p, unsigned node_size, unsigned hash_order, fib_init_func init) -- initialize a new FIB

    Arguments

    struct fib * f

    the FIB to be initialized (the structure itself being allocated by the caller)

    pool * p

    pool to allocate the nodes in

    unsigned node_size

    node size to be used (each node consists of a standard header fib_node followed by user data)

    unsigned hash_order

    initial hash order (a binary logarithm of hash table size), 0 to use default order (recommended)

    fib_init_func init

    pointer a function to be called to initialize a newly created node

    Description

    This function initializes a newly allocated FIB and prepares it for use.

    Function

    void * fib_find (struct fib * f, ip_addr * a, int len) -- search for FIB node by prefix

    Arguments

    struct fib * f

    FIB to search in

    ip_addr * a

    pointer to IP address of the prefix

    int len

    prefix length

    Description

    Search for a FIB node corresponding to the given prefix, return a pointer to it or NULL if no such node exists.

    Function

    void * fib_get (struct fib * f, ip_addr * a, int len) -- find or create a FIB node

    Arguments

    struct fib * f

    FIB to work with

    ip_addr * a

    pointer to IP address of the prefix

    int len

    prefix length

    Description

    Search for a FIB node corresponding to the given prefix and return a pointer to it. If no such node exists, create it.

    Function

    void * fib_route (struct fib * f, ip_addr a, int len) -- CIDR routing lookup

    Arguments

    struct fib * f

    FIB to search in

    ip_addr a

    pointer to IP address of the prefix

    int len

    prefix length

    Description

    Search for a FIB node with longest prefix matching the given network, that is a node which a CIDR router would use for routing that network.

    Function

    void fib_delete (struct fib * f, void * E) -- delete a FIB node

    Arguments

    struct fib * f

    FIB to delete from

    void * E

    entry to delete

    Description

    This function removes the given entry from the FIB, taking care of all the asynchronous readers by shifting them to the next node in the canonical reading order.

    Function

    void fib_free (struct fib * f) -- delete a FIB

    Arguments

    struct fib * f

    FIB to be deleted

    Description

    This function deletes a FIB -- it frees all memory associated with it and all its entries.

    Function

    void fib_check (struct fib * f) -- audit a FIB

    Arguments

    struct fib * f

    FIB to be checked

    Description

    This debugging function audits a FIB by checking its internal consistency. Use when you suspect somebody of corrupting innocent data structures.

    2.2 Routing tables

    Routing tables are probably the most important structures BIRD uses. They hold all the information about known networks, the associated routes and their attributes.

    There are multiple routing tables (a primary one together with any number of secondary ones if requested by the configuration). Each table is basically a FIB containing entries describing the individual destination networks. For each network (represented by structure net), there is a one-way linked list of route entries (rte), the first entry on the list being the best one (i.e., the one we currently use for routing), the order of the other ones is undetermined.

    The rte contains information specific to the route (preference, protocol metrics, time of last modification etc.) and a pointer to a rta structure (see the route attribute module for a precise explanation) holding the remaining route attributes which are expected to be shared by multiple routes in order to conserve memory.

    Function

    rte * rte_find (net * net, struct rte_src * src) -- find a route

    Arguments

    net * net

    network node

    struct rte_src * src

    route source

    Description

    The rte_find() function returns a route for destination net which is from route source src.

    Function

    rte * rte_get_temp (rta * a) -- get a temporary rte

    Arguments

    rta * a

    attributes to assign to the new route (a rta; in case it's un-cached, rte_update() will create a cached copy automatically)

    Description

    Create a temporary rte and bind it with the attributes a. Also set route preference to the default preference set for the protocol.

    Function

    rte * rte_cow_rta (rte * r, linpool * lp) -- get a private writable copy of rte with writable rta

    Arguments

    rte * r

    a route entry to be copied

    linpool * lp

    a linpool from which to allocate rta

    Description

    rte_cow_rta() takes a rte and prepares it and associated rta for modification. There are three possibilities: First, both rte and rta are private copies, in that case they are returned unchanged. Second, rte is private copy, but rta is cached, in that case rta is duplicated using rta_do_cow(). Third, both rte is shared and rta is cached, in that case both structures are duplicated by rte_do_cow() and rta_do_cow().

    Note that in the second case, cached rta loses one reference, while private copy created by rta_do_cow() is a shallow copy sharing indirect data (eattrs, nexthops, ...) with it. To work properly, original shared rta should have another reference during the life of created private copy.

    Result

    a pointer to the new writable rte with writable rta.

    Function

    void rte_announce (rtable * tab, unsigned type, net * net, rte * new, rte * old, rte * new_best, rte * old_best, rte * before_old) -- announce a routing table change

    Arguments

    rtable * tab

    table the route has been added to

    unsigned type

    type of route announcement (RA_OPTIMAL or RA_ANY)

    net * net

    network in question

    rte * new

    the new route to be announced

    rte * old

    the previous route for the same network

    rte * new_best

    the new best route for the same network

    rte * old_best

    the previous best route for the same network

    rte * before_old

    The previous route before old for the same network. If before_old is NULL old was the first.

    Description

    This function gets a routing table update and announces it to all protocols that acccepts given type of route announcement and are connected to the same table by their announcement hooks.

    Route announcement of type RA_OPTIMAL si generated when optimal route (in routing table tab) changes. In that case old stores the old optimal route.

    Route announcement of type RA_ANY si generated when any route (in routing table tab) changes In that case old stores the old route from the same protocol.

    For each appropriate protocol, we first call its import_control() hook which performs basic checks on the route (each protocol has a right to veto or force accept of the route before any filter is asked) and adds default values of attributes specific to the new protocol (metrics, tags etc.). Then it consults the protocol's export filter and if it accepts the route, the rt_notify() hook of the protocol gets called.

    Function

    void rte_free (rte * e) -- delete a rte

    Arguments

    rte * e

    rte to be deleted

    Description

    rte_free() deletes the given rte from the routing table it's linked to.

    Function

    void rte_update2 (struct announce_hook * ah, net * net, rte * new, struct rte_src * src) -- enter a new update to a routing table

    Arguments

    struct announce_hook * ah

    pointer to table announce hook

    net * net

    network node

    rte * new

    a rte representing the new route or NULL for route removal.

    struct rte_src * src

    protocol originating the update

    Description

    This function is called by the routing protocols whenever they discover a new route or wish to update/remove an existing route. The right announcement sequence is to build route attributes first (either un-cached with aflags set to zero or a cached one using rta_lookup(); in this case please note that you need to increase the use count of the attributes yourself by calling rta_clone()), call rte_get_temp() to obtain a temporary rte, fill in all the appropriate data and finally submit the new rte by calling rte_update().

    src specifies the protocol that originally created the route and the meaning of protocol-dependent data of new. If new is not NULL, src have to be the same value as new->attrs->proto. p specifies the protocol that called rte_update(). In most cases it is the same protocol as src. rte_update() stores p in new->sender;

    When rte_update() gets any route, it automatically validates it (checks, whether the network and next hop address are valid IP addresses and also whether a normal routing protocol doesn't try to smuggle a host or link scope route to the table), converts all protocol dependent attributes stored in the rte to temporary extended attributes, consults import filters of the protocol to see if the route should be accepted and/or its attributes modified, stores the temporary attributes back to the rte.

    Now, having a "public" version of the route, we automatically find any old route defined by the protocol src for network n, replace it by the new one (or removing it if new is NULL), recalculate the optimal route for this destination and finally broadcast the change (if any) to all routing protocols by calling rte_announce().

    All memory used for attribute lists and other temporary allocations is taken from a special linear pool rte_update_pool and freed when rte_update() finishes.

    Function

    void rt_refresh_begin (rtable * t, struct announce_hook * ah) -- start a refresh cycle

    Arguments

    rtable * t

    related routing table

    struct announce_hook * ah

    related announce hook

    Description

    This function starts a refresh cycle for given routing table and announce hook. The refresh cycle is a sequence where the protocol sends all its valid routes to the routing table (by rte_update()). After that, all protocol routes (more precisely routes with ah as sender) not sent during the refresh cycle but still in the table from the past are pruned. This is implemented by marking all related routes as stale by REF_STALE flag in rt_refresh_begin(), then marking all related stale routes with REF_DISCARD flag in rt_refresh_end() and then removing such routes in the prune loop.

    Function

    void rt_refresh_end (rtable * t, struct announce_hook * ah) -- end a refresh cycle

    Arguments

    rtable * t

    related routing table

    struct announce_hook * ah

    related announce hook

    Description

    This function starts a refresh cycle for given routing table and announce hook. See rt_refresh_begin() for description of refresh cycles.

    Function

    void rte_dump (rte * e) -- dump a route

    Arguments

    rte * e

    rte to be dumped

    Description

    This functions dumps contents of a rte to debug output.

    Function

    void rt_dump (rtable * t) -- dump a routing table

    Arguments

    rtable * t

    routing table to be dumped

    Description

    This function dumps contents of a given routing table to debug output.

    Function

    void rt_dump_all (void) -- dump all routing tables

    Description

    This function dumps contents of all routing tables to debug output.

    Function

    void rt_init (void) -- initialize routing tables

    Description

    This function is called during BIRD startup. It initializes the routing table module.

    Function

    int rt_prune_table (rtable * tab) -- prune a routing table

    Arguments

    rtable * tab

    a routing table for pruning

    Description

    This function scans the routing table tab and removes routes belonging to flushing protocols, discarded routes and also stale network entries, in a similar fashion like rt_prune_loop(). Returns 1 when all such routes are pruned. Contrary to rt_prune_loop(), this function is not a part of the protocol flushing loop, but it is called from rt_event() for just one routing table.

    Note that rt_prune_table() and rt_prune_loop() share (for each table) the prune state (prune_state) and also the pruning iterator (prune_fit).

    Function

    int rt_prune_loop (void) -- prune routing tables

    Description

    The prune loop scans routing tables and removes routes belonging to flushing protocols, discarded routes and also stale network entries. Returns 1 when all such routes are pruned. It is a part of the protocol flushing loop.

    Function

    void rt_lock_table (rtable * r) -- lock a routing table

    Arguments

    rtable * r

    routing table to be locked

    Description

    Lock a routing table, because it's in use by a protocol, preventing it from being freed when it gets undefined in a new configuration.

    Function

    void rt_unlock_table (rtable * r) -- unlock a routing table

    Arguments

    rtable * r

    routing table to be unlocked

    Description

    Unlock a routing table formerly locked by rt_lock_table(), that is decrease its use count and delete it if it's scheduled for deletion by configuration changes.

    Function

    void rt_commit (struct config * new, struct config * old) -- commit new routing table configuration

    Arguments

    struct config * new

    new configuration

    struct config * old

    original configuration or NULL if it's boot time config

    Description

    Scan differences between old and new configuration and modify the routing tables according to these changes. If new defines a previously unknown table, create it, if it omits a table existing in old, schedule it for deletion (it gets deleted when all protocols disconnect from it by calling rt_unlock_table()), if it exists in both configurations, leave it unchanged.

    Function

    int rt_feed_baby (struct proto * p) -- advertise routes to a new protocol

    Arguments

    struct proto * p

    protocol to be fed

    Description

    This function performs one pass of advertisement of routes to a newly initialized protocol. It's called by the protocol code as long as it has something to do. (We avoid transferring all the routes in single pass in order not to monopolize CPU time.)

    Function

    void rt_feed_baby_abort (struct proto * p) -- abort protocol feeding

    Arguments

    struct proto * p

    protocol

    Description

    This function is called by the protocol code when the protocol stops or ceases to exist before the last iteration of rt_feed_baby() has finished.

    Function

    net * net_find (rtable * tab, ip_addr addr, unsigned len) -- find a network entry

    Arguments

    rtable * tab

    a routing table

    ip_addr addr

    address of the network

    unsigned len

    length of the network prefix

    Description

    net_find() looks up the given network in routing table tab and returns a pointer to its net entry or NULL if no such network exists.

    Function

    net * net_get (rtable * tab, ip_addr addr, unsigned len) -- obtain a network entry

    Arguments

    rtable * tab

    a routing table

    ip_addr addr

    address of the network

    unsigned len

    length of the network prefix

    Description

    net_get() looks up the given network in routing table tab and returns a pointer to its net entry. If no such entry exists, it's created.

    Function

    rte * rte_cow (rte * r) -- copy a route for writing

    Arguments

    rte * r

    a route entry to be copied

    Description

    rte_cow() takes a rte and prepares it for modification. The exact action taken depends on the flags of the rte -- if it's a temporary entry, it's just returned unchanged, else a new temporary entry with the same contents is created.

    The primary use of this function is inside the filter machinery -- when a filter wants to modify rte contents (to change the preference or to attach another set of attributes), it must ensure that the rte is not shared with anyone else (and especially that it isn't stored in any routing table).

    Result

    a pointer to the new writable rte.

    2.3 Route attribute cache

    Each route entry carries a set of route attributes. Several of them vary from route to route, but most attributes are usually common for a large number of routes. To conserve memory, we've decided to store only the varying ones directly in the rte and hold the rest in a special structure called rta which is shared among all the rte's with these attributes.

    Each rta contains all the static attributes of the route (i.e., those which are always present) as structure members and a list of dynamic attributes represented by a linked list of ea_list structures, each of them consisting of an array of eattr's containing the individual attributes. An attribute can be specified more than once in the ea_list chain and in such case the first occurrence overrides the others. This semantics is used especially when someone (for example a filter) wishes to alter values of several dynamic attributes, but it wants to preserve the original attribute lists maintained by another module.

    Each eattr contains an attribute identifier (split to protocol ID and per-protocol attribute ID), protocol dependent flags, a type code (consisting of several bit fields describing attribute characteristics) and either an embedded 32-bit value or a pointer to a adata structure holding attribute contents.

    There exist two variants of rta's -- cached and un-cached ones. Un-cached rta's can have arbitrarily complex structure of ea_list's and they can be modified by any module in the route processing chain. Cached rta's have their attribute lists normalized (that means at most one ea_list is present and its values are sorted in order to speed up searching), they are stored in a hash table to make fast lookup possible and they are provided with a use count to allow sharing.

    Routing tables always contain only cached rta's.

    Function

    struct mpnh * mpnh_merge (struct mpnh * x, struct mpnh * y, int rx, int ry, int max, linpool * lp) -- merge nexthop lists

    Arguments

    struct mpnh * x

    list 1

    struct mpnh * y

    list 2

    int rx

    reusability of list x

    int ry

    reusability of list y

    int max

    max number of nexthops

    linpool * lp

    linpool for allocating nexthops

    Description

    The mpnh_merge() function takes two nexthop lists x and y and merges them, eliminating possible duplicates. The input lists must be sorted and the result is sorted too. The number of nexthops in result is limited by max. New nodes are allocated from linpool lp.

    The arguments rx and ry specify whether corresponding input lists may be consumed by the function (i.e. their nodes reused in the resulting list), in that case the caller should not access these lists after that. To eliminate issues with deallocation of these lists, the caller should use some form of bulk deallocation (e.g. stack or linpool) to free these nodes when the resulting list is no longer needed. When reusability is not set, the corresponding lists are not modified nor linked from the resulting list.

    Function

    eattr * ea_find (ea_list * e, unsigned id) -- find an extended attribute

    Arguments

    ea_list * e

    attribute list to search in

    unsigned id

    attribute ID to search for

    Description

    Given an extended attribute list, ea_find() searches for a first occurrence of an attribute with specified ID, returning either a pointer to its eattr structure or NULL if no such attribute exists.

    Function

    eattr * ea_walk (struct ea_walk_state * s, uint id, uint max) -- walk through extended attributes

    Arguments

    struct ea_walk_state * s

    walk state structure

    uint id

    start of attribute ID interval

    uint max

    length of attribute ID interval

    Description

    Given an extended attribute list, ea_walk() walks through the list looking for first occurrences of attributes with ID in specified interval from id to (id + max - 1), returning pointers to found eattr structures, storing its walk state in s for subsequent calls.

    The function ea_walk() is supposed to be called in a loop, with initially zeroed walk state structure s with filled the initial extended attribute list, returning one found attribute in each call or NULL when no other attribute exists. The extended attribute list or the arguments should not be modified between calls. The maximum value of max is 128.

    Function

    int ea_get_int (ea_list * e, unsigned id, int def) -- fetch an integer attribute

    Arguments

    ea_list * e

    attribute list

    unsigned id

    attribute ID

    int def

    default value

    Description

    This function is a shortcut for retrieving a value of an integer attribute by calling ea_find() to find the attribute, extracting its value or returning a provided default if no such attribute is present.

    Function

    void ea_sort (ea_list * e) -- sort an attribute list

    Arguments

    ea_list * e

    list to be sorted

    Description

    This function takes a ea_list chain and sorts the attributes within each of its entries.

    If an attribute occurs multiple times in a single ea_list, ea_sort() leaves only the first (the only significant) occurrence.

    Function

    unsigned ea_scan (ea_list * e) -- estimate attribute list size

    Arguments

    ea_list * e

    attribute list

    Description

    This function calculates an upper bound of the size of a given ea_list after merging with ea_merge().

    Function

    void ea_merge (ea_list * e, ea_list * t) -- merge segments of an attribute list

    Arguments

    ea_list * e

    attribute list

    ea_list * t

    buffer to store the result to

    Description

    This function takes a possibly multi-segment attribute list and merges all of its segments to one.

    The primary use of this function is for ea_list normalization: first call ea_scan() to determine how much memory will the result take, then allocate a buffer (usually using alloca()), merge the segments with ea_merge() and finally sort and prune the result by calling ea_sort().

    Function

    int ea_same (ea_list * x, ea_list * y) -- compare two ea_list's

    Arguments

    ea_list * x

    attribute list

    ea_list * y

    attribute list

    Description

    ea_same() compares two normalized attribute lists x and y and returns 1 if they contain the same attributes, 0 otherwise.

    Function

    void ea_show (struct cli * c, eattr * e) -- print an eattr to CLI

    Arguments

    struct cli * c

    destination CLI

    eattr * e

    attribute to be printed

    Description

    This function takes an extended attribute represented by its eattr structure and prints it to the CLI according to the type information.

    If the protocol defining the attribute provides its own get_attr() hook, it's consulted first.

    Function

    void ea_dump (ea_list * e) -- dump an extended attribute

    Arguments

    ea_list * e

    attribute to be dumped

    Description

    ea_dump() dumps contents of the extended attribute given to the debug output.

    Function

    uint ea_hash (ea_list * e) -- calculate an ea_list hash key

    Arguments

    ea_list * e

    attribute list

    Description

    ea_hash() takes an extended attribute list and calculated a hopefully uniformly distributed hash value from its contents.

    Function

    ea_list * ea_append (ea_list * to, ea_list * what) -- concatenate ea_list's

    Arguments

    ea_list * to

    destination list (can be NULL)

    ea_list * what

    list to be appended (can be NULL)

    Description

    This function appends the ea_list what at the end of ea_list to and returns a pointer to the resulting list.

    Function

    rta * rta_lookup (rta * o) -- look up a rta in attribute cache

    Arguments

    rta * o

    a un-cached rta

    Description

    rta_lookup() gets an un-cached rta structure and returns its cached counterpart. It starts with examining the attribute cache to see whether there exists a matching entry. If such an entry exists, it's returned and its use count is incremented, else a new entry is created with use count set to 1.

    The extended attribute lists attached to the rta are automatically converted to the normalized form.

    Function

    void rta_dump (rta * a) -- dump route attributes

    Arguments

    rta * a

    attribute structure to dump

    Description

    This function takes a rta and dumps its contents to the debug output.

    Function

    void rta_dump_all (void) -- dump attribute cache

    Description

    This function dumps the whole contents of route attribute cache to the debug output.

    Function

    void rta_init (void) -- initialize route attribute cache

    Description

    This function is called during initialization of the routing table module to set up the internals of the attribute cache.

    Function

    rta * rta_clone (rta * r) -- clone route attributes

    Arguments

    rta * r

    a rta to be cloned

    Description

    rta_clone() takes a cached rta and returns its identical cached copy. Currently it works by just returning the original rta with its use count incremented.

    Function

    void rta_free (rta * r) -- free route attributes

    Arguments

    rta * r

    a rta to be freed

    Description

    If you stop using a rta (for example when deleting a route which uses it), you need to call rta_free() to notify the attribute cache the attribute is no longer in use and can be freed if you were the last user (which rta_free() tests by inspecting the use count).

    2.4 Routing protocols

    Introduction

    The routing protocols are the bird's heart and a fine amount of code is dedicated to their management and for providing support functions to them. (-: Actually, this is the reason why the directory with sources of the core code is called nest :-).

    When talking about protocols, one need to distinguish between protocols and protocol instances. A protocol exists exactly once, not depending on whether it's configured or not and it can have an arbitrary number of instances corresponding to its "incarnations" requested by the configuration file. Each instance is completely autonomous, has its own configuration, its own status, its own set of routes and its own set of interfaces it works on.

    A protocol is represented by a protocol structure containing all the basic information (protocol name, default settings and pointers to most of the protocol hooks). All these structures are linked in the protocol_list list.

    Each instance has its own proto structure describing all its properties: protocol type, configuration, a resource pool where all resources belonging to the instance live, various protocol attributes (take a look at the declaration of proto in protocol.h), protocol states (see below for what do they mean), connections to routing tables, filters attached to the protocol and finally a set of pointers to the rest of protocol hooks (they are the same for all instances of the protocol, but in order to avoid extra indirections when calling the hooks from the fast path, they are stored directly in proto). The instance is always linked in both the global instance list (proto_list) and a per-status list (either active_proto_list for running protocols, initial_proto_list for protocols being initialized or flush_proto_list when the protocol is being shut down).

    The protocol hooks are described in the next chapter, for more information about configuration of protocols, please refer to the configuration chapter and also to the description of the proto_commit function.

    Protocol states

    As startup and shutdown of each protocol are complex processes which can be affected by lots of external events (user's actions, reconfigurations, behavior of neighboring routers etc.), we have decided to supervise them by a pair of simple state machines -- the protocol state machine and a core state machine.

    The protocol state machine corresponds to internal state of the protocol and the protocol can alter its state whenever it wants to. There are the following states:

    PS_DOWN

    The protocol is down and waits for being woken up by calling its start() hook.

    PS_START

    The protocol is waiting for connection with the rest of the network. It's active, it has resources allocated, but it still doesn't want any routes since it doesn't know what to do with them.

    PS_UP

    The protocol is up and running. It communicates with the core, delivers routes to tables and wants to hear announcement about route changes.

    PS_STOP

    The protocol has been shut down (either by being asked by the core code to do so or due to having encountered a protocol error).

    Unless the protocol is in the PS_DOWN state, it can decide to change its state by calling the proto_notify_state function.

    At any time, the core code can ask the protocol to shut itself down by calling its stop() hook.

    The core state machine takes care of the core view of protocol state. The states are traversed according to changes of the protocol state machine, but sometimes the transitions are delayed if the core needs to finish some actions (for example sending of new routes to the protocol) before proceeding to the new state. There are the following core states:

    FS_HUNGRY

    The protocol is down, it doesn't have any routes and doesn't want them.

    FS_FEEDING

    The protocol has reached the PS_UP state, but we are still busy sending the initial set of routes to it.

    FS_HAPPY

    The protocol is up and has complete routing information.

    FS_FLUSHING

    The protocol is shutting down (it's in either PS_STOP or PS_DOWN state) and we're flushing all of its routes from the routing tables.

    Functions of the protocol module

    The protocol module provides the following functions:

    Function

    void * proto_new (struct proto_config * c, unsigned size) -- create a new protocol instance

    Arguments

    struct proto_config * c

    protocol configuration

    unsigned size

    size of protocol data structure (each protocol instance is represented by a structure starting with generic part [struct proto] and continued with data specific to the protocol)

    Description

    When a new configuration has been read in, the core code starts initializing all the protocol instances configured by calling their init() hooks with the corresponding instance configuration. The initialization code of the protocol is expected to create a new instance according to the configuration by calling this function and then modifying the default settings to values wanted by the protocol.

    Function

    struct announce_hook * proto_add_announce_hook (struct proto * p, struct rtable * t, struct proto_stats * stats) -- connect protocol to a routing table

    Arguments

    struct proto * p

    protocol instance

    struct rtable * t

    routing table to connect to

    struct proto_stats * stats

    per-table protocol statistics

    Description

    This function creates a connection between the protocol instance p and the routing table t, making the protocol hear all changes in the table.

    The announce hook is linked in the protocol ahook list. Announce hooks are allocated from the routing table resource pool and when protocol accepts routes also in the table ahook list. The are linked to the table ahook list and unlinked from it depending on export_state (in proto_want_export_up() and proto_want_export_down()) and they are automatically freed after the protocol is flushed (in proto_fell_down()).

    Unless you want to listen to multiple routing tables (as the Pipe protocol does), you needn't to worry about this function since the connection to the protocol's primary routing table is initialized automatically by the core code.

    Function

    struct announce_hook * proto_find_announce_hook (struct proto * p, struct rtable * t) -- find announce hooks

    Arguments

    struct proto * p

    protocol instance

    struct rtable * t

    routing table

    Description

    Returns pointer to announce hook or NULL

    Function

    void * proto_config_new (struct protocol * pr, int class) -- create a new protocol configuration

    Arguments

    struct protocol * pr

    protocol the configuration will belong to

    int class

    SYM_PROTO or SYM_TEMPLATE

    Description

    Whenever the configuration file says that a new instance of a routing protocol should be created, the parser calls proto_config_new() to create a configuration entry for this instance (a structure staring with the proto_config header containing all the generic items followed by protocol-specific ones). Also, the configuration entry gets added to the list of protocol instances kept in the configuration.

    The function is also used to create protocol templates (when class SYM_TEMPLATE is specified), the only difference is that templates are not added to the list of protocol instances and therefore not initialized during protos_commit()).

    Function

    void proto_copy_config (struct proto_config * dest, struct proto_config * src) -- copy a protocol configuration

    Arguments

    struct proto_config * dest

    destination protocol configuration

    struct proto_config * src

    source protocol configuration

    Description

    Whenever a new instance of a routing protocol is created from the template, proto_copy_config() is called to copy a content of the source protocol configuration to the new protocol configuration. Name, class and a node in protos list of dest are kept intact. copy_config() protocol hook is used to copy protocol-specific data.

    Function

    void protos_preconfig (struct config * c) -- pre-configuration processing

    Arguments

    struct config * c

    new configuration

    Description

    This function calls the preconfig() hooks of all routing protocols available to prepare them for reading of the new configuration.

    Function

    void protos_postconfig (struct config * c) -- post-configuration processing

    Arguments

    struct config * c

    new configuration

    Description

    This function calls the postconfig() hooks of all protocol instances specified in configuration c. The hooks are not called for protocol templates.

    Function

    void protos_commit (struct config * new, struct config * old, int force_reconfig, int type) -- commit new protocol configuration

    Arguments

    struct config * new

    new configuration

    struct config * old

    old configuration or NULL if it's boot time config

    int force_reconfig

    force restart of all protocols (used for example when the router ID changes)

    int type

    type of reconfiguration (RECONFIG_SOFT or RECONFIG_HARD)

    Description

    Scan differences between old and new configuration and adjust all protocol instances to conform to the new configuration.

    When a protocol exists in the new configuration, but it doesn't in the original one, it's immediately started. When a collision with the other running protocol would arise, the new protocol will be temporarily stopped by the locking mechanism.

    When a protocol exists in the old configuration, but it doesn't in the new one, it's shut down and deleted after the shutdown completes.

    When a protocol exists in both configurations, the core decides whether it's possible to reconfigure it dynamically - it checks all the core properties of the protocol (changes in filters are ignored if type is RECONFIG_SOFT) and if they match, it asks the reconfigure() hook of the protocol to see if the protocol is able to switch to the new configuration. If it isn't possible, the protocol is shut down and a new instance is started with the new configuration after the shutdown is completed.

    2.5 Graceful restart recovery

    Graceful restart of a router is a process when the routing plane (e.g. BIRD) restarts but both the forwarding plane (e.g kernel routing table) and routing neighbors keep proper routes, and therefore uninterrupted packet forwarding is maintained.

    BIRD implements graceful restart recovery by deferring export of routes to protocols until routing tables are refilled with the expected content. After start, protocols generate routes as usual, but routes are not propagated to them, until protocols report that they generated all routes. After that, graceful restart recovery is finished and the export (and the initial feed) to protocols is enabled.

    When graceful restart recovery need is detected during initialization, then enabled protocols are marked with gr_recovery flag before start. Such protocols then decide how to proceed with graceful restart, participation is voluntary. Protocols could lock the recovery by proto_graceful_restart_lock() (stored in gr_lock flag), which means that they want to postpone the end of the recovery until they converge and then unlock it. They also could set gr_wait before advancing to PS_UP, which means that the core should defer route export to that protocol until the end of the recovery. This should be done by protocols that expect their neigbors to keep the proper routes (kernel table, BGP sessions with BGP graceful restart capability).

    The graceful restart recovery is finished when either all graceful restart locks are unlocked or when graceful restart wait timer fires.

    Function

    void graceful_restart_recovery (void) -- request initial graceful restart recovery

    Graceful restart recovery

    Called by the platform initialization code if the need for recovery after graceful restart is detected during boot. Have to be called before protos_commit().

    Function

    void graceful_restart_init (void) -- initialize graceful restart

    Description

    When graceful restart recovery was requested, the function starts an active phase of the recovery and initializes graceful restart wait timer. The function have to be called after protos_commit().

    Function

    void graceful_restart_done (struct timer *t UNUSED) -- finalize graceful restart

    Arguments

    struct timer *t UNUSED

    -- undescribed --

    Description

    When there are no locks on graceful restart, the functions finalizes the graceful restart recovery. Protocols postponing route export until the end of the recovery are awakened and the export to them is enabled. All other related state is cleared. The function is also called when the graceful restart wait timer fires (but there are still some locks).

    Function

    void proto_graceful_restart_lock (struct proto * p) -- lock graceful restart by protocol

    Arguments

    struct proto * p

    protocol instance

    Description

    This function allows a protocol to postpone the end of graceful restart recovery until it converges. The lock is removed when the protocol calls proto_graceful_restart_unlock() or when the protocol is stopped.

    The function have to be called during the initial phase of graceful restart recovery and only for protocols that are part of graceful restart (i.e. their gr_recovery is set), which means it should be called from protocol start hooks.

    Function

    void proto_graceful_restart_unlock (struct proto * p) -- unlock graceful restart by protocol

    Arguments

    struct proto * p

    protocol instance

    Description

    This function unlocks a lock from proto_graceful_restart_lock(). It is also automatically called when the lock holding protocol went down.

    Function

    void protos_dump_all (void) -- dump status of all protocols

    Description

    This function dumps status of all existing protocol instances to the debug output. It involves printing of general status information such as protocol states, its position on the protocol lists and also calling of a dump() hook of the protocol to print the internals.

    Function

    void proto_build (struct protocol * p) -- make a single protocol available

    Arguments

    struct protocol * p

    the protocol

    Description

    After the platform specific initialization code uses protos_build() to add all the standard protocols, it should call proto_build() for all platform specific protocols to inform the core that they exist.

    Function

    void protos_build (void) -- build a protocol list

    Description

    This function is called during BIRD startup to insert all standard protocols to the global protocol list. Insertion of platform specific protocols (such as the kernel syncer) is in the domain of competence of the platform dependent startup code.

    Function

    void proto_request_feeding (struct proto * p) -- request feeding routes to the protocol

    Arguments

    struct proto * p

    given protocol

    Description

    Sometimes it is needed to send again all routes to the protocol. This is called feeding and can be requested by this function. This would cause protocol export state transition to ES_FEEDING (during feeding) and when completed, it will switch back to ES_READY. This function can be called even when feeding is already running, in that case it is restarted.

    Function

    void proto_notify_limit (struct announce_hook * ah, struct proto_limit * l, int dir, u32 rt_count)

    Arguments

    struct announce_hook * ah

    announce hook

    struct proto_limit * l

    limit being hit

    int dir

    limit direction (PLD_*)

    u32 rt_count

    the number of routes

    Description

    The function is called by the route processing core when limit l is breached. It activates the limit and tooks appropriate action according to l->action.

    Function

    void proto_notify_state (struct proto * p, unsigned ps) -- notify core about protocol state change

    Arguments

    struct proto * p

    protocol the state of which has changed

    unsigned ps

    the new status

    Description

    Whenever a state of a protocol changes due to some event internal to the protocol (i.e., not inside a start() or shutdown() hook), it should immediately notify the core about the change by calling proto_notify_state() which will write the new state to the proto structure and take all the actions necessary to adapt to the new state. State change to PS_DOWN immediately frees resources of protocol and might execute start callback of protocol; therefore, it should be used at tail positions of protocol callbacks.

    2.6 Protocol hooks

    Each protocol can provide a rich set of hook functions referred to by pointers in either the proto or protocol structure. They are called by the core whenever it wants the protocol to perform some action or to notify the protocol about any change of its environment. All of the hooks can be set to NULL which means to ignore the change or to take a default action.

    Function

    void preconfig (struct protocol * p, struct config * c) -- protocol preconfiguration

    Arguments

    struct protocol * p

    a routing protocol

    struct config * c

    new configuration

    Description

    The preconfig() hook is called before parsing of a new configuration.

    Function

    void postconfig (struct proto_config * c) -- instance post-configuration

    Arguments

    struct proto_config * c

    instance configuration

    Description

    The postconfig() hook is called for each configured instance after parsing of the new configuration is finished.

    Function

    struct proto * init (struct proto_config * c) -- initialize an instance

    Arguments

    struct proto_config * c

    instance configuration

    Description

    The init() hook is called by the core to create a protocol instance according to supplied protocol configuration.

    Result

    a pointer to the instance created

    Function

    int reconfigure (struct proto * p, struct proto_config * c) -- request instance reconfiguration

    Arguments

    struct proto * p

    an instance

    struct proto_config * c

    new configuration

    Description

    The core calls the reconfigure() hook whenever it wants to ask the protocol for switching to a new configuration. If the reconfiguration is possible, the hook returns 1. Otherwise, it returns 0 and the core will shut down the instance and start a new one with the new configuration.

    After the protocol confirms reconfiguration, it must no longer keep any references to the old configuration since the memory it's stored in can be re-used at any time.

    Function

    void dump (struct proto * p) -- dump protocol state

    Arguments

    struct proto * p

    an instance

    Description

    This hook dumps the complete state of the instance to the debug output.

    Function

    void dump_attrs (rte * e) -- dump protocol-dependent attributes

    Arguments

    rte * e

    a route entry

    Description

    This hook dumps all attributes in the rte which belong to this protocol to the debug output.

    Function

    int start (struct proto * p) -- request instance startup

    Arguments

    struct proto * p

    protocol instance

    Description

    The start() hook is called by the core when it wishes to start the instance. Multitable protocols should lock their tables here.

    Result

    new protocol state

    Function

    int shutdown (struct proto * p) -- request instance shutdown

    Arguments

    struct proto * p

    protocol instance

    Description

    The stop() hook is called by the core when it wishes to shut the instance down for some reason.

    Returns

    new protocol state

    Function

    void cleanup (struct proto * p) -- request instance cleanup

    Arguments

    struct proto * p

    protocol instance

    Description

    The cleanup() hook is called by the core when the protocol became hungry/down, i.e. all protocol ahooks and routes are flushed. Multitable protocols should unlock their tables here.

    Function

    void get_status (struct proto * p, byte * buf) -- get instance status

    Arguments

    struct proto * p

    protocol instance

    byte * buf

    buffer to be filled with the status string

    Description

    This hook is called by the core if it wishes to obtain an brief one-line user friendly representation of the status of the instance to be printed by the <cf/show protocols/ command.

    Function

    void get_route_info (rte * e, byte * buf, ea_list * attrs) -- get route information

    Arguments

    rte * e

    a route entry

    byte * buf

    buffer to be filled with the resulting string

    ea_list * attrs

    extended attributes of the route

    Description

    This hook is called to fill the buffer buf with a brief user friendly representation of metrics of a route belonging to this protocol.

    Function

    int get_attr (eattr * a, byte * buf, int buflen) -- get attribute information

    Arguments

    eattr * a

    an extended attribute

    byte * buf

    buffer to be filled with attribute information

    int buflen

    a length of the buf parameter

    Description

    The get_attr() hook is called by the core to obtain a user friendly representation of an extended route attribute. It can either leave the whole conversion to the core (by returning GA_UNKNOWN), fill in only attribute name (and let the core format the attribute value automatically according to the type field; by returning GA_NAME) or doing the whole conversion (used in case the value requires extra care; return GA_FULL).

    Function

    void if_notify (struct proto * p, unsigned flags, struct iface * i) -- notify instance about interface changes

    Arguments

    struct proto * p

    protocol instance

    unsigned flags

    interface change flags

    struct iface * i

    the interface in question

    Description

    This hook is called whenever any network interface changes its status. The change is described by a combination of status bits (IF_CHANGE_xxx) in the flags parameter.

    Function

    void ifa_notify (struct proto * p, unsigned flags, struct ifa * a) -- notify instance about interface address changes

    Arguments

    struct proto * p

    protocol instance

    unsigned flags

    address change flags

    struct ifa * a

    the interface address

    Description

    This hook is called to notify the protocol instance about an interface acquiring or losing one of its addresses. The change is described by a combination of status bits (IF_CHANGE_xxx) in the flags parameter.

    Function

    void rt_notify (struct proto * p, net * net, rte * new, rte * old, ea_list * attrs) -- notify instance about routing table change

    Arguments

    struct proto * p

    protocol instance

    net * net

    a network entry

    rte * new

    new route for the network

    rte * old

    old route for the network

    ea_list * attrs

    extended attributes associated with the new entry

    Description

    The rt_notify() hook is called to inform the protocol instance about changes in the connected routing table table, that is a route old belonging to network net being replaced by a new route new with extended attributes attrs. Either new or old or both can be NULL if the corresponding route doesn't exist.

    If the type of route announcement is RA_OPTIMAL, it is an announcement of optimal route change, new stores the new optimal route and old stores the old optimal route.

    If the type of route announcement is RA_ANY, it is an announcement of any route change, new stores the new route and old stores the old route from the same protocol.

    p->accept_ra_types specifies which kind of route announcements protocol wants to receive.

    Function

    void neigh_notify (neighbor * neigh) -- notify instance about neighbor status change

    Arguments

    neighbor * neigh

    a neighbor cache entry

    Description

    The neigh_notify() hook is called by the neighbor cache whenever a neighbor changes its state, that is it gets disconnected or a sticky neighbor gets connected.

    Function

    ea_list * make_tmp_attrs (rte * e, struct linpool * pool) -- convert embedded attributes to temporary ones

    Arguments

    rte * e

    route entry

    struct linpool * pool

    linear pool to allocate attribute memory in

    Description

    This hook is called by the routing table functions if they need to convert the protocol attributes embedded directly in the rte to temporary extended attributes in order to distribute them to other protocols or to filters. make_tmp_attrs() creates an ea_list in the linear pool pool, fills it with values of the temporary attributes and returns a pointer to it.

    Function

    void store_tmp_attrs (rte * e, ea_list * attrs) -- convert temporary attributes to embedded ones

    Arguments

    rte * e

    route entry

    ea_list * attrs

    temporary attributes to be converted

    Description

    This hook is an exact opposite of make_tmp_attrs() -- it takes a list of extended attributes and converts them to attributes embedded in the rte corresponding to this protocol.

    You must be prepared for any of the attributes being missing from the list and use default values instead.

    Function

    int import_control (struct proto * p, rte ** e, ea_list ** attrs, struct linpool * pool) -- pre-filtering decisions on route import

    Arguments

    struct proto * p

    protocol instance the route is going to be imported to

    rte ** e

    the route in question

    ea_list ** attrs

    extended attributes of the route

    struct linpool * pool

    linear pool for allocation of all temporary data

    Description

    The import_control() hook is called as the first step of a exporting a route from a routing table to the protocol instance. It can modify route attributes and force acceptance or rejection of the route regardless of user-specified filters. See rte_announce() for a complete description of the route distribution process.

    The standard use of this hook is to reject routes having originated from the same instance and to set default values of the protocol's metrics.

    Result

    1 if the route has to be accepted, -1 if rejected and 0 if it should be passed to the filters.

    Function

    int rte_recalculate (struct rtable * table, struct network * net, struct rte * new, struct rte * old, struct rte * old_best) -- prepare routes for comparison

    Arguments

    struct rtable * table

    a routing table

    struct network * net

    a network entry

    struct rte * new

    new route for the network

    struct rte * old

    old route for the network

    struct rte * old_best

    old best route for the network (may be NULL)

    Description

    This hook is called when a route change (from old to new for a net entry) is propagated to a table. It may be used to prepare routes for comparison by rte_better() in the best route selection. new may or may not be in net->routes list, old is not there.

    Result

    1 if the ordering implied by rte_better() changes enough that full best route calculation have to be done, 0 otherwise.

    Function

    int rte_better (rte * new, rte * old) -- compare metrics of two routes

    Arguments

    rte * new

    the new route

    rte * old

    the original route

    Description

    This hook gets called when the routing table contains two routes for the same network which have originated from different instances of a single protocol and it wants to select which one is preferred over the other one. Protocols usually decide according to route metrics.

    Result

    1 if new is better (more preferred) than old, 0 otherwise.

    Function

    int rte_same (rte * e1, rte * e2) -- compare two routes

    Arguments

    rte * e1

    route

    rte * e2

    route

    Description

    The rte_same() hook tests whether the routes e1 and e2 belonging to the same protocol instance have identical contents. Contents of rta, all the extended attributes and rte preference are checked by the core code, no need to take care of them here.

    Result

    1 if e1 is identical to e2, 0 otherwise.

    Function

    void rte_insert (net * n, rte * e) -- notify instance about route insertion

    Arguments

    net * n

    network

    rte * e

    route

    Description

    This hook is called whenever a rte belonging to the instance is accepted for insertion to a routing table.

    Please avoid using this function in new protocols.

    Function

    void rte_remove (net * n, rte * e) -- notify instance about route removal

    Arguments

    net * n

    network

    rte * e

    route

    Description

    This hook is called whenever a rte belonging to the instance is removed from a routing table.

    Please avoid using this function in new protocols.

    2.7 Interfaces

    The interface module keeps track of all network interfaces in the system and their addresses.

    Each interface is represented by an iface structure which carries interface capability flags (IF_MULTIACCESS, IF_BROADCAST etc.), MTU, interface name and index and finally a linked list of network prefixes assigned to the interface, each one represented by struct ifa.

    The interface module keeps a `soft-up' state for each iface which is a conjunction of link being up, the interface being of a `sane' type and at least one IP address assigned to it.

    Function

    void ifa_dump (struct ifa * a) -- dump interface address

    Arguments

    struct ifa * a

    interface address descriptor

    Description

    This function dumps contents of an ifa to the debug output.

    Function

    void if_dump (struct iface * i) -- dump interface

    Arguments

    struct iface * i

    interface to dump

    Description

    This function dumps all information associated with a given network interface to the debug output.

    Function

    void if_dump_all (void) -- dump all interfaces

    Description

    This function dumps information about all known network interfaces to the debug output.

    Function

    void if_delete (struct iface * old) -- remove interface

    Arguments

    struct iface * old

    interface

    Description

    This function is called by the low-level platform dependent code whenever it notices an interface disappears. It is just a shorthand for if_update().

    Function

    struct iface * if_update (struct iface * new) -- update interface status

    Arguments

    struct iface * new

    new interface status

    Description

    if_update() is called by the low-level platform dependent code whenever it notices an interface change.

    There exist two types of interface updates -- synchronous and asynchronous ones. In the synchronous case, the low-level code calls if_start_update(), scans all interfaces reported by the OS, uses if_update() and ifa_update() to pass them to the core and then it finishes the update sequence by calling if_end_update(). When working asynchronously, the sysdep code calls if_update() and ifa_update() whenever it notices a change.

    if_update() will automatically notify all other modules about the change.

    Function

    void if_feed_baby (struct proto * p) -- advertise interfaces to a new protocol

    Arguments

    struct proto * p

    protocol to feed

    Description

    When a new protocol starts, this function sends it a series of notifications about all existing interfaces.

    Function

    struct iface * if_find_by_index (unsigned idx) -- find interface by ifindex

    Arguments

    unsigned idx

    ifindex

    Description

    This function finds an iface structure corresponding to an interface of the given index idx. Returns a pointer to the structure or NULL if no such structure exists.

    Function

    struct iface * if_find_by_name (char * name) -- find interface by name

    Arguments

    char * name

    interface name

    Description

    This function finds an iface structure corresponding to an interface of the given name name. Returns a pointer to the structure or NULL if no such structure exists.

    Function

    struct ifa * ifa_update (struct ifa * a) -- update interface address

    Arguments

    struct ifa * a

    new interface address

    Description

    This function adds address information to a network interface. It's called by the platform dependent code during the interface update process described under if_update().

    Function

    void ifa_delete (struct ifa * a) -- remove interface address

    Arguments

    struct ifa * a

    interface address

    Description

    This function removes address information from a network interface. It's called by the platform dependent code during the interface update process described under if_update().

    Function

    void if_init (void) -- initialize interface module

    Description

    This function is called during BIRD startup to initialize all data structures of the interface module.

    2.8 Neighbor cache

    Most routing protocols need to associate their internal state data with neighboring routers, check whether an address given as the next hop attribute of a route is really an address of a directly connected host and which interface is it connected through. Also, they often need to be notified when a neighbor ceases to exist or when their long awaited neighbor becomes connected. The neighbor cache is there to solve all these problems.

    The neighbor cache maintains a collection of neighbor entries. Each entry represents one IP address corresponding to either our directly connected neighbor or our own end of the link (when the scope of the address is set to SCOPE_HOST) together with per-neighbor data belonging to a single protocol.

    Active entries represent known neighbors and are stored in a hash table (to allow fast retrieval based on the IP address of the node) and two linked lists: one global and one per-interface (allowing quick processing of interface change events). Inactive entries exist only when the protocol has explicitly requested it via the NEF_STICKY flag because it wishes to be notified when the node will again become a neighbor. Such entries are enqueued in a special list which is walked whenever an interface changes its state to up.

    When a neighbor event occurs (a neighbor gets disconnected or a sticky inactive neighbor becomes connected), the protocol hook neigh_notify() is called to advertise the change.

    Function

    neighbor * neigh_find (struct proto * p, ip_addr * a, unsigned flags) -- find or create a neighbor entry.

    Arguments

    struct proto * p

    protocol which asks for the entry.

    ip_addr * a

    pointer to IP address of the node to be searched for.

    unsigned flags

    0 or NEF_STICKY if you want to create a sticky entry.

    Description

    Search the neighbor cache for a node with given IP address. If it's found, a pointer to the neighbor entry is returned. If no such entry exists and the node is directly connected on one of our active interfaces, a new entry is created and returned to the caller with protocol-dependent fields initialized to zero. If the node is not connected directly or *a is not a valid unicast IP address, neigh_find() returns NULL.

    Function

    void neigh_dump (neighbor * n) -- dump specified neighbor entry.

    Arguments

    neighbor * n

    the entry to dump

    Description

    This functions dumps the contents of a given neighbor entry to debug output.

    Function

    void neigh_dump_all (void) -- dump all neighbor entries.

    Description

    This function dumps the contents of the neighbor cache to debug output.

    Function

    void neigh_if_up (struct iface * i)

    Arguments

    struct iface * i

    interface in question

    Description

    Tell the neighbor cache that a new interface became up.

    The neighbor cache wakes up all inactive sticky neighbors with addresses belonging to prefixes of the interface i.

    Function

    void neigh_if_down (struct iface * i) -- notify neighbor cache about interface down event

    Arguments

    struct iface * i

    the interface in question

    Description

    Notify the neighbor cache that an interface has ceased to exist.

    It causes all entries belonging to neighbors connected to this interface to be flushed.

    Function

    void neigh_if_link (struct iface * i) -- notify neighbor cache about interface link change

    Arguments

    struct iface * i

    the interface in question

    Description

    Notify the neighbor cache that an interface changed link state. All owners of neighbor entries connected to this interface are notified.

    Function

    void neigh_ifa_update (struct ifa * a)

    Arguments

    struct ifa * a

    interface address in question

    Description

    Tell the neighbor cache that an address was added or removed.

    The neighbor cache wakes up all inactive sticky neighbors with addresses belonging to prefixes of the interface belonging to ifa and causes all unreachable neighbors to be flushed.

    Function

    void neigh_prune (void) -- prune neighbor cache

    Description

    neigh_prune() examines all neighbor entries cached and removes those corresponding to inactive protocols. It's called whenever a protocol is shut down to get rid of all its heritage.

    Function

    void neigh_init (pool * if_pool) -- initialize the neighbor cache.

    Arguments

    pool * if_pool

    resource pool to be used for neighbor entries.

    Description

    This function is called during BIRD startup to initialize the neighbor cache module.

    2.9 Command line interface

    This module takes care of the BIRD's command-line interface (CLI). The CLI exists to provide a way to control BIRD remotely and to inspect its status. It uses a very simple textual protocol over a stream connection provided by the platform dependent code (on UNIX systems, it's a UNIX domain socket).

    Each session of the CLI consists of a sequence of request and replies, slightly resembling the FTP and SMTP protocols. Requests are commands encoded as a single line of text, replies are sequences of lines starting with a four-digit code followed by either a space (if it's the last line of the reply) or a minus sign (when the reply is going to continue with the next line), the rest of the line contains a textual message semantics of which depends on the numeric code. If a reply line has the same code as the previous one and it's a continuation line, the whole prefix can be replaced by a single white space character.

    Reply codes starting with 0 stand for `action successfully completed' messages, 1 means `table entry', 8 `runtime error' and 9 `syntax error'.

    Each CLI session is internally represented by a cli structure and a resource pool containing all resources associated with the connection, so that it can be easily freed whenever the connection gets closed, not depending on the current state of command processing.

    The CLI commands are declared as a part of the configuration grammar by using the CF_CLI macro. When a command is received, it is processed by the same lexical analyzer and parser as used for the configuration, but it's switched to a special mode by prepending a fake token to the text, so that it uses only the CLI command rules. Then the parser invokes an execution routine corresponding to the command, which either constructs the whole reply and returns it back or (in case it expects the reply will be long) it prints a partial reply and asks the CLI module (using the cont hook) to call it again when the output is transferred to the user.

    The this_cli variable points to a cli structure of the session being currently parsed, but it's of course available only in command handlers not entered using the cont hook.

    TX buffer management works as follows: At cli.tx_buf there is a list of TX buffers (struct cli_out), cli.tx_write is the buffer currently used by the producer (cli_printf(), cli_alloc_out()) and cli.tx_pos is the buffer currently used by the consumer (cli_write(), in system dependent code). The producer uses cli_out.wpos ptr as the current write position and the consumer uses cli_out.outpos ptr as the current read position. When the producer produces something, it calls cli_write_trigger(). If there is not enough space in the current buffer, the producer allocates the new one. When the consumer processes everything in the buffer queue, it calls cli_written(), tha frees all buffers (except the first one) and schedules cli.event .

    Function

    void cli_printf (cli * c, int code, char * msg, ... ...) -- send reply to a CLI connection

    Arguments

    cli * c

    CLI connection

    int code

    numeric code of the reply, negative for continuation lines

    char * msg

    a printf()-like formatting string.

    ... ...

    variable arguments

    Description

    This function send a single line of reply to a given CLI connection. In works in all aspects like bsprintf() except that it automatically prepends the reply line prefix.

    Please note that if the connection can be already busy sending some data in which case cli_printf() stores the output to a temporary buffer, so please avoid sending a large batch of replies without waiting for the buffers to be flushed.

    If you want to write to the current CLI output, you can use the cli_msg() macro instead.

    Function

    void cli_init (void) -- initialize the CLI module

    Description

    This function is called during BIRD startup to initialize the internal data structures of the CLI module.

    2.10 Object locks

    The lock module provides a simple mechanism for avoiding conflicts between various protocols which would like to use a single physical resource (for example a network port). It would be easy to say that such collisions can occur only when the user specifies an invalid configuration and therefore he deserves to get what he has asked for, but unfortunately they can also arise legitimately when the daemon is reconfigured and there exists (although for a short time period only) an old protocol instance being shut down and a new one willing to start up on the same interface.

    The solution is very simple: when any protocol wishes to use a network port or some other non-shareable resource, it asks the core to lock it and it doesn't use the resource until it's notified that it has acquired the lock.

    Object locks are represented by object_lock structures which are in turn a kind of resource. Lockable resources are uniquely determined by resource type (OBJLOCK_UDP for a UDP port etc.), IP address (usually a broadcast or multicast address the port is bound to), port number, interface and optional instance ID.

    Function

    struct object_lock * olock_new (pool * p) -- create an object lock

    Arguments

    pool * p

    resource pool to create the lock in.

    Description

    The olock_new() function creates a new resource of type object_lock and returns a pointer to it. After filling in the structure, the caller should call olock_acquire() to do the real locking.

    Function

    void olock_acquire (struct object_lock * l) -- acquire a lock

    Arguments

    struct object_lock * l

    the lock to acquire

    Description

    This function attempts to acquire exclusive access to the non-shareable resource described by the lock l. It returns immediately, but as soon as the resource becomes available, it calls the hook() function set up by the caller.

    When you want to release the resource, just rfree() the lock.

    Function

    void olock_init (void) -- initialize the object lock mechanism

    Description

    This function is called during BIRD startup. It initializes all the internal data structures of the lock module.

    Next Previous Contents bird-1.6.3/doc/bird.html0000644000103200001440000000620313027054674014011 0ustar feelausers BIRD User's Guide Next Previous Contents

    BIRD User's Guide

    Ondrej Filip <feela@network.cz>, Pavel Machek <pavel@ucw.cz>, Martin Mares <mj@ucw.cz>, Ondrej Zajicek <santiago@crfreenet.org>

    This document contains user documentation for the BIRD Internet Routing Daemon project.

    1. Introduction

    2. About routing tables

    3. Configuration

    4. Remote control

    5. Filters

    6. Protocols

    7. Conclusions

    Next Previous Contents bird-1.6.3/doc/tex/0000755000103200001440000000000013027054563012777 5ustar feelausersbird-1.6.3/doc/tex/qwertz.sty0000644000103200001440000000110513027054563015071 0ustar feelausers % qwertz TeX macros \catcode`\"=12 \sloppy \newtheorem{definition}{Definition} \newtheorem{proposition}{Proposition} \newtheorem{lemma}{Lemma} \newtheorem{corollary}{Corollary} \newtheorem{theorem}{Theorem} \newcommand{\mch}[1]{{\ifmmode#1 \else\(#1\)\fi}} \newcommand{\lt}{{\ifmmode{<}\else{\verb+<+}\fi}} \newcommand{\gt}{{\ifmmode{>}\else{\verb+>+}\fi}} \newcommand{\verbar}{{\ifmmode{|}\else{\tt|}\fi}} \newcommand{\idx}[1]{#1\index{#1}} \newcommand{\cdx}[1]{#1\index{#1@{\tt #1}}} \newcommand{\nidx}[1]{\index{#1}} \newcommand{\ncdx}[1]{\index{#1@{\tt #1}}} bird-1.6.3/doc/tex/url.sty0000644000103200001440000003320513027054563014345 0ustar feelausers% url.sty ver 1.2 19-Oct-1996 Donald Arseneau asnd@triumf.ca % % A form of \verb that allows linebreaks at certain characters or % combinations of characters, accepts reconfiguration, and can usually % be used in the argument to another command. It is intended for email % addresses, hypertext links, directories/paths, etc., which normally % have no spaces. The font may be selected using the \urlstyle command, % and new url-like commands can be defined using \urldef. % % Usage: Conditions: % \url{ } If the argument contains any "%", "#", or "^^", or ends with % "\", it can't be used in the argument to another command. % The argument must not contain unbalanced braces. % \url| | ...where "|" is any character not used in the argument and not % "{". The same restrictions as above except that the argument % may contain unbalanced braces. % \xyz for "\xyz" a defined-url; this can be used anywhere, no matter % what characters it contains. % % See further instructions after "\endinput" % \def\Url@ttdo{% style assignments for tt fonts or T1 encoding \def\UrlBreaks{\do\.\do\@\do\\\do\/\do\!\do\_\do\|\do\%\do\;\do\>\do\]% \do\)\do\,\do\?\do\'\do\+\do\=}% \def\UrlBigBreaks{\do\:\do@url@hyp}% \def\UrlNoBreaks{\do\(\do\[\do\{\do\<}% (unnecessary) \def\UrlSpecials{\do\ {\ }}% \def\UrlOrds{\do\*\do\-\do\~}% any ordinary characters that aren't usually } \def\Url@do{% style assignments for OT1 fonts except tt \def\UrlBreaks{\do\.\do\@\do\/\do\!\do\%\do\;\do\]\do\)\do\,\do\?\do\+\do\=}% \def\UrlBigBreaks{\do\:\do@url@hyp}% \def\UrlNoBreaks{\do\(\do\[\do\{}% prevents breaks after *next* character \def\UrlSpecials{\do\<{\langle}\do\>{\mathbin{\rangle}}\do\_{\_% \penalty\@m}\do\|{\mid}\do\{{\lbrace}\do\}{\mathbin{\rbrace}}\do \\{\mathbin{\backslash}}\do\~{\mathord{{}^{\textstyle\sim}}}\do\ {\ }}% \def\UrlOrds{\do\'\do\"\do\-}% } \def\url@ttstyle{% \@ifundefined{selectfont}{\def\UrlFont{\tt}}{\def\UrlFont{\ttfamily}}\Url@ttdo } \def\url@rmstyle{% \@ifundefined{selectfont}{\def\UrlFont{\rm}}{\def\UrlFont{\rmfamily}}\Url@do } \def\url@sfstyle{% \@ifundefined{selectfont}{\def\UrlFont{\sf}}{\def\UrlFont{\sffamily}}\Url@do } \def\url@samestyle{\ifdim\fontdimen\thr@@\font=\z@ \url@ttstyle \else \url@rmstyle \fi \def\UrlFont{}} \@ifundefined{strip@prefix}{\def\strip@prefix#1>{}}{} \@ifundefined{verbatim@nolig@list}{\def\verbatim@nolig@list{\do\`}}{} \def\Url{\relax\ifmmode\@nomatherr$\fi \UrlFont $\fam\z@ \textfont\z@\font \let\do\@makeother \dospecials % verbatim catcodes \catcode`{\@ne \catcode`}\tw@ % except braces \medmuskip0mu \thickmuskip\medmuskip \thinmuskip\medmuskip \@tempcnta\fam\multiply\@tempcnta\@cclvi \let\do\set@mathcode \UrlOrds % ordinary characters that were special \advance\@tempcnta 8192 \UrlBreaks % bin \advance\@tempcnta 4096 \UrlBigBreaks % rel \advance\@tempcnta 4096 \UrlNoBreaks % open \let\do\set@mathact \UrlSpecials % active \let\do\set@mathnolig \verbatim@nolig@list % prevent ligatures \@ifnextchar\bgroup\Url@z\Url@y} \def\Url@y#1{\catcode`{11 \catcode`}11 \def\@tempa##1#1{\Url@z{##1}}\@tempa} \def\Url@z#1{\def\@tempa{#1}\expandafter\expandafter\expandafter\Url@Hook \expandafter\strip@prefix\meaning\@tempa\UrlRight\m@th$\endgroup} \def\Url@Hook{\UrlLeft} \let\UrlRight\@empty \let\UrlLeft\@empty \def\set@mathcode#1{\count@`#1\advance\count@\@tempcnta\mathcode`#1\count@} \def\set@mathact#1#2{\mathcode`#132768 \lccode`\~`#1\lowercase{\def~{#2}}} \def\set@mathnolig#1{\ifnum\mathcode`#1<32768 \lccode`\~`#1\lowercase{\edef~{\mathchar\number\mathcode`#1_{\/}}}% \mathcode`#132768 \fi} \def\urldef#1#2{\begingroup \setbox\z@\hbox\bgroup \def\Url@z{\Url@def{#1}{#2}}#2} \expandafter\ifx\csname DeclareRobustCommand\endcsname\relax \def\Url@def#1#2#3{\m@th$\endgroup\egroup\endgroup \def#1{#2{#3}}} \else \def\Url@def#1#2#3{\m@th$\endgroup\egroup\endgroup \DeclareRobustCommand{#1}{#2{#3}}} \fi \def\urlstyle#1{\csname url@#1style\endcsname} % Sample (and default) configuration: % \newcommand\url{\begingroup \Url} % \newcommand\path{\begingroup \urlstyle{tt}\Url} % % too many styles define \email like \address, so I will not define it. % \newcommand\email{\begingroup \urlstyle{rm}\Url} % Process LaTeX \package options % \urlstyle{tt} \let\Url@sppen\@M \def\do@url@hyp{}% by default, no breaks after hyphens \@ifundefined{ProvidesPackage}{}{ \ProvidesPackage{url}[1996/10/19 \space ver 1.2 \space Verb mode for urls, email addresses, and file names] \DeclareOption{hyphens}{\def\do@url@hyp{\do\-}}% allow breaks after hyphens \DeclareOption{obeyspaces}{\let\Url@Hook\relax}% a flag for later \DeclareOption{spaces}{\let\Url@sppen\relpenalty} \DeclareOption{T1}{\let\Url@do\Url@ttdo} \ProcessOptions \ifx\Url@Hook\relax % [obeyspaces] was declared \def\Url@Hook#1\UrlRight\m@th{\edef\@tempa{\noexpand\UrlLeft \Url@retain#1\Url@nosp\, }\@tempa\UrlRight\m@th} \def\Url@retain#1 {#1\penalty\Url@sppen\ \Url@retain} \def\Url@nosp\,#1\Url@retain{} \fi } \endinput % % url.sty ver 1.2 19-Oct-1996 Donald Arseneau asnd@reg.triumf.ca % % This package defines "\url", a form of "\verb" that allows linebreaks, % and can often be used in the argument to another command. It can be % configured to print in different formats, and is particularly useful for % hypertext links, email addresses, directories/paths, etc. The font may % be selected using the "\urlstyle" command and pre-defined text can be % stored with the "\urldef" command. New url-like commands can be defined, % and a "\path" command is provided this way. % % Usage: Conditions: % \url{ } If the argument contains any "%", "#", or "^^", or ends with % "\", it can't be used in the argument to another command. % The argument must not contain unbalanced braces. % \url| | ...where "|" is any character not used in the argument and not % "{". The same restrictions as above except that the argument % may contain unbalanced braces. % \xyz for "\xyz" a defined-url; this can be used anywhere, no matter % what characters it contains. % % The "\url" command is fragile, and its argument is likely to be very % fragile, but a defined-url is robust. % % Package Option: obeyspaces % Ordinarily, all spaces are ignored in the url-text. The "[obeyspaces]" % option allows spaces, but may introduce spurious spaces when a url % containing "\" characters is given in the argument to another command. % So if you need to obey spaces you can say "\usepackage[obeyspaces]{url}", % and if you need both spaces and backslashes, use a `defined-url' for % anything with "\". % % Package Option: hyphens % Ordinarily, breaks are not allowed after "-" characters because this % leads to confusion. (Is the "-" part of the address or just a hyphen?) % The package option "[hyphens]" allows breaks after explicit hyphen % characters. The "\url" command will *never ever* hyphenate words. % % Package Option: spaces % Likewise, breaks are not usually allowed after spaces under the % "[obeyspaces]" option, but giving the options "[obeyspaces,spaces]" % will allow breaks at those spaces. % % Package Option: T1 % This signifies that you will be using T1-encoded fonts which contain % some characters missing from most older (OT1) encoded TeX fonts. This % changes the default definition for "\urlstyle{rm}". % % Defining a defined-url: % Take for example the email address "myself%node@gateway.net" which could % not be given (using "\url" or "\verb") in a caption or parbox due to the % percent sign. This address can be predefined with % \urldef{\myself}\url{myself%node@gateway.net} or % \urldef{\myself}\url|myself%node@gateway.net| % and then you may use "\myself" instead of "\url{myself%node@gateway.net}" % in an argument, and even in a moving argument like a caption because a % defined-url is robust. % % Style: % You can switch the style of printing using "\urlstyle{tt}", where "tt" % can be any defined style. The pre-defined styles are "tt", "rm", "sf", % and "same" which all allow the same linebreaks but different fonts -- % the first three select a specific font and the "same" style uses the % current text font. You can define your own styles with different fonts % and/or line-breaking by following the explanations below. The "\url" % command follows whatever the currently-set style dictates. % % Alternate commands: % It may be desireable to have different things treated differently, each % in a predefined style; e.g., if you want directory paths to always be % in tt and email addresses to be rm, then you would define new url-like % commands as follows: % % \newcommand\email{\begingroup \urlstyle{rm}\Url} % \newcommand\directory{\begingroup \urlstyle{tt}\Url} % % You must follow this format closely, and NOTE that the final command is % "\Url", not "\url". In fact, the "\directory" example is exactly the % "\path" definition which is pre-defined in the package. If you look % above, you will see that "\url" is defined with % \newcommand\url{\begingroup \Url} % I.e., using whatever url-style has been selected. % % You can make a defined-url for these other styles, using the usual % "\urldef" command as in this example: % % \urldef{\myself}{\email}{myself%node.domain@gateway.net} % % which makes "\myself" act like "\email{myself%node.domain@gateway.net}", % if the "\email" command is defined as above. The "\myself" command % would then be robust. % % Defining styles: % Before describing how to customize the printing style, it is best to % mention something about the unusual implementation of "\url". Although % the material is textual in nature, and the font specification required % is a text-font command, the text is actually typeset in *math* mode. % This allows the context-sensitive linebreaking, but also accounts for % the default behavior of ignoring spaces. Now on to defining styles. % % To change the font or the list of characters that allow linebreaks, you % could redefine the commands "\UrlFont", "\UrlBreaks", "\UrlSpecials" etc. % directly in the document, but it is better to define a new `url-style' % (following the example of "\url@ttstyle" and "\url@rmstyle") which defines % all of "\UrlBigbreaks", "\UrlNoBreaks", "\UrlBreaks", "\UrlSpecials", and % "\UrlFont". % % Changing font: % The "\UrlFont" command selects the font. The definition of "\UrlFont" % done by the pre-defined styles varies to cope with a variety of LaTeX % font selection schemes, but it could be as simple as "\def\UrlFont{\tt}". % Depending on the font selected, some characters may need to be defined % in the "\UrlSpecials" list because many fonts don't contain all the % standard input characters. % % Changing linebreaks: % The list of characters that allow line-breaks is given by "\UrlBreaks" % and "\UrlBigBreaks", which have the format "\do\c" for character "c". % The differences are that `BigBreaks' have a lower penalty and have % different breakpoints when in sequence (as in "http://"): `BigBreaks' % are treated as mathrels while `Breaks' are mathbins (see The TeXbook, % p.170). In particular, a series of `BigBreak' characters will break at % the end and only at the end; a series of `Break' characters will break % after the first and after every following *pair*; there will be no % break after a `Break' character if a `BigBreak' follows. In the case % of "http://" it doesn't matter whether ":" is a `Break' or `BigBreak' -- % the breaks are the same in either case; but for DECnet nodes with "::" % it is important to prevent breaks *between* the colons, and that is why % colons are `BigBreaks'. % % It is possible for characters to prevent breaks after the next following % character (I use this for parentheses). Specify these in "\UrlNoBreaks". % % You can do arbitrarily complex things with characters by making them % active in math mode (mathcode hex-8000) and specifying the definition(s) % in "\UrlSpecials". This is used in the rm and sf styles for OT1 font % encoding to handle several characters that are not present in those % computer-modern style fonts. See the definition of "\Url@do", which % is used by both "\url@rmstyle" and "\url@sfstyle"; it handles missing % characters via "\UrlSpecials". The nominal format for setting each % special character "c" is: "\do\c{}", but you can include % other definitions too. % % % If all this sounds confusing ... well, it is! But I hope you won't need % to redefine breakpoints -- the default assignments seem to work well for % a wide variety of applications. If you do need to make changes, you can % test for breakpoints using regular math mode and the characters "+=(a". % % Yet more flexibility: % You can also customize the verbatim text by defining "\UrlRight" and/or % "\UrlLeft", e.g., for ISO formatting of urls surrounded by "< >", define % % \renewcommand\url{\begingroup \def\UrlLeft{}% % \urlstyle{tt}\Url} % % The meanings of "\UrlLeft" and "\UrlRight" are *not* reproduced verbatim. % This lets you use formatting commands there, but you must be careful not % to use TeX's special characters ("\^_%~#$&{}" etc.) improperly. % You can also define "\UrlLeft" to reprocess the verbatim text, but the % format of the definition is special: % % \def\UrlLeft#1\UrlRight{ ... do things with #1 ... } % % Yes, that is "#1" followed by "\UrlRight" then the definition. For % example, to put a hyperTeX hypertext link in the DVI file: % % \def\UrlLeft#1\UrlRight{\special{html:}#1\special{html:}} % % Revision History: % ver 1.1 6-Feb-1996: % Fix hyphens that wouldn't break and ligatures that weren't suppressed. % ver 1.2 19-Oct-1996: % Package option for T1 encoding; Hooks: "\UrlLeft" and "\UrlRight". % % The End bird-1.6.3/doc/tex/null.sty0000644000103200001440000000000013027054563014500 0ustar feelausersbird-1.6.3/doc/tex/birddoc.sty0000644000103200001440000000753313027054563015156 0ustar feelausers%% This is a LaTeX style file for typesetting BIRD documentation. %% Hacked up by Martin Mares %% %% This is a modified version of linuxdoc-qwertz.sty, for use with SGML-generated LaTeX %% by Matt Welsh (mdw@sunsite.unc.edu) %% %% Based on linuxdoc.sty by Michael K. Johnson, and latex.tex by %% Leslie Lamport. \NeedsTeXFormat{LaTeX2e} \ProvidesClass{birddoc} %%% GLOBAL LAYOUT THINGS \marginparwidth 0.0 in \parindent=0 in \parskip=0.5ex %\parindent=0.5in %\parskip=0pt \topmargin -0.5 in \setlength{\textheight}{\paperheight} \addtolength{\textheight}{-2 in} %\advance\headsep 2 ex \advance\textheight -2 ex %\renewcommand{\baselinestretch}{1.14} \setcounter{tocdepth}{1} \oddsidemargin 0.15 in \evensidemargin -0.35 in \textwidth 6.5in \def\ps@headings{\let\@mkboth\markboth \def\@oddfoot{}\def\@evenfoot{}% No feet. \def\@evenhead{\protect\rule[-4pt]{\textwidth}{.5pt}\kern-\textwidth \rm \thepage\hfil \bf \leftmark} % Left heading. \def\@oddhead{\protect\rule[-4pt]{\textwidth}{.5pt}\kern-\textwidth {\bf \rightmark}\hfil \rm\thepage} % Right heading. \def\chaptermark##1{\markboth {{\ifnum \c@secnumdepth >\m@ne \@chapapp\ \thechapter. \ \fi ##1}}{}}% \def\sectionmark##1{\markright {{\ifnum \c@secnumdepth >\z@ \thesection. \ \fi ##1}}}} \def\@makechapterhead#1{% {\parindent \z@ \raggedright \normalfont \huge \bfseries \@chapapp\space\thechapter: #1\par\nobreak \vskip 20\p@ }} \def\@makeschapterhead#1{% {\parindent \z@ \raggedright \normalfont \huge \bfseries #1\par\nobreak \vskip 20\p@ }} %% Titlepage stuff \gdef\@title{} \gdef\title#1{\gdef\@title{#1}} \gdef\@date{} \gdef\date#1{\gdef\@date{#1}} \gdef\@author{} \gdef\author#1{\gdef\@author{#1}} \gdef\@abstract{} \gdef\abstract#1{\gdef\@abstract{#1}} \def\maketitle{\thispagestyle{empty}\let\footnotesize\small% \let\footnoterule\relax %\setcounter{page}{0}% %\null %\vskip 3 in \noindent {\huge\sf \@title}\\ \rule{\textwidth}{1mm}\\ \mbox{}\@author\ \hfill \@date\ \\ \vskip 1 ex \noindent{\sf \@abstract} \setcounter{footnote}{0}% \gdef\@author{}\gdef\@title{}\gdef\@years{}\gdef\@abstract{} \let\maketitle\relax} \def\birdnarrow{\advance\@totalleftmargin by 0.5in} %% Needs to be here for the previous ps@headings defs to work. \pagestyle{headings} \def\progdoc{ \raggedbottom } %%% USEFUL MACROS \newcommand{\linux}{Linux} % Always use this when % refering to the \linux\ % operating system, like that. \newcommand{\key}[1]{{\fbox{\small\tt #1}}} % Use this to mark keys, like % \key{del} for the delete key. \newcommand{\ret}{\fbox{\sf return}} % Special case for the return key. \newcommand{\st}{\small\tt} % Small typewriter -- comes in handy. %\newcommand{\lb}{{\tt\char '173}} % Left Brace '{' %\newcommand{\rb}{{\tt\char '175}} % Right Brace '}' \newcommand{\lbr}{$\langle$} % Left Bracket '<' \newcommand{\rbr}{$\rangle$} % Right Bracket '>' \newcommand{\bs}{{\tt\char '134}} % BackSlash '\' \newcommand{\tm}{${}^{\mbox{\tiny\sf TM}}$} \newcommand{\TM}{\tm} % TM trademark symbol in % either case \newcommand{\cparam}[1]{{\rm \lbr{\sl #1}\rbr}} % Metavariables. %% Define NAMEURL macro to handle the optional name argument %% This calls on the \url macro from the url.sty package so the %% URL will be hyphenated correctly. \def\nameurl#1#2{{\em #2} {\tt <\url{#1}>}} \def\onlynameurl#1{{\em #1}} %% the tscreen environment automatically goes into typewriter type, %% but is otherwise like the screen environment \newenvironment{tscreen}% {\begin{quote}\bgroup\small\tt}% {\egroup\end{quote}} %% Typesetting of function descriptions \def\function{\bigbreak\hrule\nobreak\bigskip\nobreak\leftline{\bf Function}\nobreak\smallskip\nobreak\parskip=0pt\relax} \def\funcsect#1{\medbreak\leftline{\bf #1}\nobreak} bird-1.6.3/doc/bird-6.html0000644000103200001440000037032313027054674014163 0ustar feelausers BIRD User's Guide: Protocols Next Previous Contents

    6. Protocols

    6.1 Babel

    Introduction

    The Babel protocol (RFC 6126) is a loop-avoiding distance-vector routing protocol that is robust and efficient both in ordinary wired networks and in wireless mesh networks. Babel is conceptually very simple in its operation and "just works" in its default configuration, though some configuration is possible and in some cases desirable.

    While the Babel protocol is dual stack (i.e., can carry both IPv4 and IPv6 routes over the same IPv6 transport), BIRD presently implements only the IPv6 subset of the protocol. No Babel extensions are implemented, but the BIRD implementation can coexist with implementations using the extensions (and will just ignore extension messages).

    The Babel protocol implementation in BIRD is currently in alpha stage.

    Configuration

    Babel supports no global configuration options apart from those common to all other protocols, but supports the following per-interface configuration options: 

    protocol babel [<name>] {
        interface <interface pattern> {
                type <wired|wireless>;
                rxcost <number>;
                hello interval <number>;
                update interval <number>;
                port <number>;
                tx class|dscp <number>;
                tx priority <number>;
                rx buffer <number>;
                tx length <number>;
                check link <switch>;
        };
}

    type wired|wireless

    This option specifies the interface type: Wired or wireless. Wired interfaces are considered more reliable, and so the default hello interval is higher, and a neighbour is considered unreachable after only a small number of "hello" packets are lost. On wireless interfaces, hello packets are sent more often, and the ETX link quality estimation technique is used to compute the metrics of routes discovered over this interface. This technique will gradually degrade the metric of routes when packets are lost rather than the more binary up/down mechanism of wired type links. Default: wired.

    rxcost num

    This specifies the RX cost of the interface. The route metrics will be computed from this value with a mechanism determined by the interface type. Default: 96 for wired interfaces, 256 for wireless.

    hello interval num

    Interval at which periodic "hello" messages are sent on this interface, in seconds. Default: 4 seconds.

    update interval num

    Interval at which periodic (full) updates are sent. Default: 4 times the hello interval.

    port number

    This option selects an UDP port to operate on. The default is to operate on port 6696 as specified in the Babel RFC.

    tx class|dscp|priority number

    These options specify the ToS/DiffServ/Traffic class/Priority of the outgoing Babel packets. See tx class common option for detailed description.

    rx buffer number

    This option specifies the size of buffers used for packet processing. The buffer size should be bigger than maximal size of received packets. The default value is the interface MTU, and the value will be clamped to a minimum of 512 bytes + IP packet overhead.

    tx length number

    This option specifies the maximum length of generated Babel packets. To avoid IP fragmentation, it should not exceed the interface MTU value. The default value is the interface MTU value, and the value will be clamped to a minimum of 512 bytes + IP packet overhead.

    check link switch

    If set, the hardware link state (as reported by OS) is taken into consideration. When the link disappears (e.g. an ethernet cable is unplugged), neighbors are immediately considered unreachable and all routes received from them are withdrawn. It is possible that some hardware drivers or platforms do not implement this feature. Default: yes.

    Attributes

    Babel defines just one attribute: the internal babel metric of the route. It is exposed as the babel_metric attribute and has range from 1 to infinity (65535).

    Example

    protocol babel {
        interface "eth*" {
                type wired;
        };
        interface "wlan0", "wlan1" {
                type wireless;
                hello interval 1;
                rxcost 512;
        };
        interface "tap0";

        # This matches the default of babeld: redistribute all addresses
        # configured on local interfaces, plus re-distribute all routes received
        # from other babel peers.

        export where (source = RTS_DEVICE) || (source = RTS_BABEL);
}

    6.2 BFD

    Introduction

    Bidirectional Forwarding Detection (BFD) is not a routing protocol itself, it is an independent tool providing liveness and failure detection. Routing protocols like OSPF and BGP use integrated periodic "hello" messages to monitor liveness of neighbors, but detection times of these mechanisms are high (e.g. 40 seconds by default in OSPF, could be set down to several seconds). BFD offers universal, fast and low-overhead mechanism for failure detection, which could be attached to any routing protocol in an advisory role.

    BFD consists of mostly independent BFD sessions. Each session monitors an unicast bidirectional path between two BFD-enabled routers. This is done by periodically sending control packets in both directions. BFD does not handle neighbor discovery, BFD sessions are created on demand by request of other protocols (like OSPF or BGP), which supply appropriate information like IP addresses and associated interfaces. When a session changes its state, these protocols are notified and act accordingly (e.g. break an OSPF adjacency when the BFD session went down).

    BIRD implements basic BFD behavior as defined in RFC 5880 (some advanced features like the echo mode or authentication are not implemented), IP transport for BFD as defined in RFC 5881 and RFC 5883 and interaction with client protocols as defined in RFC 5882.

    Note that BFD implementation in BIRD is currently a new feature in development, expect some rough edges and possible UI and configuration changes in the future. Also note that we currently support at most one protocol instance.

    BFD packets are sent with a dynamic source port number. Linux systems use by default a bit different dynamic port range than the IANA approved one (49152-65535). If you experience problems with compatibility, please adjust /proc/sys/net/ipv4/ip_local_port_range

    Configuration

    BFD configuration consists mainly of multiple definitions of interfaces. Most BFD config options are session specific. When a new session is requested and dynamically created, it is configured from one of these definitions. For sessions to directly connected neighbors, interface definitions are chosen based on the interface associated with the session, while multihop definition is used for multihop sessions. If no definition is relevant, the session is just created with the default configuration. Therefore, an empty BFD configuration is often sufficient.

    Note that to use BFD for other protocols like OSPF or BGP, these protocols also have to be configured to request BFD sessions, usually by bfd option.

    Some of BFD session options require time value, which has to be specified with the appropriate unit: num s|ms|us. Although microseconds are allowed as units, practical minimum values are usually in order of tens of milliseconds. 

    protocol bfd [<name>] {
        interface <interface pattern> {
                interval <time>;
                min rx interval <time>;
                min tx interval <time>;
                idle tx interval <time>;
                multiplier <num>;
                passive <switch>;
                authentication none;
                authentication simple;
                authentication [meticulous] keyed md5|sha1;
                password "<text>";
                password "<text>" {
                        id <num>;
                        generate from "<date>";
                        generate to "<date>";
                        accept from "<date>";
                        accept to "<date>";
                        from "<date>";
                        to "<date>";
                };
        };
        multihop {
                interval <time>;
                min rx interval <time>;
                min tx interval <time>;
                idle tx interval <time>;
                multiplier <num>;
                passive <switch>;
        };
        neighbor <ip> [dev "<interface>"] [local <ip>] [multihop <switch>];
}

    interface pattern [, ...] { options }

    Interface definitions allow to specify options for sessions associated with such interfaces and also may contain interface specific options. See interface common option for a detailed description of interface patterns. Note that contrary to the behavior of interface definitions of other protocols, BFD protocol would accept sessions (in default configuration) even on interfaces not covered by such definitions.

    multihop { options }

    Multihop definitions allow to specify options for multihop BFD sessions, in the same manner as interface definitions are used for directly connected sessions. Currently only one such definition (for all multihop sessions) could be used.

    neighbor ip [dev "interface"] [local ip] [multihop switch]

    BFD sessions are usually created on demand as requested by other protocols (like OSPF or BGP). This option allows to explicitly add a BFD session to the specified neighbor regardless of such requests.

    The session is identified by the IP address of the neighbor, with optional specification of used interface and local IP. By default the neighbor must be directly connected, unless the session is configured as multihop. Note that local IP must be specified for multihop sessions.

    Session specific options (part of interface and multihop definitions):

    interval time

    BFD ensures availability of the forwarding path associated with the session by periodically sending BFD control packets in both directions. The rate of such packets is controlled by two options, min rx interval and min tx interval (see below). This option is just a shorthand to set both of these options together.

    min rx interval time

    This option specifies the minimum RX interval, which is announced to the neighbor and used there to limit the neighbor's rate of generated BFD control packets. Default: 10 ms.

    min tx interval time

    This option specifies the desired TX interval, which controls the rate of generated BFD control packets (together with min rx interval announced by the neighbor). Note that this value is used only if the BFD session is up, otherwise the value of idle tx interval is used instead. Default: 100 ms.

    idle tx interval time

    In order to limit unnecessary traffic in cases where a neighbor is not available or not running BFD, the rate of generated BFD control packets is lower when the BFD session is not up. This option specifies the desired TX interval in such cases instead of min tx interval. Default: 1 s.

    multiplier num

    Failure detection time for BFD sessions is based on established rate of BFD control packets (min rx/tx interval) multiplied by this multiplier, which is essentially (ignoring jitter) a number of missed packets after which the session is declared down. Note that rates and multipliers could be different in each direction of a BFD session. Default: 5.

    passive switch

    Generally, both BFD session endpoints try to establish the session by sending control packets to the other side. This option allows to enable passive mode, which means that the router does not send BFD packets until it has received one from the other side. Default: disabled.

    authentication none

    No passwords are sent in BFD packets. This is the default value.

    authentication simple

    Every packet carries 16 bytes of password. Received packets lacking this password are ignored. This authentication mechanism is very weak.

    authentication [meticulous] keyed md5|sha1

    An authentication code is appended to each packet. The cryptographic algorithm is keyed MD5 or keyed SHA-1. Note that the algorithm is common for all keys (on one interface), in contrast to OSPF or RIP, where it is a per-key option. Passwords (keys) are not sent open via network.

    The meticulous variant means that cryptographic sequence numbers are increased for each sent packet, while in the basic variant they are increased about once per second. Generally, the meticulous variant offers better resistance to replay attacks but may require more computation.

    password "text"

    Specifies a password used for authentication. See interface<@@ref>dsc-passpassword common option for detailed description. Note that password option algorithm is not available in BFD protocol. The algorithm is selected by authentication option for all passwords.

    Example

    protocol bfd {
        interface "eth*" {
                min rx interval 20 ms;
                min tx interval 50 ms;
                idle tx interval 300 ms;
        };
        interface "gre*" {
                interval 200 ms;
                multiplier 10;
                passive;
        };
        multihop {
                interval 200 ms;
                multiplier 10;
        };

        neighbor 192.168.1.10;
        neighbor 192.168.2.2 dev "eth2";
        neighbor 192.168.10.1 local 192.168.1.1 multihop;
}

    6.3 BGP

    The Border Gateway Protocol is the routing protocol used for backbone level routing in the today's Internet. Contrary to other protocols, its convergence does not rely on all routers following the same rules for route selection, making it possible to implement any routing policy at any router in the network, the only restriction being that if a router advertises a route, it must accept and forward packets according to it.

    BGP works in terms of autonomous systems (often abbreviated as AS). Each AS is a part of the network with common management and common routing policy. It is identified by a unique 16-bit number (ASN). Routers within each AS usually exchange AS-internal routing information with each other using an interior gateway protocol (IGP, such as OSPF or RIP). Boundary routers at the border of the AS communicate global (inter-AS) network reachability information with their neighbors in the neighboring AS'es via exterior BGP (eBGP) and redistribute received information to other routers in the AS via interior BGP (iBGP).

    Each BGP router sends to its neighbors updates of the parts of its routing table it wishes to export along with complete path information (a list of AS'es the packet will travel through if it uses the particular route) in order to avoid routing loops.

    BIRD supports all requirements of the BGP4 standard as defined in RFC 4271 It also supports the community attributes (RFC 1997), capability negotiation (RFC 5492), MD5 password authentication (RFC 2385), extended communities (RFC 4360), route reflectors (RFC 4456), graceful restart (RFC 4724), multiprotocol extensions (RFC 4760), 4B AS numbers (RFC 4893), and 4B AS numbers in extended communities (RFC 5668).

    For IPv6, it uses the standard multiprotocol extensions defined in RFC 4760 and applied to IPv6 according to RFC 2545.

    Route selection rules

    BGP doesn't have any simple metric, so the rules for selection of an optimal route among multiple BGP routes with the same preference are a bit more complex and they are implemented according to the following algorithm. It starts the first rule, if there are more "best" routes, then it uses the second rule to choose among them and so on.

    • Prefer route with the highest Local Preference attribute.
    • Prefer route with the shortest AS path.
    • Prefer IGP origin over EGP and EGP origin over incomplete.
    • Prefer the lowest value of the Multiple Exit Discriminator.
    • Prefer routes received via eBGP over ones received via iBGP.
    • Prefer routes with lower internal distance to a boundary router.
    • Prefer the route with the lowest value of router ID of the advertising router.

    IGP routing table

    BGP is mainly concerned with global network reachability and with routes to other autonomous systems. When such routes are redistributed to routers in the AS via BGP, they contain IP addresses of a boundary routers (in route attribute NEXT_HOP). BGP depends on existing IGP routing table with AS-internal routes to determine immediate next hops for routes and to know their internal distances to boundary routers for the purpose of BGP route selection. In BIRD, there is usually one routing table used for both IGP routes and BGP routes.

    Configuration

    Each instance of the BGP corresponds to one neighboring router. This allows to set routing policy and all the other parameters differently for each neighbor using the following configuration parameters:

    local [ip] as number

    Define which AS we are part of. (Note that contrary to other IP routers, BIRD is able to act as a router located in multiple AS'es simultaneously, but in such cases you need to tweak the BGP paths manually in the filters to get consistent behavior.) Optional ip argument specifies a source address, equivalent to the source address option (see below). This parameter is mandatory.

    neighbor [ip] [port number] [as number]

    Define neighboring router this instance will be talking to and what AS it is located in. In case the neighbor is in the same AS as we are, we automatically switch to iBGP. Optionally, the remote port may also be specified. The parameter may be used multiple times with different sub-options (e.g., both neighbor 10.0.0.1 as 65000; and neighbor 10.0.0.1; neighbor as 65000; are valid). This parameter is mandatory.

    interface string

    Define interface we should use for link-local BGP IPv6 sessions. Interface can also be specified as a part of neighbor address (e.g., neighbor fe80::1234%eth0 as 65000;). It is an error to use this parameter for non link-local sessions.

    direct

    Specify that the neighbor is directly connected. The IP address of the neighbor must be from a directly reachable IP range (i.e. associated with one of your router's interfaces), otherwise the BGP session wouldn't start but it would wait for such interface to appear. The alternative is the multihop option. Default: enabled for eBGP.

    multihop [number]

    Configure multihop BGP session to a neighbor that isn't directly connected. Accurately, this option should be used if the configured neighbor IP address does not match with any local network subnets. Such IP address have to be reachable through system routing table. The alternative is the direct option. For multihop BGP it is recommended to explicitly configure the source address to have it stable. Optional number argument can be used to specify the number of hops (used for TTL). Note that the number of networks (edges) in a path is counted; i.e., if two BGP speakers are separated by one router, the number of hops is 2. Default: enabled for iBGP.

    source address ip

    Define local address we should use for next hop calculation and as a source address for the BGP session. Default: the address of the local end of the interface our neighbor is connected to.

    next hop self

    Avoid calculation of the Next Hop attribute and always advertise our own source address as a next hop. This needs to be used only occasionally to circumvent misconfigurations of other routers. Default: disabled.

    next hop keep

    Forward the received Next Hop attribute even in situations where the local address should be used instead, like when the route is sent to an interface with a different subnet. Default: disabled.

    missing lladdr self|drop|ignore

    Next Hop attribute in BGP-IPv6 sometimes contains just the global IPv6 address, but sometimes it has to contain both global and link-local IPv6 addresses. This option specifies what to do if BIRD have to send both addresses but does not know link-local address. This situation might happen when routes from other protocols are exported to BGP, or when improper updates are received from BGP peers. self means that BIRD advertises its own local address instead. drop means that BIRD skips that prefixes and logs error. ignore means that BIRD ignores the problem and sends just the global address (and therefore forms improper BGP update). Default: self, unless BIRD is configured as a route server (option rs client), in that case default is ignore, because route servers usually do not forward packets themselves.

    gateway direct|recursive

    For received routes, their gw (immediate next hop) attribute is computed from received bgp_next_hop attribute. This option specifies how it is computed. Direct mode means that the IP address from bgp_next_hop is used if it is directly reachable, otherwise the neighbor IP address is used. Recursive mode means that the gateway is computed by an IGP routing table lookup for the IP address from bgp_next_hop. Note that there is just one level of indirection in recursive mode - the route obtained by the lookup must not be recursive itself, to prevent mutually recursive routes.

    Recursive mode is the behavior specified by the BGP standard. Direct mode is simpler, does not require any routes in a routing table, and was used in older versions of BIRD, but does not handle well nontrivial iBGP setups and multihop. Recursive mode is incompatible with sorted tables. Default: direct for direct sessions, recursive for multihop sessions.

    igp table name

    Specifies a table that is used as an IGP routing table. Default: the same as the table BGP is connected to.

    check link switch

    BGP could use hardware link state into consideration. If enabled, BIRD tracks the link state of the associated interface and when link disappears (e.g. an ethernet cable is unplugged), the BGP session is immediately shut down. Note that this option cannot be used with multihop BGP. Default: disabled.

    bfd switch

    BGP could use BFD protocol as an advisory mechanism for neighbor liveness and failure detection. If enabled, BIRD setups a BFD session for the BGP neighbor and tracks its liveness by it. This has an advantage of an order of magnitude lower detection times in case of failure. Note that BFD protocol also has to be configured, see BFD section for details. Default: disabled.

    ttl security switch

    Use GTSM (RFC 5082 - the generalized TTL security mechanism). GTSM protects against spoofed packets by ignoring received packets with a smaller than expected TTL. To work properly, GTSM have to be enabled on both sides of a BGP session. If both ttl security and multihop options are enabled, multihop option should specify proper hop value to compute expected TTL. Kernel support required: Linux: 2.6.34+ (IPv4), 2.6.35+ (IPv6), BSD: since long ago, IPv4 only. Note that full (ICMP protection, for example) RFC 5082 support is provided by Linux only. Default: disabled.

    password string

    Use this password for MD5 authentication of BGP sessions (RFC 2385). When used on BSD systems, see also setkey option below. Default: no authentication.

    setkey switch

    On BSD systems, keys for TCP MD5 authentication are stored in the global SA/SP database, which can be accessed by external utilities (e.g. setkey(8)). BIRD configures security associations in the SA/SP database automatically based on password options (see above), this option allows to disable automatic updates by BIRD when manual configuration by external utilities is preferred. Note that automatic SA/SP database updates are currently implemented only for FreeBSD. Passwords have to be set manually by an external utility on NetBSD and OpenBSD. Default: enabled (ignored on non-FreeBSD).

    passive switch

    Standard BGP behavior is both initiating outgoing connections and accepting incoming connections. In passive mode, outgoing connections are not initiated. Default: off.

    rr client

    Be a route reflector and treat the neighbor as a route reflection client. Default: disabled.

    rr cluster id IPv4 address

    Route reflectors use cluster id to avoid route reflection loops. When there is one route reflector in a cluster it usually uses its router id as a cluster id, but when there are more route reflectors in a cluster, these need to be configured (using this option) to use a common cluster id. Clients in a cluster need not know their cluster id and this option is not allowed for them. Default: the same as router id.

    rs client

    Be a route server and treat the neighbor as a route server client. A route server is used as a replacement for full mesh EBGP routing in Internet exchange points in a similar way to route reflectors used in IBGP routing. BIRD does not implement obsoleted RFC 1863, but uses ad-hoc implementation, which behaves like plain EBGP but reduces modifications to advertised route attributes to be transparent (for example does not prepend its AS number to AS PATH attribute and keeps MED attribute). Default: disabled.

    secondary switch

    Usually, if an export filter rejects a selected route, no other route is propagated for that network. This option allows to try the next route in order until one that is accepted is found or all routes for that network are rejected. This can be used for route servers that need to propagate different tables to each client but do not want to have these tables explicitly (to conserve memory). This option requires that the connected routing table is sorted. Default: off.

    add paths switch|rx|tx

    Standard BGP can propagate only one path (route) per destination network (usually the selected one). This option controls the add-path protocol extension, which allows to advertise any number of paths to a destination. Note that to be active, add-path has to be enabled on both sides of the BGP session, but it could be enabled separately for RX and TX direction. When active, all available routes accepted by the export filter are advertised to the neighbor. Default: off.

    allow local as [number]

    BGP prevents routing loops by rejecting received routes with the local AS number in the AS path. This option allows to loose or disable the check. Optional number argument can be used to specify the maximum number of local ASNs in the AS path that is allowed for received routes. When the option is used without the argument, the check is completely disabled and you should ensure loop-free behavior by some other means. Default: 0 (no local AS number allowed).

    enable route refresh switch

    After the initial route exchange, BGP protocol uses incremental updates to keep BGP speakers synchronized. Sometimes (e.g., if BGP speaker changes its import filter, or if there is suspicion of inconsistency) it is necessary to do a new complete route exchange. BGP protocol extension Route Refresh (RFC 2918) allows BGP speaker to request re-advertisement of all routes from its neighbor. BGP protocol extension Enhanced Route Refresh (RFC 7313) specifies explicit begin and end for such exchanges, therefore the receiver can remove stale routes that were not advertised during the exchange. This option specifies whether BIRD advertises these capabilities and supports related procedures. Note that even when disabled, BIRD can send route refresh requests. Default: on.

    graceful restart switch|aware

    When a BGP speaker restarts or crashes, neighbors will discard all received paths from the speaker, which disrupts packet forwarding even when the forwarding plane of the speaker remains intact. RFC 4724 specifies an optional graceful restart mechanism to alleviate this issue. This option controls the mechanism. It has three states: Disabled, when no support is provided. Aware, when the graceful restart support is announced and the support for restarting neighbors is provided, but no local graceful restart is allowed (i.e. receiving-only role). Enabled, when the full graceful restart support is provided (i.e. both restarting and receiving role). Note that proper support for local graceful restart requires also configuration of other protocols. Default: aware.

    graceful restart time number

    The restart time is announced in the BGP graceful restart capability and specifies how long the neighbor would wait for the BGP session to re-establish after a restart before deleting stale routes. Default: 120 seconds.

    interpret communities switch

    RFC 1997 demands that BGP speaker should process well-known communities like no-export (65535, 65281) or no-advertise (65535, 65282). For example, received route carrying a no-adverise community should not be advertised to any of its neighbors. If this option is enabled (which is by default), BIRD has such behavior automatically (it is evaluated when a route is exported to the BGP protocol just before the export filter). Otherwise, this integrated processing of well-known communities is disabled. In that case, similar behavior can be implemented in the export filter. Default: on.

    enable as4 switch

    BGP protocol was designed to use 2B AS numbers and was extended later to allow 4B AS number. BIRD supports 4B AS extension, but by disabling this option it can be persuaded not to advertise it and to maintain old-style sessions with its neighbors. This might be useful for circumventing bugs in neighbor's implementation of 4B AS extension. Even when disabled (off), BIRD behaves internally as AS4-aware BGP router. Default: on.

    enable extended messages switch

    The BGP protocol uses maximum message length of 4096 bytes. This option provides an extension to allow extended messages with length up to 65535 bytes. Default: off.

    capabilities switch

    Use capability advertisement to advertise optional capabilities. This is standard behavior for newer BGP implementations, but there might be some older BGP implementations that reject such connection attempts. When disabled (off), features that request it (4B AS support) are also disabled. Default: on, with automatic fallback to off when received capability-related error.

    advertise ipv4 switch

    Advertise IPv4 multiprotocol capability. This is not a correct behavior according to the strict interpretation of RFC 4760, but it is widespread and required by some BGP implementations (Cisco and Quagga). This option is relevant to IPv4 mode with enabled capability advertisement only. Default: on.

    route limit number

    The maximal number of routes that may be imported from the protocol. If the route limit is exceeded, the connection is closed with an error. Limit is currently implemented as import limit number action restart. This option is obsolete and it is replaced by import limit option. Default: no limit.

    disable after error switch

    When an error is encountered (either locally or by the other side), disable the instance automatically and wait for an administrator to fix the problem manually. Default: off.

    hold time number

    Time in seconds to wait for a Keepalive message from the other side before considering the connection stale. Default: depends on agreement with the neighboring router, we prefer 240 seconds if the other side is willing to accept it.

    startup hold time number

    Value of the hold timer used before the routers have a chance to exchange open messages and agree on the real value. Default: 240 seconds.

    keepalive time number

    Delay in seconds between sending of two consecutive Keepalive messages. Default: One third of the hold time.

    connect delay time number

    Delay in seconds between protocol startup and the first attempt to connect. Default: 5 seconds.

    connect retry time number

    Time in seconds to wait before retrying a failed attempt to connect. Default: 120 seconds.

    error wait time number,number

    Minimum and maximum delay in seconds between a protocol failure (either local or reported by the peer) and automatic restart. Doesn't apply when disable after error is configured. If consecutive errors happen, the delay is increased exponentially until it reaches the maximum. Default: 60, 300.

    error forget time number

    Maximum time in seconds between two protocol failures to treat them as a error sequence which makes error wait time increase exponentially. Default: 300 seconds.

    path metric switch

    Enable comparison of path lengths when deciding which BGP route is the best one. Default: on.

    med metric switch

    Enable comparison of MED attributes (during best route selection) even between routes received from different ASes. This may be useful if all MED attributes contain some consistent metric, perhaps enforced in import filters of AS boundary routers. If this option is disabled, MED attributes are compared only if routes are received from the same AS (which is the standard behavior). Default: off.

    deterministic med switch

    BGP route selection algorithm is often viewed as a comparison between individual routes (e.g. if a new route appears and is better than the current best one, it is chosen as the new best one). But the proper route selection, as specified by RFC 4271, cannot be fully implemented in that way. The problem is mainly in handling the MED attribute. BIRD, by default, uses an simplification based on individual route comparison, which in some cases may lead to temporally dependent behavior (i.e. the selection is dependent on the order in which routes appeared). This option enables a different (and slower) algorithm implementing proper RFC 4271 route selection, which is deterministic. Alternative way how to get deterministic behavior is to use med metric option. This option is incompatible with sorted tables. Default: off.

    igp metric switch

    Enable comparison of internal distances to boundary routers during best route selection. Default: on.

    prefer older switch

    Standard route selection algorithm breaks ties by comparing router IDs. This changes the behavior to prefer older routes (when both are external and from different peer). For details, see RFC 5004. Default: off.

    default bgp_med number

    Value of the Multiple Exit Discriminator to be used during route selection when the MED attribute is missing. Default: 0.

    default bgp_local_pref number

    A default value for the Local Preference attribute. It is used when a new Local Preference attribute is attached to a route by the BGP protocol itself (for example, if a route is received through eBGP and therefore does not have such attribute). Default: 100 (0 in pre-1.2.0 versions of BIRD).

    Attributes

    BGP defines several route attributes. Some of them (those marked with `I' in the table below) are available on internal BGP connections only, some of them (marked with `O') are optional.

    bgppath bgp_path/

    Sequence of AS numbers describing the AS path the packet will travel through when forwarded according to the particular route. In case of internal BGP it doesn't contain the number of the local AS.

    int bgp_local_pref/ [I]

    Local preference value used for selection among multiple BGP routes (see the selection rules above). It's used as an additional metric which is propagated through the whole local AS.

    int bgp_med/ [O]

    The Multiple Exit Discriminator of the route is an optional attribute which is used on external (inter-AS) links to convey to an adjacent AS the optimal entry point into the local AS. The received attribute is also propagated over internal BGP links. The attribute value is zeroed when a route is exported to an external BGP instance to ensure that the attribute received from a neighboring AS is not propagated to other neighboring ASes. A new value might be set in the export filter of an external BGP instance. See RFC 4451 for further discussion of BGP MED attribute.

    enum bgp_origin/

    Origin of the route: either ORIGIN_IGP if the route has originated in an interior routing protocol or ORIGIN_EGP if it's been imported from the EGP protocol (nowadays it seems to be obsolete) or ORIGIN_INCOMPLETE if the origin is unknown.

    ip bgp_next_hop/

    Next hop to be used for forwarding of packets to this destination. On internal BGP connections, it's an address of the originating router if it's inside the local AS or a boundary router the packet will leave the AS through if it's an exterior route, so each BGP speaker within the AS has a chance to use the shortest interior path possible to this point.

    void bgp_atomic_aggr/ [O]

    This is an optional attribute which carries no value, but the sole presence of which indicates that the route has been aggregated from multiple routes by some router on the path from the originator.

    clist bgp_community/ [O]

    List of community values associated with the route. Each such value is a pair (represented as a pair data type inside the filters) of 16-bit integers, the first of them containing the number of the AS which defines the community and the second one being a per-AS identifier. There are lots of uses of the community mechanism, but generally they are used to carry policy information like "don't export to USA peers". As each AS can define its own routing policy, it also has a complete freedom about which community attributes it defines and what will their semantics be.

    eclist bgp_ext_community/ [O]

    List of extended community values associated with the route. Extended communities have similar usage as plain communities, but they have an extended range (to allow 4B ASNs) and a nontrivial structure with a type field. Individual community values are represented using an ec data type inside the filters.

    lclist bgp_large_community [O]

    List of large community values associated with the route. Large BGP communities is another variant of communities, but contrary to extended communities they behave very much the same way as regular communities, just larger -- they are uniform untyped triplets of 32bit numbers. Individual community values are represented using an lc data type inside the filters.

    quad bgp_originator_id/ [I, O]

    This attribute is created by the route reflector when reflecting the route and contains the router ID of the originator of the route in the local AS.

    clist bgp_cluster_list/ [I, O]

    This attribute contains a list of cluster IDs of route reflectors. Each route reflector prepends its cluster ID when reflecting the route.

    Example

    protocol bgp {
        local as 65000;                      # Use a private AS number
        neighbor 198.51.100.130 as 64496;    # Our neighbor ...
        multihop;                            # ... which is connected indirectly
        export filter {                      # We use non-trivial export rules
                if source = RTS_STATIC then { # Export only static routes
                        # Assign our community
                        bgp_community.add((65000,64501));
                        # Artificially increase path length
                        # by advertising local AS number twice
                        if bgp_path ~ [= 65000 =] then
                                bgp_path.prepend(65000);
                        accept;
                }
                reject;
        };
        import all;
        source address 198.51.100.14;   # Use a non-standard source address
}

    6.4 Device

    The Device protocol is not a real routing protocol. It doesn't generate any routes and it only serves as a module for getting information about network interfaces from the kernel.

    Except for very unusual circumstances, you probably should include this protocol in the configuration since almost all other protocols require network interfaces to be defined for them to work with.

    Configuration

    scan time number

    Time in seconds between two scans of the network interface list. On systems where we are notified about interface status changes asynchronously (such as newer versions of Linux), we need to scan the list only in order to avoid confusion by lost notification messages, so the default time is set to a large value.

    primary [ "mask" ] prefix

    If a network interface has more than one network address, BIRD has to choose one of them as a primary one. By default, BIRD chooses the lexicographically smallest address as the primary one.

    This option allows to specify which network address should be chosen as a primary one. Network addresses that match prefix are preferred to non-matching addresses. If more primary options are used, the first one has the highest preference. If "mask" is specified, then such primary option is relevant only to matching network interfaces.

    In all cases, an address marked by operating system as secondary cannot be chosen as the primary one.

    As the Device protocol doesn't generate any routes, it cannot have any attributes. Example configuration looks like this: 

    protocol device {
        scan time 10;           # Scan the interfaces often
        primary "eth0" 192.168.1.1;
        primary 192.168.0.0/16;
}

    6.5 Direct

    The Direct protocol is a simple generator of device routes for all the directly connected networks according to the list of interfaces provided by the kernel via the Device protocol.

    The question is whether it is a good idea to have such device routes in BIRD routing table. OS kernel usually handles device routes for directly connected networks by itself so we don't need (and don't want) to export these routes to the kernel protocol. OSPF protocol creates device routes for its interfaces itself and BGP protocol is usually used for exporting aggregate routes. Although there are some use cases that use the direct protocol (like abusing eBGP as an IGP routing protocol), in most cases it is not needed to have these device routes in BIRD routing table and to use the direct protocol.

    There is one notable case when you definitely want to use the direct protocol -- running BIRD on BSD systems. Having high priority device routes for directly connected networks from the direct protocol protects kernel device routes from being overwritten or removed by IGP routes during some transient network conditions, because a lower priority IGP route for the same network is not exported to the kernel routing table. This is an issue on BSD systems only, as on Linux systems BIRD cannot change non-BIRD route in the kernel routing table.

    There are just few configuration options for the Direct protocol:

    interface pattern [, ...]

    By default, the Direct protocol will generate device routes for all the interfaces available. If you want to restrict it to some subset of interfaces or addresses (e.g. if you're using multiple routing tables for policy routing and some of the policy domains don't contain all interfaces), just use this clause. See interface common option for detailed description. The Direct protocol uses extended interface clauses.

    check link switch

    If enabled, a hardware link state (reported by OS) is taken into consideration. Routes for directly connected networks are generated only if link up is reported and they are withdrawn when link disappears (e.g., an ethernet cable is unplugged). Default value is no.

    Direct device routes don't contain any specific attributes.

    Example config might look like this: 

    protocol direct {
        interface "-arc*", "*";         # Exclude the ARCnets
}

    6.6 Kernel

    The Kernel protocol is not a real routing protocol. Instead of communicating with other routers in the network, it performs synchronization of BIRD's routing tables with the OS kernel. Basically, it sends all routing table updates to the kernel and from time to time it scans the kernel tables to see whether some routes have disappeared (for example due to unnoticed up/down transition of an interface) or whether an `alien' route has been added by someone else (depending on the learn switch, such routes are either ignored or accepted to our table).

    Unfortunately, there is one thing that makes the routing table synchronization a bit more complicated. In the kernel routing table there are also device routes for directly connected networks. These routes are usually managed by OS itself (as a part of IP address configuration) and we don't want to touch that. They are completely ignored during the scan of the kernel tables and also the export of device routes from BIRD tables to kernel routing tables is restricted to prevent accidental interference. This restriction can be disabled using device routes switch.

    If your OS supports only a single routing table, you can configure only one instance of the Kernel protocol. If it supports multiple tables (in order to allow policy routing; such an OS is for example Linux), you can run as many instances as you want, but each of them must be connected to a different BIRD routing table and to a different kernel table.

    Because the kernel protocol is partially integrated with the connected routing table, there are two limitations - it is not possible to connect more kernel protocols to the same routing table and changing route destination (gateway) in an export filter of a kernel protocol does not work. Both limitations can be overcome using another routing table and the pipe protocol.

    Configuration

    persist switch

    Tell BIRD to leave all its routes in the routing tables when it exits (instead of cleaning them up).

    scan time number

    Time in seconds between two consecutive scans of the kernel routing table.

    learn switch

    Enable learning of routes added to the kernel routing tables by other routing daemons or by the system administrator. This is possible only on systems which support identification of route authorship.

    device routes switch

    Enable export of device routes to the kernel routing table. By default, such routes are rejected (with the exception of explicitly configured device routes from the static protocol) regardless of the export filter to protect device routes in kernel routing table (managed by OS itself) from accidental overwriting or erasing.

    kernel table number

    Select which kernel table should this particular instance of the Kernel protocol work with. Available only on systems supporting multiple routing tables.

    metric number

    (Linux) Use specified value as a kernel metric (priority) for all routes sent to the kernel. When multiple routes for the same network are in the kernel routing table, the Linux kernel chooses one with lower metric. Also, routes with different metrics do not clash with each other, therefore using dedicated metric value is a reliable way to avoid overwriting routes from other sources (e.g. kernel device routes). Metric 0 has a special meaning of undefined metric, in which either OS default is used, or per-route metric can be set using krt_metric attribute. Default: 0 (undefined).

    graceful restart switch

    Participate in graceful restart recovery. If this option is enabled and a graceful restart recovery is active, the Kernel protocol will defer synchronization of routing tables until the end of the recovery. Note that import of kernel routes to BIRD is not affected.

    merge paths switch [limit number]

    Usually, only best routes are exported to the kernel protocol. With path merging enabled, both best routes and equivalent non-best routes are merged during export to generate one ECMP (equal-cost multipath) route for each network. This is useful e.g. for BGP multipath. Note that best routes are still pivotal for route export (responsible for most properties of resulting ECMP routes), while exported non-best routes are responsible just for additional multipath next hops. This option also allows to specify a limit on maximal number of nexthops in one route. By default, multipath merging is disabled. If enabled, default value of the limit is 16.

    Attributes

    The Kernel protocol defines several attributes. These attributes are translated to appropriate system (and OS-specific) route attributes. We support these attributes:

    int krt_source/

    The original source of the imported kernel route. The value is system-dependent. On Linux, it is a value of the protocol field of the route. See /etc/iproute2/rt_protos for common values. On BSD, it is based on STATIC and PROTOx flags. The attribute is read-only.

    int krt_metric/

    (Linux) The kernel metric of the route. When multiple same routes are in a kernel routing table, the Linux kernel chooses one with lower metric. Note that preferred way to set kernel metric is to use protocol option metric, unless per-route metric values are needed.

    ip krt_prefsrc/

    (Linux) The preferred source address. Used in source address selection for outgoing packets. Has to be one of the IP addresses of the router.

    int krt_realm/

    (Linux) The realm of the route. Can be used for traffic classification.

    int krt_scope/

    (Linux IPv4) The scope of the route. Valid values are 0-254, although Linux kernel may reject some values depending on route type and nexthop. It is supposed to represent `indirectness' of the route, where nexthops of routes are resolved through routes with a higher scope, but in current kernels anything below link (253) is treated as global (0). When not present, global scope is implied for all routes except device routes, where link scope is used by default.

    In Linux, there is also a plenty of obscure route attributes mostly focused on tuning TCP performance of local connections. BIRD supports most of these attributes, see Linux or iproute2 documentation for their meaning. Attributes krt_lock_* and krt_feature_* have type bool, others have type int. Supported attributes are:

    krt_mtu, krt_lock_mtu, krt_window, krt_lock_window, krt_rtt, krt_lock_rtt, krt_rttvar, krt_lock_rttvar, krt_sstresh, krt_lock_sstresh, krt_cwnd, krt_lock_cwnd, krt_advmss, krt_lock_advmss, krt_reordering, krt_lock_reordering, krt_hoplimit, krt_lock_hoplimit, krt_rto_min, krt_lock_rto_min, krt_initcwnd, krt_initrwnd, krt_quickack, krt_feature_ecn, krt_feature_allfrag

    Example

    A simple configuration can look this way: 

    protocol kernel {
        export all;
}

    Or for a system with two routing tables: 

    protocol kernel {               # Primary routing table
        learn;                  # Learn alien routes from the kernel
        persist;                # Don't remove routes on bird shutdown
        scan time 10;           # Scan kernel routing table every 10 seconds
        import all;
        export all;
}

protocol kernel {               # Secondary routing table
        table auxtable;
        kernel table 100;
        export all;
}

    6.7 OSPF

    Introduction

    Open Shortest Path First (OSPF) is a quite complex interior gateway protocol. The current IPv4 version (OSPFv2) is defined in RFC 2328 and the current IPv6 version (OSPFv3) is defined in RFC 5340 It's a link state (a.k.a. shortest path first) protocol -- each router maintains a database describing the autonomous system's topology. Each participating router has an identical copy of the database and all routers run the same algorithm calculating a shortest path tree with themselves as a root. OSPF chooses the least cost path as the best path.

    In OSPF, the autonomous system can be split to several areas in order to reduce the amount of resources consumed for exchanging the routing information and to protect the other areas from incorrect routing data. Topology of the area is hidden to the rest of the autonomous system.

    Another very important feature of OSPF is that it can keep routing information from other protocols (like Static or BGP) in its link state database as external routes. Each external route can be tagged by the advertising router, making it possible to pass additional information between routers on the boundary of the autonomous system.

    OSPF quickly detects topological changes in the autonomous system (such as router interface failures) and calculates new loop-free routes after a short period of convergence. Only a minimal amount of routing traffic is involved.

    Each router participating in OSPF routing periodically sends Hello messages to all its interfaces. This allows neighbors to be discovered dynamically. Then the neighbors exchange theirs parts of the link state database and keep it identical by flooding updates. The flooding process is reliable and ensures that each router detects all changes.

    Configuration

    In the main part of configuration, there can be multiple definitions of OSPF areas, each with a different id. These definitions includes many other switches and multiple definitions of interfaces. Definition of interface may contain many switches and constant definitions and list of neighbors on nonbroadcast networks. 

    protocol ospf <name> {
        rfc1583compat <switch>;
        instance id <num>;
        stub router <switch>;
        tick <num>;
        ecmp <switch> [limit <num>];
        merge external <switch>;
        area <id> {
                stub;
                nssa;
                summary <switch>;
                default nssa <switch>;
                default cost <num>;
                default cost2 <num>;
                translator <switch>;
                translator stability <num>;

                networks {
                        <prefix>;
                        <prefix> hidden;
                }
                external {
                        <prefix>;
                        <prefix> hidden;
                        <prefix> tag <num>;
                }
                stubnet <prefix>;
                stubnet <prefix> {
                        hidden <switch>;
                        summary <switch>;
                        cost <num>;
                }
                interface <interface pattern> [instance <num>] {
                        cost <num>;
                        stub <switch>;
                        hello <num>;
                        poll <num>;
                        retransmit <num>;
                        priority <num>;
                        wait <num>;
                        dead count <num>;
                        dead <num>;
                        secondary <switch>;
                        rx buffer [normal|large|<num>];
                        tx length <num>;
                        type [broadcast|bcast|pointopoint|ptp|
                                nonbroadcast|nbma|pointomultipoint|ptmp];
                        link lsa suppression <switch>;
                        strict nonbroadcast <switch>;
                        real broadcast <switch>;
                        ptp netmask <switch>;
                        check link <switch>;
                        bfd <switch>;
                        ecmp weight <num>;
                        ttl security [<switch>; | tx only]
                        tx class|dscp <num>;
                        tx priority <num>;
                        authentication none|simple|cryptographic;
                        password "<text>";
                        password "<text>" {
                                id <num>;
                                generate from "<date>";
                                generate to "<date>";
                                accept from "<date>";
                                accept to "<date>";
                                from "<date>";
                                to "<date>";
                                algorithm ( keyed md5 | keyed sha1 | hmac sha1 | hmac sha256 | hmac sha384 | hmac sha512 );
                        };
                        neighbors {
                                <ip>;
                                <ip> eligible;
                        };
                };
                virtual link <id> [instance <num>] {
                        hello <num>;
                        retransmit <num>;
                        wait <num>;
                        dead count <num>;
                        dead <num>;
                        authentication none|simple|cryptographic;
                        password "<text>";
                        password "<text>" {
                                id <num>;
                                generate from "<date>";
                                generate to "<date>";
                                accept from "<date>";
                                accept to "<date>";
                                from "<date>";
                                to "<date>";
                                algorithm ( keyed md5 | keyed sha1 | hmac sha1 | hmac sha256 | hmac sha384 | hmac sha512 );
                        };
                };
        };
}

    rfc1583compat switch

    This option controls compatibility of routing table calculation with RFC 1583. Default value is no.

    instance id num

    When multiple OSPF protocol instances are active on the same links, they should use different instance IDs to distinguish their packets. Although it could be done on per-interface basis, it is often preferred to set one instance ID to whole OSPF domain/topology (e.g., when multiple instances are used to represent separate logical topologies on the same physical network). This option specifies the default instance ID for all interfaces of the OSPF instance. Note that this option, if used, must precede interface definitions. Default value is 0.

    stub router switch

    This option configures the router to be a stub router, i.e., a router that participates in the OSPF topology but does not allow transit traffic. In OSPFv2, this is implemented by advertising maximum metric for outgoing links. In OSPFv3, the stub router behavior is announced by clearing the R-bit in the router LSA. See RFC 6987 for details. Default value is no.

    tick num

    The routing table calculation and clean-up of areas' databases is not performed when a single link state change arrives. To lower the CPU utilization, it's processed later at periodical intervals of num seconds. The default value is 1.

    ecmp switch [limit number]

    This option specifies whether OSPF is allowed to generate ECMP (equal-cost multipath) routes. Such routes are used when there are several directions to the destination, each with the same (computed) cost. This option also allows to specify a limit on maximum number of nexthops in one route. By default, ECMP is disabled. If enabled, default value of the limit is 16.

    merge external switch

    This option specifies whether OSPF should merge external routes from different routers/LSAs for the same destination. When enabled together with ecmp, equal-cost external routes will be combined to multipath routes in the same way as regular routes. When disabled, external routes from different LSAs are treated as separate even if they represents the same destination. Default value is no.

    area id

    This defines an OSPF area with given area ID (an integer or an IPv4 address, similarly to a router ID). The most important area is the backbone (ID 0) to which every other area must be connected.

    stub

    This option configures the area to be a stub area. External routes are not flooded into stub areas. Also summary LSAs can be limited in stub areas (see option summary). By default, the area is not a stub area.

    nssa

    This option configures the area to be a NSSA (Not-So-Stubby Area). NSSA is a variant of a stub area which allows a limited way of external route propagation. Global external routes are not propagated into a NSSA, but an external route can be imported into NSSA as a (area-wide) NSSA-LSA (and possibly translated and/or aggregated on area boundary). By default, the area is not NSSA.

    summary switch

    This option controls propagation of summary LSAs into stub or NSSA areas. If enabled, summary LSAs are propagated as usual, otherwise just the default summary route (0.0.0.0/0) is propagated (this is sometimes called totally stubby area). If a stub area has more area boundary routers, propagating summary LSAs could lead to more efficient routing at the cost of larger link state database. Default value is no.

    default nssa switch

    When summary option is enabled, default summary route is no longer propagated to the NSSA. In that case, this option allows to originate default route as NSSA-LSA to the NSSA. Default value is no.

    default cost num

    This option controls the cost of a default route propagated to stub and NSSA areas. Default value is 1000.

    default cost2 num

    When a default route is originated as NSSA-LSA, its cost can use either type 1 or type 2 metric. This option allows to specify the cost of a default route in type 2 metric. By default, type 1 metric (option default cost) is used.

    translator switch

    This option controls translation of NSSA-LSAs into external LSAs. By default, one translator per NSSA is automatically elected from area boundary routers. If enabled, this area boundary router would unconditionally translate all NSSA-LSAs regardless of translator election. Default value is no.

    translator stability num

    This option controls the translator stability interval (in seconds). When the new translator is elected, the old one keeps translating until the interval is over. Default value is 40.

    networks { set }

    Definition of area IP ranges. This is used in summary LSA origination. Hidden networks are not propagated into other areas.

    external { set }

    Definition of external area IP ranges for NSSAs. This is used for NSSA-LSA translation. Hidden networks are not translated into external LSAs. Networks can have configured route tag.

    stubnet prefix { options }

    Stub networks are networks that are not transit networks between OSPF routers. They are also propagated through an OSPF area as a part of a link state database. By default, BIRD generates a stub network record for each primary network address on each OSPF interface that does not have any OSPF neighbors, and also for each non-primary network address on each OSPF interface. This option allows to alter a set of stub networks propagated by this router.

    Each instance of this option adds a stub network with given network prefix to the set of propagated stub network, unless option hidden is used. It also suppresses default stub networks for given network prefix. When option summary is used, also default stub networks that are subnetworks of given stub network are suppressed. This might be used, for example, to aggregate generated stub networks.

    interface pattern [instance num]

    Defines that the specified interfaces belong to the area being defined. See interface common option for detailed description. In OSPFv2, extended interface clauses are used, because each network prefix is handled as a separate virtual interface.

    You can specify alternative instance ID for the interface definition, therefore it is possible to have several instances of that interface with different options or even in different areas. For OSPFv2, instance ID support is an extension (RFC 6549) and is supposed to be set per-protocol. For OSPFv3, it is an integral feature.

    virtual link id [instance num]

    Virtual link to router with the router id. Virtual link acts as a point-to-point interface belonging to backbone. The actual area is used as a transport area. This item cannot be in the backbone. Like with interface option, you could also use several virtual links to one destination with different instance IDs.

    cost num

    Specifies output cost (metric) of an interface. Default value is 10.

    stub switch

    If set to interface it does not listen to any packet and does not send any hello. Default value is no.

    hello num

    Specifies interval in seconds between sending of Hello messages. Beware, all routers on the same network need to have the same hello interval. Default value is 10.

    poll num

    Specifies interval in seconds between sending of Hello messages for some neighbors on NBMA network. Default value is 20.

    retransmit num

    Specifies interval in seconds between retransmissions of unacknowledged updates. Default value is 5.

    priority num

    On every multiple access network (e.g., the Ethernet) Designated Router and Backup Designated router are elected. These routers have some special functions in the flooding process. Higher priority increases preferences in this election. Routers with priority 0 are not eligible. Default value is 1.

    wait num

    After start, router waits for the specified number of seconds between starting election and building adjacency. Default value is 4*hello.

    dead count num

    When the router does not receive any messages from a neighbor in dead count*hello seconds, it will consider the neighbor down.

    dead num

    When the router does not receive any messages from a neighbor in dead seconds, it will consider the neighbor down. If both directives dead count and dead are used, dead has precedence.

    secondary switch

    On BSD systems, older versions of BIRD supported OSPFv2 only for the primary IP address of an interface, other IP ranges on the interface were handled as stub networks. Since v1.4.1, regular operation on secondary IP addresses is supported, but disabled by default for compatibility. This option allows to enable it. The option is a transitional measure, will be removed in the next major release as the behavior will be changed. On Linux systems, the option is irrelevant, as operation on non-primary addresses is already the regular behavior.

    rx buffer num

    This option allows to specify the size of buffers used for packet processing. The buffer size should be bigger than maximal size of any packets. By default, buffers are dynamically resized as needed, but a fixed value could be specified. Value large means maximal allowed packet size - 65535.

    tx length num

    Transmitted OSPF messages that contain large amount of information are segmented to separate OSPF packets to avoid IP fragmentation. This option specifies the soft ceiling for the length of generated OSPF packets. Default value is the MTU of the network interface. Note that larger OSPF packets may still be generated if underlying OSPF messages cannot be splitted (e.g. when one large LSA is propagated).

    type broadcast|bcast

    BIRD detects a type of a connected network automatically, but sometimes it's convenient to force use of a different type manually. On broadcast networks (like ethernet), flooding and Hello messages are sent using multicasts (a single packet for all the neighbors). A designated router is elected and it is responsible for synchronizing the link-state databases and originating network LSAs. This network type cannot be used on physically NBMA networks and on unnumbered networks (networks without proper IP prefix).

    type pointopoint|ptp

    Point-to-point networks connect just 2 routers together. No election is performed and no network LSA is originated, which makes it simpler and faster to establish. This network type is useful not only for physically PtP ifaces (like PPP or tunnels), but also for broadcast networks used as PtP links. This network type cannot be used on physically NBMA networks.

    type nonbroadcast|nbma

    On NBMA networks, the packets are sent to each neighbor separately because of lack of multicast capabilities. Like on broadcast networks, a designated router is elected, which plays a central role in propagation of LSAs. This network type cannot be used on unnumbered networks.

    type pointomultipoint|ptmp

    This is another network type designed to handle NBMA networks. In this case the NBMA network is treated as a collection of PtP links. This is useful if not every pair of routers on the NBMA network has direct communication, or if the NBMA network is used as an (possibly unnumbered) PtP link.

    link lsa suppression switch

    In OSPFv3, link LSAs are generated for each link, announcing link-local IPv6 address of the router to its local neighbors. These are useless on PtP or PtMP networks and this option allows to suppress the link LSA origination for such interfaces. The option is ignored on other than PtP or PtMP interfaces. Default value is no.

    strict nonbroadcast switch

    If set, don't send hello to any undefined neighbor. This switch is ignored on other than NBMA or PtMP interfaces. Default value is no.

    real broadcast switch

    In type broadcast or type ptp network configuration, OSPF packets are sent as IP multicast packets. This option changes the behavior to using old-fashioned IP broadcast packets. This may be useful as a workaround if IP multicast for some reason does not work or does not work reliably. This is a non-standard option and probably is not interoperable with other OSPF implementations. Default value is no.

    ptp netmask switch

    In type ptp network configurations, OSPFv2 implementations should ignore received netmask field in hello packets and should send hello packets with zero netmask field on unnumbered PtP links. But some OSPFv2 implementations perform netmask checking even for PtP links. This option specifies whether real netmask will be used in hello packets on type ptp interfaces. You should ignore this option unless you meet some compatibility problems related to this issue. Default value is no for unnumbered PtP links, yes otherwise.

    check link switch

    If set, a hardware link state (reported by OS) is taken into consideration. When a link disappears (e.g. an ethernet cable is unplugged), neighbors are immediately considered unreachable and only the address of the iface (instead of whole network prefix) is propagated. It is possible that some hardware drivers or platforms do not implement this feature. Default value is no.

    bfd switch

    OSPF could use BFD protocol as an advisory mechanism for neighbor liveness and failure detection. If enabled, BIRD setups a BFD session for each OSPF neighbor and tracks its liveness by it. This has an advantage of an order of magnitude lower detection times in case of failure. Note that BFD protocol also has to be configured, see BFD section for details. Default value is no.

    ttl security [switch | tx only]

    TTL security is a feature that protects routing protocols from remote spoofed packets by using TTL 255 instead of TTL 1 for protocol packets destined to neighbors. Because TTL is decremented when packets are forwarded, it is non-trivial to spoof packets with TTL 255 from remote locations. Note that this option would interfere with OSPF virtual links.

    If this option is enabled, the router will send OSPF packets with TTL 255 and drop received packets with TTL less than 255. If this option si set to tx only, TTL 255 is used for sent packets, but is not checked for received packets. Default value is no.

    tx class|dscp|priority num

    These options specify the ToS/DiffServ/Traffic class/Priority of the outgoing OSPF packets. See tx class common option for detailed description.

    ecmp weight num

    When ECMP (multipath) routes are allowed, this value specifies a relative weight used for nexthops going through the iface. Allowed values are 1-256. Default value is 1.

    authentication none

    No passwords are sent in OSPF packets. This is the default value.

    authentication simple

    Every packet carries 8 bytes of password. Received packets lacking this password are ignored. This authentication mechanism is very weak. This option is not available in OSPFv3.

    authentication cryptographic

    An authentication code is appended to every packet. The specific cryptographic algorithm is selected by option algorithm for each key. The default cryptographic algorithm for OSPFv2 keys is Keyed-MD5 and for OSPFv3 keys is HMAC-SHA-256. Passwords are not sent open via network, so this mechanism is quite secure. Packets can still be read by an attacker.

    password "text"

    Specifies a password used for authentication. See password common option for detailed description.

    neighbors { set }

    A set of neighbors to which Hello messages on NBMA or PtMP networks are to be sent. For NBMA networks, some of them could be marked as eligible. In OSPFv3, link-local addresses should be used, using global ones is possible, but it is nonstandard and might be problematic. And definitely, link-local and global addresses should not be mixed.

    Attributes

    OSPF defines four route attributes. Each internal route has a metric.

    Metric is ranging from 1 to infinity (65535). External routes use metric type 1 or metric type 2. A metric of type 1 is comparable with internal metric, a metric of type 2 is always longer than any metric of type 1 or any internal metric. Internal metric or metric of type 1 is stored in attribute ospf_metric1, metric type 2 is stored in attribute ospf_metric2. If you specify both metrics only metric1 is used.

    Each external route can also carry attribute ospf_tag which is a 32-bit integer which is used when exporting routes to other protocols; otherwise, it doesn't affect routing inside the OSPF domain at all. The fourth attribute ospf_router_id is a router ID of the router advertising that route / network. This attribute is read-only. Default is ospf_metric2 = 10000 and ospf_tag = 0.

    Example

    protocol ospf MyOSPF {
        rfc1583compat yes;
        tick 2;
        export filter {
                if source = RTS_BGP then {
                        ospf_metric1 = 100;
                        accept;
                }
                reject;
        };
        area 0.0.0.0 {
                interface "eth*" {
                        cost 11;
                        hello 15;
                        priority 100;
                        retransmit 7;
                        authentication simple;
                        password "aaa";
                };
                interface "ppp*" {
                        cost 100;
                        authentication cryptographic;
                        password "abc" {
                                id 1;
                                generate to "22-04-2003 11:00:06";
                                accept from "17-01-2001 12:01:05";
                                algorithm hmac sha384;
                        };
                        password "def" {
                                id 2;
                                generate to "22-07-2005 17:03:21";
                                accept from "22-02-2001 11:34:06";
                                algorithm hmac sha512;
                        };
                };
                interface "arc0" {
                        cost 10;
                        stub yes;
                };
                interface "arc1";
        };
        area 120 {
                stub yes;
                networks {
                        172.16.1.0/24;
                        172.16.2.0/24 hidden;
                }
                interface "-arc0" , "arc*" {
                        type nonbroadcast;
                        authentication none;
                        strict nonbroadcast yes;
                        wait 120;
                        poll 40;
                        dead count 8;
                        neighbors {
                                192.168.120.1 eligible;
                                192.168.120.2;
                                192.168.120.10;
                        };
                };
        };
}

    6.8 Pipe

    Introduction

    The Pipe protocol serves as a link between two routing tables, allowing routes to be passed from a table declared as primary (i.e., the one the pipe is connected to using the table configuration keyword) to the secondary one (declared using peer table) and vice versa, depending on what's allowed by the filters. Export filters control export of routes from the primary table to the secondary one, import filters control the opposite direction.

    The Pipe protocol may work in the transparent mode mode or in the opaque mode. In the transparent mode, the Pipe protocol retransmits all routes from one table to the other table, retaining their original source and attributes. If import and export filters are set to accept, then both tables would have the same content. The transparent mode is the default mode.

    In the opaque mode, the Pipe protocol retransmits optimal route from one table to the other table in a similar way like other protocols send and receive routes. Retransmitted route will have the source set to the Pipe protocol, which may limit access to protocol specific route attributes. This mode is mainly for compatibility, it is not suggested for new configs. The mode can be changed by mode option.

    The primary use of multiple routing tables and the Pipe protocol is for policy routing, where handling of a single packet doesn't depend only on its destination address, but also on its source address, source interface, protocol type and other similar parameters. In many systems (Linux being a good example), the kernel allows to enforce routing policies by defining routing rules which choose one of several routing tables to be used for a packet according to its parameters. Setting of these rules is outside the scope of BIRD's work (on Linux, you can use the ip command), but you can create several routing tables in BIRD, connect them to the kernel ones, use filters to control which routes appear in which tables and also you can employ the Pipe protocol for exporting a selected subset of one table to another one.

    Configuration

    peer table table

    Defines secondary routing table to connect to. The primary one is selected by the table keyword.

    mode opaque|transparent

    Specifies the mode for the pipe to work in. Default is transparent.

    Attributes

    The Pipe protocol doesn't define any route attributes.

    Example

    Let's consider a router which serves as a boundary router of two different autonomous systems, each of them connected to a subset of interfaces of the router, having its own exterior connectivity and wishing to use the other AS as a backup connectivity in case of outage of its own exterior line.

    Probably the simplest solution to this situation is to use two routing tables (we'll call them as1 and as2) and set up kernel routing rules, so that packets having arrived from interfaces belonging to the first AS will be routed according to as1 and similarly for the second AS. Thus we have split our router to two logical routers, each one acting on its own routing table, having its own routing protocols on its own interfaces. In order to use the other AS's routes for backup purposes, we can pass the routes between the tables through a Pipe protocol while decreasing their preferences and correcting their BGP paths to reflect the AS boundary crossing. 

    table as1;                              # Define the tables
table as2;

protocol kernel kern1 {                 # Synchronize them with the kernel
        table as1;
        kernel table 1;
}

protocol kernel kern2 {
        table as2;
        kernel table 2;
}

protocol bgp bgp1 {                     # The outside connections
        table as1;
        local as 1;
        neighbor 192.168.0.1 as 1001;
        export all;
        import all;
}

protocol bgp bgp2 {
        table as2;
        local as 2;
        neighbor 10.0.0.1 as 1002;
        export all;
        import all;
}

protocol pipe {                         # The Pipe
        table as1;
        peer table as2;
        export filter {
                if net ~ [ 1.0.0.0/8+] then {   # Only AS1 networks
                        if preference>10 then preference = preference-10;
                        if source=RTS_BGP then bgp_path.prepend(1);
                        accept;
                }
                reject;
        };
        import filter {
                if net ~ [ 2.0.0.0/8+] then {   # Only AS2 networks
                        if preference>10 then preference = preference-10;
                        if source=RTS_BGP then bgp_path.prepend(2);
                        accept;
                }
                reject;
        };
}

    6.9 RAdv

    Introduction

    The RAdv protocol is an implementation of Router Advertisements, which are used in the IPv6 stateless autoconfiguration. IPv6 routers send (in irregular time intervals or as an answer to a request) advertisement packets to connected networks. These packets contain basic information about a local network (e.g. a list of network prefixes), which allows network hosts to autoconfigure network addresses and choose a default route. BIRD implements router behavior as defined in RFC 4861 and also the DNS extensions from RFC 6106.

    Configuration

    There are several classes of definitions in RAdv configuration -- interface definitions, prefix definitions and DNS definitions:

    interface pattern [, ...] { options }

    Interface definitions specify a set of interfaces on which the protocol is activated and contain interface specific options. See interface common options for detailed description.

    prefix prefix { options }

    Prefix definitions allow to modify a list of advertised prefixes. By default, the advertised prefixes are the same as the network prefixes assigned to the interface. For each network prefix, the matching prefix definition is found and its options are used. If no matching prefix definition is found, the prefix is used with default options.

    Prefix definitions can be either global or interface-specific. The second ones are part of interface options. The prefix definition matching is done in the first-match style, when interface-specific definitions are processed before global definitions. As expected, the prefix definition is matching if the network prefix is a subnet of the prefix in prefix definition.

    rdnss { options }

    RDNSS definitions allow to specify a list of advertised recursive DNS servers together with their options. As options are seldom necessary, there is also a short variant rdnss address that just specifies one DNS server. Multiple definitions are cumulative. RDNSS definitions may also be interface-specific when used inside interface options. By default, interface uses both global and interface-specific options, but that can be changed by rdnss local option. dsc-iface

    dnssl { options }

    DNSSL definitions allow to specify a list of advertised DNS search domains together with their options. Like rdnss above, multiple definitions are cumulative, they can be used also as interface-specific options and there is a short variant dnssl domain that just specifies one DNS search domain.

    trigger prefix

    RAdv protocol could be configured to change its behavior based on availability of routes. When this option is used, the protocol waits in suppressed state until a trigger route (for the specified network) is exported to the protocol, the protocol also returnsd to suppressed state if the trigger route disappears. Note that route export depends on specified export filter, as usual. This option could be used, e.g., for handling failover in multihoming scenarios.

    During suppressed state, router advertisements are generated, but with some fields zeroed. Exact behavior depends on which fields are zeroed, this can be configured by sensitive option for appropriate fields. By default, just default lifetime (also called router lifetime) is zeroed, which means hosts cannot use the router as a default router. preferred lifetime and valid lifetime could also be configured as sensitive for a prefix, which would cause autoconfigured IPs to be deprecated or even removed.

    Interface specific options:

    max ra interval expr

    Unsolicited router advertisements are sent in irregular time intervals. This option specifies the maximum length of these intervals, in seconds. Valid values are 4-1800. Default: 600

    min ra interval expr

    This option specifies the minimum length of that intervals, in seconds. Must be at least 3 and at most 3/4 * max ra interval. Default: about 1/3 * max ra interval.

    min delay expr

    The minimum delay between two consecutive router advertisements, in seconds. Default: 3

    managed switch

    This option specifies whether hosts should use DHCPv6 for IP address configuration. Default: no

    other config switch

    This option specifies whether hosts should use DHCPv6 to receive other configuration information. Default: no

    link mtu expr

    This option specifies which value of MTU should be used by hosts. 0 means unspecified. Default: 0

    reachable time expr

    This option specifies the time (in milliseconds) how long hosts should assume a neighbor is reachable (from the last confirmation). Maximum is 3600000, 0 means unspecified. Default 0.

    retrans timer expr

    This option specifies the time (in milliseconds) how long hosts should wait before retransmitting Neighbor Solicitation messages. 0 means unspecified. Default 0.

    current hop limit expr

    This option specifies which value of Hop Limit should be used by hosts. Valid values are 0-255, 0 means unspecified. Default: 64

    default lifetime expr [sensitive switch]

    This option specifies the time (in seconds) how long (after the receipt of RA) hosts may use the router as a default router. 0 means do not use as a default router. For sensitive option, see trigger. Default: 3 * max ra interval, sensitive yes.

    default preference low|medium|high

    This option specifies the Default Router Preference value to advertise to hosts. Default: medium.

    rdnss local switch

    Use only local (interface-specific) RDNSS definitions for this interface. Otherwise, both global and local definitions are used. Could also be used to disable RDNSS for given interface if no local definitons are specified. Default: no.

    dnssl local switch

    Use only local DNSSL definitions for this interface. See rdnss local option above. Default: no.

    Prefix specific options

    skip switch

    This option allows to specify that given prefix should not be advertised. This is useful for making exceptions from a default policy of advertising all prefixes. Note that for withdrawing an already advertised prefix it is more useful to advertise it with zero valid lifetime. Default: no

    onlink switch

    This option specifies whether hosts may use the advertised prefix for onlink determination. Default: yes

    autonomous switch

    This option specifies whether hosts may use the advertised prefix for stateless autoconfiguration. Default: yes

    valid lifetime expr [sensitive switch]

    This option specifies the time (in seconds) how long (after the receipt of RA) the prefix information is valid, i.e., autoconfigured IP addresses can be assigned and hosts with that IP addresses are considered directly reachable. 0 means the prefix is no longer valid. For sensitive option, see trigger. Default: 86400 (1 day), sensitive no.

    preferred lifetime expr [sensitive switch]

    This option specifies the time (in seconds) how long (after the receipt of RA) IP addresses generated from the prefix using stateless autoconfiguration remain preferred. For sensitive option, see trigger. Default: 14400 (4 hours), sensitive no.

    RDNSS specific options:

    ns address

    This option specifies one recursive DNS server. Can be used multiple times for multiple servers. It is mandatory to have at least one ns option in rdnss definition.

    lifetime [mult] expr

    This option specifies the time how long the RDNSS information may be used by clients after the receipt of RA. It is expressed either in seconds or (when mult is used) in multiples of max ra interval. Note that RDNSS information is also invalidated when default lifetime expires. 0 means these addresses are no longer valid DNS servers. Default: 3 * max ra interval.

    DNSSL specific options:

    domain address

    This option specifies one DNS search domain. Can be used multiple times for multiple domains. It is mandatory to have at least one domain option in dnssl definition.

    lifetime [mult] expr

    This option specifies the time how long the DNSSL information may be used by clients after the receipt of RA. Details are the same as for RDNSS lifetime option above. Default: 3 * max ra interval.

    Example

    protocol radv {
        interface "eth2" {
                max ra interval 5;      # Fast failover with more routers
                managed yes;            # Using DHCPv6 on eth2
                prefix ::/0 {
                        autonomous off; # So do not autoconfigure any IP
                };
        };

        interface "eth*";               # No need for any other options

        prefix 2001:0DB8:1234::/48 {
                preferred lifetime 0;   # Deprecated address range
        };

        prefix 2001:0DB8:2000::/48 {
                autonomous off;         # Do not autoconfigure
        };

        rdnss 2001:0DB8:1234::10;       # Short form of RDNSS

        rdnss {
                lifetime mult 10;
                ns 2001:0DB8:1234::11;
                ns 2001:0DB8:1234::12;
        };

        dnssl {
                lifetime 3600;
                domain "abc.com";
                domain "xyz.com";
        };
}

    6.10 RIP

    Introduction

    The RIP protocol (also sometimes called Rest In Pieces) is a simple protocol, where each router broadcasts (to all its neighbors) distances to all networks it can reach. When a router hears distance to another network, it increments it and broadcasts it back. Broadcasts are done in regular intervals. Therefore, if some network goes unreachable, routers keep telling each other that its distance is the original distance plus 1 (actually, plus interface metric, which is usually one). After some time, the distance reaches infinity (that's 15 in RIP) and all routers know that network is unreachable. RIP tries to minimize situations where counting to infinity is necessary, because it is slow. Due to infinity being 16, you can't use RIP on networks where maximal distance is higher than 15 hosts.

    BIRD supports RIPv1 (RFC 1058), RIPv2 (RFC 2453), RIPng (RFC 2080), and RIP cryptographic authentication (RFC 4822).

    RIP is a very simple protocol, and it has a lot of shortcomings. Slow convergence, big network load and inability to handle larger networks makes it pretty much obsolete. It is still usable on very small networks.

    Configuration

    RIP configuration consists mainly of common protocol options and interface definitions, most RIP options are interface specific. 

    protocol rip [<name>] {
        infinity <number>;
        ecmp <switch> [limit <number>];
        interface <interface pattern> {
                metric <number>;
                mode multicast|broadcast;
                passive <switch>;
                address <ip>;
                port <number>;
                version 1|2;
                split horizon <switch>;
                poison reverse <switch>;
                check zero <switch>;
                update time <number>;
                timeout time <number>;
                garbage time <number>;
                ecmp weight <number>;
                ttl security <switch>; | tx only;
                tx class|dscp <number>;
                tx priority <number>;
                rx buffer <number>;
                tx length <number>;
                check link <switch>;
                authentication none|plaintext|cryptographic;
                password "<text>";
                password "<text>" {
                        id <num>;
                        generate from "<date>";
                        generate to "<date>";
                        accept from "<date>";
                        accept to "<date>";
                        from "<date>";
                        to "<date>";
                        algorithm ( keyed md5 | keyed sha1 | hmac sha1 | hmac sha256 | hmac sha384 | hmac sha512 );
                };
        };
}

    infinity number

    Selects the distance of infinity. Bigger values will make protocol convergence even slower. The default value is 16.

    ecmp switch [limit number]

    This option specifies whether RIP is allowed to generate ECMP (equal-cost multipath) routes. Such routes are used when there are several directions to the destination, each with the same (computed) cost. This option also allows to specify a limit on maximum number of nexthops in one route. By default, ECMP is disabled. If enabled, default value of the limit is 16.

    interface pattern [, ...] { options }

    Interface definitions specify a set of interfaces on which the protocol is activated and contain interface specific options. See interface common options for detailed description.

    Interface specific options:

    metric num

    This option specifies the metric of the interface. When a route is received from the interface, its metric is increased by this value before further processing. Valid values are 1-255, but values higher than infinity has no further meaning. Default: 1.

    mode multicast|broadcast

    This option selects the mode for RIP to use on the interface. The default is multicast mode for RIPv2 and broadcast mode for RIPv1. RIPng always uses the multicast mode.

    passive switch

    Passive interfaces receive routing updates but do not transmit any messages. Default: no.

    address ip

    This option specifies a destination address used for multicast or broadcast messages, the default is the official RIP (224.0.0.9) or RIPng (ff02::9) multicast address, or an appropriate broadcast address in the broadcast mode.

    port number

    This option selects an UDP port to operate on, the default is the official RIP (520) or RIPng (521) port.

    version 1|2

    This option selects the version of RIP used on the interface. For RIPv1, automatic subnet aggregation is not implemented, only classful network routes and host routes are propagated. Note that BIRD allows RIPv1 to be configured with features that are defined for RIPv2 only, like authentication or using multicast sockets. The default is RIPv2 for IPv4 RIP, the option is not supported for RIPng, as no further versions are defined.

    version only switch

    Regardless of RIP version configured for the interface, BIRD accepts incoming packets of any RIP version. This option restrict accepted packets to the configured version. Default: no.

    split horizon switch

    Split horizon is a scheme for preventing routing loops. When split horizon is active, routes are not regularly propagated back to the interface from which they were received. They are either not propagated back at all (plain split horizon) or propagated back with an infinity metric (split horizon with poisoned reverse). Therefore, other routers on the interface will not consider the router as a part of an independent path to the destination of the route. Default: yes.

    poison reverse switch

    When split horizon is active, this option specifies whether the poisoned reverse variant (propagating routes back with an infinity metric) is used. The poisoned reverse has some advantages in faster convergence, but uses more network traffic. Default: yes.

    check zero switch

    Received RIPv1 packets with non-zero values in reserved fields should be discarded. This option specifies whether the check is performed or such packets are just processed as usual. Default: yes.

    update time number

    Specifies the number of seconds between periodic updates. A lower number will mean faster convergence but bigger network load. Default: 30.

    timeout time number

    Specifies the time interval (in seconds) between the last received route announcement and the route expiration. After that, the network is considered unreachable, but still is propagated with infinity distance. Default: 180.

    garbage time number

    Specifies the time interval (in seconds) between the route expiration and the removal of the unreachable network entry. The garbage interval, when a route with infinity metric is propagated, is used for both internal (after expiration) and external (after withdrawal) routes. Default: 120.

    ecmp weight number

    When ECMP (multipath) routes are allowed, this value specifies a relative weight used for nexthops going through the iface. Valid values are 1-256. Default value is 1.

    authentication none|plaintext|cryptographic

    Selects authentication method to be used. none means that packets are not authenticated at all, plaintext means that a plaintext password is embedded into each packet, and cryptographic means that packets are authenticated using some cryptographic hash function selected by option algorithm for each key. The default cryptographic algorithm for RIP keys is Keyed-MD5. If you set authentication to not-none, it is a good idea to add password section. Default: none.

    password "text"

    Specifies a password used for authentication. See password common option for detailed description.

    ttl security [switch | tx only]

    TTL security is a feature that protects routing protocols from remote spoofed packets by using TTL 255 instead of TTL 1 for protocol packets destined to neighbors. Because TTL is decremented when packets are forwarded, it is non-trivial to spoof packets with TTL 255 from remote locations.

    If this option is enabled, the router will send RIP packets with TTL 255 and drop received packets with TTL less than 255. If this option si set to tx only, TTL 255 is used for sent packets, but is not checked for received packets. Such setting does not offer protection, but offers compatibility with neighbors regardless of whether they use ttl security.

    For RIPng, TTL security is a standard behavior (required by RFC 2080) and therefore default value is yes. For IPv4 RIP, default value is no.

    tx class|dscp|priority number

    These options specify the ToS/DiffServ/Traffic class/Priority of the outgoing RIP packets. See tx class common option for detailed description.

    rx buffer number

    This option specifies the size of buffers used for packet processing. The buffer size should be bigger than maximal size of received packets. The default value is 532 for IPv4 RIP and interface MTU value for RIPng.

    tx length number

    This option specifies the maximum length of generated RIP packets. To avoid IP fragmentation, it should not exceed the interface MTU value. The default value is 532 for IPv4 RIP and interface MTU value for RIPng.

    check link switch

    If set, the hardware link state (as reported by OS) is taken into consideration. When the link disappears (e.g. an ethernet cable is unplugged), neighbors are immediately considered unreachable and all routes received from them are withdrawn. It is possible that some hardware drivers or platforms do not implement this feature. Default: no.

    Attributes

    RIP defines two route attributes:

    int rip_metric/

    RIP metric of the route (ranging from 0 to infinity). When routes from different RIP instances are available and all of them have the same preference, BIRD prefers the route with lowest rip_metric. When a non-RIP route is exported to RIP, the default metric is 1.

    int rip_tag/

    RIP route tag: a 16-bit number which can be used to carry additional information with the route (for example, an originating AS number in case of external routes). When a non-RIP route is exported to RIP, the default tag is 0.

    Example

    protocol rip {
        debug all;
        port 1520;
        period 12;
        garbage time 60;
        interface "eth0" { metric 3; mode multicast; };
        interface "eth*" { metric 2; mode broadcast; };
        authentication cryptographic;
        password "secret-shared-key" { algorithm hmac sha256; };
        import filter { print "importing"; accept; };
        export filter { print "exporting"; accept; };
}

    6.11 Static

    The Static protocol doesn't communicate with other routers in the network, but instead it allows you to define routes manually. This is often used for specifying how to forward packets to parts of the network which don't use dynamic routing at all and also for defining sink routes (i.e., those telling to return packets as undeliverable if they are in your IP block, you don't have any specific destination for them and you don't want to send them out through the default route to prevent routing loops).

    There are five types of static routes: `classical' routes telling to forward packets to a neighboring router, multipath routes specifying several (possibly weighted) neighboring routers, device routes specifying forwarding to hosts on a directly connected network, recursive routes computing their nexthops by doing route table lookups for a given IP, and special routes (sink, blackhole etc.) which specify a special action to be done instead of forwarding the packet.

    When the particular destination is not available (the interface is down or the next hop of the route is not a neighbor at the moment), Static just uninstalls the route from the table it is connected to and adds it again as soon as the destination becomes adjacent again.

    There are three classes of definitions in Static protocol configuration -- global options, static route definitions, and per-route options. Usually, the definition of the protocol contains mainly a list of static routes.

    Global options:

    check link switch

    If set, hardware link states of network interfaces are taken into consideration. When link disappears (e.g. ethernet cable is unplugged), static routes directing to that interface are removed. It is possible that some hardware drivers or platforms do not implement this feature. Default: off.

    igp table name

    Specifies a table that is used for route table lookups of recursive routes. Default: the same table as the protocol is connected to.

    Route definitions (each may also contain a block of per-route options):

    route prefix via ip

    Static route through a neighboring router. For link-local next hops, interface can be specified as a part of the address (e.g., via fe80::1234%eth0).

    route prefix multipath via ip [weight num] [bfd switch] [via ...]

    Static multipath route. Contains several nexthops (gateways), possibly with their weights.

    route prefix via "interface"

    Static device route through an interface to hosts on a directly connected network.

    route prefix recursive ip

    Static recursive route, its nexthop depends on a route table lookup for given IP address.

    route prefix blackhole|unreachable|prohibit

    Special routes specifying to silently drop the packet, return it as unreachable or return it as administratively prohibited. First two targets are also known as drop and reject.

    Per-route options:

    bfd switch

    The Static protocol could use BFD protocol for next hop liveness detection. If enabled, a BFD session to the route next hop is created and the static route is BFD-controlled -- the static route is announced only if the next hop liveness is confirmed by BFD. If the BFD session fails, the static route is removed. Note that this is a bit different compared to other protocols, which may use BFD as an advisory mechanism for fast failure detection but ignores it if a BFD session is not even established.

    This option can be used for static routes with a direct next hop, or also for for individual next hops in a static multipath route (see above). Note that BFD protocol also has to be configured, see BFD section for details. Default value is no.

    filter expression

    This is a special option that allows filter expressions to be configured on per-route basis. Can be used multiple times. These expressions are evaluated when the route is originated, similarly to the import filter of the static protocol. This is especially useful for configuring route attributes, e.g., ospf_metric1 = 100; for a route that will be exported to the OSPF protocol.

    Static routes have no specific attributes.

    Example static config might look like this: 

    protocol static {
        table testable;                 # Connect to a non-default routing table
        check link;                     # Advertise routes only if link is up
        route 0.0.0.0/0 via 198.51.100.130; # Default route
        route 10.0.0.0/8 multipath      # Multipath route
                via 198.51.100.10 weight 2
                via 198.51.100.20 bfd   # BFD-controlled next hop
                via 192.0.2.1;
        route 203.0.113.0/24 unreachable; # Sink route
        route 10.2.0.0/24 via "arc0";   # Secondary network
        route 192.168.10.0/24 via 198.51.100.100 {
                ospf_metric1 = 20;      # Set extended attribute
        }
        route 192.168.10.0/24 via 198.51.100.100 {
                ospf_metric2 = 100;     # Set extended attribute
                ospf_tag = 2;           # Set extended attribute
                bfd;                    # BFD-controlled route
        }
}

    Next Previous Contents bird-1.6.3/doc/bird-2.html0000644000103200001440000001057113027054673014152 0ustar feelausers BIRD User's Guide: About routing tables Next Previous Contents

    2. About routing tables

    BIRD has one or more routing tables which may or may not be synchronized with OS kernel and which may or may not be synchronized with each other (see the Pipe protocol). Each routing table contains a list of known routes. Each route consists of:

    • network prefix this route is for (network address and prefix length -- the number of bits forming the network part of the address; also known as a netmask)
    • preference of this route
    • IP address of router which told us about this route
    • IP address of router we should forward the packets to using this route
    • other attributes common to all routes
    • dynamic attributes defined by protocols which may or may not be present (typically protocol metrics)

    Routing table maintains multiple entries for a network, but at most one entry for one network and one protocol. The entry with the highest preference is used for routing (we will call such an entry the selected route). If there are more entries with the same preference and they are from the same protocol, the protocol decides (typically according to metrics). If they aren't, an internal ordering is used to break the tie. You can get the list of route attributes in the Route attributes section.

    Each protocol is connected to a routing table through two filters which can accept, reject and modify the routes. An export filter checks routes passed from the routing table to the protocol, an import filter checks routes in the opposite direction. When the routing table gets a route from a protocol, it recalculates the selected route and broadcasts it to all protocols connected to the table. The protocols typically send the update to other routers in the network. Note that although most protocols are interested in receiving just selected routes, some protocols (e.g. the Pipe protocol) receive and process all entries in routing tables (accepted by filters).

    Usually, a routing table just chooses a selected route from a list of entries for one network. But if the sorted option is activated, these lists of entries are kept completely sorted (according to preference or some protocol-dependent metric). This is needed for some features of some protocols (e.g. secondary option of BGP protocol, which allows to accept not just a selected route, but the first route (in the sorted list) that is accepted by filters), but it is incompatible with some other features (e.g. deterministic med option of BGP protocol, which activates a way of choosing selected route that cannot be described using comparison and ordering). Minor advantage is that routes are shown sorted in show route, minor disadvantage is that it is slightly more computationally expensive.

    2.1 Graceful restart

    When BIRD is started after restart or crash, it repopulates routing tables in an uncoordinated manner, like after clean start. This may be impractical in some cases, because if the forwarding plane (i.e. kernel routing tables) remains intact, then its synchronization with BIRD would temporarily disrupt packet forwarding until protocols converge. Graceful restart is a mechanism that could help with this issue. Generally, it works by starting protocols and letting them repopulate routing tables while deferring route propagation until protocols acknowledge their convergence. Note that graceful restart behavior have to be configured for all relevant protocols and requires protocol-specific support (currently implemented for Kernel and BGP protocols), it is activated for particular boot by option -R.

    Next Previous Contents bird-1.6.3/doc/prog-6.html0000644000103200001440000001470213027054667014210 0ustar feelausers BIRD Programmer's Documentation: System dependent parts Next Previous Contents

    6. System dependent parts

    6.1 Introduction

    We've tried to make BIRD as portable as possible, but unfortunately communication with the network stack differs from one OS to another, so we need at least some OS specific code. The good news is that this code is isolated in a small set of modules:

    config.h

    is a header file with configuration information, definition of the standard set of types and so on.

    Startup module

    controls BIRD startup. Common for a family of OS's (e.g., for all Unices).

    Logging module

    manages the system logs. [per OS family]

    IO module

    gives an implementation of sockets, timers and the global event queue. [per OS family]

    KRT module

    implements the Kernel and Device protocols. This is the most arcane part of the system dependent stuff and some functions differ even between various releases of a single OS.

    6.2 Logging

    The Logging module offers a simple set of functions for writing messages to system logs and to the debug output. Message classes used by this module are described in birdlib.h and also in the user's manual.

    Function

    void log_commit (int class, buffer * buf) -- commit a log message

    Arguments

    int class

    message class information (L_DEBUG to L_BUG, see lib/birdlib.h)

    buffer * buf

    message to write

    Description

    This function writes a message prepared in the log buffer to the log file (as specified in the configuration). The log buffer is reset after that. The log message is a full line, log_commit() terminates it.

    The message class is an integer, not a first char of a string like in log(), so it should be written like *L_INFO.

    Function

    void log_msg (const char * msg, ... ...) -- log a message

    Arguments

    const char * msg

    printf-like formatting string with message class information prepended (L_DEBUG to L_BUG, see lib/birdlib.h)

    ... ...

    variable arguments

    Description

    This function formats a message according to the format string msg and writes it to the corresponding log file (as specified in the configuration). Please note that the message is automatically formatted as a full line, no need to include \n inside. It is essentially a sequence of log_reset(), logn() and log_commit().

    Function

    void bug (const char * msg, ... ...) -- report an internal error

    Arguments

    const char * msg

    a printf-like error message

    ... ...

    variable arguments

    Description

    This function logs an internal error and aborts execution of the program.

    Function

    void die (const char * msg, ... ...) -- report a fatal error

    Arguments

    const char * msg

    a printf-like error message

    ... ...

    variable arguments

    Description

    This function logs a fatal error and aborts execution of the program.

    Function

    void debug (const char * msg, ... ...) -- write to debug output

    Arguments

    const char * msg

    a printf-like message

    ... ...

    variable arguments

    Description

    This function formats the message msg and prints it out to the debugging output. No newline character is appended.

    6.3 Kernel synchronization

    This system dependent module implements the Kernel and Device protocol, that is synchronization of interface lists and routing tables with the OS kernel.

    The whole kernel synchronization is a bit messy and touches some internals of the routing table engine, because routing table maintenance is a typical example of the proverbial compatibility between different Unices and we want to keep the overhead of our KRT business as low as possible and avoid maintaining a local routing table copy.

    The kernel syncer can work in three different modes (according to system config header): Either with a single routing table and single KRT protocol [traditional UNIX] or with many routing tables and separate KRT protocols for all of them or with many routing tables, but every scan including all tables, so we start separate KRT protocols which cooperate with each other [Linux]. In this case, we keep only a single scan timer.

    We use FIB node flags in the routing table to keep track of route synchronization status. We also attach temporary rte's to the routing table, but it cannot do any harm to the rest of BIRD since table synchronization is an atomic process.

    When starting up, we cheat by looking if there is another KRT instance to be initialized later and performing table scan only once for all the instances.

    The code uses OS-dependent parts for kernel updates and scans. These parts are in more specific sysdep directories (e.g. sysdep/linux) in functions krt_sys_* and kif_sys_* (and some others like krt_replace_rte()) and krt-sys.h header file. This is also used for platform specific protocol options and route attributes.

    There was also an old code that used traditional UNIX ioctls for these tasks. It was unmaintained and later removed. For reference, see sysdep/krt-* files in commit 396dfa9042305f62da1f56589c4b98fac57fc2f6

    Next Previous Contents bird-1.6.3/doc/reply_codes0000644000103200001440000000333613027054563014437 0ustar feelausersReply codes of BIRD command-line interface ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 0xxx Action suceessfully completed 1xxx Table entry 2xxx Table heading 8xxx Run-time error 9xxx Parse-time error Continuation + Spontaneous printout 0000 OK 0001 Welcome 0002 Reading configuration 0003 Reconfigured 0004 Reconfiguration in progress 0005 Reconfiguration already in progress, queueing 0006 Reconfiguration ignored, shutting down 0007 Shutdown ordered 0008 Already disabled 0009 Disabled 0010 Already enabled 0011 Enabled 0012 Restarted 0013 Status report 0014 Route count 0015 Reloading 0016 Access restricted 0017 Reconfiguration already in progress, removing queued config 0018 Reconfiguration confirmed 0019 Nothing to do (configure undo/confirm) 0020 Configuration OK 0021 Undo requested 0022 Undo scheduled 0023 Evaluation of expression 0024 Graceful restart status report 1000 BIRD version 1001 Interface list 1002 Protocol list 1003 Interface address 1004 Interface flags 1005 Interface summary 1006 Protocol details 1007 Route list 1008 Route details 1009 Static route list 1010 Symbol list 1011 Uptime 1012 Route extended attribute list 1013 Show ospf neighbors 1014 Show ospf 1015 Show ospf interface 1016 Show ospf state/topology 1017 Show ospf lsadb 1018 Show memory 1019 Show ROA list 1020 Show BFD sessions 1021 Show RIP interface 1022 Show RIP neighbors 1023 Show Babel interfaces 1024 Show Babel neighbors 1025 Show Babel entries 8000 Reply too long 8001 Route not found 8002 Configuration file error 8003 No protocols match 8004 Stopped due to reconfiguration 8005 Protocol is down => cannot dump 8006 Reload failed 8007 Access denied 8008 Evaluation runtime error 9000 Command too long 9001 Parse error 9002 Invalid symbol type bird-1.6.3/doc/bird.out0000644000103200001440000000355413027054675013663 0ustar feelausers\BOOKMARK [0][-]{chapter.1}{Introduction }{}% 1 \BOOKMARK [1][-]{section.1.1}{What is BIRD }{chapter.1}% 2 \BOOKMARK [1][-]{section.1.2}{Installing BIRD }{chapter.1}% 3 \BOOKMARK [1][-]{section.1.3}{Running BIRD }{chapter.1}% 4 \BOOKMARK [1][-]{section.1.4}{Privileges }{chapter.1}% 5 \BOOKMARK [0][-]{chapter.2}{About routing tables }{}% 6 \BOOKMARK [1][-]{section.2.1}{Graceful restart }{chapter.2}% 7 \BOOKMARK [0][-]{chapter.3}{Configuration }{}% 8 \BOOKMARK [1][-]{section.3.1}{Introduction }{chapter.3}% 9 \BOOKMARK [1][-]{section.3.2}{Global options }{chapter.3}% 10 \BOOKMARK [1][-]{section.3.3}{Protocol options }{chapter.3}% 11 \BOOKMARK [0][-]{chapter.4}{Remote control }{}% 12 \BOOKMARK [0][-]{chapter.5}{Filters }{}% 13 \BOOKMARK [1][-]{section.5.1}{Introduction }{chapter.5}% 14 \BOOKMARK [1][-]{section.5.2}{Data types }{chapter.5}% 15 \BOOKMARK [1][-]{section.5.3}{Operators }{chapter.5}% 16 \BOOKMARK [1][-]{section.5.4}{Control structures }{chapter.5}% 17 \BOOKMARK [1][-]{section.5.5}{Route attributes }{chapter.5}% 18 \BOOKMARK [1][-]{section.5.6}{Other statements }{chapter.5}% 19 \BOOKMARK [0][-]{chapter.6}{Protocols }{}% 20 \BOOKMARK [1][-]{section.6.1}{Babel }{chapter.6}% 21 \BOOKMARK [1][-]{section.6.2}{BFD }{chapter.6}% 22 \BOOKMARK [1][-]{section.6.3}{BGP }{chapter.6}% 23 \BOOKMARK [1][-]{section.6.4}{Device }{chapter.6}% 24 \BOOKMARK [1][-]{section.6.5}{Direct }{chapter.6}% 25 \BOOKMARK [1][-]{section.6.6}{Kernel }{chapter.6}% 26 \BOOKMARK [1][-]{section.6.7}{OSPF }{chapter.6}% 27 \BOOKMARK [1][-]{section.6.8}{Pipe }{chapter.6}% 28 \BOOKMARK [1][-]{section.6.9}{RAdv }{chapter.6}% 29 \BOOKMARK [1][-]{section.6.10}{RIP }{chapter.6}% 30 \BOOKMARK [1][-]{section.6.11}{Static }{chapter.6}% 31 \BOOKMARK [0][-]{chapter.7}{Conclusions }{}% 32 \BOOKMARK [1][-]{section.7.1}{Future work }{chapter.7}% 33 \BOOKMARK [1][-]{section.7.2}{Getting more help }{chapter.7}% 34 bird-1.6.3/doc/Makefile0000644000103200001440000000134713027054563013644 0ustar feelausersroot-rel=../ dir-name=doc ifneq ($(wildcard ../Rules),) include ../Rules else srcdir=$(shell cd $(root-rel) ; pwd) srcdir_abs=$(srcdir) endif # Force rebuilds .PHONY: prog.sgml bird.sgml docs: progdocs userdocs progdocs: prog.html prog.ps userdocs: bird.html bird.pdf prog.sgml: $(srcdir)/tools/progdoc $(srcdir_abs) %.html: %.sgml ./sgml2html $< %.dvi: %.tex latex $< latex $< %.ps: %.dvi dvips -D600 -ta4 -o $@ $< %.pdf: %.tex pdflatex $< pdflatex $< %.tex: %.sgml ./sgml2latex --output=tex $< %.txt: %.sgml ./sgml2txt $< progspell: prog.sgml sed -f prog-spell.sed prog.spell ispell prog.spell clean: rm -f *.tex *.dvi *.log *.txt *.aux *.toc *.spell rm -f prog.sgml distclean: clean rm -f *.html *.ps bird-1.6.3/doc/prog-4.html0000644000103200001440000003177213027054667014214 0ustar feelausers BIRD Programmer's Documentation: Filters Next Previous Contents

    4. Filters

    4.1 Filters

    You can find sources of the filter language in filter/ directory. File filter/config.Y contains filter grammar and basically translates the source from user into a tree of f_inst structures. These trees are later interpreted using code in filter/filter.c.

    A filter is represented by a tree of f_inst structures, one structure per "instruction". Each f_inst contains code, aux value which is usually the data type this instruction operates on and two generic arguments (a1, a2). Some instructions contain pointer(s) to other instructions in their (a1, a2) fields.

    Filters use a f_val structure for their data. Each f_val contains type and value (types are constants prefixed with T_). Few of the types are special; T_RETURN can be or-ed with a type to indicate that return from a function or from the whole filter should be forced. Important thing about f_val's is that they may be copied with a simple =. That's fine for all currently defined types: strings are read-only (and therefore okay), paths are copied for each operation (okay too).

    Function

    int val_compare (struct f_val v1, struct f_val v2) -- compare two values

    Arguments

    struct f_val v1

    first value

    struct f_val v2

    second value

    Description

    Compares two values and returns -1, 0, 1 on <, =, > or CMP_ERROR on error. Tree module relies on this giving consistent results so that it can be used for building balanced trees.

    Function

    int val_same (struct f_val v1, struct f_val v2) -- compare two values

    Arguments

    struct f_val v1

    first value

    struct f_val v2

    second value

    Description

    Compares two values and returns 1 if they are same and 0 if not. Comparison of values of different types is valid and returns 0.

    Function

    int val_in_range (struct f_val v1, struct f_val v2) -- implement ~ operator

    Arguments

    struct f_val v1

    element

    struct f_val v2

    set

    Description

    Checks if v1 is element (~ operator) of v2.

    Function

    struct f_val interpret (struct f_inst * what)

    Arguments

    struct f_inst * what

    filter to interpret

    Description

    Interpret given tree of filter instructions. This is core function of filter system and does all the hard work.

    Each instruction has 4 fields

    code (which is instruction code), aux (which is extension to instruction code, typically type), arg1 and arg2 - arguments. Depending on instruction, arguments are either integers, or pointers to instruction trees. Common instructions like +, that have two expressions as arguments use TWOARGS macro to get both of them evaluated.

    f_val structures are copied around, so there are no problems with memory managment.

    Function

    int f_run (struct filter * filter, struct rte ** rte, struct ea_list ** tmp_attrs, struct linpool * tmp_pool, int flags) -- run a filter for a route

    Arguments

    struct filter * filter

    filter to run

    struct rte ** rte

    route being filtered, may be modified

    struct ea_list ** tmp_attrs

    temporary attributes, prepared by caller or generated by f_run()

    struct linpool * tmp_pool

    all filter allocations go from this pool

    int flags

    flags

    Description

    If filter needs to modify the route, there are several posibilities. rte might be read-only (with REF_COW flag), in that case rw copy is obtained by rte_cow() and rte is replaced. If rte is originally rw, it may be directly modified (and it is never copied).

    The returned rte may reuse the (possibly cached, cloned) rta, or (if rta was modificied) contains a modified uncached rta, which uses parts allocated from tmp_pool and parts shared from original rta. There is one exception - if rte is rw but contains a cached rta and that is modified, rta in returned rte is also cached.

    Ownership of cached rtas is consistent with rte, i.e. if a new rte is returned, it has its own clone of cached rta (and cached rta of read-only source rte is intact), if rte is modified in place, old cached rta is possibly freed.

    Function

    int filter_same (struct filter * new, struct filter * old) -- compare two filters

    Arguments

    struct filter * new

    first filter to be compared

    struct filter * old

    second filter to be compared, notice that this filter is damaged while comparing.

    Description

    Returns 1 in case filters are same, otherwise 0. If there are underlying bugs, it will rather say 0 on same filters than say 1 on different.

    Function

    struct f_tree * find_tree (struct f_tree * t, struct f_val val)

    Arguments

    struct f_tree * t

    tree to search in

    struct f_val val

    value to find

    Description

    Search for given value in the tree. I relies on fact that sorted tree is populated by f_val structures (that can be compared by val_compare()). In each node of tree, either single value (then t->from==t->to) or range is present.

    Both set matching and switch() { } construction is implemented using this function, thus both are as fast as they can be.

    Function

    struct f_tree * build_tree (struct f_tree * from)

    Arguments

    struct f_tree * from

    degenerated tree (linked by tree->left) to be transformed into form suitable for find_tree()

    Description

    Transforms degenerated tree into balanced tree.

    Function

    int same_tree (struct f_tree * t1, struct f_tree * t2)

    Arguments

    struct f_tree * t1

    first tree to be compared

    struct f_tree * t2

    second one

    Description

    Compares two trees and returns 1 if they are same

    4.2 Trie for prefix sets

    We use a (compressed) trie to represent prefix sets. Every node in the trie represents one prefix (addr/plen) and plen also indicates the index of the bit in the address that is used to branch at the node. If we need to represent just a set of prefixes, it would be simple, but we have to represent a set of prefix patterns. Each prefix pattern consists of ppaddr/pplen and two integers: low and high, and a prefix paddr/plen matches that pattern if the first MIN(plen, pplen) bits of paddr and ppaddr are the same and low <= plen <= high.

    We use a bitmask (accept) to represent accepted prefix lengths at a node. As there are 33 prefix lengths (0..32 for IPv4), but there is just one prefix of zero length in the whole trie so we have zero flag in f_trie (indicating whether the trie accepts prefix 0.0.0.0/0) as a special case, and accept bitmask represents accepted prefix lengths from 1 to 32.

    There are two cases in prefix matching - a match when the length of the prefix is smaller that the length of the prefix pattern, (plen < pplen) and otherwise. The second case is simple - we just walk through the trie and look at every visited node whether that prefix accepts our prefix length (plen). The first case is tricky - we don't want to examine every descendant of a final node, so (when we create the trie) we have to propagate that information from nodes to their ascendants.

    Suppose that we have two masks (M1 and M2) for a node. Mask M1 represents accepted prefix lengths by just the node and mask M2 represents accepted prefix lengths by the node or any of its descendants. Therefore M2 is a bitwise or of M1 and children's M2 and this is a maintained invariant during trie building. Basically, when we want to match a prefix, we walk through the trie, check mask M1 for our prefix length and when we came to final node, we check mask M2.

    There are two differences in the real implementation. First, we use a compressed trie so there is a case that we skip our final node (if it is not in the trie) and we came to node that is either extension of our prefix, or completely out of path In the first case, we also have to check M2.

    Second, we really need not to maintain two separate bitmasks. Checks for mask M1 are always larger than applen and we need just the first pplen bits of mask M2 (if trie compression hadn't been used it would suffice to know just $applen-th bit), so we have to store them together in accept mask - the first pplen bits of mask M2 and then mask M1.

    There are four cases when we walk through a trie:

    - we are in NULL - we are out of path (prefixes are inconsistent) - we are in the wanted (final) node (node length == plen) - we are beyond the end of path (node length > plen) - we are still on path and keep walking (node length < plen)

    The walking code in trie_match_prefix() is structured according to these cases.

    Function

    struct f_trie * f_new_trie (linpool * lp, uint node_size) -- allocates and returns a new empty trie

    Arguments

    linpool * lp

    linear pool to allocate items from

    uint node_size

    node size to be used (f_trie_node and user data)

    Function

    void * trie_add_prefix (struct f_trie * t, ip_addr px, int plen, int l, int h)

    Arguments

    struct f_trie * t

    trie to add to

    ip_addr px

    prefix address

    int plen

    prefix length

    int l

    prefix lower bound

    int h

    prefix upper bound

    Description

    Adds prefix (prefix pattern) px/plen to trie t. l and h are lower and upper bounds on accepted prefix lengths, both inclusive. 0 <= l, h <= 32 (128 for IPv6).

    Returns a pointer to the allocated node. The function can return a pointer to an existing node if px and plen are the same. If px/plen == 0/0 (or ::/0), a pointer to the root node is returned.

    Function

    int trie_match_prefix (struct f_trie * t, ip_addr px, int plen)

    Arguments

    struct f_trie * t

    trie

    ip_addr px

    prefix address

    int plen

    prefix length

    Description

    Tries to find a matching prefix pattern in the trie such that prefix px/plen matches that prefix pattern. Returns 1 if there is such prefix pattern in the trie.

    Function

    int trie_same (struct f_trie * t1, struct f_trie * t2)

    Arguments

    struct f_trie * t1

    first trie to be compared

    struct f_trie * t2

    second one

    Description

    Compares two tries and returns 1 if they are same

    Function

    void trie_format (struct f_trie * t, buffer * buf)

    Arguments

    struct f_trie * t

    trie to be formatted

    buffer * buf

    destination buffer

    Description

    Prints the trie to the supplied buffer.

    Next Previous Contents bird-1.6.3/doc/prog-5.html0000644000103200001440000017670313027054667014221 0ustar feelausers BIRD Programmer's Documentation: Protocols Next Previous Contents

    5. Protocols

    5.1 The Babel protocol

    Babel (RFC6126) is a loop-avoiding distance-vector routing protocol that is robust and efficient both in ordinary wired networks and in wireless mesh networks.

    The Babel protocol keeps state for each neighbour in a babel_neighbor struct, tracking received Hello and I Heard You (IHU) messages. A babel_interface struct keeps hello and update times for each interface, and a separate hello seqno is maintained for each interface.

    For each prefix, Babel keeps track of both the possible routes (with next hop and router IDs), as well as the feasibility distance for each prefix and router id. The prefix itself is tracked in a babel_entry struct, while the possible routes for the prefix are tracked as babel_route entries and the feasibility distance is maintained through babel_source structures.

    The main route selection is done in babel_select_route(). This is called when an entry is updated by receiving updates from the network or when modified by internal timers. It performs feasibility checks on the available routes for the prefix and selects the one with the lowest metric to be announced to the core.

    Function

    void babel_announce_rte (struct babel_proto * p, struct babel_entry * e) -- announce selected route to the core

    Arguments

    struct babel_proto * p

    Babel protocol instance

    struct babel_entry * e

    Babel route entry to announce

    Description

    This function announces a Babel entry to the core if it has a selected incoming path, and retracts it otherwise. If the selected entry has infinite metric, the route is announced as unreachable.

    Function

    void babel_select_route (struct babel_entry * e) -- select best route for given route entry

    Arguments

    struct babel_entry * e

    Babel entry to select the best route for

    Description

    Select the best feasible route for a given prefix among the routes received from peers, and propagate it to the nest. This just selects the feasible route with the lowest metric.

    If no feasible route is available for a prefix that previously had a route selected, a seqno request is sent to try to get a valid route. In the meantime, the route is marked as infeasible in the nest (to blackhole packets going to it, as per the RFC).

    If no feasible route is available, and no previous route is selected, the route is removed from the nest entirely.

    Function

    void babel_send_update (struct babel_iface * ifa, bird_clock_t changed) -- send route table updates

    Arguments

    struct babel_iface * ifa

    Interface to transmit on

    bird_clock_t changed

    Only send entries changed since this time

    Description

    This function produces update TLVs for all entries changed since the time indicated by the changed parameter and queues them for transmission on the selected interface. During the process, the feasibility distance for each transmitted entry is updated.

    Function

    void babel_handle_update (union babel_msg * m, struct babel_iface * ifa) -- handle incoming route updates

    Arguments

    union babel_msg * m

    Incoming update TLV

    struct babel_iface * ifa

    Interface the update was received on

    Description

    This function is called as a handler for update TLVs and handles the updating and maintenance of route entries in Babel's internal routing cache. The handling follows the actions described in the Babel RFC, and at the end of each update handling, babel_select_route() is called on the affected entry to optionally update the selected routes and propagate them to the core.

    Function

    void babel_iface_timer (timer * t) -- Babel interface timer handler

    Arguments

    timer * t

    Timer

    Description

    This function is called by the per-interface timer and triggers sending of periodic Hello's and both triggered and periodic updates. Periodic Hello's and updates are simply handled by setting the next_{hello,regular} variables on the interface, and triggering an update (and resetting the variable) whenever 'now' exceeds that value.

    For triggered updates, babel_trigger_iface_update() will set the want_triggered field on the interface to a timestamp value. If this is set (and the next_triggered time has passed; this is a rate limiting mechanism), babel_send_update() will be called with this timestamp as the second parameter. This causes updates to be send consisting of only the routes that have changed since the time saved in want_triggered.

    Mostly when an update is triggered, the route being modified will be set to the value of 'now' at the time of the trigger; the >= comparison for selecting which routes to send in the update will make sure this is included.

    Function

    void babel_timer (timer * t) -- global timer hook

    Arguments

    timer * t

    Timer

    Description

    This function is called by the global protocol instance timer and handles expiration of routes and neighbours as well as pruning of the seqno request cache.

    Function

    uint babel_write_queue (struct babel_iface * ifa, list * queue) -- Write a TLV queue to a transmission buffer

    Arguments

    struct babel_iface * ifa

    Interface holding the transmission buffer

    list * queue

    TLV queue to write (containing internal-format TLVs)

    Description

    This function writes a packet to the interface transmission buffer with as many TLVs from the queue as will fit in the buffer. It returns the number of bytes written (NOT counting the packet header). The function is called by babel_send_queue() and babel_send_unicast() to construct packets for transmission, and uses per-TLV helper functions to convert the internal-format TLVs to their wire representations.

    The TLVs in the queue are freed after they are written to the buffer.

    Function

    void babel_send_unicast (union babel_msg * msg, struct babel_iface * ifa, ip_addr dest) -- send a single TLV via unicast to a destination

    Arguments

    union babel_msg * msg

    TLV to send

    struct babel_iface * ifa

    Interface to send via

    ip_addr dest

    Destination of the TLV

    Description

    This function is used to send a single TLV via unicast to a designated receiver. This is used for replying to certain incoming requests, and for sending unicast requests to refresh routes before they expire.

    Function

    void babel_enqueue (union babel_msg * msg, struct babel_iface * ifa) -- enqueue a TLV for transmission on an interface

    Arguments

    union babel_msg * msg

    TLV to enqueue (in internal TLV format)

    struct babel_iface * ifa

    Interface to enqueue to

    Description

    This function is called to enqueue a TLV for subsequent transmission on an interface. The transmission event is triggered whenever a TLV is enqueued; this ensures that TLVs will be transmitted in a timely manner, but that TLVs which are enqueued in rapid succession can be transmitted together in one packet.

    Function

    void babel_process_packet (struct babel_pkt_header * pkt, int len, ip_addr saddr, struct babel_iface * ifa) -- process incoming data packet

    Arguments

    struct babel_pkt_header * pkt

    Pointer to the packet data

    int len

    Length of received packet

    ip_addr saddr

    Address of packet sender

    struct babel_iface * ifa

    Interface packet was received on.

    Description

    This function is the main processing hook of incoming Babel packets. It checks that the packet header is well-formed, then processes the TLVs contained in the packet. This is done in two passes: First all TLVs are parsed into the internal TLV format. If a TLV parser fails, processing of the rest of the packet is aborted.

    After the parsing step, the TLV handlers are called for each parsed TLV in order.

    5.2 Bidirectional Forwarding Detection

    The BFD protocol is implemented in three files: bfd.c containing the protocol logic and the protocol glue with BIRD core, packets.c handling BFD packet processing, RX, TX and protocol sockets. io.c then contains generic code for the event loop, threads and event sources (sockets, microsecond timers). This generic code will be merged to the main BIRD I/O code in the future.

    The BFD implementation uses a separate thread with an internal event loop for handling the protocol logic, which requires high-res and low-latency timing, so it is not affected by the rest of BIRD, which has several low-granularity hooks in the main loop, uses second-based timers and cannot offer good latency. The core of BFD protocol (the code related to BFD sessions, interfaces and packets) runs in the BFD thread, while the rest (the code related to BFD requests, BFD neighbors and the protocol glue) runs in the main thread.

    BFD sessions are represented by structure bfd_session that contains a state related to the session and two timers (TX timer for periodic packets and hold timer for session timeout). These sessions are allocated from session_slab and are accessible by two hash tables, session_hash_id (by session ID) and session_hash_ip (by IP addresses of neighbors). Slab and both hashes are in the main protocol structure bfd_proto. The protocol logic related to BFD sessions is implemented in internal functions bfd_session_*(), which are expected to be called from the context of BFD thread, and external functions bfd_add_session(), bfd_remove_session() and bfd_reconfigure_session(), which form an interface to the BFD core for the rest and are expected to be called from the context of main thread.

    Each BFD session has an associated BFD interface, represented by structure bfd_iface. A BFD interface contains a socket used for TX (the one for RX is shared in bfd_proto), an interface configuration and reference counter. Compared to interface structures of other protocols, these structures are not created and removed based on interface notification events, but according to the needs of BFD sessions. When a new session is created, it requests a proper BFD interface by function bfd_get_iface(), which either finds an existing one in iface_list (from bfd_proto) or allocates a new one. When a session is removed, an associated iface is discharged by bfd_free_iface().

    BFD requests are the external API for the other protocols. When a protocol wants a BFD session, it calls bfd_request_session(), which creates a structure bfd_request containing approprite information and an notify hook. This structure is a resource associated with the caller's resource pool. When a BFD protocol is available, a BFD request is submitted to the protocol, an appropriate BFD session is found or created and the request is attached to the session. When a session changes state, all attached requests (and related protocols) are notified. Note that BFD requests do not depend on BFD protocol running. When the BFD protocol is stopped or removed (or not available from beginning), related BFD requests are stored in bfd_wait_list, where waits for a new protocol.

    BFD neighbors are just a way to statically configure BFD sessions without requests from other protocol. Structures bfd_neighbor are part of BFD configuration (like static routes in the static protocol). BFD neighbors are handled by BFD protocol like it is a BFD client -- when a BFD neighbor is ready, the protocol just creates a BFD request like any other protocol.

    The protocol uses a new generic event loop (structure birdloop) from io.c, which supports sockets, timers and events like the main loop. Timers (structure timer2) are new microsecond based timers, while sockets and events are the same. A birdloop is associated with a thread (field thread) in which event hooks are executed. Most functions for setting event sources (like sk_start() or tm2_start()) must be called from the context of that thread. Birdloop allows to temporarily acquire the context of that thread for the main thread by calling birdloop_enter() and then birdloop_leave(), which also ensures mutual exclusion with all event hooks. Note that resources associated with a birdloop (like timers) should be attached to the independent resource pool, detached from the main resource tree.

    There are two kinds of interaction between the BFD core (running in the BFD thread) and the rest of BFD (running in the main thread). The first kind are configuration calls from main thread to the BFD thread (like bfd_add_session()). These calls are synchronous and use birdloop_enter() mechanism for mutual exclusion. The second kind is a notification about session changes from the BFD thread to the main thread. This is done in an asynchronous way, sesions with pending notifications are linked (in the BFD thread) to notify_list in bfd_proto, and then bfd_notify_hook() in the main thread is activated using bfd_notify_kick() and a pipe. The hook then processes scheduled sessions and calls hooks from associated BFD requests. This notify_list (and state fields in structure bfd_session) is protected by a spinlock in bfd_proto and functions bfd_lock_sessions() / bfd_unlock_sessions().

    There are few data races (accessing p->p.debug from TRACE() from the BFD thread and accessing some some private fields of bfd_session from bfd_show_sessions() from the main thread, but these are harmless (i hope).

    TODO: document functions and access restrictions for fields in BFD structures.

    Supported standards: - RFC 5880 - main BFD standard - RFC 5881 - BFD for IP links - RFC 5882 - generic application of BFD - RFC 5883 - BFD for multihop paths

    5.3 Border Gateway Protocol

    The BGP protocol is implemented in three parts: bgp.c which takes care of the connection and most of the interface with BIRD core, packets.c handling both incoming and outgoing BGP packets and attrs.c containing functions for manipulation with BGP attribute lists.

    As opposed to the other existing routing daemons, BIRD has a sophisticated core architecture which is able to keep all the information needed by BGP in the primary routing table, therefore no complex data structures like a central BGP table are needed. This increases memory footprint of a BGP router with many connections, but not too much and, which is more important, it makes BGP much easier to implement.

    Each instance of BGP (corresponding to a single BGP peer) is described by a bgp_proto structure to which are attached individual connections represented by bgp_connection (usually, there exists only one connection, but during BGP session setup, there can be more of them). The connections are handled according to the BGP state machine defined in the RFC with all the timers and all the parameters configurable.

    In incoming direction, we listen on the connection's socket and each time we receive some input, we pass it to bgp_rx(). It decodes packet headers and the markers and passes complete packets to bgp_rx_packet() which distributes the packet according to its type.

    In outgoing direction, we gather all the routing updates and sort them to buckets (bgp_bucket) according to their attributes (we keep a hash table for fast comparison of rta's and a fib which helps us to find if we already have another route for the same destination queued for sending, so that we can replace it with the new one immediately instead of sending both updates). There also exists a special bucket holding all the route withdrawals which cannot be queued anywhere else as they don't have any attributes. If we have any packet to send (due to either new routes or the connection tracking code wanting to send a Open, Keepalive or Notification message), we call bgp_schedule_packet() which sets the corresponding bit in a packet_to_send bit field in bgp_conn and as soon as the transmit socket buffer becomes empty, we call bgp_fire_tx(). It inspects state of all the packet type bits and calls the corresponding bgp_create_xx() functions, eventually rescheduling the same packet type if we have more data of the same type to send.

    The processing of attributes consists of two functions: bgp_decode_attrs() for checking of the attribute blocks and translating them to the language of BIRD's extended attributes and bgp_encode_attrs() which does the converse. Both functions are built around a bgp_attr_table array describing all important characteristics of all known attributes. Unknown transitive attributes are attached to the route as EAF_TYPE_OPAQUE byte streams.

    BGP protocol implements graceful restart in both restarting (local restart) and receiving (neighbor restart) roles. The first is handled mostly by the graceful restart code in the nest, BGP protocol just handles capabilities, sets gr_wait and locks graceful restart until end-of-RIB mark is received. The second is implemented by internal restart of the BGP state to BS_IDLE and protocol state to PS_START, but keeping the protocol up from the core point of view and therefore maintaining received routes. Routing table refresh cycle (rt_refresh_begin(), rt_refresh_end()) is used for removing stale routes after reestablishment of BGP session during graceful restart.

    Function

    int bgp_open (struct bgp_proto * p) -- open a BGP instance

    Arguments

    struct bgp_proto * p

    BGP instance

    Description

    This function allocates and configures shared BGP resources. Should be called as the last step during initialization (when lock is acquired and neighbor is ready). When error, state changed to PS_DOWN, -1 is returned and caller should return immediately.

    Function

    void bgp_close (struct bgp_proto * p, int apply_md5) -- close a BGP instance

    Arguments

    struct bgp_proto * p

    BGP instance

    int apply_md5

    0 to disable unsetting MD5 auth

    Description

    This function frees and deconfigures shared BGP resources. apply_md5 is set to 0 when bgp_close is called as a cleanup from failed bgp_open().

    Function

    void bgp_start_timer (timer * t, int value) -- start a BGP timer

    Arguments

    timer * t

    timer

    int value

    time to fire (0 to disable the timer)

    Description

    This functions calls tm_start() on t with time value and the amount of randomization suggested by the BGP standard. Please use it for all BGP timers.

    Function

    void bgp_close_conn (struct bgp_conn * conn) -- close a BGP connection

    Arguments

    struct bgp_conn * conn

    connection to close

    Description

    This function takes a connection described by the bgp_conn structure, closes its socket and frees all resources associated with it.

    Function

    void bgp_update_startup_delay (struct bgp_proto * p) -- update a startup delay

    Arguments

    struct bgp_proto * p

    BGP instance

    Description

    This function updates a startup delay that is used to postpone next BGP connect. It also handles disable_after_error and might stop BGP instance when error happened and disable_after_error is on.

    It should be called when BGP protocol error happened.

    Function

    void bgp_handle_graceful_restart (struct bgp_proto * p) -- handle detected BGP graceful restart

    Arguments

    struct bgp_proto * p

    BGP instance

    Description

    This function is called when a BGP graceful restart of the neighbor is detected (when the TCP connection fails or when a new TCP connection appears). The function activates processing of the restart - starts routing table refresh cycle and activates BGP restart timer. The protocol state goes back to PS_START, but changing BGP state back to BS_IDLE is left for the caller.

    Function

    void bgp_graceful_restart_done (struct bgp_proto * p) -- finish active BGP graceful restart

    Arguments

    struct bgp_proto * p

    BGP instance

    Description

    This function is called when the active BGP graceful restart of the neighbor should be finished - either successfully (the neighbor sends all paths and reports end-of-RIB on the new session) or unsuccessfully (the neighbor does not support BGP graceful restart on the new session). The function ends routing table refresh cycle and stops BGP restart timer.

    Function

    void bgp_graceful_restart_timeout (timer * t) -- timeout of graceful restart 'restart timer'

    Arguments

    timer * t

    timer

    Description

    This function is a timeout hook for gr_timer, implementing BGP restart time limit for reestablisment of the BGP session after the graceful restart. When fired, we just proceed with the usual protocol restart.

    Function

    void bgp_refresh_begin (struct bgp_proto * p) -- start incoming enhanced route refresh sequence

    Arguments

    struct bgp_proto * p

    BGP instance

    Description

    This function is called when an incoming enhanced route refresh sequence is started by the neighbor, demarcated by the BoRR packet. The function updates the load state and starts the routing table refresh cycle. Note that graceful restart also uses routing table refresh cycle, but RFC 7313 and load states ensure that these two sequences do not overlap.

    Function

    void bgp_refresh_end (struct bgp_proto * p) -- finish incoming enhanced route refresh sequence

    Arguments

    struct bgp_proto * p

    BGP instance

    Description

    This function is called when an incoming enhanced route refresh sequence is finished by the neighbor, demarcated by the EoRR packet. The function updates the load state and ends the routing table refresh cycle. Routes not received during the sequence are removed by the nest.

    Function

    void bgp_connect (struct bgp_proto * p) -- initiate an outgoing connection

    Arguments

    struct bgp_proto * p

    BGP instance

    Description

    The bgp_connect() function creates a new bgp_conn and initiates a TCP connection to the peer. The rest of connection setup is governed by the BGP state machine as described in the standard.

    Function

    struct bgp_proto * bgp_find_proto (sock * sk) -- find existing proto for incoming connection

    Arguments

    sock * sk

    TCP socket

    Function

    int bgp_incoming_connection (sock * sk, uint dummy UNUSED) -- handle an incoming connection

    Arguments

    sock * sk

    TCP socket

    uint dummy UNUSED

    -- undescribed --

    Description

    This function serves as a socket hook for accepting of new BGP connections. It searches a BGP instance corresponding to the peer which has connected and if such an instance exists, it creates a bgp_conn structure, attaches it to the instance and either sends an Open message or (if there already is an active connection) it closes the new connection by sending a Notification message.

    Function

    void bgp_error (struct bgp_conn * c, unsigned code, unsigned subcode, byte * data, int len) -- report a protocol error

    Arguments

    struct bgp_conn * c

    connection

    unsigned code

    error code (according to the RFC)

    unsigned subcode

    error sub-code

    byte * data

    data to be passed in the Notification message

    int len

    length of the data

    Description

    bgp_error() sends a notification packet to tell the other side that a protocol error has occurred (including the data considered erroneous if possible) and closes the connection.

    Function

    void bgp_store_error (struct bgp_proto * p, struct bgp_conn * c, u8 class, u32 code) -- store last error for status report

    Arguments

    struct bgp_proto * p

    BGP instance

    struct bgp_conn * c

    connection

    u8 class

    error class (BE_xxx constants)

    u32 code

    error code (class specific)

    Description

    bgp_store_error() decides whether given error is interesting enough and store that error to last_error variables of p

    Function

    int bgp_fire_tx (struct bgp_conn * conn) -- transmit packets

    Arguments

    struct bgp_conn * conn

    connection

    Description

    Whenever the transmit buffers of the underlying TCP connection are free and we have any packets queued for sending, the socket functions call bgp_fire_tx() which takes care of selecting the highest priority packet queued (Notification > Keepalive > Open > Update), assembling its header and body and sending it to the connection.

    Function

    void bgp_schedule_packet (struct bgp_conn * conn, int type) -- schedule a packet for transmission

    Arguments

    struct bgp_conn * conn

    connection

    int type

    packet type

    Description

    Schedule a packet of type type to be sent as soon as possible.

    Function

    const char * bgp_error_dsc (unsigned code, unsigned subcode) -- return BGP error description

    Arguments

    unsigned code

    BGP error code

    unsigned subcode

    BGP error subcode

    Description

    bgp_error_dsc() returns error description for BGP errors which might be static string or given temporary buffer.

    Function

    void bgp_rx_packet (struct bgp_conn * conn, byte * pkt, unsigned len) -- handle a received packet

    Arguments

    struct bgp_conn * conn

    BGP connection

    byte * pkt

    start of the packet

    unsigned len

    packet size

    Description

    bgp_rx_packet() takes a newly received packet and calls the corresponding packet handler according to the packet type.

    Function

    int bgp_rx (sock * sk, uint size) -- handle received data

    Arguments

    sock * sk

    socket

    uint size

    amount of data received

    Description

    bgp_rx() is called by the socket layer whenever new data arrive from the underlying TCP connection. It assembles the data fragments to packets, checks their headers and framing and passes complete packets to bgp_rx_packet().

    Function

    uint bgp_encode_attrs (struct bgp_proto * p, byte * w, ea_list * attrs, int remains) -- encode BGP attributes

    Arguments

    struct bgp_proto * p

    BGP instance

    byte * w

    buffer

    ea_list * attrs

    a list of extended attributes

    int remains

    remaining space in the buffer

    Description

    The bgp_encode_attrs() function takes a list of extended attributes and converts it to its BGP representation (a part of an Update message).

    Result

    Length of the attribute block generated or -1 if not enough space.

    Function

    struct rta * bgp_decode_attrs (struct bgp_conn * conn, byte * attr, uint len, struct linpool * pool, int mandatory) -- check and decode BGP attributes

    Arguments

    struct bgp_conn * conn

    connection

    byte * attr

    start of attribute block

    uint len

    length of attribute block

    struct linpool * pool

    linear pool to make all the allocations in

    int mandatory

    1 iff presence of mandatory attributes has to be checked

    Description

    This function takes a BGP attribute block (a part of an Update message), checks its consistency and converts it to a list of BIRD route attributes represented by a rta.

    5.4 Open Shortest Path First (OSPF)

    The OSPF protocol is quite complicated and its complex implemenation is split to many files. In ospf.c, you will find mainly the interface for communication with the core (e.g., reconfiguration hooks, shutdown and initialisation and so on). File iface.c contains the interface state machine and functions for allocation and deallocation of OSPF's interface data structures. Source neighbor.c includes the neighbor state machine and functions for election of Designated Router and Backup Designated router. In packet.c, you will find various functions for sending and receiving generic OSPF packets. There are also routines for authentication and checksumming. In hello.c, there are routines for sending and receiving of hello packets as well as functions for maintaining wait times and the inactivity timer. Files lsreq.c, lsack.c, dbdes.c contain functions for sending and receiving of link-state requests, link-state acknowledgements and database descriptions respectively. In lsupd.c, there are functions for sending and receiving of link-state updates and also the flooding algorithm. Source topology.c is a place where routines for searching LSAs in the link-state database, adding and deleting them reside, there also are functions for originating of various types of LSAs (router LSA, net LSA, external LSA). File rt.c contains routines for calculating the routing table. lsalib.c is a set of various functions for working with the LSAs (endianity conversions, calculation of checksum etc.).

    One instance of the protocol is able to hold LSA databases for multiple OSPF areas, to exchange routing information between multiple neighbors and to calculate the routing tables. The core structure is ospf_proto to which multiple ospf_area and ospf_iface structures are connected. ospf_proto is also connected to top_hash_graph which is a dynamic hashing structure that describes the link-state database. It allows fast search, addition and deletion. Each LSA is kept in two pieces: header and body. Both of them are kept in the endianity of the CPU.

    In OSPFv2 specification, it is implied that there is one IP prefix for each physical network/interface (unless it is an ptp link). But in modern systems, there might be more independent IP prefixes associated with an interface. To handle this situation, we have one ospf_iface for each active IP prefix (instead for each active iface); This behaves like virtual interface for the purpose of OSPF. If we receive packet, we associate it with a proper virtual interface mainly according to its source address.

    OSPF keeps one socket per ospf_iface. This allows us (compared to one socket approach) to evade problems with a limit of multicast groups per socket and with sending multicast packets to appropriate interface in a portable way. The socket is associated with underlying physical iface and should not receive packets received on other ifaces (unfortunately, this is not true on BSD). Generally, one packet can be received by more sockets (for example, if there are more ospf_iface on one physical iface), therefore we explicitly filter received packets according to src/dst IP address and received iface.

    Vlinks are implemented using particularly degenerate form of ospf_iface, which has several exceptions: it does not have its iface or socket (it copies these from 'parent' ospf_iface) and it is present in iface list even when down (it is not freed in ospf_iface_down()).

    The heart beat of ospf is ospf_disp(). It is called at regular intervals (ospf_proto->tick). It is responsible for aging and flushing of LSAs in the database, updating topology information in LSAs and for routing table calculation.

    To every ospf_iface, we connect one or more ospf_neighbor's -- a structure containing many timers and queues for building adjacency and for exchange of routing messages.

    BIRD's OSPF implementation respects RFC2328 in every detail, but some of internal algorithms do differ. The RFC recommends making a snapshot of the link-state database when a new adjacency is forming and sending the database description packets based on the information in this snapshot. The database can be quite large in some networks, so rather we walk through a slist structure which allows us to continue even if the actual LSA we were working with is deleted. New LSAs are added at the tail of this slist.

    We also do not keep a separate OSPF routing table, because the core helps us by being able to recognize when a route is updated to an identical one and it suppresses the update automatically. Due to this, we can flush all the routes we have recalculated and also those we have deleted to the core's routing table and the core will take care of the rest. This simplifies the process and conserves memory.

    Supported standards: - RFC 2328 - main OSPFv2 standard - RFC 5340 - main OSPFv3 standard - RFC 3101 - OSPFv2 NSSA areas - RFC 6549 - OSPFv2 multi-instance extensions - RFC 6987 - OSPF stub router advertisement

    Function

    void ospf_disp (timer * timer) -- invokes routing table calculation, aging and also area_disp()

    Arguments

    timer * timer

    timer usually called every ospf_proto->tick second, timer->data point to ospf_proto

    Function

    int ospf_import_control (struct proto * P, rte ** new, ea_list ** attrs, struct linpool * pool) -- accept or reject new route from nest's routing table

    Arguments

    struct proto * P

    OSPF protocol instance

    rte ** new

    the new route

    ea_list ** attrs

    list of attributes

    struct linpool * pool

    pool for allocation of attributes

    Description

    Its quite simple. It does not accept our own routes and leaves the decision on import to the filters.

    Function

    int ospf_shutdown (struct proto * P) -- Finish of OSPF instance

    Arguments

    struct proto * P

    OSPF protocol instance

    Description

    RFC does not define any action that should be taken before router shutdown. To make my neighbors react as fast as possible, I send them hello packet with empty neighbor list. They should start their neighbor state machine with event NEIGHBOR_1WAY.

    Function

    int ospf_reconfigure (struct proto * P, struct proto_config * c) -- reconfiguration hook

    Arguments

    struct proto * P

    current instance of protocol (with old configuration)

    struct proto_config * c

    new configuration requested by user

    Description

    This hook tries to be a little bit intelligent. Instance of OSPF will survive change of many constants like hello interval, password change, addition or deletion of some neighbor on nonbroadcast network, cost of interface, etc.

    Function

    struct top_hash_entry * ospf_install_lsa (struct ospf_proto * p, struct ospf_lsa_header * lsa, u32 type, u32 domain, void * body) -- install new LSA into database

    Arguments

    struct ospf_proto * p

    OSPF protocol instance

    struct ospf_lsa_header * lsa

    LSA header

    u32 type

    type of LSA

    u32 domain

    domain of LSA

    void * body

    pointer to LSA body

    Description

    This function ensures installing new LSA received in LS update into LSA database. Old instance is replaced. Several actions are taken to detect if new routing table calculation is necessary. This is described in 13.2 of RFC 2328. This function is for received LSA only, locally originated LSAs are installed by ospf_originate_lsa().

    The LSA body in body is expected to be mb_allocated by the caller and its ownership is transferred to the LSA entry structure.

    Function

    void ospf_advance_lsa (struct ospf_proto * p, struct top_hash_entry * en, struct ospf_lsa_header * lsa, u32 type, u32 domain, void * body) -- handle received unexpected self-originated LSA

    Arguments

    struct ospf_proto * p

    OSPF protocol instance

    struct top_hash_entry * en

    current LSA entry or NULL

    struct ospf_lsa_header * lsa

    new LSA header

    u32 type

    type of LSA

    u32 domain

    domain of LSA

    void * body

    pointer to LSA body

    Description

    This function handles received unexpected self-originated LSA (lsa, body) by either advancing sequence number of the local LSA instance (en) and propagating it, or installing the received LSA and immediately flushing it (if there is no local LSA; i.e., en is NULL or MaxAge).

    The LSA body in body is expected to be mb_allocated by the caller and its ownership is transferred to the LSA entry structure or it is freed.

    Function

    struct top_hash_entry * ospf_originate_lsa (struct ospf_proto * p, struct ospf_new_lsa * lsa) -- originate new LSA

    Arguments

    struct ospf_proto * p

    OSPF protocol instance

    struct ospf_new_lsa * lsa

    New LSA specification

    Description

    This function prepares a new LSA, installs it into the LSA database and floods it. If the new LSA cannot be originated now (because the old instance was originated within MinLSInterval, or because the LSA seqnum is currently wrapping), the origination is instead scheduled for later. If the new LSA is equivalent to the current LSA, the origination is skipped. In all cases, the corresponding LSA entry is returned. The new LSA is based on the LSA specification (lsa) and the LSA body from lsab buffer of p, which is emptied after the call. The opposite of this function is ospf_flush_lsa().

    Function

    void ospf_flush_lsa (struct ospf_proto * p, struct top_hash_entry * en) -- flush LSA from OSPF domain

    Arguments

    struct ospf_proto * p

    OSPF protocol instance

    struct top_hash_entry * en

    LSA entry to flush

    Description

    This function flushes en from the OSPF domain by setting its age to LSA_MAXAGE and flooding it. That also triggers subsequent events in LSA lifecycle leading to removal of the LSA from the LSA database (e.g. the LSA content is freed when flushing is acknowledged by neighbors). The function does nothing if the LSA is already being flushed. LSA entries are not immediately removed when being flushed, the caller may assume that en still exists after the call. The function is the opposite of ospf_originate_lsa() and is supposed to do the right thing even in cases of postponed origination.

    Function

    void ospf_update_lsadb (struct ospf_proto * p) -- update LSA database

    Arguments

    struct ospf_proto * p

    OSPF protocol instance

    Description

    This function is periodicaly invoked from ospf_disp(). It does some periodic or postponed processing related to LSA entries. It originates postponed LSAs scheduled by ospf_originate_lsa(), It continues in flushing processes started by ospf_flush_lsa(). It also periodically refreshs locally originated LSAs -- when the current instance is older LSREFRESHTIME, a new instance is originated. Finally, it also ages stored LSAs and flushes ones that reached LSA_MAXAGE.

    The RFC 2328 says that a router should periodically check checksums of all stored LSAs to detect hardware problems. This is not implemented.

    Function

    void ospf_originate_ext_lsa (struct ospf_proto * p, struct ospf_area * oa, ort * nf, u8 mode, u32 metric, u32 ebit, ip_addr fwaddr, u32 tag, int pbit) -- new route received from nest and filters

    Arguments

    struct ospf_proto * p

    OSPF protocol instance

    struct ospf_area * oa

    ospf_area for which LSA is originated

    ort * nf

    network prefix and mask

    u8 mode

    the mode of the LSA (LSA_M_EXPORT or LSA_M_RTCALC)

    u32 metric

    the metric of a route

    u32 ebit

    E-bit for route metric (bool)

    ip_addr fwaddr

    the forwarding address

    u32 tag

    the route tag

    int pbit

    P-bit for NSSA LSAs (bool), ignored for external LSAs

    Description

    If I receive a message that new route is installed, I try to originate an external LSA. If oa is an NSSA area, NSSA-LSA is originated instead. oa should not be a stub area. src does not specify whether the LSA is external or NSSA, but it specifies the source of origination - the export from ospf_rt_notify(), or the NSSA-EXT translation.

    Function

    struct top_graph * ospf_top_new (struct ospf_proto *p UNUSED4 UNUSED6, pool * pool) -- allocated new topology database

    Arguments

    struct ospf_proto *p UNUSED4 UNUSED6

    -- undescribed --

    pool * pool

    pool for allocation

    Description

    This dynamically hashed structure is used for keeping LSAs. Mainly it is used for the LSA database of the OSPF protocol, but also for LSA retransmission and request lists of OSPF neighbors.

    Function

    void ospf_neigh_chstate (struct ospf_neighbor * n, u8 state) -- handles changes related to new or lod state of neighbor

    Arguments

    struct ospf_neighbor * n

    OSPF neighbor

    u8 state

    new state

    Description

    Many actions have to be taken acording to a change of state of a neighbor. It starts rxmt timers, call interface state machine etc.

    Function

    void ospf_neigh_sm (struct ospf_neighbor * n, int event) -- ospf neighbor state machine

    Arguments

    struct ospf_neighbor * n

    neighor

    int event

    actual event

    Description

    This part implements the neighbor state machine as described in 10.3 of RFC 2328. The only difference is that state NEIGHBOR_ATTEMPT is not used. We discover neighbors on nonbroadcast networks in the same way as on broadcast networks. The only difference is in sending hello packets. These are sent to IPs listed in ospf_iface->nbma_list .

    Function

    void ospf_dr_election (struct ospf_iface * ifa) -- (Backup) Designed Router election

    Arguments

    struct ospf_iface * ifa

    actual interface

    Description

    When the wait timer fires, it is time to elect (Backup) Designated Router. Structure describing me is added to this list so every electing router has the same list. Backup Designated Router is elected before Designated Router. This process is described in 9.4 of RFC 2328. The function is supposed to be called only from ospf_iface_sm() as a part of the interface state machine.

    Function

    void ospf_iface_chstate (struct ospf_iface * ifa, u8 state) -- handle changes of interface state

    Arguments

    struct ospf_iface * ifa

    OSPF interface

    u8 state

    new state

    Description

    Many actions must be taken according to interface state changes. New network LSAs must be originated, flushed, new multicast sockets to listen for messages for ALLDROUTERS have to be opened, etc.

    Function

    void ospf_iface_sm (struct ospf_iface * ifa, int event) -- OSPF interface state machine

    Arguments

    struct ospf_iface * ifa

    OSPF interface

    int event

    event comming to state machine

    Description

    This fully respects 9.3 of RFC 2328 except we have slightly different handling of DOWN and LOOP state. We remove intefaces that are DOWN. DOWN state is used when an interface is waiting for a lock. LOOP state is used when an interface does not have a link.

    Function

    int ospf_rx_hook (sock * sk, uint len)

    Arguments

    sock * sk

    socket we received the packet.

    uint len

    size of the packet

    Description

    This is the entry point for messages from neighbors. Many checks (like authentication, checksums, size) are done before the packet is passed to non generic functions.

    Function

    int lsa_validate (struct ospf_lsa_header * lsa, u32 lsa_type, int ospf2, void * body) -- check whether given LSA is valid

    Arguments

    struct ospf_lsa_header * lsa

    LSA header

    u32 lsa_type

    one of LSA_T_xxx

    int ospf2

    true means OSPF version 2, false means OSPF version 3

    void * body

    pointer to LSA body

    Description

    Checks internal structure of given LSA body (minimal length, consistency). Returns true if valid.

    Function

    void ospf_send_dbdes (struct ospf_proto * p, struct ospf_neighbor * n) -- transmit database description packet

    Arguments

    struct ospf_proto * p

    OSPF protocol instance

    struct ospf_neighbor * n

    neighbor

    Description

    Sending of a database description packet is described in 10.8 of RFC 2328. Reception of each packet is acknowledged in the sequence number of another. When I send a packet to a neighbor I keep a copy in a buffer. If the neighbor does not reply, I don't create a new packet but just send the content of the buffer.

    Function

    void ospf_rt_spf (struct ospf_proto * p) -- calculate internal routes

    Arguments

    struct ospf_proto * p

    OSPF protocol instance

    Description

    Calculation of internal paths in an area is described in 16.1 of RFC 2328. It's based on Dijkstra's shortest path tree algorithms. This function is invoked from ospf_disp().

    5.5 Pipe

    The Pipe protocol is very simple. It just connects to two routing tables using proto_add_announce_hook() and whenever it receives a rt_notify() about a change in one of the tables, it converts it to a rte_update() in the other one.

    To avoid pipe loops, Pipe keeps a `being updated' flag in each routing table.

    A pipe has two announce hooks, the first connected to the main table, the second connected to the peer table. When a new route is announced on the main table, it gets checked by an export filter in ahook 1, and, after that, it is announced to the peer table via rte_update(), an import filter in ahook 2 is called. When a new route is announced in the peer table, an export filter in ahook2 and an import filter in ahook 1 are used. Oviously, there is no need in filtering the same route twice, so both import filters are set to accept, while user configured 'import' and 'export' filters are used as export filters in ahooks 2 and 1. Route limits are handled similarly, but on the import side of ahooks.

    5.6 Routing Information Protocol (RIP)

    The RIP protocol is implemented in two files: rip.c containing the protocol logic, route management and the protocol glue with BIRD core, and packets.c handling RIP packet processing, RX, TX and protocol sockets.

    Each instance of RIP is described by a structure rip_proto, which contains an internal RIP routing table, a list of protocol interfaces and the main timer responsible for RIP routing table cleanup.

    RIP internal routing table contains incoming and outgoing routes. For each network (represented by structure rip_entry) there is one outgoing route stored directly in rip_entry and an one-way linked list of incoming routes (structures rip_rte). The list contains incoming routes from different RIP neighbors, but only routes with the lowest metric are stored (i.e., all stored incoming routes have the same metric).

    Note that RIP itself does not select outgoing route, that is done by the core routing table. When a new incoming route is received, it is propagated to the RIP table by rip_update_rte() and possibly stored in the list of incoming routes. Then the change may be propagated to the core by rip_announce_rte(). The core selects the best route and propagate it to RIP by rip_rt_notify(), which updates outgoing route part of rip_entry and possibly triggers route propagation by rip_trigger_update().

    RIP interfaces are represented by structures rip_iface. A RIP interface contains a per-interface socket, a list of associated neighbors, interface configuration, and state information related to scheduled interface events and running update sessions. RIP interfaces are added and removed based on core interface notifications.

    There are two RIP interface events - regular updates and triggered updates. Both are managed from the RIP interface timer (rip_iface_timer()). Regular updates are called at fixed interval and propagate the whole routing table, while triggered updates are scheduled by rip_trigger_update() due to some routing table change and propagate only the routes modified since the time they were scheduled. There are also unicast-destined requested updates, but these are sent directly as a reaction to received RIP request message. The update session is started by rip_send_table(). There may be at most one active update session per interface, as the associated state (including the fib iterator) is stored directly in rip_iface structure.

    RIP neighbors are represented by structures rip_neighbor. Compared to neighbor handling in other routing protocols, RIP does not have explicit neighbor discovery and adjacency maintenance, which makes the rip_neighbor related code a bit peculiar. RIP neighbors are interlinked with core neighbor structures (neighbor) and use core neighbor notifications to ensure that RIP neighbors are timely removed. RIP neighbors are added based on received route notifications and removed based on core neighbor and RIP interface events.

    RIP neighbors are linked by RIP routes and use counter to track the number of associated routes, but when these RIP routes timeout, associated RIP neighbor is still alive (with zero counter). When RIP neighbor is removed but still has some associated routes, it is not freed, just changed to detached state (core neighbors and RIP ifaces are unlinked), then during the main timer cleanup phase the associated routes are removed and the rip_neighbor structure is finally freed.

    Supported standards: - RFC 1058 - RIPv1 - RFC 2453 - RIPv2 - RFC 2080 - RIPng - RFC 4822 - RIP cryptographic authentication

    Function

    void rip_announce_rte (struct rip_proto * p, struct rip_entry * en) -- announce route from RIP routing table to the core

    Arguments

    struct rip_proto * p

    RIP instance

    struct rip_entry * en

    related network

    Description

    The function takes a list of incoming routes from en, prepare appropriate rte for the core and propagate it by rte_update().

    Function

    void rip_update_rte (struct rip_proto * p, ip_addr * prefix, int pxlen, struct rip_rte * new) -- enter a route update to RIP routing table

    Arguments

    struct rip_proto * p

    RIP instance

    ip_addr * prefix

    network prefix

    int pxlen

    network prefix length

    struct rip_rte * new

    a rip_rte representing the new route

    Description

    The function is called by the RIP packet processing code whenever it receives a reachable route. The appropriate routing table entry is found and the list of incoming routes is updated. Eventually, the change is also propagated to the core by rip_announce_rte(). Note that for unreachable routes, rip_withdraw_rte() should be called instead of rip_update_rte().

    Function

    void rip_withdraw_rte (struct rip_proto * p, ip_addr * prefix, int pxlen, struct rip_neighbor * from) -- enter a route withdraw to RIP routing table

    Arguments

    struct rip_proto * p

    RIP instance

    ip_addr * prefix

    network prefix

    int pxlen

    network prefix length

    struct rip_neighbor * from

    a rip_neighbor propagating the withdraw

    Description

    The function is called by the RIP packet processing code whenever it receives an unreachable route. The incoming route for given network from nbr from is removed. Eventually, the change is also propagated by rip_announce_rte().

    Function

    void rip_timer (timer * t) -- RIP main timer hook

    Arguments

    timer * t

    timer

    Description

    The RIP main timer is responsible for routing table maintenance. Invalid or expired routes (rip_rte) are removed and garbage collection of stale routing table entries (rip_entry) is done. Changes are propagated to core tables, route reload is also done here. Note that garbage collection uses a maximal GC time, while interfaces maintain an illusion of per-interface GC times in rip_send_response().

    Keeping incoming routes and the selected outgoing route are two independent functions, therefore after garbage collection some entries now considered invalid (RIP_ENTRY_DUMMY) still may have non-empty list of incoming routes, while some valid entries (representing an outgoing route) may have that list empty.

    The main timer is not scheduled periodically but it uses the time of the current next event and the minimal interval of any possible event to compute the time of the next run.

    Function

    void rip_iface_timer (timer * t) -- RIP interface timer hook

    Arguments

    timer * t

    timer

    Description

    RIP interface timers are responsible for scheduling both regular and triggered updates. Fixed, delay-independent period is used for regular updates, while minimal separating interval is enforced for triggered updates. The function also ensures that a new update is not started when the old one is still running.

    Function

    void rip_send_table (struct rip_proto * p, struct rip_iface * ifa, ip_addr addr, bird_clock_t changed) -- RIP interface timer hook

    Arguments

    struct rip_proto * p

    RIP instance

    struct rip_iface * ifa

    RIP interface

    ip_addr addr

    destination IP address

    bird_clock_t changed

    time limit for triggered updates

    Description

    The function activates an update session and starts sending routing update packets (using rip_send_response()). The session may be finished during the call or may continue in rip_tx_hook() until all appropriate routes are transmitted. Note that there may be at most one active update session per interface, the function will terminate the old active session before activating the new one.

    5.7 Router Advertisements

    The RAdv protocol is implemented in two files: radv.c containing the interface with BIRD core and the protocol logic and packets.c handling low level protocol stuff (RX, TX and packet formats). The protocol does not export any routes.

    The RAdv is structured in the usual way - for each handled interface there is a structure radv_iface that contains a state related to that interface together with its resources (a socket, a timer). There is also a prepared RA stored in a TX buffer of the socket associated with an iface. These iface structures are created and removed according to iface events from BIRD core handled by radv_if_notify() callback.

    The main logic of RAdv consists of two functions: radv_iface_notify(), which processes asynchronous events (specified by RA_EV_* codes), and radv_timer(), which triggers sending RAs and computes the next timeout.

    The RAdv protocol could receive routes (through radv_import_control() and radv_rt_notify()), but only the configured trigger route is tracked (in active var). When a radv protocol is reconfigured, the connected routing table is examined (in radv_check_active()) to have proper active value in case of the specified trigger prefix was changed.

    Supported standards: - RFC 4861 - main RA standard - RFC 6106 - DNS extensions (RDDNS, DNSSL) - RFC 4191 (partial) - Default Router Preference

    5.8 Static

    The Static protocol is implemented in a straightforward way. It keeps two lists of static routes: one containing interface routes and one holding the remaining ones. Interface routes are inserted and removed according to interface events received from the core via the if_notify() hook. Routes pointing to a neighboring router use a sticky node in the neighbor cache to be notified about gaining or losing the neighbor. Special routes like black holes or rejects are inserted all the time.

    Multipath routes are tricky. Because these routes depends on several neighbors we need to integrate that to the neighbor notification handling, we use dummy static_route nodes, one for each nexthop. Therefore, a multipath route consists of a master static_route node (of dest RTD_MULTIPATH), which specifies prefix and is used in most circumstances, and a list of dummy static_route nodes (of dest RTD_NONE), which stores info about nexthops and are connected to neighbor entries and neighbor notifications. Dummy nodes are chained using mp_next, they aren't in other_routes list, and abuse some fields (masklen, if_name) for other purposes.

    The only other thing worth mentioning is that when asked for reconfiguration, Static not only compares the two configurations, but it also calculates difference between the lists of static routes and it just inserts the newly added routes and removes the obsolete ones.

    5.9 Direct

    The Direct protocol works by converting all ifa_notify() events it receives to rte_update() calls for the corresponding network.

    Next Previous Contents bird-1.6.3/doc/prog-intro.sgml0000644000103200001440000001772613027054563015200 0ustar feelausersBIRD Design Introduction

    This document describes the internal workings of BIRD, its architecture, design decisions and rationale behind them. It also contains documentation on all the essential components of the system and their interfaces.

    Routing daemons are complicated things which need to act in real time to complex sequences of external events, respond correctly even to the most erroneous behavior of their environment and still handle enormous amount of data with reasonable speed. Due to all of this, their design is very tricky as one needs to carefully balance between efficiency, stability and (last, but not least) simplicity of the program and it would be possible to write literally hundreds of pages about all of these issues. In accordance to the famous quote of Anton Chekhov "Shortness is a sister of talent", we've tried to write a much shorter document highlighting the most important stuff and leaving the boring technical details better explained by the program source itself together with comments contained therein. Design goals

    When planning the architecture of BIRD, we've taken a close look at the other existing routing daemons and also at some of the operating systems used on dedicated routers, gathered all important features and added lots of new ones to overcome their shortcomings and to better match the requirements of routing in today's Internet: IPv6, policy routing, route filtering and so on. From this planning, the following set of design goals has arisen: Support all the standard routing protocols and make it easy to add new ones. This leads to modularity and clean separation between the core and the protocols. Support both IPv4 and IPv6 in the same source tree, re-using most of the code. This leads to abstraction of IP addresses and operations on them. Minimize OS dependent code to make porting as easy as possible. Unfortunately, such code cannot be avoided at all as the details of communication with the IP stack differ from OS to OS and they often vary even between different versions of the same OS. But we can isolate such code in special modules and do the porting by changing or replacing just these modules. Also, don't rely on specific features of various operating systems, but be able to make use of them if they are available. Allow multiple routing tables. Easily solvable by abstracting out routing tables and the corresponding operations. Offer powerful route filtering. There already were several attempts to incorporate route filters to a dynamic router, but most of them have used simple sequences of filtering rules which were very inflexible and hard to use for non-trivial filters. We've decided to employ a simple loop-free programming language having access to all the route attributes and being able to modify the most of them. Support easy configuration and re-configuration. Most routers use a simple configuration language designed ad hoc with no structure at all and allow online changes of configuration by using their command-line interface, thus any complex re-configurations are hard to achieve without replacing the configuration file and restarting the whole router. We've decided to use a more general approach: to have a configuration defined in a context-free language with blocks and nesting, to perform all configuration changes by editing the configuration file, but to be able to read the new configuration and smoothly adapt to it without disturbing parts of the routing process which are not affected by the change. Be able to be controlled online. In addition to the online reconfiguration, a routing daemon should be able to communicate with the user and with many other programs (primarily scripts used for network maintenance) in order to make it possible to inspect contents of routing tables, status of all routing protocols and also to control their behavior (disable, enable or reset a protocol without restarting all the others). To achieve this, we implement a simple command-line protocol based on those used by FTP and SMTP (that is textual commands and textual replies accompanied by a numeric code which makes them both readable to a human and easy to recognize in software). Respond to all events in real time. A typical solution to this problem is to use lots of threads to separate the workings of all the routing protocols and also of the user interface parts and to hope that the scheduler will assign time to them in a fair enough manner. This is surely a good solution, but we have resisted the temptation and preferred to avoid the overhead of threading and the large number of locks involved and preferred a event driven architecture with our own scheduling of events. An unpleasant consequence of such an approach is that long lasting tasks must be split to more parts linked by special events or timers to make the CPU available for other tasks as well. Architecture

    The requirements set above have lead to a simple modular architecture containing the following types of modules: Core modules implement the core functions of BIRD: taking care of routing tables, keeping protocol status, interacting with the user using the Command-Line Interface (to be called CLI in the rest of this document) etc. Library modules form a large set of various library functions implementing several data abstractions, utility functions and also functions which are a part of the standard libraries on some systems, but missing on other ones. Resource management modules take care of resources, their allocation and automatic freeing when the module having requested shuts itself down. Configuration modules are fragments of lexical analyzer, grammar rules and the corresponding snippets of C code. For each group of code modules (core, each protocol, filters) there exist a configuration module taking care of all the related configuration stuff. The filter implements the route filtering language. Protocol modules implement the individual routing protocols. System-dependent modules implement the interface between BIRD and specific operating systems. The client is a simple program providing an easy, though friendly interface to the CLI. Implementation

    BIRD has been written in GNU C. We've considered using C++, but we've preferred the simplicity and straightforward nature of C which gives us fine control over all implementation details and on the other hand enough instruments to build the abstractions we need.

    The modules are statically linked to produce a single executable file (except for the client which stands on its own).

    The building process is controlled by a set of Makefiles for GNU Make, intermixed with several Perl and shell scripts.

    The initial configuration of the daemon, detection of system features and selection of the right modules to include for the particular OS and the set of protocols the user has chosen is performed by a configure script generated by GNU Autoconf.

    The parser of the configuration is generated by the GNU Bison.

    The documentation is generated using The comments from C sources which form a part of the programmer's documentation are extracted using a modified version of the If you want to work on BIRD, it's highly recommended to configure it with a bird-1.6.3/doc/bird-1.html0000644000103200001440000002164713027054673014157 0ustar feelausers BIRD User's Guide: Introduction Next Previous Contents

    1. Introduction

    1.1 What is BIRD

    The name `BIRD' is actually an acronym standing for `BIRD Internet Routing Daemon'. Let's take a closer look at the meaning of the name:

    BIRD: Well, we think we have already explained that. It's an acronym standing for `BIRD Internet Routing Daemon', you remember, don't you? :-)

    Internet Routing: It's a program (well, a daemon, as you are going to discover in a moment) which works as a dynamic router in an Internet type network (that is, in a network running either the IPv4 or the IPv6 protocol). Routers are devices which forward packets between interconnected networks in order to allow hosts not connected directly to the same local area network to communicate with each other. They also communicate with the other routers in the Internet to discover the topology of the network which allows them to find optimal (in terms of some metric) rules for forwarding of packets (which are called routing tables) and to adapt themselves to the changing conditions such as outages of network links, building of new connections and so on. Most of these routers are costly dedicated devices running obscure firmware which is hard to configure and not open to any changes (on the other hand, their special hardware design allows them to keep up with lots of high-speed network interfaces, better than general-purpose computer does). Fortunately, most operating systems of the UNIX family allow an ordinary computer to act as a router and forward packets belonging to the other hosts, but only according to a statically configured table.

    A Routing Daemon is in UNIX terminology a non-interactive program running on background which does the dynamic part of Internet routing, that is it communicates with the other routers, calculates routing tables and sends them to the OS kernel which does the actual packet forwarding. There already exist other such routing daemons: routed (RIP only), GateD (non-free), Zebra and MRTD, but their capabilities are limited and they are relatively hard to configure and maintain.

    BIRD is an Internet Routing Daemon designed to avoid all of these shortcomings, to support all the routing technology used in the today's Internet or planned to be used in near future and to have a clean extensible architecture allowing new routing protocols to be incorporated easily. Among other features, BIRD supports:

    • both IPv4 and IPv6 protocols
    • multiple routing tables
    • the Border Gateway Protocol (BGPv4)
    • the Routing Information Protocol (RIPv2)
    • the Open Shortest Path First protocol (OSPFv2, OSPFv3)
    • the Router Advertisements for IPv6 hosts
    • a virtual protocol for exchange of routes between different routing tables on a single host
    • a command-line interface allowing on-line control and inspection of status of the daemon
    • soft reconfiguration (no need to use complex online commands to change the configuration, just edit the configuration file and notify BIRD to re-read it and it will smoothly switch itself to the new configuration, not disturbing routing protocols unless they are affected by the configuration changes)
    • a powerful language for route filtering

    BIRD has been developed at the Faculty of Math and Physics, Charles University, Prague, Czech Republic as a student project. It can be freely distributed under the terms of the GNU General Public License.

    BIRD has been designed to work on all UNIX-like systems. It has been developed and tested under Linux 2.0 to 2.6, and then ported to FreeBSD, NetBSD and OpenBSD, porting to other systems (even non-UNIX ones) should be relatively easy due to its highly modular architecture.

    BIRD supports either IPv4 or IPv6 protocol, but have to be compiled separately for each one. Therefore, a dualstack router would run two instances of BIRD (one for IPv4 and one for IPv6), with completely separate setups (configuration files, tools ...).

    1.2 Installing BIRD

    On a recent UNIX system with GNU development tools (GCC, binutils, m4, make) and Perl, installing BIRD should be as easy as: 

            ./configure
        make
        make install
        vi /usr/local/etc/bird.conf
        bird

    You can use ./configure --help to get a list of configure options. The most important ones are: --enable-ipv6 which enables building of an IPv6 version of BIRD, --with-protocols= to produce a slightly smaller BIRD executable by configuring out routing protocols you don't use, and --prefix= to install BIRD to a place different from /usr/local.

    1.3 Running BIRD

    You can pass several command-line options to bird:

    -c config name

    use given configuration file instead of prefix/etc/bird.conf.

    -d

    enable debug messages and run bird in foreground.

    -D filename of debug log

    log debugging information to given file instead of stderr.

    -f

    run bird in foreground.

    -g group

    use that group ID, see the next section for details.

    -h, --help

    display command-line options to bird.

    -l

    look for a configuration file and a communication socket in the current working directory instead of in default system locations. However, paths specified by options -c, -s have higher priority.

    -p

    just parse the config file and exit. Return value is zero if the config file is valid, nonzero if there are some errors.

    -P name of PID file

    create a PID file with given filename.

    -R

    apply graceful restart recovery after start.

    -s name of communication socket

    use given filename for a socket for communications with the client, default is prefix/var/run/bird.ctl.

    -u user

    drop privileges and use that user ID, see the next section for details.

    --version

    display bird version.

    BIRD writes messages about its work to log files or syslog (according to config).

    1.4 Privileges

    BIRD, as a routing daemon, uses several privileged operations (like setting routing table and using raw sockets). Traditionally, BIRD is executed and runs with root privileges, which may be prone to security problems. The recommended way is to use a privilege restriction (options -u, -g). In that case BIRD is executed with root privileges, but it changes its user and group ID to an unprivileged ones, while using Linux capabilities to retain just required privileges (capabilities CAP_NET_*). Note that the control socket is created before the privileges are dropped, but the config file is read after that. The privilege restriction is not implemented in BSD port of BIRD.

    An unprivileged user (as an argument to -u options) may be the user nobody, but it is suggested to use a new dedicated user account (like bird). The similar considerations apply for the group option, but there is one more condition -- the users in the same group can use birdc to control BIRD.

    Finally, there is a possibility to use external tools to run BIRD in an environment with restricted privileges. This may need some configuration, but it is generally easy -- BIRD needs just the standard library, privileges to read the config file and create the control socket and the CAP_NET_* capabilities.

    Next Previous Contents bird-1.6.3/doc/bird-5.html0000644000103200001440000006453113027054673014162 0ustar feelausers BIRD User's Guide: Filters Next Previous Contents

    5. Filters

    5.1 Introduction

    BIRD contains a simple programming language. (No, it can't yet read mail :-). There are two objects in this language: filters and functions. Filters are interpreted by BIRD core when a route is being passed between protocols and routing tables. The filter language contains control structures such as if's and switches, but it allows no loops. An example of a filter using many features can be found in filter/test.conf.

    Filter gets the route, looks at its attributes and modifies some of them if it wishes. At the end, it decides whether to pass the changed route through (using accept) or whether to reject it. A simple filter looks like this: 

    filter not_too_far
int var;
{
        if defined( rip_metric ) then
                var = rip_metric;
        else {
                var = 1;
                rip_metric = 1;
        }
        if rip_metric > 10 then
                reject "RIP metric is too big";
        else
                accept "ok";
}

    As you can see, a filter has a header, a list of local variables, and a body. The header consists of the filter keyword followed by a (unique) name of filter. The list of local variables consists of type name; pairs where each pair defines one local variable. The body consists of { statements }. Each statement is terminated by a ;. You can group several statements to a single compound statement by using braces ({ statements }) which is useful if you want to make a bigger block of code conditional.

    BIRD supports functions, so that you don't have to repeat the same blocks of code over and over. Functions can have zero or more parameters and they can have local variables. Recursion is not allowed. Function definitions look like this: 

    function name ()
int local_variable;
{
        local_variable = 5;
}

function with_parameters (int parameter)
{
        print parameter;
}

    Unlike in C, variables are declared after the function line, but before the first {. You can't declare variables in nested blocks. Functions are called like in C: name(); with_parameters(5);. Function may return values using the return [expr] command. Returning a value exits from current function (this is similar to C).

    Filters are declared in a way similar to functions except they can't have explicit parameters. They get a route table entry as an implicit parameter, it is also passed automatically to any functions called. The filter must terminate with either accept or reject statement. If there's a runtime error in filter, the route is rejected.

    A nice trick to debug filters is to use show route filter name from the command line client. An example session might look like: 

    pavel@bug:~/bird$ ./birdc -s bird.ctl
BIRD 0.0.0 ready.
bird> show route
10.0.0.0/8         dev eth0 [direct1 23:21] (240)
195.113.30.2/32    dev tunl1 [direct1 23:21] (240)
127.0.0.0/8        dev lo [direct1 23:21] (240)
bird> show route ?
show route [<prefix>] [table <t>] [filter <f>] [all] [primary]...
bird> show route filter { if 127.0.0.5 ~ net then accept; }
127.0.0.0/8        dev lo [direct1 23:21] (240)
bird>

    5.2 Data types

    Each variable and each value has certain type. Booleans, integers and enums are incompatible with each other (that is to prevent you from shooting in the foot).

    bool

    This is a boolean type, it can have only two values, true and false. Boolean is the only type you can use in if statements.

    int

    This is a general integer type. It is an unsigned 32bit type; i.e., you can expect it to store values from 0 to 4294967295. Overflows are not checked. You can use 0x1234 syntax to write hexadecimal values.

    pair

    This is a pair of two short integers. Each component can have values from 0 to 65535. Literals of this type are written as (1234,5678). The same syntax can also be used to construct a pair from two arbitrary integer expressions (for example (1+2,a)).

    quad

    This is a dotted quad of numbers used to represent router IDs (and others). Each component can have a value from 0 to 255. Literals of this type are written like IPv4 addresses.

    string

    This is a string of characters. There are no ways to modify strings in filters. You can pass them between functions, assign them to variables of type string, print such variables, use standard string comparison operations (e.g. =, !=, <, >, <=, >=), but you can't concatenate two strings. String literals are written as "This is a string constant". Additionally matching (~, !~) operators could be used to match a string value against a shell pattern (represented also as a string).

    ip

    This type can hold a single IP address. Depending on the compile-time configuration of BIRD you are using, it is either an IPv4 or IPv6 address. IP addresses are written in the standard notation (10.20.30.40 or fec0:3:4::1). You can apply special operator .mask(num) on values of type ip. It masks out all but first num bits from the IP address. So 1.2.3.4.mask(8) = 1.0.0.0 is true.

    prefix

    This type can hold a network prefix consisting of IP address and prefix length. Prefix literals are written as ipaddress/pxlen, or ipaddress/netmask. There are two special operators on prefixes: .ip which extracts the IP address from the pair, and .len, which separates prefix length from the pair. So 1.2.0.0/16.len = 16 is true.

    ec

    This is a specialized type used to represent BGP extended community values. It is essentially a 64bit value, literals of this type are usually written as (kind, key, value), where kind is a kind of extended community (e.g. rt / ro for a route target / route origin communities), the format and possible values of key and value are usually integers, but it depends on the used kind. Similarly to pairs, ECs can be constructed using expressions for key and value parts, (e.g. (ro, myas, 3*10), where myas is an integer variable).

    lc

    This is a specialized type used to represent BGP large community values. It is essentially a triplet of 32bit values, where the first value is reserved for the AS number of the issuer, while meaning of remaining parts is defined by the issuer. Literals of this type are written as (123, 456, 789), with any integer values. Similarly to pairs, LCs can be constructed using expressions for its parts, (e.g. (myas, 10+20, 3*10), where myas is an integer variable).

    int|pair|quad|ip|prefix|ec|lc|enum set

    Filters recognize four types of sets. Sets are similar to strings: you can pass them around but you can't modify them. Literals of type int set look like [ 1, 2, 5..7 ]. As you can see, both simple values and ranges are permitted in sets.

    For pair sets, expressions like (123,*) can be used to denote ranges (in that case (123,0)..(123,65535)). You can also use (123,5..100) for range (123,5)..(123,100). You can also use * and a..b expressions in the first part of a pair, note that such expressions are translated to a set of intervals, which may be memory intensive. E.g. (*,4..20) is translated to (0,4..20), (1,4..20), (2,4..20), ... (65535, 4..20).

    EC sets use similar expressions like pair sets, e.g. (rt, 123, 10..20) or (ro, 123, *). Expressions requiring the translation (like (rt, *, 3)) are not allowed (as they usually have 4B range for ASNs).

    Also LC sets use similar expressions like pair sets. You can use ranges and wildcards, but if one field uses that, more specific (later) fields must be wildcards. E.g., (10, 20..30, *) or (10, 20, 30..40) is valid, while (10, *, 20..30) or (10, 20..30, 40) is not valid.

    You can also use expressions for int, pair, EC and LC set values. However, it must be possible to evaluate these expressions before daemon boots. So you can use only constants inside them. E.g. 

             define one=1;
         define myas=64500;
         int set odds;
         pair set ps;
         ec set es;

         odds = [ one, 2+1, 6-one, 2*2*2-1, 9, 11 ];
         ps = [ (1,one+one), (3,4)..(4,8), (5,*), (6,3..6), (7..9,*) ];
         es = [ (rt, myas, 3*10), (rt, myas+one, 0..16*16*16-1), (ro, myas+2, *) ];

    Sets of prefixes are special: their literals does not allow ranges, but allows prefix patterns that are written as ipaddress/pxlen{low,high}. Prefix ip1/len1 matches prefix pattern ip2/len2{l,h} if the first min(len1, len2) bits of ip1 and ip2 are identical and len1 <= ip1 <= len2. A valid prefix pattern has to satisfy low <= high, but pxlen is not constrained by low or high. Obviously, a prefix matches a prefix set literal if it matches any prefix pattern in the prefix set literal.

    There are also two shorthands for prefix patterns: address/len+ is a shorthand for address/len{len,maxlen} (where maxlen is 32 for IPv4 and 128 for IPv6), that means network prefix address/len and all its subnets. address/len- is a shorthand for address/len{0,len}, that means network prefix address/len and all its supernets (network prefixes that contain it).

    For example, [ 1.0.0.0/8, 2.0.0.0/8+, 3.0.0.0/8-, 4.0.0.0/8{16,24} ] matches prefix 1.0.0.0/8, all subprefixes of 2.0.0.0/8, all superprefixes of 3.0.0.0/8 and prefixes 4.X.X.X whose prefix length is 16 to 24. [ 0.0.0.0/0{20,24} ] matches all prefixes (regardless of IP address) whose prefix length is 20 to 24, [ 1.2.3.4/32- ] matches any prefix that contains IP address 1.2.3.4. 1.2.0.0/16 ~ [ 1.0.0.0/8{15,17} ] is true, but 1.0.0.0/16 ~ [ 1.0.0.0/8- ] is false.

    Cisco-style patterns like 10.0.0.0/8 ge 16 le 24 can be expressed in BIRD as 10.0.0.0/8{16,24}, 192.168.0.0/16 le 24 as 192.168.0.0/16{16,24} and 192.168.0.0/16 ge 24 as 192.168.0.0/16{24,32}.

    enum

    Enumeration types are fixed sets of possibilities. You can't define your own variables of such type, but some route attributes are of enumeration type. Enumeration types are incompatible with each other.

    bgppath

    BGP path is a list of autonomous system numbers. You can't write literals of this type. There are several special operators on bgppaths:

    P.first returns the first ASN (the neighbor ASN) in path P.

    P.last returns the last ASN (the source ASN) in path P.

    P.last_nonaggregated returns the last ASN in the non-aggregated part of the path P.

    Both first and last return zero if there is no appropriate ASN, for example if the path contains an AS set element as the first (or the last) part. If the path ends with an AS set, last_nonaggregated may be used to get last ASN before any AS set.

    P.len returns the length of path P.

    prepend(P,A) prepends ASN A to path P and returns the result.

    delete(P,A) deletes all instances of ASN A from from path P and returns the result. A may also be an integer set, in that case the operator deletes all ASNs from path P that are also members of set A.

    filter(P,A) deletes all ASNs from path P that are not members of integer set A. I.e., filter do the same as delete with inverted set A.

    Statement P = prepend(P, A); can be shortened to P.prepend(A); if P is appropriate route attribute (for example bgp_path). Similarly for delete and filter.

    bgpmask

    BGP masks are patterns used for BGP path matching (using path ~ [= 2 3 5 * =] syntax). The masks resemble wildcard patterns as used by UNIX shells. Autonomous system numbers match themselves, * matches any (even empty) sequence of arbitrary AS numbers and ? matches one arbitrary AS number. For example, if bgp_path is 4 3 2 1, then: bgp_path ~ [= * 4 3 * =] is true, but bgp_path ~ [= * 4 5 * =] is false. BGP mask expressions can also contain integer expressions enclosed in parenthesis and integer variables, for example [= * 4 (1+2) a =]. You can also use ranges, for example [= * 3..5 2 100..200 * =]. There is also old (deprecated) syntax that uses / .. / instead of [= .. =] and ? instead of *.

    clist

    Clist is similar to a set, except that unlike other sets, it can be modified. The type is used for community list (a set of pairs) and for cluster list (a set of quads). There exist no literals of this type. There are three special operators on clists:

    C.len returns the length of clist C.

    add(C,P) adds pair (or quad) P to clist C and returns the result. If item P is already in clist C, it does nothing. P may also be a clist, in that case all its members are added; i.e., it works as clist union.

    delete(C,P) deletes pair (or quad) P from clist C and returns the result. If clist C does not contain item P, it does nothing. P may also be a pair (or quad) set, in that case the operator deletes all items from clist C that are also members of set P. Moreover, P may also be a clist, which works analogously; i.e., it works as clist difference.

    filter(C,P) deletes all items from clist C that are not members of pair (or quad) set P. I.e., filter do the same as delete with inverted set P. P may also be a clist, which works analogously; i.e., it works as clist intersection.

    Statement C = add(C, P); can be shortened to C.add(P); if C is appropriate route attribute (for example bgp_community). Similarly for delete and filter.

    eclist

    Eclist is a data type used for BGP extended community lists. Eclists are very similar to clists, but they are sets of ECs instead of pairs. The same operations (like add, delete or ~ and !~ membership operators) can be used to modify or test eclists, with ECs instead of pairs as arguments.

    lclist

    Lclist is a data type used for BGP large community lists. Like eclists, lclists are very similar to clists, but they are sets of LCs instead of pairs. The same operations (like add, delete or ~ and !~ membership operators) can be used to modify or test lclists, with LCs instead of pairs as arguments.

    5.3 Operators

    The filter language supports common integer operators (+,-,*,/), parentheses (a*(b+c)), comparison (a=b, a!=b, a<b, a>=b). Logical operations include unary not (!), and (&&) and or (||). Special operators include (~, !~) for "is (not) element of a set" operation - it can be used on element and set of elements of the same type (returning true if element is contained in the given set), or on two strings (returning true if first string matches a shell-like pattern stored in second string) or on IP and prefix (returning true if IP is within the range defined by that prefix), or on prefix and prefix (returning true if first prefix is more specific than second one) or on bgppath and bgpmask (returning true if the path matches the mask) or on number and bgppath (returning true if the number is in the path) or on bgppath and int (number) set (returning true if any ASN from the path is in the set) or on pair/quad and clist (returning true if the pair/quad is element of the clist) or on clist and pair/quad set (returning true if there is an element of the clist that is also a member of the pair/quad set).

    There is one operator related to ROA infrastructure - roa_check(). It examines a ROA table and does RFC 6483 route origin validation for a given network prefix. The basic usage is roa_check(table), which checks current route (which should be from BGP to have AS_PATH argument) in the specified ROA table and returns ROA_UNKNOWN if there is no relevant ROA, ROA_VALID if there is a matching ROA, or ROA_INVALID if there are some relevant ROAs but none of them match. There is also an extended variant roa_check(table, prefix, asn), which allows to specify a prefix and an ASN as arguments.

    5.4 Control structures

    Filters support two control structures: conditions and case switches.

    Syntax of a condition is: if boolean expression then command1; else command2; and you can use { command_1; command_2; ... } instead of either command. The else clause may be omitted. If the boolean expression is true, command1 is executed, otherwise command2 is executed.

    The case is similar to case from Pascal. Syntax is case expr { else: | num_or_prefix [ .. num_or_prefix]: statement ; [ ... ] }. The expression after case can be of any type which can be on the left side of the ~ operator and anything that could be a member of a set is allowed before :. Multiple commands are allowed without {} grouping. If expr matches one of the : clauses, statements between it and next : statement are executed. If expr matches neither of the : clauses, the statements after else: are executed.

    Here is example that uses if and case structures: 

    case arg1 {
        2: print "two"; print "I can do more commands without {}";
        3 .. 5: print "three to five";
        else: print "something else";
}

if 1234 = i then printn "."; else {
  print "not 1234";
  print "You need {} around multiple commands";
}

    5.5 Route attributes

    A filter is implicitly passed a route, and it can access its attributes just like it accesses variables. Attempts to access undefined attribute result in a runtime error; you can check if an attribute is defined by using the defined( attribute ) operator. One notable exception to this rule are attributes of clist type, where undefined value is regarded as empty clist for most purposes.

    prefix net

    Network the route is talking about. Read-only. (See the chapter about routing tables.)

    enum scope

    The scope of the route. Possible values: SCOPE_HOST for routes local to this host, SCOPE_LINK for those specific for a physical link, SCOPE_SITE and SCOPE_ORGANIZATION for private routes and SCOPE_UNIVERSE for globally visible routes. This attribute is not interpreted by BIRD and can be used to mark routes in filters. The default value for new routes is SCOPE_UNIVERSE.

    int preference

    Preference of the route. Valid values are 0-65535. (See the chapter about routing tables.)

    ip from

    The router which the route has originated from.

    ip gw

    Next hop packets routed using this route should be forwarded to.

    string proto

    The name of the protocol which the route has been imported from. Read-only.

    enum source

    what protocol has told me about this route. Possible values: RTS_DUMMY, RTS_STATIC, RTS_INHERIT, RTS_DEVICE, RTS_STATIC_DEVICE, RTS_REDIRECT, RTS_RIP, RTS_OSPF, RTS_OSPF_IA, RTS_OSPF_EXT1, RTS_OSPF_EXT2, RTS_BGP, RTS_PIPE, RTS_BABEL.

    enum cast

    Route type (Currently RTC_UNICAST for normal routes, RTC_BROADCAST, RTC_MULTICAST, RTC_ANYCAST will be used in the future for broadcast, multicast and anycast routes). Read-only.

    enum dest

    Type of destination the packets should be sent to (RTD_ROUTER for forwarding to a neighboring router, RTD_DEVICE for routing to a directly-connected network, RTD_MULTIPATH for multipath destinations, RTD_BLACKHOLE for packets to be silently discarded, RTD_UNREACHABLE, RTD_PROHIBIT for packets that should be returned with ICMP host unreachable / ICMP administratively prohibited messages). Can be changed, but only to RTD_BLACKHOLE, RTD_UNREACHABLE or RTD_PROHIBIT.

    string ifname

    Name of the outgoing interface. Sink routes (like blackhole, unreachable or prohibit) and multipath routes have no interface associated with them, so ifname returns an empty string for such routes. Read-only.

    int ifindex

    Index of the outgoing interface. System wide index of the interface. May be used for interface matching, however indexes might change on interface creation/removal. Zero is returned for routes with undefined outgoing interfaces. Read-only.

    int igp_metric

    The optional attribute that can be used to specify a distance to the network for routes that do not have a native protocol metric attribute (like ospf_metric1 for OSPF routes). It is used mainly by BGP to compare internal distances to boundary routers (see below). It is also used when the route is exported to OSPF as a default value for OSPF type 1 metric.

    There also exist some protocol-specific attributes which are described in the corresponding protocol sections.

    5.6 Other statements

    The following statements are available:

    variable = expr

    Set variable to a given value.

    accept|reject [ expr ]

    Accept or reject the route, possibly printing expr.

    return expr

    Return expr from the current function, the function ends at this point.

    print|printn expr [, expr...]

    Prints given expressions; useful mainly while debugging filters. The printn variant does not terminate the line.

    quitbird

    Terminates BIRD. Useful when debugging the filter interpreter.

    Next Previous Contents