]>
git.ipfire.org Git - thirdparty/bird.git/blob - proto/ospf/ospf.c
4 * (c) 1999--2004 Ondrej Filip <feela@network.cz>
5 * (c) 2009--2014 Ondrej Zajicek <santiago@crfreenet.org>
6 * (c) 2009--2014 CZ.NIC z.s.p.o.
8 * Can be freely distributed and used under the terms of the GNU GPL.
12 * DOC: Open Shortest Path First (OSPF)
14 * The OSPF protocol is quite complicated and its complex implemenation is split
15 * to many files. In |ospf.c|, you will find mainly the interface for
16 * communication with the core (e.g., reconfiguration hooks, shutdown and
17 * initialisation and so on). File |iface.c| contains the interface state
18 * machine and functions for allocation and deallocation of OSPF's interface
19 * data structures. Source |neighbor.c| includes the neighbor state machine and
20 * functions for election of Designated Router and Backup Designated router. In
21 * |packet.c|, you will find various functions for sending and receiving generic
22 * OSPF packets. There are also routines for authentication and checksumming.
23 * In |hello.c|, there are routines for sending and receiving of hello packets
24 * as well as functions for maintaining wait times and the inactivity timer.
25 * Files |lsreq.c|, |lsack.c|, |dbdes.c| contain functions for sending and
26 * receiving of link-state requests, link-state acknowledgements and database
27 * descriptions respectively. In |lsupd.c|, there are functions for sending and
28 * receiving of link-state updates and also the flooding algorithm. Source
29 * |topology.c| is a place where routines for searching LSAs in the link-state
30 * database, adding and deleting them reside, there also are functions for
31 * originating of various types of LSAs (router LSA, net LSA, external LSA).
32 * File |rt.c| contains routines for calculating the routing table. |lsalib.c|
33 * is a set of various functions for working with the LSAs (endianity
34 * conversions, calculation of checksum etc.).
36 * One instance of the protocol is able to hold LSA databases for multiple OSPF
37 * areas, to exchange routing information between multiple neighbors and to
38 * calculate the routing tables. The core structure is &ospf_proto to which
39 * multiple &ospf_area and &ospf_iface structures are connected. &ospf_proto is
40 * also connected to &top_hash_graph which is a dynamic hashing structure that
41 * describes the link-state database. It allows fast search, addition and
42 * deletion. Each LSA is kept in two pieces: header and body. Both of them are
43 * kept in the endianity of the CPU.
45 * In OSPFv2 specification, it is implied that there is one IP prefix for each
46 * physical network/interface (unless it is an ptp link). But in modern systems,
47 * there might be more independent IP prefixes associated with an interface. To
48 * handle this situation, we have one &ospf_iface for each active IP prefix
49 * (instead for each active iface); This behaves like virtual interface for the
50 * purpose of OSPF. If we receive packet, we associate it with a proper virtual
51 * interface mainly according to its source address.
53 * OSPF keeps one socket per &ospf_iface. This allows us (compared to one socket
54 * approach) to evade problems with a limit of multicast groups per socket and
55 * with sending multicast packets to appropriate interface in a portable way.
56 * The socket is associated with underlying physical iface and should not
57 * receive packets received on other ifaces (unfortunately, this is not true on
58 * BSD). Generally, one packet can be received by more sockets (for example, if
59 * there are more &ospf_iface on one physical iface), therefore we explicitly
60 * filter received packets according to src/dst IP address and received iface.
62 * Vlinks are implemented using particularly degenerate form of &ospf_iface,
63 * which has several exceptions: it does not have its iface or socket (it copies
64 * these from 'parent' &ospf_iface) and it is present in iface list even when
65 * down (it is not freed in ospf_iface_down()).
67 * The heart beat of ospf is ospf_disp(). It is called at regular intervals
68 * (&ospf_proto->tick). It is responsible for aging and flushing of LSAs in the
69 * database, updating topology information in LSAs and for routing table
72 * To every &ospf_iface, we connect one or more &ospf_neighbor's -- a structure
73 * containing many timers and queues for building adjacency and for exchange of
76 * BIRD's OSPF implementation respects RFC2328 in every detail, but some of
77 * internal algorithms do differ. The RFC recommends making a snapshot of the
78 * link-state database when a new adjacency is forming and sending the database
79 * description packets based on the information in this snapshot. The database
80 * can be quite large in some networks, so rather we walk through a &slist
81 * structure which allows us to continue even if the actual LSA we were working
82 * with is deleted. New LSAs are added at the tail of this &slist.
84 * We also do not keep a separate OSPF routing table, because the core helps us
85 * by being able to recognize when a route is updated to an identical one and it
86 * suppresses the update automatically. Due to this, we can flush all the routes
87 * we have recalculated and also those we have deleted to the core's routing
88 * table and the core will take care of the rest. This simplifies the process
89 * and conserves memory.
91 * Supported standards:
92 * - RFC 2328 - main OSPFv2 standard
93 * - RFC 5340 - main OSPFv3 standard
94 * - RFC 3101 - OSPFv2 NSSA areas
95 * - RFC 5709 - OSPFv2 HMAC-SHA Cryptographic Authentication
96 * - RFC 5838 - OSPFv3 Support of Address Families
97 * - RFC 6549 - OSPFv2 Multi-Instance Extensions
98 * - RFC 6987 - OSPF Stub Router Advertisement
104 static int ospf_import_control(struct proto
*P
, rte
**new, struct linpool
*pool
);
105 static struct ea_list
*ospf_make_tmp_attrs(struct rte
*rt
, struct linpool
*pool
);
106 static void ospf_store_tmp_attrs(struct rte
*rt
);
107 static void ospf_reload_routes(struct channel
*C
);
108 static int ospf_rte_better(struct rte
*new, struct rte
*old
);
109 static int ospf_rte_same(struct rte
*new, struct rte
*old
);
110 static void ospf_disp(timer
*timer
);
114 add_area_nets(struct ospf_area
*oa
, struct ospf_area_config
*ac
)
116 struct ospf_proto
*p
= oa
->po
;
117 struct area_net_config
*anc
;
120 fib_init(&oa
->net_fib
, p
->p
.pool
, ospf_get_af(p
),
121 sizeof(struct area_net
), OFFSETOF(struct area_net
, fn
), 0, NULL
);
122 fib_init(&oa
->enet_fib
, p
->p
.pool
, ospf_get_af(p
),
123 sizeof(struct area_net
), OFFSETOF(struct area_net
, fn
), 0, NULL
);
125 WALK_LIST(anc
, ac
->net_list
)
127 an
= fib_get(&oa
->net_fib
, &anc
->prefix
);
128 an
->hidden
= anc
->hidden
;
131 WALK_LIST(anc
, ac
->enet_list
)
133 an
= fib_get(&oa
->enet_fib
, &anc
->prefix
);
134 an
->hidden
= anc
->hidden
;
140 ospf_opts(struct ospf_proto
*p
)
145 return ((ospf_is_ip6(p
) && !p
->af_mc
) ? OPT_V6
: 0) |
146 (!p
->stub_router
? OPT_R
: 0) | (p
->af_ext
? OPT_AF
: 0);
150 ospf_area_add(struct ospf_proto
*p
, struct ospf_area_config
*ac
)
152 struct ospf_area
*oa
;
154 OSPF_TRACE(D_EVENTS
, "Adding area %R", ac
->areaid
);
156 oa
= mb_allocz(p
->p
.pool
, sizeof(struct ospf_area
));
157 add_tail(&p
->area_list
, NODE oa
);
161 oa
->areaid
= ac
->areaid
;
164 fib_init(&oa
->rtr
, p
->p
.pool
, NET_IP4
, sizeof(ort
), OFFSETOF(ort
, fn
), 0, NULL
);
165 add_area_nets(oa
, ac
);
170 oa
->options
= ac
->type
| ospf_opts(p
);
172 ospf_notify_rt_lsa(oa
);
176 ospf_flush_area(struct ospf_proto
*p
, u32 areaid
)
178 struct top_hash_entry
*en
;
180 WALK_SLIST(en
, p
->lsal
)
181 if ((LSA_SCOPE(en
->lsa_type
) == LSA_SCOPE_AREA
) && (en
->domain
== areaid
))
182 ospf_flush_lsa(p
, en
);
186 ospf_area_remove(struct ospf_area
*oa
)
188 struct ospf_proto
*p
= oa
->po
;
189 OSPF_TRACE(D_EVENTS
, "Removing area %R", oa
->areaid
);
191 /* We suppose that interfaces are already removed */
192 ospf_flush_area(p
, oa
->areaid
);
195 fib_free(&oa
->net_fib
);
196 fib_free(&oa
->enet_fib
);
198 if (oa
->translator_timer
)
199 rfree(oa
->translator_timer
);
208 ospf_find_area(struct ospf_proto
*p
, u32 aid
)
210 struct ospf_area
*oa
;
211 WALK_LIST(oa
, p
->area_list
)
212 if (((struct ospf_area
*) oa
)->areaid
== aid
)
217 static struct ospf_iface
*
218 ospf_find_vlink(struct ospf_proto
*p
, u32 voa
, u32 vid
)
220 struct ospf_iface
*ifa
;
221 WALK_LIST(ifa
, p
->iface_list
)
222 if ((ifa
->type
== OSPF_IT_VLINK
) && (ifa
->voa
->areaid
== voa
) && (ifa
->vid
== vid
))
228 ospf_start(struct proto
*P
)
230 struct ospf_proto
*p
= (struct ospf_proto
*) P
;
231 struct ospf_config
*c
= (struct ospf_config
*) (P
->cf
);
232 struct ospf_area_config
*ac
;
234 p
->router_id
= proto_get_router_id(P
->cf
);
236 p
->af_ext
= c
->af_ext
;
238 p
->rfc1583
= c
->rfc1583
;
239 p
->stub_router
= c
->stub_router
;
240 p
->merge_external
= c
->merge_external
;
244 p
->disp_timer
= tm_new_init(P
->pool
, ospf_disp
, p
, p
->tick S
, 0);
245 tm_start(p
->disp_timer
, 100 MS
);
248 p
->lsab
= mb_alloc(P
->pool
, p
->lsab_size
);
249 p
->nhpool
= lp_new(P
->pool
, 12*sizeof(struct nexthop
));
250 init_list(&(p
->iface_list
));
251 init_list(&(p
->area_list
));
252 fib_init(&p
->rtf
, P
->pool
, ospf_get_af(p
), sizeof(ort
), OFFSETOF(ort
, fn
), 0, NULL
);
254 idm_init(&p
->idm
, P
->pool
, 16);
256 p
->gr
= ospf_top_new(p
, P
->pool
);
257 s_init_list(&(p
->lsal
));
259 p
->flood_event
= ev_new(P
->pool
);
260 p
->flood_event
->hook
= ospf_flood_event
;
261 p
->flood_event
->data
= p
;
263 p
->log_pkt_tbf
= (struct tbf
){ .rate
= 1, .burst
= 5 };
264 p
->log_lsa_tbf
= (struct tbf
){ .rate
= 4, .burst
= 20 };
266 WALK_LIST(ac
, c
->area_list
)
267 ospf_area_add(p
, ac
);
270 ospf_open_vlink_sk(p
);
272 /* Add all virtual links */
273 struct ospf_iface_patt
*ic
;
274 WALK_LIST(ic
, c
->vlink_list
)
275 ospf_iface_new_vlink(p
, ic
);
281 ospf_dump(struct proto
*P
)
283 struct ospf_proto
*p
= (struct ospf_proto
*) P
;
284 struct ospf_iface
*ifa
;
285 struct ospf_neighbor
*n
;
287 OSPF_TRACE(D_EVENTS
, "Area number: %d", p
->areano
);
289 WALK_LIST(ifa
, p
->iface_list
)
291 OSPF_TRACE(D_EVENTS
, "Interface: %s", ifa
->ifname
);
292 OSPF_TRACE(D_EVENTS
, "state: %u", ifa
->state
);
293 OSPF_TRACE(D_EVENTS
, "DR: %R", ifa
->drid
);
294 OSPF_TRACE(D_EVENTS
, "BDR: %R", ifa
->bdrid
);
295 WALK_LIST(n
, ifa
->neigh_list
)
297 OSPF_TRACE(D_EVENTS
, " neighbor %R in state %u", n
->rid
, n
->state
);
302 OSPF_TRACE(D_EVENTS, "LSA graph dump start:");
303 ospf_top_dump(p->gr, p);
304 OSPF_TRACE(D_EVENTS, "LSA graph dump finished");
309 static struct proto
*
310 ospf_init(struct proto_config
*CF
)
312 struct ospf_config
*cf
= (struct ospf_config
*) CF
;
313 struct proto
*P
= proto_new(CF
);
315 P
->main_channel
= proto_add_channel(P
, proto_cf_main_channel(CF
));
317 P
->rt_notify
= ospf_rt_notify
;
318 P
->if_notify
= ospf_if_notify
;
319 P
->ifa_notify
= cf
->ospf2
? ospf_ifa_notify2
: ospf_ifa_notify3
;
320 P
->import_control
= ospf_import_control
;
321 P
->reload_routes
= ospf_reload_routes
;
322 P
->make_tmp_attrs
= ospf_make_tmp_attrs
;
323 P
->store_tmp_attrs
= ospf_store_tmp_attrs
;
324 P
->rte_better
= ospf_rte_better
;
325 P
->rte_same
= ospf_rte_same
;
330 /* If new is better return 1 */
332 ospf_rte_better(struct rte
*new, struct rte
*old
)
334 if (new->u
.ospf
.metric1
== LSINFINITY
)
337 if(new->attrs
->source
< old
->attrs
->source
) return 1;
338 if(new->attrs
->source
> old
->attrs
->source
) return 0;
340 if(new->attrs
->source
== RTS_OSPF_EXT2
)
342 if(new->u
.ospf
.metric2
< old
->u
.ospf
.metric2
) return 1;
343 if(new->u
.ospf
.metric2
> old
->u
.ospf
.metric2
) return 0;
346 if (new->u
.ospf
.metric1
< old
->u
.ospf
.metric1
)
349 return 0; /* Old is shorter or same */
353 ospf_rte_same(struct rte
*new, struct rte
*old
)
355 /* new->attrs == old->attrs always */
357 new->u
.ospf
.metric1
== old
->u
.ospf
.metric1
&&
358 new->u
.ospf
.metric2
== old
->u
.ospf
.metric2
&&
359 new->u
.ospf
.tag
== old
->u
.ospf
.tag
&&
360 new->u
.ospf
.router_id
== old
->u
.ospf
.router_id
;
364 ospf_build_attrs(ea_list
* next
, struct linpool
*pool
, u32 m1
, u32 m2
,
368 lp_alloc(pool
, sizeof(struct ea_list
) + 4 * sizeof(eattr
));
371 l
->flags
= EALF_SORTED
;
373 l
->attrs
[0].id
= EA_OSPF_METRIC1
;
374 l
->attrs
[0].flags
= 0;
375 l
->attrs
[0].type
= EAF_TYPE_INT
| EAF_TEMP
;
376 l
->attrs
[0].u
.data
= m1
;
377 l
->attrs
[1].id
= EA_OSPF_METRIC2
;
378 l
->attrs
[1].flags
= 0;
379 l
->attrs
[1].type
= EAF_TYPE_INT
| EAF_TEMP
;
380 l
->attrs
[1].u
.data
= m2
;
381 l
->attrs
[2].id
= EA_OSPF_TAG
;
382 l
->attrs
[2].flags
= 0;
383 l
->attrs
[2].type
= EAF_TYPE_INT
| EAF_TEMP
;
384 l
->attrs
[2].u
.data
= tag
;
385 l
->attrs
[3].id
= EA_OSPF_ROUTER_ID
;
386 l
->attrs
[3].flags
= 0;
387 l
->attrs
[3].type
= EAF_TYPE_ROUTER_ID
| EAF_TEMP
;
388 l
->attrs
[3].u
.data
= rid
;
394 ospf_schedule_rtcalc(struct ospf_proto
*p
)
399 OSPF_TRACE(D_EVENTS
, "Scheduling routing table calculation");
404 ospf_reload_routes(struct channel
*C
)
406 struct ospf_proto
*p
= (struct ospf_proto
*) C
->proto
;
411 OSPF_TRACE(D_EVENTS
, "Scheduling routing table calculation with route reload");
417 * ospf_disp - invokes routing table calculation, aging and also area_disp()
418 * @timer: timer usually called every @ospf_proto->tick second, @timer->data
419 * point to @ospf_proto
422 ospf_disp(timer
* timer
)
424 struct ospf_proto
*p
= timer
->data
;
426 /* Originate or flush local topology LSAs */
427 ospf_update_topology(p
);
430 ospf_update_lsadb(p
);
432 /* Calculate routing table */
439 * ospf_import_control - accept or reject new route from nest's routing table
440 * @P: OSPF protocol instance
441 * @new: the new route
442 * @attrs: list of attributes
443 * @pool: pool for allocation of attributes
445 * Its quite simple. It does not accept our own routes and leaves the decision on
446 * import to the filters.
449 ospf_import_control(struct proto
*P
, rte
**new, struct linpool
*pool UNUSED
)
451 struct ospf_proto
*p
= (struct ospf_proto
*) P
;
452 struct ospf_area
*oa
= ospf_main_area(p
);
455 /* Reject our own routes */
456 if (e
->attrs
->src
->proto
== P
)
459 /* Do not export routes to stub areas */
466 static struct ea_list
*
467 ospf_make_tmp_attrs(struct rte
*rt
, struct linpool
*pool
)
469 return ospf_build_attrs(NULL
, pool
, rt
->u
.ospf
.metric1
, rt
->u
.ospf
.metric2
,
470 rt
->u
.ospf
.tag
, rt
->u
.ospf
.router_id
);
474 ospf_store_tmp_attrs(struct rte
*rt
)
476 rt
->u
.ospf
.metric1
= ea_get_int(rt
->attrs
->eattrs
, EA_OSPF_METRIC1
, LSINFINITY
);
477 rt
->u
.ospf
.metric2
= ea_get_int(rt
->attrs
->eattrs
, EA_OSPF_METRIC2
, 10000);
478 rt
->u
.ospf
.tag
= ea_get_int(rt
->attrs
->eattrs
, EA_OSPF_TAG
, 0);
479 rt
->u
.ospf
.router_id
= ea_get_int(rt
->attrs
->eattrs
, EA_OSPF_ROUTER_ID
, 0);
483 * ospf_shutdown - Finish of OSPF instance
484 * @P: OSPF protocol instance
486 * RFC does not define any action that should be taken before router
487 * shutdown. To make my neighbors react as fast as possible, I send
488 * them hello packet with empty neighbor list. They should start
489 * their neighbor state machine with event %NEIGHBOR_1WAY.
492 ospf_shutdown(struct proto
*P
)
494 struct ospf_proto
*p
= (struct ospf_proto
*) P
;
495 struct ospf_iface
*ifa
;
497 OSPF_TRACE(D_EVENTS
, "Shutdown requested");
499 /* And send to all my neighbors 1WAY */
500 WALK_LIST(ifa
, p
->iface_list
)
501 ospf_iface_shutdown(ifa
);
503 /* Cleanup locked rta entries */
504 FIB_WALK(&p
->rtf
, ort
, nf
)
506 rta_free(nf
->old_rta
);
514 ospf_get_status(struct proto
*P
, byte
* buf
)
516 struct ospf_proto
*p
= (struct ospf_proto
*) P
;
518 if (p
->p
.proto_state
== PS_DOWN
)
522 struct ospf_iface
*ifa
;
523 struct ospf_neighbor
*n
;
526 WALK_LIST(ifa
, p
->iface_list
)
527 WALK_LIST(n
, ifa
->neigh_list
) if (n
->state
== NEIGHBOR_FULL
)
531 strcpy(buf
, "Alone");
533 strcpy(buf
, "Running");
538 ospf_get_route_info(rte
* rte
, byte
* buf
)
540 char *type
= "<bug>";
542 switch (rte
->attrs
->source
)
558 buf
+= bsprintf(buf
, " %s", type
);
559 buf
+= bsprintf(buf
, " (%d/%d", rte
->pref
, rte
->u
.ospf
.metric1
);
560 if (rte
->attrs
->source
== RTS_OSPF_EXT2
)
561 buf
+= bsprintf(buf
, "/%d", rte
->u
.ospf
.metric2
);
562 buf
+= bsprintf(buf
, ")");
563 if ((rte
->attrs
->source
== RTS_OSPF_EXT1
|| rte
->attrs
->source
== RTS_OSPF_EXT2
) && rte
->u
.ospf
.tag
)
565 buf
+= bsprintf(buf
, " [%x]", rte
->u
.ospf
.tag
);
567 if (rte
->u
.ospf
.router_id
)
568 buf
+= bsprintf(buf
, " [%R]", rte
->u
.ospf
.router_id
);
572 ospf_get_attr(eattr
* a
, byte
* buf
, int buflen UNUSED
)
576 case EA_OSPF_METRIC1
:
577 bsprintf(buf
, "metric1");
579 case EA_OSPF_METRIC2
:
580 bsprintf(buf
, "metric2");
583 bsprintf(buf
, "tag: 0x%08x", a
->u
.data
);
585 case EA_OSPF_ROUTER_ID
:
586 bsprintf(buf
, "router_id");
594 ospf_area_reconfigure(struct ospf_area
*oa
, struct ospf_area_config
*nac
)
596 struct ospf_proto
*p
= oa
->po
;
597 struct ospf_area_config
*oac
= oa
->ac
;
598 struct ospf_iface
*ifa
;
601 oa
->options
= nac
->type
| ospf_opts(p
);
603 if (nac
->type
!= oac
->type
)
605 /* Force restart of area interfaces */
606 WALK_LIST(ifa
, p
->iface_list
)
611 /* Handle net_list */
612 fib_free(&oa
->net_fib
);
613 fib_free(&oa
->enet_fib
);
614 add_area_nets(oa
, nac
);
616 /* No need to handle stubnet_list */
619 ospf_notify_rt_lsa(oa
);
623 * ospf_reconfigure - reconfiguration hook
624 * @P: current instance of protocol (with old configuration)
625 * @c: new configuration requested by user
627 * This hook tries to be a little bit intelligent. Instance of OSPF
628 * will survive change of many constants like hello interval,
629 * password change, addition or deletion of some neighbor on
630 * nonbroadcast network, cost of interface, etc.
633 ospf_reconfigure(struct proto
*P
, struct proto_config
*CF
)
635 struct ospf_proto
*p
= (struct ospf_proto
*) P
;
636 struct ospf_config
*old
= (struct ospf_config
*) (P
->cf
);
637 struct ospf_config
*new = (struct ospf_config
*) CF
;
638 struct ospf_area_config
*nac
;
639 struct ospf_area
*oa
, *oax
;
640 struct ospf_iface
*ifa
, *ifx
;
641 struct ospf_iface_patt
*ip
;
643 if (proto_get_router_id(CF
) != p
->router_id
)
646 if (p
->ospf2
!= new->ospf2
)
649 if (p
->rfc1583
!= new->rfc1583
)
652 if (old
->abr
!= new->abr
)
655 if ((p
->af_ext
!= new->af_ext
) || (p
->af_mc
!= new->af_mc
))
658 if (!proto_configure_channel(P
, &P
->main_channel
, proto_cf_main_channel(CF
)))
661 p
->stub_router
= new->stub_router
;
662 p
->merge_external
= new->merge_external
;
666 p
->disp_timer
->recurrent
= p
->tick S
;
667 tm_start(p
->disp_timer
, 100 MS
);
669 /* Mark all areas and ifaces */
670 WALK_LIST(oa
, p
->area_list
)
673 WALK_LIST(ifa
, p
->iface_list
)
676 /* Add and update areas */
677 WALK_LIST(nac
, new->area_list
)
679 oa
= ospf_find_area(p
, nac
->areaid
);
681 ospf_area_reconfigure(oa
, nac
);
683 ospf_area_add(p
, nac
);
686 /* Add and update interfaces */
687 ospf_reconfigure_ifaces(p
);
689 /* Add and update vlinks */
690 WALK_LIST(ip
, new->vlink_list
)
692 ifa
= ospf_find_vlink(p
, ip
->voa
, ip
->vid
);
694 ospf_iface_reconfigure(ifa
, ip
);
696 ospf_iface_new_vlink(p
, ip
);
699 /* Delete remaining ifaces and areas */
700 WALK_LIST_DELSAFE(ifa
, ifx
, p
->iface_list
)
703 ospf_iface_shutdown(ifa
);
704 ospf_iface_remove(ifa
);
707 WALK_LIST_DELSAFE(oa
, oax
, p
->area_list
)
709 ospf_area_remove(oa
);
711 ospf_schedule_rtcalc(p
);
718 ospf_sh_neigh(struct proto
*P
, char *iff
)
720 struct ospf_proto
*p
= (struct ospf_proto
*) P
;
721 struct ospf_iface
*ifa
= NULL
;
722 struct ospf_neighbor
*n
;
724 if (p
->p
.proto_state
!= PS_UP
)
726 cli_msg(-1013, "%s: is not up", p
->p
.name
);
731 cli_msg(-1013, "%s:", p
->p
.name
);
732 cli_msg(-1013, "%-12s\t%3s\t%-15s\t%-5s\t%-10s %-12s", "Router ID", "Pri",
733 " State", "DTime", "Interface", "Router IP");
734 WALK_LIST(ifa
, p
->iface_list
)
735 if ((iff
== NULL
) || patmatch(iff
, ifa
->ifname
))
736 WALK_LIST(n
, ifa
->neigh_list
)
737 ospf_sh_neigh_info(n
);
742 ospf_sh(struct proto
*P
)
744 struct ospf_proto
*p
= (struct ospf_proto
*) P
;
745 struct ospf_area
*oa
;
746 struct ospf_iface
*ifa
;
747 struct ospf_neighbor
*n
;
748 int ifano
, nno
, adjno
, firstfib
;
750 if (p
->p
.proto_state
!= PS_UP
)
752 cli_msg(-1014, "%s: is not up", p
->p
.name
);
757 cli_msg(-1014, "%s:", p
->p
.name
);
758 cli_msg(-1014, "RFC1583 compatibility: %s", (p
->rfc1583
? "enabled" : "disabled"));
759 cli_msg(-1014, "Stub router: %s", (p
->stub_router
? "Yes" : "No"));
760 cli_msg(-1014, "RT scheduler tick: %d", p
->tick
);
761 cli_msg(-1014, "Number of areas: %u", p
->areano
);
762 cli_msg(-1014, "Number of LSAs in DB:\t%u", p
->gr
->hash_entries
);
764 WALK_LIST(oa
, p
->area_list
)
766 cli_msg(-1014, "\tArea: %R (%u) %s", oa
->areaid
, oa
->areaid
,
767 oa
->areaid
== 0 ? "[BACKBONE]" : "");
771 WALK_LIST(ifa
, p
->iface_list
)
776 WALK_LIST(n
, ifa
->neigh_list
)
779 if (n
->state
== NEIGHBOR_FULL
)
785 cli_msg(-1014, "\t\tStub:\t%s", oa_is_stub(oa
) ? "Yes" : "No");
786 cli_msg(-1014, "\t\tNSSA:\t%s", oa_is_nssa(oa
) ? "Yes" : "No");
787 cli_msg(-1014, "\t\tTransit:\t%s", oa
->trcap
? "Yes" : "No");
790 cli_msg(-1014, "\t\tNSSA translation:\t%s%s", oa
->translate
? "Yes" : "No",
791 oa
->translate
== TRANS_WAIT
? " (run down)" : "");
792 cli_msg(-1014, "\t\tNumber of interfaces:\t%u", ifano
);
793 cli_msg(-1014, "\t\tNumber of neighbors:\t%u", nno
);
794 cli_msg(-1014, "\t\tNumber of adjacent neighbors:\t%u", adjno
);
797 FIB_WALK(&oa
->net_fib
, struct area_net
, anet
)
801 cli_msg(-1014, "\t\tArea networks:");
804 cli_msg(-1014, "\t\t\t%1N\t%s\t%s", anet
->fn
.addr
,
805 anet
->hidden
? "Hidden" : "Advertise", anet
->active
? "Active" : "");
810 FIB_WALK(&oa
->enet_fib
, struct area_net
, anet
)
814 cli_msg(-1014, "\t\tArea external networks:");
817 cli_msg(-1014, "\t\t\t%1N\t%s\t%s", anet
->fn
.addr
,
818 anet
->hidden
? "Hidden" : "Advertise", anet
->active
? "Active" : "");
827 ospf_sh_iface(struct proto
*P
, char *iff
)
829 struct ospf_proto
*p
= (struct ospf_proto
*) P
;
830 struct ospf_iface
*ifa
= NULL
;
832 if (p
->p
.proto_state
!= PS_UP
)
834 cli_msg(-1015, "%s: is not up", p
->p
.name
);
839 cli_msg(-1015, "%s:", p
->p
.name
);
840 WALK_LIST(ifa
, p
->iface_list
)
841 if ((iff
== NULL
) || patmatch(iff
, ifa
->ifname
))
842 ospf_iface_info(ifa
);
846 /* lsa_compare_for_state() - Compare function for 'show ospf state'
848 * First we want to separate network-LSAs and other LSAs (because network-LSAs
849 * will be presented as network nodes and other LSAs together as router nodes)
850 * Network-LSAs are sorted according to network prefix, other LSAs are sorted
851 * according to originating router id (to get all LSA needed to represent one
852 * router node together). Then, according to LSA type, ID and age.
854 * For OSPFv3, we have to handle also Prefix-LSAs. We would like to put each
855 * immediately after the referenced LSA. We will make faked LSA based on ref_
859 static struct ospf_lsa_header
*
860 fake_lsa_from_prefix_lsa(struct ospf_lsa_header
*dst
, struct ospf_lsa_header
*src
,
861 struct ospf_lsa_prefix
*px
)
864 dst
->type_raw
= px
->ref_type
;
865 dst
->id
= px
->ref_id
;
866 dst
->rt
= px
->ref_rt
;
873 static int lsa_compare_ospf3
;
876 lsa_compare_for_state(const void *p1
, const void *p2
)
878 struct top_hash_entry
*he1
= * (struct top_hash_entry
**) p1
;
879 struct top_hash_entry
*he2
= * (struct top_hash_entry
**) p2
;
880 struct ospf_lsa_header
*lsa1
= &(he1
->lsa
);
881 struct ospf_lsa_header
*lsa2
= &(he2
->lsa
);
882 struct ospf_lsa_header lsatmp1
, lsatmp2
;
883 u16 lsa1_type
= he1
->lsa_type
;
884 u16 lsa2_type
= he2
->lsa_type
;
886 if (he1
->domain
< he2
->domain
)
888 if (he1
->domain
> he2
->domain
)
892 /* px1 or px2 assumes OSPFv3 */
893 int px1
= (lsa1_type
== LSA_T_PREFIX
);
894 int px2
= (lsa2_type
== LSA_T_PREFIX
);
898 lsa1
= fake_lsa_from_prefix_lsa(&lsatmp1
, lsa1
, he1
->lsa_body
);
899 lsa1_type
= lsa1
->type_raw
; /* FIXME: handle unknown ref_type */
904 lsa2
= fake_lsa_from_prefix_lsa(&lsatmp2
, lsa2
, he2
->lsa_body
);
905 lsa2_type
= lsa2
->type_raw
;
909 int nt1
= (lsa1_type
== LSA_T_NET
);
910 int nt2
= (lsa2_type
== LSA_T_NET
);
917 /* In OSPFv3, networks are named based on ID of DR */
918 if (lsa_compare_ospf3
)
920 if (lsa1
->rt
< lsa2
->rt
)
922 if (lsa1
->rt
> lsa2
->rt
)
926 /* For OSPFv2, this is IP of the network,
927 for OSPFv3, this is interface ID */
928 if (lsa1
->id
< lsa2
->id
)
930 if (lsa1
->id
> lsa2
->id
)
936 return lsa1
->sn
- lsa2
->sn
;
940 if (lsa1
->rt
< lsa2
->rt
)
942 if (lsa1
->rt
> lsa2
->rt
)
945 if (lsa1_type
< lsa2_type
)
947 if (lsa1_type
> lsa2_type
)
950 if (lsa1
->id
< lsa2
->id
)
952 if (lsa1
->id
> lsa2
->id
)
958 return lsa1
->sn
- lsa2
->sn
;
963 ext_compare_for_state(const void *p1
, const void *p2
)
965 struct top_hash_entry
* he1
= * (struct top_hash_entry
**) p1
;
966 struct top_hash_entry
* he2
= * (struct top_hash_entry
**) p2
;
967 struct ospf_lsa_header
*lsa1
= &(he1
->lsa
);
968 struct ospf_lsa_header
*lsa2
= &(he2
->lsa
);
970 if (lsa1
->rt
< lsa2
->rt
)
972 if (lsa1
->rt
> lsa2
->rt
)
975 if (lsa1
->id
< lsa2
->id
)
977 if (lsa1
->id
> lsa2
->id
)
980 return lsa1
->sn
- lsa2
->sn
;
984 show_lsa_distance(struct top_hash_entry
*he
)
986 if (he
->color
== INSPF
)
987 cli_msg(-1016, "\t\tdistance %u", he
->dist
);
989 cli_msg(-1016, "\t\tunreachable");
993 show_lsa_router(struct ospf_proto
*p
, struct top_hash_entry
*he
, int verbose
)
995 struct ospf_lsa_rt_walk rtl
;
998 cli_msg(-1016, "\trouter %R", he
->lsa
.rt
);
999 show_lsa_distance(he
);
1001 lsa_walk_rt_init(p
, he
, &rtl
);
1002 while (lsa_walk_rt(&rtl
))
1003 if (rtl
.type
== LSART_VLNK
)
1004 cli_msg(-1016, "\t\tvlink %R metric %u", rtl
.id
, rtl
.metric
);
1006 lsa_walk_rt_init(p
, he
, &rtl
);
1007 while (lsa_walk_rt(&rtl
))
1008 if (rtl
.type
== LSART_PTP
)
1009 cli_msg(-1016, "\t\trouter %R metric %u", rtl
.id
, rtl
.metric
);
1011 lsa_walk_rt_init(p
, he
, &rtl
);
1012 while (lsa_walk_rt(&rtl
))
1013 if (rtl
.type
== LSART_NET
)
1017 /* In OSPFv2, we try to find network-LSA to get prefix/pxlen */
1018 struct top_hash_entry
*net_he
= ospf_hash_find_net2(p
->gr
, he
->domain
, rtl
.id
);
1020 if (net_he
&& (net_he
->lsa
.age
< LSA_MAXAGE
))
1022 struct ospf_lsa_header
*net_lsa
= &(net_he
->lsa
);
1023 struct ospf_lsa_net
*net_ln
= net_he
->lsa_body
;
1025 cli_msg(-1016, "\t\tnetwork %I/%d metric %u",
1026 ipa_from_u32(net_lsa
->id
& net_ln
->optx
),
1027 u32_masklen(net_ln
->optx
), rtl
.metric
);
1030 cli_msg(-1016, "\t\tnetwork [%R] metric %u", rtl
.id
, rtl
.metric
);
1033 cli_msg(-1016, "\t\tnetwork [%R-%u] metric %u", rtl
.id
, rtl
.nif
, rtl
.metric
);
1036 if (ospf_is_v2(p
) && verbose
)
1038 lsa_walk_rt_init(p
, he
, &rtl
);
1039 while (lsa_walk_rt(&rtl
))
1040 if (rtl
.type
== LSART_STUB
)
1041 cli_msg(-1016, "\t\tstubnet %I/%d metric %u",
1042 ipa_from_u32(rtl
.id
), u32_masklen(rtl
.data
), rtl
.metric
);
1047 show_lsa_network(struct top_hash_entry
*he
, int ospf2
)
1049 struct ospf_lsa_header
*lsa
= &(he
->lsa
);
1050 struct ospf_lsa_net
*ln
= he
->lsa_body
;
1056 cli_msg(-1016, "\tnetwork %I/%d", ipa_from_u32(lsa
->id
& ln
->optx
), u32_masklen(ln
->optx
));
1057 cli_msg(-1016, "\t\tdr %R", lsa
->rt
);
1062 cli_msg(-1016, "\tnetwork [%R-%u]", lsa
->rt
, lsa
->id
);
1065 show_lsa_distance(he
);
1067 for (i
= 0; i
< lsa_net_count(lsa
); i
++)
1068 cli_msg(-1016, "\t\trouter %R", ln
->routers
[i
]);
1072 show_lsa_sum_net(struct top_hash_entry
*he
, int ospf2
, int af
)
1078 lsa_parse_sum_net(he
, ospf2
, af
, &net
, &pxopts
, &metric
);
1079 cli_msg(-1016, "\t\txnetwork %N metric %u", &net
, metric
);
1083 show_lsa_sum_rt(struct top_hash_entry
*he
, int ospf2
)
1089 lsa_parse_sum_rt(he
, ospf2
, &dst_rid
, &metric
, &options
);
1090 cli_msg(-1016, "\t\txrouter %R metric %u", dst_rid
, metric
);
1095 show_lsa_external(struct top_hash_entry
*he
, int ospf2
, int af
)
1097 struct ospf_lsa_ext_local rt
;
1098 char str_via
[IPA_MAX_TEXT_LENGTH
+ 8] = "";
1099 char str_tag
[16] = "";
1101 if (he
->lsa_type
== LSA_T_EXT
)
1102 he
->domain
= 0; /* Unmark the LSA */
1104 lsa_parse_ext(he
, ospf2
, af
, &rt
);
1107 bsprintf(str_via
, " via %I", rt
.fwaddr
);
1110 bsprintf(str_tag
, " tag %08x", rt
.tag
);
1112 cli_msg(-1016, "\t\t%s %N metric%s %u%s%s",
1113 (he
->lsa_type
== LSA_T_NSSA
) ? "nssa-ext" : "external",
1114 &rt
.net
, rt
.ebit
? "2" : "", rt
.metric
, str_via
, str_tag
);
1118 show_lsa_prefix(struct top_hash_entry
*he
, struct top_hash_entry
*cnode
, int af
)
1120 struct ospf_lsa_prefix
*px
= he
->lsa_body
;
1124 /* We check whether given prefix-LSA is related to the current node */
1125 if ((px
->ref_type
!= cnode
->lsa
.type_raw
) || (px
->ref_rt
!= cnode
->lsa
.rt
))
1128 if ((px
->ref_type
== LSA_T_RT
) && (px
->ref_id
!= 0))
1131 if ((px
->ref_type
== LSA_T_NET
) && (px
->ref_id
!= cnode
->lsa
.id
))
1135 for (i
= 0; i
< px
->pxcount
; i
++)
1141 buf
= ospf3_get_prefix(buf
, af
, &net
, &pxopts
, &metric
);
1143 if (px
->ref_type
== LSA_T_RT
)
1144 cli_msg(-1016, "\t\tstubnet %N metric %u", &net
, metric
);
1146 cli_msg(-1016, "\t\taddress %N", &net
);
1151 ospf_sh_state(struct proto
*P
, int verbose
, int reachable
)
1153 struct ospf_proto
*p
= (struct ospf_proto
*) P
;
1154 int ospf2
= ospf_is_v2(p
);
1155 int af
= ospf_get_af(p
);
1157 u32 last_area
= 0xFFFFFFFF;
1159 if (p
->p
.proto_state
!= PS_UP
)
1161 cli_msg(-1016, "%s: is not up", p
->p
.name
);
1166 /* We store interesting area-scoped LSAs in array hea and
1167 global-scoped (LSA_T_EXT) LSAs in array hex */
1169 uint num
= p
->gr
->hash_entries
;
1170 struct top_hash_entry
*hea
[num
];
1171 struct top_hash_entry
*hex
[verbose
? num
: 0];
1172 struct top_hash_entry
*he
;
1173 struct top_hash_entry
*cnode
= NULL
;
1176 WALK_SLIST(he
, p
->lsal
)
1180 if (he
->lsa
.age
== LSA_MAXAGE
)
1183 switch (he
->lsa_type
)
1200 he
->domain
= 1; /* Abuse domain field to mark the LSA */
1212 ASSERT(j1
<= num
&& jx
<= num
);
1214 lsa_compare_ospf3
= !ospf2
;
1215 qsort(hea
, j1
, sizeof(struct top_hash_entry
*), lsa_compare_for_state
);
1216 qsort(hex
, jx
, sizeof(struct top_hash_entry
*), ext_compare_for_state
);
1219 * This code is a bit tricky, we have a primary LSAs (router and
1220 * network) that are presented as a node, and secondary LSAs that
1221 * are presented as a part of a primary node. cnode represents an
1222 * currently opened node (whose header was presented). The LSAs are
1223 * sorted to get secondary LSAs just after related primary LSA (if
1224 * available). We present secondary LSAs only when related primary
1227 * AS-external LSAs are stored separately as they might be presented
1228 * several times (for each area when related ASBR is opened). When
1229 * the node is closed, related external routes are presented. We
1230 * also have to take into account that in OSPFv3, there might be
1231 * more router-LSAs and only the first should be considered as a
1232 * primary. This is handled by not closing old router-LSA when next
1233 * one is processed (which is not opened because there is already
1238 for (i
= 0; i
< j1
; i
++)
1242 /* If there is no opened node, we open the LSA (if appropriate) or skip to the next one */
1245 if (((he
->lsa_type
== LSA_T_RT
) || (he
->lsa_type
== LSA_T_NET
))
1246 && ((he
->color
== INSPF
) || !reachable
))
1250 if (he
->domain
!= last_area
)
1253 cli_msg(-1016, "area %R", he
->domain
);
1254 last_area
= he
->domain
;
1262 ASSERT(cnode
&& (he
->domain
== last_area
) && (he
->lsa
.rt
== cnode
->lsa
.rt
));
1264 switch (he
->lsa_type
)
1267 if (he
->lsa
.id
== cnode
->lsa
.id
)
1268 show_lsa_router(p
, he
, verbose
);
1272 show_lsa_network(he
, ospf2
);
1276 if (cnode
->lsa_type
== LSA_T_RT
)
1277 show_lsa_sum_net(he
, ospf2
, af
);
1281 if (cnode
->lsa_type
== LSA_T_RT
)
1282 show_lsa_sum_rt(he
, ospf2
);
1287 show_lsa_external(he
, ospf2
, af
);
1291 show_lsa_prefix(he
, cnode
, af
);
1295 /* In these cases, we close the current node */
1297 || (hea
[i
+1]->domain
!= last_area
)
1298 || (hea
[i
+1]->lsa
.rt
!= cnode
->lsa
.rt
)
1299 || (hea
[i
+1]->lsa_type
== LSA_T_NET
))
1301 while ((ix
< jx
) && (hex
[ix
]->lsa
.rt
< cnode
->lsa
.rt
))
1304 while ((ix
< jx
) && (hex
[ix
]->lsa
.rt
== cnode
->lsa
.rt
))
1305 show_lsa_external(hex
[ix
++], ospf2
, af
);
1312 u32 last_rt
= 0xFFFFFFFF;
1313 for (ix
= 0; ix
< jx
; ix
++)
1317 /* If it is still marked, we show it now. */
1322 if ((he
->color
!= INSPF
) && reachable
)
1328 cli_msg(-1016, "other ASBRs");
1332 if (he
->lsa
.rt
!= last_rt
)
1335 cli_msg(-1016, "\trouter %R", he
->lsa
.rt
);
1336 last_rt
= he
->lsa
.rt
;
1339 show_lsa_external(he
, ospf2
, af
);
1348 lsa_compare_for_lsadb(const void *p1
, const void *p2
)
1350 struct top_hash_entry
* he1
= * (struct top_hash_entry
**) p1
;
1351 struct top_hash_entry
* he2
= * (struct top_hash_entry
**) p2
;
1352 struct ospf_lsa_header
*lsa1
= &(he1
->lsa
);
1353 struct ospf_lsa_header
*lsa2
= &(he2
->lsa
);
1354 int sc1
= LSA_SCOPE(he1
->lsa_type
);
1355 int sc2
= LSA_SCOPE(he2
->lsa_type
);
1360 if (he1
->domain
!= he2
->domain
)
1361 return he1
->domain
- he2
->domain
;
1363 if (lsa1
->rt
!= lsa2
->rt
)
1364 return lsa1
->rt
- lsa2
->rt
;
1366 if (lsa1
->id
!= lsa2
->id
)
1367 return lsa1
->id
- lsa2
->id
;
1369 if (he1
->lsa_type
!= he2
->lsa_type
)
1370 return he1
->lsa_type
- he2
->lsa_type
;
1372 return lsa1
->sn
- lsa2
->sn
;
1376 ospf_sh_lsadb(struct lsadb_show_data
*ld
)
1378 struct ospf_proto
*p
= (struct ospf_proto
*) proto_get_named(ld
->name
, &proto_ospf
);
1379 uint num
= p
->gr
->hash_entries
;
1381 int last_dscope
= -1;
1382 u32 last_domain
= 0;
1383 u16 type_mask
= ospf_is_v2(p
) ? 0x00ff : 0xffff; /* see lsa_etype() */
1385 if (p
->p
.proto_state
!= PS_UP
)
1387 cli_msg(-1017, "%s: is not up", p
->p
.name
);
1392 if (ld
->router
== SH_ROUTER_SELF
)
1393 ld
->router
= p
->router_id
;
1395 struct top_hash_entry
*hea
[num
];
1396 struct top_hash_entry
*he
;
1399 WALK_SLIST(he
, p
->lsal
)
1405 qsort(hea
, j
, sizeof(struct top_hash_entry
*), lsa_compare_for_lsadb
);
1407 for (i
= 0; i
< j
; i
++)
1409 struct ospf_lsa_header
*lsa
= &(hea
[i
]->lsa
);
1410 u16 lsa_type
= lsa
->type_raw
& type_mask
;
1411 u16 dscope
= LSA_SCOPE(hea
[i
]->lsa_type
);
1413 /* Hack: 1 is used for LSA_SCOPE_LINK, fixed by & 0xf000 */
1414 if (ld
->scope
&& (dscope
!= (ld
->scope
& 0xf000)))
1417 if ((ld
->scope
== LSA_SCOPE_AREA
) && (hea
[i
]->domain
!= ld
->area
))
1420 /* For user convenience ignore high nibble */
1421 if (ld
->type
&& ((lsa_type
& 0x0fff) != (ld
->type
& 0x0fff)))
1424 if (ld
->lsid
&& (lsa
->id
!= ld
->lsid
))
1427 if (ld
->router
&& (lsa
->rt
!= ld
->router
))
1430 if ((dscope
!= last_dscope
) || (hea
[i
]->domain
!= last_domain
))
1436 cli_msg(-1017, "Global");
1439 case LSA_SCOPE_AREA
:
1440 cli_msg(-1017, "Area %R", hea
[i
]->domain
);
1443 case LSA_SCOPE_LINK
:
1445 struct iface
*ifa
= if_find_by_index(hea
[i
]->domain
);
1446 cli_msg(-1017, "Link %s", (ifa
!= NULL
) ? ifa
->name
: "?");
1451 cli_msg(-1017," Type LS ID Router Sequence Age Checksum");
1453 last_dscope
= dscope
;
1454 last_domain
= hea
[i
]->domain
;
1457 cli_msg(-1017," %04x %-15R %-15R %08x %5u %04x",
1458 lsa_type
, lsa
->id
, lsa
->rt
, lsa
->sn
, lsa
->age
, lsa
->checksum
);
1464 struct protocol proto_ospf
= {
1466 .template = "ospf%d",
1467 .class = PROTOCOL_OSPF
,
1468 .preference
= DEF_PREF_OSPF
,
1469 .channel_mask
= NB_IP
,
1470 .proto_size
= sizeof(struct ospf_proto
),
1471 .config_size
= sizeof(struct ospf_config
),
1474 .start
= ospf_start
,
1475 .shutdown
= ospf_shutdown
,
1476 .reconfigure
= ospf_reconfigure
,
1477 .get_status
= ospf_get_status
,
1478 .get_attr
= ospf_get_attr
,
1479 .get_route_info
= ospf_get_route_info