FD.io VPP  v21.06
Vector Packet Processing
mpls_output.c
Go to the documentation of this file.
1 /*
2  * mpls_output.c: MPLS Adj rewrite
3  *
4  * Copyright (c) 2012-2014 Cisco and/or its affiliates.
5  * Licensed under the Apache License, Version 2.0 (the "License");
6  * you may not use this file except in compliance with the License.
7  * You may obtain a copy of the License at:
8  *
9  * http://www.apache.org/licenses/LICENSE-2.0
10  *
11  * Unless required by applicable law or agreed to in writing, software
12  * distributed under the License is distributed on an "AS IS" BASIS,
13  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14  * See the License for the specific language governing permissions and
15  * limitations under the License.
16  */
17 
18 #include <vlib/vlib.h>
19 #include <vnet/ip/ip.h>
20 #include <vnet/mpls/mpls.h>
21 #include <vnet/ip/ip_frag.h>
22 #include <vnet/adj/adj_dp.h>
23 
24 typedef struct {
25  /* Adjacency taken. */
29 
30 typedef enum {
34 
35 #define foreach_mpls_output_next \
36 _(DROP, "error-drop") \
37 _(FRAG, "mpls-frag")
38 
39 typedef enum {
40 #define _(s,n) MPLS_OUTPUT_NEXT_##s,
42 #undef _
45 
46 static u8 *
47 format_mpls_output_trace (u8 * s, va_list * args)
48 {
49  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
50  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
51  mpls_output_trace_t * t = va_arg (*args, mpls_output_trace_t *);
52 
53  s = format (s, "adj-idx %d : %U flow hash: 0x%08x",
54  t->adj_index,
56  t->flow_hash);
57  return s;
58 }
59 
60 static inline uword
65 {
66  u32 n_left_from, next_index, * from, * to_next, thread_index;
67  vlib_node_runtime_t * error_node;
68  u32 n_left_to_next;
69  mpls_main_t *mm;
70 
71  thread_index = vlib_get_thread_index();
72  error_node = vlib_node_get_runtime (vm, mpls_output_node.index);
73  from = vlib_frame_vector_args (from_frame);
74  n_left_from = from_frame->n_vectors;
75  next_index = node->cached_next_index;
76  mm = &mpls_main;
77 
78  while (n_left_from > 0)
79  {
80  vlib_get_next_frame (vm, node, next_index,
81  to_next, n_left_to_next);
82 
83  while (n_left_from >= 4 && n_left_to_next >= 2)
84  {
85  ip_adjacency_t * adj0;
87  vlib_buffer_t * p0;
88  u32 pi0, adj_index0, next0, error0;
89  word rw_len0;
90 
91  ip_adjacency_t * adj1;
93  vlib_buffer_t * p1;
94  u32 pi1, adj_index1, next1, error1;
95  word rw_len1;
96 
97  /* Prefetch next iteration. */
98  {
99  vlib_buffer_t * p2, * p3;
100 
101  p2 = vlib_get_buffer (vm, from[2]);
102  p3 = vlib_get_buffer (vm, from[3]);
103 
104  vlib_prefetch_buffer_header (p2, STORE);
105  vlib_prefetch_buffer_header (p3, STORE);
106 
107  CLIB_PREFETCH (p2->data, sizeof (hdr0[0]), STORE);
108  CLIB_PREFETCH (p3->data, sizeof (hdr1[0]), STORE);
109  }
110 
111  pi0 = to_next[0] = from[0];
112  pi1 = to_next[1] = from[1];
113 
114  from += 2;
115  n_left_from -= 2;
116  to_next += 2;
117  n_left_to_next -= 2;
118 
119  p0 = vlib_get_buffer (vm, pi0);
120  p1 = vlib_get_buffer (vm, pi1);
121 
122  adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
123  adj_index1 = vnet_buffer (p1)->ip.adj_index[VLIB_TX];
124 
125  adj0 = adj_get(adj_index0);
126  adj1 = adj_get(adj_index1);
127  hdr0 = vlib_buffer_get_current (p0);
128  hdr1 = vlib_buffer_get_current (p1);
129 
130  /* Guess we are only writing on simple Ethernet header. */
131  vnet_rewrite_two_headers (adj0[0], adj1[0], hdr0, hdr1,
132  sizeof (ethernet_header_t));
133 
134  /* Update packet buffer attributes/set output interface. */
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;
139 
140  /* Bump the adj counters for packet and bytes */
143  thread_index,
144  adj_index0,
145  1,
146  vlib_buffer_length_in_chain (vm, p0) + rw_len0);
149  thread_index,
150  adj_index1,
151  1,
152  vlib_buffer_length_in_chain (vm, p1) + rw_len1);
153 
154  /* Check MTU of outgoing interface. */
156  adj0[0].rewrite_header.max_l3_packet_bytes))
157  {
158  vlib_buffer_advance(p0, -rw_len0);
159 
160  vnet_buffer (p0)->sw_if_index[VLIB_TX] =
161  adj0[0].rewrite_header.sw_if_index;
162  next0 = adj0[0].rewrite_header.next_index;
163  error0 = IP4_ERROR_NONE;
164 
165  if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
167  adj0[0].rewrite_header.sw_if_index,
168  &next0, p0);
169  }
170  else
171  {
172  error0 = IP4_ERROR_MTU_EXCEEDED;
173  next0 = MPLS_OUTPUT_NEXT_FRAG;
175  MPLS_ERROR_PKTS_NEED_FRAG,
176  1);
177  }
179  adj1[0].rewrite_header.max_l3_packet_bytes))
180  {
181  vlib_buffer_advance(p1, -rw_len1);
182 
183  vnet_buffer (p1)->sw_if_index[VLIB_TX] =
184  adj1[0].rewrite_header.sw_if_index;
185  next1 = adj1[0].rewrite_header.next_index;
186  error1 = IP4_ERROR_NONE;
187 
188  if (PREDICT_FALSE(adj1[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
190  adj1[0].rewrite_header.sw_if_index,
191  &next1, p1);
192  }
193  else
194  {
195  error1 = IP4_ERROR_MTU_EXCEEDED;
196  next1 = MPLS_OUTPUT_NEXT_FRAG;
198  MPLS_ERROR_PKTS_NEED_FRAG,
199  1);
200  }
201  if (mode == MPLS_OUTPUT_MIDCHAIN_MODE)
202  {
203  adj_midchain_fixup (vm, adj0, p0, VNET_LINK_MPLS);
204  adj_midchain_fixup (vm, adj1, p1, VNET_LINK_MPLS);
205  }
206 
207  p0->error = error_node->errors[error0];
208  p1->error = error_node->errors[error1];
209 
210  if (PREDICT_FALSE (p0->flags & VLIB_BUFFER_IS_TRACED))
211  {
212  mpls_output_trace_t *tr =
213  vlib_add_trace (vm, node, p0, sizeof (*tr));
214  tr->adj_index = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
215  tr->flow_hash = vnet_buffer (p0)->ip.flow_hash;
216  }
217  if (PREDICT_FALSE (p1->flags & VLIB_BUFFER_IS_TRACED))
218  {
219  mpls_output_trace_t *tr =
220  vlib_add_trace (vm, node, p1, sizeof (*tr));
221  tr->adj_index = vnet_buffer (p1)->ip.adj_index[VLIB_TX];
222  tr->flow_hash = vnet_buffer (p1)->ip.flow_hash;
223  }
224 
225  vlib_validate_buffer_enqueue_x2 (vm, node, next_index, to_next,
226  n_left_to_next, pi0, pi1, next0,
227  next1);
228  }
229 
230  while (n_left_from > 0 && n_left_to_next > 0)
231  {
232  ip_adjacency_t * adj0;
233  mpls_unicast_header_t *hdr0;
234  vlib_buffer_t * p0;
235  u32 pi0, adj_index0, next0, error0;
236  word rw_len0;
237 
238  pi0 = to_next[0] = from[0];
239 
240  p0 = vlib_get_buffer (vm, pi0);
241 
242  adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
243 
244  adj0 = adj_get(adj_index0);
245  hdr0 = vlib_buffer_get_current (p0);
246 
247  /* Guess we are only writing on simple Ethernet header. */
248  vnet_rewrite_one_header (adj0[0], hdr0,
249  sizeof (ethernet_header_t));
250 
251  /* Update packet buffer attributes/set output interface. */
252  rw_len0 = adj0[0].rewrite_header.data_bytes;
253  vnet_buffer (p0)->mpls.save_rewrite_length = rw_len0;
254 
257  thread_index,
258  adj_index0,
259  1,
260  vlib_buffer_length_in_chain (vm, p0) + rw_len0);
261 
262  /* Check MTU of outgoing interface. */
264  adj0[0].rewrite_header.max_l3_packet_bytes))
265  {
266  vlib_buffer_advance(p0, -rw_len0);
267 
268  vnet_buffer (p0)->sw_if_index[VLIB_TX] =
269  adj0[0].rewrite_header.sw_if_index;
270  next0 = adj0[0].rewrite_header.next_index;
271  error0 = IP4_ERROR_NONE;
272 
273  if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
275  adj0[0].rewrite_header.sw_if_index,
276  &next0, p0);
277  }
278  else
279  {
280  error0 = IP4_ERROR_MTU_EXCEEDED;
281  next0 = MPLS_OUTPUT_NEXT_FRAG;
283  MPLS_ERROR_PKTS_NEED_FRAG,
284  1);
285  }
286  if (mode == MPLS_OUTPUT_MIDCHAIN_MODE)
287  {
288  adj_midchain_fixup (vm, adj0, p0, VNET_LINK_MPLS);
289  }
290 
291  p0->error = error_node->errors[error0];
292 
293  from += 1;
294  n_left_from -= 1;
295  to_next += 1;
296  n_left_to_next -= 1;
297 
298  if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
299  {
300  mpls_output_trace_t *tr = vlib_add_trace (vm, node,
301  p0, sizeof (*tr));
302  tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
303  tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
304  }
305 
306  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
307  to_next, n_left_to_next,
308  pi0, next0);
309  }
310 
311  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
312  }
314  MPLS_ERROR_PKTS_ENCAP,
315  from_frame->n_vectors);
316 
317  return from_frame->n_vectors;
318 }
319 
320 static char * mpls_error_strings[] = {
321 #define mpls_error(n,s) s,
322 #include "error.def"
323 #undef mpls_error
324 };
325 
329 {
331 }
332 
334  .name = "mpls-output",
335  /* Takes a vector of packets. */
336  .vector_size = sizeof (u32),
337  .n_errors = MPLS_N_ERROR,
338  .error_strings = mpls_error_strings,
339 
340  .n_next_nodes = MPLS_OUTPUT_N_NEXT,
341  .next_nodes = {
342  [MPLS_OUTPUT_NEXT_DROP] = "mpls-drop",
343  [MPLS_OUTPUT_NEXT_FRAG] = "mpls-frag",
344  },
345  .format_trace = format_mpls_output_trace,
346 };
347 
351 {
353 }
354 
356  .name = "mpls-midchain",
357  .vector_size = sizeof (u32),
358 
359  .n_errors = MPLS_N_ERROR,
360  .error_strings = mpls_error_strings,
361 
362  .sibling_of = "mpls-output",
363  .format_trace = format_mpls_output_trace,
364 };
365 
366 static char *mpls_frag_error_strings[] = {
367 #define _(sym,string) string,
369 #undef _
370 };
371 
372 typedef struct mpls_frag_trace_t_
373 {
377 
378 typedef enum
379 {
386 
387 static uword
391 {
392  u32 n_left_from, next_index, * from, * to_next, n_left_to_next, *frags;
393  vlib_node_runtime_t * error_node;
394 
395  error_node = vlib_node_get_runtime (vm, mpls_output_node.index);
396  from = vlib_frame_vector_args (frame);
397  n_left_from = frame->n_vectors;
398  next_index = node->cached_next_index;
399  frags = NULL;
400 
401  while (n_left_from > 0)
402  {
403  vlib_get_next_frame (vm, node, next_index,
404  to_next, n_left_to_next);
405 
406  while (n_left_from > 0 && n_left_to_next > 0)
407  {
408  ip_adjacency_t * adj0;
409  vlib_buffer_t * p0;
410  mpls_frag_next_t next0;
411  u32 pi0, adj_index0;
412  ip_frag_error_t error0 = IP_FRAG_ERROR_NONE;
413  i16 encap_size;
414  u8 is_ip4;
415 
416  pi0 = to_next[0] = from[0];
417  p0 = vlib_get_buffer (vm, pi0);
418  from += 1;
419  n_left_from -= 1;
420  is_ip4 = vnet_buffer (p0)->mpls.pyld_proto == DPO_PROTO_IP4;
421 
422  adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
423  adj0 = adj_get(adj_index0);
424 
425  /* the size of the MPLS stack */
426  encap_size = vnet_buffer(p0)->l3_hdr_offset - p0->current_data;
427 
428  /* IP fragmentation */
429  if (is_ip4)
430  error0 = ip4_frag_do_fragment (vm, pi0,
431  adj0->rewrite_header.max_l3_packet_bytes,
432  encap_size, &frags);
433  else
434  error0 = ip6_frag_do_fragment (vm, pi0,
435  adj0->rewrite_header.max_l3_packet_bytes,
436  encap_size, &frags);
437 
438  if (PREDICT_FALSE (p0->flags & VLIB_BUFFER_IS_TRACED))
439  {
440  mpls_frag_trace_t *tr =
441  vlib_add_trace (vm, node, p0, sizeof (*tr));
442  tr->mtu = adj0->rewrite_header.max_l3_packet_bytes;
444  }
445 
446  if (PREDICT_TRUE(error0 == IP_FRAG_ERROR_NONE))
447  {
448  /* Free original buffer chain */
449  vlib_buffer_free_one (vm, pi0); /* Free original packet */
450  next0 = (IP_LOOKUP_NEXT_MIDCHAIN == adj0->lookup_next_index ?
453  }
454  else if (is_ip4 && error0 == IP_FRAG_ERROR_DONT_FRAGMENT_SET)
455  {
457  p0, ICMP4_destination_unreachable,
458  ICMP4_destination_unreachable_fragmentation_needed_and_dont_fragment_set,
459  vnet_buffer (p0)->ip_frag.mtu);
461  }
462  else
463  {
464  vlib_error_count (vm, mpls_output_node.index, error0, 1);
465  vec_add1 (frags, pi0); /* Get rid of the original buffer */
466  next0 = MPLS_FRAG_NEXT_DROP;
467  }
468 
469  /* Send fragments that were added in the frame */
470  u32 *frag_from, frag_left;
471 
472  frag_from = frags;
473  frag_left = vec_len (frags);
474 
475  while (frag_left > 0)
476  {
477  while (frag_left > 0 && n_left_to_next > 0)
478  {
479  u32 i;
480  i = to_next[0] = frag_from[0];
481  frag_from += 1;
482  frag_left -= 1;
483  to_next += 1;
484  n_left_to_next -= 1;
485 
486  p0 = vlib_get_buffer (vm, i);
487  p0->error = error_node->errors[error0];
488 
489  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
490  to_next, n_left_to_next, i,
491  next0);
492  }
493  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
494  vlib_get_next_frame (vm, node, next_index, to_next,
495  n_left_to_next);
496  }
497  vec_reset_length (frags);
498  }
499  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
500  }
501  vec_free (frags);
502 
503  return frame->n_vectors;
504 }
505 
506 static u8 *
507 format_mpls_frag_trace (u8 * s, va_list * args)
508 {
509  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
510  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
511  mpls_frag_trace_t *t = va_arg (*args, mpls_frag_trace_t *);
512 
513  s = format (s, "mtu:%d pkt-size:%d", t->mtu, t->pkt_size);
514  return s;
515 }
516 
518  .function = mpls_frag,
519  .name = "mpls-frag",
520  .vector_size = sizeof (u32),
521  .format_trace = format_mpls_frag_trace,
523 
524  .n_errors = IP_FRAG_N_ERROR,
525  .error_strings = mpls_frag_error_strings,
526 
527  .n_next_nodes = MPLS_FRAG_N_NEXT,
528  .next_nodes = {
529  [MPLS_FRAG_NEXT_REWRITE] = "mpls-output",
530  [MPLS_FRAG_NEXT_REWRITE_MIDCHAIN] = "mpls-midchain",
531  [MPLS_FRAG_NEXT_ICMP_ERROR] = "ip4-icmp-error",
532  [MPLS_FRAG_NEXT_DROP] = "mpls-drop"
533  },
534 };
535 
536 /*
537  * @brief Next index values from the MPLS incomplete adj node
538  */
539 #define foreach_mpls_adj_incomplete_next \
540 _(DROP, "error-drop") \
541 _(IP4, "ip4-arp") \
542 _(IP6, "ip6-discover-neighbor")
543 
544 typedef enum {
545 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
547 #undef _
550 
551 /**
552  * @brief A struct to hold tracing information for the MPLS label imposition
553  * node.
554  */
556 {
559 
560 
561 /**
562  * @brief Graph node for incomplete MPLS adjacency.
563  * This node will push traffic to either the v4-arp or v6-nd node
564  * based on the next-hop proto of the adj.
565  * We pay a cost for this 'routing' node, but an incomplete adj is the
566  * exception case.
567  */
571 {
572  u32 n_left_from, next_index, * from, * to_next;
573 
575  n_left_from = from_frame->n_vectors;
576  next_index = node->cached_next_index;
577 
578  while (n_left_from > 0)
579  {
580  u32 n_left_to_next;
581 
582  vlib_get_next_frame (vm, node, next_index,
583  to_next, n_left_to_next);
584 
585  while (n_left_from > 0 && n_left_to_next > 0)
586  {
587  u32 pi0, next0, adj_index0;
588  ip_adjacency_t * adj0;
589  vlib_buffer_t * p0;
590 
591  pi0 = to_next[0] = from[0];
592  p0 = vlib_get_buffer (vm, pi0);
593  from += 1;
594  n_left_from -= 1;
595  to_next += 1;
596  n_left_to_next -= 1;
597 
598  adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
599 
600  adj0 = adj_get(adj_index0);
601 
603  {
604  next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
605  }
606  else
607  {
608  next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
609  }
610 
611  if (PREDICT_FALSE(p0->flags & VLIB_BUFFER_IS_TRACED))
612  {
614  vlib_add_trace (vm, node, p0, sizeof (*tr));
615  tr->next = next0;
616  }
617 
618  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
619  to_next, n_left_to_next,
620  pi0, next0);
621  }
622 
623  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
624  }
625 
626  return from_frame->n_vectors;
627 }
628 
629 static u8 *
631 {
632  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
633  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
635  u32 indent;
636 
637  t = va_arg (*args, mpls_adj_incomplete_trace_t *);
638  indent = format_get_indent (s);
639 
640  s = format (s, "%Unext:%d",
641  format_white_space, indent,
642  t->next);
643  return (s);
644 }
645 
647  .name = "mpls-adj-incomplete",
648  .format_trace = format_mpls_adj_incomplete_trace,
649  /* Takes a vector of packets. */
650  .vector_size = sizeof (u32),
651  .n_errors = MPLS_N_ERROR,
652  .error_strings = mpls_error_strings,
653 
654  .n_next_nodes = MPLS_ADJ_INCOMPLETE_N_NEXT,
655  .next_nodes = {
656 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n,
658 #undef _
659  },
660 };
#define vnet_rewrite_one_header(rw0, p0, most_likely_size)
Definition: rewrite.h:218
u32 flags
buffer flags: VLIB_BUFFER_FREE_LIST_INDEX_MASK: bits used to store free list index, VLIB_BUFFER_IS_TRACED: trace this buffer.
Definition: buffer.h:133
#define foreach_mpls_output_next
Definition: mpls_output.c:35
#define CLIB_UNUSED(x)
Definition: clib.h:90
#define foreach_ip_frag_error
Definition: ip_frag.h:60
vlib_main_t vlib_node_runtime_t vlib_frame_t * from_frame
Definition: esp_encrypt.c:1328
u32 thread_index
#define PREDICT_TRUE(x)
Definition: clib.h:125
i16 current_data
signed offset in data[], pre_data[] that we are currently processing.
Definition: buffer.h:119
static void vlib_error_count(vlib_main_t *vm, uword node_index, uword counter, uword increment)
Definition: error_funcs.h:57
vlib_increment_combined_counter(ccm, ti, sw_if_index, n_buffers, n_bytes)
IP unicast adjacency.
Definition: adj.h:235
A struct to hold tracing information for the MPLS label imposition node.
Definition: mpls_output.c:555
vlib_main_t vlib_node_runtime_t vlib_frame_t * frame
Definition: nat44_ei.c:3048
static u8 * format_mpls_frag_trace(u8 *s, va_list *args)
Definition: mpls_output.c:507
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:607
static u8 * format_mpls_adj_incomplete_trace(u8 *s, va_list *args)
Definition: mpls_output.c:630
static u32 format_get_indent(u8 *s)
Definition: format.h:72
#define VLIB_NODE_FN(node)
Definition: node.h:202
mpls_frag_next_t
Definition: mpls_output.c:378
vlib_error_t * errors
Vector of errors for this node.
Definition: node.h:461
static uword vlib_buffer_length_in_chain(vlib_main_t *vm, vlib_buffer_t *b)
Get length in bytes of the buffer chain.
Definition: buffer_funcs.h:433
unsigned char u8
Definition: types.h:56
#define vec_reset_length(v)
Reset vector length to zero NULL-pointer tolerant.
static u8 * format_mpls_output_trace(u8 *s, va_list *args)
Definition: mpls_output.c:47
unsigned int u32
Definition: types.h:88
vlib_node_registration_t mpls_midchain_node
(constructor) VLIB_REGISTER_NODE (mpls_midchain_node)
Definition: mpls_output.c:355
vlib_node_registration_t mpls_output_node
(constructor) VLIB_REGISTER_NODE (mpls_output_node)
Definition: mpls_output.c:333
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
Definition: adj.h:470
i64 word
Definition: types.h:111
format_function_t format_ip_adjacency
Definition: format.h:58
u8 * format_white_space(u8 *s, va_list *va)
Definition: std-formats.c:129
description fragment has unexpected format
Definition: map.api:433
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
Definition: buffer.h:231
mpls_adj_incomplete_next_t
Definition: mpls_output.c:544
mpls_output_next_t
Definition: mpls_output.c:39
u8 output_feature_arc_index
Definition: mpls.h:57
static uword mpls_output_inline(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame, mpls_output_mode_t mode)
Definition: mpls_output.c:61
vl_api_fib_path_type_t type
Definition: fib_types.api:123
vlib_error_t error
Error code for buffers to be enqueued to error handler.
Definition: buffer.h:145
vlib_node_registration_t mpls_frag_node
(constructor) VLIB_REGISTER_NODE (mpls_frag_node)
Definition: mpls_output.c:517
unsigned short u16
Definition: types.h:57
static char * mpls_frag_error_strings[]
Definition: mpls_output.c:366
static void * vlib_buffer_get_current(vlib_buffer_t *b)
Get pointer to current data to process.
Definition: buffer.h:257
#define PREDICT_FALSE(x)
Definition: clib.h:124
vlib_main_t * vm
X-connect all packets from the HOST to the PHY.
Definition: nat44_ei.c:3047
#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.
Definition: buffer_node.h:70
#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.
Definition: buffer_node.h:224
#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).
Definition: node_funcs.h:395
vlib_combined_counter_main_t adjacency_counters
Adjacency packet counters.
Definition: adj.c:26
vl_api_tunnel_mode_t mode
Definition: gre.api:48
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1244
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:169
u16 n_vectors
Definition: node.h:388
mpls_main_t mpls_main
Definition: mpls.c:25
ip_frag_error_t ip6_frag_do_fragment(vlib_main_t *vm, u32 from_bi, u16 mtu, u16 l2unfragmentablesize, u32 **buffer)
Definition: ip_frag.c:381
static_always_inline uword vlib_get_thread_index(void)
Definition: threads.h:208
#define CLIB_PREFETCH(addr, size, type)
Definition: cache.h:80
mpls_output_mode_t
Definition: mpls_output.c:30
sll srl srl sll sra u16x4 i
Definition: vector_sse42.h:261
ip_frag_error_t
Definition: ip_frag.h:71
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:395
#define foreach_mpls_adj_incomplete_next
Definition: mpls_output.c:539
static vlib_node_runtime_t * vlib_node_get_runtime(vlib_main_t *vm, u32 node_index)
Get node runtime by node index.
Definition: node_funcs.h:116
u8 data[]
Packet data.
Definition: buffer.h:204
This packets follow a mid-chain adjacency.
Definition: adj.h:76
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
Definition: node.h:498
vlib_put_next_frame(vm, node, next_index, 0)
static void vlib_buffer_advance(vlib_buffer_t *b, word l)
Advance current data pointer by the supplied (signed!) amount.
Definition: buffer.h:276
nat44_ei_hairpin_src_next_t next_index
static char * mpls_error_strings[]
Definition: mpls_output.c:320
fib_protocol_t ia_nh_proto
The protocol of the neighbor/peer.
Definition: adj.h:350
Definition: defs.h:47
struct mpls_frag_trace_t_ mpls_frag_trace_t
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
vlib_main_t vlib_node_runtime_t * node
Definition: nat44_ei.c:3047
ip_lookup_next_t lookup_next_index
Next hop after ip4-lookup.
Definition: adj.h:337
VLIB buffer representation.
Definition: buffer.h:111
u64 uword
Definition: types.h:112
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:301
static_always_inline void adj_midchain_fixup(vlib_main_t *vm, const ip_adjacency_t *adj, vlib_buffer_t *b, vnet_link_t lt)
Definition: adj_dp.h:58
ip_frag_error_t ip4_frag_do_fragment(vlib_main_t *vm, u32 from_bi, u16 mtu, u16 l2unfragmentablesize, u32 **buffer)
Definition: ip_frag.c:93
#define vnet_buffer(b)
Definition: buffer.h:437
struct mpls_adj_incomplete_trace_t_ mpls_adj_incomplete_trace_t
A struct to hold tracing information for the MPLS label imposition node.
void * vlib_add_trace(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_buffer_t *b, u32 n_data_bytes)
Definition: trace.c:628
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)
Definition: mpls_output.c:646
#define vnet_rewrite_two_headers(rw0, rw1, p0, p1, most_likely_size)
Definition: rewrite.h:222
This adjacency/interface has output features configured.
Definition: rewrite.h:57
static_always_inline void icmp4_error_set_vnet_buffer(vlib_buffer_t *b, u8 type, u8 code, u32 data)
Definition: icmp4.h:51
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
Definition: buffer_funcs.h:111
static uword mpls_frag(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
Definition: mpls_output.c:388
signed short i16
Definition: types.h:46
static_always_inline void vnet_feature_arc_start(u8 arc, u32 sw_if_index, u32 *next0, vlib_buffer_t *b0)
Definition: feature.h:302