FD.io VPP  v19.08.3-2-gbabecb413
Vector Packet Processing
mpls_input.c
Go to the documentation of this file.
1 /*
2  * node.c: MPLS input
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/mpls/mpls.h>
21 #include <vnet/feature/feature.h>
22 
23 typedef struct {
27 
28 #define foreach_mpls_input_next \
29 _(DROP, "error-drop") \
30 _(LOOKUP, "mpls-lookup")
31 
32 typedef enum {
33 #define _(s,n) MPLS_INPUT_NEXT_##s,
35 #undef _
38 
39 static u8 *
40 format_mpls_input_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_input_trace_t * t = va_arg (*args, mpls_input_trace_t *);
45  char * next_name;
46  u32 label;
47  next_name = "BUG!";
48  label = clib_net_to_host_u32(t->label_net_byte_order);
49 
50 #define _(a,b) if (t->next_index == MPLS_INPUT_NEXT_##a) next_name = b;
52 #undef _
53 
54  s = format (s, "MPLS: next %s[%d] label %d ttl %d exp %d",
55  next_name, t->next_index,
57  vnet_mpls_uc_get_ttl(label),
58  vnet_mpls_uc_get_exp(label));
59 
60  return s;
61 }
62 
63 typedef struct {
69 
70 static inline uword
72  vlib_node_runtime_t * node,
73  vlib_frame_t * from_frame)
74 {
75  u32 n_left_from, next_index, * from, * to_next;
76  mpls_main_t * mm = &mpls_main;
77  u32 thread_index = vlib_get_thread_index();
79  vnet_main_t * vnm = vnet_get_main();
80 
81  from = vlib_frame_vector_args (from_frame);
82  n_left_from = from_frame->n_vectors;
83 
84  next_index = node->cached_next_index;
85 
88 
89  while (n_left_from > 0)
90  {
91  u32 n_left_to_next;
92 
93  vlib_get_next_frame (vm, node, next_index,
94  to_next, n_left_to_next);
95 
96  while (n_left_from >= 4 && n_left_to_next >= 2)
97  {
98  u32 bi0, next0, sw_if_index0;
99  u32 bi1, next1, sw_if_index1;
100  vlib_buffer_t *b0, *b1;
101  char *h0, *h1;
102 
103  /* Prefetch next iteration. */
104  {
105  vlib_buffer_t * p2, * p3;
106 
107  p2 = vlib_get_buffer (vm, from[2]);
108  p3 = vlib_get_buffer (vm, from[3]);
109 
110  vlib_prefetch_buffer_header (p2, LOAD);
111  vlib_prefetch_buffer_header (p3, LOAD);
112 
113  CLIB_PREFETCH (p2->data, sizeof (h0[0]), LOAD);
114  CLIB_PREFETCH (p3->data, sizeof (h1[0]), LOAD);
115  }
116 
117  bi0 = to_next[0] = from[0];
118  bi1 = to_next[1] = from[1];
119 
120  from += 2;
121  to_next += 2;
122  n_left_from -= 2;
123  n_left_to_next -= 2;
124 
125  b0 = vlib_get_buffer (vm, bi0);
126  b1 = vlib_get_buffer (vm, bi1);
127 
128  h0 = vlib_buffer_get_current (b0);
129  h1 = vlib_buffer_get_current (b1);
130 
131  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
132  sw_if_index1 = vnet_buffer (b1)->sw_if_index[VLIB_RX];
133 
134  /* TTL expired? */
135  if (PREDICT_FALSE(h0[3] == 0))
136  {
137  next0 = MPLS_INPUT_NEXT_DROP;
138  b0->error = node->errors[MPLS_ERROR_TTL_EXPIRED];
139  }
140  else
141  {
142  next0 = MPLS_INPUT_NEXT_LOOKUP;
144  sw_if_index0, &next0, b0);
145  vlib_increment_simple_counter (cm, thread_index, sw_if_index0, 1);
146  }
147 
148  if (PREDICT_FALSE(h1[3] == 0))
149  {
150  next1 = MPLS_INPUT_NEXT_DROP;
151  b1->error = node->errors[MPLS_ERROR_TTL_EXPIRED];
152  }
153  else
154  {
155  next1 = MPLS_INPUT_NEXT_LOOKUP;
157  sw_if_index1, &next1, b1);
158  vlib_increment_simple_counter (cm, thread_index, sw_if_index1, 1);
159  }
160 
161  if (PREDICT_FALSE(b0->flags & VLIB_BUFFER_IS_TRACED))
162  {
163  mpls_input_trace_t *tr = vlib_add_trace (vm, node,
164  b0, sizeof (*tr));
165  tr->next_index = next0;
166  tr->label_net_byte_order = *((u32*)h0);
167  }
168  if (PREDICT_FALSE(b1->flags & VLIB_BUFFER_IS_TRACED))
169  {
170  mpls_input_trace_t *tr = vlib_add_trace (vm, node,
171  b1, sizeof (*tr));
172  tr->next_index = next1;
173  tr->label_net_byte_order = *((u32*)h1);
174  }
175 
176  vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
177  to_next, n_left_to_next,
178  bi0, bi1,
179  next0, next1);
180  }
181 
182  while (n_left_from > 0 && n_left_to_next > 0)
183  {
184  u32 sw_if_index0, next0, bi0;
185  vlib_buffer_t * b0;
186  char * h0;
187 
188  bi0 = from[0];
189  to_next[0] = bi0;
190  from += 1;
191  to_next += 1;
192  n_left_from -= 1;
193  n_left_to_next -= 1;
194 
195  b0 = vlib_get_buffer (vm, bi0);
196  h0 = vlib_buffer_get_current (b0);
197  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
198 
199  /* TTL expired? */
200  if (PREDICT_FALSE(h0[3] == 0))
201  {
202  next0 = MPLS_INPUT_NEXT_DROP;
203  b0->error = node->errors[MPLS_ERROR_TTL_EXPIRED];
204  }
205  else
206  {
207  next0 = MPLS_INPUT_NEXT_LOOKUP;
208  vnet_feature_arc_start(mm->input_feature_arc_index, sw_if_index0, &next0, b0);
209  vlib_increment_simple_counter (cm, thread_index, sw_if_index0, 1);
210  }
211 
212  if (PREDICT_FALSE(b0->flags & VLIB_BUFFER_IS_TRACED))
213  {
214  mpls_input_trace_t *tr = vlib_add_trace (vm, node,
215  b0, sizeof (*tr));
216  tr->next_index = next0;
217  tr->label_net_byte_order = *(u32*)h0;
218  }
219 
220  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
221  to_next, n_left_to_next,
222  bi0, next0);
223  }
224 
225  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
226  }
228  MPLS_ERROR_PKTS_DECAP, from_frame->n_vectors);
229  return from_frame->n_vectors;
230 }
231 
233  vlib_node_runtime_t * node,
234  vlib_frame_t * from_frame)
235 {
236  return mpls_input_inline (vm, node, from_frame);
237 }
238 
239 static char * mpls_error_strings[] = {
240 #define mpls_error(n,s) s,
241 #include "error.def"
242 #undef mpls_error
243 };
244 
246  .name = "mpls-input",
247  /* Takes a vector of packets. */
248  .vector_size = sizeof (u32),
249 
250  .runtime_data_bytes = sizeof(mpls_input_runtime_t),
251 
252  .n_errors = MPLS_N_ERROR,
253  .error_strings = mpls_error_strings,
254 
255  .n_next_nodes = MPLS_INPUT_N_NEXT,
256  .next_nodes = {
257 #define _(s,n) [MPLS_INPUT_NEXT_##s] = n,
259 #undef _
260  },
261 
263  .format_trace = format_mpls_input_trace,
264 };
265 
266 #ifndef CLIB_MARCH_VARIANT
267 static void
269 {
270  pg_node_t * pn;
271 
272  pn = pg_get_node (mpls_input_node.index);
274 
275  ethernet_register_input_type (vm, ETHERNET_TYPE_MPLS,
276  mpls_input_node.index);
277 }
278 
280 {
281  mpls_setup_nodes (vm);
282 
283  return 0;
284 }
285 
286 /* *INDENT-OFF* */
288 {
289  .runs_after = VLIB_INITS("mpls_init"),
290 };
291 /* *INDENT-ON* */
292 #endif /* CLIB_MARCH_VARIANT */
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:124
#define CLIB_UNUSED(x)
Definition: clib.h:83
vnet_main_t * vnet_get_main(void)
Definition: misc.c:46
vnet_interface_main_t interface_main
Definition: vnet.h:56
u8 input_feature_arc_index
Definition: mpls.h:56
static char * mpls_error_strings[]
Definition: mpls_input.c:239
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:424
static void vlib_increment_simple_counter(vlib_simple_counter_main_t *cm, u32 thread_index, u32 index, u64 increment)
Increment a simple counter.
Definition: counter.h:78
#define VLIB_NODE_FN(node)
Definition: node.h:202
vlib_error_t * errors
Vector of errors for this node.
Definition: node.h:470
unsigned char u8
Definition: types.h:56
static pg_node_t * pg_get_node(uword node_index)
Definition: pg.h:363
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:173
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
Definition: buffer.h:203
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
format_function_t format_mpls_unicast_header_net_byte_order
Definition: mpls.h:70
unsigned int u32
Definition: types.h:88
static u32 vnet_mpls_uc_get_ttl(mpls_label_t label_exp_s_ttl)
Definition: packet.h:120
A collection of simple counters.
Definition: counter.h:57
vlib_error_t error
Error code for buffers to be enqueued to error handler.
Definition: buffer.h:136
vnet_crypto_main_t * cm
Definition: quic_crypto.c:41
vlib_node_registration_t mpls_input_node
(constructor) VLIB_REGISTER_NODE (mpls_input_node)
Definition: mpls_input.c:245
static void * vlib_buffer_get_current(vlib_buffer_t *b)
Get pointer to current data to process.
Definition: buffer.h:229
#define PREDICT_FALSE(x)
Definition: clib.h:112
static u32 vnet_mpls_uc_get_label(mpls_label_t label_exp_s_ttl)
Definition: packet.h:105
vlib_simple_counter_main_t * sw_if_counters
Definition: interface.h:845
mpls_input_next_t
Definition: mpls_input.c:32
u32 label
Definition: fib_types.api:25
#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:338
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1150
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:169
u16 n_vectors
Definition: node.h:397
mpls_main_t mpls_main
Definition: mpls.c:25
static_always_inline uword vlib_get_thread_index(void)
Definition: threads.h:218
#define CLIB_PREFETCH(addr, size, type)
Definition: cache.h:80
vlib_main_t * vm
Definition: buffer.c:323
u8 data[]
Packet data.
Definition: buffer.h:181
unformat_function_t unformat_pg_mpls_header
Definition: mpls.h:85
unformat_function_t * unformat_edit
Definition: pg.h:315
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:456
#define foreach_mpls_input_next
Definition: mpls_input.c:28
static u8 * format_mpls_input_trace(u8 *s, va_list *args)
Definition: mpls_input.c:40
static void mpls_setup_nodes(vlib_main_t *vm)
Definition: mpls_input.c:268
static clib_error_t * mpls_input_init(vlib_main_t *vm)
Definition: mpls_input.c:279
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
Definition: node.h:515
void ethernet_register_input_type(vlib_main_t *vm, ethernet_type_t type, u32 node_index)
Definition: node.c:2072
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
VLIB buffer representation.
Definition: buffer.h:102
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:244
#define vnet_buffer(b)
Definition: buffer.h:365
static uword mpls_input_inline(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *from_frame)
Definition: mpls_input.c:71
static u32 vnet_mpls_uc_get_exp(mpls_label_t label_exp_s_ttl)
Definition: packet.h:110
mpls_main_t * mpls_main
Definition: mpls_input.c:67
#define VLIB_INITS(...)
Definition: init.h:344
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
Definition: buffer_funcs.h:85
Definition: pg.h:312
Definition: defs.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:282