FD.io VPP  v19.01.2-3-gf61a1a8
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 
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 *
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 
168  from = vlib_frame_vector_args (frame);
169  n_left_from = frame->n_vectors; /* number of packets to process */
170  next_index = node->cached_next_index;
171 
172  while (n_left_from > 0)
173  {
174  u32 n_left_to_next;
175 
176  /* get space to enqueue frame to graph node "next_index" */
177  vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
178 
179  while (n_left_from >= 6 && n_left_to_next >= 2)
180  {
181  u32 bi0, next0, sw_if_index0, rwe_index0;
182  u32 bi1, next1, sw_if_index1, rwe_index1;
183  vlib_buffer_t *b0, *b1;
184  ethernet_header_t *h0, *h1;
185  l2_rw_config_t *config0, *config1;
186  u64 hash0, hash1;
187  vnet_classify_table_t *t0, *t1;
188  vnet_classify_entry_t *e0, *e1;
189  l2_rw_entry_t *rwe0, *rwe1;
190 
191  {
192  vlib_buffer_t *p2, *p3, *p4, *p5;
193  p2 = vlib_get_buffer (vm, from[2]);
194  p3 = vlib_get_buffer (vm, from[3]);
195  p4 = vlib_get_buffer (vm, from[4]);
196  p5 = vlib_get_buffer (vm, from[5]);
197 
198  vlib_prefetch_buffer_header (p4, LOAD);
199  vlib_prefetch_buffer_header (p5, LOAD);
200  vlib_prefetch_buffer_data (p2, LOAD);
201  vlib_prefetch_buffer_data (p3, LOAD);
202  }
203 
204  bi0 = from[0];
205  bi1 = from[1];
206  to_next[0] = bi0;
207  to_next[1] = bi1;
208  from += 2;
209  to_next += 2;
210  n_left_from -= 2;
211  n_left_to_next -= 2;
212 
213  b0 = vlib_get_buffer (vm, bi0);
214  b1 = vlib_get_buffer (vm, bi1);
215  h0 = vlib_buffer_get_current (b0);
216  h1 = vlib_buffer_get_current (b1);
217 
218  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
219  sw_if_index1 = vnet_buffer (b1)->sw_if_index[VLIB_RX];
220  config0 = l2_rw_get_config (sw_if_index0); /*TODO: check sw_if_index0 value */
221  config1 = l2_rw_get_config (sw_if_index1); /*TODO: check sw_if_index0 value */
222  t0 = pool_elt_at_index (vcm->tables, config0->table_index);
223  t1 = pool_elt_at_index (vcm->tables, config1->table_index);
224 
225  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
226  hash1 = vnet_classify_hash_packet (t1, (u8 *) h1);
227  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
228  e1 = vnet_classify_find_entry (t1, (u8 *) h1, hash1, now);
229 
230  while (!e0 && (t0->next_table_index != ~0))
231  {
232  t0 = pool_elt_at_index (vcm->tables, t0->next_table_index);
233  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
234  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
235  }
236 
237  while (!e1 && (t1->next_table_index != ~0))
238  {
239  t1 = pool_elt_at_index (vcm->tables, t1->next_table_index);
240  hash1 = vnet_classify_hash_packet (t1, (u8 *) h1);
241  e1 = vnet_classify_find_entry (t1, (u8 *) h1, hash1, now);
242  }
243 
244  rwe_index0 = e0 ? e0->opaque_index : config0->miss_index;
245  rwe_index1 = e1 ? e1->opaque_index : config1->miss_index;
246 
247  if (rwe_index0 != ~0)
248  {
249  rwe0 = pool_elt_at_index (rw->entries, rwe_index0);
250  l2_rw_rewrite (rwe0, (u8 *) h0);
251  }
252  if (rwe_index1 != ~0)
253  {
254  rwe1 = pool_elt_at_index (rw->entries, rwe_index1);
255  l2_rw_rewrite (rwe1, (u8 *) h1);
256  }
257 
258  if (PREDICT_FALSE ((b0->flags & VLIB_BUFFER_IS_TRACED)))
259  {
260  l2_rw_trace_t *t = vlib_add_trace (vm, node, b0, sizeof (*t));
261  t->sw_if_index = sw_if_index0;
262  t->classify_table_index = config0->table_index;
263  t->rewrite_entry_index = rwe_index0;
264  }
265 
266  if (PREDICT_FALSE ((b1->flags & VLIB_BUFFER_IS_TRACED)))
267  {
268  l2_rw_trace_t *t = vlib_add_trace (vm, node, b1, sizeof (*t));
269  t->sw_if_index = sw_if_index1;
270  t->classify_table_index = config1->table_index;
271  t->rewrite_entry_index = rwe_index1;
272  }
273 
274  /* Update feature bitmap and get next feature index */
276  L2INPUT_FEAT_RW);
278  L2INPUT_FEAT_RW);
279 
280  vlib_validate_buffer_enqueue_x2 (vm, node, next_index,
281  to_next, n_left_to_next,
282  bi0, bi1, next0, next1);
283  }
284 
285  while (n_left_from > 0 && n_left_to_next > 0)
286  {
287  u32 bi0, next0, sw_if_index0, rwe_index0;
288  vlib_buffer_t *b0;
289  ethernet_header_t *h0;
290  l2_rw_config_t *config0;
291  u64 hash0;
293  vnet_classify_entry_t *e0;
294  l2_rw_entry_t *rwe0;
295 
296  bi0 = from[0];
297  to_next[0] = bi0;
298  from += 1;
299  to_next += 1;
300  n_left_from -= 1;
301  n_left_to_next -= 1;
302 
303  b0 = vlib_get_buffer (vm, bi0);
304  h0 = vlib_buffer_get_current (b0);
305 
306  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
307  config0 = l2_rw_get_config (sw_if_index0); /*TODO: check sw_if_index0 value */
308  t0 = pool_elt_at_index (vcm->tables, config0->table_index);
309 
310  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
311  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
312 
313  while (!e0 && (t0->next_table_index != ~0))
314  {
315  t0 = pool_elt_at_index (vcm->tables, t0->next_table_index);
316  hash0 = vnet_classify_hash_packet (t0, (u8 *) h0);
317  e0 = vnet_classify_find_entry (t0, (u8 *) h0, hash0, now);
318  }
319 
320  rwe_index0 = e0 ? e0->opaque_index : config0->miss_index;
321 
322  if (rwe_index0 != ~0)
323  {
324  rwe0 = pool_elt_at_index (rw->entries, rwe_index0);
325  l2_rw_rewrite (rwe0, (u8 *) h0);
326  }
327 
328  if (PREDICT_FALSE ((b0->flags & VLIB_BUFFER_IS_TRACED)))
329  {
330  l2_rw_trace_t *t = vlib_add_trace (vm, node, b0, sizeof (*t));
331  t->sw_if_index = sw_if_index0;
332  t->classify_table_index = config0->table_index;
333  t->rewrite_entry_index = rwe_index0;
334  }
335 
336  /* Update feature bitmap and get next feature index */
338  L2INPUT_FEAT_RW);
339 
340  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
341  to_next, n_left_to_next,
342  bi0, next0);
343  }
344  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
345  }
346 
347  return frame->n_vectors;
348 }
349 
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 
399 static clib_error_t *
401  unformat_input_t * input, vlib_cli_command_t * cmd)
402 {
403  u32 index = ~0;
404  u8 *mask = 0;
405  u8 *value = 0;
406  u32 skip = 0;
407  u8 del = 0;
408 
410  {
411  if (unformat (input, "index %d", &index))
412  ;
413  else if (unformat (input, "mask %U", unformat_hex_string, &mask))
414  ;
415  else if (unformat (input, "value %U", unformat_hex_string, &value))
416  ;
417  else if (unformat (input, "skip %d", &skip))
418  ;
419  else if (unformat (input, "del"))
420  del = 1;
421  else
422  break;
423  }
424 
425  if (!mask || !value)
426  return clib_error_return (0, "Unspecified mask or value");
427 
428  if (vec_len (mask) != vec_len (value))
429  return clib_error_return (0, "Mask and value lengths must be identical");
430 
431  int ret;
432  if ((ret =
433  l2_rw_mod_entry (&index, mask, value, vec_len (mask), skip, del)))
434  return clib_error_return (0, "Could not add entry");
435 
436  return 0;
437 }
438 
439 /*?
440  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
441  * the provisioned mask and value, modifies the packet header.
442  *
443  * @cliexpar
444  * @todo This is incomplete. This needs a detailed description and a
445  * practical example.
446 ?*/
447 /* *INDENT-OFF* */
448 VLIB_CLI_COMMAND (l2_rw_entry_cli, static) = {
449  .path = "l2 rewrite entry",
450  .short_help =
451  "l2 rewrite entry [index <index>] [mask <hex-mask>] [value <hex-value>] [skip <n_bytes>] [del]",
452  .function = l2_rw_entry_cli_fn,
453 };
454 /* *INDENT-ON* */
455 
456 int
457 l2_rw_interface_set_table (u32 sw_if_index, u32 table_index, u32 miss_index)
458 {
459  l2_rw_config_t *c = l2_rw_get_config (sw_if_index);
460  l2_rw_main_t *rw = &l2_rw_main;
461 
462  c->table_index = table_index;
463  c->miss_index = miss_index;
464  u32 feature_bitmap = (table_index == ~0) ? 0 : L2INPUT_FEAT_RW;
465 
466  l2input_intf_bitmap_enable (sw_if_index, L2INPUT_FEAT_RW, feature_bitmap);
467 
468  if (c->table_index == ~0)
469  clib_bitmap_set (rw->configs_bitmap, sw_if_index, 0);
470 
471  return 0;
472 }
473 
474 static clib_error_t *
476  unformat_input_t * input, vlib_cli_command_t * cmd)
477 {
478  vnet_main_t *vnm = vnet_get_main ();
479  u32 table_index = ~0;
480  u32 sw_if_index = ~0;
481  u32 miss_index = ~0;
482 
484  {
485  unformat (input, "%U", unformat_vnet_sw_interface, vnm, &sw_if_index);
486  }
487 
489  {
490  if (unformat (input, "table %d", &table_index))
491  ;
492  else if (unformat (input, "miss-index %d", &miss_index))
493  ;
494  else
495  break;
496  }
497 
498  if (sw_if_index == ~0)
499  return clib_error_return (0,
500  "You must specify an interface 'iface <interface>'",
501  format_unformat_error, input);
502  int ret;
503  if ((ret =
504  l2_rw_interface_set_table (sw_if_index, table_index, miss_index)))
505  return clib_error_return (0, "l2_rw_interface_set_table returned %d",
506  ret);
507 
508  return 0;
509 }
510 
511 /*?
512  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
513  * the provisioned mask and value, modifies the packet header.
514  *
515  * @cliexpar
516  * @todo This is incomplete. This needs a detailed description and a
517  * practical example.
518 ?*/
519 /* *INDENT-OFF* */
520 VLIB_CLI_COMMAND (l2_rw_interface_cli, static) = {
521  .path = "set interface l2 rewrite",
522  .short_help =
523  "set interface l2 rewrite <interface> [table <table index>] [miss-index <entry-index>]",
524  .function = l2_rw_interface_cli_fn,
525 };
526 /* *INDENT-ON* */
527 
528 static clib_error_t *
530  unformat_input_t * input,
531  vlib_cli_command_t * cmd)
532 {
533  l2_rw_main_t *rw = &l2_rw_main;
535  vlib_cli_output (vm, "No interface is currently using l2 rewrite\n");
536 
537  uword i;
538  /* *INDENT-OFF* */
540  vlib_cli_output (vm, "sw_if_index:%d %U\n", i, format_l2_rw_config, &rw->configs[i]);
541  });
542  /* *INDENT-ON* */
543  return 0;
544 }
545 
546 /*?
547  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
548  * the provisioned mask and value, modifies the packet header.
549  *
550  * @cliexpar
551  * @todo This is incomplete. This needs a detailed description and a
552  * practical example.
553 ?*/
554 /* *INDENT-OFF* */
555 VLIB_CLI_COMMAND (l2_rw_show_interfaces_cli, static) = {
556  .path = "show l2 rewrite interfaces",
557  .short_help =
558  "show l2 rewrite interfaces",
559  .function = l2_rw_show_interfaces_cli_fn,
560 };
561 /* *INDENT-ON* */
562 
563 static clib_error_t *
565  unformat_input_t * input, vlib_cli_command_t * cmd)
566 {
567  l2_rw_main_t *rw = &l2_rw_main;
568  l2_rw_entry_t *e;
569  if (pool_elts (rw->entries) == 0)
570  vlib_cli_output (vm, "No entries\n");
571 
572  /* *INDENT-OFF* */
573  pool_foreach(e, rw->entries, {
574  vlib_cli_output (vm, "%U\n", format_l2_rw_entry, e);
575  });
576  /* *INDENT-ON* */
577  return 0;
578 }
579 
580 /*?
581  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
582  * the provisioned mask and value, modifies the packet header.
583  *
584  * @cliexpar
585  * @todo This is incomplete. This needs a detailed description and a
586  * practical example.
587 ?*/
588 /* *INDENT-OFF* */
589 VLIB_CLI_COMMAND (l2_rw_show_entries_cli, static) = {
590  .path = "show l2 rewrite entries",
591  .short_help =
592  "show l2 rewrite entries",
593  .function = l2_rw_show_entries_cli_fn,
594 };
595 /* *INDENT-ON* */
596 
597 int
598 l2_rw_enable_disable (u32 bridge_domain, u8 disable)
599 {
600  u32 mask = L2INPUT_FEAT_RW;
601  l2input_set_bridge_features (bridge_domain, mask, disable ? 0 : mask);
602  return 0;
603 }
604 
605 static clib_error_t *
607  unformat_input_t * input, vlib_cli_command_t * cmd)
608 {
609  u32 bridge_domain;
610  u8 disable = 0;
611 
613  !unformat (input, "%d", &bridge_domain))
614  {
615  return clib_error_return (0, "You must specify a bridge domain");
616  }
617 
619  unformat (input, "disable"))
620  {
621  disable = 1;
622  }
623 
624  if (l2_rw_enable_disable (bridge_domain, disable))
625  return clib_error_return (0, "Could not enable or disable rewrite");
626 
627  return 0;
628 }
629 
630 /*?
631  * Layer 2-Rewrite node uses classify tables to match packets. Then, using
632  * the provisioned mask and value, modfies the packet header.
633  *
634  * @cliexpar
635  * @todo This is incomplete. This needs a detailed description and a
636  * practical example.
637 ?*/
638 /* *INDENT-OFF* */
639 VLIB_CLI_COMMAND (l2_rw_set_cli, static) = {
640  .path = "set bridge-domain rewrite",
641  .short_help =
642  "set bridge-domain rewrite <bridge-domain> [disable]",
643  .function = l2_rw_set_cli_fn,
644 };
645 /* *INDENT-ON* */
646 
647 static clib_error_t *
649 {
650  l2_rw_main_t *rw = &l2_rw_main;
651  rw->configs = 0;
652  rw->entries = 0;
655  l2_rw_node.index,
659  return 0;
660 }
661 
663 
664 enum
665 {
668 };
669 
670 #define foreach_l2_rw_error \
671 _(UNKNOWN, "Unknown error")
672 
673 typedef enum
674 {
675 #define _(sym,str) L2_RW_ERROR_##sym,
677 #undef _
679 } l2_rw_error_t;
680 
681 static char *l2_rw_error_strings[] = {
682 #define _(sym,string) string,
684 #undef _
685 };
686 
687 /* *INDENT-OFF* */
689  .function = l2_rw_node_fn,
690  .name = "l2-rw",
691  .vector_size = sizeof (u32),
692  .format_trace = format_l2_rw_trace,
693  .type = VLIB_NODE_TYPE_INTERNAL,
694  .n_errors = ARRAY_LEN(l2_rw_error_strings),
695  .error_strings = l2_rw_error_strings,
696  .runtime_data_bytes = 0,
697  .n_next_nodes = L2_RW_N_NEXT,
698  .next_nodes = { [L2_RW_NEXT_DROP] = "error-drop"},
699 };
700 /* *INDENT-ON* */
701 
703 /*
704  * fd.io coding-style-patch-verification: ON
705  *
706  * Local Variables:
707  * eval: (c-set-style "gnu")
708  * End:
709  */
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
#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:529
u32 l2input_set_bridge_features(u32 bd_index, u32 feat_mask, u32 feat_value)
Definition: l2_input.c:544
l2_rw_main_t l2_rw_main
Definition: l2_rw.c:29
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:232
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:564
#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: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:236
vlib_node_registration_t l2_rw_node
(constructor) VLIB_REGISTER_NODE (l2_rw_node)
Definition: l2_rw.c:31
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:670
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:490
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:163
u32 sw_if_index
Definition: vxlan_gbp.api:37
#define always_inline
Definition: clib.h:98
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
Definition: buffer.h:188
static char * l2_rw_error_strings[]
Definition: l2_rw.c:681
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:598
#define clib_error_return(e, args...)
Definition: error.h:99
unsigned int u32
Definition: types.h:88
#define VLIB_NODE_FUNCTION_MULTIARCH(node, fn)
Definition: node.h:223
#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:606
#define pool_elt_at_index(p, i)
Returns pointer to element at given index.
Definition: pool.h:511
int l2_rw_mod_entry(u32 *index, u8 *mask, u8 *value, u32 len, u32 skip, u8 is_del)
Definition: l2_rw.c:351
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:400
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:214
#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
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 VLIB_REGISTER_NODE(x,...)
Definition: node.h:169
#define UNFORMAT_END_OF_INPUT
Definition: format.h:144
svmdb_client_t * c
u16 n_vectors
Definition: node.h:420
vlib_main_t * vm
Definition: buffer.c:301
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:189
#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:459
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:155
struct _vnet_classify_main vnet_classify_main_t
Definition: vnet_classify.h:67
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
Definition: node.h:538
u32 sw_if_index
Definition: l2_rw.c:35
static clib_error_t * l2_rw_init(vlib_main_t *vm)
Definition: l2_rw.c:648
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:530
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:475
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
struct _vlib_node_registration vlib_node_registration_t
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
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:457
#define vnet_buffer(b)
Definition: buffer.h:368
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
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:117
l2_rw_error_t
Definition: l2_rw.c:673
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:725
static vlib_buffer_t * vlib_get_buffer(vlib_main_t *vm, u32 buffer_index)
Translate buffer index into buffer pointer.
Definition: buffer_funcs.h:62
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