unit_test.c 94 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550
  1. // SPDX-License-Identifier: GPL-3.0-or-later
  2. #include "common.h"
  3. static int check_number_printing(void) {
  4. struct {
  5. NETDATA_DOUBLE n;
  6. const char *correct;
  7. } values[] = {
  8. { .n = 0, .correct = "0" },
  9. { .n = 0.0000001, .correct = "0.0000001" },
  10. { .n = 0.00000009, .correct = "0.0000001" },
  11. { .n = 0.000000001, .correct = "0" },
  12. { .n = 99.99999999999999999, .correct = "100" },
  13. { .n = -99.99999999999999999, .correct = "-100" },
  14. { .n = 123.4567890123456789, .correct = "123.456789" },
  15. { .n = 9999.9999999, .correct = "9999.9999999" },
  16. { .n = -9999.9999999, .correct = "-9999.9999999" },
  17. { .n = 0, .correct = NULL },
  18. };
  19. char netdata[50], system[50];
  20. int i, failed = 0;
  21. for(i = 0; values[i].correct ; i++) {
  22. print_netdata_double(netdata, values[i].n);
  23. snprintfz(system, 49, "%0.12" NETDATA_DOUBLE_MODIFIER, (NETDATA_DOUBLE)values[i].n);
  24. int ok = 1;
  25. if(strcmp(netdata, values[i].correct) != 0) {
  26. ok = 0;
  27. failed++;
  28. }
  29. fprintf(stderr, "'%s' (system) printed as '%s' (netdata): %s\n", system, netdata, ok?"OK":"FAILED");
  30. }
  31. if(failed) return 1;
  32. return 0;
  33. }
  34. static int check_rrdcalc_comparisons(void) {
  35. RRDCALC_STATUS a, b;
  36. // make sure calloc() sets the status to UNINITIALIZED
  37. memset(&a, 0, sizeof(RRDCALC_STATUS));
  38. if(a != RRDCALC_STATUS_UNINITIALIZED) {
  39. fprintf(stderr, "%s is not zero.\n", rrdcalc_status2string(RRDCALC_STATUS_UNINITIALIZED));
  40. return 1;
  41. }
  42. a = RRDCALC_STATUS_REMOVED;
  43. b = RRDCALC_STATUS_UNDEFINED;
  44. if(!(a < b)) {
  45. fprintf(stderr, "%s is not less than %s\n", rrdcalc_status2string(a), rrdcalc_status2string(b));
  46. return 1;
  47. }
  48. a = RRDCALC_STATUS_UNDEFINED;
  49. b = RRDCALC_STATUS_UNINITIALIZED;
  50. if(!(a < b)) {
  51. fprintf(stderr, "%s is not less than %s\n", rrdcalc_status2string(a), rrdcalc_status2string(b));
  52. return 1;
  53. }
  54. a = RRDCALC_STATUS_UNINITIALIZED;
  55. b = RRDCALC_STATUS_CLEAR;
  56. if(!(a < b)) {
  57. fprintf(stderr, "%s is not less than %s\n", rrdcalc_status2string(a), rrdcalc_status2string(b));
  58. return 1;
  59. }
  60. a = RRDCALC_STATUS_CLEAR;
  61. b = RRDCALC_STATUS_RAISED;
  62. if(!(a < b)) {
  63. fprintf(stderr, "%s is not less than %s\n", rrdcalc_status2string(a), rrdcalc_status2string(b));
  64. return 1;
  65. }
  66. a = RRDCALC_STATUS_RAISED;
  67. b = RRDCALC_STATUS_WARNING;
  68. if(!(a < b)) {
  69. fprintf(stderr, "%s is not less than %s\n", rrdcalc_status2string(a), rrdcalc_status2string(b));
  70. return 1;
  71. }
  72. a = RRDCALC_STATUS_WARNING;
  73. b = RRDCALC_STATUS_CRITICAL;
  74. if(!(a < b)) {
  75. fprintf(stderr, "%s is not less than %s\n", rrdcalc_status2string(a), rrdcalc_status2string(b));
  76. return 1;
  77. }
  78. fprintf(stderr, "RRDCALC_STATUSes are sortable.\n");
  79. return 0;
  80. }
  81. int check_storage_number(NETDATA_DOUBLE n, int debug) {
  82. char buffer[100];
  83. uint32_t flags = SN_DEFAULT_FLAGS;
  84. storage_number s = pack_storage_number(n, flags);
  85. NETDATA_DOUBLE d = unpack_storage_number(s);
  86. if(!does_storage_number_exist(s)) {
  87. fprintf(stderr, "Exists flags missing for number " NETDATA_DOUBLE_FORMAT "!\n", n);
  88. return 5;
  89. }
  90. NETDATA_DOUBLE ddiff = d - n;
  91. NETDATA_DOUBLE dcdiff = ddiff * 100.0 / n;
  92. if(dcdiff < 0) dcdiff = -dcdiff;
  93. size_t len = (size_t)print_netdata_double(buffer, d);
  94. NETDATA_DOUBLE p = str2ndd(buffer, NULL);
  95. NETDATA_DOUBLE pdiff = n - p;
  96. NETDATA_DOUBLE pcdiff = pdiff * 100.0 / n;
  97. if(pcdiff < 0) pcdiff = -pcdiff;
  98. if(debug) {
  99. fprintf(stderr,
  100. NETDATA_DOUBLE_FORMAT
  101. " original\n" NETDATA_DOUBLE_FORMAT " packed and unpacked, (stored as 0x%08X, diff " NETDATA_DOUBLE_FORMAT
  102. ", " NETDATA_DOUBLE_FORMAT "%%)\n"
  103. "%s printed after unpacked (%zu bytes)\n" NETDATA_DOUBLE_FORMAT
  104. " re-parsed from printed (diff " NETDATA_DOUBLE_FORMAT ", " NETDATA_DOUBLE_FORMAT "%%)\n\n",
  105. n,
  106. d, s, ddiff, dcdiff,
  107. buffer, len,
  108. p, pdiff, pcdiff
  109. );
  110. 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));
  111. if(dcdiff > ACCURACY_LOSS_ACCEPTED_PERCENT)
  112. fprintf(stderr, "WARNING: packing number " NETDATA_DOUBLE_FORMAT " has accuracy loss " NETDATA_DOUBLE_FORMAT " %%\n", n, dcdiff);
  113. if(pcdiff > ACCURACY_LOSS_ACCEPTED_PERCENT)
  114. fprintf(stderr, "WARNING: re-parsing the packed, unpacked and printed number " NETDATA_DOUBLE_FORMAT
  115. " has accuracy loss " NETDATA_DOUBLE_FORMAT " %%\n", n, pcdiff);
  116. }
  117. if(len != strlen(buffer)) return 1;
  118. if(dcdiff > ACCURACY_LOSS_ACCEPTED_PERCENT) return 3;
  119. if(pcdiff > ACCURACY_LOSS_ACCEPTED_PERCENT) return 4;
  120. return 0;
  121. }
  122. NETDATA_DOUBLE storage_number_min(NETDATA_DOUBLE n) {
  123. NETDATA_DOUBLE r = 1, last;
  124. do {
  125. last = n;
  126. n /= 2.0;
  127. storage_number t = pack_storage_number(n, SN_DEFAULT_FLAGS);
  128. r = unpack_storage_number(t);
  129. } while(r != 0.0 && r != last);
  130. return last;
  131. }
  132. void benchmark_storage_number(int loop, int multiplier) {
  133. int i, j;
  134. NETDATA_DOUBLE n, d;
  135. storage_number s;
  136. unsigned long long user, system, total, mine, their;
  137. NETDATA_DOUBLE storage_number_positive_min = unpack_storage_number(STORAGE_NUMBER_POSITIVE_MIN_RAW);
  138. NETDATA_DOUBLE storage_number_positive_max = unpack_storage_number(STORAGE_NUMBER_POSITIVE_MAX_RAW);
  139. char buffer[100];
  140. struct rusage now, last;
  141. fprintf(stderr, "\n\nBenchmarking %d numbers, please wait...\n\n", loop);
  142. // ------------------------------------------------------------------------
  143. fprintf(stderr, "SYSTEM LONG DOUBLE SIZE: %zu bytes\n", sizeof(NETDATA_DOUBLE));
  144. fprintf(stderr, "NETDATA FLOATING POINT SIZE: %zu bytes\n", sizeof(storage_number));
  145. mine = (NETDATA_DOUBLE)sizeof(storage_number) * (NETDATA_DOUBLE)loop;
  146. their = (NETDATA_DOUBLE)sizeof(NETDATA_DOUBLE) * (NETDATA_DOUBLE)loop;
  147. if(mine > their) {
  148. fprintf(stderr, "\nNETDATA NEEDS %0.2" NETDATA_DOUBLE_MODIFIER " TIMES MORE MEMORY. Sorry!\n", (NETDATA_DOUBLE)(mine / their));
  149. }
  150. else {
  151. fprintf(stderr, "\nNETDATA INTERNAL FLOATING POINT ARITHMETICS NEEDS %0.2" NETDATA_DOUBLE_MODIFIER " TIMES LESS MEMORY.\n", (NETDATA_DOUBLE)(their / mine));
  152. }
  153. fprintf(stderr, "\nNETDATA FLOATING POINT\n");
  154. fprintf(stderr, "MIN POSITIVE VALUE " NETDATA_DOUBLE_FORMAT "\n", unpack_storage_number(STORAGE_NUMBER_POSITIVE_MIN_RAW));
  155. fprintf(stderr, "MAX POSITIVE VALUE " NETDATA_DOUBLE_FORMAT "\n", unpack_storage_number(STORAGE_NUMBER_POSITIVE_MAX_RAW));
  156. fprintf(stderr, "MIN NEGATIVE VALUE " NETDATA_DOUBLE_FORMAT "\n", unpack_storage_number(STORAGE_NUMBER_NEGATIVE_MIN_RAW));
  157. fprintf(stderr, "MAX NEGATIVE VALUE " NETDATA_DOUBLE_FORMAT "\n", unpack_storage_number(STORAGE_NUMBER_NEGATIVE_MAX_RAW));
  158. fprintf(stderr, "Maximum accuracy loss accepted: " NETDATA_DOUBLE_FORMAT "%%\n\n\n", (NETDATA_DOUBLE)ACCURACY_LOSS_ACCEPTED_PERCENT);
  159. // ------------------------------------------------------------------------
  160. fprintf(stderr, "INTERNAL LONG DOUBLE PRINTING: ");
  161. getrusage(RUSAGE_SELF, &last);
  162. // do the job
  163. for(j = 1; j < 11 ;j++) {
  164. n = storage_number_positive_min * j;
  165. for(i = 0; i < loop ;i++) {
  166. n *= multiplier;
  167. if(n > storage_number_positive_max) n = storage_number_positive_min;
  168. print_netdata_double(buffer, n);
  169. }
  170. }
  171. getrusage(RUSAGE_SELF, &now);
  172. user = now.ru_utime.tv_sec * 1000000ULL + now.ru_utime.tv_usec - last.ru_utime.tv_sec * 1000000ULL + last.ru_utime.tv_usec;
  173. system = now.ru_stime.tv_sec * 1000000ULL + now.ru_stime.tv_usec - last.ru_stime.tv_sec * 1000000ULL + last.ru_stime.tv_usec;
  174. total = user + system;
  175. mine = total;
  176. fprintf(stderr, "user %0.5" NETDATA_DOUBLE_MODIFIER ", system %0.5" NETDATA_DOUBLE_MODIFIER
  177. ", total %0.5" NETDATA_DOUBLE_MODIFIER "\n", (NETDATA_DOUBLE)(user / 1000000.0), (NETDATA_DOUBLE)(system / 1000000.0), (NETDATA_DOUBLE)(total / 1000000.0));
  178. // ------------------------------------------------------------------------
  179. fprintf(stderr, "SYSTEM LONG DOUBLE PRINTING: ");
  180. getrusage(RUSAGE_SELF, &last);
  181. // do the job
  182. for(j = 1; j < 11 ;j++) {
  183. n = storage_number_positive_min * j;
  184. for(i = 0; i < loop ;i++) {
  185. n *= multiplier;
  186. if(n > storage_number_positive_max) n = storage_number_positive_min;
  187. snprintfz(buffer, 100, NETDATA_DOUBLE_FORMAT, n);
  188. }
  189. }
  190. getrusage(RUSAGE_SELF, &now);
  191. user = now.ru_utime.tv_sec * 1000000ULL + now.ru_utime.tv_usec - last.ru_utime.tv_sec * 1000000ULL + last.ru_utime.tv_usec;
  192. system = now.ru_stime.tv_sec * 1000000ULL + now.ru_stime.tv_usec - last.ru_stime.tv_sec * 1000000ULL + last.ru_stime.tv_usec;
  193. total = user + system;
  194. their = total;
  195. fprintf(stderr, "user %0.5" NETDATA_DOUBLE_MODIFIER ", system %0.5" NETDATA_DOUBLE_MODIFIER
  196. ", total %0.5" NETDATA_DOUBLE_MODIFIER "\n", (NETDATA_DOUBLE)(user / 1000000.0), (NETDATA_DOUBLE)(system / 1000000.0), (NETDATA_DOUBLE)(total / 1000000.0));
  197. if(mine > total) {
  198. fprintf(stderr, "NETDATA CODE IS SLOWER %0.2" NETDATA_DOUBLE_MODIFIER " %%\n", (NETDATA_DOUBLE)(mine * 100.0 / their - 100.0));
  199. }
  200. else {
  201. fprintf(stderr, "NETDATA CODE IS F A S T E R %0.2" NETDATA_DOUBLE_MODIFIER " %%\n", (NETDATA_DOUBLE)(their * 100.0 / mine - 100.0));
  202. }
  203. // ------------------------------------------------------------------------
  204. fprintf(stderr, "\nINTERNAL LONG DOUBLE PRINTING WITH PACK / UNPACK: ");
  205. getrusage(RUSAGE_SELF, &last);
  206. // do the job
  207. for(j = 1; j < 11 ;j++) {
  208. n = storage_number_positive_min * j;
  209. for(i = 0; i < loop ;i++) {
  210. n *= multiplier;
  211. if(n > storage_number_positive_max) n = storage_number_positive_min;
  212. s = pack_storage_number(n, SN_DEFAULT_FLAGS);
  213. d = unpack_storage_number(s);
  214. print_netdata_double(buffer, d);
  215. }
  216. }
  217. getrusage(RUSAGE_SELF, &now);
  218. user = now.ru_utime.tv_sec * 1000000ULL + now.ru_utime.tv_usec - last.ru_utime.tv_sec * 1000000ULL + last.ru_utime.tv_usec;
  219. system = now.ru_stime.tv_sec * 1000000ULL + now.ru_stime.tv_usec - last.ru_stime.tv_sec * 1000000ULL + last.ru_stime.tv_usec;
  220. total = user + system;
  221. mine = total;
  222. fprintf(stderr, "user %0.5" NETDATA_DOUBLE_MODIFIER ", system %0.5" NETDATA_DOUBLE_MODIFIER
  223. ", total %0.5" NETDATA_DOUBLE_MODIFIER "\n", (NETDATA_DOUBLE)(user / 1000000.0), (NETDATA_DOUBLE)(system / 1000000.0), (NETDATA_DOUBLE)(total / 1000000.0));
  224. if(mine > their) {
  225. fprintf(stderr, "WITH PACKING UNPACKING NETDATA CODE IS SLOWER %0.2" NETDATA_DOUBLE_MODIFIER " %%\n", (NETDATA_DOUBLE)(mine * 100.0 / their - 100.0));
  226. }
  227. else {
  228. fprintf(stderr, "EVEN WITH PACKING AND UNPACKING, NETDATA CODE IS F A S T E R %0.2" NETDATA_DOUBLE_MODIFIER " %%\n", (NETDATA_DOUBLE)(their * 100.0 / mine - 100.0));
  229. }
  230. // ------------------------------------------------------------------------
  231. }
  232. static int check_storage_number_exists() {
  233. uint32_t flags = SN_DEFAULT_FLAGS;
  234. NETDATA_DOUBLE n = 0.0;
  235. storage_number s = pack_storage_number(n, flags);
  236. NETDATA_DOUBLE d = unpack_storage_number(s);
  237. if(n != d) {
  238. fprintf(stderr, "Wrong number returned. Expected " NETDATA_DOUBLE_FORMAT ", returned " NETDATA_DOUBLE_FORMAT "!\n", n, d);
  239. return 1;
  240. }
  241. return 0;
  242. }
  243. int unit_test_storage() {
  244. if(check_storage_number_exists()) return 0;
  245. NETDATA_DOUBLE storage_number_positive_min = unpack_storage_number(STORAGE_NUMBER_POSITIVE_MIN_RAW);
  246. NETDATA_DOUBLE storage_number_negative_max = unpack_storage_number(STORAGE_NUMBER_NEGATIVE_MAX_RAW);
  247. NETDATA_DOUBLE c, a = 0;
  248. int i, j, g, r = 0;
  249. for(g = -1; g <= 1 ; g++) {
  250. a = 0;
  251. if(!g) continue;
  252. for(j = 0; j < 9 ;j++) {
  253. a += 0.0000001;
  254. c = a * g;
  255. for(i = 0; i < 21 ;i++, c *= 10) {
  256. if(c > 0 && c < storage_number_positive_min) continue;
  257. if(c < 0 && c > storage_number_negative_max) continue;
  258. if(check_storage_number(c, 1)) return 1;
  259. }
  260. }
  261. }
  262. // if(check_storage_number(858993459.1234567, 1)) return 1;
  263. benchmark_storage_number(1000000, 2);
  264. return r;
  265. }
  266. int unit_test_str2ld() {
  267. char *values[] = {
  268. "1.2345678", "-35.6", "0.00123", "23842384234234.2", ".1", "1.2e-10",
  269. "hello", "1wrong", "nan", "inf", NULL
  270. };
  271. int i;
  272. for(i = 0; values[i] ; i++) {
  273. char *e_mine = "hello", *e_sys = "world";
  274. NETDATA_DOUBLE mine = str2ndd(values[i], &e_mine);
  275. NETDATA_DOUBLE sys = strtondd(values[i], &e_sys);
  276. if(isnan(mine)) {
  277. if(!isnan(sys)) {
  278. fprintf(stderr, "Value '%s' is parsed as %" NETDATA_DOUBLE_MODIFIER
  279. ", but system believes it is %" NETDATA_DOUBLE_MODIFIER ".\n", values[i], mine, sys);
  280. return -1;
  281. }
  282. }
  283. else if(isinf(mine)) {
  284. if(!isinf(sys)) {
  285. fprintf(stderr, "Value '%s' is parsed as %" NETDATA_DOUBLE_MODIFIER
  286. ", but system believes it is %" NETDATA_DOUBLE_MODIFIER ".\n", values[i], mine, sys);
  287. return -1;
  288. }
  289. }
  290. else if(mine != sys && ABS(mine-sys) > 0.000001) {
  291. fprintf(stderr, "Value '%s' is parsed as %" NETDATA_DOUBLE_MODIFIER
  292. ", but system believes it is %" NETDATA_DOUBLE_MODIFIER ", delta %" NETDATA_DOUBLE_MODIFIER ".\n", values[i], mine, sys, sys-mine);
  293. return -1;
  294. }
  295. if(e_mine != e_sys) {
  296. fprintf(stderr, "Value '%s' is parsed correctly, but endptr is not right\n", values[i]);
  297. return -1;
  298. }
  299. fprintf(stderr, "str2ndd() parsed value '%s' exactly the same way with strtold(), returned %" NETDATA_DOUBLE_MODIFIER
  300. " vs %" NETDATA_DOUBLE_MODIFIER "\n", values[i], mine, sys);
  301. }
  302. return 0;
  303. }
  304. int unit_test_buffer() {
  305. BUFFER *wb = buffer_create(1);
  306. char string[2048 + 1];
  307. char final[9000 + 1];
  308. int i;
  309. for(i = 0; i < 2048; i++)
  310. string[i] = (char)((i % 24) + 'a');
  311. string[2048] = '\0';
  312. const char *fmt = "string1: %s\nstring2: %s\nstring3: %s\nstring4: %s";
  313. buffer_sprintf(wb, fmt, string, string, string, string);
  314. snprintfz(final, 9000, fmt, string, string, string, string);
  315. const char *s = buffer_tostring(wb);
  316. if(buffer_strlen(wb) != strlen(final) || strcmp(s, final) != 0) {
  317. fprintf(stderr, "\nbuffer_sprintf() is faulty.\n");
  318. fprintf(stderr, "\nstring : %s (length %zu)\n", string, strlen(string));
  319. fprintf(stderr, "\nbuffer : %s (length %zu)\n", s, buffer_strlen(wb));
  320. fprintf(stderr, "\nexpected: %s (length %zu)\n", final, strlen(final));
  321. buffer_free(wb);
  322. return -1;
  323. }
  324. fprintf(stderr, "buffer_sprintf() works as expected.\n");
  325. buffer_free(wb);
  326. return 0;
  327. }
  328. int unit_test_static_threads() {
  329. struct netdata_static_thread *static_threads = static_threads_get();
  330. /*
  331. * make sure enough static threads have been registered
  332. */
  333. if (!static_threads) {
  334. fprintf(stderr, "empty static_threads array\n");
  335. return 1;
  336. }
  337. int n;
  338. for (n = 0; static_threads[n].start_routine != NULL; n++) {}
  339. if (n < 2) {
  340. fprintf(stderr, "only %d static threads registered", n);
  341. freez(static_threads);
  342. return 1;
  343. }
  344. /*
  345. * verify that each thread's start routine is unique.
  346. */
  347. for (int i = 0; i != n - 1; i++) {
  348. for (int j = i + 1; j != n; j++) {
  349. if (static_threads[i].start_routine != static_threads[j].start_routine)
  350. continue;
  351. fprintf(stderr, "Found duplicate threads with name: %s\n", static_threads[i].name);
  352. freez(static_threads);
  353. return 1;
  354. }
  355. }
  356. freez(static_threads);
  357. return 0;
  358. }
  359. // --------------------------------------------------------------------------------------------------------------------
  360. struct feed_values {
  361. unsigned long long microseconds;
  362. collected_number value;
  363. };
  364. struct test {
  365. char name[100];
  366. char description[1024];
  367. int update_every;
  368. unsigned long long multiplier;
  369. unsigned long long divisor;
  370. RRD_ALGORITHM algorithm;
  371. unsigned long feed_entries;
  372. unsigned long result_entries;
  373. struct feed_values *feed;
  374. NETDATA_DOUBLE *results;
  375. collected_number *feed2;
  376. NETDATA_DOUBLE *results2;
  377. };
  378. // --------------------------------------------------------------------------------------------------------------------
  379. // test1
  380. // test absolute values stored
  381. struct feed_values test1_feed[] = {
  382. { 0, 10 },
  383. { 1000000, 20 },
  384. { 1000000, 30 },
  385. { 1000000, 40 },
  386. { 1000000, 50 },
  387. { 1000000, 60 },
  388. { 1000000, 70 },
  389. { 1000000, 80 },
  390. { 1000000, 90 },
  391. { 1000000, 100 },
  392. };
  393. NETDATA_DOUBLE test1_results[] = {
  394. 20, 30, 40, 50, 60, 70, 80, 90, 100
  395. };
  396. struct test test1 = {
  397. "test1", // name
  398. "test absolute values stored at exactly second boundaries",
  399. 1, // update_every
  400. 1, // multiplier
  401. 1, // divisor
  402. RRD_ALGORITHM_ABSOLUTE, // algorithm
  403. 10, // feed entries
  404. 9, // result entries
  405. test1_feed, // feed
  406. test1_results, // results
  407. NULL, // feed2
  408. NULL // results2
  409. };
  410. // --------------------------------------------------------------------------------------------------------------------
  411. // test2
  412. // test absolute values stored in the middle of second boundaries
  413. struct feed_values test2_feed[] = {
  414. { 500000, 10 },
  415. { 1000000, 20 },
  416. { 1000000, 30 },
  417. { 1000000, 40 },
  418. { 1000000, 50 },
  419. { 1000000, 60 },
  420. { 1000000, 70 },
  421. { 1000000, 80 },
  422. { 1000000, 90 },
  423. { 1000000, 100 },
  424. };
  425. NETDATA_DOUBLE test2_results[] = {
  426. 20, 30, 40, 50, 60, 70, 80, 90, 100
  427. };
  428. struct test test2 = {
  429. "test2", // name
  430. "test absolute values stored in the middle of second boundaries",
  431. 1, // update_every
  432. 1, // multiplier
  433. 1, // divisor
  434. RRD_ALGORITHM_ABSOLUTE, // algorithm
  435. 10, // feed entries
  436. 9, // result entries
  437. test2_feed, // feed
  438. test2_results, // results
  439. NULL, // feed2
  440. NULL // results2
  441. };
  442. // --------------------------------------------------------------------------------------------------------------------
  443. // test3
  444. struct feed_values test3_feed[] = {
  445. { 0, 10 },
  446. { 1000000, 20 },
  447. { 1000000, 30 },
  448. { 1000000, 40 },
  449. { 1000000, 50 },
  450. { 1000000, 60 },
  451. { 1000000, 70 },
  452. { 1000000, 80 },
  453. { 1000000, 90 },
  454. { 1000000, 100 },
  455. };
  456. NETDATA_DOUBLE test3_results[] = {
  457. 10, 10, 10, 10, 10, 10, 10, 10, 10
  458. };
  459. struct test test3 = {
  460. "test3", // name
  461. "test incremental values stored at exactly second boundaries",
  462. 1, // update_every
  463. 1, // multiplier
  464. 1, // divisor
  465. RRD_ALGORITHM_INCREMENTAL, // algorithm
  466. 10, // feed entries
  467. 9, // result entries
  468. test3_feed, // feed
  469. test3_results, // results
  470. NULL, // feed2
  471. NULL // results2
  472. };
  473. // --------------------------------------------------------------------------------------------------------------------
  474. // test4
  475. struct feed_values test4_feed[] = {
  476. { 500000, 10 },
  477. { 1000000, 20 },
  478. { 1000000, 30 },
  479. { 1000000, 40 },
  480. { 1000000, 50 },
  481. { 1000000, 60 },
  482. { 1000000, 70 },
  483. { 1000000, 80 },
  484. { 1000000, 90 },
  485. { 1000000, 100 },
  486. };
  487. NETDATA_DOUBLE test4_results[] = {
  488. 10, 10, 10, 10, 10, 10, 10, 10, 10
  489. };
  490. struct test test4 = {
  491. "test4", // name
  492. "test incremental values stored in the middle of second boundaries",
  493. 1, // update_every
  494. 1, // multiplier
  495. 1, // divisor
  496. RRD_ALGORITHM_INCREMENTAL, // algorithm
  497. 10, // feed entries
  498. 9, // result entries
  499. test4_feed, // feed
  500. test4_results, // results
  501. NULL, // feed2
  502. NULL // results2
  503. };
  504. // --------------------------------------------------------------------------------------------------------------------
  505. // test5 - 32 bit overflows
  506. struct feed_values test5_feed[] = {
  507. { 0, 0x00000000FFFFFFFFULL / 15 * 0 },
  508. { 1000000, 0x00000000FFFFFFFFULL / 15 * 7 },
  509. { 1000000, 0x00000000FFFFFFFFULL / 15 * 14 },
  510. { 1000000, 0x00000000FFFFFFFFULL / 15 * 0 },
  511. { 1000000, 0x00000000FFFFFFFFULL / 15 * 7 },
  512. { 1000000, 0x00000000FFFFFFFFULL / 15 * 14 },
  513. { 1000000, 0x00000000FFFFFFFFULL / 15 * 0 },
  514. { 1000000, 0x00000000FFFFFFFFULL / 15 * 7 },
  515. { 1000000, 0x00000000FFFFFFFFULL / 15 * 14 },
  516. { 1000000, 0x00000000FFFFFFFFULL / 15 * 0 },
  517. };
  518. NETDATA_DOUBLE test5_results[] = {
  519. 0x00000000FFFFFFFFULL / 15 * 7,
  520. 0x00000000FFFFFFFFULL / 15 * 7,
  521. 0x00000000FFFFFFFFULL / 15,
  522. 0x00000000FFFFFFFFULL / 15 * 7,
  523. 0x00000000FFFFFFFFULL / 15 * 7,
  524. 0x00000000FFFFFFFFULL / 15,
  525. 0x00000000FFFFFFFFULL / 15 * 7,
  526. 0x00000000FFFFFFFFULL / 15 * 7,
  527. 0x00000000FFFFFFFFULL / 15,
  528. };
  529. struct test test5 = {
  530. "test5", // name
  531. "test 32-bit incremental values overflow",
  532. 1, // update_every
  533. 1, // multiplier
  534. 1, // divisor
  535. RRD_ALGORITHM_INCREMENTAL, // algorithm
  536. 10, // feed entries
  537. 9, // result entries
  538. test5_feed, // feed
  539. test5_results, // results
  540. NULL, // feed2
  541. NULL // results2
  542. };
  543. // --------------------------------------------------------------------------------------------------------------------
  544. // test5b - 64 bit overflows
  545. struct feed_values test5b_feed[] = {
  546. { 0, 0xFFFFFFFFFFFFFFFFULL / 15 * 0 },
  547. { 1000000, 0xFFFFFFFFFFFFFFFFULL / 15 * 7 },
  548. { 1000000, 0xFFFFFFFFFFFFFFFFULL / 15 * 14 },
  549. { 1000000, 0xFFFFFFFFFFFFFFFFULL / 15 * 0 },
  550. { 1000000, 0xFFFFFFFFFFFFFFFFULL / 15 * 7 },
  551. { 1000000, 0xFFFFFFFFFFFFFFFFULL / 15 * 14 },
  552. { 1000000, 0xFFFFFFFFFFFFFFFFULL / 15 * 0 },
  553. { 1000000, 0xFFFFFFFFFFFFFFFFULL / 15 * 7 },
  554. { 1000000, 0xFFFFFFFFFFFFFFFFULL / 15 * 14 },
  555. { 1000000, 0xFFFFFFFFFFFFFFFFULL / 15 * 0 },
  556. };
  557. NETDATA_DOUBLE test5b_results[] = {
  558. 0xFFFFFFFFFFFFFFFFULL / 15 * 7,
  559. 0xFFFFFFFFFFFFFFFFULL / 15 * 7,
  560. 0xFFFFFFFFFFFFFFFFULL / 15,
  561. 0xFFFFFFFFFFFFFFFFULL / 15 * 7,
  562. 0xFFFFFFFFFFFFFFFFULL / 15 * 7,
  563. 0xFFFFFFFFFFFFFFFFULL / 15,
  564. 0xFFFFFFFFFFFFFFFFULL / 15 * 7,
  565. 0xFFFFFFFFFFFFFFFFULL / 15 * 7,
  566. 0xFFFFFFFFFFFFFFFFULL / 15,
  567. };
  568. struct test test5b = {
  569. "test5b", // name
  570. "test 64-bit incremental values overflow",
  571. 1, // update_every
  572. 1, // multiplier
  573. 1, // divisor
  574. RRD_ALGORITHM_INCREMENTAL, // algorithm
  575. 10, // feed entries
  576. 9, // result entries
  577. test5b_feed, // feed
  578. test5b_results, // results
  579. NULL, // feed2
  580. NULL // results2
  581. };
  582. // --------------------------------------------------------------------------------------------------------------------
  583. // test6
  584. struct feed_values test6_feed[] = {
  585. { 250000, 1000 },
  586. { 250000, 2000 },
  587. { 250000, 3000 },
  588. { 250000, 4000 },
  589. { 250000, 5000 },
  590. { 250000, 6000 },
  591. { 250000, 7000 },
  592. { 250000, 8000 },
  593. { 250000, 9000 },
  594. { 250000, 10000 },
  595. { 250000, 11000 },
  596. { 250000, 12000 },
  597. { 250000, 13000 },
  598. { 250000, 14000 },
  599. { 250000, 15000 },
  600. { 250000, 16000 },
  601. };
  602. NETDATA_DOUBLE test6_results[] = {
  603. 4000, 4000, 4000, 4000
  604. };
  605. struct test test6 = {
  606. "test6", // name
  607. "test incremental values updated within the same second",
  608. 1, // update_every
  609. 1, // multiplier
  610. 1, // divisor
  611. RRD_ALGORITHM_INCREMENTAL, // algorithm
  612. 16, // feed entries
  613. 4, // result entries
  614. test6_feed, // feed
  615. test6_results, // results
  616. NULL, // feed2
  617. NULL // results2
  618. };
  619. // --------------------------------------------------------------------------------------------------------------------
  620. // test7
  621. struct feed_values test7_feed[] = {
  622. { 500000, 1000 },
  623. { 2000000, 2000 },
  624. { 2000000, 3000 },
  625. { 2000000, 4000 },
  626. { 2000000, 5000 },
  627. { 2000000, 6000 },
  628. { 2000000, 7000 },
  629. { 2000000, 8000 },
  630. { 2000000, 9000 },
  631. { 2000000, 10000 },
  632. };
  633. NETDATA_DOUBLE test7_results[] = {
  634. 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500
  635. };
  636. struct test test7 = {
  637. "test7", // name
  638. "test incremental values updated in long durations",
  639. 1, // update_every
  640. 1, // multiplier
  641. 1, // divisor
  642. RRD_ALGORITHM_INCREMENTAL, // algorithm
  643. 10, // feed entries
  644. 18, // result entries
  645. test7_feed, // feed
  646. test7_results, // results
  647. NULL, // feed2
  648. NULL // results2
  649. };
  650. // --------------------------------------------------------------------------------------------------------------------
  651. // test8
  652. struct feed_values test8_feed[] = {
  653. { 500000, 1000 },
  654. { 2000000, 2000 },
  655. { 2000000, 3000 },
  656. { 2000000, 4000 },
  657. { 2000000, 5000 },
  658. { 2000000, 6000 },
  659. };
  660. NETDATA_DOUBLE test8_results[] = {
  661. 1250, 2000, 2250, 3000, 3250, 4000, 4250, 5000, 5250, 6000
  662. };
  663. struct test test8 = {
  664. "test8", // name
  665. "test absolute values updated in long durations",
  666. 1, // update_every
  667. 1, // multiplier
  668. 1, // divisor
  669. RRD_ALGORITHM_ABSOLUTE, // algorithm
  670. 6, // feed entries
  671. 10, // result entries
  672. test8_feed, // feed
  673. test8_results, // results
  674. NULL, // feed2
  675. NULL // results2
  676. };
  677. // --------------------------------------------------------------------------------------------------------------------
  678. // test9
  679. struct feed_values test9_feed[] = {
  680. { 250000, 1000 },
  681. { 250000, 2000 },
  682. { 250000, 3000 },
  683. { 250000, 4000 },
  684. { 250000, 5000 },
  685. { 250000, 6000 },
  686. { 250000, 7000 },
  687. { 250000, 8000 },
  688. { 250000, 9000 },
  689. { 250000, 10000 },
  690. { 250000, 11000 },
  691. { 250000, 12000 },
  692. { 250000, 13000 },
  693. { 250000, 14000 },
  694. { 250000, 15000 },
  695. { 250000, 16000 },
  696. };
  697. NETDATA_DOUBLE test9_results[] = {
  698. 4000, 8000, 12000, 16000
  699. };
  700. struct test test9 = {
  701. "test9", // name
  702. "test absolute values updated within the same second",
  703. 1, // update_every
  704. 1, // multiplier
  705. 1, // divisor
  706. RRD_ALGORITHM_ABSOLUTE, // algorithm
  707. 16, // feed entries
  708. 4, // result entries
  709. test9_feed, // feed
  710. test9_results, // results
  711. NULL, // feed2
  712. NULL // results2
  713. };
  714. // --------------------------------------------------------------------------------------------------------------------
  715. // test10
  716. struct feed_values test10_feed[] = {
  717. { 500000, 1000 },
  718. { 600000, 1000 + 600 },
  719. { 200000, 1600 + 200 },
  720. { 1000000, 1800 + 1000 },
  721. { 200000, 2800 + 200 },
  722. { 2000000, 3000 + 2000 },
  723. { 600000, 5000 + 600 },
  724. { 400000, 5600 + 400 },
  725. { 900000, 6000 + 900 },
  726. { 1000000, 6900 + 1000 },
  727. };
  728. NETDATA_DOUBLE test10_results[] = {
  729. 1000, 1000, 1000, 1000, 1000, 1000, 1000
  730. };
  731. struct test test10 = {
  732. "test10", // name
  733. "test incremental values updated in short and long durations",
  734. 1, // update_every
  735. 1, // multiplier
  736. 1, // divisor
  737. RRD_ALGORITHM_INCREMENTAL, // algorithm
  738. 10, // feed entries
  739. 7, // result entries
  740. test10_feed, // feed
  741. test10_results, // results
  742. NULL, // feed2
  743. NULL // results2
  744. };
  745. // --------------------------------------------------------------------------------------------------------------------
  746. // test11
  747. struct feed_values test11_feed[] = {
  748. { 0, 10 },
  749. { 1000000, 20 },
  750. { 1000000, 30 },
  751. { 1000000, 40 },
  752. { 1000000, 50 },
  753. { 1000000, 60 },
  754. { 1000000, 70 },
  755. { 1000000, 80 },
  756. { 1000000, 90 },
  757. { 1000000, 100 },
  758. };
  759. collected_number test11_feed2[] = {
  760. 10, 20, 30, 40, 50, 60, 70, 80, 90, 100
  761. };
  762. NETDATA_DOUBLE test11_results[] = {
  763. 50, 50, 50, 50, 50, 50, 50, 50, 50
  764. };
  765. NETDATA_DOUBLE test11_results2[] = {
  766. 50, 50, 50, 50, 50, 50, 50, 50, 50
  767. };
  768. struct test test11 = {
  769. "test11", // name
  770. "test percentage-of-incremental-row with equal values",
  771. 1, // update_every
  772. 1, // multiplier
  773. 1, // divisor
  774. RRD_ALGORITHM_PCENT_OVER_DIFF_TOTAL, // algorithm
  775. 10, // feed entries
  776. 9, // result entries
  777. test11_feed, // feed
  778. test11_results, // results
  779. test11_feed2, // feed2
  780. test11_results2 // results2
  781. };
  782. // --------------------------------------------------------------------------------------------------------------------
  783. // test12
  784. struct feed_values test12_feed[] = {
  785. { 0, 10 },
  786. { 1000000, 20 },
  787. { 1000000, 30 },
  788. { 1000000, 40 },
  789. { 1000000, 50 },
  790. { 1000000, 60 },
  791. { 1000000, 70 },
  792. { 1000000, 80 },
  793. { 1000000, 90 },
  794. { 1000000, 100 },
  795. };
  796. collected_number test12_feed2[] = {
  797. 10*3, 20*3, 30*3, 40*3, 50*3, 60*3, 70*3, 80*3, 90*3, 100*3
  798. };
  799. NETDATA_DOUBLE test12_results[] = {
  800. 25, 25, 25, 25, 25, 25, 25, 25, 25
  801. };
  802. NETDATA_DOUBLE test12_results2[] = {
  803. 75, 75, 75, 75, 75, 75, 75, 75, 75
  804. };
  805. struct test test12 = {
  806. "test12", // name
  807. "test percentage-of-incremental-row with equal values",
  808. 1, // update_every
  809. 1, // multiplier
  810. 1, // divisor
  811. RRD_ALGORITHM_PCENT_OVER_DIFF_TOTAL, // algorithm
  812. 10, // feed entries
  813. 9, // result entries
  814. test12_feed, // feed
  815. test12_results, // results
  816. test12_feed2, // feed2
  817. test12_results2 // results2
  818. };
  819. // --------------------------------------------------------------------------------------------------------------------
  820. // test13
  821. struct feed_values test13_feed[] = {
  822. { 500000, 1000 },
  823. { 600000, 1000 + 600 },
  824. { 200000, 1600 + 200 },
  825. { 1000000, 1800 + 1000 },
  826. { 200000, 2800 + 200 },
  827. { 2000000, 3000 + 2000 },
  828. { 600000, 5000 + 600 },
  829. { 400000, 5600 + 400 },
  830. { 900000, 6000 + 900 },
  831. { 1000000, 6900 + 1000 },
  832. };
  833. NETDATA_DOUBLE test13_results[] = {
  834. 83.3333300, 100, 100, 100, 100, 100, 100
  835. };
  836. struct test test13 = {
  837. "test13", // name
  838. "test incremental values updated in short and long durations",
  839. 1, // update_every
  840. 1, // multiplier
  841. 1, // divisor
  842. RRD_ALGORITHM_PCENT_OVER_DIFF_TOTAL, // algorithm
  843. 10, // feed entries
  844. 7, // result entries
  845. test13_feed, // feed
  846. test13_results, // results
  847. NULL, // feed2
  848. NULL // results2
  849. };
  850. // --------------------------------------------------------------------------------------------------------------------
  851. // test14
  852. struct feed_values test14_feed[] = {
  853. { 0, 0x015397dc42151c41ULL },
  854. { 13573000, 0x015397e612e3ff5dULL },
  855. { 29969000, 0x015397f905ecdaa8ULL },
  856. { 29958000, 0x0153980c2a6cb5e4ULL },
  857. { 30054000, 0x0153981f4032fb83ULL },
  858. { 34952000, 0x015398355efadaccULL },
  859. { 25046000, 0x01539845ba4b09f8ULL },
  860. { 29947000, 0x0153985948bf381dULL },
  861. { 30054000, 0x0153986c5b9c27e2ULL },
  862. { 29942000, 0x0153987f888982d0ULL },
  863. };
  864. NETDATA_DOUBLE test14_results[] = {
  865. 23.1383300, 21.8515600, 21.8804600, 21.7788000, 22.0112200, 22.4386100, 22.0906100, 21.9150800
  866. };
  867. struct test test14 = {
  868. "test14", // name
  869. "issue #981 with real data",
  870. 30, // update_every
  871. 8, // multiplier
  872. 1000000000, // divisor
  873. RRD_ALGORITHM_INCREMENTAL, // algorithm
  874. 10, // feed entries
  875. 8, // result entries
  876. test14_feed, // feed
  877. test14_results, // results
  878. NULL, // feed2
  879. NULL // results2
  880. };
  881. struct feed_values test14b_feed[] = {
  882. { 0, 0 },
  883. { 13573000, 13573000 },
  884. { 29969000, 13573000 + 29969000 },
  885. { 29958000, 13573000 + 29969000 + 29958000 },
  886. { 30054000, 13573000 + 29969000 + 29958000 + 30054000 },
  887. { 34952000, 13573000 + 29969000 + 29958000 + 30054000 + 34952000 },
  888. { 25046000, 13573000 + 29969000 + 29958000 + 30054000 + 34952000 + 25046000 },
  889. { 29947000, 13573000 + 29969000 + 29958000 + 30054000 + 34952000 + 25046000 + 29947000 },
  890. { 30054000, 13573000 + 29969000 + 29958000 + 30054000 + 34952000 + 25046000 + 29947000 + 30054000 },
  891. { 29942000, 13573000 + 29969000 + 29958000 + 30054000 + 34952000 + 25046000 + 29947000 + 30054000 + 29942000 },
  892. };
  893. NETDATA_DOUBLE test14b_results[] = {
  894. 1000000, 1000000, 1000000, 1000000, 1000000, 1000000, 1000000, 1000000
  895. };
  896. struct test test14b = {
  897. "test14b", // name
  898. "issue #981 with dummy data",
  899. 30, // update_every
  900. 1, // multiplier
  901. 1, // divisor
  902. RRD_ALGORITHM_INCREMENTAL, // algorithm
  903. 10, // feed entries
  904. 8, // result entries
  905. test14b_feed, // feed
  906. test14b_results, // results
  907. NULL, // feed2
  908. NULL // results2
  909. };
  910. struct feed_values test14c_feed[] = {
  911. { 29000000, 29000000 },
  912. { 1000000, 29000000 + 1000000 },
  913. { 30000000, 29000000 + 1000000 + 30000000 },
  914. { 30000000, 29000000 + 1000000 + 30000000 + 30000000 },
  915. { 30000000, 29000000 + 1000000 + 30000000 + 30000000 + 30000000 },
  916. { 30000000, 29000000 + 1000000 + 30000000 + 30000000 + 30000000 + 30000000 },
  917. { 30000000, 29000000 + 1000000 + 30000000 + 30000000 + 30000000 + 30000000 + 30000000 },
  918. { 30000000, 29000000 + 1000000 + 30000000 + 30000000 + 30000000 + 30000000 + 30000000 + 30000000 },
  919. { 30000000, 29000000 + 1000000 + 30000000 + 30000000 + 30000000 + 30000000 + 30000000 + 30000000 + 30000000 },
  920. { 30000000, 29000000 + 1000000 + 30000000 + 30000000 + 30000000 + 30000000 + 30000000 + 30000000 + 30000000 + 30000000 },
  921. };
  922. NETDATA_DOUBLE test14c_results[] = {
  923. 1000000, 1000000, 1000000, 1000000, 1000000, 1000000, 1000000, 1000000, 1000000
  924. };
  925. struct test test14c = {
  926. "test14c", // name
  927. "issue #981 with dummy data, checking for late start",
  928. 30, // update_every
  929. 1, // multiplier
  930. 1, // divisor
  931. RRD_ALGORITHM_INCREMENTAL, // algorithm
  932. 10, // feed entries
  933. 9, // result entries
  934. test14c_feed, // feed
  935. test14c_results, // results
  936. NULL, // feed2
  937. NULL // results2
  938. };
  939. // --------------------------------------------------------------------------------------------------------------------
  940. // test15
  941. struct feed_values test15_feed[] = {
  942. { 0, 1068066388 },
  943. { 1008752, 1068822698 },
  944. { 993809, 1069573072 },
  945. { 995911, 1070324135 },
  946. { 1014562, 1071078166 },
  947. { 994684, 1071831349 },
  948. { 993128, 1072235739 },
  949. { 1010332, 1072958871 },
  950. { 1003394, 1073707019 },
  951. { 995201, 1074460255 },
  952. };
  953. collected_number test15_feed2[] = {
  954. 178825286, 178825286, 178825286, 178825286, 178825498, 178825498, 179165652, 179202964, 179203282, 179204130
  955. };
  956. NETDATA_DOUBLE test15_results[] = {
  957. 5857.4080000, 5898.4540000, 5891.6590000, 5806.3160000, 5914.2640000, 3202.2630000, 5589.6560000, 5822.5260000, 5911.7520000
  958. };
  959. NETDATA_DOUBLE test15_results2[] = {
  960. 0.0000000, 0.0000000, 0.0024944, 1.6324779, 0.0212777, 2655.1890000, 290.5387000, 5.6733610, 6.5960220
  961. };
  962. struct test test15 = {
  963. "test15", // name
  964. "test incremental with 2 dimensions",
  965. 1, // update_every
  966. 8, // multiplier
  967. 1024, // divisor
  968. RRD_ALGORITHM_INCREMENTAL, // algorithm
  969. 10, // feed entries
  970. 9, // result entries
  971. test15_feed, // feed
  972. test15_results, // results
  973. test15_feed2, // feed2
  974. test15_results2 // results2
  975. };
  976. // --------------------------------------------------------------------------------------------------------------------
  977. int run_test(struct test *test)
  978. {
  979. fprintf(stderr, "\nRunning test '%s':\n%s\n", test->name, test->description);
  980. default_rrd_memory_mode = RRD_MEMORY_MODE_ALLOC;
  981. default_rrd_update_every = test->update_every;
  982. char name[101];
  983. snprintfz(name, 100, "unittest-%s", test->name);
  984. // create the chart
  985. RRDSET *st = rrdset_create_localhost("netdata", name, name, "netdata", NULL, "Unit Testing", "a value", "unittest", NULL, 1
  986. , test->update_every, RRDSET_TYPE_LINE);
  987. RRDDIM *rd = rrddim_add(st, "dim1", NULL, test->multiplier, test->divisor, test->algorithm);
  988. RRDDIM *rd2 = NULL;
  989. if(test->feed2)
  990. rd2 = rrddim_add(st, "dim2", NULL, test->multiplier, test->divisor, test->algorithm);
  991. rrdset_flag_set(st, RRDSET_FLAG_DEBUG);
  992. // feed it with the test data
  993. time_t time_now = 0, time_start = now_realtime_sec();
  994. unsigned long c;
  995. collected_number last = 0;
  996. for(c = 0; c < test->feed_entries; c++) {
  997. if(debug_flags) fprintf(stderr, "\n\n");
  998. if(c) {
  999. time_now += test->feed[c].microseconds;
  1000. fprintf(stderr, " > %s: feeding position %lu, after %0.3f seconds (%0.3f seconds from start), delta " NETDATA_DOUBLE_FORMAT
  1001. ", rate " NETDATA_DOUBLE_FORMAT "\n",
  1002. test->name, c+1,
  1003. (float)test->feed[c].microseconds / 1000000.0,
  1004. (float)time_now / 1000000.0,
  1005. ((NETDATA_DOUBLE)test->feed[c].value - (NETDATA_DOUBLE)last) * (NETDATA_DOUBLE)test->multiplier / (NETDATA_DOUBLE)test->divisor,
  1006. (((NETDATA_DOUBLE)test->feed[c].value - (NETDATA_DOUBLE)last) * (NETDATA_DOUBLE)test->multiplier / (NETDATA_DOUBLE)test->divisor) / (NETDATA_DOUBLE)test->feed[c].microseconds * (NETDATA_DOUBLE)1000000);
  1007. // rrdset_next_usec_unfiltered(st, test->feed[c].microseconds);
  1008. st->usec_since_last_update = test->feed[c].microseconds;
  1009. }
  1010. else {
  1011. fprintf(stderr, " > %s: feeding position %lu\n", test->name, c+1);
  1012. }
  1013. fprintf(stderr, " >> %s with value " COLLECTED_NUMBER_FORMAT "\n", rd->name, test->feed[c].value);
  1014. rrddim_set(st, "dim1", test->feed[c].value);
  1015. last = test->feed[c].value;
  1016. if(rd2) {
  1017. fprintf(stderr, " >> %s with value " COLLECTED_NUMBER_FORMAT "\n", rd2->name, test->feed2[c]);
  1018. rrddim_set(st, "dim2", test->feed2[c]);
  1019. }
  1020. rrdset_done(st);
  1021. // align the first entry to second boundary
  1022. if(!c) {
  1023. fprintf(stderr, " > %s: fixing first collection time to be %llu microseconds to second boundary\n", test->name, test->feed[c].microseconds);
  1024. rd->last_collected_time.tv_usec = st->last_collected_time.tv_usec = st->last_updated.tv_usec = test->feed[c].microseconds;
  1025. // time_start = st->last_collected_time.tv_sec;
  1026. }
  1027. }
  1028. // check the result
  1029. int errors = 0;
  1030. if(st->counter != test->result_entries) {
  1031. fprintf(stderr, " %s stored %zu entries, but we were expecting %lu, ### E R R O R ###\n", test->name, st->counter, test->result_entries);
  1032. errors++;
  1033. }
  1034. unsigned long max = (st->counter < test->result_entries)?st->counter:test->result_entries;
  1035. for(c = 0 ; c < max ; c++) {
  1036. NETDATA_DOUBLE v = unpack_storage_number(rd->db[c]);
  1037. NETDATA_DOUBLE n = unpack_storage_number(pack_storage_number(test->results[c], SN_DEFAULT_FLAGS));
  1038. int same = (roundndd(v * 10000000.0) == roundndd(n * 10000000.0))?1:0;
  1039. fprintf(stderr, " %s/%s: checking position %lu (at %"PRId64" secs), expecting value " NETDATA_DOUBLE_FORMAT
  1040. ", found " NETDATA_DOUBLE_FORMAT ", %s\n",
  1041. test->name, rd->name, c+1,
  1042. (int64_t)((rrdset_first_entry_t(st) + c * st->update_every) - time_start),
  1043. n, v, (same)?"OK":"### E R R O R ###");
  1044. if(!same) errors++;
  1045. if(rd2) {
  1046. v = unpack_storage_number(rd2->db[c]);
  1047. n = test->results2[c];
  1048. same = (roundndd(v * 10000000.0) == roundndd(n * 10000000.0))?1:0;
  1049. fprintf(stderr, " %s/%s: checking position %lu (at %"PRId64" secs), expecting value " NETDATA_DOUBLE_FORMAT
  1050. ", found " NETDATA_DOUBLE_FORMAT ", %s\n",
  1051. test->name, rd2->name, c+1,
  1052. (int64_t)((rrdset_first_entry_t(st) + c * st->update_every) - time_start),
  1053. n, v, (same)?"OK":"### E R R O R ###");
  1054. if(!same) errors++;
  1055. }
  1056. }
  1057. return errors;
  1058. }
  1059. static int test_variable_renames(void) {
  1060. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1061. fprintf(stderr, "Creating chart\n");
  1062. RRDSET *st = rrdset_create_localhost("chart", "ID", NULL, "family", "context", "Unit Testing", "a value", "unittest", NULL, 1, 1, RRDSET_TYPE_LINE);
  1063. fprintf(stderr, "Created chart with id '%s', name '%s'\n", st->id, st->name);
  1064. fprintf(stderr, "Creating dimension DIM1\n");
  1065. RRDDIM *rd1 = rrddim_add(st, "DIM1", NULL, 1, 1, RRD_ALGORITHM_INCREMENTAL);
  1066. fprintf(stderr, "Created dimension with id '%s', name '%s'\n", rd1->id, rd1->name);
  1067. fprintf(stderr, "Creating dimension DIM2\n");
  1068. RRDDIM *rd2 = rrddim_add(st, "DIM2", NULL, 1, 1, RRD_ALGORITHM_INCREMENTAL);
  1069. fprintf(stderr, "Created dimension with id '%s', name '%s'\n", rd2->id, rd2->name);
  1070. fprintf(stderr, "Renaming chart to CHARTNAME1\n");
  1071. rrdset_set_name(st, "CHARTNAME1");
  1072. fprintf(stderr, "Renamed chart with id '%s' to name '%s'\n", st->id, st->name);
  1073. fprintf(stderr, "Renaming chart to CHARTNAME2\n");
  1074. rrdset_set_name(st, "CHARTNAME2");
  1075. fprintf(stderr, "Renamed chart with id '%s' to name '%s'\n", st->id, st->name);
  1076. fprintf(stderr, "Renaming dimension DIM1 to DIM1NAME1\n");
  1077. rrddim_set_name(st, rd1, "DIM1NAME1");
  1078. fprintf(stderr, "Renamed dimension with id '%s' to name '%s'\n", rd1->id, rd1->name);
  1079. fprintf(stderr, "Renaming dimension DIM1 to DIM1NAME2\n");
  1080. rrddim_set_name(st, rd1, "DIM1NAME2");
  1081. fprintf(stderr, "Renamed dimension with id '%s' to name '%s'\n", rd1->id, rd1->name);
  1082. fprintf(stderr, "Renaming dimension DIM2 to DIM2NAME1\n");
  1083. rrddim_set_name(st, rd2, "DIM2NAME1");
  1084. fprintf(stderr, "Renamed dimension with id '%s' to name '%s'\n", rd2->id, rd2->name);
  1085. fprintf(stderr, "Renaming dimension DIM2 to DIM2NAME2\n");
  1086. rrddim_set_name(st, rd2, "DIM2NAME2");
  1087. fprintf(stderr, "Renamed dimension with id '%s' to name '%s'\n", rd2->id, rd2->name);
  1088. BUFFER *buf = buffer_create(1);
  1089. health_api_v1_chart_variables2json(st, buf);
  1090. fprintf(stderr, "%s", buffer_tostring(buf));
  1091. buffer_free(buf);
  1092. return 1;
  1093. }
  1094. int check_strdupz_path_subpath() {
  1095. struct strdupz_path_subpath_checks {
  1096. const char *path;
  1097. const char *subpath;
  1098. const char *result;
  1099. } checks[] = {
  1100. { "", "", "." },
  1101. { "/", "", "/" },
  1102. { "/etc/netdata", "", "/etc/netdata" },
  1103. { "/etc/netdata///", "", "/etc/netdata" },
  1104. { "/etc/netdata///", "health.d", "/etc/netdata/health.d" },
  1105. { "/etc/netdata///", "///health.d", "/etc/netdata/health.d" },
  1106. { "/etc/netdata", "///health.d", "/etc/netdata/health.d" },
  1107. { "", "///health.d", "./health.d" },
  1108. { "/", "///health.d", "/health.d" },
  1109. // terminator
  1110. { NULL, NULL, NULL }
  1111. };
  1112. size_t i;
  1113. for(i = 0; checks[i].result ; i++) {
  1114. char *s = strdupz_path_subpath(checks[i].path, checks[i].subpath);
  1115. fprintf(stderr, "strdupz_path_subpath(\"%s\", \"%s\") = \"%s\": ", checks[i].path, checks[i].subpath, s);
  1116. if(!s || strcmp(s, checks[i].result) != 0) {
  1117. freez(s);
  1118. fprintf(stderr, "FAILED\n");
  1119. return 1;
  1120. }
  1121. else {
  1122. freez(s);
  1123. fprintf(stderr, "OK\n");
  1124. }
  1125. }
  1126. return 0;
  1127. }
  1128. int run_all_mockup_tests(void)
  1129. {
  1130. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1131. if(check_strdupz_path_subpath())
  1132. return 1;
  1133. if(check_number_printing())
  1134. return 1;
  1135. if(check_rrdcalc_comparisons())
  1136. return 1;
  1137. if(!test_variable_renames())
  1138. return 1;
  1139. if(run_test(&test1))
  1140. return 1;
  1141. if(run_test(&test2))
  1142. return 1;
  1143. if(run_test(&test3))
  1144. return 1;
  1145. if(run_test(&test4))
  1146. return 1;
  1147. if(run_test(&test5))
  1148. return 1;
  1149. if(run_test(&test5b))
  1150. return 1;
  1151. if(run_test(&test6))
  1152. return 1;
  1153. if(run_test(&test7))
  1154. return 1;
  1155. if(run_test(&test8))
  1156. return 1;
  1157. if(run_test(&test9))
  1158. return 1;
  1159. if(run_test(&test10))
  1160. return 1;
  1161. if(run_test(&test11))
  1162. return 1;
  1163. if(run_test(&test12))
  1164. return 1;
  1165. if(run_test(&test13))
  1166. return 1;
  1167. if(run_test(&test14))
  1168. return 1;
  1169. if(run_test(&test14b))
  1170. return 1;
  1171. if(run_test(&test14c))
  1172. return 1;
  1173. if(run_test(&test15))
  1174. return 1;
  1175. return 0;
  1176. }
  1177. int unit_test(long delay, long shift)
  1178. {
  1179. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1180. static int repeat = 0;
  1181. repeat++;
  1182. char name[101];
  1183. snprintfz(name, 100, "unittest-%d-%ld-%ld", repeat, delay, shift);
  1184. //debug_flags = 0xffffffff;
  1185. default_rrd_memory_mode = RRD_MEMORY_MODE_ALLOC;
  1186. default_rrd_update_every = 1;
  1187. int do_abs = 1;
  1188. int do_inc = 1;
  1189. int do_abst = 0;
  1190. int do_absi = 0;
  1191. RRDSET *st = rrdset_create_localhost("netdata", name, name, "netdata", NULL, "Unit Testing", "a value", "unittest", NULL, 1, 1
  1192. , RRDSET_TYPE_LINE);
  1193. rrdset_flag_set(st, RRDSET_FLAG_DEBUG);
  1194. RRDDIM *rdabs = NULL;
  1195. RRDDIM *rdinc = NULL;
  1196. RRDDIM *rdabst = NULL;
  1197. RRDDIM *rdabsi = NULL;
  1198. if(do_abs) rdabs = rrddim_add(st, "absolute", "absolute", 1, 1, RRD_ALGORITHM_ABSOLUTE);
  1199. if(do_inc) rdinc = rrddim_add(st, "incremental", "incremental", 1, 1, RRD_ALGORITHM_INCREMENTAL);
  1200. if(do_abst) rdabst = rrddim_add(st, "percentage-of-absolute-row", "percentage-of-absolute-row", 1, 1, RRD_ALGORITHM_PCENT_OVER_ROW_TOTAL);
  1201. if(do_absi) rdabsi = rrddim_add(st, "percentage-of-incremental-row", "percentage-of-incremental-row", 1, 1, RRD_ALGORITHM_PCENT_OVER_DIFF_TOTAL);
  1202. long increment = 1000;
  1203. collected_number i = 0;
  1204. unsigned long c, dimensions = 0;
  1205. RRDDIM *rd;
  1206. for(rd = st->dimensions ; rd ; rd = rd->next) dimensions++;
  1207. for(c = 0; c < 20 ;c++) {
  1208. i += increment;
  1209. fprintf(stderr, "\n\nLOOP = %lu, DELAY = %ld, VALUE = " COLLECTED_NUMBER_FORMAT "\n", c, delay, i);
  1210. if(c) {
  1211. // rrdset_next_usec_unfiltered(st, delay);
  1212. st->usec_since_last_update = delay;
  1213. }
  1214. if(do_abs) rrddim_set(st, "absolute", i);
  1215. if(do_inc) rrddim_set(st, "incremental", i);
  1216. if(do_abst) rrddim_set(st, "percentage-of-absolute-row", i);
  1217. if(do_absi) rrddim_set(st, "percentage-of-incremental-row", i);
  1218. if(!c) {
  1219. now_realtime_timeval(&st->last_collected_time);
  1220. st->last_collected_time.tv_usec = shift;
  1221. }
  1222. // prevent it from deleting the dimensions
  1223. for(rd = st->dimensions ; rd ; rd = rd->next)
  1224. rd->last_collected_time.tv_sec = st->last_collected_time.tv_sec;
  1225. rrdset_done(st);
  1226. }
  1227. unsigned long oincrement = increment;
  1228. increment = increment * st->update_every * 1000000 / delay;
  1229. fprintf(stderr, "\n\nORIGINAL INCREMENT: %lu, INCREMENT %ld, DELAY %ld, SHIFT %ld\n", oincrement * 10, increment * 10, delay, shift);
  1230. int ret = 0;
  1231. storage_number sn;
  1232. NETDATA_DOUBLE cn, v;
  1233. for(c = 0 ; c < st->counter ; c++) {
  1234. fprintf(stderr, "\nPOSITION: c = %lu, EXPECTED VALUE %lu\n", c, (oincrement + c * increment + increment * (1000000 - shift) / 1000000 )* 10);
  1235. for(rd = st->dimensions ; rd ; rd = rd->next) {
  1236. sn = rd->db[c];
  1237. cn = unpack_storage_number(sn);
  1238. fprintf(stderr, "\t %s " NETDATA_DOUBLE_FORMAT " (PACKED AS " STORAGE_NUMBER_FORMAT ") -> ", rd->id, cn, sn);
  1239. if(rd == rdabs) v =
  1240. ( oincrement
  1241. // + (increment * (1000000 - shift) / 1000000)
  1242. + (c + 1) * increment
  1243. );
  1244. else if(rd == rdinc) v = (c?(increment):(increment * (1000000 - shift) / 1000000));
  1245. else if(rd == rdabst) v = oincrement / dimensions / 10;
  1246. else if(rd == rdabsi) v = oincrement / dimensions / 10;
  1247. else v = 0;
  1248. if(v == cn) fprintf(stderr, "passed.\n");
  1249. else {
  1250. fprintf(stderr, "ERROR! (expected " NETDATA_DOUBLE_FORMAT ")\n", v);
  1251. ret = 1;
  1252. }
  1253. }
  1254. }
  1255. if(ret)
  1256. fprintf(stderr, "\n\nUNIT TEST(%ld, %ld) FAILED\n\n", delay, shift);
  1257. return ret;
  1258. }
  1259. int test_sqlite(void) {
  1260. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1261. sqlite3 *db_meta;
  1262. fprintf(stderr, "Testing SQLIte\n");
  1263. int rc = sqlite3_open(":memory:", &db_meta);
  1264. if (rc != SQLITE_OK) {
  1265. fprintf(stderr,"Failed to test SQLite: DB init failed\n");
  1266. return 1;
  1267. }
  1268. rc = sqlite3_exec(db_meta, "CREATE TABLE IF NOT EXISTS mine (id1, id2);", 0, 0, NULL);
  1269. if (rc != SQLITE_OK) {
  1270. fprintf(stderr,"Failed to test SQLite: Create table failed\n");
  1271. return 1;
  1272. }
  1273. rc = sqlite3_exec(db_meta, "DELETE FROM MINE LIMIT 1;", 0, 0, NULL);
  1274. if (rc != SQLITE_OK) {
  1275. fprintf(stderr,"Failed to test SQLite: Delete with LIMIT failed\n");
  1276. return 1;
  1277. }
  1278. rc = sqlite3_exec(db_meta, "UPDATE MINE SET id1=1 LIMIT 1;", 0, 0, NULL);
  1279. if (rc != SQLITE_OK) {
  1280. fprintf(stderr,"Failed to test SQLite: Update with LIMIT failed\n");
  1281. return 1;
  1282. }
  1283. BUFFER *sql = buffer_create(ACLK_SYNC_QUERY_SIZE);
  1284. char *uuid_str = "0000_000";
  1285. buffer_sprintf(sql, TABLE_ACLK_CHART, uuid_str);
  1286. rc = sqlite3_exec(db_meta, buffer_tostring(sql), 0, 0, NULL);
  1287. buffer_flush(sql);
  1288. if (rc != SQLITE_OK)
  1289. goto error;
  1290. buffer_sprintf(sql, TABLE_ACLK_CHART_PAYLOAD, uuid_str);
  1291. rc = sqlite3_exec(db_meta, buffer_tostring(sql), 0, 0, NULL);
  1292. buffer_flush(sql);
  1293. if (rc != SQLITE_OK)
  1294. goto error;
  1295. buffer_sprintf(sql, TABLE_ACLK_CHART_LATEST, uuid_str);
  1296. rc = sqlite3_exec(db_meta, buffer_tostring(sql), 0, 0, NULL);
  1297. if (rc != SQLITE_OK)
  1298. goto error;
  1299. buffer_flush(sql);
  1300. buffer_sprintf(sql, INDEX_ACLK_CHART, uuid_str, uuid_str);
  1301. rc = sqlite3_exec(db_meta, buffer_tostring(sql), 0, 0, NULL);
  1302. if (rc != SQLITE_OK)
  1303. goto error;
  1304. buffer_flush(sql);
  1305. buffer_sprintf(sql, INDEX_ACLK_CHART_LATEST, uuid_str, uuid_str);
  1306. rc = sqlite3_exec(db_meta, buffer_tostring(sql), 0, 0, NULL);
  1307. if (rc != SQLITE_OK)
  1308. goto error;
  1309. buffer_flush(sql);
  1310. buffer_sprintf(sql, TRIGGER_ACLK_CHART_PAYLOAD, uuid_str, uuid_str, uuid_str);
  1311. rc = sqlite3_exec(db_meta, buffer_tostring(sql), 0, 0, NULL);
  1312. if (rc != SQLITE_OK)
  1313. goto error;
  1314. buffer_flush(sql);
  1315. buffer_sprintf(sql, TABLE_ACLK_ALERT, uuid_str);
  1316. rc = sqlite3_exec(db_meta, buffer_tostring(sql), 0, 0, NULL);
  1317. if (rc != SQLITE_OK)
  1318. goto error;
  1319. buffer_flush(sql);
  1320. buffer_sprintf(sql, INDEX_ACLK_ALERT, uuid_str, uuid_str);
  1321. rc = sqlite3_exec(db_meta, buffer_tostring(sql), 0, 0, NULL);
  1322. if (rc != SQLITE_OK)
  1323. goto error;
  1324. buffer_flush(sql);
  1325. buffer_free(sql);
  1326. fprintf(stderr,"SQLite is OK\n");
  1327. return 0;
  1328. error:
  1329. fprintf(stderr,"SQLite statement failed: %s\n", buffer_tostring(sql));
  1330. buffer_free(sql);
  1331. fprintf(stderr,"SQLite tests failed\n");
  1332. return 1;
  1333. }
  1334. int unit_test_bitmap256(void) {
  1335. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1336. BITMAP256 test_bitmap = {0};
  1337. bitmap256_set_bit(&test_bitmap, 0, 1);
  1338. bitmap256_set_bit(&test_bitmap, 64, 1);
  1339. bitmap256_set_bit(&test_bitmap, 128, 1);
  1340. bitmap256_set_bit(&test_bitmap, 192, 1);
  1341. if (test_bitmap.data[0] == 1)
  1342. fprintf(stderr, "%s() INDEX 1 is OK\n", __FUNCTION__ );
  1343. if (test_bitmap.data[1] == 1)
  1344. fprintf(stderr, "%s() INDEX 65 is OK\n", __FUNCTION__ );
  1345. if (test_bitmap.data[2] == 1)
  1346. fprintf(stderr, "%s() INDEX 129 is OK\n", __FUNCTION__ );
  1347. if (test_bitmap.data[3] == 1)
  1348. fprintf(stderr, "%s() INDEX 192 is OK\n", __FUNCTION__ );
  1349. uint8_t i=0;
  1350. int j = 0;
  1351. do {
  1352. bitmap256_set_bit(&test_bitmap, i++, 1);
  1353. j++;
  1354. } while (j < 256);
  1355. if (test_bitmap.data[0] == 0xffffffffffffffff)
  1356. fprintf(stderr, "%s() INDEX 0 is fully set OK\n", __FUNCTION__);
  1357. else {
  1358. fprintf(stderr, "%s() INDEX 0 is %lx expected 0xffffffffffffffff\n", __FUNCTION__, test_bitmap.data[0]);
  1359. return 1;
  1360. }
  1361. if (test_bitmap.data[1] == 0xffffffffffffffff)
  1362. fprintf(stderr, "%s() INDEX 1 is fully set OK\n", __FUNCTION__);
  1363. else {
  1364. fprintf(stderr, "%s() INDEX 1 is %lx expected 0xffffffffffffffff\n", __FUNCTION__, test_bitmap.data[0]);
  1365. return 1;
  1366. }
  1367. if (test_bitmap.data[2] == 0xffffffffffffffff)
  1368. fprintf(stderr, "%s() INDEX 2 is fully set OK\n", __FUNCTION__);
  1369. else {
  1370. fprintf(stderr, "%s() INDEX 2 is %lx expected 0xffffffffffffffff\n", __FUNCTION__, test_bitmap.data[0]);
  1371. return 1;
  1372. }
  1373. if (test_bitmap.data[3] == 0xffffffffffffffff)
  1374. fprintf(stderr, "%s() INDEX 3 is fully set OK\n", __FUNCTION__);
  1375. else {
  1376. fprintf(stderr, "%s() INDEX 3 is %lx expected 0xffffffffffffffff\n", __FUNCTION__, test_bitmap.data[0]);
  1377. return 1;
  1378. }
  1379. i = 0;
  1380. j = 0;
  1381. do {
  1382. bitmap256_set_bit(&test_bitmap, i++, 0);
  1383. j++;
  1384. } while (j < 256);
  1385. if (test_bitmap.data[0] == 0)
  1386. fprintf(stderr, "%s() INDEX 0 is reset OK\n", __FUNCTION__);
  1387. else {
  1388. fprintf(stderr, "%s() INDEX 0 is not reset FAILED\n", __FUNCTION__);
  1389. return 1;
  1390. }
  1391. if (test_bitmap.data[1] == 0)
  1392. fprintf(stderr, "%s() INDEX 1 is reset OK\n", __FUNCTION__);
  1393. else {
  1394. fprintf(stderr, "%s() INDEX 1 is not reset FAILED\n", __FUNCTION__);
  1395. return 1;
  1396. }
  1397. if (test_bitmap.data[2] == 0)
  1398. fprintf(stderr, "%s() INDEX 2 is reset OK\n", __FUNCTION__);
  1399. else {
  1400. fprintf(stderr, "%s() INDEX 2 is not reset FAILED\n", __FUNCTION__);
  1401. return 1;
  1402. }
  1403. if (test_bitmap.data[3] == 0)
  1404. fprintf(stderr, "%s() INDEX 3 is reset OK\n", __FUNCTION__);
  1405. else {
  1406. fprintf(stderr, "%s() INDEX 3 is not reset FAILED\n", __FUNCTION__);
  1407. return 1;
  1408. }
  1409. i=0;
  1410. j = 0;
  1411. do {
  1412. bitmap256_set_bit(&test_bitmap, i, 1);
  1413. i += 4;
  1414. j += 4;
  1415. } while (j < 256);
  1416. if (test_bitmap.data[0] == 0x1111111111111111)
  1417. fprintf(stderr, "%s() INDEX 0 is 0x1111111111111111 set OK\n", __FUNCTION__);
  1418. else {
  1419. fprintf(stderr, "%s() INDEX 0 is %lx expected 0x1111111111111111\n", __FUNCTION__, test_bitmap.data[0]);
  1420. return 1;
  1421. }
  1422. if (test_bitmap.data[1] == 0x1111111111111111)
  1423. fprintf(stderr, "%s() INDEX 1 is 0x1111111111111111 set OK\n", __FUNCTION__);
  1424. else {
  1425. fprintf(stderr, "%s() INDEX 1 is %lx expected 0x1111111111111111\n", __FUNCTION__, test_bitmap.data[1]);
  1426. return 1;
  1427. }
  1428. if (test_bitmap.data[2] == 0x1111111111111111)
  1429. fprintf(stderr, "%s() INDEX 2 is 0x1111111111111111 set OK\n", __FUNCTION__);
  1430. else {
  1431. fprintf(stderr, "%s() INDEX 2 is %lx expected 0x1111111111111111\n", __FUNCTION__, test_bitmap.data[2]);
  1432. return 1;
  1433. }
  1434. if (test_bitmap.data[3] == 0x1111111111111111)
  1435. fprintf(stderr, "%s() INDEX 3 is 0x1111111111111111 set OK\n", __FUNCTION__);
  1436. else {
  1437. fprintf(stderr, "%s() INDEX 3 is %lx expected 0x1111111111111111\n", __FUNCTION__, test_bitmap.data[3]);
  1438. return 1;
  1439. }
  1440. fprintf(stderr, "%s() tests passed\n", __FUNCTION__);
  1441. return 0;
  1442. }
  1443. #ifdef ENABLE_DBENGINE
  1444. static inline void rrddim_set_by_pointer_fake_time(RRDDIM *rd, collected_number value, time_t now)
  1445. {
  1446. rd->last_collected_time.tv_sec = now;
  1447. rd->last_collected_time.tv_usec = 0;
  1448. rd->collected_value = value;
  1449. rd->updated = 1;
  1450. rd->collections_counter++;
  1451. collected_number v = (value >= 0) ? value : -value;
  1452. if(unlikely(v > rd->collected_value_max)) rd->collected_value_max = v;
  1453. }
  1454. static RRDHOST *dbengine_rrdhost_find_or_create(char *name)
  1455. {
  1456. /* We don't want to drop metrics when generating load, we prefer to block data generation itself */
  1457. rrdeng_drop_metrics_under_page_cache_pressure = 0;
  1458. return rrdhost_find_or_create(
  1459. name
  1460. , name
  1461. , name
  1462. , os_type
  1463. , netdata_configured_timezone
  1464. , netdata_configured_abbrev_timezone
  1465. , netdata_configured_utc_offset
  1466. , ""
  1467. , program_name
  1468. , program_version
  1469. , default_rrd_update_every
  1470. , default_rrd_history_entries
  1471. , RRD_MEMORY_MODE_DBENGINE
  1472. , default_health_enabled
  1473. , default_rrdpush_enabled
  1474. , default_rrdpush_destination
  1475. , default_rrdpush_api_key
  1476. , default_rrdpush_send_charts_matching
  1477. , NULL
  1478. );
  1479. }
  1480. // constants for test_dbengine
  1481. static const int CHARTS = 64;
  1482. static const int DIMS = 16; // That gives us 64 * 16 = 1024 metrics
  1483. #define REGIONS (3) // 3 regions of update_every
  1484. // first region update_every is 2, second is 3, third is 1
  1485. static const int REGION_UPDATE_EVERY[REGIONS] = {2, 3, 1};
  1486. static const int REGION_POINTS[REGIONS] = {
  1487. 16384, // This produces 64MiB of metric data for the first region: update_every = 2
  1488. 16384, // This produces 64MiB of metric data for the second region: update_every = 3
  1489. 16384, // This produces 64MiB of metric data for the third region: update_every = 1
  1490. };
  1491. static const int QUERY_BATCH = 4096;
  1492. static void test_dbengine_create_charts(RRDHOST *host, RRDSET *st[CHARTS], RRDDIM *rd[CHARTS][DIMS],
  1493. int update_every)
  1494. {
  1495. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1496. int i, j;
  1497. char name[101];
  1498. for (i = 0 ; i < CHARTS ; ++i) {
  1499. snprintfz(name, 100, "dbengine-chart-%d", i);
  1500. // create the chart
  1501. st[i] = rrdset_create(host, "netdata", name, name, "netdata", NULL, "Unit Testing", "a value", "unittest",
  1502. NULL, 1, update_every, RRDSET_TYPE_LINE);
  1503. rrdset_flag_set(st[i], RRDSET_FLAG_DEBUG);
  1504. rrdset_flag_set(st[i], RRDSET_FLAG_STORE_FIRST);
  1505. for (j = 0 ; j < DIMS ; ++j) {
  1506. snprintfz(name, 100, "dim-%d", j);
  1507. rd[i][j] = rrddim_add(st[i], name, NULL, 1, 1, RRD_ALGORITHM_ABSOLUTE);
  1508. }
  1509. }
  1510. // Initialize DB with the very first entries
  1511. for (i = 0 ; i < CHARTS ; ++i) {
  1512. for (j = 0 ; j < DIMS ; ++j) {
  1513. rd[i][j]->last_collected_time.tv_sec =
  1514. st[i]->last_collected_time.tv_sec = st[i]->last_updated.tv_sec = 2 * API_RELATIVE_TIME_MAX - 1;
  1515. rd[i][j]->last_collected_time.tv_usec =
  1516. st[i]->last_collected_time.tv_usec = st[i]->last_updated.tv_usec = 0;
  1517. }
  1518. }
  1519. for (i = 0 ; i < CHARTS ; ++i) {
  1520. st[i]->usec_since_last_update = USEC_PER_SEC;
  1521. for (j = 0; j < DIMS; ++j) {
  1522. rrddim_set_by_pointer_fake_time(rd[i][j], 69, 2 * API_RELATIVE_TIME_MAX); // set first value to 69
  1523. }
  1524. rrdset_done(st[i]);
  1525. }
  1526. // Fluh pages for subsequent real values
  1527. for (i = 0 ; i < CHARTS ; ++i) {
  1528. for (j = 0; j < DIMS; ++j) {
  1529. rrdeng_store_metric_flush_current_page((rd[i][j])->tiers[0]->db_collection_handle);
  1530. }
  1531. }
  1532. }
  1533. // Feeds the database region with test data, returns last timestamp of region
  1534. static time_t test_dbengine_create_metrics(RRDSET *st[CHARTS], RRDDIM *rd[CHARTS][DIMS],
  1535. int current_region, time_t time_start)
  1536. {
  1537. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1538. time_t time_now;
  1539. int i, j, c, update_every;
  1540. collected_number next;
  1541. update_every = REGION_UPDATE_EVERY[current_region];
  1542. time_now = time_start;
  1543. // feed it with the test data
  1544. for (i = 0 ; i < CHARTS ; ++i) {
  1545. for (j = 0 ; j < DIMS ; ++j) {
  1546. rd[i][j]->last_collected_time.tv_sec =
  1547. st[i]->last_collected_time.tv_sec = st[i]->last_updated.tv_sec = time_now;
  1548. rd[i][j]->last_collected_time.tv_usec =
  1549. st[i]->last_collected_time.tv_usec = st[i]->last_updated.tv_usec = 0;
  1550. }
  1551. }
  1552. for (c = 0; c < REGION_POINTS[current_region] ; ++c) {
  1553. time_now += update_every; // time_now = start + (c + 1) * update_every
  1554. for (i = 0 ; i < CHARTS ; ++i) {
  1555. st[i]->usec_since_last_update = USEC_PER_SEC * update_every;
  1556. for (j = 0; j < DIMS; ++j) {
  1557. next = ((collected_number)i * DIMS) * REGION_POINTS[current_region] +
  1558. j * REGION_POINTS[current_region] + c;
  1559. rrddim_set_by_pointer_fake_time(rd[i][j], next, time_now);
  1560. }
  1561. rrdset_done(st[i]);
  1562. }
  1563. }
  1564. return time_now; //time_end
  1565. }
  1566. // Checks the metric data for the given region, returns number of errors
  1567. static int test_dbengine_check_metrics(RRDSET *st[CHARTS], RRDDIM *rd[CHARTS][DIMS],
  1568. int current_region, time_t time_start)
  1569. {
  1570. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1571. uint8_t same;
  1572. time_t time_now, time_retrieved, end_time;
  1573. int i, j, k, c, errors, update_every;
  1574. collected_number last;
  1575. NETDATA_DOUBLE value, expected;
  1576. struct rrddim_query_handle handle;
  1577. size_t value_errors = 0, time_errors = 0;
  1578. update_every = REGION_UPDATE_EVERY[current_region];
  1579. errors = 0;
  1580. // check the result
  1581. for (c = 0; c < REGION_POINTS[current_region] ; c += QUERY_BATCH) {
  1582. time_now = time_start + (c + 1) * update_every;
  1583. for (i = 0 ; i < CHARTS ; ++i) {
  1584. for (j = 0; j < DIMS; ++j) {
  1585. rd[i][j]->tiers[0]->query_ops.init(rd[i][j]->tiers[0]->db_metric_handle, &handle, time_now, time_now + QUERY_BATCH * update_every, TIER_QUERY_FETCH_SUM);
  1586. for (k = 0; k < QUERY_BATCH; ++k) {
  1587. last = ((collected_number)i * DIMS) * REGION_POINTS[current_region] +
  1588. j * REGION_POINTS[current_region] + c + k;
  1589. expected = unpack_storage_number(pack_storage_number((NETDATA_DOUBLE)last, SN_DEFAULT_FLAGS));
  1590. STORAGE_POINT sp = rd[i][j]->tiers[0]->query_ops.next_metric(&handle);
  1591. value = sp.sum;
  1592. time_retrieved = sp.start_time;
  1593. end_time = sp.end_time;
  1594. same = (roundndd(value) == roundndd(expected)) ? 1 : 0;
  1595. if(!same) {
  1596. if(!value_errors)
  1597. fprintf(stderr, " DB-engine unittest %s/%s: at %lu secs, expecting value " NETDATA_DOUBLE_FORMAT
  1598. ", found " NETDATA_DOUBLE_FORMAT ", ### E R R O R ###\n",
  1599. st[i]->name, rd[i][j]->name, (unsigned long)time_now + k * update_every, expected, value);
  1600. value_errors++;
  1601. errors++;
  1602. }
  1603. if(end_time != time_now + k * update_every) {
  1604. if(!time_errors)
  1605. fprintf(stderr, " DB-engine unittest %s/%s: at %lu secs, found timestamp %lu ### E R R O R ###\n",
  1606. st[i]->name, rd[i][j]->name, (unsigned long)time_now + k * update_every, (unsigned long)time_retrieved);
  1607. time_errors++;
  1608. errors++;
  1609. }
  1610. }
  1611. rd[i][j]->tiers[0]->query_ops.finalize(&handle);
  1612. }
  1613. }
  1614. }
  1615. if(value_errors)
  1616. fprintf(stderr, "%zu value errors encountered\n", value_errors);
  1617. if(time_errors)
  1618. fprintf(stderr, "%zu time errors encountered\n", time_errors);
  1619. return errors;
  1620. }
  1621. // Check rrdr transformations
  1622. static int test_dbengine_check_rrdr(RRDSET *st[CHARTS], RRDDIM *rd[CHARTS][DIMS],
  1623. int current_region, time_t time_start, time_t time_end)
  1624. {
  1625. int update_every = REGION_UPDATE_EVERY[current_region];
  1626. fprintf(stderr, "%s() running on region %d, start time %ld, end time %ld, update every %d...\n", __FUNCTION__, current_region, time_start, time_end, update_every);
  1627. uint8_t same;
  1628. time_t time_now, time_retrieved;
  1629. int i, j, errors, value_errors = 0, time_errors = 0;
  1630. long c;
  1631. collected_number last;
  1632. NETDATA_DOUBLE value, expected;
  1633. errors = 0;
  1634. long points = (time_end - time_start) / update_every;
  1635. for (i = 0 ; i < CHARTS ; ++i) {
  1636. ONEWAYALLOC *owa = onewayalloc_create(0);
  1637. RRDR *r = rrd2rrdr(owa, st[i], points, time_start, time_end,
  1638. RRDR_GROUPING_AVERAGE, 0, RRDR_OPTION_NATURAL_POINTS,
  1639. NULL, NULL, NULL, 0, 0);
  1640. if (!r) {
  1641. fprintf(stderr, " DB-engine unittest %s: empty RRDR on region %d ### E R R O R ###\n", st[i]->name, current_region);
  1642. return ++errors;
  1643. } else {
  1644. assert(r->st == st[i]);
  1645. for (c = 0; c != rrdr_rows(r) ; ++c) {
  1646. RRDDIM *d;
  1647. time_now = time_start + (c + 1) * update_every;
  1648. time_retrieved = r->t[c];
  1649. // for each dimension
  1650. for (j = 0, d = r->st->dimensions ; d && j < r->d ; ++j, d = d->next) {
  1651. NETDATA_DOUBLE *cn = &r->v[ c * r->d ];
  1652. value = cn[j];
  1653. assert(rd[i][j] == d);
  1654. last = i * DIMS * REGION_POINTS[current_region] + j * REGION_POINTS[current_region] + c;
  1655. expected = unpack_storage_number(pack_storage_number((NETDATA_DOUBLE)last, SN_DEFAULT_FLAGS));
  1656. same = (roundndd(value) == roundndd(expected)) ? 1 : 0;
  1657. if(!same) {
  1658. if(value_errors < 20)
  1659. fprintf(stderr, " DB-engine unittest %s/%s: at %lu secs, expecting value " NETDATA_DOUBLE_FORMAT
  1660. ", RRDR found " NETDATA_DOUBLE_FORMAT ", ### E R R O R ###\n",
  1661. st[i]->name, rd[i][j]->name, (unsigned long)time_now, expected, value);
  1662. value_errors++;
  1663. }
  1664. if(time_retrieved != time_now) {
  1665. if(time_errors < 20)
  1666. fprintf(stderr, " DB-engine unittest %s/%s: at %lu secs, found RRDR timestamp %lu ### E R R O R ###\n",
  1667. st[i]->name, rd[i][j]->name, (unsigned long)time_now, (unsigned long)time_retrieved);
  1668. time_errors++;
  1669. }
  1670. }
  1671. }
  1672. rrdr_free(owa, r);
  1673. }
  1674. onewayalloc_destroy(owa);
  1675. }
  1676. if(value_errors)
  1677. fprintf(stderr, "%d value errors encountered\n", value_errors);
  1678. if(time_errors)
  1679. fprintf(stderr, "%d time errors encountered\n", time_errors);
  1680. return errors + value_errors + time_errors;
  1681. }
  1682. int test_dbengine(void)
  1683. {
  1684. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1685. int i, j, errors, value_errors = 0, time_errors = 0, update_every, current_region;
  1686. RRDHOST *host = NULL;
  1687. RRDSET *st[CHARTS];
  1688. RRDDIM *rd[CHARTS][DIMS];
  1689. time_t time_start[REGIONS], time_end[REGIONS];
  1690. error_log_limit_unlimited();
  1691. fprintf(stderr, "\nRunning DB-engine test\n");
  1692. default_rrd_memory_mode = RRD_MEMORY_MODE_DBENGINE;
  1693. fprintf(stderr, "Initializing localhost with hostname 'unittest-dbengine'");
  1694. host = dbengine_rrdhost_find_or_create("unittest-dbengine");
  1695. if (NULL == host)
  1696. return 1;
  1697. current_region = 0; // this is the first region of data
  1698. update_every = REGION_UPDATE_EVERY[current_region]; // set data collection frequency to 2 seconds
  1699. test_dbengine_create_charts(host, st, rd, update_every);
  1700. time_start[current_region] = 2 * API_RELATIVE_TIME_MAX;
  1701. time_end[current_region] = test_dbengine_create_metrics(st,rd, current_region, time_start[current_region]);
  1702. errors = test_dbengine_check_metrics(st, rd, current_region, time_start[current_region]);
  1703. if (errors)
  1704. goto error_out;
  1705. current_region = 1; //this is the second region of data
  1706. update_every = REGION_UPDATE_EVERY[current_region]; // set data collection frequency to 3 seconds
  1707. // Align pages for frequency change
  1708. for (i = 0 ; i < CHARTS ; ++i) {
  1709. st[i]->update_every = update_every;
  1710. for (j = 0; j < DIMS; ++j) {
  1711. rrdeng_store_metric_flush_current_page((rd[i][j])->tiers[0]->db_collection_handle);
  1712. }
  1713. }
  1714. time_start[current_region] = time_end[current_region - 1] + update_every;
  1715. if (0 != time_start[current_region] % update_every) // align to update_every
  1716. time_start[current_region] += update_every - time_start[current_region] % update_every;
  1717. time_end[current_region] = test_dbengine_create_metrics(st,rd, current_region, time_start[current_region]);
  1718. errors = test_dbengine_check_metrics(st, rd, current_region, time_start[current_region]);
  1719. if (errors)
  1720. goto error_out;
  1721. current_region = 2; //this is the third region of data
  1722. update_every = REGION_UPDATE_EVERY[current_region]; // set data collection frequency to 1 seconds
  1723. // Align pages for frequency change
  1724. for (i = 0 ; i < CHARTS ; ++i) {
  1725. st[i]->update_every = update_every;
  1726. for (j = 0; j < DIMS; ++j) {
  1727. rrdeng_store_metric_flush_current_page((rd[i][j])->tiers[0]->db_collection_handle);
  1728. }
  1729. }
  1730. time_start[current_region] = time_end[current_region - 1] + update_every;
  1731. if (0 != time_start[current_region] % update_every) // align to update_every
  1732. time_start[current_region] += update_every - time_start[current_region] % update_every;
  1733. time_end[current_region] = test_dbengine_create_metrics(st,rd, current_region, time_start[current_region]);
  1734. errors = test_dbengine_check_metrics(st, rd, current_region, time_start[current_region]);
  1735. if (errors)
  1736. goto error_out;
  1737. for (current_region = 0 ; current_region < REGIONS ; ++current_region) {
  1738. errors = test_dbengine_check_rrdr(st, rd, current_region, time_start[current_region], time_end[current_region]);
  1739. if (errors)
  1740. goto error_out;
  1741. }
  1742. current_region = 1;
  1743. update_every = REGION_UPDATE_EVERY[current_region]; // use the maximum update_every = 3
  1744. errors = 0;
  1745. long points = (time_end[REGIONS - 1] - time_start[0]) / update_every; // cover all time regions with RRDR
  1746. long point_offset = (time_start[current_region] - time_start[0]) / update_every;
  1747. for (i = 0 ; i < CHARTS ; ++i) {
  1748. ONEWAYALLOC *owa = onewayalloc_create(0);
  1749. RRDR *r = rrd2rrdr(owa, st[i], points, time_start[0] + update_every,
  1750. time_end[REGIONS - 1], RRDR_GROUPING_AVERAGE, 0,
  1751. RRDR_OPTION_NATURAL_POINTS, NULL, NULL, NULL, 0, 0);
  1752. if (!r) {
  1753. fprintf(stderr, " DB-engine unittest %s: empty RRDR ### E R R O R ###\n", st[i]->name);
  1754. ++errors;
  1755. } else {
  1756. long c;
  1757. assert(r->st == st[i]);
  1758. // test current region values only, since they must be left unchanged
  1759. for (c = point_offset ; c < point_offset + rrdr_rows(r) / REGIONS / 2 ; ++c) {
  1760. RRDDIM *d;
  1761. time_t time_now = time_start[current_region] + (c - point_offset + 2) * update_every;
  1762. time_t time_retrieved = r->t[c];
  1763. // for each dimension
  1764. for(j = 0, d = r->st->dimensions ; d && j < r->d ; ++j, d = d->next) {
  1765. NETDATA_DOUBLE *cn = &r->v[ c * r->d ];
  1766. NETDATA_DOUBLE value = cn[j];
  1767. assert(rd[i][j] == d);
  1768. collected_number last = i * DIMS * REGION_POINTS[current_region] + j * REGION_POINTS[current_region] + c - point_offset + 1;
  1769. NETDATA_DOUBLE expected = unpack_storage_number(pack_storage_number((NETDATA_DOUBLE)last, SN_DEFAULT_FLAGS));
  1770. uint8_t same = (roundndd(value) == roundndd(expected)) ? 1 : 0;
  1771. if(!same) {
  1772. if(!value_errors)
  1773. fprintf(stderr, " DB-engine unittest %s/%s: at %lu secs, expecting value " NETDATA_DOUBLE_FORMAT
  1774. ", RRDR found " NETDATA_DOUBLE_FORMAT ", ### E R R O R ###\n",
  1775. st[i]->name, rd[i][j]->name, (unsigned long)time_now, expected, value);
  1776. value_errors++;
  1777. }
  1778. if(time_retrieved != time_now) {
  1779. if(!time_errors)
  1780. fprintf(stderr, " DB-engine unittest %s/%s: at %lu secs, found RRDR timestamp %lu ### E R R O R ###\n",
  1781. st[i]->name, rd[i][j]->name, (unsigned long)time_now, (unsigned long)time_retrieved);
  1782. time_errors++;
  1783. }
  1784. }
  1785. }
  1786. rrdr_free(owa, r);
  1787. }
  1788. onewayalloc_destroy(owa);
  1789. }
  1790. error_out:
  1791. rrd_wrlock();
  1792. rrdeng_prepare_exit((struct rrdengine_instance *)host->storage_instance[0]);
  1793. rrdhost_delete_charts(host);
  1794. rrdeng_exit((struct rrdengine_instance *)host->storage_instance[0]);
  1795. rrd_unlock();
  1796. return errors + value_errors + time_errors;
  1797. }
  1798. struct dbengine_chart_thread {
  1799. uv_thread_t thread;
  1800. RRDHOST *host;
  1801. char *chartname; /* Will be prefixed by type, e.g. "example_local1.", "example_local2." etc */
  1802. unsigned dset_charts; /* number of charts */
  1803. unsigned dset_dims; /* dimensions per chart */
  1804. unsigned chart_i; /* current chart offset */
  1805. time_t time_present; /* current virtual time of the benchmark */
  1806. volatile time_t time_max; /* latest timestamp of stored values */
  1807. unsigned history_seconds; /* how far back in the past to go */
  1808. volatile long done; /* initialize to 0, set to 1 to stop thread */
  1809. struct completion charts_initialized;
  1810. unsigned long errors, stored_metrics_nr; /* statistics */
  1811. RRDSET *st;
  1812. RRDDIM *rd[]; /* dset_dims elements */
  1813. };
  1814. collected_number generate_dbengine_chart_value(int chart_i, int dim_i, time_t time_current)
  1815. {
  1816. collected_number value;
  1817. value = ((collected_number)time_current) * (chart_i + 1);
  1818. value += ((collected_number)time_current) * (dim_i + 1);
  1819. value %= 1024LLU;
  1820. return value;
  1821. }
  1822. static void generate_dbengine_chart(void *arg)
  1823. {
  1824. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1825. struct dbengine_chart_thread *thread_info = (struct dbengine_chart_thread *)arg;
  1826. RRDHOST *host = thread_info->host;
  1827. char *chartname = thread_info->chartname;
  1828. const unsigned DSET_DIMS = thread_info->dset_dims;
  1829. unsigned history_seconds = thread_info->history_seconds;
  1830. time_t time_present = thread_info->time_present;
  1831. unsigned j, update_every = 1;
  1832. RRDSET *st;
  1833. RRDDIM *rd[DSET_DIMS];
  1834. char name[RRD_ID_LENGTH_MAX + 1];
  1835. time_t time_current;
  1836. // create the chart
  1837. snprintfz(name, RRD_ID_LENGTH_MAX, "example_local%u", thread_info->chart_i + 1);
  1838. thread_info->st = st = rrdset_create(host, name, chartname, chartname, "example", NULL, chartname, chartname,
  1839. chartname, NULL, 1, update_every, RRDSET_TYPE_LINE);
  1840. for (j = 0 ; j < DSET_DIMS ; ++j) {
  1841. snprintfz(name, RRD_ID_LENGTH_MAX, "%s%u", chartname, j + 1);
  1842. thread_info->rd[j] = rd[j] = rrddim_add(st, name, NULL, 1, 1, RRD_ALGORITHM_ABSOLUTE);
  1843. }
  1844. completion_mark_complete(&thread_info->charts_initialized);
  1845. // feed it with the test data
  1846. time_current = time_present - history_seconds;
  1847. for (j = 0 ; j < DSET_DIMS ; ++j) {
  1848. rd[j]->last_collected_time.tv_sec =
  1849. st->last_collected_time.tv_sec = st->last_updated.tv_sec = time_current - update_every;
  1850. rd[j]->last_collected_time.tv_usec =
  1851. st->last_collected_time.tv_usec = st->last_updated.tv_usec = 0;
  1852. }
  1853. for( ; !thread_info->done && time_current < time_present ; time_current += update_every) {
  1854. st->usec_since_last_update = USEC_PER_SEC * update_every;
  1855. for (j = 0; j < DSET_DIMS; ++j) {
  1856. collected_number value;
  1857. value = generate_dbengine_chart_value(thread_info->chart_i, j, time_current);
  1858. rrddim_set_by_pointer_fake_time(rd[j], value, time_current);
  1859. ++thread_info->stored_metrics_nr;
  1860. }
  1861. rrdset_done(st);
  1862. thread_info->time_max = time_current;
  1863. }
  1864. for (j = 0; j < DSET_DIMS; ++j) {
  1865. rrdeng_store_metric_finalize((rd[j])->tiers[0]->db_collection_handle);
  1866. }
  1867. }
  1868. void generate_dbengine_dataset(unsigned history_seconds)
  1869. {
  1870. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1871. const int DSET_CHARTS = 16;
  1872. const int DSET_DIMS = 128;
  1873. const uint64_t EXPECTED_COMPRESSION_RATIO = 20;
  1874. RRDHOST *host = NULL;
  1875. struct dbengine_chart_thread **thread_info;
  1876. int i;
  1877. time_t time_present;
  1878. default_rrd_memory_mode = RRD_MEMORY_MODE_DBENGINE;
  1879. default_rrdeng_page_cache_mb = 128;
  1880. // Worst case for uncompressible data
  1881. default_rrdeng_disk_quota_mb = (((uint64_t)DSET_DIMS * DSET_CHARTS) * sizeof(storage_number) * history_seconds) /
  1882. (1024 * 1024);
  1883. default_rrdeng_disk_quota_mb -= default_rrdeng_disk_quota_mb * EXPECTED_COMPRESSION_RATIO / 100;
  1884. error_log_limit_unlimited();
  1885. fprintf(stderr, "Initializing localhost with hostname 'dbengine-dataset'");
  1886. host = dbengine_rrdhost_find_or_create("dbengine-dataset");
  1887. if (NULL == host)
  1888. return;
  1889. thread_info = mallocz(sizeof(*thread_info) * DSET_CHARTS);
  1890. for (i = 0 ; i < DSET_CHARTS ; ++i) {
  1891. thread_info[i] = mallocz(sizeof(*thread_info[i]) + sizeof(RRDDIM *) * DSET_DIMS);
  1892. }
  1893. fprintf(stderr, "\nRunning DB-engine workload generator\n");
  1894. time_present = now_realtime_sec();
  1895. for (i = 0 ; i < DSET_CHARTS ; ++i) {
  1896. thread_info[i]->host = host;
  1897. thread_info[i]->chartname = "random";
  1898. thread_info[i]->dset_charts = DSET_CHARTS;
  1899. thread_info[i]->chart_i = i;
  1900. thread_info[i]->dset_dims = DSET_DIMS;
  1901. thread_info[i]->history_seconds = history_seconds;
  1902. thread_info[i]->time_present = time_present;
  1903. thread_info[i]->time_max = 0;
  1904. thread_info[i]->done = 0;
  1905. completion_init(&thread_info[i]->charts_initialized);
  1906. assert(0 == uv_thread_create(&thread_info[i]->thread, generate_dbengine_chart, thread_info[i]));
  1907. completion_wait_for(&thread_info[i]->charts_initialized);
  1908. completion_destroy(&thread_info[i]->charts_initialized);
  1909. }
  1910. for (i = 0 ; i < DSET_CHARTS ; ++i) {
  1911. assert(0 == uv_thread_join(&thread_info[i]->thread));
  1912. }
  1913. for (i = 0 ; i < DSET_CHARTS ; ++i) {
  1914. freez(thread_info[i]);
  1915. }
  1916. freez(thread_info);
  1917. rrd_wrlock();
  1918. rrdhost_free(host);
  1919. rrd_unlock();
  1920. }
  1921. struct dbengine_query_thread {
  1922. uv_thread_t thread;
  1923. RRDHOST *host;
  1924. char *chartname; /* Will be prefixed by type, e.g. "example_local1.", "example_local2." etc */
  1925. unsigned dset_charts; /* number of charts */
  1926. unsigned dset_dims; /* dimensions per chart */
  1927. time_t time_present; /* current virtual time of the benchmark */
  1928. unsigned history_seconds; /* how far back in the past to go */
  1929. volatile long done; /* initialize to 0, set to 1 to stop thread */
  1930. unsigned long errors, queries_nr, queried_metrics_nr; /* statistics */
  1931. uint8_t delete_old_data; /* if non zero then data are deleted when disk space is exhausted */
  1932. struct dbengine_chart_thread *chart_threads[]; /* dset_charts elements */
  1933. };
  1934. static void query_dbengine_chart(void *arg)
  1935. {
  1936. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  1937. struct dbengine_query_thread *thread_info = (struct dbengine_query_thread *)arg;
  1938. const int DSET_CHARTS = thread_info->dset_charts;
  1939. const int DSET_DIMS = thread_info->dset_dims;
  1940. time_t time_after, time_before, time_min, time_approx_min, time_max, duration;
  1941. int i, j, update_every = 1;
  1942. RRDSET *st;
  1943. RRDDIM *rd;
  1944. uint8_t same;
  1945. time_t time_now, time_retrieved, end_time;
  1946. collected_number generatedv;
  1947. NETDATA_DOUBLE value, expected;
  1948. struct rrddim_query_handle handle;
  1949. size_t value_errors = 0, time_errors = 0;
  1950. do {
  1951. // pick a chart and dimension
  1952. i = random() % DSET_CHARTS;
  1953. st = thread_info->chart_threads[i]->st;
  1954. j = random() % DSET_DIMS;
  1955. rd = thread_info->chart_threads[i]->rd[j];
  1956. time_min = thread_info->time_present - thread_info->history_seconds + 1;
  1957. time_max = thread_info->chart_threads[i]->time_max;
  1958. if (thread_info->delete_old_data) {
  1959. /* A time window of twice the disk space is sufficient for compression space savings of up to 50% */
  1960. time_approx_min = time_max - (default_rrdeng_disk_quota_mb * 2 * 1024 * 1024) /
  1961. (((uint64_t) DSET_DIMS * DSET_CHARTS) * sizeof(storage_number));
  1962. time_min = MAX(time_min, time_approx_min);
  1963. }
  1964. if (!time_max) {
  1965. time_before = time_after = time_min;
  1966. } else {
  1967. time_after = time_min + random() % (MAX(time_max - time_min, 1));
  1968. duration = random() % 3600;
  1969. time_before = MIN(time_after + duration, time_max); /* up to 1 hour queries */
  1970. }
  1971. rd->tiers[0]->query_ops.init(rd->tiers[0]->db_metric_handle, &handle, time_after, time_before, TIER_QUERY_FETCH_SUM);
  1972. ++thread_info->queries_nr;
  1973. for (time_now = time_after ; time_now <= time_before ; time_now += update_every) {
  1974. generatedv = generate_dbengine_chart_value(i, j, time_now);
  1975. expected = unpack_storage_number(pack_storage_number((NETDATA_DOUBLE) generatedv, SN_DEFAULT_FLAGS));
  1976. if (unlikely(rd->tiers[0]->query_ops.is_finished(&handle))) {
  1977. if (!thread_info->delete_old_data) { /* data validation only when we don't delete */
  1978. fprintf(stderr, " DB-engine stresstest %s/%s: at %lu secs, expecting value " NETDATA_DOUBLE_FORMAT
  1979. ", found data gap, ### E R R O R ###\n",
  1980. st->name, rd->name, (unsigned long) time_now, expected);
  1981. ++thread_info->errors;
  1982. }
  1983. break;
  1984. }
  1985. STORAGE_POINT sp = rd->tiers[0]->query_ops.next_metric(&handle);
  1986. value = sp.sum;
  1987. time_retrieved = sp.start_time;
  1988. end_time = sp.end_time;
  1989. if (!netdata_double_isnumber(value)) {
  1990. if (!thread_info->delete_old_data) { /* data validation only when we don't delete */
  1991. fprintf(stderr, " DB-engine stresstest %s/%s: at %lu secs, expecting value " NETDATA_DOUBLE_FORMAT
  1992. ", found data gap, ### E R R O R ###\n",
  1993. st->name, rd->name, (unsigned long) time_now, expected);
  1994. ++thread_info->errors;
  1995. }
  1996. break;
  1997. }
  1998. ++thread_info->queried_metrics_nr;
  1999. same = (roundndd(value) == roundndd(expected)) ? 1 : 0;
  2000. if (!same) {
  2001. if (!thread_info->delete_old_data) { /* data validation only when we don't delete */
  2002. if(!value_errors)
  2003. fprintf(stderr, " DB-engine stresstest %s/%s: at %lu secs, expecting value " NETDATA_DOUBLE_FORMAT
  2004. ", found " NETDATA_DOUBLE_FORMAT ", ### E R R O R ###\n",
  2005. st->name, rd->name, (unsigned long) time_now, expected, value);
  2006. value_errors++;
  2007. thread_info->errors++;
  2008. }
  2009. }
  2010. if (end_time != time_now) {
  2011. if (!thread_info->delete_old_data) { /* data validation only when we don't delete */
  2012. if(!time_errors)
  2013. fprintf(stderr,
  2014. " DB-engine stresstest %s/%s: at %lu secs, found timestamp %lu ### E R R O R ###\n",
  2015. st->name, rd->name, (unsigned long) time_now, (unsigned long) time_retrieved);
  2016. time_errors++;
  2017. thread_info->errors++;
  2018. }
  2019. }
  2020. }
  2021. rd->tiers[0]->query_ops.finalize(&handle);
  2022. } while(!thread_info->done);
  2023. if(value_errors)
  2024. fprintf(stderr, "%zu value errors encountered\n", value_errors);
  2025. if(time_errors)
  2026. fprintf(stderr, "%zu time errors encountered\n", time_errors);
  2027. }
  2028. void dbengine_stress_test(unsigned TEST_DURATION_SEC, unsigned DSET_CHARTS, unsigned QUERY_THREADS,
  2029. unsigned RAMP_UP_SECONDS, unsigned PAGE_CACHE_MB, unsigned DISK_SPACE_MB)
  2030. {
  2031. fprintf(stderr, "%s() running...\n", __FUNCTION__ );
  2032. const unsigned DSET_DIMS = 128;
  2033. const uint64_t EXPECTED_COMPRESSION_RATIO = 20;
  2034. const unsigned HISTORY_SECONDS = 3600 * 24 * 365 * 50; /* 50 year of history */
  2035. RRDHOST *host = NULL;
  2036. struct dbengine_chart_thread **chart_threads;
  2037. struct dbengine_query_thread **query_threads;
  2038. unsigned i, j;
  2039. time_t time_start, test_duration;
  2040. error_log_limit_unlimited();
  2041. if (!TEST_DURATION_SEC)
  2042. TEST_DURATION_SEC = 10;
  2043. if (!DSET_CHARTS)
  2044. DSET_CHARTS = 1;
  2045. if (!QUERY_THREADS)
  2046. QUERY_THREADS = 1;
  2047. if (PAGE_CACHE_MB < RRDENG_MIN_PAGE_CACHE_SIZE_MB)
  2048. PAGE_CACHE_MB = RRDENG_MIN_PAGE_CACHE_SIZE_MB;
  2049. default_rrd_memory_mode = RRD_MEMORY_MODE_DBENGINE;
  2050. default_rrdeng_page_cache_mb = PAGE_CACHE_MB;
  2051. if (DISK_SPACE_MB) {
  2052. fprintf(stderr, "By setting disk space limit data are allowed to be deleted. "
  2053. "Data validation is turned off for this run.\n");
  2054. default_rrdeng_disk_quota_mb = DISK_SPACE_MB;
  2055. } else {
  2056. // Worst case for uncompressible data
  2057. default_rrdeng_disk_quota_mb =
  2058. (((uint64_t) DSET_DIMS * DSET_CHARTS) * sizeof(storage_number) * HISTORY_SECONDS) / (1024 * 1024);
  2059. default_rrdeng_disk_quota_mb -= default_rrdeng_disk_quota_mb * EXPECTED_COMPRESSION_RATIO / 100;
  2060. }
  2061. fprintf(stderr, "Initializing localhost with hostname 'dbengine-stress-test'\n");
  2062. (void) sql_init_database(DB_CHECK_NONE, 1);
  2063. host = dbengine_rrdhost_find_or_create("dbengine-stress-test");
  2064. if (NULL == host)
  2065. return;
  2066. chart_threads = mallocz(sizeof(*chart_threads) * DSET_CHARTS);
  2067. for (i = 0 ; i < DSET_CHARTS ; ++i) {
  2068. chart_threads[i] = mallocz(sizeof(*chart_threads[i]) + sizeof(RRDDIM *) * DSET_DIMS);
  2069. }
  2070. query_threads = mallocz(sizeof(*query_threads) * QUERY_THREADS);
  2071. for (i = 0 ; i < QUERY_THREADS ; ++i) {
  2072. query_threads[i] = mallocz(sizeof(*query_threads[i]) + sizeof(struct dbengine_chart_thread *) * DSET_CHARTS);
  2073. }
  2074. fprintf(stderr, "\nRunning DB-engine stress test, %u seconds writers ramp-up time,\n"
  2075. "%u seconds of concurrent readers and writers, %u writer threads, %u reader threads,\n"
  2076. "%u MiB of page cache.\n",
  2077. RAMP_UP_SECONDS, TEST_DURATION_SEC, DSET_CHARTS, QUERY_THREADS, PAGE_CACHE_MB);
  2078. time_start = now_realtime_sec() + HISTORY_SECONDS; /* move history to the future */
  2079. for (i = 0 ; i < DSET_CHARTS ; ++i) {
  2080. chart_threads[i]->host = host;
  2081. chart_threads[i]->chartname = "random";
  2082. chart_threads[i]->dset_charts = DSET_CHARTS;
  2083. chart_threads[i]->chart_i = i;
  2084. chart_threads[i]->dset_dims = DSET_DIMS;
  2085. chart_threads[i]->history_seconds = HISTORY_SECONDS;
  2086. chart_threads[i]->time_present = time_start;
  2087. chart_threads[i]->time_max = 0;
  2088. chart_threads[i]->done = 0;
  2089. chart_threads[i]->errors = chart_threads[i]->stored_metrics_nr = 0;
  2090. completion_init(&chart_threads[i]->charts_initialized);
  2091. assert(0 == uv_thread_create(&chart_threads[i]->thread, generate_dbengine_chart, chart_threads[i]));
  2092. }
  2093. /* barrier so that subsequent queries can access valid chart data */
  2094. for (i = 0 ; i < DSET_CHARTS ; ++i) {
  2095. completion_wait_for(&chart_threads[i]->charts_initialized);
  2096. completion_destroy(&chart_threads[i]->charts_initialized);
  2097. }
  2098. sleep(RAMP_UP_SECONDS);
  2099. /* at this point data have already began being written to the database */
  2100. for (i = 0 ; i < QUERY_THREADS ; ++i) {
  2101. query_threads[i]->host = host;
  2102. query_threads[i]->chartname = "random";
  2103. query_threads[i]->dset_charts = DSET_CHARTS;
  2104. query_threads[i]->dset_dims = DSET_DIMS;
  2105. query_threads[i]->history_seconds = HISTORY_SECONDS;
  2106. query_threads[i]->time_present = time_start;
  2107. query_threads[i]->done = 0;
  2108. query_threads[i]->errors = query_threads[i]->queries_nr = query_threads[i]->queried_metrics_nr = 0;
  2109. for (j = 0 ; j < DSET_CHARTS ; ++j) {
  2110. query_threads[i]->chart_threads[j] = chart_threads[j];
  2111. }
  2112. query_threads[i]->delete_old_data = DISK_SPACE_MB ? 1 : 0;
  2113. assert(0 == uv_thread_create(&query_threads[i]->thread, query_dbengine_chart, query_threads[i]));
  2114. }
  2115. sleep(TEST_DURATION_SEC);
  2116. /* stop workload */
  2117. for (i = 0 ; i < DSET_CHARTS ; ++i) {
  2118. chart_threads[i]->done = 1;
  2119. }
  2120. for (i = 0 ; i < QUERY_THREADS ; ++i) {
  2121. query_threads[i]->done = 1;
  2122. }
  2123. for (i = 0 ; i < DSET_CHARTS ; ++i) {
  2124. assert(0 == uv_thread_join(&chart_threads[i]->thread));
  2125. }
  2126. for (i = 0 ; i < QUERY_THREADS ; ++i) {
  2127. assert(0 == uv_thread_join(&query_threads[i]->thread));
  2128. }
  2129. test_duration = now_realtime_sec() - (time_start - HISTORY_SECONDS);
  2130. if (!test_duration)
  2131. test_duration = 1;
  2132. fprintf(stderr, "\nDB-engine stress test finished in %ld seconds.\n", test_duration);
  2133. unsigned long stored_metrics_nr = 0;
  2134. for (i = 0 ; i < DSET_CHARTS ; ++i) {
  2135. stored_metrics_nr += chart_threads[i]->stored_metrics_nr;
  2136. }
  2137. unsigned long queried_metrics_nr = 0;
  2138. for (i = 0 ; i < QUERY_THREADS ; ++i) {
  2139. queried_metrics_nr += query_threads[i]->queried_metrics_nr;
  2140. }
  2141. fprintf(stderr, "%u metrics were stored (dataset size of %lu MiB) in %u charts by 1 writer thread per chart.\n",
  2142. DSET_CHARTS * DSET_DIMS, stored_metrics_nr * sizeof(storage_number) / (1024 * 1024), DSET_CHARTS);
  2143. fprintf(stderr, "Metrics were being generated per 1 emulated second and time was accelerated.\n");
  2144. fprintf(stderr, "%lu metric data points were queried by %u reader threads.\n", queried_metrics_nr, QUERY_THREADS);
  2145. fprintf(stderr, "Query starting time is randomly chosen from the beginning of the time-series up to the time of\n"
  2146. "the latest data point, and ending time from 1 second up to 1 hour after the starting time.\n");
  2147. fprintf(stderr, "Performance is %lu written data points/sec and %lu read data points/sec.\n",
  2148. stored_metrics_nr / test_duration, queried_metrics_nr / test_duration);
  2149. for (i = 0 ; i < DSET_CHARTS ; ++i) {
  2150. freez(chart_threads[i]);
  2151. }
  2152. freez(chart_threads);
  2153. for (i = 0 ; i < QUERY_THREADS ; ++i) {
  2154. freez(query_threads[i]);
  2155. }
  2156. freez(query_threads);
  2157. rrd_wrlock();
  2158. rrdeng_prepare_exit((struct rrdengine_instance *)host->storage_instance[0]);
  2159. rrdhost_delete_charts(host);
  2160. rrdeng_exit((struct rrdengine_instance *)host->storage_instance[0]);
  2161. rrd_unlock();
  2162. }
  2163. #endif