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         unsigned int conf_max_count;
 113         unsigned int curr_count;
 114         unsigned int hwm_count;
 115         unsigned int max_count_reached_count;
 116 };
 117
 118 struct update_group {
 119         /* back pointer to the BGP instance */
 120         struct bgp *bgp;
 121
 122         /* list of subgroups that belong to the update group */
 123         LIST_HEAD(subgrp_list, update_subgroup) subgrps;
 124
 125         /* lazy way to store configuration common to all peers
 126            hash function will compute from this data */
 127         struct peer *conf;
 128
 129         afi_t afi;
 130         safi_t safi;
 131         int afid;
 132
 133         uint64_t id;
 134         time_t uptime;
 135
 136         uint32_t join_events;
 137         uint32_t prune_events;
 138         uint32_t merge_events;
 139         uint32_t updgrp_switch_events;
 140         uint32_t peer_refreshes_combined;
 141         uint32_t adj_count;
 142         uint32_t split_events;
 143         uint32_t merge_checks_triggered;
 144
 145         uint32_t subgrps_created;
 146         uint32_t subgrps_deleted;
 147
 148         uint32_t num_dbg_en_peers;
 149 };
 150
 151 /*
 152  * Shorthand for a global statistics counter.
 153  */
 154 #define UPDGRP_GLOBAL_STAT(updgrp, stat)                                       \
 155         ((updgrp)->bgp->update_group_stats.stat)
 156
 157 /*
 158  * Add the given value to a counter on an update group and the bgp
 159  * instance.
 160  */
 161 #define UPDGRP_INCR_STAT_BY(updgrp, stat, value)                               \
 162         do {                                                                   \
 163                 (updgrp)->stat += (value);                                     \
 164                 UPDGRP_GLOBAL_STAT(updgrp, stat) += (value);                   \
 165         } while (0)
 166
 167 /*
 168  * Increment a counter on a update group and its parent structures.
 169  */
 170 #define UPDGRP_INCR_STAT(subgrp, stat) UPDGRP_INCR_STAT_BY(subgrp, stat, 1)
 171
 172 struct update_subgroup {
 173         /* back pointer to the parent update group */
 174         struct update_group *update_group;
 175
 176         /* list of peers that belong to the subgroup */
 177         LIST_HEAD(peer_list, peer_af) peers;
 178         int peer_count;
 179
 180         /* for being part of an update group's subgroup list */
 181         LIST_ENTRY(update_subgroup) updgrp_train;
 182
 183         struct bpacket_queue pkt_queue;
 184
 185         /*
 186          * List of adj-out structures for this subgroup.
 187          * It essentially represents the snapshot of every prefix that
 188          * has been advertised to the members of the subgroup
 189          */
 190         TAILQ_HEAD(adjout_queue, bgp_adj_out) adjq;
 191
 192         /* packet buffer for update generation */
 193         struct stream *work;
 194
 195         /* We use a separate stream to encode MP_REACH_NLRI for efficient
 196          * NLRI packing. peer->obuf_work stores all the other attributes. The
 197          * actual packet is then constructed by concatenating the two.
 198          */
 199         struct stream *scratch;
 200
 201         /* synchronization list and time */
 202         struct bgp_synchronize *sync;
 203
 204         /* send prefix count */
 205         uint32_t scount;
 206
 207         /* announcement attribute hash */
 208         struct hash *hash;
 209
 210         struct thread *t_coalesce;
 211         uint32_t v_coalesce;
 212
 213         struct thread *t_merge_check;
 214
 215         /* table version that the subgroup has caught up to. */
 216         uint64_t version;
 217
 218         /* version maintained to record adj changes */
 219         uint64_t adj_version;
 220
 221         time_t uptime;
 222
 223         /*
 224          * Identifying information about the subgroup that this subgroup was
 225          * split
 226          * from, if any.
 227          */
 228         struct {
 229                 uint64_t update_group_id;
 230                 uint64_t subgroup_id;
 231         } split_from;
 232
 233         uint32_t join_events;
 234         uint32_t prune_events;
 235
 236         /*
 237          * This is bumped up when another subgroup merges into this one.
 238          */
 239         uint32_t merge_events;
 240         uint32_t updgrp_switch_events;
 241         uint32_t peer_refreshes_combined;
 242         uint32_t adj_count;
 243         uint32_t split_events;
 244         uint32_t merge_checks_triggered;
 245
 246         uint64_t id;
 247
 248         uint16_t sflags;
 249 #define SUBGRP_STATUS_DEFAULT_ORIGINATE (1 << 0)
 250 #define SUBGRP_STATUS_FORCE_UPDATES (1 << 1)
 251
 252         uint16_t flags;
 253 #define SUBGRP_FLAG_NEEDS_REFRESH (1 << 0)
 254 };
 255
 256 /*
 257  * Add the given value to the specified counter on a subgroup and its
 258  * parent structures.
 259  */
 260 #define SUBGRP_INCR_STAT_BY(subgrp, stat, value)                               \
 261         do {                                                                   \
 262                 (subgrp)->stat += (value);                                     \
 263                 if ((subgrp)->update_group)                                    \
 264                         UPDGRP_INCR_STAT_BY((subgrp)->update_group, stat,      \
 265                                             value);                            \
 266         } while (0)
 267
 268 /*
 269  * Increment a counter on a subgroup and its parent structures.
 270  */
 271 #define SUBGRP_INCR_STAT(subgrp, stat) SUBGRP_INCR_STAT_BY(subgrp, stat, 1)
 272
 273 /*
 274  * Decrement a counter on a subgroup and its parent structures.
 275  */
 276 #define SUBGRP_DECR_STAT(subgrp, stat) SUBGRP_INCR_STAT_BY(subgrp, stat, -1)
 277
 278 typedef int (*updgrp_walkcb)(struct update_group *updgrp, void *ctx);
 279
 280 /* really a private structure */
 281 struct updwalk_context {
 282         struct vty *vty;
 283         struct bgp_dest *dest;
 284         struct bgp_path_info *pi;
 285         uint64_t updgrp_id;
 286         uint64_t subgrp_id;
 287         bgp_policy_type_e policy_type;
 288         const char *policy_name;
 289         int policy_event_start_flag;
 290         int policy_route_update;
 291         updgrp_walkcb cb;
 292         void *context;
 293         uint8_t flags;
 294
 295 #define UPDWALK_FLAGS_ADVQUEUE   (1 << 0)
 296 #define UPDWALK_FLAGS_ADVERTISED (1 << 1)
 297 };
 298
 299 #define UPDWALK_CONTINUE HASHWALK_CONTINUE
 300 #define UPDWALK_ABORT HASHWALK_ABORT
 301
 302 #define PAF_PEER(p)        ((p)->peer)
 303 #define PAF_SUBGRP(p)      ((p)->subgroup)
 304 #define PAF_UPDGRP(p)      ((p)->subgroup->update_group)
 305 #define PAF_PKTQ(f)        SUBGRP_PKTQ((f)->subgroup)
 306
 307 #define UPDGRP_PEER(u)     ((u)->conf)
 308 #define UPDGRP_AFI(u)      ((u)->afi)
 309 #define UPDGRP_SAFI(u)     ((u)->safi)
 310 #define UPDGRP_INST(u)     ((u)->bgp)
 311 #define UPDGRP_AFFLAGS(u) ((u)->conf->af_flags[UPDGRP_AFI(u)][UPDGRP_SAFI(u)])
 312 #define UPDGRP_DBG_ON(u)   ((u)->num_dbg_en_peers)
 313 #define UPDGRP_PEER_DBG_EN(u)  (((u)->num_dbg_en_peers)++)
 314 #define UPDGRP_PEER_DBG_DIS(u) (((u)->num_dbg_en_peers)--)
 315 #define UPDGRP_PEER_DBG_OFF(u) (u)->num_dbg_en_peers = 0
 316
 317 #define SUBGRP_AFI(s)      UPDGRP_AFI((s)->update_group)
 318 #define SUBGRP_SAFI(s)     UPDGRP_SAFI((s)->update_group)
 319 #define SUBGRP_PEER(s)     UPDGRP_PEER((s)->update_group)
 320 #define SUBGRP_PCOUNT(s)   ((s)->peer_count)
 321 #define SUBGRP_PFIRST(s)   LIST_FIRST(&((s)->peers))
 322 #define SUBGRP_PKTQ(s)     &((s)->pkt_queue)
 323 #define SUBGRP_INST(s)     UPDGRP_INST((s)->update_group)
 324 #define SUBGRP_AFFLAGS(s)  UPDGRP_AFFLAGS((s)->update_group)
 325 #define SUBGRP_UPDGRP(s)   ((s)->update_group)
 326
 327 /*
 328  * Walk all subgroups in an update group.
 329  */
 330 #define UPDGRP_FOREACH_SUBGRP(updgrp, subgrp)                                  \
 331         LIST_FOREACH (subgrp, &((updgrp)->subgrps), updgrp_train)
 332
 333 #define UPDGRP_FOREACH_SUBGRP_SAFE(updgrp, subgrp, tmp_subgrp)                 \
 334         LIST_FOREACH_SAFE (subgrp, &((updgrp)->subgrps), updgrp_train,         \
 335                            tmp_subgrp)
 336
 337 #define SUBGRP_FOREACH_PEER(subgrp, paf)                                       \
 338         LIST_FOREACH (paf, &(subgrp->peers), subgrp_train)
 339
 340 #define SUBGRP_FOREACH_PEER_SAFE(subgrp, paf, temp_paf)                        \
 341         LIST_FOREACH_SAFE (paf, &(subgrp->peers), subgrp_train, temp_paf)
 342
 343 #define SUBGRP_FOREACH_ADJ(subgrp, adj)                                        \
 344         TAILQ_FOREACH (adj, &(subgrp->adjq), subgrp_adj_train)
 345
 346 #define SUBGRP_FOREACH_ADJ_SAFE(subgrp, adj, adj_temp)                         \
 347         TAILQ_FOREACH_SAFE (adj, &(subgrp->adjq), subgrp_adj_train, adj_temp)
 348
 349 /* Prototypes.  */
 350 /* bgp_updgrp.c */
 351 extern void update_bgp_group_init(struct bgp *);
 352 extern void udpate_bgp_group_free(struct bgp *);
 353
 354 extern void update_group_show(struct bgp *bgp, afi_t afi, safi_t safi,
 355                               struct vty *vty, uint64_t subgrp_id);
 356 extern void update_group_show_stats(struct bgp *bgp, struct vty *vty);
 357 extern void update_group_adjust_peer(struct peer_af *paf);
 358 extern int update_group_adjust_soloness(struct peer *peer, int set);
 359
 360 extern void update_subgroup_remove_peer(struct update_subgroup *,
 361                                         struct peer_af *);
 362 extern struct bgp_table *update_subgroup_rib(struct update_subgroup *);
 363 extern void update_subgroup_split_peer(struct peer_af *, struct update_group *);
 364 extern bool update_subgroup_check_merge(struct update_subgroup *, const char *);
 365 extern bool update_subgroup_trigger_merge_check(struct update_subgroup *,
 366                                                 int force);
 367 extern void update_group_policy_update(struct bgp *bgp, bgp_policy_type_e ptype,
 368                                        const char *pname, int route_update,
 369                                        int start_event);
 370 extern void update_group_af_walk(struct bgp *bgp, afi_t afi, safi_t safi,
 371                                  updgrp_walkcb cb, void *ctx);
 372 extern void update_group_walk(struct bgp *bgp, updgrp_walkcb cb, void *ctx);
 373 extern void update_group_periodic_merge(struct bgp *bgp);
 374 extern int
 375 update_group_refresh_default_originate_route_map(struct thread *thread);
 376 extern void update_group_start_advtimer(struct bgp *bgp);
 377
 378 extern void update_subgroup_inherit_info(struct update_subgroup *to,
 379                                          struct update_subgroup *from);
 380
 381 /* bgp_updgrp_packet.c */
 382 extern struct bpacket *bpacket_alloc(void);
 383 extern void bpacket_free(struct bpacket *pkt);
 384 extern void bpacket_queue_init(struct bpacket_queue *q);
 385 extern void bpacket_queue_cleanup(struct bpacket_queue *q);
 386 extern void bpacket_queue_sanity_check(struct bpacket_queue *q);
 387 extern struct bpacket *bpacket_queue_add(struct bpacket_queue *q,
 388                                          struct stream *s,
 389                                          struct bpacket_attr_vec_arr *vecarr);
 390 struct bpacket *bpacket_queue_remove(struct bpacket_queue *q);
 391 extern struct bpacket *bpacket_queue_first(struct bpacket_queue *q);
 392 struct bpacket *bpacket_queue_last(struct bpacket_queue *q);
 393 unsigned int bpacket_queue_length(struct bpacket_queue *q);
 394 unsigned int bpacket_queue_hwm_length(struct bpacket_queue *q);
 395 bool bpacket_queue_is_full(struct bgp *bgp, struct bpacket_queue *q);
 396 extern void bpacket_queue_advance_peer(struct peer_af *paf);
 397 extern void bpacket_queue_remove_peer(struct peer_af *paf);
 398 extern void bpacket_add_peer(struct bpacket *pkt, struct peer_af *paf);
 399 unsigned int bpacket_queue_virtual_length(struct peer_af *paf);
 400 extern void bpacket_queue_show_vty(struct bpacket_queue *q, struct vty *vty);
 401 bool subgroup_packets_to_build(struct update_subgroup *subgrp);
 402 extern struct bpacket *subgroup_update_packet(struct update_subgroup *s);
 403 extern struct bpacket *subgroup_withdraw_packet(struct update_subgroup *s);
 404 extern struct stream *bpacket_reformat_for_peer(struct bpacket *pkt,
 405                                                 struct peer_af *paf);
 406 extern void bpacket_attr_vec_arr_reset(struct bpacket_attr_vec_arr *vecarr);
 407 extern void bpacket_attr_vec_arr_set_vec(struct bpacket_attr_vec_arr *vecarr,
 408                                          bpacket_attr_vec_type type,
 409                                          struct stream *s, struct attr *attr);
 410 extern void subgroup_default_update_packet(struct update_subgroup *subgrp,
 411                                            struct attr *attr,
 412                                            struct peer *from);
 413 extern void subgroup_default_withdraw_packet(struct update_subgroup *subgrp);
 414
 415 /* bgp_updgrp_adv.c */
 416 extern struct bgp_advertise *
 417 bgp_advertise_clean_subgroup(struct update_subgroup *subgrp,
 418                              struct bgp_adj_out *adj);
 419 extern void update_group_show_adj_queue(struct bgp *bgp, afi_t afi, safi_t safi,
 420                                         struct vty *vty, uint64_t id);
 421 extern void update_group_show_advertised(struct bgp *bgp, afi_t afi,
 422                                          safi_t safi, struct vty *vty,
 423                                          uint64_t id);
 424 extern void update_group_show_packet_queue(struct bgp *bgp, afi_t afi,
 425                                            safi_t safi, struct vty *vty,
 426                                            uint64_t id);
 427 extern void subgroup_announce_route(struct update_subgroup *subgrp);
 428 extern void subgroup_announce_all(struct update_subgroup *subgrp);
 429
 430 extern void subgroup_default_originate(struct update_subgroup *subgrp,
 431                                        int withdraw);
 432 extern void group_announce_route(struct bgp *bgp, afi_t afi, safi_t safi,
 433                                  struct bgp_dest *dest,
 434                                  struct bgp_path_info *pi);
 435 extern void subgroup_clear_table(struct update_subgroup *subgrp);
 436 extern void update_group_announce(struct bgp *bgp);
 437 extern void update_group_announce_rrclients(struct bgp *bgp);
 438 extern void peer_af_announce_route(struct peer_af *paf, int combine);
 439 extern struct bgp_adj_out *bgp_adj_out_alloc(struct update_subgroup *subgrp,
 440                                              struct bgp_dest *dest,
 441                                              uint32_t addpath_tx_id);
 442 extern void bgp_adj_out_remove_subgroup(struct bgp_dest *dest,
 443                                         struct bgp_adj_out *adj,
 444                                         struct update_subgroup *subgrp);
 445 extern void bgp_adj_out_set_subgroup(struct bgp_dest *dest,
 446                                      struct update_subgroup *subgrp,
 447                                      struct attr *attr,
 448                                      struct bgp_path_info *path);
 449 extern void bgp_adj_out_unset_subgroup(struct bgp_dest *dest,
 450                                        struct update_subgroup *subgrp,
 451                                        char withdraw, uint32_t addpath_tx_id);
 452 void subgroup_announce_table(struct update_subgroup *subgrp,
 453                              struct bgp_table *table);
 454 extern void subgroup_trigger_write(struct update_subgroup *subgrp);
 455
 456 extern int update_group_clear_update_dbg(struct update_group *updgrp,
 457                                          void *arg);
 458
 459 extern void update_bgp_group_free(struct bgp *bgp);
 460 extern int bgp_addpath_encode_tx(struct peer *peer, afi_t afi, safi_t safi);
 461
 462 /*
 463  * Inline functions
 464  */
 465
 466 /*
 467  * bpacket_queue_is_empty
 468  */
 469 static inline int bpacket_queue_is_empty(struct bpacket_queue *queue)
 470 {
 471
 472         /*
 473          * The packet queue is empty if it only contains a sentinel.
 474          */
 475         if (queue->curr_count != 1)
 476                 return 0;
 477
 478         assert(bpacket_queue_first(queue)->buffer == NULL);
 479         return 1;
 480 }
 481
 482 /*
 483  * bpacket_next
 484  *
 485  * Returns the packet after the given packet in a bpacket queue.
 486  */
 487 static inline struct bpacket *bpacket_next(struct bpacket *pkt)
 488 {
 489         return TAILQ_NEXT(pkt, pkt_train);
 490 }
 491
 492 /*
 493  * update_group_adjust_peer_afs
 494  *
 495  * Adjust all peer_af structures for the given peer.
 496  */
 497 static inline void update_group_adjust_peer_afs(struct peer *peer)
 498 {
 499         struct peer_af *paf;
 500         int afidx;
 501
 502         for (afidx = BGP_AF_START; afidx < BGP_AF_MAX; afidx++) {
 503                 paf = peer->peer_af_array[afidx];
 504                 if (paf != NULL)
 505                         update_group_adjust_peer(paf);
 506         }
 507 }
 508
 509 /*
 510  * update_group_remove_peer_afs
 511  *
 512  * Remove all peer_af structures for the given peer from their subgroups.
 513  */
 514 static inline void update_group_remove_peer_afs(struct peer *peer)
 515 {
 516         struct peer_af *paf;
 517         int afidx;
 518
 519         for (afidx = BGP_AF_START; afidx < BGP_AF_MAX; afidx++) {
 520                 paf = peer->peer_af_array[afidx];
 521                 if (paf != NULL)
 522                         update_subgroup_remove_peer(PAF_SUBGRP(paf), paf);
 523         }
 524 }
 525
 526 /*
 527  * update_subgroup_needs_refresh
 528  */
 529 static inline int
 530 update_subgroup_needs_refresh(const struct update_subgroup *subgrp)
 531 {
 532         if (CHECK_FLAG(subgrp->flags, SUBGRP_FLAG_NEEDS_REFRESH))
 533                 return 1;
 534         else
 535                 return 0;
 536 }
 537
 538 /*
 539  * update_subgroup_set_needs_refresh
 540  */
 541 static inline void
 542 update_subgroup_set_needs_refresh(struct update_subgroup *subgrp, int value)
 543 {
 544         if (value)
 545                 SET_FLAG(subgrp->flags, SUBGRP_FLAG_NEEDS_REFRESH);
 546         else
 547                 UNSET_FLAG(subgrp->flags, SUBGRP_FLAG_NEEDS_REFRESH);
 548 }
 549
 550 static inline struct update_subgroup *peer_subgroup(struct peer *peer,
 551                                                     afi_t afi, safi_t safi)
 552 {
 553         struct peer_af *paf;
 554
 555         paf = peer_af_find(peer, afi, safi);
 556         if (paf)
 557                 return PAF_SUBGRP(paf);
 558         return NULL;
 559 }
 560
 561 /*
 562  * update_group_adjust_peer_afs
 563  *
 564  * Adjust all peer_af structures for the given peer.
 565  */
 566 static inline void bgp_announce_peer(struct peer *peer)
 567 {
 568         struct peer_af *paf;
 569         int afidx;
 570
 571         for (afidx = BGP_AF_START; afidx < BGP_AF_MAX; afidx++) {
 572                 paf = peer->peer_af_array[afidx];
 573                 if (paf != NULL)
 574                         subgroup_announce_all(PAF_SUBGRP(paf));
 575         }
 576 }
 577
 578 /**
 579  * advertise_list_is_empty
 580  */
 581 static inline int advertise_list_is_empty(struct update_subgroup *subgrp)
 582 {
 583         if (bgp_adv_fifo_count(&subgrp->sync->update)
 584             || bgp_adv_fifo_count(&subgrp->sync->withdraw)
 585             || bgp_adv_fifo_count(&subgrp->sync->withdraw_low)) {
 586                 return 0;
 587         }
 588
 589         return 1;
 590 }
 591
 592 #endif /* _QUAGGA_BGP_UPDGRP_H */