]>
Commit | Line | Data |
---|---|---|
7f57883e DS |
1 | /* |
2 | * EIGRP Sending and Receiving EIGRP Update Packets. | |
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 | #include <zebra.h> | |
33 | ||
34 | #include "thread.h" | |
35 | #include "memory.h" | |
36 | #include "linklist.h" | |
37 | #include "prefix.h" | |
38 | #include "if.h" | |
39 | #include "table.h" | |
40 | #include "sockunion.h" | |
41 | #include "stream.h" | |
42 | #include "log.h" | |
43 | #include "sockopt.h" | |
44 | #include "checksum.h" | |
45 | #include "md5.h" | |
46 | #include "vty.h" | |
47 | #include "plist.h" | |
48 | #include "plist_int.h" | |
49 | #include "routemap.h" | |
50 | #include "vty.h" | |
51 | ||
52 | #include "eigrpd/eigrp_structs.h" | |
53 | #include "eigrpd/eigrpd.h" | |
54 | #include "eigrpd/eigrp_interface.h" | |
55 | #include "eigrpd/eigrp_neighbor.h" | |
56 | #include "eigrpd/eigrp_packet.h" | |
57 | #include "eigrpd/eigrp_zebra.h" | |
58 | #include "eigrpd/eigrp_vty.h" | |
59 | #include "eigrpd/eigrp_dump.h" | |
60 | #include "eigrpd/eigrp_macros.h" | |
61 | #include "eigrpd/eigrp_topology.h" | |
62 | #include "eigrpd/eigrp_fsm.h" | |
63 | #include "eigrpd/eigrp_network.h" | |
64 | #include "eigrpd/eigrp_memory.h" | |
65 | ||
71b52ef2 DS |
66 | bool eigrp_update_prefix_apply(struct eigrp *eigrp, |
67 | struct eigrp_interface *ei, | |
68 | int in, struct prefix *prefix) | |
69 | { | |
70 | struct access_list *alist; | |
71 | struct prefix_list *plist; | |
72 | ||
73 | alist = eigrp->list[in]; | |
74 | if (alist && access_list_apply(alist, prefix) == FILTER_DENY) | |
75 | return true; | |
76 | ||
77 | plist = eigrp->prefix[in]; | |
78 | if (plist && prefix_list_apply(plist, prefix) == PREFIX_DENY) | |
79 | return true; | |
80 | ||
81 | alist = ei->list[in]; | |
82 | if (alist && access_list_apply(alist, prefix) == FILTER_DENY) | |
83 | return true; | |
84 | ||
85 | plist = ei->prefix[in]; | |
86 | if (plist && prefix_list_apply(plist, prefix) == PREFIX_DENY) | |
87 | return true; | |
88 | ||
89 | return false; | |
90 | } | |
91 | ||
7f57883e DS |
92 | /** |
93 | * @fn remove_received_prefix_gr | |
94 | * | |
95 | * @param[in] nbr_prefixes List of neighbor prefixes | |
d62a17ae | 96 | * @param[in] recv_prefix Prefix which needs to be removed from |
97 | * list | |
7f57883e DS |
98 | * |
99 | * @return void | |
100 | * | |
101 | * @par | |
102 | * Function is used for removing received prefix | |
103 | * from list of neighbor prefixes | |
104 | */ | |
d62a17ae | 105 | static void remove_received_prefix_gr(struct list *nbr_prefixes, |
106 | struct eigrp_prefix_entry *recv_prefix) | |
7f57883e | 107 | { |
d62a17ae | 108 | struct listnode *node1, *node11; |
109 | struct eigrp_prefix_entry *prefix = NULL; | |
110 | ||
111 | /* iterate over all prefixes in list */ | |
112 | for (ALL_LIST_ELEMENTS(nbr_prefixes, node1, node11, prefix)) { | |
113 | /* remove prefix from list if found */ | |
114 | if (prefix == recv_prefix) { | |
115 | listnode_delete(nbr_prefixes, prefix); | |
116 | } | |
117 | } | |
7f57883e DS |
118 | } |
119 | ||
120 | /** | |
121 | * @fn eigrp_update_receive_GR_ask | |
122 | * | |
123 | * @param[in] eigrp EIGRP process | |
d62a17ae | 124 | * @param[in] nbr Neighbor update of who we |
125 | * received | |
7f57883e DS |
126 | * @param[in] nbr_prefixes Prefixes which weren't advertised |
127 | * | |
128 | * @return void | |
129 | * | |
130 | * @par | |
131 | * Function is used for notifying FSM about prefixes which | |
132 | * weren't advertised by neighbor: | |
133 | * We will send message to FSM with prefix delay set to infinity. | |
134 | */ | |
d62a17ae | 135 | static void eigrp_update_receive_GR_ask(struct eigrp *eigrp, |
136 | struct eigrp_neighbor *nbr, | |
137 | struct list *nbr_prefixes) | |
7f57883e | 138 | { |
d62a17ae | 139 | struct listnode *node1; |
140 | struct eigrp_prefix_entry *prefix; | |
5ca6df78 | 141 | struct eigrp_fsm_action_message fsm_msg; |
d62a17ae | 142 | |
143 | /* iterate over all prefixes which weren't advertised by neighbor */ | |
144 | for (ALL_LIST_ELEMENTS_RO(nbr_prefixes, node1, prefix)) { | |
02b45998 DS |
145 | char buffer[PREFIX_STRLEN]; |
146 | zlog_debug("GR receive: Neighbor not advertised %s", | |
147 | prefix2str(prefix->destination, | |
148 | buffer, PREFIX_STRLEN)); | |
d62a17ae | 149 | |
5ca6df78 | 150 | fsm_msg.metrics = prefix->reported_metric; |
d62a17ae | 151 | /* set delay to MAX */ |
5ca6df78 | 152 | fsm_msg.metrics.delay = EIGRP_MAX_METRIC; |
d62a17ae | 153 | |
255ab940 | 154 | struct eigrp_nexthop_entry *entry = |
d62a17ae | 155 | eigrp_prefix_entry_lookup(prefix->entries, nbr); |
156 | ||
92035b1d DS |
157 | fsm_msg.packet_type = EIGRP_OPC_UPDATE; |
158 | fsm_msg.eigrp = eigrp; | |
7cfa4322 | 159 | fsm_msg.data_type = EIGRP_INT; |
92035b1d | 160 | fsm_msg.adv_router = nbr; |
92035b1d DS |
161 | fsm_msg.entry = entry; |
162 | fsm_msg.prefix = prefix; | |
d62a17ae | 163 | |
164 | /* send message to FSM */ | |
6118272f | 165 | eigrp_fsm_event(&fsm_msg); |
d62a17ae | 166 | } |
7f57883e DS |
167 | } |
168 | ||
169 | /* | |
170 | * EIGRP UPDATE read function | |
171 | */ | |
d62a17ae | 172 | void eigrp_update_receive(struct eigrp *eigrp, struct ip *iph, |
173 | struct eigrp_header *eigrph, struct stream *s, | |
174 | struct eigrp_interface *ei, int size) | |
7f57883e | 175 | { |
d62a17ae | 176 | struct eigrp_neighbor *nbr; |
177 | struct TLV_IPv4_Internal_type *tlv; | |
178 | struct eigrp_prefix_entry *pe; | |
255ab940 | 179 | struct eigrp_nexthop_entry *ne; |
d62a17ae | 180 | u_int32_t flags; |
181 | u_int16_t type; | |
c283f389 | 182 | u_int16_t length; |
d62a17ae | 183 | u_char same; |
476a1469 | 184 | struct prefix dest_addr; |
d62a17ae | 185 | u_char graceful_restart; |
186 | u_char graceful_restart_final; | |
187 | struct list *nbr_prefixes = NULL; | |
188 | ||
189 | /* increment statistics. */ | |
190 | ei->update_in++; | |
191 | ||
192 | /* get neighbor struct */ | |
193 | nbr = eigrp_nbr_get(ei, eigrph, iph); | |
194 | ||
195 | /* neighbor must be valid, eigrp_nbr_get creates if none existed */ | |
196 | assert(nbr); | |
197 | ||
198 | flags = ntohl(eigrph->flags); | |
199 | ||
200 | if (flags & EIGRP_CR_FLAG) { | |
201 | return; | |
202 | } | |
203 | ||
204 | same = 0; | |
205 | graceful_restart = 0; | |
206 | graceful_restart_final = 0; | |
207 | if ((nbr->recv_sequence_number) == (ntohl(eigrph->sequence))) | |
208 | same = 1; | |
209 | ||
210 | nbr->recv_sequence_number = ntohl(eigrph->sequence); | |
211 | if (IS_DEBUG_EIGRP_PACKET(0, RECV)) | |
212 | zlog_debug( | |
213 | "Processing Update size[%u] int(%s) nbr(%s) seq [%u] flags [%0x]", | |
214 | size, | |
215 | ifindex2ifname(nbr->ei->ifp->ifindex, VRF_DEFAULT), | |
216 | inet_ntoa(nbr->src), nbr->recv_sequence_number, flags); | |
217 | ||
218 | ||
219 | if ((flags == (EIGRP_INIT_FLAG + EIGRP_RS_FLAG + EIGRP_EOT_FLAG)) | |
220 | && (!same)) { | |
221 | /* Graceful restart Update received with all routes */ | |
222 | ||
223 | zlog_info("Neighbor %s (%s) is resync: peer graceful-restart", | |
224 | inet_ntoa(nbr->src), | |
225 | ifindex2ifname(nbr->ei->ifp->ifindex, VRF_DEFAULT)); | |
226 | ||
227 | /* get all prefixes from neighbor from topology table */ | |
228 | nbr_prefixes = eigrp_neighbor_prefixes_lookup(eigrp, nbr); | |
229 | graceful_restart = 1; | |
230 | graceful_restart_final = 1; | |
231 | } else if ((flags == (EIGRP_INIT_FLAG + EIGRP_RS_FLAG)) && (!same)) { | |
232 | /* Graceful restart Update received, routes also in next packet | |
233 | */ | |
234 | ||
235 | zlog_info("Neighbor %s (%s) is resync: peer graceful-restart", | |
236 | inet_ntoa(nbr->src), | |
237 | ifindex2ifname(nbr->ei->ifp->ifindex, VRF_DEFAULT)); | |
238 | ||
239 | /* get all prefixes from neighbor from topology table */ | |
240 | nbr_prefixes = eigrp_neighbor_prefixes_lookup(eigrp, nbr); | |
241 | /* save prefixes to neighbor for later use */ | |
242 | nbr->nbr_gr_prefixes = nbr_prefixes; | |
243 | graceful_restart = 1; | |
244 | graceful_restart_final = 0; | |
245 | } else if ((flags == (EIGRP_EOT_FLAG)) && (!same)) { | |
246 | /* If there was INIT+RS Update packet before, | |
247 | * consider this as GR EOT */ | |
248 | ||
249 | if (nbr->nbr_gr_prefixes != NULL) { | |
250 | /* this is final packet of GR */ | |
251 | nbr_prefixes = nbr->nbr_gr_prefixes; | |
252 | nbr->nbr_gr_prefixes = NULL; | |
253 | ||
254 | graceful_restart = 1; | |
255 | graceful_restart_final = 1; | |
256 | } | |
257 | ||
258 | } else if ((flags == (0)) && (!same)) { | |
259 | /* If there was INIT+RS Update packet before, | |
260 | * consider this as GR not final packet */ | |
261 | ||
262 | if (nbr->nbr_gr_prefixes != NULL) { | |
263 | /* this is GR not final route packet */ | |
264 | nbr_prefixes = nbr->nbr_gr_prefixes; | |
265 | ||
266 | graceful_restart = 1; | |
267 | graceful_restart_final = 0; | |
268 | } | |
269 | ||
270 | } else if ((flags & EIGRP_INIT_FLAG) | |
271 | && (!same)) { /* When in pending state, send INIT update only | |
272 | if it wasn't | |
273 | already sent before (only if init_sequence | |
274 | is 0) */ | |
275 | if ((nbr->state == EIGRP_NEIGHBOR_PENDING) | |
276 | && (nbr->init_sequence_number == 0)) | |
277 | eigrp_update_send_init(nbr); | |
278 | ||
279 | if (nbr->state == EIGRP_NEIGHBOR_UP) { | |
280 | eigrp_nbr_state_set(nbr, EIGRP_NEIGHBOR_DOWN); | |
281 | eigrp_topology_neighbor_down(nbr->ei->eigrp, nbr); | |
282 | nbr->recv_sequence_number = ntohl(eigrph->sequence); | |
283 | zlog_info("Neighbor %s (%s) is down: peer restarted", | |
284 | inet_ntoa(nbr->src), | |
285 | ifindex2ifname(nbr->ei->ifp->ifindex, | |
286 | VRF_DEFAULT)); | |
287 | eigrp_nbr_state_set(nbr, EIGRP_NEIGHBOR_PENDING); | |
288 | zlog_info("Neighbor %s (%s) is pending: new adjacency", | |
289 | inet_ntoa(nbr->src), | |
290 | ifindex2ifname(nbr->ei->ifp->ifindex, | |
291 | VRF_DEFAULT)); | |
292 | eigrp_update_send_init(nbr); | |
293 | } | |
294 | } | |
295 | ||
296 | /*If there is topology information*/ | |
297 | while (s->endp > s->getp) { | |
298 | type = stream_getw(s); | |
c283f389 DS |
299 | switch (type) { |
300 | case EIGRP_TLV_IPv4_INT: | |
d62a17ae | 301 | stream_set_getp(s, s->getp - sizeof(u_int16_t)); |
302 | ||
303 | tlv = eigrp_read_ipv4_tlv(s); | |
304 | ||
305 | /*searching if destination exists */ | |
306 | dest_addr.family = AF_INET; | |
476a1469 | 307 | dest_addr.u.prefix4 = tlv->destination; |
d62a17ae | 308 | dest_addr.prefixlen = tlv->prefix_length; |
309 | struct eigrp_prefix_entry *dest = | |
310 | eigrp_topology_table_lookup_ipv4( | |
311 | eigrp->topology_table, &dest_addr); | |
312 | ||
313 | /*if exists it comes to DUAL*/ | |
314 | if (dest != NULL) { | |
315 | /* remove received prefix from neighbor prefix | |
316 | * list if in GR */ | |
317 | if (graceful_restart) | |
318 | remove_received_prefix_gr(nbr_prefixes, | |
319 | dest); | |
320 | ||
92035b1d | 321 | struct eigrp_fsm_action_message msg; |
255ab940 | 322 | struct eigrp_nexthop_entry *entry = |
d62a17ae | 323 | eigrp_prefix_entry_lookup(dest->entries, |
324 | nbr); | |
325 | ||
92035b1d DS |
326 | msg.packet_type = EIGRP_OPC_UPDATE; |
327 | msg.eigrp = eigrp; | |
7cfa4322 | 328 | msg.data_type = EIGRP_INT; |
92035b1d | 329 | msg.adv_router = nbr; |
db6ec9ff | 330 | msg.metrics = tlv->metric; |
92035b1d DS |
331 | msg.entry = entry; |
332 | msg.prefix = dest; | |
6118272f | 333 | eigrp_fsm_event(&msg); |
d62a17ae | 334 | } else { |
335 | /*Here comes topology information save*/ | |
336 | pe = eigrp_prefix_entry_new(); | |
337 | pe->serno = eigrp->serno; | |
02b45998 DS |
338 | pe->destination = (struct prefix *)prefix_ipv4_new(); |
339 | prefix_copy(pe->destination, | |
476a1469 | 340 | &dest_addr); |
d62a17ae | 341 | pe->af = AF_INET; |
342 | pe->state = EIGRP_FSM_STATE_PASSIVE; | |
343 | pe->nt = EIGRP_TOPOLOGY_TYPE_REMOTE; | |
344 | ||
255ab940 | 345 | ne = eigrp_nexthop_entry_new(); |
d62a17ae | 346 | ne->ei = ei; |
347 | ne->adv_router = nbr; | |
348 | ne->reported_metric = tlv->metric; | |
349 | ne->reported_distance = eigrp_calculate_metrics( | |
350 | eigrp, tlv->metric); | |
351 | /* | |
352 | * Filtering | |
353 | */ | |
71b52ef2 DS |
354 | if (eigrp_update_prefix_apply(eigrp, ei, |
355 | EIGRP_FILTER_IN, | |
356 | &dest_addr)) | |
357 | ne->reported_metric.delay = EIGRP_MAX_METRIC; | |
d62a17ae | 358 | |
359 | ne->distance = eigrp_calculate_total_metrics( | |
360 | eigrp, ne); | |
361 | ||
362 | pe->fdistance = pe->distance = pe->rdistance = | |
363 | ne->distance; | |
364 | ne->prefix = pe; | |
255ab940 | 365 | ne->flags = EIGRP_NEXTHOP_ENTRY_SUCCESSOR_FLAG; |
d62a17ae | 366 | |
367 | eigrp_prefix_entry_add(eigrp->topology_table, | |
368 | pe); | |
255ab940 | 369 | eigrp_nexthop_entry_add(pe, ne); |
d62a17ae | 370 | pe->distance = pe->fdistance = pe->rdistance = |
371 | ne->distance; | |
372 | pe->reported_metric = ne->total_metric; | |
373 | eigrp_topology_update_node_flags(pe); | |
374 | ||
375 | pe->req_action |= EIGRP_FSM_NEED_UPDATE; | |
376 | listnode_add( | |
377 | eigrp->topology_changes_internalIPV4, | |
378 | pe); | |
379 | } | |
380 | eigrp_IPv4_InternalTLV_free(tlv); | |
c283f389 DS |
381 | break; |
382 | ||
383 | case EIGRP_TLV_IPv4_EXT: | |
384 | /* DVS: processing of external routes needs packet and fsm work. | |
385 | * for now, lets just not creash the box | |
386 | */ | |
387 | default: | |
388 | length = stream_getw(s); | |
389 | // -2 for type, -2 for len | |
390 | for (length-=4; length ; length--) { | |
391 | (void)stream_getc(s); | |
392 | } | |
d62a17ae | 393 | } |
394 | } | |
395 | ||
396 | /* ask about prefixes not present in GR update, | |
397 | * if this is final GR packet */ | |
398 | if (graceful_restart_final) { | |
399 | eigrp_update_receive_GR_ask(eigrp, nbr, nbr_prefixes); | |
400 | } | |
401 | ||
402 | /* | |
403 | * We don't need to send separate Ack for INIT Update. INIT will be | |
404 | * acked in EOT Update. | |
405 | */ | |
406 | if ((nbr->state == EIGRP_NEIGHBOR_UP) && !(flags == EIGRP_INIT_FLAG)) { | |
407 | eigrp_hello_send_ack(nbr); | |
408 | } | |
409 | ||
410 | eigrp_query_send_all(eigrp); | |
411 | eigrp_update_send_all(eigrp, ei); | |
dbfd865b DS |
412 | |
413 | if (nbr_prefixes) | |
414 | list_delete(nbr_prefixes); | |
7f57883e DS |
415 | } |
416 | ||
417 | /*send EIGRP Update packet*/ | |
d62a17ae | 418 | void eigrp_update_send_init(struct eigrp_neighbor *nbr) |
7f57883e | 419 | { |
d62a17ae | 420 | struct eigrp_packet *ep; |
421 | u_int16_t length = EIGRP_HEADER_LEN; | |
422 | ||
907b4303 | 423 | ep = eigrp_packet_new(nbr->ei->ifp->mtu, nbr); |
d62a17ae | 424 | |
425 | /* Prepare EIGRP INIT UPDATE header */ | |
426 | if (IS_DEBUG_EIGRP_PACKET(0, RECV)) | |
427 | zlog_debug("Enqueuing Update Init Seq [%u] Ack [%u]", | |
428 | nbr->ei->eigrp->sequence_number, | |
429 | nbr->recv_sequence_number); | |
430 | ||
cf2f4dae DS |
431 | eigrp_packet_header_init(EIGRP_OPC_UPDATE, nbr->ei->eigrp, |
432 | ep->s, EIGRP_INIT_FLAG, | |
433 | nbr->ei->eigrp->sequence_number, | |
434 | nbr->recv_sequence_number); | |
d62a17ae | 435 | |
436 | // encode Authentication TLV, if needed | |
437 | if ((IF_DEF_PARAMS(nbr->ei->ifp)->auth_type == EIGRP_AUTH_TYPE_MD5) | |
438 | && (IF_DEF_PARAMS(nbr->ei->ifp)->auth_keychain != NULL)) { | |
439 | length += eigrp_add_authTLV_MD5_to_stream(ep->s, nbr->ei); | |
440 | eigrp_make_md5_digest(nbr->ei, ep->s, | |
441 | EIGRP_AUTH_UPDATE_INIT_FLAG); | |
442 | } | |
443 | ||
444 | /* EIGRP Checksum */ | |
445 | eigrp_packet_checksum(nbr->ei, ep->s, length); | |
446 | ||
447 | ep->length = length; | |
448 | ep->dst.s_addr = nbr->src.s_addr; | |
449 | ||
450 | /*This ack number we await from neighbor*/ | |
451 | nbr->init_sequence_number = nbr->ei->eigrp->sequence_number; | |
452 | ep->sequence_number = nbr->ei->eigrp->sequence_number; | |
453 | if (IS_DEBUG_EIGRP_PACKET(0, RECV)) | |
454 | zlog_debug("Enqueuing Update Init Len [%u] Seq [%u] Dest [%s]", | |
455 | ep->length, ep->sequence_number, inet_ntoa(ep->dst)); | |
456 | ||
457 | /*Put packet to retransmission queue*/ | |
f90f65a2 | 458 | eigrp_fifo_push(nbr->retrans_queue, ep); |
d62a17ae | 459 | |
460 | if (nbr->retrans_queue->count == 1) { | |
461 | eigrp_send_packet_reliably(nbr); | |
462 | } | |
7f57883e DS |
463 | } |
464 | ||
7ecf0a4d DS |
465 | static void eigrp_update_place_on_nbr_queue(struct eigrp_neighbor *nbr, |
466 | struct eigrp_packet *ep, | |
467 | u_int32_t seq_no, | |
468 | int length) | |
469 | { | |
470 | if((IF_DEF_PARAMS (nbr->ei->ifp)->auth_type == EIGRP_AUTH_TYPE_MD5) && | |
471 | (IF_DEF_PARAMS (nbr->ei->ifp)->auth_keychain != NULL)) { | |
472 | eigrp_make_md5_digest(nbr->ei,ep->s, EIGRP_AUTH_UPDATE_FLAG); | |
473 | } | |
474 | ||
475 | /* EIGRP Checksum */ | |
476 | eigrp_packet_checksum(nbr->ei, ep->s, length); | |
477 | ||
478 | ep->length = length; | |
479 | ep->dst.s_addr = nbr->src.s_addr; | |
480 | ||
481 | /*This ack number we await from neighbor*/ | |
482 | ep->sequence_number = seq_no; | |
483 | ||
484 | if (IS_DEBUG_EIGRP_PACKET(0, RECV)) | |
485 | zlog_debug("Enqueuing Update Init Len [%u] Seq [%u] Dest [%s]", | |
486 | ep->length, ep->sequence_number, inet_ntoa(ep->dst)); | |
487 | ||
488 | /*Put packet to retransmission queue*/ | |
f90f65a2 | 489 | eigrp_fifo_push(nbr->retrans_queue, ep); |
17a2f658 DS |
490 | |
491 | if (nbr->retrans_queue->count == 1) | |
492 | eigrp_send_packet_reliably(nbr); | |
7ecf0a4d DS |
493 | } |
494 | ||
a6e8810e DS |
495 | static void eigrp_update_send_to_all_nbrs(struct eigrp_interface *ei, |
496 | struct eigrp_packet *ep) | |
497 | { | |
498 | struct listnode *node, *nnode; | |
499 | struct eigrp_neighbor *nbr; | |
500 | bool packet_sent = false; | |
501 | ||
502 | for (ALL_LIST_ELEMENTS(ei->nbrs, node, nnode, nbr)) { | |
503 | struct eigrp_packet *ep_dup; | |
504 | ||
505 | if (nbr->state != EIGRP_NEIGHBOR_UP) | |
506 | continue; | |
507 | ||
508 | if (packet_sent) | |
509 | ep_dup = eigrp_packet_duplicate(ep, NULL); | |
510 | else | |
511 | ep_dup = ep; | |
512 | ||
513 | ep_dup->nbr = nbr; | |
514 | packet_sent = true; | |
515 | /*Put packet to retransmission queue*/ | |
516 | eigrp_fifo_push(nbr->retrans_queue, ep_dup); | |
517 | ||
518 | if (nbr->retrans_queue->count == 1) { | |
519 | eigrp_send_packet_reliably(nbr); | |
520 | } | |
521 | } | |
522 | ||
523 | if (!packet_sent) | |
524 | eigrp_packet_free(ep); | |
525 | } | |
526 | ||
d62a17ae | 527 | void eigrp_update_send_EOT(struct eigrp_neighbor *nbr) |
7f57883e | 528 | { |
d62a17ae | 529 | struct eigrp_packet *ep; |
d62a17ae | 530 | u_int16_t length = EIGRP_HEADER_LEN; |
255ab940 | 531 | struct eigrp_nexthop_entry *te; |
d62a17ae | 532 | struct eigrp_prefix_entry *pe; |
533 | struct listnode *node, *node2, *nnode, *nnode2; | |
3a45a729 DS |
534 | struct eigrp_interface *ei = nbr->ei; |
535 | struct eigrp *eigrp = ei->eigrp; | |
02b45998 | 536 | struct prefix *dest_addr; |
3a45a729 | 537 | u_int32_t seq_no = eigrp->sequence_number; |
d62a17ae | 538 | |
3a45a729 | 539 | ep = eigrp_packet_new(ei->ifp->mtu, nbr); |
d62a17ae | 540 | |
541 | /* Prepare EIGRP EOT UPDATE header */ | |
3a45a729 | 542 | eigrp_packet_header_init(EIGRP_OPC_UPDATE, eigrp, |
cf2f4dae DS |
543 | ep->s, EIGRP_EOT_FLAG, |
544 | seq_no, nbr->recv_sequence_number); | |
d62a17ae | 545 | |
546 | // encode Authentication TLV, if needed | |
3a45a729 DS |
547 | if((IF_DEF_PARAMS (ei->ifp)->auth_type == EIGRP_AUTH_TYPE_MD5) && |
548 | (IF_DEF_PARAMS (ei->ifp)->auth_keychain != NULL)) { | |
549 | length += eigrp_add_authTLV_MD5_to_stream(ep->s,ei); | |
d62a17ae | 550 | } |
551 | ||
3a45a729 | 552 | for (ALL_LIST_ELEMENTS(eigrp->topology_table, node, nnode, pe)) { |
d62a17ae | 553 | for (ALL_LIST_ELEMENTS(pe->entries, node2, nnode2, te)) { |
3a45a729 | 554 | if (eigrp_nbr_split_horizon_check(te, ei)) |
d62a17ae | 555 | continue; |
556 | ||
3a45a729 | 557 | if ((length + 0x001D) > (u_int16_t)ei->ifp->mtu) { |
7ecf0a4d | 558 | eigrp_update_place_on_nbr_queue (nbr, ep, seq_no, length); |
7ecf0a4d DS |
559 | seq_no++; |
560 | ||
561 | length = EIGRP_HEADER_LEN; | |
3a45a729 DS |
562 | ep = eigrp_packet_new(ei->ifp->mtu, nbr); |
563 | eigrp_packet_header_init(EIGRP_OPC_UPDATE, eigrp, | |
cf2f4dae | 564 | ep->s, EIGRP_EOT_FLAG, |
7ecf0a4d DS |
565 | seq_no, nbr->recv_sequence_number); |
566 | ||
3a45a729 DS |
567 | if((IF_DEF_PARAMS (ei->ifp)->auth_type == EIGRP_AUTH_TYPE_MD5) && |
568 | (IF_DEF_PARAMS (ei->ifp)->auth_keychain != NULL)) | |
7ecf0a4d | 569 | { |
3a45a729 | 570 | length += eigrp_add_authTLV_MD5_to_stream(ep->s,ei); |
7ecf0a4d DS |
571 | } |
572 | } | |
d62a17ae | 573 | /* Get destination address from prefix */ |
02b45998 | 574 | dest_addr = pe->destination; |
d62a17ae | 575 | |
d62a17ae | 576 | /* Check if any list fits */ |
71b52ef2 DS |
577 | if (eigrp_update_prefix_apply(eigrp, ei, |
578 | EIGRP_FILTER_OUT, | |
579 | dest_addr)) | |
d62a17ae | 580 | continue; |
71b52ef2 | 581 | else { |
7ecf0a4d | 582 | length += eigrp_add_internalTLV_to_stream(ep->s, pe); |
d62a17ae | 583 | } |
d62a17ae | 584 | } |
585 | } | |
586 | ||
7ecf0a4d | 587 | eigrp_update_place_on_nbr_queue (nbr, ep, seq_no, length); |
3a45a729 | 588 | eigrp->sequence_number = seq_no++; |
7f57883e DS |
589 | } |
590 | ||
d62a17ae | 591 | void eigrp_update_send(struct eigrp_interface *ei) |
7f57883e | 592 | { |
d62a17ae | 593 | struct eigrp_packet *ep; |
594 | struct listnode *node, *nnode; | |
d62a17ae | 595 | struct eigrp_prefix_entry *pe; |
596 | u_char has_tlv; | |
3a45a729 | 597 | struct eigrp *eigrp = ei->eigrp; |
02b45998 | 598 | struct prefix *dest_addr; |
3a45a729 | 599 | u_int32_t seq_no = eigrp->sequence_number; |
a6e8810e DS |
600 | |
601 | if (ei->nbrs->count == 0) | |
602 | return; | |
d62a17ae | 603 | |
604 | u_int16_t length = EIGRP_HEADER_LEN; | |
605 | ||
907b4303 | 606 | ep = eigrp_packet_new(ei->ifp->mtu, NULL); |
d62a17ae | 607 | |
608 | /* Prepare EIGRP INIT UPDATE header */ | |
3a45a729 | 609 | eigrp_packet_header_init(EIGRP_OPC_UPDATE, eigrp, |
cf2f4dae | 610 | ep->s, 0, seq_no, 0); |
d62a17ae | 611 | |
612 | // encode Authentication TLV, if needed | |
613 | if ((IF_DEF_PARAMS(ei->ifp)->auth_type == EIGRP_AUTH_TYPE_MD5) | |
614 | && (IF_DEF_PARAMS(ei->ifp)->auth_keychain != NULL)) { | |
615 | length += eigrp_add_authTLV_MD5_to_stream(ep->s, ei); | |
616 | } | |
617 | ||
618 | has_tlv = 0; | |
619 | for (ALL_LIST_ELEMENTS(ei->eigrp->topology_changes_internalIPV4, node, | |
620 | nnode, pe)) { | |
255ab940 | 621 | struct eigrp_nexthop_entry *ne; |
d62a17ae | 622 | |
a75c1cc1 DS |
623 | if (!(pe->req_action & EIGRP_FSM_NEED_UPDATE)) |
624 | continue; | |
d62a17ae | 625 | |
cd044247 DS |
626 | ne = listnode_head(pe->entries); |
627 | if (eigrp_nbr_split_horizon_check(ne, ei)) | |
628 | continue; | |
629 | ||
a6e8810e DS |
630 | if ((length + 0x001D) > (u_int16_t)ei->ifp->mtu) { |
631 | if ((IF_DEF_PARAMS(ei->ifp)->auth_type == EIGRP_AUTH_TYPE_MD5) | |
632 | && (IF_DEF_PARAMS(ei->ifp)->auth_keychain != NULL)) { | |
633 | eigrp_make_md5_digest(ei, ep->s, EIGRP_AUTH_UPDATE_FLAG); | |
634 | } | |
635 | ||
636 | eigrp_packet_checksum(ei, ep->s, length); | |
637 | ep->length = length; | |
638 | ||
639 | ep->dst.s_addr = htonl(EIGRP_MULTICAST_ADDRESS); | |
640 | ||
641 | ep->sequence_number = seq_no; | |
642 | seq_no++; | |
643 | eigrp_update_send_to_all_nbrs(ei, ep); | |
644 | ||
645 | length = EIGRP_HEADER_LEN; | |
646 | ep = eigrp_packet_new(ei->ifp->mtu, NULL); | |
3a45a729 | 647 | eigrp_packet_header_init(EIGRP_OPC_UPDATE, eigrp, |
cf2f4dae | 648 | ep->s, 0, seq_no, 0); |
a6e8810e DS |
649 | if ((IF_DEF_PARAMS(ei->ifp)->auth_type == EIGRP_AUTH_TYPE_MD5) |
650 | && (IF_DEF_PARAMS(ei->ifp)->auth_keychain != NULL)) { | |
651 | length += eigrp_add_authTLV_MD5_to_stream(ep->s, ei); | |
652 | } | |
653 | has_tlv = 0; | |
654 | } | |
a75c1cc1 | 655 | /* Get destination address from prefix */ |
02b45998 | 656 | dest_addr = pe->destination; |
d62a17ae | 657 | |
71b52ef2 DS |
658 | if (eigrp_update_prefix_apply(eigrp, ei, |
659 | EIGRP_FILTER_OUT, | |
660 | dest_addr)) { | |
a75c1cc1 DS |
661 | // pe->reported_metric.delay = EIGRP_MAX_METRIC; |
662 | continue; | |
663 | } else { | |
664 | length += eigrp_add_internalTLV_to_stream(ep->s, | |
665 | pe); | |
666 | has_tlv = 1; | |
d62a17ae | 667 | } |
668 | } | |
669 | ||
670 | if (!has_tlv) { | |
671 | eigrp_packet_free(ep); | |
672 | return; | |
673 | } | |
674 | ||
675 | if ((IF_DEF_PARAMS(ei->ifp)->auth_type == EIGRP_AUTH_TYPE_MD5) | |
676 | && (IF_DEF_PARAMS(ei->ifp)->auth_keychain != NULL)) { | |
677 | eigrp_make_md5_digest(ei, ep->s, EIGRP_AUTH_UPDATE_FLAG); | |
678 | } | |
679 | ||
680 | /* EIGRP Checksum */ | |
681 | eigrp_packet_checksum(ei, ep->s, length); | |
682 | ep->length = length; | |
683 | ||
684 | ep->dst.s_addr = htonl(EIGRP_MULTICAST_ADDRESS); | |
685 | ||
686 | /*This ack number we await from neighbor*/ | |
3a45a729 | 687 | ep->sequence_number = eigrp->sequence_number; |
d62a17ae | 688 | |
689 | if (IS_DEBUG_EIGRP_PACKET(0, RECV)) | |
690 | zlog_debug("Enqueuing Update length[%u] Seq [%u]", length, | |
691 | ep->sequence_number); | |
692 | ||
a6e8810e DS |
693 | eigrp_update_send_to_all_nbrs(ei, ep); |
694 | ei->eigrp->sequence_number = seq_no++; | |
7f57883e DS |
695 | } |
696 | ||
d62a17ae | 697 | void eigrp_update_send_all(struct eigrp *eigrp, |
698 | struct eigrp_interface *exception) | |
7f57883e | 699 | { |
d62a17ae | 700 | struct eigrp_interface *iface; |
701 | struct listnode *node, *node2, *nnode2; | |
702 | struct eigrp_prefix_entry *pe; | |
703 | ||
704 | for (ALL_LIST_ELEMENTS_RO(eigrp->eiflist, node, iface)) { | |
705 | if (iface != exception) { | |
706 | eigrp_update_send(iface); | |
707 | } | |
708 | } | |
709 | ||
710 | for (ALL_LIST_ELEMENTS(eigrp->topology_changes_internalIPV4, node2, | |
711 | nnode2, pe)) { | |
712 | if (pe->req_action & EIGRP_FSM_NEED_UPDATE) { | |
713 | pe->req_action &= ~EIGRP_FSM_NEED_UPDATE; | |
714 | listnode_delete(eigrp->topology_changes_internalIPV4, | |
715 | pe); | |
d62a17ae | 716 | } |
717 | } | |
7f57883e DS |
718 | } |
719 | ||
720 | /** | |
721 | * @fn eigrp_update_send_GR_part | |
722 | * | |
9d303b37 DL |
723 | * @param[in] nbr contains neighbor who would receive Graceful |
724 | * restart | |
7f57883e DS |
725 | * |
726 | * @return void | |
727 | * | |
728 | * @par | |
729 | * Function used for sending Graceful restart Update packet | |
730 | * and if there are multiple chunks, send only one of them. | |
731 | * It is called from thread. Do not call it directly. | |
732 | * | |
733 | * Uses nbr_gr_packet_type from neighbor. | |
734 | */ | |
d62a17ae | 735 | static void eigrp_update_send_GR_part(struct eigrp_neighbor *nbr) |
7f57883e | 736 | { |
d62a17ae | 737 | struct eigrp_packet *ep; |
738 | u_int16_t length = EIGRP_HEADER_LEN; | |
739 | struct listnode *node, *nnode; | |
740 | struct eigrp_prefix_entry *pe; | |
02b45998 | 741 | struct prefix *dest_addr; |
3a45a729 DS |
742 | struct eigrp_interface *ei = nbr->ei; |
743 | struct eigrp *eigrp = ei->eigrp; | |
d62a17ae | 744 | struct list *prefixes; |
745 | u_int32_t flags; | |
746 | unsigned int send_prefixes; | |
d62a17ae | 747 | |
748 | /* get prefixes to send to neighbor */ | |
749 | prefixes = nbr->nbr_gr_prefixes_send; | |
750 | ||
751 | send_prefixes = 0; | |
752 | length = EIGRP_HEADER_LEN; | |
753 | ||
754 | /* if there already were last packet chunk, we won't continue */ | |
755 | if (nbr->nbr_gr_packet_type == EIGRP_PACKET_PART_LAST) | |
756 | return; | |
757 | ||
758 | /* if this is first packet chunk, we need to decide, | |
759 | * if there will be one or more chunks */ | |
760 | if (nbr->nbr_gr_packet_type == EIGRP_PACKET_PART_FIRST) { | |
761 | if (prefixes->count <= EIGRP_TLV_MAX_IPv4) { | |
762 | /* there will be only one chunk */ | |
763 | flags = EIGRP_INIT_FLAG + EIGRP_RS_FLAG | |
764 | + EIGRP_EOT_FLAG; | |
765 | nbr->nbr_gr_packet_type = EIGRP_PACKET_PART_LAST; | |
766 | } else { | |
767 | /* there will be more chunks */ | |
768 | flags = EIGRP_INIT_FLAG + EIGRP_RS_FLAG; | |
769 | nbr->nbr_gr_packet_type = EIGRP_PACKET_PART_NA; | |
770 | } | |
771 | } else { | |
772 | /* this is not first chunk, and we need to decide, | |
773 | * if there will be more chunks */ | |
774 | if (prefixes->count <= EIGRP_TLV_MAX_IPv4) { | |
775 | /* this is last chunk */ | |
776 | flags = EIGRP_EOT_FLAG; | |
777 | nbr->nbr_gr_packet_type = EIGRP_PACKET_PART_LAST; | |
778 | } else { | |
779 | /* there will be more chunks */ | |
780 | flags = 0; | |
781 | nbr->nbr_gr_packet_type = EIGRP_PACKET_PART_NA; | |
782 | } | |
783 | } | |
784 | ||
3a45a729 | 785 | ep = eigrp_packet_new(ei->ifp->mtu, nbr); |
d62a17ae | 786 | |
787 | /* Prepare EIGRP Graceful restart UPDATE header */ | |
3a45a729 DS |
788 | eigrp_packet_header_init(EIGRP_OPC_UPDATE, eigrp, ep->s, flags, |
789 | eigrp->sequence_number, | |
d62a17ae | 790 | nbr->recv_sequence_number); |
791 | ||
792 | // encode Authentication TLV, if needed | |
3a45a729 DS |
793 | if ((IF_DEF_PARAMS(ei->ifp)->auth_type == EIGRP_AUTH_TYPE_MD5) |
794 | && (IF_DEF_PARAMS(ei->ifp)->auth_keychain != NULL)) { | |
795 | length += eigrp_add_authTLV_MD5_to_stream(ep->s, ei); | |
d62a17ae | 796 | } |
797 | ||
3a45a729 | 798 | for (ALL_LIST_ELEMENTS(eigrp->topology_table, node, nnode, pe)) { |
d62a17ae | 799 | /* |
800 | * Filtering | |
801 | */ | |
02b45998 | 802 | dest_addr = pe->destination; |
71b52ef2 DS |
803 | |
804 | if (eigrp_update_prefix_apply(eigrp, ei, | |
805 | EIGRP_FILTER_OUT, | |
806 | dest_addr)) { | |
d62a17ae | 807 | /* do not send filtered route */ |
808 | zlog_info("Filtered prefix %s won't be sent out.", | |
02b45998 | 809 | inet_ntoa(dest_addr->u.prefix4)); |
d62a17ae | 810 | } else { |
811 | /* sending route which wasn't filtered */ | |
812 | length += eigrp_add_internalTLV_to_stream(ep->s, pe); | |
813 | send_prefixes++; | |
814 | } | |
815 | ||
71b52ef2 DS |
816 | /* |
817 | * This makes no sense, Filter out then filter in??? | |
818 | * Look into this more - DBS | |
819 | */ | |
820 | if (eigrp_update_prefix_apply(eigrp, ei, | |
821 | EIGRP_FILTER_IN, | |
822 | dest_addr)) { | |
d62a17ae | 823 | /* do not send filtered route */ |
824 | zlog_info("Filtered prefix %s will be removed.", | |
02b45998 | 825 | inet_ntoa(dest_addr->u.prefix4)); |
d62a17ae | 826 | |
d62a17ae | 827 | /* prepare message for FSM */ |
92035b1d | 828 | struct eigrp_fsm_action_message fsm_msg; |
d62a17ae | 829 | |
255ab940 | 830 | struct eigrp_nexthop_entry *entry = |
d62a17ae | 831 | eigrp_prefix_entry_lookup(pe->entries, nbr); |
832 | ||
92035b1d | 833 | fsm_msg.packet_type = EIGRP_OPC_UPDATE; |
3a45a729 | 834 | fsm_msg.eigrp = eigrp; |
7cfa4322 | 835 | fsm_msg.data_type = EIGRP_INT; |
92035b1d | 836 | fsm_msg.adv_router = nbr; |
5ca6df78 DS |
837 | fsm_msg.metrics = pe->reported_metric; |
838 | /* Set delay to MAX */ | |
839 | fsm_msg.metrics.delay = EIGRP_MAX_METRIC; | |
92035b1d DS |
840 | fsm_msg.entry = entry; |
841 | fsm_msg.prefix = pe; | |
d62a17ae | 842 | |
843 | /* send message to FSM */ | |
6118272f | 844 | eigrp_fsm_event(&fsm_msg); |
d62a17ae | 845 | } |
d62a17ae | 846 | |
847 | /* NULL the pointer */ | |
848 | dest_addr = NULL; | |
849 | ||
850 | /* delete processed prefix from list */ | |
851 | listnode_delete(prefixes, pe); | |
852 | ||
853 | /* if there are enough prefixes, send packet */ | |
854 | if (send_prefixes >= EIGRP_TLV_MAX_IPv4) | |
855 | break; | |
856 | } | |
857 | ||
858 | /* compute Auth digest */ | |
3a45a729 DS |
859 | if ((IF_DEF_PARAMS(ei->ifp)->auth_type == EIGRP_AUTH_TYPE_MD5) |
860 | && (IF_DEF_PARAMS(ei->ifp)->auth_keychain != NULL)) { | |
861 | eigrp_make_md5_digest(ei, ep->s, EIGRP_AUTH_UPDATE_FLAG); | |
d62a17ae | 862 | } |
863 | ||
864 | /* EIGRP Checksum */ | |
3a45a729 | 865 | eigrp_packet_checksum(ei, ep->s, length); |
d62a17ae | 866 | |
867 | ep->length = length; | |
868 | ep->dst.s_addr = nbr->src.s_addr; | |
869 | ||
870 | /*This ack number we await from neighbor*/ | |
3a45a729 | 871 | ep->sequence_number = eigrp->sequence_number; |
d62a17ae | 872 | |
873 | if (IS_DEBUG_EIGRP_PACKET(0, RECV)) | |
874 | zlog_debug("Enqueuing Update Init Len [%u] Seq [%u] Dest [%s]", | |
875 | ep->length, ep->sequence_number, inet_ntoa(ep->dst)); | |
876 | ||
877 | /*Put packet to retransmission queue*/ | |
f90f65a2 | 878 | eigrp_fifo_push(nbr->retrans_queue, ep); |
d62a17ae | 879 | |
880 | if (nbr->retrans_queue->count == 1) { | |
881 | eigrp_send_packet_reliably(nbr); | |
882 | } | |
7f57883e DS |
883 | } |
884 | ||
885 | /** | |
886 | * @fn eigrp_update_send_GR_thread | |
887 | * | |
d62a17ae | 888 | * @param[in] thread contains neighbor who would receive |
889 | * Graceful restart | |
7f57883e DS |
890 | * |
891 | * @return int always 0 | |
892 | * | |
893 | * @par | |
894 | * Function used for sending Graceful restart Update packet | |
895 | * in thread, it is prepared for multiple chunks of packet. | |
896 | * | |
897 | * Uses nbr_gr_packet_type and t_nbr_send_gr from neighbor. | |
898 | */ | |
d62a17ae | 899 | int eigrp_update_send_GR_thread(struct thread *thread) |
7f57883e | 900 | { |
d62a17ae | 901 | struct eigrp_neighbor *nbr; |
902 | ||
903 | /* get argument from thread */ | |
904 | nbr = THREAD_ARG(thread); | |
905 | /* remove this thread pointer */ | |
906 | nbr->t_nbr_send_gr = NULL; | |
907 | ||
908 | /* if there is packet waiting in queue, | |
909 | * schedule this thread again with small delay */ | |
910 | if (nbr->retrans_queue->count > 0) { | |
911 | nbr->t_nbr_send_gr = NULL; | |
912 | thread_add_timer_msec(master, eigrp_update_send_GR_thread, nbr, | |
913 | 10, &nbr->t_nbr_send_gr); | |
914 | return 0; | |
915 | } | |
916 | ||
917 | /* send GR EIGRP packet chunk */ | |
918 | eigrp_update_send_GR_part(nbr); | |
919 | ||
920 | /* if it wasn't last chunk, schedule this thread again */ | |
921 | if (nbr->nbr_gr_packet_type != EIGRP_PACKET_PART_LAST) { | |
922 | thread_execute(master, eigrp_update_send_GR_thread, nbr, 0); | |
923 | nbr->t_nbr_send_gr = NULL; | |
924 | } | |
925 | ||
926 | return 0; | |
7f57883e DS |
927 | } |
928 | ||
929 | /** | |
930 | * @fn eigrp_update_send_GR | |
931 | * | |
9d303b37 DL |
932 | * @param[in] nbr Neighbor who would receive Graceful |
933 | * restart | |
7f57883e DS |
934 | * @param[in] gr_type Who executed Graceful restart |
935 | * @param[in] vty Virtual terminal for log output | |
936 | * | |
937 | * @return void | |
938 | * | |
939 | * @par | |
940 | * Function used for sending Graceful restart Update packet: | |
941 | * Creates Update packet with INIT, RS, EOT flags and include | |
942 | * all route except those filtered | |
943 | */ | |
d62a17ae | 944 | void eigrp_update_send_GR(struct eigrp_neighbor *nbr, enum GR_type gr_type, |
945 | struct vty *vty) | |
7f57883e | 946 | { |
d62a17ae | 947 | struct eigrp_prefix_entry *pe2; |
948 | struct listnode *node2, *nnode2; | |
949 | struct list *prefixes; | |
950 | ||
951 | if (gr_type == EIGRP_GR_FILTER) { | |
952 | /* function was called after applying filtration */ | |
953 | zlog_info( | |
954 | "Neighbor %s (%s) is resync: route configuration changed", | |
955 | inet_ntoa(nbr->src), | |
956 | ifindex2ifname(nbr->ei->ifp->ifindex, VRF_DEFAULT)); | |
957 | } else if (gr_type == EIGRP_GR_MANUAL) { | |
958 | /* Graceful restart was called manually */ | |
959 | zlog_info("Neighbor %s (%s) is resync: manually cleared", | |
960 | inet_ntoa(nbr->src), | |
961 | ifindex2ifname(nbr->ei->ifp->ifindex, VRF_DEFAULT)); | |
962 | ||
963 | if (vty != NULL) { | |
964 | vty_time_print(vty, 0); | |
965 | vty_out(vty, | |
966 | "Neighbor %s (%s) is resync: manually cleared\n", | |
967 | inet_ntoa(nbr->src), | |
968 | ifindex2ifname(nbr->ei->ifp->ifindex, | |
969 | VRF_DEFAULT)); | |
970 | } | |
971 | } | |
972 | ||
973 | prefixes = list_new(); | |
974 | /* add all prefixes from topology table to list */ | |
975 | for (ALL_LIST_ELEMENTS(nbr->ei->eigrp->topology_table, node2, nnode2, | |
976 | pe2)) { | |
977 | listnode_add(prefixes, pe2); | |
978 | } | |
979 | ||
980 | /* save prefixes to neighbor */ | |
981 | nbr->nbr_gr_prefixes_send = prefixes; | |
982 | /* indicate, that this is first GR Update packet chunk */ | |
983 | nbr->nbr_gr_packet_type = EIGRP_PACKET_PART_FIRST; | |
984 | /* execute packet sending in thread */ | |
985 | thread_execute(master, eigrp_update_send_GR_thread, nbr, 0); | |
986 | nbr->t_nbr_send_gr = NULL; | |
7f57883e DS |
987 | } |
988 | ||
989 | /** | |
990 | * @fn eigrp_update_send_interface_GR | |
991 | * | |
9d303b37 DL |
992 | * @param[in] ei Interface to neighbors of which the GR |
993 | * is sent | |
7f57883e DS |
994 | * @param[in] gr_type Who executed Graceful restart |
995 | * @param[in] vty Virtual terminal for log output | |
996 | * | |
997 | * @return void | |
998 | * | |
999 | * @par | |
1000 | * Function used for sending Graceful restart Update packet | |
1001 | * to all neighbors on specified interface. | |
1002 | */ | |
d62a17ae | 1003 | void eigrp_update_send_interface_GR(struct eigrp_interface *ei, |
1004 | enum GR_type gr_type, struct vty *vty) | |
7f57883e | 1005 | { |
d62a17ae | 1006 | struct listnode *node; |
1007 | struct eigrp_neighbor *nbr; | |
1008 | ||
1009 | /* iterate over all neighbors on eigrp interface */ | |
1010 | for (ALL_LIST_ELEMENTS_RO(ei->nbrs, node, nbr)) { | |
1011 | /* send GR to neighbor */ | |
1012 | eigrp_update_send_GR(nbr, gr_type, vty); | |
1013 | } | |
7f57883e DS |
1014 | } |
1015 | ||
1016 | /** | |
1017 | * @fn eigrp_update_send_process_GR | |
1018 | * | |
1019 | * @param[in] eigrp EIGRP process | |
1020 | * @param[in] gr_type Who executed Graceful restart | |
1021 | * @param[in] vty Virtual terminal for log output | |
1022 | * | |
1023 | * @return void | |
1024 | * | |
1025 | * @par | |
1026 | * Function used for sending Graceful restart Update packet | |
1027 | * to all neighbors in eigrp process. | |
1028 | */ | |
d62a17ae | 1029 | void eigrp_update_send_process_GR(struct eigrp *eigrp, enum GR_type gr_type, |
1030 | struct vty *vty) | |
7f57883e | 1031 | { |
d62a17ae | 1032 | struct listnode *node; |
1033 | struct eigrp_interface *ei; | |
1034 | ||
1035 | /* iterate over all eigrp interfaces */ | |
1036 | for (ALL_LIST_ELEMENTS_RO(eigrp->eiflist, node, ei)) { | |
1037 | /* send GR to all neighbors on interface */ | |
1038 | eigrp_update_send_interface_GR(ei, gr_type, vty); | |
1039 | } | |
f9e5c9ca | 1040 | } |