/* * BIRD -- OSPF * * (c) 2000-2004 Ondrej Filip * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "ospf.h" char *s_queue[] = { "direct", "delayed" }; /* * ===================================== * Note, that h is in network endianity! * ===================================== */ void ospf_lsack_enqueue(struct ospf_neighbor *n, struct ospf_lsa_header *h, int queue) { struct lsah_n *no = mb_alloc(n->pool, sizeof(struct lsah_n)); memcpy(&no->lsa, h, sizeof(struct ospf_lsa_header)); add_tail(&n->ackl[queue], NODE no); DBG("Adding (%s) ack for %I, ID: %I, RT: %I, 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; sock *sk; u16 len, i = 0; struct ospf_lsa_header *h; struct lsah_n *no; struct ospf_iface *ifa = n->ifa; struct proto *p = &n->ifa->proto->proto; if (EMPTY_LIST(n->ackl[queue])) return; OSPF_TRACE(D_PACKETS, "LS ack sent to %I (%s)", n->ip, s_queue[queue]); if (ifa->type == OSPF_IT_BCAST) sk = ifa->hello_sk; else sk = ifa->ip_sk; pk = (struct ospf_lsack_packet *) sk->tbuf; op = (struct ospf_packet *) sk->tbuf; fill_ospf_pkt_hdr(n->ifa, pk, LSACK_P); h = (struct ospf_lsa_header *) (pk + 1); while (!EMPTY_LIST(n->ackl[queue])) { no = (struct lsah_n *) HEAD(n->ackl[queue]); memcpy(h + i, &no->lsa, sizeof(struct ospf_lsa_header)); i++; DBG("Iter %u ID: %I, RT: %I, Type: %u\n", i, ntohl((h + i)->id), ntohl((h + i)->rt), (h + i)->type); rem_node(NODE no); mb_free(no); if ((i * sizeof(struct ospf_lsa_header) + sizeof(struct ospf_lsack_packet) + SIPH) > n->ifa->iface->mtu) { if (!EMPTY_LIST(n->ackl[queue])) { len = sizeof(struct ospf_lsack_packet) + i * sizeof(struct ospf_lsa_header); op->length = htons(len); ospf_pkt_finalize(n->ifa, op); DBG("Sending and continuing! Len=%u\n", len); if (ifa->type == OSPF_IT_BCAST) { if ((ifa->state == OSPF_IS_DR) || (ifa->state == OSPF_IS_BACKUP)) sk_send_to(sk, len, AllSPFRouters, OSPF_PROTO); else sk_send_to(sk, len, AllDRouters, OSPF_PROTO); } else { if ((ifa->state == OSPF_IS_DR) || (ifa->state == OSPF_IS_BACKUP)) sk_send_to_agt(sk, len, ifa, NEIGHBOR_EXCHANGE); else sk_send_to_bdr(sk, len, ifa); } fill_ospf_pkt_hdr(n->ifa, pk, LSACK_P); i = 0; } } } len = sizeof(struct ospf_lsack_packet) + i * sizeof(struct ospf_lsa_header); op->length = htons(len); ospf_pkt_finalize(n->ifa, op); DBG("Sending! Len=%u\n", len); if (ifa->type == OSPF_IT_BCAST) { if ((ifa->state == OSPF_IS_DR) || (ifa->state == OSPF_IS_BACKUP)) { sk_send_to(sk, len, AllSPFRouters, OSPF_PROTO); } else { sk_send_to(sk, len, AllDRouters, OSPF_PROTO); } } else { sk_send_to_agt(sk, len, ifa, NEIGHBOR_EXCHANGE); } } void ospf_lsack_receive(struct ospf_lsack_packet *ps, struct ospf_iface *ifa, struct ospf_neighbor *n) { struct ospf_lsa_header lsa, *plsa; u16 nolsa; struct top_hash_entry *en; struct proto *p = (struct proto *) ifa->proto; unsigned int size = ntohs(ps->ospf_packet.length), i; OSPF_TRACE(D_PACKETS, "Received LS ack from %I", n->ip); ospf_neigh_sm(n, INM_HELLOREC); if (n->state < NEIGHBOR_EXCHANGE) return; nolsa = (size - sizeof(struct ospf_lsack_packet)) / sizeof(struct ospf_lsa_header); if ((nolsa < 1) || ((size - sizeof(struct ospf_lsack_packet)) != (nolsa * sizeof(struct ospf_lsa_header)))) { log(L_ERR "Received corrupted LS ack from %I", n->ip); return; } plsa = (struct ospf_lsa_header *) (ps + 1); for (i = 0; i < nolsa; i++) { ntohlsah(plsa + i, &lsa); if ((en = ospf_hash_find_header(n->lsrth, &lsa)) == NULL) continue; /* pg 155 */ if (lsa_comp(&lsa, &en->lsa) != CMP_SAME) /* pg 156 */ { if ((lsa.sn == LSA_MAXSEQNO) && (lsa.age == LSA_MAXAGE)) continue; OSPF_TRACE(D_PACKETS, "Strange LS acknoledgement from %I", n->ip); OSPF_TRACE(D_PACKETS, "Id: %I, Rt: %I, Type: %u", lsa.id, lsa.rt, lsa.type); OSPF_TRACE(D_PACKETS, "I have: Age: %4u, Seqno: 0x%08x, Sum: %u", en->lsa.age, en->lsa.sn, en->lsa.checksum); OSPF_TRACE(D_PACKETS, "He has: Age: %4u, Seqno: 0x%08x, Sum: %u", lsa.age, lsa.sn, lsa.checksum); continue; } DBG("Deleting LS Id: %I RT: %I Type: %u from LS Retl for neighbor %I\n", lsa.id, lsa.rt, lsa.type, n->rid); s_rem_node(SNODE en); if (en->lsa_body != NULL) mb_free(en->lsa_body); en->lsa_body = NULL; ospf_hash_delete(n->lsrth, en); } }