static int
ospf6_spf_calculation_thread (struct thread *t)
{
struct ospf6_area *oa;
struct timeval start, end, runtime;
oa = (struct ospf6_area *) THREAD_ARG (t);
oa->thread_spf_calculation = NULL;
if (IS_OSPF6_DEBUG_SPF (PROCESS))
zlog_debug ("SPF calculation for Area %s", oa->name);
if (IS_OSPF6_DEBUG_SPF (DATABASE))
ospf6_spf_log_database (oa);
/* execute SPF calculation */
quagga_gettime (QUAGGA_CLK_MONOTONIC, &start);
ospf6_spf_calculation (oa->ospf6->router_id, oa->spf_table, oa);
quagga_gettime (QUAGGA_CLK_MONOTONIC, &end);
timersub (&end, &start, &runtime);
if (IS_OSPF6_DEBUG_SPF (PROCESS) || IS_OSPF6_DEBUG_SPF (TIME))
zlog_debug ("SPF runtime: %ld sec %ld usec",
runtime.tv_sec, runtime.tv_usec);
ospf6_intra_route_calculation (oa);
ospf6_intra_brouter_calculation (oa);
return 0;
}
static void
ospf6_nexthop_calc (struct ospf6_vertex *w, struct ospf6_vertex *v,
caddr_t lsdesc)
{
int i;
ifindex_t ifindex;
struct ospf6_interface *oi;
u_int16_t type;
u_int32_t adv_router;
struct ospf6_lsa *lsa;
struct ospf6_link_lsa *link_lsa;
char buf[64];
assert (VERTEX_IS_TYPE (ROUTER, w));
ifindex = (VERTEX_IS_TYPE (NETWORK, v) ? v->nexthop[0].ifindex :
/* v is the local router & the interface_id is a local ifindex */
(ifindex_t) ROUTER_LSDESC_GET_IFID (lsdesc));
assert (ifindex >= 0);
oi = ospf6_interface_lookup_by_ifindex (ifindex);
if (oi == NULL)
{
if (IS_OSPF6_DEBUG_SPF (PROCESS))
zlog_debug ("Can't find interface in SPF: ifindex %d", ifindex);
return;
}
type = htons (OSPF6_LSTYPE_LINK);
adv_router = (VERTEX_IS_TYPE (NETWORK, v) ?
NETWORK_LSDESC_GET_NBR_ROUTERID (lsdesc) :
ROUTER_LSDESC_GET_NBR_ROUTERID (lsdesc));
i = 0;
for (lsa = ospf6_lsdb_type_router_head (type, adv_router, oi->lsdb); lsa;
lsa = ospf6_lsdb_type_router_next (type, adv_router, lsa))
{
if (VERTEX_IS_TYPE (ROUTER, v) &&
htonl (ROUTER_LSDESC_GET_NBR_IFID (lsdesc)) != lsa->header->id)
continue;
link_lsa = (struct ospf6_link_lsa *) OSPF6_LSA_HEADER_END (lsa->header);
if (IS_OSPF6_DEBUG_SPF (PROCESS))
{
inet_ntop (AF_INET6, &link_lsa->linklocal_addr, buf, sizeof (buf));
zlog_debug (" nexthop %s from %s", buf, lsa->name);
}
if (i < OSPF6_MULTI_PATH_LIMIT)
{
memcpy (&w->nexthop[i].address, &link_lsa->linklocal_addr,
sizeof (struct in6_addr));
w->nexthop[i].ifindex = ifindex;
i++;
}
}
if (i == 0 && IS_OSPF6_DEBUG_SPF (PROCESS))
zlog_debug ("No nexthop for %s found", w->name);
}
static char *
ospf6_lsdesc_backlink (struct ospf6_lsa *lsa,
caddr_t lsdesc, struct ospf6_vertex *v)
{
caddr_t backlink, found = NULL;
int size;
size = (OSPF6_LSA_IS_TYPE (ROUTER, lsa) ?
sizeof (struct ospf6_router_lsdesc) :
sizeof (struct ospf6_network_lsdesc));
for (backlink = OSPF6_LSA_HEADER_END (lsa->header) + 4;
backlink + size <= OSPF6_LSA_END (lsa->header); backlink += size)
{
assert (! (OSPF6_LSA_IS_TYPE (NETWORK, lsa) &&
VERTEX_IS_TYPE (NETWORK, v)));
if (OSPF6_LSA_IS_TYPE (NETWORK, lsa) &&
NETWORK_LSDESC_GET_NBR_ROUTERID (backlink)
== v->lsa->header->adv_router)
found = backlink;
else if (VERTEX_IS_TYPE (NETWORK, v) &&
ROUTER_LSDESC_IS_TYPE (TRANSIT_NETWORK, backlink) &&
ROUTER_LSDESC_GET_NBR_ROUTERID (backlink)
== v->lsa->header->adv_router &&
ROUTER_LSDESC_GET_NBR_IFID (backlink)
== ntohl (v->lsa->header->id))
found = backlink;
else
{
if (! ROUTER_LSDESC_IS_TYPE (POINTTOPOINT, backlink) ||
! ROUTER_LSDESC_IS_TYPE (POINTTOPOINT, lsdesc))
continue;
if (ROUTER_LSDESC_GET_NBR_IFID (backlink) !=
ROUTER_LSDESC_GET_IFID (lsdesc) ||
ROUTER_LSDESC_GET_NBR_IFID (lsdesc) !=
ROUTER_LSDESC_GET_IFID (backlink))
continue;
if (ROUTER_LSDESC_GET_NBR_ROUTERID (backlink) !=
v->lsa->header->adv_router ||
ROUTER_LSDESC_GET_NBR_ROUTERID (lsdesc) !=
lsa->header->adv_router)
continue;
found = backlink;
}
}
if (IS_OSPF6_DEBUG_SPF (PROCESS))
zlog_debug (" Backlink %s", (found ? "OK" : "FAIL"));
return found;
}
static struct ospf6_lsa *
ospf6_lsdesc_lsa (caddr_t lsdesc, struct ospf6_vertex *v)
{
struct ospf6_lsa *lsa;
u_int16_t type = 0;
u_int32_t id = 0, adv_router = 0;
if (VERTEX_IS_TYPE (NETWORK, v))
{
type = htons (OSPF6_LSTYPE_ROUTER);
id = htonl (0);
adv_router = NETWORK_LSDESC_GET_NBR_ROUTERID (lsdesc);
}
else
{
if (ROUTER_LSDESC_IS_TYPE (POINTTOPOINT, lsdesc))
{
type = htons (OSPF6_LSTYPE_ROUTER);
id = htonl (0);
adv_router = ROUTER_LSDESC_GET_NBR_ROUTERID (lsdesc);
}
else if (ROUTER_LSDESC_IS_TYPE (TRANSIT_NETWORK, lsdesc))
{
type = htons (OSPF6_LSTYPE_NETWORK);
id = htonl (ROUTER_LSDESC_GET_NBR_IFID (lsdesc));
adv_router = ROUTER_LSDESC_GET_NBR_ROUTERID (lsdesc);
}
}
lsa = ospf6_lsdb_lookup (type, id, adv_router, v->area->lsdb);
if (IS_OSPF6_DEBUG_SPF (PROCESS))
{
char ibuf[16], abuf[16];
inet_ntop (AF_INET, &id, ibuf, sizeof (ibuf));
inet_ntop (AF_INET, &adv_router, abuf, sizeof (abuf));
if (lsa)
zlog_debug (" Link to: %s", lsa->name);
else
zlog_debug (" Link to: [%s Id:%s Adv:%s] No LSA",
ospf6_lstype_name (type), ibuf, abuf);
}
return lsa;
}
/* RFC2740 3.8.1. Calculating the shortest path tree for an area */
void
ospf6_spf_calculation (u_int32_t router_id,
struct ospf6_route_table *result_table,
struct ospf6_area *oa)
{
struct pqueue *candidate_list;
struct ospf6_vertex *root, *v, *w;
int i;
int size;
caddr_t lsdesc;
struct ospf6_lsa *lsa;
/* Install the calculating router itself as the root of the SPF tree */
/* construct root vertex */
lsa = ospf6_lsdb_lookup (htons (OSPF6_LSTYPE_ROUTER), htonl (0),
router_id, oa->lsdb);
if (lsa == NULL)
return;
/* initialize */
candidate_list = pqueue_create ();
candidate_list->cmp = ospf6_vertex_cmp;
ospf6_spf_table_finish (result_table);
root = ospf6_vertex_create (lsa);
root->area = oa;
root->cost = 0;
root->hops = 0;
root->nexthop[0].ifindex = 0; /* loopbak I/F is better ... */
inet_pton (AF_INET6, "::1", &root->nexthop[0].address);
/* Actually insert root to the candidate-list as the only candidate */
pqueue_enqueue (root, candidate_list);
/* Iterate until candidate-list becomes empty */
while (candidate_list->size)
{
/* get closest candidate from priority queue */
v = pqueue_dequeue (candidate_list);
/* installing may result in merging or rejecting of the vertex */
if (ospf6_spf_install (v, result_table) < 0)
continue;
/* For each LS description in the just-added vertex V's LSA */
size = (VERTEX_IS_TYPE (ROUTER, v) ?
sizeof (struct ospf6_router_lsdesc) :
sizeof (struct ospf6_network_lsdesc));
for (lsdesc = OSPF6_LSA_HEADER_END (v->lsa->header) + 4;
lsdesc + size <= OSPF6_LSA_END (v->lsa->header); lsdesc += size)
{
lsa = ospf6_lsdesc_lsa (lsdesc, v);
if (lsa == NULL)
continue;
if (! ospf6_lsdesc_backlink (lsa, lsdesc, v))
continue;
w = ospf6_vertex_create (lsa);
w->area = oa;
w->parent = v;
if (VERTEX_IS_TYPE (ROUTER, v))
{
w->cost = v->cost + ROUTER_LSDESC_GET_METRIC (lsdesc);
w->hops = v->hops + (VERTEX_IS_TYPE (NETWORK, w) ? 0 : 1);
}
else /* NETWORK */
{
w->cost = v->cost;
w->hops = v->hops + 1;
}
/* nexthop calculation */
if (w->hops == 0)
w->nexthop[0].ifindex = ROUTER_LSDESC_GET_IFID (lsdesc);
else if (w->hops == 1 && v->hops == 0)
ospf6_nexthop_calc (w, v, lsdesc);
else
{
for (i = 0; ospf6_nexthop_is_set (&v->nexthop[i]) &&
i < OSPF6_MULTI_PATH_LIMIT; i++)
ospf6_nexthop_copy (&w->nexthop[i], &v->nexthop[i]);
}
/* add new candidate to the candidate_list */
if (IS_OSPF6_DEBUG_SPF (PROCESS))
zlog_debug (" New candidate: %s hops %d cost %d",
w->name, w->hops, w->cost);
pqueue_enqueue (w, candidate_list);
}
}
pqueue_delete (candidate_list);
}
static int
ospf6_spf_install (struct ospf6_vertex *v,
struct ospf6_route_table *result_table)
{
struct ospf6_route *route;
int i, j;
struct ospf6_vertex *prev;
if (IS_OSPF6_DEBUG_SPF (PROCESS))
zlog_debug ("SPF install %s hops %d cost %d",
v->name, v->hops, v->cost);
route = ospf6_route_lookup (&v->vertex_id, result_table);
if (route && route->path.cost < v->cost)
{
if (IS_OSPF6_DEBUG_SPF (PROCESS))
zlog_debug (" already installed with lower cost (%d), ignore",
route->path.cost);
ospf6_vertex_delete (v);
return -1;
}
else if (route && route->path.cost == v->cost)
{
if (IS_OSPF6_DEBUG_SPF (PROCESS))
zlog_debug (" another path found, merge");
for (i = 0; ospf6_nexthop_is_set (&v->nexthop[i]) &&
i < OSPF6_MULTI_PATH_LIMIT; i++)
{
for (j = 0; j < OSPF6_MULTI_PATH_LIMIT; j++)
{
if (ospf6_nexthop_is_set (&route->nexthop[j]))
{
if (ospf6_nexthop_is_same (&route->nexthop[j],
&v->nexthop[i]))
break;
else
continue;
}
ospf6_nexthop_copy (&route->nexthop[j], &v->nexthop[i]);
break;
}
}
prev = (struct ospf6_vertex *) route->route_option;
assert (prev->hops <= v->hops);
ospf6_vertex_delete (v);
return -1;
}
/* There should be no case where candidate being installed (variable
"v") is closer than the one in the SPF tree (variable "route").
In the case something has gone wrong with the behavior of
Priority-Queue. */
/* the case where the route exists already is handled and returned
up to here. */
assert (route == NULL);
route = ospf6_route_create ();
memcpy (&route->prefix, &v->vertex_id, sizeof (struct prefix));
route->type = OSPF6_DEST_TYPE_LINKSTATE;
route->path.type = OSPF6_PATH_TYPE_INTRA;
route->path.origin.type = v->lsa->header->type;
route->path.origin.id = v->lsa->header->id;
route->path.origin.adv_router = v->lsa->header->adv_router;
route->path.metric_type = 1;
route->path.cost = v->cost;
route->path.cost_e2 = v->hops;
route->path.router_bits = v->capability;
route->path.options[0] = v->options[0];
route->path.options[1] = v->options[1];
route->path.options[2] = v->options[2];
for (i = 0; ospf6_nexthop_is_set (&v->nexthop[i]) &&
i < OSPF6_MULTI_PATH_LIMIT; i++)
ospf6_nexthop_copy (&route->nexthop[i], &v->nexthop[i]);
if (v->parent)
listnode_add_sort (v->parent->child_list, v);
route->route_option = v;
ospf6_route_add (route, result_table);
return 0;
}
/* Add schedule for SPF calculation. To avoid frequenst SPF calc, we
set timer for SPF calc. */
void
ospf6_spf_schedule (struct ospf6 *ospf6, unsigned int reason)
{
unsigned long delay, elapsed, ht;
struct timeval now, result;
ospf6_set_spf_reason(ospf6, reason);
if (IS_OSPF6_DEBUG_SPF(PROCESS) || IS_OSPF6_DEBUG_SPF (TIME))
{
char rbuf[32];
ospf6_spf_reason_string(reason, rbuf, sizeof(rbuf));
zlog_debug ("SPF: calculation timer scheduled (reason %s)", rbuf);
}
/* OSPF instance does not exist. */
if (ospf6 == NULL)
return;
/* SPF calculation timer is already scheduled. */
if (ospf6->t_spf_calc)
{
if (IS_OSPF6_DEBUG_SPF(PROCESS) || IS_OSPF6_DEBUG_SPF (TIME))
zlog_debug ("SPF: calculation timer is already scheduled: %p",
(void *)ospf6->t_spf_calc);
return;
}
/* XXX Monotic timers: we only care about relative time here. */
now = recent_relative_time ();
timersub (&now, &ospf6->ts_spf, &result);
elapsed = (result.tv_sec * 1000) + (result.tv_usec / 1000);
ht = ospf6->spf_holdtime * ospf6->spf_hold_multiplier;
if (ht > ospf6->spf_max_holdtime)
ht = ospf6->spf_max_holdtime;
/* Get SPF calculation delay time. */
if (elapsed < ht)
{
/* Got an event within the hold time of last SPF. We need to
* increase the hold_multiplier, if it's not already at/past
* maximum value, and wasn't already increased..
*/
if (ht < ospf6->spf_max_holdtime)
ospf6->spf_hold_multiplier++;
/* always honour the SPF initial delay */
if ( (ht - elapsed) < ospf6->spf_delay)
delay = ospf6->spf_delay;
else
delay = ht - elapsed;
}
else
{
/* Event is past required hold-time of last SPF */
delay = ospf6->spf_delay;
ospf6->spf_hold_multiplier = 1;
}
if (IS_OSPF6_DEBUG_SPF(PROCESS) || IS_OSPF6_DEBUG_SPF (TIME))
zlog_debug ("SPF: calculation timer delay = %ld", delay);
zlog_info ("SPF: Scheduled in %ld msec", delay);
ospf6->t_spf_calc =
thread_add_timer_msec (master, ospf6_spf_calculation_thread, ospf6, delay);
}
static int
ospf6_spf_calculation_thread (struct thread *t)
{
struct ospf6_area *oa;
struct ospf6 *ospf6;
struct timeval start, end, runtime;
struct listnode *node;
struct ospf6_route *route;
int areas_processed = 0;
char rbuf[32];
ospf6 = (struct ospf6 *)THREAD_ARG (t);
ospf6->t_spf_calc = NULL;
/* execute SPF calculation */
quagga_gettime (QUAGGA_CLK_MONOTONIC, &start);
for (ALL_LIST_ELEMENTS_RO(ospf6->area_list, node, oa))
{
if (oa == ospf6->backbone)
continue;
if (IS_OSPF6_DEBUG_SPF (PROCESS))
zlog_debug ("SPF calculation for Area %s", oa->name);
if (IS_OSPF6_DEBUG_SPF (DATABASE))
ospf6_spf_log_database (oa);
ospf6_spf_calculation (ospf6->router_id, oa->spf_table, oa);
ospf6_intra_route_calculation (oa);
ospf6_intra_brouter_calculation (oa);
areas_processed++;
}
if (ospf6->backbone)
{
if (IS_OSPF6_DEBUG_SPF (PROCESS))
zlog_debug ("SPF calculation for Backbone area %s",
ospf6->backbone->name);
if (IS_OSPF6_DEBUG_SPF (DATABASE))
ospf6_spf_log_database(ospf6->backbone);
ospf6_spf_calculation(ospf6->router_id, ospf6->backbone->spf_table,
ospf6->backbone);
ospf6_intra_route_calculation(ospf6->backbone);
ospf6_intra_brouter_calculation(ospf6->backbone);
areas_processed++;
}
/* Redo summaries if required */
for (route = ospf6_route_head (ospf6->route_table); route;
route = ospf6_route_next (route))
ospf6_abr_originate_summary(route);
quagga_gettime (QUAGGA_CLK_MONOTONIC, &end);
timersub (&end, &start, &runtime);
ospf6->ts_spf_duration = runtime;
ospf6_spf_reason_string(ospf6->spf_reason, rbuf, sizeof(rbuf));
if (IS_OSPF6_DEBUG_SPF (PROCESS) || IS_OSPF6_DEBUG_SPF (TIME))
zlog_debug ("SPF runtime: %lld sec %lld usec",
(long long)runtime.tv_sec, (long long)runtime.tv_usec);
zlog_info("SPF processing: # Areas: %d, SPF runtime: %lld sec %lld usec, "
"Reason: %s\n", areas_processed,
(long long)runtime.tv_sec, (long long)runtime.tv_usec,
rbuf);
ospf6->last_spf_reason = ospf6->spf_reason;
ospf6_reset_spf_reason(ospf6);
return 0;
}