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 enum bpacket_attr_vec_type { BGP_ATTR_VEC_NH = 0, BGP_ATTR_VEC_MAX };
  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         /* send prefix count prior to packet update */
 208         uint32_t pscount;
 209
 210         /* announcement attribute hash */
 211         struct hash *hash;
 212
 213         struct thread *t_coalesce;
 214         uint32_t v_coalesce;
 215
 216         struct thread *t_merge_check;
 217
 218         /* table version that the subgroup has caught up to. */
 219         uint64_t version;
 220
 221         /* version maintained to record adj changes */
 222         uint64_t adj_version;
 223
 224         time_t uptime;
 225
 226         /*
 227          * Identifying information about the subgroup that this subgroup was
 228          * split
 229          * from, if any.
 230          */
 231         struct {
 232                 uint64_t update_group_id;
 233                 uint64_t subgroup_id;
 234         } split_from;
 235
 236         uint32_t join_events;
 237         uint32_t prune_events;
 238
 239         /*
 240          * This is bumped up when another subgroup merges into this one.
 241          */
 242         uint32_t merge_events;
 243         uint32_t updgrp_switch_events;
 244         uint32_t peer_refreshes_combined;
 245         uint32_t adj_count;
 246         uint32_t split_events;
 247         uint32_t merge_checks_triggered;
 248
 249         uint64_t id;
 250
 251         uint16_t sflags;
 252 #define SUBGRP_STATUS_DEFAULT_ORIGINATE (1 << 0)
 253 #define SUBGRP_STATUS_FORCE_UPDATES (1 << 1)
 254 #define SUBGRP_STATUS_TABLE_REPARSING (1 << 2)
 255 /*
 256  * This flag has been added to ensure that the SNT counters
 257  * gets incremented and decremented only during the creation
 258  * and deletion workflows of default originate,
 259  * not during the update workflow.
 260  */
 261 #define SUBGRP_STATUS_PEER_DEFAULT_ORIGINATED (1 << 3)
 262
 263         uint16_t flags;
 264 #define SUBGRP_FLAG_NEEDS_REFRESH (1 << 0)
 265 };
 266
 267 /*
 268  * Add the given value to the specified counter on a subgroup and its
 269  * parent structures.
 270  */
 271 #define SUBGRP_INCR_STAT_BY(subgrp, stat, value)                               \
 272         do {                                                                   \
 273                 (subgrp)->stat += (value);                                     \
 274                 if ((subgrp)->update_group)                                    \
 275                         UPDGRP_INCR_STAT_BY((subgrp)->update_group, stat,      \
 276                                             value);                            \
 277         } while (0)
 278
 279 /*
 280  * Increment a counter on a subgroup and its parent structures.
 281  */
 282 #define SUBGRP_INCR_STAT(subgrp, stat) SUBGRP_INCR_STAT_BY(subgrp, stat, 1)
 283
 284 /*
 285  * Decrement a counter on a subgroup and its parent structures.
 286  */
 287 #define SUBGRP_DECR_STAT(subgrp, stat) SUBGRP_INCR_STAT_BY(subgrp, stat, -1)
 288
 289 typedef int (*updgrp_walkcb)(struct update_group *updgrp, void *ctx);
 290
 291 /* really a private structure */
 292 struct updwalk_context {
 293         struct vty *vty;
 294         struct bgp_dest *dest;
 295         struct bgp_path_info *pi;
 296         uint64_t updgrp_id;
 297         uint64_t subgrp_id;
 298         enum bgp_policy_type policy_type;
 299         const char *policy_name;
 300         int policy_event_start_flag;
 301         bool policy_route_update;
 302         updgrp_walkcb cb;
 303         void *context;
 304         uint8_t flags;
 305
 306 #define UPDWALK_FLAGS_ADVQUEUE   (1 << 0)
 307 #define UPDWALK_FLAGS_ADVERTISED (1 << 1)
 308 };
 309
 310 #define UPDWALK_CONTINUE HASHWALK_CONTINUE
 311 #define UPDWALK_ABORT HASHWALK_ABORT
 312
 313 #define PAF_PEER(p)        ((p)->peer)
 314 #define PAF_SUBGRP(p)      ((p)->subgroup)
 315 #define PAF_UPDGRP(p)      ((p)->subgroup->update_group)
 316 #define PAF_PKTQ(f)        SUBGRP_PKTQ((f)->subgroup)
 317
 318 #define UPDGRP_PEER(u)     ((u)->conf)
 319 #define UPDGRP_AFI(u)      ((u)->afi)
 320 #define UPDGRP_SAFI(u)     ((u)->safi)
 321 #define UPDGRP_INST(u)     ((u)->bgp)
 322 #define UPDGRP_AFFLAGS(u) ((u)->conf->af_flags[UPDGRP_AFI(u)][UPDGRP_SAFI(u)])
 323 #define UPDGRP_DBG_ON(u)   ((u)->num_dbg_en_peers)
 324 #define UPDGRP_PEER_DBG_EN(u)  (((u)->num_dbg_en_peers)++)
 325 #define UPDGRP_PEER_DBG_DIS(u) (((u)->num_dbg_en_peers)--)
 326 #define UPDGRP_PEER_DBG_OFF(u) (u)->num_dbg_en_peers = 0
 327
 328 #define SUBGRP_AFI(s)      UPDGRP_AFI((s)->update_group)
 329 #define SUBGRP_SAFI(s)     UPDGRP_SAFI((s)->update_group)
 330 #define SUBGRP_PEER(s)     UPDGRP_PEER((s)->update_group)
 331 #define SUBGRP_PCOUNT(s)   ((s)->peer_count)
 332 #define SUBGRP_PFIRST(s)   LIST_FIRST(&((s)->peers))
 333 #define SUBGRP_PKTQ(s)     &((s)->pkt_queue)
 334 #define SUBGRP_INST(s)     UPDGRP_INST((s)->update_group)
 335 #define SUBGRP_AFFLAGS(s)  UPDGRP_AFFLAGS((s)->update_group)
 336 #define SUBGRP_UPDGRP(s)   ((s)->update_group)
 337
 338 /*
 339  * Walk all subgroups in an update group.
 340  */
 341 #define UPDGRP_FOREACH_SUBGRP(updgrp, subgrp)                                  \
 342         LIST_FOREACH (subgrp, &((updgrp)->subgrps), updgrp_train)
 343
 344 #define UPDGRP_FOREACH_SUBGRP_SAFE(updgrp, subgrp, tmp_subgrp)                 \
 345         LIST_FOREACH_SAFE (subgrp, &((updgrp)->subgrps), updgrp_train,         \
 346                            tmp_subgrp)
 347
 348 #define SUBGRP_FOREACH_PEER(subgrp, paf)                                       \
 349         LIST_FOREACH (paf, &(subgrp->peers), subgrp_train)
 350
 351 #define SUBGRP_FOREACH_PEER_SAFE(subgrp, paf, temp_paf)                        \
 352         LIST_FOREACH_SAFE (paf, &(subgrp->peers), subgrp_train, temp_paf)
 353
 354 #define SUBGRP_FOREACH_ADJ(subgrp, adj)                                        \
 355         TAILQ_FOREACH (adj, &(subgrp->adjq), subgrp_adj_train)
 356
 357 #define SUBGRP_FOREACH_ADJ_SAFE(subgrp, adj, adj_temp)                         \
 358         TAILQ_FOREACH_SAFE (adj, &(subgrp->adjq), subgrp_adj_train, adj_temp)
 359
 360 /* Prototypes.  */
 361 /* bgp_updgrp.c */
 362 extern void update_bgp_group_init(struct bgp *);
 363 extern void udpate_bgp_group_free(struct bgp *);
 364
 365 extern void update_group_show(struct bgp *bgp, afi_t afi, safi_t safi,
 366                               struct vty *vty, uint64_t subgrp_id);
 367 extern void update_group_show_stats(struct bgp *bgp, struct vty *vty);
 368 extern void update_group_adjust_peer(struct peer_af *paf);
 369 extern int update_group_adjust_soloness(struct peer *peer, int set);
 370
 371 extern void update_subgroup_remove_peer(struct update_subgroup *,
 372                                         struct peer_af *);
 373 extern struct bgp_table *update_subgroup_rib(struct update_subgroup *);
 374 extern void update_subgroup_split_peer(struct peer_af *, struct update_group *);
 375 extern bool update_subgroup_check_merge(struct update_subgroup *, const char *);
 376 extern bool update_subgroup_trigger_merge_check(struct update_subgroup *,
 377                                                 int force);
 378 extern void update_group_policy_update(struct bgp *bgp,
 379                                        enum bgp_policy_type ptype,
 380                                        const char *pname, bool route_update,
 381                                        int start_event);
 382 extern void update_group_af_walk(struct bgp *bgp, afi_t afi, safi_t safi,
 383                                  updgrp_walkcb cb, void *ctx);
 384 extern void update_group_walk(struct bgp *bgp, updgrp_walkcb cb, void *ctx);
 385 extern void update_group_periodic_merge(struct bgp *bgp);
 386 extern void
 387 update_group_refresh_default_originate_route_map(struct thread *thread);
 388 extern void update_group_start_advtimer(struct bgp *bgp);
 389
 390 extern void update_subgroup_inherit_info(struct update_subgroup *to,
 391                                          struct update_subgroup *from);
 392
 393 /* bgp_updgrp_packet.c */
 394 extern struct bpacket *bpacket_alloc(void);
 395 extern void bpacket_free(struct bpacket *pkt);
 396 extern void bpacket_queue_init(struct bpacket_queue *q);
 397 extern void bpacket_queue_cleanup(struct bpacket_queue *q);
 398 extern void bpacket_queue_sanity_check(struct bpacket_queue *q);
 399 extern struct bpacket *bpacket_queue_add(struct bpacket_queue *q,
 400                                          struct stream *s,
 401                                          struct bpacket_attr_vec_arr *vecarr);
 402 struct bpacket *bpacket_queue_remove(struct bpacket_queue *q);
 403 extern struct bpacket *bpacket_queue_first(struct bpacket_queue *q);
 404 struct bpacket *bpacket_queue_last(struct bpacket_queue *q);
 405 unsigned int bpacket_queue_length(struct bpacket_queue *q);
 406 unsigned int bpacket_queue_hwm_length(struct bpacket_queue *q);
 407 bool bpacket_queue_is_full(struct bgp *bgp, struct bpacket_queue *q);
 408 extern void bpacket_queue_advance_peer(struct peer_af *paf);
 409 extern void bpacket_queue_remove_peer(struct peer_af *paf);
 410 extern void bpacket_add_peer(struct bpacket *pkt, struct peer_af *paf);
 411 unsigned int bpacket_queue_virtual_length(struct peer_af *paf);
 412 extern void bpacket_queue_show_vty(struct bpacket_queue *q, struct vty *vty);
 413 bool subgroup_packets_to_build(struct update_subgroup *subgrp);
 414 extern struct bpacket *subgroup_update_packet(struct update_subgroup *s);
 415 extern struct bpacket *subgroup_withdraw_packet(struct update_subgroup *s);
 416 extern struct stream *bpacket_reformat_for_peer(struct bpacket *pkt,
 417                                                 struct peer_af *paf);
 418 extern void bpacket_attr_vec_arr_reset(struct bpacket_attr_vec_arr *vecarr);
 419 extern void bpacket_attr_vec_arr_set_vec(struct bpacket_attr_vec_arr *vecarr,
 420                                          enum bpacket_attr_vec_type type,
 421                                          struct stream *s, struct attr *attr);
 422 extern void subgroup_default_update_packet(struct update_subgroup *subgrp,
 423                                            struct attr *attr,
 424                                            struct peer *from);
 425 extern void subgroup_default_withdraw_packet(struct update_subgroup *subgrp);
 426
 427 /* bgp_updgrp_adv.c */
 428 extern struct bgp_advertise *
 429 bgp_advertise_clean_subgroup(struct update_subgroup *subgrp,
 430                              struct bgp_adj_out *adj);
 431 extern void update_group_show_adj_queue(struct bgp *bgp, afi_t afi, safi_t safi,
 432                                         struct vty *vty, uint64_t id);
 433 extern void update_group_show_advertised(struct bgp *bgp, afi_t afi,
 434                                          safi_t safi, struct vty *vty,
 435                                          uint64_t id);
 436 extern void update_group_show_packet_queue(struct bgp *bgp, afi_t afi,
 437                                            safi_t safi, struct vty *vty,
 438                                            uint64_t id);
 439 extern void subgroup_announce_route(struct update_subgroup *subgrp);
 440 extern void subgroup_announce_all(struct update_subgroup *subgrp);
 441
 442 extern void subgroup_default_originate(struct update_subgroup *subgrp,
 443                                        int withdraw);
 444 extern void group_announce_route(struct bgp *bgp, afi_t afi, safi_t safi,
 445                                  struct bgp_dest *dest,
 446                                  struct bgp_path_info *pi);
 447 extern void subgroup_clear_table(struct update_subgroup *subgrp);
 448 extern void update_group_announce(struct bgp *bgp);
 449 extern void update_group_announce_rrclients(struct bgp *bgp);
 450 extern void peer_af_announce_route(struct peer_af *paf, int combine);
 451 extern struct bgp_adj_out *bgp_adj_out_alloc(struct update_subgroup *subgrp,
 452                                              struct bgp_dest *dest,
 453                                              uint32_t addpath_tx_id);
 454 extern void bgp_adj_out_remove_subgroup(struct bgp_dest *dest,
 455                                         struct bgp_adj_out *adj,
 456                                         struct update_subgroup *subgrp);
 457 extern void bgp_adj_out_set_subgroup(struct bgp_dest *dest,
 458                                      struct update_subgroup *subgrp,
 459                                      struct attr *attr,
 460                                      struct bgp_path_info *path);
 461 extern void bgp_adj_out_unset_subgroup(struct bgp_dest *dest,
 462                                        struct update_subgroup *subgrp,
 463                                        char withdraw, uint32_t addpath_tx_id);
 464 void subgroup_announce_table(struct update_subgroup *subgrp,
 465                              struct bgp_table *table);
 466 extern void subgroup_trigger_write(struct update_subgroup *subgrp);
 467
 468 extern int update_group_clear_update_dbg(struct update_group *updgrp,
 469                                          void *arg);
 470
 471 extern void update_bgp_group_free(struct bgp *bgp);
 472 extern bool bgp_addpath_encode_tx(struct peer *peer, afi_t afi, safi_t safi);
 473 extern bool bgp_check_selected(struct bgp_path_info *bpi, struct peer *peer,
 474                                bool addpath_capable, afi_t afi, safi_t safi);
 475
 476 /*
 477  * Inline functions
 478  */
 479
 480 /*
 481  * bpacket_queue_is_empty
 482  */
 483 static inline int bpacket_queue_is_empty(struct bpacket_queue *queue)
 484 {
 485
 486         /*
 487          * The packet queue is empty if it only contains a sentinel.
 488          */
 489         if (queue->curr_count != 1)
 490                 return 0;
 491
 492         assert(bpacket_queue_first(queue)->buffer == NULL);
 493         return 1;
 494 }
 495
 496 /*
 497  * bpacket_next
 498  *
 499  * Returns the packet after the given packet in a bpacket queue.
 500  */
 501 static inline struct bpacket *bpacket_next(struct bpacket *pkt)
 502 {
 503         return TAILQ_NEXT(pkt, pkt_train);
 504 }
 505
 506 /*
 507  * update_group_adjust_peer_afs
 508  *
 509  * Adjust all peer_af structures for the given peer.
 510  */
 511 static inline void update_group_adjust_peer_afs(struct peer *peer)
 512 {
 513         struct peer_af *paf;
 514         int afidx;
 515
 516         for (afidx = BGP_AF_START; afidx < BGP_AF_MAX; afidx++) {
 517                 paf = peer->peer_af_array[afidx];
 518                 if (paf != NULL)
 519                         update_group_adjust_peer(paf);
 520         }
 521 }
 522
 523 /*
 524  * update_group_remove_peer_afs
 525  *
 526  * Remove all peer_af structures for the given peer from their subgroups.
 527  */
 528 static inline void update_group_remove_peer_afs(struct peer *peer)
 529 {
 530         struct peer_af *paf;
 531         int afidx;
 532
 533         for (afidx = BGP_AF_START; afidx < BGP_AF_MAX; afidx++) {
 534                 paf = peer->peer_af_array[afidx];
 535                 if (paf != NULL)
 536                         update_subgroup_remove_peer(PAF_SUBGRP(paf), paf);
 537         }
 538 }
 539
 540 /*
 541  * update_subgroup_needs_refresh
 542  */
 543 static inline int
 544 update_subgroup_needs_refresh(const struct update_subgroup *subgrp)
 545 {
 546         if (CHECK_FLAG(subgrp->flags, SUBGRP_FLAG_NEEDS_REFRESH))
 547                 return 1;
 548         else
 549                 return 0;
 550 }
 551
 552 /*
 553  * update_subgroup_set_needs_refresh
 554  */
 555 static inline void
 556 update_subgroup_set_needs_refresh(struct update_subgroup *subgrp, int value)
 557 {
 558         if (value)
 559                 SET_FLAG(subgrp->flags, SUBGRP_FLAG_NEEDS_REFRESH);
 560         else
 561                 UNSET_FLAG(subgrp->flags, SUBGRP_FLAG_NEEDS_REFRESH);
 562 }
 563
 564 static inline struct update_subgroup *peer_subgroup(struct peer *peer,
 565                                                     afi_t afi, safi_t safi)
 566 {
 567         struct peer_af *paf;
 568
 569         paf = peer_af_find(peer, afi, safi);
 570         if (paf)
 571                 return PAF_SUBGRP(paf);
 572         return NULL;
 573 }
 574
 575 /*
 576  * update_group_adjust_peer_afs
 577  *
 578  * Adjust all peer_af structures for the given peer.
 579  */
 580 static inline void bgp_announce_peer(struct peer *peer)
 581 {
 582         struct peer_af *paf;
 583         int afidx;
 584
 585         for (afidx = BGP_AF_START; afidx < BGP_AF_MAX; afidx++) {
 586                 paf = peer->peer_af_array[afidx];
 587                 if (paf != NULL)
 588                         subgroup_announce_all(PAF_SUBGRP(paf));
 589         }
 590 }
 591
 592 /**
 593  * advertise_list_is_empty
 594  */
 595 static inline int advertise_list_is_empty(struct update_subgroup *subgrp)
 596 {
 597         if (bgp_adv_fifo_count(&subgrp->sync->update)
 598             || bgp_adv_fifo_count(&subgrp->sync->withdraw)
 599             || bgp_adv_fifo_count(&subgrp->sync->withdraw_low)) {
 600                 return 0;
 601         }
 602
 603         return 1;
 604 }
 605
 606 #endif /* _QUAGGA_BGP_UPDGRP_H */