657
}
658
}
659
660
-// ----------------------------------------------------------------------------
661
-
662
-static void rrdr_disable_not_selected_dimensions(RRDR *r, RRDR_OPTIONS options, const char *dims,
663
- struct context_param *context_param_list)
664
-{
665
- RRDDIM *temp_rd = context_param_list ? context_param_list->rd : NULL;
666
- int should_lock = (!context_param_list || !(context_param_list->flags & CONTEXT_FLAGS_ARCHIVE));
667
-
668
- if(unlikely(!dims || !*dims || (dims[0] == '*' && dims[1] == '\0'))) return;
669
-
670
- if (should_lock)
671
- rrdset_check_rdlock(r->st);
672
-
673
- int match_ids = 0, match_names = 0;
674
-
675
- if(unlikely(options & RRDR_OPTION_MATCH_IDS))
676
- match_ids = 1;
677
- if(unlikely(options & RRDR_OPTION_MATCH_NAMES))
678
- match_names = 1;
679
-
680
- if(likely(!match_ids && !match_names))
681
- match_ids = match_names = 1;
682
-
683
- SIMPLE_PATTERN *pattern = simple_pattern_create(dims, ",|\t\r\n\f\v", SIMPLE_PATTERN_EXACT);
684
-
685
- RRDDIM *d;
686
- long c, dims_selected = 0, dims_not_hidden_not_zero = 0;
687
- for(c = 0, d = temp_rd?temp_rd:r->st->dimensions; d ;c++, d = d->next) {
688
- if( (match_ids && simple_pattern_matches(pattern, rrddim_id(d)))
689
- || (match_names && simple_pattern_matches(pattern, rrddim_name(d)))
690
- ) {
691
- r->od[c] |= RRDR_DIMENSION_SELECTED;
692
- if(unlikely(r->od[c] & RRDR_DIMENSION_HIDDEN)) r->od[c] &= ~RRDR_DIMENSION_HIDDEN;
693
- dims_selected++;
694
-
695
- // since the user needs this dimension
696
- // make it appear as NONZERO, to return it
697
- // even if the dimension has only zeros
698
- // unless option non_zero is set
699
- if(unlikely(!(options & RRDR_OPTION_NONZERO)))
700
- r->od[c] |= RRDR_DIMENSION_NONZERO;
701
-
702
- // count the visible dimensions
703
- if(likely(r->od[c] & RRDR_DIMENSION_NONZERO))
704
- dims_not_hidden_not_zero++;
705
- }
706
- else {
707
- r->od[c] |= RRDR_DIMENSION_HIDDEN;
708
- if(unlikely(r->od[c] & RRDR_DIMENSION_SELECTED)) r->od[c] &= ~RRDR_DIMENSION_SELECTED;
709
- }
710
- }
711
- simple_pattern_free(pattern);
712
-
713
- // check if all dimensions are hidden
714
- if(unlikely(!dims_not_hidden_not_zero && dims_selected)) {
715
- // there are a few selected dimensions,
716
- // but they are all zero
717
- // enable the selected ones
718
- // to avoid returning an empty chart
719
- for(c = 0, d = temp_rd?temp_rd:r->st->dimensions; d ;c++, d = d->next)
720
- if(unlikely(r->od[c] & RRDR_DIMENSION_SELECTED))
721
- r->od[c] |= RRDR_DIMENSION_NONZERO;
722
- }
723
-}
724
-
660
// ----------------------------------------------------------------------------
661
// helpers to find our way in RRDR
662
671
static inline long rrdr_line_init(RRDR *r, time_t t, long rrdr_line) {
672
rrdr_line++;
673
739
- internal_error(rrdr_line >= r->n,
740
- "QUERY: requested to step above RRDR size for chart '%s'",
741
- rrdset_name(r->st));
674
+ internal_error(rrdr_line >= (long)r->n,
675
+ "QUERY: requested to step above RRDR size for query '%s'",
676
+ r->internal.qt->id);
677
678
internal_error(r->t[rrdr_line] != 0 && r->t[rrdr_line] != t,
744
- "QUERY: overwriting the timestamp of RRDR line %zu from %zu to %zu, of chart '%s'",
745
- (size_t)rrdr_line, (size_t)r->t[rrdr_line], (size_t)t, rrdset_name(r->st));
679
+ "QUERY: overwriting the timestamp of RRDR line %zu from %zu to %zu, of query '%s'",
680
+ (size_t)rrdr_line, (size_t)r->t[rrdr_line], (size_t)t, r->internal.qt->id);
681
682
// save the time
683
r->t[rrdr_line] = t;
693
// ----------------------------------------------------------------------------
694
// tier management
695
761
-static int rrddim_find_best_tier_for_timeframe(RRDDIM *rd, time_t after_wanted, time_t before_wanted, long points_wanted) {
696
+static bool query_metric_is_valid_tier(QUERY_METRIC *qm, size_t tier) {
697
+ if(!qm->tiers[tier].db_metric_handle || !qm->tiers[tier].db_first_time_t || !qm->tiers[tier].db_last_time_t || !qm->tiers[tier].db_update_every)
698
+ return false;
699
+
700
+ return true;
701
+}
702
+
703
+static size_t query_metric_first_working_tier(QUERY_METRIC *qm) {
704
+ for(size_t tier = 0; tier < storage_tiers ; tier++) {
705
+
706
+ // find the db time-range for this tier for all metrics
707
+ STORAGE_METRIC_HANDLE *db_metric_handle = qm->tiers[tier].db_metric_handle;
708
+ time_t first_t = qm->tiers[tier].db_first_time_t;
709
+ time_t last_t = qm->tiers[tier].db_last_time_t;
710
+ time_t update_every = qm->tiers[tier].db_update_every;
711
+
712
+ if(!db_metric_handle || !first_t || !last_t || !update_every)
713
+ continue;
714
+
715
+ return tier;
716
+ }
717
+
718
+ return 0;
719
+}
720
+
721
+static long query_plan_points_coverage_weight(time_t db_first_t, time_t db_last_t, time_t db_update_every, time_t after_wanted, time_t before_wanted, size_t points_wanted) {
722
+ if(db_first_t == 0 || db_last_t == 0 || db_update_every == 0)
723
+ return -LONG_MAX;
724
+
725
+ time_t common_first_t = MAX(db_first_t, after_wanted);
726
+ time_t common_last_t = MIN(db_last_t, before_wanted);
727
+
728
+ long points_available = (common_last_t - common_first_t) / db_update_every;
729
+ long points_delta = (long)(points_available - points_wanted);
730
+ long points_coverage = (points_delta < 0) ? (long)(points_available * 1000 / points_wanted): 1000;
731
+
732
+ if(points_available <= 0)
733
+ return -LONG_MAX;
734
+
735
+ return points_coverage;
736
+}
737
+
738
+static size_t query_metric_best_tier_for_timeframe(QUERY_METRIC *qm, time_t after_wanted, time_t before_wanted, size_t points_wanted) {
739
if(unlikely(storage_tiers < 2))
740
return 0;
741
765
- if(unlikely(after_wanted == before_wanted || points_wanted <= 0 || !rd || !rd->rrdset)) {
742
+ if(unlikely(after_wanted == before_wanted || points_wanted <= 0))
743
+ return query_metric_first_working_tier(qm);
744
767
- if(!rd)
768
- internal_error(true, "QUERY: NULL dimension - invalid params to tier calculation");
769
- else
770
- internal_error(true, "QUERY: chart '%s' dimension '%s' invalid params to tier calculation",
771
- (rd->rrdset)?rrdset_name(rd->rrdset):"unknown", rrddim_name(rd));
745
+ long weight[storage_tiers];
746
773
- return 0;
747
+ for(size_t tier = 0; tier < storage_tiers ; tier++) {
748
+
749
+ // find the db time-range for this tier for all metrics
750
+ STORAGE_METRIC_HANDLE *db_metric_handle = qm->tiers[tier].db_metric_handle;
751
+ time_t first_t = qm->tiers[tier].db_first_time_t;
752
+ time_t last_t = qm->tiers[tier].db_last_time_t;
753
+ time_t update_every = qm->tiers[tier].db_update_every;
754
+
755
+ if(!db_metric_handle || !first_t || !last_t || !update_every) {
756
+ weight[tier] = -LONG_MAX;
757
+ continue;
758
+ }
759
+
760
+ weight[tier] = query_plan_points_coverage_weight(first_t, last_t, update_every, after_wanted, before_wanted, points_wanted);
761
}
762
776
- //BUFFER *wb = buffer_create(1000);
777
- //buffer_sprintf(wb, "Best tier for chart '%s', dim '%s', from %ld to %ld (dur %ld, every %d), points %ld",
778
- // rd->rrdset->name, rd->name, after_wanted, before_wanted, before_wanted - after_wanted, rd->update_every, points_wanted);
763
+ size_t best_tier = 0;
764
+ for(size_t tier = 1; tier < storage_tiers ; tier++) {
765
+ if(weight[tier] >= weight[best_tier])
766
+ best_tier = tier;
767
+ }
768
+
769
+ return best_tier;
770
+}
771
+
772
+static size_t rrddim_find_best_tier_for_timeframe(QUERY_TARGET *qt, time_t after_wanted, time_t before_wanted, size_t points_wanted) {
773
+ if(unlikely(storage_tiers < 2))
774
+ return 0;
775
+
776
+ if(unlikely(after_wanted == before_wanted || points_wanted <= 0)) {
777
+ internal_error(true, "QUERY: '%s' has invalid params to tier calculation", qt->id);
778
+ return 0;
779
+ }
780
781
long weight[storage_tiers];
782
782
- for(int tier = 0; tier < storage_tiers ; tier++) {
783
- if(unlikely(!rd->tiers[tier])) {
784
- internal_error(true, "QUERY: tier %d of chart '%s' dimension '%s' not initialized",
785
- tier, rrdset_name(rd->rrdset), rrddim_name(rd));
786
- // buffer_free(wb);
787
- return 0;
788
- }
783
+ for(size_t tier = 0; tier < storage_tiers ; tier++) {
784
790
- time_t first_t = rd->tiers[tier]->query_ops.oldest_time(rd->tiers[tier]->db_metric_handle);
791
- time_t last_t = rd->tiers[tier]->query_ops.latest_time(rd->tiers[tier]->db_metric_handle);
785
+ time_t common_first_t = 0;
786
+ time_t common_last_t = 0;
787
+ time_t common_update_every = 0;
788
793
- time_t common_after = MAX(first_t, after_wanted);
794
- time_t common_before = MIN(last_t, before_wanted);
789
+ // find the db time-range for this tier for all metrics
790
+ for(size_t i = 0, used = qt->query.used; i < used ; i++) {
791
+ QUERY_METRIC *qm = &qt->query.array[i];
792
796
- long time_coverage = (common_before - common_after) * 1000 / (before_wanted - after_wanted);
797
- if(time_coverage < 0) time_coverage = 0;
793
+ time_t first_t = qm->tiers[tier].db_first_time_t;
794
+ time_t last_t = qm->tiers[tier].db_last_time_t;
795
+ time_t update_every = qm->tiers[tier].db_update_every;
796
799
- int update_every = (int)rd->tiers[tier]->tier_grouping * (int)rd->update_every;
800
- if(unlikely(update_every == 0)) {
801
- internal_error(true, "QUERY: update_every of tier %d for chart '%s' dimension '%s' is zero. tg = %d, ue = %d",
802
- tier, rrdset_name(rd->rrdset), rrddim_name(rd), rd->tiers[tier]->tier_grouping, rd->update_every);
803
- // buffer_free(wb);
804
- return 0;
805
- }
797
+ if(!first_t || !last_t || !update_every)
798
+ continue;
799
807
- long points_available = (before_wanted - after_wanted) / update_every;
808
- long points_delta = points_available - points_wanted;
809
- long points_coverage = (points_delta < 0) ? points_available * 1000 / points_wanted: 1000;
800
+ if(!common_first_t)
801
+ common_first_t = first_t;
802
+ else
803
+ common_first_t = MIN(first_t, common_first_t);
804
811
- if(points_available <= 0)
812
- weight[tier] = -LONG_MAX;
813
- else
814
- weight[tier] = points_coverage;
805
+ if(!common_last_t)
806
+ common_last_t = last_t;
807
+ else
808
+ common_last_t = MAX(last_t, common_last_t);
809
816
- // buffer_sprintf(wb, ": tier %d, first %ld, last %ld (dur %ld, tg %d, every %d), points %ld, tcoverage %ld, pcoverage %ld, weight %ld",
817
- // tier, first_t, last_t, last_t - first_t, rd->tiers[tier]->tier_grouping, update_every,
818
- // points_available, time_coverage, points_coverage, weight[tier]);
810
+ if(!common_update_every)
811
+ common_update_every = update_every;
812
+ else
813
+ common_update_every = MIN(update_every, common_update_every);
814
+ }
815
+
816
+ weight[tier] = query_plan_points_coverage_weight(common_first_t, common_last_t, common_update_every, after_wanted, before_wanted, points_wanted);
817
}
818
821
- int best_tier = 0;
822
- for(int tier = 1; tier < storage_tiers ; tier++) {
819
+ size_t best_tier = 0;
820
+ for(size_t tier = 1; tier < storage_tiers ; tier++) {
821
if(weight[tier] >= weight[best_tier])
822
best_tier = tier;
823
}
825
if(weight[best_tier] == -LONG_MAX)
826
best_tier = 0;
827
830
- //buffer_sprintf(wb, ": final best tier %d", best_tier);
831
- //internal_error(true, "%s", buffer_tostring(wb));
832
- //buffer_free(wb);
833
-
828
return best_tier;
829
}
830
837
-static int rrdset_find_natural_update_every_for_timeframe(RRDSET *st, time_t after_wanted, time_t before_wanted, long points_wanted, RRDR_OPTIONS options, int tier) {
838
- int ret = st->update_every;
831
+static time_t rrdset_find_natural_update_every_for_timeframe(QUERY_TARGET *qt, time_t after_wanted, time_t before_wanted, size_t points_wanted, RRDR_OPTIONS options, size_t tier) {
832
+ size_t best_tier;
833
+ if((options & RRDR_OPTION_SELECTED_TIER) && tier < storage_tiers)
834
+ best_tier = tier;
835
+ else
836
+ best_tier = rrddim_find_best_tier_for_timeframe(qt, after_wanted, before_wanted, points_wanted);
837
840
- if(unlikely(!rrdset_number_of_dimensions(st)))
841
- return ret;
838
+ // find the db minimum update every for this tier for all metrics
839
+ time_t common_update_every = default_rrd_update_every;
840
+ for(size_t i = 0, used = qt->query.used; i < used ; i++) {
841
+ QUERY_METRIC *qm = &qt->query.array[i];
842
843
- RRDDIM *first_rd = NULL;
844
- rrddim_foreach_read(first_rd, st) break; rrddim_foreach_done(first_rd);
845
- if(!first_rd)
846
- return ret;
843
+ time_t update_every = qm->tiers[best_tier].db_update_every;
844
848
- int best_tier;
849
- if(options & RRDR_OPTION_SELECTED_TIER && tier >= 0 && tier < storage_tiers)
850
- best_tier = tier;
851
- else {
852
- best_tier = rrddim_find_best_tier_for_timeframe(first_rd, after_wanted, before_wanted, points_wanted);
853
- }
854
-
855
- if(!first_rd->tiers[best_tier]) {
856
- internal_error(
857
- true,
858
- "QUERY: tier %d on chart '%s', is not initialized", best_tier, rrdset_name(st));
859
- }
860
- else {
861
- ret = (int)first_rd->tiers[best_tier]->tier_grouping * (int)st->update_every;
862
- if(unlikely(!ret)) {
863
- internal_error(
864
- true,
865
- "QUERY: update_every calculated to be zero on chart '%s', tier_grouping %d, update_every %d",
866
- rrdset_name(st), first_rd->tiers[best_tier]->tier_grouping, st->update_every);
867
-
868
- ret = st->update_every;
869
- }
845
+ if(!i)
846
+ common_update_every = update_every;
847
+ else
848
+ common_update_every = MIN(update_every, common_update_every);
849
}
850
872
- return ret;
851
+ return common_update_every;
852
}
853
854
// ----------------------------------------------------------------------------
896
typedef struct query_engine_ops {
897
// configuration
898
RRDR *r;
920
- RRDDIM *rd;
899
+ QUERY_METRIC *qm;
900
time_t view_update_every;
901
time_t query_granularity;
902
TIER_QUERY_FETCH tier_query_fetch;
908
909
// storage queries
910
size_t tier;
932
- struct rrddim_tier *tier_ptr;
933
- struct rrddim_query_handle handle;
934
- STORAGE_POINT (*next_metric)(struct rrddim_query_handle *handle);
935
- int (*is_finished)(struct rrddim_query_handle *handle);
936
- void (*finalize)(struct rrddim_query_handle *handle);
911
+ struct query_metric_tier *tier_ptr;
912
+ struct storage_engine_query_handle handle;
913
+ STORAGE_POINT (*next_metric)(struct storage_engine_query_handle *handle);
914
+ int (*is_finished)(struct storage_engine_query_handle *handle);
915
+ void (*finalize)(struct storage_engine_query_handle *handle);
916
917
// aggregating points over time
918
void (*grouping_add)(struct rrdresult *r, NETDATA_DOUBLE value);
933
934
#define query_plan_should_switch_plan(ops, now) ((now) >= (ops).current_plan_expire_time)
935
957
-static void query_planer_activate_plan(QUERY_ENGINE_OPS *ops, size_t plan_id, time_t overwrite_after) {
936
+static bool query_planer_activate_plan(QUERY_ENGINE_OPS *ops, size_t plan_id, time_t overwrite_after) {
937
if(unlikely(plan_id >= ops->plan.entries))
938
plan_id = ops->plan.entries - 1;
939
940
+ if(!query_metric_is_valid_tier(ops->qm, ops->plan.data[plan_id].tier)) {
941
+ ops->current_plan_expire_time = ops->plan.data[plan_id].before;
942
+ return false;
943
+ }
944
+
945
time_t after = ops->plan.data[plan_id].after;
946
time_t before = ops->plan.data[plan_id].before;
947
949
after = overwrite_after;
950
951
ops->tier = ops->plan.data[plan_id].tier;
968
- ops->tier_ptr = ops->rd->tiers[ops->tier];
969
- ops->tier_ptr->query_ops.init(ops->tier_ptr->db_metric_handle, &ops->handle, after, before);
970
- ops->next_metric = ops->tier_ptr->query_ops.next_metric;
971
- ops->is_finished = ops->tier_ptr->query_ops.is_finished;
972
- ops->finalize = ops->tier_ptr->query_ops.finalize;
952
+ ops->tier_ptr = &ops->qm->tiers[ops->tier];
953
+ ops->tier_ptr->eng->api.query_ops.init(ops->tier_ptr->db_metric_handle, &ops->handle, after, before);
954
+ ops->next_metric = ops->tier_ptr->eng->api.query_ops.next_metric;
955
+ ops->is_finished = ops->tier_ptr->eng->api.query_ops.is_finished;
956
+ ops->finalize = ops->tier_ptr->eng->api.query_ops.finalize;
957
ops->current_plan = plan_id;
958
ops->current_plan_expire_time = ops->plan.data[plan_id].before;
959
+
960
+ return true;
961
}
962
963
static void query_planer_next_plan(QUERY_ENGINE_OPS *ops, time_t now, time_t last_point_end_time) {
970
971
if (ops->current_plan >= ops->plan.entries) {
972
ops->current_plan = ops->plan.entries - 1;
973
+ // let the query run with current plan
974
+ // we will not switch it
975
return;
976
}
977
983
ops->finalize = NULL;
984
}
985
998
- query_planer_activate_plan(ops, ops->current_plan, MIN(now, last_point_end_time));
999
-
986
// internal_error(true, "QUERY: switched plan to %zu (all is %zu), previous expiration was %ld, this starts at %ld, now is %ld, last_point_end_time %ld", ops->current_plan, ops->plan.entries, ops->plan.data[ops->current_plan-1].before, ops->plan.data[ops->current_plan].after, now, last_point_end_time);
987
+
988
+ query_planer_activate_plan(ops, ops->current_plan, MIN(now, last_point_end_time));
989
}
990
991
static int compare_query_plan_entries_on_start_time(const void *a, const void *b) {
994
return (p1->after < p2->after)?-1:1;
995
}
996
1009
-static void query_plan(QUERY_ENGINE_OPS *ops, time_t after_wanted, time_t before_wanted, long points_wanted) {
1010
- RRDDIM *rd = ops->rd;
1011
-
997
+static bool query_plan(QUERY_ENGINE_OPS *ops, time_t after_wanted, time_t before_wanted, size_t points_wanted) {
998
//BUFFER *wb = buffer_create(1000);
999
//buffer_sprintf(wb, "QUERY PLAN for chart '%s' dimension '%s', from %ld to %ld:", rd->rrdset->name, rd->name, after_wanted, before_wanted);
1000
1001
// put our selected tier as the first plan
1002
size_t selected_tier;
1003
1018
- if(ops->r->internal.query_options & RRDR_OPTION_SELECTED_TIER && ops->r->internal.query_tier >= 0 && ops->r->internal.query_tier < storage_tiers) {
1019
- selected_tier = ops->r->internal.query_tier;
1004
+ if(ops->r->internal.query_options & RRDR_OPTION_SELECTED_TIER
1005
+ && ops->r->internal.qt->window.tier < storage_tiers
1006
+ && query_metric_is_valid_tier(ops->qm, ops->r->internal.qt->window.tier)) {
1007
+ selected_tier = ops->r->internal.qt->window.tier;
1008
}
1009
else {
1022
-
1023
- selected_tier = rrddim_find_best_tier_for_timeframe(rd, after_wanted, before_wanted, points_wanted);
1010
+ selected_tier = query_metric_best_tier_for_timeframe(ops->qm, after_wanted, before_wanted, points_wanted);
1011
1012
if(ops->r->internal.query_options & RRDR_OPTION_SELECTED_TIER)
1013
ops->r->internal.query_options &= ~RRDR_OPTION_SELECTED_TIER;
1015
1016
ops->plan.entries = 1;
1017
ops->plan.data[0].tier = selected_tier;
1031
- ops->plan.data[0].after = rd->tiers[selected_tier]->query_ops.oldest_time(rd->tiers[selected_tier]->db_metric_handle);
1032
- ops->plan.data[0].before = rd->tiers[selected_tier]->query_ops.latest_time(rd->tiers[selected_tier]->db_metric_handle);
1018
+ ops->plan.data[0].after = ops->qm->tiers[selected_tier].db_first_time_t;
1019
+ ops->plan.data[0].before = ops->qm->tiers[selected_tier].db_last_time_t;
1020
1021
if(!(ops->r->internal.query_options & RRDR_OPTION_SELECTED_TIER)) {
1022
// the selected tier
1028
// check if our selected tier can start the query
1029
if (selected_tier_first_time_t > after_wanted) {
1030
// we need some help from other tiers
1044
- for (int tr = (int)selected_tier + 1; tr < storage_tiers; tr++) {
1031
+ for (size_t tr = (int)selected_tier + 1; tr < storage_tiers; tr++) {
1032
+ if(!query_metric_is_valid_tier(ops->qm, tr))
1033
+ continue;
1034
+
1035
// find the first time of this tier
1046
- time_t first_time_t = rd->tiers[tr]->query_ops.oldest_time(rd->tiers[tr]->db_metric_handle);
1036
+ time_t first_time_t = ops->qm->tiers[tr].db_first_time_t;
1037
1038
//buffer_sprintf(wb, ": EVAL AFTER tier %d, %ld", tier, first_time_t);
1039
1059
if (selected_tier_last_time_t < before_wanted) {
1060
// we need some help from other tiers
1061
for (int tr = (int)selected_tier - 1; tr >= 0; tr--) {
1062
+ if(!query_metric_is_valid_tier(ops->qm, tr))
1063
+ continue;
1064
+
1065
// find the last time of this tier
1073
- time_t last_time_t = rd->tiers[tr]->query_ops.latest_time(rd->tiers[tr]->db_metric_handle);
1066
+ time_t last_time_t = ops->qm->tiers[tr].db_last_time_t;
1067
1068
//buffer_sprintf(wb, ": EVAL BEFORE tier %d, %ld", tier, last_time_t);
1069
1101
1102
//internal_error(true, "%s", buffer_tostring(wb));
1103
1111
- query_planer_activate_plan(ops, 0, 0);
1104
+ return query_planer_activate_plan(ops, 0, 0);
1105
}
1106
1107
1141
(ops).group_anomaly_rate += (point).anomaly; \
1142
} while(0)
1143
1151
-static inline void rrd2rrdr_do_dimension(
1152
- RRDR *r
1153
- , long points_wanted
1154
- , RRDDIM *rd
1155
- , long dim_id_in_rrdr
1156
- , time_t after_wanted
1157
- , time_t before_wanted
1158
-){
1144
+static inline void rrd2rrdr_do_dimension(RRDR *r, size_t dim_id_in_rrdr) {
1145
+ QUERY_TARGET *qt = r->internal.qt;
1146
+ QUERY_METRIC *qm = &qt->query.array[dim_id_in_rrdr];
1147
+ size_t points_wanted = qt->window.points;
1148
+ time_t after_wanted = qt->window.after;
1149
+ time_t before_wanted = qt->window.before;
1150
+
1151
// bool debug_this = false;
1152
// if(strcmp("user", string2str(rd->id)) == 0 && strcmp("system.cpu", string2str(rd->rrdset->id)) == 0)
1153
// debug_this = true;
1159
1160
QUERY_ENGINE_OPS ops = {
1161
.r = r,
1170
- .rd = rd,
1162
+ .qm = qm,
1163
.grouping_add = r->internal.grouping_add,
1164
.grouping_flush = r->internal.grouping_flush,
1165
.tier_query_fetch = r->internal.tier_query_fetch,
1166
.view_update_every = r->update_every,
1175
- .query_granularity = r->update_every / r->group,
1167
+ .query_granularity = (time_t)(r->update_every / r->group),
1168
.group_value_flags = RRDR_VALUE_NOTHING
1169
};
1170
1171
long rrdr_line = -1;
1172
bool use_anomaly_bit_as_value = (r->internal.query_options & RRDR_OPTION_ANOMALY_BIT) ? true : false;
1173
1182
- query_plan(&ops, after_wanted, before_wanted, points_wanted);
1174
+ if(!query_plan(&ops, after_wanted, before_wanted, points_wanted))
1175
+ return;
1176
1177
NETDATA_DOUBLE min = r->min, max = r->max;
1178
1184
time_t now_end_time = after_wanted + ops.view_update_every - ops.query_granularity;
1185
1186
// The main loop, based on the query granularity we need
1194
- for( ; (long)points_added < points_wanted ; now_start_time = now_end_time, now_end_time += ops.view_update_every) {
1187
+ for( ; points_added < points_wanted ; now_start_time = now_end_time, now_end_time += ops.view_update_every) {
1188
1189
if(query_plan_should_switch_plan(ops, now_end_time))
1190
query_planer_next_plan(&ops, now_end_time, new_point.end_time);
1264
1265
// check if the db is giving us zero duration points
1266
if(unlikely(new_point.start_time == new_point.end_time)) {
1274
- internal_error(true, "QUERY: next_metric(%s, %s) returned point %zu start time %ld, end time %ld, that are both equal",
1275
- rrdset_name(rd->rrdset), rrddim_name(rd), new_point.id, new_point.start_time, new_point.end_time);
1267
+ internal_error(true, "QUERY: '%s', dimension '%s' next_metric() returned point %zu start time %ld, end time %ld, that are both equal",
1268
+ qt->id, string2str(qm->dimension.id), new_point.id, new_point.start_time, new_point.end_time);
1269
1277
- new_point.start_time = new_point.end_time - ((time_t)ops.tier_ptr->tier_grouping * (time_t)ops.rd->update_every);
1270
+ new_point.start_time = new_point.end_time - ops.tier_ptr->db_update_every;
1271
}
1272
1273
// check if the db is advancing the query
1274
if(unlikely(new_point.end_time <= last1_point.end_time)) {
1282
- internal_error(true, "QUERY: next_metric(%s, %s) returned point %zu from %ld to %ld, before the last point %zu end time %ld, now is %ld to %ld",
1283
- rrdset_name(rd->rrdset), rrddim_name(rd), new_point.id, new_point.start_time, new_point.end_time,
1275
+ internal_error(true, "QUERY: '%s', dimension '%s' next_metric() returned point %zu from %ld to %ld, before the last point %zu end time %ld, now is %ld to %ld",
1276
+ qt->id, string2str(qm->dimension.id), new_point.id, new_point.start_time, new_point.end_time,
1277
last1_point.id, last1_point.end_time, now_start_time, now_end_time);
1278
1279
count_same_end_time++;
1300
1301
// we only log if this is not point 1
1302
internal_error(new_point.end_time < after_wanted && new_point.id > 1,
1310
- "QUERY: next_metric(%s, %s) returned point %zu from %ld time %ld, which is entirely before our current timeframe %ld to %ld (and before the entire query, after %ld, before %ld)",
1311
- rrdset_name(rd->rrdset), rrddim_name(rd),
1303
+ "QUERY: '%s', dimension '%s' next_metric() returned point %zu from %ld time %ld, which is entirely before our current timeframe %ld to %ld (and before the entire query, after %ld, before %ld)",
1304
+ qt->id, string2str(qm->dimension.id),
1305
new_point.id, new_point.start_time, new_point.end_time,
1306
now_start_time, now_end_time,
1307
after_wanted, before_wanted);
1317
1318
if(unlikely(count_same_end_time)) {
1319
internal_error(true,
1327
- "QUERY: the database does not advance the query, it returned an end time less or equal to the end time of the last point we got %ld, %zu times",
1328
- last1_point.end_time, count_same_end_time);
1320
+ "QUERY: '%s', dimension '%s', the database does not advance the query, it returned an end time less or equal to the end time of the last point we got %ld, %zu times",
1321
+ qt->id, string2str(qm->dimension.id), last1_point.end_time, count_same_end_time);
1322
1323
if(unlikely(new_point.end_time <= last1_point.end_time))
1324
new_point.end_time = now_end_time;
1329
// we select the one to use based on their timestamps
1330
1331
size_t iterations = 0;
1339
- for ( ; now_end_time <= new_point.end_time && (long)points_added < points_wanted ;
1332
+ for ( ; now_end_time <= new_point.end_time && points_added < points_wanted ;
1333
now_end_time += ops.view_update_every, iterations++) {
1334
1335
// now_start_time is wrong in this loop
1342
current_point = new_point;
1343
query_interpolate_point(current_point, last1_point, now_end_time);
1344
1352
- internal_error(current_point.id > 0 && last1_point.id == 0 && current_point.end_time > after_wanted && current_point.end_time > now_end_time,
1353
- "QUERY: on '%s', dim '%s', after %ld, before %ld, view update every %ld, query granularity %ld,"
1354
- " interpolating point %zu (from %ld to %ld) at %ld, but we could really favor by having last_point1 in this query.",
1355
- rrdset_name(rd->rrdset), rrddim_name(rd), after_wanted, before_wanted, ops.view_update_every, ops.query_granularity,
1356
- current_point.id, current_point.start_time, current_point.end_time, now_end_time);
1345
+ internal_error(current_point.id > 0
1346
+ && last1_point.id == 0
1347
+ && current_point.end_time > after_wanted
1348
+ && current_point.end_time > now_end_time,
1349
+ "QUERY: '%s', dimension '%s', after %ld, before %ld, view update every %ld,"
1350
+ " query granularity %ld, interpolating point %zu (from %ld to %ld) at %ld,"
1351
+ " but we could really favor by having last_point1 in this query.",
1352
+ qt->id, string2str(qm->dimension.id),
1353
+ after_wanted, before_wanted,
1354
+ ops.view_update_every, ops.query_granularity,
1355
+ current_point.id, current_point.start_time, current_point.end_time,
1356
+ now_end_time);
1357
}
1358
else if(likely(now_end_time <= last1_point.end_time)) {
1359
// our LAST point is still valid
1360
current_point = last1_point;
1361
query_interpolate_point(current_point, last2_point, now_end_time);
1362
1363
- internal_error(current_point.id > 0 && last2_point.id == 0 && current_point.end_time > after_wanted && current_point.end_time > now_end_time,
1364
- "QUERY: on '%s', dim '%s', after %ld, before %ld, view update every %ld, query granularity %ld,"
1365
- " interpolating point %zu (from %ld to %ld) at %ld, but we could really favor by having last_point2 in this query.",
1366
- rrdset_name(rd->rrdset), rrddim_name(rd), after_wanted, before_wanted, ops.view_update_every, ops.query_granularity,
1367
- current_point.id, current_point.start_time, current_point.end_time, now_end_time);
1363
+ internal_error(current_point.id > 0
1364
+ && last2_point.id == 0
1365
+ && current_point.end_time > after_wanted
1366
+ && current_point.end_time > now_end_time,
1367
+ "QUERY: '%s', dimension '%s', after %ld, before %ld, view update every %ld,"
1368
+ " query granularity %ld, interpolating point %zu (from %ld to %ld) at %ld,"
1369
+ " but we could really favor by having last_point2 in this query.",
1370
+ qt->id, string2str(qm->dimension.id),
1371
+ after_wanted, before_wanted, ops.view_update_every, ops.query_granularity,
1372
+ current_point.id, current_point.start_time, current_point.end_time,
1373
+ now_end_time);
1374
}
1375
else {
1376
// a GAP, we don't have a value this time
1433
1434
r->internal.result_points_generated += points_added;
1435
r->internal.db_points_read += ops.db_total_points_read;
1430
- for(int tr = 0; tr < storage_tiers ; tr++)
1436
+ for(size_t tr = 0; tr < storage_tiers ; tr++)
1437
r->internal.tier_points_read[tr] += ops.db_points_read_per_tier[tr];
1438
1439
r->min = min;
1442
r->after = min_date - ops.view_update_every + ops.query_granularity;
1443
rrdr_done(r, rrdr_line);
1444
1439
- internal_error((long)points_added != points_wanted,
1440
- "QUERY: query on %s/%s requested %zu points, but RRDR added %zu (%zu db points read).",
1441
- rrdset_name(r->st), rrddim_name(rd), (size_t)points_wanted, (size_t)points_added, ops.db_total_points_read);
1445
+ internal_error(points_added != points_wanted,
1446
+ "QUERY: '%s', dimension '%s', requested %zu points, but RRDR added %zu (%zu db points read).",
1447
+ qt->id, string2str(qm->dimension.id),
1448
+ (size_t)points_wanted, (size_t)points_added, ops.db_total_points_read);
1449
}
1450
1451
// ----------------------------------------------------------------------------
1453
1454
extern void store_metric_at_tier(RRDDIM *rd, struct rrddim_tier *t, STORAGE_POINT sp, usec_t now_ut);
1455
1449
-void rrdr_fill_tier_gap_from_smaller_tiers(RRDDIM *rd, int tier, time_t now) {
1450
- if(unlikely(tier < 0 || tier >= storage_tiers)) return;
1456
+void rrdr_fill_tier_gap_from_smaller_tiers(RRDDIM *rd, size_t tier, time_t now) {
1457
+ if(unlikely(tier >= storage_tiers)) return;
1458
if(storage_tiers_backfill[tier] == RRD_BACKFILL_NONE) return;
1459
1460
struct rrddim_tier *t = rd->tiers[tier];
1461
if(unlikely(!t)) return;
1462
1456
- time_t latest_time_t = t->query_ops.latest_time(t->db_metric_handle);
1463
+ time_t latest_time_t = t->query_ops->latest_time(t->db_metric_handle);
1464
time_t granularity = (time_t)t->tier_grouping * (time_t)rd->update_every;
1465
time_t time_diff = now - latest_time_t;
1466
1470
// there is really nothing we can do
1471
if(now <= latest_time_t || time_diff < granularity) return;
1472
1466
- struct rrddim_query_handle handle;
1473
+ struct storage_engine_query_handle handle;
1474
1475
size_t all_points_read = 0;
1476
1477
// for each lower tier
1471
- for(int tr = tier - 1; tr >= 0 ;tr--){
1472
- time_t smaller_tier_first_time = rd->tiers[tr]->query_ops.oldest_time(rd->tiers[tr]->db_metric_handle);
1473
- time_t smaller_tier_last_time = rd->tiers[tr]->query_ops.latest_time(rd->tiers[tr]->db_metric_handle);
1478
+ for(int tr = (int)tier - 1; tr >= 0 ;tr--){
1479
+ time_t smaller_tier_first_time = rd->tiers[tr]->query_ops->oldest_time(rd->tiers[tr]->db_metric_handle);
1480
+ time_t smaller_tier_last_time = rd->tiers[tr]->query_ops->latest_time(rd->tiers[tr]->db_metric_handle);
1481
if(smaller_tier_last_time <= latest_time_t) continue; // it is as bad as we are
1482
1483
long after_wanted = (latest_time_t < smaller_tier_first_time) ? smaller_tier_first_time : latest_time_t;
1484
long before_wanted = smaller_tier_last_time;
1485
1486
struct rrddim_tier *tmp = rd->tiers[tr];
1480
- tmp->query_ops.init(tmp->db_metric_handle, &handle, after_wanted, before_wanted);
1487
+ tmp->query_ops->init(tmp->db_metric_handle, &handle, after_wanted, before_wanted);
1488
1489
size_t points = 0;
1490
1484
- while(!tmp->query_ops.is_finished(&handle)) {
1491
+ while(!tmp->query_ops->is_finished(&handle)) {
1492
1486
- STORAGE_POINT sp = tmp->query_ops.next_metric(&handle);
1493
+ STORAGE_POINT sp = tmp->query_ops->next_metric(&handle);
1494
1495
if(sp.end_time > latest_time_t) {
1496
latest_time_t = sp.end_time;
1500
}
1501
1502
all_points_read += points;
1496
- tmp->query_ops.finalize(&handle);
1503
+ tmp->query_ops->finalize(&handle);
1504
1505
//internal_error(true, "DBENGINE: backfilled chart '%s', dimension '%s', tier %d, from %ld to %ld, with %zu points from tier %d",
1506
// rd->rrdset->name, rd->name, tier, after_wanted, before_wanted, points, tr);
1517
, RRDR_OPTIONS options __maybe_unused
1518
, RRDR_GROUPING group_method
1519
, bool aligned
1513
- , long group
1514
- , long resampling_time
1515
- , long resampling_group
1520
+ , size_t group
1521
+ , time_t resampling_time
1522
+ , size_t resampling_group
1523
, time_t after_wanted
1524
, time_t after_requested
1525
, time_t before_wanted
1526
, time_t before_requested
1520
- , long points_requested
1521
- , long points_wanted
1527
+ , size_t points_requested
1528
+ , size_t points_wanted
1529
//, size_t after_slot
1530
//, size_t before_slot
1531
, const char *msg
1532
) {
1533
1527
- time_t first_entry_t = rrdset_first_entry_t(r->st);
1528
- time_t last_entry_t = rrdset_last_entry_t(r->st);
1534
+ time_t first_entry_t = r->internal.qt->db.first_time_t;
1535
+ time_t last_entry_t = r->internal.qt->db.last_time_t;
1536
1530
- info("INTERNAL ERROR: rrd2rrdr() on %s update every %d with %s grouping %s (group: %ld, resampling_time: %ld, resampling_group: %ld), "
1531
- "after (got: %zu, want: %zu, req: %ld, db: %zu), "
1532
- "before (got: %zu, want: %zu, req: %ld, db: %zu), "
1533
- "duration (got: %zu, want: %zu, req: %ld, db: %zu), "
1534
- //"slot (after: %zu, before: %zu, delta: %zu), "
1535
- "points (got: %ld, want: %ld, req: %ld, db: %ld), "
1537
+ internal_error(
1538
+ true,
1539
+ "rrd2rrdr() on %s update every %ld with %s grouping %s (group: %zu, resampling_time: %ld, resampling_group: %zu), "
1540
+ "after (got: %ld, want: %ld, req: %ld, db: %ld), "
1541
+ "before (got: %ld, want: %ld, req: %ld, db: %ld), "
1542
+ "duration (got: %ld, want: %ld, req: %ld, db: %ld), "
1543
+ "points (got: %zu, want: %zu, req: %zu), "
1544
"%s"
1537
- , rrdset_name(r->st)
1538
- , r->st->update_every
1545
+ , r->internal.qt->id
1546
+ , r->internal.qt->window.query_granularity
1547
1548
// grouping
1549
, (aligned) ? "aligned" : "unaligned"
1553
, resampling_group
1554
1555
// after
1548
- , (size_t)r->after
1549
- , (size_t)after_wanted
1556
+ , r->after
1557
+ , after_wanted
1558
, after_requested
1551
- , (size_t)first_entry_t
1559
+ , first_entry_t
1560
1561
// before
1554
- , (size_t)r->before
1555
- , (size_t)before_wanted
1562
+ , r->before
1563
+ , before_wanted
1564
, before_requested
1557
- , (size_t)last_entry_t
1565
+ , last_entry_t
1566
1567
// duration
1560
- , (size_t)(r->before - r->after + r->st->update_every)
1561
- , (size_t)(before_wanted - after_wanted + r->st->update_every)
1562
- , before_requested - after_requested
1563
- , (size_t)((last_entry_t - first_entry_t) + r->st->update_every)
1564
-
1565
- // slot
1566
- /*
1567
- , after_slot
1568
- , before_slot
1569
- , (after_slot > before_slot) ? (r->st->entries - after_slot + before_slot) : (before_slot - after_slot)
1570
- */
1568
+ , (long)(r->before - r->after + r->internal.qt->window.query_granularity)
1569
+ , (long)(before_wanted - after_wanted + r->internal.qt->window.query_granularity)
1570
+ , (long)before_requested - after_requested
1571
+ , (long)((last_entry_t - first_entry_t) + r->internal.qt->window.query_granularity)
1572
1573
// points
1574
, r->rows
1575
, points_wanted
1576
, points_requested
1576
- , r->st->entries
1577
1578
// message
1579
, msg
1582
#endif // NETDATA_INTERNAL_CHECKS
1583
1584
// Returns 1 if an absolute period was requested or 0 if it was a relative period
1585
-int rrdr_relative_window_to_absolute(long long *after, long long *before) {
1585
+bool rrdr_relative_window_to_absolute(time_t *after, time_t *before) {
1586
time_t now = now_realtime_sec() - 1;
1587
1588
int absolute_period_requested = -1;
1642
*before = before_requested;
1643
*after = after_requested;
1644
1645
- return absolute_period_requested;
1645
+ return (absolute_period_requested != 1);
1646
}
1647
1648
// #define DEBUG_QUERY_LOGIC 1
1651
#define query_debug_log_init() BUFFER *debug_log = buffer_create(1000)
1652
#define query_debug_log(args...) buffer_sprintf(debug_log, ##args)
1653
#define query_debug_log_fin() { \
1654
- info("QUERY: chart '%s', after:%lld, before:%lld, duration:%lld, points:%ld, res:%ld - wanted => after:%lld, before:%lld, points:%ld, group:%ld, granularity:%ld, resgroup:%ld, resdiv:" NETDATA_DOUBLE_FORMAT_AUTO " %s", st->name, after_requested, before_requested, before_requested - after_requested, points_requested, resampling_time_requested, after_wanted, before_wanted, points_wanted, group, query_granularity, resampling_group, resampling_divisor, buffer_tostring(debug_log)); \
1654
+ info("QUERY: '%s', after:%ld, before:%ld, duration:%ld, points:%zu, res:%ld - wanted => after:%ld, before:%ld, points:%zu, group:%zu, granularity:%ld, resgroup:%ld, resdiv:" NETDATA_DOUBLE_FORMAT_AUTO " %s", qt->id, after_requested, before_requested, before_requested - after_requested, points_requested, resampling_time_requested, after_wanted, before_wanted, points_wanted, group, query_granularity, resampling_group, resampling_divisor, buffer_tostring(debug_log)); \
1655
buffer_free(debug_log); \
1656
debug_log = NULL; \
1657
}
1663
#define query_debug_log_free() debug_dummy()
1664
#endif
1665
1666
-RRDR *rrd2rrdr(
1667
- ONEWAYALLOC *owa
1668
- , RRDSET *st
1669
- , long points_requested
1670
- , long long after_requested
1671
- , long long before_requested
1672
- , RRDR_GROUPING group_method
1673
- , long resampling_time_requested
1674
- , RRDR_OPTIONS options
1675
- , const char *dimensions
1676
- , struct context_param *context_param_list
1677
- , const char *group_options
1678
- , int timeout
1679
- , int tier
1680
-) {
1666
+bool query_target_calculate_window(QUERY_TARGET *qt) {
1667
+ if (unlikely(!qt)) return false;
1668
+
1669
+ size_t points_requested = (long)qt->request.points;
1670
+ time_t after_requested = qt->request.after;
1671
+ time_t before_requested = qt->request.before;
1672
+ RRDR_GROUPING group_method = qt->request.group_method;
1673
+ time_t resampling_time_requested = qt->request.resampling_time;
1674
+ RRDR_OPTIONS options = qt->request.options;
1675
+ size_t tier = qt->request.tier;
1676
+ time_t update_every = qt->db.minimum_latest_update_every;
1677
+
1678
// RULES
1679
// points_requested = 0
1680
// the user wants all the natural points the database has
1688
// when natural points are wanted, the query has to be aligned to the update_every
1689
// of the database
1690
1694
- long points_wanted = points_requested;
1695
- long long after_wanted = after_requested;
1696
- long long before_wanted = before_requested;
1697
- int update_every = st->update_every;
1691
+ size_t points_wanted = points_requested;
1692
+ time_t after_wanted = after_requested;
1693
+ time_t before_wanted = before_requested;
1694
1695
bool aligned = !(options & RRDR_OPTION_NOT_ALIGNED);
1696
bool automatic_natural_points = (points_wanted == 0);
1700
1701
query_debug_log_init();
1702
1707
- // make sure points_wanted is positive
1708
- if(points_wanted < 0) {
1709
- points_wanted = -points_wanted;
1710
- query_debug_log(":-points_wanted %ld", points_wanted);
1711
- }
1712
-
1713
- if(ABS(before_requested) <= API_RELATIVE_TIME_MAX || ABS(after_requested) <= API_RELATIVE_TIME_MAX) {
1703
+ if (ABS(before_requested) <= API_RELATIVE_TIME_MAX || ABS(after_requested) <= API_RELATIVE_TIME_MAX) {
1704
relative_period_requested = true;
1705
natural_points = true;
1706
options |= RRDR_OPTION_NATURAL_POINTS;
1708
}
1709
1710
// if the user wants virtual points, make sure we do it
1721
- if(options & RRDR_OPTION_VIRTUAL_POINTS)
1711
+ if (options & RRDR_OPTION_VIRTUAL_POINTS)
1712
natural_points = false;
1713
1714
// set the right flag about natural and virtual points
1725
- if(natural_points) {
1715
+ if (natural_points) {
1716
options |= RRDR_OPTION_NATURAL_POINTS;
1717
1728
- if(options & RRDR_OPTION_VIRTUAL_POINTS)
1718
+ if (options & RRDR_OPTION_VIRTUAL_POINTS)
1719
options &= ~RRDR_OPTION_VIRTUAL_POINTS;
1720
}
1721
else {
1722
options |= RRDR_OPTION_VIRTUAL_POINTS;
1723
1734
- if(options & RRDR_OPTION_NATURAL_POINTS)
1724
+ if (options & RRDR_OPTION_NATURAL_POINTS)
1725
options &= ~RRDR_OPTION_NATURAL_POINTS;
1726
}
1727
1738
- if(after_wanted == 0 || before_wanted == 0) {
1739
- // for non-context queries we have to find the duration of the database
1740
- // for context queries we will assume 600 seconds duration
1741
-
1742
- if(!context_param_list) {
1743
- relative_period_requested = true;
1744
-
1745
- time_t first_entry_t = rrdset_first_entry_t(st);
1746
- time_t last_entry_t = rrdset_last_entry_t(st);
1747
-
1748
- if(first_entry_t == 0 || last_entry_t == 0) {
1749
- internal_error(true, "QUERY: chart without data detected on '%s'", rrdset_name(st));
1750
- query_debug_log_free();
1751
- return NULL;
1752
- }
1728
+ if (after_wanted == 0 || before_wanted == 0) {
1729
+ relative_period_requested = true;
1730
1754
- query_debug_log(":first_entry_t %ld, last_entry_t %ld", first_entry_t, last_entry_t);
1731
+ time_t first_entry_t = qt->db.first_time_t;
1732
+ time_t last_entry_t = qt->db.last_time_t;
1733
1756
- if (after_wanted == 0) {
1757
- after_wanted = first_entry_t;
1758
- query_debug_log(":zero after_wanted %lld", after_wanted);
1759
- }
1734
+ if (first_entry_t == 0 || last_entry_t == 0) {
1735
+ internal_error(true, "QUERY: no data detected on query '%s' (db first_entry_t = %ld, last_entry_t = %ld", qt->id, first_entry_t, last_entry_t);
1736
+ query_debug_log_free();
1737
+ return false;
1738
+ }
1739
1761
- if (before_wanted == 0) {
1762
- before_wanted = last_entry_t;
1763
- before_is_aligned_to_db_end = true;
1764
- query_debug_log(":zero before_wanted %lld", before_wanted);
1765
- }
1740
+ query_debug_log(":first_entry_t %ld, last_entry_t %ld", first_entry_t, last_entry_t);
1741
1767
- if(points_wanted == 0) {
1768
- points_wanted = (last_entry_t - first_entry_t) / update_every;
1769
- query_debug_log(":zero points_wanted %ld", points_wanted);
1770
- }
1742
+ if (after_wanted == 0) {
1743
+ after_wanted = first_entry_t;
1744
+ query_debug_log(":zero after_wanted %ld", after_wanted);
1745
}
1746
1773
- // if they are still zero, assume 600
1747
+ if (before_wanted == 0) {
1748
+ before_wanted = last_entry_t;
1749
+ before_is_aligned_to_db_end = true;
1750
+ query_debug_log(":zero before_wanted %ld", before_wanted);
1751
+ }
1752
1775
- if(after_wanted == 0) {
1776
- after_wanted = -600;
1777
- query_debug_log(":zero600 after_wanted %lld", after_wanted);
1753
+ if (points_wanted == 0) {
1754
+ points_wanted = (last_entry_t - first_entry_t) / update_every;
1755
+ query_debug_log(":zero points_wanted %zu", points_wanted);
1756
}
1757
}
1758
1781
- if(points_wanted == 0) {
1759
+ if (points_wanted == 0) {
1760
points_wanted = 600;
1783
- query_debug_log(":zero600 points_wanted %ld", points_wanted);
1761
+ query_debug_log(":zero600 points_wanted %zu", points_wanted);
1762
}
1763
1764
// convert our before_wanted and after_wanted to absolute
1765
rrdr_relative_window_to_absolute(&after_wanted, &before_wanted);
1788
- query_debug_log(":relative2absolute after %lld, before %lld", after_wanted, before_wanted);
1766
+ query_debug_log(":relative2absolute after %ld, before %ld", after_wanted, before_wanted);
1767
1790
- if(natural_points && (options & RRDR_OPTION_SELECTED_TIER) && tier > 0 && storage_tiers > 1) {
1791
- update_every = rrdset_find_natural_update_every_for_timeframe(st, after_wanted, before_wanted, points_wanted, options, tier);
1792
- if(update_every <= 0) update_every = st->update_every;
1793
- query_debug_log(":natural update every %d", update_every);
1768
+ if (natural_points && (options & RRDR_OPTION_SELECTED_TIER) && tier > 0 && storage_tiers > 1) {
1769
+ update_every = rrdset_find_natural_update_every_for_timeframe(
1770
+ qt, after_wanted, before_wanted, points_wanted, options, tier);
1771
+
1772
+ if (update_every <= 0) update_every = qt->db.minimum_latest_update_every;
1773
+ query_debug_log(":natural update every %ld", update_every);
1774
}
1775
1776
// this is the update_every of the query
1777
// it may be different to the update_every of the database
1798
- time_t query_granularity = (natural_points)?update_every:1;
1799
- if(query_granularity <= 0) query_granularity = 1;
1778
+ time_t query_granularity = (natural_points) ? update_every : 1;
1779
+ if (query_granularity <= 0) query_granularity = 1;
1780
query_debug_log(":query_granularity %ld", query_granularity);
1781
1782
// align before_wanted and after_wanted to query_granularity
1783
if (before_wanted % query_granularity) {
1784
before_wanted -= before_wanted % query_granularity;
1805
- query_debug_log(":granularity align before_wanted %lld", before_wanted);
1785
+ query_debug_log(":granularity align before_wanted %ld", before_wanted);
1786
}
1787
1788
if (after_wanted % query_granularity) {
1789
after_wanted -= after_wanted % query_granularity;
1810
- query_debug_log(":granularity align after_wanted %lld", after_wanted);
1790
+ query_debug_log(":granularity align after_wanted %ld", after_wanted);
1791
}
1792
1793
// automatic_natural_points is set when the user wants all the points available in the database
1814
- if(automatic_natural_points) {
1794
+ if (automatic_natural_points) {
1795
points_wanted = (before_wanted - after_wanted + 1) / query_granularity;
1816
- if(unlikely(points_wanted <= 0)) points_wanted = 1;
1817
- query_debug_log(":auto natural points_wanted %ld", points_wanted);
1796
+ if (unlikely(points_wanted <= 0)) points_wanted = 1;
1797
+ query_debug_log(":auto natural points_wanted %zu", points_wanted);
1798
}
1799
1800
time_t duration = before_wanted - after_wanted;
1803
if (unlikely(resampling_time_requested > duration)) {
1804
after_wanted = before_wanted - resampling_time_requested;
1805
duration = before_wanted - after_wanted;
1826
- query_debug_log(":resampling after_wanted %lld", after_wanted);
1806
+ query_debug_log(":resampling after_wanted %ld", after_wanted);
1807
}
1808
1809
// if the duration is not aligned to resampling time
1810
// extend the duration to the past, to avoid a gap at the chart
1811
// only when the missing duration is above 1/10th of a point
1832
- if(resampling_time_requested > query_granularity && duration % resampling_time_requested) {
1812
+ if (resampling_time_requested > query_granularity && duration % resampling_time_requested) {
1813
time_t delta = duration % resampling_time_requested;
1834
- if(delta > resampling_time_requested / 10) {
1814
+ if (delta > resampling_time_requested / 10) {
1815
after_wanted -= resampling_time_requested - delta;
1816
duration = before_wanted - after_wanted;
1837
- query_debug_log(":resampling2 after_wanted %lld", after_wanted);
1817
+ query_debug_log(":resampling2 after_wanted %ld", after_wanted);
1818
}
1819
}
1820
1821
// the available points of the query
1842
- long points_available = (duration + 1) / query_granularity;
1843
- if(unlikely(points_available <= 0)) points_available = 1;
1844
- query_debug_log(":points_available %ld", points_available);
1822
+ size_t points_available = (duration + 1) / query_granularity;
1823
+ if (unlikely(points_available <= 0)) points_available = 1;
1824
+ query_debug_log(":points_available %zu", points_available);
1825
1846
- if(points_wanted > points_available) {
1826
+ if (points_wanted > points_available) {
1827
points_wanted = points_available;
1848
- query_debug_log(":max points_wanted %ld", points_wanted);
1828
+ query_debug_log(":max points_wanted %zu", points_wanted);
1829
}
1830
1831
// calculate the desired grouping of source data points
1852
- long group = points_available / points_wanted;
1853
- if(group <= 0) group = 1;
1832
+ size_t group = points_available / points_wanted;
1833
+ if (group == 0) group = 1;
1834
1835
// round "group" to the closest integer
1856
- if(points_available % points_wanted > points_wanted / 2)
1836
+ if (points_available % points_wanted > points_wanted / 2)
1837
group++;
1838
1859
- query_debug_log(":group %ld", group);
1839
+ query_debug_log(":group %zu", group);
1840
1861
- if(points_wanted * group * query_granularity < duration) {
1841
+ if (points_wanted * group * query_granularity < (size_t)duration) {
1842
// the grouping we are going to do, is not enough
1843
// to cover the entire duration requested, so
1844
// we have to change the number of points, to make sure we will
1847
// let's see how many points are the optimal
1848
points_wanted = points_available / group;
1849
1870
- if(points_wanted * group < points_available)
1850
+ if (points_wanted * group < points_available)
1851
points_wanted++;
1852
1873
- if(unlikely(points_wanted <= 0))
1853
+ if (unlikely(points_wanted == 0))
1854
points_wanted = 1;
1855
1876
- query_debug_log(":optimal points %ld", points_wanted);
1856
+ query_debug_log(":optimal points %zu", points_wanted);
1857
}
1858
1859
// resampling_time_requested enforces a certain grouping multiple
1860
NETDATA_DOUBLE resampling_divisor = 1.0;
1881
- long resampling_group = 1;
1882
- if(unlikely(resampling_time_requested > query_granularity)) {
1861
+ size_t resampling_group = 1;
1862
+ if (unlikely(resampling_time_requested > query_granularity)) {
1863
// the points we should group to satisfy gtime
1864
resampling_group = resampling_time_requested / query_granularity;
1885
- if(unlikely(resampling_time_requested % query_granularity))
1865
+ if (unlikely(resampling_time_requested % query_granularity))
1866
resampling_group++;
1867
1888
- query_debug_log(":resampling group %ld", resampling_group);
1868
+ query_debug_log(":resampling group %zu", resampling_group);
1869
1870
// adapt group according to resampling_group
1891
- if(unlikely(group < resampling_group)) {
1892
- group = resampling_group; // do not allow grouping below the desired one
1893
- query_debug_log(":group less res %ld", group);
1871
+ if (unlikely(group < resampling_group)) {
1872
+ group = resampling_group; // do not allow grouping below the desired one
1873
+ query_debug_log(":group less res %zu", group);
1874
}
1895
- if(unlikely(group % resampling_group)) {
1875
+ if (unlikely(group % resampling_group)) {
1876
group += resampling_group - (group % resampling_group); // make sure group is multiple of resampling_group
1897
- query_debug_log(":group mod res %ld", group);
1877
+ query_debug_log(":group mod res %zu", group);
1878
}
1879
1880
// resampling_divisor = group / resampling_group;
1901
- resampling_divisor = (NETDATA_DOUBLE)(group * query_granularity) / (NETDATA_DOUBLE)resampling_time_requested;
1881
+ resampling_divisor = (NETDATA_DOUBLE) (group * query_granularity) / (NETDATA_DOUBLE) resampling_time_requested;
1882
query_debug_log(":resampling divisor " NETDATA_DOUBLE_FORMAT, resampling_divisor);
1883
}
1884
1885
// now that we have group, align the requested timeframe to fit it.
1906
- if(aligned && before_wanted % (group * query_granularity)) {
1907
- if(before_is_aligned_to_db_end)
1908
- before_wanted -= before_wanted % (group * query_granularity);
1886
+ if (aligned && before_wanted % (group * query_granularity)) {
1887
+ if (before_is_aligned_to_db_end)
1888
+ before_wanted -= before_wanted % (time_t)(group * query_granularity);
1889
else
1910
- before_wanted += (group * query_granularity) - before_wanted % (group * query_granularity);
1911
- query_debug_log(":align before_wanted %lld", before_wanted);
1890
+ before_wanted += (time_t)(group * query_granularity) - before_wanted % (time_t)(group * query_granularity);
1891
+ query_debug_log(":align before_wanted %ld", before_wanted);
1892
}
1893
1914
- after_wanted = before_wanted - (points_wanted * group * query_granularity) + query_granularity;
1915
- query_debug_log(":final after_wanted %lld", after_wanted);
1894
+ after_wanted = before_wanted - (time_t)(points_wanted * group * query_granularity) + query_granularity;
1895
+ query_debug_log(":final after_wanted %ld", after_wanted);
1896
1897
duration = before_wanted - after_wanted;
1898
query_debug_log(":final duration %ld", duration + 1);
1899
1920
- // check the context query based on the starting time of the query
1921
- if (context_param_list && !(context_param_list->flags & CONTEXT_FLAGS_ARCHIVE)) {
1922
- rebuild_context_param_list(owa, context_param_list, after_wanted);
1923
- st = context_param_list->rd ? context_param_list->rd->rrdset : NULL;
1924
-
1925
- if(unlikely(!st))
1926
- return NULL;
1927
- }
1900
+ query_debug_log_fin();
1901
1902
internal_error(points_wanted != duration / (query_granularity * group) + 1,
1930
- "QUERY: points_wanted %ld is not points %ld",
1931
- points_wanted, duration / (query_granularity * group) + 1);
1903
+ "QUERY: points_wanted %zu is not points %zu",
1904
+ points_wanted, (size_t)(duration / (query_granularity * group) + 1));
1905
1906
internal_error(group < resampling_group,
1934
- "QUERY: group %ld is less than the desired group points %ld",
1907
+ "QUERY: group %zu is less than the desired group points %zu",
1908
group, resampling_group);
1909
1910
internal_error(group > resampling_group && group % resampling_group,
1938
- "QUERY: group %ld is not a multiple of the desired group points %ld",
1911
+ "QUERY: group %zu is not a multiple of the desired group points %zu",
1912
group, resampling_group);
1913
1914
// -------------------------------------------------------------------------
1942
- // initialize our result set
1943
- // this also locks the chart for us
1915
+ // update QUERY_TARGET with our calculations
1916
+
1917
+ qt->window.after = after_wanted;
1918
+ qt->window.before = before_wanted;
1919
+ qt->window.relative = relative_period_requested;
1920
+ qt->window.points = points_wanted;
1921
+ qt->window.group = group;
1922
+ qt->window.group_method = group_method;
1923
+ qt->window.group_options = qt->request.group_options;
1924
+ qt->window.query_granularity = query_granularity;
1925
+ qt->window.resampling_group = resampling_group;
1926
+ qt->window.resampling_divisor = resampling_divisor;
1927
+ qt->window.options = options;
1928
+ qt->window.tier = tier;
1929
+ qt->window.aligned = aligned;
1930
+
1931
+ return true;
1932
+}
1933
1945
- RRDR *r = rrdr_create(owa, st, points_wanted, context_param_list);
1934
+RRDR *rrd2rrdr_legacy(
1935
+ ONEWAYALLOC *owa,
1936
+ RRDSET *st, size_t points, time_t after, time_t before,
1937
+ RRDR_GROUPING group_method, time_t resampling_time, RRDR_OPTIONS options, const char *dimensions,
1938
+ const char *group_options, time_t timeout, size_t tier) {
1939
+
1940
+ QUERY_TARGET_REQUEST qtr = {
1941
+ .st = st,
1942
+ .points = points,
1943
+ .after = after,
1944
+ .before = before,
1945
+ .group_method = group_method,
1946
+ .resampling_time = resampling_time,
1947
+ .options = options,
1948
+ .dimensions = dimensions,
1949
+ .group_options = group_options,
1950
+ .timeout = timeout,
1951
+ .tier = tier,
1952
+ };
1953
+
1954
+ return rrd2rrdr(owa, query_target_create(&qtr));
1955
+}
1956
+
1957
+RRDR *rrd2rrdr(ONEWAYALLOC *owa, QUERY_TARGET *qt) {
1958
+ if(!qt || !owa) return NULL;
1959
+
1960
+ time_t timeout = qt->request.timeout;
1961
+ time_t resampling_time_requested = qt->request.resampling_time;
1962
+ time_t after_requested = qt->request.after;
1963
+ time_t before_requested = qt->request.before;
1964
+ size_t points_requested = qt->request.points;
1965
+
1966
+ RRDR_OPTIONS options = qt->window.options;
1967
+ size_t points_wanted = qt->window.points;
1968
+ time_t after_wanted = qt->window.after;
1969
+ time_t before_wanted = qt->window.before;
1970
+ bool relative_period_requested = qt->window.relative;
1971
+ bool aligned = qt->window.aligned;
1972
+ RRDR_GROUPING group_method = qt->window.group_method;
1973
+ size_t group = qt->window.group;
1974
+ size_t resampling_group = qt->window.resampling_group;
1975
+ time_t query_granularity = qt->window.query_granularity;
1976
+
1977
+ RRDR *r = rrdr_create(owa, qt);
1978
if(unlikely(!r)) {
1947
- internal_error(true, "QUERY: cannot create RRDR for %s, after=%u, before=%u, duration=%u, points=%ld",
1948
- rrdset_id(st), (uint32_t)after_wanted, (uint32_t)before_wanted, (uint32_t)duration, points_wanted);
1979
+ internal_error(true, "QUERY: cannot create RRDR for %s, after=%ld, before=%ld, points=%zu",
1980
+ qt->id, after_wanted, before_wanted, points_wanted);
1981
return NULL;
1982
}
1983
1984
if(unlikely(!r->d || !points_wanted)) {
1953
- internal_error(true, "QUERY: returning empty RRDR (no dimensions in RRDSET) for %s, after=%u, before=%u, duration=%zu, points=%ld",
1954
- rrdset_id(st), (uint32_t)after_wanted, (uint32_t)before_wanted, (size_t)duration, points_wanted);
1985
+ internal_error(true, "QUERY: returning empty RRDR (no dimensions in RRDSET) for %s, after=%ld, before=%ld, points=%zu",
1986
+ qt->id, after_wanted, before_wanted, points_wanted);
1987
return r;
1988
}
1989
1992
else
1993
r->result_options |= RRDR_RESULT_OPTION_ABSOLUTE;
1994
1963
- // find how many dimensions we have
1964
- long dimensions_count = r->d;
1965
-
1995
// -------------------------------------------------------------------------
1996
// initialize RRDR
1997
1969
- r->group = group;
1970
- r->update_every = (int)(group * query_granularity);
1971
- r->before = before_wanted;
1972
- r->after = after_wanted;
1973
- r->internal.points_wanted = points_wanted;
1974
- r->internal.resampling_group = resampling_group;
1975
- r->internal.resampling_divisor = resampling_divisor;
1976
- r->internal.query_options = options;
1977
- r->internal.query_tier = tier;
1998
+ r->group = qt->window.group;
1999
+ r->update_every = (int) (qt->window.group * qt->window.query_granularity);
2000
+ r->before = qt->window.before;
2001
+ r->after = qt->window.after;
2002
+ r->internal.points_wanted = qt->window.points;
2003
+ r->internal.resampling_group = qt->window.resampling_group;
2004
+ r->internal.resampling_divisor = qt->window.resampling_divisor;
2005
+ r->internal.query_options = qt->window.options;
2006
2007
// -------------------------------------------------------------------------
2008
// assign the processor functions
1981
- rrdr_set_grouping_function(r, group_method);
2009
+ rrdr_set_grouping_function(r, qt->window.group_method);
2010
2011
// allocate any memory required by the grouping method
1984
- r->internal.grouping_create(r, group_options);
1985
-
1986
-
1987
- // -------------------------------------------------------------------------
1988
- // disable the not-wanted dimensions
1989
-
1990
- if (context_param_list && !(context_param_list->flags & CONTEXT_FLAGS_ARCHIVE))
1991
- rrdset_check_rdlock(st);
1992
-
1993
- if(dimensions && *dimensions)
1994
- rrdr_disable_not_selected_dimensions(r, options, dimensions, context_param_list);
1995
-
1996
- query_debug_log_fin();
2012
+ r->internal.grouping_create(r, qt->window.group_options);
2013
2014
// -------------------------------------------------------------------------
2015
// do the work for each dimension
2016
2017
time_t max_after = 0, min_before = 0;
2002
- long max_rows = 0;
2018
+ size_t max_rows = 0;
2019
2004
- RRDDIM *first_rd = context_param_list ? context_param_list->rd : st->dimensions;
2005
- RRDDIM *rd;
2006
- long c, dimensions_used = 0, dimensions_nonzero = 0;
2020
+ long dimensions_used = 0, dimensions_nonzero = 0;
2021
struct timeval query_start_time;
2022
struct timeval query_current_time;
2023
if (timeout) now_realtime_timeval(&query_start_time);
2024
2011
- for(rd = first_rd, c = 0 ; rd && c < dimensions_count ; rd = rd->next, c++) {
2025
+ for(size_t c = 0, max = qt->query.used; c < max ; c++) {
2026
+ // set the query target dimension options to rrdr
2027
+ r->od[c] = qt->query.array[c].dimension.options;
2028
2013
- // if we need a percentage, we need to calculate all dimensions
2014
- if(unlikely(!(options & RRDR_OPTION_PERCENTAGE) && (r->od[c] & RRDR_DIMENSION_HIDDEN))) {
2015
- if(unlikely(r->od[c] & RRDR_DIMENSION_SELECTED)) r->od[c] &= ~RRDR_DIMENSION_SELECTED;
2016
- continue;
2017
- }
2029
r->od[c] |= RRDR_DIMENSION_SELECTED;
2030
2031
// reset the grouping for the new dimension
2032
r->internal.grouping_reset(r);
2033
2023
- rrd2rrdr_do_dimension(r, points_wanted, rd, c, after_wanted, before_wanted);
2034
+ rrd2rrdr_do_dimension(r, c);
2035
if (timeout)
2036
now_realtime_timeval(&query_current_time);
2037
2047
else {
2048
if(r->after != max_after) {
2049
internal_error(true, "QUERY: 'after' mismatch between dimensions for chart '%s': max is %zu, dimension '%s' has %zu",
2039
- rrdset_name(st), (size_t)max_after, rrddim_name(rd), (size_t)r->after);
2050
+ string2str(qt->query.array[c].dimension.id), (size_t)max_after, string2str(qt->query.array[c].dimension.name), (size_t)r->after);
2051
2052
r->after = (r->after > max_after) ? r->after : max_after;
2053
}
2054
2055
if(r->before != min_before) {
2056
internal_error(true, "QUERY: 'before' mismatch between dimensions for chart '%s': max is %zu, dimension '%s' has %zu",
2046
- rrdset_name(st), (size_t)min_before, rrddim_name(rd), (size_t)r->before);
2057
+ string2str(qt->query.array[c].dimension.id), (size_t)min_before, string2str(qt->query.array[c].dimension.name), (size_t)r->before);
2058
2059
r->before = (r->before < min_before) ? r->before : min_before;
2060
}
2061
2062
if(r->rows != max_rows) {
2063
internal_error(true, "QUERY: 'rows' mismatch between dimensions for chart '%s': max is %zu, dimension '%s' has %zu",
2053
- rrdset_name(st), (size_t)max_rows, rrddim_name(rd), (size_t)r->rows);
2064
+ string2str(qt->query.array[c].dimension.id), (size_t)max_rows, string2str(qt->query.array[c].dimension.name), (size_t)r->rows);
2065
2066
r->rows = (r->rows > max_rows) ? r->rows : max_rows;
2067
}
2068
}
2069
2070
dimensions_used++;
2060
- if (timeout && ((NETDATA_DOUBLE)dt_usec(&query_start_time, &query_current_time) / 1000.0) > timeout) {
2061
- log_access("QUERY CANCELED RUNTIME EXCEEDED %0.2f ms (LIMIT %d ms)",
2071
+ if (timeout && ((NETDATA_DOUBLE)dt_usec(&query_start_time, &query_current_time) / 1000.0) > (NETDATA_DOUBLE)timeout) {
2072
+ log_access("QUERY CANCELED RUNTIME EXCEEDED %0.2f ms (LIMIT %ld ms)",
2073
(NETDATA_DOUBLE)dt_usec(&query_start_time, &query_current_time) / 1000.0, timeout);
2074
r->result_options |= RRDR_RESULT_OPTION_CANCEL;
2075
break;
2129
if(unlikely(options & RRDR_OPTION_NONZERO && !dimensions_nonzero && !(r->result_options & RRDR_RESULT_OPTION_CANCEL))) {
2130
// all the dimensions are zero
2131
// mark them as NONZERO to send them all
2121
- for(rd = first_rd, c = 0 ; rd && c < dimensions_count ; rd = rd->next, c++) {
2132
+ for(size_t c = 0, max = qt->query.used; c < max ; c++) {
2133
if(unlikely(r->od[c] & RRDR_DIMENSION_HIDDEN)) continue;
2134
r->od[c] |= RRDR_DIMENSION_NONZERO;
2135
}