FD.io VPP  v21.06-3-gbb25fbf28
Vector Packet Processing
fib_node.h
Go to the documentation of this file.
1 /*
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:
6  *
7  * http://www.apache.org/licenses/LICENSE-2.0
8  *
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.
14  */
15 
16 #ifndef __FIB_NODE_H__
17 #define __FIB_NODE_H__
18 
19 #include <vnet/fib/fib_types.h>
20 
21 /**
22  * The types of nodes in a FIB graph
23  */
24 typedef enum fib_node_type_t_ {
25  /**
26  * Marker. New types after this one.
27  */
29  /**
30  * See the respective fib_*.h files for descriptions of these objects.
31  */
53  /**
54  * Marker. New types before this one. leave the test last.
55  */
58 } __attribute__ ((packed)) fib_node_type_t;
59 
60 #define FIB_NODE_TYPE_MAX (FIB_NODE_TYPE_LAST + 1)
61 
62 #define FIB_NODE_TYPES { \
63  [FIB_NODE_TYPE_ENTRY] = "entry", \
64  [FIB_NODE_TYPE_MFIB_ENTRY] = "mfib-entry", \
65  [FIB_NODE_TYPE_WALK] = "walk", \
66  [FIB_NODE_TYPE_PATH_LIST] = "path-list", \
67  [FIB_NODE_TYPE_PATH] = "path", \
68  [FIB_NODE_TYPE_MPLS_ENTRY] = "mpls-entry", \
69  [FIB_NODE_TYPE_MPLS_TUNNEL] = "mpls-tunnel", \
70  [FIB_NODE_TYPE_ADJ] = "adj", \
71  [FIB_NODE_TYPE_LISP_GPE_FWD_ENTRY] = "lisp-gpe-fwd-entry", \
72  [FIB_NODE_TYPE_LISP_ADJ] = "lisp-adj", \
73  [FIB_NODE_TYPE_VXLAN_TUNNEL] = "vxlan-tunnel", \
74  [FIB_NODE_TYPE_MAP_E] = "map-e", \
75  [FIB_NODE_TYPE_VXLAN_GPE_TUNNEL] = "vxlan-gpe-tunnel", \
76  [FIB_NODE_TYPE_UDP_ENCAP] = "udp-encap", \
77  [FIB_NODE_TYPE_BIER_FMASK] = "bier-fmask", \
78  [FIB_NODE_TYPE_BIER_ENTRY] = "bier-entry", \
79  [FIB_NODE_TYPE_VXLAN_GBP_TUNNEL] = "vxlan-gbp-tunnel", \
80  [FIB_NODE_TYPE_IPSEC_SA] = "ipsec-sa", \
81  [FIB_NODE_TYPE_IP_PUNT_REDIRECT] = "ip-punt-redirect", \
82  [FIB_NODE_TYPE_ENTRY_TRACK] = "fib-entry-track" \
83 }
84 
85 /**
86  * Reasons for backwalking the FIB object graph
87  */
89  /**
90  * Marker. Add new ones after.
91  */
93  /**
94  * Walk to re-resolve the child.
95  * Used when the parent is no longer a valid resolution target
96  */
98  /**
99  * Walk to re-evaluate the forwarding contributed by the parent.
100  * Used when a parent's forwarding changes and the child needs to
101  * incorporate this change in its forwarding.
102  */
104  /**
105  * A resolving interface has come up
106  */
108  /**
109  * A resolving interface has gone down
110  */
112  /**
113  * A resolving interface has been deleted.
114  */
116  /**
117  * Walk to re-collapse the multipath adjs when the rewrite of
118  * a unipath adjacency changes
119  */
121  /**
122  * Walk update the adjacency MTU
123  */
125  /**
126  * Walk to update children to inform them the adjacency is now down.
127  */
129  /**
130  * Marker. Add new before and update
131  */
134 
135 #define FIB_NODE_BW_REASONS { \
136  [FIB_NODE_BW_REASON_RESOLVE] = "resolve", \
137  [FIB_NODE_BW_REASON_EVALUATE] = "evaluate", \
138  [FIB_NODE_BW_REASON_INTERFACE_UP] = "if-up", \
139  [FIB_NODE_BW_REASON_INTERFACE_DOWN] = "if-down", \
140  [FIB_NODE_BW_REASON_INTERFACE_DELETE] = "if-delete", \
141  [FIB_NODE_BW_REASON_ADJ_UPDATE] = "adj-update", \
142  [FIB_NODE_BW_REASON_ADJ_MTU] = "adj-mtu", \
143  [FIB_NODE_BW_REASON_ADJ_DOWN] = "adj-down", \
144 }
145 
146 #define FOR_EACH_FIB_NODE_BW_REASON(_item) \
147  for (_item = FIB_NODE_BW_REASON_FIRST; \
148  _item <= FIB_NODE_BW_REASON_LAST; \
149  _item++)
150 
151 /**
152  * Flags enum constructed from the reaons
153  */
164 } __attribute__ ((packed)) fib_node_bw_reason_flag_t;
165 
167  "BW Reason enum < 2 byte. Consequences for cover_upd_res_t");
168 
169 extern u8 *format_fib_node_bw_reason(u8 *s, va_list *args);
170 
171 /**
172  * Flags on the walk
173  */
175 {
177  /**
178  * Force the walk to be synchronous
179  */
182 
183 /**
184  * Forward declarations
185  */
186 struct fib_node_t_;
187 
188 /**
189  * A representation of one pointer to another node.
190  * To fully qualify a node, one must know its type and its index so it
191  * can be retrieved from the appropriate pool. Direct pointers to nodes
192  * are forbidden, since all nodes are allocated from pools, which are vectors,
193  * and thus subject to realloc at any time.
194  */
195 typedef struct fib_node_ptr_t_ {
196  /**
197  * node type
198  */
200  /**
201  * node's index
202  */
205 
206 /**
207  * @brief A list of FIB nodes.
208  */
210 
211 /**
212  * Context passed between object during a back walk.
213  */
215  /**
216  * The reason/trigger for the backwalk
217  */
219 
220  /**
221  * additional flags for the walk
222  */
224 
225  /**
226  * the number of levels the walk has already traversed.
227  * this value is maintained by the walk infra, tp limit the depth of
228  * a walk so it does not run indefinately the presence of a loop/cycle
229  * in the graph.
230  */
233 
234 /**
235  * We consider a depth of 32 to be sufficient to cover all sane
236  * network topologies. Anything more is then an indication that
237  * there is a loop/cycle in the FIB graph.
238  * Note that all object types contribute to 1 to the depth.
239  */
240 #define FIB_NODE_GRAPH_MAX_DEPTH ((u32)32)
241 
242 /**
243  * A callback function for walking a node dependency list
244  */
245 typedef int (*fib_node_ptr_walk_t)(fib_node_ptr_t *depend,
246  void *ctx);
247 
248 /**
249  * A list of dependent nodes.
250  * This is currently implemented as a hash_table of fib_node_ptr_t
251  */
253 
254 /**
255  * Return code from a back walk function
256  */
261 
262 /**
263  * Function definition to backwalk a FIB node
264  */
266  struct fib_node_t_ *node,
268 
269 /**
270  * Function definition to get a FIB node from its index
271  */
272 typedef struct fib_node_t_* (*fib_node_get_t)(fib_node_index_t index);
273 
274 /**
275  * Function definition to inform the FIB node that its last lock has gone.
276  */
277 typedef void (*fib_node_last_lock_gone_t)(struct fib_node_t_ *node);
278 
279 /**
280  * Function definition to display the amount of memory used by a type.
281  * Implementations should call fib_show_memory_usage()
282  */
283 typedef void (*fib_node_memory_show_t)(void);
284 
285 /**
286  * A FIB graph nodes virtual function table
287  */
288 typedef struct fib_node_vft_t_ {
295 
296 /**
297  * An node in the FIB graph
298  *
299  * Objects in the FIB form a graph.
300  */
301 typedef struct fib_node_t_ {
302  /**
303  * The node's type. make sure we are dynamic/down casting correctly
304  */
306 
307  /**
308  * Some pad space the concrete/derived type is free to use
309  */
311 
312  /**
313  * Vector of nodes that depend upon/use/share this node
314  */
316 
317  /**
318  * Number of dependents on this node. This number includes the number
319  * of children
320  */
322 } fib_node_t;
323 
324 STATIC_ASSERT(sizeof(fib_node_t) == 12, "FIB node type is growing");
325 
326 /**
327  * @brief
328  * Register the function table for a given type
329  *
330  * @param ft
331  * FIB node type
332  *
333  * @param vft
334  * virtual function table
335  */
337  const fib_node_vft_t *vft);
338 
339 /**
340  * @brief
341  * Create a new FIB node type and Register the function table for it.
342  *
343  * @param vft
344  * virtual function table
345  *
346  * @return new FIB node type
347  */
349 
350 /**
351  * @brief Show the memory usage for a type
352  *
353  * This should be invoked by the type in response to the infra calling
354  * its registered memory show function
355  *
356  * @param name the name of the type
357  * @param in_use_elts The number of elements in use
358  * @param allocd_elts The number of allocated pool elemenets
359  * @param size_elt The size of one element
360  */
361 extern void fib_show_memory_usage(const char *name,
362  u32 in_use_elts,
363  u32 allocd_elts,
364  size_t size_elt);
365 
366 extern void fib_node_init(fib_node_t *node,
367  fib_node_type_t ft);
368 extern void fib_node_deinit(fib_node_t *node);
369 
370 extern void fib_node_lock(fib_node_t *node);
371 extern void fib_node_unlock(fib_node_t *node);
372 
373 extern u32 fib_node_get_n_children(fib_node_type_t parent_type,
374  fib_node_index_t parent_index);
375 extern u32 fib_node_child_add(fib_node_type_t parent_type,
376  fib_node_index_t parent_index,
377  fib_node_type_t child_type,
378  fib_node_index_t child_index);
379 extern void fib_node_child_remove(fib_node_type_t parent_type,
380  fib_node_index_t parent_index,
381  fib_node_index_t sibling_index);
382 
385 
387  u8 *s);
388 
389 extern const char* fib_node_type_get_name(fib_node_type_t type);
390 
391 static inline int
393 {
394  return (FIB_NODE_INDEX_INVALID != ni);
395 }
396 
397 #endif
398 
FIB_NODE_TYPE_GENEVE_TUNNEL
@ FIB_NODE_TYPE_GENEVE_TUNNEL
Definition: fib_node.h:45
FIB_NODE_BW_REASON_LAST
@ FIB_NODE_BW_REASON_LAST
Marker.
Definition: fib_node.h:132
FIB_NODE_BW_REASON_FLAG_ADJ_DOWN
@ FIB_NODE_BW_REASON_FLAG_ADJ_DOWN
Definition: fib_node.h:163
FIB_NODE_BW_REASON_RESOLVE
@ FIB_NODE_BW_REASON_RESOLVE
Walk to re-resolve the child.
Definition: fib_node.h:97
FIB_NODE_TYPE_ENTRY
@ FIB_NODE_TYPE_ENTRY
Definition: fib_node.h:33
FIB_NODE_BW_REASON_INTERFACE_DOWN
@ FIB_NODE_BW_REASON_INTERFACE_DOWN
A resolving interface has gone down.
Definition: fib_node.h:111
fib_node_memory_show_t
void(* fib_node_memory_show_t)(void)
Function definition to display the amount of memory used by a type.
Definition: fib_node.h:283
FIB_NODE_TYPE_ADJ
@ FIB_NODE_TYPE_ADJ
Definition: fib_node.h:37
FIB_NODE_BW_REASON_FLAG_INTERFACE_UP
@ FIB_NODE_BW_REASON_FLAG_INTERFACE_UP
Definition: fib_node.h:158
FIB_NODE_BW_REASON_EVALUATE
@ FIB_NODE_BW_REASON_EVALUATE
Walk to re-evaluate the forwarding contributed by the parent.
Definition: fib_node.h:103
fib_node_back_walk_rc_t
enum fib_node_back_walk_rc_t_ fib_node_back_walk_rc_t
Return code from a back walk function.
FIB_NODE_BW_REASON_FLAG_NONE
@ FIB_NODE_BW_REASON_FLAG_NONE
Definition: fib_node.h:155
fib_node_vft_t_::fnv_last_lock
fib_node_last_lock_gone_t fnv_last_lock
Definition: fib_node.h:290
FIB_NODE_BW_REASON_FLAG_ADJ_MTU
@ FIB_NODE_BW_REASON_FLAG_ADJ_MTU
Definition: fib_node.h:162
fib_node_deinit
void fib_node_deinit(fib_node_t *node)
Definition: fib_node.c:197
FIB_NODE_TYPE_PATH
@ FIB_NODE_TYPE_PATH
Definition: fib_node.h:36
fib_node_ptr_t_::fnp_type
fib_node_type_t fnp_type
node type
Definition: fib_node.h:199
name
string name[64]
Definition: fib.api:25
fib_node_list_t
u32 fib_node_list_t
A list of FIB nodes.
Definition: fib_node.h:209
FIB_NODE_TYPE_LAST
@ FIB_NODE_TYPE_LAST
Definition: fib_node.h:57
fib_node_back_walk_ctx_t_::fnbw_flags
fib_node_bw_flags_t fnbw_flags
additional flags for the walk
Definition: fib_node.h:223
node
vlib_main_t vlib_node_runtime_t * node
Definition: nat44_ei.c:3047
fib_node_t_::fn_children
fib_node_list_t fn_children
Vector of nodes that depend upon/use/share this node.
Definition: fib_node.h:315
fib_node_vft_t_
A FIB graph nodes virtual function table.
Definition: fib_node.h:288
FIB_NODE_BW_REASON_INTERFACE_UP
@ FIB_NODE_BW_REASON_INTERFACE_UP
A resolving interface has come up.
Definition: fib_node.h:107
fib_node_children_format
u8 * fib_node_children_format(fib_node_list_t list, u8 *s)
Definition: fib_node.c:176
FIB_NODE_INDEX_INVALID
#define FIB_NODE_INDEX_INVALID
Definition: fib_types.h:30
u16
unsigned short u16
Definition: types.h:57
fib_node_t
struct fib_node_t_ fib_node_t
An node in the FIB graph.
fib_node_vft_t_::fnv_format
format_function_t * fnv_format
Definition: fib_node.h:292
fib_node_t_::fn_locks
u32 fn_locks
Number of dependents on this node.
Definition: fib_node.h:321
fib_node_bw_reason_flag_t
enum fib_node_bw_reason_flag_t_ fib_node_bw_reason_flag_t
Flags enum constructed from the reaons.
fib_node_back_walk_ctx_t
struct fib_node_back_walk_ctx_t_ fib_node_back_walk_ctx_t
Context passed between object during a back walk.
fib_node_init
void fib_node_init(fib_node_t *node, fib_node_type_t ft)
Definition: fib_node.c:185
fib_node_get_n_children
u32 fib_node_get_n_children(fib_node_type_t parent_type, fib_node_index_t parent_index)
Definition: fib_node.c:142
fib_node_type_t
enum fib_node_type_t_ fib_node_type_t
The types of nodes in a FIB graph.
fib_node_child_add
u32 fib_node_child_add(fib_node_type_t parent_type, fib_node_index_t parent_index, fib_node_type_t child_type, fib_node_index_t child_index)
Definition: fib_node.c:98
fib_node_ptr_walk_t
int(* fib_node_ptr_walk_t)(fib_node_ptr_t *depend, void *ctx)
A callback function for walking a node dependency list.
Definition: fib_node.h:245
FIB_NODE_TYPE_BIER_FMASK
@ FIB_NODE_TYPE_BIER_FMASK
Definition: fib_node.h:47
FIB_NODE_TYPE_LISP_ADJ
@ FIB_NODE_TYPE_LISP_ADJ
Definition: fib_node.h:41
fib_node_back_walk_ctx_t_::fnbw_reason
fib_node_bw_reason_flag_t fnbw_reason
The reason/trigger for the backwalk.
Definition: fib_node.h:218
FIB_NODE_BW_REASON_FLAG_EVALUATE
@ FIB_NODE_BW_REASON_FLAG_EVALUATE
Definition: fib_node.h:157
FIB_NODE_BW_REASON_FIRST
@ FIB_NODE_BW_REASON_FIRST
Marker.
Definition: fib_node.h:92
FIB_NODE_TYPE_MPLS_TUNNEL
@ FIB_NODE_TYPE_MPLS_TUNNEL
Definition: fib_node.h:39
FIB_NODE_BW_REASON_INTERFACE_DELETE
@ FIB_NODE_BW_REASON_INTERFACE_DELETE
A resolving interface has been deleted.
Definition: fib_node.h:115
fib_node_vft_t_::fnv_mem_show
fib_node_memory_show_t fnv_mem_show
Definition: fib_node.h:293
fib_node_t_::fn_type
fib_node_type_t fn_type
The node's type.
Definition: fib_node.h:305
fib_node_vft_t
struct fib_node_vft_t_ fib_node_vft_t
A FIB graph nodes virtual function table.
fib_node_unlock
void fib_node_unlock(fib_node_t *node)
Definition: fib_node.c:209
fib_node_back_walk_one
fib_node_back_walk_rc_t fib_node_back_walk_one(fib_node_ptr_t *ptr, fib_node_back_walk_ctx_t *ctx)
Definition: fib_node.c:154
FIB_NODE_TYPE_IPSEC_SA
@ FIB_NODE_TYPE_IPSEC_SA
Definition: fib_node.h:50
FIB_NODE_TYPE_MPLS_ENTRY
@ FIB_NODE_TYPE_MPLS_ENTRY
Definition: fib_node.h:38
fib_types.h
FIB_NODE_TYPE_PATH_LIST
@ FIB_NODE_TYPE_PATH_LIST
Definition: fib_node.h:35
FIB_NODE_BW_REASON_FLAG_RESOLVE
@ FIB_NODE_BW_REASON_FLAG_RESOLVE
Definition: fib_node.h:156
fib_node_last_lock_gone_t
void(* fib_node_last_lock_gone_t)(struct fib_node_t_ *node)
Function definition to inform the FIB node that its last lock has gone.
Definition: fib_node.h:277
fib_node_index_t
u32 fib_node_index_t
A typedef of a node index.
Definition: fib_types.h:29
fib_node_get_t
struct fib_node_t_ *(* fib_node_get_t)(fib_node_index_t index)
Function definition to get a FIB node from its index.
Definition: fib_node.h:272
fib_node_bw_flags_t_
fib_node_bw_flags_t_
Flags on the walk.
Definition: fib_node.h:174
fib_show_memory_usage
void fib_show_memory_usage(const char *name, u32 in_use_elts, u32 allocd_elts, size_t size_elt)
Show the memory usage for a type.
Definition: fib_node.c:220
FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE
@ FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE
Definition: fib_node.h:161
FIB_NODE_TYPE_FIRST
@ FIB_NODE_TYPE_FIRST
Marker.
Definition: fib_node.h:28
fib_node_t_::fn_pad
u16 fn_pad
Some pad space the concrete/derived type is free to use.
Definition: fib_node.h:310
FIB_NODE_BACK_WALK_CONTINUE
@ FIB_NODE_BACK_WALK_CONTINUE
Definition: fib_node.h:259
fib_node_ptr_t_
A representation of one pointer to another node.
Definition: fib_node.h:195
FIB_NODE_BW_REASON_ADJ_UPDATE
@ FIB_NODE_BW_REASON_ADJ_UPDATE
Walk to re-collapse the multipath adjs when the rewrite of a unipath adjacency changes.
Definition: fib_node.h:120
FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN
@ FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN
Definition: fib_node.h:159
fib_node_back_walk_t
fib_node_back_walk_rc_t(* fib_node_back_walk_t)(struct fib_node_t_ *node, fib_node_back_walk_ctx_t *ctx)
Function definition to backwalk a FIB node.
Definition: fib_node.h:265
FIB_NODE_TYPE_MFIB_ENTRY
@ FIB_NODE_TYPE_MFIB_ENTRY
Definition: fib_node.h:34
fib_node_ptr_list_t
fib_node_ptr_t fib_node_ptr_list_t
A list of dependent nodes.
Definition: fib_node.h:252
FIB_NODE_TYPE_WALK
@ FIB_NODE_TYPE_WALK
See the respective fib_*.h files for descriptions of these objects.
Definition: fib_node.h:32
STATIC_ASSERT
STATIC_ASSERT(sizeof(fib_node_bw_reason_flag_t)< 2, "BW Reason enum < 2 byte. Consequences for cover_upd_res_t")
FIB_NODE_BACK_WALK_MERGE
@ FIB_NODE_BACK_WALK_MERGE
Definition: fib_node.h:258
fib_node_child_remove
void fib_node_child_remove(fib_node_type_t parent_type, fib_node_index_t parent_index, fib_node_index_t sibling_index)
Definition: fib_node.c:123
format_function_t
u8 *() format_function_t(u8 *s, va_list *args)
Definition: format.h:48
fib_node_register_type
void fib_node_register_type(fib_node_type_t ft, const fib_node_vft_t *vft)
Register the function table for a given type.
Definition: fib_node.c:60
fib_node_ptr_t_::fnp_index
fib_node_index_t fnp_index
node's index
Definition: fib_node.h:203
index
u32 index
Definition: flow_types.api:221
fib_node_bw_reason_flag_t_
fib_node_bw_reason_flag_t_
Flags enum constructed from the reaons.
Definition: fib_node.h:154
FIB_NODE_TYPE_MAP_E
@ FIB_NODE_TYPE_MAP_E
Definition: fib_node.h:43
FIB_NODE_TYPE_UDP_ENCAP
@ FIB_NODE_TYPE_UDP_ENCAP
Definition: fib_node.h:46
FIB_NODE_BW_FLAG_NONE
@ FIB_NODE_BW_FLAG_NONE
Definition: fib_node.h:176
FIB_NODE_TYPE_TEST
@ FIB_NODE_TYPE_TEST
Marker.
Definition: fib_node.h:56
FIB_NODE_TYPE_VXLAN_GPE_TUNNEL
@ FIB_NODE_TYPE_VXLAN_GPE_TUNNEL
Definition: fib_node.h:44
FIB_NODE_TYPE_IP_PUNT_REDIRECT
@ FIB_NODE_TYPE_IP_PUNT_REDIRECT
Definition: fib_node.h:51
u32
unsigned int u32
Definition: types.h:88
FIB_NODE_TYPE_VXLAN_GBP_TUNNEL
@ FIB_NODE_TYPE_VXLAN_GBP_TUNNEL
Definition: fib_node.h:49
ctx
long ctx[MAX_CONNS]
Definition: main.c:144
FIB_NODE_TYPE_VXLAN_TUNNEL
@ FIB_NODE_TYPE_VXLAN_TUNNEL
Definition: fib_node.h:42
FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE
@ FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE
Definition: fib_node.h:160
fib_node_t_
An node in the FIB graph.
Definition: fib_node.h:301
fib_node_type_t_
fib_node_type_t_
The types of nodes in a FIB graph.
Definition: fib_node.h:24
fib_node_back_walk_ctx_t_::fnbw_depth
u32 fnbw_depth
the number of levels the walk has already traversed.
Definition: fib_node.h:231
fib_node_back_walk_reason_t
enum fib_node_back_walk_reason_t_ fib_node_back_walk_reason_t
Reasons for backwalking the FIB object graph.
fib_node_index_is_valid
static int fib_node_index_is_valid(fib_node_index_t ni)
Definition: fib_node.h:392
u8
unsigned char u8
Definition: types.h:56
FIB_NODE_BW_REASON_ADJ_MTU
@ FIB_NODE_BW_REASON_ADJ_MTU
Walk update the adjacency MTU.
Definition: fib_node.h:124
fib_node_back_walk_rc_t_
fib_node_back_walk_rc_t_
Return code from a back walk function.
Definition: fib_node.h:257
FIB_NODE_BW_REASON_ADJ_DOWN
@ FIB_NODE_BW_REASON_ADJ_DOWN
Walk to update children to inform them the adjacency is now down.
Definition: fib_node.h:128
fib_node_back_walk_ctx_t_
Context passed between object during a back walk.
Definition: fib_node.h:214
fib_node_vft_t_::fnv_get
fib_node_get_t fnv_get
Definition: fib_node.h:289
fib_node_vft_t_::fnv_back_walk
fib_node_back_walk_t fnv_back_walk
Definition: fib_node.h:291
FIB_NODE_BW_FLAG_FORCE_SYNC
@ FIB_NODE_BW_FLAG_FORCE_SYNC
Force the walk to be synchronous.
Definition: fib_node.h:180
FIB_NODE_TYPE_LISP_GPE_FWD_ENTRY
@ FIB_NODE_TYPE_LISP_GPE_FWD_ENTRY
Definition: fib_node.h:40
fib_node_type_get_name
const char * fib_node_type_get_name(fib_node_type_t type)
Definition: fib_node.c:37
FIB_NODE_TYPE_ENTRY_TRACK
@ FIB_NODE_TYPE_ENTRY_TRACK
Definition: fib_node.h:52
fib_node_bw_flags_t
enum fib_node_bw_flags_t_ fib_node_bw_flags_t
Flags on the walk.
fib_node_back_walk_reason_t_
fib_node_back_walk_reason_t_
Reasons for backwalking the FIB object graph.
Definition: fib_node.h:88
FIB_NODE_TYPE_BIER_ENTRY
@ FIB_NODE_TYPE_BIER_ENTRY
Definition: fib_node.h:48
fib_node_ptr_t
struct fib_node_ptr_t_ fib_node_ptr_t
A representation of one pointer to another node.
format_fib_node_bw_reason
u8 * format_fib_node_bw_reason(u8 *s, va_list *args)
Definition: fib_walk.c:973
type
vl_api_fib_path_type_t type
Definition: fib_types.api:123
fib_node_lock
void fib_node_lock(fib_node_t *node)
Definition: fib_node.c:203
fib_node_register_new_type
fib_node_type_t fib_node_register_new_type(const fib_node_vft_t *vft)
Create a new FIB node type and Register the function table for it.
Definition: fib_node.c:80