FD.io VPP  v20.09-64-g4f7b92f0a
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->ia_cfg_index = 0;
103  adj->rewrite_header.sw_if_index = ~0;
104  adj->rewrite_header.flags = 0;
105  adj->lookup_next_index = 0;
106  adj->ia_delegates = NULL;
107 
108  /* lest it become a midchain in the future */
109  clib_memset(&adj->sub_type.midchain.next_dpo, 0,
110  sizeof(adj->sub_type.midchain.next_dpo));
111 
112  if (need_barrier_sync)
114 
115  return (adj);
116 }
117 
118 static int
120 {
121  if (ADJ_INDEX_INVALID == adj_index)
122  return (!0);
123 
124  return (0);
125 }
126 
127 u8*
128 format_adj_flags (u8 * s, va_list * args)
129 {
130  adj_flags_t af;
131  adj_attr_t at;
132 
133  af = va_arg (*args, int);
134 
135  if (ADJ_FLAG_NONE == af)
136  {
137  return (format(s, "None"));
138  }
140  {
141  if (af & (1 << at))
142  {
143  s = format(s, "%s ", adj_attr_names[at]);
144  }
145  }
146  return (s);
147 }
148 
149 /**
150  * @brief Pretty print helper function for formatting specific adjacencies.
151  * @param s - input string to format
152  * @param args - other args passed to format function such as:
153  * - vnet_main_t
154  * - ip_lookup_main_t
155  * - adj_index
156  */
157 u8 *
158 format_ip_adjacency (u8 * s, va_list * args)
159 {
161  ip_adjacency_t * adj;
162  u32 adj_index;
163 
164  adj_index = va_arg (*args, u32);
165  fiaf = va_arg (*args, format_ip_adjacency_flags_t);
166 
167  if (!adj_is_valid(adj_index))
168  return format(s, "<invalid adjacency>");
169 
170  adj = adj_get(adj_index);
171 
172  switch (adj->lookup_next_index)
173  {
176  s = format (s, "%U", format_adj_nbr, adj_index, 0);
177  break;
178  case IP_LOOKUP_NEXT_ARP:
179  s = format (s, "%U", format_adj_nbr_incomplete, adj_index, 0);
180  break;
182  s = format (s, "%U", format_adj_glean, adj_index, 0);
183  break;
185  s = format (s, "%U", format_adj_midchain, adj_index, 2);
186  break;
188  s = format (s, "%U", format_adj_mcast, adj_index, 0);
189  break;
191  s = format (s, "%U", format_adj_mcast_midchain, adj_index, 0);
192  break;
193  case IP_LOOKUP_NEXT_DROP:
194  case IP_LOOKUP_NEXT_PUNT:
197  case IP_LOOKUP_N_NEXT:
198  break;
199  }
200 
201  if (fiaf & FORMAT_IP_ADJACENCY_DETAIL)
202  {
203  vlib_counter_t counts;
204 
205  vlib_get_combined_counter(&adjacency_counters, adj_index, &counts);
206  s = format (s, "\n flags:%U", format_adj_flags, adj->ia_flags);
207  s = format (s, "\n counts:[%Ld:%Ld]", counts.packets, counts.bytes);
208  s = format (s, "\n locks:%d", adj->ia_node.fn_locks);
209  s = format(s, "\n delegates:");
210  s = adj_delegate_format(s, adj);
211 
212  s = format(s, "\n children:");
214  {
215  s = format(s, "\n ");
217  }
218  }
219 
220  return s;
221 }
222 
223 int
225  fib_node_index_t **entry_indicies)
226 {
227  ip_adjacency_t * adj;
228 
229  adj = adj_get(ai);
230 
231  switch (adj->lookup_next_index)
232  {
234  case IP_LOOKUP_NEXT_ARP:
238  case IP_LOOKUP_NEXT_DROP:
239  case IP_LOOKUP_NEXT_PUNT:
242  case IP_LOOKUP_N_NEXT:
243  /*
244  * these adjacency types are terminal graph nodes, so there's no
245  * possibility of a loop down here.
246  */
247  break;
250  return (adj_ndr_midchain_recursive_loop_detect(ai, entry_indicies));
251  }
252 
253  return (0);
254 }
255 
256 /*
257  * adj_last_lock_gone
258  *
259  * last lock/reference to the adj has gone, we no longer need it.
260  */
261 static void
263 {
265 
267  ADJ_DBG(adj, "last-lock-gone");
268 
270 
272 
273  switch (adj->lookup_next_index)
274  {
277  /* FALL THROUGH */
278  case IP_LOOKUP_NEXT_ARP:
281  /*
282  * complete and incomplete nbr adjs
283  */
285  adj->ia_nh_proto,
286  adj->ia_link,
287  &adj->sub_type.nbr.next_hop,
288  adj->rewrite_header.sw_if_index);
289  break;
292  adj->rewrite_header.sw_if_index);
293  break;
296  /* FALL THROUGH */
299  adj->rewrite_header.sw_if_index);
300  break;
301  case IP_LOOKUP_NEXT_DROP:
302  case IP_LOOKUP_NEXT_PUNT:
305  case IP_LOOKUP_N_NEXT:
306  /*
307  * type not stored in any DB from which we need to remove it
308  */
309  break;
310  }
311 
313 
314  fib_node_deinit(&adj->ia_node);
315  ASSERT(0 == vec_len(adj->ia_delegates));
316  vec_free(adj->ia_delegates);
317  pool_put(adj_pool, adj);
318 }
319 
320 u32
322 {
323  ip_adjacency_t *adj;
324 
325  adj = adj_get(dpo->dpoi_index);
326 
327  return (adj->rewrite_header.sw_if_index);
328 }
329 
330 void
332 {
333  ip_adjacency_t *adj;
334 
335  if (adj_index_is_special(adj_index))
336  {
337  return;
338  }
339 
340  adj = adj_get(adj_index);
341  ASSERT(adj);
342 
343  ADJ_DBG(adj, "lock");
344  fib_node_lock(&adj->ia_node);
345 }
346 
347 void
349 {
350  ip_adjacency_t *adj;
351 
352  if (adj_index_is_special(adj_index))
353  {
354  return;
355  }
356 
357  adj = adj_get(adj_index);
358  ASSERT(adj);
359 
360  ADJ_DBG(adj, "unlock");
361  ASSERT(adj);
362 
363  fib_node_unlock(&adj->ia_node);
364 }
365 
366 u32
368  fib_node_type_t child_type,
369  fib_node_index_t child_index)
370 {
371  ASSERT(ADJ_INDEX_INVALID != adj_index);
372  if (adj_index_is_special(adj_index))
373  {
374  return (~0);
375  }
376 
378  adj_index,
379  child_type,
380  child_index));
381 }
382 
383 void
385  u32 sibling_index)
386 {
387  if (adj_index_is_special(adj_index))
388  {
389  return;
390  }
391 
393  adj_index,
394  sibling_index);
395 }
396 
397 /*
398  * Context for the walk to update the cached feature flags.
399  */
400 typedef struct adj_feature_update_t_
401 {
405 
406 static adj_walk_rc_t
408  void *arg)
409 {
411  ip_adjacency_t *adj;
412 
413  adj = adj_get(ai);
414 
415  /*
416  * this ugly mess matches the feature arc that is changing with affected
417  * adjacencies
418  */
420  (VNET_LINK_IP6 == adj->ia_link)) ||
422  (VNET_LINK_IP4 == adj->ia_link)) ||
424  (VNET_LINK_MPLS == adj->ia_link)))
425  {
428 
429  cm = &fm->feature_config_mains[ctx->arc];
430 
431  if (ctx->enable)
432  adj->rewrite_header.flags |= VNET_REWRITE_HAS_FEATURES;
433  else
434  adj->rewrite_header.flags &= ~VNET_REWRITE_HAS_FEATURES;
435 
437  adj->rewrite_header.sw_if_index);
438  }
439  return (ADJ_WALK_RC_CONTINUE);
440 }
441 
442 static void
444  u8 arc_index,
445  u8 is_enable,
446  void *data)
447 {
448  /*
449  * Walk all the adjacencies on the interface to update the cached
450  * 'has-features' flag
451  */
453  .arc = arc_index,
454  .enable = is_enable,
455  };
456  adj_walk (sw_if_index, adj_feature_update_walk_cb, &ctx);
457 }
458 
459 static adj_walk_rc_t
461  void *arg)
462 {
463  ip_adjacency_t *adj;
464 
465  adj = adj_get(ai);
466 
468  &adj->rewrite_header);
469 
470  return (ADJ_WALK_RC_CONTINUE);
471 }
472 
473 static clib_error_t *
475 {
476  adj_walk (sw_if_index, adj_mtu_update_walk_cb, NULL);
477 
478  return (NULL);
479 }
480 
482 
483 /**
484  * @brief Walk the Adjacencies on a given interface
485  */
486 void
488  adj_walk_cb_t cb,
489  void *ctx)
490 {
491  /*
492  * walk all the neighbor adjacencies
493  */
495 
497  {
498  adj_nbr_walk(sw_if_index, proto, cb, ctx);
499  adj_mcast_walk(sw_if_index, proto, cb, ctx);
500  }
501 }
502 
503 /**
504  * @brief Return the link type of the adjacency
505  */
508 {
509  const ip_adjacency_t *adj;
510 
511  adj = adj_get(ai);
512 
513  return (adj->ia_link);
514 }
515 
516 /**
517  * @brief Return the sw interface index of the adjacency.
518  */
519 u32
521 {
522  const ip_adjacency_t *adj;
523 
524  adj = adj_get(ai);
525 
526  return (adj->rewrite_header.sw_if_index);
527 }
528 
529 /**
530  * @brief Return true if the adjacency is 'UP', i.e. can be used for forwarding
531  * 0 is down, !0 is up.
532  */
533 int
535 {
536  return (adj_bfd_is_up(ai));
537 }
538 
539 /**
540  * @brief Return the rewrite string of the adjacency
541  */
542 const u8*
544 {
546  ip_adjacency_t *adj;
547 
548  adj = adj_get(ai);
549  rw = &adj->rewrite_header;
550 
551  ASSERT (rw->data_bytes != 0xfefe);
552 
553  return (rw->data - rw->data_bytes);
554 }
555 
556 static fib_node_t *
558 {
559  ip_adjacency_t *adj;
560 
561  adj = adj_get(index);
562 
563  return (&adj->ia_node);
564 }
565 
566 #define ADJ_FROM_NODE(_node) \
567  ((ip_adjacency_t*)((char*)_node - STRUCT_OFFSET_OF(ip_adjacency_t, ia_node)))
568 
569 static void
571 {
573 }
574 
578 {
579  ip_adjacency_t *adj;
580 
581  adj = ADJ_FROM_NODE(node);
582 
583  switch (adj->lookup_next_index)
584  {
587  break;
588  case IP_LOOKUP_NEXT_ARP:
594  case IP_LOOKUP_NEXT_DROP:
595  case IP_LOOKUP_NEXT_PUNT:
598  case IP_LOOKUP_N_NEXT:
599  /*
600  * Que pasa. yo soj en el final!
601  */
602  ASSERT(0);
603  break;
604  }
605 
607 }
608 
609 /*
610  * Adjacency's graph node virtual function table
611  */
612 static const fib_node_vft_t adj_vft = {
614  .fnv_last_lock = adj_node_last_lock_gone,
615  .fnv_back_walk = adj_back_walk_notify,
616 };
617 
618 static clib_error_t *
620 {
622 
627 
629 
630  return (NULL);
631 }
632 
634 
635 static clib_error_t *
637  unformat_input_t * input,
638  vlib_cli_command_t * cmd)
639 {
641  u32 sw_if_index = ~0;
642  int summary = 0;
643 
645  {
646  if (unformat (input, "%d", &ai))
647  ;
648  else if (unformat (input, "summary") || unformat (input, "sum"))
649  summary = 1;
650  else if (unformat (input, "%U",
652  &sw_if_index))
653  ;
654  else
655  break;
656  }
657 
658  if (summary)
659  {
660  vlib_cli_output (vm, "Number of adjacencies: %d", pool_elts(adj_pool));
661  vlib_cli_output (vm, "Per-adjacency counters: %s",
663  "enabled":
664  "disabled"));
665  }
666  else
667  {
668  if (ADJ_INDEX_INVALID != ai)
669  {
670  if (pool_is_free_index(adj_pool, ai))
671  {
672  vlib_cli_output (vm, "adjacency %d invalid", ai);
673  return 0;
674  }
675 
676  vlib_cli_output (vm, "[@%d] %U",
677  ai,
680  }
681  else
682  {
683  /* *INDENT-OFF* */
684  pool_foreach_index(ai, adj_pool,
685  ({
686  if (~0 != sw_if_index &&
687  sw_if_index != adj_get_sw_if_index(ai))
688  {
689  }
690  else
691  {
692  vlib_cli_output (vm, "[@%d] %U",
693  ai,
696  }
697  }));
698  /* *INDENT-ON* */
699  }
700  }
701  return 0;
702 }
703 
704 /*?
705  * Show all adjacencies.
706  * @cliexpar
707  * @cliexstart{sh adj}
708  * [@0]
709  * [@1] glean: loop0
710  * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
711  * [@3] mpls via 1.0.0.2 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
712  * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
713  * [@5] mpls via 1.0.0.3 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
714  * @cliexend
715  ?*/
716 VLIB_CLI_COMMAND (adj_show_command, static) = {
717  .path = "show adj",
718  .short_help = "show adj [<adj_index>] [interface] [summary]",
719  .function = adj_show,
720 };
721 
722 /**
723  * @brief CLI invoked function to enable/disable per-adj counters
724  */
725 static clib_error_t *
727  unformat_input_t * input,
728  vlib_cli_command_t * cmd)
729 {
730  clib_error_t *error = NULL;
731  int enable = ~0;
732 
734  {
735  if (unformat (input, "enable"))
736  enable = 1;
737  else if (unformat (input, "disable"))
738  enable = 0;
739  else
740  break;
741  }
742 
743  if (enable != ~0)
744  {
745  /* user requested something sensible */
747  }
748  else
749  {
750  error = clib_error_return (0, "specify 'enable' or 'disable'");
751  }
752 
753  return (error);
754 }
755 
756 /*?
757  * Enable/disable per-adjacency counters. This is optional because it comes
758  * with a non-negligible performance cost.
759  ?*/
760 VLIB_CLI_COMMAND (adj_cli_counters_set_command, static) = {
761  .path = "adjacency counters",
762  .short_help = "adjacency counters [enable|disable]",
763  .function = adj_cli_counters_set,
764 };
void vnet_feature_register(vnet_feature_update_cb_t cb, void *data)
Definition: feature.c:29
void adj_glean_remove(fib_protocol_t proto, u32 sw_if_index)
Definition: adj_glean.c:133
void adj_delegate_adj_deleted(ip_adjacency_t *adj)
Definition: adj_delegate.c:142
adj_flags_t ia_flags
Flags on the adjacency 1-bytes.
Definition: adj.h:348
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:354
vl_api_wireguard_peer_flags_t flags
Definition: wireguard.api:103
u8 * format_adj_nbr(u8 *s, va_list *ap)
Format a neigbour (REWRITE) adjacency.
Definition: adj_nbr.c:1015
static int adj_index_is_special(adj_index_t adj_index)
Definition: adj.c:119
void adj_lock(adj_index_t adj_index)
Take a reference counting lock on the adjacency.
Definition: adj.c:331
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:543
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:507
clib_memset(h->entries, 0, sizeof(h->entries[0]) *entries)
Broadcast Adjacency.
Definition: adj.h:85
IP unicast adjacency.
Definition: adj.h:227
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:249
#define pool_get_aligned_will_expand(P, YESNO, A)
See if pool_get will expand the pool or not.
Definition: pool.h:258
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:108
vlib_main_t * vm
Definition: in2out_ed.c:1582
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:996
void adj_child_remove(adj_index_t adj_index, u32 sibling_index)
Remove a child dependent.
Definition: adj.c:384
u32 adj_dpo_get_urpf(const dpo_id_t *dpo)
Definition: adj.c:321
unsigned char u8
Definition: types.h:56
#define ADJ_ATTR_NAMES
Definition: adj.h:190
u8 data[128]
Definition: ipsec_types.api:89
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:205
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:335
#define fm
Adjacency to punt this packet.
Definition: adj.h:55
u8 output_feature_arc_index
Definition: lookup.h:169
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
Definition: adj.h:459
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:173
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:316
#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:348
int adj_bfd_is_up(adj_index_t ai)
Definition: adj_bfd.c:239
unsigned int u32
Definition: types.h:88
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:726
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:85
u8 output_feature_arc_index
Definition: mpls.h:57
struct ip_adjacency_t_::@149::@151 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
union ip_adjacency_t_::@149 sub_type
#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
vnet_crypto_main_t * cm
Definition: quic_crypto.c:53
#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:534
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:520
vl_api_ip_proto_t proto
Definition: acl_types.api:50
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:763
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:645
static adj_index_t adj_get_index(const ip_adjacency_t *adj)
Get a pointer to an adjacency object from its index.
Definition: adj_internal.h:101
struct _unformat_input_t unformat_input_t
#define ADJ_FROM_NODE(_node)
Definition: adj.c:566
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:302
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
#define always_inline
Definition: ipsec.h:28
ip6_main_t ip6_main
Definition: ip6_forward.c:2781
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:576
An node in the FIB graph.
Definition: fib_node.h:295
void adj_nbr_module_init(void)
Module initialisation.
Definition: adj_nbr.c:1125
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:235
void adj_mcast_remove(fib_protocol_t proto, u32 sw_if_index)
Definition: adj_mcast.c:180
u8 * format_adj_flags(u8 *s, va_list *args)
Format adjacency flags.
Definition: adj.c:128
void adj_glean_module_init(void)
Module initialisation.
Definition: adj_glean.c:324
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P with alignment A.
Definition: pool.h:246
static clib_error_t * adj_show(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: adj.c:636
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:224
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
static void adj_last_lock_gone(ip_adjacency_t *adj)
Definition: adj.c:262
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:380
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:265
static clib_error_t * adj_mtu_update(vnet_main_t *vnm, u32 sw_if_index, u32 flags)
Definition: adj.c:474
void adj_mcast_module_init(void)
Module initialisation.
Definition: adj_mcast.c:477
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:460
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:299
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:331
void adj_nbr_walk(u32 sw_if_index, fib_protocol_t adj_nh_proto, adj_walk_cb_t cb, void *ctx)
Walk all adjacencies on a link for a given next-hop protocol.
Definition: adj_nbr.c:571
vlib_main_t vlib_node_runtime_t * node
Definition: in2out_ed.c:1582
Context passed between object during a back walk.
Definition: fib_node.h:208
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:158
void adj_walk(u32 sw_if_index, adj_walk_cb_t cb, void *ctx)
Walk the Adjacencies on a given interface.
Definition: adj.c:487
u8 * format_adj_midchain(u8 *s, va_list *ap)
Format a midchain adjacency.
Definition: adj_midchain.c:672
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)
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:696
static fib_node_t * adj_get_node(fib_node_index_t index)
Definition: adj.c:557
ip_lookup_main_t lookup_main
Definition: ip6.h:181
enum vnet_link_t_ vnet_link_t
Link Type: A description of the protocol of packets on the link.
struct ip_adjacency_t_::@149::@150 nbr
IP_LOOKUP_NEXT_ARP/IP_LOOKUP_NEXT_REWRITE.
u32 ia_cfg_index
feature [arc] config index
Definition: adj.h:239
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:198
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.
#define vec_elt(v, i)
Get vector value at index i.
u8 * adj_delegate_format(u8 *s, ip_adjacency_t *adj)
Definition: adj_delegate.c:172
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:342
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:329
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:367
u8 * format_ip_adjacency(u8 *s, va_list *args)
Pretty print helper function for formatting specific adjacencies.
Definition: adj.c:158
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
u32 index
Definition: flow_types.api:221
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:465
static void adj_node_last_lock_gone(fib_node_t *node)
Definition: adj.c:570
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:1554
ip4_main_t ip4_main
Global ip4 main structure.
Definition: ip4_forward.c:1144
void adj_midchain_teardown(ip_adjacency_t *adj)
adj_midchain_setup
Definition: adj_midchain.c:357
static clib_error_t * adj_module_init(vlib_main_t *vm)
Definition: adj.c:619
#define pool_foreach_index(i, v, body)
Iterate pool by index.
Definition: pool.h:558
vnet_feature_config_main_t * feature_config_mains
feature config main objects
Definition: feature.h:100
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
vnet_feature_main_t feature_main
Definition: feature.c:18
static void adj_feature_update(u32 sw_if_index, u8 arc_index, u8 is_enable, void *data)
Definition: adj.c:443
static adj_walk_rc_t adj_feature_update_walk_cb(adj_index_t ai, void *arg)
Definition: adj.c:407
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:474
vl_api_interface_index_t sw_if_index
Definition: wireguard.api:33
uword unformat(unformat_input_t *i, const char *fmt,...)
Definition: unformat.c:978
static uword unformat_check_input(unformat_input_t *i)
Definition: format.h:171
struct adj_delegate_t_ * ia_delegates
A sorted vector of delegates.
Definition: adj.h:317
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