2 * Copyright (c) 2016 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
16 #ifndef __FIB_NODE_H__
17 #define __FIB_NODE_H__
19 #include <vnet/fib/fib_types.h>
22 * The types of nodes in a FIB graph
24 typedef enum fib_node_type_t_ {
26 * Marker. New types after this one.
28 FIB_NODE_TYPE_FIRST = 0,
30 * See the respective fib_*.h files for descriptions of these objects.
34 FIB_NODE_TYPE_MFIB_ENTRY,
35 FIB_NODE_TYPE_PATH_LIST,
38 FIB_NODE_TYPE_MPLS_ENTRY,
39 FIB_NODE_TYPE_MPLS_TUNNEL,
40 FIB_NODE_TYPE_LISP_GPE_FWD_ENTRY,
41 FIB_NODE_TYPE_LISP_ADJ,
42 FIB_NODE_TYPE_GRE_TUNNEL,
43 FIB_NODE_TYPE_VXLAN_TUNNEL,
46 * Marker. New types before this one. leave the test last.
49 FIB_NODE_TYPE_LAST = FIB_NODE_TYPE_TEST,
52 #define FIB_NODE_TYPE_MAX (FIB_NODE_TYPE_LAST + 1)
54 #define FIB_NODE_TYPES { \
55 [FIB_NODE_TYPE_ENTRY] = "entry", \
56 [FIB_NODE_TYPE_MFIB_ENTRY] = "mfib-entry", \
57 [FIB_NODE_TYPE_WALK] = "walk", \
58 [FIB_NODE_TYPE_PATH_LIST] = "path-list", \
59 [FIB_NODE_TYPE_PATH] = "path", \
60 [FIB_NODE_TYPE_MPLS_ENTRY] = "mpls-entry", \
61 [FIB_NODE_TYPE_MPLS_TUNNEL] = "mpls-tunnel", \
62 [FIB_NODE_TYPE_ADJ] = "adj", \
63 [FIB_NODE_TYPE_LISP_GPE_FWD_ENTRY] = "lisp-gpe-fwd-entry", \
64 [FIB_NODE_TYPE_LISP_ADJ] = "lisp-adj", \
65 [FIB_NODE_TYPE_GRE_TUNNEL] = "gre-tunnel", \
66 [FIB_NODE_TYPE_VXLAN_TUNNEL] = "vxlan-tunnel", \
67 [FIB_NODE_TYPE_MAP_E] = "map-e", \
71 * Reasons for backwalking the FIB object graph
73 typedef enum fib_node_back_walk_reason_t_ {
75 * Marker. Add new ones after.
77 FIB_NODE_BW_REASON_FIRST = 0,
79 * Walk to re-resolve the child.
80 * Used when the parent is no longer a valid resolution target
82 FIB_NODE_BW_REASON_RESOLVE = FIB_NODE_BW_REASON_FIRST,
84 * Walk to re-evaluate the forwarding contributed by the parent.
85 * Used when a parent's forwarding changes and the child needs to
86 * incorporate this change in its forwarding.
88 FIB_NODE_BW_REASON_EVALUATE,
90 * A resolving interface has come up
92 FIB_NODE_BW_REASON_INTERFACE_UP,
94 * A resolving interface has gone down
96 FIB_NODE_BW_REASON_INTERFACE_DOWN,
98 * A resolving interface has been deleted.
100 FIB_NODE_BW_REASON_INTERFACE_DELETE,
102 * Walk to re-collapse the multipath adjs when the rewrite of
103 * a unipath adjacency changes
105 FIB_NODE_BW_REASON_ADJ_UPDATE,
107 * Walk to update children to inform them the adjacency is now down.
109 FIB_NODE_BW_REASON_ADJ_DOWN,
111 * Marker. Add new before and update
113 FIB_NODE_BW_REASON_LAST = FIB_NODE_BW_REASON_ADJ_DOWN,
114 } fib_node_back_walk_reason_t;
116 #define FIB_NODE_BW_REASONS { \
117 [FIB_NODE_BW_REASON_RESOLVE] = "resolve", \
118 [FIB_NODE_BW_REASON_EVALUATE] = "evaluate", \
119 [FIB_NODE_BW_REASON_INTERFACE_UP] = "if-up", \
120 [FIB_NODE_BW_REASON_INTERFACE_DOWN] = "if-down", \
121 [FIB_NODE_BW_REASON_INTERFACE_DELETE] = "if-delete", \
122 [FIB_NODE_BW_REASON_ADJ_UPDATE] = "adj-update", \
123 [FIB_NODE_BW_REASON_ADJ_DOWN] = "adj-down", \
126 #define FOR_EACH_FIB_NODE_BW_REASON(_item) \
127 for (_item = FIB_NODE_BW_REASON_FIRST; \
128 _item <= FIB_NODE_BW_REASON_LAST; \
132 * Flags enum constructed from the reaons
134 typedef enum fib_node_bw_reason_flag_t_ {
135 FIB_NODE_BW_REASON_FLAG_NONE = 0,
136 FIB_NODE_BW_REASON_FLAG_RESOLVE = (1 << FIB_NODE_BW_REASON_RESOLVE),
137 FIB_NODE_BW_REASON_FLAG_EVALUATE = (1 << FIB_NODE_BW_REASON_EVALUATE),
138 FIB_NODE_BW_REASON_FLAG_INTERFACE_UP = (1 << FIB_NODE_BW_REASON_INTERFACE_UP),
139 FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN = (1 << FIB_NODE_BW_REASON_INTERFACE_DOWN),
140 FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE = (1 << FIB_NODE_BW_REASON_INTERFACE_DELETE),
141 FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE = (1 << FIB_NODE_BW_REASON_ADJ_UPDATE),
142 FIB_NODE_BW_REASON_FLAG_ADJ_DOWN = (1 << FIB_NODE_BW_REASON_ADJ_DOWN),
143 } __attribute__ ((packed)) fib_node_bw_reason_flag_t;
145 STATIC_ASSERT(sizeof(fib_node_bw_reason_flag_t) < 2,
146 "BW Reason enum < 2 byte. Consequences for cover_upd_res_t");
151 typedef enum fib_node_bw_flags_t_
154 * Force the walk to be synchronous
156 FIB_NODE_BW_FLAG_FORCE_SYNC = (1 << 0),
157 } fib_node_bw_flags_t;
160 * Forward eclarations
165 * A representation of one pointer to another node.
166 * To fully qualify a node, one must know its type and its index so it
167 * can be retrieved from the appropriate pool. Direct pointers to nodes
168 * are forbidden, since all nodes are allocated from pools, which are vectors,
169 * and thus subject to realloc at any time.
171 typedef struct fib_node_ptr_t_ {
175 fib_node_type_t fnp_type;
179 fib_node_index_t fnp_index;
183 * @brief A list of FIB nodes.
185 typedef u32 fib_node_list_t;
188 * Context passed between object during a back walk.
190 typedef struct fib_node_back_walk_ctx_t_ {
192 * The reason/trigger for the backwalk
194 fib_node_bw_reason_flag_t fnbw_reason;
197 * additional flags for the walk
199 fib_node_bw_flags_t fnbw_flags;
202 * the number of levels the walk has already traversed.
203 * this value is maintained by the walk infra, tp limit the depth of
204 * a walk so it does not run indefinately the presence of a loop/cycle
208 } fib_node_back_walk_ctx_t;
211 * We consider a depth of 32 to be sufficient to cover all sane
212 * network topologies. Anything more is then an indication that
213 * there is a loop/cycle in the FIB graph.
214 * Note that all object types contribute to 1 to the depth.
216 #define FIB_NODE_GRAPH_MAX_DEPTH ((u32)32)
219 * A callback function for walking a node dependency list
221 typedef int (*fib_node_ptr_walk_t)(fib_node_ptr_t *depend,
225 * A list of dependent nodes.
226 * This is currently implemented as a hash_table of fib_node_ptr_t
228 typedef fib_node_ptr_t fib_node_ptr_list_t;
231 * Return code from a back walk function
233 typedef enum fib_node_back_walk_rc_t_ {
234 FIB_NODE_BACK_WALK_MERGE,
235 FIB_NODE_BACK_WALK_CONTINUE,
236 } fib_node_back_walk_rc_t;
239 * Function definition to backwalk a FIB node
241 typedef fib_node_back_walk_rc_t (*fib_node_back_walk_t)(
242 struct fib_node_t_ *node,
243 fib_node_back_walk_ctx_t *ctx);
246 * Function definition to get a FIB node from its index
248 typedef struct fib_node_t_* (*fib_node_get_t)(fib_node_index_t index);
251 * Function definition to inform the FIB node that its last lock has gone.
253 typedef void (*fib_node_last_lock_gone_t)(struct fib_node_t_ *node);
256 * Function definition to display the amount of memory used by a type.
257 * Implementations should call fib_show_memory_usage()
259 typedef void (*fib_node_memory_show_t)(void);
262 * A FIB graph nodes virtual function table
264 typedef struct fib_node_vft_t_ {
265 fib_node_get_t fnv_get;
266 fib_node_last_lock_gone_t fnv_last_lock;
267 fib_node_back_walk_t fnv_back_walk;
268 format_function_t *fnv_format;
269 fib_node_memory_show_t fnv_mem_show;
273 * An node in the FIB graph
275 * Objects in the FIB form a graph.
277 typedef struct fib_node_t_ {
280 * The node's type. make sure we are dynamic/down casting correctly
282 fib_node_type_t fn_type;
286 * we could store the type here instead, and lookup the VFT using that. But
287 * I like this better,
289 const fib_node_vft_t *fn_vft;
292 * Vector of nodes that depend upon/use/share this node
294 fib_node_list_t fn_children;
297 * Number of dependents on this node. This number includes the number
305 * Register the function table for a given type
311 * virtual function table
313 extern void fib_node_register_type (fib_node_type_t ft,
314 const fib_node_vft_t *vft);
318 * Create a new FIB node type and Register the function table for it.
321 * virtual function table
323 * @return new FIB node type
325 extern fib_node_type_t fib_node_register_new_type (const fib_node_vft_t *vft);
328 * @brief Show the memory usage for a type
330 * This should be invoked by the type in response to the infra calling
331 * its registered memory show function
333 * @param name the name of the type
334 * @param in_use_elts The number of elements in use
335 * @param allocd_elts The number of allocated pool elemenets
336 * @param size_elt The size of one element
338 extern void fib_show_memory_usage(const char *name,
343 extern void fib_node_init(fib_node_t *node,
345 extern void fib_node_deinit(fib_node_t *node);
347 extern void fib_node_lock(fib_node_t *node);
348 extern void fib_node_unlock(fib_node_t *node);
350 extern u32 fib_node_get_n_children(fib_node_type_t parent_type,
351 fib_node_index_t parent_index);
352 extern u32 fib_node_child_add(fib_node_type_t parent_type,
353 fib_node_index_t parent_index,
354 fib_node_type_t child_type,
355 fib_node_index_t child_index);
356 extern void fib_node_child_remove(fib_node_type_t parent_type,
357 fib_node_index_t parent_index,
358 fib_node_index_t sibling_index);
360 extern fib_node_back_walk_rc_t fib_node_back_walk_one(fib_node_ptr_t *ptr,
361 fib_node_back_walk_ctx_t *ctx);
363 extern u8* fib_node_children_format(fib_node_list_t list,
366 extern const char* fib_node_type_get_name(fib_node_type_t type);
369 fib_node_index_is_valid (fib_node_index_t ni)
371 return (FIB_NODE_INDEX_INVALID != ni);