FD.io VPP  v19.08.3-2-gbabecb413
Vector Packet Processing
adj.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2016 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 <vnet/adj/adj.h>
17 #include <vnet/adj/adj_internal.h>
18 #include <vnet/adj/adj_glean.h>
19 #include <vnet/adj/adj_midchain.h>
20 #include <vnet/adj/adj_mcast.h>
21 #include <vnet/adj/adj_delegate.h>
22 #include <vnet/fib/fib_node_list.h>
23 
24 /* Adjacency packet/byte counters indexed by adjacency index. */
25 vlib_combined_counter_main_t adjacency_counters = {
26  .name = "adjacency",
27  .stat_segment_name = "/net/adjacency",
28 };
29 
30 /*
31  * the single adj pool
32  */
34 
35 /**
36  * @brief Global Config for enabling per-adjacency counters.
37  * By default these are disabled.
38  */
40 
41 const ip46_address_t ADJ_BCAST_ADDR = {
42  .ip6 = {
43  .as_u64[0] = 0xffffffffffffffff,
44  .as_u64[1] = 0xffffffffffffffff,
45  },
46 };
47 
48 /**
49  * Adj flag names
50  */
51 static const char *adj_attr_names[] = ADJ_ATTR_NAMES;
52 
53 always_inline void
55 {
56  if (CLIB_DEBUG > 0)
57  {
58  clib_memset (adj, 0xfe, sizeof (adj[0]));
59  }
60 }
61 
64 {
65  ip_adjacency_t *adj;
66  u8 need_barrier_sync = 0;
67  vlib_main_t *vm;
68  vm = vlib_get_main();
69 
70  ASSERT (vm->thread_index == 0);
71 
72  pool_get_aligned_will_expand (adj_pool, need_barrier_sync,
74  /* If the adj_pool will expand, stop the parade. */
75  if (need_barrier_sync)
77 
79 
80  adj_poison(adj);
81 
82  /* Validate adjacency counters. */
83  if (need_barrier_sync == 0)
84  {
85  /* If the adj counter pool will expand, stop the parade */
87  (&adjacency_counters, adj_get_index (adj));
88  if (need_barrier_sync)
90  }
91  vlib_validate_combined_counter(&adjacency_counters,
92  adj_get_index(adj));
93 
94  /* Make sure certain fields are always initialized. */
95  vlib_zero_combined_counter(&adjacency_counters,
96  adj_get_index(adj));
97  fib_node_init(&adj->ia_node,
99 
100  adj->ia_nh_proto = proto;
101  adj->ia_flags = 0;
102  adj->rewrite_header.sw_if_index = ~0;
103  adj->rewrite_header.flags = 0;
104  adj->lookup_next_index = 0;
105  adj->ia_delegates = NULL;
106 
107  /* lest it become a midchain in the future */
108  clib_memset(&adj->sub_type.midchain.next_dpo, 0,
109  sizeof(adj->sub_type.midchain.next_dpo));
110 
111  if (need_barrier_sync)
113 
114  return (adj);
115 }
116 
117 static int
119 {
120  if (ADJ_INDEX_INVALID == adj_index)
121  return (!0);
122 
123  return (0);
124 }
125 
126 u8*
127 format_adj_flags (u8 * s, va_list * args)
128 {
129  adj_flags_t af;
130  adj_attr_t at;
131 
132  af = va_arg (*args, int);
133 
134  if (ADJ_FLAG_NONE == af)
135  {
136  return (format(s, "None"));
137  }
139  {
140  if (af & (1 << at))
141  {
142  s = format(s, "%s ", adj_attr_names[at]);
143  }
144  }
145  return (s);
146 }
147 
148 /**
149  * @brief Pretty print helper function for formatting specific adjacencies.
150  * @param s - input string to format
151  * @param args - other args passed to format function such as:
152  * - vnet_main_t
153  * - ip_lookup_main_t
154  * - adj_index
155  */
156 u8 *
157 format_ip_adjacency (u8 * s, va_list * args)
158 {
160  ip_adjacency_t * adj;
161  u32 adj_index;
162 
163  adj_index = va_arg (*args, u32);
164  fiaf = va_arg (*args, format_ip_adjacency_flags_t);
165 
166  if (!adj_is_valid(adj_index))
167  return format(s, "<invalid adjacency>");
168 
169  adj = adj_get(adj_index);
170 
171  switch (adj->lookup_next_index)
172  {
175  s = format (s, "%U", format_adj_nbr, adj_index, 0);
176  break;
177  case IP_LOOKUP_NEXT_ARP:
178  s = format (s, "%U", format_adj_nbr_incomplete, adj_index, 0);
179  break;
181  s = format (s, "%U", format_adj_glean, adj_index, 0);
182  break;
184  s = format (s, "%U", format_adj_midchain, adj_index, 2);
185  break;
187  s = format (s, "%U", format_adj_mcast, adj_index, 0);
188  break;
190  s = format (s, "%U", format_adj_mcast_midchain, adj_index, 0);
191  break;
192  case IP_LOOKUP_NEXT_DROP:
193  case IP_LOOKUP_NEXT_PUNT:
196  case IP_LOOKUP_N_NEXT:
197  break;
198  }
199 
200  if (fiaf & FORMAT_IP_ADJACENCY_DETAIL)
201  {
202  vlib_counter_t counts;
203 
204  vlib_get_combined_counter(&adjacency_counters, adj_index, &counts);
205  s = format (s, "\n flags:%U", format_adj_flags, adj->ia_flags);
206  s = format (s, "\n counts:[%Ld:%Ld]", counts.packets, counts.bytes);
207  s = format (s, "\n locks:%d", adj->ia_node.fn_locks);
208  s = format(s, "\n delegates:\n ");
209  s = adj_delegate_format(s, adj);
210 
211  s = format(s, "\n children:");
213  {
214  s = format(s, "\n ");
216  }
217  }
218 
219  return s;
220 }
221 
222 int
224  fib_node_index_t **entry_indicies)
225 {
226  ip_adjacency_t * adj;
227 
228  adj = adj_get(ai);
229 
230  switch (adj->lookup_next_index)
231  {
233  case IP_LOOKUP_NEXT_ARP:
237  case IP_LOOKUP_NEXT_DROP:
238  case IP_LOOKUP_NEXT_PUNT:
241  case IP_LOOKUP_N_NEXT:
242  /*
243  * these adjacency types are terminal graph nodes, so there's no
244  * possibility of a loop down here.
245  */
246  break;
249  return (adj_ndr_midchain_recursive_loop_detect(ai, entry_indicies));
250  }
251 
252  return (0);
253 }
254 
255 /*
256  * adj_last_lock_gone
257  *
258  * last lock/reference to the adj has gone, we no longer need it.
259  */
260 static void
262 {
264 
266  ADJ_DBG(adj, "last-lock-gone");
267 
269 
271 
272  switch (adj->lookup_next_index)
273  {
276  /* FALL THROUGH */
277  case IP_LOOKUP_NEXT_ARP:
280  /*
281  * complete and incomplete nbr adjs
282  */
284  adj->ia_nh_proto,
285  adj->ia_link,
286  &adj->sub_type.nbr.next_hop,
287  adj->rewrite_header.sw_if_index);
288  break;
291  adj->rewrite_header.sw_if_index);
292  break;
295  /* FALL THROUGH */
298  adj->rewrite_header.sw_if_index);
299  break;
300  case IP_LOOKUP_NEXT_DROP:
301  case IP_LOOKUP_NEXT_PUNT:
304  case IP_LOOKUP_N_NEXT:
305  /*
306  * type not stored in any DB from which we need to remove it
307  */
308  break;
309  }
310 
312 
313  fib_node_deinit(&adj->ia_node);
314  ASSERT(0 == vec_len(adj->ia_delegates));
315  vec_free(adj->ia_delegates);
316  pool_put(adj_pool, adj);
317 }
318 
319 u32
321 {
322  ip_adjacency_t *adj;
323 
324  adj = adj_get(dpo->dpoi_index);
325 
326  return (adj->rewrite_header.sw_if_index);
327 }
328 
329 void
331 {
332  ip_adjacency_t *adj;
333 
334  if (adj_index_is_special(adj_index))
335  {
336  return;
337  }
338 
339  adj = adj_get(adj_index);
340  ASSERT(adj);
341 
342  ADJ_DBG(adj, "lock");
343  fib_node_lock(&adj->ia_node);
344 }
345 
346 void
348 {
349  ip_adjacency_t *adj;
350 
351  if (adj_index_is_special(adj_index))
352  {
353  return;
354  }
355 
356  adj = adj_get(adj_index);
357  ASSERT(adj);
358 
359  ADJ_DBG(adj, "unlock");
360  ASSERT(adj);
361 
362  fib_node_unlock(&adj->ia_node);
363 }
364 
365 u32
367  fib_node_type_t child_type,
368  fib_node_index_t child_index)
369 {
370  ASSERT(ADJ_INDEX_INVALID != adj_index);
371  if (adj_index_is_special(adj_index))
372  {
373  return (~0);
374  }
375 
377  adj_index,
378  child_type,
379  child_index));
380 }
381 
382 void
384  u32 sibling_index)
385 {
386  if (adj_index_is_special(adj_index))
387  {
388  return;
389  }
390 
392  adj_index,
393  sibling_index);
394 }
395 
396 /*
397  * Context for the walk to update the cached feature flags.
398  */
399 typedef struct adj_feature_update_t_
400 {
404 
405 static adj_walk_rc_t
407  void *arg)
408 {
410  ip_adjacency_t *adj;
411 
412  adj = adj_get(ai);
413 
414  /*
415  * this ugly mess matches the feature arc that is changing with affected
416  * adjacencies
417  */
419  (VNET_LINK_IP6 == adj->ia_link)) ||
421  (VNET_LINK_IP4 == adj->ia_link)) ||
423  (VNET_LINK_MPLS == adj->ia_link)))
424  {
425  if (ctx->enable)
426  adj->rewrite_header.flags |= VNET_REWRITE_HAS_FEATURES;
427  else
428  adj->rewrite_header.flags &= ~VNET_REWRITE_HAS_FEATURES;
429  }
430  return (ADJ_WALK_RC_CONTINUE);
431 }
432 
433 void
435  u8 arc_index,
436  u8 is_enable)
437 {
438  /*
439  * Walk all the adjacencies on the interface to update the cached
440  * 'has-features' flag
441  */
443  .arc = arc_index,
444  .enable = is_enable,
445  };
446  adj_walk (sw_if_index, adj_feature_update_walk_cb, &ctx);
447 }
448 
449 static adj_walk_rc_t
451  void *arg)
452 {
453  ip_adjacency_t *adj;
454 
455  adj = adj_get(ai);
456 
458  &adj->rewrite_header);
459 
460  return (ADJ_WALK_RC_CONTINUE);
461 }
462 
463 static clib_error_t *
465 {
466  adj_walk (sw_if_index, adj_mtu_update_walk_cb, NULL);
467 
468  return (NULL);
469 }
470 
472 
473 /**
474  * @brief Walk the Adjacencies on a given interface
475  */
476 void
478  adj_walk_cb_t cb,
479  void *ctx)
480 {
481  /*
482  * walk all the neighbor adjacencies
483  */
485 
487  {
488  adj_nbr_walk(sw_if_index, proto, cb, ctx);
489  adj_mcast_walk(sw_if_index, proto, cb, ctx);
490  }
491 }
492 
493 /**
494  * @brief Return the link type of the adjacency
495  */
498 {
499  const ip_adjacency_t *adj;
500 
501  adj = adj_get(ai);
502 
503  return (adj->ia_link);
504 }
505 
506 /**
507  * @brief Return the sw interface index of the adjacency.
508  */
509 u32
511 {
512  const ip_adjacency_t *adj;
513 
514  adj = adj_get(ai);
515 
516  return (adj->rewrite_header.sw_if_index);
517 }
518 
519 /**
520  * @brief Return true if the adjacency is 'UP', i.e. can be used for forwarding
521  * 0 is down, !0 is up.
522  */
523 int
525 {
526  return (adj_bfd_is_up(ai));
527 }
528 
529 /**
530  * @brief Return the rewrite string of the adjacency
531  */
532 const u8*
534 {
535  vnet_rewrite_header_t *rw;
536  ip_adjacency_t *adj;
537 
538  adj = adj_get(ai);
539  rw = &adj->rewrite_header;
540 
541  ASSERT (rw->data_bytes != 0xfefe);
542 
543  return (rw->data - rw->data_bytes);
544 }
545 
546 static fib_node_t *
548 {
549  ip_adjacency_t *adj;
550 
551  adj = adj_get(index);
552 
553  return (&adj->ia_node);
554 }
555 
556 #define ADJ_FROM_NODE(_node) \
557  ((ip_adjacency_t*)((char*)_node - STRUCT_OFFSET_OF(ip_adjacency_t, ia_node)))
558 
559 static void
561 {
563 }
564 
568 {
569  ip_adjacency_t *adj;
570 
571  adj = ADJ_FROM_NODE(node);
572 
573  switch (adj->lookup_next_index)
574  {
577  break;
578  case IP_LOOKUP_NEXT_ARP:
584  case IP_LOOKUP_NEXT_DROP:
585  case IP_LOOKUP_NEXT_PUNT:
588  case IP_LOOKUP_N_NEXT:
589  /*
590  * Que pasa. yo soj en el final!
591  */
592  ASSERT(0);
593  break;
594  }
595 
597 }
598 
599 /*
600  * Adjacency's graph node virtual function table
601  */
602 static const fib_node_vft_t adj_vft = {
604  .fnv_last_lock = adj_node_last_lock_gone,
605  .fnv_back_walk = adj_back_walk_notify,
606 };
607 
608 static clib_error_t *
610 {
612 
617 
618  return (NULL);
619 }
620 
622 
623 static clib_error_t *
625  unformat_input_t * input,
626  vlib_cli_command_t * cmd)
627 {
629  u32 sw_if_index = ~0;
630  int summary = 0;
631 
633  {
634  if (unformat (input, "%d", &ai))
635  ;
636  else if (unformat (input, "summary") || unformat (input, "sum"))
637  summary = 1;
638  else if (unformat (input, "%U",
640  &sw_if_index))
641  ;
642  else
643  break;
644  }
645 
646  if (summary)
647  {
648  vlib_cli_output (vm, "Number of adjacencies: %d", pool_elts(adj_pool));
649  vlib_cli_output (vm, "Per-adjacency counters: %s",
651  "enabled":
652  "disabled"));
653  }
654  else
655  {
656  if (ADJ_INDEX_INVALID != ai)
657  {
658  if (pool_is_free_index(adj_pool, ai))
659  {
660  vlib_cli_output (vm, "adjacency %d invalid", ai);
661  return 0;
662  }
663 
664  vlib_cli_output (vm, "[@%d] %U",
665  ai,
668  }
669  else
670  {
671  /* *INDENT-OFF* */
672  pool_foreach_index(ai, adj_pool,
673  ({
674  if (~0 != sw_if_index &&
675  sw_if_index != adj_get_sw_if_index(ai))
676  {
677  }
678  else
679  {
680  vlib_cli_output (vm, "[@%d] %U",
681  ai,
684  }
685  }));
686  /* *INDENT-ON* */
687  }
688  }
689  return 0;
690 }
691 
692 /*?
693  * Show all adjacencies.
694  * @cliexpar
695  * @cliexstart{sh adj}
696  * [@0]
697  * [@1] glean: loop0
698  * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
699  * [@3] mpls via 1.0.0.2 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
700  * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
701  * [@5] mpls via 1.0.0.3 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
702  * @cliexend
703  ?*/
704 VLIB_CLI_COMMAND (adj_show_command, static) = {
705  .path = "show adj",
706  .short_help = "show adj [<adj_index>] [interface] [summary]",
707  .function = adj_show,
708 };
709 
710 /**
711  * @brief CLI invoked function to enable/disable per-adj counters
712  */
713 static clib_error_t *
715  unformat_input_t * input,
716  vlib_cli_command_t * cmd)
717 {
718  clib_error_t *error = NULL;
719  int enable = ~0;
720 
722  {
723  if (unformat (input, "enable"))
724  enable = 1;
725  else if (unformat (input, "disable"))
726  enable = 0;
727  else
728  break;
729  }
730 
731  if (enable != ~0)
732  {
733  /* user requested something sensible */
735  }
736  else
737  {
738  error = clib_error_return (0, "specify 'enable' or 'disable'");
739  }
740 
741  return (error);
742 }
743 
744 /*?
745  * Enable/disable per-adjacency counters. This is optional because it comes
746  * with a non-negligible performance cost.
747  ?*/
748 VLIB_CLI_COMMAND (adj_cli_counters_set_command, static) = {
749  .path = "adjacency counters",
750  .short_help = "adjacency counters [enable|disable]",
751  .function = adj_cli_counters_set,
752 };
void adj_glean_remove(fib_protocol_t proto, u32 sw_if_index)
Definition: adj_glean.c:130
void adj_delegate_adj_deleted(ip_adjacency_t *adj)
Definition: adj_delegate.c:128
adj_flags_t ia_flags
Flags on the adjacency 1-bytes.
Definition: adj.h:255
u32 flags
Definition: vhost_user.h:141
ip_adjacency_t * adj_pool
The global adjacency pool.
Definition: adj.c:33
void vlib_validate_combined_counter(vlib_combined_counter_main_t *cm, u32 index)
validate a combined counter
Definition: counter.c:108
enum adj_attr_t_ adj_attr_t
Flags on an IP adjacency.
u8 * format_adj_mcast_midchain(u8 *s, va_list *ap)
Definition: adj_mcast.c:351
u8 * format_adj_nbr(u8 *s, va_list *ap)
Format a neigbour (REWRITE) adjacency.
Definition: adj_nbr.c:993
static int adj_index_is_special(adj_index_t adj_index)
Definition: adj.c:118
void adj_lock(adj_index_t adj_index)
Take a reference counting lock on the adjacency.
Definition: adj.c:330
vnet_main_t * vnet_get_main(void)
Definition: misc.c:46
void fib_node_init(fib_node_t *node, fib_node_type_t type)
Definition: fib_node.c:185
const u8 * adj_get_rewrite(adj_index_t ai)
Return the rewrite string of the adjacency.
Definition: adj.c:533
int vlib_validate_combined_counter_will_expand(vlib_combined_counter_main_t *cm, u32 index)
Definition: counter.c:124
Multicast Adjacency.
Definition: adj.h:82
vnet_link_t adj_get_link_type(adj_index_t ai)
Return the link type of the adjacency.
Definition: adj.c:497
clib_memset(h->entries, 0, sizeof(h->entries[0]) *entries)
Broadcasr Adjacency.
Definition: adj.h:85
IP unicast adjacency.
Definition: adj.h:221
enum fib_node_back_walk_rc_t_ fib_node_back_walk_rc_t
Return code from a back walk function.
u32 thread_index
Definition: main.h:218
#define pool_get_aligned_will_expand(P, YESNO, A)
See if pool_get will expand the pool or not.
Definition: pool.h:242
This packet is to be rewritten and forwarded to the next processing node.
Definition: adj.h:73
Combined counter to hold both packets and byte differences.
Definition: counter_types.h:26
void fib_node_deinit(fib_node_t *node)
Definition: fib_node.c:197
ip_lookup_main_t lookup_main
Definition: ip4.h:107
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:424
unformat_function_t unformat_vnet_sw_interface
u8 * format_adj_nbr_incomplete(u8 *s, va_list *ap)
Format aa incomplete neigbour (ARP) adjacency.
Definition: adj_nbr.c:974
void adj_child_remove(adj_index_t adj_index, u32 sibling_index)
Remove a child dependent.
Definition: adj.c:383
u32 adj_dpo_get_urpf(const dpo_id_t *dpo)
Definition: adj.c:320
unsigned char u8
Definition: types.h:56
#define ADJ_ATTR_NAMES
Definition: adj.h:186
enum fib_protocol_t_ fib_protocol_t
Protocol Type.
u32 fib_node_child_add(fib_node_type_t parent_type, fib_node_index_t parent_index, fib_node_type_t type, fib_node_index_t index)
Definition: fib_node.c:98
#define vlib_worker_thread_barrier_sync(X)
Definition: threads.h:204
void fib_node_register_type(fib_node_type_t type, const fib_node_vft_t *vft)
fib_node_register_type
Definition: fib_node.c:60
vnet_link_t ia_link
link/ether-type 1 bytes
Definition: adj.h:242
union ip_adjacency_t_::@48 sub_type
Adjacency to punt this packet.
Definition: adj.h:55
u8 output_feature_arc_index
Definition: lookup.h:164
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
Definition: adj.h:433
vl_api_interface_index_t sw_if_index
Definition: gre.api:50
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:173
#define always_inline
Definition: clib.h:99
enum adj_walk_rc_t_ adj_walk_rc_t
return codes from a adjacency walker callback function
void adj_mcast_walk(u32 sw_if_index, fib_protocol_t proto, adj_walk_cb_t cb, void *ctx)
Walk the multicast Adjacencies on a given interface.
Definition: adj_mcast.c:313
#define clib_error_return(e, args...)
Definition: error.h:99
void adj_unlock(adj_index_t adj_index)
Release a reference counting lock on the adjacency.
Definition: adj.c:347
int adj_bfd_is_up(adj_index_t ai)
Definition: adj_bfd.c:239
unsigned int u32
Definition: types.h:88
struct ip_adjacency_t_::@48::@50 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
static clib_error_t * adj_cli_counters_set(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
CLI invoked function to enable/disable per-adj counters.
Definition: adj.c:714
void adj_nbr_remove(adj_index_t ai, fib_protocol_t nh_proto, vnet_link_t link_type, const ip46_address_t *nh_addr, u32 sw_if_index)
Definition: adj_nbr.c:81
u8 output_feature_arc_index
Definition: mpls.h:57
#define ADJ_DBG(_e, _fmt, _args...)
big switch to turn on Adjacency debugging
Definition: adj_internal.h:42
The identity of a DPO is a combination of its type and its instance number/index of objects of that t...
Definition: dpo.h:170
#define ADJ_INDEX_INVALID
Invalid ADJ index - used when no adj is known likewise blazoned capitals INVALID speak volumes where ...
Definition: adj_types.h:36
static void vlib_zero_combined_counter(vlib_combined_counter_main_t *cm, u32 index)
Clear a combined counter Clears the set of per-thread counters.
Definition: counter.h:285
int adj_is_up(adj_index_t ai)
Return true if the adjacency is &#39;UP&#39;, i.e.
Definition: adj.c:524
counter_t packets
packet counter
Definition: counter_types.h:28
u32 adj_get_sw_if_index(adj_index_t ai)
Return the sw interface index of the adjacency.
Definition: adj.c:510
void fib_node_lock(fib_node_t *node)
Definition: fib_node.c:203
long ctx[MAX_CONNS]
Definition: main.c:144
void adj_midchain_module_init(void)
Module initialisation.
Definition: adj_midchain.c:810
int adj_ndr_midchain_recursive_loop_detect(adj_index_t ai, fib_node_index_t **entry_indicies)
descend the FIB graph looking for loops
Definition: adj_midchain.c:692
struct _unformat_input_t unformat_input_t
#define ADJ_FROM_NODE(_node)
Definition: adj.c:556
static adj_index_t adj_get_index(ip_adjacency_t *adj)
Get a pointer to an adjacency object from its index.
Definition: adj_internal.h:101
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:286
void adj_midchain_delegate_restack(adj_index_t ai)
restack a midchain delegate
This packet matches an "interface route" and packets need to be passed to ARP to find rewrite string ...
Definition: adj.h:68
int adj_per_adj_counters
Global Config for enabling per-adjacency counters.
Definition: adj.c:39
static fib_node_back_walk_rc_t adj_back_walk_notify(fib_node_t *node, fib_node_back_walk_ctx_t *ctx)
Definition: adj.c:566
An node in the FIB graph.
Definition: fib_node.h:295
void adj_nbr_module_init(void)
Module initialisation.
Definition: adj_nbr.c:1103
void fib_node_unlock(fib_node_t *node)
Definition: fib_node.c:209
fib_node_t ia_node
Linkage into the FIB node graph.
Definition: adj.h:229
void adj_mcast_remove(fib_protocol_t proto, u32 sw_if_index)
Definition: adj_mcast.c:177
u8 * format_adj_flags(u8 *s, va_list *args)
Format adjacency flags.
Definition: adj.c:127
void adj_glean_module_init(void)
Module initialisation.
Definition: adj_glean.c:322
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P with alignment A.
Definition: pool.h:230
struct ip_adjacency_t_::@48::@49 nbr
IP_LOOKUP_NEXT_ARP/IP_LOOKUP_NEXT_REWRITE.
static clib_error_t * adj_show(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: adj.c:624
This packet matches an "incomplete adjacency" and packets need to be passed to ARP to find rewrite st...
Definition: adj.h:63
Adjacency to drop this packet.
Definition: adj.h:53
#define UNFORMAT_END_OF_INPUT
Definition: format.h:145
fib_node_list_t fn_children
Vector of nodes that depend upon/use/share this node.
Definition: fib_node.h:309
mpls_main_t mpls_main
Definition: mpls.c:25
int adj_recursive_loop_detect(adj_index_t ai, fib_node_index_t **entry_indicies)
descend the FIB graph looking for loops
Definition: adj.c:223
static void vlib_get_combined_counter(const vlib_combined_counter_main_t *cm, u32 index, vlib_counter_t *result)
Get the value of a combined counter, never called in the speed path Scrapes the entire set of per-thr...
Definition: counter.h:259
vlib_main_t * vm
Definition: buffer.c:323
static void adj_last_lock_gone(ip_adjacency_t *adj)
Definition: adj.c:261
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:341
Multicast Midchain Adjacency.
Definition: adj.h:89
fib_node_get_t fnv_get
Definition: fib_node.h:283
u8 * format_adj_glean(u8 *s, va_list *ap)
Format/display a glean adjacency.
Definition: adj_glean.c:263
static clib_error_t * adj_mtu_update(vnet_main_t *vnm, u32 sw_if_index, u32 flags)
Definition: adj.c:464
void adj_mcast_module_init(void)
Module initialisation.
Definition: adj_mcast.c:474
u32 fib_node_index_t
A typedef of a node index.
Definition: fib_types.h:30
static adj_walk_rc_t adj_mtu_update_walk_cb(adj_index_t ai, void *arg)
Definition: adj.c:450
adj_walk_rc_t(* adj_walk_cb_t)(adj_index_t ai, void *ctx)
Call back function when walking adjacencies.
Definition: adj_types.h:50
static void adj_poison(ip_adjacency_t *adj)
Definition: adj.c:54
#define pool_is_free_index(P, I)
Use free bitmap to query whether given index is free.
Definition: pool.h:283
u32 adj_index_t
An index for adjacencies.
Definition: adj_types.h:30
u8 * format_adj_mcast(u8 *s, va_list *ap)
Format/display a mcast adjacency.
Definition: adj_mcast.c:328
void adj_nbr_walk(u32 sw_if_index, fib_protocol_t adj_nh_proto, adj_walk_cb_t cb, void *ctx)
Walk the neighbour Adjacencies on a given interface.
Definition: adj_nbr.c:581
Context passed between object during a back walk.
Definition: fib_node.h:208
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:161
void adj_walk(u32 sw_if_index, adj_walk_cb_t cb, void *ctx)
Walk the Adjacencies on a given interface.
Definition: adj.c:477
u8 * format_adj_midchain(u8 *s, va_list *ap)
Format a midchain adjacency.
Definition: adj_midchain.c:719
This packets follow a mid-chain adjacency.
Definition: adj.h:76
static const char * adj_attr_names[]
Adj flag names.
Definition: adj.c:51
u32 fib_node_list_get_size(fib_node_list_t list)
#define ASSERT(truth)
static fib_node_t * adj_get_node(fib_node_index_t index)
Definition: adj.c:547
ip6_main_t ip6_main
Definition: ip6_forward.c:2805
ip_lookup_main_t lookup_main
Definition: ip6.h:179
enum vnet_link_t_ vnet_link_t
Link Type: A description of the protocol of packets on the link.
void fib_node_child_remove(fib_node_type_t parent_type, fib_node_index_t parent_index, fib_node_index_t sibling_index)
Definition: fib_node.c:123
#define FOR_EACH_ADJ_ATTR(_attr)
Definition: adj.h:193
static vlib_main_t * vlib_get_main(void)
Definition: global_funcs.h:23
enum adj_flags_t_ adj_flags_t
Flags on an IP adjacency.
u8 * adj_delegate_format(u8 *s, ip_adjacency_t *adj)
Definition: adj_delegate.c:144
counter_t bytes
byte counter
Definition: counter_types.h:29
This packets needs to go to ICMP error.
Definition: adj.h:79
This packet is for one of our own IP addresses.
Definition: adj.h:58
fib_protocol_t ia_nh_proto
The protocol of the neighbor/peer.
Definition: adj.h:249
index_t dpoi_index
the index of objects of that type
Definition: dpo.h:186
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
ip_lookup_next_t lookup_next_index
Next hop after ip4-lookup.
Definition: adj.h:236
u32 fn_locks
Number of dependents on this node.
Definition: fib_node.h:315
u32 adj_child_add(adj_index_t adj_index, fib_node_type_t child_type, fib_node_index_t child_index)
Add a child dependent to an adjacency.
Definition: adj.c:366
u8 * format_ip_adjacency(u8 *s, va_list *args)
Pretty print helper function for formatting specific adjacencies.
Definition: adj.c:157
ip_adjacency_t * adj_alloc(fib_protocol_t proto)
Definition: adj.c:63
char * name
The counter collection&#39;s name.
Definition: counter.h:193
A collection of combined counters.
Definition: counter.h:188
#define FOR_EACH_FIB_IP_PROTOCOL(_item)
Definition: fib_types.h:70
static int adj_is_valid(adj_index_t adj_index)
Definition: adj.h:439
static void adj_node_last_lock_gone(fib_node_t *node)
Definition: adj.c:560
A FIB graph nodes virtual function table.
Definition: fib_node.h:282
enum fib_node_type_t_ fib_node_type_t
The types of nodes in a FIB graph.
void vlib_worker_thread_barrier_release(vlib_main_t *vm)
Definition: threads.c:1520
ip4_main_t ip4_main
Global ip4 main structure.
Definition: ip4_forward.c:1076
void adj_feature_update(u32 sw_if_index, u8 arc_index, u8 is_enable)
Notify the adjacency subsystem that the features settings for an interface have changed.
Definition: adj.c:434
void adj_midchain_teardown(ip_adjacency_t *adj)
adj_midchain_setup
Definition: adj_midchain.c:456
static clib_error_t * adj_module_init(vlib_main_t *vm)
Definition: adj.c:609
#define pool_foreach_index(i, v, body)
Iterate pool by index.
Definition: pool.h:538
u8 * fib_node_children_format(fib_node_list_t list, u8 *s)
Definition: fib_node.c:176
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:59
struct adj_feature_update_t_ adj_feature_update_ctx_t
This adjacency/interface has output features configured.
Definition: rewrite.h:57
VNET_SW_INTERFACE_MTU_CHANGE_FUNCTION(adj_mtu_update)
void vnet_rewrite_update_mtu(vnet_main_t *vnm, vnet_link_t linkt, vnet_rewrite_header_t *rw)
Definition: rewrite.c:92
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:772
static adj_walk_rc_t adj_feature_update_walk_cb(adj_index_t ai, void *arg)
Definition: adj.c:406
const ip46_address_t ADJ_BCAST_ADDR
The special broadcast address (to construct a broadcast adjacency.
Definition: adj.c:41
static int adj_are_counters_enabled(void)
Get the global configuration option for enabling per-adj counters.
Definition: adj.h:448
uword unformat(unformat_input_t *i, const char *fmt,...)
Definition: unformat.c:978
vl_api_fib_path_nh_proto_t proto
Definition: fib_types.api:125
static uword unformat_check_input(unformat_input_t *i)
Definition: format.h:171
struct adj_delegate_t_ * ia_delegates
more control plane members that do not fit on the first cacheline
Definition: adj.h:327
enum format_ip_adjacency_flags_t_ format_ip_adjacency_flags_t
static uword pool_elts(void *v)
Number of active elements in a pool.
Definition: pool.h:128