FD.io VPP
v17.10-9-gd594711
Vector Packet Processing
|
Go to the source code of this file.
Macros | |
#define | FIB_PATH_CFG_ATTRIBUTE_MAX (FIB_PATH_CFG_ATTRIBUTE_LAST + 1) |
The maximum number of path attributes. More... | |
#define | FIB_PATH_CFG_ATTRIBUTES |
#define | FOR_EACH_FIB_PATH_CFG_ATTRIBUTE(_item) |
Typedefs | |
typedef enum fib_path_cfg_attribute_t_ | fib_path_cfg_attribute_t |
Given a route of the form; q.r.s.t/Y via <interface> <next-hop> More... | |
typedef enum fib_path_cfg_flags_t_ | fib_path_cfg_flags_t |
Path config flags from the attributes. More... | |
#define FIB_PATH_CFG_ATTRIBUTE_MAX (FIB_PATH_CFG_ATTRIBUTE_LAST + 1) |
The maximum number of path attributes.
Definition at line 95 of file fib_path.h.
#define FIB_PATH_CFG_ATTRIBUTES |
Definition at line 97 of file fib_path.h.
#define FOR_EACH_FIB_PATH_CFG_ATTRIBUTE | ( | _item | ) |
Definition at line 109 of file fib_path.h.
typedef enum fib_path_cfg_attribute_t_ fib_path_cfg_attribute_t |
Given a route of the form; q.r.s.t/Y via <interface> <next-hop>
The prefix is: q.r.s.t./Y the path is: 'via <interface> <next-hop>
The path is the description of where to send the traffic, and the the prefix is a description of which traffic to send. It is the aim of the FIB to resolve the path, i.e. to find the corresponding adjacency to match the path's description. Enurmeration of path configuration attributes
typedef enum fib_path_cfg_flags_t_ fib_path_cfg_flags_t |
Path config flags from the attributes.
Given a route of the form; q.r.s.t/Y via <interface> <next-hop>
The prefix is: q.r.s.t./Y the path is: 'via <interface> <next-hop>
The path is the description of where to send the traffic, and the the prefix is a description of which traffic to send. It is the aim of the FIB to resolve the path, i.e. to find the corresponding adjacency to match the path's description. Enurmeration of path configuration attributes
Definition at line 42 of file fib_path.h.
Path config flags from the attributes.
Definition at line 117 of file fib_path.h.
u8* fib_path_adj_format | ( | fib_node_index_t | pi, |
u32 | indent, | ||
u8 * | s | ||
) |
load_balance_path_t* fib_path_append_nh_for_multipath_hash | ( | fib_node_index_t | path_index, |
fib_forward_chain_type_t | fct, | ||
load_balance_path_t * | hash_key | ||
) |
Definition at line 2057 of file fib_path.c.
int fib_path_cmp | ( | fib_node_index_t | path_index1, |
fib_node_index_t | path_index2 | ||
) |
Definition at line 1383 of file fib_path.c.
int fib_path_cmp_for_sort | ( | void * | a1, |
void * | a2 | ||
) |
Definition at line 1356 of file fib_path.c.
int fib_path_cmp_w_route_path | ( | fib_node_index_t | path_index, |
const fib_route_path_t * | rpath | ||
) |
Definition at line 1395 of file fib_path.c.
void fib_path_contribute_forwarding | ( | fib_node_index_t | path_index, |
fib_forward_chain_type_t | type, | ||
dpo_id_t * | dpo | ||
) |
Definition at line 1899 of file fib_path.c.
void fib_path_contribute_urpf | ( | fib_node_index_t | path_index, |
index_t | urpf | ||
) |
Contribute the path's adjacency to the list passed.
By calling this function over all paths, recursively, a child can construct its full set of forwarding adjacencies, and hence its uRPF list.
Definition at line 1802 of file fib_path.c.
fib_node_index_t fib_path_copy | ( | fib_node_index_t | path_index, |
fib_node_index_t | path_list_index | ||
) |
Definition at line 1209 of file fib_path.c.
fib_node_index_t fib_path_create | ( | fib_node_index_t | pl_index, |
const fib_route_path_t * | path | ||
) |
Definition at line 1060 of file fib_path.c.
fib_node_index_t fib_path_create_special | ( | fib_node_index_t | pl_index, |
dpo_proto_t | nh_proto, | ||
fib_path_cfg_flags_t | flags, | ||
const dpo_id_t * | dpo | ||
) |
Definition at line 1163 of file fib_path.c.
void fib_path_destroy | ( | fib_node_index_t | path_index | ) |
Definition at line 1242 of file fib_path.c.
fib_path_list_walk_rc_t fib_path_encode | ( | fib_node_index_t | path_list_index, |
fib_node_index_t | path_index, | ||
void * | ctx | ||
) |
Definition at line 2136 of file fib_path.c.
u8* fib_path_format | ( | fib_node_index_t | pi, |
u8 * | s | ||
) |
Definition at line 497 of file fib_path.c.
adj_index_t fib_path_get_adj | ( | fib_node_index_t | path_index | ) |
Definition at line 1757 of file fib_path.c.
u16 fib_path_get_preference | ( | fib_node_index_t | path_index | ) |
Definition at line 1784 of file fib_path.c.
dpo_proto_t fib_path_get_proto | ( | fib_node_index_t | path_index | ) |
Definition at line 2184 of file fib_path.c.
u32 fib_path_get_resolving_interface | ( | fib_node_index_t | fib_entry_index | ) |
Definition at line 1727 of file fib_path.c.
u16 fib_path_get_weight | ( | fib_node_index_t | path_index | ) |
Definition at line 1772 of file fib_path.c.
uword fib_path_hash | ( | fib_node_index_t | path_index | ) |
Definition at line 1263 of file fib_path.c.
int fib_path_is_deag | ( | fib_node_index_t | path_index | ) |
Definition at line 2103 of file fib_path.c.
int fib_path_is_exclusive | ( | fib_node_index_t | path_index | ) |
Definition at line 2093 of file fib_path.c.
int fib_path_is_looped | ( | fib_node_index_t | path_index | ) |
Definition at line 2126 of file fib_path.c.
int fib_path_is_recursive_constrained | ( | fib_node_index_t | path_index | ) |
Definition at line 2081 of file fib_path.c.
int fib_path_is_resolved | ( | fib_node_index_t | path_index | ) |
Definition at line 2113 of file fib_path.c.
void fib_path_module_init | ( | void | ) |
Definition at line 2194 of file fib_path.c.
int fib_path_recursive_loop_detect | ( | fib_node_index_t | path_index, |
fib_node_index_t ** | entry_indicies | ||
) |
Definition at line 1490 of file fib_path.c.
int fib_path_resolve | ( | fib_node_index_t | path_index | ) |
Definition at line 1570 of file fib_path.c.
void fib_path_stack_mpls_disp | ( | fib_node_index_t | path_index, |
dpo_proto_t | payload_proto, | ||
dpo_id_t * | dpo | ||
) |
Definition at line 1861 of file fib_path.c.
Definition at line 375 of file fib_path.c.