FD.io VPP  v20.09-64-g4f7b92f0a
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>
20 
21 /**
22  * @file
23  * @brief Layer 2 Rewrite.
24  *
25  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
26  * the provisioned mask and value, modifies the packet header.
27  */
28 
29 
30 #ifndef CLIB_MARCH_VARIANT
32 #endif /* CLIB_MARCH_VARIANT */
33 
34 typedef struct
35 {
40 
41 static u8 *
42 format_l2_rw_entry (u8 * s, va_list * args)
43 {
44  l2_rw_entry_t *e = va_arg (*args, l2_rw_entry_t *);
45  l2_rw_main_t *rw = &l2_rw_main;
46  s = format (s, "%d - mask:%U value:%U\n",
47  e - rw->entries,
48  format_hex_bytes, e->mask,
49  e->rewrite_n_vectors * sizeof (u32x4), format_hex_bytes,
50  e->value, e->rewrite_n_vectors * sizeof (u32x4));
51  s =
52  format (s, " hits:%d skip_bytes:%d", e->hit_count,
53  e->skip_n_vectors * sizeof (u32x4));
54  return s;
55 }
56 
57 static u8 *
58 format_l2_rw_config (u8 * s, va_list * args)
59 {
60  l2_rw_config_t *c = va_arg (*args, l2_rw_config_t *);
61  return format (s, "table-index:%d miss-index:%d",
62  c->table_index, c->miss_index);
63 }
64 
65 /* packet trace format function */
66 static u8 *
67 format_l2_rw_trace (u8 * s, va_list * args)
68 {
69  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
70  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
71  l2_rw_trace_t *t = va_arg (*args, l2_rw_trace_t *);
72  return format (s, "l2-rw: sw_if_index %d, table %d, entry %d",
75 }
76 
77 always_inline l2_rw_config_t *
79 {
80  l2_rw_main_t *rw = &l2_rw_main;
81  if (PREDICT_FALSE (!clib_bitmap_get (rw->configs_bitmap, sw_if_index)))
82  {
83  vec_validate (rw->configs, sw_if_index);
84  rw->configs[sw_if_index].table_index = ~0;
85  rw->configs[sw_if_index].miss_index = ~0;
86  rw->configs_bitmap =
87  clib_bitmap_set (rw->configs_bitmap, sw_if_index, 1);
88  }
89  return &rw->configs[sw_if_index];
90 }
91 
93 l2_rw_rewrite (l2_rw_entry_t * rwe, u8 * h)
94 {
95  u32x4u *d = ((u32x4u *) h) + rwe->skip_n_vectors;
96  switch (rwe->rewrite_n_vectors)
97  {
98  case 5:
99  d[4] = (d[4] & ~rwe->mask[4]) | rwe->value[4];
100  /* FALLTHROUGH */
101  case 4:
102  d[3] = (d[3] & ~rwe->mask[3]) | rwe->value[3];
103  /* FALLTHROUGH */
104  case 3:
105  d[2] = (d[2] & ~rwe->mask[2]) | rwe->value[2];
106  /* FALLTHROUGH */
107  case 2:
108  d[1] = (d[1] & ~rwe->mask[1]) | rwe->value[1];
109  /* FALLTHROUGH */
110  case 1:
111  d[0] = (d[0] & ~rwe->mask[0]) | rwe->value[0];
112  break;
113  default:
114  abort ();
115  }
116 }
117 
120 {
121  l2_rw_main_t *rw = &l2_rw_main;
122  u32 n_left_from, *from, *to_next, next_index;
124  f64 now = vlib_time_now (vlib_get_main ());
125 
126  from = vlib_frame_vector_args (frame);
127  n_left_from = frame->n_vectors; /* number of packets to process */
128  next_index = node->cached_next_index;
129 
130  while (n_left_from > 0)
131  {
132  u32 n_left_to_next;
133 
134  /* get space to enqueue frame to graph node "next_index" */
135  vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
136 
137  while (n_left_from >= 6 && n_left_to_next >= 2)
138  {
139  u32 bi0, next0, sw_if_index0, rwe_index0;
140  u32 bi1, next1, sw_if_index1, rwe_index1;
141  vlib_buffer_t *b0, *b1;
142  ethernet_header_t *h0, *h1;
143  l2_rw_config_t *config0, *config1;
144  u64 hash0, hash1;
145  vnet_classify_table_t *t0, *t1;
146  vnet_classify_entry_t *e0, *e1;
147  l2_rw_entry_t *rwe0, *rwe1;
148 
149  {
150  vlib_buffer_t *p2, *p3, *p4, *p5;
151  p2 = vlib_get_buffer (vm, from[2]);
152  p3 = vlib_get_buffer (vm, from[3]);
153  p4 = vlib_get_buffer (vm, from[4]);
154  p5 = vlib_get_buffer (vm, from[5]);
155 
156  vlib_prefetch_buffer_header (p4, LOAD);
157  vlib_prefetch_buffer_header (p5, LOAD);
158  vlib_prefetch_buffer_data (p2, LOAD);
159  vlib_prefetch_buffer_data (p3, LOAD);
160  }
161 
162  bi0 = from[0];
163  bi1 = from[1];
164  to_next[0] = bi0;
165  to_next[1] = bi1;
166  from += 2;
167  to_next += 2;
168  n_left_from -= 2;
169  n_left_to_next -= 2;
170 
171  b0 = vlib_get_buffer (vm, bi0);
172  b1 = vlib_get_buffer (vm, bi1);
173  h0 = vlib_buffer_get_current (b0);
174  h1 = vlib_buffer_get_current (b1);
175 
176  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
177  sw_if_index1 = vnet_buffer (b1)->sw_if_index[VLIB_RX];
178  config0 = l2_rw_get_config (sw_if_index0); /*TODO: check sw_if_index0 value */
179  config1 = l2_rw_get_config (sw_if_index1); /*TODO: check sw_if_index0 value */
180  t0 = pool_elt_at_index (vcm->tables, config0->table_index);
181  t1 = pool_elt_at_index (vcm->tables, config1->table_index);
182 
183  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
184  hash1 = vnet_classify_hash_packet (t1, (u8 *) h1);
185  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
186  e1 = vnet_classify_find_entry (t1, (u8 *) h1, hash1, now);
187 
188  while (!e0 && (t0->next_table_index != ~0))
189  {
190  t0 = pool_elt_at_index (vcm->tables, t0->next_table_index);
191  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
192  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
193  }
194 
195  while (!e1 && (t1->next_table_index != ~0))
196  {
197  t1 = pool_elt_at_index (vcm->tables, t1->next_table_index);
198  hash1 = vnet_classify_hash_packet (t1, (u8 *) h1);
199  e1 = vnet_classify_find_entry (t1, (u8 *) h1, hash1, now);
200  }
201 
202  rwe_index0 = e0 ? e0->opaque_index : config0->miss_index;
203  rwe_index1 = e1 ? e1->opaque_index : config1->miss_index;
204 
205  if (rwe_index0 != ~0)
206  {
207  rwe0 = pool_elt_at_index (rw->entries, rwe_index0);
208  l2_rw_rewrite (rwe0, (u8 *) h0);
209  }
210  if (rwe_index1 != ~0)
211  {
212  rwe1 = pool_elt_at_index (rw->entries, rwe_index1);
213  l2_rw_rewrite (rwe1, (u8 *) h1);
214  }
215 
216  if (PREDICT_FALSE ((b0->flags & VLIB_BUFFER_IS_TRACED)))
217  {
218  l2_rw_trace_t *t = vlib_add_trace (vm, node, b0, sizeof (*t));
219  t->sw_if_index = sw_if_index0;
220  t->classify_table_index = config0->table_index;
221  t->rewrite_entry_index = rwe_index0;
222  }
223 
224  if (PREDICT_FALSE ((b1->flags & VLIB_BUFFER_IS_TRACED)))
225  {
226  l2_rw_trace_t *t = vlib_add_trace (vm, node, b1, sizeof (*t));
227  t->sw_if_index = sw_if_index1;
228  t->classify_table_index = config1->table_index;
229  t->rewrite_entry_index = rwe_index1;
230  }
231 
232  /* Update feature bitmap and get next feature index */
234  L2INPUT_FEAT_RW);
236  L2INPUT_FEAT_RW);
237 
238  vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
239  to_next, n_left_to_next,
240  bi0, bi1, next0, next1);
241  }
242 
243  while (n_left_from > 0 && n_left_to_next > 0)
244  {
245  u32 bi0, next0, sw_if_index0, rwe_index0;
246  vlib_buffer_t *b0;
247  ethernet_header_t *h0;
248  l2_rw_config_t *config0;
249  u64 hash0;
251  vnet_classify_entry_t *e0;
252  l2_rw_entry_t *rwe0;
253 
254  bi0 = from[0];
255  to_next[0] = bi0;
256  from += 1;
257  to_next += 1;
258  n_left_from -= 1;
259  n_left_to_next -= 1;
260 
261  b0 = vlib_get_buffer (vm, bi0);
262  h0 = vlib_buffer_get_current (b0);
263 
264  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
265  config0 = l2_rw_get_config (sw_if_index0); /*TODO: check sw_if_index0 value */
266  t0 = pool_elt_at_index (vcm->tables, config0->table_index);
267 
268  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
269  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
270 
271  while (!e0 && (t0->next_table_index != ~0))
272  {
273  t0 = pool_elt_at_index (vcm->tables, t0->next_table_index);
274  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
275  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
276  }
277 
278  rwe_index0 = e0 ? e0->opaque_index : config0->miss_index;
279 
280  if (rwe_index0 != ~0)
281  {
282  rwe0 = pool_elt_at_index (rw->entries, rwe_index0);
283  l2_rw_rewrite (rwe0, (u8 *) h0);
284  }
285 
286  if (PREDICT_FALSE ((b0->flags & VLIB_BUFFER_IS_TRACED)))
287  {
288  l2_rw_trace_t *t = vlib_add_trace (vm, node, b0, sizeof (*t));
289  t->sw_if_index = sw_if_index0;
290  t->classify_table_index = config0->table_index;
291  t->rewrite_entry_index = rwe_index0;
292  }
293 
294  /* Update feature bitmap and get next feature index */
296  L2INPUT_FEAT_RW);
297 
298  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
299  to_next, n_left_to_next,
300  bi0, next0);
301  }
302  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
303  }
304 
305  return frame->n_vectors;
306 }
307 
308 #ifndef CLIB_MARCH_VARIANT
309 int
311  u8 * mask, u8 * value, u32 len, u32 skip, u8 is_del)
312 {
313  l2_rw_main_t *rw = &l2_rw_main;
314  l2_rw_entry_t *e = 0;
315  if (*index != ~0)
316  {
317  if (pool_is_free_index (rw->entries, *index))
318  {
319  return -1;
320  }
321  e = pool_elt_at_index (rw->entries, *index);
322  }
323  else
324  {
325  pool_get (rw->entries, e);
326  *index = e - rw->entries;
327  }
328 
329  if (!e)
330  return -1;
331 
332  if (is_del)
333  {
334  pool_put (rw->entries, e);
335  return 0;
336  }
337 
338  e->skip_n_vectors = skip / sizeof (u32x4);
339  skip -= e->skip_n_vectors * sizeof (u32x4);
340  e->rewrite_n_vectors = (skip + len - 1) / sizeof (u32x4) + 1;
341  vec_alloc_aligned (e->mask, e->rewrite_n_vectors, sizeof (u32x4));
342  clib_memset (e->mask, 0, e->rewrite_n_vectors * sizeof (u32x4));
343  vec_alloc_aligned (e->value, e->rewrite_n_vectors, sizeof (u32x4));
344  clib_memset (e->value, 0, e->rewrite_n_vectors * sizeof (u32x4));
345 
346  clib_memcpy (((u8 *) e->value) + skip, value, len);
347  clib_memcpy (((u8 *) e->mask) + skip, mask, len);
348 
349  int i;
350  for (i = 0; i < e->rewrite_n_vectors; i++)
351  {
352  e->value[i] &= e->mask[i];
353  }
354 
355  return 0;
356 }
357 #endif /* CLIB_MARCH_VARIANT */
358 
359 static clib_error_t *
361  unformat_input_t * input, vlib_cli_command_t * cmd)
362 {
363  u32 index = ~0;
364  u8 *mask = 0;
365  u8 *value = 0;
366  u32 skip = 0;
367  u8 del = 0;
368 
370  {
371  if (unformat (input, "index %d", &index))
372  ;
373  else if (unformat (input, "mask %U", unformat_hex_string, &mask))
374  ;
375  else if (unformat (input, "value %U", unformat_hex_string, &value))
376  ;
377  else if (unformat (input, "skip %d", &skip))
378  ;
379  else if (unformat (input, "del"))
380  del = 1;
381  else
382  break;
383  }
384 
385  if (!mask || !value)
386  return clib_error_return (0, "Unspecified mask or value");
387 
388  if (vec_len (mask) != vec_len (value))
389  return clib_error_return (0, "Mask and value lengths must be identical");
390 
391  int ret;
392  if ((ret =
393  l2_rw_mod_entry (&index, mask, value, vec_len (mask), skip, del)))
394  return clib_error_return (0, "Could not add entry");
395 
396  return 0;
397 }
398 
399 /*?
400  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
401  * the provisioned mask and value, modifies the packet header.
402  *
403  * @cliexpar
404  * @todo This is incomplete. This needs a detailed description and a
405  * practical example.
406 ?*/
407 /* *INDENT-OFF* */
408 VLIB_CLI_COMMAND (l2_rw_entry_cli, static) = {
409  .path = "l2 rewrite entry",
410  .short_help =
411  "l2 rewrite entry [index <index>] [mask <hex-mask>] [value <hex-value>] [skip <n_bytes>] [del]",
412  .function = l2_rw_entry_cli_fn,
413 };
414 /* *INDENT-ON* */
415 
416 #ifndef CLIB_MARCH_VARIANT
417 int
418 l2_rw_interface_set_table (u32 sw_if_index, u32 table_index, u32 miss_index)
419 {
420  l2_rw_config_t *c = l2_rw_get_config (sw_if_index);
421  l2_rw_main_t *rw = &l2_rw_main;
422 
423  c->table_index = table_index;
424  c->miss_index = miss_index;
425  u32 feature_bitmap = (table_index == ~0) ? 0 : L2INPUT_FEAT_RW;
426 
427  l2input_intf_bitmap_enable (sw_if_index, L2INPUT_FEAT_RW, feature_bitmap);
428 
429  if (c->table_index == ~0)
430  clib_bitmap_set (rw->configs_bitmap, sw_if_index, 0);
431 
432  return 0;
433 }
434 #endif /* CLIB_MARCH_VARIANT */
435 
436 static clib_error_t *
438  unformat_input_t * input, vlib_cli_command_t * cmd)
439 {
440  vnet_main_t *vnm = vnet_get_main ();
441  u32 table_index = ~0;
442  u32 sw_if_index = ~0;
443  u32 miss_index = ~0;
444 
446  {
447  unformat (input, "%U", unformat_vnet_sw_interface, vnm, &sw_if_index);
448  }
449 
451  {
452  if (unformat (input, "table %d", &table_index))
453  ;
454  else if (unformat (input, "miss-index %d", &miss_index))
455  ;
456  else
457  break;
458  }
459 
460  if (sw_if_index == ~0)
461  return clib_error_return (0,
462  "You must specify an interface 'iface <interface>'",
463  format_unformat_error, input);
464  int ret;
465  if ((ret =
466  l2_rw_interface_set_table (sw_if_index, table_index, miss_index)))
467  return clib_error_return (0, "l2_rw_interface_set_table returned %d",
468  ret);
469 
470  return 0;
471 }
472 
473 /*?
474  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
475  * the provisioned mask and value, modifies the packet header.
476  *
477  * @cliexpar
478  * @todo This is incomplete. This needs a detailed description and a
479  * practical example.
480 ?*/
481 /* *INDENT-OFF* */
482 VLIB_CLI_COMMAND (l2_rw_interface_cli, static) = {
483  .path = "set interface l2 rewrite",
484  .short_help =
485  "set interface l2 rewrite <interface> [table <table index>] [miss-index <entry-index>]",
486  .function = l2_rw_interface_cli_fn,
487 };
488 /* *INDENT-ON* */
489 
490 static clib_error_t *
492  unformat_input_t * input,
493  vlib_cli_command_t * cmd)
494 {
495  l2_rw_main_t *rw = &l2_rw_main;
497  vlib_cli_output (vm, "No interface is currently using l2 rewrite\n");
498 
499  uword i;
500  /* *INDENT-OFF* */
502  vlib_cli_output (vm, "sw_if_index:%d %U\n", i, format_l2_rw_config, &rw->configs[i]);
503  });
504  /* *INDENT-ON* */
505  return 0;
506 }
507 
508 /*?
509  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
510  * the provisioned mask and value, modifies the packet header.
511  *
512  * @cliexpar
513  * @todo This is incomplete. This needs a detailed description and a
514  * practical example.
515 ?*/
516 /* *INDENT-OFF* */
517 VLIB_CLI_COMMAND (l2_rw_show_interfaces_cli, static) = {
518  .path = "show l2 rewrite interfaces",
519  .short_help =
520  "show l2 rewrite interfaces",
521  .function = l2_rw_show_interfaces_cli_fn,
522 };
523 /* *INDENT-ON* */
524 
525 static clib_error_t *
527  unformat_input_t * input, vlib_cli_command_t * cmd)
528 {
529  l2_rw_main_t *rw = &l2_rw_main;
530  l2_rw_entry_t *e;
531  if (pool_elts (rw->entries) == 0)
532  vlib_cli_output (vm, "No entries\n");
533 
534  /* *INDENT-OFF* */
535  pool_foreach(e, rw->entries, {
536  vlib_cli_output (vm, "%U\n", format_l2_rw_entry, e);
537  });
538  /* *INDENT-ON* */
539  return 0;
540 }
541 
542 /*?
543  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
544  * the provisioned mask and value, modifies the packet header.
545  *
546  * @cliexpar
547  * @todo This is incomplete. This needs a detailed description and a
548  * practical example.
549 ?*/
550 /* *INDENT-OFF* */
551 VLIB_CLI_COMMAND (l2_rw_show_entries_cli, static) = {
552  .path = "show l2 rewrite entries",
553  .short_help =
554  "show l2 rewrite entries",
555  .function = l2_rw_show_entries_cli_fn,
556 };
557 /* *INDENT-ON* */
558 
559 static int
560 l2_rw_enable_disable (u32 bridge_domain, u8 disable)
561 {
562  u32 mask = L2INPUT_FEAT_RW;
563  l2input_set_bridge_features (bridge_domain, mask, disable ? 0 : mask);
564  return 0;
565 }
566 
567 static clib_error_t *
569  unformat_input_t * input, vlib_cli_command_t * cmd)
570 {
571  u32 bridge_domain;
572  u8 disable = 0;
573 
575  !unformat (input, "%d", &bridge_domain))
576  {
577  return clib_error_return (0, "You must specify a bridge domain");
578  }
579 
581  unformat (input, "disable"))
582  {
583  disable = 1;
584  }
585 
586  if (l2_rw_enable_disable (bridge_domain, disable))
587  return clib_error_return (0, "Could not enable or disable rewrite");
588 
589  return 0;
590 }
591 
592 /*?
593  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
594  * the provisioned mask and value, modfies the packet header.
595  *
596  * @cliexpar
597  * @todo This is incomplete. This needs a detailed description and a
598  * practical example.
599 ?*/
600 /* *INDENT-OFF* */
601 VLIB_CLI_COMMAND (l2_rw_set_cli, static) = {
602  .path = "set bridge-domain rewrite",
603  .short_help =
604  "set bridge-domain rewrite <bridge-domain> [disable]",
605  .function = l2_rw_set_cli_fn,
606 };
607 /* *INDENT-ON* */
608 
609 static clib_error_t *
611 {
612  l2_rw_main_t *rw = &l2_rw_main;
613  rw->configs = 0;
614  rw->entries = 0;
617  l2_rw_node.index,
621  return 0;
622 }
623 
625 
626 enum
627 {
630 };
631 
632 #define foreach_l2_rw_error \
633 _(UNKNOWN, "Unknown error")
634 
635 typedef enum
636 {
637 #define _(sym,str) L2_RW_ERROR_##sym,
639 #undef _
641 } l2_rw_error_t;
642 
643 static char *l2_rw_error_strings[] = {
644 #define _(sym,string) string,
646 #undef _
647 };
648 
649 /* *INDENT-OFF* */
651  .name = "l2-rw",
652  .vector_size = sizeof (u32),
653  .format_trace = format_l2_rw_trace,
655  .n_errors = ARRAY_LEN(l2_rw_error_strings),
656  .error_strings = l2_rw_error_strings,
657  .runtime_data_bytes = 0,
658  .n_next_nodes = L2_RW_N_NEXT,
659  .next_nodes = { [L2_RW_NEXT_DROP] = "error-drop"},
660 };
661 /* *INDENT-ON* */
662 
663 /*
664  * fd.io coding-style-patch-verification: ON
665  *
666  * Local Variables:
667  * eval: (c-set-style "gnu")
668  * End:
669  */
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:509
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:87
vnet_main_t * vnet_get_main(void)
Definition: misc.c:46
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:491
u32 l2input_set_bridge_features(u32 bd_index, u32 feat_mask, u32 feat_value)
Definition: l2_input.c:541
l2_rw_main_t l2_rw_main
Definition: l2_rw.c:31
unsigned long u64
Definition: types.h:89
static l2_rw_config_t * l2_rw_get_config(u32 sw_if_index)
Definition: l2_rw.c:78
static u8 * format_l2_rw_entry(u8 *s, va_list *args)
Definition: l2_rw.c:42
clib_memset(h->entries, 0, sizeof(h->entries[0]) *entries)
static f64 vlib_time_now(vlib_main_t *vm)
Definition: main.h:333
unformat_function_t unformat_hex_string
Definition: format.h:289
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:526
l2_rw_config_t * configs
Definition: l2_rw.h:57
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
vlib_main_t * vm
Definition: in2out_ed.c:1582
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:202
u16 mask
Definition: flow_types.api:52
#define pool_get(P, E)
Allocate an object E from a pool P (unspecified alignment).
Definition: pool.h:252
vlib_node_registration_t l2_rw_node
(constructor) VLIB_REGISTER_NODE (l2_rw_node)
Definition: l2_rw.c:650
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:58
#define foreach_l2_rw_error
Definition: l2_rw.c:632
double f64
Definition: types.h:142
#define clib_memcpy(d, s, n)
Definition: string.h:180
u32 classify_table_index
Definition: l2_rw.c:37
#define static_always_inline
Definition: clib.h:108
#define pool_foreach(VAR, POOL, BODY)
Iterate through pool.
Definition: pool.h:513
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:173
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
Definition: buffer.h:203
static char * l2_rw_error_strings[]
Definition: l2_rw.c:643
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
vl_api_fib_path_type_t type
Definition: fib_types.api:123
#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:568
#define pool_elt_at_index(p, i)
Returns pointer to element at given index.
Definition: pool.h:534
int l2_rw_mod_entry(u32 *index, u8 *mask, u8 *value, u32 len, u32 skip, u8 is_del)
Definition: l2_rw.c:310
static int l2_rw_enable_disable(u32 bridge_domain, u8 disable)
Definition: l2_rw.c:560
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:360
struct _unformat_input_t unformat_input_t
vec_header_t h
Definition: buffer.c:322
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:328
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:302
static_always_inline void l2_rw_rewrite(l2_rw_entry_t *rwe, u8 *h)
Definition: l2_rw.c:93
uword * configs_bitmap
Definition: l2_rw.h:58
#define PREDICT_FALSE(x)
Definition: clib.h:120
#define always_inline
Definition: ipsec.h:28
#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:391
static u8 * format_l2_rw_trace(u8 *s, va_list *args)
Definition: l2_rw.c:67
u8 len
Definition: ip_types.api:92
#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:145
svmdb_client_t * c
sll srl srl sll sra u16x4 i
Definition: vector_sse42.h:317
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:299
#define ARRAY_LEN(x)
Definition: clib.h:67
u32 rewrite_entry_index
Definition: l2_rw.c:38
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:483
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
vlib_main_t vlib_node_runtime_t * node
Definition: in2out_ed.c:1582
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:158
struct _vnet_classify_main vnet_classify_main_t
Definition: vnet_classify.h:55
u8 value
Definition: qos.api:54
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:696
u32 sw_if_index
Definition: l2_rw.c:36
static clib_error_t * l2_rw_init(vlib_main_t *vm)
Definition: l2_rw.c:610
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:527
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:437
u32 feat_next_node_index[32]
Definition: l2_rw.h:51
vnet_classify_main_t vnet_classify_main
Definition: vnet_classify.c:29
static vlib_main_t * vlib_get_main(void)
Definition: global_funcs.h:23
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_main_t vlib_node_runtime_t vlib_frame_t * frame
Definition: in2out_ed.c:1583
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:297
u32 index
Definition: flow_types.api:221
int l2_rw_interface_set_table(u32 sw_if_index, u32 table_index, u32 miss_index)
Definition: l2_rw.c:418
#define vnet_buffer(b)
Definition: buffer.h:417
u8 * format_unformat_error(u8 *s, va_list *va)
Definition: unformat.c:91
unsigned long long u32x4
Definition: ixge.c:28
void * vlib_add_trace(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_buffer_t *b, u32 n_data_bytes)
Definition: trace.c:577
l2_rw_entry_t * entries
Definition: l2_rw.h:54
l2_rw_error_t
Definition: l2_rw.c:635
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)
vl_api_interface_index_t sw_if_index
Definition: wireguard.api:33
uword unformat(unformat_input_t *i, const char *fmt,...)
Definition: unformat.c:978
Definition: defs.h:46
static uword unformat_check_input(unformat_input_t *i)
Definition: format.h:171
static uword pool_elts(void *v)
Number of active elements in a pool.
Definition: pool.h:128