/* * BIRD -- OSPF * * (c) 2000 Ondrej Filip <feela@network.cz> * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "ospf.h" void init_infib(struct fib_node *fn) { struct infib *f=(struct infib *)fn; f->metric=LSINFINITY; f->en=NULL; } void ospf_rt_spfa(struct ospf_area *oa) { struct top_hash_entry *en, *nx; u32 i,*rts; struct ospf_lsa_rt *rt; struct ospf_lsa_rt_link *rtl,*rr; struct fib *in=&oa->infib; struct infib *nf; bird_clock_t delta; int age=0,flush=0; struct proto *p=&oa->po->proto; ip_addr ip; struct fib_iterator fit; struct ospf_lsa_net *ln; flush=can_flush_lsa(oa); if((delta=now-oa->lage)>=AGINGDELTA) { oa->lage=now; age=1; } WALK_SLIST_DELSAFE(SNODE en, nx, oa->lsal) { en->color=OUTSPF; en->dist=LSINFINITY; if(age) ospf_age(en,delta,flush,oa); } FIB_WALK(in,nftmp) { nf=(struct infib *)nftmp; nf->metric=LSINFINITY; } FIB_WALK_END; init_list(&oa->cand); /* Empty list of candidates */ oa->trcap=0; DBG("LSA db prepared, adding me into candidate list.\n"); oa->rt->dist=0; oa->rt->color=CANDIDATE; add_head(&oa->cand, &oa->rt->cn); DBG("RT LSA: rt: %I, id: %I, type: %u\n",oa->rt->lsa.rt,oa->rt->lsa.id,oa->rt->lsa.type); while(!EMPTY_LIST(oa->cand)) { struct top_hash_entry *act,*tmp; node *n; u16 met; n=HEAD(oa->cand); act=SKIP_BACK(struct top_hash_entry, cn, n); rem_node(n); DBG("Working on LSA: rt: %I, id: %I, type: %u\n",act->lsa.rt,act->lsa.id,act->lsa.type); act->color=INSPF; switch(act->lsa.type) { case LSA_T_RT: rt=(struct ospf_lsa_rt *)act->lsa_body; if((rt->VEB)&(1>>LSA_RT_V)) oa->trcap=1; rr=(struct ospf_lsa_rt_link *)(rt+1); DBG(" Number of links: %u\n",rt->links); for(i=0;i<rt->links;i++) { tmp=NULL; rtl=(rr+i); DBG(" Working on link: %I (type: %u) ",rtl->id,rtl->type); switch(rtl->type) { case LSART_STUB: /* FIXME add stub network into fib */ DBG("\n"); ip=ipa_from_u32(rtl->id); nf=fib_get(in,&ip, ipa_mklen(ipa_from_u32(rtl->data))); if(nf->metric>(met=act->dist+rtl->metric)) { nf->metric=met; nf->en=act; } break; case LSART_VLNK: DBG("Ignoring\n"); continue; break; case LSART_NET: tmp=ospf_hash_find(oa->gr,rtl->id,rtl->id,LSA_T_NET); if(tmp==NULL) DBG("Fuck!\n"); else DBG("Found. :-)\n"); break; case LSART_PTP: /* FIXME */ tmp=ospf_hash_find(oa->gr,rtl->id,rtl->id,LSA_T_RT); DBG("PTP searched.\n"); break; default: log("Unknown link type in router lsa.\n"); break; } add_cand(&oa->cand,tmp,act,act->dist+rtl->metric,oa); } break; case LSA_T_NET: /* FIXME Add to fib */ ln=act->lsa_body; ip=ipa_and(ipa_from_u32(act->lsa.id),ln->netmask); nf=fib_get(in,&ip, ipa_mklen(ln->netmask)); if(nf->metric>act->dist) { nf->metric=act->dist; nf->en=act; } rts=(u32 *)(ln+1); for(i=0;i<(act->lsa.length-sizeof(struct ospf_lsa_header)- sizeof(struct ospf_lsa_net))/sizeof(u32);i++) { DBG(" Working on router %I ",*(rts+i)); tmp=ospf_hash_find(oa->gr, *(rts+i), *(rts+i), LSA_T_RT); if(tmp!=NULL) DBG("Found :-)\n"); else DBG("Fuck!\n"); add_cand(&oa->cand,tmp,act,act->dist,oa); } break; } } /* Now sync our fib with nest's */ DBG("\nNow syncing my rt table with nest's\n\n"); FIB_ITERATE_INIT(&fit,in); again: FIB_ITERATE_START(in,&fit,nftmp) { nf=(struct infib *)nftmp; if(nf->metric==LSINFINITY) { net *ne; rta a0; struct top_hash_entry *en=nf->en; ln=en->lsa_body; bzero(&a0, sizeof(a0)); a0.proto=p; a0.source=RTS_OSPF; a0.scope=SCOPE_UNIVERSE; /* What's this good for? */ a0.cast=RTC_UNICAST; a0.dest=RTD_ROUTER; a0.flags=0; a0.aflags=0; a0.iface=en->nhi; a0.gw=en->nh; a0.from=en->nh; /* FIXME Just a test */ ne=net_get(p->table, nf->fn.prefix, nf->fn.pxlen); DBG("Deleting rt entry %I\n (IP: %I, GW: %I, Iface: %s)\n", nf->fn.prefix,ip,en->nh,en->nhi->name); rte_update(p->table, ne, p, NULL); /* Now delete my fib */ FIB_ITERATE_PUT(&fit, nftmp); fib_delete(in, nftmp); goto again; } else { /* Update routing table */ if(nf->en->nhi!=NULL) { net *ne; rta a0; rte *e; struct top_hash_entry *en=nf->en; ln=en->lsa_body; bzero(&a0, sizeof(a0)); a0.proto=p; a0.source=RTS_OSPF; a0.scope=SCOPE_UNIVERSE; /* What's this good for? */ a0.cast=RTC_UNICAST; a0.dest=RTD_ROUTER; a0.flags=0; a0.aflags=0; a0.iface=en->nhi; a0.gw=en->nh; a0.from=en->nh; /* FIXME Just a test */ ne=net_get(p->table, nf->fn.prefix, nf->fn.pxlen); e=rte_get_temp(&a0); e->u.ospf.metric1=nf->metric; e->u.ospf.metric2=0; e->u.ospf.tag=0; /* FIXME Some config? */ e->pflags = 0; e->net=ne; e->pref = p->preference; DBG("Modifying rt entry %I\n (IP: %I, GW: %I, Iface: %s)\n", nf->fn.prefix,ip,en->nh,en->nhi->name); rte_update(p->table, ne, p, e); } } } FIB_ITERATE_END(nftmp); } void add_cand(list *l, struct top_hash_entry *en, struct top_hash_entry *par, u16 dist, struct ospf_area *oa) { node *prev,*n; int flag=0,added=0; struct top_hash_entry *act; struct proto *p=&oa->po->proto; if(en==NULL) return; if(en->lsa.age==LSA_MAXAGE) return; /* FIXME Does it have link back? Test it! */ if(en->color==INSPF) return; if(dist>=en->dist) return; /* * FIXME The line above is not a bug, but we don't support * multiple next hops. I'll start as soon as nest will */ DBG(" Adding candidate: rt: %I, id: %I, type: %u\n",en->lsa.rt,en->lsa.id,en->lsa.type); en->nhi=NULL; calc_next_hop(par,en,oa); if(en->color==CANDIDATE) /* We found a shorter path */ { rem_node(&en->cn); } en->dist=dist; en->color=CANDIDATE; prev=NULL; if(EMPTY_LIST(*l)) { add_head(l,&en->cn); } else { WALK_LIST(n,*l) { act=SKIP_BACK(struct top_hash_entry, cn, n); if((act->dist>dist)|| ((act->dist==dist)&&(act->lsa.type==LSA_T_NET))) { if(prev==NULL) add_head(l,&en->cn); else insert_node(&en->cn,prev); added=1; break; } prev=n; } if(!added) { add_tail(l,&en->cn); } } /* FIXME Some VLINK staff should be here */ } void calc_next_hop(struct top_hash_entry *par, struct top_hash_entry *en, struct ospf_area *oa) { struct ospf_neighbor *neigh; struct proto *p=&oa->po->proto; struct proto_ospf *po=oa->po; DBG(" Next hop called\n"); if(par==oa->rt) return; if(par->nhi==NULL) { neighbor *nn; DBG(" Next hop calculating for id: %I rt: %I type: %u\n",en->lsa.id,en->lsa.rt,en->lsa.type); if(par->lsa.type!=LSA_T_RT) return; if((neigh=find_neigh_noifa(po,par->lsa.rt))==NULL) return; nn=neigh_find(p,&neigh->ip,0); DBG(" Next hop calculated: %I\n", nn->addr); en->nh=nn->addr; en->nhi=nn->iface; return; } en->nh=par->nh; en->nhi=par->nhi; DBG(" Next hop calculated: %I\n", en->nh); }