1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
#include "common/bloom_filter.hpp"
MEMPOOL_DEFINE_FACTORY(unsigned char, byte, bloom_filter);
using ceph::bufferlist;
using ceph::bufferptr;
using ceph::Formatter;
void bloom_filter::encode(bufferlist& bl) const
{
ENCODE_START(2, 2, bl);
encode((uint64_t)salt_count_, bl);
encode((uint64_t)insert_count_, bl);
encode((uint64_t)target_element_count_, bl);
encode((uint64_t)random_seed_, bl);
bufferptr bp((const char*)bit_table_, table_size_);
encode(bp, bl);
ENCODE_FINISH(bl);
}
void bloom_filter::decode(bufferlist::const_iterator& p)
{
DECODE_START(2, p);
uint64_t v;
decode(v, p);
salt_count_ = v;
decode(v, p);
insert_count_ = v;
decode(v, p);
target_element_count_ = v;
decode(v, p);
random_seed_ = v;
bufferlist t;
decode(t, p);
salt_.clear();
generate_unique_salt();
table_size_ = t.length();
delete[] bit_table_;
if (table_size_) {
bit_table_ = new cell_type[table_size_];
t.begin().copy(table_size_, (char *)bit_table_);
} else {
bit_table_ = NULL;
}
DECODE_FINISH(p);
}
void bloom_filter::dump(Formatter *f) const
{
f->dump_unsigned("salt_count", salt_count_);
f->dump_unsigned("table_size", table_size_);
f->dump_unsigned("insert_count", insert_count_);
f->dump_unsigned("target_element_count", target_element_count_);
f->dump_unsigned("random_seed", random_seed_);
f->open_array_section("salt_table");
for (std::vector<bloom_type>::const_iterator i = salt_.begin(); i != salt_.end(); ++i)
f->dump_unsigned("salt", *i);
f->close_section();
f->open_array_section("bit_table");
for (unsigned i = 0; i < table_size_; ++i)
f->dump_unsigned("byte", (unsigned)bit_table_[i]);
f->close_section();
}
void bloom_filter::generate_test_instances(std::list<bloom_filter*>& ls)
{
ls.push_back(new bloom_filter(10, .5, 1));
ls.push_back(new bloom_filter(10, .5, 1));
ls.back()->insert("foo");
ls.back()->insert("bar");
ls.push_back(new bloom_filter(50, .5, 1));
ls.back()->insert("foo");
ls.back()->insert("bar");
ls.back()->insert("baz");
ls.back()->insert("boof");
ls.back()->insert("boogggg");
}
void compressible_bloom_filter::encode(bufferlist& bl) const
{
ENCODE_START(2, 2, bl);
bloom_filter::encode(bl);
uint32_t s = size_list.size();
encode(s, bl);
for (std::vector<size_t>::const_iterator p = size_list.begin();
p != size_list.end(); ++p)
encode((uint64_t)*p, bl);
ENCODE_FINISH(bl);
}
void compressible_bloom_filter::decode(bufferlist::const_iterator& p)
{
DECODE_START(2, p);
bloom_filter::decode(p);
uint32_t s;
decode(s, p);
size_list.resize(s);
for (unsigned i = 0; i < s; i++) {
uint64_t v;
decode(v, p);
size_list[i] = v;
}
DECODE_FINISH(p);
}
void compressible_bloom_filter::dump(Formatter *f) const
{
bloom_filter::dump(f);
f->open_array_section("table_sizes");
for (std::vector<size_t>::const_iterator p = size_list.begin();
p != size_list.end(); ++p)
f->dump_unsigned("size", (uint64_t)*p);
f->close_section();
}
void compressible_bloom_filter::generate_test_instances(std::list<compressible_bloom_filter*>& ls)
{
ls.push_back(new compressible_bloom_filter(10, .5, 1));
ls.push_back(new compressible_bloom_filter(10, .5, 1));
ls.back()->insert("foo");
ls.back()->insert("bar");
ls.push_back(new compressible_bloom_filter(50, .5, 1));
ls.back()->insert("foo");
ls.back()->insert("bar");
ls.back()->insert("baz");
ls.back()->insert("boof");
ls.back()->compress(20);
ls.back()->insert("boogggg");
}
|
