zebra/zebra_nhg.h

   1 /* Zebra Nexthop Group header.
   2  * Copyright (C) 2019 Cumulus Networks, Inc.
   3  *                    Donald Sharp
   4  *                    Stephen Worley
   5  *
   6  * This file is part of FRR.
   7  *
   8  * FRR 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  * FRR 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
  19  * along with FRR; see the file COPYING.  If not, write to the Free
  20  * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
  21  * 02111-1307, USA.
  22  */
  23 #ifndef __ZEBRA_NHG_H__
  24 #define __ZEBRA_NHG_H__
  25
  26 #include "lib/nexthop.h"
  27 #include "lib/nexthop_group.h"
  28
  29 #ifdef __cplusplus
  30 extern "C" {
  31 #endif
  32
  33 /* This struct is used exclusively for dataplane
  34  * interaction via a dataplane context.
  35  *
  36  * It is designed to mimic the netlink nexthop_grp
  37  * struct in include/linux/nexthop.h
  38  */
  39 struct nh_grp {
  40         uint32_t id;
  41         uint8_t weight;
  42 };
  43
  44 PREDECL_RBTREE_UNIQ(nhg_connected_tree);
  45
  46 /*
  47  * Hashtables containing nhg entries is in `zebra_router`.
  48  */
  49 struct nhg_hash_entry {
  50         uint32_t id;
  51         afi_t afi;
  52         vrf_id_t vrf_id;
  53
  54         /* Time since last update */
  55         time_t uptime;
  56
  57         /* Source protocol - zebra or another daemon */
  58         int type;
  59
  60         /* zapi instance and session id, for groups from other daemons */
  61         uint16_t zapi_instance;
  62         uint32_t zapi_session;
  63
  64         struct nexthop_group nhg;
  65
  66         /* If supported, a mapping of backup nexthops. */
  67         struct nhg_backup_info *backup_info;
  68
  69         /* If this is not a group, it
  70          * will be a single nexthop
  71          * and must have an interface
  72          * associated with it.
  73          * Otherwise, this will be null.
  74          */
  75         struct interface *ifp;
  76
  77         uint32_t refcnt;
  78         uint32_t dplane_ref;
  79
  80         uint32_t flags;
  81
  82         /* Dependency trees for other entries.
  83          * For instance a group with two
  84          * nexthops will have two dependencies
  85          * pointing to those nhg_hash_entries.
  86          *
  87          * Using a rb tree here to make lookups
  88          * faster with ID's.
  89          *
  90          * nhg_depends the RB tree of entries that this
  91          * group contains.
  92          *
  93          * nhg_dependents the RB tree of entries that
  94          * this group is being used by
  95          *
  96          * NHG id 3 with nexthops id 1/2
  97          * nhg(3)->nhg_depends has 1 and 2 in the tree
  98          * nhg(3)->nhg_dependents is empty
  99          *
 100          * nhg(1)->nhg_depends is empty
 101          * nhg(1)->nhg_dependents is 3 in the tree
 102          *
 103          * nhg(2)->nhg_depends is empty
 104          * nhg(3)->nhg_dependents is 3 in the tree
 105          */
 106         struct nhg_connected_tree_head nhg_depends, nhg_dependents;
 107
 108         struct thread *timer;
 109
 110 /*
 111  * Is this nexthop group valid, ie all nexthops are fully resolved.
 112  * What is fully resolved?  It's a nexthop that is either self contained
 113  * and correct( ie no recursive pointer ) or a nexthop that is recursively
 114  * resolved and correct.
 115  */
 116 #define NEXTHOP_GROUP_VALID (1 << 0)
 117 /*
 118  * Has this nexthop group been installed?  At this point in time, this
 119  * means that the data-plane has been told about this nexthop group
 120  * and it's possible usage by a route entry.
 121  */
 122 #define NEXTHOP_GROUP_INSTALLED (1 << 1)
 123 /*
 124  * Has the nexthop group been queued to be send to the FIB?
 125  * The NEXTHOP_GROUP_VALID flag should also be set by this point.
 126  */
 127 #define NEXTHOP_GROUP_QUEUED (1 << 2)
 128 /*
 129  * Is this a nexthop that is recursively resolved?
 130  */
 131 #define NEXTHOP_GROUP_RECURSIVE (1 << 3)
 132
 133 /*
 134  * Backup nexthop support - identify groups that are backups for
 135  * another group.
 136  */
 137 #define NEXTHOP_GROUP_BACKUP (1 << 4)
 138
 139 /*
 140  * The NHG has been release by an upper level protocol via the
 141  * `zebra_nhg_proto_del()` API.
 142  *
 143  * We use this flag to track this state in case the NHG is still being used
 144  * by routes therefore holding their refcnts as well. Otherwise, the NHG will
 145  * be removed and uninstalled.
 146  *
 147  */
 148 #define NEXTHOP_GROUP_PROTO_RELEASED (1 << 5)
 149
 150 /*
 151  * When deleting a NHG notice that it is still installed
 152  * and if it is, slightly delay the actual removal to
 153  * the future.  So that upper level protocols might
 154  * be able to take advantage of some NHG's that
 155  * are there
 156  */
 157 #define NEXTHOP_GROUP_KEEP_AROUND (1 << 6)
 158
 159 /*
 160  * Track FPM installation status..
 161  */
 162 #define NEXTHOP_GROUP_FPM (1 << 6)
 163 };
 164
 165 /* Upper 4 bits of the NHG are reserved for indicating the NHG type */
 166 #define NHG_ID_TYPE_POS 28
 167 enum nhg_type {
 168         NHG_TYPE_L3 = 0,
 169         NHG_TYPE_L2_NH, /* NHs in a L2 NHG used as a MAC/FDB dest */
 170         NHG_TYPE_L2,    /* L2 NHG used as a MAC/FDB dest */
 171 };
 172
 173 /* Was this one we created, either this session or previously? */
 174 #define ZEBRA_NHG_CREATED(NHE)                                                 \
 175         (((NHE->type) <= ZEBRA_ROUTE_MAX) && (NHE->type != ZEBRA_ROUTE_KERNEL))
 176
 177 /* Is this an NHE owned by zebra and not an upper level protocol? */
 178 #define ZEBRA_OWNED(NHE) (NHE->type == ZEBRA_ROUTE_NHG)
 179
 180 #define PROTO_OWNED(NHE) (NHE->id >= ZEBRA_NHG_PROTO_LOWER)
 181
 182 /*
 183  * Backup nexthops: this is a group object itself, so
 184  * that the backup nexthops can use the same code as a normal object.
 185  */
 186 struct nhg_backup_info {
 187         struct nhg_hash_entry *nhe;
 188 };
 189
 190 enum nhg_ctx_op_e {
 191         NHG_CTX_OP_NONE = 0,
 192         NHG_CTX_OP_NEW,
 193         NHG_CTX_OP_DEL,
 194 };
 195
 196 enum nhg_ctx_status {
 197         NHG_CTX_NONE = 0,
 198         NHG_CTX_QUEUED,
 199         NHG_CTX_REQUEUED,
 200         NHG_CTX_SUCCESS,
 201         NHG_CTX_FAILURE,
 202 };
 203
 204 /*
 205  * Context needed to queue nhg updates on the
 206  * work queue.
 207  */
 208 struct nhg_ctx {
 209
 210         /* Unique ID */
 211         uint32_t id;
 212
 213         vrf_id_t vrf_id;
 214         afi_t afi;
 215
 216         /*
 217          * This should only ever be ZEBRA_ROUTE_NHG unless we get a a kernel
 218          * created nexthop not made by us.
 219          */
 220         int type;
 221
 222         /* If its a group array, how many? */
 223         uint8_t count;
 224
 225         /* Its either a single nexthop or an array of ID's */
 226         union {
 227                 struct nexthop nh;
 228                 struct nh_grp grp[MULTIPATH_NUM];
 229         } u;
 230
 231         enum nhg_ctx_op_e op;
 232         enum nhg_ctx_status status;
 233 };
 234
 235 /* Global control to disable use of kernel nexthops, if available. We can't
 236  * force the kernel to support nexthop ids, of course, but we can disable
 237  * zebra's use of them, for testing e.g. By default, if the kernel supports
 238  * nexthop ids, zebra uses them.
 239  */
 240 void zebra_nhg_enable_kernel_nexthops(bool set);
 241 bool zebra_nhg_kernel_nexthops_enabled(void);
 242
 243 /* Global control for zebra to only use proto-owned nexthops */
 244 void zebra_nhg_set_proto_nexthops_only(bool set);
 245 bool zebra_nhg_proto_nexthops_only(void);
 246
 247 /* Global control for use of activated backups for recursive resolution. */
 248 void zebra_nhg_set_recursive_use_backups(bool set);
 249 bool zebra_nhg_recursive_use_backups(void);
 250
 251 /**
 252  * NHE abstracted tree functions.
 253  * Use these where possible instead of direct access.
 254  */
 255 struct nhg_hash_entry *zebra_nhg_alloc(void);
 256 void zebra_nhg_free(struct nhg_hash_entry *nhe);
 257 /* In order to clear a generic hash, we need a generic api, sigh. */
 258 void zebra_nhg_hash_free(void *p);
 259
 260 /* Init an nhe, for use in a hash lookup for example. There's some fuzziness
 261  * if the nhe represents only a single nexthop, so we try to capture that
 262  * variant also.
 263  */
 264 void zebra_nhe_init(struct nhg_hash_entry *nhe, afi_t afi,
 265                     const struct nexthop *nh);
 266
 267 /*
 268  * Shallow copy of 'orig', into new/allocated nhe.
 269  */
 270 struct nhg_hash_entry *zebra_nhe_copy(const struct nhg_hash_entry *orig,
 271                                       uint32_t id);
 272
 273 /* Allocate, free backup nexthop info objects */
 274 struct nhg_backup_info *zebra_nhg_backup_alloc(void);
 275 void zebra_nhg_backup_free(struct nhg_backup_info **p);
 276
 277 struct nexthop_group *zebra_nhg_get_backup_nhg(struct nhg_hash_entry *nhe);
 278
 279 extern struct nhg_hash_entry *zebra_nhg_resolve(struct nhg_hash_entry *nhe);
 280
 281 extern unsigned int zebra_nhg_depends_count(const struct nhg_hash_entry *nhe);
 282 extern bool zebra_nhg_depends_is_empty(const struct nhg_hash_entry *nhe);
 283
 284 extern unsigned int
 285 zebra_nhg_dependents_count(const struct nhg_hash_entry *nhe);
 286 extern bool zebra_nhg_dependents_is_empty(const struct nhg_hash_entry *nhe);
 287
 288 /* Lookup ID, doesn't create */
 289 extern struct nhg_hash_entry *zebra_nhg_lookup_id(uint32_t id);
 290
 291 /* Hash functions */
 292 extern uint32_t zebra_nhg_hash_key(const void *arg);
 293 extern uint32_t zebra_nhg_id_key(const void *arg);
 294
 295 extern bool zebra_nhg_hash_equal(const void *arg1, const void *arg2);
 296 extern bool zebra_nhg_hash_id_equal(const void *arg1, const void *arg2);
 297
 298 /*
 299  * Process a context off of a queue.
 300  * Specifically this should be from
 301  * the rib meta queue.
 302  */
 303 extern int nhg_ctx_process(struct nhg_ctx *ctx);
 304 void nhg_ctx_free(struct nhg_ctx **ctx);
 305
 306 /* Find via kernel nh creation */
 307 extern int zebra_nhg_kernel_find(uint32_t id, struct nexthop *nh,
 308                                  struct nh_grp *grp, uint8_t count,
 309                                  vrf_id_t vrf_id, afi_t afi, int type,
 310                                  int startup);
 311 /* Del via kernel */
 312 extern int zebra_nhg_kernel_del(uint32_t id, vrf_id_t vrf_id);
 313
 314 /* Find an nhe based on a nexthop_group */
 315 extern struct nhg_hash_entry *zebra_nhg_rib_find(uint32_t id,
 316                                                  struct nexthop_group *nhg,
 317                                                  afi_t rt_afi, int type);
 318
 319 /* Find an nhe based on a route's nhe, used during route creation */
 320 struct nhg_hash_entry *
 321 zebra_nhg_rib_find_nhe(struct nhg_hash_entry *rt_nhe, afi_t rt_afi);
 322
 323
 324 /**
 325  * Functions for Add/Del/Replace via protocol NHG creation.
 326  *
 327  * The NHEs will not be hashed. They will only be present in the
 328  * ID table and therefore not sharable.
 329  *
 330  * It is the owning protocols job to manage these.
 331  */
 332
 333 /*
 334  * Add NHE. If already exists, Replace.
 335  *
 336  * Returns allocated NHE on success, otherwise NULL.
 337  */
 338 struct nhg_hash_entry *zebra_nhg_proto_add(uint32_t id, int type,
 339                                            uint16_t instance, uint32_t session,
 340                                            struct nexthop_group *nhg,
 341                                            afi_t afi);
 342
 343 /*
 344  * Del NHE.
 345  *
 346  * Returns deleted NHE on success, otherwise NULL.
 347  *
 348  * Caller must decrement ref with zebra_nhg_decrement_ref() when done.
 349  */
 350 struct nhg_hash_entry *zebra_nhg_proto_del(uint32_t id, int type);
 351
 352 /*
 353  * Remove specific by proto NHGs.
 354  *
 355  * Called after client disconnect.
 356  *
 357  */
 358 unsigned long zebra_nhg_score_proto(int type);
 359
 360 /* Reference counter functions */
 361 extern void zebra_nhg_decrement_ref(struct nhg_hash_entry *nhe);
 362 extern void zebra_nhg_increment_ref(struct nhg_hash_entry *nhe);
 363
 364 /* Check validity of nhe, if invalid will update dependents as well */
 365 extern void zebra_nhg_check_valid(struct nhg_hash_entry *nhe);
 366
 367 /* Convert nhe depends to a grp context that can be passed around safely */
 368 extern uint8_t zebra_nhg_nhe2grp(struct nh_grp *grp, struct nhg_hash_entry *nhe,
 369                                  int size);
 370
 371 /* Dataplane install/uninstall */
 372 extern void zebra_nhg_install_kernel(struct nhg_hash_entry *nhe);
 373 extern void zebra_nhg_uninstall_kernel(struct nhg_hash_entry *nhe);
 374
 375 /* Forward ref of dplane update context type */
 376 struct zebra_dplane_ctx;
 377 extern void zebra_nhg_dplane_result(struct zebra_dplane_ctx *ctx);
 378
 379
 380 /* Sweep the nhg hash tables for old entries on restart */
 381 extern void zebra_nhg_sweep_table(struct hash *hash);
 382
 383 /*
 384  * We are shutting down but the nexthops should be kept
 385  * as that -r has been specified and we don't want to delete
 386  * the routes unintentionally
 387  */
 388 extern void zebra_nhg_mark_keep(void);
 389
 390 /* Nexthop resolution processing */
 391 struct route_entry; /* Forward ref to avoid circular includes */
 392 extern int nexthop_active_update(struct route_node *rn, struct route_entry *re);
 393
 394 #ifdef _FRR_ATTRIBUTE_PRINTFRR
 395 #pragma FRR printfrr_ext "%pNG" (const struct nhg_hash_entry *)
 396 #endif
 397
 398 #ifdef __cplusplus
 399 }
 400 #endif
 401
 402 #endif  /* __ZEBRA_NHG_H__ */