29 #define foreach_mpls_output_next \ 33 #define _(s,n) MPLS_OUTPUT_NEXT_##s, 46 s =
format (s,
"adj-idx %d : %U flow hash: 0x%08x",
59 u32 n_left_from, next_index, * from, * to_next, thread_index;
71 while (n_left_from > 0)
74 to_next, n_left_to_next);
76 while (n_left_from >= 4 && n_left_to_next >= 2)
81 u32 pi0, rw_len0, adj_index0, next0, error0;
86 u32 pi1, rw_len1, adj_index1, next1, error1;
102 pi0 = to_next[0] = from[0];
103 pi1 = to_next[1] = from[1];
126 rw_len0 = adj0[0].rewrite_header.data_bytes;
127 rw_len1 = adj1[0].rewrite_header.data_bytes;
128 vnet_buffer (p0)->mpls.save_rewrite_length = rw_len0;
129 vnet_buffer (p1)->mpls.save_rewrite_length = rw_len1;
147 adj0[0].rewrite_header.max_l3_packet_bytes))
153 adj0[0].rewrite_header.sw_if_index;
154 next0 = adj0[0].rewrite_header.next_index;
155 error0 = IP4_ERROR_NONE;
159 adj0[0].rewrite_header.sw_if_index,
164 error0 = IP4_ERROR_MTU_EXCEEDED;
165 next0 = MPLS_OUTPUT_NEXT_DROP;
168 adj1[0].rewrite_header.max_l3_packet_bytes))
174 adj1[0].rewrite_header.sw_if_index;
175 next1 = adj1[0].rewrite_header.next_index;
176 error1 = IP4_ERROR_NONE;
180 adj1[0].rewrite_header.sw_if_index,
185 error1 = IP4_ERROR_MTU_EXCEEDED;
186 next1 = MPLS_OUTPUT_NEXT_DROP;
217 to_next, n_left_to_next,
218 pi0, pi1, next0, next1);
221 while (n_left_from > 0 && n_left_to_next > 0)
226 u32 pi0, rw_len0, adj_index0, next0, error0;
228 pi0 = to_next[0] = from[0];
242 rw_len0 = adj0[0].rewrite_header.data_bytes;
243 vnet_buffer (p0)->mpls.save_rewrite_length = rw_len0;
254 adj0[0].rewrite_header.max_l3_packet_bytes))
260 adj0[0].rewrite_header.sw_if_index;
261 next0 = adj0[0].rewrite_header.next_index;
262 error0 = IP4_ERROR_NONE;
266 adj0[0].rewrite_header.sw_if_index,
271 error0 = IP4_ERROR_MTU_EXCEEDED;
272 next0 = MPLS_OUTPUT_NEXT_DROP;
297 to_next, n_left_to_next,
304 MPLS_ERROR_PKTS_ENCAP,
311 #define mpls_error(n,s) s, 326 .name =
"mpls-output",
328 .vector_size =
sizeof (
u32),
334 #define _(s,n) [MPLS_OUTPUT_NEXT_##s] = n, 354 .name =
"mpls-midchain",
355 .vector_size =
sizeof (
u32),
359 .sibling_of =
"mpls-output",
367 #define foreach_mpls_adj_incomplete_next \ 368 _(DROP, "error-drop") \ 370 _(IP6, "ip6-discover-neighbor") 373 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s, 401 u32 n_left_from, next_index, * from, * to_next;
407 while (n_left_from > 0)
412 to_next, n_left_to_next);
414 while (n_left_from > 0 && n_left_to_next > 0)
416 u32 pi0, next0, adj_index0;
420 pi0 = to_next[0] = from[0];
433 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
437 next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
448 to_next, n_left_to_next,
469 s =
format (s,
"%Unext:%d",
477 .name =
"mpls-adj-incomplete",
480 .vector_size =
sizeof (
u32),
486 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n, #define vnet_rewrite_one_header(rw0, p0, most_likely_size)
#define foreach_mpls_output_next
struct ip_adjacency_t_::@45::@47 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
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.
union ip_adjacency_t_::@45 sub_type
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.
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
#define VLIB_NODE_FUNCTION_MULTIARCH(node, fn)
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)
#define VLIB_REGISTER_NODE(x,...)
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.
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.
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.
struct mpls_adj_incomplete_trace_t_ mpls_adj_incomplete_trace_t
A struct to hold tracing information for the MPLS label imposition node.
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)