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