bgpd: optimize bgp_nexthop_self()

This function scores 2nd, profiling a full internet table load. It's called
for every prefix received.
  Instead of looping in the interface lists comparing addresses use a hash
to mantain them.

* bgpd.c: Init the own address hash.
* bgp_nexthop.c: Introduce methods to maintain an own address hash.
  (bgp_connected_add) add addresses to the hash.
  (bgp_connected_delete) delete addresses from the hash.
  (bgp_nexthop_self) lookup addresses in the hash. Removed the unused afi_t
  parameter.
* bgp_route.c: (bgp_update_main) Micro-optimization, rearranged condition to
  not lookup the hash for bogus nexthops (0.0.0.0 or a class D/E address)

Signed-off-by: Jorge Boncompte [DTI2] <jorge@dti2.net>
Signed-off-by: David Lamparter <equinox@opensourcerouting.org>
This commit is contained in:
Jorge Boncompte [DTI2] 2012-05-07 16:52:52 +00:00 committed by David Lamparter
parent f669f7d25f
commit 10f9bf3f20
5 changed files with 97 additions and 20 deletions

View File

@ -28,6 +28,8 @@ Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
#include "network.h" #include "network.h"
#include "log.h" #include "log.h"
#include "memory.h" #include "memory.h"
#include "hash.h"
#include "jhash.h"
#include "bgpd/bgpd.h" #include "bgpd/bgpd.h"
#include "bgpd/bgp_table.h" #include "bgpd/bgp_table.h"
@ -524,6 +526,83 @@ bgp_scan_timer (struct thread *t)
return 0; return 0;
} }
/* BGP own address structure */
struct bgp_addr
{
struct in_addr addr;
int refcnt;
};
static struct hash *bgp_address_hash;
static void *
bgp_address_hash_alloc (void *p)
{
struct in_addr *val = p;
struct bgp_addr *addr;
addr = XMALLOC (MTYPE_BGP_ADDR, sizeof (struct bgp_addr));
addr->refcnt = 0;
addr->addr.s_addr = val->s_addr;
return addr;
}
static unsigned int
bgp_address_hash_key_make (void *p)
{
const struct bgp_addr *addr = p;
return jhash_1word(addr->addr.s_addr, 0);
}
static int
bgp_address_hash_cmp (const void *p1, const void *p2)
{
const struct bgp_addr *addr1 = p1;
const struct bgp_addr *addr2 = p2;
return addr1->addr.s_addr == addr2->addr.s_addr;
}
void
bgp_address_init (void)
{
bgp_address_hash = hash_create (bgp_address_hash_key_make,
bgp_address_hash_cmp);
}
static void
bgp_address_add (struct prefix *p)
{
struct bgp_addr tmp;
struct bgp_addr *addr;
tmp.addr = p->u.prefix4;
addr = hash_get (bgp_address_hash, &tmp, bgp_address_hash_alloc);
addr->refcnt++;
}
static void
bgp_address_del (struct prefix *p)
{
struct bgp_addr tmp;
struct bgp_addr *addr;
tmp.addr = p->u.prefix4;
addr = hash_lookup (bgp_address_hash, &tmp);
addr->refcnt--;
if (addr->refcnt == 0)
{
hash_release (bgp_address_hash, addr);
XFREE (MTYPE_BGP_ADDR, addr);
}
}
struct bgp_connected_ref struct bgp_connected_ref
{ {
@ -557,6 +636,8 @@ bgp_connected_add (struct connected *ifc)
if (prefix_ipv4_any ((struct prefix_ipv4 *) &p)) if (prefix_ipv4_any ((struct prefix_ipv4 *) &p))
return; return;
bgp_address_add (addr);
rn = bgp_node_get (bgp_connected_table[AFI_IP], (struct prefix *) &p); rn = bgp_node_get (bgp_connected_table[AFI_IP], (struct prefix *) &p);
if (rn->info) if (rn->info)
{ {
@ -622,6 +703,8 @@ bgp_connected_delete (struct connected *ifc)
if (prefix_ipv4_any ((struct prefix_ipv4 *) &p)) if (prefix_ipv4_any ((struct prefix_ipv4 *) &p))
return; return;
bgp_address_del (addr);
rn = bgp_node_lookup (bgp_connected_table[AFI_IP], &p); rn = bgp_node_lookup (bgp_connected_table[AFI_IP], &p);
if (! rn) if (! rn)
return; return;
@ -666,25 +749,16 @@ bgp_connected_delete (struct connected *ifc)
} }
int int
bgp_nexthop_self (afi_t afi, struct attr *attr) bgp_nexthop_self (struct attr *attr)
{ {
struct listnode *node; struct bgp_addr tmp, *addr;
struct listnode *node2;
struct interface *ifp;
struct connected *ifc;
struct prefix *p;
for (ALL_LIST_ELEMENTS_RO (iflist, node, ifp)) tmp.addr = attr->nexthop;
{
for (ALL_LIST_ELEMENTS_RO (ifp->connected, node2, ifc)) addr = hash_lookup (bgp_address_hash, &tmp);
{ if (addr)
p = ifc->address; return 1;
if (p && p->family == AF_INET
&& IPV4_ADDR_SAME (&p->u.prefix4, &attr->nexthop))
return 1;
}
}
return 0; return 0;
} }

View File

@ -55,6 +55,7 @@ extern void bgp_connected_delete (struct connected *c);
extern int bgp_multiaccess_check_v4 (struct in_addr, char *); extern int bgp_multiaccess_check_v4 (struct in_addr, char *);
extern int bgp_config_write_scan_time (struct vty *); extern int bgp_config_write_scan_time (struct vty *);
extern int bgp_nexthop_onlink (afi_t, struct attr *); extern int bgp_nexthop_onlink (afi_t, struct attr *);
extern int bgp_nexthop_self (afi_t, struct attr *); extern int bgp_nexthop_self (struct attr *);
extern void bgp_address_init (void);
#endif /* _QUAGGA_BGP_NEXTHOP_H */ #endif /* _QUAGGA_BGP_NEXTHOP_H */

View File

@ -2147,9 +2147,9 @@ bgp_update_main (struct peer *peer, struct prefix *p, struct attr *attr,
/* Next hop must not be 0.0.0.0 nor Class D/E address. Next hop /* Next hop must not be 0.0.0.0 nor Class D/E address. Next hop
must not be my own address. */ must not be my own address. */
if (bgp_nexthop_self (afi, &new_attr) if (new_attr.nexthop.s_addr == 0
|| new_attr.nexthop.s_addr == 0 || IPV4_CLASS_DE (ntohl (new_attr.nexthop.s_addr))
|| IPV4_CLASS_DE (ntohl (new_attr.nexthop.s_addr))) || bgp_nexthop_self (&new_attr))
{ {
reason = "martian next-hop;"; reason = "martian next-hop;";
goto filtered; goto filtered;

View File

@ -5358,6 +5358,7 @@ bgp_init (void)
bgp_dump_init (); bgp_dump_init ();
bgp_route_init (); bgp_route_init ();
bgp_route_map_init (); bgp_route_map_init ();
bgp_address_init ();
bgp_scan_init (); bgp_scan_init ();
bgp_mplsvpn_init (); bgp_mplsvpn_init ();

View File

@ -150,6 +150,7 @@ struct memory_list memory_list_bgp[] =
{ MTYPE_BGP_DAMP_ARRAY, "BGP Dampening array" }, { MTYPE_BGP_DAMP_ARRAY, "BGP Dampening array" },
{ MTYPE_BGP_REGEXP, "BGP regexp" }, { MTYPE_BGP_REGEXP, "BGP regexp" },
{ MTYPE_BGP_AGGREGATE, "BGP aggregate" }, { MTYPE_BGP_AGGREGATE, "BGP aggregate" },
{ MTYPE_BGP_ADDR, "BGP own address" },
{ -1, NULL } { -1, NULL }
}; };