test_store_mdb.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300
  1. #include "test.h"
  2. #include "store_mdb.h"
  3. #include "assets.h"
  4. static char *path = "/tmp/testdb";
  5. static void rmdb() {
  6. char data_path[32], lock_path[32];
  7. sprintf(data_path, "%s/data.mdb", path);
  8. sprintf(lock_path, "%s/lock.mdb", path);
  9. printf("Removing %s\n", data_path);
  10. remove(data_path);
  11. printf("Removing %s\n", lock_path);
  12. remove(lock_path);
  13. printf("Removing %s\n", path);
  14. remove(path);
  15. }
  16. /** @brief Test triple store.
  17. */
  18. static int test_triple_store()
  19. {
  20. rmdb();
  21. EXPECT_PASS(LSUP_store_setup(&path));
  22. LSUP_MDBStore *store;
  23. store = LSUP_store_new(path, NULL); // triple store.
  24. ASSERT(store != NULL, "Error initializing store!");
  25. LSUP_Triple *trp = create_triples();
  26. LSUP_SerTerm sterms[NUM_TRP][3];
  27. LSUP_SerTriple ser_trp[NUM_TRP];
  28. for (int i = 0; i < NUM_TRP; i++) {
  29. ser_trp[i].s = sterms[i];
  30. ser_trp[i].p = sterms[i] + 1;
  31. ser_trp[i].o = sterms[i] + 2;
  32. for (int j = 0; j < 3; j++) {
  33. LSUP_term_serialize(
  34. LSUP_triple_term_by_pos(trp + i, j),
  35. LSUP_ser_triple_term_by_pos(ser_trp + i, j));
  36. }
  37. }
  38. // Test adding.
  39. EXPECT_PASS(LSUP_store_add(store, NULL, ser_trp, NUM_TRP));
  40. EXPECT_INT_EQ(LSUP_store_size(store), 8);
  41. // Test lookups.
  42. LSUP_SerTerm *lut[12][4] = {
  43. {NULL, NULL, NULL, NULL},
  44. {ser_trp[0].s, NULL, NULL, NULL},
  45. {ser_trp[2].s, NULL, NULL, ser_trp[2].s},
  46. {NULL, ser_trp[0].p, NULL, NULL},
  47. {NULL, ser_trp[0].s, NULL, NULL},
  48. {NULL, NULL, ser_trp[6].o, NULL},
  49. {ser_trp[4].s, ser_trp[4].p, NULL, NULL},
  50. {NULL, ser_trp[7].p, ser_trp[7].o, NULL},
  51. {ser_trp[5].s, NULL, ser_trp[5].o, NULL},
  52. {ser_trp[5].s, NULL, ser_trp[5].o, ser_trp[2].s},
  53. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, NULL},
  54. {ser_trp[4].s, ser_trp[4].p, ser_trp[6].o, NULL},
  55. };
  56. size_t results[12] = {
  57. 8,
  58. 5, 1, 1, 0, 1,
  59. 2, 1, 2, 2,
  60. 1, 0,
  61. };
  62. for (int i = 0; i < 12; i++) {
  63. size_t ct;
  64. LSUP_MDBIterator *it;
  65. TRACE("Testing triple lookup #%d.\n", i);
  66. EXPECT_PASS(LSUP_store_lookup(store, lut[i], &it, &ct));
  67. EXPECT_INT_EQ(ct, results[i]);
  68. LSUP_store_it_free(it);
  69. }
  70. for (int i = 0; i < NUM_TRP; i++) {
  71. LSUP_buffer_done(ser_trp[i].s);
  72. LSUP_buffer_done(ser_trp[i].p);
  73. LSUP_buffer_done(ser_trp[i].o);
  74. }
  75. LSUP_store_free(store);
  76. free_triples(trp);
  77. return 0;
  78. }
  79. /** @brief Test quad store.
  80. *
  81. * Insert the same triple set twice with different contexts.
  82. */
  83. static int test_quad_store()
  84. {
  85. rmdb();
  86. EXPECT_PASS(LSUP_store_setup(&path));
  87. LSUP_Term *ctx1 = LSUP_uri_new("urn:c:1");
  88. LSUP_SerTerm sc1_s;
  89. LSUP_SerTerm *sc1 = &sc1_s;
  90. LSUP_term_serialize(ctx1, sc1);
  91. LSUP_MDBStore *store;
  92. store = LSUP_store_new(path, sc1); // quad store.
  93. ASSERT(store != NULL, "Error initializing store!");
  94. LSUP_Triple *trp = create_triples();
  95. LSUP_SerTerm sterms[NUM_TRP][3];
  96. LSUP_SerTriple ser_trp[NUM_TRP];
  97. for (int i = 0; i < NUM_TRP; i++) {
  98. ser_trp[i].s = sterms[i];
  99. ser_trp[i].p = sterms[i] + 1;
  100. ser_trp[i].o = sterms[i] + 2;
  101. for (int j = 0; j < 3; j++) {
  102. LSUP_term_serialize(
  103. LSUP_triple_term_by_pos(trp + i, j),
  104. LSUP_ser_triple_term_by_pos(ser_trp + i, j));
  105. }
  106. }
  107. // Only triples 0÷5 in default context.
  108. EXPECT_PASS(LSUP_store_add(store, NULL, ser_trp, 6));
  109. LSUP_Term *ctx2 = LSUP_uri_new("urn:c:2");
  110. LSUP_SerTerm sc2_s;
  111. LSUP_SerTerm *sc2 = &sc2_s;
  112. LSUP_term_serialize(ctx2, sc2);
  113. // Only triples 4÷9 in default context.
  114. EXPECT_PASS(LSUP_store_add(store, &sc2_s, ser_trp + 4, 6));
  115. // 6 triples in ctx1 + 6 in ctx2 - 2 duplicates
  116. EXPECT_INT_EQ(LSUP_store_size(store), 10);
  117. // Test lookups.
  118. // This context is not with any triple.
  119. LSUP_Term *ctx3 = LSUP_uri_new("urn:c:3");
  120. LSUP_SerTerm sc3_s;
  121. LSUP_SerTerm *sc3 = &sc3_s;
  122. LSUP_term_serialize(ctx3, &sc3_s);
  123. LSUP_SerTerm *lut[41][4] = {
  124. // Any context
  125. {NULL, NULL, NULL, NULL}, // #0
  126. {ser_trp[0].s, NULL, NULL, NULL}, // #1
  127. {NULL, ser_trp[0].p, NULL, NULL}, // #2
  128. {NULL, ser_trp[0].s, NULL, NULL}, // #3
  129. {NULL, NULL, ser_trp[6].o, NULL}, // #4
  130. {ser_trp[4].s, ser_trp[4].p, NULL, NULL}, // #5
  131. {NULL, ser_trp[7].p, ser_trp[7].o, NULL}, // #6
  132. {ser_trp[5].s, NULL, ser_trp[5].o, NULL}, // #7
  133. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, NULL}, // #8
  134. {ser_trp[2].s, ser_trp[4].p, ser_trp[5].o, NULL}, // #9
  135. // Context 1 (trp[0÷5])
  136. {NULL, NULL, NULL, sc1}, // #10
  137. {ser_trp[0].s, NULL, NULL, sc1}, // #11
  138. {ser_trp[2].s, NULL, NULL, sc1}, // #12
  139. {NULL, ser_trp[0].p, NULL, sc1}, // #13
  140. {NULL, ser_trp[6].p, NULL, sc1}, // #14
  141. {NULL, NULL, ser_trp[6].o, sc1}, // #15
  142. {ser_trp[4].s, ser_trp[4].p, NULL, sc1}, // #16
  143. {NULL, ser_trp[7].p, ser_trp[7].o, sc1}, // #17
  144. {ser_trp[5].s, NULL, ser_trp[5].o, sc1}, // #18
  145. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, sc1}, // #19
  146. {ser_trp[6].s, ser_trp[6].p, ser_trp[6].o, sc1}, // #20
  147. // Context 2 (trp[4÷9])
  148. {NULL, NULL, NULL, sc2}, // #21
  149. {ser_trp[0].s, NULL, NULL, sc2}, // #22
  150. {NULL, ser_trp[0].p, NULL, sc2}, // #23
  151. {NULL, ser_trp[0].s, NULL, sc2}, // #24
  152. {NULL, NULL, ser_trp[6].o, sc2}, // #25
  153. {ser_trp[4].s, ser_trp[4].p, NULL, sc2}, // #26
  154. {NULL, ser_trp[7].p, ser_trp[7].o, sc2}, // #27
  155. {ser_trp[5].s, NULL, ser_trp[5].o, sc2}, // #28
  156. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, sc2}, // #29
  157. {ser_trp[6].s, ser_trp[6].p, ser_trp[6].o, sc2}, // #30
  158. // Non-existing context
  159. {NULL, NULL, NULL, sc3}, // #31
  160. {ser_trp[0].s, NULL, NULL, sc3}, // #32
  161. {NULL, ser_trp[0].p, NULL, sc3}, // #33
  162. {NULL, ser_trp[0].s, NULL, sc3}, // #34
  163. {NULL, NULL, ser_trp[6].o, sc3}, // #35
  164. {ser_trp[4].s, ser_trp[4].p, NULL, sc3}, // #36
  165. {NULL, ser_trp[7].p, ser_trp[7].o, sc3}, // #37
  166. {ser_trp[5].s, NULL, ser_trp[5].o, sc3}, // #38
  167. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, sc3}, // #39
  168. {ser_trp[6].s, ser_trp[6].p, ser_trp[6].o, sc3}, // #40
  169. };
  170. size_t results[41] = {
  171. // NULL ctx
  172. 8, // #0
  173. 5, 1, 0, 1, // #1-#4
  174. 2, 1, 2, // #5-#7
  175. 1, 0, // #8-#9
  176. // ctx1
  177. 6, // #10
  178. 4, 1, 1, 0, 0, // #11-#15
  179. 1, 0, 1, // #16-#18
  180. 1, 0, // #19-#20
  181. // ctx2
  182. 4, // #21
  183. 3, 0, 0, 1, // #22-#25
  184. 2, 1, 2, // #26-#28
  185. 1, 1, // #29-#30
  186. // ctx3
  187. 0, // #31-#32
  188. 0, 0, 0, 0, // #33-#36
  189. 0, 0, 0, // #37-#39
  190. 0, 0, // #40
  191. };
  192. for (int i = 0; i < 41; i++) {
  193. size_t ct;
  194. LSUP_MDBIterator *it;
  195. printf("Testing triple lookup #%d: {", i);
  196. if(lut[i][0]) LSUP_buffer_print(lut[i][0]);
  197. else printf("NULL");
  198. printf(" ");
  199. if(lut[i][1]) LSUP_buffer_print(lut[i][1]);
  200. else printf("NULL");
  201. printf(" ");
  202. if(lut[i][2]) LSUP_buffer_print(lut[i][2]);
  203. else printf("NULL");
  204. printf(" ");
  205. if(lut[i][3]) LSUP_buffer_print(lut[i][3]);
  206. else printf("NULL");
  207. printf("}\n");
  208. EXPECT_PASS(LSUP_store_lookup(store, lut[i], &it, &ct));
  209. EXPECT_INT_EQ(ct, results[i]);
  210. LSUP_store_it_free(it);
  211. }
  212. for (int i = 0; i < NUM_TRP; i++) {
  213. LSUP_buffer_done(ser_trp[i].s);
  214. LSUP_buffer_done(ser_trp[i].p);
  215. LSUP_buffer_done(ser_trp[i].o);
  216. }
  217. LSUP_term_free(ctx1);
  218. LSUP_term_free(ctx2);
  219. LSUP_buffer_done(&sc1_s);
  220. LSUP_buffer_done(&sc2_s);
  221. free_triples(trp);
  222. LSUP_store_free(store);
  223. return 0;
  224. }
  225. int store_mdb_test()
  226. {
  227. RUN(test_triple_store);
  228. RUN(test_quad_store);
  229. return 0;
  230. }