test_store_mdb.c 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265
  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. size_t ct;
  43. LSUP_SerTerm *lut[12][4] = {
  44. {NULL, NULL, NULL, NULL},
  45. {ser_trp[0].s, NULL, NULL, NULL},
  46. {ser_trp[2].s, NULL, NULL, ser_trp[2].s},
  47. {NULL, ser_trp[0].p, NULL, NULL},
  48. {NULL, ser_trp[0].s, NULL, NULL},
  49. {NULL, NULL, ser_trp[6].o, NULL},
  50. {ser_trp[4].s, ser_trp[4].p, NULL, NULL},
  51. {NULL, ser_trp[7].p, ser_trp[7].o, NULL},
  52. {ser_trp[5].s, NULL, ser_trp[5].o, NULL},
  53. {ser_trp[6].s, NULL, ser_trp[5].o, ser_trp[2].s},
  54. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, NULL},
  55. {ser_trp[4].s, ser_trp[4].p, ser_trp[5].o, NULL},
  56. };
  57. size_t results[12] = {
  58. 8,
  59. 5, 1, 1, 0, 1,
  60. 2, 1, 2, 0,
  61. 1, 0,
  62. };
  63. for (int i = 0; i < 8; i++) {
  64. TRACE("Testing triple lookup #%d.\n", i);
  65. int rc = LSUP_store_lookup(store, lut[i], &ct, NULL, NULL);
  66. if (ct > 0) EXPECT_INT_EQ(rc, LSUP_OK);
  67. else if (ct == 0) EXPECT_INT_EQ(rc, LSUP_NORESULT);
  68. EXPECT_INT_EQ(ct, results[i]);
  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_term_serialize(ctx1, &sc1_s);
  90. LSUP_MDBStore *store;
  91. store = LSUP_store_new(path, &sc1_s); // quad store.
  92. ASSERT(store != NULL, "Error initializing store!");
  93. LSUP_Triple *trp = create_triples();
  94. LSUP_SerTerm sterms[NUM_TRP][3];
  95. LSUP_SerTriple ser_trp[NUM_TRP];
  96. for (int i = 0; i < NUM_TRP; i++) {
  97. ser_trp[i].s = sterms[i];
  98. ser_trp[i].p = sterms[i] + 1;
  99. ser_trp[i].o = sterms[i] + 2;
  100. for (int j = 0; j < 3; j++) {
  101. LSUP_term_serialize(
  102. LSUP_triple_term_by_pos(trp + i, j),
  103. LSUP_ser_triple_term_by_pos(ser_trp + i, j));
  104. }
  105. }
  106. // Only triples 0÷5 in default context.
  107. EXPECT_PASS(LSUP_store_add(store, NULL, ser_trp, 6));
  108. LSUP_Term *ctx2 = LSUP_uri_new("urn:c:2");
  109. LSUP_SerTerm sc2_s;
  110. LSUP_term_serialize(ctx2, &sc2_s);
  111. // Only triples 4÷9 in default context.
  112. EXPECT_PASS(LSUP_store_add(store, &sc2_s, ser_trp + 4, 6));
  113. // 6 triples in ctx1 + 6 in ctx2 - 2 duplicates
  114. EXPECT_INT_EQ(LSUP_store_size(store), 10);
  115. // Test lookups.
  116. // This context is not with any triple.
  117. LSUP_Term *ctx3 = LSUP_uri_new("urn:c:3");
  118. LSUP_SerTerm sc3_s;
  119. LSUP_term_serialize(ctx2, &sc3_s);
  120. size_t ct;
  121. LSUP_SerTerm *lut[12][4] = {
  122. // No context
  123. {NULL, NULL, NULL, NULL},
  124. {ser_trp[0].s, NULL, NULL, NULL},
  125. {ser_trp[2].s, NULL, NULL, ser_trp[2].s},
  126. {NULL, ser_trp[0].p, NULL, NULL},
  127. {NULL, ser_trp[0].s, NULL, NULL},
  128. {NULL, NULL, ser_trp[6].o, NULL},
  129. {ser_trp[4].s, ser_trp[4].p, NULL, NULL},
  130. {NULL, ser_trp[7].p, ser_trp[7].o, NULL},
  131. {ser_trp[5].s, NULL, ser_trp[5].o, NULL},
  132. {ser_trp[6].s, NULL, ser_trp[5].o, ser_trp[2].s},
  133. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, NULL},
  134. {ser_trp[4].s, ser_trp[4].p, ser_trp[5].o, NULL},
  135. // Context 1
  136. {NULL, NULL, NULL, NULL},
  137. {ser_trp[0].s, NULL, NULL, NULL},
  138. {ser_trp[2].s, NULL, NULL, ser_trp[2].s},
  139. {NULL, ser_trp[0].p, NULL, NULL},
  140. {NULL, ser_trp[0].s, NULL, NULL},
  141. {NULL, NULL, ser_trp[6].o, NULL},
  142. {ser_trp[4].s, ser_trp[4].p, NULL, NULL},
  143. {NULL, ser_trp[7].p, ser_trp[7].o, NULL},
  144. {ser_trp[5].s, NULL, ser_trp[5].o, NULL},
  145. {ser_trp[6].s, NULL, ser_trp[5].o, ser_trp[2].s},
  146. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, NULL},
  147. {ser_trp[4].s, ser_trp[4].p, ser_trp[5].o, NULL},
  148. // Context 2
  149. {NULL, NULL, NULL, NULL},
  150. {ser_trp[0].s, NULL, NULL, NULL},
  151. {ser_trp[2].s, NULL, NULL, ser_trp[2].s},
  152. {NULL, ser_trp[0].p, NULL, NULL},
  153. {NULL, ser_trp[0].s, NULL, NULL},
  154. {NULL, NULL, ser_trp[6].o, NULL},
  155. {ser_trp[4].s, ser_trp[4].p, NULL, NULL},
  156. {NULL, ser_trp[7].p, ser_trp[7].o, NULL},
  157. {ser_trp[5].s, NULL, ser_trp[5].o, NULL},
  158. {ser_trp[6].s, NULL, ser_trp[5].o, ser_trp[2].s},
  159. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, NULL},
  160. {ser_trp[4].s, ser_trp[4].p, ser_trp[5].o, NULL},
  161. // Non-existing context
  162. {NULL, NULL, NULL, NULL},
  163. {ser_trp[0].s, NULL, NULL, NULL},
  164. {ser_trp[2].s, NULL, NULL, ser_trp[2].s},
  165. {NULL, ser_trp[0].p, NULL, NULL},
  166. {NULL, ser_trp[0].s, NULL, NULL},
  167. {NULL, NULL, ser_trp[6].o, NULL},
  168. {ser_trp[4].s, ser_trp[4].p, NULL, NULL},
  169. {NULL, ser_trp[7].p, ser_trp[7].o, NULL},
  170. {ser_trp[5].s, NULL, ser_trp[5].o, NULL},
  171. {ser_trp[6].s, NULL, ser_trp[5].o, ser_trp[2].s},
  172. {ser_trp[4].s, ser_trp[4].p, ser_trp[4].o, NULL},
  173. {ser_trp[4].s, ser_trp[4].p, ser_trp[5].o, NULL},
  174. };
  175. size_t results[12] = {
  176. 8,
  177. 5, 1, 1, 0, 1,
  178. 2, 1, 2, 0,
  179. 1, 0,
  180. };
  181. for (int i = 0; i < 8; i++) {
  182. TRACE("Testing triple lookup #%d.\n", i);
  183. int rc = LSUP_store_lookup(store, lut[i], &ct, NULL, NULL);
  184. if (ct > 0) EXPECT_INT_EQ(rc, LSUP_OK);
  185. else if (ct == 0) EXPECT_INT_EQ(rc, LSUP_NORESULT);
  186. EXPECT_INT_EQ(ct, results[i]);
  187. }
  188. for (int i = 0; i < NUM_TRP; i++) {
  189. LSUP_buffer_done(ser_trp[i].s);
  190. LSUP_buffer_done(ser_trp[i].p);
  191. LSUP_buffer_done(ser_trp[i].o);
  192. }
  193. LSUP_term_free(ctx1);
  194. LSUP_term_free(ctx2);
  195. LSUP_buffer_done(&sc1_s);
  196. LSUP_buffer_done(&sc2_s);
  197. free_triples(trp);
  198. LSUP_store_free(store);
  199. return 0;
  200. }
  201. int store_mdb_test()
  202. {
  203. RUN(test_triple_store);
  204. RUN(test_quad_store);
  205. return 0;
  206. }