FD.io VPP  v17.07.01-10-g3be13f0
Vector Packet Processing
l2_learn.c
Go to the documentation of this file.
1 /*
2  * l2_learn.c : layer 2 learning using l2fib
3  *
4  * Copyright (c) 2013 Cisco and/or its affiliates.
5  * Licensed under the Apache License, Version 2.0 (the "License");
6  * you may not use this file except in compliance with the License.
7  * You may obtain a copy of the License at:
8  *
9  * http://www.apache.org/licenses/LICENSE-2.0
10  *
11  * Unless required by applicable law or agreed to in writing, software
12  * distributed under the License is distributed on an "AS IS" BASIS,
13  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14  * See the License for the specific language governing permissions and
15  * limitations under the License.
16  */
17 
18 #include <vlib/vlib.h>
19 #include <vnet/vnet.h>
20 #include <vnet/pg/pg.h>
21 #include <vnet/ethernet/ethernet.h>
22 #include <vlib/cli.h>
23 
24 #include <vnet/l2/l2_input.h>
25 #include <vnet/l2/feat_bitmap.h>
26 #include <vnet/l2/l2_fib.h>
27 #include <vnet/l2/l2_learn.h>
28 
29 #include <vppinfra/error.h>
30 #include <vppinfra/hash.h>
31 
32 /**
33  * @file
34  * @brief Ethernet Bridge Learning.
35  *
36  * Populate the mac table with entries mapping the packet's source mac + bridge
37  * domain ID to the input sw_if_index.
38  *
39  * Note that learning and forwarding are separate graph nodes. This means that
40  * for a set of packets, all learning is performed first, then all nodes are
41  * forwarded. The forwarding is done based on the end-state of the mac table,
42  * instead of the state after each packet. Thus the forwarding results could
43  * differ in certain cases (mac move tests), but this not expected to cause
44  * problems in real-world networks. It is much simpler to separate learning
45  * and forwarding into separate nodes.
46  */
47 
48 
49 typedef struct
50 {
51  u8 src[6];
52  u8 dst[6];
56 
57 
58 /* packet trace format function */
59 static u8 *
60 format_l2learn_trace (u8 * s, va_list * args)
61 {
62  CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
63  CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
64  l2learn_trace_t *t = va_arg (*args, l2learn_trace_t *);
65 
66  s = format (s, "l2-learn: sw_if_index %d dst %U src %U bd_index %d",
67  t->sw_if_index,
70  return s;
71 }
72 
74 
75 #define foreach_l2learn_error \
76 _(L2LEARN, "L2 learn packets") \
77 _(MISS, "L2 learn misses") \
78 _(MAC_MOVE, "L2 mac moves") \
79 _(MAC_MOVE_VIOLATE, "L2 mac move violations") \
80 _(LIMIT, "L2 not learned due to limit") \
81 _(HIT_UPDATE, "L2 learn hit updates") \
82 _(FILTER_DROP, "L2 filter mac drops")
83 
84 typedef enum
85 {
86 #define _(sym,str) L2LEARN_ERROR_##sym,
88 #undef _
91 
92 static char *l2learn_error_strings[] = {
93 #define _(sym,string) string,
95 #undef _
96 };
97 
98 typedef enum
99 {
104 
105 
106 /** Perform learning on one packet based on the mac table lookup result. */
107 
110  l2learn_main_t * msm,
111  u64 * counter_base,
112  vlib_buffer_t * b0,
113  u32 sw_if_index0,
114  l2fib_entry_key_t * key0,
115  l2fib_entry_key_t * cached_key,
116  u32 * count,
117  l2fib_entry_result_t * result0, u32 * next0, u8 timestamp)
118 {
119  u32 feature_bitmap;
120 
121  /* Set up the default next node (typically L2FWD) */
122 
123  /* Remove ourself from the feature bitmap */
124  feature_bitmap = vnet_buffer (b0)->l2.feature_bitmap & ~L2INPUT_FEAT_LEARN;
125 
126  /* Save for next feature graph nodes */
127  vnet_buffer (b0)->l2.feature_bitmap = feature_bitmap;
128 
129  /* Determine the next node */
131  feature_bitmap);
132 
133  /* Check mac table lookup result */
134  if (PREDICT_TRUE (result0->fields.sw_if_index == sw_if_index0))
135  {
136  /* Entry in L2FIB with matching sw_if_index matched - normal fast path */
137  u32 dtime = timestamp - result0->fields.timestamp;
138  u32 dsn = result0->fields.sn.as_u16 - vnet_buffer (b0)->l2.l2fib_sn;
139  u32 check = (dtime && vnet_buffer (b0)->l2.bd_age) || dsn;
140 
141  if (PREDICT_TRUE (check == 0))
142  return;
143 
144  if (result0->fields.static_mac)
145  return;
146 
147  /* Limit updates per l2-learn node call to avoid prolonged update burst
148  * as dtime advance over 1 minute mark, unless more than 1 min behind */
149  if ((*count > 2) && (dtime == 1))
150  return;
151 
152  counter_base[L2LEARN_ERROR_HIT_UPDATE] += 1;
153  *count += 1;
154  }
155  else if (result0->raw == ~0)
156  {
157  /* The entry was not in table, so add it */
158  counter_base[L2LEARN_ERROR_MISS] += 1;
159 
160  if (msm->global_learn_count == msm->global_learn_limit)
161  {
162  /*
163  * Global limit reached. Do not learn the mac but forward the packet.
164  * In the future, limits could also be per-interface or bridge-domain.
165  */
166  counter_base[L2LEARN_ERROR_LIMIT] += 1;
167  return;
168  }
169 
170  /* It is ok to learn */
171  msm->global_learn_count++;
172  result0->raw = 0; /* clear all fields */
173  result0->fields.sw_if_index = sw_if_index0;
174  }
175  else
176  {
177  /* The entry was in the table, but with the wrong sw_if_index mapping (mac move) */
178  if (result0->fields.filter)
179  {
180  ASSERT (result0->fields.sw_if_index == ~0);
181  /* drop packet because lookup matched a filter mac entry */
182  b0->error = node->errors[L2LEARN_ERROR_FILTER_DROP];
183  *next0 = L2LEARN_NEXT_DROP;
184  return;
185  }
186 
187  counter_base[L2LEARN_ERROR_MAC_MOVE] += 1;
188 
189  if (result0->fields.static_mac)
190  {
191  /*
192  * Don't overwrite a static mac
193  * TODO: Check violation policy. For now drop the packet
194  */
195  b0->error = node->errors[L2LEARN_ERROR_MAC_MOVE_VIOLATE];
196  *next0 = L2LEARN_NEXT_DROP;
197  return;
198  }
199 
200  /*
201  * TODO: may want to rate limit mac moves
202  * TODO: check global/bridge domain/interface learn limits
203  */
204  result0->fields.sw_if_index = sw_if_index0;
205  }
206 
207  /* Update the entry */
208  result0->fields.timestamp = timestamp;
209  result0->fields.sn.as_u16 = vnet_buffer (b0)->l2.l2fib_sn;
210 
211  BVT (clib_bihash_kv) kv;
212  kv.key = key0->raw;
213  kv.value = result0->raw;
214  BV (clib_bihash_add_del) (msm->mac_table, &kv, 1 /* is_add */ );
215 
216  /* Invalidate the cache */
217  cached_key->raw = ~0;
218 }
219 
220 
223  vlib_frame_t * frame, int do_trace)
224 {
225  u32 n_left_from, *from, *to_next;
226  l2learn_next_t next_index;
228  vlib_node_t *n = vlib_get_node (vm, l2learn_node.index);
229  u32 node_counter_base_index = n->error_heap_index;
230  vlib_error_main_t *em = &vm->error_main;
231  l2fib_entry_key_t cached_key;
232  l2fib_entry_result_t cached_result;
233  u8 timestamp = (u8) (vlib_time_now (vm) / 60);
234  u32 count = 0;
235 
236  from = vlib_frame_vector_args (frame);
237  n_left_from = frame->n_vectors; /* number of packets to process */
238  next_index = node->cached_next_index;
239 
240  /* Clear the one-entry cache in case mac table was updated */
241  cached_key.raw = ~0;
242  cached_result.raw = ~0; /* warning be gone */
243 
244  while (n_left_from > 0)
245  {
246  u32 n_left_to_next;
247 
248  /* get space to enqueue frame to graph node "next_index" */
249  vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next);
250 
251  while (n_left_from >= 8 && n_left_to_next >= 4)
252  {
253  u32 bi0, bi1, bi2, bi3;
254  vlib_buffer_t *b0, *b1, *b2, *b3;
255  u32 next0, next1, next2, next3;
256  u32 sw_if_index0, sw_if_index1, sw_if_index2, sw_if_index3;
257  ethernet_header_t *h0, *h1, *h2, *h3;
258  l2fib_entry_key_t key0, key1, key2, key3;
259  l2fib_entry_result_t result0, result1, result2, result3;
260  u32 bucket0, bucket1, bucket2, bucket3;
261 
262  /* Prefetch next iteration. */
263  {
264  vlib_buffer_t *p4, *p5, *p6, *p7;;
265 
266  p4 = vlib_get_buffer (vm, from[4]);
267  p5 = vlib_get_buffer (vm, from[5]);
268  p6 = vlib_get_buffer (vm, from[6]);
269  p7 = vlib_get_buffer (vm, from[7]);
270 
271  vlib_prefetch_buffer_header (p4, LOAD);
272  vlib_prefetch_buffer_header (p5, LOAD);
273  vlib_prefetch_buffer_header (p6, LOAD);
274  vlib_prefetch_buffer_header (p7, LOAD);
275 
280  }
281 
282  /* speculatively enqueue b0 and b1 to the current next frame */
283  /* bi is "buffer index", b is pointer to the buffer */
284  to_next[0] = bi0 = from[0];
285  to_next[1] = bi1 = from[1];
286  to_next[2] = bi2 = from[2];
287  to_next[3] = bi3 = from[3];
288  from += 4;
289  to_next += 4;
290  n_left_from -= 4;
291  n_left_to_next -= 4;
292 
293  b0 = vlib_get_buffer (vm, bi0);
294  b1 = vlib_get_buffer (vm, bi1);
295  b2 = vlib_get_buffer (vm, bi2);
296  b3 = vlib_get_buffer (vm, bi3);
297 
298  /* RX interface handles */
299  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
300  sw_if_index1 = vnet_buffer (b1)->sw_if_index[VLIB_RX];
301  sw_if_index2 = vnet_buffer (b2)->sw_if_index[VLIB_RX];
302  sw_if_index3 = vnet_buffer (b3)->sw_if_index[VLIB_RX];
303 
304  /* Process 4 x pkts */
305 
306  h0 = vlib_buffer_get_current (b0);
307  h1 = vlib_buffer_get_current (b1);
308  h2 = vlib_buffer_get_current (b2);
309  h3 = vlib_buffer_get_current (b3);
310 
311  if (do_trace)
312  {
313  if (b0->flags & VLIB_BUFFER_IS_TRACED)
314  {
315  l2learn_trace_t *t =
316  vlib_add_trace (vm, node, b0, sizeof (*t));
317  t->sw_if_index = sw_if_index0;
318  t->bd_index = vnet_buffer (b0)->l2.bd_index;
319  clib_memcpy (t->src, h0->src_address, 6);
320  clib_memcpy (t->dst, h0->dst_address, 6);
321  }
322  if (b1->flags & VLIB_BUFFER_IS_TRACED)
323  {
324  l2learn_trace_t *t =
325  vlib_add_trace (vm, node, b1, sizeof (*t));
326  t->sw_if_index = sw_if_index1;
327  t->bd_index = vnet_buffer (b1)->l2.bd_index;
328  clib_memcpy (t->src, h1->src_address, 6);
329  clib_memcpy (t->dst, h1->dst_address, 6);
330  }
331  if (b2->flags & VLIB_BUFFER_IS_TRACED)
332  {
333  l2learn_trace_t *t =
334  vlib_add_trace (vm, node, b2, sizeof (*t));
335  t->sw_if_index = sw_if_index2;
336  t->bd_index = vnet_buffer (b2)->l2.bd_index;
337  clib_memcpy (t->src, h2->src_address, 6);
338  clib_memcpy (t->dst, h2->dst_address, 6);
339  }
340  if (b3->flags & VLIB_BUFFER_IS_TRACED)
341  {
342  l2learn_trace_t *t =
343  vlib_add_trace (vm, node, b3, sizeof (*t));
344  t->sw_if_index = sw_if_index3;
345  t->bd_index = vnet_buffer (b3)->l2.bd_index;
346  clib_memcpy (t->src, h3->src_address, 6);
347  clib_memcpy (t->dst, h3->dst_address, 6);
348  }
349  }
350 
351  /* process 4 pkts */
353  L2LEARN_ERROR_L2LEARN, 4);
354 
355  l2fib_lookup_4 (msm->mac_table, &cached_key, &cached_result,
356  h0->src_address,
357  h1->src_address,
358  h2->src_address,
359  h3->src_address,
360  vnet_buffer (b0)->l2.bd_index,
361  vnet_buffer (b1)->l2.bd_index,
362  vnet_buffer (b2)->l2.bd_index,
363  vnet_buffer (b3)->l2.bd_index,
364  &key0, &key1, &key2, &key3,
365  &bucket0, &bucket1, &bucket2, &bucket3,
366  &result0, &result1, &result2, &result3);
367 
368  l2learn_process (node, msm, &em->counters[node_counter_base_index],
369  b0, sw_if_index0, &key0, &cached_key,
370  &count, &result0, &next0, timestamp);
371 
372  l2learn_process (node, msm, &em->counters[node_counter_base_index],
373  b1, sw_if_index1, &key1, &cached_key,
374  &count, &result1, &next1, timestamp);
375 
376  l2learn_process (node, msm, &em->counters[node_counter_base_index],
377  b2, sw_if_index2, &key2, &cached_key,
378  &count, &result2, &next2, timestamp);
379 
380  l2learn_process (node, msm, &em->counters[node_counter_base_index],
381  b3, sw_if_index3, &key3, &cached_key,
382  &count, &result3, &next3, timestamp);
383 
384  /* verify speculative enqueues, maybe switch current next frame */
385  /* if next0==next1==next_index then nothing special needs to be done */
386  vlib_validate_buffer_enqueue_x4 (vm, node, next_index,
387  to_next, n_left_to_next,
388  bi0, bi1, bi2, bi3,
389  next0, next1, next2, next3);
390  }
391 
392  while (n_left_from > 0 && n_left_to_next > 0)
393  {
394  u32 bi0;
395  vlib_buffer_t *b0;
396  u32 next0;
397  u32 sw_if_index0;
398  ethernet_header_t *h0;
399  l2fib_entry_key_t key0;
400  l2fib_entry_result_t result0;
401  u32 bucket0;
402 
403  /* speculatively enqueue b0 to the current next frame */
404  bi0 = from[0];
405  to_next[0] = bi0;
406  from += 1;
407  to_next += 1;
408  n_left_from -= 1;
409  n_left_to_next -= 1;
410 
411  b0 = vlib_get_buffer (vm, bi0);
412 
413  sw_if_index0 = vnet_buffer (b0)->sw_if_index[VLIB_RX];
414 
415  h0 = vlib_buffer_get_current (b0);
416 
417  if (do_trace && PREDICT_FALSE (b0->flags & VLIB_BUFFER_IS_TRACED))
418  {
419  l2learn_trace_t *t = vlib_add_trace (vm, node, b0, sizeof (*t));
420  t->sw_if_index = sw_if_index0;
421  t->bd_index = vnet_buffer (b0)->l2.bd_index;
422  clib_memcpy (t->src, h0->src_address, 6);
423  clib_memcpy (t->dst, h0->dst_address, 6);
424  }
425 
426  /* process 1 pkt */
428  L2LEARN_ERROR_L2LEARN, 1);
429 
430 
431  l2fib_lookup_1 (msm->mac_table, &cached_key, &cached_result,
432  h0->src_address, vnet_buffer (b0)->l2.bd_index,
433  &key0, &bucket0, &result0);
434 
435  l2learn_process (node, msm, &em->counters[node_counter_base_index],
436  b0, sw_if_index0, &key0, &cached_key,
437  &count, &result0, &next0, timestamp);
438 
439  /* verify speculative enqueue, maybe switch current next frame */
440  vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
441  to_next, n_left_to_next,
442  bi0, next0);
443  }
444 
445  vlib_put_next_frame (vm, node, next_index, n_left_to_next);
446  }
447 
448  return frame->n_vectors;
449 }
450 
451 static uword
453  vlib_node_runtime_t * node, vlib_frame_t * frame)
454 {
455  if (PREDICT_FALSE ((node->flags & VLIB_NODE_FLAG_TRACE)))
456  return l2learn_node_inline (vm, node, frame, 1 /* do_trace */ );
457  return l2learn_node_inline (vm, node, frame, 0 /* do_trace */ );
458 }
459 
460 /* *INDENT-OFF* */
461 VLIB_REGISTER_NODE (l2learn_node,static) = {
462  .function = l2learn_node_fn,
463  .name = "l2-learn",
464  .vector_size = sizeof (u32),
465  .format_trace = format_l2learn_trace,
466  .type = VLIB_NODE_TYPE_INTERNAL,
467 
468  .n_errors = ARRAY_LEN(l2learn_error_strings),
469  .error_strings = l2learn_error_strings,
470 
471  .n_next_nodes = L2LEARN_N_NEXT,
472 
473  /* edit / add dispositions here */
474  .next_nodes = {
475  [L2LEARN_NEXT_DROP] = "error-drop",
476  [L2LEARN_NEXT_L2FWD] = "l2-fwd",
477  },
478 };
479 /* *INDENT-ON* */
480 
483 {
485 
486  mp->vlib_main = vm;
487  mp->vnet_main = vnet_get_main ();
488 
489  /* Initialize the feature next-node indexes */
491  l2learn_node.index,
495 
496  /* init the hash table ptr */
497  mp->mac_table = get_mac_table ();
498 
499  /*
500  * Set the default number of dynamically learned macs to the number
501  * of buckets.
502  */
504 
505  return 0;
506 }
507 
509 
510 
511 /**
512  * Set subinterface learn enable/disable.
513  * The CLI format is:
514  * set interface l2 learn <interface> [disable]
515  */
516 static clib_error_t *
518  unformat_input_t * input, vlib_cli_command_t * cmd)
519 {
520  vnet_main_t *vnm = vnet_get_main ();
521  clib_error_t *error = 0;
522  u32 sw_if_index;
523  u32 enable;
524 
525  if (!unformat_user (input, unformat_vnet_sw_interface, vnm, &sw_if_index))
526  {
527  error = clib_error_return (0, "unknown interface `%U'",
528  format_unformat_error, input);
529  goto done;
530  }
531 
532  enable = 1;
533  if (unformat (input, "disable"))
534  {
535  enable = 0;
536  }
537 
538  /* set the interface flag */
539  l2input_intf_bitmap_enable (sw_if_index, L2INPUT_FEAT_LEARN, enable);
540 
541 done:
542  return error;
543 }
544 
545 /*?
546  * Layer 2 learning can be enabled and disabled on each
547  * interface and on each bridge-domain. Use this command to
548  * manage interfaces. It is enabled by default.
549  *
550  * @cliexpar
551  * Example of how to enable learning:
552  * @cliexcmd{set interface l2 learn GigabitEthernet0/8/0}
553  * Example of how to disable learning:
554  * @cliexcmd{set interface l2 learn GigabitEthernet0/8/0 disable}
555 ?*/
556 /* *INDENT-OFF* */
557 VLIB_CLI_COMMAND (int_learn_cli, static) = {
558  .path = "set interface l2 learn",
559  .short_help = "set interface l2 learn <interface> [disable]",
560  .function = int_learn,
561 };
562 /* *INDENT-ON* */
563 
564 
565 static clib_error_t *
567 {
569 
571  {
572  if (unformat (input, "limit %d", &mp->global_learn_limit))
573  ;
574 
575  else
576  return clib_error_return (0, "unknown input `%U'",
577  format_unformat_error, input);
578  }
579 
580  return 0;
581 }
582 
584 
585 
586 /*
587  * fd.io coding-style-patch-verification: ON
588  *
589  * Local Variables:
590  * eval: (c-set-style "gnu")
591  * End:
592  */
u32 error_heap_index
Definition: node.h:279
u32 global_learn_count
Definition: l2_learn.h:32
#define CLIB_UNUSED(x)
Definition: clib.h:79
vnet_main_t * vnet_get_main(void)
Definition: misc.c:46
#define PREDICT_TRUE(x)
Definition: clib.h:98
static f64 vlib_time_now(vlib_main_t *vm)
Definition: main.h:192
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
u8 src_address[6]
Definition: packet.h:54
#define vlib_validate_buffer_enqueue_x4(vm, node, next_index, to_next, n_left_to_next, bi0, bi1, bi2, bi3, next0, next1, next2, next3)
Finish enqueueing four buffers forward in the graph.
Definition: buffer_node.h:138
struct _vlib_node_registration vlib_node_registration_t
uword unformat_user(unformat_input_t *input, unformat_function_t *func,...)
Definition: unformat.c:983
clib_error_t * l2learn_init(vlib_main_t *vm)
Definition: l2_learn.c:482
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:419
unformat_function_t unformat_vnet_sw_interface
Definition: l2_fib.h:86
vlib_error_t * errors
Vector of errors for this node.
Definition: node.h:419
static_always_inline void l2learn_process(vlib_node_runtime_t *node, l2learn_main_t *msm, u64 *counter_base, vlib_buffer_t *b0, u32 sw_if_index0, l2fib_entry_key_t *key0, l2fib_entry_key_t *cached_key, u32 *count, l2fib_entry_result_t *result0, u32 *next0, u8 timestamp)
Perform learning on one packet based on the mac table lookup result.
Definition: l2_learn.c:109
#define static_always_inline
Definition: clib.h:85
u8 * format_ethernet_address(u8 *s, va_list *args)
Definition: format.c:44
int clib_bihash_add_del(clib_bihash *h, clib_bihash_kv *add_v, int is_add)
Add or delete a (key,value) pair from a bi-hash table.
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:111
u8 dst_address[6]
Definition: packet.h:53
static BVT(clib_bihash)
Definition: adj_nbr.c:26
#define vlib_prefetch_buffer_header(b, type)
Prefetch buffer metadata.
Definition: buffer.h:164
#define clib_error_return(e, args...)
Definition: error.h:99
unsigned long u64
Definition: types.h:89
static char * l2learn_error_strings[]
Definition: l2_learn.c:92
vlib_error_main_t error_main
Definition: main.h:124
vnet_main_t * vnet_main
Definition: l2_learn.h:42
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:188
#define PREDICT_FALSE(x)
Definition: clib.h:97
#define VLIB_CONFIG_FUNCTION(x, n,...)
Definition: init.h:119
static_always_inline uword l2learn_node_inline(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame, int do_trace)
Definition: l2_learn.c:222
#define L2FIB_NUM_BUCKETS
Definition: l2_fib.h:27
static u32 feat_bitmap_get_next_node_index(u32 *next_nodes, u32 bitmap)
Return the graph node index for the feature corresponding to the first set bit in the bitmap...
Definition: feat_bitmap.h:79
static u8 * format_l2learn_trace(u8 *s, va_list *args)
Definition: l2_learn.c:60
#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:216
#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:366
u64 raw
Definition: l2_fib.h:101
vlib_error_t error
Error code for buffers to be enqueued to error handler.
Definition: buffer.h:113
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1131
u64 * counters
Definition: error.h:78
#define UNFORMAT_END_OF_INPUT
Definition: format.h:143
u16 n_vectors
Definition: node.h:345
#define CLIB_PREFETCH(addr, size, type)
Definition: cache.h:82
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 foreach_l2learn_error
Definition: l2_learn.c:75
static clib_error_t * l2learn_config(vlib_main_t *vm, unformat_input_t *input)
Definition: l2_learn.c:566
#define VLIB_BUFFER_IS_TRACED
Definition: buffer.h:85
#define clib_memcpy(a, b, c)
Definition: string.h:69
l2learn_next_t
Definition: l2_learn.c:98
static clib_error_t * int_learn(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Set subinterface learn enable/disable.
Definition: l2_learn.c:517
#define ARRAY_LEN(x)
Definition: clib.h:59
u32 feat_next_node_index[32]
Definition: l2_learn.h:38
char ** l2input_get_feat_names(void)
Return an array of strings containing graph node names of each feature.
Definition: l2_input.c:58
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:154
l2learn_error_t
Definition: l2_learn.c:84
u16 cached_next_index
Next frame index that vector arguments were last enqueued to last time this node ran.
Definition: node.h:460
#define ASSERT(truth)
unsigned int u32
Definition: types.h:88
Definition: l2_fib.h:49
struct l2fib_entry_result_t::@184::@186 fields
#define VLIB_NODE_FLAG_TRACE
Definition: node.h:260
u32 global_learn_limit
Definition: l2_learn.h:35
static uword l2learn_node_fn(vlib_main_t *vm, vlib_node_runtime_t *node, vlib_frame_t *frame)
Definition: l2_learn.c:452
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:486
unsigned short u16
Definition: types.h:57
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:269
vlib_main_t * vlib_main
Definition: l2_learn.h:41
#define vnet_buffer(b)
Definition: buffer.h:304
#define VLIB_NODE_FUNCTION_MULTIARCH(node, fn)
Definition: node.h:159
u8 * format_unformat_error(u8 *s, va_list *va)
Definition: unformat.c:91
#define VLIB_REGISTER_NODE(x,...)
Definition: node.h:144
l2learn_main_t l2learn_main
Definition: l2_learn.h:46
u8 data[0]
Packet data.
Definition: buffer.h:152
static vlib_node_t * vlib_get_node(vlib_main_t *vm, u32 i)
Get vlib node by index.
Definition: node_funcs.h:58
static_always_inline void l2fib_lookup_4(BVT(clib_bihash)*mac_table, l2fib_entry_key_t *cached_key, l2fib_entry_result_t *cached_result, u8 *mac0, u8 *mac1, u8 *mac2, u8 *mac3, u16 bd_index0, u16 bd_index1, u16 bd_index2, u16 bd_index3, l2fib_entry_key_t *key0, l2fib_entry_key_t *key1, l2fib_entry_key_t *key2, l2fib_entry_key_t *key3, u32 *bucket0, u32 *bucket1, u32 *bucket2, u32 *bucket3, l2fib_entry_result_t *result0, l2fib_entry_result_t *result1, l2fib_entry_result_t *result2, l2fib_entry_result_t *result3)
Definition: l2_fib.h:269
u16 flags
Copy of main node flags.
Definition: node.h:454
static_always_inline void l2fib_lookup_1(BVT(clib_bihash)*mac_table, l2fib_entry_key_t *cached_key, l2fib_entry_result_t *cached_result, u8 *mac0, u16 bd_index0, l2fib_entry_key_t *key0, u32 *bucket0, l2fib_entry_result_t *result0)
Lookup the entry for mac and bd_index in the mac table for 1 packet.
Definition: l2_fib.h:170
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:67
u32 flags
buffer flags: VLIB_BUFFER_IS_TRACED: trace this buffer.
Definition: buffer.h:74
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
static vlib_node_registration_t l2learn_node
(constructor) VLIB_REGISTER_NODE (l2learn_node)
Definition: l2_learn.c:73
uword unformat(unformat_input_t *i, const char *fmt,...)
Definition: unformat.c:972
Definition: defs.h:46
u64 raw
Definition: l2_fib.h:63
static uword unformat_check_input(unformat_input_t *i)
Definition: format.h:169