MirrorHub/construct
0
0
Fork 0
mirror of https://github.com/matrix-construct/construct synced 2024-06-02 18:18:56 +02:00
Code Issues Releases Wiki Activity

ircd::db: Add parallel has() to column interface.

Browse source
This commit is contained in:
Jason Volk 2020-06-08 21:40:54 -07:00
parent 40c62b085b
commit c0c9c2c4f0
2 changed files with 50 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
include/ircd/db/column.h
View file

@ -44,6 +44,10 @@ namespace ircd::db
bool cached(column &, const string_view &key, const gopts & = {});
bool prefetch(column &, const string_view &key, const gopts & = {});
// [GET] Tests if multiple keys exist in parallel; returns bitset
uint64_t has(const vector_view<column> &, const vector_view<const string_view> &keys, const gopts & = {});
uint64_t has(column &, const vector_view<const string_view> &keys, const gopts & = {});
// [GET] Query space usage
size_t bytes(column &, const std::pair<string_view, string_view> &range, const gopts & = {});
size_t bytes_value(column &, const string_view &key, const gopts & = {});

46
ircd/db.cc
View file

@ -6596,6 +6596,52 @@ ircd::db::has(column &column,
return valid_eq(*it, key);
}
uint64_t
ircd::db::has(column &column,
const vector_view<const string_view> &key,
const gopts &opts)
{
const size_t num(key.size());
return has({&column, 1}, key, opts);
}
uint64_t
ircd::db::has(const vector_view<column> &c,
const vector_view<const string_view> &key,
const gopts &gopts)
{
if(c.empty())
return 0UL;
const size_t num(key.size());
if(unlikely(!num || num > 64))
throw std::out_of_range
{
"db::has() :too many columns or vector size mismatch"
};
_read_op op[num];
for(size_t i(0); i < num; ++i)
op[i] =
{
c[std::min(c.size() - 1, i)], key[i]
};
uint64_t i(0), ret(0);
auto opts(make_opts(gopts));
_read({op, num}, opts, [&i, &ret, &opts]
(column &, const column::delta &, const rocksdb::Status &s)
{
uint64_t found {0};
found |= s.ok();
found |= s.IsIncomplete() & (opts.read_tier == NON_BLOCKING);
ret |= (found << i++);
return true;
});
return ret;
}
//
// column
//