Imported Upstream version 1.0.0upstream/1.0.0

1 files changed, 799 insertions, 0 deletions

diff --git a/src/unit_test.c b/src/unit_test.c
new file mode 100755
index 000000000..47aa5396c
--- /dev/null
+++ b/src/unit_test.c
@@ -0,0 +1,799 @@
+#ifdef HAVE_CONFIG_H
+#include <config.h>
+#endif
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sys/resource.h>
+
+#include "common.h"
+#include "storage_number.h"
+#include "rrd.h"
+#include "log.h"
+#include "web_buffer.h"
+
+int check_storage_number(calculated_number n, int debug) {
+	char buffer[100];
+	uint32_t flags = SN_EXISTS;
+
+	storage_number s = pack_storage_number(n, flags);
+	calculated_number d = unpack_storage_number(s);
+
+	if(!does_storage_number_exist(s)) {
+		fprintf(stderr, "Exists flags missing for number " CALCULATED_NUMBER_FORMAT "!\n", n);
+		return 5;
+	}
+
+	calculated_number ddiff = d - n;
+	calculated_number dcdiff = ddiff * 100.0 / n;
+
+	if(dcdiff < 0) dcdiff = -dcdiff;
+
+	size_t len = print_calculated_number(buffer, d);
+	calculated_number p = strtold(buffer, NULL);
+	calculated_number pdiff = n - p;
+	calculated_number pcdiff = pdiff * 100.0 / n;
+	if(pcdiff < 0) pcdiff = -pcdiff;
+
+	if(debug) {
+		fprintf(stderr,
+			CALCULATED_NUMBER_FORMAT " original\n"
+			CALCULATED_NUMBER_FORMAT " packed and unpacked, (stored as 0x%08X, diff " CALCULATED_NUMBER_FORMAT ", " CALCULATED_NUMBER_FORMAT "%%)\n"
+			"%s printed after unpacked (%zu bytes)\n"
+			CALCULATED_NUMBER_FORMAT " re-parsed from printed (diff " CALCULATED_NUMBER_FORMAT ", " CALCULATED_NUMBER_FORMAT "%%)\n\n",
+			n,
+			d, s, ddiff, dcdiff,
+			buffer,
+			len, p, pdiff, pcdiff
+		);
+		if(len != strlen(buffer)) fprintf(stderr, "ERROR: printed number %s is reported to have length %zu but it has %zu\n", buffer, len, strlen(buffer));
+		if(dcdiff > ACCURACY_LOSS) fprintf(stderr, "WARNING: packing number " CALCULATED_NUMBER_FORMAT " has accuracy loss %0.7Lf %%\n", n, dcdiff);
+		if(pcdiff > ACCURACY_LOSS) fprintf(stderr, "WARNING: re-parsing the packed, unpacked and printed number " CALCULATED_NUMBER_FORMAT " has accuracy loss %0.7Lf %%\n", n, pcdiff);
+	}
+
+	if(len != strlen(buffer)) return 1;
+	if(dcdiff > ACCURACY_LOSS) return 3;
+	if(pcdiff > ACCURACY_LOSS) return 4;
+	return 0;
+}
+
+void benchmark_storage_number(int loop, int multiplier) {
+	int i, j;
+	calculated_number n, d;
+	storage_number s;
+	unsigned long long user, system, total, mine, their;
+
+	char buffer[100];
+
+	struct rusage now, last;
+
+	fprintf(stderr, "\n\nBenchmarking %d numbers, please wait...\n\n", loop);
+
+	// ------------------------------------------------------------------------
+
+	fprintf(stderr, "SYSTEM  LONG DOUBLE    SIZE: %zu bytes\n", sizeof(calculated_number));
+	fprintf(stderr, "NETDATA FLOATING POINT SIZE: %zu bytes\n", sizeof(storage_number));
+
+	mine = (calculated_number)sizeof(storage_number) * (calculated_number)loop;
+	their = (calculated_number)sizeof(calculated_number) * (calculated_number)loop;
+
+	if(mine > their) {
+		fprintf(stderr, "\nNETDATA NEEDS %0.2Lf TIMES MORE MEMORY. Sorry!\n", (long double)(mine / their));
+	}
+	else {
+		fprintf(stderr, "\nNETDATA INTERNAL FLOATING POINT ARITHMETICS NEEDS %0.2Lf TIMES LESS MEMORY.\n", (long double)(their / mine));
+	}
+
+	fprintf(stderr, "\nNETDATA FLOATING POINT\n");
+	fprintf(stderr, "MIN POSITIVE VALUE " CALCULATED_NUMBER_FORMAT "\n", (calculated_number)STORAGE_NUMBER_POSITIVE_MIN);
+	fprintf(stderr, "MAX POSITIVE VALUE " CALCULATED_NUMBER_FORMAT "\n", (calculated_number)STORAGE_NUMBER_POSITIVE_MAX);
+	fprintf(stderr, "MIN NEGATIVE VALUE " CALCULATED_NUMBER_FORMAT "\n", (calculated_number)STORAGE_NUMBER_NEGATIVE_MIN);
+	fprintf(stderr, "MAX NEGATIVE VALUE " CALCULATED_NUMBER_FORMAT "\n", (calculated_number)STORAGE_NUMBER_NEGATIVE_MAX);
+	fprintf(stderr, "Maximum accuracy loss: " CALCULATED_NUMBER_FORMAT "%%\n\n\n", (calculated_number)ACCURACY_LOSS);
+
+	// ------------------------------------------------------------------------
+
+	fprintf(stderr, "INTERNAL LONG DOUBLE PRINTING: ");
+	getrusage(RUSAGE_SELF, &last);
+
+	// do the job
+	for(j = 1; j < 11 ;j++) {
+		n = STORAGE_NUMBER_POSITIVE_MIN * j;
+
+		for(i = 0; i < loop ;i++) {
+			n *= multiplier;
+			if(n > STORAGE_NUMBER_POSITIVE_MAX) n = STORAGE_NUMBER_POSITIVE_MIN;
+
+			print_calculated_number(buffer, n);
+		}
+	}
+
+	getrusage(RUSAGE_SELF, &now);
+	user   = now.ru_utime.tv_sec * 1000000ULL + now.ru_utime.tv_usec - last.ru_utime.tv_sec * 1000000ULL + last.ru_utime.tv_usec;
+	system = now.ru_stime.tv_sec * 1000000ULL + now.ru_stime.tv_usec - last.ru_stime.tv_sec * 1000000ULL + last.ru_stime.tv_usec;
+	total  = user + system;
+	mine = total;
+
+	fprintf(stderr, "user %0.5Lf, system %0.5Lf, total %0.5Lf\n", (long double)(user / 1000000.0), (long double)(system / 1000000.0), (long double)(total / 1000000.0));
+
+	// ------------------------------------------------------------------------
+
+	fprintf(stderr, "SYSTEM   LONG DOUBLE PRINTING: ");
+	getrusage(RUSAGE_SELF, &last);
+
+	// do the job
+	for(j = 1; j < 11 ;j++) {
+		n = STORAGE_NUMBER_POSITIVE_MIN * j;
+
+		for(i = 0; i < loop ;i++) {
+			n *= multiplier;
+			if(n > STORAGE_NUMBER_POSITIVE_MAX) n = STORAGE_NUMBER_POSITIVE_MIN;
+			snprintf(buffer, 100, CALCULATED_NUMBER_FORMAT, n);
+		}
+	}
+
+	getrusage(RUSAGE_SELF, &now);
+	user   = now.ru_utime.tv_sec * 1000000ULL + now.ru_utime.tv_usec - last.ru_utime.tv_sec * 1000000ULL + last.ru_utime.tv_usec;
+	system = now.ru_stime.tv_sec * 1000000ULL + now.ru_stime.tv_usec - last.ru_stime.tv_sec * 1000000ULL + last.ru_stime.tv_usec;
+	total  = user + system;
+	their = total;
+
+	fprintf(stderr, "user %0.5Lf, system %0.5Lf, total %0.5Lf\n", (long double)(user / 1000000.0), (long double)(system / 1000000.0), (long double)(total / 1000000.0));
+
+	if(mine > total) {
+		fprintf(stderr, "NETDATA CODE IS SLOWER %0.2Lf %%\n", (long double)(mine * 100.0 / their - 100.0));
+	}
+	else {
+		fprintf(stderr, "NETDATA CODE IS  F A S T E R  %0.2Lf %%\n", (long double)(their * 100.0 / mine - 100.0));
+	}
+
+	// ------------------------------------------------------------------------
+
+	fprintf(stderr, "\nINTERNAL LONG DOUBLE PRINTING WITH PACK / UNPACK: ");
+	getrusage(RUSAGE_SELF, &last);
+
+	// do the job
+	for(j = 1; j < 11 ;j++) {
+		n = STORAGE_NUMBER_POSITIVE_MIN * j;
+
+		for(i = 0; i < loop ;i++) {
+			n *= multiplier;
+			if(n > STORAGE_NUMBER_POSITIVE_MAX) n = STORAGE_NUMBER_POSITIVE_MIN;
+
+			s = pack_storage_number(n, 1);
+			d = unpack_storage_number(s);
+			print_calculated_number(buffer, d);
+		}
+	}
+
+	getrusage(RUSAGE_SELF, &now);
+	user   = now.ru_utime.tv_sec * 1000000ULL + now.ru_utime.tv_usec - last.ru_utime.tv_sec * 1000000ULL + last.ru_utime.tv_usec;
+	system = now.ru_stime.tv_sec * 1000000ULL + now.ru_stime.tv_usec - last.ru_stime.tv_sec * 1000000ULL + last.ru_stime.tv_usec;
+	total  = user + system;
+	mine = total;
+
+	fprintf(stderr, "user %0.5Lf, system %0.5Lf, total %0.5Lf\n", (long double)(user / 1000000.0), (long double)(system / 1000000.0), (long double)(total / 1000000.0));
+
+	if(mine > their) {
+		fprintf(stderr, "WITH PACKING UNPACKING NETDATA CODE IS SLOWER %0.2Lf %%\n", (long double)(mine * 100.0 / their - 100.0));
+	}
+	else {
+		fprintf(stderr, "EVEN WITH PACKING AND UNPACKING, NETDATA CODE IS  F A S T E R  %0.2Lf %%\n", (long double)(their * 100.0 / mine - 100.0));
+	}
+
+	// ------------------------------------------------------------------------
+
+}
+
+static int check_storage_number_exists() {
+	uint32_t flags = SN_EXISTS;
+
+
+	for(flags = 0; flags < 7 ; flags++) {
+		if(get_storage_number_flags(flags << 24) != flags << 24) {
+			fprintf(stderr, "Flag 0x%08x is not checked correctly. It became 0x%08x\n", flags << 24, get_storage_number_flags(flags << 24));
+			return 1;
+		}
+	}
+
+	flags = SN_EXISTS;
+	calculated_number n = 0.0;
+
+	storage_number s = pack_storage_number(n, flags);
+	calculated_number d = unpack_storage_number(s);
+	if(get_storage_number_flags(s) != flags) {
+		fprintf(stderr, "Wrong flags. Given %08x, Got %08x!\n", flags, get_storage_number_flags(s));
+		return 1;
+	}
+	if(n != d) {
+		fprintf(stderr, "Wrong number returned. Expected " CALCULATED_NUMBER_FORMAT ", returned " CALCULATED_NUMBER_FORMAT "!\n", n, d);
+		return 1;
+	}
+
+	return 0;
+}
+
+int unit_test_storage()
+{
+	if(check_storage_number_exists()) return 0;
+
+	calculated_number c, a = 0;
+	int i, j, g, r = 0;
+
+	for(g = -1; g <= 1 ; g++) {
+		a = 0;
+
+		if(!g) continue;
+
+		for(j = 0; j < 9 ;j++) {
+			a += 0.0000001;
+			c = a * g;
+			for(i = 0; i < 21 ;i++, c *= 10) {
+				if(c > 0 && c < STORAGE_NUMBER_POSITIVE_MIN) continue;
+				if(c < 0 && c > STORAGE_NUMBER_NEGATIVE_MAX) continue;
+
+				if(check_storage_number(c, 1)) return 1;
+			}
+		}
+	}
+
+	benchmark_storage_number(1000000, 2);
+	return r;
+}
+
+
+// --------------------------------------------------------------------------------------------------------------------
+
+struct feed_values {
+		unsigned long long microseconds;
+		calculated_number value;
+};
+
+struct test {
+	char name[100];
+	char description[1024];
+
+	int update_every;
+	unsigned long long multiplier;
+	unsigned long long divisor;
+	int algorithm;
+
+	unsigned long feed_entries;
+	unsigned long result_entries;
+	struct feed_values *feed;
+	calculated_number *results;
+};
+
+// --------------------------------------------------------------------------------------------------------------------
+// test1
+// test absolute values stored
+
+struct feed_values test1_feed[] = {
+		{ 0, 10 },
+		{ 1000000, 20 },
+		{ 1000000, 30 },
+		{ 1000000, 40 },
+		{ 1000000, 50 },
+		{ 1000000, 60 },
+		{ 1000000, 70 },
+		{ 1000000, 80 },
+		{ 1000000, 90 },
+		{ 1000000, 100 },
+};
+
+calculated_number test1_results[] = {
+		20, 30, 40, 50, 60, 70, 80, 90, 100
+};
+
+struct test test1 = {
+		"test1",			// name
+		"test absolute values stored at exactly second boundaries",
+		1,					// update_every
+		1,					// multiplier
+		1,					// divisor
+		RRDDIM_ABSOLUTE,	// algorithm
+		10,					// feed entries
+		9,					// result entries
+		test1_feed,			// feed
+		test1_results		// results
+};
+
+// --------------------------------------------------------------------------------------------------------------------
+// test2
+// test absolute values stored in the middle of second boundaries
+
+struct feed_values test2_feed[] = {
+		{ 500000, 10 },
+		{ 1000000, 20 },
+		{ 1000000, 30 },
+		{ 1000000, 40 },
+		{ 1000000, 50 },
+		{ 1000000, 60 },
+		{ 1000000, 70 },
+		{ 1000000, 80 },
+		{ 1000000, 90 },
+		{ 1000000, 100 },
+};
+
+calculated_number test2_results[] = {
+		20, 30, 40, 50, 60, 70, 80, 90, 100
+};
+
+struct test test2 = {
+		"test2",			// name
+		"test absolute values stored in the middle of second boundaries",
+		1,					// update_every
+		1,					// multiplier
+		1,					// divisor
+		RRDDIM_ABSOLUTE,	// algorithm
+		10,					// feed entries
+		9,					// result entries
+		test2_feed,			// feed
+		test2_results		// results
+};
+
+// --------------------------------------------------------------------------------------------------------------------
+// test3
+
+struct feed_values test3_feed[] = {
+		{ 0, 10 },
+		{ 1000000, 20 },
+		{ 1000000, 30 },
+		{ 1000000, 40 },
+		{ 1000000, 50 },
+		{ 1000000, 60 },
+		{ 1000000, 70 },
+		{ 1000000, 80 },
+		{ 1000000, 90 },
+		{ 1000000, 100 },
+};
+
+calculated_number test3_results[] = {
+		10, 10, 10, 10, 10, 10, 10, 10, 10
+};
+
+struct test test3 = {
+		"test3",			// name
+		"test incremental values stored at exactly second boundaries",
+		1,					// update_every
+		1,					// multiplier
+		1,					// divisor
+		RRDDIM_INCREMENTAL,	// algorithm
+		10,					// feed entries
+		9,					// result entries
+		test3_feed,			// feed
+		test3_results		// results
+};
+
+// --------------------------------------------------------------------------------------------------------------------
+// test4
+
+struct feed_values test4_feed[] = {
+		{ 500000, 10 },
+		{ 1000000, 20 },
+		{ 1000000, 30 },
+		{ 1000000, 40 },
+		{ 1000000, 50 },
+		{ 1000000, 60 },
+		{ 1000000, 70 },
+		{ 1000000, 80 },
+		{ 1000000, 90 },
+		{ 1000000, 100 },
+};
+
+calculated_number test4_results[] = {
+		5, 10, 10, 10, 10, 10, 10, 10, 10
+};
+
+struct test test4 = {
+		"test4",			// name
+		"test incremental values stored in the middle of second boundaries",
+		1,					// update_every
+		1,					// multiplier
+		1,					// divisor
+		RRDDIM_INCREMENTAL,	// algorithm
+		10,					// feed entries
+		9,					// result entries
+		test4_feed,			// feed
+		test4_results		// results
+};
+
+// --------------------------------------------------------------------------------------------------------------------
+// test5
+
+struct feed_values test5_feed[] = {
+		{ 500000, 1000 },
+		{ 1000000, 2000 },
+		{ 1000000, 2000 },
+		{ 1000000, 2000 },
+		{ 1000000, 3000 },
+		{ 1000000, 2000 },
+		{ 1000000, 2000 },
+		{ 1000000, 2000 },
+		{ 1000000, 2000 },
+		{ 1000000, 2000 },
+};
+
+calculated_number test5_results[] = {
+		500, 500, 0, 500, 500, 0, 0, 0, 0
+};
+
+struct test test5 = {
+		"test5",			// name
+		"test incremental values ups and downs",
+		1,					// update_every
+		1,					// multiplier
+		1,					// divisor
+		RRDDIM_INCREMENTAL,	// algorithm
+		10,					// feed entries
+		9,					// result entries
+		test5_feed,			// feed
+		test5_results		// results
+};
+
+// --------------------------------------------------------------------------------------------------------------------
+// test6
+
+struct feed_values test6_feed[] = {
+		{ 250000, 1000 },
+		{ 250000, 2000 },
+		{ 250000, 3000 },
+		{ 250000, 4000 },
+		{ 250000, 5000 },
+		{ 250000, 6000 },
+		{ 250000, 7000 },
+		{ 250000, 8000 },
+		{ 250000, 9000 },
+		{ 250000, 10000 },
+		{ 250000, 11000 },
+		{ 250000, 12000 },
+		{ 250000, 13000 },
+		{ 250000, 14000 },
+		{ 250000, 15000 },
+		{ 250000, 16000 },
+};
+
+calculated_number test6_results[] = {
+		3000, 4000, 4000, 4000
+};
+
+struct test test6 = {
+		"test6",			// name
+		"test incremental values updated within the same second",
+		1,					// update_every
+		1,					// multiplier
+		1,					// divisor
+		RRDDIM_INCREMENTAL,	// algorithm
+		16,					// feed entries
+		4,					// result entries
+		test6_feed,			// feed
+		test6_results		// results
+};
+
+// --------------------------------------------------------------------------------------------------------------------
+// test7
+
+struct feed_values test7_feed[] = {
+		{ 500000, 1000 },
+		{ 2000000, 2000 },
+		{ 2000000, 3000 },
+		{ 2000000, 4000 },
+		{ 2000000, 5000 },
+		{ 2000000, 6000 },
+		{ 2000000, 7000 },
+		{ 2000000, 8000 },
+		{ 2000000, 9000 },
+		{ 2000000, 10000 },
+};
+
+calculated_number test7_results[] = {
+		250, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500
+};
+
+struct test test7 = {
+		"test7",			// name
+		"test incremental values updated in long durations",
+		1,					// update_every
+		1,					// multiplier
+		1,					// divisor
+		RRDDIM_INCREMENTAL,	// algorithm
+		10,					// feed entries
+		18,					// result entries
+		test7_feed,			// feed
+		test7_results		// results
+};
+
+// --------------------------------------------------------------------------------------------------------------------
+// test8
+
+struct feed_values test8_feed[] = {
+		{ 500000, 1000 },
+		{ 2000000, 2000 },
+		{ 2000000, 3000 },
+		{ 2000000, 4000 },
+		{ 2000000, 5000 },
+		{ 2000000, 6000 },
+};
+
+calculated_number test8_results[] = {
+		1250, 2000, 2250, 3000, 3250, 4000, 4250, 5000, 5250, 6000
+};
+
+struct test test8 = {
+		"test8",			// name
+		"test absolute values updated in long durations",
+		1,					// update_every
+		1,					// multiplier
+		1,					// divisor
+		RRDDIM_ABSOLUTE,	// algorithm
+		6,					// feed entries
+		10,					// result entries
+		test8_feed,			// feed
+		test8_results		// results
+};
+
+// --------------------------------------------------------------------------------------------------------------------
+// test9
+
+struct feed_values test9_feed[] = {
+		{ 250000, 1000 },
+		{ 250000, 2000 },
+		{ 250000, 3000 },
+		{ 250000, 4000 },
+		{ 250000, 5000 },
+		{ 250000, 6000 },
+		{ 250000, 7000 },
+		{ 250000, 8000 },
+		{ 250000, 9000 },
+		{ 250000, 10000 },
+		{ 250000, 11000 },
+		{ 250000, 12000 },
+		{ 250000, 13000 },
+		{ 250000, 14000 },
+		{ 250000, 15000 },
+		{ 250000, 16000 },
+};
+
+calculated_number test9_results[] = {
+		4000, 8000, 12000, 16000
+};
+
+struct test test9 = {
+		"test9",			// name
+		"test absolute values updated within the same second",
+		1,					// update_every
+		1,					// multiplier
+		1,					// divisor
+		RRDDIM_ABSOLUTE,	// algorithm
+		16,					// feed entries
+		4,					// result entries
+		test9_feed,			// feed
+		test9_results		// results
+};
+
+// --------------------------------------------------------------------------------------------------------------------
+// test10
+
+struct feed_values test10_feed[] = {
+		{ 500000,  1000 },
+		{ 600000,  1000 +  600 },
+		{ 200000,  1600 +  200 },
+		{ 1000000, 1800 + 1000 },
+		{ 200000,  2800 +  200 },
+		{ 2000000, 3000 + 2000 },
+		{ 600000,  5000 +  600 },
+		{ 400000,  5600 +  400 },
+		{ 900000,  6000 +  900 },
+		{ 1000000, 6900 + 1000 },
+};
+
+calculated_number test10_results[] = {
+		500, 1000, 1000, 1000, 1000, 1000, 1000
+};
+
+struct test test10 = {
+		"test10",			// name
+		"test incremental values updated in short and long durations",
+		1,					// update_every
+		1,					// multiplier
+		1,					// divisor
+		RRDDIM_INCREMENTAL,	// algorithm
+		10,					// feed entries
+		7,					// result entries
+		test10_feed,			// feed
+		test10_results		// results
+};
+
+// --------------------------------------------------------------------------------------------------------------------
+
+int run_test(struct test *test)
+{
+	fprintf(stderr, "\nRunning test '%s':\n%s\n", test->name, test->description);
+
+	rrd_memory_mode = RRD_MEMORY_MODE_RAM;
+	rrd_update_every = test->update_every;
+
+	char name[101];
+	snprintf(name, 100, "unittest-%s", test->name);
+
+	// create the chart
+	RRDSET *st = rrdset_create("netdata", name, name, "netdata", NULL, "Unit Testing", "a value", 1, 1, RRDSET_TYPE_LINE);
+	RRDDIM *rd = rrddim_add(st, "dimension", NULL, test->multiplier, test->divisor, test->algorithm);
+	st->debug = 1;
+
+	// feed it with the test data
+	unsigned long c;
+	for(c = 0; c < test->feed_entries; c++) {
+		if(debug_flags) fprintf(stderr, "\n\n");
+
+		if(c) {
+			fprintf(stderr, "    > %s: feeding position %lu, after %llu microseconds, with value " CALCULATED_NUMBER_FORMAT "\n", test->name, c+1, test->feed[c].microseconds, test->feed[c].value);
+			rrdset_next_usec(st, test->feed[c].microseconds);
+		}
+		else {
+			fprintf(stderr, "    > %s: feeding position %lu with value " CALCULATED_NUMBER_FORMAT "\n", test->name, c+1, test->feed[c].value);
+		}
+
+		rrddim_set(st, "dimension", test->feed[c].value);
+		rrdset_done(st);
+
+		// align the first entry to second boundary
+		if(!c) {
+			fprintf(stderr, "    > %s: fixing first collection time to be %llu microseconds to second boundary\n", test->name, test->feed[c].microseconds);
+			rd->last_collected_time.tv_usec = st->last_collected_time.tv_usec = st->last_updated.tv_usec = test->feed[c].microseconds;
+		}
+	}
+
+	// check the result
+	int errors = 0;
+
+	if(st->counter != test->result_entries) {
+		fprintf(stderr, "    %s stored %lu entries, but we were expecting %lu, ### E R R O R ###\n", test->name, st->counter, test->result_entries);
+		errors++;
+	}
+
+	unsigned long max = (st->counter < test->result_entries)?st->counter:test->result_entries;
+	for(c = 0 ; c < max ; c++) {
+		calculated_number v = unpack_storage_number(rd->values[c]), n = test->results[c];
+		fprintf(stderr, "    %s: checking position %lu, expecting value " CALCULATED_NUMBER_FORMAT ", found " CALCULATED_NUMBER_FORMAT ", %s\n", test->name, c+1, n, v, (v == n)?"OK":"### E R R O R ###");
+		if(v != n) errors++;
+	}
+
+	return errors;
+}
+
+int run_all_mockup_tests(void)
+{
+	if(run_test(&test1))
+		return 1;
+
+	if(run_test(&test2))
+		return 1;
+
+	if(run_test(&test3))
+		return 1;
+
+	if(run_test(&test4))
+		return 1;
+
+	if(run_test(&test5))
+		return 1;
+
+	if(run_test(&test6))
+		return 1;
+
+	if(run_test(&test7))
+		return 1;
+
+	if(run_test(&test8))
+		return 1;
+
+	if(run_test(&test9))
+		return 1;
+
+	if(run_test(&test10))
+		return 1;
+
+	return 0;
+}
+
+int unit_test(long delay, long shift)
+{
+	static int repeat = 0;
+	repeat++;
+
+	char name[101];
+	snprintf(name, 100, "unittest-%d-%ld-%ld", repeat, delay, shift);
+
+	//debug_flags = 0xffffffff;
+	rrd_memory_mode = RRD_MEMORY_MODE_RAM;
+	rrd_update_every = 1;
+
+	int do_abs = 1;
+	int do_inc = 1;
+	int do_abst = 0;
+	int do_absi = 0;
+
+	RRDSET *st = rrdset_create("netdata", name, name, "netdata", NULL, "Unit Testing", "a value", 1, 1, RRDSET_TYPE_LINE);
+	st->debug = 1;
+
+	RRDDIM *rdabs = NULL;
+	RRDDIM *rdinc = NULL;
+	RRDDIM *rdabst = NULL;
+	RRDDIM *rdabsi = NULL;
+
+	if(do_abs) rdabs = rrddim_add(st, "absolute", "absolute", 1, 1, RRDDIM_ABSOLUTE);
+	if(do_inc) rdinc = rrddim_add(st, "incremental", "incremental", 1, 1, RRDDIM_INCREMENTAL);
+	if(do_abst) rdabst = rrddim_add(st, "percentage-of-absolute-row", "percentage-of-absolute-row", 1, 1, RRDDIM_PCENT_OVER_ROW_TOTAL);
+	if(do_absi) rdabsi = rrddim_add(st, "percentage-of-incremental-row", "percentage-of-incremental-row", 1, 1, RRDDIM_PCENT_OVER_DIFF_TOTAL);
+
+	long increment = 1000;
+	collected_number i = 0;
+
+	unsigned long c, dimensions = 0;
+	RRDDIM *rd;
+	for(rd = st->dimensions ; rd ; rd = rd->next) dimensions++;
+
+	for(c = 0; c < 20 ;c++) {
+		i += increment;
+
+		fprintf(stderr, "\n\nLOOP = %lu, DELAY = %ld, VALUE = " COLLECTED_NUMBER_FORMAT "\n", c, delay, i);
+		if(c) {
+			rrdset_next_usec(st, delay);
+		}
+		if(do_abs) rrddim_set(st, "absolute", i);
+		if(do_inc) rrddim_set(st, "incremental", i);
+		if(do_abst) rrddim_set(st, "percentage-of-absolute-row", i);
+		if(do_absi) rrddim_set(st, "percentage-of-incremental-row", i);
+
+		if(!c) {
+			gettimeofday(&st->last_collected_time, NULL);
+			st->last_collected_time.tv_usec = shift;
+		}
+
+		// prevent it from deleting the dimensions
+		for(rd = st->dimensions ; rd ; rd = rd->next)
+			rd->last_collected_time.tv_sec = st->last_collected_time.tv_sec;
+
+		rrdset_done(st);
+	}
+
+	unsigned long oincrement = increment;
+	increment = increment * st->update_every * 1000000 / delay;
+	fprintf(stderr, "\n\nORIGINAL INCREMENT: %lu, INCREMENT %lu, DELAY %lu, SHIFT %lu\n", oincrement * 10, increment * 10, delay, shift);
+
+	int ret = 0;
+	storage_number sn;
+	calculated_number cn, v;
+	for(c = 0 ; c < st->counter ; c++) {
+		fprintf(stderr, "\nPOSITION: c = %lu, EXPECTED VALUE %lu\n", c, (oincrement + c * increment + increment * (1000000 - shift) / 1000000 )* 10);
+
+		for(rd = st->dimensions ; rd ; rd = rd->next) {
+			sn = rd->values[c];
+			cn = unpack_storage_number(sn);
+			fprintf(stderr, "\t %s " CALCULATED_NUMBER_FORMAT " (PACKED AS " STORAGE_NUMBER_FORMAT ")   ->   ", rd->id, cn, sn);
+
+			if(rd == rdabs) v =
+				(	  oincrement
+					// + (increment * (1000000 - shift) / 1000000)
+					+ (c + 1) * increment
+				);
+
+			else if(rd == rdinc) v = (c?(increment):(increment * (1000000 - shift) / 1000000));
+			else if(rd == rdabst) v = oincrement / dimensions / 10;
+			else if(rd == rdabsi) v = oincrement / dimensions / 10;
+			else v = 0;
+
+			if(v == cn) fprintf(stderr, "passed.\n");
+			else {
+				fprintf(stderr, "ERROR! (expected " CALCULATED_NUMBER_FORMAT ")\n", v);
+				ret = 1;
+			}
+		}
+	}
+
+	if(ret)
+		fprintf(stderr, "\n\nUNIT TEST(%ld, %ld) FAILED\n\n", delay, shift);
+
+	return ret;
+}