2 * Copyright (c) 2015 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 * counter.c: simple and packet/byte counters
18 * Copyright (c) 2008 Eliot Dresselhaus
20 * Permission is hereby granted, free of charge, to any person obtaining
21 * a copy of this software and associated documentation files (the
22 * "Software"), to deal in the Software without restriction, including
23 * without limitation the rights to use, copy, modify, merge, publish,
24 * distribute, sublicense, and/or sell copies of the Software, and to
25 * permit persons to whom the Software is furnished to do so, subject to
26 * the following conditions:
28 * The above copyright notice and this permission notice shall be
29 * included in all copies or substantial portions of the Software.
31 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
32 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
33 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
34 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
35 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
36 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
37 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
40 #include <vlib/vlib.h>
41 #include <vlib/stats/stats.h>
44 vlib_clear_simple_counters (vlib_simple_counter_main_t * cm)
46 counter_t *my_counters;
49 for (i = 0; i < vec_len (cm->counters); i++)
51 my_counters = cm->counters[i];
53 for (j = 0; j < vec_len (my_counters); j++)
61 vlib_clear_combined_counters (vlib_combined_counter_main_t * cm)
63 vlib_counter_t *my_counters;
66 for (i = 0; i < vec_len (cm->counters); i++)
68 my_counters = cm->counters[i];
70 for (j = 0; j < vec_len (my_counters); j++)
72 my_counters[j].packets = 0;
73 my_counters[j].bytes = 0;
79 vlib_validate_simple_counter (vlib_simple_counter_main_t * cm, u32 index)
81 vlib_thread_main_t *tm = vlib_get_thread_main ();
82 char *name = cm->stat_segment_name ? cm->stat_segment_name : cm->name;
86 if (cm->counters == 0)
87 cm->stats_entry_index = ~0;
88 vec_validate (cm->counters, tm->n_vlib_mains - 1);
89 for (int i = 0; i < tm->n_vlib_mains; i++)
90 vec_validate_aligned (cm->counters[i], index, CLIB_CACHE_LINE_BYTES);
94 if (cm->counters == 0)
95 cm->stats_entry_index = vlib_stats_add_counter_vector ("%s", name);
97 vlib_stats_validate (cm->stats_entry_index, tm->n_vlib_mains - 1, index);
98 cm->counters = vlib_stats_get_entry_data_pointer (cm->stats_entry_index);
102 vlib_free_simple_counter (vlib_simple_counter_main_t * cm)
104 if (cm->stats_entry_index == ~0)
106 for (int i = 0; i < vec_len (cm->counters); i++)
107 vec_free (cm->counters[i]);
108 vec_free (cm->counters);
112 vlib_stats_remove_entry (cm->stats_entry_index);
118 vlib_validate_combined_counter (vlib_combined_counter_main_t * cm, u32 index)
120 vlib_thread_main_t *tm = vlib_get_thread_main ();
121 char *name = cm->stat_segment_name ? cm->stat_segment_name : cm->name;
125 if (cm->counters == 0)
126 cm->stats_entry_index = ~0;
127 vec_validate (cm->counters, tm->n_vlib_mains - 1);
128 for (int i = 0; i < tm->n_vlib_mains; i++)
129 vec_validate_aligned (cm->counters[i], index, CLIB_CACHE_LINE_BYTES);
133 if (cm->counters == 0)
134 cm->stats_entry_index = vlib_stats_add_counter_pair_vector ("%s", name);
136 vlib_stats_validate (cm->stats_entry_index, tm->n_vlib_mains - 1, index);
137 cm->counters = vlib_stats_get_entry_data_pointer (cm->stats_entry_index);
141 vlib_validate_combined_counter_will_expand
142 (vlib_combined_counter_main_t * cm, u32 index)
144 vlib_thread_main_t *tm = vlib_get_thread_main ();
146 void *oldheap = vlib_stats_set_heap ();
148 /* Possibly once in recorded history */
149 if (PREDICT_FALSE (vec_len (cm->counters) == 0))
151 clib_mem_set_heap (oldheap);
155 for (i = 0; i < tm->n_vlib_mains; i++)
157 /* Trivially OK, and proves that index >= vec_len(...) */
158 if (index < vec_len (cm->counters[i]))
160 if (vec_resize_will_expand (cm->counters[i],
161 index - vec_len (cm->counters[i]) +
162 1 /* length_increment */))
164 clib_mem_set_heap (oldheap);
168 clib_mem_set_heap (oldheap);
173 vlib_free_combined_counter (vlib_combined_counter_main_t * cm)
175 if (cm->stats_entry_index == ~0)
177 for (int i = 0; i < vec_len (cm->counters); i++)
178 vec_free (cm->counters[i]);
179 vec_free (cm->counters);
183 vlib_stats_remove_entry (cm->stats_entry_index);
189 vlib_combined_counter_n_counters (const vlib_combined_counter_main_t * cm)
191 ASSERT (cm->counters);
192 return (vec_len (cm->counters[0]));
196 vlib_simple_counter_n_counters (const vlib_simple_counter_main_t * cm)
198 ASSERT (cm->counters);
199 return (vec_len (cm->counters[0]));
203 * fd.io coding-style-patch-verification: ON
206 * eval: (c-set-style "gnu")