29 u8 packet_data[64 - 1*
sizeof(
u32)];
32 #define foreach_mpls_output_next \ 36 #define _(s,n) MPLS_OUTPUT_NEXT_##s, 50 s =
format (s,
"adj-idx %d : %U flow hash: 0x%08x",
67 u32 n_left_from, next_index, * from, * to_next, thread_index;
79 while (n_left_from > 0)
82 to_next, n_left_to_next);
84 while (n_left_from >= 4 && n_left_to_next >= 2)
89 u32 pi0, rw_len0, adj_index0, next0, error0;
94 u32 pi1, rw_len1, adj_index1, next1, error1;
110 pi0 = to_next[0] = from[0];
111 pi1 = to_next[1] = from[1];
134 rw_len0 = adj0[0].rewrite_header.data_bytes;
135 rw_len1 = adj1[0].rewrite_header.data_bytes;
153 adj0[0].rewrite_header.max_l3_packet_bytes))
159 adj0[0].rewrite_header.sw_if_index;
160 next0 = adj0[0].rewrite_header.next_index;
161 error0 = IP4_ERROR_NONE;
165 adj0[0].rewrite_header.sw_if_index,
170 error0 = IP4_ERROR_MTU_EXCEEDED;
171 next0 = MPLS_OUTPUT_NEXT_DROP;
174 adj1[0].rewrite_header.max_l3_packet_bytes))
180 adj1[0].rewrite_header.sw_if_index;
181 next1 = adj1[0].rewrite_header.next_index;
182 error1 = IP4_ERROR_NONE;
186 adj1[0].rewrite_header.sw_if_index,
191 error1 = IP4_ERROR_MTU_EXCEEDED;
192 next1 = MPLS_OUTPUT_NEXT_DROP;
225 to_next, n_left_to_next,
226 pi0, pi1, next0, next1);
229 while (n_left_from > 0 && n_left_to_next > 0)
234 u32 pi0, rw_len0, adj_index0, next0, error0;
236 pi0 = to_next[0] = from[0];
250 rw_len0 = adj0[0].rewrite_header.data_bytes;
261 adj0[0].rewrite_header.max_l3_packet_bytes))
267 adj0[0].rewrite_header.sw_if_index;
268 next0 = adj0[0].rewrite_header.next_index;
269 error0 = IP4_ERROR_NONE;
273 adj0[0].rewrite_header.sw_if_index,
278 error0 = IP4_ERROR_MTU_EXCEEDED;
279 next0 = MPLS_OUTPUT_NEXT_DROP;
302 to_next, n_left_to_next,
309 MPLS_ERROR_PKTS_ENCAP,
316 #define mpls_error(n,s) s, 331 .name =
"mpls-output",
333 .vector_size =
sizeof (
u32),
339 #define _(s,n) [MPLS_OUTPUT_NEXT_##s] = n, 359 .name =
"mpls-midchain",
360 .vector_size =
sizeof (
u32),
364 .sibling_of =
"mpls-output",
372 #define foreach_mpls_adj_incomplete_next \ 373 _(DROP, "error-drop") \ 375 _(IP6, "ip6-discover-neighbor") 378 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s, 406 u32 n_left_from, next_index, * from, * to_next;
412 while (n_left_from > 0)
417 to_next, n_left_to_next);
419 while (n_left_from > 0 && n_left_to_next > 0)
421 u32 pi0, next0, adj_index0;
425 pi0 = to_next[0] = from[0];
438 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
442 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
453 to_next, n_left_to_next,
474 s =
format (s,
"%Unext:%d",
482 .name =
"mpls-adj-incomplete",
485 .vector_size =
sizeof (
u32),
491 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n, #define vnet_rewrite_one_header(rw0, p0, most_likely_size)
#define foreach_mpls_output_next
static void vlib_increment_combined_counter(vlib_combined_counter_main_t *cm, u32 thread_index, u32 index, u64 n_packets, u64 n_bytes)
Increment a combined counter.
A struct to hold tracing information for the MPLS label imposition node.
static u8 * format_mpls_adj_incomplete_trace(u8 *s, va_list *args)
vlib_error_t * errors
Vector of errors for this node.
static uword vlib_buffer_length_in_chain(vlib_main_t *vm, vlib_buffer_t *b)
Get length in bytes of the buffer chain.
struct ip_adjacency_t_::@38::@40 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
static u8 * format_mpls_output_trace(u8 *s, va_list *args)
vlib_node_registration_t mpls_midchain_node
(constructor) VLIB_REGISTER_NODE (mpls_midchain_node)
vlib_node_registration_t mpls_output_node
(constructor) VLIB_REGISTER_NODE (mpls_output_node)
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
i16 current_data
signed offset in data[], pre_data[] that we are currently processing.
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
mpls_adj_incomplete_next_t
u8 output_feature_arc_index
u16 current_length
Nbytes between current data and the end of this buffer.
static void * vlib_buffer_get_current(vlib_buffer_t *b)
Get pointer to current data to process.
static uword mpls_adj_incomplete(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame)
Graph node for incomplete MPLS adjacency.
#define vlib_validate_buffer_enqueue_x2(vm, node, next_index, to_next, n_left_to_next, bi0, bi1, next0, next1)
Finish enqueueing two buffers forward in the graph.
#define vlib_validate_buffer_enqueue_x1(vm, node, next_index, to_next, n_left_to_next, bi0, next0)
Finish enqueueing one buffer forward in the graph.
#define vlib_get_next_frame(vm, node, next_index, vectors, n_vectors_left)
Get pointer to next frame vector data by (vlib_node_runtime_t, next_index).
vlib_combined_counter_main_t adjacency_counters
Adjacency packet counters.
vlib_error_t error
Error code for buffers to be enqueued to error handler.
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
static uword mpls_output(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame)
union ip_adjacency_t_::@38 sub_type
static_always_inline uword vlib_get_thread_index(void)
#define CLIB_PREFETCH(addr, size, type)
#define foreach_mpls_adj_incomplete_next
Next index values from the MPLS incomplete adj node.
#define VLIB_BUFFER_IS_TRACED
static vlib_node_runtime_t * vlib_node_get_runtime(vlib_main_t *vm, u32 node_index)
Get node runtime by node index.
#define clib_memcpy(a, b, c)
void vlib_put_next_frame(vlib_main_t *vm, vlib_node_runtime_t *r, u32 next_index, u32 n_vectors_left)
Release pointer to next frame vector data.
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
static uword mpls_output_inline(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame, int is_midchain)
static void * vlib_add_trace(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_buffer_t *b, u32 n_data_bytes)
static char * mpls_error_strings[]
fib_protocol_t ia_nh_proto
The protocol of the neighbor/peer.
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
#define VLIB_NODE_FUNCTION_MULTIARCH(node, fn)
#define VLIB_REGISTER_NODE(x,...)
struct mpls_adj_incomplete_trace_t_ mpls_adj_incomplete_trace_t
A struct to hold tracing information for the MPLS label imposition node.
u8 packet_data[64-1 *sizeof(u32)]
vlib_node_registration_t mpls_adj_incomplete_node
(constructor) VLIB_REGISTER_NODE (mpls_adj_incomplete_node)
#define vnet_rewrite_two_headers(rw0, rw1, p0, p1, most_likely_size)
u32 flags
buffer flags: VLIB_BUFFER_FREE_LIST_INDEX_MASK: bits used to store free list index, VLIB_BUFFER_IS_TRACED: trace this buffer.
This adjacency/interface has output features configured.
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
static uword mpls_midchain(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame)
static_always_inline void vnet_feature_arc_start(u8 arc, u32 sw_if_index, u32 *next0, vlib_buffer_t *b0)