]>
Commit | Line | Data |
---|---|---|
7f57883e DS |
1 | /* |
2 | * EIGRP Daemon Program. | |
3 | * Copyright (C) 2013-2014 | |
4 | * Authors: | |
5 | * Donnie Savage | |
6 | * Jan Janovic | |
7 | * Matej Perina | |
8 | * Peter Orsag | |
9 | * Peter Paluch | |
10 | * | |
11 | * This file is part of GNU Zebra. | |
12 | * | |
13 | * GNU Zebra is free software; you can redistribute it and/or modify it | |
14 | * under the terms of the GNU General Public License as published by the | |
15 | * Free Software Foundation; either version 2, or (at your option) any | |
16 | * later version. | |
17 | * | |
18 | * GNU Zebra is distributed in the hope that it will be useful, but | |
19 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
20 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
21 | * General Public License for more details. | |
22 | * | |
896014f4 DL |
23 | * You should have received a copy of the GNU General Public License along |
24 | * with this program; see the file COPYING; if not, write to the Free Software | |
25 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
7f57883e DS |
26 | */ |
27 | ||
28 | #include <zebra.h> | |
29 | ||
30 | #include "thread.h" | |
31 | #include "vty.h" | |
32 | #include "command.h" | |
33 | #include "linklist.h" | |
34 | #include "prefix.h" | |
35 | #include "table.h" | |
36 | #include "if.h" | |
37 | #include "memory.h" | |
38 | #include "stream.h" | |
39 | #include "log.h" | |
d62a17ae | 40 | #include "sockunion.h" /* for inet_aton () */ |
7f57883e DS |
41 | #include "zclient.h" |
42 | #include "plist.h" | |
43 | #include "sockopt.h" | |
44 | #include "keychain.h" | |
8879bd22 | 45 | #include "libfrr.h" |
8b0a80f1 | 46 | #include "lib_errors.h" |
03a38493 | 47 | #include "distribute.h" |
7f57883e DS |
48 | |
49 | #include "eigrpd/eigrp_structs.h" | |
50 | #include "eigrpd/eigrpd.h" | |
51 | #include "eigrpd/eigrp_interface.h" | |
52 | #include "eigrpd/eigrp_zebra.h" | |
53 | #include "eigrpd/eigrp_vty.h" | |
54 | #include "eigrpd/eigrp_neighbor.h" | |
55 | #include "eigrpd/eigrp_packet.h" | |
56 | #include "eigrpd/eigrp_network.h" | |
57 | #include "eigrpd/eigrp_topology.h" | |
58 | #include "eigrpd/eigrp_memory.h" | |
03a38493 | 59 | #include "eigrpd/eigrp_filter.h" |
7f57883e DS |
60 | |
61 | DEFINE_QOBJ_TYPE(eigrp) | |
62 | ||
63 | static struct eigrp_master eigrp_master; | |
64 | ||
65 | struct eigrp_master *eigrp_om; | |
66 | ||
7f57883e DS |
67 | extern struct zclient *zclient; |
68 | extern struct in_addr router_id_zebra; | |
69 | ||
70 | ||
71 | /* | |
72 | * void eigrp_router_id_update(struct eigrp *eigrp) | |
73 | * | |
74 | * Description: | |
75 | * update routerid associated with this instance of EIGRP. | |
76 | * If the id changes, then call if_update for each interface | |
77 | * to resync the topology database with all neighbors | |
78 | * | |
79 | * Select the router ID based on these priorities: | |
80 | * 1. Statically assigned router ID is always the first choice. | |
81 | * 2. If there is no statically assigned router ID, then try to stick | |
82 | * with the most recent value, since changing router ID's is very | |
83 | * disruptive. | |
84 | * 3. Last choice: just go with whatever the zebra daemon recommends. | |
85 | * | |
86 | * Note: | |
87 | * router id for EIGRP is really just a 32 bit number. Cisco historically | |
88 | * displays it in dotted decimal notation, and will pickup an IP address | |
89 | * from an interface so it can be 'auto-configed" to a uniqe value | |
90 | * | |
91 | * This does not work for IPv6, and to make the code simpler, its | |
92 | * stored and processed internerall as a 32bit number | |
93 | */ | |
d62a17ae | 94 | void eigrp_router_id_update(struct eigrp *eigrp) |
7f57883e | 95 | { |
daa64bdf | 96 | struct vrf *vrf = vrf_lookup_by_id(eigrp->vrf_id); |
d62a17ae | 97 | struct interface *ifp; |
900e2d42 | 98 | struct in_addr router_id, router_id_old; |
7f57883e | 99 | |
d62a17ae | 100 | router_id_old = eigrp->router_id; |
7f57883e | 101 | |
900e2d42 | 102 | if (eigrp->router_id_static.s_addr != 0) |
d62a17ae | 103 | router_id = eigrp->router_id_static; |
7f57883e | 104 | |
900e2d42 | 105 | else if (eigrp->router_id.s_addr != 0) |
d62a17ae | 106 | router_id = eigrp->router_id; |
7f57883e | 107 | |
d62a17ae | 108 | else |
900e2d42 | 109 | router_id = router_id_zebra; |
7f57883e | 110 | |
d62a17ae | 111 | eigrp->router_id = router_id; |
900e2d42 | 112 | if (router_id_old.s_addr != router_id.s_addr) { |
d62a17ae | 113 | // if (IS_DEBUG_EIGRP_EVENT) |
114 | // zlog_debug("Router-ID[NEW:%s]: Update", | |
115 | // inet_ntoa(eigrp->router_id)); | |
7f57883e | 116 | |
d62a17ae | 117 | /* update eigrp_interface's */ |
451fda4f | 118 | FOR_ALL_INTERFACES (vrf, ifp) |
d62a17ae | 119 | eigrp_if_update(ifp); |
120 | } | |
7f57883e DS |
121 | } |
122 | ||
4d762f26 | 123 | void eigrp_master_init(void) |
7f57883e | 124 | { |
d62a17ae | 125 | struct timeval tv; |
7f57883e | 126 | |
d62a17ae | 127 | memset(&eigrp_master, 0, sizeof(struct eigrp_master)); |
7f57883e | 128 | |
d62a17ae | 129 | eigrp_om = &eigrp_master; |
130 | eigrp_om->eigrp = list_new(); | |
7f57883e | 131 | |
d62a17ae | 132 | monotime(&tv); |
133 | eigrp_om->start_time = tv.tv_sec; | |
7f57883e DS |
134 | } |
135 | ||
7f57883e | 136 | /* Allocate new eigrp structure. */ |
c371cd6b | 137 | static struct eigrp *eigrp_new(const char *AS, vrf_id_t vrf_id) |
7f57883e | 138 | { |
d62a17ae | 139 | struct eigrp *eigrp = XCALLOC(MTYPE_EIGRP_TOP, sizeof(struct eigrp)); |
140 | int eigrp_socket; | |
141 | ||
142 | /* init information relevant to peers */ | |
c371cd6b | 143 | eigrp->vrf_id = vrf_id; |
d62a17ae | 144 | eigrp->vrid = 0; |
145 | eigrp->AS = atoi(AS); | |
900e2d42 DS |
146 | eigrp->router_id.s_addr = 0; |
147 | eigrp->router_id_static.s_addr = 0; | |
d62a17ae | 148 | eigrp->sequence_number = 1; |
149 | ||
150 | /*Configure default K Values for EIGRP Process*/ | |
151 | eigrp->k_values[0] = EIGRP_K1_DEFAULT; | |
152 | eigrp->k_values[1] = EIGRP_K2_DEFAULT; | |
153 | eigrp->k_values[2] = EIGRP_K3_DEFAULT; | |
154 | eigrp->k_values[3] = EIGRP_K4_DEFAULT; | |
155 | eigrp->k_values[4] = EIGRP_K5_DEFAULT; | |
156 | eigrp->k_values[5] = EIGRP_K6_DEFAULT; | |
157 | ||
158 | /* init internal data structures */ | |
159 | eigrp->eiflist = list_new(); | |
160 | eigrp->passive_interface_default = EIGRP_IF_ACTIVE; | |
9ca66cc7 | 161 | eigrp->networks = eigrp_topology_new(); |
d62a17ae | 162 | |
163 | if ((eigrp_socket = eigrp_sock_init()) < 0) { | |
09c866e3 | 164 | flog_err_sys( |
450971aa | 165 | EC_LIB_SOCKET, |
09c866e3 | 166 | "eigrp_new: fatal error: eigrp_sock_init was unable to open a socket"); |
d62a17ae | 167 | exit(1); |
168 | } | |
169 | ||
170 | eigrp->fd = eigrp_socket; | |
171 | eigrp->maxsndbuflen = getsockopt_so_sendbuf(eigrp->fd); | |
172 | ||
6ae7ed45 | 173 | eigrp->ibuf = stream_new(EIGRP_PACKET_MAX_LEN + 1); |
d62a17ae | 174 | |
175 | eigrp->t_read = NULL; | |
176 | thread_add_read(master, eigrp_read, eigrp, eigrp->fd, &eigrp->t_read); | |
177 | eigrp->oi_write_q = list_new(); | |
178 | ||
9ca66cc7 | 179 | eigrp->topology_table = route_table_init(); |
d62a17ae | 180 | |
181 | eigrp->neighbor_self = eigrp_nbr_new(NULL); | |
182 | eigrp->neighbor_self->src.s_addr = INADDR_ANY; | |
183 | ||
184 | eigrp->variance = EIGRP_VARIANCE_DEFAULT; | |
185 | eigrp->max_paths = EIGRP_MAX_PATHS_DEFAULT; | |
186 | ||
187 | eigrp->serno = 0; | |
188 | eigrp->serno_last_update = 0; | |
189 | eigrp->topology_changes_externalIPV4 = list_new(); | |
190 | eigrp->topology_changes_internalIPV4 = list_new(); | |
191 | ||
192 | eigrp->list[EIGRP_FILTER_IN] = NULL; | |
193 | eigrp->list[EIGRP_FILTER_OUT] = NULL; | |
194 | ||
195 | eigrp->prefix[EIGRP_FILTER_IN] = NULL; | |
196 | eigrp->prefix[EIGRP_FILTER_OUT] = NULL; | |
197 | ||
198 | eigrp->routemap[EIGRP_FILTER_IN] = NULL; | |
199 | eigrp->routemap[EIGRP_FILTER_OUT] = NULL; | |
200 | ||
03a38493 | 201 | /* Distribute list install. */ |
daa64bdf DS |
202 | eigrp->distribute_ctx = |
203 | distribute_list_ctx_create(vrf_lookup_by_id(eigrp->vrf_id)); | |
03a38493 PG |
204 | distribute_list_add_hook(eigrp->distribute_ctx, |
205 | eigrp_distribute_update); | |
206 | distribute_list_delete_hook(eigrp->distribute_ctx, | |
207 | eigrp_distribute_update); | |
4b23867c PG |
208 | |
209 | /* | |
daa64bdf | 210 | eigrp->if_rmap_ctx = if_rmap_ctx_create(eigrp->vrf_id); |
4b23867c PG |
211 | if_rmap_hook_add (eigrp_if_rmap_update); |
212 | if_rmap_hook_delete (eigrp_if_rmap_update); | |
213 | */ | |
d62a17ae | 214 | QOBJ_REG(eigrp, eigrp); |
215 | return eigrp; | |
7f57883e DS |
216 | } |
217 | ||
c371cd6b | 218 | struct eigrp *eigrp_get(const char *AS, vrf_id_t vrf_id) |
7f57883e | 219 | { |
d62a17ae | 220 | struct eigrp *eigrp; |
7f57883e | 221 | |
d62a17ae | 222 | eigrp = eigrp_lookup(); |
223 | if (eigrp == NULL) { | |
c371cd6b | 224 | eigrp = eigrp_new(AS, vrf_id); |
7eee7ef6 | 225 | listnode_add(eigrp_om->eigrp, eigrp); |
d62a17ae | 226 | } |
7f57883e | 227 | |
d62a17ae | 228 | return eigrp; |
7f57883e DS |
229 | } |
230 | ||
231 | /* Shut down the entire process */ | |
d62a17ae | 232 | void eigrp_terminate(void) |
7f57883e | 233 | { |
d62a17ae | 234 | struct eigrp *eigrp; |
235 | struct listnode *node, *nnode; | |
7f57883e | 236 | |
d62a17ae | 237 | /* shutdown already in progress */ |
238 | if (CHECK_FLAG(eigrp_om->options, EIGRP_MASTER_SHUTDOWN)) | |
239 | return; | |
7f57883e | 240 | |
d62a17ae | 241 | SET_FLAG(eigrp_om->options, EIGRP_MASTER_SHUTDOWN); |
7f57883e | 242 | |
d62a17ae | 243 | for (ALL_LIST_ELEMENTS(eigrp_om->eigrp, node, nnode, eigrp)) |
244 | eigrp_finish(eigrp); | |
8879bd22 RW |
245 | |
246 | frr_fini(); | |
7f57883e DS |
247 | } |
248 | ||
d62a17ae | 249 | void eigrp_finish(struct eigrp *eigrp) |
7f57883e | 250 | { |
d62a17ae | 251 | eigrp_finish_final(eigrp); |
252 | ||
253 | /* eigrp being shut-down? If so, was this the last eigrp instance? */ | |
254 | if (CHECK_FLAG(eigrp_om->options, EIGRP_MASTER_SHUTDOWN) | |
255 | && (listcount(eigrp_om->eigrp) == 0)) { | |
256 | if (zclient) { | |
257 | zclient_stop(zclient); | |
258 | zclient_free(zclient); | |
259 | } | |
260 | exit(0); | |
edaf6c01 | 261 | } |
7f57883e | 262 | |
d62a17ae | 263 | return; |
7f57883e DS |
264 | } |
265 | ||
266 | /* Final cleanup of eigrp instance */ | |
d62a17ae | 267 | void eigrp_finish_final(struct eigrp *eigrp) |
7f57883e | 268 | { |
d62a17ae | 269 | struct eigrp_interface *ei; |
270 | struct eigrp_neighbor *nbr; | |
271 | struct listnode *node, *nnode, *node2, *nnode2; | |
272 | ||
273 | for (ALL_LIST_ELEMENTS(eigrp->eiflist, node, nnode, ei)) { | |
274 | for (ALL_LIST_ELEMENTS(ei->nbrs, node2, nnode2, nbr)) | |
275 | eigrp_nbr_delete(nbr); | |
276 | eigrp_if_free(ei, INTERFACE_DOWN_BY_FINAL); | |
277 | } | |
7f57883e | 278 | |
d62a17ae | 279 | THREAD_OFF(eigrp->t_write); |
280 | THREAD_OFF(eigrp->t_read); | |
281 | close(eigrp->fd); | |
7f57883e | 282 | |
6a154c88 DL |
283 | list_delete(&eigrp->eiflist); |
284 | list_delete(&eigrp->oi_write_q); | |
7f57883e | 285 | |
d62a17ae | 286 | eigrp_topology_free(eigrp->topology_table); |
7f57883e | 287 | |
d62a17ae | 288 | eigrp_nbr_delete(eigrp->neighbor_self); |
7f57883e | 289 | |
6a154c88 DL |
290 | list_delete(&eigrp->topology_changes_externalIPV4); |
291 | list_delete(&eigrp->topology_changes_internalIPV4); | |
052fe054 | 292 | |
7eee7ef6 | 293 | listnode_delete(eigrp_om->eigrp, eigrp); |
7f57883e | 294 | |
7eee7ef6 | 295 | stream_free(eigrp->ibuf); |
03a38493 | 296 | distribute_list_delete(&eigrp->distribute_ctx); |
d62a17ae | 297 | XFREE(MTYPE_EIGRP_TOP, eigrp); |
7f57883e DS |
298 | } |
299 | ||
300 | /*Look for existing eigrp process*/ | |
d62a17ae | 301 | struct eigrp *eigrp_lookup(void) |
7f57883e | 302 | { |
d62a17ae | 303 | if (listcount(eigrp_om->eigrp) == 0) |
304 | return NULL; | |
7f57883e | 305 | |
d62a17ae | 306 | return listgetdata(listhead(eigrp_om->eigrp)); |
7f57883e | 307 | } |