2013-11-27 22:27:02 +00:00
|
|
|
// Copyright (c) 2013, Facebook, Inc. All rights reserved.
|
|
|
|
// This source code is licensed under the BSD-style license found in the
|
|
|
|
// LICENSE file in the root directory of this source tree. An additional grant
|
|
|
|
// of patent rights can be found in the PATENTS file in the same directory.
|
|
|
|
|
2014-05-09 15:34:18 +00:00
|
|
|
#ifndef GFLAGS
|
|
|
|
#include <cstdio>
|
|
|
|
int main() {
|
|
|
|
fprintf(stderr, "Please install gflags to run rocksdb tools\n");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
|
2014-09-05 06:14:37 +00:00
|
|
|
#ifndef __STDC_FORMAT_MACROS
|
2014-04-03 23:04:10 +00:00
|
|
|
#define __STDC_FORMAT_MACROS
|
2014-09-05 06:14:37 +00:00
|
|
|
#endif
|
|
|
|
|
2014-04-03 23:04:10 +00:00
|
|
|
#include <inttypes.h>
|
2014-03-28 16:21:20 +00:00
|
|
|
#include <algorithm>
|
2013-11-27 22:27:02 +00:00
|
|
|
#include <gflags/gflags.h>
|
|
|
|
|
|
|
|
#include "dynamic_bloom.h"
|
2014-03-28 16:21:20 +00:00
|
|
|
#include "port/port.h"
|
2014-12-02 20:09:20 +00:00
|
|
|
#include "util/arena.h"
|
2013-11-27 22:27:02 +00:00
|
|
|
#include "util/logging.h"
|
|
|
|
#include "util/testharness.h"
|
|
|
|
#include "util/testutil.h"
|
2014-03-28 16:21:20 +00:00
|
|
|
#include "util/stop_watch.h"
|
2013-11-27 22:27:02 +00:00
|
|
|
|
2014-05-09 15:34:18 +00:00
|
|
|
using GFLAGS::ParseCommandLineFlags;
|
|
|
|
|
2013-11-27 22:27:02 +00:00
|
|
|
DEFINE_int32(bits_per_key, 10, "");
|
|
|
|
DEFINE_int32(num_probes, 6, "");
|
2014-03-28 16:21:20 +00:00
|
|
|
DEFINE_bool(enable_perf, false, "");
|
2013-11-27 22:27:02 +00:00
|
|
|
|
|
|
|
namespace rocksdb {
|
|
|
|
|
2014-03-28 16:21:20 +00:00
|
|
|
static Slice Key(uint64_t i, char* buffer) {
|
2013-11-27 22:27:02 +00:00
|
|
|
memcpy(buffer, &i, sizeof(i));
|
|
|
|
return Slice(buffer, sizeof(i));
|
|
|
|
}
|
|
|
|
|
|
|
|
class DynamicBloomTest {
|
|
|
|
};
|
|
|
|
|
|
|
|
TEST(DynamicBloomTest, EmptyFilter) {
|
2014-06-30 22:54:31 +00:00
|
|
|
Arena arena;
|
|
|
|
DynamicBloom bloom1(&arena, 100, 0, 2);
|
2014-03-28 16:21:20 +00:00
|
|
|
ASSERT_TRUE(!bloom1.MayContain("hello"));
|
|
|
|
ASSERT_TRUE(!bloom1.MayContain("world"));
|
|
|
|
|
2014-06-30 22:54:31 +00:00
|
|
|
DynamicBloom bloom2(&arena, CACHE_LINE_SIZE * 8 * 2 - 1, 1, 2);
|
2014-03-28 16:21:20 +00:00
|
|
|
ASSERT_TRUE(!bloom2.MayContain("hello"));
|
|
|
|
ASSERT_TRUE(!bloom2.MayContain("world"));
|
2013-11-27 22:27:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST(DynamicBloomTest, Small) {
|
2014-06-30 22:54:31 +00:00
|
|
|
Arena arena;
|
|
|
|
DynamicBloom bloom1(&arena, 100, 0, 2);
|
2014-03-28 16:21:20 +00:00
|
|
|
bloom1.Add("hello");
|
|
|
|
bloom1.Add("world");
|
|
|
|
ASSERT_TRUE(bloom1.MayContain("hello"));
|
|
|
|
ASSERT_TRUE(bloom1.MayContain("world"));
|
|
|
|
ASSERT_TRUE(!bloom1.MayContain("x"));
|
|
|
|
ASSERT_TRUE(!bloom1.MayContain("foo"));
|
|
|
|
|
2014-06-30 22:54:31 +00:00
|
|
|
DynamicBloom bloom2(&arena, CACHE_LINE_SIZE * 8 * 2 - 1, 1, 2);
|
2014-03-28 16:21:20 +00:00
|
|
|
bloom2.Add("hello");
|
|
|
|
bloom2.Add("world");
|
|
|
|
ASSERT_TRUE(bloom2.MayContain("hello"));
|
|
|
|
ASSERT_TRUE(bloom2.MayContain("world"));
|
|
|
|
ASSERT_TRUE(!bloom2.MayContain("x"));
|
|
|
|
ASSERT_TRUE(!bloom2.MayContain("foo"));
|
2013-11-27 22:27:02 +00:00
|
|
|
}
|
|
|
|
|
2014-03-28 16:21:20 +00:00
|
|
|
static uint32_t NextNum(uint32_t num) {
|
|
|
|
if (num < 10) {
|
|
|
|
num += 1;
|
|
|
|
} else if (num < 100) {
|
|
|
|
num += 10;
|
|
|
|
} else if (num < 1000) {
|
|
|
|
num += 100;
|
2013-11-27 22:27:02 +00:00
|
|
|
} else {
|
2014-03-28 16:21:20 +00:00
|
|
|
num += 1000;
|
2013-11-27 22:27:02 +00:00
|
|
|
}
|
2014-03-28 16:21:20 +00:00
|
|
|
return num;
|
2013-11-27 22:27:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST(DynamicBloomTest, VaryingLengths) {
|
2014-03-28 23:21:42 +00:00
|
|
|
char buffer[sizeof(uint64_t)];
|
2013-11-27 22:27:02 +00:00
|
|
|
|
|
|
|
// Count number of filters that significantly exceed the false positive rate
|
|
|
|
int mediocre_filters = 0;
|
|
|
|
int good_filters = 0;
|
2014-04-02 22:05:03 +00:00
|
|
|
uint32_t num_probes = static_cast<uint32_t>(FLAGS_num_probes);
|
2013-11-27 22:27:02 +00:00
|
|
|
|
|
|
|
fprintf(stderr, "bits_per_key: %d num_probes: %d\n",
|
2014-04-02 22:05:03 +00:00
|
|
|
FLAGS_bits_per_key, num_probes);
|
2013-11-27 22:27:02 +00:00
|
|
|
|
2014-06-02 23:52:29 +00:00
|
|
|
for (uint32_t enable_locality = 0; enable_locality < 2; ++enable_locality) {
|
2014-03-28 16:21:20 +00:00
|
|
|
for (uint32_t num = 1; num <= 10000; num = NextNum(num)) {
|
|
|
|
uint32_t bloom_bits = 0;
|
2014-06-30 22:54:31 +00:00
|
|
|
Arena arena;
|
2014-06-02 23:52:29 +00:00
|
|
|
if (enable_locality == 0) {
|
2014-03-28 16:21:20 +00:00
|
|
|
bloom_bits = std::max(num * FLAGS_bits_per_key, 64U);
|
|
|
|
} else {
|
|
|
|
bloom_bits = std::max(num * FLAGS_bits_per_key,
|
2014-06-02 23:52:29 +00:00
|
|
|
enable_locality * CACHE_LINE_SIZE * 8);
|
2014-03-28 16:21:20 +00:00
|
|
|
}
|
2014-06-30 22:54:31 +00:00
|
|
|
DynamicBloom bloom(&arena, bloom_bits, enable_locality, num_probes);
|
2014-03-28 16:21:20 +00:00
|
|
|
for (uint64_t i = 0; i < num; i++) {
|
|
|
|
bloom.Add(Key(i, buffer));
|
|
|
|
ASSERT_TRUE(bloom.MayContain(Key(i, buffer)));
|
|
|
|
}
|
2013-11-27 22:27:02 +00:00
|
|
|
|
2014-03-28 16:21:20 +00:00
|
|
|
// All added keys must match
|
|
|
|
for (uint64_t i = 0; i < num; i++) {
|
|
|
|
ASSERT_TRUE(bloom.MayContain(Key(i, buffer)))
|
|
|
|
<< "Num " << num << "; key " << i;
|
|
|
|
}
|
2013-11-27 22:27:02 +00:00
|
|
|
|
2014-03-28 16:21:20 +00:00
|
|
|
// Check false positive rate
|
2013-11-27 22:27:02 +00:00
|
|
|
|
2014-03-28 16:21:20 +00:00
|
|
|
int result = 0;
|
|
|
|
for (uint64_t i = 0; i < 10000; i++) {
|
|
|
|
if (bloom.MayContain(Key(i + 1000000000, buffer))) {
|
|
|
|
result++;
|
|
|
|
}
|
2013-11-27 22:27:02 +00:00
|
|
|
}
|
2014-03-28 16:21:20 +00:00
|
|
|
double rate = result / 10000.0;
|
|
|
|
|
2014-06-02 23:52:29 +00:00
|
|
|
fprintf(stderr,
|
|
|
|
"False positives: %5.2f%% @ num = %6u, bloom_bits = %6u, "
|
|
|
|
"enable locality?%u\n",
|
|
|
|
rate * 100.0, num, bloom_bits, enable_locality);
|
2014-03-28 16:21:20 +00:00
|
|
|
|
|
|
|
if (rate > 0.0125)
|
|
|
|
mediocre_filters++; // Allowed, but not too often
|
|
|
|
else
|
|
|
|
good_filters++;
|
2013-11-27 22:27:02 +00:00
|
|
|
}
|
|
|
|
|
2014-03-28 16:21:20 +00:00
|
|
|
fprintf(stderr, "Filters: %d good, %d mediocre\n",
|
|
|
|
good_filters, mediocre_filters);
|
|
|
|
ASSERT_LE(mediocre_filters, good_filters/5);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(DynamicBloomTest, perf) {
|
|
|
|
StopWatchNano timer(Env::Default());
|
2014-04-02 22:05:03 +00:00
|
|
|
uint32_t num_probes = static_cast<uint32_t>(FLAGS_num_probes);
|
2013-11-27 22:27:02 +00:00
|
|
|
|
2014-03-28 16:21:20 +00:00
|
|
|
if (!FLAGS_enable_perf) {
|
|
|
|
return;
|
2013-11-27 22:27:02 +00:00
|
|
|
}
|
|
|
|
|
2014-11-11 21:47:22 +00:00
|
|
|
for (uint32_t m = 1; m <= 8; ++m) {
|
2014-06-30 22:54:31 +00:00
|
|
|
Arena arena;
|
2014-11-11 21:47:22 +00:00
|
|
|
const uint32_t num_keys = m * 8 * 1024 * 1024;
|
|
|
|
fprintf(stderr, "testing %" PRIu32 "M keys\n", m * 8);
|
2013-11-27 22:27:02 +00:00
|
|
|
|
2014-06-30 22:54:31 +00:00
|
|
|
DynamicBloom std_bloom(&arena, num_keys * 10, 0, num_probes);
|
2013-11-27 22:27:02 +00:00
|
|
|
|
2014-03-28 16:21:20 +00:00
|
|
|
timer.Start();
|
2014-11-11 21:47:22 +00:00
|
|
|
for (uint32_t i = 1; i <= num_keys; ++i) {
|
2014-03-28 16:21:20 +00:00
|
|
|
std_bloom.Add(Slice(reinterpret_cast<const char*>(&i), 8));
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t elapsed = timer.ElapsedNanos();
|
2014-04-03 23:04:10 +00:00
|
|
|
fprintf(stderr, "standard bloom, avg add latency %" PRIu64 "\n",
|
2014-03-28 16:21:20 +00:00
|
|
|
elapsed / num_keys);
|
|
|
|
|
2014-11-11 21:47:22 +00:00
|
|
|
uint32_t count = 0;
|
2014-03-28 16:21:20 +00:00
|
|
|
timer.Start();
|
2014-11-11 21:47:22 +00:00
|
|
|
for (uint32_t i = 1; i <= num_keys; ++i) {
|
2014-03-28 16:21:20 +00:00
|
|
|
if (std_bloom.MayContain(Slice(reinterpret_cast<const char*>(&i), 8))) {
|
|
|
|
++count;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
elapsed = timer.ElapsedNanos();
|
2014-04-03 23:04:10 +00:00
|
|
|
fprintf(stderr, "standard bloom, avg query latency %" PRIu64 "\n",
|
2014-03-28 16:21:20 +00:00
|
|
|
elapsed / count);
|
|
|
|
ASSERT_TRUE(count == num_keys);
|
|
|
|
|
2014-06-02 23:52:29 +00:00
|
|
|
// Locality enabled version
|
2014-06-30 22:54:31 +00:00
|
|
|
DynamicBloom blocked_bloom(&arena, num_keys * 10, 1, num_probes);
|
2014-03-28 16:21:20 +00:00
|
|
|
|
|
|
|
timer.Start();
|
2014-11-11 21:47:22 +00:00
|
|
|
for (uint32_t i = 1; i <= num_keys; ++i) {
|
2014-03-28 16:21:20 +00:00
|
|
|
blocked_bloom.Add(Slice(reinterpret_cast<const char*>(&i), 8));
|
|
|
|
}
|
|
|
|
|
2014-06-02 23:52:29 +00:00
|
|
|
elapsed = timer.ElapsedNanos();
|
|
|
|
fprintf(stderr,
|
|
|
|
"blocked bloom(enable locality), avg add latency %" PRIu64 "\n",
|
|
|
|
elapsed / num_keys);
|
2014-03-28 16:21:20 +00:00
|
|
|
|
2014-06-02 23:52:29 +00:00
|
|
|
count = 0;
|
2014-03-28 16:21:20 +00:00
|
|
|
timer.Start();
|
2014-11-11 21:47:22 +00:00
|
|
|
for (uint32_t i = 1; i <= num_keys; ++i) {
|
2014-03-28 16:21:20 +00:00
|
|
|
if (blocked_bloom.MayContain(
|
2014-11-11 21:47:22 +00:00
|
|
|
Slice(reinterpret_cast<const char*>(&i), 8))) {
|
2014-03-28 16:21:20 +00:00
|
|
|
++count;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
elapsed = timer.ElapsedNanos();
|
2014-06-02 23:52:29 +00:00
|
|
|
fprintf(stderr,
|
|
|
|
"blocked bloom(enable locality), avg query latency %" PRIu64 "\n",
|
|
|
|
elapsed / count);
|
2014-03-28 16:21:20 +00:00
|
|
|
ASSERT_TRUE(count == num_keys);
|
|
|
|
}
|
|
|
|
}
|
2013-11-27 22:27:02 +00:00
|
|
|
|
|
|
|
} // namespace rocksdb
|
|
|
|
|
|
|
|
int main(int argc, char** argv) {
|
2014-05-09 15:34:18 +00:00
|
|
|
ParseCommandLineFlags(&argc, &argv, true);
|
2013-11-27 22:27:02 +00:00
|
|
|
|
|
|
|
return rocksdb::test::RunAllTests();
|
|
|
|
}
|
2014-05-09 15:34:18 +00:00
|
|
|
|
|
|
|
#endif // GFLAGS
|