]> git.proxmox.com Git - mirror_frr.git/blame - eigrpd/eigrpd.c
zebra: Allow ns delete to happen after under/over flow checks
[mirror_frr.git] / eigrpd / eigrpd.c
CommitLineData
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"
7f57883e
DS
47
48#include "eigrpd/eigrp_structs.h"
49#include "eigrpd/eigrpd.h"
50#include "eigrpd/eigrp_interface.h"
51#include "eigrpd/eigrp_zebra.h"
52#include "eigrpd/eigrp_vty.h"
53#include "eigrpd/eigrp_neighbor.h"
54#include "eigrpd/eigrp_packet.h"
55#include "eigrpd/eigrp_network.h"
56#include "eigrpd/eigrp_topology.h"
57#include "eigrpd/eigrp_memory.h"
58
59DEFINE_QOBJ_TYPE(eigrp)
60
61static struct eigrp_master eigrp_master;
62
63struct eigrp_master *eigrp_om;
64
7f57883e 65static struct eigrp *eigrp_new(const char *);
7f57883e
DS
66
67extern struct zclient *zclient;
68extern 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 94void eigrp_router_id_update(struct eigrp *eigrp)
7f57883e 95{
f4e14fdb 96 struct vrf *vrf = vrf_lookup_by_id(VRF_DEFAULT);
d62a17ae 97 struct interface *ifp;
d7c0a89a 98 uint32_t router_id, router_id_old;
7f57883e 99
d62a17ae 100 router_id_old = eigrp->router_id;
7f57883e 101
d62a17ae 102 if (eigrp->router_id_static != 0)
103 router_id = eigrp->router_id_static;
7f57883e 104
d62a17ae 105 else if (eigrp->router_id != 0)
106 router_id = eigrp->router_id;
7f57883e 107
d62a17ae 108 else
109 router_id = router_id_zebra.s_addr;
7f57883e 110
d62a17ae 111 eigrp->router_id = router_id;
112 if (router_id_old != router_id) {
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
d62a17ae 123void eigrp_master_init()
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. */
d62a17ae 137static struct eigrp *eigrp_new(const char *AS)
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 */
143 eigrp->vrid = 0;
144 eigrp->AS = atoi(AS);
145 eigrp->router_id = 0L;
146 eigrp->router_id_static = 0L;
147 eigrp->sequence_number = 1;
148
149 /*Configure default K Values for EIGRP Process*/
150 eigrp->k_values[0] = EIGRP_K1_DEFAULT;
151 eigrp->k_values[1] = EIGRP_K2_DEFAULT;
152 eigrp->k_values[2] = EIGRP_K3_DEFAULT;
153 eigrp->k_values[3] = EIGRP_K4_DEFAULT;
154 eigrp->k_values[4] = EIGRP_K5_DEFAULT;
155 eigrp->k_values[5] = EIGRP_K6_DEFAULT;
156
157 /* init internal data structures */
158 eigrp->eiflist = list_new();
159 eigrp->passive_interface_default = EIGRP_IF_ACTIVE;
9ca66cc7 160 eigrp->networks = eigrp_topology_new();
d62a17ae 161
162 if ((eigrp_socket = eigrp_sock_init()) < 0) {
09c866e3 163 flog_err_sys(
450971aa 164 EC_LIB_SOCKET,
09c866e3 165 "eigrp_new: fatal error: eigrp_sock_init was unable to open a socket");
d62a17ae 166 exit(1);
167 }
168
169 eigrp->fd = eigrp_socket;
170 eigrp->maxsndbuflen = getsockopt_so_sendbuf(eigrp->fd);
171
6ae7ed45 172 eigrp->ibuf = stream_new(EIGRP_PACKET_MAX_LEN + 1);
d62a17ae 173
174 eigrp->t_read = NULL;
175 thread_add_read(master, eigrp_read, eigrp, eigrp->fd, &eigrp->t_read);
176 eigrp->oi_write_q = list_new();
177
9ca66cc7 178 eigrp->topology_table = route_table_init();
d62a17ae 179
180 eigrp->neighbor_self = eigrp_nbr_new(NULL);
181 eigrp->neighbor_self->src.s_addr = INADDR_ANY;
182
183 eigrp->variance = EIGRP_VARIANCE_DEFAULT;
184 eigrp->max_paths = EIGRP_MAX_PATHS_DEFAULT;
185
186 eigrp->serno = 0;
187 eigrp->serno_last_update = 0;
188 eigrp->topology_changes_externalIPV4 = list_new();
189 eigrp->topology_changes_internalIPV4 = list_new();
190
191 eigrp->list[EIGRP_FILTER_IN] = NULL;
192 eigrp->list[EIGRP_FILTER_OUT] = NULL;
193
194 eigrp->prefix[EIGRP_FILTER_IN] = NULL;
195 eigrp->prefix[EIGRP_FILTER_OUT] = NULL;
196
197 eigrp->routemap[EIGRP_FILTER_IN] = NULL;
198 eigrp->routemap[EIGRP_FILTER_OUT] = NULL;
199
200 QOBJ_REG(eigrp, eigrp);
201 return eigrp;
7f57883e
DS
202}
203
d62a17ae 204struct eigrp *eigrp_get(const char *AS)
7f57883e 205{
d62a17ae 206 struct eigrp *eigrp;
7f57883e 207
d62a17ae 208 eigrp = eigrp_lookup();
209 if (eigrp == NULL) {
210 eigrp = eigrp_new(AS);
7eee7ef6 211 listnode_add(eigrp_om->eigrp, eigrp);
d62a17ae 212 }
7f57883e 213
d62a17ae 214 return eigrp;
7f57883e
DS
215}
216
217/* Shut down the entire process */
d62a17ae 218void eigrp_terminate(void)
7f57883e 219{
d62a17ae 220 struct eigrp *eigrp;
221 struct listnode *node, *nnode;
7f57883e 222
d62a17ae 223 /* shutdown already in progress */
224 if (CHECK_FLAG(eigrp_om->options, EIGRP_MASTER_SHUTDOWN))
225 return;
7f57883e 226
d62a17ae 227 SET_FLAG(eigrp_om->options, EIGRP_MASTER_SHUTDOWN);
7f57883e 228
d62a17ae 229 for (ALL_LIST_ELEMENTS(eigrp_om->eigrp, node, nnode, eigrp))
230 eigrp_finish(eigrp);
8879bd22
RW
231
232 frr_fini();
7f57883e
DS
233}
234
d62a17ae 235void eigrp_finish(struct eigrp *eigrp)
7f57883e 236{
d62a17ae 237 eigrp_finish_final(eigrp);
238
239 /* eigrp being shut-down? If so, was this the last eigrp instance? */
240 if (CHECK_FLAG(eigrp_om->options, EIGRP_MASTER_SHUTDOWN)
241 && (listcount(eigrp_om->eigrp) == 0)) {
242 if (zclient) {
243 zclient_stop(zclient);
244 zclient_free(zclient);
245 }
246 exit(0);
edaf6c01 247 }
7f57883e 248
d62a17ae 249 return;
7f57883e
DS
250}
251
252/* Final cleanup of eigrp instance */
d62a17ae 253void eigrp_finish_final(struct eigrp *eigrp)
7f57883e 254{
d62a17ae 255 struct eigrp_interface *ei;
256 struct eigrp_neighbor *nbr;
257 struct listnode *node, *nnode, *node2, *nnode2;
258
259 for (ALL_LIST_ELEMENTS(eigrp->eiflist, node, nnode, ei)) {
260 for (ALL_LIST_ELEMENTS(ei->nbrs, node2, nnode2, nbr))
261 eigrp_nbr_delete(nbr);
262 eigrp_if_free(ei, INTERFACE_DOWN_BY_FINAL);
263 }
7f57883e 264
d62a17ae 265 THREAD_OFF(eigrp->t_write);
266 THREAD_OFF(eigrp->t_read);
267 close(eigrp->fd);
7f57883e 268
6a154c88
DL
269 list_delete(&eigrp->eiflist);
270 list_delete(&eigrp->oi_write_q);
7f57883e 271
d62a17ae 272 eigrp_topology_free(eigrp->topology_table);
7f57883e 273
d62a17ae 274 eigrp_nbr_delete(eigrp->neighbor_self);
7f57883e 275
6a154c88
DL
276 list_delete(&eigrp->topology_changes_externalIPV4);
277 list_delete(&eigrp->topology_changes_internalIPV4);
052fe054 278
7eee7ef6 279 listnode_delete(eigrp_om->eigrp, eigrp);
7f57883e 280
7eee7ef6 281 stream_free(eigrp->ibuf);
d62a17ae 282 XFREE(MTYPE_EIGRP_TOP, eigrp);
7f57883e
DS
283}
284
285/*Look for existing eigrp process*/
d62a17ae 286struct eigrp *eigrp_lookup(void)
7f57883e 287{
d62a17ae 288 if (listcount(eigrp_om->eigrp) == 0)
289 return NULL;
7f57883e 290
d62a17ae 291 return listgetdata(listhead(eigrp_om->eigrp));
7f57883e 292}