0
0
Fork 0
mirror of https://github.com/netdata/netdata.git synced 2025-04-27 14:16:20 +00:00
netdata_netdata/web/api/queries/incremental_sum/incremental_sum.c
Costa Tsaousis c3dfbe52a6
netdata doubles ()
* netdata doubles

* fix cmocka test

* fix cmocka test again

* fix left-overs of long double to NETDATA_DOUBLE

* RRDDIM detached from disk representation; db settings in [db] section of netdata.conf

* update the memory before saving

* rrdset is now detached from file structures too

* on memory mode map, update the memory mapped structures on every iteration

* allow RRD_ID_LENGTH_MAX to be changed

* granularity secs, back to update every

* fix formatting

* more formatting
2022-06-28 17:04:37 +03:00

66 lines
1.7 KiB
C

// SPDX-License-Identifier: GPL-3.0-or-later
#include "incremental_sum.h"
// ----------------------------------------------------------------------------
// incremental sum
struct grouping_incremental_sum {
NETDATA_DOUBLE first;
NETDATA_DOUBLE last;
size_t count;
};
void grouping_create_incremental_sum(RRDR *r, const char *options __maybe_unused) {
r->internal.grouping_data = callocz(1, sizeof(struct grouping_incremental_sum));
}
// resets when switches dimensions
// so, clear everything to restart
void grouping_reset_incremental_sum(RRDR *r) {
struct grouping_incremental_sum *g = (struct grouping_incremental_sum *)r->internal.grouping_data;
g->first = 0;
g->last = 0;
g->count = 0;
}
void grouping_free_incremental_sum(RRDR *r) {
freez(r->internal.grouping_data);
r->internal.grouping_data = NULL;
}
void grouping_add_incremental_sum(RRDR *r, NETDATA_DOUBLE value) {
struct grouping_incremental_sum *g = (struct grouping_incremental_sum *)r->internal.grouping_data;
if(unlikely(!g->count)) {
g->first = value;
g->count++;
}
else {
g->last = value;
g->count++;
}
}
NETDATA_DOUBLE grouping_flush_incremental_sum(RRDR *r, RRDR_VALUE_FLAGS *rrdr_value_options_ptr) {
struct grouping_incremental_sum *g = (struct grouping_incremental_sum *)r->internal.grouping_data;
NETDATA_DOUBLE value;
if(unlikely(!g->count)) {
value = 0.0;
*rrdr_value_options_ptr |= RRDR_VALUE_EMPTY;
}
else if(unlikely(g->count == 1)) {
value = 0.0;
}
else {
value = g->last - g->first;
}
g->first = 0.0;
g->last = 0.0;
g->count = 0;
return value;
}