FD.io VPP  v18.01.2-1-g9b554f3
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, modfies the packet header.
26  */
27 
28 
30 
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 *
77 l2_rw_get_config (u32 sw_if_index)
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 
159 static uword
161  vlib_node_runtime_t * node, vlib_frame_t * frame)
162 {
163  l2_rw_main_t *rw = &l2_rw_main;
164  u32 n_left_from, *from, *to_next, next_index;
166  f64 now = vlib_time_now (vlib_get_main ());
167  u32 prefetch_size = 0;
168 
169  from = vlib_frame_vector_args (frame);
170  n_left_from = frame->n_vectors; /* number of packets to process */
171  next_index = node->cached_next_index;
172 
173  while (n_left_from > 0)
174  {
175  u32 n_left_to_next;
176 
177  /* get space to enqueue frame to graph node "next_index" */
178  vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
179 
180  while (n_left_from >= 4 && n_left_to_next >= 2)
181  {
182  u32 bi0, next0, sw_if_index0, rwe_index0;
183  u32 bi1, next1, sw_if_index1, rwe_index1;
184  vlib_buffer_t *b0, *b1;
185  ethernet_header_t *h0, *h1;
186  l2_rw_config_t *config0, *config1;
187  u64 hash0, hash1;
188  vnet_classify_table_t *t0, *t1;
189  vnet_classify_entry_t *e0, *e1;
190  l2_rw_entry_t *rwe0, *rwe1;
191 
192  {
193  vlib_buffer_t *p2, *p3;
194  p2 = vlib_get_buffer (vm, from[2]);
195  p3 = vlib_get_buffer (vm, from[3]);
196 
197  vlib_prefetch_buffer_header (p2, LOAD);
198  vlib_prefetch_buffer_header (p3, LOAD);
199  CLIB_PREFETCH (vlib_buffer_get_current (p2), prefetch_size, LOAD);
200  CLIB_PREFETCH (vlib_buffer_get_current (p3), prefetch_size, 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  prefetch_size =
224  (t1->skip_n_vectors + t1->match_n_vectors) * sizeof (u32x4);
225 
226  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
227  hash1 = vnet_classify_hash_packet (t1, (u8 *) h1);
228  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
229  e1 = vnet_classify_find_entry (t1, (u8 *) h1, hash1, now);
230 
231  while (!e0 && (t0->next_table_index != ~0))
232  {
233  t0 = pool_elt_at_index (vcm->tables, t0->next_table_index);
234  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
235  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
236  }
237 
238  while (!e1 && (t1->next_table_index != ~0))
239  {
240  t1 = pool_elt_at_index (vcm->tables, t1->next_table_index);
241  hash1 = vnet_classify_hash_packet (t1, (u8 *) h1);
242  e1 = vnet_classify_find_entry (t1, (u8 *) h1, hash1, now);
243  }
244 
245  rwe_index0 = e0 ? e0->opaque_index : config0->miss_index;
246  rwe_index1 = e1 ? e1->opaque_index : config1->miss_index;
247 
248  if (rwe_index0 != ~0)
249  {
250  rwe0 = pool_elt_at_index (rw->entries, rwe_index0);
251  l2_rw_rewrite (rwe0, (u8 *) h0);
252  }
253  if (rwe_index1 != ~0)
254  {
255  rwe1 = pool_elt_at_index (rw->entries, rwe_index1);
256  l2_rw_rewrite (rwe1, (u8 *) h1);
257  }
258 
260  {
261  l2_rw_trace_t *t = vlib_add_trace (vm, node, b0, sizeof (*t));
262  t->sw_if_index = sw_if_index0;
263  t->classify_table_index = config0->table_index;
264  t->rewrite_entry_index = rwe_index0;
265  }
266 
268  {
269  l2_rw_trace_t *t = vlib_add_trace (vm, node, b1, sizeof (*t));
270  t->sw_if_index = sw_if_index1;
271  t->classify_table_index = config1->table_index;
272  t->rewrite_entry_index = rwe_index1;
273  }
274 
275  /* Update feature bitmap and get next feature index */
277  L2INPUT_FEAT_RW);
279  L2INPUT_FEAT_RW);
280 
281  vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
282  to_next, n_left_to_next,
283  bi0, bi1, next0, next1);
284  }
285 
286  while (n_left_from > 0 && n_left_to_next > 0)
287  {
288  u32 bi0, next0, sw_if_index0, rwe_index0;
289  vlib_buffer_t *b0;
290  ethernet_header_t *h0;
291  l2_rw_config_t *config0;
292  u64 hash0;
294  vnet_classify_entry_t *e0;
295  l2_rw_entry_t *rwe0;
296 
297  bi0 = from[0];
298  to_next[0] = bi0;
299  from += 1;
300  to_next += 1;
301  n_left_from -= 1;
302  n_left_to_next -= 1;
303 
304  b0 = vlib_get_buffer (vm, bi0);
305  h0 = vlib_buffer_get_current (b0);
306 
307  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
308  config0 = l2_rw_get_config (sw_if_index0); /*TODO: check sw_if_index0 value */
309  t0 = pool_elt_at_index (vcm->tables, config0->table_index);
310 
311  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
312  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
313 
314  while (!e0 && (t0->next_table_index != ~0))
315  {
316  t0 = pool_elt_at_index (vcm->tables, t0->next_table_index);
317  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
318  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
319  }
320 
321  rwe_index0 = e0 ? e0->opaque_index : config0->miss_index;
322 
323  if (rwe_index0 != ~0)
324  {
325  rwe0 = pool_elt_at_index (rw->entries, rwe_index0);
326  l2_rw_rewrite (rwe0, (u8 *) h0);
327  }
328 
330  {
331  l2_rw_trace_t *t = vlib_add_trace (vm, node, b0, sizeof (*t));
332  t->sw_if_index = sw_if_index0;
333  t->classify_table_index = config0->table_index;
334  t->rewrite_entry_index = rwe_index0;
335  }
336 
337  /* Update feature bitmap and get next feature index */
339  L2INPUT_FEAT_RW);
340 
341  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
342  to_next, n_left_to_next,
343  bi0, next0);
344  }
345  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
346  }
347 
348  return frame->n_vectors;
349 }
350 
351 int
353  u8 * mask, u8 * value, u32 len, u32 skip, u8 is_del)
354 {
355  l2_rw_main_t *rw = &l2_rw_main;
356  l2_rw_entry_t *e = 0;
357  if (*index != ~0)
358  {
359  if (pool_is_free_index (rw->entries, *index))
360  {
361  return -1;
362  }
363  e = pool_elt_at_index (rw->entries, *index);
364  }
365  else
366  {
367  pool_get (rw->entries, e);
368  *index = e - rw->entries;
369  }
370 
371  if (!e)
372  return -1;
373 
374  if (is_del)
375  {
376  pool_put (rw->entries, e);
377  return 0;
378  }
379 
380  e->skip_n_vectors = skip / sizeof (u32x4);
381  skip -= e->skip_n_vectors * sizeof (u32x4);
382  e->rewrite_n_vectors = (skip + len - 1) / sizeof (u32x4) + 1;
383  vec_alloc_aligned (e->mask, e->rewrite_n_vectors, sizeof (u32x4));
384  memset (e->mask, 0, e->rewrite_n_vectors * sizeof (u32x4));
385  vec_alloc_aligned (e->value, e->rewrite_n_vectors, sizeof (u32x4));
386  memset (e->value, 0, e->rewrite_n_vectors * sizeof (u32x4));
387 
388  clib_memcpy (((u8 *) e->value) + skip, value, len);
389  clib_memcpy (((u8 *) e->mask) + skip, mask, len);
390 
391  int i;
392  for (i = 0; i < e->rewrite_n_vectors; i++)
393  {
394  e->value[i] &= e->mask[i];
395  }
396 
397  return 0;
398 }
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, modfies 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 int
458 l2_rw_interface_set_table (u32 sw_if_index, u32 table_index, u32 miss_index)
459 {
460  l2_rw_config_t *c = l2_rw_get_config (sw_if_index);
461  l2_rw_main_t *rw = &l2_rw_main;
462 
463  c->table_index = table_index;
464  c->miss_index = miss_index;
465  u32 feature_bitmap = (table_index == ~0) ? 0 : L2INPUT_FEAT_RW;
466 
467  l2input_intf_bitmap_enable (sw_if_index, L2INPUT_FEAT_RW, feature_bitmap);
468 
469  if (c->table_index == ~0)
470  clib_bitmap_set (rw->configs_bitmap, sw_if_index, 0);
471 
472  return 0;
473 }
474 
475 static clib_error_t *
477  unformat_input_t * input, vlib_cli_command_t * cmd)
478 {
479  vnet_main_t *vnm = vnet_get_main ();
480  u32 table_index = ~0;
481  u32 sw_if_index = ~0;
482  u32 miss_index = ~0;
483 
485  {
486  unformat (input, "%U", unformat_vnet_sw_interface, vnm, &sw_if_index);
487  }
488 
490  {
491  if (unformat (input, "table %d", &table_index))
492  ;
493  else if (unformat (input, "miss-index %d", &miss_index))
494  ;
495  else
496  break;
497  }
498 
499  if (sw_if_index == ~0)
500  return clib_error_return (0,
501  "You must specify an interface 'iface <interface>'",
502  format_unformat_error, input);
503  int ret;
504  if ((ret =
505  l2_rw_interface_set_table (sw_if_index, table_index, miss_index)))
506  return clib_error_return (0, "l2_rw_interface_set_table returned %d",
507  ret);
508 
509  return 0;
510 }
511 
512 /*?
513  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
514  * the provisioned mask and value, modfies the packet header.
515  *
516  * @cliexpar
517  * @todo This is incomplete. This needs a detailed description and a
518  * practical example.
519 ?*/
520 /* *INDENT-OFF* */
521 VLIB_CLI_COMMAND (l2_rw_interface_cli, static) = {
522  .path = "set interface l2 rewrite",
523  .short_help =
524  "set interface l2 rewrite <interface> [table <table index>] [miss-index <entry-index>]",
525  .function = l2_rw_interface_cli_fn,
526 };
527 /* *INDENT-ON* */
528 
529 static clib_error_t *
531  unformat_input_t * input,
532  vlib_cli_command_t * cmd)
533 {
534  l2_rw_main_t *rw = &l2_rw_main;
536  vlib_cli_output (vm, "No interface is currently using l2 rewrite\n");
537 
538  uword i;
539  /* *INDENT-OFF* */
541  vlib_cli_output (vm, "sw_if_index:%d %U\n", i, format_l2_rw_config, &rw->configs[i]);
542  });
543  /* *INDENT-ON* */
544  return 0;
545 }
546 
547 /*?
548  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
549  * the provisioned mask and value, modfies the packet header.
550  *
551  * @cliexpar
552  * @todo This is incomplete. This needs a detailed description and a
553  * practical example.
554 ?*/
555 /* *INDENT-OFF* */
556 VLIB_CLI_COMMAND (l2_rw_show_interfaces_cli, static) = {
557  .path = "show l2 rewrite interfaces",
558  .short_help =
559  "show l2 rewrite interfaces",
560  .function = l2_rw_show_interfaces_cli_fn,
561 };
562 /* *INDENT-ON* */
563 
564 static clib_error_t *
566  unformat_input_t * input, vlib_cli_command_t * cmd)
567 {
568  l2_rw_main_t *rw = &l2_rw_main;
569  l2_rw_entry_t *e;
570  if (pool_elts (rw->entries) == 0)
571  vlib_cli_output (vm, "No entries\n");
572 
573  /* *INDENT-OFF* */
574  pool_foreach(e, rw->entries, {
575  vlib_cli_output (vm, "%U\n", format_l2_rw_entry, e);
576  });
577  /* *INDENT-ON* */
578  return 0;
579 }
580 
581 /*?
582  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
583  * the provisioned mask and value, modfies the packet header.
584  *
585  * @cliexpar
586  * @todo This is incomplete. This needs a detailed description and a
587  * practical example.
588 ?*/
589 /* *INDENT-OFF* */
590 VLIB_CLI_COMMAND (l2_rw_show_entries_cli, static) = {
591  .path = "show l2 rewrite entries",
592  .short_help =
593  "show l2 rewrite entries",
594  .function = l2_rw_show_entries_cli_fn,
595 };
596 /* *INDENT-ON* */
597 
598 int
599 l2_rw_enable_disable (u32 bridge_domain, u8 disable)
600 {
601  u32 mask = L2INPUT_FEAT_RW;
602  l2input_set_bridge_features (bridge_domain, mask, disable ? 0 : mask);
603  return 0;
604 }
605 
606 static clib_error_t *
608  unformat_input_t * input, vlib_cli_command_t * cmd)
609 {
610  u32 bridge_domain;
611  u8 disable = 0;
612 
614  !unformat (input, "%d", &bridge_domain))
615  {
616  return clib_error_return (0, "You must specify a bridge domain");
617  }
618 
620  unformat (input, "disable"))
621  {
622  disable = 1;
623  }
624 
625  if (l2_rw_enable_disable (bridge_domain, disable))
626  return clib_error_return (0, "Could not enable or disable rewrite");
627 
628  return 0;
629 }
630 
631 /*?
632  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
633  * the provisioned mask and value, modfies the packet header.
634  *
635  * @cliexpar
636  * @todo This is incomplete. This needs a detailed description and a
637  * practical example.
638 ?*/
639 /* *INDENT-OFF* */
640 VLIB_CLI_COMMAND (l2_rw_set_cli, static) = {
641  .path = "set bridge-domain rewrite",
642  .short_help =
643  "set bridge-domain rewrite <bridge-domain> [disable]",
644  .function = l2_rw_set_cli_fn,
645 };
646 /* *INDENT-ON* */
647 
648 static clib_error_t *
650 {
651  l2_rw_main_t *rw = &l2_rw_main;
652  rw->configs = 0;
653  rw->entries = 0;
656  l2_rw_node.index,
660  return 0;
661 }
662 
664 
665 enum
666 {
669 };
670 
671 #define foreach_l2_rw_error \
672 _(UNKNOWN, "Unknown error")
673 
674 typedef enum
675 {
676 #define _(sym,str) L2_RW_ERROR_##sym,
678 #undef _
680 } l2_rw_error_t;
681 
682 static char *l2_rw_error_strings[] = {
683 #define _(sym,string) string,
685 #undef _
686 };
687 
688 /* *INDENT-OFF* */
690  .function = l2_rw_node_fn,
691  .name = "l2-rw",
692  .vector_size = sizeof (u32),
693  .format_trace = format_l2_rw_trace,
694  .type = VLIB_NODE_TYPE_INTERNAL,
695  .n_errors = ARRAY_LEN(l2_rw_error_strings),
696  .error_strings = l2_rw_error_strings,
697  .runtime_data_bytes = 0,
698  .n_next_nodes = L2_RW_N_NEXT,
699  .next_nodes = { [L2_RW_NEXT_DROP] = "error-drop"},
700 };
701 /* *INDENT-ON* */
702 
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:432
sll srl srl sll sra u16x4 i
Definition: vector_sse2.h:337
#define CLIB_UNUSED(x)
Definition: clib.h:79
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:530
u32 l2input_set_bridge_features(u32 bd_index, u32 feat_mask, u32 feat_value)
Definition: l2_input.c:547
l2_rw_main_t l2_rw_main
Definition: l2_rw.c:29
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:224
unformat_function_t unformat_hex_string
Definition: format.h:287
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:565
#define U32X4_ALIGNED(p)
Definition: vnet_classify.h:47
l2_rw_config_t * configs
Definition: l2_rw.h:57
struct _vlib_node_registration vlib_node_registration_t
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:419
unformat_function_t unformat_vnet_sw_interface
#define pool_get(P, E)
Allocate an object E from a pool P (unspecified alignment).
Definition: pool.h:225
vlib_node_registration_t l2_rw_node
(constructor) VLIB_REGISTER_NODE (l2_rw_node)
Definition: l2_rw.c:31
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:671
u32 classify_table_index
Definition: l2_rw.c:36
#define static_always_inline
Definition: clib.h:93
#define pool_foreach(VAR, POOL, BODY)
Iterate through pool.
Definition: pool.h:438
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:111
#define always_inline
Definition: clib.h:92
unsigned long long u32x4
Definition: ixge.c:28
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
Definition: buffer.h:171
static char * l2_rw_error_strings[]
Definition: l2_rw.c:682
u8 * format_hex_bytes(u8 *s, va_list *va)
Definition: std-formats.c:84
int l2_rw_enable_disable(u32 bridge_domain, u8 disable)
Definition: l2_rw.c:599
#define clib_error_return(e, args...)
Definition: error.h:99
unsigned long u64
Definition: types.h:89
#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:607
#define pool_elt_at_index(p, i)
Returns pointer to element at given index.
Definition: pool.h:459
int l2_rw_mod_entry(u32 *index, u8 *mask, u8 *value, u32 len, u32 skip, u8 is_del)
Definition: l2_rw.c:352
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:195
#define vec_alloc_aligned(V, N, A)
Allocate space for N more elements (no header, given alignment)
Definition: vec.h:284
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:271
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:105
#define vlib_validate_buffer_enqueue_x2(vm, node, next_index, to_next, n_left_to_next, bi0, bi1, next0, next1)
Finish enqueueing two buffers forward in the graph.
Definition: buffer_node.h:70
#define vlib_validate_buffer_enqueue_x1(vm, node, next_index, to_next, n_left_to_next, bi0, next0)
Finish enqueueing one buffer forward in the graph.
Definition: buffer_node.h:218
#define vlib_get_next_frame(vm, node, next_index, vectors, n_vectors_left)
Get pointer to next frame vector data by (vlib_node_runtime_t, next_index).
Definition: node_funcs.h:364
static u8 * format_l2_rw_trace(u8 *s, va_list *args)
Definition: l2_rw.c:66
static uword l2_rw_node_fn(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
Definition: l2_rw.c:160
#define clib_bitmap_alloc(v, n_bits)
Allocate a bitmap with the supplied number of bits.
Definition: bitmap.h:109
#define UNFORMAT_END_OF_INPUT
Definition: format.h:143
svmdb_client_t * c
u16 n_vectors
Definition: node.h:344
#define CLIB_PREFETCH(addr, size, type)
Definition: cache.h:82
vlib_main_t * vm
Definition: buffer.c:283
vec_header_t h
Definition: buffer.c:282
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_BUFFER_IS_TRACED
Definition: buffer.h:93
#define clib_memcpy(a, b, c)
Definition: string.h:75
#define pool_is_free_index(P, I)
Use free bitmap to query whether given index is free.
Definition: pool.h:268
#define ARRAY_LEN(x)
Definition: clib.h:59
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:454
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:60
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:154
struct _vnet_classify_main vnet_classify_main_t
Definition: vnet_classify.h:73
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
Definition: node.h:456
unsigned int u32
Definition: types.h:88
u32 sw_if_index
Definition: l2_rw.c:35
static clib_error_t * l2_rw_init(vlib_main_t *vm)
Definition: l2_rw.c:649
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:476
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
u64 uword
Definition: types.h:112
static void * vlib_add_trace(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_buffer_t *b, u32 n_data_bytes)
Definition: trace_funcs.h:55
u32 l2input_intf_bitmap_enable(u32 sw_if_index, u32 feature_bitmap, u32 enable)
Enable (or disable) the feature in the bitmap for the given interface.
Definition: l2_input.c:534
static uword clib_bitmap_count_set_bits(uword *ai)
Return the number of set bits in a bitmap.
Definition: bitmap.h:441
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
double f64
Definition: types.h:142
unsigned char u8
Definition: types.h:56
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:267
int l2_rw_interface_set_table(u32 sw_if_index, u32 table_index, u32 miss_index)
Definition: l2_rw.c:458
#define vnet_buffer(b)
Definition: buffer.h:326
#define VLIB_NODE_FUNCTION_MULTIARCH(node, fn)
Definition: node.h:158
u8 * format_unformat_error(u8 *s, va_list *va)
Definition: unformat.c:91
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:143
l2_rw_entry_t * entries
Definition: l2_rw.h:54
u32 flags
buffer flags: VLIB_BUFFER_FREE_LIST_INDEX_MASK: bits used to store free list index, VLIB_BUFFER_IS_TRACED: trace this buffer.
Definition: buffer.h:75
l2_rw_error_t
Definition: l2_rw.c:674
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:680
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
Definition: buffer_funcs.h:57
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:169
static uword pool_elts(void *v)
Number of active elements in a pool.
Definition: pool.h:128