median.h 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143
  1. // SPDX-License-Identifier: GPL-3.0-or-later
  2. #ifndef NETDATA_API_QUERIES_MEDIAN_H
  3. #define NETDATA_API_QUERIES_MEDIAN_H
  4. #include "../query.h"
  5. #include "../rrdr.h"
  6. struct tg_median {
  7. size_t series_size;
  8. size_t next_pos;
  9. NETDATA_DOUBLE percent;
  10. NETDATA_DOUBLE *series;
  11. };
  12. static inline void tg_median_create_internal(RRDR *r, const char *options, NETDATA_DOUBLE def) {
  13. long entries = r->view.group;
  14. if(entries < 10) entries = 10;
  15. struct tg_median *g = (struct tg_median *)onewayalloc_callocz(r->internal.owa, 1, sizeof(struct tg_median));
  16. g->series = onewayalloc_mallocz(r->internal.owa, entries * sizeof(NETDATA_DOUBLE));
  17. g->series_size = (size_t)entries;
  18. g->percent = def;
  19. if(options && *options) {
  20. g->percent = str2ndd(options, NULL);
  21. if(!netdata_double_isnumber(g->percent)) g->percent = 0.0;
  22. if(g->percent < 0.0) g->percent = 0.0;
  23. if(g->percent > 50.0) g->percent = 50.0;
  24. }
  25. g->percent = g->percent / 100.0;
  26. r->time_grouping.data = g;
  27. }
  28. static inline void tg_median_create(RRDR *r, const char *options) {
  29. tg_median_create_internal(r, options, 0.0);
  30. }
  31. static inline void tg_median_create_trimmed_1(RRDR *r, const char *options) {
  32. tg_median_create_internal(r, options, 1.0);
  33. }
  34. static inline void tg_median_create_trimmed_2(RRDR *r, const char *options) {
  35. tg_median_create_internal(r, options, 2.0);
  36. }
  37. static inline void tg_median_create_trimmed_3(RRDR *r, const char *options) {
  38. tg_median_create_internal(r, options, 3.0);
  39. }
  40. static inline void tg_median_create_trimmed_5(RRDR *r, const char *options) {
  41. tg_median_create_internal(r, options, 5.0);
  42. }
  43. static inline void tg_median_create_trimmed_10(RRDR *r, const char *options) {
  44. tg_median_create_internal(r, options, 10.0);
  45. }
  46. static inline void tg_median_create_trimmed_15(RRDR *r, const char *options) {
  47. tg_median_create_internal(r, options, 15.0);
  48. }
  49. static inline void tg_median_create_trimmed_20(RRDR *r, const char *options) {
  50. tg_median_create_internal(r, options, 20.0);
  51. }
  52. static inline void tg_median_create_trimmed_25(RRDR *r, const char *options) {
  53. tg_median_create_internal(r, options, 25.0);
  54. }
  55. // resets when switches dimensions
  56. // so, clear everything to restart
  57. static inline void tg_median_reset(RRDR *r) {
  58. struct tg_median *g = (struct tg_median *)r->time_grouping.data;
  59. g->next_pos = 0;
  60. }
  61. static inline void tg_median_free(RRDR *r) {
  62. struct tg_median *g = (struct tg_median *)r->time_grouping.data;
  63. if(g) onewayalloc_freez(r->internal.owa, g->series);
  64. onewayalloc_freez(r->internal.owa, r->time_grouping.data);
  65. r->time_grouping.data = NULL;
  66. }
  67. static inline void tg_median_add(RRDR *r, NETDATA_DOUBLE value) {
  68. struct tg_median *g = (struct tg_median *)r->time_grouping.data;
  69. if(unlikely(g->next_pos >= g->series_size)) {
  70. g->series = onewayalloc_doublesize( r->internal.owa, g->series, g->series_size * sizeof(NETDATA_DOUBLE));
  71. g->series_size *= 2;
  72. }
  73. g->series[g->next_pos++] = value;
  74. }
  75. static inline NETDATA_DOUBLE tg_median_flush(RRDR *r, RRDR_VALUE_FLAGS *rrdr_value_options_ptr) {
  76. struct tg_median *g = (struct tg_median *)r->time_grouping.data;
  77. size_t available_slots = g->next_pos;
  78. NETDATA_DOUBLE value;
  79. if(unlikely(!available_slots)) {
  80. value = 0.0;
  81. *rrdr_value_options_ptr |= RRDR_VALUE_EMPTY;
  82. }
  83. else if(available_slots == 1) {
  84. value = g->series[0];
  85. }
  86. else {
  87. sort_series(g->series, available_slots);
  88. size_t start_slot = 0;
  89. size_t end_slot = available_slots - 1;
  90. if(g->percent > 0.0) {
  91. NETDATA_DOUBLE min = g->series[0];
  92. NETDATA_DOUBLE max = g->series[available_slots - 1];
  93. NETDATA_DOUBLE delta = (max - min) * g->percent;
  94. NETDATA_DOUBLE wanted_min = min + delta;
  95. NETDATA_DOUBLE wanted_max = max - delta;
  96. for (start_slot = 0; start_slot < available_slots; start_slot++)
  97. if (g->series[start_slot] >= wanted_min) break;
  98. for (end_slot = available_slots - 1; end_slot > start_slot; end_slot--)
  99. if (g->series[end_slot] <= wanted_max) break;
  100. }
  101. if(start_slot == end_slot)
  102. value = g->series[start_slot];
  103. else
  104. value = median_on_sorted_series(&g->series[start_slot], end_slot - start_slot + 1);
  105. }
  106. if(unlikely(!netdata_double_isnumber(value))) {
  107. value = 0.0;
  108. *rrdr_value_options_ptr |= RRDR_VALUE_EMPTY;
  109. }
  110. //log_series_to_stderr(g->series, g->next_pos, value, "median");
  111. g->next_pos = 0;
  112. return value;
  113. }
  114. #endif //NETDATA_API_QUERIES_MEDIAN_H