src/rrd2json.c

   1 #include <pthread.h>
   2 #include <sys/time.h>
   3 #include <stdlib.h>
   4
   5 #include "log.h"
   6 #include "common.h"
   7 #include "rrd2json.h"
   8
   9 #define HOSTNAME_MAX 1024
  10 char *hostname = "unknown";
  11
  12 unsigned long rrd_stats_one_json(RRDSET *st, char *options, struct web_buffer *wb)
  13 {
  14         time_t now = time(NULL);
  15         web_buffer_increase(wb, 65536);
  16
  17         pthread_rwlock_rdlock(&st->rwlock);
  18
  19         web_buffer_printf(wb,
  20                 "\t\t{\n"
  21                 "\t\t\t\"id\": \"%s\",\n"
  22                 "\t\t\t\"name\": \"%s\",\n"
  23                 "\t\t\t\"type\": \"%s\",\n"
  24                 "\t\t\t\"family\": \"%s\",\n"
  25                 "\t\t\t\"title\": \"%s\",\n"
  26                 "\t\t\t\"priority\": %ld,\n"
  27                 "\t\t\t\"enabled\": %d,\n"
  28                 "\t\t\t\"units\": \"%s\",\n"
  29                 "\t\t\t\"url\": \"/data/%s/%s\",\n"
  30                 "\t\t\t\"chart_type\": \"%s\",\n"
  31                 "\t\t\t\"counter\": %ld,\n"
  32                 "\t\t\t\"entries\": %ld,\n"
  33                 "\t\t\t\"first_entry_t\": %lu,\n"
  34                 "\t\t\t\"last_entry\": %ld,\n"
  35                 "\t\t\t\"last_entry_t\": %lu,\n"
  36                 "\t\t\t\"last_entry_secs_ago\": %lu,\n"
  37                 "\t\t\t\"update_every\": %d,\n"
  38                 "\t\t\t\"isdetail\": %d,\n"
  39                 "\t\t\t\"usec_since_last_update\": %llu,\n"
  40                 "\t\t\t\"collected_total\": " TOTAL_NUMBER_FORMAT ",\n"
  41                 "\t\t\t\"last_collected_total\": " TOTAL_NUMBER_FORMAT ",\n"
  42                 "\t\t\t\"dimensions\": [\n"
  43                 , st->id
  44                 , st->name
  45                 , st->type
  46                 , st->family
  47                 , st->title
  48                 , st->priority
  49                 , st->enabled
  50                 , st->units
  51                 , st->name, options?options:""
  52                 , rrdset_type_name(st->chart_type)
  53                 , st->counter
  54                 , st->entries
  55                 , rrdset_first_entry_t(st)
  56                 , rrdset_last_slot(st)
  57                 , rrdset_last_entry_t(st)
  58                 , (now < rrdset_last_entry_t(st)) ? (time_t)0 : now - rrdset_last_entry_t(st)
  59                 , st->update_every
  60                 , st->isdetail
  61                 , st->usec_since_last_update
  62                 , st->collected_total
  63                 , st->last_collected_total
  64                 );
  65
  66         unsigned long memory = st->memsize;
  67
  68         RRDDIM *rd;
  69         for(rd = st->dimensions; rd ; rd = rd->next) {
  70                 web_buffer_increase(wb, 4096);
  71
  72                 memory += rd->memsize;
  73
  74                 web_buffer_printf(wb,
  75                         "\t\t\t\t{\n"
  76                         "\t\t\t\t\t\"id\": \"%s\",\n"
  77                         "\t\t\t\t\t\"name\": \"%s\",\n"
  78                         "\t\t\t\t\t\"entries\": %ld,\n"
  79                         "\t\t\t\t\t\"isHidden\": %d,\n"
  80                         "\t\t\t\t\t\"algorithm\": \"%s\",\n"
  81                         "\t\t\t\t\t\"multiplier\": %ld,\n"
  82                         "\t\t\t\t\t\"divisor\": %ld,\n"
  83                         "\t\t\t\t\t\"last_entry_t\": %lu,\n"
  84                         "\t\t\t\t\t\"collected_value\": " COLLECTED_NUMBER_FORMAT ",\n"
  85                         "\t\t\t\t\t\"calculated_value\": " CALCULATED_NUMBER_FORMAT ",\n"
  86                         "\t\t\t\t\t\"last_collected_value\": " COLLECTED_NUMBER_FORMAT ",\n"
  87                         "\t\t\t\t\t\"last_calculated_value\": " CALCULATED_NUMBER_FORMAT ",\n"
  88                         "\t\t\t\t\t\"memory\": %lu\n"
  89                         "\t\t\t\t}%s\n"
  90                         , rd->id
  91                         , rd->name
  92                         , rd->entries
  93                         , rd->hidden
  94                         , rrddim_algorithm_name(rd->algorithm)
  95                         , rd->multiplier
  96                         , rd->divisor
  97                         , rd->last_collected_time.tv_sec
  98                         , rd->collected_value
  99                         , rd->calculated_value
 100                         , rd->last_collected_value
 101                         , rd->last_calculated_value
 102                         , rd->memsize
 103                         , rd->next?",":""
 104                         );
 105         }
 106
 107         web_buffer_printf(wb,
 108                 "\t\t\t],\n"
 109                 "\t\t\t\"memory\" : %lu\n"
 110                 "\t\t}"
 111                 , memory
 112                 );
 113
 114         pthread_rwlock_unlock(&st->rwlock);
 115         return memory;
 116 }
 117
 118 #define RRD_GRAPH_JSON_HEADER "{\n\t\"charts\": [\n"
 119 #define RRD_GRAPH_JSON_FOOTER "\n\t]\n}\n"
 120
 121 void rrd_stats_graph_json(RRDSET *st, char *options, struct web_buffer *wb)
 122 {
 123         web_buffer_increase(wb, 2048);
 124
 125         web_buffer_printf(wb, RRD_GRAPH_JSON_HEADER);
 126         rrd_stats_one_json(st, options, wb);
 127         web_buffer_printf(wb, RRD_GRAPH_JSON_FOOTER);
 128 }
 129
 130 void rrd_stats_all_json(struct web_buffer *wb)
 131 {
 132         web_buffer_increase(wb, 2048);
 133
 134         unsigned long memory = 0;
 135         long c;
 136         RRDSET *st;
 137
 138         web_buffer_printf(wb, RRD_GRAPH_JSON_HEADER);
 139
 140         pthread_rwlock_rdlock(&rrdset_root_rwlock);
 141         for(st = rrdset_root, c = 0; st ; st = st->next) {
 142                 if(st->enabled) {
 143                         if(c) web_buffer_printf(wb, "%s", ",\n");
 144                         memory += rrd_stats_one_json(st, NULL, wb);
 145                         c++;
 146                 }
 147         }
 148         pthread_rwlock_unlock(&rrdset_root_rwlock);
 149
 150         web_buffer_printf(wb, "\n\t],\n"
 151                 "\t\"hostname\": \"%s\",\n"
 152                 "\t\"update_every\": %d,\n"
 153                 "\t\"history\": %d,\n"
 154                 "\t\"memory\": %lu\n"
 155                 "}\n"
 156                 , hostname
 157                 , rrd_update_every
 158                 , rrd_default_history_entries
 159                 , memory
 160                 );
 161 }
 162
 163
 164
 165 // ----------------------------------------------------------------------------
 166
 167 // RRDR options
 168 #define RRDR_EMPTY      0x01
 169 #define RRDR_RESET      0x02
 170 #define RRDR_HIDDEN     0x04
 171 #define RRDR_NONZERO    0x08
 172
 173
 174 typedef struct rrdresult {
 175         RRDSET *st;                     // the chart this result refers to
 176
 177         int d;                                  // the number of dimensions
 178         int n;                                  // the number of values in the arrays
 179
 180         uint8_t *od;                    // the options for the dimensions
 181
 182         time_t *t;                              // array of n timestamps
 183         calculated_number *v;   // array n x d values
 184         uint8_t *o;                             // array n x d options
 185
 186         int c;                                  // current line ( 0 ~ n )
 187
 188         int has_st_lock;                // if st is read locked by us
 189 } RRDR;
 190
 191 static void rrdr_dump(RRDR *r)
 192 {
 193         long c, i;
 194         RRDDIM *d;
 195
 196         fprintf(stderr, "\nCHART %s (%s)\n", r->st->id, r->st->name);
 197
 198         for(c = 0, d = r->st->dimensions; d ;c++, d = d->next) {
 199                 fprintf(stderr, "DIMENSION %s (%s), %s%s%s%s\n"
 200                                 , d->id
 201                                 , d->name
 202                                 , (r->od[c] & RRDR_EMPTY)?"EMPTY ":""
 203                                 , (r->od[c] & RRDR_RESET)?"RESET ":""
 204                                 , (r->od[c] & RRDR_HIDDEN)?"HIDDEN ":""
 205                                 , (r->od[c] & RRDR_NONZERO)?"NONZERO ":""
 206                                 );
 207         }
 208
 209         if(r->c < 0) {
 210                 fprintf(stderr, "RRDR does not have any values in it.\n");
 211                 return;
 212         }
 213
 214         fprintf(stderr, "RRDR includes %d values in it:\n", r->c + 1);
 215
 216         // for each line in the array
 217         for(i = 0; i <= r->c ;i++) {
 218                 calculated_number *cn = &r->v[ i * r->d ];
 219                 uint8_t *co = &r->o[ i * r->d ];
 220
 221                 // print the id and the timestamp of the line
 222                 fprintf(stderr, "%ld %ld ", i + 1, r->t[i]);
 223
 224                 // for each dimension
 225                 for(c = 0, d = r->st->dimensions; d ;c++, d = d->next) {
 226                         if(unlikely(r->od[c] & RRDR_HIDDEN)) continue;
 227                         if(unlikely(!(r->od[c] & RRDR_NONZERO))) continue;
 228
 229                         if(co[c] & RRDR_EMPTY)
 230                                 fprintf(stderr, "null ");
 231                         else
 232                                 fprintf(stderr, CALCULATED_NUMBER_FORMAT " %s%s%s%s "
 233                                         , cn[c]
 234                                         , (co[c] & RRDR_EMPTY)?"E":" "
 235                                         , (co[c] & RRDR_RESET)?"R":" "
 236                                         , (co[c] & RRDR_HIDDEN)?"H":" "
 237                                         , (co[c] & RRDR_NONZERO)?"N":" "
 238                                         );
 239                 }
 240
 241                 fprintf(stderr, "\n");
 242         }
 243 }
 244
 245 inline static calculated_number *rrdr_line_values(RRDR *r)
 246 {
 247         return &r->v[ r->c * r->d ];
 248 }
 249
 250 inline static uint8_t *rrdr_line_options(RRDR *r)
 251 {
 252         return &r->o[ r->c * r->d ];
 253 }
 254
 255 inline static int rrdr_line_init(RRDR *r, time_t t)
 256 {
 257         r->c++;
 258         if(unlikely(r->c >= r->n)) {
 259                 r->c = r->n - 1;
 260                 return 0;
 261         }
 262
 263         // save the time
 264         r->t[r->c] = t;
 265
 266         return 1;
 267 }
 268
 269 inline static void rrdr_lock_rrdset(RRDR *r) {
 270         if(unlikely(!r)) {
 271                 error("NULL value given!");
 272                 return;
 273         }
 274
 275         pthread_rwlock_rdlock(&r->st->rwlock);
 276         r->has_st_lock = 1;
 277 }
 278
 279 inline static void rrdr_unlock_rrdset(RRDR *r) {
 280         if(unlikely(!r)) {
 281                 error("NULL value given!");
 282                 return;
 283         }
 284
 285         if(likely(r->has_st_lock)) {
 286                 pthread_rwlock_unlock(&r->st->rwlock);
 287                 r->has_st_lock = 0;
 288         }
 289 }
 290
 291 inline static void rrdr_free(RRDR *r)
 292 {
 293         if(unlikely(!r)) {
 294                 error("NULL value given!");
 295                 return;
 296         }
 297
 298         rrdr_unlock_rrdset(r);
 299         if(likely(r->t)) free(r->t);
 300         if(likely(r->v)) free(r->v);
 301         if(likely(r->o)) free(r->o);
 302         if(likely(r->od)) free(r->od);
 303         free(r);
 304 }
 305
 306 static RRDR *rrdr_create(RRDSET *st, int n)
 307 {
 308         if(unlikely(!st)) {
 309                 error("NULL value given!");
 310                 return NULL;
 311         }
 312
 313         RRDR *r = calloc(1, sizeof(RRDR));
 314         if(unlikely(!r)) goto cleanup;
 315
 316         r->st = st;
 317
 318         rrdr_lock_rrdset(r);
 319
 320         RRDDIM *rd;
 321         for(rd = st->dimensions ; rd ; rd = rd->next) r->d++;
 322
 323         r->n = n;
 324         r->t = malloc(n * sizeof(time_t));
 325         if(unlikely(!r->t)) goto cleanup;
 326
 327         r->t = malloc(n * sizeof(time_t));
 328         if(unlikely(!r->t)) goto cleanup;
 329
 330         r->v = malloc(n * r->d * sizeof(calculated_number));
 331         if(unlikely(!r->v)) goto cleanup;
 332
 333         r->o = malloc(n * r->d * sizeof(uint8_t));
 334         if(unlikely(!r->o)) goto cleanup;
 335
 336         r->od = calloc(r->d, sizeof(uint8_t));
 337         if(unlikely(!r->od)) goto cleanup;
 338
 339         r->c = -1;
 340
 341         return r;
 342
 343 cleanup:
 344         error("Cannot allocate memory");
 345         if(likely(r)) rrdr_free(r);
 346         return NULL;
 347 }
 348
 349 RRDR *rrd2rrdr(RRDSET *st, long points, time_t after, time_t before, int group_method)
 350 {
 351         int debug = st->debug;
 352
 353         time_t first_entry_t = rrdset_first_entry_t(st);
 354         time_t last_entry_t = rrdset_last_entry_t(st);
 355
 356         // allow relative for before and after
 357         if(before <= st->update_every * st->entries) before = last_entry_t + before;
 358         if(after <= st->update_every * st->entries) after = last_entry_t + after;
 359
 360         // make sure they are within our timeframe
 361         if(before > last_entry_t) before = last_entry_t;
 362         if(before < first_entry_t) before = first_entry_t;
 363
 364         if(after > last_entry_t) after = last_entry_t;
 365         if(after < first_entry_t) after = first_entry_t;
 366
 367         // check if they are upside down
 368         if(after > before) {
 369                 time_t t = before;
 370                 before = after;
 371                 after = t;
 372         }
 373
 374         // the duration of the chart
 375         time_t duration = before - after;
 376         if(duration <= 0) return NULL;
 377
 378         // check the required points
 379         if(points <= 0) points = duration;
 380
 381         // calculate proper grouping of source data
 382         long group = duration / points;
 383         if(group <= 0) group = 1;
 384         if(duration / group > points) group++;
 385
 386         // align timestamps to group
 387         before -= before % group;
 388         after -= after % group;
 389         duration = before - after;
 390
 391         // error("NEW: points=%d after=%d before=%d group=%d, duration=%d", points, after, before, group, duration);
 392
 393         // Now we have:
 394         // before = the end time of the calculation
 395         // after = the start time of the calculation
 396         // duration = the duration of the calculation
 397         // group = the number of source points to aggregate / group together
 398         // method = the method of grouping source points
 399         // points = the number of points to generate
 400
 401
 402         // -------------------------------------------------------------------------
 403         // initialize our result set
 404
 405         RRDR *r = rrdr_create(st, points);
 406         if(!r) return NULL;
 407         if(!r->d) {
 408                 rrdr_free(r);
 409                 return NULL;
 410         }
 411
 412         // find how many dimensions we have
 413         long dimensions = r->d;
 414
 415
 416         // -------------------------------------------------------------------------
 417         // checks for debugging
 418
 419         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"
 420                         , st->id
 421                         , first_entry_t
 422                         , last_entry_t
 423                         , last_entry_t - first_entry_t
 424                         , after
 425                         , before
 426                         , duration
 427                         , points
 428                         , group
 429                         );
 430
 431
 432         // -------------------------------------------------------------------------
 433         // temp arrays for keeping values per dimension
 434
 435         calculated_number       group_values[dimensions]; // keep sums when grouping
 436         long                            group_counts[dimensions]; // keep the number of values added to group_values
 437         uint8_t                         group_options[dimensions];
 438         uint8_t                         found_non_zero[dimensions];
 439
 440
 441         // initialize them
 442         RRDDIM *rd;
 443         long c;
 444         for( rd = st->dimensions, c = 0 ; rd && c < dimensions ; rd = rd->next, c++) {
 445                 group_values[c] = 0;
 446                 group_counts[c] = 0;
 447                 group_options[c] = 0;
 448                 found_non_zero[c] = 0;
 449         }
 450
 451
 452         // -------------------------------------------------------------------------
 453         // the main loop
 454
 455         long    t = rrdset_time2slot(st, before), // rrdset_last_slot(st),
 456                         stop_at_t = rrdset_time2slot(st, after),
 457                         added = 0,
 458                         group_count = 0,
 459                         add_this = 0,
 460                         stop_now = 0;
 461
 462         time_t  now = rrdset_slot2time(st, t),
 463                         dt = st->update_every,
 464                         group_start_t = 0;
 465
 466         if(debug) debug(D_RRD_STATS, "BEGIN %s after_t: %lu (stop slot %ld), before_t: %lu (start slot %ld), start_t(now): %lu"
 467                         , st->id
 468                         , after
 469                         , stop_at_t
 470                         , before
 471                         , t
 472                         , now
 473                         );
 474
 475         for( ; !stop_now ; now -= dt, t--) {
 476                 if(unlikely(t < 0)) c = st->entries - 1;
 477                 if(t == stop_at_t) stop_now = 1;
 478
 479                 if(debug) debug(D_RRD_STATS, "ROW %s c: %ld, group_count: %ld, added: %ld, now: %lu, %s %s"
 480                                 , st->id
 481                                 , t
 482                                 , group_count + 1
 483                                 , added
 484                                 , now
 485                                 , (group_count + 1 == group)?"PRINT":"  -  "
 486                                 , (now >= after && now <= before)?"RANGE":"  -  "
 487                                 );
 488
 489                 // make sure we return data in the proper time range
 490                 if(unlikely(now > before)) continue;
 491                 if(unlikely(now < after)) break;
 492
 493                 if(group_count == 0) group_start_t = now;
 494                 group_count++;
 495
 496                 if(unlikely(group_count == group)) {
 497                         if(unlikely(added >= points)) break;
 498                         add_this = 1;
 499                 }
 500
 501                 // do the calculations
 502                 for(rd = st->dimensions, c = 0 ; likely(rd && c < dimensions) ; rd = rd->next, c++) {
 503                         storage_number n = rd->values[t];
 504                         if(unlikely(!does_storage_number_exist(n))) continue;
 505
 506                         group_counts[c]++;
 507
 508                         calculated_number value = unpack_storage_number(n);
 509                         if(value != 0.0) {
 510                                 group_options[c] |= RRDR_NONZERO;
 511                                 found_non_zero[c] = 1;
 512                         }
 513
 514                         if(unlikely(did_storage_number_reset(n)))
 515                                 group_options[c] |= RRDR_RESET;
 516
 517                         switch(group_method) {
 518                                 case GROUP_MAX:
 519                                         if(unlikely(abs(value) > abs(group_values[c])))
 520                                                 group_values[c] = value;
 521                                         break;
 522
 523                                 default:
 524                                 case GROUP_SUM:
 525                                 case GROUP_AVERAGE:
 526                                         group_values[c] += value;
 527                                         break;
 528                         }
 529                 }
 530
 531                 // added it
 532                 if(unlikely(add_this)) {
 533                         if(!rrdr_line_init(r, group_start_t)) break;
 534
 535                         calculated_number *cn = rrdr_line_values(r);
 536                         uint8_t *co = rrdr_line_options(r);
 537
 538                         for(rd = st->dimensions, c = 0 ; likely(rd && c < dimensions) ; rd = rd->next, c++) {
 539
 540                                 // update the dimension options
 541                                 if(found_non_zero[c]) r->od[c] |= RRDR_NONZERO;
 542                                 if(rd->hidden) r->od[c] |= RRDR_HIDDEN;
 543
 544                                 // store the specific point options
 545                                 co[c] = group_options[c];
 546
 547                                 // store the value
 548                                 if(group_counts[c] == 0) {
 549                                         cn[c] = 0.0;
 550                                         co[c] |= RRDR_EMPTY;
 551                                 }
 552                                 else if(unlikely(group_method == GROUP_AVERAGE)) {
 553                                         cn[c] = group_values[c] / group_counts[c];
 554                                 }
 555                                 else {
 556                                         cn[c] = group_values[c];
 557                                 }
 558
 559                                 // reset them for the next loop
 560                                 group_values[c] = 0;
 561                                 group_counts[c] = 0;
 562                                 group_options[c] = 0;
 563                         }
 564
 565                         added++;
 566                         group_count = 0;
 567                         add_this = 0;
 568                 }
 569         }
 570
 571         rrdr_dump(r);
 572         rrdr_free(r);
 573         return NULL;
 574 }
 575
 576 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)
 577 {
 578         int c;
 579         pthread_rwlock_rdlock(&st->rwlock);
 580
 581
 582         // -------------------------------------------------------------------------
 583         // switch from JSON to google JSON
 584
 585         char kq[2] = "\"";
 586         char sq[2] = "\"";
 587         switch(type) {
 588                 case DATASOURCE_GOOGLE_JSON:
 589                 case DATASOURCE_GOOGLE_JSONP:
 590                         kq[0] = '\0';
 591                         sq[0] = '\'';
 592                         break;
 593
 594                 case DATASOURCE_JSON:
 595                 default:
 596                         break;
 597         }
 598
 599
 600         // -------------------------------------------------------------------------
 601         // validate the parameters
 602
 603         if(points < 1) points = 1;
 604         if(group < 1) group = 1;
 605
 606         if(before == 0 || before > rrdset_last_entry_t(st)) before = rrdset_last_entry_t(st);
 607         if(after  == 0 || after < rrdset_first_entry_t(st)) after = rrdset_first_entry_t(st);
 608
 609         // ---
 610
 611         // our return value (the last timestamp printed)
 612         // this is required to detect re-transmit in google JSONP
 613         time_t last_timestamp = 0;
 614
 615
 616         // -------------------------------------------------------------------------
 617         // find how many dimensions we have
 618
 619         int dimensions = 0;
 620         RRDDIM *rd;
 621         for( rd = st->dimensions ; rd ; rd = rd->next) dimensions++;
 622         if(!dimensions) {
 623                 pthread_rwlock_unlock(&st->rwlock);
 624                 web_buffer_printf(wb, "No dimensions yet.");
 625                 return 0;
 626         }
 627
 628
 629         // -------------------------------------------------------------------------
 630         // prepare various strings, to speed up the loop
 631
 632         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);
 633         char normal_annotation[201];   snprintf(normal_annotation,   200, ",{%sv%s:null},{%sv%s:null}", kq, kq, kq, kq);
 634         char pre_date[51];             snprintf(pre_date,             50, "             {%sc%s:[{%sv%s:%s", kq, kq, kq, kq, sq);
 635         char post_date[21];            snprintf(post_date,            20, "%s}", sq);
 636         char pre_value[21];            snprintf(pre_value,            20, ",{%sv%s:", kq, kq);
 637         char post_value[21];           snprintf(post_value,           20, "}");
 638
 639
 640         // -------------------------------------------------------------------------
 641         // checks for debugging
 642
 643         if(st->debug) {
 644                 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"
 645                         , st->id
 646                         , rrdset_first_entry_t(st)
 647                         , rrdset_last_entry_t(st)
 648                         , rrdset_last_entry_t(st) - rrdset_first_entry_t(st)
 649                         , after
 650                         , before
 651                         , before - after
 652                         , points
 653                         , group
 654                         );
 655
 656                 if(before < after)
 657                         debug(D_RRD_STATS, "WARNING: %s The newest value in the database (%lu) is earlier than the oldest (%lu)", st->name, before, after);
 658
 659                 if((before - after) > st->entries * st->update_every)
 660                         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);
 661         }
 662
 663
 664         // -------------------------------------------------------------------------
 665         // temp arrays for keeping values per dimension
 666
 667         calculated_number group_values[dimensions]; // keep sums when grouping
 668         int               print_hidden[dimensions]; // keep hidden flags
 669         int               found_non_zero[dimensions];
 670         int               found_non_existing[dimensions];
 671
 672         // initialize them
 673         for( rd = st->dimensions, c = 0 ; rd && c < dimensions ; rd = rd->next, c++) {
 674                 group_values[c] = 0;
 675                 print_hidden[c] = rd->hidden;
 676                 found_non_zero[c] = 0;
 677                 found_non_existing[c] = 0;
 678         }
 679
 680
 681         // 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);
 682         // rrd2array(st, entries_to_show, before - (st->update_every * group * entries_to_show), before, group_method, only_non_zero);
 683         // rrd2rrdr(st, entries_to_show, before - (st->update_every * group * entries_to_show), before, group_method);
 684
 685         // -------------------------------------------------------------------------
 686         // remove dimensions that contain only zeros
 687
 688         int max_loop = 1;
 689         if(only_non_zero) max_loop = 2;
 690
 691         for(; max_loop ; max_loop--) {
 692
 693                 // -------------------------------------------------------------------------
 694                 // print the JSON header
 695
 696                 web_buffer_printf(wb, "{\n      %scols%s:\n     [\n", kq, kq);
 697                 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);
 698                 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);
 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:%sannotationText%s}}", kq, kq, sq, sq, kq, kq, sq, sq, kq, kq, sq, sq, kq, kq, sq, sq, kq, kq, kq, kq, sq, sq);
 700
 701                 // print the header for each dimension
 702                 // and update the print_hidden array for the dimensions that should be hidden
 703                 int pc = 0;
 704                 for( rd = st->dimensions, c = 0 ; rd && c < dimensions ; rd = rd->next, c++) {
 705                         if(!print_hidden[c]) {
 706                                 pc++;
 707                                 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);
 708                         }
 709                 }
 710                 if(!pc) {
 711                         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);
 712                 }
 713
 714                 // print the begin of row data
 715                 web_buffer_printf(wb, "\n       ],\n    %srows%s:\n     [\n", kq, kq);
 716
 717
 718                 // -------------------------------------------------------------------------
 719                 // the main loop
 720
 721                 int annotate_reset = 0;
 722                 int annotation_count = 0;
 723
 724                 // the minimum line length we expect
 725                 int line_size = 4096 + (dimensions * 200);
 726
 727                 long    t = rrdset_time2slot(st, before),
 728                                 stop_at_t = rrdset_time2slot(st, after),
 729                                 stop_now = 0;
 730
 731                 t -= t % group;
 732
 733                 time_t  now = rrdset_slot2time(st, t),
 734                                 dt = st->update_every;
 735
 736                 long count = 0, printed = 0, group_count = 0;
 737                 last_timestamp = 0;
 738
 739                 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"
 740                                         , st->id
 741                                         , after
 742                                         , before
 743                                         , points
 744                                         , group
 745                                         , st->current_entry
 746                                         , rrdset_first_entry_t(st)
 747                                         , rrdset_last_entry_t(st)
 748                                         , t
 749                                         , stop_at_t
 750                                         );
 751
 752                 for(; !stop_now ; now -= dt, t--) {
 753                         if(t < 0) t = st->entries - 1;
 754                         if(t == stop_at_t) stop_now = 1;
 755
 756                         int print_this = 0;
 757
 758                         if(st->debug) debug(D_RRD_STATS, "%s t = %ld, count = %ld, group_count = %ld, printed = %ld, now = %lu, %s %s"
 759                                         , st->id
 760                                         , t
 761                                         , count + 1
 762                                         , group_count + 1
 763                                         , printed
 764                                         , now
 765                                         , (group_count + 1 == group)?"PRINT":"  -  "
 766                                         , (now >= after && now <= before)?"RANGE":"  -  "
 767                                         );
 768
 769
 770                         // make sure we return data in the proper time range
 771                         if(now > before) continue;
 772                         if(now < after) break;
 773
 774                         //if(rrdset_slot2time(st, t) != now)
 775                         //      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));
 776
 777                         count++;
 778                         group_count++;
 779
 780                         // check if we have to print this now
 781                         if(group_count == group) {
 782                                 if(printed >= points) {
 783                                         // debug(D_RRD_STATS, "Already printed all rows. Stopping.");
 784                                         break;
 785                                 }
 786
 787                                 // check if we may exceed the buffer provided
 788                                 web_buffer_increase(wb, line_size);
 789
 790                                 // generate the local date time
 791                                 struct tm *tm = localtime(&now);
 792                                 if(!tm) { error("localtime() failed."); continue; }
 793                                 if(now > last_timestamp) last_timestamp = now;
 794
 795                                 if(printed) web_buffer_strcpy(wb, "]},\n");
 796                                 web_buffer_strcpy(wb, pre_date);
 797                                 web_buffer_jsdate(wb, tm->tm_year + 1900, tm->tm_mon, tm->tm_mday, tm->tm_hour, tm->tm_min, tm->tm_sec);
 798                                 web_buffer_strcpy(wb, post_date);
 799
 800                                 print_this = 1;
 801                         }
 802
 803                         // do the calculations
 804                         for(rd = st->dimensions, c = 0 ; rd && c < dimensions ; rd = rd->next, c++) {
 805                                 storage_number n = rd->values[t];
 806                                 calculated_number value = unpack_storage_number(n);
 807
 808                                 if(!does_storage_number_exist(n)) {
 809                                         value = 0.0;
 810                                         found_non_existing[c]++;
 811                                 }
 812                                 if(did_storage_number_reset(n)) annotate_reset = 1;
 813
 814                                 switch(group_method) {
 815                                         case GROUP_MAX:
 816                                                 if(abs(value) > abs(group_values[c])) group_values[c] = value;
 817                                                 break;
 818
 819                                         case GROUP_SUM:
 820                                                 group_values[c] += value;
 821                                                 break;
 822
 823                                         default:
 824                                         case GROUP_AVERAGE:
 825                                                 group_values[c] += value;
 826                                                 if(print_this) group_values[c] /= ( group_count - found_non_existing[c] );
 827                                                 break;
 828                                 }
 829                         }
 830
 831                         if(print_this) {
 832                                 if(annotate_reset) {
 833                                         annotation_count++;
 834                                         web_buffer_strcpy(wb, overflow_annotation);
 835                                         annotate_reset = 0;
 836                                 }
 837                                 else
 838                                         web_buffer_strcpy(wb, normal_annotation);
 839
 840                                 pc = 0;
 841                                 for(c = 0 ; c < dimensions ; c++) {
 842                                         if(found_non_existing[c] == group_count) {
 843                                                 // all entries are non-existing
 844                                                 pc++;
 845                                                 web_buffer_strcpy(wb, pre_value);
 846                                                 web_buffer_strcpy(wb, "null");
 847                                                 web_buffer_strcpy(wb, post_value);
 848                                         }
 849                                         else if(!print_hidden[c]) {
 850                                                 pc++;
 851                                                 web_buffer_strcpy(wb, pre_value);
 852                                                 web_buffer_rrd_value(wb, group_values[c]);
 853                                                 web_buffer_strcpy(wb, post_value);
 854
 855                                                 if(group_values[c]) found_non_zero[c]++;
 856                                         }
 857
 858                                         // reset them for the next loop
 859                                         group_values[c] = 0;
 860                                         found_non_existing[c] = 0;
 861                                 }
 862
 863                                 // if all dimensions are hidden, print a null
 864                                 if(!pc) {
 865                                         web_buffer_strcpy(wb, pre_value);
 866                                         web_buffer_strcpy(wb, "null");
 867                                         web_buffer_strcpy(wb, post_value);
 868                                 }
 869
 870                                 printed++;
 871                                 group_count = 0;
 872                         }
 873                 }
 874
 875                 if(printed) web_buffer_printf(wb, "]}");
 876                 web_buffer_printf(wb, "\n       ]\n}\n");
 877
 878                 if(only_non_zero && max_loop > 1) {
 879                         int changed = 0;
 880                         for(rd = st->dimensions, c = 0 ; rd && c < dimensions ; rd = rd->next, c++) {
 881                                 group_values[c] = 0;
 882                                 found_non_existing[c] = 0;
 883
 884                                 if(!print_hidden[c] && !found_non_zero[c]) {
 885                                         changed = 1;
 886                                         print_hidden[c] = 1;
 887                                 }
 888                         }
 889
 890                         if(changed) web_buffer_reset(wb);
 891                         else break;
 892                 }
 893                 else break;
 894
 895         } // max_loop
 896
 897         debug(D_RRD_STATS, "RRD_STATS_JSON: %s total %ld bytes", st->name, wb->bytes);
 898
 899         pthread_rwlock_unlock(&st->rwlock);
 900         return last_timestamp;
 901 }