30 #ifndef __FIB_PATH_H__ 31 #define __FIB_PATH_H__ 90 } __attribute__ ((packed)) fib_path_cfg_attribute_t;
95 #define FIB_PATH_CFG_ATTRIBUTE_MAX (FIB_PATH_CFG_ATTRIBUTE_LAST + 1) 97 #define FIB_PATH_CFG_ATTRIBUTES { \ 98 [FIB_PATH_CFG_ATTRIBUTE_DROP] = "drop", \ 99 [FIB_PATH_CFG_ATTRIBUTE_EXCLUSIVE] = "exclusive", \ 100 [FIB_PATH_CFG_ATTRIBUTE_RESOLVE_HOST] = "resolve-host", \ 101 [FIB_PATH_CFG_ATTRIBUTE_RESOLVE_ATTACHED] = "resolve-attached", \ 102 [FIB_PATH_CFG_ATTRIBUTE_LOCAL] = "local", \ 103 [FIB_PATH_CFG_ATTRIBUTE_ATTACHED] = "attached", \ 104 [FIB_PATH_CFG_ATTRIBUTE_INTF_RX] = "interface-rx", \ 105 [FIB_PATH_CFG_ATTRIBUTE_RPF_ID] = "rpf-id", \ 106 [FIB_PATH_CFG_ATTRIBUTE_DEAG_SRC] = "deag-src", \ 109 #define FOR_EACH_FIB_PATH_CFG_ATTRIBUTE(_item) \ 110 for (_item = FIB_PATH_CFG_ATTRIBUTE_FIRST; \ 111 _item <= FIB_PATH_CFG_ATTRIBUTE_LAST; \ The path is forced to a drop, whatever the next-hop info says.
int fib_path_is_recursive_constrained(fib_node_index_t path_index)
fib_node_index_t fib_path_create(fib_node_index_t pl_index, const fib_route_path_t *path)
u32 fib_path_get_resolving_interface(fib_node_index_t fib_entry_index)
The path is a deag with rpf-id.
A representation of a path as described by a route producer.
uword fib_path_hash(fib_node_index_t path_index)
index_t fib_path_get_resolving_index(fib_node_index_t path_index)
fib_path_cfg_attribute_t_
Given a route of the form; q.r.s.t/Y via <interface> <next-hop>
The path is an interface recieve.
u32 index_t
A Data-Path Object is an object that represents actions that are applied to packets are they are swit...
The path uses an adj that is exclusive.
adj_index_t fib_path_get_adj(fib_node_index_t path_index)
int fib_path_resolve(fib_node_index_t path_index)
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)
u8 * format_fib_path(u8 *s, va_list *args)
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)
Recursion constraint via attached.
int fib_path_cmp(fib_node_index_t path_index1, fib_node_index_t path_index2)
dpo_proto_t fib_path_get_proto(fib_node_index_t path_index)
enum dpo_proto_t_ dpo_proto_t
Data path protocol.
fib_node_index_t fib_path_copy(fib_node_index_t path_index, fib_node_index_t path_list_index)
The deag path does a source lookup.
The identity of a DPO is a combination of its type and its instance number/index of objects of that t...
u16 fib_path_get_preference(fib_node_index_t path_index)
void fib_path_contribute_urpf(fib_node_index_t path_index, index_t urpf)
Contribute the path's adjacency to the list passed.
fib_path_cfg_flags_t_
Path config flags from the attributes.
u32 fib_node_index_t
A typedef of a node index.
u32 adj_index_t
An index for adjacencies.
enum fib_forward_chain_type_t_ fib_forward_chain_type_t
FIB output chain type.
void fib_path_destroy(fib_node_index_t path_index)
void fib_path_module_init(void)
int fib_path_cmp_w_route_path(fib_node_index_t path_index, const fib_route_path_t *rpath)
enum fib_path_list_walk_rc_t_ fib_path_list_walk_rc_t
return code to control pat-hlist walk
int fib_path_recursive_loop_detect(fib_node_index_t path_index, fib_node_index_t **entry_indicies)
The path is a for-us path.
int fib_path_is_looped(fib_node_index_t path_index)
fib_path_list_walk_rc_t fib_path_encode(fib_node_index_t path_list_index, fib_node_index_t path_index, void *ctx)
Recursion constraint via host.
u32 fib_path_get_rpf_id(fib_node_index_t path_index)
One path from an [EU]CMP set that the client wants to add to a load-balance object.
void fib_path_stack_mpls_disp(fib_node_index_t path_index, dpo_proto_t payload_proto, dpo_id_t *dpo)
enum fib_path_cfg_flags_t_ fib_path_cfg_flags_t
Path config flags from the attributes.
void fib_path_contribute_forwarding(fib_node_index_t path_index, fib_forward_chain_type_t type, dpo_id_t *dpo)
int fib_path_is_deag(fib_node_index_t path_index)
int fib_path_is_exclusive(fib_node_index_t path_index)
int fib_path_is_resolved(fib_node_index_t path_index)
u16 fib_path_get_weight(fib_node_index_t path_index)
int fib_path_cmp_for_sort(void *a1, void *a2)