/* $OpenBSD: lsreq.c,v 1.11 2005/12/15 20:39:33 claudio Exp $ */ /* * Copyright (c) 2004, 2005 Esben Norby * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */ #include #include #include #include #include #include "ospfd.h" #include "ospf.h" #include "log.h" #include "ospfe.h" extern struct imsgbuf *ibuf_rde; /* link state request packet handling */ int send_ls_req(struct nbr *nbr) { struct sockaddr_in dst; struct ls_req_hdr ls_req_hdr; struct lsa_entry *le, *nle; struct buf *buf; int ret; if ((buf = buf_open(nbr->iface->mtu - sizeof(struct ip))) == NULL) fatal("send_ls_req"); /* set destination */ dst.sin_family = AF_INET; dst.sin_len = sizeof(struct sockaddr_in); switch (nbr->iface->type) { case IF_TYPE_POINTOPOINT: inet_aton(AllSPFRouters, &dst.sin_addr); break; case IF_TYPE_BROADCAST: case IF_TYPE_NBMA: case IF_TYPE_POINTOMULTIPOINT: case IF_TYPE_VIRTUALLINK: dst.sin_addr.s_addr = nbr->addr.s_addr; break; default: fatalx("send_ls_req: unknown interface type"); } /* OSPF header */ if (gen_ospf_hdr(buf, nbr->iface, PACKET_TYPE_LS_REQUEST)) goto fail; /* LSA header(s), keep space for a possible md5 sum */ for (le = TAILQ_FIRST(&nbr->ls_req_list); le != NULL && buf->wpos + sizeof(struct ls_req_hdr) < buf->max - MD5_DIGEST_LENGTH; le = nle) { nbr->ls_req = nle = TAILQ_NEXT(le, entry); ls_req_hdr.type = htonl(le->le_lsa->type); ls_req_hdr.ls_id = le->le_lsa->ls_id; ls_req_hdr.adv_rtr = le->le_lsa->adv_rtr; if (buf_add(buf, &ls_req_hdr, sizeof(ls_req_hdr))) goto fail; } /* update authentication and calculate checksum */ if (auth_gen(buf, nbr->iface)) goto fail; ret = send_packet(nbr->iface, buf->buf, buf->wpos, &dst); buf_free(buf); return (ret); fail: log_warn("send_ls_req"); buf_free(buf); return (-1); } void recv_ls_req(struct nbr *nbr, char *buf, u_int16_t len) { switch (nbr->state) { case NBR_STA_DOWN: case NBR_STA_ATTEMPT: case NBR_STA_INIT: case NBR_STA_2_WAY: case NBR_STA_XSTRT: case NBR_STA_SNAP: log_debug("recv_ls_req: packet ignored in state %s, " "neighbor ID %s", nbr_state_name(nbr->state), inet_ntoa(nbr->id)); break; case NBR_STA_XCHNG: case NBR_STA_LOAD: case NBR_STA_FULL: imsg_compose(ibuf_rde, IMSG_LS_REQ, nbr->peerid, 0, -1, buf, len); break; default: fatalx("recv_ls_req: unknown neighbor state"); } } /* link state request list */ void ls_req_list_add(struct nbr *nbr, struct lsa_hdr *lsa) { struct lsa_entry *le; if (lsa == NULL) fatalx("ls_req_list_add: no LSA header"); if ((le = calloc(1, sizeof(*le))) == NULL) fatal("ls_req_list_add"); TAILQ_INSERT_TAIL(&nbr->ls_req_list, le, entry); le->le_lsa = lsa; nbr->ls_req_cnt++; } struct lsa_entry * ls_req_list_get(struct nbr *nbr, struct lsa_hdr *lsa_hdr) { struct lsa_entry *le; TAILQ_FOREACH(le, &nbr->ls_req_list, entry) { if ((lsa_hdr->type == le->le_lsa->type) && (lsa_hdr->ls_id == le->le_lsa->ls_id) && (lsa_hdr->adv_rtr == le->le_lsa->adv_rtr)) return (le); } return (NULL); } void ls_req_list_free(struct nbr *nbr, struct lsa_entry *le) { if (nbr->ls_req == le) { nbr->ls_req = TAILQ_NEXT(le, entry); } TAILQ_REMOVE(&nbr->ls_req_list, le, entry); free(le->le_lsa); free(le); nbr->ls_req_cnt--; /* received all requested LSA(s), send a new LS req */ if (nbr->ls_req != NULL && nbr->ls_req == TAILQ_FIRST(&nbr->ls_req_list)) { start_ls_req_tx_timer(nbr); } if (ls_req_list_empty(nbr) && nbr->dd_pending == 0) nbr_fsm(nbr, NBR_EVT_LOAD_DONE); } void ls_req_list_clr(struct nbr *nbr) { struct lsa_entry *le; while ((le = TAILQ_FIRST(&nbr->ls_req_list)) != NULL) { TAILQ_REMOVE(&nbr->ls_req_list, le, entry); free(le->le_lsa); free(le); } nbr->ls_req_cnt = 0; nbr->ls_req = NULL; } int ls_req_list_empty(struct nbr *nbr) { return (TAILQ_EMPTY(&nbr->ls_req_list)); } /* timers */ void ls_req_tx_timer(int fd, short event, void *arg) { struct nbr *nbr = arg; struct timeval tv; switch (nbr->state) { case NBR_STA_DOWN: case NBR_STA_ATTEMPT: case NBR_STA_INIT: case NBR_STA_2_WAY: case NBR_STA_SNAP: case NBR_STA_XSTRT: case NBR_STA_XCHNG: return; case NBR_STA_LOAD: send_ls_req(nbr); break; case NBR_STA_FULL: return; default: log_debug("ls_req_tx_timer: unknown neighbor state, " "neighbor ID %s", inet_ntoa(nbr->id)); break; } /* reschedule lsreq_tx_timer */ if (nbr->state == NBR_STA_LOAD) { timerclear(&tv); tv.tv_sec = nbr->iface->rxmt_interval; evtimer_add(&nbr->lsreq_tx_timer, &tv); } } int start_ls_req_tx_timer(struct nbr *nbr) { struct timeval tv; if (nbr == nbr->iface->self) return (0); timerclear(&tv); return (evtimer_add(&nbr->lsreq_tx_timer, &tv)); } int stop_ls_req_tx_timer(struct nbr *nbr) { if (nbr == nbr->iface->self) return (0); return (evtimer_del(&nbr->lsreq_tx_timer)); }