projects
/
collectd.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
daemon/plugin.c: remove unneccesary casts
[collectd.git]
/
src
/
utils_latency.c
diff --git
a/src/utils_latency.c
b/src/utils_latency.c
index
625fc42
..
6e4f873
100644
(file)
--- a/
src/utils_latency.c
+++ b/
src/utils_latency.c
@@
-65,7
+65,7
@@
struct latency_counter_s {
* When a value above this range is added, Histogram's range is increased by
* increasing the bin width (note that number of bins remains always at 1000).
* This operation of increasing bin width is little expensive as each bin need
* When a value above this range is added, Histogram's range is increased by
* increasing the bin width (note that number of bins remains always at 1000).
* This operation of increasing bin width is little expensive as each bin need
-* to be visited to update it
'
s count. To reduce frequent change of bin width,
+* to be visited to update its count. To reduce frequent change of bin width,
* new bin width will be the next nearest power of 2. Example: 2, 4, 8, 16, 32,
* 64, 128, 256, 512, 1024, 2048, 5086, ...
*
* new bin width will be the next nearest power of 2. Example: 2, 4, 8, 16, 32,
* 64, 128, 256, 512, 1024, 2048, 5086, ...
*
@@
-156,7
+156,7
@@
void latency_counter_add(latency_counter_t *lc, cdtime_t latency) /* {{{ */
change_bin_width(lc, latency);
bin = (latency - 1) / lc->bin_width;
if (bin >= HISTOGRAM_NUM_BINS) {
change_bin_width(lc, latency);
bin = (latency - 1) / lc->bin_width;
if (bin >= HISTOGRAM_NUM_BINS) {
-
ERROR("utils_latency:
latency_counter_add: Invalid bin: %" PRIu64, bin);
+
P_ERROR("
latency_counter_add: Invalid bin: %" PRIu64, bin);
return;
}
}
return;
}
}