FD.io VPP  v18.07.1-19-g511ce25
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  {
132  vlib_counter_t counts;
133 
134  vlib_get_combined_counter(&adjacency_counters, adj_index, &counts);
135  s = format (s, "\n counts:[%Ld:%Ld]", counts.packets, counts.bytes);
136  s = format (s, "\n locks:%d", adj->ia_node.fn_locks);
137  s = format(s, "\n delegates:\n ");
138  adj_delegate_format(s, adj);
139 
140  s = format(s, "\n children:");
142  {
143  s = format(s, "\n ");
145  }
146  }
147 
148  return s;
149 }
150 
151 /*
152  * adj_last_lock_gone
153  *
154  * last lock/reference to the adj has gone, we no longer need it.
155  */
156 static void
158 {
160 
162  ADJ_DBG(adj, "last-lock-gone");
163 
165 
167 
168  switch (adj->lookup_next_index)
169  {
171  dpo_reset(&adj->sub_type.midchain.next_dpo);
172  /* FALL THROUGH */
173  case IP_LOOKUP_NEXT_ARP:
175  /*
176  * complete and incomplete nbr adjs
177  */
179  adj->ia_nh_proto,
180  adj->ia_link,
181  &adj->sub_type.nbr.next_hop,
182  adj->rewrite_header.sw_if_index);
183  break;
186  adj->rewrite_header.sw_if_index);
187  break;
191  adj->rewrite_header.sw_if_index);
192  break;
193  case IP_LOOKUP_NEXT_DROP:
194  case IP_LOOKUP_NEXT_PUNT:
197  case IP_LOOKUP_N_NEXT:
198  /*
199  * type not stored in any DB from which we need to remove it
200  */
201  break;
202  }
203 
205 
206  fib_node_deinit(&adj->ia_node);
207  ASSERT(0 == vec_len(adj->ia_delegates));
208  vec_free(adj->ia_delegates);
209  pool_put(adj_pool, adj);
210 }
211 
212 u32
214 {
215  ip_adjacency_t *adj;
216 
217  adj = adj_get(dpo->dpoi_index);
218 
219  return (adj->rewrite_header.sw_if_index);
220 }
221 
222 void
224 {
225  ip_adjacency_t *adj;
226 
227  if (adj_index_is_special(adj_index))
228  {
229  return;
230  }
231 
232  adj = adj_get(adj_index);
233  ASSERT(adj);
234 
235  ADJ_DBG(adj, "lock");
236  fib_node_lock(&adj->ia_node);
237 }
238 
239 void
241 {
242  ip_adjacency_t *adj;
243 
244  if (adj_index_is_special(adj_index))
245  {
246  return;
247  }
248 
249  adj = adj_get(adj_index);
250  ASSERT(adj);
251 
252  ADJ_DBG(adj, "unlock");
253  ASSERT(adj);
254 
255  fib_node_unlock(&adj->ia_node);
256 }
257 
258 u32
260  fib_node_type_t child_type,
261  fib_node_index_t child_index)
262 {
263  ASSERT(ADJ_INDEX_INVALID != adj_index);
264  if (adj_index_is_special(adj_index))
265  {
266  return (~0);
267  }
268 
270  adj_index,
271  child_type,
272  child_index));
273 }
274 
275 void
277  u32 sibling_index)
278 {
279  if (adj_index_is_special(adj_index))
280  {
281  return;
282  }
283 
285  adj_index,
286  sibling_index);
287 }
288 
289 /*
290  * Context for the walk to update the cached feture flags.
291  */
292 typedef struct adj_feature_update_t_
293 {
297 
298 static adj_walk_rc_t
300  void *arg)
301 {
303  ip_adjacency_t *adj;
304 
305  adj = adj_get(ai);
306 
307  /*
308  * this ugly mess matches the feature arc that is changing with affected
309  * adjacencies
310  */
312  (VNET_LINK_IP6 == adj->ia_link)) ||
314  (VNET_LINK_IP4 == adj->ia_link)) ||
316  (VNET_LINK_MPLS == adj->ia_link)))
317  {
318  if (ctx->enable)
319  adj->rewrite_header.flags |= VNET_REWRITE_HAS_FEATURES;
320  else
321  adj->rewrite_header.flags &= ~VNET_REWRITE_HAS_FEATURES;
322  }
323  return (ADJ_WALK_RC_CONTINUE);
324 }
325 
326 void
327 adj_feature_update (u32 sw_if_index,
328  u8 arc_index,
329  u8 is_enable)
330 {
331  /*
332  * Walk all the adjacencies on the interface to update the cached
333  * 'has-features' flag
334  */
336  .arc = arc_index,
337  .enable = is_enable,
338  };
339  adj_walk (sw_if_index, adj_feature_update_walk_cb, &ctx);
340 }
341 
342 static adj_walk_rc_t
344  void *arg)
345 {
346  ip_adjacency_t *adj;
347 
348  adj = adj_get(ai);
349 
351  &adj->rewrite_header);
352 
353  return (ADJ_WALK_RC_CONTINUE);
354 }
355 
356 static void
357 adj_mtu_update (vnet_main_t * vnm, u32 sw_if_index, u32 flags)
358 {
359  adj_walk (sw_if_index, adj_mtu_update_walk_cb, NULL);
360 }
361 
363 
364 /**
365  * @brief Walk the Adjacencies on a given interface
366  */
367 void
368 adj_walk (u32 sw_if_index,
369  adj_walk_cb_t cb,
370  void *ctx)
371 {
372  /*
373  * walk all the neighbor adjacencies
374  */
375  fib_protocol_t proto;
376 
378  {
379  adj_nbr_walk(sw_if_index, proto, cb, ctx);
380  adj_mcast_walk(sw_if_index, proto, cb, ctx);
381  }
382 }
383 
384 /**
385  * @brief Return the link type of the adjacency
386  */
389 {
390  const ip_adjacency_t *adj;
391 
392  adj = adj_get(ai);
393 
394  return (adj->ia_link);
395 }
396 
397 /**
398  * @brief Return the sw interface index of the adjacency.
399  */
400 u32
402 {
403  const ip_adjacency_t *adj;
404 
405  adj = adj_get(ai);
406 
407  return (adj->rewrite_header.sw_if_index);
408 }
409 
410 /**
411  * @brief Return true if the adjacency is 'UP', i.e. can be used for forwarding
412  * 0 is down, !0 is up.
413  */
414 int
416 {
417  return (adj_bfd_is_up(ai));
418 }
419 
420 /**
421  * @brief Return the rewrite string of the adjacency
422  */
423 const u8*
425 {
426  vnet_rewrite_header_t *rw;
427  ip_adjacency_t *adj;
428 
429  adj = adj_get(ai);
430  rw = &adj->rewrite_header;
431 
432  ASSERT (rw->data_bytes != 0xfefe);
433 
434  return (rw->data - rw->data_bytes);
435 }
436 
437 static fib_node_t *
439 {
440  ip_adjacency_t *adj;
441 
442  adj = adj_get(index);
443 
444  return (&adj->ia_node);
445 }
446 
447 #define ADJ_FROM_NODE(_node) \
448  ((ip_adjacency_t*)((char*)_node - STRUCT_OFFSET_OF(ip_adjacency_t, ia_node)))
449 
450 static void
452 {
454 }
455 
459 {
460  /*
461  * Que pasa. yo soj en el final!
462  */
463  ASSERT(0);
464 
466 }
467 
468 /*
469  * Adjacency's graph node virtual function table
470  */
471 static const fib_node_vft_t adj_vft = {
473  .fnv_last_lock = adj_node_last_lock_gone,
474  .fnv_back_walk = adj_back_walk_notify,
475 };
476 
477 static clib_error_t *
479 {
481 
486 
487  return (NULL);
488 }
489 
491 
492 static clib_error_t *
494  unformat_input_t * input,
495  vlib_cli_command_t * cmd)
496 {
498  u32 sw_if_index = ~0;
499  int summary = 0;
500 
502  {
503  if (unformat (input, "%d", &ai))
504  ;
505  else if (unformat (input, "sum"))
506  summary = 1;
507  else if (unformat (input, "summary"))
508  summary = 1;
509  else if (unformat (input, "%U",
511  &sw_if_index))
512  ;
513  else
514  break;
515  }
516 
517  if (summary)
518  {
519  vlib_cli_output (vm, "Number of adjacenies: %d", pool_elts(adj_pool));
520  vlib_cli_output (vm, "Per-adjacency counters: %s",
522  "enabled":
523  "disabled"));
524  }
525  else
526  {
527  if (ADJ_INDEX_INVALID != ai)
528  {
529  if (pool_is_free_index(adj_pool, ai))
530  {
531  vlib_cli_output (vm, "adjacency %d invalid", ai);
532  return 0;
533  }
534 
535  vlib_cli_output (vm, "[@%d] %U",
536  ai,
539  }
540  else
541  {
542  /* *INDENT-OFF* */
543  pool_foreach_index(ai, adj_pool,
544  ({
545  if (~0 != sw_if_index &&
546  sw_if_index != adj_get_sw_if_index(ai))
547  {
548  }
549  else
550  {
551  vlib_cli_output (vm, "[@%d] %U",
552  ai,
555  }
556  }));
557  /* *INDENT-ON* */
558  }
559  }
560  return 0;
561 }
562 
563 /*?
564  * Show all adjacencies.
565  * @cliexpar
566  * @cliexstart{sh adj}
567  * [@0]
568  * [@1] glean: loop0
569  * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
570  * [@3] mpls via 1.0.0.2 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
571  * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
572  * [@5] mpls via 1.0.0.3 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
573  * @cliexend
574  ?*/
575 VLIB_CLI_COMMAND (adj_show_command, static) = {
576  .path = "show adj",
577  .short_help = "show adj [<adj_index>] [interface] [summary]",
578  .function = adj_show,
579 };
580 
581 /**
582  * @brief CLI invoked function to enable/disable per-adj counters
583  */
584 static clib_error_t *
586  unformat_input_t * input,
587  vlib_cli_command_t * cmd)
588 {
589  clib_error_t *error = NULL;
590  int enable = ~0;
591 
593  {
594  if (unformat (input, "enable"))
595  enable = 1;
596  else if (unformat (input, "disable"))
597  enable = 0;
598  else
599  break;
600  }
601 
602  if (enable != ~0)
603  {
604  /* user requested something sensible */
606  }
607  else
608  {
609  error = clib_error_return (0, "specify 'enable' or 'disable'");
610  }
611 
612  return (error);
613 }
614 
615 /*?
616  * Enabe/disble per-adjacency counters. This is optional because it comes with
617  * a non-negligible performance cost.
618  ?*/
619 VLIB_CLI_COMMAND (adj_cli_counters_set_command, static) = {
620  .path = "adjacency counters",
621  .short_help = "adjacency counters [enable|disable]",
622  .function = adj_cli_counters_set,
623 };
void adj_glean_remove(fib_protocol_t proto, u32 sw_if_index)
Definition: adj_glean.c:130
void adj_delegate_adj_deleted(ip_adjacency_t *adj)
Definition: adj_delegate.c:128
adj_flags_t ia_flags
Flags on the adjacency 1-bytes.
Definition: adj.h:209
struct ip_adjacency_t_::@45::@47 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
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:106
u8 * format_adj_mcast_midchain(u8 *s, va_list *ap)
Definition: adj_mcast.c:346
u8 * format_adj_nbr(u8 *s, va_list *ap)
Format a neigbour (REWRITE) adjacency.
Definition: adj_nbr.c:976
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:223
vnet_main_t * vnet_get_main(void)
Definition: misc.c:47
struct ip_adjacency_t_::@45::@46 nbr
IP_LOOKUP_NEXT_ARP/IP_LOOKUP_NEXT_REWRITE.
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:424
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:388
#define NULL
Definition: clib.h:55
IP unicast adjacency.
Definition: adj.h:175
union ip_adjacency_t_::@45 sub_type
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.h:140
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:957
void adj_child_remove(adj_index_t adj_index, u32 sibling_index)
Remove a child dependent.
Definition: adj.c:276
u32 adj_dpo_get_urpf(const dpo_id_t *dpo)
Definition: adj.c:213
unsigned char u8
Definition: types.h:56
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:196
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:370
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:156
#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:313
#define clib_error_return(e, args...)
Definition: error.h:99
void adj_unlock(adj_index_t adj_index)
Release a reference counting lock on the adjacency.
Definition: adj.c:240
int adj_bfd_is_up(adj_index_t ai)
Definition: adj_bfd.c:231
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:585
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:168
#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:415
counter_t packets
packet counter
Definition: counter.h:142
u32 adj_get_sw_if_index(adj_index_t ai)
Return the sw interface index of the adjacency.
Definition: adj.c:401
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:670
struct _unformat_input_t unformat_input_t
#define ADJ_FROM_NODE(_node)
Definition: adj.c:447
static adj_index_t adj_get_index(ip_adjacency_t *adj)
Get a pointer to an adjacency object from its index.
Definition: adj_internal.h:101
#define pool_put(P, E)
Free an object E in pool P.
Definition: pool.h:274
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:457
An node in the FIB graph.
Definition: fib_node.h:287
void adj_nbr_module_init(void)
Module initialisation.
Definition: adj_nbr.c:1086
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:183
void adj_mcast_remove(fib_protocol_t proto, u32 sw_if_index)
Definition: adj_mcast.c:177
void adj_glean_module_init(void)
Module initialisation.
Definition: adj_glean.c:322
u32 flags
Definition: vhost_user.h:110
#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:493
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:144
fib_node_list_t fn_children
Vector of nodes that depend upon/use/share this node.
Definition: fib_node.h:301
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:252
vlib_main_t * vm
Definition: buffer.c:294
static void adj_last_lock_gone(ip_adjacency_t *adj)
Definition: adj.c:157
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:339
Multicast Midchain Adjacency.
Definition: adj.h:86
fib_node_get_t fnv_get
Definition: fib_node.h:275
u8 * format_adj_glean(u8 *s, va_list *ap)
Format/display a glean adjacency.
Definition: adj_glean.c:263
void adj_mcast_module_init(void)
Module initialisation.
Definition: adj_mcast.c:469
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:343
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:271
u32 adj_index_t
An index for adjacencies.
Definition: adj_types.h:30
u8 * format_adj_mcast(u8 *s, va_list *ap)
Format/display a mcast adjacency.
Definition: adj_mcast.c:328
void adj_nbr_walk(u32 sw_if_index, fib_protocol_t adj_nh_proto, adj_walk_cb_t cb, void *ctx)
Walk the neighbour Adjacencies on a given interface.
Definition: adj_nbr.c:567
Context passed between object during a back walk.
Definition: fib_node.h:200
#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:368
u8 * format_adj_midchain(u8 *s, va_list *ap)
Format a midchain adjacency.
Definition: adj_midchain.c:588
This packets follow a mid-chain adjacency.
Definition: adj.h:76
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:438
ip6_main_t ip6_main
Definition: ip6_forward.c:2574
ip_lookup_main_t lookup_main
Definition: ip6.h:161
long ctx[MAX_CONNS]
Definition: main.c:126
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
u8 * adj_delegate_format(u8 *s, ip_adjacency_t *adj)
Definition: adj_delegate.c:144
counter_t bytes
byte counter
Definition: counter.h:143
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:203
index_t dpoi_index
the index of objects of that type
Definition: dpo.h:184
#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:190
u32 fn_locks
Number of dependents on this node.
Definition: fib_node.h:307
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:259
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:181
#define FOR_EACH_FIB_IP_PROTOCOL(_item)
Definition: fib_types.h:70
static void adj_node_last_lock_gone(fib_node_t *node)
Definition: adj.c:451
A FIB graph nodes virtual function table.
Definition: fib_node.h:274
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:1545
static void adj_mtu_update(vnet_main_t *vnm, u32 sw_if_index, u32 flags)
Definition: adj.c:357
ip4_main_t ip4_main
Global ip4 main structure.
Definition: ip4_forward.c:832
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:327
void dpo_reset(dpo_id_t *dpo)
reset a DPO ID The DPO will be unlocked.
Definition: dpo.c:231
static clib_error_t * adj_module_init(vlib_main_t *vm)
Definition: adj.c:478
#define pool_foreach_index(i, v, body)
Iterate pool by index.
Definition: pool.h:488
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:62
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:116
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:681
static adj_walk_rc_t adj_feature_update_walk_cb(adj_index_t ai, void *arg)
Definition: adj.c:299
static int adj_are_counters_enabled(void)
Get the global configuration option for enabling per-adj counters.
Definition: adj.h:379
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:170
struct adj_delegate_t_ * ia_delegates
more control plane members that do not fit on the first cacheline
Definition: adj.h:276
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