12 #define HOSTNAME_MAX 1024
13 char *hostname = "unknown";
15 unsigned long rrd_stats_one_json(RRDSET *st, char *options, struct web_buffer *wb)
17 time_t now = time(NULL);
18 web_buffer_increase(wb, 65536);
20 pthread_rwlock_rdlock(&st->rwlock);
24 "\t\t\t\"id\": \"%s\",\n"
25 "\t\t\t\"name\": \"%s\",\n"
26 "\t\t\t\"type\": \"%s\",\n"
27 "\t\t\t\"family\": \"%s\",\n"
28 "\t\t\t\"title\": \"%s\",\n"
29 "\t\t\t\"priority\": %ld,\n"
30 "\t\t\t\"enabled\": %d,\n"
31 "\t\t\t\"units\": \"%s\",\n"
32 "\t\t\t\"url\": \"/data/%s/%s\",\n"
33 "\t\t\t\"chart_type\": \"%s\",\n"
34 "\t\t\t\"counter\": %ld,\n"
35 "\t\t\t\"entries\": %ld,\n"
36 "\t\t\t\"first_entry_t\": %lu,\n"
37 "\t\t\t\"last_entry\": %ld,\n"
38 "\t\t\t\"last_entry_t\": %lu,\n"
39 "\t\t\t\"last_entry_secs_ago\": %lu,\n"
40 "\t\t\t\"update_every\": %d,\n"
41 "\t\t\t\"isdetail\": %d,\n"
42 "\t\t\t\"usec_since_last_update\": %llu,\n"
43 "\t\t\t\"collected_total\": " TOTAL_NUMBER_FORMAT ",\n"
44 "\t\t\t\"last_collected_total\": " TOTAL_NUMBER_FORMAT ",\n"
45 "\t\t\t\"dimensions\": [\n"
54 , st->name, options?options:""
55 , rrdset_type_name(st->chart_type)
58 , rrdset_first_entry_t(st)
59 , rrdset_last_slot(st)
60 , rrdset_last_entry_t(st)
61 , (now < rrdset_last_entry_t(st)) ? (time_t)0 : now - rrdset_last_entry_t(st)
64 , st->usec_since_last_update
66 , st->last_collected_total
69 unsigned long memory = st->memsize;
72 for(rd = st->dimensions; rd ; rd = rd->next) {
73 web_buffer_increase(wb, 4096);
75 memory += rd->memsize;
79 "\t\t\t\t\t\"id\": \"%s\",\n"
80 "\t\t\t\t\t\"name\": \"%s\",\n"
81 "\t\t\t\t\t\"entries\": %ld,\n"
82 "\t\t\t\t\t\"isHidden\": %d,\n"
83 "\t\t\t\t\t\"algorithm\": \"%s\",\n"
84 "\t\t\t\t\t\"multiplier\": %ld,\n"
85 "\t\t\t\t\t\"divisor\": %ld,\n"
86 "\t\t\t\t\t\"last_entry_t\": %lu,\n"
87 "\t\t\t\t\t\"collected_value\": " COLLECTED_NUMBER_FORMAT ",\n"
88 "\t\t\t\t\t\"calculated_value\": " CALCULATED_NUMBER_FORMAT ",\n"
89 "\t\t\t\t\t\"last_collected_value\": " COLLECTED_NUMBER_FORMAT ",\n"
90 "\t\t\t\t\t\"last_calculated_value\": " CALCULATED_NUMBER_FORMAT ",\n"
91 "\t\t\t\t\t\"memory\": %lu\n"
97 , rrddim_algorithm_name(rd->algorithm)
100 , rd->last_collected_time.tv_sec
101 , rd->collected_value
102 , rd->calculated_value
103 , rd->last_collected_value
104 , rd->last_calculated_value
110 web_buffer_printf(wb,
112 "\t\t\t\"memory\" : %lu\n"
117 pthread_rwlock_unlock(&st->rwlock);
121 #define RRD_GRAPH_JSON_HEADER "{\n\t\"charts\": [\n"
122 #define RRD_GRAPH_JSON_FOOTER "\n\t]\n}\n"
124 void rrd_stats_graph_json(RRDSET *st, char *options, struct web_buffer *wb)
126 web_buffer_increase(wb, 2048);
128 web_buffer_printf(wb, RRD_GRAPH_JSON_HEADER);
129 rrd_stats_one_json(st, options, wb);
130 web_buffer_printf(wb, RRD_GRAPH_JSON_FOOTER);
133 void rrd_stats_all_json(struct web_buffer *wb)
135 web_buffer_increase(wb, 2048);
137 unsigned long memory = 0;
141 web_buffer_printf(wb, RRD_GRAPH_JSON_HEADER);
143 pthread_rwlock_rdlock(&rrdset_root_rwlock);
144 for(st = rrdset_root, c = 0; st ; st = st->next) {
146 if(c) web_buffer_printf(wb, "%s", ",\n");
147 memory += rrd_stats_one_json(st, NULL, wb);
151 pthread_rwlock_unlock(&rrdset_root_rwlock);
153 web_buffer_printf(wb, "\n\t],\n"
154 "\t\"hostname\": \"%s\",\n"
155 "\t\"update_every\": %d,\n"
156 "\t\"history\": %d,\n"
157 "\t\"memory\": %lu\n"
161 , rrd_default_history_entries
168 // ----------------------------------------------------------------------------
171 #define RRDR_EMPTY 0x01
172 #define RRDR_RESET 0x02
173 #define RRDR_HIDDEN 0x04
174 #define RRDR_NONZERO 0x08
177 typedef struct rrdresult {
178 RRDSET *st; // the chart this result refers to
180 int d; // the number of dimensions
181 int n; // the number of values in the arrays
183 uint8_t *od; // the options for the dimensions
185 time_t *t; // array of n timestamps
186 calculated_number *v; // array n x d values
187 uint8_t *o; // array n x d options
189 int c; // current line ( 0 ~ n )
191 int has_st_lock; // if st is read locked by us
194 static void rrdr_dump(RRDR *r)
199 fprintf(stderr, "\nCHART %s (%s)\n", r->st->id, r->st->name);
201 for(c = 0, d = r->st->dimensions; d ;c++, d = d->next) {
202 fprintf(stderr, "DIMENSION %s (%s), %s%s%s%s\n"
205 , (r->od[c] & RRDR_EMPTY)?"EMPTY ":""
206 , (r->od[c] & RRDR_RESET)?"RESET ":""
207 , (r->od[c] & RRDR_HIDDEN)?"HIDDEN ":""
208 , (r->od[c] & RRDR_NONZERO)?"NONZERO ":""
213 fprintf(stderr, "RRDR does not have any values in it.\n");
217 fprintf(stderr, "RRDR includes %d values in it:\n", r->c + 1);
219 // for each line in the array
220 for(i = 0; i <= r->c ;i++) {
221 calculated_number *cn = &r->v[ i * r->d ];
222 uint8_t *co = &r->o[ i * r->d ];
224 // print the id and the timestamp of the line
225 fprintf(stderr, "%ld %ld ", i + 1, r->t[i]);
227 // for each dimension
228 for(c = 0, d = r->st->dimensions; d ;c++, d = d->next) {
229 if(unlikely(r->od[c] & RRDR_HIDDEN)) continue;
230 if(unlikely(!(r->od[c] & RRDR_NONZERO))) continue;
232 if(co[c] & RRDR_EMPTY)
233 fprintf(stderr, "null ");
235 fprintf(stderr, CALCULATED_NUMBER_FORMAT " %s%s%s%s "
237 , (co[c] & RRDR_EMPTY)?"E":" "
238 , (co[c] & RRDR_RESET)?"R":" "
239 , (co[c] & RRDR_HIDDEN)?"H":" "
240 , (co[c] & RRDR_NONZERO)?"N":" "
244 fprintf(stderr, "\n");
248 inline static calculated_number *rrdr_line_values(RRDR *r)
250 return &r->v[ r->c * r->d ];
253 inline static uint8_t *rrdr_line_options(RRDR *r)
255 return &r->o[ r->c * r->d ];
258 inline static int rrdr_line_init(RRDR *r, time_t t)
261 if(unlikely(r->c >= r->n)) {
272 inline static void rrdr_lock_rrdset(RRDR *r) {
274 error("NULL value given!");
278 pthread_rwlock_rdlock(&r->st->rwlock);
282 inline static void rrdr_unlock_rrdset(RRDR *r) {
284 error("NULL value given!");
288 if(likely(r->has_st_lock)) {
289 pthread_rwlock_unlock(&r->st->rwlock);
294 inline static void rrdr_free(RRDR *r)
297 error("NULL value given!");
301 rrdr_unlock_rrdset(r);
302 if(likely(r->t)) free(r->t);
303 if(likely(r->v)) free(r->v);
304 if(likely(r->o)) free(r->o);
305 if(likely(r->od)) free(r->od);
309 static RRDR *rrdr_create(RRDSET *st, int n)
312 error("NULL value given!");
316 RRDR *r = calloc(1, sizeof(RRDR));
317 if(unlikely(!r)) goto cleanup;
324 for(rd = st->dimensions ; rd ; rd = rd->next) r->d++;
327 r->t = malloc(n * sizeof(time_t));
328 if(unlikely(!r->t)) goto cleanup;
330 r->t = malloc(n * sizeof(time_t));
331 if(unlikely(!r->t)) goto cleanup;
333 r->v = malloc(n * r->d * sizeof(calculated_number));
334 if(unlikely(!r->v)) goto cleanup;
336 r->o = malloc(n * r->d * sizeof(uint8_t));
337 if(unlikely(!r->o)) goto cleanup;
339 r->od = calloc(r->d, sizeof(uint8_t));
340 if(unlikely(!r->od)) goto cleanup;
347 error("Cannot allocate memory");
348 if(likely(r)) rrdr_free(r);
352 RRDR *rrd2rrdr(RRDSET *st, long points, time_t after, time_t before, int group_method)
354 int debug = st->debug;
356 time_t first_entry_t = rrdset_first_entry_t(st);
357 time_t last_entry_t = rrdset_last_entry_t(st);
359 // allow relative for before and after
360 if(before <= st->update_every * st->entries) before = last_entry_t + before;
361 if(after <= st->update_every * st->entries) after = last_entry_t + after;
363 // make sure they are within our timeframe
364 if(before > last_entry_t) before = last_entry_t;
365 if(before < first_entry_t) before = first_entry_t;
367 if(after > last_entry_t) after = last_entry_t;
368 if(after < first_entry_t) after = first_entry_t;
370 // check if they are upside down
377 // the duration of the chart
378 time_t duration = before - after;
379 if(duration <= 0) return NULL;
381 // check the required points
382 if(points <= 0) points = duration;
384 // calculate proper grouping of source data
385 long group = duration / points;
386 if(group <= 0) group = 1;
387 if(duration / group > points) group++;
389 // error("NEW: points=%d after=%d before=%d group=%d, duration=%d", points, after, before, group, duration);
392 // before = the end time of the calculation
393 // after = the start time of the calculation
394 // duration = the duration of the calculation
395 // group = the number of source points to aggregate / group together
396 // method = the method of grouping source points
397 // points = the number of points to generate
400 // -------------------------------------------------------------------------
401 // initialize our result set
403 RRDR *r = rrdr_create(st, points);
410 // find how many dimensions we have
411 long dimensions = r->d;
414 // -------------------------------------------------------------------------
415 // checks for debugging
417 if(debug) debug(D_RRD_STATS, "INFO %s first_t: %lu, last_t: %lu, all_duration: %lu, after: %lu, before: %lu, duration: %lu, points: %ld, group: %ld"
421 , last_entry_t - first_entry_t
430 // -------------------------------------------------------------------------
431 // temp arrays for keeping values per dimension
433 calculated_number group_values[dimensions]; // keep sums when grouping
434 long group_counts[dimensions]; // keep the number of values added to group_values
435 uint8_t group_options[dimensions];
436 uint8_t found_non_zero[dimensions];
442 for( rd = st->dimensions, c = 0 ; rd && c < dimensions ; rd = rd->next, c++) {
445 group_options[c] = 0;
446 found_non_zero[c] = 0;
450 // -------------------------------------------------------------------------
453 long t = rrdset_time2slot(st, before), // rrdset_last_slot(st),
454 stop_at_t = rrdset_time2slot(st, after),
460 // align to group for proper panning of data
463 time_t now = rrdset_slot2time(st, t),
464 dt = st->update_every,
467 if(debug) debug(D_RRD_STATS, "BEGIN %s after_t: %lu (stop slot %ld), before_t: %lu (start slot %ld), start_t(now): %lu"
476 for( ; !stop_now ; now -= dt, t--) {
477 if(unlikely(t < 0)) c = st->entries - 1;
478 if(t == stop_at_t) stop_now = 1;
480 if(debug) debug(D_RRD_STATS, "ROW %s c: %ld, group_count: %ld, added: %ld, now: %lu, %s %s"
486 , (group_count + 1 == group)?"PRINT":" - "
487 , (now >= after && now <= before)?"RANGE":" - "
490 // make sure we return data in the proper time range
491 if(unlikely(now > before)) continue;
492 if(unlikely(now < after)) break;
494 if(group_count == 0) group_start_t = now;
497 if(unlikely(group_count == group)) {
498 if(unlikely(added >= points)) break;
502 // do the calculations
503 for(rd = st->dimensions, c = 0 ; likely(rd && c < dimensions) ; rd = rd->next, c++) {
504 storage_number n = rd->values[t];
505 if(unlikely(!does_storage_number_exist(n))) continue;
509 calculated_number value = unpack_storage_number(n);
511 group_options[c] |= RRDR_NONZERO;
512 found_non_zero[c] = 1;
515 if(unlikely(did_storage_number_reset(n)))
516 group_options[c] |= RRDR_RESET;
518 switch(group_method) {
520 if(unlikely(abs(value) > abs(group_values[c])))
521 group_values[c] = value;
527 group_values[c] += value;
533 if(unlikely(add_this)) {
534 if(!rrdr_line_init(r, group_start_t)) break;
536 calculated_number *cn = rrdr_line_values(r);
537 uint8_t *co = rrdr_line_options(r);
539 for(rd = st->dimensions, c = 0 ; likely(rd && c < dimensions) ; rd = rd->next, c++) {
541 // update the dimension options
542 if(found_non_zero[c]) r->od[c] |= RRDR_NONZERO;
543 if(rd->hidden) r->od[c] |= RRDR_HIDDEN;
545 // store the specific point options
546 co[c] = group_options[c];
549 if(group_counts[c] == 0) {
553 else if(unlikely(group_method == GROUP_AVERAGE)) {
554 cn[c] = group_values[c] / group_counts[c];
557 cn[c] = group_values[c];
560 // reset them for the next loop
563 group_options[c] = 0;
577 unsigned long rrd_stats_json(int type, RRDSET *st, struct web_buffer *wb, int points, int group, int group_method, time_t after, time_t before, int only_non_zero)
580 pthread_rwlock_rdlock(&st->rwlock);
583 // -------------------------------------------------------------------------
584 // switch from JSON to google JSON
589 case DATASOURCE_GOOGLE_JSON:
590 case DATASOURCE_GOOGLE_JSONP:
595 case DATASOURCE_JSON:
601 // -------------------------------------------------------------------------
602 // validate the parameters
604 if(points < 1) points = 1;
605 if(group < 1) group = 1;
607 if(before == 0 || before > rrdset_last_entry_t(st)) before = rrdset_last_entry_t(st);
608 if(after == 0 || after < rrdset_first_entry_t(st)) after = rrdset_first_entry_t(st);
612 // our return value (the last timestamp printed)
613 // this is required to detect re-transmit in google JSONP
614 time_t last_timestamp = 0;
617 // -------------------------------------------------------------------------
618 // find how many dimensions we have
622 for( rd = st->dimensions ; rd ; rd = rd->next) dimensions++;
624 pthread_rwlock_unlock(&st->rwlock);
625 web_buffer_printf(wb, "No dimensions yet.");
630 // -------------------------------------------------------------------------
631 // prepare various strings, to speed up the loop
633 char overflow_annotation[201]; snprintf(overflow_annotation, 200, ",{%sv%s:%sRESET OR OVERFLOW%s},{%sv%s:%sThe counters have been wrapped.%s}", kq, kq, sq, sq, kq, kq, sq, sq);
634 char normal_annotation[201]; snprintf(normal_annotation, 200, ",{%sv%s:null},{%sv%s:null}", kq, kq, kq, kq);
635 char pre_date[51]; snprintf(pre_date, 50, " {%sc%s:[{%sv%s:%s", kq, kq, kq, kq, sq);
636 char post_date[21]; snprintf(post_date, 20, "%s}", sq);
637 char pre_value[21]; snprintf(pre_value, 20, ",{%sv%s:", kq, kq);
638 char post_value[21]; snprintf(post_value, 20, "}");
641 // -------------------------------------------------------------------------
642 // checks for debugging
645 debug(D_RRD_STATS, "%s first_entry_t = %lu, last_entry_t = %lu, duration = %lu, after = %lu, before = %lu, duration = %lu, entries_to_show = %lu, group = %lu"
647 , rrdset_first_entry_t(st)
648 , rrdset_last_entry_t(st)
649 , rrdset_last_entry_t(st) - rrdset_first_entry_t(st)
658 debug(D_RRD_STATS, "WARNING: %s The newest value in the database (%lu) is earlier than the oldest (%lu)", st->name, before, after);
660 if((before - after) > st->entries * st->update_every)
661 debug(D_RRD_STATS, "WARNING: %s The time difference between the oldest and the newest entries (%lu) is higher than the capacity of the database (%lu)", st->name, before - after, st->entries * st->update_every);
665 // -------------------------------------------------------------------------
666 // temp arrays for keeping values per dimension
668 calculated_number group_values[dimensions]; // keep sums when grouping
669 int print_hidden[dimensions]; // keep hidden flags
670 int found_non_zero[dimensions];
671 int found_non_existing[dimensions];
674 for( rd = st->dimensions, c = 0 ; rd && c < dimensions ; rd = rd->next, c++) {
676 print_hidden[c] = rd->hidden;
677 found_non_zero[c] = 0;
678 found_non_existing[c] = 0;
682 // error("OLD: points=%d after=%d before=%d group=%d, duration=%d", entries_to_show, before - (st->update_every * group * entries_to_show), before, group, before - after + 1);
683 // rrd2array(st, entries_to_show, before - (st->update_every * group * entries_to_show), before, group_method, only_non_zero);
684 // rrd2rrdr(st, entries_to_show, before - (st->update_every * group * entries_to_show), before, group_method);
686 // -------------------------------------------------------------------------
687 // remove dimensions that contain only zeros
690 if(only_non_zero) max_loop = 2;
692 for(; max_loop ; max_loop--) {
694 // -------------------------------------------------------------------------
695 // print the JSON header
697 web_buffer_printf(wb, "{\n %scols%s:\n [\n", kq, kq);
698 web_buffer_printf(wb, " {%sid%s:%s%s,%slabel%s:%stime%s,%spattern%s:%s%s,%stype%s:%sdatetime%s},\n", kq, kq, sq, sq, kq, kq, sq, sq, kq, kq, sq, sq, kq, kq, sq, sq);
699 web_buffer_printf(wb, " {%sid%s:%s%s,%slabel%s:%s%s,%spattern%s:%s%s,%stype%s:%sstring%s,%sp%s:{%srole%s:%sannotation%s}},\n", kq, kq, sq, sq, kq, kq, sq, sq, kq, kq, sq, sq, kq, kq, sq, sq, kq, kq, kq, kq, sq, sq);
700 web_buffer_printf(wb, " {%sid%s:%s%s,%slabel%s:%s%s,%spattern%s:%s%s,%stype%s:%sstring%s,%sp%s:{%srole%s:%sannotationText%s}}", kq, kq, sq, sq, kq, kq, sq, sq, kq, kq, sq, sq, kq, kq, sq, sq, kq, kq, kq, kq, sq, sq);
702 // print the header for each dimension
703 // and update the print_hidden array for the dimensions that should be hidden
705 for( rd = st->dimensions, c = 0 ; rd && c < dimensions ; rd = rd->next, c++) {
706 if(!print_hidden[c]) {
708 web_buffer_printf(wb, ",\n {%sid%s:%s%s,%slabel%s:%s%s%s,%spattern%s:%s%s,%stype%s:%snumber%s}", kq, kq, sq, sq, kq, kq, sq, rd->name, sq, kq, kq, sq, sq, kq, kq, sq, sq);
712 web_buffer_printf(wb, ",\n {%sid%s:%s%s,%slabel%s:%s%s%s,%spattern%s:%s%s,%stype%s:%snumber%s}", kq, kq, sq, sq, kq, kq, sq, "no data", sq, kq, kq, sq, sq, kq, kq, sq, sq);
715 // print the begin of row data
716 web_buffer_printf(wb, "\n ],\n %srows%s:\n [\n", kq, kq);
719 // -------------------------------------------------------------------------
722 int annotate_reset = 0;
723 int annotation_count = 0;
725 // the minimum line length we expect
726 int line_size = 4096 + (dimensions * 200);
728 long t = rrdset_time2slot(st, before),
729 stop_at_t = rrdset_time2slot(st, after),
734 time_t now = rrdset_slot2time(st, t),
735 dt = st->update_every;
737 long count = 0, printed = 0, group_count = 0;
740 if(st->debug) debug(D_RRD_STATS, "%s: REQUEST after:%lu before:%lu, points:%d, group:%d, CHART cur:%ld first: %lu last:%lu, CALC start_t:%ld, stop_t:%ld"
747 , rrdset_first_entry_t(st)
748 , rrdset_last_entry_t(st)
753 for(; !stop_now ; now -= dt, t--) {
754 if(t < 0) t = st->entries - 1;
755 if(t == stop_at_t) stop_now = 1;
759 if(st->debug) debug(D_RRD_STATS, "%s t = %ld, count = %ld, group_count = %ld, printed = %ld, now = %lu, %s %s"
766 , (group_count + 1 == group)?"PRINT":" - "
767 , (now >= after && now <= before)?"RANGE":" - "
771 // make sure we return data in the proper time range
772 if(now > before) continue;
773 if(now < after) break;
775 //if(rrdset_slot2time(st, t) != now)
776 // error("%s: slot=%ld, now=%ld, slot2time=%ld, diff=%ld, last_entry_t=%ld, rrdset_last_slot=%ld", st->id, t, now, rrdset_slot2time(st,t), now - rrdset_slot2time(st,t), rrdset_last_entry_t(st), rrdset_last_slot(st));
781 // check if we have to print this now
782 if(group_count == group) {
783 if(printed >= points) {
784 // debug(D_RRD_STATS, "Already printed all rows. Stopping.");
788 // check if we may exceed the buffer provided
789 web_buffer_increase(wb, line_size);
791 // generate the local date time
792 struct tm *tm = localtime(&now);
793 if(!tm) { error("localtime() failed."); continue; }
794 if(now > last_timestamp) last_timestamp = now;
796 if(printed) web_buffer_strcpy(wb, "]},\n");
797 web_buffer_strcpy(wb, pre_date);
798 web_buffer_jsdate(wb, tm->tm_year + 1900, tm->tm_mon, tm->tm_mday, tm->tm_hour, tm->tm_min, tm->tm_sec);
799 web_buffer_strcpy(wb, post_date);
804 // do the calculations
805 for(rd = st->dimensions, c = 0 ; rd && c < dimensions ; rd = rd->next, c++) {
806 storage_number n = rd->values[t];
807 calculated_number value = unpack_storage_number(n);
809 if(!does_storage_number_exist(n)) {
811 found_non_existing[c]++;
813 if(did_storage_number_reset(n)) annotate_reset = 1;
815 switch(group_method) {
817 if(abs(value) > abs(group_values[c])) group_values[c] = value;
821 group_values[c] += value;
826 group_values[c] += value;
827 if(print_this) group_values[c] /= ( group_count - found_non_existing[c] );
835 web_buffer_strcpy(wb, overflow_annotation);
839 web_buffer_strcpy(wb, normal_annotation);
842 for(c = 0 ; c < dimensions ; c++) {
843 if(found_non_existing[c] == group_count) {
844 // all entries are non-existing
846 web_buffer_strcpy(wb, pre_value);
847 web_buffer_strcpy(wb, "null");
848 web_buffer_strcpy(wb, post_value);
850 else if(!print_hidden[c]) {
852 web_buffer_strcpy(wb, pre_value);
853 web_buffer_rrd_value(wb, group_values[c]);
854 web_buffer_strcpy(wb, post_value);
856 if(group_values[c]) found_non_zero[c]++;
859 // reset them for the next loop
861 found_non_existing[c] = 0;
864 // if all dimensions are hidden, print a null
866 web_buffer_strcpy(wb, pre_value);
867 web_buffer_strcpy(wb, "null");
868 web_buffer_strcpy(wb, post_value);
876 if(printed) web_buffer_printf(wb, "]}");
877 web_buffer_printf(wb, "\n ]\n}\n");
879 if(only_non_zero && max_loop > 1) {
881 for(rd = st->dimensions, c = 0 ; rd && c < dimensions ; rd = rd->next, c++) {
883 found_non_existing[c] = 0;
885 if(!print_hidden[c] && !found_non_zero[c]) {
891 if(changed) web_buffer_reset(wb);
898 debug(D_RRD_STATS, "RRD_STATS_JSON: %s total %ld bytes", st->name, wb->bytes);
900 pthread_rwlock_unlock(&st->rwlock);
901 return last_timestamp;