mtest4.c 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168
  1. /* mtest4.c - memory-mapped database tester/toy */
  2. /*
  3. * Copyright 2011-2021 Howard Chu, Symas Corp.
  4. * All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted only as authorized by the OpenLDAP
  8. * Public License.
  9. *
  10. * A copy of this license is available in the file LICENSE in the
  11. * top-level directory of the distribution or, alternatively, at
  12. * <http://www.OpenLDAP.org/license.html>.
  13. */
  14. /* Tests for sorted duplicate DBs with fixed-size keys */
  15. #include <stdio.h>
  16. #include <stdlib.h>
  17. #include <string.h>
  18. #include <time.h>
  19. #include "lmdb.h"
  20. #define E(expr) CHECK((rc = (expr)) == MDB_SUCCESS, #expr)
  21. #define RES(err, expr) ((rc = expr) == (err) || (CHECK(!rc, #expr), 0))
  22. #define CHECK(test, msg) ((test) ? (void)0 : ((void)fprintf(stderr, \
  23. "%s:%d: %s: %s\n", __FILE__, __LINE__, msg, mdb_strerror(rc)), abort()))
  24. int main(int argc,char * argv[])
  25. {
  26. int i = 0, j = 0, rc;
  27. MDB_env *env;
  28. MDB_dbi dbi;
  29. MDB_val key, data;
  30. MDB_txn *txn;
  31. MDB_stat mst;
  32. MDB_cursor *cursor;
  33. int count;
  34. int *values;
  35. char sval[8];
  36. char kval[sizeof(int)];
  37. memset(sval, 0, sizeof(sval));
  38. count = 510;
  39. values = (int *)malloc(count*sizeof(int));
  40. for(i = 0;i<count;i++) {
  41. values[i] = i*5;
  42. }
  43. E(mdb_env_create(&env));
  44. E(mdb_env_set_mapsize(env, 10485760));
  45. E(mdb_env_set_maxdbs(env, 4));
  46. E(mdb_env_open(env, "./testdb", MDB_FIXEDMAP|MDB_NOSYNC, 0664));
  47. E(mdb_txn_begin(env, NULL, 0, &txn));
  48. E(mdb_dbi_open(txn, "id4", MDB_CREATE|MDB_DUPSORT|MDB_DUPFIXED, &dbi));
  49. key.mv_size = sizeof(int);
  50. key.mv_data = kval;
  51. data.mv_size = sizeof(sval);
  52. data.mv_data = sval;
  53. printf("Adding %d values\n", count);
  54. strcpy(kval, "001");
  55. for (i=0;i<count;i++) {
  56. sprintf(sval, "%07x", values[i]);
  57. if (RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NODUPDATA)))
  58. j++;
  59. }
  60. if (j) printf("%d duplicates skipped\n", j);
  61. E(mdb_txn_commit(txn));
  62. E(mdb_env_stat(env, &mst));
  63. /* there should be one full page of dups now.
  64. */
  65. E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
  66. E(mdb_cursor_open(txn, dbi, &cursor));
  67. while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
  68. printf("key: %p %.*s, data: %p %.*s\n",
  69. key.mv_data, (int) key.mv_size, (char *) key.mv_data,
  70. data.mv_data, (int) data.mv_size, (char *) data.mv_data);
  71. }
  72. CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
  73. mdb_cursor_close(cursor);
  74. mdb_txn_abort(txn);
  75. /* test all 3 branches of split code:
  76. * 1: new key in lower half
  77. * 2: new key at split point
  78. * 3: new key in upper half
  79. */
  80. key.mv_size = sizeof(int);
  81. key.mv_data = kval;
  82. data.mv_size = sizeof(sval);
  83. data.mv_data = sval;
  84. sprintf(sval, "%07x", values[3]+1);
  85. E(mdb_txn_begin(env, NULL, 0, &txn));
  86. (void)RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NODUPDATA));
  87. mdb_txn_abort(txn);
  88. sprintf(sval, "%07x", values[255]+1);
  89. E(mdb_txn_begin(env, NULL, 0, &txn));
  90. (void)RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NODUPDATA));
  91. mdb_txn_abort(txn);
  92. sprintf(sval, "%07x", values[500]+1);
  93. E(mdb_txn_begin(env, NULL, 0, &txn));
  94. (void)RES(MDB_KEYEXIST, mdb_put(txn, dbi, &key, &data, MDB_NODUPDATA));
  95. E(mdb_txn_commit(txn));
  96. /* Try MDB_NEXT_MULTIPLE */
  97. E(mdb_txn_begin(env, NULL, 0, &txn));
  98. E(mdb_cursor_open(txn, dbi, &cursor));
  99. while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT_MULTIPLE)) == 0) {
  100. printf("key: %.*s, data: %.*s\n",
  101. (int) key.mv_size, (char *) key.mv_data,
  102. (int) data.mv_size, (char *) data.mv_data);
  103. }
  104. CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
  105. mdb_cursor_close(cursor);
  106. mdb_txn_abort(txn);
  107. j=0;
  108. for (i= count - 1; i > -1; i-= (rand()%3)) {
  109. j++;
  110. txn=NULL;
  111. E(mdb_txn_begin(env, NULL, 0, &txn));
  112. sprintf(sval, "%07x", values[i]);
  113. key.mv_size = sizeof(int);
  114. key.mv_data = kval;
  115. data.mv_size = sizeof(sval);
  116. data.mv_data = sval;
  117. if (RES(MDB_NOTFOUND, mdb_del(txn, dbi, &key, &data))) {
  118. j--;
  119. mdb_txn_abort(txn);
  120. } else {
  121. E(mdb_txn_commit(txn));
  122. }
  123. }
  124. free(values);
  125. printf("Deleted %d values\n", j);
  126. E(mdb_env_stat(env, &mst));
  127. E(mdb_txn_begin(env, NULL, MDB_RDONLY, &txn));
  128. E(mdb_cursor_open(txn, dbi, &cursor));
  129. printf("Cursor next\n");
  130. while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_NEXT)) == 0) {
  131. printf("key: %.*s, data: %.*s\n",
  132. (int) key.mv_size, (char *) key.mv_data,
  133. (int) data.mv_size, (char *) data.mv_data);
  134. }
  135. CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
  136. printf("Cursor prev\n");
  137. while ((rc = mdb_cursor_get(cursor, &key, &data, MDB_PREV)) == 0) {
  138. printf("key: %.*s, data: %.*s\n",
  139. (int) key.mv_size, (char *) key.mv_data,
  140. (int) data.mv_size, (char *) data.mv_data);
  141. }
  142. CHECK(rc == MDB_NOTFOUND, "mdb_cursor_get");
  143. mdb_cursor_close(cursor);
  144. mdb_txn_abort(txn);
  145. mdb_dbi_close(env, dbi);
  146. mdb_env_close(env);
  147. return 0;
  148. }