bird/proto/ospf/lsack.c

192 lines
4.9 KiB
C
Raw Normal View History

2000-03-31 04:00:42 +08:00
/*
* BIRD -- OSPF
*
* (c) 2000-2004 Ondrej Filip <feela@network.cz>
2000-03-31 04:00:42 +08:00
*
* Can be freely distributed and used under the terms of the GNU GPL.
*/
#include "ospf.h"
2009-08-21 15:27:52 +08:00
struct ospf_lsack_packet
{
struct ospf_packet ospf_packet;
struct ospf_lsa_header lsh[];
};
2004-06-05 00:55:53 +08:00
char *s_queue[] = { "direct", "delayed" };
static void ospf_dump_lsack(struct proto *p, struct ospf_lsack_packet *pkt)
{
struct ospf_packet *op = &pkt->ospf_packet;
ASSERT(op->type == LSACK_P);
ospf_dump_common(p, op);
unsigned int i, j;
j = (ntohs(op->length) - sizeof(struct ospf_lsack_packet)) /
sizeof(struct ospf_lsa_header);
for (i = 0; i < j; i++)
2009-08-21 15:27:52 +08:00
ospf_dump_lsahdr(p, pkt->lsh + i);
}
/*
* =====================================
* Note, that h is in network endianity!
* =====================================
*/
2004-06-05 00:55:53 +08:00
void
2004-06-05 00:55:53 +08:00
ospf_lsack_enqueue(struct ospf_neighbor *n, struct ospf_lsa_header *h,
2004-06-05 01:05:24 +08:00
int queue)
{
2004-06-05 01:05:24 +08:00
struct lsah_n *no = mb_alloc(n->pool, sizeof(struct lsah_n));
2004-06-05 00:55:53 +08:00
memcpy(&no->lsa, h, sizeof(struct ospf_lsa_header));
add_tail(&n->ackl[queue], NODE no);
2009-07-23 22:51:28 +08:00
DBG("Adding (%s) ack for %R, ID: %R, RT: %R, Type: %u\n", s_queue[queue],
n->rid, ntohl(h->id), ntohl(h->rt), h->type);
}
void
ospf_lsack_send(struct ospf_neighbor *n, int queue)
{
struct ospf_packet *op;
struct ospf_lsack_packet *pk;
2004-06-05 00:55:53 +08:00
u16 len, i = 0;
struct ospf_lsa_header *h;
struct lsah_n *no;
2004-06-05 00:55:53 +08:00
struct ospf_iface *ifa = n->ifa;
struct proto *p = &n->ifa->oa->po->proto;
2004-06-05 00:55:53 +08:00
if (EMPTY_LIST(n->ackl[queue]))
return;
pk = ospf_tx_buffer();
op = &pk->ospf_packet;
ospf_pkt_fill_hdr(n->ifa, pk, LSACK_P);
2009-08-21 15:27:52 +08:00
h = pk->lsh;
2004-06-05 00:55:53 +08:00
while (!EMPTY_LIST(n->ackl[queue]))
{
2004-06-05 00:55:53 +08:00
no = (struct lsah_n *) HEAD(n->ackl[queue]);
memcpy(h + i, &no->lsa, sizeof(struct ospf_lsa_header));
2009-12-04 01:25:14 +08:00
DBG("Iter %u ID: %R, RT: %R, Type: %04x\n", i, ntohl((h + i)->id),
2009-07-23 22:51:28 +08:00
ntohl((h + i)->rt), (h + i)->type);
2009-12-04 01:25:14 +08:00
i++;
rem_node(NODE no);
mb_free(no);
2004-06-05 00:55:53 +08:00
if ((i * sizeof(struct ospf_lsa_header) +
sizeof(struct ospf_lsack_packet)) > ospf_pkt_maxsize(n->ifa))
{
2004-06-05 00:55:53 +08:00
if (!EMPTY_LIST(n->ackl[queue]))
{
2004-06-05 00:55:53 +08:00
len =
sizeof(struct ospf_lsack_packet) +
i * sizeof(struct ospf_lsa_header);
op->length = htons(len);
DBG("Sending and continuing! Len=%u\n", len);
OSPF_PACKET(ospf_dump_lsack, pk, "LSACK packet sent via %s", ifa->iface->name);
2004-06-05 00:55:53 +08:00
if (ifa->type == OSPF_IT_BCAST)
{
2004-06-05 00:55:53 +08:00
if ((ifa->state == OSPF_IS_DR) || (ifa->state == OSPF_IS_BACKUP))
ospf_send_to(ifa, AllSPFRouters);
else
ospf_send_to(ifa, AllDRouters);
}
else
{
2004-06-05 00:55:53 +08:00
if ((ifa->state == OSPF_IS_DR) || (ifa->state == OSPF_IS_BACKUP))
ospf_send_to_agt(ifa, NEIGHBOR_EXCHANGE);
else
ospf_send_to_bdr(ifa);
}
ospf_pkt_fill_hdr(n->ifa, pk, LSACK_P);
2004-06-05 00:55:53 +08:00
i = 0;
}
}
}
2004-06-05 00:55:53 +08:00
len = sizeof(struct ospf_lsack_packet) + i * sizeof(struct ospf_lsa_header);
op->length = htons(len);
DBG("Sending! Len=%u\n", len);
OSPF_PACKET(ospf_dump_lsack, pk, "LSACK packet sent via %s", ifa->iface->name);
2004-06-05 00:55:53 +08:00
if (ifa->type == OSPF_IT_BCAST)
{
2004-06-05 00:55:53 +08:00
if ((ifa->state == OSPF_IS_DR) || (ifa->state == OSPF_IS_BACKUP))
ospf_send_to(ifa, AllSPFRouters);
else
ospf_send_to(ifa, AllDRouters);
}
else
ospf_send_to_agt(ifa, NEIGHBOR_EXCHANGE);
2000-03-31 04:00:42 +08:00
}
void
2009-08-21 15:27:52 +08:00
ospf_lsack_receive(struct ospf_packet *ps_i, struct ospf_iface *ifa,
struct ospf_neighbor *n)
2000-03-31 04:00:42 +08:00
{
struct proto *p = &ifa->oa->po->proto;
2009-08-21 15:27:52 +08:00
struct ospf_lsa_header lsa;
2000-04-12 23:20:13 +08:00
struct top_hash_entry *en;
unsigned int i, lsano;
unsigned int size = ntohs(ps_i->length);
if (size < sizeof(struct ospf_lsack_packet))
{
log(L_ERR "Bad OSPF LSACK packet from %I - too short (%u B)", n->ip, size);
return;
}
2000-04-12 23:37:52 +08:00
struct ospf_lsack_packet *ps = (void *) ps_i;
OSPF_PACKET(ospf_dump_lsack, ps, "LSACK packet received from %I via %s", n->ip, ifa->iface->name);
ospf_neigh_sm(n, INM_HELLOREC);
2004-06-05 00:55:53 +08:00
if (n->state < NEIGHBOR_EXCHANGE)
return;
lsano = (size - sizeof(struct ospf_lsack_packet)) /
2000-04-12 23:20:13 +08:00
sizeof(struct ospf_lsa_header);
for (i = 0; i < lsano; i++)
2000-04-12 23:20:13 +08:00
{
2009-08-21 15:27:52 +08:00
ntohlsah(ps->lsh + i, &lsa);
2009-08-25 22:42:14 +08:00
u32 dom = ospf_lsa_domain(lsa.type, n->ifa);
if ((en = ospf_hash_find_header(n->lsrth, dom, &lsa)) == NULL)
2004-06-06 17:37:54 +08:00
continue; /* pg 155 */
2000-04-12 23:20:13 +08:00
if (lsa_comp(&lsa, &en->lsa) != CMP_SAME) /* pg 156 */
2000-04-12 23:20:13 +08:00
{
2004-06-05 00:55:53 +08:00
if ((lsa.sn == LSA_MAXSEQNO) && (lsa.age == LSA_MAXAGE))
continue;
2009-12-15 00:29:33 +08:00
OSPF_TRACE(D_PACKETS, "Strange LSACK from %I", n->ip);
OSPF_TRACE(D_PACKETS, "Type: %04x, Id: %R, Rt: %R",
lsa.type, lsa.id, lsa.rt);
OSPF_TRACE(D_PACKETS, "I have: Age: %4u, Seq: %08x, Sum: %04x",
2004-06-05 00:55:53 +08:00
en->lsa.age, en->lsa.sn, en->lsa.checksum);
2009-12-15 00:29:33 +08:00
OSPF_TRACE(D_PACKETS, "He has: Age: %4u, Seq: %08x, Sum: %04x",
2004-06-05 00:55:53 +08:00
lsa.age, lsa.sn, lsa.checksum);
2000-04-12 23:20:13 +08:00
continue;
}
2009-07-23 22:51:28 +08:00
DBG("Deleting LS Id: %R RT: %R Type: %u from LS Retl for neighbor %R\n",
lsa.id, lsa.rt, lsa.type, n->rid);
2000-04-12 23:20:13 +08:00
s_rem_node(SNODE en);
2004-06-05 00:55:53 +08:00
if (en->lsa_body != NULL)
mb_free(en->lsa_body);
en->lsa_body = NULL;
ospf_hash_delete(n->lsrth, en);
}
2000-03-31 04:00:42 +08:00
}