bgpd/bgp_updgrp.h

   1 /**
   2  * bgp_updgrp.c: BGP update group structures
   3  *
   4  * @copyright Copyright (C) 2014 Cumulus Networks, Inc.
   5  *
   6  * @author Avneesh Sachdev <avneesh@sproute.net>
   7  * @author Rajesh Varadarajan <rajesh@sproute.net>
   8  * @author Pradosh Mohapatra <pradosh@sproute.net>
   9  *
  10  * This file is part of GNU Zebra.
  11  *
  12  * GNU Zebra is free software; you can redistribute it and/or modify it
  13  * under the terms of the GNU General Public License as published by the
  14  * Free Software Foundation; either version 2, or (at your option) any
  15  * later version.
  16  *
  17  * GNU Zebra is distributed in the hope that it will be useful, but
  18  * WITHOUT ANY WARRANTY; without even the implied warranty of
  19  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  20  * General Public License for more details.
  21  *
  22  * You should have received a copy of the GNU General Public License along
  23  * with this program; see the file COPYING; if not, write to the Free Software
  24  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  25  */
  26
  27 #ifndef _QUAGGA_BGP_UPDGRP_H
  28 #define _QUAGGA_BGP_UPDGRP_H
  29
  30 #include "bgp_advertise.h"
  31
  32 /*
  33  * The following three heuristic constants determine how long advertisement to
  34  * a subgroup will be delayed after it is created. The intent is to allow
  35  * transient changes in peer state (primarily session establishment) to settle,
  36  * so that more peers can be grouped together and benefit from sharing
  37  * advertisement computations with the subgroup.
  38  *
  39  * These values have a very large impact on initial convergence time; any
  40  * changes should be accompanied by careful performance testing at all scales.
  41  *
  42  * The coalesce time 'C' for a new subgroup within a particular BGP instance
  43  * 'B' with total number of known peers 'P', established or not, is computed as
  44  * follows:
  45  *
  46  * C = MIN(BGP_MAX_SUBGROUP_COALESCE_TIME,
  47  *         BGP_DEFAULT_SUBGROUP_COALESCE_TIME +
  48  *         (P*BGP_PEER_ADJUST_SUBGROUP_COALESCE_TIME))
  49  */
  50 #define BGP_DEFAULT_SUBGROUP_COALESCE_TIME 1000
  51 #define BGP_MAX_SUBGROUP_COALESCE_TIME 10000
  52 #define BGP_PEER_ADJUST_SUBGROUP_COALESCE_TIME 50
  53
  54 #define PEER_UPDGRP_FLAGS                                                      \
  55         (PEER_FLAG_LOCAL_AS_NO_PREPEND | PEER_FLAG_LOCAL_AS_REPLACE_AS)
  56
  57 #define PEER_UPDGRP_AF_FLAGS                                                   \
  58         (PEER_FLAG_SEND_COMMUNITY | PEER_FLAG_SEND_EXT_COMMUNITY               \
  59          | PEER_FLAG_SEND_LARGE_COMMUNITY                                      \
  60          | PEER_FLAG_DEFAULT_ORIGINATE | PEER_FLAG_REFLECTOR_CLIENT            \
  61          | PEER_FLAG_RSERVER_CLIENT | PEER_FLAG_NEXTHOP_SELF                   \
  62          | PEER_FLAG_NEXTHOP_UNCHANGED | PEER_FLAG_FORCE_NEXTHOP_SELF          \
  63          | PEER_FLAG_AS_PATH_UNCHANGED | PEER_FLAG_MED_UNCHANGED               \
  64          | PEER_FLAG_NEXTHOP_LOCAL_UNCHANGED | PEER_FLAG_REMOVE_PRIVATE_AS     \
  65          | PEER_FLAG_REMOVE_PRIVATE_AS_ALL                                     \
  66          | PEER_FLAG_REMOVE_PRIVATE_AS_REPLACE                                 \
  67          | PEER_FLAG_REMOVE_PRIVATE_AS_ALL_REPLACE                             \
  68          | PEER_FLAG_AS_OVERRIDE)
  69
  70 #define PEER_UPDGRP_CAP_FLAGS (PEER_CAP_AS4_RCV)
  71
  72 #define PEER_UPDGRP_AF_CAP_FLAGS                                               \
  73         (PEER_CAP_ORF_PREFIX_SM_RCV | PEER_CAP_ORF_PREFIX_SM_OLD_RCV           \
  74          | PEER_CAP_ADDPATH_AF_TX_ADV | PEER_CAP_ADDPATH_AF_RX_RCV             \
  75          | PEER_CAP_ENHE_AF_NEGO)
  76
  77 typedef enum { BGP_ATTR_VEC_NH = 0, BGP_ATTR_VEC_MAX } bpacket_attr_vec_type;
  78
  79 typedef struct {
  80         uint32_t flags;
  81         unsigned long offset;
  82 } bpacket_attr_vec;
  83
  84 #define BPKT_ATTRVEC_FLAGS_UPDATED        (1 << 0)
  85 #define BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS   (1 << 1)
  86 #define BPKT_ATTRVEC_FLAGS_REFLECTED (1 << 2)
  87 #define BPKT_ATTRVEC_FLAGS_RMAP_NH_UNCHANGED   (1 << 3)
  88 #define BPKT_ATTRVEC_FLAGS_RMAP_IPV4_NH_CHANGED   (1 << 4)
  89 #define BPKT_ATTRVEC_FLAGS_RMAP_IPV6_GNH_CHANGED  (1 << 5)
  90 #define BPKT_ATTRVEC_FLAGS_RMAP_IPV6_LNH_CHANGED  (1 << 6)
  91
  92 typedef struct bpacket_attr_vec_arr {
  93         bpacket_attr_vec entries[BGP_ATTR_VEC_MAX];
  94 } bpacket_attr_vec_arr;
  95
  96 struct bpacket {
  97         /* for being part of an update subgroup's message list */
  98         TAILQ_ENTRY(bpacket) pkt_train;
  99
 100         /* list of peers (well, peer_afs) that the packet needs to be sent to */
 101         LIST_HEAD(pkt_peer_list, peer_af) peers;
 102
 103         struct stream *buffer;
 104         bpacket_attr_vec_arr arr;
 105
 106         unsigned int ver;
 107 };
 108
 109 struct bpacket_queue {
 110         TAILQ_HEAD(pkt_queue, bpacket) pkts;
 111
 112 #if 0
 113   /* A dummy packet that is used to thread all peers that have
 114      completed their work */
 115   struct bpacket sentinel;
 116 #endif
 117
 118         unsigned int conf_max_count;
 119         unsigned int curr_count;
 120         unsigned int hwm_count;
 121         unsigned int max_count_reached_count;
 122 };
 123
 124 struct update_group {
 125         /* back pointer to the BGP instance */
 126         struct bgp *bgp;
 127
 128         /* list of subgroups that belong to the update group */
 129         LIST_HEAD(subgrp_list, update_subgroup) subgrps;
 130
 131         /* lazy way to store configuration common to all peers
 132            hash function will compute from this data */
 133         struct peer *conf;
 134
 135         afi_t afi;
 136         safi_t safi;
 137         int afid;
 138
 139         uint64_t id;
 140         time_t uptime;
 141
 142         uint32_t join_events;
 143         uint32_t prune_events;
 144         uint32_t merge_events;
 145         uint32_t updgrp_switch_events;
 146         uint32_t peer_refreshes_combined;
 147         uint32_t adj_count;
 148         uint32_t split_events;
 149         uint32_t merge_checks_triggered;
 150
 151         uint32_t subgrps_created;
 152         uint32_t subgrps_deleted;
 153
 154         uint32_t num_dbg_en_peers;
 155 };
 156
 157 /*
 158  * Shorthand for a global statistics counter.
 159  */
 160 #define UPDGRP_GLOBAL_STAT(updgrp, stat)                                       \
 161         ((updgrp)->bgp->update_group_stats.stat)
 162
 163 /*
 164  * Add the given value to a counter on an update group and the bgp
 165  * instance.
 166  */
 167 #define UPDGRP_INCR_STAT_BY(updgrp, stat, value)                               \
 168         do {                                                                   \
 169                 (updgrp)->stat += (value);                                     \
 170                 UPDGRP_GLOBAL_STAT(updgrp, stat) += (value);                   \
 171         } while (0)
 172
 173 /*
 174  * Increment a counter on a update group and its parent structures.
 175  */
 176 #define UPDGRP_INCR_STAT(subgrp, stat) UPDGRP_INCR_STAT_BY(subgrp, stat, 1)
 177
 178 struct update_subgroup {
 179         /* back pointer to the parent update group */
 180         struct update_group *update_group;
 181
 182         /* list of peers that belong to the subgroup */
 183         LIST_HEAD(peer_list, peer_af) peers;
 184         int peer_count;
 185
 186         /* for being part of an update group's subgroup list */
 187         LIST_ENTRY(update_subgroup) updgrp_train;
 188
 189         struct bpacket_queue pkt_queue;
 190
 191         /*
 192          * List of adj-out structures for this subgroup.
 193          * It essentially represents the snapshot of every prefix that
 194          * has been advertised to the members of the subgroup
 195          */
 196         TAILQ_HEAD(adjout_queue, bgp_adj_out) adjq;
 197
 198         /* packet buffer for update generation */
 199         struct stream *work;
 200
 201         /* We use a separate stream to encode MP_REACH_NLRI for efficient
 202          * NLRI packing. peer->obuf_work stores all the other attributes. The
 203          * actual packet is then constructed by concatenating the two.
 204          */
 205         struct stream *scratch;
 206
 207         /* synchronization list and time */
 208         struct bgp_synchronize *sync;
 209
 210         /* send prefix count */
 211         uint32_t scount;
 212
 213         /* announcement attribute hash */
 214         struct hash *hash;
 215
 216         struct thread *t_coalesce;
 217         uint32_t v_coalesce;
 218
 219         struct thread *t_merge_check;
 220
 221         /* table version that the subgroup has caught up to. */
 222         uint64_t version;
 223
 224         /* version maintained to record adj changes */
 225         uint64_t adj_version;
 226
 227         time_t uptime;
 228
 229         /*
 230          * Identifying information about the subgroup that this subgroup was
 231          * split
 232          * from, if any.
 233          */
 234         struct {
 235                 uint64_t update_group_id;
 236                 uint64_t subgroup_id;
 237         } split_from;
 238
 239         uint32_t join_events;
 240         uint32_t prune_events;
 241
 242         /*
 243          * This is bumped up when another subgroup merges into this one.
 244          */
 245         uint32_t merge_events;
 246         uint32_t updgrp_switch_events;
 247         uint32_t peer_refreshes_combined;
 248         uint32_t adj_count;
 249         uint32_t split_events;
 250         uint32_t merge_checks_triggered;
 251
 252         uint64_t id;
 253
 254         uint16_t sflags;
 255 #define SUBGRP_STATUS_DEFAULT_ORIGINATE (1 << 0)
 256 #define SUBGRP_STATUS_FORCE_UPDATES (1 << 1)
 257
 258         uint16_t flags;
 259 #define SUBGRP_FLAG_NEEDS_REFRESH (1 << 0)
 260 };
 261
 262 /*
 263  * Add the given value to the specified counter on a subgroup and its
 264  * parent structures.
 265  */
 266 #define SUBGRP_INCR_STAT_BY(subgrp, stat, value)                               \
 267         do {                                                                   \
 268                 (subgrp)->stat += (value);                                     \
 269                 if ((subgrp)->update_group)                                    \
 270                         UPDGRP_INCR_STAT_BY((subgrp)->update_group, stat,      \
 271                                             value);                            \
 272         } while (0)
 273
 274 /*
 275  * Increment a counter on a subgroup and its parent structures.
 276  */
 277 #define SUBGRP_INCR_STAT(subgrp, stat) SUBGRP_INCR_STAT_BY(subgrp, stat, 1)
 278
 279 /*
 280  * Decrement a counter on a subgroup and its parent structures.
 281  */
 282 #define SUBGRP_DECR_STAT(subgrp, stat) SUBGRP_INCR_STAT_BY(subgrp, stat, -1)
 283
 284 typedef int (*updgrp_walkcb)(struct update_group *updgrp, void *ctx);
 285
 286 /* really a private structure */
 287 struct updwalk_context {
 288         struct vty *vty;
 289         struct bgp_dest *dest;
 290         struct bgp_path_info *pi;
 291         uint64_t updgrp_id;
 292         uint64_t subgrp_id;
 293         bgp_policy_type_e policy_type;
 294         const char *policy_name;
 295         int policy_event_start_flag;
 296         int policy_route_update;
 297         updgrp_walkcb cb;
 298         void *context;
 299         uint8_t flags;
 300
 301 #define UPDWALK_FLAGS_ADVQUEUE   (1 << 0)
 302 #define UPDWALK_FLAGS_ADVERTISED (1 << 1)
 303 };
 304
 305 #define UPDWALK_CONTINUE HASHWALK_CONTINUE
 306 #define UPDWALK_ABORT HASHWALK_ABORT
 307
 308 #define PAF_PEER(p)        ((p)->peer)
 309 #define PAF_SUBGRP(p)      ((p)->subgroup)
 310 #define PAF_UPDGRP(p)      ((p)->subgroup->update_group)
 311 #define PAF_PKTQ(f)        SUBGRP_PKTQ((f)->subgroup)
 312
 313 #define UPDGRP_PEER(u)     ((u)->conf)
 314 #define UPDGRP_AFI(u)      ((u)->afi)
 315 #define UPDGRP_SAFI(u)     ((u)->safi)
 316 #define UPDGRP_INST(u)     ((u)->bgp)
 317 #define UPDGRP_AFFLAGS(u) ((u)->conf->af_flags[UPDGRP_AFI(u)][UPDGRP_SAFI(u)])
 318 #define UPDGRP_DBG_ON(u)   ((u)->num_dbg_en_peers)
 319 #define UPDGRP_PEER_DBG_EN(u)  (((u)->num_dbg_en_peers)++)
 320 #define UPDGRP_PEER_DBG_DIS(u) (((u)->num_dbg_en_peers)--)
 321 #define UPDGRP_PEER_DBG_OFF(u) (u)->num_dbg_en_peers = 0
 322
 323 #define SUBGRP_AFI(s)      UPDGRP_AFI((s)->update_group)
 324 #define SUBGRP_SAFI(s)     UPDGRP_SAFI((s)->update_group)
 325 #define SUBGRP_PEER(s)     UPDGRP_PEER((s)->update_group)
 326 #define SUBGRP_PCOUNT(s)   ((s)->peer_count)
 327 #define SUBGRP_PFIRST(s)   LIST_FIRST(&((s)->peers))
 328 #define SUBGRP_PKTQ(s)     &((s)->pkt_queue)
 329 #define SUBGRP_INST(s)     UPDGRP_INST((s)->update_group)
 330 #define SUBGRP_AFFLAGS(s)  UPDGRP_AFFLAGS((s)->update_group)
 331 #define SUBGRP_UPDGRP(s)   ((s)->update_group)
 332
 333 /*
 334  * Walk all subgroups in an update group.
 335  */
 336 #define UPDGRP_FOREACH_SUBGRP(updgrp, subgrp)                                  \
 337         LIST_FOREACH (subgrp, &((updgrp)->subgrps), updgrp_train)
 338
 339 #define UPDGRP_FOREACH_SUBGRP_SAFE(updgrp, subgrp, tmp_subgrp)                 \
 340         LIST_FOREACH_SAFE (subgrp, &((updgrp)->subgrps), updgrp_train,         \
 341                            tmp_subgrp)
 342
 343 #define SUBGRP_FOREACH_PEER(subgrp, paf)                                       \
 344         LIST_FOREACH (paf, &(subgrp->peers), subgrp_train)
 345
 346 #define SUBGRP_FOREACH_PEER_SAFE(subgrp, paf, temp_paf)                        \
 347         LIST_FOREACH_SAFE (paf, &(subgrp->peers), subgrp_train, temp_paf)
 348
 349 #define SUBGRP_FOREACH_ADJ(subgrp, adj)                                        \
 350         TAILQ_FOREACH (adj, &(subgrp->adjq), subgrp_adj_train)
 351
 352 #define SUBGRP_FOREACH_ADJ_SAFE(subgrp, adj, adj_temp)                         \
 353         TAILQ_FOREACH_SAFE (adj, &(subgrp->adjq), subgrp_adj_train, adj_temp)
 354
 355 /* Prototypes.  */
 356 /* bgp_updgrp.c */
 357 extern void update_bgp_group_init(struct bgp *);
 358 extern void udpate_bgp_group_free(struct bgp *);
 359
 360 extern void update_group_show(struct bgp *bgp, afi_t afi, safi_t safi,
 361                               struct vty *vty, uint64_t subgrp_id);
 362 extern void update_group_show_stats(struct bgp *bgp, struct vty *vty);
 363 extern void update_group_adjust_peer(struct peer_af *paf);
 364 extern int update_group_adjust_soloness(struct peer *peer, int set);
 365
 366 extern void update_subgroup_remove_peer(struct update_subgroup *,
 367                                         struct peer_af *);
 368 extern struct bgp_table *update_subgroup_rib(struct update_subgroup *);
 369 extern void update_subgroup_split_peer(struct peer_af *, struct update_group *);
 370 extern bool update_subgroup_check_merge(struct update_subgroup *, const char *);
 371 extern bool update_subgroup_trigger_merge_check(struct update_subgroup *,
 372                                                 int force);
 373 extern void update_group_policy_update(struct bgp *bgp, bgp_policy_type_e ptype,
 374                                        const char *pname, int route_update,
 375                                        int start_event);
 376 extern void update_group_af_walk(struct bgp *bgp, afi_t afi, safi_t safi,
 377                                  updgrp_walkcb cb, void *ctx);
 378 extern void update_group_walk(struct bgp *bgp, updgrp_walkcb cb, void *ctx);
 379 extern void update_group_periodic_merge(struct bgp *bgp);
 380 extern int
 381 update_group_refresh_default_originate_route_map(struct thread *thread);
 382 extern void update_group_start_advtimer(struct bgp *bgp);
 383
 384 extern void update_subgroup_inherit_info(struct update_subgroup *to,
 385                                          struct update_subgroup *from);
 386
 387 /* bgp_updgrp_packet.c */
 388 extern struct bpacket *bpacket_alloc(void);
 389 extern void bpacket_free(struct bpacket *pkt);
 390 extern void bpacket_queue_init(struct bpacket_queue *q);
 391 extern void bpacket_queue_cleanup(struct bpacket_queue *q);
 392 extern void bpacket_queue_sanity_check(struct bpacket_queue *q);
 393 extern struct bpacket *bpacket_queue_add(struct bpacket_queue *q,
 394                                          struct stream *s,
 395                                          struct bpacket_attr_vec_arr *vecarr);
 396 struct bpacket *bpacket_queue_remove(struct bpacket_queue *q);
 397 extern struct bpacket *bpacket_queue_first(struct bpacket_queue *q);
 398 struct bpacket *bpacket_queue_last(struct bpacket_queue *q);
 399 unsigned int bpacket_queue_length(struct bpacket_queue *q);
 400 unsigned int bpacket_queue_hwm_length(struct bpacket_queue *q);
 401 bool bpacket_queue_is_full(struct bgp *bgp, struct bpacket_queue *q);
 402 extern void bpacket_queue_advance_peer(struct peer_af *paf);
 403 extern void bpacket_queue_remove_peer(struct peer_af *paf);
 404 extern void bpacket_add_peer(struct bpacket *pkt, struct peer_af *paf);
 405 unsigned int bpacket_queue_virtual_length(struct peer_af *paf);
 406 extern void bpacket_queue_show_vty(struct bpacket_queue *q, struct vty *vty);
 407 bool subgroup_packets_to_build(struct update_subgroup *subgrp);
 408 extern struct bpacket *subgroup_update_packet(struct update_subgroup *s);
 409 extern struct bpacket *subgroup_withdraw_packet(struct update_subgroup *s);
 410 extern struct stream *bpacket_reformat_for_peer(struct bpacket *pkt,
 411                                                 struct peer_af *paf);
 412 extern void bpacket_attr_vec_arr_reset(struct bpacket_attr_vec_arr *vecarr);
 413 extern void bpacket_attr_vec_arr_set_vec(struct bpacket_attr_vec_arr *vecarr,
 414                                          bpacket_attr_vec_type type,
 415                                          struct stream *s, struct attr *attr);
 416 extern void subgroup_default_update_packet(struct update_subgroup *subgrp,
 417                                            struct attr *attr,
 418                                            struct peer *from);
 419 extern void subgroup_default_withdraw_packet(struct update_subgroup *subgrp);
 420
 421 /* bgp_updgrp_adv.c */
 422 extern struct bgp_advertise *
 423 bgp_advertise_clean_subgroup(struct update_subgroup *subgrp,
 424                              struct bgp_adj_out *adj);
 425 extern void update_group_show_adj_queue(struct bgp *bgp, afi_t afi, safi_t safi,
 426                                         struct vty *vty, uint64_t id);
 427 extern void update_group_show_advertised(struct bgp *bgp, afi_t afi,
 428                                          safi_t safi, struct vty *vty,
 429                                          uint64_t id);
 430 extern void update_group_show_packet_queue(struct bgp *bgp, afi_t afi,
 431                                            safi_t safi, struct vty *vty,
 432                                            uint64_t id);
 433 extern void subgroup_announce_route(struct update_subgroup *subgrp);
 434 extern void subgroup_announce_all(struct update_subgroup *subgrp);
 435
 436 extern void subgroup_default_originate(struct update_subgroup *subgrp,
 437                                        int withdraw);
 438 extern void group_announce_route(struct bgp *bgp, afi_t afi, safi_t safi,
 439                                  struct bgp_dest *dest,
 440                                  struct bgp_path_info *pi);
 441 extern void subgroup_clear_table(struct update_subgroup *subgrp);
 442 extern void update_group_announce(struct bgp *bgp);
 443 extern void update_group_announce_rrclients(struct bgp *bgp);
 444 extern void peer_af_announce_route(struct peer_af *paf, int combine);
 445 extern struct bgp_adj_out *bgp_adj_out_alloc(struct update_subgroup *subgrp,
 446                                              struct bgp_dest *dest,
 447                                              uint32_t addpath_tx_id);
 448 extern void bgp_adj_out_remove_subgroup(struct bgp_dest *dest,
 449                                         struct bgp_adj_out *adj,
 450                                         struct update_subgroup *subgrp);
 451 extern void bgp_adj_out_set_subgroup(struct bgp_dest *dest,
 452                                      struct update_subgroup *subgrp,
 453                                      struct attr *attr,
 454                                      struct bgp_path_info *path);
 455 extern void bgp_adj_out_unset_subgroup(struct bgp_dest *dest,
 456                                        struct update_subgroup *subgrp,
 457                                        char withdraw, uint32_t addpath_tx_id);
 458 void subgroup_announce_table(struct update_subgroup *subgrp,
 459                              struct bgp_table *table);
 460 extern void subgroup_trigger_write(struct update_subgroup *subgrp);
 461
 462 extern int update_group_clear_update_dbg(struct update_group *updgrp,
 463                                          void *arg);
 464
 465 extern void update_bgp_group_free(struct bgp *bgp);
 466 extern int bgp_addpath_encode_tx(struct peer *peer, afi_t afi, safi_t safi);
 467
 468 /*
 469  * Inline functions
 470  */
 471
 472 /*
 473  * bpacket_queue_is_empty
 474  */
 475 static inline int bpacket_queue_is_empty(struct bpacket_queue *queue)
 476 {
 477
 478         /*
 479          * The packet queue is empty if it only contains a sentinel.
 480          */
 481         if (queue->curr_count != 1)
 482                 return 0;
 483
 484         assert(bpacket_queue_first(queue)->buffer == NULL);
 485         return 1;
 486 }
 487
 488 /*
 489  * bpacket_next
 490  *
 491  * Returns the packet after the given packet in a bpacket queue.
 492  */
 493 static inline struct bpacket *bpacket_next(struct bpacket *pkt)
 494 {
 495         return TAILQ_NEXT(pkt, pkt_train);
 496 }
 497
 498 /*
 499  * update_group_adjust_peer_afs
 500  *
 501  * Adjust all peer_af structures for the given peer.
 502  */
 503 static inline void update_group_adjust_peer_afs(struct peer *peer)
 504 {
 505         struct peer_af *paf;
 506         int afidx;
 507
 508         for (afidx = BGP_AF_START; afidx < BGP_AF_MAX; afidx++) {
 509                 paf = peer->peer_af_array[afidx];
 510                 if (paf != NULL)
 511                         update_group_adjust_peer(paf);
 512         }
 513 }
 514
 515 /*
 516  * update_group_remove_peer_afs
 517  *
 518  * Remove all peer_af structures for the given peer from their subgroups.
 519  */
 520 static inline void update_group_remove_peer_afs(struct peer *peer)
 521 {
 522         struct peer_af *paf;
 523         int afidx;
 524
 525         for (afidx = BGP_AF_START; afidx < BGP_AF_MAX; afidx++) {
 526                 paf = peer->peer_af_array[afidx];
 527                 if (paf != NULL)
 528                         update_subgroup_remove_peer(PAF_SUBGRP(paf), paf);
 529         }
 530 }
 531
 532 /*
 533  * update_subgroup_needs_refresh
 534  */
 535 static inline int
 536 update_subgroup_needs_refresh(const struct update_subgroup *subgrp)
 537 {
 538         if (CHECK_FLAG(subgrp->flags, SUBGRP_FLAG_NEEDS_REFRESH))
 539                 return 1;
 540         else
 541                 return 0;
 542 }
 543
 544 /*
 545  * update_subgroup_set_needs_refresh
 546  */
 547 static inline void
 548 update_subgroup_set_needs_refresh(struct update_subgroup *subgrp, int value)
 549 {
 550         if (value)
 551                 SET_FLAG(subgrp->flags, SUBGRP_FLAG_NEEDS_REFRESH);
 552         else
 553                 UNSET_FLAG(subgrp->flags, SUBGRP_FLAG_NEEDS_REFRESH);
 554 }
 555
 556 static inline struct update_subgroup *peer_subgroup(struct peer *peer,
 557                                                     afi_t afi, safi_t safi)
 558 {
 559         struct peer_af *paf;
 560
 561         paf = peer_af_find(peer, afi, safi);
 562         if (paf)
 563                 return PAF_SUBGRP(paf);
 564         return NULL;
 565 }
 566
 567 /*
 568  * update_group_adjust_peer_afs
 569  *
 570  * Adjust all peer_af structures for the given peer.
 571  */
 572 static inline void bgp_announce_peer(struct peer *peer)
 573 {
 574         struct peer_af *paf;
 575         int afidx;
 576
 577         for (afidx = BGP_AF_START; afidx < BGP_AF_MAX; afidx++) {
 578                 paf = peer->peer_af_array[afidx];
 579                 if (paf != NULL)
 580                         subgroup_announce_all(PAF_SUBGRP(paf));
 581         }
 582 }
 583
 584 /**
 585  * advertise_list_is_empty
 586  */
 587 static inline int advertise_list_is_empty(struct update_subgroup *subgrp)
 588 {
 589         if (bgp_adv_fifo_count(&subgrp->sync->update)
 590             || bgp_adv_fifo_count(&subgrp->sync->withdraw)
 591             || bgp_adv_fifo_count(&subgrp->sync->withdraw_low)) {
 592                 return 0;
 593         }
 594
 595         return 1;
 596 }
 597
 598 #endif /* _QUAGGA_BGP_UPDGRP_H */