1 // -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
2 // vim: ts=8 sw=2 smarttab
4 #include "common/bloom_filter.hpp"
6 MEMPOOL_DEFINE_FACTORY(unsigned char, byte, bloom_filter);
8 void bloom_filter::encode(bufferlist& bl) const
10 ENCODE_START(2, 2, bl);
11 ::encode((uint64_t)salt_count_, bl);
12 ::encode((uint64_t)insert_count_, bl);
13 ::encode((uint64_t)target_element_count_, bl);
14 ::encode((uint64_t)random_seed_, bl);
15 bufferptr bp((const char*)bit_table_, table_size_);
20 void bloom_filter::decode(bufferlist::iterator& p)
29 target_element_count_ = v;
36 generate_unique_salt();
37 table_size_ = t.length();
40 bit_table_ = new cell_type[table_size_];
41 t.copy(0, table_size_, (char *)bit_table_);
49 void bloom_filter::dump(Formatter *f) const
51 f->dump_unsigned("salt_count", salt_count_);
52 f->dump_unsigned("table_size", table_size_);
53 f->dump_unsigned("insert_count", insert_count_);
54 f->dump_unsigned("target_element_count", target_element_count_);
55 f->dump_unsigned("random_seed", random_seed_);
57 f->open_array_section("salt_table");
58 for (std::vector<bloom_type>::const_iterator i = salt_.begin(); i != salt_.end(); ++i)
59 f->dump_unsigned("salt", *i);
62 f->open_array_section("bit_table");
63 for (unsigned i = 0; i < table_size_; ++i)
64 f->dump_unsigned("byte", (unsigned)bit_table_[i]);
68 void bloom_filter::generate_test_instances(std::list<bloom_filter*>& ls)
70 ls.push_back(new bloom_filter(10, .5, 1));
71 ls.push_back(new bloom_filter(10, .5, 1));
72 ls.back()->insert("foo");
73 ls.back()->insert("bar");
74 ls.push_back(new bloom_filter(50, .5, 1));
75 ls.back()->insert("foo");
76 ls.back()->insert("bar");
77 ls.back()->insert("baz");
78 ls.back()->insert("boof");
79 ls.back()->insert("boogggg");
83 void compressible_bloom_filter::encode(bufferlist& bl) const
85 ENCODE_START(2, 2, bl);
86 bloom_filter::encode(bl);
88 uint32_t s = size_list.size();
90 for (std::vector<size_t>::const_iterator p = size_list.begin();
91 p != size_list.end(); ++p)
92 ::encode((uint64_t)*p, bl);
97 void compressible_bloom_filter::decode(bufferlist::iterator& p)
100 bloom_filter::decode(p);
105 for (unsigned i = 0; i < s; i++) {
114 void compressible_bloom_filter::dump(Formatter *f) const
116 bloom_filter::dump(f);
118 f->open_array_section("table_sizes");
119 for (std::vector<size_t>::const_iterator p = size_list.begin();
120 p != size_list.end(); ++p)
121 f->dump_unsigned("size", (uint64_t)*p);
125 void compressible_bloom_filter::generate_test_instances(std::list<compressible_bloom_filter*>& ls)
127 ls.push_back(new compressible_bloom_filter(10, .5, 1));
128 ls.push_back(new compressible_bloom_filter(10, .5, 1));
129 ls.back()->insert("foo");
130 ls.back()->insert("bar");
131 ls.push_back(new compressible_bloom_filter(50, .5, 1));
132 ls.back()->insert("foo");
133 ls.back()->insert("bar");
134 ls.back()->insert("baz");
135 ls.back()->insert("boof");
136 ls.back()->compress(20);
137 ls.back()->insert("boogggg");