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:
7 * http://www.apache.org/licenses/LICENSE-2.0
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.
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/fib/fib_node_list.h>
24 * Special Adj with index zero. we need to define this since the v4 mtrie
25 * assumes an index of 0 implies the ply is empty. therefore all 'real'
26 * adjs need a non-zero index.
28 static ip_adjacency_t *special_v4_miss_adj_with_index_zero;
30 /* Adjacency packet/byte counters indexed by adjacency index. */
31 vlib_combined_counter_main_t adjacency_counters;
36 ip_adjacency_t *adj_pool;
39 * @brief Global Config for enabling per-adjacency counters.
40 * By default these are disabled.
42 int adj_per_adj_counters;
45 adj_poison (ip_adjacency_t * adj)
49 memset (adj, 0xfe, sizeof (adj[0]));
54 adj_alloc (fib_protocol_t proto)
58 pool_get(adj_pool, adj);
62 /* Make sure certain fields are always initialized. */
63 /* Validate adjacency counters. */
64 vlib_validate_combined_counter(&adjacency_counters,
67 adj->rewrite_header.sw_if_index = ~0;
69 adj->lookup_next_index = 0;
71 fib_node_init(&adj->ia_node,
73 adj->ia_nh_proto = proto;
76 ip4_main.lookup_main.adjacency_heap = adj_pool;
77 ip6_main.lookup_main.adjacency_heap = adj_pool;
83 adj_index_is_special (adj_index_t adj_index)
85 if (ADJ_INDEX_INVALID == adj_index)
92 * @brief Pretty print helper function for formatting specific adjacencies.
93 * @param s - input string to format
94 * @param args - other args passed to format function such as:
100 format_ip_adjacency (u8 * s, va_list * args)
102 format_ip_adjacency_flags_t fiaf;
103 ip_adjacency_t * adj;
106 adj_index = va_arg (*args, u32);
107 fiaf = va_arg (*args, format_ip_adjacency_flags_t);
108 adj = adj_get(adj_index);
110 switch (adj->lookup_next_index)
112 case IP_LOOKUP_NEXT_REWRITE:
113 s = format (s, "%U", format_adj_nbr, adj_index, 0);
115 case IP_LOOKUP_NEXT_ARP:
116 s = format (s, "%U", format_adj_nbr_incomplete, adj_index, 0);
118 case IP_LOOKUP_NEXT_GLEAN:
119 s = format (s, "%U", format_adj_glean, adj_index, 0);
121 case IP_LOOKUP_NEXT_MIDCHAIN:
122 s = format (s, "%U", format_adj_midchain, adj_index, 2);
124 case IP_LOOKUP_NEXT_MCAST:
125 s = format (s, "%U", format_adj_mcast, adj_index, 0);
131 if (fiaf & FORMAT_IP_ADJACENCY_DETAIL)
133 vlib_counter_t counts;
135 vlib_get_combined_counter(&adjacency_counters, adj_index, &counts);
136 s = format (s, "\n counts:[%Ld:%Ld]", counts.packets, counts.bytes);
137 s = format (s, "\n locks:%d", adj->ia_node.fn_locks);
138 s = format (s, " node:[%d]:%U",
139 adj->rewrite_header.node_index,
140 format_vlib_node_name, vlib_get_main(),
141 adj->rewrite_header.node_index);
142 s = format (s, " next:[%d]:%U",
143 adj->rewrite_header.next_index,
144 format_vlib_next_node_name,
146 adj->rewrite_header.node_index,
147 adj->rewrite_header.next_index);
148 s = format(s, "\n children:\n ");
149 s = fib_node_children_format(adj->ia_node.fn_children, s);
158 * last lock/reference to the adj has gone, we no longer need it.
161 adj_last_lock_gone (ip_adjacency_t *adj)
163 vlib_main_t * vm = vlib_get_main();
165 ASSERT(0 == fib_node_list_get_size(adj->ia_node.fn_children));
166 ADJ_DBG(adj, "last-lock-gone");
168 vlib_worker_thread_barrier_sync (vm);
170 switch (adj->lookup_next_index)
172 case IP_LOOKUP_NEXT_MIDCHAIN:
173 dpo_reset(&adj->sub_type.midchain.next_dpo);
175 case IP_LOOKUP_NEXT_ARP:
176 case IP_LOOKUP_NEXT_REWRITE:
178 * complete and incomplete nbr adjs
180 adj_nbr_remove(adj_get_index(adj),
183 &adj->sub_type.nbr.next_hop,
184 adj->rewrite_header.sw_if_index);
186 case IP_LOOKUP_NEXT_GLEAN:
187 adj_glean_remove(adj->ia_nh_proto,
188 adj->rewrite_header.sw_if_index);
190 case IP_LOOKUP_NEXT_MCAST:
191 adj_mcast_remove(adj->ia_nh_proto,
192 adj->rewrite_header.sw_if_index);
196 * type not stored in any DB from which we need to remove it
201 vlib_worker_thread_barrier_release(vm);
203 fib_node_deinit(&adj->ia_node);
204 pool_put(adj_pool, adj);
208 adj_lock (adj_index_t adj_index)
212 if (adj_index_is_special(adj_index))
217 adj = adj_get(adj_index);
220 ADJ_DBG(adj, "lock");
221 fib_node_lock(&adj->ia_node);
225 adj_unlock (adj_index_t adj_index)
229 if (adj_index_is_special(adj_index))
234 adj = adj_get(adj_index);
237 ADJ_DBG(adj, "unlock");
240 fib_node_unlock(&adj->ia_node);
244 adj_child_add (adj_index_t adj_index,
245 fib_node_type_t child_type,
246 fib_node_index_t child_index)
248 ASSERT(ADJ_INDEX_INVALID != adj_index);
249 if (adj_index_is_special(adj_index))
254 return (fib_node_child_add(FIB_NODE_TYPE_ADJ,
261 adj_child_remove (adj_index_t adj_index,
264 if (adj_index_is_special(adj_index))
269 fib_node_child_remove(FIB_NODE_TYPE_ADJ,
275 * @brief Return the link type of the adjacency
278 adj_get_link_type (adj_index_t ai)
280 const ip_adjacency_t *adj;
284 return (adj->ia_link);
288 * @brief Return the sw interface index of the adjacency.
291 adj_get_sw_if_index (adj_index_t ai)
293 const ip_adjacency_t *adj;
297 return (adj->rewrite_header.sw_if_index);
301 * @brief Return the link type of the adjacency
304 adj_get_rewrite (adj_index_t ai)
306 vnet_rewrite_header_t *rw;
310 rw = &adj->rewrite_header;
312 ASSERT (rw->data_bytes != 0xfefe);
314 return (rw->data - rw->data_bytes);
318 adj_get_node (fib_node_index_t index)
322 adj = adj_get(index);
324 return (&adj->ia_node);
327 #define ADJ_FROM_NODE(_node) \
328 ((ip_adjacency_t*)((char*)_node - STRUCT_OFFSET_OF(ip_adjacency_t, ia_node)))
331 adj_node_last_lock_gone (fib_node_t *node)
333 adj_last_lock_gone(ADJ_FROM_NODE(node));
336 static fib_node_back_walk_rc_t
337 adj_back_walk_notify (fib_node_t *node,
338 fib_node_back_walk_ctx_t *ctx)
341 * Que pasa. yo soj en el final!
345 return (FIB_NODE_BACK_WALK_CONTINUE);
349 * Adjacency's graph node virtual function table
351 static const fib_node_vft_t adj_vft = {
352 .fnv_get = adj_get_node,
353 .fnv_last_lock = adj_node_last_lock_gone,
354 .fnv_back_walk = adj_back_walk_notify,
357 static clib_error_t *
358 adj_module_init (vlib_main_t * vm)
360 fib_node_register_type(FIB_NODE_TYPE_ADJ, &adj_vft);
362 adj_nbr_module_init();
363 adj_glean_module_init();
364 adj_midchain_module_init();
365 adj_mcast_module_init();
368 * one special adj to reserve index 0
370 special_v4_miss_adj_with_index_zero = adj_alloc(FIB_PROTOCOL_IP4);
375 VLIB_INIT_FUNCTION (adj_module_init);
377 static clib_error_t *
378 adj_show (vlib_main_t * vm,
379 unformat_input_t * input,
380 vlib_cli_command_t * cmd)
382 adj_index_t ai = ADJ_INDEX_INVALID;
383 u32 sw_if_index = ~0;
386 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
388 if (unformat (input, "%d", &ai))
390 else if (unformat (input, "sum"))
392 else if (unformat (input, "summary"))
394 else if (unformat (input, "%U",
395 unformat_vnet_sw_interface, vnet_get_main(),
404 vlib_cli_output (vm, "Number of adjacenies: %d", pool_elts(adj_pool));
405 vlib_cli_output (vm, "Per-adjacency counters: %s",
406 (adj_are_counters_enabled() ?
412 if (ADJ_INDEX_INVALID != ai)
414 if (pool_is_free_index(adj_pool, ai))
416 vlib_cli_output (vm, "adjacency %d invalid", ai);
420 vlib_cli_output (vm, "[@%d] %U",
422 format_ip_adjacency, ai,
423 FORMAT_IP_ADJACENCY_DETAIL);
428 pool_foreach_index(ai, adj_pool,
430 if (~0 != sw_if_index &&
431 sw_if_index != adj_get_sw_if_index(ai))
436 vlib_cli_output (vm, "[@%d] %U",
438 format_ip_adjacency, ai,
439 FORMAT_IP_ADJACENCY_NONE);
449 * Show all adjacencies.
451 * @cliexstart{sh adj}
454 * [@2] ipv4 via 1.0.0.2 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
455 * [@3] mpls via 1.0.0.2 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
456 * [@4] ipv4 via 1.0.0.3 loop0: IP4: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
457 * [@5] mpls via 1.0.0.3 loop0: MPLS_UNICAST: 00:00:22:aa:bb:cc -> 00:00:11:aa:bb:cc
460 VLIB_CLI_COMMAND (adj_show_command, static) = {
462 .short_help = "show adj [<adj_index>] [interface] [summary]",
463 .function = adj_show,
467 * @brief CLI invoked function to enable/disable per-adj counters
469 static clib_error_t *
470 adj_cli_counters_set (vlib_main_t * vm,
471 unformat_input_t * input,
472 vlib_cli_command_t * cmd)
474 clib_error_t *error = NULL;
477 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
479 if (unformat (input, "enable"))
481 else if (unformat (input, "disable"))
489 /* user requested something sensible */
490 adj_per_adj_counters = enable;
494 error = clib_error_return (0, "specify 'enable' or 'disable'");
501 * Enabe/disble per-adjacency counters. This is optional because it comes with
502 * a non-negligible performance cost.
504 VLIB_CLI_COMMAND (adj_cli_counters_set_command, static) = {
505 .path = "adjacency counters",
506 .short_help = "adjacency counters [enable|disable]",
507 .function = adj_cli_counters_set,