1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
/*
* Copyright (c) 2015 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*
* counter.c: simple and packet/byte counters
*
* Copyright (c) 2008 Eliot Dresselhaus
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#include <vlib/vlib.h>
#include <vlib/stats/stats.h>
void
vlib_clear_simple_counters (vlib_simple_counter_main_t * cm)
{
counter_t *my_counters;
uword i, j;
for (i = 0; i < vec_len (cm->counters); i++)
{
my_counters = cm->counters[i];
for (j = 0; j < vec_len (my_counters); j++)
{
my_counters[j] = 0;
}
}
}
void
vlib_clear_combined_counters (vlib_combined_counter_main_t * cm)
{
vlib_counter_t *my_counters;
uword i, j;
for (i = 0; i < vec_len (cm->counters); i++)
{
my_counters = cm->counters[i];
for (j = 0; j < vec_len (my_counters); j++)
{
my_counters[j].packets = 0;
my_counters[j].bytes = 0;
}
}
}
void
vlib_validate_simple_counter (vlib_simple_counter_main_t * cm, u32 index)
{
vlib_thread_main_t *tm = vlib_get_thread_main ();
int i, resized = 0;
void *oldheap = vlib_stats_set_heap ();
vec_validate (cm->counters, tm->n_vlib_mains - 1);
for (i = 0; i < tm->n_vlib_mains; i++)
if (index >= vec_len (cm->counters[i]))
{
if (vec_resize_will_expand (cm->counters[i],
index - vec_len (cm->counters[i]) +
1 /* length_increment */))
resized++;
vec_validate_aligned (cm->counters[i], index, CLIB_CACHE_LINE_BYTES);
}
clib_mem_set_heap (oldheap);
/* Avoid the epoch increase when there was no counter vector resize. */
if (resized)
vlib_stats_update_counter (cm, index, STAT_DIR_TYPE_COUNTER_VECTOR_SIMPLE);
}
void
vlib_free_simple_counter (vlib_simple_counter_main_t * cm)
{
int i;
vlib_stats_delete_cm (cm);
void *oldheap = vlib_stats_set_heap ();
for (i = 0; i < vec_len (cm->counters); i++)
vec_free (cm->counters[i]);
vec_free (cm->counters);
clib_mem_set_heap (oldheap);
}
void
vlib_validate_combined_counter (vlib_combined_counter_main_t * cm, u32 index)
{
vlib_thread_main_t *tm = vlib_get_thread_main ();
int i, resized = 0;
void *oldheap = vlib_stats_set_heap ();
vec_validate (cm->counters, tm->n_vlib_mains - 1);
for (i = 0; i < tm->n_vlib_mains; i++)
if (index >= vec_len (cm->counters[i]))
{
if (vec_resize_will_expand (cm->counters[i],
index - vec_len (cm->counters[i]) +
1 /* length_increment */))
resized++;
vec_validate_aligned (cm->counters[i], index, CLIB_CACHE_LINE_BYTES);
}
clib_mem_set_heap (oldheap);
/* Avoid the epoch increase when there was no counter vector resize. */
if (resized)
vlib_stats_update_counter (cm, index,
STAT_DIR_TYPE_COUNTER_VECTOR_COMBINED);
}
int
vlib_validate_combined_counter_will_expand
(vlib_combined_counter_main_t * cm, u32 index)
{
vlib_thread_main_t *tm = vlib_get_thread_main ();
int i;
void *oldheap = vlib_stats_set_heap ();
/* Possibly once in recorded history */
if (PREDICT_FALSE (vec_len (cm->counters) == 0))
{
clib_mem_set_heap (oldheap);
return 1;
}
for (i = 0; i < tm->n_vlib_mains; i++)
{
/* Trivially OK, and proves that index >= vec_len(...) */
if (index < vec_len (cm->counters[i]))
continue;
if (vec_resize_will_expand (cm->counters[i],
index - vec_len (cm->counters[i]) +
1 /* length_increment */))
{
clib_mem_set_heap (oldheap);
return 1;
}
}
clib_mem_set_heap (oldheap);
return 0;
}
void
vlib_free_combined_counter (vlib_combined_counter_main_t * cm)
{
int i;
vlib_stats_delete_cm (cm);
void *oldheap = vlib_stats_set_heap ();
for (i = 0; i < vec_len (cm->counters); i++)
vec_free (cm->counters[i]);
vec_free (cm->counters);
clib_mem_set_heap (oldheap);
}
u32
vlib_combined_counter_n_counters (const vlib_combined_counter_main_t * cm)
{
ASSERT (cm->counters);
return (vec_len (cm->counters[0]));
}
u32
vlib_simple_counter_n_counters (const vlib_simple_counter_main_t * cm)
{
ASSERT (cm->counters);
return (vec_len (cm->counters[0]));
}
/*
* fd.io coding-style-patch-verification: ON
*
* Local Variables:
* eval: (c-set-style "gnu")
* End:
*/
|
