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 route_table
*table
)
122 eigrp_topology_delete_all(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
)));
151 * Adding topology entry to topology node
153 void eigrp_nexthop_entry_add(struct eigrp_prefix_entry
*node
,
154 struct eigrp_nexthop_entry
*entry
)
156 struct list
*l
= list_new();
158 listnode_add(l
, entry
);
160 if (listnode_lookup(node
->entries
, entry
) == NULL
) {
161 listnode_add_sort(node
->entries
, entry
);
162 entry
->prefix
= node
;
164 eigrp_zebra_route_add(node
->destination
, l
, node
->fdistance
);
171 * Deleting topology node from topology table
173 void eigrp_prefix_entry_delete(struct route_table
*table
,
174 struct eigrp_prefix_entry
*pe
)
176 struct eigrp
*eigrp
= eigrp_lookup();
177 struct eigrp_nexthop_entry
*ne
;
178 struct listnode
*node
, *nnode
;
179 struct route_node
*rn
;
184 rn
= route_node_lookup(table
, pe
->destination
);
189 * Emergency removal of the node from this list.
192 listnode_delete(eigrp
->topology_changes_internalIPV4
, pe
);
194 for (ALL_LIST_ELEMENTS(pe
->entries
, node
, nnode
, ne
))
195 eigrp_nexthop_entry_delete(pe
, ne
);
196 list_delete(&pe
->entries
);
197 list_delete(&pe
->rij
);
198 eigrp_zebra_route_delete(pe
->destination
);
199 prefix_free(pe
->destination
);
202 route_unlock_node(rn
); // Lookup above
203 route_unlock_node(rn
); // Initial creation
204 XFREE(MTYPE_EIGRP_PREFIX_ENTRY
, pe
);
208 * Deleting topology entry from topology node
210 void eigrp_nexthop_entry_delete(struct eigrp_prefix_entry
*node
,
211 struct eigrp_nexthop_entry
*entry
)
213 if (listnode_lookup(node
->entries
, entry
) != NULL
) {
214 listnode_delete(node
->entries
, entry
);
215 eigrp_zebra_route_delete(node
->destination
);
216 XFREE(MTYPE_EIGRP_NEXTHOP_ENTRY
, entry
);
221 * Deleting all nodes from topology table
223 void eigrp_topology_delete_all(struct route_table
*topology
)
225 struct route_node
*rn
;
226 struct eigrp_prefix_entry
*pe
;
228 for (rn
= route_top(topology
); rn
; rn
= route_next(rn
)) {
234 eigrp_prefix_entry_delete(topology
, pe
);
238 struct eigrp_prefix_entry
*
239 eigrp_topology_table_lookup_ipv4(struct route_table
*table
,
240 struct prefix
*address
)
242 struct eigrp_prefix_entry
*pe
;
243 struct route_node
*rn
;
245 rn
= route_node_lookup(table
, address
);
251 route_unlock_node(rn
);
257 * For a future optimization, put the successor list into it's
258 * own separate list from the full list?
260 * That way we can clean up all the list_new and list_delete's
261 * that we are doing. DBS
263 struct list
*eigrp_topology_get_successor(struct eigrp_prefix_entry
*table_node
)
265 struct list
*successors
= list_new();
266 struct eigrp_nexthop_entry
*data
;
267 struct listnode
*node1
, *node2
;
269 for (ALL_LIST_ELEMENTS(table_node
->entries
, node1
, node2
, data
)) {
270 if (data
->flags
& EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
) {
271 listnode_add(successors
, data
);
276 * If we have no successors return NULL
278 if (!successors
->count
) {
279 list_delete(&successors
);
287 eigrp_topology_get_successor_max(struct eigrp_prefix_entry
*table_node
,
288 unsigned int maxpaths
)
290 struct list
*successors
= eigrp_topology_get_successor(table_node
);
292 if (successors
&& successors
->count
> maxpaths
) {
294 struct listnode
*node
= listtail(successors
);
296 list_delete_node(successors
, node
);
298 } while (successors
->count
> maxpaths
);
304 struct eigrp_nexthop_entry
*
305 eigrp_prefix_entry_lookup(struct list
*entries
, struct eigrp_neighbor
*nbr
)
307 struct eigrp_nexthop_entry
*data
;
308 struct listnode
*node
, *nnode
;
309 for (ALL_LIST_ELEMENTS(entries
, node
, nnode
, data
)) {
310 if (data
->adv_router
== nbr
) {
318 /* Lookup all prefixes from specified neighbor */
319 struct list
*eigrp_neighbor_prefixes_lookup(struct eigrp
*eigrp
,
320 struct eigrp_neighbor
*nbr
)
322 struct listnode
*node2
, *node22
;
323 struct eigrp_nexthop_entry
*entry
;
324 struct eigrp_prefix_entry
*pe
;
325 struct route_node
*rn
;
327 /* create new empty list for prefixes storage */
328 struct list
*prefixes
= list_new();
330 /* iterate over all prefixes in topology table */
331 for (rn
= route_top(eigrp
->topology_table
); rn
; rn
= route_next(rn
)) {
335 /* iterate over all neighbor entry in prefix */
336 for (ALL_LIST_ELEMENTS(pe
->entries
, node2
, node22
, entry
)) {
337 /* if entry is from specified neighbor, add to list */
338 if (entry
->adv_router
== nbr
) {
339 listnode_add(prefixes
, pe
);
344 /* return list of prefixes from specified neighbor */
349 eigrp_topology_update_distance(struct eigrp_fsm_action_message
*msg
)
351 struct eigrp
*eigrp
= msg
->eigrp
;
352 struct eigrp_prefix_entry
*prefix
= msg
->prefix
;
353 struct eigrp_nexthop_entry
*entry
= msg
->entry
;
354 enum metric_change change
= METRIC_SAME
;
355 uint32_t new_reported_distance
;
359 switch (msg
->data_type
) {
360 case EIGRP_CONNECTED
:
361 if (prefix
->nt
== EIGRP_TOPOLOGY_TYPE_CONNECTED
)
364 change
= METRIC_DECREASE
;
367 if (prefix
->nt
== EIGRP_TOPOLOGY_TYPE_CONNECTED
) {
368 change
= METRIC_INCREASE
;
371 if (eigrp_metrics_is_same(msg
->metrics
,
372 entry
->reported_metric
)) {
373 return change
; // No change
376 new_reported_distance
=
377 eigrp_calculate_metrics(eigrp
, msg
->metrics
);
379 if (entry
->reported_distance
< new_reported_distance
) {
380 change
= METRIC_INCREASE
;
383 change
= METRIC_DECREASE
;
385 entry
->reported_metric
= msg
->metrics
;
386 entry
->reported_distance
= new_reported_distance
;
387 eigrp_calculate_metrics(eigrp
, msg
->metrics
);
388 entry
->distance
= eigrp_calculate_total_metrics(eigrp
, entry
);
391 if (prefix
->nt
== EIGRP_TOPOLOGY_TYPE_REMOTE_EXTERNAL
) {
392 if (eigrp_metrics_is_same(msg
->metrics
,
393 entry
->reported_metric
))
396 change
= METRIC_INCREASE
;
401 flog_err(EC_LIB_DEVELOPMENT
, "%s: Please implement handler",
402 __PRETTY_FUNCTION__
);
407 * Move to correct position in list according to new distance
409 listnode_delete(prefix
->entries
, entry
);
410 listnode_add_sort(prefix
->entries
, entry
);
415 void eigrp_topology_update_all_node_flags(struct eigrp
*eigrp
)
417 struct eigrp_prefix_entry
*pe
;
418 struct route_node
*rn
;
423 for (rn
= route_top(eigrp
->topology_table
); rn
; rn
= route_next(rn
)) {
429 eigrp_topology_update_node_flags(pe
);
433 void eigrp_topology_update_node_flags(struct eigrp_prefix_entry
*dest
)
435 struct listnode
*node
;
436 struct eigrp_nexthop_entry
*entry
;
437 struct eigrp
*eigrp
= eigrp_lookup();
441 for (ALL_LIST_ELEMENTS_RO(dest
->entries
, node
, entry
)) {
442 if (entry
->reported_distance
< dest
->fdistance
) {
443 // is feasible successor, can be successor
444 if (((uint64_t)entry
->distance
445 <= (uint64_t)dest
->distance
446 * (uint64_t)eigrp
->variance
)
447 && entry
->distance
!= EIGRP_MAX_METRIC
) {
450 EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
;
452 ~EIGRP_NEXTHOP_ENTRY_FSUCCESSOR_FLAG
;
454 // is feasible successor only
456 EIGRP_NEXTHOP_ENTRY_FSUCCESSOR_FLAG
;
458 ~EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
;
461 entry
->flags
&= ~EIGRP_NEXTHOP_ENTRY_FSUCCESSOR_FLAG
;
462 entry
->flags
&= ~EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG
;
467 void eigrp_update_routing_table(struct eigrp_prefix_entry
*prefix
)
469 struct eigrp
*eigrp
= eigrp_lookup();
470 struct list
*successors
;
471 struct listnode
*node
;
472 struct eigrp_nexthop_entry
*entry
;
477 successors
= eigrp_topology_get_successor_max(prefix
, eigrp
->max_paths
);
480 eigrp_zebra_route_add(prefix
->destination
, successors
,
482 for (ALL_LIST_ELEMENTS_RO(successors
, node
, entry
))
483 entry
->flags
|= EIGRP_NEXTHOP_ENTRY_INTABLE_FLAG
;
485 list_delete(&successors
);
487 eigrp_zebra_route_delete(prefix
->destination
);
488 for (ALL_LIST_ELEMENTS_RO(prefix
->entries
, node
, entry
))
489 entry
->flags
&= ~EIGRP_NEXTHOP_ENTRY_INTABLE_FLAG
;
493 void eigrp_topology_neighbor_down(struct eigrp
*eigrp
,
494 struct eigrp_neighbor
*nbr
)
496 struct listnode
*node2
, *node22
;
497 struct eigrp_prefix_entry
*pe
;
498 struct eigrp_nexthop_entry
*entry
;
499 struct route_node
*rn
;
501 for (rn
= route_top(eigrp
->topology_table
); rn
; rn
= route_next(rn
)) {
507 for (ALL_LIST_ELEMENTS(pe
->entries
, node2
, node22
, entry
)) {
508 struct eigrp_fsm_action_message msg
;
510 if (entry
->adv_router
!= nbr
)
513 msg
.metrics
.delay
= EIGRP_MAX_METRIC
;
514 msg
.packet_type
= EIGRP_OPC_UPDATE
;
516 msg
.data_type
= EIGRP_INT
;
517 msg
.adv_router
= nbr
;
520 eigrp_fsm_event(&msg
);
524 eigrp_query_send_all(eigrp
);
525 eigrp_update_send_all(eigrp
, nbr
->ei
);
528 void eigrp_update_topology_table_prefix(struct route_table
*table
,
529 struct eigrp_prefix_entry
*prefix
)
531 struct listnode
*node1
, *node2
;
533 struct eigrp_nexthop_entry
*entry
;
534 for (ALL_LIST_ELEMENTS(prefix
->entries
, node1
, node2
, entry
)) {
535 if (entry
->distance
== EIGRP_MAX_METRIC
) {
536 eigrp_nexthop_entry_delete(prefix
, entry
);
539 if (prefix
->distance
== EIGRP_MAX_METRIC
540 && prefix
->nt
!= EIGRP_TOPOLOGY_TYPE_CONNECTED
) {
541 eigrp_prefix_entry_delete(table
, prefix
);