FD.io VPP  v18.01.1-37-g7ea3975
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/pg/pg.h>
20 #include <vnet/ip/ip.h>
21 #include <vnet/mpls/mpls.h>
22 
23 typedef struct {
24  /* Adjacency taken. */
28 
29 #define foreach_mpls_output_next \
30 _(DROP, "error-drop")
31 
32 typedef enum {
33 #define _(s,n) MPLS_OUTPUT_NEXT_##s,
35 #undef _
38 
39 static u8 *
40 format_mpls_output_trace (u8 * s, va_list * args)
41 {
42  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
43  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
44  mpls_output_trace_t * t = va_arg (*args, mpls_output_trace_t *);
45 
46  s = format (s, "adj-idx %d : %U flow hash: 0x%08x",
47  t->adj_index,
49  t->flow_hash);
50  return s;
51 }
52 
53 static inline uword
55  vlib_node_runtime_t * node,
56  vlib_frame_t * from_frame,
57  int is_midchain)
58 {
59  u32 n_left_from, next_index, * from, * to_next, thread_index;
60  vlib_node_runtime_t * error_node;
61  u32 n_left_to_next;
62  mpls_main_t *mm;
63 
64  thread_index = vlib_get_thread_index();
65  error_node = vlib_node_get_runtime (vm, mpls_output_node.index);
66  from = vlib_frame_vector_args (from_frame);
67  n_left_from = from_frame->n_vectors;
68  next_index = node->cached_next_index;
69  mm = &mpls_main;
70 
71  while (n_left_from > 0)
72  {
73  vlib_get_next_frame (vm, node, next_index,
74  to_next, n_left_to_next);
75 
76  while (n_left_from >= 4 && n_left_to_next >= 2)
77  {
78  ip_adjacency_t * adj0;
80  vlib_buffer_t * p0;
81  u32 pi0, rw_len0, adj_index0, next0, error0;
82 
83  ip_adjacency_t * adj1;
85  vlib_buffer_t * p1;
86  u32 pi1, rw_len1, adj_index1, next1, error1;
87 
88  /* Prefetch next iteration. */
89  {
90  vlib_buffer_t * p2, * p3;
91 
92  p2 = vlib_get_buffer (vm, from[2]);
93  p3 = vlib_get_buffer (vm, from[3]);
94 
95  vlib_prefetch_buffer_header (p2, STORE);
96  vlib_prefetch_buffer_header (p3, STORE);
97 
98  CLIB_PREFETCH (p2->data, sizeof (hdr0[0]), STORE);
99  CLIB_PREFETCH (p3->data, sizeof (hdr1[0]), STORE);
100  }
101 
102  pi0 = to_next[0] = from[0];
103  pi1 = to_next[1] = from[1];
104 
105  from += 2;
106  n_left_from -= 2;
107  to_next += 2;
108  n_left_to_next -= 2;
109 
110  p0 = vlib_get_buffer (vm, pi0);
111  p1 = vlib_get_buffer (vm, pi1);
112 
113  adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
114  adj_index1 = vnet_buffer (p1)->ip.adj_index[VLIB_TX];
115 
116  adj0 = adj_get(adj_index0);
117  adj1 = adj_get(adj_index1);
118  hdr0 = vlib_buffer_get_current (p0);
119  hdr1 = vlib_buffer_get_current (p1);
120 
121  /* Guess we are only writing on simple Ethernet header. */
122  vnet_rewrite_two_headers (adj0[0], adj1[0], hdr0, hdr1,
123  sizeof (ethernet_header_t));
124 
125  /* Update packet buffer attributes/set output interface. */
126  rw_len0 = adj0[0].rewrite_header.data_bytes;
127  rw_len1 = adj1[0].rewrite_header.data_bytes;
128 
129  /* Bump the adj counters for packet and bytes */
132  thread_index,
133  adj_index0,
134  1,
135  vlib_buffer_length_in_chain (vm, p0) + rw_len0);
138  thread_index,
139  adj_index1,
140  1,
141  vlib_buffer_length_in_chain (vm, p1) + rw_len1);
142 
143  /* Check MTU of outgoing interface. */
145  adj0[0].rewrite_header.max_l3_packet_bytes))
146  {
147  p0->current_data -= rw_len0;
148  p0->current_length += rw_len0;
149 
150  vnet_buffer (p0)->sw_if_index[VLIB_TX] =
151  adj0[0].rewrite_header.sw_if_index;
152  next0 = adj0[0].rewrite_header.next_index;
153  error0 = IP4_ERROR_NONE;
154 
155  if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
157  adj0[0].rewrite_header.sw_if_index,
158  &next0, p0);
159  }
160  else
161  {
162  error0 = IP4_ERROR_MTU_EXCEEDED;
163  next0 = MPLS_OUTPUT_NEXT_DROP;
164  }
166  adj1[0].rewrite_header.max_l3_packet_bytes))
167  {
168  p1->current_data -= rw_len1;
169  p1->current_length += rw_len1;
170 
171  vnet_buffer (p1)->sw_if_index[VLIB_TX] =
172  adj1[0].rewrite_header.sw_if_index;
173  next1 = adj1[0].rewrite_header.next_index;
174  error1 = IP4_ERROR_NONE;
175 
176  if (PREDICT_FALSE(adj1[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
178  adj1[0].rewrite_header.sw_if_index,
179  &next1, p1);
180  }
181  else
182  {
183  error1 = IP4_ERROR_MTU_EXCEEDED;
184  next1 = MPLS_OUTPUT_NEXT_DROP;
185  }
186  if (is_midchain)
187  {
188  adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
189  adj1->sub_type.midchain.fixup_func(vm, adj1, p1);
190  }
191 
192  p0->error = error_node->errors[error0];
193  p1->error = error_node->errors[error1];
194 
196  {
197  mpls_output_trace_t *tr = vlib_add_trace (vm, node,
198  p0, sizeof (*tr));
199  tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
200  tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
201  }
203  {
204  mpls_output_trace_t *tr = vlib_add_trace (vm, node,
205  p1, sizeof (*tr));
206  tr->adj_index = vnet_buffer(p1)->ip.adj_index[VLIB_TX];
207  tr->flow_hash = vnet_buffer(p1)->ip.flow_hash;
208  }
209 
210  vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
211  to_next, n_left_to_next,
212  pi0, pi1, next0, next1);
213  }
214 
215  while (n_left_from > 0 && n_left_to_next > 0)
216  {
217  ip_adjacency_t * adj0;
218  mpls_unicast_header_t *hdr0;
219  vlib_buffer_t * p0;
220  u32 pi0, rw_len0, adj_index0, next0, error0;
221 
222  pi0 = to_next[0] = from[0];
223 
224  p0 = vlib_get_buffer (vm, pi0);
225 
226  adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
227 
228  adj0 = adj_get(adj_index0);
229  hdr0 = vlib_buffer_get_current (p0);
230 
231  /* Guess we are only writing on simple Ethernet header. */
232  vnet_rewrite_one_header (adj0[0], hdr0,
233  sizeof (ethernet_header_t));
234 
235  /* Update packet buffer attributes/set output interface. */
236  rw_len0 = adj0[0].rewrite_header.data_bytes;
237 
240  thread_index,
241  adj_index0,
242  1,
243  vlib_buffer_length_in_chain (vm, p0) + rw_len0);
244 
245  /* Check MTU of outgoing interface. */
247  adj0[0].rewrite_header.max_l3_packet_bytes))
248  {
249  p0->current_data -= rw_len0;
250  p0->current_length += rw_len0;
251 
252  vnet_buffer (p0)->sw_if_index[VLIB_TX] =
253  adj0[0].rewrite_header.sw_if_index;
254  next0 = adj0[0].rewrite_header.next_index;
255  error0 = IP4_ERROR_NONE;
256 
257  if (PREDICT_FALSE(adj0[0].rewrite_header.flags & VNET_REWRITE_HAS_FEATURES))
259  adj0[0].rewrite_header.sw_if_index,
260  &next0, p0);
261  }
262  else
263  {
264  error0 = IP4_ERROR_MTU_EXCEEDED;
265  next0 = MPLS_OUTPUT_NEXT_DROP;
266  }
267  if (is_midchain)
268  {
269  adj0->sub_type.midchain.fixup_func(vm, adj0, p0);
270  }
271 
272  p0->error = error_node->errors[error0];
273 
274  from += 1;
275  n_left_from -= 1;
276  to_next += 1;
277  n_left_to_next -= 1;
278 
280  {
281  mpls_output_trace_t *tr = vlib_add_trace (vm, node,
282  p0, sizeof (*tr));
283  tr->adj_index = vnet_buffer(p0)->ip.adj_index[VLIB_TX];
284  tr->flow_hash = vnet_buffer(p0)->ip.flow_hash;
285  }
286 
287  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
288  to_next, n_left_to_next,
289  pi0, next0);
290  }
291 
292  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
293  }
295  MPLS_ERROR_PKTS_ENCAP,
296  from_frame->n_vectors);
297 
298  return from_frame->n_vectors;
299 }
300 
301 static char * mpls_error_strings[] = {
302 #define mpls_error(n,s) s,
303 #include "error.def"
304 #undef mpls_error
305 };
306 
307 static inline uword
309  vlib_node_runtime_t * node,
310  vlib_frame_t * from_frame)
311 {
312  return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 0));
313 }
314 
316  .function = mpls_output,
317  .name = "mpls-output",
318  /* Takes a vector of packets. */
319  .vector_size = sizeof (u32),
320  .n_errors = MPLS_N_ERROR,
321  .error_strings = mpls_error_strings,
322 
323  .n_next_nodes = MPLS_OUTPUT_N_NEXT,
324  .next_nodes = {
325 #define _(s,n) [MPLS_OUTPUT_NEXT_##s] = n,
327 #undef _
328  },
329 
330  .format_trace = format_mpls_output_trace,
331 };
332 
334 
335 static inline uword
337  vlib_node_runtime_t * node,
338  vlib_frame_t * from_frame)
339 {
340  return (mpls_output_inline(vm, node, from_frame, /* is_midchain */ 1));
341 }
342 
344  .function = mpls_midchain,
345  .name = "mpls-midchain",
346  .vector_size = sizeof (u32),
347 
348  .format_trace = format_mpls_output_trace,
349 
350  .sibling_of = "mpls-output",
351 };
352 
354 
355 /**
356  * @brief Next index values from the MPLS incomplete adj node
357  */
358 #define foreach_mpls_adj_incomplete_next \
359 _(DROP, "error-drop") \
360 _(IP4, "ip4-arp") \
361 _(IP6, "ip6-discover-neighbor")
362 
363 typedef enum {
364 #define _(s,n) MPLS_ADJ_INCOMPLETE_NEXT_##s,
366 #undef _
369 
370 /**
371  * @brief A struct to hold tracing information for the MPLS label imposition
372  * node.
373  */
375 {
378 
379 
380 /**
381  * @brief Graph node for incomplete MPLS adjacency.
382  * This node will push traffic to either the v4-arp or v6-nd node
383  * based on the next-hop proto of the adj.
384  * We pay a cost for this 'routing' node, but an incomplete adj is the
385  * exception case.
386  */
387 static inline uword
389  vlib_node_runtime_t * node,
390  vlib_frame_t * from_frame)
391 {
392  u32 n_left_from, next_index, * from, * to_next;
393 
394  from = vlib_frame_vector_args (from_frame);
395  n_left_from = from_frame->n_vectors;
396  next_index = node->cached_next_index;
397 
398  while (n_left_from > 0)
399  {
400  u32 n_left_to_next;
401 
402  vlib_get_next_frame (vm, node, next_index,
403  to_next, n_left_to_next);
404 
405  while (n_left_from > 0 && n_left_to_next > 0)
406  {
407  u32 pi0, next0, adj_index0;
408  ip_adjacency_t * adj0;
409  vlib_buffer_t * p0;
410 
411  pi0 = to_next[0] = from[0];
412  p0 = vlib_get_buffer (vm, pi0);
413  from += 1;
414  n_left_from -= 1;
415  to_next += 1;
416  n_left_to_next -= 1;
417 
418  adj_index0 = vnet_buffer (p0)->ip.adj_index[VLIB_TX];
419 
420  adj0 = adj_get(adj_index0);
421 
423  {
424  next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP4;
425  }
426  else
427  {
428  next0 = MPLS_ADJ_INCOMPLETE_NEXT_IP6;
429  }
430 
432  {
434  vlib_add_trace (vm, node, p0, sizeof (*tr));
435  tr->next = next0;
436  }
437 
438  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
439  to_next, n_left_to_next,
440  pi0, next0);
441  }
442 
443  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
444  }
445 
446  return from_frame->n_vectors;
447 }
448 
449 static u8 *
451 {
452  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
453  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
455  u32 indent;
456 
457  t = va_arg (*args, mpls_adj_incomplete_trace_t *);
458  indent = format_get_indent (s);
459 
460  s = format (s, "%Unext:%d",
461  format_white_space, indent,
462  t->next);
463  return (s);
464 }
465 
467  .function = mpls_adj_incomplete,
468  .name = "mpls-adj-incomplete",
469  .format_trace = format_mpls_adj_incomplete_trace,
470  /* Takes a vector of packets. */
471  .vector_size = sizeof (u32),
472  .n_errors = MPLS_N_ERROR,
473  .error_strings = mpls_error_strings,
474 
475  .n_next_nodes = MPLS_ADJ_INCOMPLETE_N_NEXT,
476  .next_nodes = {
477 #define _(s,n) [MPLS_ADJ_INCOMPLETE_NEXT_##s] = n,
479 #undef _
480  },
481 };
482 
#define vnet_rewrite_one_header(rw0, p0, most_likely_size)
Definition: rewrite.h:281
#define foreach_mpls_output_next
Definition: mpls_output.c:29
#define CLIB_UNUSED(x)
Definition: clib.h:79
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.
Definition: counter.h:211
#define PREDICT_TRUE(x)
Definition: clib.h:106
IP unicast adjacency.
Definition: adj.h:174
A struct to hold tracing information for the MPLS label imposition node.
Definition: mpls_output.c:374
static u8 * format_mpls_adj_incomplete_trace(u8 *s, va_list *args)
Definition: mpls_output.c:450
static u32 format_get_indent(u8 *s)
Definition: format.h:72
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:419
vlib_error_t * errors
Vector of errors for this node.
Definition: node.h:415
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:107
struct ip_adjacency_t_::@38::@40 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
static u8 * format_mpls_output_trace(u8 *s, va_list *args)
Definition: mpls_output.c:40
vlib_node_registration_t mpls_midchain_node
(constructor) VLIB_REGISTER_NODE (mpls_midchain_node)
Definition: mpls_output.c:343
vlib_node_registration_t mpls_output_node
(constructor) VLIB_REGISTER_NODE (mpls_output_node)
Definition: mpls_output.c:315
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
Definition: adj.h:365
i16 current_data
signed offset in data[], pre_data[] that we are currently processing.
Definition: buffer.h:68
format_function_t format_ip_adjacency
Definition: format.h:58
u8 * format_white_space(u8 *s, va_list *va)
Definition: std-formats.c:113
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
Definition: buffer.h:171
mpls_adj_incomplete_next_t
Definition: mpls_output.c:363
mpls_output_next_t
Definition: mpls_output.c:32
u8 output_feature_arc_index
Definition: mpls.h:57
u16 current_length
Nbytes between current data and the end of this buffer.
Definition: buffer.h:72
static void * vlib_buffer_get_current(vlib_buffer_t *b)
Get pointer to current data to process.
Definition: buffer.h:195
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.
Definition: mpls_output.c:388
#define PREDICT_FALSE(x)
Definition: clib.h:105
#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:218
#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:364
vlib_combined_counter_main_t adjacency_counters
Adjacency packet counters.
Definition: adj.c:25
vlib_error_t error
Error code for buffers to be enqueued to error handler.
Definition: buffer.h:113
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1158
static uword mpls_output(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame)
Definition: mpls_output.c:308
union ip_adjacency_t_::@38 sub_type
u16 n_vectors
Definition: node.h:344
mpls_main_t mpls_main
Definition: mpls.c:25
static_always_inline uword vlib_get_thread_index(void)
Definition: threads.h:221
#define CLIB_PREFETCH(addr, size, type)
Definition: cache.h:82
vlib_main_t * vm
Definition: buffer.c:283
#define foreach_mpls_adj_incomplete_next
Next index values from the MPLS incomplete adj node.
Definition: mpls_output.c:358
#define VLIB_BUFFER_IS_TRACED
Definition: buffer.h:93
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:89
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.
Definition: main.c:454
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
Definition: node.h:456
static uword mpls_output_inline(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame, int is_midchain)
Definition: mpls_output.c:54
unsigned int u32
Definition: types.h:88
u64 uword
Definition: types.h:112
static void * vlib_add_trace(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_buffer_t *b, u32 n_data_bytes)
Definition: trace_funcs.h:55
static char * mpls_error_strings[]
Definition: mpls_output.c:301
fib_protocol_t ia_nh_proto
The protocol of the neighbor/peer.
Definition: adj.h:202
Definition: defs.h:47
unsigned char u8
Definition: types.h:56
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:267
#define vnet_buffer(b)
Definition: buffer.h:326
#define VLIB_NODE_FUNCTION_MULTIARCH(node, fn)
Definition: node.h:158
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:143
u8 data[0]
Packet data.
Definition: buffer.h:159
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)
Definition: mpls_output.c:466
#define vnet_rewrite_two_headers(rw0, rw1, p0, p1, most_likely_size)
Definition: rewrite.h:286
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:75
This adjacency/interface has output features configured.
Definition: rewrite.h:57
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
Definition: buffer_funcs.h:57
static uword mpls_midchain(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame)
Definition: mpls_output.c:336
static_always_inline void vnet_feature_arc_start(u8 arc, u32 sw_if_index, u32 *next0, vlib_buffer_t *b0)
Definition: feature.h:201