test_store_mdb.c 7.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301
  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[6].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, 1,
  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. int rc = LSUP_store_lookup(store, lut[i], &it, &ct);
  67. if (ct > 0) EXPECT_INT_EQ(rc, LSUP_OK);
  68. else if (ct == 0) EXPECT_INT_EQ(rc, LSUP_NORESULT);
  69. EXPECT_INT_EQ(ct, results[i]);
  70. }
  71. for (int i = 0; i < NUM_TRP; i++) {
  72. LSUP_buffer_done(ser_trp[i].s);
  73. LSUP_buffer_done(ser_trp[i].p);
  74. LSUP_buffer_done(ser_trp[i].o);
  75. }
  76. LSUP_store_free(store);
  77. free_triples(trp);
  78. return 0;
  79. }
  80. /** @brief Test quad store.
  81. *
  82. * Insert the same triple set twice with different contexts.
  83. */
  84. static int test_quad_store()
  85. {
  86. rmdb();
  87. EXPECT_PASS(LSUP_store_setup(&path));
  88. LSUP_Term *ctx1 = LSUP_uri_new("urn:c:1");
  89. LSUP_SerTerm sc1_s;
  90. LSUP_SerTerm *sc1 = &sc1_s;
  91. LSUP_term_serialize(ctx1, sc1);
  92. LSUP_MDBStore *store;
  93. store = LSUP_store_new(path, sc1); // quad store.
  94. ASSERT(store != NULL, "Error initializing store!");
  95. LSUP_Triple *trp = create_triples();
  96. LSUP_SerTerm sterms[NUM_TRP][3];
  97. LSUP_SerTriple ser_trp[NUM_TRP];
  98. for (int i = 0; i < NUM_TRP; i++) {
  99. ser_trp[i].s = sterms[i];
  100. ser_trp[i].p = sterms[i] + 1;
  101. ser_trp[i].o = sterms[i] + 2;
  102. for (int j = 0; j < 3; j++) {
  103. LSUP_term_serialize(
  104. LSUP_triple_term_by_pos(trp + i, j),
  105. LSUP_ser_triple_term_by_pos(ser_trp + i, j));
  106. }
  107. }
  108. // Only triples 0÷5 in default context.
  109. EXPECT_PASS(LSUP_store_add(store, NULL, ser_trp, 6));
  110. LSUP_Term *ctx2 = LSUP_uri_new("urn:c:2");
  111. LSUP_SerTerm sc2_s;
  112. LSUP_SerTerm *sc2 = &sc2_s;
  113. LSUP_term_serialize(ctx2, sc2);
  114. // Only triples 4÷9 in default context.
  115. EXPECT_PASS(LSUP_store_add(store, &sc2_s, ser_trp + 4, 6));
  116. // 6 triples in ctx1 + 6 in ctx2 - 2 duplicates
  117. EXPECT_INT_EQ(LSUP_store_size(store), 10);
  118. // Test lookups.
  119. // This context is not with any triple.
  120. LSUP_Term *ctx3 = LSUP_uri_new("urn:c:3");
  121. LSUP_SerTerm sc3_s;
  122. LSUP_SerTerm *sc3 = &sc3_s;
  123. LSUP_term_serialize(ctx2, &sc3_s);
  124. LSUP_SerTerm *lut[41][4] = {
  125. // Any context
  126. {NULL, NULL, NULL, NULL},
  127. {ser_trp[0].s, NULL, NULL, NULL},
  128. {NULL, ser_trp[0].p, NULL, NULL},
  129. {NULL, ser_trp[0].s, NULL, NULL},
  130. {NULL, NULL, ser_trp[6].o, NULL},
  131. {ser_trp[4].s, ser_trp[4].p, NULL, NULL},
  132. {NULL, ser_trp[7].p, ser_trp[7].o, NULL},
  133. {ser_trp[5].s, NULL, ser_trp[5].o, NULL},
  134. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, NULL},
  135. {ser_trp[2].s, ser_trp[4].p, ser_trp[5].o, NULL},
  136. // Context 1 (trp[0÷5])
  137. {NULL, NULL, NULL, sc1},
  138. {ser_trp[0].s, NULL, NULL, sc1},
  139. {ser_trp[2].s, NULL, NULL, sc1},
  140. {NULL, ser_trp[0].p, NULL, sc1},
  141. {NULL, ser_trp[6].p, NULL, sc1},
  142. {NULL, NULL, ser_trp[6].o, sc1},
  143. {ser_trp[4].s, ser_trp[4].p, NULL, sc1},
  144. {NULL, ser_trp[7].p, ser_trp[7].o, sc1},
  145. {ser_trp[5].s, NULL, ser_trp[5].o, sc1},
  146. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, sc1},
  147. {ser_trp[6].s, ser_trp[6].p, ser_trp[6].o, sc1},
  148. // Context 2 (trp[4÷9])
  149. {NULL, NULL, NULL, sc2},
  150. {ser_trp[0].s, NULL, NULL, sc2},
  151. {NULL, ser_trp[0].p, NULL, sc2},
  152. {NULL, ser_trp[0].s, NULL, sc2},
  153. {NULL, NULL, ser_trp[6].o, sc2},
  154. {ser_trp[4].s, ser_trp[4].p, NULL, sc2},
  155. {NULL, ser_trp[7].p, ser_trp[7].o, sc2},
  156. {ser_trp[5].s, NULL, ser_trp[5].o, sc2},
  157. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, sc2},
  158. {ser_trp[6].s, ser_trp[6].p, ser_trp[6].o, sc2},
  159. // Non-existing context
  160. {NULL, NULL, NULL, sc3},
  161. {ser_trp[0].s, NULL, NULL, sc3},
  162. {NULL, ser_trp[0].p, NULL, sc3},
  163. {NULL, ser_trp[0].s, NULL, sc3},
  164. {NULL, NULL, ser_trp[6].o, sc3},
  165. {ser_trp[4].s, ser_trp[4].p, NULL, sc3},
  166. {NULL, ser_trp[7].p, ser_trp[7].o, sc3},
  167. {ser_trp[5].s, NULL, ser_trp[5].o, sc3},
  168. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, sc3},
  169. {ser_trp[6].s, ser_trp[6].p, ser_trp[6].o, sc3},
  170. };
  171. size_t results[40] = {
  172. // NULL ctx
  173. 8,
  174. 5, 1, 0, 1,
  175. 2, 1, 2,
  176. 1, 0,
  177. // ctx1
  178. 6,
  179. 4, 1, 0, 0,
  180. 1, 0, 0,
  181. 1, 0,
  182. // ctx2
  183. 4,
  184. 3, 0, 0, 1,
  185. 2, 1, 1,
  186. 1, 1,
  187. // ctx3
  188. 0,
  189. 0, 0, 0, 0,
  190. 0, 0, 0,
  191. 0, 0,
  192. };
  193. for (int i = 0; i < 41; i++) {
  194. size_t ct;
  195. LSUP_MDBIterator *it;
  196. printf("Testing triple lookup #%d: {", i);
  197. if(lut[i][0]) LSUP_buffer_print(lut[i][0]);
  198. else printf("NULL");
  199. printf(" ");
  200. if(lut[i][1]) LSUP_buffer_print(lut[i][1]);
  201. else printf("NULL");
  202. printf(" ");
  203. if(lut[i][2]) LSUP_buffer_print(lut[i][2]);
  204. else printf("NULL");
  205. printf(" ");
  206. if(lut[i][3]) LSUP_buffer_print(lut[i][3]);
  207. else printf("NULL");
  208. printf("}\n");
  209. int rc = LSUP_store_lookup(store, lut[i], &it, &ct);
  210. if (ct > 0) EXPECT_INT_EQ(rc, LSUP_OK);
  211. else if (ct == 0) EXPECT_INT_EQ(rc, LSUP_NORESULT);
  212. EXPECT_INT_EQ(ct, results[i]);
  213. }
  214. for (int i = 0; i < NUM_TRP; i++) {
  215. LSUP_buffer_done(ser_trp[i].s);
  216. LSUP_buffer_done(ser_trp[i].p);
  217. LSUP_buffer_done(ser_trp[i].o);
  218. }
  219. LSUP_term_free(ctx1);
  220. LSUP_term_free(ctx2);
  221. LSUP_buffer_done(&sc1_s);
  222. LSUP_buffer_done(&sc2_s);
  223. free_triples(trp);
  224. LSUP_store_free(store);
  225. return 0;
  226. }
  227. int store_mdb_test()
  228. {
  229. RUN(test_triple_store);
  230. RUN(test_quad_store);
  231. return 0;
  232. }