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