bird/proto/ospf/dbdes.c

417 lines
10 KiB
C
Raw Normal View History

/*
* BIRD -- OSPF
*
2004-06-05 02:24:15 +08:00
* (c) 1999--2004 Ondrej Filip <feela@network.cz>
*
* Can be freely distributed and used under the terms of the GNU GPL.
*/
#include "ospf.h"
2009-08-21 15:27:52 +08:00
#ifdef OSPFv2
struct ospf_dbdes_packet
{
struct ospf_packet ospf_packet;
u16 iface_mtu;
u8 options;
union imms imms; /* I, M, MS bits */
u32 ddseq;
};
#define hton_opt(X) X
#define ntoh_opt(X) X
#endif
#ifdef OSPFv3
struct ospf_dbdes_packet
{
struct ospf_packet ospf_packet;
u32 options;
u16 iface_mtu;
u8 padding;
union imms imms; /* I, M, MS bits */
u32 ddseq;
};
#define hton_opt(X) htonl(X)
#define ntoh_opt(X) ntohl(X)
#endif
static void ospf_dump_dbdes(struct proto *p, struct ospf_dbdes_packet *pkt)
{
struct ospf_packet *op = &pkt->ospf_packet;
ASSERT(op->type == DBDES_P);
ospf_dump_common(p, op);
log(L_TRACE "%s: imms %s%s%s",
p->name, pkt->imms.bit.ms ? "MS " : "",
pkt->imms.bit.m ? "M " : "",
pkt->imms.bit.i ? "I " : "" );
log(L_TRACE "%s: ddseq %u", p->name, ntohl(pkt->ddseq));
struct ospf_lsa_header *plsa = (void *) (pkt + 1);
unsigned int i, j;
j = (ntohs(op->length) - sizeof(struct ospf_dbdes_packet)) /
sizeof(struct ospf_lsa_header);
for (i = 0; i < j; i++)
ospf_dump_lsahdr(p, plsa + i);
}
2000-06-08 06:53:51 +08:00
/**
2004-06-05 01:49:25 +08:00
* ospf_dbdes_send - transmit database description packet
2000-06-08 06:53:51 +08:00
* @n: neighbor
* @next: whether to send a next packet in a sequence (1) or to retransmit the old one (0)
2000-06-08 06:53:51 +08:00
*
2009-08-21 15:27:52 +08:00
* 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.
2000-06-08 06:53:51 +08:00
*/
void
ospf_dbdes_send(struct ospf_neighbor *n, int next)
{
struct ospf_dbdes_packet *pkt;
struct ospf_packet *op;
2004-06-05 01:49:25 +08:00
struct ospf_iface *ifa = n->ifa;
struct ospf_area *oa = ifa->oa;
struct proto_ospf *po = oa->po;
struct proto *p = &po->proto;
u16 length, i, j;
2009-08-25 22:42:14 +08:00
/* FIXME ??? */
if ((oa->rt == NULL) || (EMPTY_LIST(po->lsal)))
2009-08-25 22:42:14 +08:00
update_rt_lsa(oa);
2004-06-05 01:49:25 +08:00
switch (n->state)
{
2004-06-05 01:49:25 +08:00
case NEIGHBOR_EXSTART: /* Send empty packets */
n->myimms.bit.i = 1;
pkt = ospf_tx_buffer();
op = &pkt->ospf_packet;
ospf_pkt_fill_hdr(ifa, pkt, DBDES_P);
pkt->iface_mtu = htons(ifa->iface->mtu);
2009-08-21 15:27:52 +08:00
pkt->options = hton_opt(oa->options);
2004-06-05 01:49:25 +08:00
pkt->imms = n->myimms;
pkt->ddseq = htonl(n->dds);
length = sizeof(struct ospf_dbdes_packet);
op->length = htons(length);
OSPF_PACKET(ospf_dump_dbdes, pkt, "DBDES packet sent to %I via %s", n->ip, ifa->iface->name);
ospf_send_to(ifa, n->ip);
2004-06-05 01:49:25 +08:00
break;
case NEIGHBOR_EXCHANGE:
n->myimms.bit.i = 0;
if (next)
2004-06-05 01:49:25 +08:00
{
snode *sn;
2004-06-05 01:49:25 +08:00
struct ospf_lsa_header *lsa;
pkt = n->ldbdes;
op = (struct ospf_packet *) pkt;
ospf_pkt_fill_hdr(ifa, pkt, DBDES_P);
2004-06-05 01:49:25 +08:00
pkt->iface_mtu = htons(ifa->iface->mtu);
pkt->ddseq = htonl(n->dds);
2009-08-21 15:27:52 +08:00
pkt->options = hton_opt(oa->options);
j = i = (ospf_pkt_maxsize(ifa) - sizeof(struct ospf_dbdes_packet)) / sizeof(struct ospf_lsa_header); /* Number of possible lsaheaders to send */
2004-06-05 01:49:25 +08:00
lsa = (n->ldbdes + sizeof(struct ospf_dbdes_packet));
2004-06-05 01:49:25 +08:00
if (n->myimms.bit.m)
{
2004-06-05 01:49:25 +08:00
sn = s_get(&(n->dbsi));
DBG("Number of LSA: %d\n", j);
for (; i > 0; i--)
{
struct top_hash_entry *en= (struct top_hash_entry *) sn;
2009-08-21 15:27:52 +08:00
if (ospf_lsa_flooding_allowed(&en->lsa, en->domain, ifa))
{
htonlsah(&(en->lsa), lsa);
DBG("Working on: %d\n", i);
2009-07-23 22:51:28 +08:00
DBG("\tX%01x %-1R %-1R %p\n", en->lsa.type, en->lsa.id, en->lsa.rt, en->lsa_body);
lsa++;
}
else i++; /* No lsa added */
2000-03-29 08:34:28 +08:00
if (sn == STAIL(po->lsal))
{
i--;
break;
}
2004-06-05 01:49:25 +08:00
sn = sn->next;
}
2000-03-29 08:34:28 +08:00
if (sn == STAIL(po->lsal))
2004-06-05 01:49:25 +08:00
{
DBG("Number of LSA NOT sent: %d\n", i);
DBG("M bit unset.\n");
n->myimms.bit.m = 0; /* Unset more bit */
}
s_put(&(n->dbsi), sn);
}
2004-06-05 01:49:25 +08:00
pkt->imms.byte = n->myimms.byte;
2004-06-05 01:49:25 +08:00
length = (j - i) * sizeof(struct ospf_lsa_header) +
sizeof(struct ospf_dbdes_packet);
op->length = htons(length);
DBG("%s: DB_DES (M) prepared for %I.\n", p->name, n->ip);
}
case NEIGHBOR_LOADING:
case NEIGHBOR_FULL:
2004-06-06 17:37:54 +08:00
length = ntohs(((struct ospf_packet *) n->ldbdes)->length);
2004-06-05 01:49:25 +08:00
2004-06-06 17:37:54 +08:00
if (!length)
2004-06-05 02:51:29 +08:00
{
OSPF_TRACE(D_PACKETS, "No packet in my buffer for repeating");
ospf_neigh_sm(n, INM_KILLNBR);
2004-06-05 03:21:19 +08:00
return;
2004-06-05 02:51:29 +08:00
}
2004-06-06 17:37:54 +08:00
/* Copy last sent packet again */
pkt = ospf_tx_buffer();
memcpy(pkt, n->ldbdes, length);
OSPF_PACKET(ospf_dump_dbdes, pkt, "DBDES packet sent to %I via %s", n->ip, ifa->iface->name);
ospf_send_to(ifa, n->ip);
if(n->myimms.bit.ms) tm_start(n->rxmt_timer, n->ifa->rxmtint); /* Restart timer */
2004-06-05 01:49:25 +08:00
if (!n->myimms.bit.ms)
{
if ((n->myimms.bit.m == 0) && (n->imms.bit.m == 0) &&
(n->state == NEIGHBOR_EXCHANGE))
{
2004-06-05 01:49:25 +08:00
ospf_neigh_sm(n, INM_EXDONE);
}
2004-06-05 01:49:25 +08:00
}
break;
2004-06-05 01:49:25 +08:00
default: /* Ignore it */
break;
}
}
2004-06-05 17:58:23 +08:00
static void
2004-06-05 01:49:25 +08:00
ospf_dbdes_reqladd(struct ospf_dbdes_packet *ps, struct ospf_neighbor *n)
{
2004-06-05 01:49:25 +08:00
struct ospf_lsa_header *plsa, lsa;
struct top_hash_entry *he, *sn;
struct ospf_area *oa = n->ifa->oa;
struct top_graph *gr = oa->po->gr;
2000-03-30 08:18:59 +08:00
struct ospf_packet *op;
2004-06-05 01:49:25 +08:00
int i, j;
2004-06-05 01:49:25 +08:00
op = (struct ospf_packet *) ps;
2004-06-05 01:49:25 +08:00
plsa = (void *) (ps + 1);
2000-03-30 08:18:59 +08:00
2004-06-05 01:49:25 +08:00
j = (ntohs(op->length) - sizeof(struct ospf_dbdes_packet)) /
sizeof(struct ospf_lsa_header);
2000-03-30 08:18:59 +08:00
2004-06-05 01:49:25 +08:00
for (i = 0; i < j; i++)
2000-03-30 08:18:59 +08:00
{
2004-06-05 01:49:25 +08:00
ntohlsah(plsa + i, &lsa);
2009-08-25 22:42:14 +08:00
u32 dom = ospf_lsa_domain(lsa.type, n->ifa);
if (((he = ospf_hash_find_header(gr, dom, &lsa)) == NULL) ||
2004-06-05 01:49:25 +08:00
(lsa_comp(&lsa, &(he->lsa)) == 1))
{
/* Is this condition necessary? */
2009-08-25 22:42:14 +08:00
if (ospf_hash_find_header(n->lsrqh, dom, &lsa) == NULL)
{
2009-08-25 22:42:14 +08:00
sn = ospf_hash_get_header(n->lsrqh, dom, &lsa);
2004-06-05 01:49:25 +08:00
ntohlsah(plsa + i, &(sn->lsa));
s_add_tail(&(n->lsrql), SNODE sn);
}
}
2000-03-30 08:18:59 +08:00
}
}
void
2009-08-21 15:27:52 +08:00
ospf_dbdes_receive(struct ospf_packet *ps_i, struct ospf_iface *ifa,
struct ospf_neighbor *n)
{
struct proto_ospf *po = ifa->oa->po;
struct proto *p = &po->proto;
unsigned int size = ntohs(ps_i->length);
if (size < sizeof(struct ospf_dbdes_packet))
{
log(L_ERR "Bad OSPF DBDES packet from %I - too short (%u B)", n->ip, size);
return;
}
struct ospf_dbdes_packet *ps = (void *) ps_i;
2009-08-21 15:27:52 +08:00
u32 ps_ddseq = ntohl(ps->ddseq);
u32 ps_options = ntoh_opt(ps->options);
OSPF_PACKET(ospf_dump_dbdes, ps, "DBDES packet received from %I via %s", n->ip, ifa->iface->name);
ospf_neigh_sm(n, INM_HELLOREC);
2000-05-10 20:22:00 +08:00
2004-06-05 01:49:25 +08:00
switch (n->state)
{
2004-06-05 01:49:25 +08:00
case NEIGHBOR_DOWN:
case NEIGHBOR_ATTEMPT:
case NEIGHBOR_2WAY:
return;
break;
case NEIGHBOR_INIT:
ospf_neigh_sm(n, INM_2WAYREC);
if (n->state != NEIGHBOR_EXSTART)
return;
case NEIGHBOR_EXSTART:
if ((ps->imms.bit.m && ps->imms.bit.ms && ps->imms.bit.i)
&& (n->rid > po->router_id) && (size == sizeof(struct ospf_dbdes_packet)))
2004-06-05 01:49:25 +08:00
{
/* I'm slave! */
2009-08-21 15:27:52 +08:00
n->dds = ps_ddseq;
n->ddr = ps_ddseq;
n->options = ps_options;
2004-06-05 01:49:25 +08:00
n->myimms.bit.ms = 0;
n->imms.byte = ps->imms.byte;
OSPF_TRACE(D_PACKETS, "I'm slave to %I.", n->ip);
ospf_neigh_sm(n, INM_NEGDONE);
ospf_dbdes_send(n, 1);
break;
2004-06-05 01:49:25 +08:00
}
if (((ps->imms.bit.i == 0) && (ps->imms.bit.ms == 0)) &&
(n->rid < po->router_id) && (n->dds == ps_ddseq))
2004-06-05 01:49:25 +08:00
{
/* I'm master! */
2009-08-21 15:27:52 +08:00
n->options = ps_options;
n->ddr = ps_ddseq - 1; /* It will be set corectly a few lines down */
n->imms.byte = ps->imms.byte;
OSPF_TRACE(D_PACKETS, "I'm master to %I.", n->ip);
ospf_neigh_sm(n, INM_NEGDONE);
2004-06-05 01:49:25 +08:00
}
else
{
DBG("%s: Nothing happend to %I (imms=%u)\n", p->name, n->ip,
ps->imms.byte);
2004-06-05 01:49:25 +08:00
break;
}
2004-06-05 01:49:25 +08:00
case NEIGHBOR_EXCHANGE:
2009-08-21 15:27:52 +08:00
if ((ps->imms.byte == n->imms.byte) && (ps_options == n->options) &&
(ps_ddseq == n->ddr))
2004-06-05 01:49:25 +08:00
{
/* Duplicate packet */
OSPF_TRACE(D_PACKETS, "Received duplicate dbdes from %I.", n->ip);
if (n->myimms.bit.ms == 0)
2004-06-05 01:49:25 +08:00
{
/* Slave should retransmit dbdes packet */
ospf_dbdes_send(n, 0);
2004-06-05 01:49:25 +08:00
}
return;
}
2009-08-21 15:27:52 +08:00
n->ddr = ps_ddseq;
2004-06-05 01:49:25 +08:00
if (ps->imms.bit.ms != n->imms.bit.ms) /* M/S bit differs */
{
OSPF_TRACE(D_PACKETS, "dbdes - sequence mismatch neighbor %I (bit MS)",
n->ip);
ospf_neigh_sm(n, INM_SEQMIS);
break;
2004-06-05 01:49:25 +08:00
}
if (ps->imms.bit.i) /* I bit is set */
{
OSPF_TRACE(D_PACKETS, "dbdes - sequence mismatch neighbor %I (bit I)",
n->ip);
ospf_neigh_sm(n, INM_SEQMIS);
break;
2004-06-05 01:49:25 +08:00
}
n->imms.byte = ps->imms.byte;
2009-08-21 15:27:52 +08:00
if (ps_options != n->options) /* Options differs */
2004-06-05 01:49:25 +08:00
{
OSPF_TRACE(D_PACKETS, "dbdes - sequence mismatch neighbor %I (options)",
n->ip);
ospf_neigh_sm(n, INM_SEQMIS);
break;
2004-06-05 01:49:25 +08:00
}
2004-06-05 01:49:25 +08:00
if (n->myimms.bit.ms)
{
2009-08-21 15:27:52 +08:00
if (ps_ddseq != n->dds) /* MASTER */
2004-06-05 01:49:25 +08:00
{
OSPF_TRACE(D_PACKETS,
"dbdes - sequence mismatch neighbor %I (master)", n->ip);
ospf_neigh_sm(n, INM_SEQMIS);
break;
}
n->dds++;
DBG("Incrementing dds\n");
ospf_dbdes_reqladd(ps, n);
if ((n->myimms.bit.m == 0) && (ps->imms.bit.m == 0))
{
ospf_neigh_sm(n, INM_EXDONE);
}
else
{
ospf_dbdes_send(n, 1);
2004-06-05 01:49:25 +08:00
}
}
else
{
2009-08-21 15:27:52 +08:00
if (ps_ddseq != (n->dds + 1)) /* SLAVE */
2004-06-05 01:49:25 +08:00
{
OSPF_TRACE(D_PACKETS, "dbdes - sequence mismatch neighbor %I (slave)",
n->ip);
ospf_neigh_sm(n, INM_SEQMIS);
break;
}
2009-08-21 15:27:52 +08:00
n->ddr = ps_ddseq;
n->dds = ps_ddseq;
2004-06-05 01:49:25 +08:00
ospf_dbdes_reqladd(ps, n);
ospf_dbdes_send(n, 1);
2004-06-05 01:49:25 +08:00
}
break;
case NEIGHBOR_LOADING:
case NEIGHBOR_FULL:
2009-08-21 15:27:52 +08:00
if ((ps->imms.byte == n->imms.byte) && (ps_options == n->options)
&& (ps_ddseq == n->ddr))
2004-06-05 01:49:25 +08:00
/* Only duplicate are accepted */
{
OSPF_TRACE(D_PACKETS, "Received duplicate dbdes from %I.", n->ip);
if (n->myimms.bit.ms == 0)
{
/* Slave should retransmit dbdes packet */
ospf_dbdes_send(n, 0);
}
2004-06-05 01:49:25 +08:00
return;
}
else
{
OSPF_TRACE(D_PACKETS, "dbdes - sequence mismatch neighbor %I (full)",
n->ip);
2009-08-21 15:27:52 +08:00
DBG("PS=%u, DDR=%u, DDS=%u\n", ps_ddseq, n->ddr, n->dds);
2004-06-05 01:49:25 +08:00
ospf_neigh_sm(n, INM_SEQMIS);
}
break;
2004-06-05 17:29:38 +08:00
default:
2004-06-05 01:49:25 +08:00
bug("Received dbdes from %I in undefined state.", n->ip);
}
}