bird/proto/ospf/dbdes.c

366 lines
8.7 KiB
C
Raw Normal View History

/*
* BIRD -- OSPF
*
* (c) 1999-2000 Ondrej Filip <feela@network.cz>
*
* Can be freely distributed and used under the terms of the GNU GPL.
*/
#include "ospf.h"
void
ospf_dbdes_tx(struct ospf_neighbor *n)
{
struct ospf_dbdes_packet *pkt;
struct ospf_packet *op;
2000-05-11 07:42:37 +08:00
struct ospf_iface *ifa=n->ifa;
u16 length;
struct proto *p;
u16 i,j;
u8 *aa,*bb;
p=(struct proto *)(ifa->proto);
switch(n->state)
{
case NEIGHBOR_EXSTART: /* Send empty packets */
2000-03-29 20:45:37 +08:00
n->myimms.bit.i=1;
2000-03-29 08:34:28 +08:00
pkt=(struct ospf_dbdes_packet *)(ifa->ip_sk->tbuf);
op=(struct ospf_packet *)pkt;
2000-06-03 09:29:00 +08:00
fill_ospf_pkt_hdr(ifa, pkt, DBDES_P);
2000-03-29 20:47:07 +08:00
pkt->iface_mtu=htons(ifa->iface->mtu); /*FIXME NOT for VLINK! */
pkt->options= ifa->options;
pkt->imms=n->myimms;
pkt->ddseq=htonl(n->dds);
length=sizeof(struct ospf_dbdes_packet);
op->length=htons(length);
ospf_pkt_finalize(ifa, op);
sk_send_to(ifa->ip_sk,length, n->ip, OSPF_PROTO);
2000-05-11 07:42:37 +08:00
debug("%s: DB_DES (I) sent to %I via %s.\n", p->name, n->ip,
ifa->iface->name);
break;
case NEIGHBOR_EXCHANGE:
2000-03-29 20:45:37 +08:00
n->myimms.bit.i=0;
if(((n->myimms.bit.ms) && (n->dds==n->ddr+1)) ||
((!(n->myimms.bit.ms)) && (n->dds==n->ddr)))
{
snode *sn; /* Send next */
struct ospf_lsa_header *lsa;
2000-03-29 08:34:28 +08:00
pkt=n->ldbdes;
op=(struct ospf_packet *)pkt;
2000-06-03 09:29:00 +08:00
fill_ospf_pkt_hdr(ifa, pkt, DBDES_P);
2000-03-29 08:34:28 +08:00
pkt->iface_mtu=htons(ifa->iface->mtu);
pkt->options= ifa->options;
pkt->ddseq=htonl(n->dds);
j=i=(ifa->iface->mtu-sizeof(struct ospf_dbdes_packet)-SIPH)/
sizeof(struct ospf_lsa_header); /* Number of lsaheaders */
lsa=(n->ldbdes+sizeof(struct ospf_dbdes_packet));
if(n->myimms.bit.m)
{
2000-03-30 01:51:40 +08:00
sn=s_get(&(n->dbsi));
2000-03-30 01:51:40 +08:00
DBG("Number of LSA: %d\n", j);
for(;i>0;i--)
{
struct top_hash_entry *en;
2000-03-30 01:51:40 +08:00
en=(struct top_hash_entry *)sn;
htonlsah(&(en->lsa), lsa);
DBG("Working on: %d\n", i);
DBG("\tX%01x %08I %08I %p\n", en->lsa.type, en->lsa.id,
2000-03-30 01:51:40 +08:00
en->lsa.rt, en->lsa_body);
if(sn==STAIL(n->ifa->oa->lsal))
2000-03-30 01:51:40 +08:00
{
i--;
break; /* Should set some flag? */
2000-03-30 01:51:40 +08:00
}
sn=sn->next;
lsa++;
}
2000-03-29 08:34:28 +08:00
if(sn==STAIL(n->ifa->oa->lsal))
{
2000-03-30 01:51:40 +08:00
DBG("Number of LSA NOT sent: %d\n", i);
DBG("M bit unset.\n");
n->myimms.bit.m=0; /* Unset more bit */
}
else s_put(&(n->dbsi),sn);
}
2000-03-29 08:34:28 +08:00
2000-03-29 20:45:37 +08:00
pkt->imms.byte=n->myimms.byte;
2000-03-29 08:34:28 +08:00
length=(j-i)*sizeof(struct ospf_lsa_header)+
sizeof(struct ospf_dbdes_packet);
op->length=htons(length);
2000-03-29 20:45:37 +08:00
ospf_pkt_finalize(ifa, op);
2000-05-11 07:42:37 +08:00
DBG("%s: DB_DES (M) sent to %I.\n", p->name, n->ip);
}
case NEIGHBOR_LOADING:
case NEIGHBOR_FULL:
aa=ifa->ip_sk->tbuf;
bb=n->ldbdes;
2000-03-29 08:34:28 +08:00
op=n->ldbdes;
length=ntohs(op->length);
for(i=0; i<length; i++)
{
2000-03-29 20:45:37 +08:00
*(aa+i)=*(bb+i); /* Copy last sent packet again */
}
sk_send_to(ifa->ip_sk,length, n->ip, OSPF_PROTO);
2000-05-11 07:42:37 +08:00
debug("%s: DB_DES (M) sent to %I via %s.\n", p->name, n->ip,
ifa->iface->name);
if(n->myimms.bit.ms) tm_start(n->rxmt_timer,ifa->rxmtint);
else
{
if((n->myimms.bit.m==0) && (n->imms.bit.m==0) &&
(n->state==NEIGHBOR_EXCHANGE))
{
ospf_neigh_sm(n, INM_EXDONE);
if(n->myimms.bit.ms) tm_stop(n->rxmt_timer);
else tm_start(n->rxmt_timer,ifa->rxmtint);
}
}
break;
default: /* Ignore it */
die("Bug in dbdes sending\n");
break;
}
}
void
rxmt_timer_hook(timer *timer)
{
struct ospf_iface *ifa;
struct proto *p;
struct ospf_neighbor *n;
n=(struct ospf_neighbor *)timer->data;
ifa=n->ifa;
p=(struct proto *)(ifa->proto);
DBG("%s: RXMT timer fired on interface %s for neigh: %I.\n",
2000-05-10 20:22:00 +08:00
p->name, ifa->iface->name, n->ip);
if(n->state<NEIGHBOR_LOADING) ospf_dbdes_tx(n);
2000-03-30 01:51:40 +08:00
else
{
tm_stop(n->rxmt_timer);
/* FIXME I should dealloc ldbdes */
}
}
void
ospf_dbdes_reqladd(struct ospf_dbdes_packet *ps, struct proto *p,
struct ospf_neighbor *n)
{
struct ospf_lsa_header *plsa,lsa;
struct top_hash_entry *he,*sn;
struct top_graph *gr;
2000-03-30 08:18:59 +08:00
struct ospf_packet *op;
int i,j;
gr=n->ifa->oa->gr;
2000-03-30 08:18:59 +08:00
op=(struct ospf_packet *)ps;
plsa=(void *)(ps+1);
2000-03-30 08:18:59 +08:00
j=(ntohs(op->length)-sizeof(struct ospf_dbdes_packet))/
sizeof( struct ospf_lsa_header);
for(i=0;i<j;i++)
{
ntohlsah(plsa+i, &lsa);
if(((he=ospf_hash_find(gr,lsa.id,lsa.rt,lsa.type))==NULL)||
(lsa_comp(&lsa, &(he->lsa))==1))
{
/* Is this condition necessary? */
if(ospf_hash_find(n->lsrqh,lsa.id,lsa.rt,lsa.type)==NULL)
{
sn=ospf_hash_get(n->lsrqh,lsa.id,lsa.rt,lsa.type);
ntohlsah(plsa+i, &(sn->lsa));
s_add_tail(&(n->lsrql), SNODE sn);
}
/* FIXME and the next part of condition? */
}
2000-03-30 08:18:59 +08:00
}
}
void
ospf_dbdes_rx(struct ospf_dbdes_packet *ps, struct proto *p,
struct ospf_iface *ifa, u16 size)
{
u32 nrid, myrid;
struct ospf_neighbor *n;
u8 i;
nrid=ntohl(((struct ospf_packet *)ps)->routerid);
myrid=p->cf->global->router_id;
if((n=find_neigh(ifa, nrid))==NULL)
{
2000-05-11 07:42:37 +08:00
debug("%s: Received dbdes from unknown neigbor! %I\n", p->name,
nrid);
return ;
}
if(ifa->iface->mtu<size)
{
2000-05-10 20:22:00 +08:00
debug("%s: Received dbdes larger than MTU from %I!\n", p->name, n->ip);
return ;
}
2000-05-11 07:42:37 +08:00
debug("%s: Received dbdes from %I via %s.\n", p->name, n->ip,
ifa->iface->name);
2000-05-10 20:22:00 +08:00
switch(n->state)
{
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 > myrid) &&
(size == sizeof(struct ospf_dbdes_packet)))
{
/* I'm slave! */
n->dds=ntohl(ps->ddseq);
n->ddr=ntohl(ps->ddseq);
n->options=ps->options;
n->myimms.bit.ms=0;
n->imms.byte=ps->imms.byte;
2000-05-10 20:22:00 +08:00
debug("%s: I'm slave to %I. \n", p->name, n->ip);
ospf_neigh_sm(n, INM_NEGDONE);
tm_stop(n->rxmt_timer);
ospf_dbdes_tx(n);
break;
}
else
{
if(((ps->imms.bit.i==0) && (ps->imms.bit.ms==0)) &&
(n->rid < myrid) && (n->dds == ntohl(ps->ddseq)))
{
/* I'm master! */
n->options=ps->options;
n->ddr=ntohl(ps->ddseq)-1;
n->imms.byte=ps->imms.byte;
2000-04-19 02:29:50 +08:00
debug("%s: I'm master to %I. \n", p->name, nrid);
ospf_neigh_sm(n, INM_NEGDONE);
}
else
{
2000-05-10 20:22:00 +08:00
DBG("%s: Nothing happend to %I (imms=%u)\n", p->name, n->ip,
ps->imms.byte);
break;
}
}
2000-05-11 07:42:37 +08:00
if(ps->imms.bit.i) break;
case NEIGHBOR_EXCHANGE:
if((ps->imms.byte==n->imms.byte) && (ps->options=n->options) &&
(ntohl(ps->ddseq)==n->ddr))
{
/* Duplicate packet */
2000-05-10 20:22:00 +08:00
debug("%s: Received duplicate dbdes from %I!\n", p->name, n->ip);
if(n->imms.bit.ms==0)
{
ospf_dbdes_tx(n);
}
return;
}
n->ddr=ntohl(ps->ddseq);
if(ps->imms.bit.ms!=n->imms.bit.ms) /* M/S bit differs */
{
2000-05-11 07:42:37 +08:00
debug("SEQMIS-BIT-MS\n");
ospf_neigh_sm(n, INM_SEQMIS);
break;
}
if(ps->imms.bit.i) /* I bit is set */
{
2000-05-11 07:42:37 +08:00
debug("SEQMIS-BIT-I\n");
ospf_neigh_sm(n, INM_SEQMIS);
break;
}
2000-03-30 01:51:40 +08:00
n->imms.byte=ps->imms.byte;
if(ps->options!=n->options) /* Options differs */
{
2000-05-11 07:42:37 +08:00
debug("SEQMIS-OPT\n");
ospf_neigh_sm(n, INM_SEQMIS);
break;
}
if(n->myimms.bit.ms)
{
if(ntohl(ps->ddseq)!=n->dds) /* MASTER */
{
2000-05-11 07:42:37 +08:00
debug("SEQMIS-MASTER\n");
ospf_neigh_sm(n, INM_SEQMIS);
break;
}
n->dds++;
DBG("Incrementing dds\n");
ospf_dbdes_reqladd(ps,p,n);
if((n->myimms.bit.m==0) && (ps->imms.bit.m==0))
{
ospf_neigh_sm(n, INM_EXDONE);
}
else
{
ospf_dbdes_tx(n);
}
}
else
{
2000-03-30 01:51:40 +08:00
if(ntohl(ps->ddseq)!=(n->dds+1)) /* SLAVE */
{
2000-05-11 07:42:37 +08:00
debug("SEQMIS-SLAVE\n");
ospf_neigh_sm(n, INM_SEQMIS);
break;
}
2000-03-30 01:51:40 +08:00
n->ddr=ntohl(ps->ddseq);
n->dds=ntohl(ps->ddseq);
ospf_dbdes_reqladd(ps,p,n);
ospf_dbdes_tx(n);
}
break;
case NEIGHBOR_LOADING:
case NEIGHBOR_FULL:
if((ps->imms.byte==n->imms.byte) && (ps->options=n->options) &&
(ps->ddseq==n->dds)) /* Only duplicate are accepted */
{
2000-05-10 20:22:00 +08:00
debug("%s: Received duplicate dbdes from %I!\n", p->name, n->ip);
return;
}
else
{
2000-05-11 07:42:37 +08:00
debug("SEQMIS-FULL\n");
ospf_neigh_sm(n, INM_SEQMIS);
}
break;
defaut:
2000-05-10 20:22:00 +08:00
die("%s: Received dbdes from %I in unknown state.\n", p->name, n->ip);
break;
}
}