]>
Commit | Line | Data |
---|---|---|
1 | /* BGP nexthop scan | |
2 | Copyright (C) 2000 Kunihiro Ishiguro | |
3 | ||
4 | This file is part of GNU Zebra. | |
5 | ||
6 | GNU Zebra is free software; you can redistribute it and/or modify it | |
7 | under the terms of the GNU General Public License as published by the | |
8 | Free Software Foundation; either version 2, or (at your option) any | |
9 | later version. | |
10 | ||
11 | GNU Zebra is distributed in the hope that it will be useful, but | |
12 | WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
14 | General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with GNU Zebra; see the file COPYING. If not, write to the Free | |
18 | Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA | |
19 | 02111-1307, USA. */ | |
20 | ||
21 | #include <zebra.h> | |
22 | ||
23 | #include "command.h" | |
24 | #include "thread.h" | |
25 | #include "prefix.h" | |
26 | #include "zclient.h" | |
27 | #include "stream.h" | |
28 | #include "network.h" | |
29 | #include "log.h" | |
30 | #include "memory.h" | |
31 | #include "hash.h" | |
32 | #include "jhash.h" | |
33 | #include "nexthop.h" | |
34 | #include "queue.h" | |
35 | #include "filter.h" | |
36 | ||
37 | #include "bgpd/bgpd.h" | |
38 | #include "bgpd/bgp_table.h" | |
39 | #include "bgpd/bgp_route.h" | |
40 | #include "bgpd/bgp_attr.h" | |
41 | #include "bgpd/bgp_nexthop.h" | |
42 | #include "bgpd/bgp_nht.h" | |
43 | #include "bgpd/bgp_debug.h" | |
44 | #include "bgpd/bgp_damp.h" | |
45 | #include "bgpd/bgp_fsm.h" | |
46 | #include "bgpd/bgp_vty.h" | |
47 | #include "zebra/rib.h" | |
48 | #include "zebra/zserv.h" /* For ZEBRA_SERV_PATH. */ | |
49 | ||
50 | char * | |
51 | bnc_str (struct bgp_nexthop_cache *bnc, char *buf, int size) | |
52 | { | |
53 | prefix2str(&(bnc->node->p), buf, size); | |
54 | return buf; | |
55 | } | |
56 | ||
57 | void | |
58 | bnc_nexthop_free (struct bgp_nexthop_cache *bnc) | |
59 | { | |
60 | nexthops_free(bnc->nexthop); | |
61 | } | |
62 | ||
63 | struct bgp_nexthop_cache * | |
64 | bnc_new (void) | |
65 | { | |
66 | struct bgp_nexthop_cache *bnc; | |
67 | ||
68 | bnc = XCALLOC (MTYPE_BGP_NEXTHOP_CACHE, sizeof (struct bgp_nexthop_cache)); | |
69 | LIST_INIT(&(bnc->paths)); | |
70 | return bnc; | |
71 | } | |
72 | ||
73 | void | |
74 | bnc_free (struct bgp_nexthop_cache *bnc) | |
75 | { | |
76 | bnc_nexthop_free (bnc); | |
77 | XFREE (MTYPE_BGP_NEXTHOP_CACHE, bnc); | |
78 | } | |
79 | ||
80 | /* Reset and free all BGP nexthop cache. */ | |
81 | static void | |
82 | bgp_nexthop_cache_reset (struct bgp_table *table) | |
83 | { | |
84 | struct bgp_node *rn; | |
85 | struct bgp_nexthop_cache *bnc; | |
86 | ||
87 | for (rn = bgp_table_top (table); rn; rn = bgp_route_next (rn)) | |
88 | if ((bnc = rn->info) != NULL) | |
89 | { | |
90 | bnc_free (bnc); | |
91 | rn->info = NULL; | |
92 | bgp_unlock_node (rn); | |
93 | } | |
94 | } | |
95 | ||
96 | /* BGP own address structure */ | |
97 | struct bgp_addr | |
98 | { | |
99 | struct in_addr addr; | |
100 | int refcnt; | |
101 | }; | |
102 | ||
103 | static void * | |
104 | bgp_address_hash_alloc (void *p) | |
105 | { | |
106 | const struct in_addr *val = (const struct in_addr *)p; | |
107 | struct bgp_addr *addr; | |
108 | ||
109 | addr = XMALLOC (MTYPE_BGP_ADDR, sizeof (struct bgp_addr)); | |
110 | addr->refcnt = 0; | |
111 | addr->addr.s_addr = val->s_addr; | |
112 | ||
113 | return addr; | |
114 | } | |
115 | ||
116 | static unsigned int | |
117 | bgp_address_hash_key_make (void *p) | |
118 | { | |
119 | const struct bgp_addr *addr = p; | |
120 | ||
121 | return jhash_1word(addr->addr.s_addr, 0); | |
122 | } | |
123 | ||
124 | static int | |
125 | bgp_address_hash_cmp (const void *p1, const void *p2) | |
126 | { | |
127 | const struct bgp_addr *addr1 = p1; | |
128 | const struct bgp_addr *addr2 = p2; | |
129 | ||
130 | return addr1->addr.s_addr == addr2->addr.s_addr; | |
131 | } | |
132 | ||
133 | void | |
134 | bgp_address_init (struct bgp *bgp) | |
135 | { | |
136 | bgp->address_hash = hash_create (bgp_address_hash_key_make, | |
137 | bgp_address_hash_cmp); | |
138 | } | |
139 | ||
140 | void | |
141 | bgp_address_destroy (struct bgp *bgp) | |
142 | { | |
143 | if (bgp->address_hash == NULL) | |
144 | return; | |
145 | hash_clean(bgp->address_hash, NULL); | |
146 | hash_free(bgp->address_hash); | |
147 | bgp->address_hash = NULL; | |
148 | } | |
149 | ||
150 | static void | |
151 | bgp_address_add (struct bgp *bgp, struct prefix *p) | |
152 | { | |
153 | struct bgp_addr tmp; | |
154 | struct bgp_addr *addr; | |
155 | ||
156 | tmp.addr = p->u.prefix4; | |
157 | ||
158 | addr = hash_get (bgp->address_hash, &tmp, bgp_address_hash_alloc); | |
159 | if (!addr) | |
160 | return; | |
161 | ||
162 | addr->refcnt++; | |
163 | } | |
164 | ||
165 | static void | |
166 | bgp_address_del (struct bgp *bgp, struct prefix *p) | |
167 | { | |
168 | struct bgp_addr tmp; | |
169 | struct bgp_addr *addr; | |
170 | ||
171 | tmp.addr = p->u.prefix4; | |
172 | ||
173 | addr = hash_lookup (bgp->address_hash, &tmp); | |
174 | /* may have been deleted earlier by bgp_interface_down() */ | |
175 | if (addr == NULL) | |
176 | return; | |
177 | ||
178 | addr->refcnt--; | |
179 | ||
180 | if (addr->refcnt == 0) | |
181 | { | |
182 | hash_release (bgp->address_hash, addr); | |
183 | XFREE (MTYPE_BGP_ADDR, addr); | |
184 | } | |
185 | } | |
186 | ||
187 | ||
188 | struct bgp_connected_ref | |
189 | { | |
190 | unsigned int refcnt; | |
191 | }; | |
192 | ||
193 | void | |
194 | bgp_connected_add (struct bgp *bgp, struct connected *ifc) | |
195 | { | |
196 | struct prefix p; | |
197 | struct prefix *addr; | |
198 | struct bgp_node *rn; | |
199 | struct bgp_connected_ref *bc; | |
200 | struct listnode *node, *nnode; | |
201 | struct peer *peer; | |
202 | ||
203 | addr = ifc->address; | |
204 | ||
205 | p = *(CONNECTED_PREFIX(ifc)); | |
206 | if (addr->family == AF_INET) | |
207 | { | |
208 | apply_mask_ipv4 ((struct prefix_ipv4 *) &p); | |
209 | ||
210 | if (prefix_ipv4_any ((struct prefix_ipv4 *) &p)) | |
211 | return; | |
212 | ||
213 | bgp_address_add (bgp, addr); | |
214 | ||
215 | rn = bgp_node_get (bgp->connected_table[AFI_IP], (struct prefix *) &p); | |
216 | if (rn->info) | |
217 | { | |
218 | bc = rn->info; | |
219 | bc->refcnt++; | |
220 | } | |
221 | else | |
222 | { | |
223 | bc = XCALLOC (MTYPE_BGP_CONN, sizeof (struct bgp_connected_ref)); | |
224 | bc->refcnt = 1; | |
225 | rn->info = bc; | |
226 | } | |
227 | ||
228 | for (ALL_LIST_ELEMENTS (bgp->peer, node, nnode, peer)) | |
229 | { | |
230 | if (peer->conf_if && (strcmp (peer->conf_if, ifc->ifp->name) == 0) && | |
231 | peer->status != Established && | |
232 | !CHECK_FLAG(peer->flags, PEER_FLAG_IFPEER_V6ONLY)) | |
233 | { | |
234 | if (peer_active(peer)) | |
235 | BGP_EVENT_ADD (peer, BGP_Stop); | |
236 | BGP_EVENT_ADD (peer, BGP_Start); | |
237 | } | |
238 | } | |
239 | } | |
240 | #ifdef HAVE_IPV6 | |
241 | else if (addr->family == AF_INET6) | |
242 | { | |
243 | apply_mask_ipv6 ((struct prefix_ipv6 *) &p); | |
244 | ||
245 | if (IN6_IS_ADDR_UNSPECIFIED (&p.u.prefix6)) | |
246 | return; | |
247 | ||
248 | if (IN6_IS_ADDR_LINKLOCAL (&p.u.prefix6)) | |
249 | return; | |
250 | ||
251 | rn = bgp_node_get (bgp->connected_table[AFI_IP6], (struct prefix *) &p); | |
252 | if (rn->info) | |
253 | { | |
254 | bc = rn->info; | |
255 | bc->refcnt++; | |
256 | } | |
257 | else | |
258 | { | |
259 | bc = XCALLOC (MTYPE_BGP_CONN, sizeof (struct bgp_connected_ref)); | |
260 | bc->refcnt = 1; | |
261 | rn->info = bc; | |
262 | } | |
263 | } | |
264 | #endif /* HAVE_IPV6 */ | |
265 | } | |
266 | ||
267 | void | |
268 | bgp_connected_delete (struct bgp *bgp, struct connected *ifc) | |
269 | { | |
270 | struct prefix p; | |
271 | struct prefix *addr; | |
272 | struct bgp_node *rn; | |
273 | struct bgp_connected_ref *bc; | |
274 | ||
275 | addr = ifc->address; | |
276 | ||
277 | p = *(CONNECTED_PREFIX(ifc)); | |
278 | if (addr->family == AF_INET) | |
279 | { | |
280 | apply_mask_ipv4 ((struct prefix_ipv4 *) &p); | |
281 | ||
282 | if (prefix_ipv4_any ((struct prefix_ipv4 *) &p)) | |
283 | return; | |
284 | ||
285 | bgp_address_del (bgp, addr); | |
286 | ||
287 | rn = bgp_node_lookup (bgp->connected_table[AFI_IP], &p); | |
288 | if (! rn) | |
289 | return; | |
290 | ||
291 | bc = rn->info; | |
292 | bc->refcnt--; | |
293 | if (bc->refcnt == 0) | |
294 | { | |
295 | XFREE (MTYPE_BGP_CONN, bc); | |
296 | rn->info = NULL; | |
297 | } | |
298 | bgp_unlock_node (rn); | |
299 | bgp_unlock_node (rn); | |
300 | } | |
301 | #ifdef HAVE_IPV6 | |
302 | else if (addr->family == AF_INET6) | |
303 | { | |
304 | apply_mask_ipv6 ((struct prefix_ipv6 *) &p); | |
305 | ||
306 | if (IN6_IS_ADDR_UNSPECIFIED (&p.u.prefix6)) | |
307 | return; | |
308 | ||
309 | if (IN6_IS_ADDR_LINKLOCAL (&p.u.prefix6)) | |
310 | return; | |
311 | ||
312 | rn = bgp_node_lookup (bgp->connected_table[AFI_IP6], (struct prefix *) &p); | |
313 | if (! rn) | |
314 | return; | |
315 | ||
316 | bc = rn->info; | |
317 | bc->refcnt--; | |
318 | if (bc->refcnt == 0) | |
319 | { | |
320 | XFREE (MTYPE_BGP_CONN, bc); | |
321 | rn->info = NULL; | |
322 | } | |
323 | bgp_unlock_node (rn); | |
324 | bgp_unlock_node (rn); | |
325 | } | |
326 | #endif /* HAVE_IPV6 */ | |
327 | } | |
328 | ||
329 | int | |
330 | bgp_nexthop_self (struct bgp *bgp, struct attr *attr) | |
331 | { | |
332 | struct bgp_addr tmp, *addr; | |
333 | ||
334 | tmp.addr = attr->nexthop; | |
335 | ||
336 | addr = hash_lookup (bgp->address_hash, &tmp); | |
337 | if (addr) | |
338 | return 1; | |
339 | ||
340 | return 0; | |
341 | } | |
342 | ||
343 | int | |
344 | bgp_multiaccess_check_v4 (struct in_addr nexthop, struct peer *peer) | |
345 | { | |
346 | struct bgp_node *rn1; | |
347 | struct bgp_node *rn2; | |
348 | struct prefix p; | |
349 | int ret; | |
350 | ||
351 | p.family = AF_INET; | |
352 | p.prefixlen = IPV4_MAX_BITLEN; | |
353 | p.u.prefix4 = nexthop; | |
354 | ||
355 | rn1 = bgp_node_match (peer->bgp->connected_table[AFI_IP], &p); | |
356 | if (!rn1) | |
357 | return 0; | |
358 | ||
359 | p.family = AF_INET; | |
360 | p.prefixlen = IPV4_MAX_BITLEN; | |
361 | p.u.prefix4 = peer->su.sin.sin_addr; | |
362 | ||
363 | rn2 = bgp_node_match (peer->bgp->connected_table[AFI_IP], &p); | |
364 | if (!rn2) | |
365 | { | |
366 | bgp_unlock_node(rn1); | |
367 | return 0; | |
368 | } | |
369 | ||
370 | ret = (rn1 == rn2) ? 1 : 0; | |
371 | ||
372 | bgp_unlock_node(rn1); | |
373 | bgp_unlock_node(rn2); | |
374 | ||
375 | return (ret); | |
376 | } | |
377 | ||
378 | static void | |
379 | bgp_show_nexthops (struct vty *vty, struct bgp *bgp, int detail) | |
380 | { | |
381 | struct bgp_node *rn; | |
382 | struct bgp_nexthop_cache *bnc; | |
383 | char buf[PREFIX2STR_BUFFER]; | |
384 | struct nexthop *nexthop; | |
385 | time_t tbuf; | |
386 | afi_t afi; | |
387 | ||
388 | vty_out (vty, "Current BGP nexthop cache:%s", VTY_NEWLINE); | |
389 | for (afi = AFI_IP ; afi < AFI_MAX ; afi++) | |
390 | { | |
391 | if (!bgp->nexthop_cache_table[afi]) | |
392 | continue; | |
393 | ||
394 | for (rn = bgp_table_top (bgp->nexthop_cache_table[afi]); rn; rn = bgp_route_next (rn)) | |
395 | { | |
396 | if ((bnc = rn->info) != NULL) | |
397 | { | |
398 | if (CHECK_FLAG(bnc->flags, BGP_NEXTHOP_VALID)) | |
399 | { | |
400 | vty_out (vty, " %s valid [IGP metric %d], #paths %d%s", | |
401 | inet_ntop (rn->p.family, &rn->p.u.prefix, buf, sizeof (buf)), | |
402 | bnc->metric, bnc->path_count, VTY_NEWLINE); | |
403 | if (detail) | |
404 | for (nexthop = bnc->nexthop; nexthop; nexthop = nexthop->next) | |
405 | switch (nexthop->type) | |
406 | { | |
407 | case NEXTHOP_TYPE_IPV6: | |
408 | vty_out (vty, " gate %s%s", | |
409 | inet_ntop (AF_INET6, &nexthop->gate.ipv6, | |
410 | buf, sizeof (buf)), VTY_NEWLINE); | |
411 | break; | |
412 | case NEXTHOP_TYPE_IPV6_IFINDEX: | |
413 | vty_out(vty, " gate %s, if %s%s", | |
414 | inet_ntop(AF_INET6, &nexthop->gate.ipv6, buf, | |
415 | sizeof (buf)), | |
416 | ifindex2ifname(nexthop->ifindex), | |
417 | VTY_NEWLINE); | |
418 | break; | |
419 | case NEXTHOP_TYPE_IPV4: | |
420 | vty_out (vty, " gate %s%s", | |
421 | inet_ntop (AF_INET, &nexthop->gate.ipv4, buf, | |
422 | sizeof (buf)), VTY_NEWLINE); | |
423 | break; | |
424 | case NEXTHOP_TYPE_IFINDEX: | |
425 | vty_out (vty, " if %s%s", | |
426 | ifindex2ifname(nexthop->ifindex), VTY_NEWLINE); | |
427 | break; | |
428 | case NEXTHOP_TYPE_IPV4_IFINDEX: | |
429 | vty_out (vty, " gate %s, if %s%s", | |
430 | inet_ntop(AF_INET, &nexthop->gate.ipv4, buf, | |
431 | sizeof (buf)), | |
432 | ifindex2ifname(nexthop->ifindex), VTY_NEWLINE); | |
433 | break; | |
434 | default: | |
435 | vty_out (vty, " invalid nexthop type %u%s", | |
436 | nexthop->type, VTY_NEWLINE); | |
437 | } | |
438 | } | |
439 | else | |
440 | { | |
441 | vty_out (vty, " %s invalid%s", | |
442 | inet_ntop (rn->p.family, &rn->p.u.prefix, | |
443 | buf, sizeof (buf)), VTY_NEWLINE); | |
444 | if (CHECK_FLAG(bnc->flags, BGP_NEXTHOP_CONNECTED)) | |
445 | vty_out (vty, " Must be Connected%s", VTY_NEWLINE); | |
446 | } | |
447 | #ifdef HAVE_CLOCK_MONOTONIC | |
448 | tbuf = time(NULL) - (bgp_clock() - bnc->last_update); | |
449 | vty_out (vty, " Last update: %s", ctime(&tbuf)); | |
450 | #else | |
451 | vty_out (vty, " Last update: %s", ctime(&bnc->uptime)); | |
452 | #endif /* HAVE_CLOCK_MONOTONIC */ | |
453 | vty_out(vty, "%s", VTY_NEWLINE); | |
454 | } | |
455 | } | |
456 | } | |
457 | } | |
458 | ||
459 | static int | |
460 | show_ip_bgp_nexthop_table (struct vty *vty, const char *name, int detail) | |
461 | { | |
462 | struct bgp *bgp; | |
463 | ||
464 | if (name) | |
465 | bgp = bgp_lookup_by_name (name); | |
466 | else | |
467 | bgp = bgp_get_default (); | |
468 | if (!bgp) | |
469 | { | |
470 | vty_out (vty, "%% No such BGP instance exist%s", VTY_NEWLINE); | |
471 | return CMD_WARNING; | |
472 | } | |
473 | ||
474 | bgp_show_nexthops (vty, bgp, detail); | |
475 | ||
476 | return CMD_SUCCESS; | |
477 | } | |
478 | ||
479 | static void | |
480 | bgp_show_all_instances_nexthops_vty (struct vty *vty) | |
481 | { | |
482 | struct listnode *node, *nnode; | |
483 | struct bgp *bgp; | |
484 | ||
485 | for (ALL_LIST_ELEMENTS (bm->bgp, node, nnode, bgp)) | |
486 | { | |
487 | vty_out (vty, "%sInstance %s:%s", | |
488 | VTY_NEWLINE, | |
489 | (bgp->inst_type == BGP_INSTANCE_TYPE_DEFAULT) ? "Default" : bgp->name, | |
490 | VTY_NEWLINE); | |
491 | bgp_show_nexthops (vty, bgp, 0); | |
492 | } | |
493 | } | |
494 | ||
495 | DEFUN (show_ip_bgp_nexthop, | |
496 | show_ip_bgp_nexthop_cmd, | |
497 | "show ip bgp nexthop", | |
498 | SHOW_STR | |
499 | IP_STR | |
500 | BGP_STR | |
501 | "BGP nexthop table\n") | |
502 | { | |
503 | return show_ip_bgp_nexthop_table (vty, NULL, 0); | |
504 | } | |
505 | ||
506 | DEFUN (show_ip_bgp_nexthop_detail, | |
507 | show_ip_bgp_nexthop_detail_cmd, | |
508 | "show ip bgp nexthop detail", | |
509 | SHOW_STR | |
510 | IP_STR | |
511 | BGP_STR | |
512 | "BGP nexthop table\n") | |
513 | { | |
514 | return show_ip_bgp_nexthop_table (vty, NULL, 1); | |
515 | } | |
516 | ||
517 | DEFUN (show_ip_bgp_instance_nexthop, | |
518 | show_ip_bgp_instance_nexthop_cmd, | |
519 | "show ip bgp " BGP_INSTANCE_CMD " nexthop", | |
520 | SHOW_STR | |
521 | IP_STR | |
522 | BGP_STR | |
523 | BGP_INSTANCE_HELP_STR | |
524 | "BGP nexthop table\n") | |
525 | { | |
526 | return show_ip_bgp_nexthop_table (vty, argv[1], 0); | |
527 | } | |
528 | ||
529 | DEFUN (show_ip_bgp_instance_all_nexthop, | |
530 | show_ip_bgp_instance_all_nexthop_cmd, | |
531 | "show ip bgp " BGP_INSTANCE_ALL_CMD " nexthop", | |
532 | SHOW_STR | |
533 | IP_STR | |
534 | BGP_STR | |
535 | BGP_INSTANCE_ALL_HELP_STR | |
536 | "BGP nexthop table\n") | |
537 | { | |
538 | bgp_show_all_instances_nexthops_vty (vty); | |
539 | return CMD_SUCCESS; | |
540 | } | |
541 | ||
542 | DEFUN (show_ip_bgp_instance_nexthop_detail, | |
543 | show_ip_bgp_instance_nexthop_detail_cmd, | |
544 | "show ip bgp " BGP_INSTANCE_CMD " nexthop detail", | |
545 | SHOW_STR | |
546 | IP_STR | |
547 | BGP_STR | |
548 | BGP_INSTANCE_HELP_STR | |
549 | "BGP nexthop table\n") | |
550 | { | |
551 | return show_ip_bgp_nexthop_table (vty, argv[1], 1); | |
552 | } | |
553 | ||
554 | void | |
555 | bgp_scan_init (struct bgp *bgp) | |
556 | { | |
557 | afi_t afi; | |
558 | ||
559 | for (afi = AFI_IP; afi < AFI_MAX; afi++) | |
560 | { | |
561 | bgp->nexthop_cache_table[afi] = bgp_table_init (afi, SAFI_UNICAST); | |
562 | bgp->connected_table[afi] = bgp_table_init (afi, SAFI_UNICAST); | |
563 | bgp->import_check_table[afi] = bgp_table_init (afi, SAFI_UNICAST); | |
564 | } | |
565 | } | |
566 | ||
567 | void | |
568 | bgp_scan_vty_init (void) | |
569 | { | |
570 | install_element (VIEW_NODE, &show_ip_bgp_nexthop_cmd); | |
571 | install_element (VIEW_NODE, &show_ip_bgp_nexthop_detail_cmd); | |
572 | install_element (VIEW_NODE, &show_ip_bgp_instance_nexthop_cmd); | |
573 | install_element (VIEW_NODE, &show_ip_bgp_instance_all_nexthop_cmd); | |
574 | install_element (VIEW_NODE, &show_ip_bgp_instance_nexthop_detail_cmd); | |
575 | } | |
576 | ||
577 | void | |
578 | bgp_scan_finish (struct bgp *bgp) | |
579 | { | |
580 | afi_t afi; | |
581 | ||
582 | for (afi = AFI_IP; afi < AFI_MAX; afi++) | |
583 | { | |
584 | /* Only the current one needs to be reset. */ | |
585 | bgp_nexthop_cache_reset (bgp->nexthop_cache_table[afi]); | |
586 | bgp_table_unlock (bgp->nexthop_cache_table[afi]); | |
587 | bgp->nexthop_cache_table[afi] = NULL; | |
588 | ||
589 | bgp_table_unlock (bgp->connected_table[afi]); | |
590 | bgp->connected_table[afi] = NULL; | |
591 | ||
592 | bgp_table_unlock (bgp->import_check_table[afi]); | |
593 | bgp->import_check_table[afi] = NULL; | |
594 | } | |
595 | } |