Go to the source code of this file.
|
static u8 * | format_mpls_output_trace (u8 *s, va_list *args) |
|
static uword | mpls_output_inline (vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame, int is_midchain) |
|
VLIB_NODE_FN() | mpls_output_node (vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame) |
|
VLIB_NODE_FN() | mpls_midchain_node (vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame) |
|
VLIB_NODE_FN() | mpls_adj_incomplete_node (vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame) |
| Graph node for incomplete MPLS adjacency. More...
|
|
static u8 * | format_mpls_adj_incomplete_trace (u8 *s, va_list *args) |
|
◆ foreach_mpls_adj_incomplete_next
#define foreach_mpls_adj_incomplete_next |
Value:_(
IP6,
"ip6-discover-neighbor")
Next index values from the MPLS incomplete adj node.
Definition at line 359 of file mpls_output.c.
◆ foreach_mpls_output_next
#define foreach_mpls_output_next _(DROP, "error-drop") |
◆ mpls_error
#define mpls_error |
( |
|
n, |
|
|
|
s |
|
) |
| s, |
◆ mpls_adj_incomplete_trace_t
A struct to hold tracing information for the MPLS label imposition node.
◆ mpls_adj_incomplete_next_t
Enumerator |
---|
MPLS_ADJ_INCOMPLETE_N_NEXT | |
Definition at line 364 of file mpls_output.c.
◆ mpls_output_next_t
◆ format_mpls_adj_incomplete_trace()
static u8* format_mpls_adj_incomplete_trace |
( |
u8 * |
s, |
|
|
va_list * |
args |
|
) |
| |
|
static |
◆ format_mpls_output_trace()
static u8* format_mpls_output_trace |
( |
u8 * |
s, |
|
|
va_list * |
args |
|
) |
| |
|
static |
◆ mpls_adj_incomplete_node()
Graph node for incomplete MPLS adjacency.
This node will push traffic to either the v4-arp or v6-nd node based on the next-hop proto of the adj. We pay a cost for this 'routing' node, but an incomplete adj is the exception case.
Definition at line 388 of file mpls_output.c.
◆ mpls_midchain_node()
◆ mpls_output_inline()
◆ mpls_output_node()
◆ mpls_adj_incomplete_node
Initial value:= {
.name = "mpls-adj-incomplete",
.vector_size =
sizeof (
u32),
.next_nodes = {
#define _(s,n)
},
}
static u8 * format_mpls_adj_incomplete_trace(u8 *s, va_list *args)
#define foreach_mpls_adj_incomplete_next
Next index values from the MPLS incomplete adj node.
static char * mpls_error_strings[]
(constructor) VLIB_REGISTER_NODE (mpls_adj_incomplete_node)
Definition at line 466 of file mpls_output.c.
◆ mpls_error_strings
char* mpls_error_strings[] |
|
static |
Initial value:= {
#define mpls_error(n,s)
mpls_error (PKTS_DECAP, "MPLS input packets decapsulated")
mpls_error (PKTS_ENCAP, "MPLS output packets encapsulated")
}
for(i=1;i<=collision_buckets;i++)
Definition at line 310 of file mpls_output.c.
◆ mpls_midchain_node
Initial value:= {
.name = "mpls-midchain",
.vector_size =
sizeof (
u32),
.sibling_of = "mpls-output",
}
static u8 * format_mpls_output_trace(u8 *s, va_list *args)
(constructor) VLIB_REGISTER_NODE (mpls_midchain_node)
Definition at line 347 of file mpls_output.c.
◆ mpls_output_node
Initial value:= {
.name = "mpls-output",
.vector_size =
sizeof (
u32),
.next_nodes = {
#define _(s,n)
},
}
#define foreach_mpls_output_next
static u8 * format_mpls_output_trace(u8 *s, va_list *args)
static char * mpls_error_strings[]
(constructor) VLIB_REGISTER_NODE (mpls_output_node)
Definition at line 323 of file mpls_output.c.