FD.io VPP  v18.10-32-g1161dda
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 always_inline void
50 {
51  if (CLIB_DEBUG > 0)
52  {
53  memset (adj, 0xfe, sizeof (adj[0]));
54  }
55 }
56 
59 {
60  ip_adjacency_t *adj;
61 
63 
64  adj_poison(adj);
65 
66  /* Make sure certain fields are always initialized. */
67  /* Validate adjacency counters. */
68  vlib_validate_combined_counter(&adjacency_counters,
69  adj_get_index(adj));
70  vlib_zero_combined_counter(&adjacency_counters,
71  adj_get_index(adj));
72  fib_node_init(&adj->ia_node,
74 
75  adj->ia_nh_proto = proto;
76  adj->ia_flags = 0;
77  adj->rewrite_header.sw_if_index = ~0;
78  adj->rewrite_header.flags = 0;
79  adj->lookup_next_index = 0;
80  adj->ia_delegates = NULL;
81 
82  /* lest it become a midchain in the future */
83  memset(&adj->sub_type.midchain.next_dpo, 0,
84  sizeof(adj->sub_type.midchain.next_dpo));
85 
86  return (adj);
87 }
88 
89 static int
91 {
92  if (ADJ_INDEX_INVALID == adj_index)
93  return (!0);
94 
95  return (0);
96 }
97 
98 /**
99  * @brief Pretty print helper function for formatting specific adjacencies.
100  * @param s - input string to format
101  * @param args - other args passed to format function such as:
102  * - vnet_main_t
103  * - ip_lookup_main_t
104  * - adj_index
105  */
106 u8 *
107 format_ip_adjacency (u8 * s, va_list * args)
108 {
110  ip_adjacency_t * adj;
111  u32 adj_index;
112 
113  adj_index = va_arg (*args, u32);
114  fiaf = va_arg (*args, format_ip_adjacency_flags_t);
115  adj = adj_get(adj_index);
116 
117  switch (adj->lookup_next_index)
118  {
120  s = format (s, "%U", format_adj_nbr, adj_index, 0);
121  break;
122  case IP_LOOKUP_NEXT_ARP:
123  s = format (s, "%U", format_adj_nbr_incomplete, adj_index, 0);
124  break;
126  s = format (s, "%U", format_adj_glean, adj_index, 0);
127  break;
129  s = format (s, "%U", format_adj_midchain, adj_index, 2);
130  break;
132  s = format (s, "%U", format_adj_mcast, adj_index, 0);
133  break;
135  s = format (s, "%U", format_adj_mcast_midchain, adj_index, 0);
136  break;
137  default:
138  break;
139  }
140 
141  if (fiaf & FORMAT_IP_ADJACENCY_DETAIL)
142  {
143  vlib_counter_t counts;
144 
145  vlib_get_combined_counter(&adjacency_counters, adj_index, &counts);
146  s = format (s, "\n counts:[%Ld:%Ld]", counts.packets, counts.bytes);
147  s = format (s, "\n locks:%d", adj->ia_node.fn_locks);
148  s = format(s, "\n delegates:\n ");
149  adj_delegate_format(s, adj);
150 
151  s = format(s, "\n children:");
153  {
154  s = format(s, "\n ");
156  }
157  }
158 
159  return s;
160 }
161 
162 /*
163  * adj_last_lock_gone
164  *
165  * last lock/reference to the adj has gone, we no longer need it.
166  */
167 static void
169 {
171 
173  ADJ_DBG(adj, "last-lock-gone");
174 
176 
178 
179  switch (adj->lookup_next_index)
180  {
182  dpo_reset(&adj->sub_type.midchain.next_dpo);
183  /* FALL THROUGH */
184  case IP_LOOKUP_NEXT_ARP:
187  /*
188  * complete and incomplete nbr adjs
189  */
191  adj->ia_nh_proto,
192  adj->ia_link,
193  &adj->sub_type.nbr.next_hop,
194  adj->rewrite_header.sw_if_index);
195  break;
198  adj->rewrite_header.sw_if_index);
199  break;
203  adj->rewrite_header.sw_if_index);
204  break;
205  case IP_LOOKUP_NEXT_DROP:
206  case IP_LOOKUP_NEXT_PUNT:
209  case IP_LOOKUP_N_NEXT:
210  /*
211  * type not stored in any DB from which we need to remove it
212  */
213  break;
214  }
215 
217 
218  fib_node_deinit(&adj->ia_node);
219  ASSERT(0 == vec_len(adj->ia_delegates));
220  vec_free(adj->ia_delegates);
221  pool_put(adj_pool, adj);
222 }
223 
224 u32
226 {
227  ip_adjacency_t *adj;
228 
229  adj = adj_get(dpo->dpoi_index);
230 
231  return (adj->rewrite_header.sw_if_index);
232 }
233 
234 void
236 {
237  ip_adjacency_t *adj;
238 
239  if (adj_index_is_special(adj_index))
240  {
241  return;
242  }
243 
244  adj = adj_get(adj_index);
245  ASSERT(adj);
246 
247  ADJ_DBG(adj, "lock");
248  fib_node_lock(&adj->ia_node);
249 }
250 
251 void
253 {
254  ip_adjacency_t *adj;
255 
256  if (adj_index_is_special(adj_index))
257  {
258  return;
259  }
260 
261  adj = adj_get(adj_index);
262  ASSERT(adj);
263 
264  ADJ_DBG(adj, "unlock");
265  ASSERT(adj);
266 
267  fib_node_unlock(&adj->ia_node);
268 }
269 
270 u32
272  fib_node_type_t child_type,
273  fib_node_index_t child_index)
274 {
275  ASSERT(ADJ_INDEX_INVALID != adj_index);
276  if (adj_index_is_special(adj_index))
277  {
278  return (~0);
279  }
280 
282  adj_index,
283  child_type,
284  child_index));
285 }
286 
287 void
289  u32 sibling_index)
290 {
291  if (adj_index_is_special(adj_index))
292  {
293  return;
294  }
295 
297  adj_index,
298  sibling_index);
299 }
300 
301 /*
302  * Context for the walk to update the cached feture flags.
303  */
304 typedef struct adj_feature_update_t_
305 {
309 
310 static adj_walk_rc_t
312  void *arg)
313 {
315  ip_adjacency_t *adj;
316 
317  adj = adj_get(ai);
318 
319  /*
320  * this ugly mess matches the feature arc that is changing with affected
321  * adjacencies
322  */
324  (VNET_LINK_IP6 == adj->ia_link)) ||
326  (VNET_LINK_IP4 == adj->ia_link)) ||
328  (VNET_LINK_MPLS == adj->ia_link)))
329  {
330  if (ctx->enable)
331  adj->rewrite_header.flags |= VNET_REWRITE_HAS_FEATURES;
332  else
333  adj->rewrite_header.flags &= ~VNET_REWRITE_HAS_FEATURES;
334  }
335  return (ADJ_WALK_RC_CONTINUE);
336 }
337 
338 void
340  u8 arc_index,
341  u8 is_enable)
342 {
343  /*
344  * Walk all the adjacencies on the interface to update the cached
345  * 'has-features' flag
346  */
348  .arc = arc_index,
349  .enable = is_enable,
350  };
351  adj_walk (sw_if_index, adj_feature_update_walk_cb, &ctx);
352 }
353 
354 static adj_walk_rc_t
356  void *arg)
357 {
358  ip_adjacency_t *adj;
359 
360  adj = adj_get(ai);
361 
363  &adj->rewrite_header);
364 
365  return (ADJ_WALK_RC_CONTINUE);
366 }
367 
368 static void
370 {
371  adj_walk (sw_if_index, adj_mtu_update_walk_cb, NULL);
372 }
373 
375 
376 /**
377  * @brief Walk the Adjacencies on a given interface
378  */
379 void
381  adj_walk_cb_t cb,
382  void *ctx)
383 {
384  /*
385  * walk all the neighbor adjacencies
386  */
387  fib_protocol_t proto;
388 
390  {
391  adj_nbr_walk(sw_if_index, proto, cb, ctx);
392  adj_mcast_walk(sw_if_index, proto, cb, ctx);
393  }
394 }
395 
396 /**
397  * @brief Return the link type of the adjacency
398  */
401 {
402  const ip_adjacency_t *adj;
403 
404  adj = adj_get(ai);
405 
406  return (adj->ia_link);
407 }
408 
409 /**
410  * @brief Return the sw interface index of the adjacency.
411  */
412 u32
414 {
415  const ip_adjacency_t *adj;
416 
417  adj = adj_get(ai);
418 
419  return (adj->rewrite_header.sw_if_index);
420 }
421 
422 /**
423  * @brief Return true if the adjacency is 'UP', i.e. can be used for forwarding
424  * 0 is down, !0 is up.
425  */
426 int
428 {
429  return (adj_bfd_is_up(ai));
430 }
431 
432 /**
433  * @brief Return the rewrite string of the adjacency
434  */
435 const u8*
437 {
438  vnet_rewrite_header_t *rw;
439  ip_adjacency_t *adj;
440 
441  adj = adj_get(ai);
442  rw = &adj->rewrite_header;
443 
444  ASSERT (rw->data_bytes != 0xfefe);
445 
446  return (rw->data - rw->data_bytes);
447 }
448 
449 static fib_node_t *
451 {
452  ip_adjacency_t *adj;
453 
454  adj = adj_get(index);
455 
456  return (&adj->ia_node);
457 }
458 
459 #define ADJ_FROM_NODE(_node) \
460  ((ip_adjacency_t*)((char*)_node - STRUCT_OFFSET_OF(ip_adjacency_t, ia_node)))
461 
462 static void
464 {
466 }
467 
471 {
472  /*
473  * Que pasa. yo soj en el final!
474  */
475  ASSERT(0);
476 
478 }
479 
480 /*
481  * Adjacency's graph node virtual function table
482  */
483 static const fib_node_vft_t adj_vft = {
485  .fnv_last_lock = adj_node_last_lock_gone,
486  .fnv_back_walk = adj_back_walk_notify,
487 };
488 
489 static clib_error_t *
491 {
493 
498 
499  return (NULL);
500 }
501 
503 
504 static clib_error_t *
506  unformat_input_t * input,
507  vlib_cli_command_t * cmd)
508 {
510  u32 sw_if_index = ~0;
511  int summary = 0;
512 
514  {
515  if (unformat (input, "%d", &ai))
516  ;
517  else if (unformat (input, "sum"))
518  summary = 1;
519  else if (unformat (input, "summary"))
520  summary = 1;
521  else if (unformat (input, "%U",
523  &sw_if_index))
524  ;
525  else
526  break;
527  }
528 
529  if (summary)
530  {
531  vlib_cli_output (vm, "Number of adjacencies: %d", pool_elts(adj_pool));
532  vlib_cli_output (vm, "Per-adjacency counters: %s",
534  "enabled":
535  "disabled"));
536  }
537  else
538  {
539  if (ADJ_INDEX_INVALID != ai)
540  {
541  if (pool_is_free_index(adj_pool, ai))
542  {
543  vlib_cli_output (vm, "adjacency %d invalid", ai);
544  return 0;
545  }
546 
547  vlib_cli_output (vm, "[@%d] %U",
548  ai,
551  }
552  else
553  {
554  /* *INDENT-OFF* */
555  pool_foreach_index(ai, adj_pool,
556  ({
557  if (~0 != sw_if_index &&
558  sw_if_index != adj_get_sw_if_index(ai))
559  {
560  }
561  else
562  {
563  vlib_cli_output (vm, "[@%d] %U",
564  ai,
567  }
568  }));
569  /* *INDENT-ON* */
570  }
571  }
572  return 0;
573 }
574 
575 /*?
576  * Show all adjacencies.
577  * @cliexpar
578  * @cliexstart{sh adj}
579  * [@0]
580  * [@1] glean: loop0
581  * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
582  * [@3] mpls via 1.0.0.2 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
583  * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
584  * [@5] mpls via 1.0.0.3 loop0: MPLS: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
585  * @cliexend
586  ?*/
587 VLIB_CLI_COMMAND (adj_show_command, static) = {
588  .path = "show adj",
589  .short_help = "show adj [<adj_index>] [interface] [summary]",
590  .function = adj_show,
591 };
592 
593 /**
594  * @brief CLI invoked function to enable/disable per-adj counters
595  */
596 static clib_error_t *
598  unformat_input_t * input,
599  vlib_cli_command_t * cmd)
600 {
601  clib_error_t *error = NULL;
602  int enable = ~0;
603 
605  {
606  if (unformat (input, "enable"))
607  enable = 1;
608  else if (unformat (input, "disable"))
609  enable = 0;
610  else
611  break;
612  }
613 
614  if (enable != ~0)
615  {
616  /* user requested something sensible */
618  }
619  else
620  {
621  error = clib_error_return (0, "specify 'enable' or 'disable'");
622  }
623 
624  return (error);
625 }
626 
627 /*?
628  * Enabe/disble per-adjacency counters. This is optional because it comes with
629  * a non-negligible performance cost.
630  ?*/
631 VLIB_CLI_COMMAND (adj_cli_counters_set_command, static) = {
632  .path = "adjacency counters",
633  .short_help = "adjacency counters [enable|disable]",
634  .function = adj_cli_counters_set,
635 };
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:219
struct ip_adjacency_t_::@45::@47 midchain
IP_LOOKUP_NEXT_MIDCHAIN.
ip_adjacency_t * adj_pool
The global adjacnecy 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: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:981
static int adj_index_is_special(adj_index_t adj_index)
Definition: adj.c:90
void adj_lock(adj_index_t adj_index)
Take a reference counting lock on the adjacency.
Definition: adj.c:235
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:436
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:400
#define NULL
Definition: clib.h:57
Broadcasr Adjacency.
Definition: adj.h:85
IP unicast adjacency.
Definition: adj.h:185
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_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:98
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:962
void adj_child_remove(adj_index_t adj_index, u32 sibling_index)
Remove a child dependent.
Definition: adj.c:288
u32 adj_dpo_get_urpf(const dpo_id_t *dpo)
Definition: adj.c:225
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: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:206
Adjacency to punt this packet.
Definition: adj.h:55
u8 output_feature_arc_index
Definition: lookup.h:138
static ip_adjacency_t * adj_get(adj_index_t adj_index)
Get a pointer to an adjacency object from its index.
Definition: adj.h:380
memset(h->entries, 0, sizeof(h->entries[0])*entries)
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:163
u32 sw_if_index
Definition: vxlan_gbp.api:39
#define always_inline
Definition: clib.h:94
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:252
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:597
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
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:269
int adj_is_up(adj_index_t ai)
Return true if the adjacency is &#39;UP&#39;, i.e.
Definition: adj.c:427
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:413
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:671
struct _unformat_input_t unformat_input_t
#define ADJ_FROM_NODE(_node)
Definition: adj.c:459
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: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:469
An node in the FIB graph.
Definition: fib_node.h:289
void adj_nbr_module_init(void)
Module initialisation.
Definition: adj_nbr.c:1091
void fib_node_unlock(fib_node_t *node)
Definition: fib_node.c:209
fib_node_t ia_node
Linkage into the FIB node grpah.
Definition: adj.h:193
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:115
#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:505
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:303
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:243
vlib_main_t * vm
Definition: buffer.c:294
static void adj_last_lock_gone(ip_adjacency_t *adj)
Definition: adj.c:168
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:339
Multicast Midchain Adjacency.
Definition: adj.h:89
fib_node_get_t fnv_get
Definition: fib_node.h:277
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:355
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:49
#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:572
Context passed between object during a back walk.
Definition: fib_node.h:202
#define VLIB_CLI_COMMAND(x,...)
Definition: cli.h:155
void adj_walk(u32 sw_if_index, adj_walk_cb_t cb, void *ctx)
Walk the Adjacencies on a given interface.
Definition: adj.c:380
u8 * format_adj_midchain(u8 *s, va_list *ap)
Format a midchain adjacency.
Definition: adj_midchain.c:589
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:450
ip6_main_t ip6_main
Definition: ip6_forward.c:2590
ip_lookup_main_t lookup_main
Definition: ip6.h:161
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_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:213
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:200
u32 fn_locks
Number of dependents on this node.
Definition: fib_node.h:309
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:271
u8 * format_ip_adjacency(u8 *s, va_list *args)
Pretty print helper function for formatting specific adjacencies.
Definition: adj.c:107
ip_adjacency_t * adj_alloc(fib_protocol_t proto)
Definition: adj.c:58
char * name
The counter collection&#39;s name.
Definition: counter.h:177
A collection of combined counters.
Definition: counter.h:172
#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:463
A FIB graph nodes virtual function table.
Definition: fib_node.h:276
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:1455
static void adj_mtu_update(vnet_main_t *vnm, u32 sw_if_index, u32 flags)
Definition: adj.c:369
ip4_main_t ip4_main
Global ip4 main structure.
Definition: ip4_forward.c:900
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:339
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:490
#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: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:116
void vlib_cli_output(vlib_main_t *vm, char *fmt,...)
Definition: cli.c:725
static adj_walk_rc_t adj_feature_update_walk_cb(adj_index_t ai, void *arg)
Definition: adj.c:311
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:389
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:286
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