FD.io VPP  v21.06
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 #include <vnet/fib/fib_walk.h>
24 
25 /* Adjacency packet/byte counters indexed by adjacency index. */
26 vlib_combined_counter_main_t adjacency_counters = {
27  .name = "adjacency",
28  .stat_segment_name = "/net/adjacency",
29 };
30 
31 /*
32  * the single adj pool
33  */
35 
36 /**
37  * @brief Global Config for enabling per-adjacency counters.
38  * By default these are disabled.
39  */
41 
42 const ip46_address_t ADJ_BCAST_ADDR = {
43  .ip6 = {
44  .as_u64[0] = 0xffffffffffffffff,
45  .as_u64[1] = 0xffffffffffffffff,
46  },
47 };
48 
49 /**
50  * Adj flag names
51  */
52 static const char *adj_attr_names[] = ADJ_ATTR_NAMES;
53 
54 always_inline void
56 {
57  if (CLIB_DEBUG > 0)
58  {
59  clib_memset (adj, 0xfe, sizeof (adj[0]));
60  }
61 }
62 
65 {
66  ip_adjacency_t *adj;
67  u8 need_barrier_sync = 0;
68  vlib_main_t *vm;
69  vm = vlib_get_main();
70 
71  ASSERT (vm->thread_index == 0);
72 
73  pool_get_aligned_will_expand (adj_pool, need_barrier_sync,
75  /* If the adj_pool will expand, stop the parade. */
76  if (need_barrier_sync)
78 
80 
81  adj_poison(adj);
82 
83  /* Validate adjacency counters. */
84  if (need_barrier_sync == 0)
85  {
86  /* If the adj counter pool will expand, stop the parade */
88  (&adjacency_counters, adj_get_index (adj));
89  if (need_barrier_sync)
91  }
92  vlib_validate_combined_counter(&adjacency_counters,
93  adj_get_index(adj));
94 
95  /* Make sure certain fields are always initialized. */
96  vlib_zero_combined_counter(&adjacency_counters,
97  adj_get_index(adj));
98  fib_node_init(&adj->ia_node,
100 
101  adj->ia_nh_proto = proto;
102  adj->ia_flags = 0;
103  adj->ia_cfg_index = 0;
104  adj->rewrite_header.sw_if_index = ~0;
105  adj->rewrite_header.flags = 0;
106  adj->lookup_next_index = 0;
107  adj->ia_delegates = NULL;
108 
109  /* lest it become a midchain in the future */
110  clib_memset(&adj->sub_type.midchain.next_dpo, 0,
111  sizeof(adj->sub_type.midchain.next_dpo));
112 
113  if (need_barrier_sync)
115 
116  return (adj);
117 }
118 
119 static int
121 {
122  if (ADJ_INDEX_INVALID == adj_index)
123  return (!0);
124 
125  return (0);
126 }
127 
128 u8*
129 format_adj_flags (u8 * s, va_list * args)
130 {
131  adj_flags_t af;
132  adj_attr_t at;
133 
134  af = va_arg (*args, int);
135 
136  if (ADJ_FLAG_NONE == af)
137  {
138  return (format(s, "None"));
139  }
141  {
142  if (af & (1 << at))
143  {
144  s = format(s, "%s ", adj_attr_names[at]);
145  }
146  }
147  return (s);
148 }
149 
150 /**
151  * @brief Pretty print helper function for formatting specific adjacencies.
152  * @param s - input string to format
153  * @param args - other args passed to format function such as:
154  * - vnet_main_t
155  * - ip_lookup_main_t
156  * - adj_index
157  */
158 u8 *
159 format_ip_adjacency (u8 * s, va_list * args)
160 {
162  ip_adjacency_t * adj;
163  u32 adj_index;
164 
165  adj_index = va_arg (*args, u32);
166  fiaf = va_arg (*args, format_ip_adjacency_flags_t);
167 
168  if (!adj_is_valid(adj_index))
169  return format(s, "<invalid adjacency>");
170 
171  adj = adj_get(adj_index);
172 
173  switch (adj->lookup_next_index)
174  {
177  s = format (s, "%U", format_adj_nbr, adj_index, 0);
178  break;
179  case IP_LOOKUP_NEXT_ARP:
180  s = format (s, "%U", format_adj_nbr_incomplete, adj_index, 0);
181  break;
183  s = format (s, "%U", format_adj_glean, adj_index, 0);
184  break;
186  s = format (s, "%U", format_adj_midchain, adj_index, 2);
187  break;
189  s = format (s, "%U", format_adj_mcast, adj_index, 0);
190  break;
192  s = format (s, "%U", format_adj_mcast_midchain, adj_index, 0);
193  break;
194  case IP_LOOKUP_NEXT_DROP:
195  case IP_LOOKUP_NEXT_PUNT:
198  case IP_LOOKUP_N_NEXT:
199  break;
200  }
201 
202  if (fiaf & FORMAT_IP_ADJACENCY_DETAIL)
203  {
204  vlib_counter_t counts;
205 
206  vlib_get_combined_counter(&adjacency_counters, adj_index, &counts);
207  s = format (s, "\n flags:%U", format_adj_flags, adj->ia_flags);
208  s = format (s, "\n counts:[%Ld:%Ld]", counts.packets, counts.bytes);
209  s = format (s, "\n locks:%d", adj->ia_node.fn_locks);
210  s = format(s, "\n delegates:");
211  s = adj_delegate_format(s, adj);
212 
213  s = format(s, "\n children:");
215  {
216  s = format(s, "\n ");
218  }
219  }
220 
221  return s;
222 }
223 
224 int
226  fib_node_index_t **entry_indicies)
227 {
228  ip_adjacency_t * adj;
229 
230  adj = adj_get(ai);
231 
232  switch (adj->lookup_next_index)
233  {
235  case IP_LOOKUP_NEXT_ARP:
239  case IP_LOOKUP_NEXT_DROP:
240  case IP_LOOKUP_NEXT_PUNT:
243  case IP_LOOKUP_N_NEXT:
244  /*
245  * these adjacency types are terminal graph nodes, so there's no
246  * possibility of a loop down here.
247  */
248  break;
251  return (adj_ndr_midchain_recursive_loop_detect(ai, entry_indicies));
252  }
253 
254  return (0);
255 }
256 
257 /*
258  * adj_last_lock_gone
259  *
260  * last lock/reference to the adj has gone, we no longer need it.
261  */
262 static void
264 {
266 
268  ADJ_DBG(adj, "last-lock-gone");
269 
271 
273 
274  switch (adj->lookup_next_index)
275  {
278  /* FALL THROUGH */
279  case IP_LOOKUP_NEXT_ARP:
282  /*
283  * complete and incomplete nbr adjs
284  */
286  adj->ia_nh_proto,
287  adj->ia_link,
288  &adj->sub_type.nbr.next_hop,
289  adj->rewrite_header.sw_if_index);
290  break;
292  adj_glean_remove(adj);
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 u16
332 {
333  ip_adjacency_t *adj;
334 
335  adj = adj_get(dpo->dpoi_index);
336 
337  return (adj->rewrite_header.max_l3_packet_bytes);
338 }
339 
340 void
342 {
343  ip_adjacency_t *adj;
344 
345  if (adj_index_is_special(adj_index))
346  {
347  return;
348  }
349 
350  adj = adj_get(adj_index);
351  ASSERT(adj);
352 
353  ADJ_DBG(adj, "lock");
354  fib_node_lock(&adj->ia_node);
355 }
356 
357 void
359 {
360  ip_adjacency_t *adj;
361 
362  if (adj_index_is_special(adj_index))
363  {
364  return;
365  }
366 
367  adj = adj_get(adj_index);
368  ASSERT(adj);
369 
370  ADJ_DBG(adj, "unlock");
371  ASSERT(adj);
372 
373  fib_node_unlock(&adj->ia_node);
374 }
375 
376 u32
378  fib_node_type_t child_type,
379  fib_node_index_t child_index)
380 {
381  ASSERT(ADJ_INDEX_INVALID != adj_index);
382  if (adj_index_is_special(adj_index))
383  {
384  return (~0);
385  }
386 
388  adj_index,
389  child_type,
390  child_index));
391 }
392 
393 void
395  u32 sibling_index)
396 {
397  if (adj_index_is_special(adj_index))
398  {
399  return;
400  }
401 
403  adj_index,
404  sibling_index);
405 }
406 
407 /*
408  * Context for the walk to update the cached feature flags.
409  */
410 typedef struct adj_feature_update_t_
411 {
415 
416 static adj_walk_rc_t
418  void *arg)
419 {
421  ip_adjacency_t *adj;
422 
423  adj = adj_get(ai);
424 
425  /*
426  * this ugly mess matches the feature arc that is changing with affected
427  * adjacencies
428  */
430  (VNET_LINK_IP6 == adj->ia_link)) ||
432  (VNET_LINK_IP4 == adj->ia_link)) ||
434  (VNET_LINK_MPLS == adj->ia_link)))
435  {
438 
439  cm = &fm->feature_config_mains[ctx->arc];
440 
441  if (ctx->enable)
442  adj->rewrite_header.flags |= VNET_REWRITE_HAS_FEATURES;
443  else
444  adj->rewrite_header.flags &= ~VNET_REWRITE_HAS_FEATURES;
445 
447  adj->rewrite_header.sw_if_index);
448  }
449  return (ADJ_WALK_RC_CONTINUE);
450 }
451 
452 static void
454  u8 arc_index,
455  u8 is_enable,
456  void *data)
457 {
458  /*
459  * Walk all the adjacencies on the interface to update the cached
460  * 'has-features' flag
461  */
463  .arc = arc_index,
464  .enable = is_enable,
465  };
466  adj_walk (sw_if_index, adj_feature_update_walk_cb, &ctx);
467 }
468 
469 static adj_walk_rc_t
471  void *arg)
472 {
473  ip_adjacency_t *adj;
474 
475  adj = adj_get(ai);
476 
478  &adj->rewrite_header);
480 
481  /**
482  * Backwalk to all Path MTU trackers, casual like ..
483  */
484  {
485  fib_node_back_walk_ctx_t bw_ctx = {
487  };
488 
490  FIB_WALK_PRIORITY_LOW, &bw_ctx);
491  }
492 
493  return (ADJ_WALK_RC_CONTINUE);
494 }
495 
496 static clib_error_t *
498 {
499  adj_walk (sw_if_index, adj_mtu_update_walk_cb, NULL);
500 
501  return (NULL);
502 }
503 
505 
506 /**
507  * @brief Walk the Adjacencies on a given interface
508  */
509 void
511  adj_walk_cb_t cb,
512  void *ctx)
513 {
514  /*
515  * walk all the neighbor adjacencies
516  */
518 
520  {
521  adj_nbr_walk(sw_if_index, proto, cb, ctx);
522  adj_mcast_walk(sw_if_index, proto, cb, ctx);
523  }
524 }
525 
526 /**
527  * @brief Return the link type of the adjacency
528  */
531 {
532  const ip_adjacency_t *adj;
533 
534  adj = adj_get(ai);
535 
536  return (adj->ia_link);
537 }
538 
539 /**
540  * @brief Return the sw interface index of the adjacency.
541  */
542 u32
544 {
545  const ip_adjacency_t *adj;
546 
547  adj = adj_get(ai);
548 
549  return (adj->rewrite_header.sw_if_index);
550 }
551 
552 /**
553  * @brief Return true if the adjacency is 'UP', i.e. can be used for forwarding
554  * 0 is down, !0 is up.
555  */
556 int
558 {
559  return (adj_bfd_is_up(ai));
560 }
561 
562 /**
563  * @brief Return the rewrite string of the adjacency
564  */
565 const u8*
567 {
569  ip_adjacency_t *adj;
570 
571  adj = adj_get(ai);
572  rw = &adj->rewrite_header;
573 
574  ASSERT (rw->data_bytes != 0xfefe);
575 
576  return (rw->data - rw->data_bytes);
577 }
578 
579 static fib_node_t *
581 {
582  ip_adjacency_t *adj;
583 
584  adj = adj_get(index);
585 
586  return (&adj->ia_node);
587 }
588 
589 #define ADJ_FROM_NODE(_node) \
590  ((ip_adjacency_t*)((char*)_node - STRUCT_OFFSET_OF(ip_adjacency_t, ia_node)))
591 
592 static void
594 {
596 }
597 
601 {
602  ip_adjacency_t *adj;
603 
604  adj = ADJ_FROM_NODE(node);
605 
606  switch (adj->lookup_next_index)
607  {
610  break;
611  case IP_LOOKUP_NEXT_ARP:
617  case IP_LOOKUP_NEXT_DROP:
618  case IP_LOOKUP_NEXT_PUNT:
621  case IP_LOOKUP_N_NEXT:
622  /*
623  * Que pasa. yo soj en el final!
624  */
625  ASSERT(0);
626  break;
627  }
628 
630 }
631 
632 /*
633  * Adjacency's graph node virtual function table
634  */
635 static const fib_node_vft_t adj_vft = {
637  .fnv_last_lock = adj_node_last_lock_gone,
638  .fnv_back_walk = adj_back_walk_notify,
639 };
640 
641 static clib_error_t *
643 {
645 
650 
652 
653  return (NULL);
654 }
655 
657 
658 static clib_error_t *
660  unformat_input_t * input,
661  vlib_cli_command_t * cmd)
662 {
664  u32 sw_if_index = ~0;
665  int summary = 0;
666 
668  {
669  if (unformat (input, "%d", &ai))
670  ;
671  else if (unformat (input, "summary") || unformat (input, "sum"))
672  summary = 1;
673  else if (unformat (input, "%U",
675  &sw_if_index))
676  ;
677  else
678  break;
679  }
680 
681  if (summary)
682  {
683  vlib_cli_output (vm, "Number of adjacencies: %d", pool_elts(adj_pool));
684  vlib_cli_output (vm, "Per-adjacency counters: %s",
686  "enabled":
687  "disabled"));
688  }
689  else
690  {
691  if (ADJ_INDEX_INVALID != ai)
692  {
693  if (pool_is_free_index(adj_pool, ai))
694  {
695  vlib_cli_output (vm, "adjacency %d invalid", ai);
696  return 0;
697  }
698 
699  vlib_cli_output (vm, "[@%d] %U",
700  ai,
703  }
704  else
705  {
706  /* *INDENT-OFF* */
707  pool_foreach_index (ai, adj_pool)
708  {
709  if (~0 != sw_if_index &&
710  sw_if_index != adj_get_sw_if_index(ai))
711  {
712  }
713  else
714  {
715  vlib_cli_output (vm, "[@%d] %U",
716  ai,
719  }
720  }
721  /* *INDENT-ON* */
722  }
723  }
724  return 0;
725 }
726 
727 /*?
728  * Show all adjacencies.
729  * @cliexpar
730  * @cliexstart{sh adj}
731  * [@0]
732  * [@1] glean: loop0
733  * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
734  * [@3] mpls via 1.0.0.2 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
735  * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
736  * [@5] mpls via 1.0.0.3 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
737  * @cliexend
738  ?*/
739 VLIB_CLI_COMMAND (adj_show_command, static) = {
740  .path = "show adj",
741  .short_help = "show adj [<adj_index>] [interface] [summary]",
742  .function = adj_show,
743 };
744 
745 /**
746  * @brief CLI invoked function to enable/disable per-adj counters
747  */
748 static clib_error_t *
750  unformat_input_t * input,
751  vlib_cli_command_t * cmd)
752 {
753  clib_error_t *error = NULL;
754  int enable = ~0;
755 
757  {
758  if (unformat (input, "enable"))
759  enable = 1;
760  else if (unformat (input, "disable"))
761  enable = 0;
762  else
763  break;
764  }
765 
766  if (enable != ~0)
767  {
768  /* user requested something sensible */
770  }
771  else
772  {
773  error = clib_error_return (0, "specify 'enable' or 'disable'");
774  }
775 
776  return (error);
777 }
778 
779 /*?
780  * Enable/disable per-adjacency counters. This is optional because it comes
781  * with a non-negligible performance cost.
782  ?*/
783 VLIB_CLI_COMMAND (adj_cli_counters_set_command, static) = {
784  .path = "adjacency counters",
785  .short_help = "adjacency counters [enable|disable]",
786  .function = adj_cli_counters_set,
787 };
void vnet_feature_register(vnet_feature_update_cb_t cb, void *data)
Definition: feature.c:29
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:356
ip_adjacency_t * adj_pool
The global adjacency pool.
Definition: adj.c:34
#define pool_foreach_index(i, v)
Definition: pool.h:576
void vlib_validate_combined_counter(vlib_combined_counter_main_t *cm, u32 index)
validate a combined counter
Definition: counter.c:119
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:105
u8 * format_adj_nbr(u8 *s, va_list *ap)
Format a neigbour (REWRITE) adjacency.
Definition: adj_nbr.c:1039
static int adj_index_is_special(adj_index_t adj_index)
Definition: adj.c:120
void adj_lock(adj_index_t adj_index)
Take a reference counting lock on the adjacency.
Definition: adj.c:341
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:566
int vlib_validate_combined_counter_will_expand(vlib_combined_counter_main_t *cm, u32 index)
Definition: counter.c:146
u16 adj_dpo_get_mtu(const dpo_id_t *dpo)
Definition: adj.c:331
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:530
vnet_feature_config_main_t * cm
clib_memset(h->entries, 0, sizeof(h->entries[0]) *entries)
Broadcast Adjacency.
Definition: adj.h:85
IP unicast adjacency.
Definition: adj.h:235
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:213
#define pool_get_aligned_will_expand(P, YESNO, A)
See if pool_get will expand the pool or not.
Definition: pool.h:261
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:109
void fib_walk_async(fib_node_type_t parent_type, fib_node_index_t parent_index, fib_walk_priority_t prio, fib_node_back_walk_ctx_t *ctx)
Definition: fib_walk.c:688
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:1020
void adj_child_remove(adj_index_t adj_index, u32 sibling_index)
Remove a child dependent.
Definition: adj.c:394
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:196
u8 data[128]
Definition: ipsec_types.api:92
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:194
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:343
unsigned int u32
Definition: types.h:88
Adjacency to punt this packet.
Definition: adj.h:55
u8 output_feature_arc_index
Definition: lookup.h:145
vnet_feature_main_t * fm
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
Definition: adj.h:470
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:172
enum adj_walk_rc_t_ adj_walk_rc_t
return codes from a adjacency walker callback function
description fragment has unexpected format
Definition: map.api:433
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
vnet_main_t * vnet_get_main(void)
void adj_unlock(adj_index_t adj_index)
Release a reference counting lock on the adjacency.
Definition: adj.c:358
int adj_bfd_is_up(adj_index_t ai)
Definition: adj_bfd.c:239
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:749
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
union ip_adjacency_t_::@144 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:172
fib_node_bw_reason_flag_t fnbw_reason
The reason/trigger for the backwalk.
Definition: fib_node.h:218
Definition: cJSON.c:88
#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:298
vl_api_interface_index_t sw_if_index
Definition: wireguard.api:34
int adj_is_up(adj_index_t ai)
Return true if the adjacency is &#39;UP&#39;, i.e.
Definition: adj.c:557
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:543
vl_api_ip_proto_t proto
Definition: acl_types.api:51
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:566
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:447
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:109
struct _unformat_input_t unformat_input_t
unsigned short u16
Definition: types.h:57
#define ADJ_FROM_NODE(_node)
Definition: adj.c:589
struct ip_adjacency_t_::@144::@146 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
void adj_delegate_adj_modified(ip_adjacency_t *adj)
Definition: adj_delegate.c:128
void adj_glean_remove(ip_adjacency_t *adj)
Definition: adj_glean.c:307
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:305
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
ip6_main_t ip6_main
Definition: ip6_forward.c:2787
vlib_main_t * vm
X-connect all packets from the HOST to the PHY.
Definition: nat44_ei.c:3047
int adj_per_adj_counters
Global Config for enabling per-adjacency counters.
Definition: adj.c:40
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:599
An node in the FIB graph.
Definition: fib_node.h:301
void adj_nbr_module_init(void)
Module initialisation.
Definition: adj_nbr.c:1151
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:243
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:129
void adj_glean_module_init(void)
Module initialisation.
Definition: adj_glean.c:509
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P with alignment A.
Definition: pool.h:249
static clib_error_t * adj_show(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: adj.c:659
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:137
fib_node_list_t fn_children
Vector of nodes that depend upon/use/share this node.
Definition: fib_node.h:315
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:225
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:272
static void adj_last_lock_gone(ip_adjacency_t *adj)
Definition: adj.c:263
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:395
u32 index
Definition: flow_types.api:221
Multicast Midchain Adjacency.
Definition: adj.h:89
fib_node_get_t fnv_get
Definition: fib_node.h:289
u8 * format_adj_glean(u8 *s, va_list *ap)
Format/display a glean adjacency.
Definition: adj_glean.c:429
static clib_error_t * adj_mtu_update(vnet_main_t *vnm, u32 sw_if_index, u32 flags)
Definition: adj.c:497
vnet_feature_main_t feature_main
void adj_mcast_module_init(void)
Module initialisation.
Definition: adj_mcast.c:479
u32 fib_node_index_t
A typedef of a node index.
Definition: fib_types.h:29
static adj_walk_rc_t adj_mtu_update_walk_cb(adj_index_t ai, void *arg)
Definition: adj.c:470
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:55
#define pool_is_free_index(P, I)
Use free bitmap to query whether given index is free.
Definition: pool.h:302
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:592
Context passed between object during a back walk.
Definition: fib_node.h:214
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:163
void adj_walk(u32 sw_if_index, adj_walk_cb_t cb, void *ctx)
Walk the Adjacencies on a given interface.
Definition: adj.c:510
u8 * format_adj_midchain(u8 *s, va_list *ap)
Format a midchain adjacency.
Definition: adj_midchain.c:474
This packets follow a mid-chain adjacency.
Definition: adj.h:76
static const char * adj_attr_names[]
Adj flag names.
Definition: adj.c:52
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:716
static fib_node_t * adj_get_node(fib_node_index_t index)
Definition: adj.c:580
ip_lookup_main_t lookup_main
Definition: ip6.h:112
enum vnet_link_t_ vnet_link_t
Link Type: A description of the protocol of packets on the link.
#define always_inline
Definition: rdma_mlx5dv.h:23
u32 ia_cfg_index
feature [arc] config index
Definition: adj.h:247
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
u8 arc_index
#define FOR_EACH_ADJ_ATTR(_attr)
Definition: adj.h:205
static vlib_main_t * vlib_get_main(void)
Definition: global_funcs.h:38
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:350
index_t dpoi_index
the index of objects of that type
Definition: dpo.h:190
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
vlib_main_t vlib_node_runtime_t * node
Definition: nat44_ei.c:3047
ip_lookup_next_t lookup_next_index
Next hop after ip4-lookup.
Definition: adj.h:337
u32 fn_locks
Number of dependents on this node.
Definition: fib_node.h:321
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:377
u8 * format_ip_adjacency(u8 *s, va_list *args)
Pretty print helper function for formatting specific adjacencies.
Definition: adj.c:159
ip_adjacency_t * adj_alloc(fib_protocol_t proto)
Definition: adj.c:64
char * name
The counter collection&#39;s name.
Definition: counter.h:206
A collection of combined counters.
Definition: counter.h:203
#define FOR_EACH_FIB_IP_PROTOCOL(_item)
Definition: fib_types.h:69
static int adj_is_valid(adj_index_t adj_index)
Definition: adj.h:476
static void adj_node_last_lock_gone(fib_node_t *node)
Definition: adj.c:593
A FIB graph nodes virtual function table.
Definition: fib_node.h:288
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:1386
ip4_main_t ip4_main
Global ip4 main structure.
Definition: ip4_forward.c:1105
void adj_midchain_teardown(ip_adjacency_t *adj)
adj_midchain_setup
Definition: adj_midchain.c:132
static clib_error_t * adj_module_init(vlib_main_t *vm)
Definition: adj.c:642
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:108
static void adj_feature_update(u32 sw_if_index, u8 arc_index, u8 is_enable, void *data)
Definition: adj.c:453
static adj_walk_rc_t adj_feature_update_walk_cb(adj_index_t ai, void *arg)
Definition: adj.c:417
struct ip_adjacency_t_::@144::@145 nbr
IP_LOOKUP_NEXT_ARP/IP_LOOKUP_NEXT_REWRITE.
const ip46_address_t ADJ_BCAST_ADDR
The special broadcast address (to construct a broadcast adjacency.
Definition: adj.c:42
static int adj_are_counters_enabled(void)
Get the global configuration option for enabling per-adj counters.
Definition: adj.h:485
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:163
struct adj_delegate_t_ * ia_delegates
A sorted vector of delegates.
Definition: adj.h:325
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:127