FD.io VPP  v19.04.2-12-g66b1689
Vector Packet Processing
l2_rw.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2015 Cisco and/or its affiliates.
3  * Licensed under the Apache License, Version 2.0 (the "License");
4  * you may not use this file except in compliance with the License.
5  * You may obtain a copy of the License at:
6  *
7  * http://www.apache.org/licenses/LICENSE-2.0
8  *
9  * Unless required by applicable law or agreed to in writing, software
10  * distributed under the License is distributed on an "AS IS" BASIS,
11  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12  * See the License for the specific language governing permissions and
13  * limitations under the License.
14  */
15 
16 #include <vlib/vlib.h>
17 #include <vnet/l2/feat_bitmap.h>
18 #include <vnet/l2/l2_rw.h>
19 
20 /**
21  * @file
22  * @brief Layer 2 Rewrite.
23  *
24  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
25  * the provisioned mask and value, modifies the packet header.
26  */
27 
28 
29 #ifndef CLIB_MARCH_VARIANT
31 #endif /* CLIB_MARCH_VARIANT */
32 
33 typedef struct
34 {
39 
40 static u8 *
41 format_l2_rw_entry (u8 * s, va_list * args)
42 {
43  l2_rw_entry_t *e = va_arg (*args, l2_rw_entry_t *);
44  l2_rw_main_t *rw = &l2_rw_main;
45  s = format (s, "%d - mask:%U value:%U\n",
46  e - rw->entries,
47  format_hex_bytes, e->mask,
48  e->rewrite_n_vectors * sizeof (u32x4), format_hex_bytes,
49  e->value, e->rewrite_n_vectors * sizeof (u32x4));
50  s =
51  format (s, " hits:%d skip_bytes:%d", e->hit_count,
52  e->skip_n_vectors * sizeof (u32x4));
53  return s;
54 }
55 
56 static u8 *
57 format_l2_rw_config (u8 * s, va_list * args)
58 {
59  l2_rw_config_t *c = va_arg (*args, l2_rw_config_t *);
60  return format (s, "table-index:%d miss-index:%d",
61  c->table_index, c->miss_index);
62 }
63 
64 /* packet trace format function */
65 static u8 *
66 format_l2_rw_trace (u8 * s, va_list * args)
67 {
68  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
69  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
70  l2_rw_trace_t *t = va_arg (*args, l2_rw_trace_t *);
71  return format (s, "l2-rw: sw_if_index %d, table %d, entry %d",
74 }
75 
76 always_inline l2_rw_config_t *
78 {
79  l2_rw_main_t *rw = &l2_rw_main;
80  if (PREDICT_FALSE (!clib_bitmap_get (rw->configs_bitmap, sw_if_index)))
81  {
82  vec_validate (rw->configs, sw_if_index);
83  rw->configs[sw_if_index].table_index = ~0;
84  rw->configs[sw_if_index].miss_index = ~0;
85  rw->configs_bitmap =
86  clib_bitmap_set (rw->configs_bitmap, sw_if_index, 1);
87  }
88  return &rw->configs[sw_if_index];
89 }
90 
92 l2_rw_rewrite (l2_rw_entry_t * rwe, u8 * h)
93 {
94  if (U32X4_ALIGNED (h))
95  {
96  u32x4 *d = ((u32x4 *) h) + rwe->skip_n_vectors;
97  switch (rwe->rewrite_n_vectors)
98  {
99  case 5:
100  d[4] = (d[4] & ~rwe->mask[4]) | rwe->value[4];
101  /* FALLTHROUGH */
102  case 4:
103  d[3] = (d[3] & ~rwe->mask[3]) | rwe->value[3];
104  /* FALLTHROUGH */
105  case 3:
106  d[2] = (d[2] & ~rwe->mask[2]) | rwe->value[2];
107  /* FALLTHROUGH */
108  case 2:
109  d[1] = (d[1] & ~rwe->mask[1]) | rwe->value[1];
110  /* FALLTHROUGH */
111  case 1:
112  d[0] = (d[0] & ~rwe->mask[0]) | rwe->value[0];
113  break;
114  default:
115  abort ();
116  }
117  }
118  else
119  {
120  u64 *d = ((u64 *) h) + rwe->skip_n_vectors * 2;
121  switch (rwe->rewrite_n_vectors)
122  {
123  case 5:
124  d[8] =
125  (d[8] & ~(((u64 *) rwe->mask)[8])) | (((u64 *) rwe->value)[8]);
126  d[9] =
127  (d[9] & ~(((u64 *) rwe->mask)[9])) | (((u64 *) rwe->value)[9]);
128  /* FALLTHROUGH */
129  case 4:
130  d[6] =
131  (d[6] & ~(((u64 *) rwe->mask)[6])) | (((u64 *) rwe->value)[6]);
132  d[7] =
133  (d[7] & ~(((u64 *) rwe->mask)[7])) | (((u64 *) rwe->value)[7]);
134  /* FALLTHROUGH */
135  case 3:
136  d[4] =
137  (d[4] & ~(((u64 *) rwe->mask)[4])) | (((u64 *) rwe->value)[4]);
138  d[5] =
139  (d[5] & ~(((u64 *) rwe->mask)[5])) | (((u64 *) rwe->value)[5]);
140  /* FALLTHROUGH */
141  case 2:
142  d[2] =
143  (d[2] & ~(((u64 *) rwe->mask)[2])) | (((u64 *) rwe->value)[2]);
144  d[3] =
145  (d[3] & ~(((u64 *) rwe->mask)[3])) | (((u64 *) rwe->value)[3]);
146  /* FALLTHROUGH */
147  case 1:
148  d[0] =
149  (d[0] & ~(((u64 *) rwe->mask)[0])) | (((u64 *) rwe->value)[0]);
150  d[1] =
151  (d[1] & ~(((u64 *) rwe->mask)[1])) | (((u64 *) rwe->value)[1]);
152  break;
153  default:
154  abort ();
155  }
156  }
157 }
158 
160  vlib_node_runtime_t * node, vlib_frame_t * frame)
161 {
162  l2_rw_main_t *rw = &l2_rw_main;
163  u32 n_left_from, *from, *to_next, next_index;
165  f64 now = vlib_time_now (vlib_get_main ());
166 
167  from = vlib_frame_vector_args (frame);
168  n_left_from = frame->n_vectors; /* number of packets to process */
169  next_index = node->cached_next_index;
170 
171  while (n_left_from > 0)
172  {
173  u32 n_left_to_next;
174 
175  /* get space to enqueue frame to graph node "next_index" */
176  vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
177 
178  while (n_left_from >= 6 && n_left_to_next >= 2)
179  {
180  u32 bi0, next0, sw_if_index0, rwe_index0;
181  u32 bi1, next1, sw_if_index1, rwe_index1;
182  vlib_buffer_t *b0, *b1;
183  ethernet_header_t *h0, *h1;
184  l2_rw_config_t *config0, *config1;
185  u64 hash0, hash1;
186  vnet_classify_table_t *t0, *t1;
187  vnet_classify_entry_t *e0, *e1;
188  l2_rw_entry_t *rwe0, *rwe1;
189 
190  {
191  vlib_buffer_t *p2, *p3, *p4, *p5;
192  p2 = vlib_get_buffer (vm, from[2]);
193  p3 = vlib_get_buffer (vm, from[3]);
194  p4 = vlib_get_buffer (vm, from[4]);
195  p5 = vlib_get_buffer (vm, from[5]);
196 
197  vlib_prefetch_buffer_header (p4, LOAD);
198  vlib_prefetch_buffer_header (p5, LOAD);
199  vlib_prefetch_buffer_data (p2, LOAD);
200  vlib_prefetch_buffer_data (p3, LOAD);
201  }
202 
203  bi0 = from[0];
204  bi1 = from[1];
205  to_next[0] = bi0;
206  to_next[1] = bi1;
207  from += 2;
208  to_next += 2;
209  n_left_from -= 2;
210  n_left_to_next -= 2;
211 
212  b0 = vlib_get_buffer (vm, bi0);
213  b1 = vlib_get_buffer (vm, bi1);
214  h0 = vlib_buffer_get_current (b0);
215  h1 = vlib_buffer_get_current (b1);
216 
217  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
218  sw_if_index1 = vnet_buffer (b1)->sw_if_index[VLIB_RX];
219  config0 = l2_rw_get_config (sw_if_index0); /*TODO: check sw_if_index0 value */
220  config1 = l2_rw_get_config (sw_if_index1); /*TODO: check sw_if_index0 value */
221  t0 = pool_elt_at_index (vcm->tables, config0->table_index);
222  t1 = pool_elt_at_index (vcm->tables, config1->table_index);
223 
224  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
225  hash1 = vnet_classify_hash_packet (t1, (u8 *) h1);
226  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
227  e1 = vnet_classify_find_entry (t1, (u8 *) h1, hash1, now);
228 
229  while (!e0 && (t0->next_table_index != ~0))
230  {
231  t0 = pool_elt_at_index (vcm->tables, t0->next_table_index);
232  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
233  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
234  }
235 
236  while (!e1 && (t1->next_table_index != ~0))
237  {
238  t1 = pool_elt_at_index (vcm->tables, t1->next_table_index);
239  hash1 = vnet_classify_hash_packet (t1, (u8 *) h1);
240  e1 = vnet_classify_find_entry (t1, (u8 *) h1, hash1, now);
241  }
242 
243  rwe_index0 = e0 ? e0->opaque_index : config0->miss_index;
244  rwe_index1 = e1 ? e1->opaque_index : config1->miss_index;
245 
246  if (rwe_index0 != ~0)
247  {
248  rwe0 = pool_elt_at_index (rw->entries, rwe_index0);
249  l2_rw_rewrite (rwe0, (u8 *) h0);
250  }
251  if (rwe_index1 != ~0)
252  {
253  rwe1 = pool_elt_at_index (rw->entries, rwe_index1);
254  l2_rw_rewrite (rwe1, (u8 *) h1);
255  }
256 
257  if (PREDICT_FALSE ((b0->flags & VLIB_BUFFER_IS_TRACED)))
258  {
259  l2_rw_trace_t *t = vlib_add_trace (vm, node, b0, sizeof (*t));
260  t->sw_if_index = sw_if_index0;
261  t->classify_table_index = config0->table_index;
262  t->rewrite_entry_index = rwe_index0;
263  }
264 
265  if (PREDICT_FALSE ((b1->flags & VLIB_BUFFER_IS_TRACED)))
266  {
267  l2_rw_trace_t *t = vlib_add_trace (vm, node, b1, sizeof (*t));
268  t->sw_if_index = sw_if_index1;
269  t->classify_table_index = config1->table_index;
270  t->rewrite_entry_index = rwe_index1;
271  }
272 
273  /* Update feature bitmap and get next feature index */
275  L2INPUT_FEAT_RW);
277  L2INPUT_FEAT_RW);
278 
279  vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
280  to_next, n_left_to_next,
281  bi0, bi1, next0, next1);
282  }
283 
284  while (n_left_from > 0 && n_left_to_next > 0)
285  {
286  u32 bi0, next0, sw_if_index0, rwe_index0;
287  vlib_buffer_t *b0;
288  ethernet_header_t *h0;
289  l2_rw_config_t *config0;
290  u64 hash0;
292  vnet_classify_entry_t *e0;
293  l2_rw_entry_t *rwe0;
294 
295  bi0 = from[0];
296  to_next[0] = bi0;
297  from += 1;
298  to_next += 1;
299  n_left_from -= 1;
300  n_left_to_next -= 1;
301 
302  b0 = vlib_get_buffer (vm, bi0);
303  h0 = vlib_buffer_get_current (b0);
304 
305  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
306  config0 = l2_rw_get_config (sw_if_index0); /*TODO: check sw_if_index0 value */
307  t0 = pool_elt_at_index (vcm->tables, config0->table_index);
308 
309  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
310  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
311 
312  while (!e0 && (t0->next_table_index != ~0))
313  {
314  t0 = pool_elt_at_index (vcm->tables, t0->next_table_index);
315  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
316  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
317  }
318 
319  rwe_index0 = e0 ? e0->opaque_index : config0->miss_index;
320 
321  if (rwe_index0 != ~0)
322  {
323  rwe0 = pool_elt_at_index (rw->entries, rwe_index0);
324  l2_rw_rewrite (rwe0, (u8 *) h0);
325  }
326 
327  if (PREDICT_FALSE ((b0->flags & VLIB_BUFFER_IS_TRACED)))
328  {
329  l2_rw_trace_t *t = vlib_add_trace (vm, node, b0, sizeof (*t));
330  t->sw_if_index = sw_if_index0;
331  t->classify_table_index = config0->table_index;
332  t->rewrite_entry_index = rwe_index0;
333  }
334 
335  /* Update feature bitmap and get next feature index */
337  L2INPUT_FEAT_RW);
338 
339  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
340  to_next, n_left_to_next,
341  bi0, next0);
342  }
343  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
344  }
345 
346  return frame->n_vectors;
347 }
348 
349 #ifndef CLIB_MARCH_VARIANT
350 int
352  u8 * mask, u8 * value, u32 len, u32 skip, u8 is_del)
353 {
354  l2_rw_main_t *rw = &l2_rw_main;
355  l2_rw_entry_t *e = 0;
356  if (*index != ~0)
357  {
358  if (pool_is_free_index (rw->entries, *index))
359  {
360  return -1;
361  }
362  e = pool_elt_at_index (rw->entries, *index);
363  }
364  else
365  {
366  pool_get (rw->entries, e);
367  *index = e - rw->entries;
368  }
369 
370  if (!e)
371  return -1;
372 
373  if (is_del)
374  {
375  pool_put (rw->entries, e);
376  return 0;
377  }
378 
379  e->skip_n_vectors = skip / sizeof (u32x4);
380  skip -= e->skip_n_vectors * sizeof (u32x4);
381  e->rewrite_n_vectors = (skip + len - 1) / sizeof (u32x4) + 1;
382  vec_alloc_aligned (e->mask, e->rewrite_n_vectors, sizeof (u32x4));
383  clib_memset (e->mask, 0, e->rewrite_n_vectors * sizeof (u32x4));
384  vec_alloc_aligned (e->value, e->rewrite_n_vectors, sizeof (u32x4));
385  clib_memset (e->value, 0, e->rewrite_n_vectors * sizeof (u32x4));
386 
387  clib_memcpy (((u8 *) e->value) + skip, value, len);
388  clib_memcpy (((u8 *) e->mask) + skip, mask, len);
389 
390  int i;
391  for (i = 0; i < e->rewrite_n_vectors; i++)
392  {
393  e->value[i] &= e->mask[i];
394  }
395 
396  return 0;
397 }
398 #endif /* CLIB_MARCH_VARIANT */
399 
400 static clib_error_t *
402  unformat_input_t * input, vlib_cli_command_t * cmd)
403 {
404  u32 index = ~0;
405  u8 *mask = 0;
406  u8 *value = 0;
407  u32 skip = 0;
408  u8 del = 0;
409 
411  {
412  if (unformat (input, "index %d", &index))
413  ;
414  else if (unformat (input, "mask %U", unformat_hex_string, &mask))
415  ;
416  else if (unformat (input, "value %U", unformat_hex_string, &value))
417  ;
418  else if (unformat (input, "skip %d", &skip))
419  ;
420  else if (unformat (input, "del"))
421  del = 1;
422  else
423  break;
424  }
425 
426  if (!mask || !value)
427  return clib_error_return (0, "Unspecified mask or value");
428 
429  if (vec_len (mask) != vec_len (value))
430  return clib_error_return (0, "Mask and value lengths must be identical");
431 
432  int ret;
433  if ((ret =
434  l2_rw_mod_entry (&index, mask, value, vec_len (mask), skip, del)))
435  return clib_error_return (0, "Could not add entry");
436 
437  return 0;
438 }
439 
440 /*?
441  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
442  * the provisioned mask and value, modifies the packet header.
443  *
444  * @cliexpar
445  * @todo This is incomplete. This needs a detailed description and a
446  * practical example.
447 ?*/
448 /* *INDENT-OFF* */
449 VLIB_CLI_COMMAND (l2_rw_entry_cli, static) = {
450  .path = "l2 rewrite entry",
451  .short_help =
452  "l2 rewrite entry [index <index>] [mask <hex-mask>] [value <hex-value>] [skip <n_bytes>] [del]",
453  .function = l2_rw_entry_cli_fn,
454 };
455 /* *INDENT-ON* */
456 
457 #ifndef CLIB_MARCH_VARIANT
458 int
459 l2_rw_interface_set_table (u32 sw_if_index, u32 table_index, u32 miss_index)
460 {
461  l2_rw_config_t *c = l2_rw_get_config (sw_if_index);
462  l2_rw_main_t *rw = &l2_rw_main;
463 
464  c->table_index = table_index;
465  c->miss_index = miss_index;
466  u32 feature_bitmap = (table_index == ~0) ? 0 : L2INPUT_FEAT_RW;
467 
468  l2input_intf_bitmap_enable (sw_if_index, L2INPUT_FEAT_RW, feature_bitmap);
469 
470  if (c->table_index == ~0)
471  clib_bitmap_set (rw->configs_bitmap, sw_if_index, 0);
472 
473  return 0;
474 }
475 #endif /* CLIB_MARCH_VARIANT */
476 
477 static clib_error_t *
479  unformat_input_t * input, vlib_cli_command_t * cmd)
480 {
481  vnet_main_t *vnm = vnet_get_main ();
482  u32 table_index = ~0;
483  u32 sw_if_index = ~0;
484  u32 miss_index = ~0;
485 
487  {
488  unformat (input, "%U", unformat_vnet_sw_interface, vnm, &sw_if_index);
489  }
490 
492  {
493  if (unformat (input, "table %d", &table_index))
494  ;
495  else if (unformat (input, "miss-index %d", &miss_index))
496  ;
497  else
498  break;
499  }
500 
501  if (sw_if_index == ~0)
502  return clib_error_return (0,
503  "You must specify an interface 'iface <interface>'",
504  format_unformat_error, input);
505  int ret;
506  if ((ret =
507  l2_rw_interface_set_table (sw_if_index, table_index, miss_index)))
508  return clib_error_return (0, "l2_rw_interface_set_table returned %d",
509  ret);
510 
511  return 0;
512 }
513 
514 /*?
515  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
516  * the provisioned mask and value, modifies the packet header.
517  *
518  * @cliexpar
519  * @todo This is incomplete. This needs a detailed description and a
520  * practical example.
521 ?*/
522 /* *INDENT-OFF* */
523 VLIB_CLI_COMMAND (l2_rw_interface_cli, static) = {
524  .path = "set interface l2 rewrite",
525  .short_help =
526  "set interface l2 rewrite <interface> [table <table index>] [miss-index <entry-index>]",
527  .function = l2_rw_interface_cli_fn,
528 };
529 /* *INDENT-ON* */
530 
531 static clib_error_t *
533  unformat_input_t * input,
534  vlib_cli_command_t * cmd)
535 {
536  l2_rw_main_t *rw = &l2_rw_main;
538  vlib_cli_output (vm, "No interface is currently using l2 rewrite\n");
539 
540  uword i;
541  /* *INDENT-OFF* */
543  vlib_cli_output (vm, "sw_if_index:%d %U\n", i, format_l2_rw_config, &rw->configs[i]);
544  });
545  /* *INDENT-ON* */
546  return 0;
547 }
548 
549 /*?
550  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
551  * the provisioned mask and value, modifies the packet header.
552  *
553  * @cliexpar
554  * @todo This is incomplete. This needs a detailed description and a
555  * practical example.
556 ?*/
557 /* *INDENT-OFF* */
558 VLIB_CLI_COMMAND (l2_rw_show_interfaces_cli, static) = {
559  .path = "show l2 rewrite interfaces",
560  .short_help =
561  "show l2 rewrite interfaces",
562  .function = l2_rw_show_interfaces_cli_fn,
563 };
564 /* *INDENT-ON* */
565 
566 static clib_error_t *
568  unformat_input_t * input, vlib_cli_command_t * cmd)
569 {
570  l2_rw_main_t *rw = &l2_rw_main;
571  l2_rw_entry_t *e;
572  if (pool_elts (rw->entries) == 0)
573  vlib_cli_output (vm, "No entries\n");
574 
575  /* *INDENT-OFF* */
576  pool_foreach(e, rw->entries, {
577  vlib_cli_output (vm, "%U\n", format_l2_rw_entry, e);
578  });
579  /* *INDENT-ON* */
580  return 0;
581 }
582 
583 /*?
584  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
585  * the provisioned mask and value, modifies the packet header.
586  *
587  * @cliexpar
588  * @todo This is incomplete. This needs a detailed description and a
589  * practical example.
590 ?*/
591 /* *INDENT-OFF* */
592 VLIB_CLI_COMMAND (l2_rw_show_entries_cli, static) = {
593  .path = "show l2 rewrite entries",
594  .short_help =
595  "show l2 rewrite entries",
596  .function = l2_rw_show_entries_cli_fn,
597 };
598 /* *INDENT-ON* */
599 
600 static int
601 l2_rw_enable_disable (u32 bridge_domain, u8 disable)
602 {
603  u32 mask = L2INPUT_FEAT_RW;
604  l2input_set_bridge_features (bridge_domain, mask, disable ? 0 : mask);
605  return 0;
606 }
607 
608 static clib_error_t *
610  unformat_input_t * input, vlib_cli_command_t * cmd)
611 {
612  u32 bridge_domain;
613  u8 disable = 0;
614 
616  !unformat (input, "%d", &bridge_domain))
617  {
618  return clib_error_return (0, "You must specify a bridge domain");
619  }
620 
622  unformat (input, "disable"))
623  {
624  disable = 1;
625  }
626 
627  if (l2_rw_enable_disable (bridge_domain, disable))
628  return clib_error_return (0, "Could not enable or disable rewrite");
629 
630  return 0;
631 }
632 
633 /*?
634  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
635  * the provisioned mask and value, modfies the packet header.
636  *
637  * @cliexpar
638  * @todo This is incomplete. This needs a detailed description and a
639  * practical example.
640 ?*/
641 /* *INDENT-OFF* */
642 VLIB_CLI_COMMAND (l2_rw_set_cli, static) = {
643  .path = "set bridge-domain rewrite",
644  .short_help =
645  "set bridge-domain rewrite <bridge-domain> [disable]",
646  .function = l2_rw_set_cli_fn,
647 };
648 /* *INDENT-ON* */
649 
650 static clib_error_t *
652 {
653  l2_rw_main_t *rw = &l2_rw_main;
654  rw->configs = 0;
655  rw->entries = 0;
658  l2_rw_node.index,
662  return 0;
663 }
664 
666 
667 enum
668 {
671 };
672 
673 #define foreach_l2_rw_error \
674 _(UNKNOWN, "Unknown error")
675 
676 typedef enum
677 {
678 #define _(sym,str) L2_RW_ERROR_##sym,
680 #undef _
682 } l2_rw_error_t;
683 
684 static char *l2_rw_error_strings[] = {
685 #define _(sym,string) string,
687 #undef _
688 };
689 
690 /* *INDENT-OFF* */
692  .name = "l2-rw",
693  .vector_size = sizeof (u32),
694  .format_trace = format_l2_rw_trace,
695  .type = VLIB_NODE_TYPE_INTERNAL,
696  .n_errors = ARRAY_LEN(l2_rw_error_strings),
697  .error_strings = l2_rw_error_strings,
698  .runtime_data_bytes = 0,
699  .n_next_nodes = L2_RW_N_NEXT,
700  .next_nodes = { [L2_RW_NEXT_DROP] = "error-drop"},
701 };
702 /* *INDENT-ON* */
703 
704 /*
705  * fd.io coding-style-patch-verification: ON
706  *
707  * Local Variables:
708  * eval: (c-set-style "gnu")
709  * End:
710  */
u64 vnet_classify_hash_packet(vnet_classify_table_t *t, u8 *h)
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:439
u32 sw_if_index
Definition: ipsec_gre.api:37
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:82
vnet_main_t * vnet_get_main(void)
Definition: misc.c:47
static clib_error_t * l2_rw_show_interfaces_cli_fn(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: l2_rw.c:532
u32 l2input_set_bridge_features(u32 bd_index, u32 feat_mask, u32 feat_value)
Definition: l2_input.c:550
l2_rw_main_t l2_rw_main
Definition: l2_rw.c:30
unsigned long u64
Definition: types.h:89
static l2_rw_config_t * l2_rw_get_config(u32 sw_if_index)
Definition: l2_rw.c:77
static u8 * format_l2_rw_entry(u8 *s, va_list *args)
Definition: l2_rw.c:41
static f64 vlib_time_now(vlib_main_t *vm)
Definition: main.h:255
unformat_function_t unformat_hex_string
Definition: format.h:288
static clib_error_t * l2_rw_show_entries_cli_fn(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: l2_rw.c:567
#define U32X4_ALIGNED(p)
Definition: vnet_classify.h:41
l2_rw_config_t * configs
Definition: l2_rw.h:57
int i
static uword * clib_bitmap_set(uword *ai, uword i, uword value)
Sets the ith bit of a bitmap to new_value Removes trailing zeros from the bitmap. ...
Definition: bitmap.h:167
clib_memset(h->entries, 0, sizeof(h->entries[0])*entries)
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:424
unformat_function_t unformat_vnet_sw_interface
#define VLIB_NODE_FN(node)
Definition: node.h:201
#define pool_get(P, E)
Allocate an object E from a pool P (unspecified alignment).
Definition: pool.h:236
vlib_node_registration_t l2_rw_node
(constructor) VLIB_REGISTER_NODE (l2_rw_node)
Definition: l2_rw.c:691
unsigned char u8
Definition: types.h:56
static u32 vnet_l2_feature_next(vlib_buffer_t *b, u32 *next_nodes, u32 feat_bit)
Return the graph node index for the feature corresponding to the next set bit after clearing the curr...
Definition: feat_bitmap.h:94
static u8 * format_l2_rw_config(u8 *s, va_list *args)
Definition: l2_rw.c:57
#define foreach_l2_rw_error
Definition: l2_rw.c:673
double f64
Definition: types.h:142
#define clib_memcpy(d, s, n)
Definition: string.h:180
u32 classify_table_index
Definition: l2_rw.c:36
#define static_always_inline
Definition: clib.h:99
#define pool_foreach(VAR, POOL, BODY)
Iterate through pool.
Definition: pool.h:493
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:163
#define always_inline
Definition: clib.h:98
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
Definition: buffer.h:203
static char * l2_rw_error_strings[]
Definition: l2_rw.c:684
u8 * format_hex_bytes(u8 *s, va_list *va)
Definition: std-formats.c:84
#define clib_error_return(e, args...)
Definition: error.h:99
unsigned int u32
Definition: types.h:88
#define clib_bitmap_foreach(i, ai, body)
Macro to iterate across set bits in a bitmap.
Definition: bitmap.h:361
static clib_error_t * l2_rw_set_cli_fn(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: l2_rw.c:609
#define pool_elt_at_index(p, i)
Returns pointer to element at given index.
Definition: pool.h:514
int l2_rw_mod_entry(u32 *index, u8 *mask, u8 *value, u32 len, u32 skip, u8 is_del)
Definition: l2_rw.c:351
static int l2_rw_enable_disable(u32 bridge_domain, u8 disable)
Definition: l2_rw.c:601
static clib_error_t * l2_rw_entry_cli_fn(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: l2_rw.c:401
struct _unformat_input_t unformat_input_t
static void * vlib_buffer_get_current(vlib_buffer_t *b)
Get pointer to current data to process.
Definition: buffer.h:229
#define vec_alloc_aligned(V, N, A)
Allocate space for N more elements (no header, given alignment)
Definition: vec.h:289
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:286
static_always_inline void l2_rw_rewrite(l2_rw_entry_t *rwe, u8 *h)
Definition: l2_rw.c:92
uword * configs_bitmap
Definition: l2_rw.h:58
#define PREDICT_FALSE(x)
Definition: clib.h:111
#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:368
static u8 * format_l2_rw_trace(u8 *s, va_list *args)
Definition: l2_rw.c:66
u8 len
Definition: ip_types.api:49
#define clib_bitmap_alloc(v, n_bits)
Allocate a bitmap with the supplied number of bits.
Definition: bitmap.h:109
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:169
#define UNFORMAT_END_OF_INPUT
Definition: format.h:144
svmdb_client_t * c
vlib_main_t * vm
Definition: buffer.c:312
static void feat_bitmap_init_next_nodes(vlib_main_t *vm, u32 node_index, u32 num_features, char **feat_names, u32 *next_nodes)
Initialize the feature next-node indexes of a graph node.
Definition: feat_bitmap.h:43
#define vlib_prefetch_buffer_data(b, type)
Definition: buffer.h:204
#define pool_is_free_index(P, I)
Use free bitmap to query whether given index is free.
Definition: pool.h:283
#define ARRAY_LEN(x)
Definition: clib.h:62
u32 rewrite_entry_index
Definition: l2_rw.c:37
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:465
static uword clib_bitmap_get(uword *ai, uword i)
Gets the ith bit value from a bitmap.
Definition: bitmap.h:197
char ** l2input_get_feat_names(void)
Return an array of strings containing graph node names of each feature.
Definition: l2_input.c:62
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:155
struct _vnet_classify_main vnet_classify_main_t
Definition: vnet_classify.h:67
u32 sw_if_index
Definition: l2_rw.c:35
static clib_error_t * l2_rw_init(vlib_main_t *vm)
Definition: l2_rw.c:651
u32 l2input_intf_bitmap_enable(u32 sw_if_index, l2input_feat_masks_t feature_bitmap, u32 enable)
Enable (or disable) the feature in the bitmap for the given interface.
Definition: l2_input.c:536
static clib_error_t * l2_rw_interface_cli_fn(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: l2_rw.c:478
u32 feat_next_node_index[32]
Definition: l2_rw.h:51
vnet_classify_main_t vnet_classify_main
Definition: vnet_classify.c:22
static vlib_main_t * vlib_get_main(void)
Definition: global_funcs.h:23
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:57
static uword clib_bitmap_count_set_bits(uword *ai)
Return the number of set bits in a bitmap.
Definition: bitmap.h:462
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
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:274
int l2_rw_interface_set_table(u32 sw_if_index, u32 table_index, u32 miss_index)
Definition: l2_rw.c:459
#define vnet_buffer(b)
Definition: buffer.h:369
u8 * format_unformat_error(u8 *s, va_list *va)
Definition: unformat.c:91
unsigned long long u32x4
Definition: ixge.c:28
l2_rw_entry_t * entries
Definition: l2_rw.h:54
l2_rw_error_t
Definition: l2_rw.c:676
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:762
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
vnet_classify_entry_t * vnet_classify_find_entry(vnet_classify_table_t *t, u8 *h, u64 hash, f64 now)
uword unformat(unformat_input_t *i, const char *fmt,...)
Definition: unformat.c:972
Definition: defs.h:46
static uword unformat_check_input(unformat_input_t *i)
Definition: format.h:170
static uword pool_elts(void *v)
Number of active elements in a pool.
Definition: pool.h:128