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
40 #include "lib_errors.h"
42 #include "eigrpd/eigrp_structs.h"
43 #include "eigrpd/eigrpd.h"
44 #include "eigrpd/eigrp_interface.h"
45 #include "eigrpd/eigrp_neighbor.h"
46 #include "eigrpd/eigrp_packet.h"
47 #include "eigrpd/eigrp_zebra.h"
48 #include "eigrpd/eigrp_vty.h"
49 #include "eigrpd/eigrp_network.h"
50 #include "eigrpd/eigrp_dump.h"
51 #include "eigrpd/eigrp_topology.h"
52 #include "eigrpd/eigrp_fsm.h"
53 #include "eigrpd/eigrp_memory.h"
55 static int eigrp_nexthop_entry_cmp(struct eigrp_nexthop_entry
*,
56 struct eigrp_nexthop_entry
*);
59 * Returns linkedlist used as topology table
60 * cmp - assigned function for comparing topology nodes
61 * del - assigned function executed before deleting topology node by list
64 struct route_table
*eigrp_topology_new(void)
66 return route_table_init();
70 * Returns new created toplogy node
71 * cmp - assigned function for comparing topology entry
73 struct eigrp_prefix_entry
*eigrp_prefix_entry_new(void)
75 struct eigrp_prefix_entry
*new;
76 new = XCALLOC(MTYPE_EIGRP_PREFIX_ENTRY
,
77 sizeof(struct eigrp_prefix_entry
));
78 new->entries
= list_new();
79 new->rij
= list_new();
80 new->entries
->cmp
= (int (*)(void *, void *))eigrp_nexthop_entry_cmp
;
81 new->distance
= new->fdistance
= new->rdistance
= EIGRP_MAX_METRIC
;
82 new->destination
= NULL
;
88 * Topology entry comparison
90 static int eigrp_nexthop_entry_cmp(struct eigrp_nexthop_entry
*entry1
,
91 struct eigrp_nexthop_entry
*entry2
)
93 if (entry1
->distance
< entry2
->distance
)
95 if (entry1
->distance
> entry2
->distance
)
102 * Returns new topology entry
105 struct eigrp_nexthop_entry
*eigrp_nexthop_entry_new(void)
107 struct eigrp_nexthop_entry
*new;
109 new = XCALLOC(MTYPE_EIGRP_NEXTHOP_ENTRY
,
110 sizeof(struct eigrp_nexthop_entry
));
111 new->reported_distance
= EIGRP_MAX_METRIC
;
112 new->distance
= EIGRP_MAX_METRIC
;
118 * Freeing topology table list
120 void eigrp_topology_free(struct eigrp
*eigrp
, struct route_table
*table
)
122 eigrp_topology_delete_all(eigrp
, table
);
123 route_table_finish(table
);
127 * Adding topology node to topology table
129 void eigrp_prefix_entry_add(struct route_table
*topology
,
130 struct eigrp_prefix_entry
*pe
)
132 struct route_node
*rn
;
134 rn
= route_node_get(topology
, pe
->destination
);
136 if (IS_DEBUG_EIGRP_EVENT
) {
137 char buf
[PREFIX_STRLEN
];
140 "%s: %s Should we have found this entry in the topo table?",
142 prefix2str(pe
->destination
, buf
, sizeof(buf
)));
144 route_unlock_node(rn
);
151 * Adding topology entry to topology node
153 void eigrp_nexthop_entry_add(struct eigrp
*eigrp
,
154 struct eigrp_prefix_entry
*node
,
155 struct eigrp_nexthop_entry
*entry
)
157 struct list
*l
= list_new();
159 listnode_add(l
, entry
);
161 if (listnode_lookup(node
->entries
, entry
) == NULL
) {
162 listnode_add_sort(node
->entries
, entry
);
163 entry
->prefix
= node
;
165 eigrp_zebra_route_add(eigrp
, node
->destination
,
173 * Deleting topology node from topology table
175 void eigrp_prefix_entry_delete(struct eigrp
*eigrp
, struct route_table
*table
,
176 struct eigrp_prefix_entry
*pe
)
178 struct eigrp_nexthop_entry
*ne
;
179 struct listnode
*node
, *nnode
;
180 struct route_node
*rn
;
185 rn
= route_node_lookup(table
, pe
->destination
);
190 * Emergency removal of the node from this list.
193 listnode_delete(eigrp
->topology_changes_internalIPV4
, pe
);
195 for (ALL_LIST_ELEMENTS(pe
->entries
, node
, nnode
, ne
))
196 eigrp_nexthop_entry_delete(eigrp
, pe
, ne
);
197 list_delete(&pe
->entries
);
198 list_delete(&pe
->rij
);
199 eigrp_zebra_route_delete(eigrp
, pe
->destination
);
200 prefix_free(&pe
->destination
);
203 route_unlock_node(rn
); // Lookup above
204 route_unlock_node(rn
); // Initial creation
205 XFREE(MTYPE_EIGRP_PREFIX_ENTRY
, pe
);
209 * Deleting topology entry from topology node
211 void eigrp_nexthop_entry_delete(struct eigrp
*eigrp
,
212 struct eigrp_prefix_entry
*node
,
213 struct eigrp_nexthop_entry
*entry
)
215 if (listnode_lookup(node
->entries
, entry
) != NULL
) {
216 listnode_delete(node
->entries
, entry
);
217 eigrp_zebra_route_delete(eigrp
, node
->destination
);
218 XFREE(MTYPE_EIGRP_NEXTHOP_ENTRY
, entry
);
223 * Deleting all nodes from topology table
225 void eigrp_topology_delete_all(struct eigrp
*eigrp
,
226 struct route_table
*topology
)
228 struct route_node
*rn
;
229 struct eigrp_prefix_entry
*pe
;
231 for (rn
= route_top(topology
); rn
; rn
= route_next(rn
)) {
237 eigrp_prefix_entry_delete(eigrp
, topology
, pe
);
241 struct eigrp_prefix_entry
*
242 eigrp_topology_table_lookup_ipv4(struct route_table
*table
,
243 struct prefix
*address
)
245 struct eigrp_prefix_entry
*pe
;
246 struct route_node
*rn
;
248 rn
= route_node_lookup(table
, address
);
254 route_unlock_node(rn
);
260 * For a future optimization, put the successor list into it's
261 * own separate list from the full list?
263 * That way we can clean up all the list_new and list_delete's
264 * that we are doing. DBS
266 struct list
*eigrp_topology_get_successor(struct eigrp_prefix_entry
*table_node
)
268 struct list
*successors
= list_new();
269 struct eigrp_nexthop_entry
*data
;
270 struct listnode
*node1
, *node2
;
272 for (ALL_LIST_ELEMENTS(table_node
->entries
, node1
, node2
, data
)) {
273 if (data
->flags
& EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
) {
274 listnode_add(successors
, data
);
279 * If we have no successors return NULL
281 if (!successors
->count
) {
282 list_delete(&successors
);
290 eigrp_topology_get_successor_max(struct eigrp_prefix_entry
*table_node
,
291 unsigned int maxpaths
)
293 struct list
*successors
= eigrp_topology_get_successor(table_node
);
295 if (successors
&& successors
->count
> maxpaths
) {
297 struct listnode
*node
= listtail(successors
);
299 list_delete_node(successors
, node
);
301 } while (successors
->count
> maxpaths
);
307 struct eigrp_nexthop_entry
*
308 eigrp_prefix_entry_lookup(struct list
*entries
, struct eigrp_neighbor
*nbr
)
310 struct eigrp_nexthop_entry
*data
;
311 struct listnode
*node
, *nnode
;
312 for (ALL_LIST_ELEMENTS(entries
, node
, nnode
, data
)) {
313 if (data
->adv_router
== nbr
) {
321 /* Lookup all prefixes from specified neighbor */
322 struct list
*eigrp_neighbor_prefixes_lookup(struct eigrp
*eigrp
,
323 struct eigrp_neighbor
*nbr
)
325 struct listnode
*node2
, *node22
;
326 struct eigrp_nexthop_entry
*entry
;
327 struct eigrp_prefix_entry
*pe
;
328 struct route_node
*rn
;
330 /* create new empty list for prefixes storage */
331 struct list
*prefixes
= list_new();
333 /* iterate over all prefixes in topology table */
334 for (rn
= route_top(eigrp
->topology_table
); rn
; rn
= route_next(rn
)) {
338 /* iterate over all neighbor entry in prefix */
339 for (ALL_LIST_ELEMENTS(pe
->entries
, node2
, node22
, entry
)) {
340 /* if entry is from specified neighbor, add to list */
341 if (entry
->adv_router
== nbr
) {
342 listnode_add(prefixes
, pe
);
347 /* return list of prefixes from specified neighbor */
352 eigrp_topology_update_distance(struct eigrp_fsm_action_message
*msg
)
354 struct eigrp
*eigrp
= msg
->eigrp
;
355 struct eigrp_prefix_entry
*prefix
= msg
->prefix
;
356 struct eigrp_nexthop_entry
*entry
= msg
->entry
;
357 enum metric_change change
= METRIC_SAME
;
358 uint32_t new_reported_distance
;
362 switch (msg
->data_type
) {
363 case EIGRP_CONNECTED
:
364 if (prefix
->nt
== EIGRP_TOPOLOGY_TYPE_CONNECTED
)
367 change
= METRIC_DECREASE
;
370 if (prefix
->nt
== EIGRP_TOPOLOGY_TYPE_CONNECTED
) {
371 change
= METRIC_INCREASE
;
374 if (eigrp_metrics_is_same(msg
->metrics
,
375 entry
->reported_metric
)) {
376 return change
; // No change
379 new_reported_distance
=
380 eigrp_calculate_metrics(eigrp
, msg
->metrics
);
382 if (entry
->reported_distance
< new_reported_distance
) {
383 change
= METRIC_INCREASE
;
386 change
= METRIC_DECREASE
;
388 entry
->reported_metric
= msg
->metrics
;
389 entry
->reported_distance
= new_reported_distance
;
390 eigrp_calculate_metrics(eigrp
, msg
->metrics
);
391 entry
->distance
= eigrp_calculate_total_metrics(eigrp
, entry
);
394 if (prefix
->nt
== EIGRP_TOPOLOGY_TYPE_REMOTE_EXTERNAL
) {
395 if (eigrp_metrics_is_same(msg
->metrics
,
396 entry
->reported_metric
))
399 change
= METRIC_INCREASE
;
404 flog_err(EC_LIB_DEVELOPMENT
, "%s: Please implement handler",
410 * Move to correct position in list according to new distance
412 listnode_delete(prefix
->entries
, entry
);
413 listnode_add_sort(prefix
->entries
, entry
);
418 void eigrp_topology_update_all_node_flags(struct eigrp
*eigrp
)
420 struct eigrp_prefix_entry
*pe
;
421 struct route_node
*rn
;
426 for (rn
= route_top(eigrp
->topology_table
); rn
; rn
= route_next(rn
)) {
432 eigrp_topology_update_node_flags(eigrp
, pe
);
436 void eigrp_topology_update_node_flags(struct eigrp
*eigrp
,
437 struct eigrp_prefix_entry
*dest
)
439 struct listnode
*node
;
440 struct eigrp_nexthop_entry
*entry
;
442 for (ALL_LIST_ELEMENTS_RO(dest
->entries
, node
, entry
)) {
443 if (entry
->reported_distance
< dest
->fdistance
) {
444 // is feasible successor, can be successor
445 if (((uint64_t)entry
->distance
446 <= (uint64_t)dest
->distance
447 * (uint64_t)eigrp
->variance
)
448 && entry
->distance
!= EIGRP_MAX_METRIC
) {
451 EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
;
453 ~EIGRP_NEXTHOP_ENTRY_FSUCCESSOR_FLAG
;
455 // is feasible successor only
457 EIGRP_NEXTHOP_ENTRY_FSUCCESSOR_FLAG
;
459 ~EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
;
462 entry
->flags
&= ~EIGRP_NEXTHOP_ENTRY_FSUCCESSOR_FLAG
;
463 entry
->flags
&= ~EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
;
468 void eigrp_update_routing_table(struct eigrp
*eigrp
,
469 struct eigrp_prefix_entry
*prefix
)
471 struct list
*successors
;
472 struct listnode
*node
;
473 struct eigrp_nexthop_entry
*entry
;
475 successors
= eigrp_topology_get_successor_max(prefix
, eigrp
->max_paths
);
478 eigrp_zebra_route_add(eigrp
, prefix
->destination
, successors
,
480 for (ALL_LIST_ELEMENTS_RO(successors
, node
, entry
))
481 entry
->flags
|= EIGRP_NEXTHOP_ENTRY_INTABLE_FLAG
;
483 list_delete(&successors
);
485 eigrp_zebra_route_delete(eigrp
, prefix
->destination
);
486 for (ALL_LIST_ELEMENTS_RO(prefix
->entries
, node
, entry
))
487 entry
->flags
&= ~EIGRP_NEXTHOP_ENTRY_INTABLE_FLAG
;
491 void eigrp_topology_neighbor_down(struct eigrp
*eigrp
,
492 struct eigrp_neighbor
*nbr
)
494 struct listnode
*node2
, *node22
;
495 struct eigrp_prefix_entry
*pe
;
496 struct eigrp_nexthop_entry
*entry
;
497 struct route_node
*rn
;
499 for (rn
= route_top(eigrp
->topology_table
); rn
; rn
= route_next(rn
)) {
505 for (ALL_LIST_ELEMENTS(pe
->entries
, node2
, node22
, entry
)) {
506 struct eigrp_fsm_action_message msg
;
508 if (entry
->adv_router
!= nbr
)
511 msg
.metrics
.delay
= EIGRP_MAX_METRIC
;
512 msg
.packet_type
= EIGRP_OPC_UPDATE
;
514 msg
.data_type
= EIGRP_INT
;
515 msg
.adv_router
= nbr
;
518 eigrp_fsm_event(&msg
);
522 eigrp_query_send_all(eigrp
);
523 eigrp_update_send_all(eigrp
, nbr
->ei
);
526 void eigrp_update_topology_table_prefix(struct eigrp
*eigrp
,
527 struct route_table
*table
,
528 struct eigrp_prefix_entry
*prefix
)
530 struct listnode
*node1
, *node2
;
532 struct eigrp_nexthop_entry
*entry
;
533 for (ALL_LIST_ELEMENTS(prefix
->entries
, node1
, node2
, entry
)) {
534 if (entry
->distance
== EIGRP_MAX_METRIC
) {
535 eigrp_nexthop_entry_delete(eigrp
, prefix
, entry
);
538 if (prefix
->distance
== EIGRP_MAX_METRIC
539 && prefix
->nt
!= EIGRP_TOPOLOGY_TYPE_CONNECTED
) {
540 eigrp_prefix_entry_delete(eigrp
, table
, prefix
);