094d2bdb79
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.
344 lines
10 KiB
C
344 lines
10 KiB
C
/*
|
|
* BIRD -- Table-to-Table Routing Protocol a.k.a Pipe
|
|
*
|
|
* (c) 1999--2000 Martin Mares <mj@ucw.cz>
|
|
*
|
|
* Can be freely distributed and used under the terms of the GNU GPL.
|
|
*/
|
|
|
|
/**
|
|
* DOC: 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.
|
|
*/
|
|
|
|
#undef LOCAL_DEBUG
|
|
|
|
#include "nest/bird.h"
|
|
#include "nest/iface.h"
|
|
#include "nest/protocol.h"
|
|
#include "nest/route.h"
|
|
#include "nest/cli.h"
|
|
#include "conf/conf.h"
|
|
#include "filter/filter.h"
|
|
#include "lib/string.h"
|
|
|
|
#include "pipe.h"
|
|
|
|
static void
|
|
pipe_rt_notify(struct proto *P, rtable *src_table, net *n, rte *new, rte *old, ea_list *attrs)
|
|
{
|
|
struct pipe_proto *p = (struct pipe_proto *) P;
|
|
struct announce_hook *ah = (src_table == P->table) ? p->peer_ahook : P->main_ahook;
|
|
rtable *dst_table = ah->table;
|
|
struct rte_src *src;
|
|
|
|
net *nn;
|
|
rte *e;
|
|
rta a;
|
|
|
|
if (!new && !old)
|
|
return;
|
|
|
|
if (dst_table->pipe_busy)
|
|
{
|
|
log(L_ERR "Pipe loop detected when sending %I/%d to table %s",
|
|
n->n.prefix, n->n.pxlen, dst_table->name);
|
|
return;
|
|
}
|
|
|
|
nn = net_get(dst_table, n->n.prefix, n->n.pxlen);
|
|
if (new)
|
|
{
|
|
memcpy(&a, new->attrs, sizeof(rta));
|
|
|
|
if (p->mode == PIPE_OPAQUE)
|
|
{
|
|
a.src = P->main_source;
|
|
a.source = RTS_PIPE;
|
|
}
|
|
|
|
a.aflags = 0;
|
|
a.eattrs = attrs;
|
|
a.hostentry = NULL;
|
|
e = rte_get_temp(&a);
|
|
e->net = nn;
|
|
e->pflags = 0;
|
|
|
|
if (p->mode == PIPE_TRANSPARENT)
|
|
{
|
|
/* Copy protocol specific embedded attributes. */
|
|
memcpy(&(e->u), &(new->u), sizeof(e->u));
|
|
e->pref = new->pref;
|
|
e->pflags = new->pflags;
|
|
}
|
|
|
|
src = a.src;
|
|
}
|
|
else
|
|
{
|
|
e = NULL;
|
|
src = old->attrs->src;
|
|
}
|
|
|
|
src_table->pipe_busy = 1;
|
|
rte_update2(ah, nn, e, src);
|
|
src_table->pipe_busy = 0;
|
|
}
|
|
|
|
static int
|
|
pipe_import_control(struct proto *P, rte **ee, ea_list **ea UNUSED, struct linpool *p UNUSED)
|
|
{
|
|
struct proto *pp = (*ee)->sender->proto;
|
|
|
|
if (pp == P)
|
|
return -1; /* Avoid local loops automatically */
|
|
return 0;
|
|
}
|
|
|
|
static int
|
|
pipe_reload_routes(struct proto *P)
|
|
{
|
|
struct pipe_proto *p = (struct pipe_proto *) P;
|
|
|
|
/*
|
|
* Because the pipe protocol feeds routes from both routing tables
|
|
* together, both directions are reloaded during refeed and 'reload
|
|
* out' command works like 'reload' command. For symmetry, we also
|
|
* request refeed when 'reload in' command is used.
|
|
*/
|
|
proto_request_feeding(P);
|
|
|
|
proto_reset_limit(P->main_ahook->in_limit);
|
|
proto_reset_limit(p->peer_ahook->in_limit);
|
|
|
|
return 1;
|
|
}
|
|
|
|
static struct proto *
|
|
pipe_init(struct proto_config *C)
|
|
{
|
|
struct pipe_config *c = (struct pipe_config *) C;
|
|
struct proto *P = proto_new(C, sizeof(struct pipe_proto));
|
|
struct pipe_proto *p = (struct pipe_proto *) P;
|
|
|
|
p->mode = c->mode;
|
|
p->peer_table = c->peer->table;
|
|
P->accept_ra_types = (p->mode == PIPE_OPAQUE) ? RA_OPTIMAL : RA_ANY;
|
|
P->rt_notify = pipe_rt_notify;
|
|
P->import_control = pipe_import_control;
|
|
P->reload_routes = pipe_reload_routes;
|
|
|
|
return P;
|
|
}
|
|
|
|
static int
|
|
pipe_start(struct proto *P)
|
|
{
|
|
struct pipe_config *cf = (struct pipe_config *) P->cf;
|
|
struct pipe_proto *p = (struct pipe_proto *) P;
|
|
|
|
/* Lock both tables, unlock is handled in pipe_cleanup() */
|
|
rt_lock_table(P->table);
|
|
rt_lock_table(p->peer_table);
|
|
|
|
/* Going directly to PS_UP - prepare for feeding,
|
|
connect the protocol to both routing tables */
|
|
|
|
P->main_ahook = proto_add_announce_hook(P, P->table, &P->stats);
|
|
P->main_ahook->out_filter = cf->c.out_filter;
|
|
P->main_ahook->in_limit = cf->c.in_limit;
|
|
proto_reset_limit(P->main_ahook->in_limit);
|
|
|
|
p->peer_ahook = proto_add_announce_hook(P, p->peer_table, &p->peer_stats);
|
|
p->peer_ahook->out_filter = cf->c.in_filter;
|
|
p->peer_ahook->in_limit = cf->c.out_limit;
|
|
proto_reset_limit(p->peer_ahook->in_limit);
|
|
|
|
if (p->mode == PIPE_OPAQUE)
|
|
{
|
|
P->main_source = rt_get_source(P, 0);
|
|
rt_lock_source(P->main_source);
|
|
}
|
|
|
|
return PS_UP;
|
|
}
|
|
|
|
static void
|
|
pipe_cleanup(struct proto *P)
|
|
{
|
|
struct pipe_proto *p = (struct pipe_proto *) P;
|
|
|
|
bzero(&P->stats, sizeof(struct proto_stats));
|
|
bzero(&p->peer_stats, sizeof(struct proto_stats));
|
|
|
|
P->main_ahook = NULL;
|
|
p->peer_ahook = NULL;
|
|
|
|
if (p->mode == PIPE_OPAQUE)
|
|
rt_unlock_source(P->main_source);
|
|
P->main_source = NULL;
|
|
|
|
rt_unlock_table(P->table);
|
|
rt_unlock_table(p->peer_table);
|
|
}
|
|
|
|
static void
|
|
pipe_postconfig(struct proto_config *C)
|
|
{
|
|
struct pipe_config *c = (struct pipe_config *) C;
|
|
|
|
if (!c->peer)
|
|
cf_error("Name of peer routing table not specified");
|
|
if (c->peer == C->table)
|
|
cf_error("Primary table and peer table must be different");
|
|
}
|
|
|
|
extern int proto_reconfig_type;
|
|
|
|
static int
|
|
pipe_reconfigure(struct proto *P, struct proto_config *new)
|
|
{
|
|
struct pipe_proto *p = (struct pipe_proto *)P;
|
|
struct proto_config *old = P->cf;
|
|
struct pipe_config *oc = (struct pipe_config *) old;
|
|
struct pipe_config *nc = (struct pipe_config *) new;
|
|
|
|
if ((oc->peer->table != nc->peer->table) || (oc->mode != nc->mode))
|
|
return 0;
|
|
|
|
/* Update output filters in ahooks */
|
|
if (P->main_ahook)
|
|
{
|
|
P->main_ahook->out_filter = new->out_filter;
|
|
P->main_ahook->in_limit = new->in_limit;
|
|
}
|
|
|
|
if (p->peer_ahook)
|
|
{
|
|
p->peer_ahook->out_filter = new->in_filter;
|
|
p->peer_ahook->in_limit = new->out_limit;
|
|
}
|
|
|
|
if ((P->proto_state != PS_UP) || (proto_reconfig_type == RECONFIG_SOFT))
|
|
return 1;
|
|
|
|
if ((new->preference != old->preference)
|
|
|| ! filter_same(new->in_filter, old->in_filter)
|
|
|| ! filter_same(new->out_filter, old->out_filter))
|
|
proto_request_feeding(P);
|
|
|
|
return 1;
|
|
}
|
|
|
|
static void
|
|
pipe_copy_config(struct proto_config *dest, struct proto_config *src)
|
|
{
|
|
/* Just a shallow copy, not many items here */
|
|
proto_copy_rest(dest, src, sizeof(struct pipe_config));
|
|
}
|
|
|
|
static void
|
|
pipe_get_status(struct proto *P, byte *buf)
|
|
{
|
|
struct pipe_proto *p = (struct pipe_proto *) P;
|
|
|
|
bsprintf(buf, "%c> %s", (p->mode == PIPE_OPAQUE) ? '-' : '=', p->peer_table->name);
|
|
}
|
|
|
|
static void
|
|
pipe_show_stats(struct pipe_proto *p)
|
|
{
|
|
struct proto_stats *s1 = &p->p.stats;
|
|
struct proto_stats *s2 = &p->peer_stats;
|
|
|
|
/*
|
|
* Pipe stats (as anything related to pipes) are a bit tricky. There
|
|
* are two sets of stats - s1 for ahook to the primary routing and
|
|
* s2 for the ahook to the secondary routing table. The user point
|
|
* of view is that routes going from the primary routing table to
|
|
* the secondary routing table are 'exported', while routes going in
|
|
* the other direction are 'imported'.
|
|
*
|
|
* Each route going through a pipe is, technically, first exported
|
|
* to the pipe and then imported from that pipe and such operations
|
|
* are counted in one set of stats according to the direction of the
|
|
* route propagation. Filtering is done just in the first part
|
|
* (export). Therefore, we compose stats for one directon for one
|
|
* user direction from both import and export stats, skipping
|
|
* immediate and irrelevant steps (exp_updates_accepted,
|
|
* imp_updates_received, imp_updates_filtered, ...).
|
|
*
|
|
* Rule of thumb is that stats s1 have the correct 'polarity'
|
|
* (imp/exp), while stats s2 have switched 'polarity'.
|
|
*/
|
|
|
|
cli_msg(-1006, " Routes: %u imported, %u exported",
|
|
s1->imp_routes, s2->imp_routes);
|
|
cli_msg(-1006, " Route change stats: received rejected filtered ignored accepted");
|
|
cli_msg(-1006, " Import updates: %10u %10u %10u %10u %10u",
|
|
s2->exp_updates_received, s2->exp_updates_rejected + s1->imp_updates_invalid,
|
|
s2->exp_updates_filtered, s1->imp_updates_ignored, s1->imp_updates_accepted);
|
|
cli_msg(-1006, " Import withdraws: %10u %10u --- %10u %10u",
|
|
s2->exp_withdraws_received, s1->imp_withdraws_invalid,
|
|
s1->imp_withdraws_ignored, s1->imp_withdraws_accepted);
|
|
cli_msg(-1006, " Export updates: %10u %10u %10u %10u %10u",
|
|
s1->exp_updates_received, s1->exp_updates_rejected + s2->imp_updates_invalid,
|
|
s1->exp_updates_filtered, s2->imp_updates_ignored, s2->imp_updates_accepted);
|
|
cli_msg(-1006, " Export withdraws: %10u %10u --- %10u %10u",
|
|
s1->exp_withdraws_received, s2->imp_withdraws_invalid,
|
|
s2->imp_withdraws_ignored, s2->imp_withdraws_accepted);
|
|
}
|
|
|
|
static void
|
|
pipe_show_proto_info(struct proto *P)
|
|
{
|
|
struct pipe_proto *p = (struct pipe_proto *) P;
|
|
struct pipe_config *cf = (struct pipe_config *) P->cf;
|
|
|
|
// cli_msg(-1006, " Table: %s", P->table->name);
|
|
// cli_msg(-1006, " Peer table: %s", p->peer_table->name);
|
|
cli_msg(-1006, " Preference: %d", P->preference);
|
|
cli_msg(-1006, " Input filter: %s", filter_name(cf->c.in_filter));
|
|
cli_msg(-1006, " Output filter: %s", filter_name(cf->c.out_filter));
|
|
|
|
proto_show_limit(cf->c.in_limit, "Import limit:");
|
|
proto_show_limit(cf->c.out_limit, "Export limit:");
|
|
|
|
if (P->proto_state != PS_DOWN)
|
|
pipe_show_stats(p);
|
|
}
|
|
|
|
|
|
struct protocol proto_pipe = {
|
|
name: "Pipe",
|
|
template: "pipe%d",
|
|
multitable: 1,
|
|
preference: DEF_PREF_PIPE,
|
|
postconfig: pipe_postconfig,
|
|
init: pipe_init,
|
|
start: pipe_start,
|
|
cleanup: pipe_cleanup,
|
|
reconfigure: pipe_reconfigure,
|
|
copy_config: pipe_copy_config,
|
|
get_status: pipe_get_status,
|
|
show_proto_info: pipe_show_proto_info
|
|
};
|