2 * EIGRP Topology Table.
3 * Copyright (C) 2013-2016
15 * This file is part of GNU Zebra.
17 * GNU Zebra is free software; you can redistribute it and/or modify it
18 * under the terms of the GNU General Public License as published by the
19 * Free Software Foundation; either version 2, or (at your option) any
22 * GNU Zebra is distributed in the hope that it will be useful, but
23 * WITHOUT ANY WARRANTY; without even the implied warranty of
24 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
25 * General Public License for more details.
27 * You should have received a copy of the GNU General Public License along
28 * with this program; see the file COPYING; if not, write to the Free Software
29 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
41 #include "eigrpd/eigrp_structs.h"
42 #include "eigrpd/eigrpd.h"
43 #include "eigrpd/eigrp_interface.h"
44 #include "eigrpd/eigrp_neighbor.h"
45 #include "eigrpd/eigrp_packet.h"
46 #include "eigrpd/eigrp_zebra.h"
47 #include "eigrpd/eigrp_vty.h"
48 #include "eigrpd/eigrp_network.h"
49 #include "eigrpd/eigrp_dump.h"
50 #include "eigrpd/eigrp_topology.h"
51 #include "eigrpd/eigrp_fsm.h"
52 #include "eigrpd/eigrp_memory.h"
54 static int eigrp_prefix_entry_cmp(struct eigrp_prefix_entry
*,
55 struct eigrp_prefix_entry
*);
56 static void eigrp_prefix_entry_del(struct eigrp_prefix_entry
*);
57 static int eigrp_nexthop_entry_cmp(struct eigrp_nexthop_entry
*,
58 struct eigrp_nexthop_entry
*);
61 * Returns linkedlist used as topology table
62 * cmp - assigned function for comparing topology nodes
63 * del - assigned function executed before deleting topology node by list
66 struct list
*eigrp_topology_new()
68 struct list
*new = list_new();
69 new->cmp
= (int (*)(void *, void *))eigrp_prefix_entry_cmp
;
70 new->del
= (void (*)(void *))eigrp_prefix_entry_del
;
76 * Topology node comparison
79 static int eigrp_prefix_entry_cmp(struct eigrp_prefix_entry
*node1
,
80 struct eigrp_prefix_entry
*node2
)
82 if (node1
->af
== AF_INET
) {
83 if (node2
->af
== AF_INET
) {
84 if (node1
->destination
->u
.prefix4
.s_addr
85 < node2
->destination
->u
.prefix4
.s_addr
)
87 if (node1
->destination
->u
.prefix4
.s_addr
88 > node2
->destination
->u
.prefix4
.s_addr
)
99 * Topology node delete
102 static void eigrp_prefix_entry_del(struct eigrp_prefix_entry
*node
)
104 list_delete_and_null(&node
->entries
);
108 * Returns new created toplogy node
109 * cmp - assigned function for comparing topology entry
111 struct eigrp_prefix_entry
*eigrp_prefix_entry_new()
113 struct eigrp_prefix_entry
*new;
114 new = XCALLOC(MTYPE_EIGRP_PREFIX_ENTRY
,
115 sizeof(struct eigrp_prefix_entry
));
116 new->entries
= list_new();
117 new->rij
= list_new();
118 new->entries
->cmp
= (int (*)(void *, void *))eigrp_nexthop_entry_cmp
;
119 new->distance
= new->fdistance
= new->rdistance
= EIGRP_MAX_METRIC
;
120 new->destination
= NULL
;
126 * Topology entry comparison
128 static int eigrp_nexthop_entry_cmp(struct eigrp_nexthop_entry
*entry1
,
129 struct eigrp_nexthop_entry
*entry2
)
131 if (entry1
->distance
< entry2
->distance
)
133 if (entry1
->distance
> entry2
->distance
)
140 * Returns new topology entry
143 struct eigrp_nexthop_entry
*eigrp_nexthop_entry_new()
145 struct eigrp_nexthop_entry
*new;
147 new = XCALLOC(MTYPE_EIGRP_NEXTHOP_ENTRY
,
148 sizeof(struct eigrp_nexthop_entry
));
149 new->reported_distance
= EIGRP_MAX_METRIC
;
150 new->distance
= EIGRP_MAX_METRIC
;
156 * Freeing topology table list
158 void eigrp_topology_free(struct list
*list
)
160 list_delete_and_null(&list
);
164 * Deleting all topology nodes in table
166 void eigrp_topology_cleanup(struct list
*topology
)
170 eigrp_topology_delete_all(topology
);
174 * Adding topology node to topology table
176 void eigrp_prefix_entry_add(struct list
*topology
,
177 struct eigrp_prefix_entry
*node
)
179 if (listnode_lookup(topology
, node
) == NULL
) {
180 listnode_add_sort(topology
, node
);
185 * Adding topology entry to topology node
187 void eigrp_nexthop_entry_add(struct eigrp_prefix_entry
*node
,
188 struct eigrp_nexthop_entry
*entry
)
190 struct list
*l
= list_new();
192 listnode_add(l
, entry
);
194 if (listnode_lookup(node
->entries
, entry
) == NULL
) {
195 listnode_add_sort(node
->entries
, entry
);
196 entry
->prefix
= node
;
198 eigrp_zebra_route_add(node
->destination
, l
);
201 list_delete_and_null(&l
);
205 * Deleting topology node from topology table
207 void eigrp_prefix_entry_delete(struct list
*topology
,
208 struct eigrp_prefix_entry
*node
)
210 struct eigrp
*eigrp
= eigrp_lookup();
213 * Emergency removal of the node from this list.
216 listnode_delete(eigrp
->topology_changes_internalIPV4
, node
);
218 if (listnode_lookup(topology
, node
) != NULL
) {
219 list_delete_and_null(&node
->entries
);
220 list_delete_and_null(&node
->rij
);
221 listnode_delete(topology
, node
);
222 eigrp_zebra_route_delete(node
->destination
);
223 XFREE(MTYPE_EIGRP_PREFIX_ENTRY
, node
);
228 * Deleting topology entry from topology node
230 void eigrp_nexthop_entry_delete(struct eigrp_prefix_entry
*node
,
231 struct eigrp_nexthop_entry
*entry
)
233 if (listnode_lookup(node
->entries
, entry
) != NULL
) {
234 listnode_delete(node
->entries
, entry
);
235 eigrp_zebra_route_delete(node
->destination
);
236 XFREE(MTYPE_EIGRP_NEXTHOP_ENTRY
, entry
);
241 * Deleting all nodes from topology table
243 void eigrp_topology_delete_all(struct list
*topology
)
245 list_delete_all_node(topology
);
249 * Return 0 if topology is not empty
252 unsigned int eigrp_topology_table_isempty(struct list
*topology
)
260 struct eigrp_prefix_entry
*
261 eigrp_topology_table_lookup_ipv4(struct list
*topology_table
,
262 struct prefix
*address
)
264 struct eigrp_prefix_entry
*data
;
265 struct listnode
*node
;
266 for (ALL_LIST_ELEMENTS_RO(topology_table
, node
, data
)) {
267 if (prefix_same(data
->destination
, address
))
275 * For a future optimization, put the successor list into it's
276 * own separate list from the full list?
278 * That way we can clean up all the list_new and list_delete's
279 * that we are doing. DBS
281 struct list
*eigrp_topology_get_successor(struct eigrp_prefix_entry
*table_node
)
283 struct list
*successors
= list_new();
284 struct eigrp_nexthop_entry
*data
;
285 struct listnode
*node1
, *node2
;
287 for (ALL_LIST_ELEMENTS(table_node
->entries
, node1
, node2
, data
)) {
288 if (data
->flags
& EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
) {
289 listnode_add(successors
, data
);
294 * If we have no successors return NULL
296 if (!successors
->count
) {
297 list_delete_and_null(&successors
);
305 eigrp_topology_get_successor_max(struct eigrp_prefix_entry
*table_node
,
306 unsigned int maxpaths
)
308 struct list
*successors
= eigrp_topology_get_successor(table_node
);
310 if (successors
&& successors
->count
> maxpaths
) {
312 struct listnode
*node
= listtail(successors
);
314 list_delete_node(successors
, node
);
316 } while (successors
->count
> maxpaths
);
322 struct eigrp_nexthop_entry
*
323 eigrp_prefix_entry_lookup(struct list
*entries
, struct eigrp_neighbor
*nbr
)
325 struct eigrp_nexthop_entry
*data
;
326 struct listnode
*node
, *nnode
;
327 for (ALL_LIST_ELEMENTS(entries
, node
, nnode
, data
)) {
328 if (data
->adv_router
== nbr
) {
336 /* Lookup all prefixes from specified neighbor */
337 struct list
*eigrp_neighbor_prefixes_lookup(struct eigrp
*eigrp
,
338 struct eigrp_neighbor
*nbr
)
340 struct listnode
*node1
, *node11
, *node2
, *node22
;
341 struct eigrp_prefix_entry
*prefix
;
342 struct eigrp_nexthop_entry
*entry
;
344 /* create new empty list for prefixes storage */
345 struct list
*prefixes
= list_new();
347 /* iterate over all prefixes in topology table */
348 for (ALL_LIST_ELEMENTS(eigrp
->topology_table
, node1
, node11
, prefix
)) {
349 /* iterate over all neighbor entry in prefix */
350 for (ALL_LIST_ELEMENTS(prefix
->entries
, node2
, node22
, entry
)) {
351 /* if entry is from specified neighbor, add to list */
352 if (entry
->adv_router
== nbr
) {
353 listnode_add(prefixes
, prefix
);
358 /* return list of prefixes from specified neighbor */
362 enum metric_change
eigrp_topology_update_distance(struct eigrp_fsm_action_message
*msg
)
364 struct eigrp
*eigrp
= msg
->eigrp
;
365 struct eigrp_prefix_entry
*prefix
= msg
->prefix
;
366 struct eigrp_nexthop_entry
*entry
= msg
->entry
;
367 enum metric_change change
= METRIC_SAME
;
368 u_int32_t new_reported_distance
;
372 switch(msg
->data_type
) {
373 case EIGRP_CONNECTED
:
374 if (prefix
->nt
== EIGRP_TOPOLOGY_TYPE_CONNECTED
)
377 change
= METRIC_DECREASE
;
380 if (prefix
->nt
== EIGRP_TOPOLOGY_TYPE_CONNECTED
) {
381 change
= METRIC_INCREASE
;
384 if (eigrp_metrics_is_same(msg
->metrics
,
385 entry
->reported_metric
)) {
386 return change
; // No change
389 new_reported_distance
= eigrp_calculate_metrics(eigrp
,
392 if (entry
->reported_distance
< new_reported_distance
) {
393 change
= METRIC_INCREASE
;
396 change
= METRIC_DECREASE
;
398 entry
->reported_metric
= msg
->metrics
;
399 entry
->reported_distance
= new_reported_distance
;
400 eigrp_calculate_metrics(eigrp
, msg
->metrics
);
401 entry
->distance
= eigrp_calculate_total_metrics(eigrp
, entry
);
404 if (prefix
->nt
== EIGRP_TOPOLOGY_TYPE_REMOTE_EXTERNAL
) {
405 if (eigrp_metrics_is_same(msg
->metrics
,
406 entry
->reported_metric
))
409 change
= METRIC_INCREASE
;
414 zlog_err("%s: Please implement handler", __PRETTY_FUNCTION__
);
419 * Move to correct position in list according to new distance
421 listnode_delete(prefix
->entries
, entry
);
422 listnode_add_sort(prefix
->entries
, entry
);
427 void eigrp_topology_update_all_node_flags(struct eigrp
*eigrp
)
429 struct list
*table
= eigrp
->topology_table
;
430 struct eigrp_prefix_entry
*data
;
431 struct listnode
*node
, *nnode
;
432 for (ALL_LIST_ELEMENTS(table
, node
, nnode
, data
)) {
433 eigrp_topology_update_node_flags(data
);
437 void eigrp_topology_update_node_flags(struct eigrp_prefix_entry
*dest
)
439 struct listnode
*node
;
440 struct eigrp_nexthop_entry
*entry
;
441 struct eigrp
*eigrp
= eigrp_lookup();
443 for (ALL_LIST_ELEMENTS_RO(dest
->entries
, node
, entry
)) {
444 if (((uint64_t)entry
->distance
445 <= (uint64_t)dest
->distance
* (uint64_t)eigrp
->variance
)
446 && entry
->distance
!= EIGRP_MAX_METRIC
) // is successor
448 entry
->flags
|= EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
;
449 entry
->flags
&= ~EIGRP_NEXTHOP_ENTRY_FSUCCESSOR_FLAG
;
450 } else if (entry
->reported_distance
451 < dest
->fdistance
) // is feasible successor
453 entry
->flags
|= EIGRP_NEXTHOP_ENTRY_FSUCCESSOR_FLAG
;
454 entry
->flags
&= ~EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
;
456 entry
->flags
&= ~EIGRP_NEXTHOP_ENTRY_FSUCCESSOR_FLAG
;
457 entry
->flags
&= ~EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
;
462 void eigrp_update_routing_table(struct eigrp_prefix_entry
*prefix
)
464 struct eigrp
*eigrp
= eigrp_lookup();
465 struct list
*successors
=
466 eigrp_topology_get_successor_max(prefix
, eigrp
->max_paths
);
467 struct listnode
*node
;
468 struct eigrp_nexthop_entry
*entry
;
471 eigrp_zebra_route_add(prefix
->destination
,
473 for (ALL_LIST_ELEMENTS_RO(successors
, node
, entry
))
474 entry
->flags
|= EIGRP_NEXTHOP_ENTRY_INTABLE_FLAG
;
476 list_delete_and_null(&successors
);
478 eigrp_zebra_route_delete(prefix
->destination
);
479 for (ALL_LIST_ELEMENTS_RO(prefix
->entries
, node
, entry
))
480 entry
->flags
&= ~EIGRP_NEXTHOP_ENTRY_INTABLE_FLAG
;
484 void eigrp_topology_neighbor_down(struct eigrp
*eigrp
,
485 struct eigrp_neighbor
*nbr
)
487 struct listnode
*node1
, *node11
, *node2
, *node22
;
488 struct eigrp_prefix_entry
*prefix
;
489 struct eigrp_nexthop_entry
*entry
;
491 for (ALL_LIST_ELEMENTS(eigrp
->topology_table
, node1
, node11
, prefix
)) {
492 for (ALL_LIST_ELEMENTS(prefix
->entries
, node2
, node22
, entry
)) {
493 struct eigrp_fsm_action_message msg
;
495 if (entry
->adv_router
!= nbr
)
498 msg
.metrics
.delay
= EIGRP_MAX_METRIC
;
499 msg
.packet_type
= EIGRP_OPC_UPDATE
;
501 msg
.data_type
= EIGRP_INT
;
502 msg
.adv_router
= nbr
;
505 eigrp_fsm_event(&msg
);
509 eigrp_query_send_all(eigrp
);
510 eigrp_update_send_all(eigrp
, nbr
->ei
);
513 void eigrp_update_topology_table_prefix(struct list
*table
,
514 struct eigrp_prefix_entry
*prefix
)
516 struct listnode
*node1
, *node2
;
518 struct eigrp_nexthop_entry
*entry
;
519 for (ALL_LIST_ELEMENTS(prefix
->entries
, node1
, node2
, entry
)) {
520 if (entry
->distance
== EIGRP_MAX_METRIC
) {
521 eigrp_nexthop_entry_delete(prefix
, entry
);
524 if (prefix
->distance
== EIGRP_MAX_METRIC
525 && prefix
->nt
!= EIGRP_TOPOLOGY_TYPE_CONNECTED
) {
526 eigrp_prefix_entry_delete(table
, prefix
);