]>
Commit | Line | Data |
---|---|---|
7f57883e DS |
1 | /* |
2 | * EIGRP Topology Table. | |
3 | * Copyright (C) 2013-2016 | |
4 | * Authors: | |
5 | * Donnie Savage | |
6 | * Jan Janovic | |
7 | * Matej Perina | |
8 | * Peter Orsag | |
9 | * Peter Paluch | |
10 | * Frantisek Gazo | |
11 | * Tomas Hvorkovy | |
12 | * Martin Kontsek | |
13 | * Lukas Koribsky | |
14 | * | |
15 | * This file is part of GNU Zebra. | |
16 | * | |
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 | |
20 | * later version. | |
21 | * | |
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. | |
26 | * | |
896014f4 DL |
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 | |
7f57883e DS |
30 | */ |
31 | ||
32 | #ifndef _ZEBRA_EIGRP_TOPOLOGY_H | |
33 | #define _ZEBRA_EIGRP_TOPOLOGY_H | |
34 | ||
7f57883e | 35 | /* EIGRP Topology table related functions. */ |
9ca66cc7 DS |
36 | extern struct route_table *eigrp_topology_new(void); |
37 | extern void eigrp_topology_init(struct route_table *table); | |
d62a17ae | 38 | extern struct eigrp_prefix_entry *eigrp_prefix_entry_new(void); |
255ab940 | 39 | extern struct eigrp_nexthop_entry *eigrp_nexthop_entry_new(void); |
0da93ecf | 40 | extern void eigrp_topology_free(struct eigrp *eigrp, struct route_table *table); |
9ca66cc7 DS |
41 | extern void eigrp_prefix_entry_add(struct route_table *table, |
42 | struct eigrp_prefix_entry *pe); | |
0da93ecf DS |
43 | extern void eigrp_nexthop_entry_add(struct eigrp *eigrp, |
44 | struct eigrp_prefix_entry *pe, | |
45 | struct eigrp_nexthop_entry *ne); | |
46 | extern void eigrp_prefix_entry_delete(struct eigrp *eigrp, | |
47 | struct route_table *table, | |
9ca66cc7 | 48 | struct eigrp_prefix_entry *pe); |
0da93ecf DS |
49 | extern void eigrp_nexthop_entry_delete(struct eigrp *eigrp, |
50 | struct eigrp_prefix_entry *pe, | |
51 | struct eigrp_nexthop_entry *ne); | |
52 | extern void eigrp_topology_delete_all(struct eigrp *eigrp, | |
53 | struct route_table *table); | |
d62a17ae | 54 | extern struct eigrp_prefix_entry * |
996c9314 | 55 | eigrp_topology_table_lookup_ipv4(struct route_table *table, struct prefix *p); |
0da93ecf | 56 | extern struct list *eigrp_topology_get_successor(struct eigrp_prefix_entry *pe); |
d62a17ae | 57 | extern struct list * |
58 | eigrp_topology_get_successor_max(struct eigrp_prefix_entry *pe, | |
59 | unsigned int maxpaths); | |
255ab940 | 60 | extern struct eigrp_nexthop_entry * |
0da93ecf DS |
61 | eigrp_prefix_entry_lookup(struct list *entries, struct eigrp_neighbor *neigh); |
62 | extern struct list *eigrp_neighbor_prefixes_lookup(struct eigrp *eigrp, | |
63 | struct eigrp_neighbor *n); | |
64 | extern void eigrp_topology_update_all_node_flags(struct eigrp *eigrp); | |
65 | extern void eigrp_topology_update_node_flags(struct eigrp *eigrp, | |
66 | struct eigrp_prefix_entry *pe); | |
996c9314 | 67 | extern enum metric_change |
0da93ecf DS |
68 | eigrp_topology_update_distance(struct eigrp_fsm_action_message *msg); |
69 | extern void eigrp_update_routing_table(struct eigrp *eigrp, | |
70 | struct eigrp_prefix_entry *pe); | |
71 | extern void eigrp_topology_neighbor_down(struct eigrp *eigrp, | |
72 | struct eigrp_neighbor *neigh); | |
73 | extern void eigrp_update_topology_table_prefix(struct eigrp *eigrp, | |
74 | struct route_table *table, | |
9ca66cc7 | 75 | struct eigrp_prefix_entry *pe); |
f6709c16 | 76 | |
7f57883e | 77 | #endif |