2 * Copyright (C) 2000 Kunihiro Ishiguro
4 * This file is part of GNU Zebra.
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
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.
16 * You should have received a copy of the GNU General Public License along
17 * with this program; see the file COPYING; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
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. */
50 char *bnc_str(struct bgp_nexthop_cache
*bnc
, char *buf
, int size
)
52 prefix2str(&(bnc
->node
->p
), buf
, size
);
56 void bnc_nexthop_free(struct bgp_nexthop_cache
*bnc
)
58 nexthops_free(bnc
->nexthop
);
61 struct bgp_nexthop_cache
*bnc_new(void)
63 struct bgp_nexthop_cache
*bnc
;
65 bnc
= XCALLOC(MTYPE_BGP_NEXTHOP_CACHE
,
66 sizeof(struct bgp_nexthop_cache
));
67 LIST_INIT(&(bnc
->paths
));
71 void bnc_free(struct bgp_nexthop_cache
*bnc
)
73 bnc_nexthop_free(bnc
);
74 XFREE(MTYPE_BGP_NEXTHOP_CACHE
, bnc
);
77 /* Reset and free all BGP nexthop cache. */
78 static void bgp_nexthop_cache_reset(struct bgp_table
*table
)
81 struct bgp_nexthop_cache
*bnc
;
83 for (rn
= bgp_table_top(table
); rn
; rn
= bgp_route_next(rn
))
84 if ((bnc
= rn
->info
) != NULL
) {
91 static void *bgp_tip_hash_alloc(void *p
)
93 const struct in_addr
*val
= (const struct in_addr
*)p
;
94 struct tip_addr
*addr
;
96 addr
= XMALLOC(MTYPE_TIP_ADDR
, sizeof(struct tip_addr
));
98 addr
->addr
.s_addr
= val
->s_addr
;
103 static void bgp_tip_hash_free(void *addr
)
105 XFREE(MTYPE_TIP_ADDR
, addr
);
108 static unsigned int bgp_tip_hash_key_make(void *p
)
110 const struct tip_addr
*addr
= p
;
112 return jhash_1word(addr
->addr
.s_addr
, 0);
115 static int bgp_tip_hash_cmp(const void *p1
, const void *p2
)
117 const struct tip_addr
*addr1
= p1
;
118 const struct tip_addr
*addr2
= p2
;
120 return addr1
->addr
.s_addr
== addr2
->addr
.s_addr
;
123 void bgp_tip_hash_init(struct bgp
*bgp
)
125 bgp
->tip_hash
= hash_create(bgp_tip_hash_key_make
,
126 bgp_tip_hash_cmp
, NULL
);
129 void bgp_tip_hash_destroy(struct bgp
*bgp
)
131 if (bgp
->tip_hash
== NULL
)
133 hash_clean(bgp
->tip_hash
, bgp_tip_hash_free
);
134 hash_free(bgp
->tip_hash
);
135 bgp
->tip_hash
= NULL
;
138 void bgp_tip_add(struct bgp
*bgp
, struct in_addr
*tip
)
141 struct tip_addr
*addr
;
145 addr
= hash_get(bgp
->tip_hash
, &tmp
, bgp_tip_hash_alloc
);
152 void bgp_tip_del(struct bgp
*bgp
, struct in_addr
*tip
)
155 struct tip_addr
*addr
;
159 addr
= hash_lookup(bgp
->tip_hash
, &tmp
);
160 /* may have been deleted earlier by bgp_interface_down() */
166 if (addr
->refcnt
== 0) {
167 hash_release(bgp
->tip_hash
, addr
);
168 XFREE(MTYPE_TIP_ADDR
, addr
);
172 static void *bgp_address_hash_alloc(void *p
)
174 const struct in_addr
*val
= (const struct in_addr
*)p
;
175 struct bgp_addr
*addr
;
177 addr
= XMALLOC(MTYPE_BGP_ADDR
, sizeof(struct bgp_addr
));
179 addr
->addr
.s_addr
= val
->s_addr
;
184 static void bgp_address_hash_free(void *addr
)
186 XFREE(MTYPE_BGP_ADDR
, addr
);
189 static unsigned int bgp_address_hash_key_make(void *p
)
191 const struct bgp_addr
*addr
= p
;
193 return jhash_1word(addr
->addr
.s_addr
, 0);
196 static int bgp_address_hash_cmp(const void *p1
, const void *p2
)
198 const struct bgp_addr
*addr1
= p1
;
199 const struct bgp_addr
*addr2
= p2
;
201 return addr1
->addr
.s_addr
== addr2
->addr
.s_addr
;
204 void bgp_address_init(struct bgp
*bgp
)
206 bgp
->address_hash
= hash_create(bgp_address_hash_key_make
,
207 bgp_address_hash_cmp
, NULL
);
210 void bgp_address_destroy(struct bgp
*bgp
)
212 if (bgp
->address_hash
== NULL
)
214 hash_clean(bgp
->address_hash
, bgp_address_hash_free
);
215 hash_free(bgp
->address_hash
);
216 bgp
->address_hash
= NULL
;
219 static void bgp_address_add(struct bgp
*bgp
, struct prefix
*p
)
222 struct bgp_addr
*addr
;
224 tmp
.addr
= p
->u
.prefix4
;
226 addr
= hash_get(bgp
->address_hash
, &tmp
, bgp_address_hash_alloc
);
233 static void bgp_address_del(struct bgp
*bgp
, struct prefix
*p
)
236 struct bgp_addr
*addr
;
238 tmp
.addr
= p
->u
.prefix4
;
240 addr
= hash_lookup(bgp
->address_hash
, &tmp
);
241 /* may have been deleted earlier by bgp_interface_down() */
247 if (addr
->refcnt
== 0) {
248 hash_release(bgp
->address_hash
, addr
);
249 XFREE(MTYPE_BGP_ADDR
, addr
);
254 struct bgp_connected_ref
{
258 void bgp_connected_add(struct bgp
*bgp
, struct connected
*ifc
)
263 struct bgp_connected_ref
*bc
;
264 struct listnode
*node
, *nnode
;
269 p
= *(CONNECTED_PREFIX(ifc
));
270 if (addr
->family
== AF_INET
) {
271 apply_mask_ipv4((struct prefix_ipv4
*)&p
);
273 if (prefix_ipv4_any((struct prefix_ipv4
*)&p
))
276 bgp_address_add(bgp
, addr
);
278 rn
= bgp_node_get(bgp
->connected_table
[AFI_IP
],
279 (struct prefix
*)&p
);
284 bc
= XCALLOC(MTYPE_BGP_CONN
,
285 sizeof(struct bgp_connected_ref
));
290 for (ALL_LIST_ELEMENTS(bgp
->peer
, node
, nnode
, peer
)) {
292 && (strcmp(peer
->conf_if
, ifc
->ifp
->name
) == 0)
293 && peer
->status
!= Established
294 && !CHECK_FLAG(peer
->flags
,
295 PEER_FLAG_IFPEER_V6ONLY
)) {
296 if (peer_active(peer
))
297 BGP_EVENT_ADD(peer
, BGP_Stop
);
298 BGP_EVENT_ADD(peer
, BGP_Start
);
301 } else if (addr
->family
== AF_INET6
) {
302 apply_mask_ipv6((struct prefix_ipv6
*)&p
);
304 if (IN6_IS_ADDR_UNSPECIFIED(&p
.u
.prefix6
))
307 if (IN6_IS_ADDR_LINKLOCAL(&p
.u
.prefix6
))
310 rn
= bgp_node_get(bgp
->connected_table
[AFI_IP6
],
311 (struct prefix
*)&p
);
316 bc
= XCALLOC(MTYPE_BGP_CONN
,
317 sizeof(struct bgp_connected_ref
));
324 void bgp_connected_delete(struct bgp
*bgp
, struct connected
*ifc
)
329 struct bgp_connected_ref
*bc
;
333 p
= *(CONNECTED_PREFIX(ifc
));
334 if (addr
->family
== AF_INET
) {
335 apply_mask_ipv4((struct prefix_ipv4
*)&p
);
337 if (prefix_ipv4_any((struct prefix_ipv4
*)&p
))
340 bgp_address_del(bgp
, addr
);
342 rn
= bgp_node_lookup(bgp
->connected_table
[AFI_IP
], &p
);
348 if (bc
->refcnt
== 0) {
349 XFREE(MTYPE_BGP_CONN
, bc
);
354 } else if (addr
->family
== AF_INET6
) {
355 apply_mask_ipv6((struct prefix_ipv6
*)&p
);
357 if (IN6_IS_ADDR_UNSPECIFIED(&p
.u
.prefix6
))
360 if (IN6_IS_ADDR_LINKLOCAL(&p
.u
.prefix6
))
363 rn
= bgp_node_lookup(bgp
->connected_table
[AFI_IP6
],
364 (struct prefix
*)&p
);
370 if (bc
->refcnt
== 0) {
371 XFREE(MTYPE_BGP_CONN
, bc
);
379 int bgp_nexthop_self(struct bgp
*bgp
, struct in_addr nh_addr
)
381 struct bgp_addr tmp
, *addr
;
382 struct tip_addr tmp_tip
, *tip
;
386 addr
= hash_lookup(bgp
->address_hash
, &tmp
);
390 tmp_tip
.addr
= nh_addr
;
391 tip
= hash_lookup(bgp
->tip_hash
, &tmp_tip
);
398 int bgp_multiaccess_check_v4(struct in_addr nexthop
, struct peer
*peer
)
400 struct bgp_node
*rn1
;
401 struct bgp_node
*rn2
;
406 p
.prefixlen
= IPV4_MAX_BITLEN
;
407 p
.u
.prefix4
= nexthop
;
409 rn1
= bgp_node_match(peer
->bgp
->connected_table
[AFI_IP
], &p
);
414 p
.prefixlen
= IPV4_MAX_BITLEN
;
415 p
.u
.prefix4
= peer
->su
.sin
.sin_addr
;
417 rn2
= bgp_node_match(peer
->bgp
->connected_table
[AFI_IP
], &p
);
419 bgp_unlock_node(rn1
);
423 ret
= (rn1
== rn2
) ? 1 : 0;
425 bgp_unlock_node(rn1
);
426 bgp_unlock_node(rn2
);
431 static void bgp_show_nexthops(struct vty
*vty
, struct bgp
*bgp
, int detail
)
434 struct bgp_nexthop_cache
*bnc
;
435 char buf
[PREFIX2STR_BUFFER
];
436 struct nexthop
*nexthop
;
440 vty_out(vty
, "Current BGP nexthop cache:\n");
441 for (afi
= AFI_IP
; afi
< AFI_MAX
; afi
++) {
442 if (!bgp
->nexthop_cache_table
[afi
])
445 for (rn
= bgp_table_top(bgp
->nexthop_cache_table
[afi
]); rn
;
446 rn
= bgp_route_next(rn
)) {
447 if ((bnc
= rn
->info
) != NULL
) {
448 if (CHECK_FLAG(bnc
->flags
, BGP_NEXTHOP_VALID
)) {
450 " %s valid [IGP metric %d], #paths %d\n",
451 inet_ntop(rn
->p
.family
,
452 &rn
->p
.u
.prefix
, buf
,
454 bnc
->metric
, bnc
->path_count
);
456 for (nexthop
= bnc
->nexthop
;
458 nexthop
= nexthop
->next
)
459 switch (nexthop
->type
) {
460 case NEXTHOP_TYPE_IPV6
:
470 case NEXTHOP_TYPE_IPV6_IFINDEX
:
483 case NEXTHOP_TYPE_IPV4
:
493 case NEXTHOP_TYPE_IFINDEX
:
500 case NEXTHOP_TYPE_IPV4_IFINDEX
:
515 " invalid nexthop type %u\n",
519 vty_out(vty
, " %s invalid\n",
520 inet_ntop(rn
->p
.family
,
521 &rn
->p
.u
.prefix
, buf
,
523 if (CHECK_FLAG(bnc
->flags
,
524 BGP_NEXTHOP_CONNECTED
))
526 " Must be Connected\n");
529 - (bgp_clock() - bnc
->last_update
);
530 vty_out(vty
, " Last update: %s", ctime(&tbuf
));
537 static int show_ip_bgp_nexthop_table(struct vty
*vty
, const char *name
,
543 bgp
= bgp_lookup_by_name(name
);
545 bgp
= bgp_get_default();
547 vty_out(vty
, "%% No such BGP instance exist\n");
551 bgp_show_nexthops(vty
, bgp
, detail
);
556 static void bgp_show_all_instances_nexthops_vty(struct vty
*vty
)
558 struct listnode
*node
, *nnode
;
561 for (ALL_LIST_ELEMENTS(bm
->bgp
, node
, nnode
, bgp
)) {
562 vty_out(vty
, "\nInstance %s:\n",
563 (bgp
->inst_type
== BGP_INSTANCE_TYPE_DEFAULT
)
566 bgp_show_nexthops(vty
, bgp
, 0);
570 DEFUN (show_ip_bgp_nexthop
,
571 show_ip_bgp_nexthop_cmd
,
572 "show [ip] bgp [<view|vrf> VIEWVRFNAME] nexthop [detail]",
576 BGP_INSTANCE_HELP_STR
577 "BGP nexthop table\n"
578 "Show detailed information\n")
581 char *vrf
= argv_find(argv
, argc
, "WORD", &idx
) ? argv
[idx
]->arg
: NULL
;
582 int detail
= argv_find(argv
, argc
, "detail", &idx
) ? 1 : 0;
583 return show_ip_bgp_nexthop_table(vty
, vrf
, detail
);
586 DEFUN (show_ip_bgp_instance_all_nexthop
,
587 show_ip_bgp_instance_all_nexthop_cmd
,
588 "show [ip] bgp <view|vrf> all nexthop",
592 BGP_INSTANCE_ALL_HELP_STR
593 "BGP nexthop table\n")
595 bgp_show_all_instances_nexthops_vty(vty
);
599 void bgp_scan_init(struct bgp
*bgp
)
603 for (afi
= AFI_IP
; afi
< AFI_MAX
; afi
++) {
604 bgp
->nexthop_cache_table
[afi
] =
605 bgp_table_init(afi
, SAFI_UNICAST
);
606 bgp
->connected_table
[afi
] = bgp_table_init(afi
, SAFI_UNICAST
);
607 bgp
->import_check_table
[afi
] =
608 bgp_table_init(afi
, SAFI_UNICAST
);
612 void bgp_scan_vty_init(void)
614 install_element(VIEW_NODE
, &show_ip_bgp_nexthop_cmd
);
615 install_element(VIEW_NODE
, &show_ip_bgp_instance_all_nexthop_cmd
);
618 void bgp_scan_finish(struct bgp
*bgp
)
622 for (afi
= AFI_IP
; afi
< AFI_MAX
; afi
++) {
623 /* Only the current one needs to be reset. */
624 bgp_nexthop_cache_reset(bgp
->nexthop_cache_table
[afi
]);
625 bgp_table_unlock(bgp
->nexthop_cache_table
[afi
]);
626 bgp
->nexthop_cache_table
[afi
] = NULL
;
628 bgp_table_unlock(bgp
->connected_table
[afi
]);
629 bgp
->connected_table
[afi
] = NULL
;
631 bgp_table_unlock(bgp
->import_check_table
[afi
]);
632 bgp
->import_check_table
[afi
] = NULL
;