summaryrefslogtreecommitdiff
path: root/deps/jemalloc/test/bitmap.c
diff options
context:
space:
mode:
authorantirez <antirez@gmail.com>2011-05-09 10:52:55 +0200
committerantirez <antirez@gmail.com>2011-06-20 11:30:06 +0200
commita78e148b7d12a8c46b0a4686a9b0a3e8e054261c (patch)
treee6317a5a2f11b50a26bfb452d4d3671f67b524ac /deps/jemalloc/test/bitmap.c
parent07486df6fecae97b02171bba86f51d5df0a94cb5 (diff)
downloadredis-a78e148b7d12a8c46b0a4686a9b0a3e8e054261c.tar.gz
jemalloc source added
Diffstat (limited to 'deps/jemalloc/test/bitmap.c')
-rw-r--r--deps/jemalloc/test/bitmap.c157
1 files changed, 157 insertions, 0 deletions
diff --git a/deps/jemalloc/test/bitmap.c b/deps/jemalloc/test/bitmap.c
new file mode 100644
index 000000000..adfaacfe5
--- /dev/null
+++ b/deps/jemalloc/test/bitmap.c
@@ -0,0 +1,157 @@
+#define JEMALLOC_MANGLE
+#include "jemalloc_test.h"
+
+/*
+ * Avoid using the assert() from jemalloc_internal.h, since it requires
+ * internal libjemalloc functionality.
+ * */
+#include <assert.h>
+
+/*
+ * Directly include the bitmap code, since it isn't exposed outside
+ * libjemalloc.
+ */
+#include "../src/bitmap.c"
+
+#if (LG_BITMAP_MAXBITS > 12)
+# define MAXBITS 4500
+#else
+# define MAXBITS (1U << LG_BITMAP_MAXBITS)
+#endif
+
+static void
+test_bitmap_size(void)
+{
+ size_t i, prev_size;
+
+ prev_size = 0;
+ for (i = 1; i <= MAXBITS; i++) {
+ size_t size = bitmap_size(i);
+ assert(size >= prev_size);
+ prev_size = size;
+ }
+}
+
+static void
+test_bitmap_init(void)
+{
+ size_t i;
+
+ for (i = 1; i <= MAXBITS; i++) {
+ bitmap_info_t binfo;
+ bitmap_info_init(&binfo, i);
+ {
+ size_t j;
+ bitmap_t bitmap[bitmap_info_ngroups(&binfo)];
+ bitmap_init(bitmap, &binfo);
+
+ for (j = 0; j < i; j++)
+ assert(bitmap_get(bitmap, &binfo, j) == false);
+
+ }
+ }
+}
+
+static void
+test_bitmap_set(void)
+{
+ size_t i;
+
+ for (i = 1; i <= MAXBITS; i++) {
+ bitmap_info_t binfo;
+ bitmap_info_init(&binfo, i);
+ {
+ size_t j;
+ bitmap_t bitmap[bitmap_info_ngroups(&binfo)];
+ bitmap_init(bitmap, &binfo);
+
+ for (j = 0; j < i; j++)
+ bitmap_set(bitmap, &binfo, j);
+ assert(bitmap_full(bitmap, &binfo));
+ }
+ }
+}
+
+static void
+test_bitmap_unset(void)
+{
+ size_t i;
+
+ for (i = 1; i <= MAXBITS; i++) {
+ bitmap_info_t binfo;
+ bitmap_info_init(&binfo, i);
+ {
+ size_t j;
+ bitmap_t bitmap[bitmap_info_ngroups(&binfo)];
+ bitmap_init(bitmap, &binfo);
+
+ for (j = 0; j < i; j++)
+ bitmap_set(bitmap, &binfo, j);
+ assert(bitmap_full(bitmap, &binfo));
+ for (j = 0; j < i; j++)
+ bitmap_unset(bitmap, &binfo, j);
+ for (j = 0; j < i; j++)
+ bitmap_set(bitmap, &binfo, j);
+ assert(bitmap_full(bitmap, &binfo));
+ }
+ }
+}
+
+static void
+test_bitmap_sfu(void)
+{
+ size_t i;
+
+ for (i = 1; i <= MAXBITS; i++) {
+ bitmap_info_t binfo;
+ bitmap_info_init(&binfo, i);
+ {
+ ssize_t j;
+ bitmap_t bitmap[bitmap_info_ngroups(&binfo)];
+ bitmap_init(bitmap, &binfo);
+
+ /* Iteratively set bits starting at the beginning. */
+ for (j = 0; j < i; j++)
+ assert(bitmap_sfu(bitmap, &binfo) == j);
+ assert(bitmap_full(bitmap, &binfo));
+
+ /*
+ * Iteratively unset bits starting at the end, and
+ * verify that bitmap_sfu() reaches the unset bits.
+ */
+ for (j = i - 1; j >= 0; j--) {
+ bitmap_unset(bitmap, &binfo, j);
+ assert(bitmap_sfu(bitmap, &binfo) == j);
+ bitmap_unset(bitmap, &binfo, j);
+ }
+ assert(bitmap_get(bitmap, &binfo, 0) == false);
+
+ /*
+ * Iteratively set bits starting at the beginning, and
+ * verify that bitmap_sfu() looks past them.
+ */
+ for (j = 1; j < i; j++) {
+ bitmap_set(bitmap, &binfo, j - 1);
+ assert(bitmap_sfu(bitmap, &binfo) == j);
+ bitmap_unset(bitmap, &binfo, j);
+ }
+ assert(bitmap_sfu(bitmap, &binfo) == i - 1);
+ assert(bitmap_full(bitmap, &binfo));
+ }
+ }
+}
+
+int
+main(void)
+{
+ fprintf(stderr, "Test begin\n");
+
+ test_bitmap_size();
+ test_bitmap_init();
+ test_bitmap_set();
+ test_bitmap_unset();
+ test_bitmap_sfu();
+
+ fprintf(stderr, "Test end\n");
+ return (0);
+}