bgpd/bgp_advertise.h

   1 /* BGP advertisement and adjacency
   2  * Copyright (C) 1996, 97, 98, 99, 2000 Kunihiro Ishiguro
   3  *
   4  * This file is part of GNU Zebra.
   5  *
   6  * GNU Zebra is free software; you can redistribute it and/or modify it
   7  * under the terms of the GNU General Public License as published by the
   8  * Free Software Foundation; either version 2, or (at your option) any
   9  * later version.
  10  *
  11  * GNU Zebra is distributed in the hope that it will be useful, but
  12  * WITHOUT ANY WARRANTY; without even the implied warranty of
  13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14  * General Public License for more details.
  15  *
  16  * You should have received a copy of the GNU General Public License along
  17  * with this program; see the file COPYING; if not, write to the Free Software
  18  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  19  */
  20
  21 #ifndef _QUAGGA_BGP_ADVERTISE_H
  22 #define _QUAGGA_BGP_ADVERTISE_H
  23
  24 #include <lib/fifo.h>
  25
  26 struct update_subgroup;
  27
  28 /* BGP advertise FIFO.  */
  29 struct bgp_advertise_fifo {
  30         struct bgp_advertise *next;
  31         struct bgp_advertise *prev;
  32         uint32_t count;
  33 };
  34
  35 /* BGP advertise attribute.  */
  36 struct bgp_advertise_attr {
  37         /* Head of advertisement pointer. */
  38         struct bgp_advertise *adv;
  39
  40         /* Reference counter.  */
  41         unsigned long refcnt;
  42
  43         /* Attribute pointer to be announced.  */
  44         struct attr *attr;
  45 };
  46
  47 struct bgp_advertise {
  48         /* FIFO for advertisement.  */
  49         struct bgp_advertise_fifo fifo;
  50
  51         /* Link list for same attribute advertise.  */
  52         struct bgp_advertise *next;
  53         struct bgp_advertise *prev;
  54
  55         /* Prefix information.  */
  56         struct bgp_node *rn;
  57
  58         /* Reference pointer.  */
  59         struct bgp_adj_out *adj;
  60
  61         /* Advertisement attribute.  */
  62         struct bgp_advertise_attr *baa;
  63
  64         /* BGP info.  */
  65         struct bgp_path_info *pathi;
  66 };
  67
  68 /* BGP adjacency out.  */
  69 struct bgp_adj_out {
  70         /* RB Tree of adjacency entries */
  71         RB_ENTRY(bgp_adj_out) adj_entry;
  72
  73         /* Advertised subgroup.  */
  74         struct update_subgroup *subgroup;
  75
  76         /* Threading that makes the adj part of subgroup's adj queue */
  77         TAILQ_ENTRY(bgp_adj_out) subgrp_adj_train;
  78
  79         /* Prefix information.  */
  80         struct bgp_node *rn;
  81
  82         uint32_t addpath_tx_id;
  83
  84         /* Advertised attribute.  */
  85         struct attr *attr;
  86
  87         /* Advertisement information.  */
  88         struct bgp_advertise *adv;
  89 };
  90
  91 RB_HEAD(bgp_adj_out_rb, bgp_adj_out);
  92 RB_PROTOTYPE(bgp_adj_out_rb, bgp_adj_out, adj_entry,
  93              bgp_adj_out_compare);
  94
  95 /* BGP adjacency in. */
  96 struct bgp_adj_in {
  97         /* Linked list pointer.  */
  98         struct bgp_adj_in *next;
  99         struct bgp_adj_in *prev;
 100
 101         /* Received peer.  */
 102         struct peer *peer;
 103
 104         /* Received attribute.  */
 105         struct attr *attr;
 106
 107         /* Addpath identifier */
 108         uint32_t addpath_rx_id;
 109 };
 110
 111 /* BGP advertisement list.  */
 112 struct bgp_synchronize {
 113         struct bgp_advertise_fifo update;
 114         struct bgp_advertise_fifo withdraw;
 115         struct bgp_advertise_fifo withdraw_low;
 116 };
 117
 118 /* BGP adjacency linked list.  */
 119 #define BGP_PATH_INFO_ADD(N, A, TYPE)                                          \
 120         do {                                                                   \
 121                 (A)->prev = NULL;                                              \
 122                 (A)->next = (N)->TYPE;                                         \
 123                 if ((N)->TYPE)                                                 \
 124                         (N)->TYPE->prev = (A);                                 \
 125                 (N)->TYPE = (A);                                               \
 126         } while (0)
 127
 128 #define BGP_PATH_INFO_DEL(N, A, TYPE)                                          \
 129         do {                                                                   \
 130                 if ((A)->next)                                                 \
 131                         (A)->next->prev = (A)->prev;                           \
 132                 if ((A)->prev)                                                 \
 133                         (A)->prev->next = (A)->next;                           \
 134                 else                                                           \
 135                         (N)->TYPE = (A)->next;                                 \
 136         } while (0)
 137
 138 #define BGP_ADJ_IN_ADD(N, A) BGP_PATH_INFO_ADD(N, A, adj_in)
 139 #define BGP_ADJ_IN_DEL(N, A) BGP_PATH_INFO_DEL(N, A, adj_in)
 140
 141 #define BGP_ADV_FIFO_ADD(F, N)                                                 \
 142         do {                                                                   \
 143                 FIFO_ADD((F), (N));                                            \
 144                 (F)->count++;                                                  \
 145         } while (0)
 146
 147 #define BGP_ADV_FIFO_DEL(F, N)                                                 \
 148         do {                                                                   \
 149                 FIFO_DEL((N));                                                 \
 150                 (F)->count--;                                                  \
 151         } while (0)
 152
 153 #define BGP_ADV_FIFO_INIT(F)                                                   \
 154         do {                                                                   \
 155                 FIFO_INIT((F));                                                \
 156                 (F)->count = 0;                                                \
 157         } while (0)
 158
 159 #define BGP_ADV_FIFO_COUNT(F) (F)->count
 160
 161 #define BGP_ADV_FIFO_EMPTY(F)                                                  \
 162         (((struct bgp_advertise_fifo *)(F))->next                              \
 163          == (struct bgp_advertise *)(F))
 164
 165 #define BGP_ADV_FIFO_HEAD(F)                                                   \
 166         ((((struct bgp_advertise_fifo *)(F))->next                             \
 167           == (struct bgp_advertise *)(F))                                      \
 168                  ? NULL                                                        \
 169                  : (F)->next)
 170
 171 /* Prototypes.  */
 172 extern int bgp_adj_out_lookup(struct peer *, struct bgp_node *, uint32_t);
 173 extern void bgp_adj_in_set(struct bgp_node *, struct peer *, struct attr *,
 174                            uint32_t);
 175 extern int bgp_adj_in_unset(struct bgp_node *, struct peer *, uint32_t);
 176 extern void bgp_adj_in_remove(struct bgp_node *, struct bgp_adj_in *);
 177
 178 extern void bgp_sync_init(struct peer *);
 179 extern void bgp_sync_delete(struct peer *);
 180 extern unsigned int baa_hash_key(void *p);
 181 extern bool baa_hash_cmp(const void *p1, const void *p2);
 182 extern void bgp_advertise_add(struct bgp_advertise_attr *baa,
 183                               struct bgp_advertise *adv);
 184 extern struct bgp_advertise *bgp_advertise_new(void);
 185 extern void bgp_advertise_free(struct bgp_advertise *adv);
 186 extern struct bgp_advertise_attr *bgp_advertise_intern(struct hash *hash,
 187                                                        struct attr *attr);
 188 extern struct bgp_advertise_attr *baa_new(void);
 189 extern void bgp_advertise_delete(struct bgp_advertise_attr *baa,
 190                                  struct bgp_advertise *adv);
 191 extern void bgp_advertise_unintern(struct hash *hash,
 192                                    struct bgp_advertise_attr *baa);
 193
 194 #endif /* _QUAGGA_BGP_ADVERTISE_H */