1 /* SPDX-License-Identifier: Apache-2.0
2 * Copyright(c) 2022 Cisco Systems, Inc.
6 #include <vlib/unix/unix.h>
7 #include <vlib/stats/stats.h>
23 [NODE_CLOCKS] = { .name = "clocks" },
24 [NODE_VECTORS] = { .name = "vectors" },
25 [NODE_CALLS] = { .name = "calls" },
26 [NODE_SUSPENDS] = { .name = "suspends" },
32 u32 symlinks[N_NODE_COUNTERS];
35 static vlib_stats_string_vector_t node_names = 0;
38 update_node_counters (vlib_stats_segment_t *sm)
40 clib_bitmap_t *bmp = 0;
41 vlib_main_t **stat_vms = 0;
42 vlib_node_t ***node_dups = 0;
46 vlib_node_get_nodes (0 /* vm, for barrier sync */,
47 (u32) ~0 /* all threads */, 1 /* include stats */,
48 0 /* barrier sync */, &node_dups, &stat_vms);
50 n_nodes = vec_len (node_dups[0]);
52 vec_validate (node_data, n_nodes - 1);
54 for (i = 0; i < n_nodes; i++)
55 if (vec_is_equal (node_data[i].name, node_dups[0][i]) == 0)
56 bmp = clib_bitmap_set (bmp, i, 1);
60 u32 last_thread = vlib_get_n_threads ();
61 vlib_stats_segment_lock ();
62 clib_bitmap_foreach (i, bmp)
64 vlib_node_t *n = node_dups[0][i];
65 if (node_data[i].name)
67 vec_free (node_data[i].name);
68 for (j = 0; j < ARRAY_LEN (node_data->symlinks); j++)
69 vlib_stats_remove_entry (node_data[i].symlinks[j]);
72 node_data[i].name = vec_dup (node_dups[0][i]->name);
73 vlib_stats_set_string_vector (&node_names, n->index, "%v", n->name);
75 for (int j = 0; j < ARRAY_LEN (node_counters); j++)
77 vlib_stats_validate (node_counters[j].entry_index, last_thread,
79 node_data[i].symlinks[j] = vlib_stats_add_symlink (
80 node_counters[j].entry_index, n->index, "/nodes/%U/%s",
81 format_vlib_stats_symlink, n->name, node_counters[j].name);
82 ASSERT (node_data[i].symlinks[j] != CLIB_U32_MAX);
85 vlib_stats_segment_unlock ();
89 for (j = 0; j < vec_len (node_dups); j++)
91 vlib_node_t **nodes = node_dups[j];
93 for (i = 0; i < vec_len (nodes); i++)
97 vlib_node_t *n = nodes[i];
99 counters = vlib_stats_get_entry_data_pointer (
100 node_counters[NODE_CLOCKS].entry_index);
102 c[n->index] = n->stats_total.clocks - n->stats_last_clear.clocks;
104 counters = vlib_stats_get_entry_data_pointer (
105 node_counters[NODE_VECTORS].entry_index);
107 c[n->index] = n->stats_total.vectors - n->stats_last_clear.vectors;
109 counters = vlib_stats_get_entry_data_pointer (
110 node_counters[NODE_CALLS].entry_index);
112 c[n->index] = n->stats_total.calls - n->stats_last_clear.calls;
114 counters = vlib_stats_get_entry_data_pointer (
115 node_counters[NODE_SUSPENDS].entry_index);
117 c[n->index] = n->stats_total.suspends - n->stats_last_clear.suspends;
119 vec_free (node_dups[j]);
121 vec_free (node_dups);
126 do_stat_segment_updates (vlib_main_t *vm, vlib_stats_segment_t *sm)
128 if (sm->node_counters_enabled)
129 update_node_counters (sm);
131 vlib_stats_collector_t *c;
132 pool_foreach (c, sm->collectors)
134 vlib_stats_collector_data_t data = {
135 .entry_index = c->entry_index,
136 .vector_index = c->vector_index,
137 .private_data = c->private_data,
138 .entry = sm->directory_vector + c->entry_index,
143 /* Heartbeat, so clients detect we're still here */
144 sm->directory_vector[STAT_COUNTER_HEARTBEAT].value++;
148 stat_segment_collector_process (vlib_main_t *vm, vlib_node_runtime_t *rt,
151 vlib_stats_segment_t *sm = vlib_stats_get_segment ();
153 if (sm->node_counters_enabled)
155 node_names = vlib_stats_add_string_vector ("/sys/node/names");
158 for (int x = 0; x < ARRAY_LEN (node_counters); x++)
160 node_counters[x].entry_index = vlib_stats_add_counter_vector (
161 "/sys/node/%s", node_counters[x].name);
162 ASSERT (node_counters[x].entry_index != CLIB_U32_MAX);
168 do_stat_segment_updates (vm, sm);
169 vlib_process_suspend (vm, sm->update_interval);
171 return 0; /* or not */
174 VLIB_REGISTER_NODE (stat_segment_collector, static) = {
175 .function = stat_segment_collector_process,
176 .name = "statseg-collector-process",
177 .type = VLIB_NODE_TYPE_PROCESS,