3 * Copyright (C) 2016 Cumulus Networks
6 * This file is part of Quagga.
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
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.
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
22 #if !defined(__ZEBRA_VRF_H__)
23 #define __ZEBRA_VRF_H__
27 #include <zebra/zebra_ns.h>
28 #include <zebra/zebra_pw.h>
29 #include <lib/vxlan.h>
35 /* MPLS (Segment Routing) global block */
36 typedef struct mpls_srgb_t_
{
43 struct route_map
*map
;
46 PREDECL_RBTREE_UNIQ(otable
);
48 struct other_route_table
{
49 struct otable_item next
;
55 struct route_table
*table
;
58 /* Routing table instance. */
71 #define ZEBRA_VRF_RETAIN (1 << 0)
76 struct route_table
*table
[AFI_MAX
][SAFI_MAX
];
78 /* Recursive Nexthop table */
79 struct route_table
*rnh_table
[AFI_MAX
];
81 /* Import check table (used mostly by BGP */
82 struct route_table
*import_check_table
[AFI_MAX
];
84 struct otable_head other_tables
;
86 /* 2nd pointer type used primarily to quell a warning on
87 * ALL_LIST_ELEMENTS_RO
89 struct list _rid_all_sorted_list
;
90 struct list _rid_lo_sorted_list
;
91 struct list
*rid_all_sorted_list
;
92 struct list
*rid_lo_sorted_list
;
93 struct prefix rid_user_assigned
;
96 * Back pointer to the owning namespace.
100 /* MPLS Label to handle L3VPN <-> vrf popping */
101 mpls_label_t label
[AFI_MAX
];
103 /* MPLS static LSP config table */
104 struct hash
*slsp_table
;
106 /* MPLS label forwarding table */
107 struct hash
*lsp_table
;
109 /* MPLS FEC binding table */
110 struct route_table
*fec_table
[AFI_MAX
];
112 /* MPLS Segment Routing Global block */
113 mpls_srgb_t mpls_srgb
;
116 struct zebra_pw_head pseudowires
;
117 struct zebra_static_pw_head static_pseudowires
;
119 struct zebra_rmap proto_rm
[AFI_MAX
][ZEBRA_ROUTE_MAX
+ 1];
120 struct zebra_rmap nht_rm
[AFI_MAX
][ZEBRA_ROUTE_MAX
+ 1];
122 /* MPLS processing flags */
124 #define MPLS_FLAG_SCHEDULE_LSPS (1 << 0)
127 * VNI hash table (for EVPN). Only in the EVPN instance.
129 struct hash
*vni_table
;
132 * Whether EVPN is enabled or not. Only in the EVPN instance.
134 int advertise_all_vni
;
137 * Whether we are advertising g/w macip in EVPN or not.
138 * Only in the EVPN instance.
140 int advertise_gw_macip
;
142 int advertise_svi_macip
;
147 /* pim mroutes installed for vxlan flooding */
148 struct hash
*vxlan_sg_table
;
150 bool dup_addr_detect
;
153 uint32_t dad_max_moves
;
155 uint32_t dad_freeze_time
;
158 * Flooding mechanism for BUM packets for VxLAN-EVPN.
160 enum vxlan_flood_control vxlan_flood_ctrl
;
165 uint64_t installs_queued
;
166 uint64_t removals_queued
;
167 uint64_t neigh_updates
;
168 uint64_t lsp_installs_queued
;
169 uint64_t lsp_removals_queued
;
170 uint64_t lsp_installs
;
171 uint64_t lsp_removals
;
173 #if defined(HAVE_RTADV)
175 #endif /* HAVE_RTADV */
177 #define PROTO_RM_NAME(zvrf, afi, rtype) zvrf->proto_rm[afi][rtype].name
178 #define NHT_RM_NAME(zvrf, afi, rtype) zvrf->nht_rm[afi][rtype].name
179 #define PROTO_RM_MAP(zvrf, afi, rtype) zvrf->proto_rm[afi][rtype].map
180 #define NHT_RM_MAP(zvrf, afi, rtype) zvrf->nht_rm[afi][rtype].map
183 * special macro to allow us to get the correct zebra_vrf
185 #define ZEBRA_DECLVAR_CONTEXT(A, B) \
186 struct vrf *A = VTY_GET_CONTEXT(vrf); \
187 struct zebra_vrf *B = (A) ? A->info : vrf_info_lookup(VRF_DEFAULT)
189 static inline vrf_id_t
zvrf_id(struct zebra_vrf
*zvrf
)
191 if (!zvrf
|| !zvrf
->vrf
)
193 return zvrf
->vrf
->vrf_id
;
196 static inline struct zebra_vrf
*zvrf_info_lookup(struct vrf
*vrf
)
198 struct zebra_vrf
*zvrf
= NULL
;
201 zvrf
= (struct zebra_vrf
*)vrf
->info
;
205 static inline const char *zvrf_ns_name(struct zebra_vrf
*zvrf
)
207 if (!zvrf
->vrf
|| !zvrf
->vrf
->ns_ctxt
)
209 return ns_get_name((struct ns
*)zvrf
->vrf
->ns_ctxt
);
212 static inline const char *zvrf_name(struct zebra_vrf
*zvrf
)
214 return zvrf
->vrf
->name
;
217 static inline bool zvrf_is_active(struct zebra_vrf
*zvrf
)
219 return zvrf
->vrf
->status
& VRF_ACTIVE
;
223 zvrf_other_table_compare_func(const struct other_route_table
*a
,
224 const struct other_route_table
*b
)
226 if (a
->afi
!= b
->afi
)
227 return a
->afi
- b
->afi
;
229 if (a
->safi
!= b
->safi
)
230 return a
->safi
- b
->safi
;
232 if (a
->table_id
!= b
->table_id
)
233 return a
->table_id
- b
->table_id
;
238 DECLARE_RBTREE_UNIQ(otable
, struct other_route_table
, next
,
239 zvrf_other_table_compare_func
)
241 struct route_table
*zebra_vrf_table_with_table_id(afi_t afi
, safi_t safi
,
245 extern void zebra_vrf_update_all(struct zserv
*client
);
246 extern struct zebra_vrf
*zebra_vrf_lookup_by_id(vrf_id_t vrf_id
);
247 extern struct zebra_vrf
*zebra_vrf_lookup_by_name(const char *);
248 extern struct zebra_vrf
*zebra_vrf_alloc(void);
249 extern struct route_table
*zebra_vrf_table(afi_t
, safi_t
, vrf_id_t
);
251 extern int zebra_vrf_has_config(struct zebra_vrf
*zvrf
);
252 extern void zebra_vrf_init(void);
254 extern void zebra_rtable_node_cleanup(struct route_table
*table
,
255 struct route_node
*node
);
261 #endif /* ZEBRA_VRF_H */