]> git.proxmox.com Git - mirror_frr.git/blob - eigrpd/eigrp_interface.c
zebra: Allow ns delete to happen after under/over flow checks
[mirror_frr.git] / eigrpd / eigrp_interface.c
1 /*
2 * EIGRP Interface Functions.
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 *
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
30 */
31
32 #include <zebra.h>
33
34 #include "thread.h"
35 #include "linklist.h"
36 #include "prefix.h"
37 #include "if.h"
38 #include "table.h"
39 #include "memory.h"
40 #include "command.h"
41 #include "stream.h"
42 #include "log.h"
43 #include "keychain.h"
44 #include "vrf.h"
45
46 #include "eigrpd/eigrp_structs.h"
47 #include "eigrpd/eigrpd.h"
48 #include "eigrpd/eigrp_interface.h"
49 #include "eigrpd/eigrp_neighbor.h"
50 #include "eigrpd/eigrp_packet.h"
51 #include "eigrpd/eigrp_zebra.h"
52 #include "eigrpd/eigrp_vty.h"
53 #include "eigrpd/eigrp_network.h"
54 #include "eigrpd/eigrp_topology.h"
55 #include "eigrpd/eigrp_memory.h"
56 #include "eigrpd/eigrp_fsm.h"
57
58 struct eigrp_interface *eigrp_if_new(struct eigrp *eigrp, struct interface *ifp,
59 struct prefix *p)
60 {
61 struct eigrp_interface *ei = ifp->info;
62 int i;
63
64 if (ei)
65 return ei;
66
67 ei = XCALLOC(MTYPE_EIGRP_IF, sizeof(struct eigrp_interface));
68
69 /* Set zebra interface pointer. */
70 ei->ifp = ifp;
71 ei->address = p;
72
73 ifp->info = ei;
74 listnode_add(eigrp->eiflist, ei);
75
76 ei->type = EIGRP_IFTYPE_BROADCAST;
77
78 /* Initialize neighbor list. */
79 ei->nbrs = list_new();
80
81 ei->crypt_seqnum = time(NULL);
82
83 /* Initialize lists */
84 for (i = 0; i < EIGRP_FILTER_MAX; i++) {
85 ei->list[i] = NULL;
86 ei->prefix[i] = NULL;
87 ei->routemap[i] = NULL;
88 }
89
90 ei->eigrp = eigrp;
91
92 ei->params.v_hello = EIGRP_HELLO_INTERVAL_DEFAULT;
93 ei->params.v_wait = EIGRP_HOLD_INTERVAL_DEFAULT;
94 ei->params.bandwidth = EIGRP_BANDWIDTH_DEFAULT;
95 ei->params.delay = EIGRP_DELAY_DEFAULT;
96 ei->params.reliability = EIGRP_RELIABILITY_DEFAULT;
97 ei->params.load = EIGRP_LOAD_DEFAULT;
98 ei->params.auth_type = EIGRP_AUTH_TYPE_NONE;
99 ei->params.auth_keychain = NULL;
100
101 return ei;
102 }
103
104 int eigrp_if_delete_hook(struct interface *ifp)
105 {
106 struct eigrp_interface *ei = ifp->info;
107 struct eigrp *eigrp;
108
109 if (!ei)
110 return 0;
111
112 list_delete(&ei->nbrs);
113
114 eigrp = ei->eigrp;
115 listnode_delete(eigrp->eiflist, ei);
116
117 XFREE(MTYPE_EIGRP_IF_INFO, ifp->info);
118 ifp->info = NULL;
119
120 return 0;
121 }
122
123 struct list *eigrp_iflist;
124
125 void eigrp_if_init()
126 {
127 /* Initialize Zebra interface data structure. */
128 // hook_register_prio(if_add, 0, eigrp_if_new);
129 hook_register_prio(if_del, 0, eigrp_if_delete_hook);
130 }
131
132
133 void eigrp_del_if_params(struct eigrp_if_params *eip)
134 {
135 if (eip->auth_keychain)
136 free(eip->auth_keychain);
137 }
138
139 int eigrp_if_up(struct eigrp_interface *ei)
140 {
141 struct eigrp_prefix_entry *pe;
142 struct eigrp_nexthop_entry *ne;
143 struct eigrp_metrics metric;
144 struct eigrp_interface *ei2;
145 struct listnode *node, *nnode;
146 struct eigrp *eigrp;
147
148 if (ei == NULL)
149 return 0;
150
151 eigrp = ei->eigrp;
152 eigrp_adjust_sndbuflen(eigrp, ei->ifp->mtu);
153
154 eigrp_if_stream_set(ei);
155
156 /* Set multicast memberships appropriately for new state. */
157 eigrp_if_set_multicast(ei);
158
159 thread_add_event(master, eigrp_hello_timer, ei, (1), NULL);
160
161 /*Prepare metrics*/
162 metric.bandwidth = eigrp_bandwidth_to_scaled(ei->params.bandwidth);
163 metric.delay = eigrp_delay_to_scaled(ei->params.delay);
164 metric.load = ei->params.load;
165 metric.reliability = ei->params.reliability;
166 metric.mtu[0] = 0xDC;
167 metric.mtu[1] = 0x05;
168 metric.mtu[2] = 0x00;
169 metric.hop_count = 0;
170 metric.flags = 0;
171 metric.tag = 0;
172
173 /*Add connected entry to topology table*/
174
175 ne = eigrp_nexthop_entry_new();
176 ne->ei = ei;
177 ne->reported_metric = metric;
178 ne->total_metric = metric;
179 ne->distance = eigrp_calculate_metrics(eigrp, metric);
180 ne->reported_distance = 0;
181 ne->adv_router = eigrp->neighbor_self;
182 ne->flags = EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG;
183
184 struct prefix dest_addr;
185
186 dest_addr = *ei->address;
187 apply_mask(&dest_addr);
188 pe = eigrp_topology_table_lookup_ipv4(eigrp->topology_table,
189 &dest_addr);
190
191 if (pe == NULL) {
192 pe = eigrp_prefix_entry_new();
193 pe->serno = eigrp->serno;
194 pe->destination = (struct prefix *)prefix_ipv4_new();
195 prefix_copy(pe->destination, &dest_addr);
196 pe->af = AF_INET;
197 pe->nt = EIGRP_TOPOLOGY_TYPE_CONNECTED;
198
199 ne->prefix = pe;
200 pe->reported_metric = metric;
201 pe->state = EIGRP_FSM_STATE_PASSIVE;
202 pe->fdistance = eigrp_calculate_metrics(eigrp, metric);
203 pe->req_action |= EIGRP_FSM_NEED_UPDATE;
204 eigrp_prefix_entry_add(eigrp->topology_table, pe);
205 listnode_add(eigrp->topology_changes_internalIPV4, pe);
206
207 eigrp_nexthop_entry_add(pe, ne);
208
209 for (ALL_LIST_ELEMENTS(eigrp->eiflist, node, nnode, ei2)) {
210 eigrp_update_send(ei2);
211 }
212
213 pe->req_action &= ~EIGRP_FSM_NEED_UPDATE;
214 listnode_delete(eigrp->topology_changes_internalIPV4, pe);
215 } else {
216 struct eigrp_fsm_action_message msg;
217
218 ne->prefix = pe;
219 eigrp_nexthop_entry_add(pe, ne);
220
221 msg.packet_type = EIGRP_OPC_UPDATE;
222 msg.eigrp = eigrp;
223 msg.data_type = EIGRP_CONNECTED;
224 msg.adv_router = NULL;
225 msg.entry = ne;
226 msg.prefix = pe;
227
228 eigrp_fsm_event(&msg);
229 }
230
231 return 1;
232 }
233
234 int eigrp_if_down(struct eigrp_interface *ei)
235 {
236 struct listnode *node, *nnode;
237 struct eigrp_neighbor *nbr;
238
239 if (ei == NULL)
240 return 0;
241
242 /* Shutdown packet reception and sending */
243 if (ei->t_hello)
244 THREAD_OFF(ei->t_hello);
245
246 eigrp_if_stream_unset(ei);
247
248 /*Set infinite metrics to routes learned by this interface and start
249 * query process*/
250 for (ALL_LIST_ELEMENTS(ei->nbrs, node, nnode, nbr)) {
251 eigrp_nbr_delete(nbr);
252 }
253
254 return 1;
255 }
256
257 void eigrp_if_stream_set(struct eigrp_interface *ei)
258 {
259 /* set output fifo queue. */
260 if (ei->obuf == NULL)
261 ei->obuf = eigrp_fifo_new();
262 }
263
264 void eigrp_if_stream_unset(struct eigrp_interface *ei)
265 {
266 struct eigrp *eigrp = ei->eigrp;
267
268 if (ei->obuf) {
269 eigrp_fifo_free(ei->obuf);
270 ei->obuf = NULL;
271
272 if (ei->on_write_q) {
273 listnode_delete(eigrp->oi_write_q, ei);
274 if (list_isempty(eigrp->oi_write_q))
275 thread_cancel(eigrp->t_write);
276 ei->on_write_q = 0;
277 }
278 }
279 }
280
281 bool eigrp_if_is_passive(struct eigrp_interface *ei)
282 {
283 if (ei->params.passive_interface == EIGRP_IF_ACTIVE)
284 return false;
285
286 if (ei->eigrp->passive_interface_default == EIGRP_IF_ACTIVE)
287 return false;
288
289 return true;
290 }
291
292 void eigrp_if_set_multicast(struct eigrp_interface *ei)
293 {
294 if (!eigrp_if_is_passive(ei)) {
295 /* The interface should belong to the EIGRP-all-routers group.
296 */
297 if (!ei->member_allrouters
298 && (eigrp_if_add_allspfrouters(ei->eigrp, ei->address,
299 ei->ifp->ifindex)
300 >= 0))
301 /* Set the flag only if the system call to join
302 * succeeded. */
303 ei->member_allrouters = true;
304 } else {
305 /* The interface should NOT belong to the EIGRP-all-routers
306 * group. */
307 if (ei->member_allrouters) {
308 /* Only actually drop if this is the last reference */
309 eigrp_if_drop_allspfrouters(ei->eigrp, ei->address,
310 ei->ifp->ifindex);
311 /* Unset the flag regardless of whether the system call
312 to leave
313 the group succeeded, since it's much safer to assume
314 that
315 we are not a member. */
316 ei->member_allrouters = false;
317 }
318 }
319 }
320
321 uint8_t eigrp_default_iftype(struct interface *ifp)
322 {
323 if (if_is_pointopoint(ifp))
324 return EIGRP_IFTYPE_POINTOPOINT;
325 else if (if_is_loopback(ifp))
326 return EIGRP_IFTYPE_LOOPBACK;
327 else
328 return EIGRP_IFTYPE_BROADCAST;
329 }
330
331 void eigrp_if_free(struct eigrp_interface *ei, int source)
332 {
333 struct prefix dest_addr;
334 struct eigrp_prefix_entry *pe;
335 struct eigrp *eigrp = eigrp_lookup();
336
337 if (!eigrp)
338 return;
339
340 if (source == INTERFACE_DOWN_BY_VTY) {
341 THREAD_OFF(ei->t_hello);
342 eigrp_hello_send(ei, EIGRP_HELLO_GRACEFUL_SHUTDOWN, NULL);
343 }
344
345 dest_addr = *ei->address;
346 apply_mask(&dest_addr);
347 pe = eigrp_topology_table_lookup_ipv4(eigrp->topology_table,
348 &dest_addr);
349 if (pe)
350 eigrp_prefix_entry_delete(eigrp->topology_table, pe);
351
352 eigrp_if_down(ei);
353
354 list_delete(&ei->nbrs);
355 listnode_delete(ei->eigrp->eiflist, ei);
356 }
357
358 /* Simulate down/up on the interface. This is needed, for example, when
359 the MTU changes. */
360 void eigrp_if_reset(struct interface *ifp)
361 {
362 struct eigrp_interface *ei = ifp->info;
363
364 if (!ei)
365 return;
366
367 eigrp_if_down(ei);
368 eigrp_if_up(ei);
369 }
370
371 struct eigrp_interface *eigrp_if_lookup_by_local_addr(struct eigrp *eigrp,
372 struct interface *ifp,
373 struct in_addr address)
374 {
375 struct listnode *node;
376 struct eigrp_interface *ei;
377
378 for (ALL_LIST_ELEMENTS_RO(eigrp->eiflist, node, ei)) {
379 if (ifp && ei->ifp != ifp)
380 continue;
381
382 if (IPV4_ADDR_SAME(&address, &ei->address->u.prefix4))
383 return ei;
384 }
385
386 return NULL;
387 }
388
389 /**
390 * @fn eigrp_if_lookup_by_name
391 *
392 * @param[in] eigrp EIGRP process
393 * @param[in] if_name Name of the interface
394 *
395 * @return struct eigrp_interface *
396 *
397 * @par
398 * Function is used for lookup interface by name.
399 */
400 struct eigrp_interface *eigrp_if_lookup_by_name(struct eigrp *eigrp,
401 const char *if_name)
402 {
403 struct eigrp_interface *ei;
404 struct listnode *node;
405
406 /* iterate over all eigrp interfaces */
407 for (ALL_LIST_ELEMENTS_RO(eigrp->eiflist, node, ei)) {
408 /* compare int name with eigrp interface's name */
409 if (strcmp(ei->ifp->name, if_name) == 0) {
410 return ei;
411 }
412 }
413
414 return NULL;
415 }
416
417 uint32_t eigrp_bandwidth_to_scaled(uint32_t bandwidth)
418 {
419 uint64_t temp_bandwidth = (256ull * 10000000) / bandwidth;
420
421 temp_bandwidth = temp_bandwidth < EIGRP_MAX_METRIC ? temp_bandwidth
422 : EIGRP_MAX_METRIC;
423
424 return (uint32_t)temp_bandwidth;
425 }
426
427 uint32_t eigrp_scaled_to_bandwidth(uint32_t scaled)
428 {
429 uint64_t temp_scaled = scaled * (256ull * 10000000);
430
431 temp_scaled =
432 temp_scaled < EIGRP_MAX_METRIC ? temp_scaled : EIGRP_MAX_METRIC;
433
434 return (uint32_t)temp_scaled;
435 }
436
437 uint32_t eigrp_delay_to_scaled(uint32_t delay)
438 {
439 return delay * 256;
440 }
441
442 uint32_t eigrp_scaled_to_delay(uint32_t scaled)
443 {
444 return scaled / 256;
445 }