struct peer *peer;
struct listnode *node, *nnode;
- if (! bgp)
- bgp = bgp_get_default ();
-
- if (! bgp)
- return NULL;
+ if (bgp != NULL)
+ {
+ for (ALL_LIST_ELEMENTS (bgp->peer, node, nnode, peer))
+ {
+ if (sockunion_same (&peer->su, su)
+ && ! CHECK_FLAG (peer->sflags, PEER_STATUS_ACCEPT_PEER))
+ return peer;
+ }
+ }
+ else if (bm->bgp != NULL)
+ {
+ struct listnode *bgpnode, *nbgpnode;
+ for(ALL_LIST_ELEMENTS(bm->bgp, bgpnode, nbgpnode, bgp))
+ {
for (ALL_LIST_ELEMENTS (bgp->peer, node, nnode, peer))
{
if (sockunion_same (&peer->su, su)
&& ! CHECK_FLAG (peer->sflags, PEER_STATUS_ACCEPT_PEER))
return peer;
}
+ }
+ }
return NULL;
}
{
struct peer *peer;
struct listnode *node, *nnode;
+ struct listnode *bgpnode, *nbgpnode;
struct bgp *bgp;
- bgp = bgp_get_default ();
- if (! bgp)
+ if (! bm->bgp)
return NULL;
+ for(ALL_LIST_ELEMENTS(bm->bgp, bgpnode, nbgpnode, bgp))
+ {
for (ALL_LIST_ELEMENTS (bgp->peer, node, nnode, peer))
{
if (sockunion_same (&peer->su, su)
*as = 1;
}
}
+
for (ALL_LIST_ELEMENTS (bgp->peer, node, nnode, peer))
{
if (sockunion_same (&peer->su, su)
*as = 1;
}
}
+ }
return NULL;
}
\f