FD.io VPP  v18.01.2-1-g9b554f3
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. */
26 
27 /*
28  * the single adj pool
29  */
31 
32 /**
33  * @brief Global Config for enabling per-adjacency counters.
34  * By default these are disabled.
35  */
37 
38 always_inline void
40 {
41  if (CLIB_DEBUG > 0)
42  {
43  memset (adj, 0xfe, sizeof (adj[0]));
44  }
45 }
46 
49 {
50  ip_adjacency_t *adj;
51 
53 
54  adj_poison(adj);
55 
56  /* Make sure certain fields are always initialized. */
57  /* Validate adjacency counters. */
58  vlib_validate_combined_counter(&adjacency_counters,
59  adj_get_index(adj));
60 
61  fib_node_init(&adj->ia_node,
63 
64  adj->ia_nh_proto = proto;
65  adj->ia_flags = 0;
66  adj->rewrite_header.sw_if_index = ~0;
67  adj->rewrite_header.flags = 0;
68  adj->lookup_next_index = 0;
69  adj->ia_delegates = NULL;
70 
71  /* lest it become a midchain in the future */
72  memset(&adj->sub_type.midchain.next_dpo, 0,
73  sizeof(adj->sub_type.midchain.next_dpo));
74 
75  return (adj);
76 }
77 
78 static int
80 {
81  if (ADJ_INDEX_INVALID == adj_index)
82  return (!0);
83 
84  return (0);
85 }
86 
87 /**
88  * @brief Pretty print helper function for formatting specific adjacencies.
89  * @param s - input string to format
90  * @param args - other args passed to format function such as:
91  * - vnet_main_t
92  * - ip_lookup_main_t
93  * - adj_index
94  */
95 u8 *
96 format_ip_adjacency (u8 * s, va_list * args)
97 {
99  ip_adjacency_t * adj;
100  u32 adj_index;
101 
102  adj_index = va_arg (*args, u32);
103  fiaf = va_arg (*args, format_ip_adjacency_flags_t);
104  adj = adj_get(adj_index);
105 
106  switch (adj->lookup_next_index)
107  {
109  s = format (s, "%U", format_adj_nbr, adj_index, 0);
110  break;
111  case IP_LOOKUP_NEXT_ARP:
112  s = format (s, "%U", format_adj_nbr_incomplete, adj_index, 0);
113  break;
115  s = format (s, "%U", format_adj_glean, adj_index, 0);
116  break;
118  s = format (s, "%U", format_adj_midchain, adj_index, 2);
119  break;
121  s = format (s, "%U", format_adj_mcast, adj_index, 0);
122  break;
124  s = format (s, "%U", format_adj_mcast_midchain, adj_index, 0);
125  break;
126  default:
127  break;
128  }
129 
130  if (fiaf & FORMAT_IP_ADJACENCY_DETAIL)
131  {
133  adj_delegate_t *aed;
134  vlib_counter_t counts;
135 
136  vlib_get_combined_counter(&adjacency_counters, adj_index, &counts);
137  s = format (s, "\n counts:[%Ld:%Ld]", counts.packets, counts.bytes);
138  s = format (s, "\n locks:%d", adj->ia_node.fn_locks);
139  s = format(s, "\n delegates:\n ");
140  FOR_EACH_ADJ_DELEGATE(adj, adt, aed,
141  {
142  s = format(s, " %U\n", format_adj_deletegate, aed);
143  });
144 
145  s = format(s, "\n children:\n ");
147  }
148 
149  return s;
150 }
151 
152 /*
153  * adj_last_lock_gone
154  *
155  * last lock/reference to the adj has gone, we no longer need it.
156  */
157 static void
159 {
161 
163  ADJ_DBG(adj, "last-lock-gone");
164 
166 
167  switch (adj->lookup_next_index)
168  {
170  dpo_reset(&adj->sub_type.midchain.next_dpo);
171  /* FALL THROUGH */
172  case IP_LOOKUP_NEXT_ARP:
174  /*
175  * complete and incomplete nbr adjs
176  */
178  adj->ia_nh_proto,
179  adj->ia_link,
180  &adj->sub_type.nbr.next_hop,
181  adj->rewrite_header.sw_if_index);
182  break;
185  adj->rewrite_header.sw_if_index);
186  break;
190  adj->rewrite_header.sw_if_index);
191  break;
192  case IP_LOOKUP_NEXT_DROP:
193  case IP_LOOKUP_NEXT_PUNT:
196  case IP_LOOKUP_N_NEXT:
197  /*
198  * type not stored in any DB from which we need to remove it
199  */
200  break;
201  }
202 
204 
205  fib_node_deinit(&adj->ia_node);
206  ASSERT(0 == vec_len(adj->ia_delegates));
207  vec_free(adj->ia_delegates);
208  pool_put(adj_pool, adj);
209 }
210 
211 u32
213 {
214  ip_adjacency_t *adj;
215 
216  adj = adj_get(dpo->dpoi_index);
217 
218  return (adj->rewrite_header.sw_if_index);
219 }
220 
221 void
223 {
224  ip_adjacency_t *adj;
225 
226  if (adj_index_is_special(adj_index))
227  {
228  return;
229  }
230 
231  adj = adj_get(adj_index);
232  ASSERT(adj);
233 
234  ADJ_DBG(adj, "lock");
235  fib_node_lock(&adj->ia_node);
236 }
237 
238 void
240 {
241  ip_adjacency_t *adj;
242 
243  if (adj_index_is_special(adj_index))
244  {
245  return;
246  }
247 
248  adj = adj_get(adj_index);
249  ASSERT(adj);
250 
251  ADJ_DBG(adj, "unlock");
252  ASSERT(adj);
253 
254  fib_node_unlock(&adj->ia_node);
255 }
256 
257 u32
259  fib_node_type_t child_type,
260  fib_node_index_t child_index)
261 {
262  ASSERT(ADJ_INDEX_INVALID != adj_index);
263  if (adj_index_is_special(adj_index))
264  {
265  return (~0);
266  }
267 
269  adj_index,
270  child_type,
271  child_index));
272 }
273 
274 void
276  u32 sibling_index)
277 {
278  if (adj_index_is_special(adj_index))
279  {
280  return;
281  }
282 
284  adj_index,
285  sibling_index);
286 }
287 
288 /*
289  * Context for the walk to update the cached feture flags.
290  */
291 typedef struct adj_feature_update_t_
292 {
296 
297 static adj_walk_rc_t
299  void *arg)
300 {
302  ip_adjacency_t *adj;
303 
304  adj = adj_get(ai);
305 
306  /*
307  * this ugly mess matches the feature arc that is changing with affected
308  * adjacencies
309  */
311  (VNET_LINK_IP6 == adj->ia_link)) ||
313  (VNET_LINK_IP4 == adj->ia_link)) ||
315  (VNET_LINK_MPLS == adj->ia_link)))
316  {
317  if (ctx->enable)
318  adj->rewrite_header.flags |= VNET_REWRITE_HAS_FEATURES;
319  else
320  adj->rewrite_header.flags &= ~VNET_REWRITE_HAS_FEATURES;
321  }
322  return (ADJ_WALK_RC_CONTINUE);
323 }
324 
325 void
326 adj_feature_update (u32 sw_if_index,
327  u8 arc_index,
328  u8 is_enable)
329 {
330  /*
331  * Walk all the adjacencies on the interface to update the cached
332  * 'has-features' flag
333  */
335  .arc = arc_index,
336  .enable = is_enable,
337  };
338  adj_walk (sw_if_index, adj_feature_update_walk_cb, &ctx);
339 }
340 
341 /**
342  * @brief Walk the Adjacencies on a given interface
343  */
344 void
345 adj_walk (u32 sw_if_index,
346  adj_walk_cb_t cb,
347  void *ctx)
348 {
349  /*
350  * walk all the neighbor adjacencies
351  */
352  fib_protocol_t proto;
353 
355  {
356  adj_nbr_walk(sw_if_index, proto, cb, ctx);
357  adj_mcast_walk(sw_if_index, proto, cb, ctx);
358  }
359 }
360 
361 /**
362  * @brief Return the link type of the adjacency
363  */
366 {
367  const ip_adjacency_t *adj;
368 
369  adj = adj_get(ai);
370 
371  return (adj->ia_link);
372 }
373 
374 /**
375  * @brief Return the sw interface index of the adjacency.
376  */
377 u32
379 {
380  const ip_adjacency_t *adj;
381 
382  adj = adj_get(ai);
383 
384  return (adj->rewrite_header.sw_if_index);
385 }
386 
387 /**
388  * @brief Return true if the adjacency is 'UP', i.e. can be used for forwarding
389  * 0 is down, !0 is up.
390  */
391 int
393 {
394  const adj_delegate_t *aed;
395 
397 
398  if (NULL == aed)
399  {
400  /*
401  * no BFD tracking - resolved
402  */
403  return (!0);
404  }
405  else
406  {
407  /*
408  * defer to the state of the BFD tracking
409  */
410  return (ADJ_BFD_STATE_UP == aed->ad_bfd_state);
411  }
412 }
413 
414 /**
415  * @brief Return the rewrite string of the adjacency
416  */
417 const u8*
419 {
420  vnet_rewrite_header_t *rw;
421  ip_adjacency_t *adj;
422 
423  adj = adj_get(ai);
424  rw = &adj->rewrite_header;
425 
426  ASSERT (rw->data_bytes != 0xfefe);
427 
428  return (rw->data - rw->data_bytes);
429 }
430 
431 static fib_node_t *
433 {
434  ip_adjacency_t *adj;
435 
436  adj = adj_get(index);
437 
438  return (&adj->ia_node);
439 }
440 
441 #define ADJ_FROM_NODE(_node) \
442  ((ip_adjacency_t*)((char*)_node - STRUCT_OFFSET_OF(ip_adjacency_t, ia_node)))
443 
444 static void
446 {
448 }
449 
453 {
454  /*
455  * Que pasa. yo soj en el final!
456  */
457  ASSERT(0);
458 
460 }
461 
462 /*
463  * Adjacency's graph node virtual function table
464  */
465 static const fib_node_vft_t adj_vft = {
467  .fnv_last_lock = adj_node_last_lock_gone,
468  .fnv_back_walk = adj_back_walk_notify,
469 };
470 
471 static clib_error_t *
473 {
475 
480 
481  return (NULL);
482 }
483 
485 
486 static clib_error_t *
488  unformat_input_t * input,
489  vlib_cli_command_t * cmd)
490 {
492  u32 sw_if_index = ~0;
493  int summary = 0;
494 
496  {
497  if (unformat (input, "%d", &ai))
498  ;
499  else if (unformat (input, "sum"))
500  summary = 1;
501  else if (unformat (input, "summary"))
502  summary = 1;
503  else if (unformat (input, "%U",
505  &sw_if_index))
506  ;
507  else
508  break;
509  }
510 
511  if (summary)
512  {
513  vlib_cli_output (vm, "Number of adjacenies: %d", pool_elts(adj_pool));
514  vlib_cli_output (vm, "Per-adjacency counters: %s",
516  "enabled":
517  "disabled"));
518  }
519  else
520  {
521  if (ADJ_INDEX_INVALID != ai)
522  {
523  if (pool_is_free_index(adj_pool, ai))
524  {
525  vlib_cli_output (vm, "adjacency %d invalid", ai);
526  return 0;
527  }
528 
529  vlib_cli_output (vm, "[@%d] %U",
530  ai,
533  }
534  else
535  {
536  /* *INDENT-OFF* */
537  pool_foreach_index(ai, adj_pool,
538  ({
539  if (~0 != sw_if_index &&
540  sw_if_index != adj_get_sw_if_index(ai))
541  {
542  }
543  else
544  {
545  vlib_cli_output (vm, "[@%d] %U",
546  ai,
549  }
550  }));
551  /* *INDENT-ON* */
552  }
553  }
554  return 0;
555 }
556 
557 /*?
558  * Show all adjacencies.
559  * @cliexpar
560  * @cliexstart{sh adj}
561  * [@0]
562  * [@1] glean: loop0
563  * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
564  * [@3] mpls via 1.0.0.2 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
565  * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
566  * [@5] mpls via 1.0.0.3 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
567  * @cliexend
568  ?*/
569 VLIB_CLI_COMMAND (adj_show_command, static) = {
570  .path = "show adj",
571  .short_help = "show adj [<adj_index>] [interface] [summary]",
572  .function = adj_show,
573 };
574 
575 /**
576  * @brief CLI invoked function to enable/disable per-adj counters
577  */
578 static clib_error_t *
580  unformat_input_t * input,
581  vlib_cli_command_t * cmd)
582 {
583  clib_error_t *error = NULL;
584  int enable = ~0;
585 
587  {
588  if (unformat (input, "enable"))
589  enable = 1;
590  else if (unformat (input, "disable"))
591  enable = 0;
592  else
593  break;
594  }
595 
596  if (enable != ~0)
597  {
598  /* user requested something sensible */
600  }
601  else
602  {
603  error = clib_error_return (0, "specify 'enable' or 'disable'");
604  }
605 
606  return (error);
607 }
608 
609 /*?
610  * Enabe/disble per-adjacency counters. This is optional because it comes with
611  * a non-negligible performance cost.
612  ?*/
613 VLIB_CLI_COMMAND (adj_cli_counters_set_command, static) = {
614  .path = "adjacency counters",
615  .short_help = "adjacency counters [enable|disable]",
616  .function = adj_cli_counters_set,
617 };
void adj_glean_remove(fib_protocol_t proto, u32 sw_if_index)
Definition: adj_glean.c:92
adj_flags_t ia_flags
Flags on the adjacency 1-bytes.
Definition: adj.h:208
ip_adjacency_t * adj_pool
The global adjacnecy pool.
Definition: adj.c:30
void vlib_validate_combined_counter(vlib_combined_counter_main_t *cm, u32 index)
validate a combined counter
Definition: counter.c:89
u8 * format_adj_mcast_midchain(u8 *s, va_list *ap)
Definition: adj_mcast.c:353
u8 * format_adj_nbr(u8 *s, va_list *ap)
Format a neigbour (REWRITE) adjacency.
Definition: adj_nbr.c:1008
static int adj_index_is_special(adj_index_t adj_index)
Definition: adj.c:79
void adj_lock(adj_index_t adj_index)
Take a reference counting lock on the adjacency.
Definition: adj.c:222
vnet_main_t * vnet_get_main(void)
Definition: misc.c:47
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:418
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:365
#define NULL
Definition: clib.h:55
IP unicast adjacency.
Definition: adj.h:174
enum fib_node_back_walk_rc_t_ fib_node_back_walk_rc_t
Return code from a back walk function.
adj_bfd_state_t ad_bfd_state
BFD session state.
Definition: adj_delegate.h:85
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.h:139
void fib_node_deinit(fib_node_t *node)
Definition: fib_node.c:197
ip_lookup_main_t lookup_main
Definition: ip4.h:97
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:419
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:987
void adj_child_remove(adj_index_t adj_index, u32 sibling_index)
Remove a child dependent.
Definition: adj.c:275
u32 adj_dpo_get_urpf(const dpo_id_t *dpo)
Definition: adj.c:212
struct ip_adjacency_t_::@38::@40 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
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:212
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:195
Adjacency to punt this packet.
Definition: adj.h:55
u8 output_feature_arc_index
Definition: lookup.h:137
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
Definition: adj.h:365
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:111
#define always_inline
Definition: clib.h:92
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:320
#define FOR_EACH_ADJ_DELEGATE(_adj, _adt, _aed, _body)
Definition: adj_delegate.h:31
#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:239
A Delagate is a means to implement the Delagation design pattern; the extension of an object&#39;s functi...
Definition: adj_delegate.h:61
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:579
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:79
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:166
#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
int adj_is_up(adj_index_t ai)
Return true if the adjacency is &#39;UP&#39;, i.e.
Definition: adj.c:392
counter_t packets
packet counter
Definition: counter.h:141
u32 adj_get_sw_if_index(adj_index_t ai)
Return the sw interface index of the adjacency.
Definition: adj.c:378
struct ip_adjacency_t_::@38::@39 nbr
IP_LOOKUP_NEXT_ARP/IP_LOOKUP_NEXT_REWRITE.
void fib_node_lock(fib_node_t *node)
Definition: fib_node.c:203
void adj_midchain_module_init(void)
Module initialisation.
Definition: adj_midchain.c:664
struct _unformat_input_t unformat_input_t
enum adj_delegate_type_t_ adj_delegate_type_t
Delegate types.
#define ADJ_FROM_NODE(_node)
Definition: adj.c:441
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:86
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:271
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:36
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:451
An node in the FIB graph.
Definition: fib_node.h:286
void adj_nbr_module_init(void)
Module initialisation.
Definition: adj_nbr.c:1118
void fib_node_unlock(fib_node_t *node)
Definition: fib_node.c:209
vlib_combined_counter_main_t adjacency_counters
Adjacency packet counters.
Definition: adj.c:25
fib_node_t ia_node
Linkage into the FIB node grpah.
Definition: adj.h:182
u8 * format_adj_deletegate(u8 *s, va_list *args)
Definition: adj_delegate.c:137
void adj_mcast_remove(fib_protocol_t proto, u32 sw_if_index)
Definition: adj_mcast.c:186
void adj_glean_module_init(void)
Module initialisation.
Definition: adj_glean.c:283
union ip_adjacency_t_::@38 sub_type
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P (general version).
Definition: pool.h:188
static clib_error_t * adj_show(vlib_main_t *vm, unformat_input_t *input, vlib_cli_command_t *cmd)
Definition: adj.c:487
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:143
fib_node_list_t fn_children
The node&#39;s VFT.
Definition: fib_node.h:306
mpls_main_t mpls_main
Definition: mpls.c:25
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:250
vlib_main_t * vm
Definition: buffer.c:283
static void adj_last_lock_gone(ip_adjacency_t *adj)
Definition: adj.c:158
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:336
Multicast Midchain Adjacency.
Definition: adj.h:86
fib_node_get_t fnv_get
Definition: fib_node.h:274
u8 * format_adj_glean(u8 *s, va_list *ap)
Format/display a glean adjacency.
Definition: adj_glean.c:223
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:29
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:39
#define pool_is_free_index(P, I)
Use free bitmap to query whether given index is free.
Definition: pool.h:268
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:335
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:567
Context passed between object during a back walk.
Definition: fib_node.h:199
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:154
void adj_walk(u32 sw_if_index, adj_walk_cb_t cb, void *ctx)
Walk the Adjacencies on a given interface.
Definition: adj.c:345
u8 * format_adj_midchain(u8 *s, va_list *ap)
Format a midchain adjacency.
Definition: adj_midchain.c:583
This packets follow a mid-chain adjacency.
Definition: adj.h:76
BFD session state.
Definition: adj_delegate.h:28
u32 fib_node_list_get_size(fib_node_list_t list)
#define ASSERT(truth)
unsigned int u32
Definition: types.h:88
static fib_node_t * adj_get_node(fib_node_index_t index)
Definition: adj.c:432
adj_delegate_t * adj_delegate_get(const ip_adjacency_t *adj, adj_delegate_type_t type)
Definition: adj_delegate.c:48
ip6_main_t ip6_main
Definition: ip6_forward.c:3009
ip_lookup_main_t lookup_main
Definition: ip6.h:158
long ctx[MAX_CONNS]
Definition: main.c:122
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
static vlib_main_t * vlib_get_main(void)
Definition: global_funcs.h:23
counter_t bytes
byte counter
Definition: counter.h:142
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:202
index_t dpoi_index
the index of objects of that type
Definition: dpo.h:182
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
unsigned char u8
Definition: types.h:56
ip_lookup_next_t lookup_next_index
Next hop after ip4-lookup.
Definition: adj.h:189
u32 fn_locks
Number of dependents on this node.
Definition: fib_node.h:312
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:258
u8 * format_ip_adjacency(u8 *s, va_list *args)
Pretty print helper function for formatting specific adjacencies.
Definition: adj.c:96
ip_adjacency_t * adj_alloc(fib_protocol_t proto)
Definition: adj.c:48
A collection of combined counters.
Definition: counter.h:180
#define FOR_EACH_FIB_IP_PROTOCOL(_item)
Definition: fib_types.h:69
static void adj_node_last_lock_gone(fib_node_t *node)
Definition: adj.c:445
A FIB graph nodes virtual function table.
Definition: fib_node.h:273
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:1491
ip4_main_t ip4_main
Global ip4 main structure.
Definition: ip4_forward.c:1181
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:326
void dpo_reset(dpo_id_t *dpo)
reset a DPO ID The DPO will be unlocked.
Definition: dpo.c:228
static clib_error_t * adj_module_init(vlib_main_t *vm)
Definition: adj.c:472
#define pool_foreach_index(i, v, body)
Iterate pool by index.
Definition: pool.h:480
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:67
struct adj_feature_update_t_ adj_feature_update_ctx_t
This adjacency/interface has output features configured.
Definition: rewrite.h:57
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:680
static adj_walk_rc_t adj_feature_update_walk_cb(adj_index_t ai, void *arg)
Definition: adj.c:298
static int adj_are_counters_enabled(void)
Get the global configuration option for enabling per-adj counters.
Definition: adj.h:374
uword unformat(unformat_input_t *i, const char *fmt,...)
Definition: unformat.c:972
static uword unformat_check_input(unformat_input_t *i)
Definition: format.h:169
struct adj_delegate_t_ * ia_delegates
more control plane members that do not fit on the first cacheline
Definition: adj.h:271
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