FD.io VPP  v20.01-48-g3e0dafb74
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 
68 
69  adj_poison(adj);
70 
71  /* Make sure certain fields are always initialized. */
72  /* Validate adjacency counters. */
73  vlib_validate_combined_counter(&adjacency_counters,
74  adj_get_index(adj));
75  vlib_zero_combined_counter(&adjacency_counters,
76  adj_get_index(adj));
77  fib_node_init(&adj->ia_node,
79 
80  adj->ia_nh_proto = proto;
81  adj->ia_flags = 0;
82  adj->rewrite_header.sw_if_index = ~0;
83  adj->rewrite_header.flags = 0;
84  adj->lookup_next_index = 0;
85  adj->ia_delegates = NULL;
86 
87  /* lest it become a midchain in the future */
88  clib_memset(&adj->sub_type.midchain.next_dpo, 0,
89  sizeof(adj->sub_type.midchain.next_dpo));
90 
91  return (adj);
92 }
93 
94 static int
96 {
97  if (ADJ_INDEX_INVALID == adj_index)
98  return (!0);
99 
100  return (0);
101 }
102 
103 u8*
104 format_adj_flags (u8 * s, va_list * args)
105 {
106  adj_flags_t af;
107  adj_attr_t at;
108 
109  af = va_arg (*args, int);
110 
111  if (ADJ_FLAG_NONE == af)
112  {
113  return (format(s, "None"));
114  }
116  {
117  if (af & (1 << at))
118  {
119  s = format(s, "%s ", adj_attr_names[at]);
120  }
121  }
122  return (s);
123 }
124 
125 /**
126  * @brief Pretty print helper function for formatting specific adjacencies.
127  * @param s - input string to format
128  * @param args - other args passed to format function such as:
129  * - vnet_main_t
130  * - ip_lookup_main_t
131  * - adj_index
132  */
133 u8 *
134 format_ip_adjacency (u8 * s, va_list * args)
135 {
137  ip_adjacency_t * adj;
138  u32 adj_index;
139 
140  adj_index = va_arg (*args, u32);
141  fiaf = va_arg (*args, format_ip_adjacency_flags_t);
142 
143  if (!adj_is_valid(adj_index))
144  return format(s, "<invalid adjacency>");
145 
146  adj = adj_get(adj_index);
147 
148  switch (adj->lookup_next_index)
149  {
152  s = format (s, "%U", format_adj_nbr, adj_index, 0);
153  break;
154  case IP_LOOKUP_NEXT_ARP:
155  s = format (s, "%U", format_adj_nbr_incomplete, adj_index, 0);
156  break;
158  s = format (s, "%U", format_adj_glean, adj_index, 0);
159  break;
161  s = format (s, "%U", format_adj_midchain, adj_index, 2);
162  break;
164  s = format (s, "%U", format_adj_mcast, adj_index, 0);
165  break;
167  s = format (s, "%U", format_adj_mcast_midchain, adj_index, 0);
168  break;
169  case IP_LOOKUP_NEXT_DROP:
170  case IP_LOOKUP_NEXT_PUNT:
173  case IP_LOOKUP_N_NEXT:
174  break;
175  }
176 
177  if (fiaf & FORMAT_IP_ADJACENCY_DETAIL)
178  {
179  vlib_counter_t counts;
180 
181  vlib_get_combined_counter(&adjacency_counters, adj_index, &counts);
182  s = format (s, "\n flags:%U", format_adj_flags, adj->ia_flags);
183  s = format (s, "\n counts:[%Ld:%Ld]", counts.packets, counts.bytes);
184  s = format (s, "\n locks:%d", adj->ia_node.fn_locks);
185  s = format(s, "\n delegates:\n ");
186  s = adj_delegate_format(s, adj);
187 
188  s = format(s, "\n children:");
190  {
191  s = format(s, "\n ");
193  }
194  }
195 
196  return s;
197 }
198 
199 int
201  fib_node_index_t **entry_indicies)
202 {
203  ip_adjacency_t * adj;
204 
205  adj = adj_get(ai);
206 
207  switch (adj->lookup_next_index)
208  {
210  case IP_LOOKUP_NEXT_ARP:
214  case IP_LOOKUP_NEXT_DROP:
215  case IP_LOOKUP_NEXT_PUNT:
218  case IP_LOOKUP_N_NEXT:
219  /*
220  * these adjacency types are terminal graph nodes, so there's no
221  * possibility of a loop down here.
222  */
223  break;
226  return (adj_ndr_midchain_recursive_loop_detect(ai, entry_indicies));
227  }
228 
229  return (0);
230 }
231 
232 /*
233  * adj_last_lock_gone
234  *
235  * last lock/reference to the adj has gone, we no longer need it.
236  */
237 static void
239 {
241 
243  ADJ_DBG(adj, "last-lock-gone");
244 
246 
248 
249  switch (adj->lookup_next_index)
250  {
253  /* FALL THROUGH */
254  case IP_LOOKUP_NEXT_ARP:
257  /*
258  * complete and incomplete nbr adjs
259  */
261  adj->ia_nh_proto,
262  adj->ia_link,
263  &adj->sub_type.nbr.next_hop,
264  adj->rewrite_header.sw_if_index);
265  break;
268  adj->rewrite_header.sw_if_index);
269  break;
272  /* FALL THROUGH */
275  adj->rewrite_header.sw_if_index);
276  break;
277  case IP_LOOKUP_NEXT_DROP:
278  case IP_LOOKUP_NEXT_PUNT:
281  case IP_LOOKUP_N_NEXT:
282  /*
283  * type not stored in any DB from which we need to remove it
284  */
285  break;
286  }
287 
289 
290  fib_node_deinit(&adj->ia_node);
291  ASSERT(0 == vec_len(adj->ia_delegates));
292  vec_free(adj->ia_delegates);
293  pool_put(adj_pool, adj);
294 }
295 
296 u32
298 {
299  ip_adjacency_t *adj;
300 
301  adj = adj_get(dpo->dpoi_index);
302 
303  return (adj->rewrite_header.sw_if_index);
304 }
305 
306 void
308 {
309  ip_adjacency_t *adj;
310 
311  if (adj_index_is_special(adj_index))
312  {
313  return;
314  }
315 
316  adj = adj_get(adj_index);
317  ASSERT(adj);
318 
319  ADJ_DBG(adj, "lock");
320  fib_node_lock(&adj->ia_node);
321 }
322 
323 void
325 {
326  ip_adjacency_t *adj;
327 
328  if (adj_index_is_special(adj_index))
329  {
330  return;
331  }
332 
333  adj = adj_get(adj_index);
334  ASSERT(adj);
335 
336  ADJ_DBG(adj, "unlock");
337  ASSERT(adj);
338 
339  fib_node_unlock(&adj->ia_node);
340 }
341 
342 u32
344  fib_node_type_t child_type,
345  fib_node_index_t child_index)
346 {
347  ASSERT(ADJ_INDEX_INVALID != adj_index);
348  if (adj_index_is_special(adj_index))
349  {
350  return (~0);
351  }
352 
354  adj_index,
355  child_type,
356  child_index));
357 }
358 
359 void
361  u32 sibling_index)
362 {
363  if (adj_index_is_special(adj_index))
364  {
365  return;
366  }
367 
369  adj_index,
370  sibling_index);
371 }
372 
373 /*
374  * Context for the walk to update the cached feature flags.
375  */
376 typedef struct adj_feature_update_t_
377 {
381 
382 static adj_walk_rc_t
384  void *arg)
385 {
387  ip_adjacency_t *adj;
388 
389  adj = adj_get(ai);
390 
391  /*
392  * this ugly mess matches the feature arc that is changing with affected
393  * adjacencies
394  */
396  (VNET_LINK_IP6 == adj->ia_link)) ||
398  (VNET_LINK_IP4 == adj->ia_link)) ||
400  (VNET_LINK_MPLS == adj->ia_link)))
401  {
402  if (ctx->enable)
403  adj->rewrite_header.flags |= VNET_REWRITE_HAS_FEATURES;
404  else
405  adj->rewrite_header.flags &= ~VNET_REWRITE_HAS_FEATURES;
406  }
407  return (ADJ_WALK_RC_CONTINUE);
408 }
409 
410 static void
412  u8 arc_index,
413  u8 is_enable,
414  void *data)
415 {
416  /*
417  * Walk all the adjacencies on the interface to update the cached
418  * 'has-features' flag
419  */
421  .arc = arc_index,
422  .enable = is_enable,
423  };
424  adj_walk (sw_if_index, adj_feature_update_walk_cb, &ctx);
425 }
426 
427 static adj_walk_rc_t
429  void *arg)
430 {
431  ip_adjacency_t *adj;
432 
433  adj = adj_get(ai);
434 
436  &adj->rewrite_header);
437 
438  return (ADJ_WALK_RC_CONTINUE);
439 }
440 
441 static clib_error_t *
443 {
444  adj_walk (sw_if_index, adj_mtu_update_walk_cb, NULL);
445 
446  return (NULL);
447 }
448 
450 
451 /**
452  * @brief Walk the Adjacencies on a given interface
453  */
454 void
456  adj_walk_cb_t cb,
457  void *ctx)
458 {
459  /*
460  * walk all the neighbor adjacencies
461  */
463 
465  {
466  adj_nbr_walk(sw_if_index, proto, cb, ctx);
467  adj_mcast_walk(sw_if_index, proto, cb, ctx);
468  }
469 }
470 
471 /**
472  * @brief Return the link type of the adjacency
473  */
476 {
477  const ip_adjacency_t *adj;
478 
479  adj = adj_get(ai);
480 
481  return (adj->ia_link);
482 }
483 
484 /**
485  * @brief Return the sw interface index of the adjacency.
486  */
487 u32
489 {
490  const ip_adjacency_t *adj;
491 
492  adj = adj_get(ai);
493 
494  return (adj->rewrite_header.sw_if_index);
495 }
496 
497 /**
498  * @brief Return true if the adjacency is 'UP', i.e. can be used for forwarding
499  * 0 is down, !0 is up.
500  */
501 int
503 {
504  return (adj_bfd_is_up(ai));
505 }
506 
507 /**
508  * @brief Return the rewrite string of the adjacency
509  */
510 const u8*
512 {
513  vnet_rewrite_header_t *rw;
514  ip_adjacency_t *adj;
515 
516  adj = adj_get(ai);
517  rw = &adj->rewrite_header;
518 
519  ASSERT (rw->data_bytes != 0xfefe);
520 
521  return (rw->data - rw->data_bytes);
522 }
523 
524 static fib_node_t *
526 {
527  ip_adjacency_t *adj;
528 
529  adj = adj_get(index);
530 
531  return (&adj->ia_node);
532 }
533 
534 #define ADJ_FROM_NODE(_node) \
535  ((ip_adjacency_t*)((char*)_node - STRUCT_OFFSET_OF(ip_adjacency_t, ia_node)))
536 
537 static void
539 {
541 }
542 
546 {
547  ip_adjacency_t *adj;
548 
549  adj = ADJ_FROM_NODE(node);
550 
551  switch (adj->lookup_next_index)
552  {
555  break;
556  case IP_LOOKUP_NEXT_ARP:
562  case IP_LOOKUP_NEXT_DROP:
563  case IP_LOOKUP_NEXT_PUNT:
566  case IP_LOOKUP_N_NEXT:
567  /*
568  * Que pasa. yo soj en el final!
569  */
570  ASSERT(0);
571  break;
572  }
573 
575 }
576 
577 /*
578  * Adjacency's graph node virtual function table
579  */
580 static const fib_node_vft_t adj_vft = {
582  .fnv_last_lock = adj_node_last_lock_gone,
583  .fnv_back_walk = adj_back_walk_notify,
584 };
585 
586 static clib_error_t *
588 {
590 
595 
597 
598  return (NULL);
599 }
600 
602 
603 static clib_error_t *
605  unformat_input_t * input,
606  vlib_cli_command_t * cmd)
607 {
609  u32 sw_if_index = ~0;
610  int summary = 0;
611 
613  {
614  if (unformat (input, "%d", &ai))
615  ;
616  else if (unformat (input, "sum"))
617  summary = 1;
618  else if (unformat (input, "summary"))
619  summary = 1;
620  else if (unformat (input, "%U",
622  &sw_if_index))
623  ;
624  else
625  break;
626  }
627 
628  if (summary)
629  {
630  vlib_cli_output (vm, "Number of adjacencies: %d", pool_elts(adj_pool));
631  vlib_cli_output (vm, "Per-adjacency counters: %s",
633  "enabled":
634  "disabled"));
635  }
636  else
637  {
638  if (ADJ_INDEX_INVALID != ai)
639  {
640  if (pool_is_free_index(adj_pool, ai))
641  {
642  vlib_cli_output (vm, "adjacency %d invalid", ai);
643  return 0;
644  }
645 
646  vlib_cli_output (vm, "[@%d] %U",
647  ai,
650  }
651  else
652  {
653  /* *INDENT-OFF* */
654  pool_foreach_index(ai, adj_pool,
655  ({
656  if (~0 != sw_if_index &&
657  sw_if_index != adj_get_sw_if_index(ai))
658  {
659  }
660  else
661  {
662  vlib_cli_output (vm, "[@%d] %U",
663  ai,
666  }
667  }));
668  /* *INDENT-ON* */
669  }
670  }
671  return 0;
672 }
673 
674 /*?
675  * Show all adjacencies.
676  * @cliexpar
677  * @cliexstart{sh adj}
678  * [@0]
679  * [@1] glean: loop0
680  * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
681  * [@3] mpls via 1.0.0.2 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
682  * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
683  * [@5] mpls via 1.0.0.3 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
684  * @cliexend
685  ?*/
686 VLIB_CLI_COMMAND (adj_show_command, static) = {
687  .path = "show adj",
688  .short_help = "show adj [<adj_index>] [interface] [summary]",
689  .function = adj_show,
690 };
691 
692 /**
693  * @brief CLI invoked function to enable/disable per-adj counters
694  */
695 static clib_error_t *
697  unformat_input_t * input,
698  vlib_cli_command_t * cmd)
699 {
700  clib_error_t *error = NULL;
701  int enable = ~0;
702 
704  {
705  if (unformat (input, "enable"))
706  enable = 1;
707  else if (unformat (input, "disable"))
708  enable = 0;
709  else
710  break;
711  }
712 
713  if (enable != ~0)
714  {
715  /* user requested something sensible */
717  }
718  else
719  {
720  error = clib_error_return (0, "specify 'enable' or 'disable'");
721  }
722 
723  return (error);
724 }
725 
726 /*?
727  * Enable/disable per-adjacency counters. This is optional because it comes
728  * with a non-negligible performance cost.
729  ?*/
730 VLIB_CLI_COMMAND (adj_cli_counters_set_command, static) = {
731  .path = "adjacency counters",
732  .short_help = "adjacency counters [enable|disable]",
733  .function = adj_cli_counters_set,
734 };
void vnet_feature_register(vnet_feature_update_cb_t cb, void *data)
Definition: feature.c:30
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:128
adj_flags_t ia_flags
Flags on the adjacency 1-bytes.
Definition: adj.h:255
u8 proto
Definition: acl_types.api:47
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:94
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
u8 * format_adj_nbr(u8 *s, va_list *ap)
Format a neigbour (REWRITE) adjacency.
Definition: adj_nbr.c:1002
static int adj_index_is_special(adj_index_t adj_index)
Definition: adj.c:95
void adj_lock(adj_index_t adj_index)
Take a reference counting lock on the adjacency.
Definition: adj.c:307
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:511
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:475
#define NULL
Definition: clib.h:58
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.
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:983
void adj_child_remove(adj_index_t adj_index, u32 sibling_index)
Remove a child dependent.
Definition: adj.c:360
u32 adj_dpo_get_urpf(const dpo_id_t *dpo)
Definition: adj.c:297
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
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:431
vl_api_interface_index_t sw_if_index
Definition: gre.api:59
#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
struct ip_adjacency_t_::@119::@120 nbr
IP_LOOKUP_NEXT_ARP/IP_LOOKUP_NEXT_REWRITE.
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:324
union ip_adjacency_t_::@119 sub_type
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:696
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:502
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:488
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
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:534
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:287
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:2703
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:544
An node in the FIB graph.
Definition: fib_node.h:295
void adj_nbr_module_init(void)
Module initialisation.
Definition: adj_nbr.c:1112
void fib_node_unlock(fib_node_t *node)
Definition: fib_node.c:209
vlib_main_t * vm
Definition: in2out_ed.c:1810
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:180
u8 * format_adj_flags(u8 *s, va_list *args)
Format adjacency flags.
Definition: adj.c:104
void adj_glean_module_init(void)
Module initialisation.
Definition: adj_glean.c:325
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P with alignment A.
Definition: pool.h:231
static clib_error_t * adj_show(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: adj.c:604
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
u32 flags
Definition: vhost_user.h:141
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:200
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:238
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:342
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:266
static clib_error_t * adj_mtu_update(vnet_main_t *vnm, u32 sw_if_index, u32 flags)
Definition: adj.c:442
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:428
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:284
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 the neighbour Adjacencies on a given interface.
Definition: adj_nbr.c:588
vlib_main_t vlib_node_runtime_t * node
Definition: in2out_ed.c:1810
Context passed between object during a back walk.
Definition: fib_node.h:208
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:152
void adj_walk(u32 sw_if_index, adj_walk_cb_t cb, void *ctx)
Walk the Adjacencies on a given interface.
Definition: adj.c:455
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:525
ip_lookup_main_t lookup_main
Definition: ip6.h:180
u8 data[128]
Definition: ipsec_types.api:87
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:158
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:343
u8 * format_ip_adjacency(u8 *s, va_list *args)
Pretty print helper function for formatting specific adjacencies.
Definition: adj.c:134
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:437
static void adj_node_last_lock_gone(fib_node_t *node)
Definition: adj.c:538
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:1496
ip4_main_t ip4_main
Global ip4 main structure.
Definition: ip4_forward.c:1079
void adj_midchain_teardown(ip_adjacency_t *adj)
adj_midchain_setup
Definition: adj_midchain.c:456
struct ip_adjacency_t_::@119::@121 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
static clib_error_t * adj_module_init(vlib_main_t *vm)
Definition: adj.c:587
#define pool_foreach_index(i, v, body)
Iterate pool by index.
Definition: pool.h:543
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:689
static void adj_feature_update(u32 sw_if_index, u8 arc_index, u8 is_enable, void *data)
Definition: adj.c:411
static adj_walk_rc_t adj_feature_update_walk_cb(adj_index_t ai, void *arg)
Definition: adj.c:383
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:446
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
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