/usr/include/jellyfish/bloom_filter.hpp is in libjellyfish-2.0-dev 2.2.8-3build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 | /* This file is part of Jellyfish.
Jellyfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Jellyfish is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with Jellyfish. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef __JELLYFISH_BLOOM_FILTER_HPP__
#define __JELLYFISH_BLOOM_FILTER_HPP__
#include <jellyfish/allocators_mmap.hpp>
#include <jellyfish/atomic_gcc.hpp>
#include <jellyfish/bloom_common.hpp>
namespace jellyfish {
template<typename Key, typename HashPair = hash_pair<Key>, typename atomic_t = ::atomic::gcc>
class bloom_filter_base :
public bloom_base<Key, bloom_filter_base<Key, HashPair>, HashPair>
{
typedef bloom_base<Key, bloom_filter_base<Key, HashPair>, HashPair> super;
protected:
static size_t nb_bytes__(size_t l) {
return l / 8 + (l % 8 != 0);
}
public:
bloom_filter_base(size_t m, unsigned long k, unsigned char* ptr, const HashPair& fns = HashPair()) :
super(m, k, ptr, fns)
{ }
bloom_filter_base(bloom_filter_base&& rhs) :
super(std::move(rhs))
{ }
size_t nb_bytes() const {
return nb_bytes__(super::d_.d());
}
// Insert key with given hashes
unsigned int insert__(const uint64_t *hashes) {
// Prefetch memory locations
// This static_assert make clang++ happy...
static_assert(std::is_pod<typename super::prefetch_info>::value, "prefetch_info must be a POD");
typename super::prefetch_info pinfo[super::k_];
const size_t base = super::d_.remainder(hashes[0]);
const size_t inc = super::d_.remainder(hashes[1]);
for(unsigned long i = 0; i < super::k_; ++i) {
const size_t pos = super::d_.remainder(base + i * inc);
const size_t elt_i = pos / 8;
pinfo[i].boff = pos % 8;
pinfo[i].pos = super::data_ + elt_i;
__builtin_prefetch(pinfo[i].pos, 1, 0);
}
// Check if element present
bool present = true;
for(unsigned long i = 0; i < super::k_; ++i) {
const char mask = (char)1 << pinfo[i].boff;
const char prev = __sync_fetch_and_or(pinfo[i].pos, mask);
present = present && (prev & mask);
}
return present;
}
// Compute hashes of key k
void hash(const Key &k, uint64_t *hashes) const { hash_fns_(k, hashes); }
unsigned int check__(const uint64_t *hashes) const {
// Prefetch memory locations
static_assert(std::is_pod<typename super::prefetch_info>::value, "prefetch_info must be a POD");
typename super::prefetch_info pinfo[super::k_];
const size_t base = super::d_.remainder(hashes[0]);
const size_t inc = super::d_.remainder(hashes[1]);
for(unsigned long i = 0; i < super::k_; ++i) {
const size_t pos = super::d_.remainder(base + i * inc);
const size_t elt_i = pos / 8;
pinfo[i].boff = pos % 8;
pinfo[i].pos = super::data_ + elt_i;
__builtin_prefetch(pinfo[i].pos, 0, 0);
}
for(unsigned long i = 0; i < super::k_; ++i)
if(!(jflib::a_load(pinfo[i].pos) & ((char)1 << pinfo[i].boff)))
return 0;
return 1;
}
};
template<typename Key, typename HashPair = hash_pair<Key>, typename atomic_t = ::atomic::gcc,
typename mem_block_t = allocators::mmap>
class bloom_filter :
protected mem_block_t,
public bloom_filter_base<Key, HashPair, atomic_t>
{
typedef bloom_filter_base<Key, HashPair, atomic_t> super;
public:
bloom_filter(double fp, size_t n, const HashPair& fns = HashPair()) :
mem_block_t(super::nb_bytes__(super::opt_m(fp, n))),
super(super::opt_m(fp, n), super::opt_k(fp), (unsigned char*)mem_block_t::get_ptr(), fns)
{
if(!mem_block_t::get_ptr())
throw std::runtime_error(err::msg() << "Failed to allocate " << super::nb_bytes__(super::opt_m(fp, n))
<< " bytes of memory for bloom_filter");
}
bloom_filter(size_t m, unsigned long k, const HashPair& fns = HashPair()) :
mem_block_t(super::nb_bytes__(m)),
super(m, k, (unsigned char*)mem_block_t::get_ptr(), fns)
{
if(!mem_block_t::get_ptr())
throw std::runtime_error(err::msg() << "Failed to allocate " << super::nb_bytes__(m) << " bytes of memory for bloom_filter");
}
bloom_filter(size_t m, unsigned long k, std::istream& is, const HashPair& fns = HashPair()) :
mem_block_t(super::nb_bytes__(m)),
super(m, k, (unsigned char*)mem_block_t::get_ptr(), fns)
{
if(!mem_block_t::get_ptr())
throw std::runtime_error(err::msg() << "Failed to allocate " << super::nb_bytes__(m) << " bytes of memory for bloom_filter");
is.read((char*)mem_block_t::get_ptr(), mem_block_t::get_size());
}
bloom_filter(bloom_filter&& rhs) :
mem_block_t(std::move(rhs)),
super(std::move(rhs))
{ }
};
template<typename Key, typename HashPair = hash_pair<Key>, typename atomic_t = ::atomic::gcc>
class bloom_filter_file :
protected mapped_file,
public bloom_filter_base<Key, HashPair, atomic_t>
{
typedef bloom_filter_base<Key, HashPair, atomic_t> super;
public:
typedef typename super::key_type key_type;
bloom_filter_file(size_t m, unsigned long k, const char* path, const HashPair& fns = HashPair(), off_t offset = 0) :
mapped_file(path),
super(m, k, (unsigned char*)mapped_file::base() + offset, fns)
{ }
bloom_filter_file(const bloom_filter_file& rhs) = delete;
bloom_filter_file(bloom_filter_file&& rhs) :
mapped_file(std::move(rhs)),
super(std::move(rhs))
{ }
};
}
#endif /* __JELLYFISH_BLOOM_FILTER_HPP__ */
|