/* $OpenBSD: lsupdate.c,v 1.29 2006/03/13 09:36:06 claudio Exp $ */ /* * Copyright (c) 2005 Claudio Jeker * 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 #include #include "ospf.h" #include "ospfd.h" #include "log.h" #include "ospfe.h" #include "rde.h" extern struct ospfd_conf *oeconf; extern struct imsgbuf *ibuf_rde; struct buf *prepare_ls_update(struct iface *); int add_ls_update(struct buf *, struct iface *, void *, int, u_int16_t); int send_ls_update(struct buf *, struct iface *, struct in_addr, u_int32_t); void ls_retrans_list_insert(struct nbr *, struct lsa_entry *); void ls_retrans_list_remove(struct nbr *, struct lsa_entry *); /* link state update packet handling */ int lsa_flood(struct iface *iface, struct nbr *originator, struct lsa_hdr *lsa_hdr, void *data, u_int16_t len) { struct nbr *nbr; struct lsa_entry *le = NULL; int queued = 0, dont_ack = 0; int r; LIST_FOREACH(nbr, &iface->nbr_list, entry) { if (nbr == iface->self) continue; if (!(nbr->state & NBR_STA_FLOOD)) continue; if (iface->state & IF_STA_DROTHER && !queued) while ((le = ls_retrans_list_get(iface->self, lsa_hdr))) ls_retrans_list_free(iface->self, le); while ((le = ls_retrans_list_get(nbr, lsa_hdr))) ls_retrans_list_free(nbr, le); if (!(nbr->state & NBR_STA_FULL) && (le = ls_req_list_get(nbr, lsa_hdr)) != NULL) { r = lsa_newer(lsa_hdr, le->le_lsa); if (r > 0) { /* to flood LSA is newer than requested */ ls_req_list_free(nbr, le); /* new needs to be flooded */ } else if (r < 0) { /* to flood LSA is older than requested */ continue; } else { /* LSA are equal */ ls_req_list_free(nbr, le); continue; } } if (nbr == originator) { dont_ack++; continue; } /* non DR or BDR router keep all lsa in one retrans list */ if (iface->state & IF_STA_DROTHER) { if (!queued) ls_retrans_list_add(iface->self, data, iface->rxmt_interval, 0); queued = 1; } else { ls_retrans_list_add(nbr, data, iface->rxmt_interval, 0); queued = 1; } } if (!queued) return (0); if (iface == originator->iface && iface->self != originator) { if (iface->dr == originator || iface->bdr == originator) return (0); if (iface->state & IF_STA_BACKUP) return (0); dont_ack++; } /* * initial flood needs to be queued separately, timeout is zero * and oneshot has to be set because the retransimssion queues * are already loaded. */ switch (iface->type) { case IF_TYPE_POINTOPOINT: case IF_TYPE_BROADCAST: ls_retrans_list_add(iface->self, data, 0, 1); break; case IF_TYPE_NBMA: case IF_TYPE_POINTOMULTIPOINT: case IF_TYPE_VIRTUALLINK: LIST_FOREACH(nbr, &iface->nbr_list, entry) { if (nbr == iface->self) continue; if (!(nbr->state & NBR_STA_FLOOD)) continue; if (!TAILQ_EMPTY(&nbr->ls_retrans_list)) { le = TAILQ_LAST(&nbr->ls_retrans_list, lsa_head); 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) continue; } ls_retrans_list_add(nbr, data, 0, 1); } break; default: fatalx("lsa_flood: unknown interface type"); } return (dont_ack == 2); } struct buf * prepare_ls_update(struct iface *iface) { struct buf *buf; if ((buf = buf_open(iface->mtu - sizeof(struct ip))) == NULL) fatal("send_ls_update"); /* OSPF header */ if (gen_ospf_hdr(buf, iface, PACKET_TYPE_LS_UPDATE)) goto fail; /* reserve space for number of lsa field */ if (buf_reserve(buf, sizeof(u_int32_t)) == NULL) goto fail; return (buf); fail: log_warn("prepare_ls_update"); buf_free(buf); return (NULL); } int add_ls_update(struct buf *buf, struct iface *iface, void *data, int len, u_int16_t older) { size_t pos; u_int16_t age; if (buf->wpos + len >= buf->max - MD5_DIGEST_LENGTH) return (0); pos = buf->wpos; if (buf_add(buf, data, len)) { log_warn("add_ls_update"); return (0); } /* age LSA before sending it out */ memcpy(&age, data, sizeof(age)); age = ntohs(age); if ((age += older + iface->transmit_delay) >= MAX_AGE) age = MAX_AGE; age = htons(age); memcpy(buf_seek(buf, pos, sizeof(age)), &age, sizeof(age)); return (1); } int send_ls_update(struct buf *buf, struct iface *iface, struct in_addr addr, u_int32_t nlsa) { struct sockaddr_in dst; int ret; nlsa = htonl(nlsa); memcpy(buf_seek(buf, sizeof(struct ospf_hdr), sizeof(nlsa)), &nlsa, sizeof(nlsa)); /* update authentication and calculate checksum */ if (auth_gen(buf, iface)) goto fail; /* set destination */ dst.sin_family = AF_INET; dst.sin_len = sizeof(struct sockaddr_in); dst.sin_addr.s_addr = addr.s_addr; ret = send_packet(iface, buf->buf, buf->wpos, &dst); buf_free(buf); return (ret); fail: log_warn("send_ls_update"); buf_free(buf); return (-1); } void recv_ls_update(struct nbr *nbr, char *buf, u_int16_t len) { struct lsa_hdr lsa; u_int32_t nlsa; if (len < sizeof(nlsa)) { log_warnx("recv_ls_update: bad packet size, neighbor ID %s", inet_ntoa(nbr->id)); return; } memcpy(&nlsa, buf, sizeof(nlsa)); nlsa = ntohl(nlsa); buf += sizeof(nlsa); len -= sizeof(nlsa); 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_update: 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: for (; nlsa > 0 && len > 0; nlsa--) { if (len < sizeof(lsa)) { log_warnx("recv_ls_update: bad packet size, " "neighbor ID %s", inet_ntoa(nbr->id)); return; } memcpy(&lsa, buf, sizeof(lsa)); if (len < ntohs(lsa.len)) { log_warnx("recv_ls_update: bad packet size, " "neighbor ID %s", inet_ntoa(nbr->id)); return; } imsg_compose(ibuf_rde, IMSG_LS_UPD, nbr->peerid, 0, buf, ntohs(lsa.len)); buf += ntohs(lsa.len); len -= ntohs(lsa.len); } if (nlsa > 0 || len > 0) { log_warnx("recv_ls_update: bad packet size, " "neighbor ID %s", inet_ntoa(nbr->id)); return; } break; default: fatalx("recv_ls_update: unknown neighbor state"); } } /* link state retransmit list */ void ls_retrans_list_add(struct nbr *nbr, struct lsa_hdr *lsa, unsigned short timeout, unsigned short oneshot) { struct timeval tv; struct lsa_entry *le; struct lsa_ref *ref; if ((ref = lsa_cache_get(lsa)) == NULL) fatalx("King Bula sez: somebody forgot to lsa_cache_add"); if ((le = calloc(1, sizeof(*le))) == NULL) fatal("ls_retrans_list_add"); le->le_ref = ref; le->le_when = timeout; le->le_oneshot = oneshot; ls_retrans_list_insert(nbr, le); if (!evtimer_pending(&nbr->ls_retrans_timer, NULL)) { timerclear(&tv); tv.tv_sec = TAILQ_FIRST(&nbr->ls_retrans_list)->le_when; if (evtimer_add(&nbr->ls_retrans_timer, &tv) == -1) fatal("ls_retrans_list_add"); } } int ls_retrans_list_del(struct nbr *nbr, struct lsa_hdr *lsa_hdr) { struct lsa_entry *le; if ((le = ls_retrans_list_get(nbr, lsa_hdr)) == NULL) return (-1); if (lsa_hdr->seq_num == le->le_ref->hdr.seq_num && lsa_hdr->ls_chksum == le->le_ref->hdr.ls_chksum) { ls_retrans_list_free(nbr, le); return (0); } log_warnx("ls_retrans_list_del: invalid LS ack received, neighbor %s", inet_ntoa(nbr->id)); return (-1); } struct lsa_entry * ls_retrans_list_get(struct nbr *nbr, struct lsa_hdr *lsa_hdr) { struct lsa_entry *le; TAILQ_FOREACH(le, &nbr->ls_retrans_list, entry) { if ((lsa_hdr->type == le->le_ref->hdr.type) && (lsa_hdr->ls_id == le->le_ref->hdr.ls_id) && (lsa_hdr->adv_rtr == le->le_ref->hdr.adv_rtr)) return (le); } return (NULL); } void ls_retrans_list_insert(struct nbr *nbr, struct lsa_entry *new) { struct lsa_entry *le; unsigned short when = new->le_when; TAILQ_FOREACH(le, &nbr->ls_retrans_list, entry) { if (when < le->le_when) { new->le_when = when; TAILQ_INSERT_BEFORE(le, new, entry); nbr->ls_ret_cnt++; return; } when -= le->le_when; } new->le_when = when; TAILQ_INSERT_TAIL(&nbr->ls_retrans_list, new, entry); nbr->ls_ret_cnt++; } void ls_retrans_list_remove(struct nbr *nbr, struct lsa_entry *le) { struct timeval tv; struct lsa_entry *next = TAILQ_NEXT(le, entry); int reset = 0; /* adjust timeout of next entry */ if (next) next->le_when += le->le_when; if (TAILQ_FIRST(&nbr->ls_retrans_list) == le && evtimer_pending(&nbr->ls_retrans_timer, NULL)) reset = 1; TAILQ_REMOVE(&nbr->ls_retrans_list, le, entry); nbr->ls_ret_cnt--; if (reset && TAILQ_FIRST(&nbr->ls_retrans_list)) { if (evtimer_del(&nbr->ls_retrans_timer) == -1) fatal("ls_retrans_list_remove"); timerclear(&tv); tv.tv_sec = TAILQ_FIRST(&nbr->ls_retrans_list)->le_when; if (evtimer_add(&nbr->ls_retrans_timer, &tv) == -1) fatal("ls_retrans_list_remove"); } } void ls_retrans_list_free(struct nbr *nbr, struct lsa_entry *le) { ls_retrans_list_remove(nbr, le); lsa_cache_put(le->le_ref, nbr); free(le); } void ls_retrans_list_clr(struct nbr *nbr) { struct lsa_entry *le; while ((le = TAILQ_FIRST(&nbr->ls_retrans_list)) != NULL) ls_retrans_list_free(nbr, le); nbr->ls_ret_cnt = 0; } int ls_retrans_list_empty(struct nbr *nbr) { return (TAILQ_EMPTY(&nbr->ls_retrans_list)); } void ls_retrans_timer(int fd, short event, void *bula) { struct timeval tv; struct timespec tp; struct in_addr addr; struct nbr *nbr = bula; struct lsa_entry *le; struct buf *buf; time_t now; int d; u_int32_t nlsa = 0; if ((le = TAILQ_FIRST(&nbr->ls_retrans_list)) != NULL) le->le_when = 0; /* timer fired */ else return; /* queue empty, nothing to do */ clock_gettime(CLOCK_MONOTONIC, &tp); now = tp.tv_sec; if (nbr->iface->self == nbr) { /* * oneshot needs to be set for lsa queued for flooding, * if oneshot is not set then the lsa needs to be converted * because the router switched lately to DR or BDR */ if (le->le_oneshot && nbr->iface->state & IF_STA_DRORBDR) inet_aton(AllSPFRouters, &addr); else if (nbr->iface->state & IF_STA_DRORBDR) { /* * old retransmission needs to be converted into * flood by rerunning the lsa_flood. */ lsa_flood(nbr->iface, nbr, &le->le_ref->hdr, le->le_ref->data, le->le_ref->len); ls_retrans_list_free(nbr, le); /* ls_retrans_list_free retriggers the timer */ return; } else inet_aton(AllDRouters, &addr); } else memcpy(&addr, &nbr->addr, sizeof(addr)); if ((buf = prepare_ls_update(nbr->iface)) == NULL) { le->le_when = 1; goto done; } while ((le = TAILQ_FIRST(&nbr->ls_retrans_list)) != NULL && le->le_when == 0) { d = now - le->le_ref->stamp; if (d < 0) d = 0; else if (d > MAX_AGE) d = MAX_AGE; if (add_ls_update(buf, nbr->iface, le->le_ref->data, le->le_ref->len, d) == 0) break; nlsa++; if (le->le_oneshot) ls_retrans_list_free(nbr, le); else { TAILQ_REMOVE(&nbr->ls_retrans_list, le, entry); nbr->ls_ret_cnt--; le->le_when = nbr->iface->rxmt_interval; ls_retrans_list_insert(nbr, le); } } send_ls_update(buf, nbr->iface, addr, nlsa); done: if ((le = TAILQ_FIRST(&nbr->ls_retrans_list)) != NULL) { timerclear(&tv); tv.tv_sec = le->le_when; if (evtimer_add(&nbr->ls_retrans_timer, &tv) == -1) fatal("ls_retrans_timer"); } } LIST_HEAD(lsa_cache_head, lsa_ref); struct lsa_cache { struct lsa_cache_head *hashtbl; u_int32_t hashmask; } lsacache; struct lsa_ref *lsa_cache_look(struct lsa_hdr *); void lsa_cache_init(u_int32_t hashsize) { u_int32_t hs, i; for (hs = 1; hs < hashsize; hs <<= 1) ; lsacache.hashtbl = calloc(hs, sizeof(struct lsa_cache_head)); if (lsacache.hashtbl == NULL) fatal("lsa_cache_init"); for (i = 0; i < hs; i++) LIST_INIT(&lsacache.hashtbl[i]); lsacache.hashmask = hs - 1; } struct lsa_ref * lsa_cache_add(void *data, u_int16_t len) { struct lsa_cache_head *head; struct lsa_ref *ref, *old; struct timespec tp; if ((ref = calloc(1, sizeof(*ref))) == NULL) fatal("lsa_cache_add"); memcpy(&ref->hdr, data, sizeof(ref->hdr)); if ((old = lsa_cache_look(&ref->hdr))) { free(ref); old->refcnt++; return (old); } if ((ref->data = malloc(len)) == NULL) fatal("lsa_cache_add"); memcpy(ref->data, data, len); clock_gettime(CLOCK_MONOTONIC, &tp); ref->stamp = tp.tv_sec; ref->len = len; ref->refcnt = 1; head = &lsacache.hashtbl[hash32_buf(&ref->hdr, sizeof(ref->hdr), HASHINIT) & lsacache.hashmask]; LIST_INSERT_HEAD(head, ref, entry); return (ref); } struct lsa_ref * lsa_cache_get(struct lsa_hdr *lsa_hdr) { struct lsa_ref *ref; ref = lsa_cache_look(lsa_hdr); if (ref) ref->refcnt++; return (ref); } void lsa_cache_put(struct lsa_ref *ref, struct nbr *nbr) { if (--ref->refcnt > 0) return; if (ntohs(ref->hdr.age) >= MAX_AGE) ospfe_imsg_compose_rde(IMSG_LS_MAXAGE, nbr->peerid, 0, ref->data, sizeof(struct lsa_hdr)); free(ref->data); LIST_REMOVE(ref, entry); free(ref); } struct lsa_ref * lsa_cache_look(struct lsa_hdr *lsa_hdr) { struct lsa_cache_head *head; struct lsa_ref *ref; head = &lsacache.hashtbl[hash32_buf(lsa_hdr, sizeof(*lsa_hdr), HASHINIT) & lsacache.hashmask]; LIST_FOREACH(ref, head, entry) { if (memcmp(&ref->hdr, lsa_hdr, sizeof(*lsa_hdr)) == 0) /* found match */ return (ref); } return (NULL); }