zebra/zebra_vrf.h

   1 /*
   2  * Zebra Vrf Header
   3  * Copyright (C) 2016 Cumulus Networks
   4  *                    Donald Sahrp
   5  *
   6  * This file is part of Quagga.
   7  *
   8  * Quagga is free software; you can redistribute it and/or modify it
   9  * under the terms of the GNU General Public License as published by the
  10  * Free Software Foundation; either version 2, or (at your option) any
  11  * later version.
  12  *
  13  * Quagga is distributed in the hope that it will be useful, but
  14  * WITHOUT ANY WARRANTY; without even the implied warranty of
  15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  16  * General Public License for more details.
  17  *
  18  * You should have received a copy of the GNU General Public License along
  19  * with this program; see the file COPYING; if not, write to the Free Software
  20  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  21  */
  22 #if !defined(__ZEBRA_VRF_H__)
  23 #define __ZEBRA_VRF_H__
  24
  25 #include <zebra/zebra_ns.h>
  26 #include <zebra/zebra_pw.h>
  27 #include <lib/vxlan.h>
  28
  29 /* MPLS (Segment Routing) global block */
  30 typedef struct mpls_srgb_t_ {
  31         uint32_t start_label;
  32         uint32_t end_label;
  33 } mpls_srgb_t;
  34
  35 /* Routing table instance.  */
  36 struct zebra_vrf {
  37         /* Back pointer */
  38         struct vrf *vrf;
  39
  40         /* Description.  */
  41         char *desc;
  42
  43         /* FIB identifier.  */
  44         uint8_t fib_id;
  45
  46         /* Flags. */
  47         uint16_t flags;
  48 #define ZEBRA_VRF_RIB_SCHEDULED   (1 << 0)
  49 #define ZEBRA_VRF_RETAIN          (2 << 0)
  50
  51         uint32_t table_id;
  52
  53         /* Routing table.  */
  54         struct route_table *table[AFI_MAX][SAFI_MAX];
  55
  56         /* Recursive Nexthop table */
  57         struct route_table *rnh_table[AFI_MAX];
  58
  59         /* Import check table (used mostly by BGP */
  60         struct route_table *import_check_table[AFI_MAX];
  61
  62         /* 2nd pointer type used primarily to quell a warning on
  63          * ALL_LIST_ELEMENTS_RO
  64          */
  65         struct list _rid_all_sorted_list;
  66         struct list _rid_lo_sorted_list;
  67         struct list *rid_all_sorted_list;
  68         struct list *rid_lo_sorted_list;
  69         struct prefix rid_user_assigned;
  70
  71         /*
  72          * Back pointer to the owning namespace.
  73          */
  74         struct zebra_ns *zns;
  75
  76         /* MPLS Label to handle L3VPN <-> vrf popping */
  77         mpls_label_t label[AFI_MAX];
  78
  79         /* MPLS static LSP config table */
  80         struct hash *slsp_table;
  81
  82         /* MPLS label forwarding table */
  83         struct hash *lsp_table;
  84
  85         /* MPLS FEC binding table */
  86         struct route_table *fec_table[AFI_MAX];
  87
  88         /* MPLS Segment Routing Global block */
  89         mpls_srgb_t mpls_srgb;
  90
  91         /* Pseudowires. */
  92         struct zebra_pw_head pseudowires;
  93         struct zebra_static_pw_head static_pseudowires;
  94
  95         /* MPLS processing flags */
  96         uint16_t mpls_flags;
  97 #define MPLS_FLAG_SCHEDULE_LSPS    (1 << 0)
  98
  99         /*
 100          * VNI hash table (for EVPN). Only in default instance.
 101          */
 102         struct hash *vni_table;
 103
 104         /*
 105          * Whether EVPN is enabled or not. Only in default instance.
 106          */
 107         int advertise_all_vni;
 108
 109         /*
 110          * Whether we are advertising g/w macip in EVPN or not.
 111          * Only in default instance.
 112          */
 113         int advertise_gw_macip;
 114
 115         /* l3-vni info */
 116         vni_t l3vni;
 117
 118         /* Route Installs */
 119         uint64_t installs;
 120         uint64_t removals;
 121         uint64_t neigh_updates;
 122         uint64_t lsp_installs;
 123         uint64_t lsp_removals;
 124 };
 125
 126 static inline vrf_id_t zvrf_id(struct zebra_vrf *zvrf)
 127 {
 128         if (!zvrf || !zvrf->vrf)
 129                 return VRF_UNKNOWN;
 130         return zvrf->vrf->vrf_id;
 131 }
 132
 133 static inline const char *zvrf_ns_name(struct zebra_vrf *zvrf)
 134 {
 135         if (!zvrf->vrf || !zvrf->vrf->ns_ctxt)
 136                 return NULL;
 137         return ns_get_name((struct ns *)zvrf->vrf->ns_ctxt);
 138 }
 139
 140 static inline const char *zvrf_name(struct zebra_vrf *zvrf)
 141 {
 142         return zvrf->vrf->name;
 143 }
 144
 145 static inline bool zvrf_is_active(struct zebra_vrf *zvrf)
 146 {
 147         return zvrf->vrf->status & VRF_ACTIVE;
 148 }
 149
 150 struct route_table *zebra_vrf_table_with_table_id(afi_t afi, safi_t safi,
 151                                                   vrf_id_t vrf_id,
 152                                                   uint32_t table_id);
 153
 154 extern void zebra_vrf_update_all(struct zserv *client);
 155 extern struct zebra_vrf *zebra_vrf_lookup_by_id(vrf_id_t vrf_id);
 156 extern struct zebra_vrf *zebra_vrf_lookup_by_name(const char *);
 157 extern struct zebra_vrf *zebra_vrf_alloc(void);
 158 extern struct route_table *zebra_vrf_table(afi_t, safi_t, vrf_id_t);
 159
 160 extern struct route_table *
 161 zebra_vrf_other_route_table(afi_t afi, uint32_t table_id, vrf_id_t vrf_id);
 162 extern int zebra_vrf_has_config(struct zebra_vrf *zvrf);
 163 extern void zebra_vrf_init(void);
 164
 165 extern void zebra_rtable_node_cleanup(struct route_table *table,
 166                                       struct route_node *node);
 167 #endif /* ZEBRA_VRF_H */