35 #define foreach_mpls_output_next \ 36 _(DROP, "error-drop") \ 40 #define _(s,n) MPLS_OUTPUT_NEXT_##s, 53 s =
format (s,
"adj-idx %d : %U flow hash: 0x%08x",
66 u32 n_left_from, next_index, * from, * to_next, thread_index;
78 while (n_left_from > 0)
81 to_next, n_left_to_next);
83 while (n_left_from >= 4 && n_left_to_next >= 2)
88 u32 pi0, adj_index0, next0, error0;
94 u32 pi1, adj_index1, next1, error1;
111 pi0 = to_next[0] = from[0];
112 pi1 = to_next[1] = from[1];
135 rw_len0 = adj0[0].rewrite_header.data_bytes;
136 rw_len1 = adj1[0].rewrite_header.data_bytes;
137 vnet_buffer (p0)->mpls.save_rewrite_length = rw_len0;
138 vnet_buffer (p1)->mpls.save_rewrite_length = rw_len1;
156 adj0[0].rewrite_header.max_l3_packet_bytes))
161 adj0[0].rewrite_header.sw_if_index;
162 next0 = adj0[0].rewrite_header.next_index;
163 error0 = IP4_ERROR_NONE;
167 adj0[0].rewrite_header.sw_if_index,
172 error0 = IP4_ERROR_MTU_EXCEEDED;
173 next0 = MPLS_OUTPUT_NEXT_FRAG;
175 MPLS_ERROR_PKTS_NEED_FRAG,
179 adj1[0].rewrite_header.max_l3_packet_bytes))
184 adj1[0].rewrite_header.sw_if_index;
185 next1 = adj1[0].rewrite_header.next_index;
186 error1 = IP4_ERROR_NONE;
190 adj1[0].rewrite_header.sw_if_index,
195 error1 = IP4_ERROR_MTU_EXCEEDED;
196 next1 = MPLS_OUTPUT_NEXT_FRAG;
198 MPLS_ERROR_PKTS_NEED_FRAG,
230 to_next, n_left_to_next,
231 pi0, pi1, next0, next1);
234 while (n_left_from > 0 && n_left_to_next > 0)
239 u32 pi0, adj_index0, next0, error0;
242 pi0 = to_next[0] = from[0];
256 rw_len0 = adj0[0].rewrite_header.data_bytes;
257 vnet_buffer (p0)->mpls.save_rewrite_length = rw_len0;
268 adj0[0].rewrite_header.max_l3_packet_bytes))
273 adj0[0].rewrite_header.sw_if_index;
274 next0 = adj0[0].rewrite_header.next_index;
275 error0 = IP4_ERROR_NONE;
279 adj0[0].rewrite_header.sw_if_index,
284 error0 = IP4_ERROR_MTU_EXCEEDED;
285 next0 = MPLS_OUTPUT_NEXT_FRAG;
287 MPLS_ERROR_PKTS_NEED_FRAG,
313 to_next, n_left_to_next,
320 MPLS_ERROR_PKTS_ENCAP,
327 #define mpls_error(n,s) s, 340 .name =
"mpls-output",
342 .vector_size =
sizeof (
u32),
348 [MPLS_OUTPUT_NEXT_DROP] =
"mpls-drop",
349 [MPLS_OUTPUT_NEXT_FRAG] =
"mpls-frag",
362 .name =
"mpls-midchain",
363 .vector_size =
sizeof (
u32),
368 .sibling_of =
"mpls-output",
373 #define _(sym,string) string, 398 u32 n_left_from, next_index, * from, * to_next, n_left_to_next, *frags;
407 while (n_left_from > 0)
410 to_next, n_left_to_next);
412 while (n_left_from > 0 && n_left_to_next > 0)
422 pi0 = to_next[0] = from[0];
437 adj0->rewrite_header.max_l3_packet_bytes,
441 adj0->rewrite_header.max_l3_packet_bytes,
448 tr->
mtu = adj0->rewrite_header.max_l3_packet_bytes;
460 else if (is_ip4 && error0 == IP_FRAG_ERROR_DONT_FRAGMENT_SET)
463 p0, ICMP4_destination_unreachable,
464 ICMP4_destination_unreachable_fragmentation_needed_and_dont_fragment_set,
476 u32 *frag_from, frag_left;
481 while (frag_left > 0)
483 while (frag_left > 0 && n_left_to_next > 0)
486 i = to_next[0] = frag_from[0];
496 to_next, n_left_to_next, i,
526 .vector_size =
sizeof (
u32),
545 #define foreach_mpls_adj_incomplete_next \ 546 _(DROP, "error-drop") \ 548 _(IP6, "ip6-discover-neighbor") 551 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s, 578 u32 n_left_from, next_index, * from, * to_next;
581 n_left_from = from_frame->n_vectors;
582 next_index =
node->cached_next_index;
584 while (n_left_from > 0)
589 to_next, n_left_to_next);
591 while (n_left_from > 0 && n_left_to_next > 0)
593 u32 pi0, next0, adj_index0;
597 pi0 = to_next[0] = from[0];
610 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
614 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
625 to_next, n_left_to_next,
632 return from_frame->n_vectors;
646 s =
format (s,
"%Unext:%d",
653 .name =
"mpls-adj-incomplete",
656 .vector_size =
sizeof (
u32),
662 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n, #define vnet_rewrite_one_header(rw0, p0, 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.
#define foreach_mpls_output_next
#define foreach_ip_frag_error
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.
i16 current_data
signed offset in data[], pre_data[] that we are currently processing.
static void vlib_error_count(vlib_main_t *vm, uword node_index, uword counter, uword increment)
A struct to hold tracing information for the MPLS label imposition node.
static u8 * format_mpls_frag_trace(u8 *s, va_list *args)
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
static u8 * format_mpls_adj_incomplete_trace(u8 *s, va_list *args)
union ip_adjacency_t_::@137 sub_type
#define VLIB_NODE_FN(node)
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.
#define vec_reset_length(v)
Reset vector length to zero NULL-pointer tolerant.
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.
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
mpls_adj_incomplete_next_t
struct ip_adjacency_t_::@137::@139 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
u8 output_feature_arc_index
static uword mpls_output_inline(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame, mpls_output_mode_t mode)
vl_api_fib_path_type_t type
vlib_error_t error
Error code for buffers to be enqueued to error handler.
vlib_node_registration_t mpls_frag_node
(constructor) VLIB_REGISTER_NODE (mpls_frag_node)
static char * mpls_frag_error_strings[]
static void * vlib_buffer_get_current(vlib_buffer_t *b)
Get pointer to current data to process.
#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.
vl_api_tunnel_mode_t mode
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
#define VLIB_REGISTER_NODE(x,...)
ip_frag_error_t ip6_frag_do_fragment(vlib_main_t *vm, u32 from_bi, u16 mtu, u16 l2unfragmentablesize, u32 **buffer)
static_always_inline uword vlib_get_thread_index(void)
#define CLIB_PREFETCH(addr, size, type)
sll srl srl sll sra u16x4 i
#define vec_free(V)
Free vector's memory (no header).
#define foreach_mpls_adj_incomplete_next
static vlib_node_runtime_t * vlib_node_get_runtime(vlib_main_t *vm, u32 node_index)
Get node runtime by node index.
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.
vlib_main_t vlib_node_runtime_t * node
This packets follow a mid-chain adjacency.
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
static void vlib_buffer_advance(vlib_buffer_t *b, word l)
Advance current data pointer by the supplied (signed!) amount.
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.
struct mpls_frag_trace_t_ mpls_frag_trace_t
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
ip_lookup_next_t lookup_next_index
Next hop after ip4-lookup.
VLIB buffer representation.
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
ip_frag_error_t ip4_frag_do_fragment(vlib_main_t *vm, u32 from_bi, u16 mtu, u16 l2unfragmentablesize, u32 **buffer)
struct mpls_adj_incomplete_trace_t_ mpls_adj_incomplete_trace_t
A struct to hold tracing information for the MPLS label imposition node.
vlib_main_t vlib_node_runtime_t vlib_frame_t * frame
static void vlib_buffer_free_one(vlib_main_t *vm, u32 buffer_index)
Free one buffer Shorthand to free a single buffer chain.
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)
This adjacency/interface has output features configured.
static_always_inline void icmp4_error_set_vnet_buffer(vlib_buffer_t *b, u8 type, u8 code, u32 data)
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
static uword mpls_frag(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
static_always_inline void vnet_feature_arc_start(u8 arc, u32 sw_if_index, u32 *next0, vlib_buffer_t *b0)