mirror of
https://github.com/matrix-construct/construct
synced 2024-11-13 05:21:07 +01:00
44cf572ee5
ircd::rfc3986: Add additional convenience constants.
4716 lines
87 KiB
C++
4716 lines
87 KiB
C++
// Matrix Construct
|
|
//
|
|
// Copyright (C) Matrix Construct Developers, Authors & Contributors
|
|
// Copyright (C) 2016-2018 Jason Volk <jason@zemos.net>
|
|
//
|
|
// Permission to use, copy, modify, and/or distribute this software for any
|
|
// purpose with or without fee is hereby granted, provided that the above
|
|
// copyright notice and this permission notice is present in all copies. The
|
|
// full license for this software is available in the LICENSE file.
|
|
|
|
size_t
|
|
ircd::m::room::purge(const room &room)
|
|
{
|
|
size_t ret(0);
|
|
db::txn txn
|
|
{
|
|
*m::dbs::events
|
|
};
|
|
|
|
room.for_each([&txn, &ret]
|
|
(const m::event::idx &idx)
|
|
{
|
|
const m::event::fetch event
|
|
{
|
|
idx
|
|
};
|
|
|
|
m::dbs::write_opts opts;
|
|
opts.op = db::op::DELETE;
|
|
opts.event_idx = idx;
|
|
m::dbs::write(txn, event, opts);
|
|
++ret;
|
|
});
|
|
|
|
txn();
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::is(const event::idx &event_idx)
|
|
{
|
|
bool ret{false};
|
|
m::get(event_idx, "state_key", [&ret]
|
|
(const string_view &state_key)
|
|
{
|
|
ret = true;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::is(std::nothrow_t,
|
|
const event::idx &event_idx)
|
|
{
|
|
bool ret{false};
|
|
m::get(std::nothrow, event_idx, "state_key", [&ret]
|
|
(const string_view &state_key)
|
|
{
|
|
ret = true;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::state::purge_replaced(const state &state)
|
|
{
|
|
db::txn txn
|
|
{
|
|
*m::dbs::events
|
|
};
|
|
|
|
size_t ret(0);
|
|
m::room::messages it
|
|
{
|
|
state.room_id, uint64_t(0)
|
|
};
|
|
|
|
if(!it)
|
|
return ret;
|
|
|
|
for(; it; ++it)
|
|
{
|
|
const m::event::idx &event_idx(it.event_idx());
|
|
if(!m::get(std::nothrow, event_idx, "state_key", [](const auto &) {}))
|
|
continue;
|
|
|
|
if(!m::event::refs(event_idx).count(m::dbs::ref::NEXT_STATE))
|
|
continue;
|
|
|
|
// TODO: erase event
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::force_present(const m::event &event)
|
|
{
|
|
db::txn txn
|
|
{
|
|
*m::dbs::events
|
|
};
|
|
|
|
if(!defined(json::get<"room_id"_>(event)))
|
|
throw error
|
|
{
|
|
"event %s is not a room event (no room_id)",
|
|
json::get<"event_id"_>(event)
|
|
};
|
|
|
|
if(!defined(json::get<"state_key"_>(event)))
|
|
throw error
|
|
{
|
|
"event %s is not a state event (no state_key)",
|
|
json::get<"event_id"_>(event)
|
|
};
|
|
|
|
dbs::write_opts opts;
|
|
opts.event_idx = m::index(event);
|
|
opts.appendix.reset();
|
|
opts.appendix.set(dbs::appendix::ROOM_STATE);
|
|
opts.appendix.reset(dbs::appendix::ROOM_JOINED);
|
|
dbs::write(txn, event, opts);
|
|
|
|
txn();
|
|
return true;
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::state::rebuild_present(const state &state)
|
|
{
|
|
size_t ret{0};
|
|
m::room::messages it
|
|
{
|
|
state.room_id, uint64_t(0)
|
|
};
|
|
|
|
if(!it)
|
|
return ret;
|
|
|
|
db::txn txn
|
|
{
|
|
*m::dbs::events
|
|
};
|
|
|
|
for(; it; ++it)
|
|
{
|
|
const m::event::idx &event_idx{it};
|
|
if(!state.is(std::nothrow, event_idx))
|
|
continue;
|
|
|
|
const m::event &event{*it};
|
|
m::dbs::write_opts opts;
|
|
opts.event_idx = event_idx;
|
|
opts.appendix.reset();
|
|
opts.appendix.set(dbs::appendix::ROOM_STATE);
|
|
opts.appendix.set(dbs::appendix::ROOM_JOINED);
|
|
dbs::write(txn, event, opts);
|
|
++ret;
|
|
}
|
|
|
|
txn();
|
|
return ret;
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::state::rebuild_history(const state &state)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::state::clear_history(const state &state)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
namespace ircd::m
|
|
{
|
|
extern conf::item<ulong> state__prefetch__yield_modulus;
|
|
}
|
|
|
|
decltype(ircd::m::state__prefetch__yield_modulus)
|
|
ircd::m::state__prefetch__yield_modulus
|
|
{
|
|
{ "name", "ircd.m.room.state_prefetch.yield_modulus" },
|
|
{ "default", 256L },
|
|
};
|
|
|
|
size_t
|
|
ircd::m::room::state::prefetch(const state &state,
|
|
const string_view &type,
|
|
const event::idx_range &range)
|
|
{
|
|
const m::event::fetch::opts &fopts
|
|
{
|
|
state.fopts?
|
|
*state.fopts:
|
|
m::event::fetch::default_opts
|
|
};
|
|
|
|
size_t ret{0};
|
|
state.for_each(type, m::event::closure_idx{[&ret, &fopts, &range]
|
|
(const m::event::idx &event_idx)
|
|
{
|
|
if(event_idx < range.first)
|
|
return;
|
|
|
|
if(range.second && event_idx > range.second)
|
|
return;
|
|
|
|
m::prefetch(event_idx, fopts);
|
|
++ret;
|
|
|
|
const ulong ym(state__prefetch__yield_modulus);
|
|
if(ym && ret % ym == 0)
|
|
ctx::yield();
|
|
}});
|
|
|
|
return ret;
|
|
}
|
|
|
|
ircd::m::event::idx
|
|
ircd::m::room::state::prev(const event::idx &event_idx)
|
|
{
|
|
event::idx ret{0};
|
|
prev(event_idx, [&ret]
|
|
(const event::idx &event_idx)
|
|
{
|
|
if(event_idx > ret)
|
|
ret = event_idx;
|
|
|
|
return true;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
ircd::m::event::idx
|
|
ircd::m::room::state::next(const event::idx &event_idx)
|
|
{
|
|
event::idx ret{0};
|
|
next(event_idx, [&ret]
|
|
(const event::idx &event_idx)
|
|
{
|
|
if(event_idx > ret)
|
|
ret = event_idx;
|
|
|
|
return true;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::next(const event::idx &event_idx,
|
|
const event::closure_idx_bool &closure)
|
|
{
|
|
const m::event::refs refs
|
|
{
|
|
event_idx
|
|
};
|
|
|
|
return refs.for_each(dbs::ref::NEXT_STATE, [&closure]
|
|
(const event::idx &event_idx, const dbs::ref &ref)
|
|
{
|
|
assert(ref == dbs::ref::NEXT_STATE);
|
|
return closure(event_idx);
|
|
});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::prev(const event::idx &event_idx,
|
|
const event::closure_idx_bool &closure)
|
|
{
|
|
const m::event::refs refs
|
|
{
|
|
event_idx
|
|
};
|
|
|
|
return refs.for_each(dbs::ref::PREV_STATE, [&closure]
|
|
(const event::idx &event_idx, const dbs::ref &ref)
|
|
{
|
|
assert(ref == dbs::ref::PREV_STATE);
|
|
return closure(event_idx);
|
|
});
|
|
}
|
|
|
|
ircd::m::room
|
|
ircd::m::create(const id::room &room_id,
|
|
const id::user &creator,
|
|
const string_view &preset)
|
|
{
|
|
return create(createroom
|
|
{
|
|
{ "room_id", room_id },
|
|
{ "creator", creator },
|
|
{ "preset", preset },
|
|
});
|
|
}
|
|
|
|
ircd::m::room
|
|
ircd::m::create(const createroom &c,
|
|
json::stack::array *const &errors)
|
|
{
|
|
using prototype = room (const createroom &, json::stack::array *const &);
|
|
|
|
static mods::import<prototype> call
|
|
{
|
|
"client_createroom", "ircd::m::create"
|
|
};
|
|
|
|
return call(c, errors);
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::join(const id::room_alias &room_alias,
|
|
const id::user &user_id)
|
|
{
|
|
using prototype = event::id::buf (const id::room_alias &, const id::user &);
|
|
|
|
static mods::import<prototype> function
|
|
{
|
|
"client_rooms", "ircd::m::join"
|
|
};
|
|
|
|
return function(room_alias, user_id);
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::join(const room &room,
|
|
const id::user &user_id)
|
|
{
|
|
using prototype = event::id::buf (const m::room &, const id::user &);
|
|
|
|
static mods::import<prototype> function
|
|
{
|
|
"client_rooms", "ircd::m::join"
|
|
};
|
|
|
|
return function(room, user_id);
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::leave(const room &room,
|
|
const id::user &user_id)
|
|
{
|
|
using prototype = event::id::buf (const m::room &, const id::user &);
|
|
|
|
static mods::import<prototype> function
|
|
{
|
|
"client_rooms", "ircd::m::leave"
|
|
};
|
|
|
|
return function(room, user_id);
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::invite(const room &room,
|
|
const id::user &target,
|
|
const id::user &sender)
|
|
{
|
|
json::iov content;
|
|
return invite(room, target, sender, content);
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::invite(const room &room,
|
|
const id::user &target,
|
|
const id::user &sender,
|
|
json::iov &content)
|
|
{
|
|
using prototype = event::id::buf (const m::room &, const id::user &, const id::user &, json::iov &);
|
|
|
|
static mods::import<prototype> call
|
|
{
|
|
"client_rooms", "ircd::m::invite"
|
|
};
|
|
|
|
return call(room, target, sender, content);
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::redact(const room &room,
|
|
const id::user &sender,
|
|
const id::event &event_id,
|
|
const string_view &reason)
|
|
{
|
|
using prototype = event::id::buf (const m::room &, const id::user &, const id::event &, const string_view &);
|
|
|
|
static mods::import<prototype> function
|
|
{
|
|
"client_rooms", "redact__"
|
|
};
|
|
|
|
return function(room, sender, event_id, reason);
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::notice(const room &room,
|
|
const string_view &body)
|
|
{
|
|
return message(room, me.user_id, body, "m.notice");
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::notice(const room &room,
|
|
const m::id::user &sender,
|
|
const string_view &body)
|
|
{
|
|
return message(room, sender, body, "m.notice");
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::msghtml(const room &room,
|
|
const m::id::user &sender,
|
|
const string_view &html,
|
|
const string_view &alt,
|
|
const string_view &msgtype)
|
|
{
|
|
return message(room, sender,
|
|
{
|
|
{ "msgtype", msgtype },
|
|
{ "format", "org.matrix.custom.html" },
|
|
{ "body", { alt?: html, json::STRING } },
|
|
{ "formatted_body", { html, json::STRING } },
|
|
});
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::message(const room &room,
|
|
const m::id::user &sender,
|
|
const string_view &body,
|
|
const string_view &msgtype)
|
|
{
|
|
return message(room, sender,
|
|
{
|
|
{ "body", { body, json::STRING } },
|
|
{ "msgtype", { msgtype, json::STRING } },
|
|
});
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::message(const room &room,
|
|
const m::id::user &sender,
|
|
const json::members &contents)
|
|
{
|
|
return send(room, sender, "m.room.message", contents);
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
__attribute__((stack_protect))
|
|
ircd::m::send(const room &room,
|
|
const m::id::user &sender,
|
|
const string_view &type,
|
|
const string_view &state_key,
|
|
const json::members &contents)
|
|
{
|
|
const size_t contents_count
|
|
{
|
|
std::min(contents.size(), json::object::max_sorted_members)
|
|
};
|
|
|
|
json::iov _content;
|
|
json::iov::push content[contents_count]; // 48B each
|
|
return send(room, sender, type, state_key, make_iov(_content, content, contents_count, contents));
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
__attribute__((stack_protect))
|
|
ircd::m::send(const room &room,
|
|
const m::id::user &sender,
|
|
const string_view &type,
|
|
const string_view &state_key,
|
|
const json::object &contents)
|
|
{
|
|
const size_t contents_count
|
|
{
|
|
std::min(contents.size(), json::object::max_sorted_members)
|
|
};
|
|
|
|
json::iov _content;
|
|
json::iov::push content[contents_count]; // 48B each
|
|
return send(room, sender, type, state_key, make_iov(_content, content, contents_count, contents));
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::send(const room &room,
|
|
const m::id::user &sender,
|
|
const string_view &type,
|
|
const string_view &state_key,
|
|
const json::iov &content)
|
|
{
|
|
using prototype = event::id::buf (const m::room &, const id::user &, const string_view &, const string_view &, const json::iov &);
|
|
|
|
static mods::import<prototype> function
|
|
{
|
|
"client_rooms", "ircd::m::send"
|
|
};
|
|
|
|
return function(room, sender, type, state_key, content);
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
__attribute__((stack_protect))
|
|
ircd::m::send(const room &room,
|
|
const m::id::user &sender,
|
|
const string_view &type,
|
|
const json::members &contents)
|
|
{
|
|
const size_t contents_count
|
|
{
|
|
std::min(contents.size(), json::object::max_sorted_members)
|
|
};
|
|
|
|
json::iov _content;
|
|
json::iov::push content[contents_count]; // 48B each
|
|
return send(room, sender, type, make_iov(_content, content, contents_count, contents));
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
__attribute__((stack_protect))
|
|
ircd::m::send(const room &room,
|
|
const m::id::user &sender,
|
|
const string_view &type,
|
|
const json::object &contents)
|
|
{
|
|
const size_t contents_count
|
|
{
|
|
std::min(contents.size(), json::object::max_sorted_members)
|
|
};
|
|
|
|
json::iov _content;
|
|
json::iov::push content[contents_count]; // 48B each
|
|
return send(room, sender, type, make_iov(_content, content, contents_count, contents));
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::send(const room &room,
|
|
const id::user &sender,
|
|
const string_view &type,
|
|
const json::iov &content)
|
|
{
|
|
using prototype = event::id::buf (const m::room &, const id::user &, const string_view &, const json::iov &);
|
|
|
|
static mods::import<prototype> function
|
|
{
|
|
"client_rooms", "ircd::m::send"
|
|
};
|
|
|
|
return function(room, sender, type, content);
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::commit(const room &room,
|
|
json::iov &event,
|
|
const json::iov &contents)
|
|
{
|
|
vm::copts opts
|
|
{
|
|
room.copts?
|
|
*room.copts:
|
|
vm::default_copts
|
|
};
|
|
|
|
// Some functionality on this server may create an event on behalf
|
|
// of remote users. It's safe for us to mask this here, but eval'ing
|
|
// this event in any replay later will require special casing.
|
|
opts.non_conform |= event::conforms::MISMATCH_ORIGIN_SENDER;
|
|
|
|
// Stupid protocol workaround
|
|
opts.non_conform |= event::conforms::MISSING_PREV_STATE;
|
|
|
|
// Don't need this here
|
|
opts.verify = false;
|
|
|
|
vm::eval eval
|
|
{
|
|
opts
|
|
};
|
|
|
|
eval(room, event, contents);
|
|
return eval.event_id;
|
|
}
|
|
|
|
std::pair<int64_t, ircd::m::event::idx>
|
|
ircd::m::twain(const room &room)
|
|
{
|
|
std::pair<int64_t, m::event::idx> ret
|
|
{
|
|
-1, 0
|
|
};
|
|
|
|
rfor_each_depth_gap(room, [&ret]
|
|
(const auto &range, const auto &event_idx)
|
|
{
|
|
ret.first = range.first - 1;
|
|
ret.second = event_idx;
|
|
return false;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
std::pair<int64_t, ircd::m::event::idx>
|
|
ircd::m::sounding(const room &room)
|
|
{
|
|
std::pair<int64_t, m::event::idx> ret
|
|
{
|
|
-1, 0
|
|
};
|
|
|
|
rfor_each_depth_gap(room, [&ret]
|
|
(const auto &range, const auto &event_idx)
|
|
{
|
|
ret.first = range.second;
|
|
ret.second = event_idx;
|
|
return false;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
std::pair<int64_t, ircd::m::event::idx>
|
|
ircd::m::hazard(const room &room)
|
|
{
|
|
std::pair<int64_t, m::event::idx> ret {0, 0};
|
|
for_each_depth_gap(room, [&ret]
|
|
(const auto &range, const auto &event_idx)
|
|
{
|
|
ret.first = range.first;
|
|
ret.second = event_idx;
|
|
return false;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::sounding(const room &room,
|
|
const depth_range_closure &closure)
|
|
{
|
|
bool ret(true);
|
|
int64_t depth(-1);
|
|
rfor_each_depth_gap(room, [&depth, &ret, &closure]
|
|
(const auto &range, const auto &event_idx)
|
|
{
|
|
if(depth != -1 && depth != range.second)
|
|
return false;
|
|
|
|
depth = range.second;
|
|
if(!closure(range, event_idx))
|
|
return false;
|
|
|
|
return true;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::rfor_each_depth_gap(const room &room,
|
|
const depth_range_closure &closure)
|
|
{
|
|
room::messages it
|
|
{
|
|
room
|
|
};
|
|
|
|
if(!it)
|
|
return true;
|
|
|
|
event::idx idx{0};
|
|
for(depth_range range{0L, it.depth()}; it; --it)
|
|
{
|
|
range.first = it.depth();
|
|
if(range.first == range.second)
|
|
{
|
|
idx = it.event_idx();
|
|
continue;
|
|
}
|
|
|
|
--range.second;
|
|
if(range.first == range.second)
|
|
{
|
|
idx = it.event_idx();
|
|
continue;
|
|
}
|
|
|
|
if(!closure({range.first+1, range.second+1}, idx))
|
|
return false;
|
|
|
|
range.second = range.first;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
ircd::m::for_each_depth_gap(const room &room,
|
|
const depth_range_closure &closure)
|
|
{
|
|
room::messages it
|
|
{
|
|
room, int64_t(0L)
|
|
};
|
|
|
|
for(depth_range range{0L, 0L}; it; ++it)
|
|
{
|
|
range.second = it.depth();
|
|
if(range.first == range.second)
|
|
continue;
|
|
|
|
++range.first;
|
|
if(range.first == range.second)
|
|
continue;
|
|
|
|
if(!closure(range, it.event_idx()))
|
|
return false;
|
|
|
|
range.first = range.second;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
size_t
|
|
ircd::m::count_since(const m::event::id &a,
|
|
const m::event::id &b)
|
|
{
|
|
return count_since(index(a), index(b));
|
|
}
|
|
|
|
size_t
|
|
ircd::m::count_since(const m::event::idx &a,
|
|
const m::event::idx &b)
|
|
{
|
|
// Get the room_id from b here; a might not be in the same room but downstream
|
|
// the counter seeks to a in the given room and will properly fail there.
|
|
room::id::buf room_id
|
|
{
|
|
m::get(std::max(a, b), "room_id", room_id)
|
|
};
|
|
|
|
return count_since(room_id, a, b);
|
|
}
|
|
|
|
size_t
|
|
ircd::m::count_since(const room &room,
|
|
const m::event::id &a,
|
|
const m::event::id &b)
|
|
{
|
|
return count_since(room, index(a), index(b));
|
|
}
|
|
|
|
size_t
|
|
ircd::m::count_since(const m::room &room,
|
|
const m::event::idx &a,
|
|
const m::event::idx &b)
|
|
{
|
|
m::room::messages it
|
|
{
|
|
room
|
|
};
|
|
|
|
assert(a <= b);
|
|
it.seek_idx(a);
|
|
|
|
if(!it && !exists(room))
|
|
throw m::NOT_FOUND
|
|
{
|
|
"Cannot find room '%s' to count events in",
|
|
string_view{room.room_id}
|
|
};
|
|
else if(!it)
|
|
throw m::NOT_FOUND
|
|
{
|
|
"Event @ idx:%lu or idx:%lu not found in room '%s' or at all",
|
|
a,
|
|
b,
|
|
string_view{room.room_id}
|
|
};
|
|
|
|
size_t ret{0};
|
|
// Hit the iterator once first otherwise the count will always increment
|
|
// to `1` erroneously when it ought to show `0`.
|
|
for(++it; it && it.event_idx() < b; ++it, ++ret);
|
|
return ret;
|
|
}
|
|
|
|
ircd::m::id::room::buf
|
|
ircd::m::room_id(const id::room_alias &room_alias)
|
|
{
|
|
char buf[m::id::MAX_SIZE + 1];
|
|
static_assert(sizeof(buf) <= 256);
|
|
return room_id(buf, room_alias);
|
|
}
|
|
|
|
ircd::m::id::room::buf
|
|
ircd::m::room_id(const string_view &room_id_or_alias)
|
|
{
|
|
char buf[m::id::MAX_SIZE + 1];
|
|
static_assert(sizeof(buf) <= 256);
|
|
return room_id(buf, room_id_or_alias);
|
|
}
|
|
|
|
ircd::m::id::room
|
|
ircd::m::room_id(const mutable_buffer &out,
|
|
const string_view &room_id_or_alias)
|
|
{
|
|
switch(m::sigil(room_id_or_alias))
|
|
{
|
|
case id::ROOM:
|
|
return id::room{out, room_id_or_alias};
|
|
|
|
case id::USER:
|
|
{
|
|
const m::user::room user_room(room_id_or_alias);
|
|
return string_view{data(out), copy(out, user_room.room_id)};
|
|
}
|
|
|
|
default:
|
|
return room_id(out, id::room_alias{room_id_or_alias});
|
|
}
|
|
}
|
|
|
|
ircd::m::id::room
|
|
ircd::m::room_id(const mutable_buffer &out,
|
|
const id::room_alias &room_alias)
|
|
{
|
|
room::id ret;
|
|
room::aliases::cache::get(room_alias, [&out, &ret]
|
|
(const room::id &room_id)
|
|
{
|
|
ret = string_view { data(out), copy(out, room_id) };
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::exists(const id::room_alias &room_alias,
|
|
const bool &remote_query)
|
|
{
|
|
if(room::aliases::cache::has(room_alias))
|
|
return true;
|
|
|
|
if(!remote_query)
|
|
return false;
|
|
|
|
return room::aliases::cache::get(std::nothrow, room_alias, [](const room::id &room_id) {});
|
|
}
|
|
|
|
int64_t
|
|
ircd::m::depth(const id::room &room_id)
|
|
{
|
|
return std::get<int64_t>(top(room_id));
|
|
}
|
|
|
|
int64_t
|
|
ircd::m::depth(std::nothrow_t,
|
|
const id::room &room_id)
|
|
{
|
|
const auto it
|
|
{
|
|
dbs::room_events.begin(room_id)
|
|
};
|
|
|
|
if(!it)
|
|
return -1;
|
|
|
|
const auto part
|
|
{
|
|
dbs::room_events_key(it->first)
|
|
};
|
|
|
|
return std::get<0>(part);
|
|
}
|
|
|
|
ircd::m::event::idx
|
|
ircd::m::head_idx(const id::room &room_id)
|
|
{
|
|
return std::get<event::idx>(top(room_id));
|
|
}
|
|
|
|
ircd::m::event::idx
|
|
ircd::m::head_idx(std::nothrow_t,
|
|
const id::room &room_id)
|
|
{
|
|
const auto it
|
|
{
|
|
dbs::room_events.begin(room_id)
|
|
};
|
|
|
|
if(!it)
|
|
return 0;
|
|
|
|
const auto part
|
|
{
|
|
dbs::room_events_key(it->first)
|
|
};
|
|
|
|
return std::get<1>(part);
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::head(const id::room &room_id)
|
|
{
|
|
return std::get<event::id::buf>(top(room_id));
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::head(std::nothrow_t,
|
|
const id::room &room_id)
|
|
{
|
|
return std::get<event::id::buf>(top(std::nothrow, room_id));
|
|
}
|
|
|
|
std::tuple<ircd::m::event::id::buf, int64_t, ircd::m::event::idx>
|
|
ircd::m::top(const id::room &room_id)
|
|
{
|
|
const auto ret
|
|
{
|
|
top(std::nothrow, room_id)
|
|
};
|
|
|
|
if(std::get<int64_t>(ret) == -1)
|
|
throw m::NOT_FOUND
|
|
{
|
|
"No head for room %s", string_view{room_id}
|
|
};
|
|
|
|
return ret;
|
|
}
|
|
|
|
std::tuple<ircd::m::event::id::buf, int64_t, ircd::m::event::idx>
|
|
ircd::m::top(std::nothrow_t,
|
|
const id::room &room_id)
|
|
{
|
|
const auto it
|
|
{
|
|
dbs::room_events.begin(room_id)
|
|
};
|
|
|
|
if(!it)
|
|
return
|
|
{
|
|
event::id::buf{}, -1, 0
|
|
};
|
|
|
|
const auto part
|
|
{
|
|
dbs::room_events_key(it->first)
|
|
};
|
|
|
|
const int64_t &depth
|
|
{
|
|
int64_t(std::get<0>(part))
|
|
};
|
|
|
|
const event::idx &event_idx
|
|
{
|
|
std::get<1>(part)
|
|
};
|
|
|
|
std::tuple<event::id::buf, int64_t, event::idx> ret
|
|
{
|
|
event::id::buf{}, depth, event_idx
|
|
};
|
|
|
|
event::fetch::event_id(event_idx, std::nothrow, [&ret]
|
|
(const event::id &event_id)
|
|
{
|
|
std::get<event::id::buf>(ret) = event_id;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
ircd::string_view
|
|
ircd::m::version(const mutable_buffer &buf,
|
|
const room &room)
|
|
{
|
|
const auto ret
|
|
{
|
|
version(buf, room, std::nothrow)
|
|
};
|
|
|
|
if(!ret)
|
|
throw m::NOT_FOUND
|
|
{
|
|
"Failed to find room %s to query its version",
|
|
string_view{room.room_id}
|
|
};
|
|
|
|
return ret;
|
|
}
|
|
|
|
ircd::string_view
|
|
ircd::m::version(const mutable_buffer &buf,
|
|
const room &room,
|
|
std::nothrow_t)
|
|
{
|
|
string_view ret;
|
|
const auto event_idx
|
|
{
|
|
room.get(std::nothrow, "m.room.create", "")
|
|
};
|
|
|
|
if(!event_idx)
|
|
return ret;
|
|
|
|
m::get(std::nothrow, event_idx, "content", [&ret]
|
|
(const json::object &content)
|
|
{
|
|
ret = unquote(content.get("version", "1"));
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::creator(const id::room &room_id,
|
|
const id::user &user_id)
|
|
{
|
|
const auto creator_user_id
|
|
{
|
|
creator(room_id)
|
|
};
|
|
|
|
return creator_user_id == user_id;
|
|
}
|
|
|
|
ircd::m::id::user::buf
|
|
ircd::m::creator(const id::room &room_id)
|
|
{
|
|
// Query the sender field of the event to get the creator. This is for
|
|
// future compatibility if the content.creator field gets eliminated.
|
|
static const event::fetch::opts fopts
|
|
{
|
|
event::keys::include
|
|
{
|
|
"sender",
|
|
}
|
|
};
|
|
|
|
const room::state state
|
|
{
|
|
room_id, &fopts
|
|
};
|
|
|
|
id::user::buf ret;
|
|
state.get("m.room.create", "", [&ret]
|
|
(const m::event &event)
|
|
{
|
|
ret = user::id
|
|
{
|
|
json::get<"sender"_>(event)
|
|
};
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::federate(const id::room &room_id)
|
|
{
|
|
static const m::event::fetch::opts fopts
|
|
{
|
|
event::keys::include
|
|
{
|
|
"content",
|
|
}
|
|
};
|
|
|
|
const m::room::state state
|
|
{
|
|
room_id, &fopts
|
|
};
|
|
|
|
bool ret;
|
|
state.get("m.room.create", "", [&ret]
|
|
(const m::event &event)
|
|
{
|
|
ret = json::get<"content"_>(event).get("m.federate", true);
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::exists(const id::room &room_id)
|
|
{
|
|
const auto it
|
|
{
|
|
dbs::room_events.begin(room_id)
|
|
};
|
|
|
|
return bool(it);
|
|
}
|
|
|
|
bool
|
|
ircd::m::exists(const room &room)
|
|
{
|
|
return exists(room.room_id);
|
|
}
|
|
|
|
bool
|
|
ircd::m::operator==(const room &a, const room &b)
|
|
{
|
|
return !(a != b);
|
|
}
|
|
|
|
bool
|
|
ircd::m::operator!=(const room &a, const room &b)
|
|
{
|
|
return a.room_id != b.room_id;
|
|
}
|
|
|
|
bool
|
|
ircd::m::operator!(const room &a)
|
|
{
|
|
return !a.room_id;
|
|
}
|
|
|
|
bool
|
|
ircd::m::my(const room &room)
|
|
{
|
|
return my(room.room_id);
|
|
}
|
|
|
|
//
|
|
// room
|
|
//
|
|
|
|
/// A room index is just the event::idx of its create event.
|
|
ircd::m::event::idx
|
|
ircd::m::room::index(const room::id &room_id)
|
|
{
|
|
const auto ret
|
|
{
|
|
index(room_id, std::nothrow)
|
|
};
|
|
|
|
if(!ret)
|
|
throw m::NOT_FOUND
|
|
{
|
|
"No index for room %s", string_view{room_id}
|
|
};
|
|
|
|
return ret;
|
|
}
|
|
|
|
ircd::m::event::idx
|
|
ircd::m::room::index(const room::id &room_id,
|
|
std::nothrow_t)
|
|
{
|
|
uint64_t depth{0};
|
|
room::messages it
|
|
{
|
|
room_id, depth
|
|
};
|
|
|
|
return it? it.event_idx() : 0;
|
|
}
|
|
|
|
//
|
|
// room::room
|
|
//
|
|
|
|
ircd::m::id::user::buf
|
|
ircd::m::room::any_user(const string_view &host,
|
|
const string_view &membership)
|
|
const
|
|
{
|
|
user::id::buf ret;
|
|
const members members{*this};
|
|
members.for_each(membership, members::closure_bool{[&host, &ret]
|
|
(const id::user &user_id)
|
|
{
|
|
if(host && user_id.host() != host)
|
|
return true;
|
|
|
|
ret = user_id;
|
|
return false;
|
|
}});
|
|
|
|
return ret;
|
|
}
|
|
|
|
/// Test of the join_rule of the room is the argument.
|
|
bool
|
|
ircd::m::room::join_rule(const string_view &rule)
|
|
const
|
|
{
|
|
char buf[32];
|
|
return join_rule(mutable_buffer{buf}) == rule;
|
|
}
|
|
|
|
/// Receive the join_rule of the room into buffer of sufficient size.
|
|
/// The protocol does not specify a join_rule string longer than 7
|
|
/// characters but do be considerate of the future. This function
|
|
/// properly defaults the string as per the protocol spec.
|
|
ircd::string_view
|
|
ircd::m::room::join_rule(const mutable_buffer &out)
|
|
const
|
|
{
|
|
static const string_view default_join_rule
|
|
{
|
|
"invite"
|
|
};
|
|
|
|
string_view ret
|
|
{
|
|
default_join_rule
|
|
};
|
|
|
|
const event::keys::include keys
|
|
{
|
|
"content"
|
|
};
|
|
|
|
const m::event::fetch::opts fopts
|
|
{
|
|
keys, this->fopts? this->fopts->gopts : db::gopts{}
|
|
};
|
|
|
|
const room::state state
|
|
{
|
|
*this, &fopts
|
|
};
|
|
|
|
state.get(std::nothrow, "m.room.join_rules", "", [&ret, &out]
|
|
(const m::event &event)
|
|
{
|
|
const auto &content
|
|
{
|
|
json::get<"content"_>(event)
|
|
};
|
|
|
|
const string_view &rule
|
|
{
|
|
content.get("join_rule", default_join_rule)
|
|
};
|
|
|
|
ret = string_view
|
|
{
|
|
data(out), copy(out, unquote(rule))
|
|
};
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
/// The only joined members are from our origin (local only). This indicates
|
|
/// we won't have any other federation servers to query for room data, nor do
|
|
/// we need to broadcast events to the federation. This is not an authority
|
|
/// about a room's type or ability to federate. Returned value changes to false
|
|
/// when another origin joins.
|
|
bool
|
|
ircd::m::room::lonly()
|
|
const
|
|
{
|
|
const origins origins(*this);
|
|
return origins.only(my_host());
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::visible(const string_view &mxid,
|
|
const event *const &event)
|
|
const
|
|
{
|
|
if(event)
|
|
return m::visible(*event, mxid);
|
|
|
|
const m::event event_
|
|
{
|
|
{ "event_id", event_id },
|
|
{ "room_id", room_id },
|
|
};
|
|
|
|
return m::visible(event_, mxid);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::membership(const m::id::user &user_id,
|
|
const string_view &membership)
|
|
const
|
|
{
|
|
char buf[64];
|
|
return this->membership(buf, user_id) == membership;
|
|
}
|
|
|
|
ircd::string_view
|
|
ircd::m::room::membership(const mutable_buffer &out,
|
|
const m::id::user &user_id)
|
|
const
|
|
{
|
|
string_view ret;
|
|
const room::state state{*this};
|
|
state.get(std::nothrow, "m.room.member", user_id, [&out, &ret]
|
|
(const event::idx &event_idx)
|
|
{
|
|
m::get(std::nothrow, event_idx, "content", [&out, &ret]
|
|
(const json::object &content)
|
|
{
|
|
ret =
|
|
{
|
|
data(out), copy(out, unquote(content.get("membership")))
|
|
};
|
|
});
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::has(const string_view &type)
|
|
const
|
|
{
|
|
return get(std::nothrow, type, event::closure{});
|
|
}
|
|
|
|
void
|
|
ircd::m::room::get(const string_view &type,
|
|
const event::closure &closure)
|
|
const
|
|
{
|
|
if(!get(std::nothrow, type, closure))
|
|
throw m::NOT_FOUND
|
|
{
|
|
"No events of type '%s' found in '%s'",
|
|
type,
|
|
room_id
|
|
};
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::get(std::nothrow_t,
|
|
const string_view &type,
|
|
const event::closure &closure)
|
|
const
|
|
{
|
|
bool ret{false};
|
|
for_each(type, event::closure_bool{[&ret, &closure]
|
|
(const event &event)
|
|
{
|
|
if(closure)
|
|
closure(event);
|
|
|
|
ret = true;
|
|
return false;
|
|
}});
|
|
|
|
return ret;
|
|
}
|
|
|
|
ircd::m::event::idx
|
|
ircd::m::room::get(const string_view &type,
|
|
const string_view &state_key)
|
|
const
|
|
{
|
|
return state(*this).get(type, state_key);
|
|
}
|
|
|
|
ircd::m::event::idx
|
|
ircd::m::room::get(std::nothrow_t,
|
|
const string_view &type,
|
|
const string_view &state_key)
|
|
const
|
|
{
|
|
return state(*this).get(std::nothrow, type, state_key);
|
|
}
|
|
|
|
void
|
|
ircd::m::room::get(const string_view &type,
|
|
const string_view &state_key,
|
|
const event::closure &closure)
|
|
const
|
|
{
|
|
const state state{*this};
|
|
state.get(type, state_key, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::get(std::nothrow_t,
|
|
const string_view &type,
|
|
const string_view &state_key,
|
|
const event::closure &closure)
|
|
const
|
|
{
|
|
const state state{*this};
|
|
return state.get(std::nothrow, type, state_key, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::has(const string_view &type,
|
|
const string_view &state_key)
|
|
const
|
|
{
|
|
const state state{*this};
|
|
return state.has(type, state_key);
|
|
}
|
|
|
|
void
|
|
ircd::m::room::for_each(const event::closure &closure)
|
|
const
|
|
{
|
|
for_each(string_view{}, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::for_each(const event::closure_bool &closure)
|
|
const
|
|
{
|
|
return for_each(string_view{}, closure);
|
|
}
|
|
|
|
void
|
|
ircd::m::room::for_each(const event::id::closure &closure)
|
|
const
|
|
{
|
|
for_each(string_view{}, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::for_each(const event::id::closure_bool &closure)
|
|
const
|
|
{
|
|
return for_each(string_view{}, closure);
|
|
}
|
|
|
|
void
|
|
ircd::m::room::for_each(const event::closure_idx &closure)
|
|
const
|
|
{
|
|
for_each(string_view{}, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::for_each(const event::closure_idx_bool &closure)
|
|
const
|
|
{
|
|
return for_each(string_view{}, closure);
|
|
}
|
|
|
|
void
|
|
ircd::m::room::for_each(const string_view &type,
|
|
const event::closure &closure)
|
|
const
|
|
{
|
|
for_each(type, event::closure_bool{[&closure]
|
|
(const event &event)
|
|
{
|
|
closure(event);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::for_each(const string_view &type,
|
|
const event::closure_bool &closure)
|
|
const
|
|
{
|
|
event::fetch event
|
|
{
|
|
fopts? *fopts : event::fetch::default_opts
|
|
};
|
|
|
|
return for_each(type, event::closure_idx_bool{[&closure, &event]
|
|
(const event::idx &event_idx)
|
|
{
|
|
if(!seek(event, event_idx, std::nothrow))
|
|
return true;
|
|
|
|
return closure(event);
|
|
}});
|
|
}
|
|
|
|
void
|
|
ircd::m::room::for_each(const string_view &type,
|
|
const event::id::closure &closure)
|
|
const
|
|
{
|
|
for_each(type, event::id::closure_bool{[&closure]
|
|
(const event::id &event_id)
|
|
{
|
|
closure(event_id);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::for_each(const string_view &type,
|
|
const event::id::closure_bool &closure)
|
|
const
|
|
{
|
|
return for_each(type, event::closure_idx_bool{[&closure]
|
|
(const event::idx &idx)
|
|
{
|
|
bool ret{true};
|
|
event::fetch::event_id(idx, std::nothrow, [&ret, &closure]
|
|
(const event::id &event_id)
|
|
{
|
|
ret = closure(event_id);
|
|
});
|
|
|
|
return ret;
|
|
}});
|
|
}
|
|
|
|
void
|
|
ircd::m::room::for_each(const string_view &type,
|
|
const event::closure_idx &closure)
|
|
const
|
|
{
|
|
for_each(type, event::closure_idx_bool{[&closure]
|
|
(const event::idx &idx)
|
|
{
|
|
closure(idx);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::for_each(const string_view &type,
|
|
const event::closure_idx_bool &closure)
|
|
const
|
|
{
|
|
static constexpr auto idx
|
|
{
|
|
json::indexof<event, "type"_>()
|
|
};
|
|
|
|
auto &column
|
|
{
|
|
dbs::event_column.at(idx)
|
|
};
|
|
|
|
messages it{*this};
|
|
for(; it; --it)
|
|
{
|
|
const auto &event_idx
|
|
{
|
|
it.event_idx()
|
|
};
|
|
|
|
bool match
|
|
{
|
|
empty(type) // allow empty type to always match and bypass query
|
|
};
|
|
|
|
if(!match)
|
|
column(byte_view<string_view>(event_idx), std::nothrow, [&match, &type]
|
|
(const string_view &value)
|
|
{
|
|
match = value == type;
|
|
});
|
|
|
|
if(match)
|
|
if(!closure(event_idx))
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
//
|
|
// room::timeline
|
|
//
|
|
|
|
uint64_t
|
|
ircd::m::latency(const room::timeline &a,
|
|
const room::timeline &b)
|
|
{
|
|
return 0UL;
|
|
}
|
|
|
|
//
|
|
// room::timeline::timeline
|
|
//
|
|
|
|
ircd::m::room::timeline::timeline(const m::room &room)
|
|
:room{room}
|
|
{
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::timeline::for_each(const closure &closure,
|
|
const coord &branch)
|
|
const
|
|
{
|
|
m::event::refs refs
|
|
{
|
|
room.event_id?
|
|
index(room.event_id):
|
|
room::index(room)
|
|
};
|
|
|
|
if(!refs.idx)
|
|
return true;
|
|
|
|
timeline::coord coord;
|
|
if(!closure(coord, refs.idx))
|
|
return false;
|
|
|
|
for(++coord.y; coord.y <= branch.y; ++coord.y, coord.x = 0)
|
|
{
|
|
auto idx(0);
|
|
refs.for_each(dbs::ref::NEXT, [&coord, &branch, &idx]
|
|
(const auto &event_idx, const auto &)
|
|
{
|
|
if(coord.x <= branch.x)
|
|
idx = event_idx;
|
|
|
|
if(coord.x < branch.x)
|
|
{
|
|
++coord.x;
|
|
return true;
|
|
}
|
|
else return false;
|
|
});
|
|
|
|
if(!idx)
|
|
return true;
|
|
|
|
if(!closure(coord, idx))
|
|
return false;
|
|
|
|
refs.idx = idx;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::timeline::has_future(const event::id &event_id)
|
|
const
|
|
{
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::timeline::has_past(const event::id &event_id)
|
|
const
|
|
{
|
|
|
|
return true;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::timeline::rebuild(const m::room &room)
|
|
{
|
|
m::room::messages it
|
|
{
|
|
room, 0UL
|
|
};
|
|
|
|
if(!it)
|
|
return;
|
|
|
|
db::txn txn
|
|
{
|
|
*m::dbs::events
|
|
};
|
|
|
|
for(; it; ++it)
|
|
{
|
|
const m::event &event{*it};
|
|
m::dbs::write_opts opts;
|
|
opts.event_idx = it.event_idx();
|
|
opts.appendix.reset();
|
|
opts.appendix.set(dbs::appendix::EVENT_REFS);
|
|
opts.event_refs.reset();
|
|
opts.event_refs.set(uint(dbs::ref::NEXT));
|
|
m::dbs::write(txn, event, opts);
|
|
}
|
|
|
|
txn();
|
|
}
|
|
|
|
//
|
|
// room::messages
|
|
//
|
|
|
|
ircd::m::room::messages::messages(const m::room &room,
|
|
const event::fetch::opts *const &fopts)
|
|
:room{room}
|
|
,_event
|
|
{
|
|
fopts?
|
|
*fopts:
|
|
room.fopts?
|
|
*room.fopts:
|
|
event::fetch::default_opts
|
|
}
|
|
{
|
|
if(room.event_id)
|
|
seek(room.event_id);
|
|
else
|
|
seek();
|
|
}
|
|
|
|
ircd::m::room::messages::messages(const m::room &room,
|
|
const event::id &event_id,
|
|
const event::fetch::opts *const &fopts)
|
|
:room{room}
|
|
,_event
|
|
{
|
|
fopts?
|
|
*fopts:
|
|
room.fopts?
|
|
*room.fopts:
|
|
event::fetch::default_opts
|
|
}
|
|
{
|
|
seek(event_id);
|
|
}
|
|
|
|
ircd::m::room::messages::messages(const m::room &room,
|
|
const uint64_t &depth,
|
|
const event::fetch::opts *const &fopts)
|
|
:room{room}
|
|
,_event
|
|
{
|
|
fopts?
|
|
*fopts:
|
|
room.fopts?
|
|
*room.fopts:
|
|
event::fetch::default_opts
|
|
}
|
|
{
|
|
// As a special convenience for the ctor only, if the depth=0 and
|
|
// nothing is found another attempt is made for depth=1 for synapse
|
|
// rooms which start at depth=1.
|
|
if(!seek(depth) && depth == 0)
|
|
seek(1);
|
|
}
|
|
|
|
const ircd::m::event &
|
|
ircd::m::room::messages::operator*()
|
|
{
|
|
return fetch(std::nothrow);
|
|
};
|
|
|
|
bool
|
|
ircd::m::room::messages::seek(const event::id &event_id)
|
|
{
|
|
const event::idx &event_idx
|
|
{
|
|
m::index(event_id, std::nothrow)
|
|
};
|
|
|
|
return event_idx?
|
|
seek_idx(event_idx):
|
|
false;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::messages::seek(const uint64_t &depth)
|
|
{
|
|
char buf[dbs::ROOM_EVENTS_KEY_MAX_SIZE];
|
|
const string_view seek_key
|
|
{
|
|
depth != uint64_t(-1)?
|
|
dbs::room_events_key(buf, room.room_id, depth):
|
|
room.room_id
|
|
};
|
|
|
|
this->it = dbs::room_events.begin(seek_key);
|
|
return bool(*this);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::messages::seek_idx(const event::idx &event_idx)
|
|
try
|
|
{
|
|
uint64_t depth(0);
|
|
if(event_idx)
|
|
m::get(event_idx, "depth", mutable_buffer
|
|
{
|
|
reinterpret_cast<char *>(&depth), sizeof(depth)
|
|
});
|
|
|
|
char buf[dbs::ROOM_EVENTS_KEY_MAX_SIZE];
|
|
const auto &seek_key
|
|
{
|
|
dbs::room_events_key(buf, room.room_id, depth, event_idx)
|
|
};
|
|
|
|
this->it = dbs::room_events.begin(seek_key);
|
|
if(!bool(*this))
|
|
return false;
|
|
|
|
// Check if this event_idx is actually in this room
|
|
if(event_idx && event_idx != this->event_idx())
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
catch(const db::not_found &e)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
ircd::m::room::messages::operator
|
|
ircd::m::event::idx()
|
|
const
|
|
{
|
|
return event_idx();
|
|
}
|
|
|
|
ircd::m::event::id::buf
|
|
ircd::m::room::messages::event_id()
|
|
const
|
|
{
|
|
event::id::buf ret;
|
|
event::fetch::event_id(this->event_idx(), [&ret]
|
|
(const event::id &event_id)
|
|
{
|
|
ret = event_id;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
ircd::string_view
|
|
ircd::m::room::messages::state_root()
|
|
const
|
|
{
|
|
assert(bool(*this));
|
|
return it->second;
|
|
}
|
|
|
|
uint64_t
|
|
ircd::m::room::messages::depth()
|
|
const
|
|
{
|
|
assert(bool(*this));
|
|
const auto part
|
|
{
|
|
dbs::room_events_key(it->first)
|
|
};
|
|
|
|
return std::get<0>(part);
|
|
}
|
|
|
|
ircd::m::event::idx
|
|
ircd::m::room::messages::event_idx()
|
|
const
|
|
{
|
|
assert(bool(*this));
|
|
const auto part
|
|
{
|
|
dbs::room_events_key(it->first)
|
|
};
|
|
|
|
return std::get<1>(part);
|
|
}
|
|
|
|
const ircd::m::event &
|
|
ircd::m::room::messages::fetch()
|
|
{
|
|
m::seek(_event, event_idx());
|
|
return _event;
|
|
}
|
|
|
|
const ircd::m::event &
|
|
ircd::m::room::messages::fetch(std::nothrow_t)
|
|
{
|
|
m::seek(_event, event_idx(), std::nothrow);
|
|
return _event;
|
|
}
|
|
|
|
//
|
|
// room::state
|
|
//
|
|
|
|
decltype(ircd::m::room::state::disable_history)
|
|
ircd::m::room::state::disable_history
|
|
{
|
|
{ "name", "ircd.m.room.state.disable_history" },
|
|
{ "default", true },
|
|
};
|
|
|
|
decltype(ircd::m::room::state::readahead_size)
|
|
ircd::m::room::state::readahead_size
|
|
{
|
|
{ "name", "ircd.m.room.state.readahead_size" },
|
|
{ "default", 0L },
|
|
};
|
|
|
|
//
|
|
// room::state::state
|
|
//
|
|
|
|
ircd::m::room::state::state(const m::room &room,
|
|
const event::fetch::opts *const &fopts)
|
|
:room_id
|
|
{
|
|
room.room_id
|
|
}
|
|
,event_id
|
|
{
|
|
room.event_id?
|
|
event::id::buf{room.event_id}:
|
|
event::id::buf{}
|
|
}
|
|
,root_id
|
|
{
|
|
event_id && !bool(disable_history)?
|
|
dbs::state_root(root_id_buf, room_id, event_id):
|
|
m::state::id{}
|
|
}
|
|
,fopts
|
|
{
|
|
fopts?
|
|
fopts:
|
|
room.fopts
|
|
}
|
|
{
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::state::prefetch(const event::idx &start,
|
|
const event::idx &stop)
|
|
const
|
|
{
|
|
return prefetch(string_view{}, start, stop);
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::state::prefetch(const string_view &type,
|
|
const event::idx &start,
|
|
const event::idx &stop)
|
|
const
|
|
{
|
|
return prefetch(*this, type, event::idx_range{start, stop});
|
|
}
|
|
|
|
ircd::m::event::idx
|
|
ircd::m::room::state::get(const string_view &type,
|
|
const string_view &state_key)
|
|
const
|
|
{
|
|
event::idx ret;
|
|
get(type, state_key, event::closure_idx{[&ret]
|
|
(const event::idx &event_idx)
|
|
{
|
|
ret = event_idx;
|
|
}});
|
|
|
|
return ret;
|
|
}
|
|
|
|
ircd::m::event::idx
|
|
ircd::m::room::state::get(std::nothrow_t,
|
|
const string_view &type,
|
|
const string_view &state_key)
|
|
const
|
|
{
|
|
event::idx ret{0};
|
|
get(std::nothrow, type, state_key, event::closure_idx{[&ret]
|
|
(const event::idx &event_idx)
|
|
{
|
|
ret = event_idx;
|
|
}});
|
|
|
|
return ret;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::state::get(const string_view &type,
|
|
const string_view &state_key,
|
|
const event::closure &closure)
|
|
const
|
|
{
|
|
get(type, state_key, event::closure_idx{[this, &closure]
|
|
(const event::idx &event_idx)
|
|
{
|
|
const event::fetch event
|
|
{
|
|
event_idx, fopts? *fopts : event::fetch::default_opts
|
|
};
|
|
|
|
closure(event);
|
|
}});
|
|
}
|
|
|
|
void
|
|
ircd::m::room::state::get(const string_view &type,
|
|
const string_view &state_key,
|
|
const event::id::closure &closure)
|
|
const try
|
|
{
|
|
if(!present())
|
|
return m::state::get(root_id, type, state_key, [&closure]
|
|
(const string_view &event_id)
|
|
{
|
|
closure(unquote(event_id));
|
|
});
|
|
|
|
get(type, state_key, event::closure_idx{[&closure]
|
|
(const event::idx &idx)
|
|
{
|
|
event::fetch::event_id(idx, closure);
|
|
}});
|
|
}
|
|
catch(const db::not_found &e)
|
|
{
|
|
throw m::NOT_FOUND
|
|
{
|
|
"(%s,%s) in %s :%s",
|
|
type,
|
|
state_key,
|
|
string_view{room_id},
|
|
e.what()
|
|
};
|
|
}
|
|
|
|
void
|
|
ircd::m::room::state::get(const string_view &type,
|
|
const string_view &state_key,
|
|
const event::closure_idx &closure)
|
|
const try
|
|
{
|
|
if(!present())
|
|
m::state::get(root_id, type, state_key, [&closure]
|
|
(const string_view &event_id)
|
|
{
|
|
closure(index(m::event::id(unquote(event_id))));
|
|
});
|
|
|
|
auto &column{dbs::room_state};
|
|
char key[dbs::ROOM_STATE_KEY_MAX_SIZE];
|
|
column(dbs::room_state_key(key, room_id, type, state_key), [&closure]
|
|
(const string_view &value)
|
|
{
|
|
closure(byte_view<event::idx>(value));
|
|
});
|
|
}
|
|
catch(const db::not_found &e)
|
|
{
|
|
throw m::NOT_FOUND
|
|
{
|
|
"(%s,%s) in %s :%s",
|
|
type,
|
|
state_key,
|
|
string_view{room_id},
|
|
e.what()
|
|
};
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::get(std::nothrow_t,
|
|
const string_view &type,
|
|
const string_view &state_key,
|
|
const event::closure &closure)
|
|
const
|
|
{
|
|
return get(std::nothrow, type, state_key, event::closure_idx{[this, &closure]
|
|
(const event::idx &event_idx)
|
|
{
|
|
const event::fetch event
|
|
{
|
|
event_idx, std::nothrow, fopts? *fopts : event::fetch::default_opts
|
|
};
|
|
|
|
closure(event);
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::get(std::nothrow_t,
|
|
const string_view &type,
|
|
const string_view &state_key,
|
|
const event::id::closure &closure)
|
|
const
|
|
{
|
|
if(!present())
|
|
return m::state::get(std::nothrow, root_id, type, state_key, [&closure]
|
|
(const string_view &event_id)
|
|
{
|
|
closure(unquote(event_id));
|
|
});
|
|
|
|
return get(std::nothrow, type, state_key, event::closure_idx{[&closure]
|
|
(const event::idx &idx)
|
|
{
|
|
event::fetch::event_id(idx, std::nothrow, closure);
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::get(std::nothrow_t,
|
|
const string_view &type,
|
|
const string_view &state_key,
|
|
const event::closure_idx &closure)
|
|
const
|
|
{
|
|
if(!present())
|
|
return m::state::get(std::nothrow, root_id, type, state_key, [&closure]
|
|
(const string_view &event_id)
|
|
{
|
|
return closure(index(m::event::id(unquote(event_id)), std::nothrow));
|
|
});
|
|
|
|
auto &column{dbs::room_state};
|
|
char key[dbs::ROOM_STATE_KEY_MAX_SIZE];
|
|
return column(dbs::room_state_key(key, room_id, type, state_key), std::nothrow, [&closure]
|
|
(const string_view &value)
|
|
{
|
|
closure(byte_view<event::idx>(value));
|
|
});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::has(const string_view &type)
|
|
const
|
|
{
|
|
return for_each(type, event::id::closure_bool{[](const m::event::id &)
|
|
{
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::has(const string_view &type,
|
|
const string_view &state_key)
|
|
const
|
|
{
|
|
if(!present())
|
|
return m::state::get(std::nothrow, root_id, type, state_key, []
|
|
(const string_view &event_id)
|
|
{});
|
|
|
|
auto &column{dbs::room_state};
|
|
char key[dbs::ROOM_STATE_KEY_MAX_SIZE];
|
|
return db::has(column, dbs::room_state_key(key, room_id, type, state_key));
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::state::count()
|
|
const
|
|
{
|
|
return count(string_view{});
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::state::count(const string_view &type)
|
|
const
|
|
{
|
|
if(!present())
|
|
return m::state::count(root_id, type);
|
|
|
|
size_t ret{0};
|
|
for_each(type, event::closure_idx{[&ret]
|
|
(const event::idx &event_idx)
|
|
{
|
|
++ret;
|
|
}});
|
|
|
|
return ret;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::state::for_each(const event::closure &closure)
|
|
const
|
|
{
|
|
for_each(event::closure_bool{[&closure]
|
|
(const m::event &event)
|
|
{
|
|
closure(event);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const event::closure_bool &closure)
|
|
const
|
|
{
|
|
event::fetch event
|
|
{
|
|
fopts? *fopts : event::fetch::default_opts
|
|
};
|
|
|
|
return for_each(event::closure_idx_bool{[&event, &closure]
|
|
(const event::idx &event_idx)
|
|
{
|
|
if(seek(event, event_idx, std::nothrow))
|
|
if(!closure(event))
|
|
return false;
|
|
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
void
|
|
ircd::m::room::state::for_each(const event::id::closure &closure)
|
|
const
|
|
{
|
|
for_each(event::id::closure_bool{[&closure]
|
|
(const event::id &event_id)
|
|
{
|
|
closure(event_id);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const event::id::closure_bool &closure)
|
|
const
|
|
{
|
|
if(!present())
|
|
return m::state::for_each(root_id, m::state::iter_bool_closure{[&closure]
|
|
(const json::array &key, const string_view &event_id)
|
|
{
|
|
return closure(unquote(event_id));
|
|
}});
|
|
|
|
return for_each(event::closure_idx_bool{[&closure]
|
|
(const event::idx &idx)
|
|
{
|
|
bool ret{true};
|
|
event::fetch::event_id(idx, std::nothrow, [&ret, &closure]
|
|
(const event::id &id)
|
|
{
|
|
ret = closure(id);
|
|
});
|
|
|
|
return ret;
|
|
}});
|
|
}
|
|
|
|
void
|
|
ircd::m::room::state::for_each(const event::closure_idx &closure)
|
|
const
|
|
{
|
|
for_each(event::closure_idx_bool{[&closure]
|
|
(const event::idx &event_idx)
|
|
{
|
|
closure(event_idx);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const event::closure_idx_bool &closure)
|
|
const
|
|
{
|
|
return for_each(closure_bool{[&closure]
|
|
(const string_view &type, const string_view &state_key, const event::idx &event_idx)
|
|
{
|
|
return closure(event_idx);
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const closure_bool &closure)
|
|
const
|
|
{
|
|
if(!present())
|
|
return m::state::for_each(root_id, m::state::iter_bool_closure{[&closure]
|
|
(const json::array &key, const string_view &event_id)
|
|
{
|
|
const auto idx(index(m::event::id(unquote(event_id)), std::nothrow));
|
|
return closure(key.at(0), key.at(1), idx);
|
|
}});
|
|
|
|
db::gopts opts
|
|
{
|
|
this->fopts? this->fopts->gopts : db::gopts{}
|
|
};
|
|
|
|
if(!opts.readahead)
|
|
opts.readahead = size_t(readahead_size);
|
|
|
|
auto &column{dbs::room_state};
|
|
for(auto it{column.begin(room_id, opts)}; bool(it); ++it)
|
|
{
|
|
const byte_view<event::idx> idx(it->second);
|
|
const auto key(dbs::room_state_key(it->first));
|
|
if(!closure(std::get<0>(key), std::get<1>(key), idx))
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const event::closure &closure)
|
|
const
|
|
{
|
|
for_each(type, event::closure_bool{[&closure]
|
|
(const m::event &event)
|
|
{
|
|
closure(event);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const event::closure_bool &closure)
|
|
const
|
|
{
|
|
return type?
|
|
for_each(type, string_view{}, closure):
|
|
for_each(closure);
|
|
}
|
|
|
|
void
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const event::id::closure &closure)
|
|
const
|
|
{
|
|
for_each(type, event::id::closure_bool{[&closure]
|
|
(const event::id &event_id)
|
|
{
|
|
closure(event_id);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const event::id::closure_bool &closure)
|
|
const
|
|
{
|
|
return type?
|
|
for_each(type, string_view{}, closure):
|
|
for_each(closure);
|
|
}
|
|
|
|
void
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const event::closure_idx &closure)
|
|
const
|
|
{
|
|
for_each(type, event::closure_idx_bool{[&closure]
|
|
(const event::idx &event_idx)
|
|
{
|
|
closure(event_idx);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const event::closure_idx_bool &closure)
|
|
const
|
|
{
|
|
return type?
|
|
for_each(type, string_view{}, closure):
|
|
for_each(closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const closure_bool &closure)
|
|
const
|
|
{
|
|
return type?
|
|
for_each(type, string_view{}, closure):
|
|
for_each(closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const string_view &state_key_lb,
|
|
const event::closure_bool &closure)
|
|
const
|
|
{
|
|
event::fetch event
|
|
{
|
|
fopts? *fopts : event::fetch::default_opts
|
|
};
|
|
|
|
return for_each(type, state_key_lb, event::closure_idx_bool{[&event, &closure]
|
|
(const event::idx &event_idx)
|
|
{
|
|
if(seek(event, event_idx, std::nothrow))
|
|
if(!closure(event))
|
|
return false;
|
|
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const string_view &state_key_lb,
|
|
const event::id::closure_bool &closure)
|
|
const
|
|
{
|
|
if(!present())
|
|
return m::state::for_each(root_id, type, state_key_lb, [&closure]
|
|
(const json::array &key, const string_view &event_id)
|
|
{
|
|
return closure(unquote(event_id));
|
|
});
|
|
|
|
return for_each(type, state_key_lb, event::closure_idx_bool{[&closure]
|
|
(const event::idx &idx)
|
|
{
|
|
bool ret{true};
|
|
event::fetch::event_id(idx, std::nothrow, [&ret, &closure]
|
|
(const event::id &id)
|
|
{
|
|
ret = closure(id);
|
|
});
|
|
|
|
return ret;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const string_view &state_key_lb,
|
|
const event::closure_idx_bool &closure)
|
|
const
|
|
{
|
|
return for_each(type, state_key_lb, closure_bool{[&closure]
|
|
(const string_view &type, const string_view &state_key, const event::idx &event_idx)
|
|
{
|
|
return closure(event_idx);
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const string_view &state_key_lb,
|
|
const closure_bool &closure)
|
|
const
|
|
{
|
|
if(!present())
|
|
return m::state::for_each(root_id, type, state_key_lb, [&closure]
|
|
(const json::array &key, const string_view &event_id)
|
|
{
|
|
const auto idx(index(m::event::id(unquote(event_id)), std::nothrow));
|
|
return closure(key.at(0), key.at(1), idx);
|
|
});
|
|
|
|
char keybuf[dbs::ROOM_STATE_KEY_MAX_SIZE];
|
|
const auto &key
|
|
{
|
|
dbs::room_state_key(keybuf, room_id, type, state_key_lb)
|
|
};
|
|
|
|
db::gopts opts
|
|
{
|
|
this->fopts? this->fopts->gopts : db::gopts{}
|
|
};
|
|
|
|
if(!opts.readahead)
|
|
opts.readahead = size_t(readahead_size);
|
|
|
|
auto &column{dbs::room_state};
|
|
for(auto it{column.begin(key, opts)}; bool(it); ++it)
|
|
{
|
|
const auto key
|
|
{
|
|
dbs::room_state_key(it->first)
|
|
};
|
|
|
|
if(std::get<0>(key) != type)
|
|
break;
|
|
|
|
const byte_view<event::idx> idx(it->second);
|
|
if(!closure(std::get<0>(key), std::get<1>(key), idx))
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const keys &closure)
|
|
const
|
|
{
|
|
for_each(type, keys_bool{[&closure]
|
|
(const string_view &key)
|
|
{
|
|
closure(key);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const keys_bool &closure)
|
|
const
|
|
{
|
|
return for_each(type, string_view{}, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const string_view &type,
|
|
const string_view &state_key_lb,
|
|
const keys_bool &closure)
|
|
const
|
|
{
|
|
if(!present())
|
|
return m::state::for_each(root_id, type, state_key_lb, [&closure]
|
|
(const json::array &key, const string_view &event_id)
|
|
{
|
|
assert(size(key) >= 2);
|
|
return closure(unquote(key.at(1)));
|
|
});
|
|
|
|
char keybuf[dbs::ROOM_STATE_KEY_MAX_SIZE];
|
|
const auto &key
|
|
{
|
|
dbs::room_state_key(keybuf, room_id, type, state_key_lb)
|
|
};
|
|
|
|
db::gopts opts
|
|
{
|
|
this->fopts? this->fopts->gopts : db::gopts{}
|
|
};
|
|
|
|
if(!opts.readahead)
|
|
opts.readahead = size_t(readahead_size);
|
|
|
|
auto &column{dbs::room_state};
|
|
for(auto it{column.begin(key, opts)}; bool(it); ++it)
|
|
{
|
|
const auto key
|
|
{
|
|
dbs::room_state_key(it->first)
|
|
};
|
|
|
|
if(std::get<0>(key) != type)
|
|
break;
|
|
|
|
if(!closure(std::get<1>(key)))
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const type_prefix &prefix,
|
|
const types_bool &closure)
|
|
const
|
|
{
|
|
bool ret(true), cont(true);
|
|
for_each(types_bool([&prefix, &closure, &ret, &cont]
|
|
(const string_view &type)
|
|
{
|
|
if(!startswith(type, string_view(prefix)))
|
|
return cont;
|
|
|
|
cont = false;
|
|
ret = closure(type);
|
|
return ret;
|
|
}));
|
|
|
|
return ret;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::state::for_each(const types &closure)
|
|
const
|
|
{
|
|
for_each(types_bool{[&closure]
|
|
(const string_view &type)
|
|
{
|
|
closure(type);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::for_each(const types_bool &closure)
|
|
const
|
|
{
|
|
string_view last;
|
|
char lastbuf[m::event::TYPE_MAX_SIZE];
|
|
if(!present())
|
|
{
|
|
m::state::for_each(root_id, m::state::iter_bool_closure{[&closure, &last, &lastbuf]
|
|
(const json::array &key, const string_view &)
|
|
{
|
|
assert(size(key) >= 2);
|
|
const auto type
|
|
{
|
|
unquote(key.at(0))
|
|
};
|
|
|
|
if(type == last)
|
|
return true;
|
|
|
|
last = strlcpy(lastbuf, type);
|
|
return closure(type);
|
|
}});
|
|
|
|
return true;
|
|
}
|
|
|
|
char keybuf[dbs::ROOM_STATE_KEY_MAX_SIZE];
|
|
const auto &key
|
|
{
|
|
dbs::room_state_key(keybuf, room_id, string_view{})
|
|
};
|
|
|
|
db::gopts opts
|
|
{
|
|
this->fopts? this->fopts->gopts : db::gopts{}
|
|
};
|
|
|
|
auto &column{dbs::room_state};
|
|
for(auto it{column.begin(key, opts)}; bool(it); ++it)
|
|
{
|
|
const auto part
|
|
{
|
|
dbs::room_state_key(it->first)
|
|
};
|
|
|
|
const auto &type
|
|
{
|
|
std::get<0>(part)
|
|
};
|
|
|
|
if(type == last)
|
|
continue;
|
|
|
|
last = strlcpy(lastbuf, type);
|
|
if(!closure(type))
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
/// Figure out if this instance of room::state is presenting the current
|
|
/// "present" state of the room or the state of the room at some previous
|
|
/// event. This is an important distinction because the present state of
|
|
/// the room should provide optimal performance for the functions of this
|
|
/// interface by using the present state table. Prior states will use the
|
|
/// state btree.
|
|
bool
|
|
ircd::m::room::state::present()
|
|
const
|
|
{
|
|
// When no event_id is passed to the state constructor that immediately
|
|
// indicates the present state of the room is sought.
|
|
if(!event_id)
|
|
return true;
|
|
|
|
// When an event_id is passed but no state btree root_id was found
|
|
// that means there is no state btree generated for this room or at
|
|
// this event_id. Right now we fall back to using the present state
|
|
// of the room, which may be confusing behavior. In production this
|
|
// shouldn't happen; if it does, the ctor should probably throw rather
|
|
// than this. We just fallback to considering present state here.
|
|
if(!root_id)
|
|
return true;
|
|
|
|
// Check the cached value from a previous false result of this function
|
|
// before doing any real work/IO below. If this function ever returned
|
|
// false it will never return true after.
|
|
if(_not_present)
|
|
return false;
|
|
|
|
const auto head_id
|
|
{
|
|
m::head(std::nothrow, room_id)
|
|
};
|
|
|
|
// If the event_id passed is exactly the latest event we can obviously
|
|
// consider this the present state.
|
|
if(!head_id || head_id == event_id)
|
|
return true;
|
|
|
|
m::state::id_buffer root_id_buf;
|
|
const auto head_root
|
|
{
|
|
dbs::state_root(root_id_buf, room_id, head_id)
|
|
};
|
|
|
|
// If the room's state has not changed between the event_id desired
|
|
// here and the latest event we can also consider this the present state.
|
|
if(head_root && head_root == root_id)
|
|
return true;
|
|
|
|
// This result is cacheable because once it's no longer the present
|
|
// it will never be again. Panta chorei kai ouden menei. Note that this
|
|
// is a const member function; the cache variable is an appropriate case
|
|
// for the 'mutable' keyword.
|
|
_not_present = true;
|
|
return false;
|
|
}
|
|
|
|
//
|
|
// room::state::space
|
|
//
|
|
|
|
ircd::m::room::state::space::space(const m::room &room)
|
|
:room
|
|
{
|
|
room
|
|
}
|
|
{
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::space::has(const string_view &type)
|
|
const
|
|
{
|
|
return has(type, string_view{});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::space::has(const string_view &type,
|
|
const string_view &state_key)
|
|
const
|
|
{
|
|
return has(type, state_key, -1);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::space::has(const string_view &type,
|
|
const string_view &state_key,
|
|
const int64_t &depth)
|
|
const
|
|
{
|
|
return !for_each(type, state_key, depth, []
|
|
(const auto &type, const auto &state_key, const auto &depth, const auto &event_idx)
|
|
{
|
|
return false;
|
|
});
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::state::space::count(const string_view &type)
|
|
const
|
|
{
|
|
return count(type, string_view{});
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::state::space::count(const string_view &type,
|
|
const string_view &state_key)
|
|
const
|
|
{
|
|
return count(type, state_key, -1L);
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::state::space::count(const string_view &type,
|
|
const string_view &state_key,
|
|
const int64_t &depth)
|
|
const
|
|
{
|
|
size_t ret(0);
|
|
for_each(type, state_key, depth, [&ret]
|
|
(const auto &type, const auto &state_key, const auto &depth, const auto &event_idx)
|
|
{
|
|
++ret;
|
|
return true;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::space::for_each(const closure &closure)
|
|
const
|
|
{
|
|
auto it
|
|
{
|
|
dbs::room_state_space.begin(room.room_id)
|
|
};
|
|
|
|
for(; it; ++it)
|
|
{
|
|
const auto &key
|
|
{
|
|
dbs::room_state_space_key(it->first)
|
|
};
|
|
|
|
if(!closure(std::get<0>(key), std::get<1>(key), std::get<2>(key), std::get<3>(key)))
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::space::for_each(const string_view &type,
|
|
const closure &closure)
|
|
const
|
|
{
|
|
return for_each(type, string_view{}, -1L, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::space::for_each(const string_view &type,
|
|
const string_view &state_key,
|
|
const closure &closure)
|
|
const
|
|
{
|
|
return for_each(type, state_key, -1L, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::state::space::for_each(const string_view &type,
|
|
const string_view &state_key,
|
|
const int64_t &depth,
|
|
const closure &closure)
|
|
const
|
|
{
|
|
char buf[dbs::ROOM_STATE_SPACE_KEY_MAX_SIZE];
|
|
const string_view &key
|
|
{
|
|
dbs::room_state_space_key(buf, room.room_id, type, state_key, depth)
|
|
};
|
|
|
|
auto it
|
|
{
|
|
dbs::room_state_space.begin(key)
|
|
};
|
|
|
|
for(; it; ++it)
|
|
{
|
|
const auto &key
|
|
{
|
|
dbs::room_state_space_key(it->first)
|
|
};
|
|
|
|
if(type && std::get<0>(key) != type)
|
|
break;
|
|
|
|
if(state_key && std::get<1>(key) != state_key)
|
|
break;
|
|
|
|
if(depth > -1 && std::get<2>(key) != depth)
|
|
break;
|
|
|
|
if(!closure(std::get<0>(key), std::get<1>(key), std::get<2>(key), std::get<3>(key)))
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
//
|
|
// room::state::space::rebuild
|
|
//
|
|
|
|
ircd::m::room::state::space::rebuild::rebuild()
|
|
{
|
|
static const size_t interval
|
|
{
|
|
500000UL
|
|
};
|
|
|
|
auto &column
|
|
{
|
|
dbs::event_column.at(json::indexof<m::event>("state_key"_sv))
|
|
};
|
|
|
|
size_t total(0);
|
|
size_t current(0);
|
|
db::txn txn
|
|
{
|
|
*m::dbs::events
|
|
};
|
|
|
|
dbs::write_opts wopts;
|
|
wopts.appendix.reset();
|
|
wopts.appendix.set(dbs::appendix::ROOM_STATE_SPACE);
|
|
|
|
event::fetch event;
|
|
for(auto it(column.begin()); it; ++it) try
|
|
{
|
|
const event::idx &event_idx
|
|
{
|
|
byte_view<event::idx>(it->first)
|
|
};
|
|
|
|
seek(event, event_idx);
|
|
wopts.event_idx = event_idx;
|
|
dbs::write(txn, event, wopts);
|
|
|
|
++total;
|
|
++current;
|
|
if(current >= interval)
|
|
{
|
|
log::info
|
|
{
|
|
log, "room::state::space::rebuild total:%zu committing events:%zu elems:%zu size:%s",
|
|
total,
|
|
current,
|
|
txn.size(),
|
|
pretty(iec(txn.bytes()))
|
|
};
|
|
|
|
txn();
|
|
txn.clear();
|
|
current = 0;
|
|
}
|
|
}
|
|
catch(const ctx::interrupted &)
|
|
{
|
|
break;
|
|
}
|
|
catch(const std::exception &e)
|
|
{
|
|
log::error
|
|
{
|
|
log, "room::state::space::rebuild :%s",
|
|
e.what()
|
|
};
|
|
}
|
|
|
|
log::info
|
|
{
|
|
log, "room::state::space::rebuild total:%zu final transaction events:%zu elems:%zu size:%s",
|
|
total,
|
|
current,
|
|
txn.size(),
|
|
pretty(iec(txn.bytes()))
|
|
};
|
|
|
|
txn();
|
|
}
|
|
|
|
//
|
|
// room::members
|
|
//
|
|
|
|
size_t
|
|
ircd::m::room::members::count()
|
|
const
|
|
{
|
|
const room::state state
|
|
{
|
|
room
|
|
};
|
|
|
|
return state.count("m.room.member");
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::members::count(const string_view &membership)
|
|
const
|
|
{
|
|
// Allow empty membership string to count all memberships
|
|
if(!membership)
|
|
return count();
|
|
|
|
// joined members optimization. Only possible when seeking
|
|
// membership="join" on the present state of the room.
|
|
if(!room.event_id && membership == "join")
|
|
{
|
|
size_t ret{0};
|
|
const room::origins origins{room};
|
|
origins._for_each(origins, [&ret](const string_view &)
|
|
{
|
|
++ret;
|
|
return true;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
// The list of event fields to fetch for the closure
|
|
static const event::keys::include keys
|
|
{
|
|
"event_id", // Added for any upstack usage (but may be unnecessary).
|
|
"content", // Required because synapse events randomly have no event.membership
|
|
};
|
|
|
|
const m::event::fetch::opts fopts
|
|
{
|
|
keys, room.fopts? room.fopts->gopts : db::gopts{}
|
|
};
|
|
|
|
const room::state state
|
|
{
|
|
room, &fopts
|
|
};
|
|
|
|
size_t ret{0};
|
|
state.for_each("m.room.member", event::closure{[&ret, &membership]
|
|
(const m::event &event)
|
|
{
|
|
ret += m::membership(event) == membership;
|
|
}});
|
|
|
|
return ret;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::members::for_each(const closure &closure)
|
|
const
|
|
{
|
|
for_each(string_view{}, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::members::for_each(const closure_bool &closure)
|
|
const
|
|
{
|
|
return for_each(string_view{}, closure);
|
|
}
|
|
|
|
void
|
|
ircd::m::room::members::for_each(const event::closure &closure)
|
|
const
|
|
{
|
|
for_each(string_view{}, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::members::for_each(const event::closure_bool &closure)
|
|
const
|
|
{
|
|
const room::state state{room};
|
|
return state.for_each("m.room.member", event::closure_bool{[&closure]
|
|
(const m::event &event)
|
|
{
|
|
return closure(event);
|
|
}});
|
|
}
|
|
|
|
void
|
|
ircd::m::room::members::for_each(const string_view &membership,
|
|
const closure &closure)
|
|
const
|
|
{
|
|
for_each(membership, closure_bool{[&closure]
|
|
(const user::id &user_id)
|
|
{
|
|
closure(user_id);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
/// Iterate the mxid's of the users in the room, optionally with a specific
|
|
/// membership state. This query contains internal optimizations as the closure
|
|
/// only requires a user::id. The db::gopts set in the room.fopts pointer is
|
|
/// still used if provided.
|
|
bool
|
|
ircd::m::room::members::for_each(const string_view &membership,
|
|
const closure_bool &closure)
|
|
const
|
|
{
|
|
// Setup the list of event fields to fetch for the closure
|
|
static const event::keys::include keys
|
|
{
|
|
"event_id",
|
|
"state_key",
|
|
"content",
|
|
};
|
|
|
|
// In this case the fetch opts isn't static so it can maintain the
|
|
// previously given db::gopts, but it will use our keys list.
|
|
const m::event::fetch::opts fopts
|
|
{
|
|
keys, room.fopts? room.fopts->gopts : db::gopts{}
|
|
};
|
|
|
|
// Stack-over the the current fetch opts with our new opts for this query,
|
|
// putting them back when we're finished. This requires a const_cast which
|
|
// should be okay here.
|
|
auto &room(const_cast<m::room &>(this->room));
|
|
const auto theirs{room.fopts};
|
|
room.fopts = &fopts;
|
|
const unwind reset{[&room, &theirs]
|
|
{
|
|
room.fopts = theirs;
|
|
}};
|
|
|
|
return for_each(membership, event::closure_bool{[&closure]
|
|
(const event &event)
|
|
{
|
|
const user::id &user_id
|
|
{
|
|
at<"state_key"_>(event)
|
|
};
|
|
|
|
return closure(user_id);
|
|
}});
|
|
}
|
|
|
|
void
|
|
ircd::m::room::members::for_each(const string_view &membership,
|
|
const event::closure &closure)
|
|
const
|
|
{
|
|
for_each(membership, event::closure_bool{[&closure]
|
|
(const m::event &event)
|
|
{
|
|
closure(event);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::members::for_each(const string_view &membership,
|
|
const event::closure_bool &closure)
|
|
const
|
|
{
|
|
if(empty(membership))
|
|
return for_each(closure);
|
|
|
|
// joined members optimization. Only possible when seeking
|
|
// membership="join" on the present state of the room.
|
|
if(!room.event_id && membership == "join")
|
|
{
|
|
const room::origins origins{room};
|
|
return origins._for_each(origins, [&closure, this]
|
|
(const string_view &key)
|
|
{
|
|
const string_view &member
|
|
{
|
|
std::get<1>(dbs::room_joined_key(key))
|
|
};
|
|
|
|
bool ret{true};
|
|
room.get(std::nothrow, "m.room.member", member, event::closure{[&closure, &ret]
|
|
(const event &event)
|
|
{
|
|
ret = closure(event);
|
|
}});
|
|
|
|
return ret;
|
|
});
|
|
}
|
|
|
|
return for_each(event::closure_bool{[&membership, &closure]
|
|
(const event &event)
|
|
{
|
|
if(m::membership(event) == membership)
|
|
if(!closure(event))
|
|
return false;
|
|
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
//
|
|
// room::origins
|
|
//
|
|
|
|
ircd::string_view
|
|
ircd::m::room::origins::random(const mutable_buffer &buf,
|
|
const closure_bool &proffer)
|
|
const
|
|
{
|
|
string_view ret;
|
|
const auto closure{[&buf, &proffer, &ret]
|
|
(const string_view &origin)
|
|
{
|
|
ret = { data(buf), copy(buf, origin) };
|
|
}};
|
|
|
|
random(closure, proffer);
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::origins::random(const closure &view,
|
|
const closure_bool &proffer)
|
|
const
|
|
{
|
|
return random(*this, view, proffer);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::origins::random(const origins &origins,
|
|
const closure &view,
|
|
const closure_bool &proffer)
|
|
{
|
|
bool ret{false};
|
|
const size_t max
|
|
{
|
|
origins.count()
|
|
};
|
|
|
|
if(unlikely(!max))
|
|
return ret;
|
|
|
|
auto select
|
|
{
|
|
ssize_t(rand::integer(0, max - 1))
|
|
};
|
|
|
|
const closure_bool closure{[&proffer, &view, &select]
|
|
(const string_view &origin)
|
|
{
|
|
if(select-- > 0)
|
|
return true;
|
|
|
|
// Test if this random selection is "ok" e.g. the callback allows the
|
|
// user to test a blacklist for this origin. Skip to next if not.
|
|
if(proffer && !proffer(origin))
|
|
{
|
|
++select;
|
|
return true;
|
|
}
|
|
|
|
view(origin);
|
|
return false;
|
|
}};
|
|
|
|
const auto iteration{[&origins, &closure, &ret]
|
|
{
|
|
ret = !origins.for_each(closure);
|
|
}};
|
|
|
|
// Attempt select on first iteration
|
|
iteration();
|
|
|
|
// If nothing was OK between the random int and the end of the iteration
|
|
// then start again and pick the first OK.
|
|
if(!ret && select >= 0)
|
|
iteration();
|
|
|
|
return ret;
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::origins::count()
|
|
const
|
|
{
|
|
size_t ret{0};
|
|
for_each([&ret](const string_view &)
|
|
{
|
|
++ret;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
/// Tests if argument is the only origin in the room.
|
|
/// If a zero or more than one origins exist, returns false. If the only origin
|
|
/// in the room is the argument origin, returns true.
|
|
bool
|
|
ircd::m::room::origins::only(const string_view &origin)
|
|
const
|
|
{
|
|
ushort ret{2};
|
|
for_each(closure_bool{[&ret, &origin]
|
|
(const string_view &origin_) -> bool
|
|
{
|
|
if(origin == origin_)
|
|
ret = 1;
|
|
else
|
|
ret = 0;
|
|
|
|
return ret;
|
|
}});
|
|
|
|
return ret == 1;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::origins::has(const string_view &origin)
|
|
const
|
|
{
|
|
db::index &index
|
|
{
|
|
dbs::room_joined
|
|
};
|
|
|
|
char querybuf[dbs::ROOM_JOINED_KEY_MAX_SIZE];
|
|
const auto query
|
|
{
|
|
dbs::room_joined_key(querybuf, room.room_id, origin)
|
|
};
|
|
|
|
auto it
|
|
{
|
|
index.begin(query)
|
|
};
|
|
|
|
if(!it)
|
|
return false;
|
|
|
|
const string_view &key
|
|
{
|
|
lstrip(it->first, "\0"_sv)
|
|
};
|
|
|
|
const string_view &key_origin
|
|
{
|
|
std::get<0>(dbs::room_joined_key(key))
|
|
};
|
|
|
|
return key_origin == origin;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::origins::for_each(const closure &view)
|
|
const
|
|
{
|
|
for_each(closure_bool{[&view]
|
|
(const string_view &origin)
|
|
{
|
|
view(origin);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::origins::for_each(const closure_bool &view)
|
|
const
|
|
{
|
|
string_view last;
|
|
char lastbuf[rfc1035::NAME_BUFSIZE];
|
|
return _for_each(*this, [&last, &lastbuf, &view]
|
|
(const string_view &key)
|
|
{
|
|
const string_view &origin
|
|
{
|
|
std::get<0>(dbs::room_joined_key(key))
|
|
};
|
|
|
|
if(origin == last)
|
|
return true;
|
|
|
|
if(!view(origin))
|
|
return false;
|
|
|
|
last = { lastbuf, copy(lastbuf, origin) };
|
|
return true;
|
|
});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::origins::_for_each(const origins &origins,
|
|
const closure_bool &view)
|
|
{
|
|
db::index &index
|
|
{
|
|
dbs::room_joined
|
|
};
|
|
|
|
auto it
|
|
{
|
|
index.begin(origins.room.room_id)
|
|
};
|
|
|
|
for(; bool(it); ++it)
|
|
{
|
|
const string_view &key
|
|
{
|
|
lstrip(it->first, "\0"_sv)
|
|
};
|
|
|
|
if(!view(key))
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
//
|
|
// room::head
|
|
//
|
|
|
|
std::pair<ircd::json::array, int64_t>
|
|
ircd::m::room::head::make_refs(const mutable_buffer &buf,
|
|
const size_t &limit,
|
|
const bool &need_top)
|
|
const
|
|
{
|
|
json::stack out{buf};
|
|
json::stack::array array{out};
|
|
const auto depth
|
|
{
|
|
make_refs(array, limit, need_top)
|
|
};
|
|
array.~array();
|
|
return
|
|
{
|
|
json::array{out.completed()},
|
|
depth
|
|
};
|
|
}
|
|
|
|
int64_t
|
|
ircd::m::room::head::make_refs(json::stack::array &out,
|
|
const size_t &limit,
|
|
const bool &need_top)
|
|
const
|
|
{
|
|
return make_refs(*this, out, limit, need_top);
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::head::count()
|
|
const
|
|
{
|
|
size_t ret(0);
|
|
for_each([&ret]
|
|
(const event::idx &event_idx, const event::id &event_id)
|
|
{
|
|
++ret;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::head::has(const event::id &event_id)
|
|
const
|
|
{
|
|
bool ret{false};
|
|
for_each(closure_bool{[&ret, &event_id]
|
|
(const event::idx &event_idx, const event::id &event_id_)
|
|
{
|
|
ret = event_id_ == event_id;
|
|
return !ret; // for_each protocol: false to break
|
|
}});
|
|
|
|
return ret;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::head::for_each(const closure &closure)
|
|
const
|
|
{
|
|
for_each(closure_bool{[&closure]
|
|
(const event::idx &event_idx, const event::id &event_id)
|
|
{
|
|
closure(event_idx, event_id);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::head::for_each(const closure_bool &closure)
|
|
const
|
|
{
|
|
return for_each(*this, closure);
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::head::rebuild(const head &head)
|
|
{
|
|
size_t ret{0};
|
|
const auto &room{head.room};
|
|
const m::room::state state{room};
|
|
const auto create_idx
|
|
{
|
|
state.get("m.room.create")
|
|
};
|
|
|
|
static const m::event::fetch::opts fopts
|
|
{
|
|
{ db::get::NO_CACHE }
|
|
};
|
|
|
|
m::room::messages it
|
|
{
|
|
room, create_idx, &fopts
|
|
};
|
|
|
|
if(!it)
|
|
return ret;
|
|
|
|
db::txn txn
|
|
{
|
|
*m::dbs::events
|
|
};
|
|
|
|
m::dbs::write_opts opts;
|
|
opts.op = db::op::SET;
|
|
for(; it; ++it)
|
|
{
|
|
const m::event &event{*it};
|
|
opts.event_idx = it.event_idx();
|
|
opts.appendix.reset();
|
|
opts.appendix.set(dbs::appendix::ROOM_HEAD);
|
|
m::dbs::write(txn, event, opts);
|
|
++ret;
|
|
}
|
|
|
|
txn();
|
|
return ret;
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::head::reset(const head &head)
|
|
{
|
|
size_t ret{0};
|
|
const auto &room{head.room};
|
|
m::room::messages it{room};
|
|
if(!it)
|
|
return ret;
|
|
|
|
// Replacement will be the single new head
|
|
const m::event replacement
|
|
{
|
|
*it
|
|
};
|
|
|
|
db::txn txn
|
|
{
|
|
*m::dbs::events
|
|
};
|
|
|
|
// Iterate all of the existing heads with a delete operation
|
|
m::dbs::write_opts opts;
|
|
opts.op = db::op::DELETE;
|
|
opts.appendix.reset();
|
|
opts.appendix.set(dbs::appendix::ROOM_HEAD);
|
|
m::room::head{room}.for_each([&room, &opts, &txn, &ret]
|
|
(const m::event::idx &event_idx, const m::event::id &event_id)
|
|
{
|
|
const m::event::fetch event
|
|
{
|
|
event_idx, std::nothrow
|
|
};
|
|
|
|
if(!event.valid)
|
|
{
|
|
log::derror
|
|
{
|
|
m::log, "Invalid event '%s' idx %lu in head for %s",
|
|
string_view{event_id},
|
|
event_idx,
|
|
string_view{room.room_id}
|
|
};
|
|
|
|
return;
|
|
}
|
|
|
|
opts.event_idx = event_idx;
|
|
m::dbs::write(txn, event, opts);
|
|
++ret;
|
|
});
|
|
|
|
// Finally add the replacement to the txn
|
|
opts.op = db::op::SET;
|
|
opts.event_idx = it.event_idx();
|
|
m::dbs::write(txn, replacement, opts);
|
|
|
|
// Commit txn
|
|
txn();
|
|
return ret;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::head::modify(const m::event::id &event_id,
|
|
const db::op &op,
|
|
const bool &refs)
|
|
{
|
|
const m::event::fetch event
|
|
{
|
|
event_id
|
|
};
|
|
|
|
db::txn txn
|
|
{
|
|
*m::dbs::events
|
|
};
|
|
|
|
// Iterate all of the existing heads with a delete operation
|
|
m::dbs::write_opts opts;
|
|
opts.op = op;
|
|
opts.event_idx = event.event_idx;
|
|
opts.appendix.reset();
|
|
opts.appendix.set(dbs::appendix::ROOM_HEAD);
|
|
m::dbs::write(txn, event, opts);
|
|
|
|
// Commit txn
|
|
txn();
|
|
}
|
|
|
|
int64_t
|
|
ircd::m::room::head::make_refs(const head &head,
|
|
json::stack::array &out,
|
|
const size_t &_limit,
|
|
const bool &_need_tophead)
|
|
{
|
|
size_t limit{_limit};
|
|
bool need_tophead{_need_tophead};
|
|
const auto &room{head.room};
|
|
const auto top_head
|
|
{
|
|
need_tophead?
|
|
m::top(std::nothrow, room.room_id):
|
|
std::tuple<m::id::event::buf, int64_t, m::event::idx>{}
|
|
};
|
|
|
|
int64_t depth{-1};
|
|
m::event::fetch event;
|
|
head.for_each(m::room::head::closure_bool{[&]
|
|
(const m::event::idx &idx, const m::event::id &event_id)
|
|
{
|
|
seek(event, idx, std::nothrow);
|
|
if(!event.valid)
|
|
return true;
|
|
|
|
if(need_tophead)
|
|
if(json::get<"event_id"_>(event) == std::get<0>(top_head))
|
|
need_tophead = false;
|
|
|
|
depth = std::max(json::get<"depth"_>(event), depth);
|
|
json::stack::array prev{out};
|
|
prev.append(event_id);
|
|
{
|
|
json::stack::object hash{prev};
|
|
json::stack::member will
|
|
{
|
|
hash, "", ""
|
|
};
|
|
}
|
|
|
|
return --limit - need_tophead > 0;
|
|
}});
|
|
|
|
if(need_tophead)
|
|
{
|
|
depth = std::get<1>(top_head);
|
|
json::stack::array prev{out};
|
|
prev.append(std::get<0>(top_head));
|
|
{
|
|
json::stack::object hash{prev};
|
|
json::stack::member will
|
|
{
|
|
hash, "", ""
|
|
};
|
|
}
|
|
}
|
|
|
|
return depth;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::head::for_each(const head &head,
|
|
const closure_bool &closure)
|
|
{
|
|
auto it
|
|
{
|
|
dbs::room_head.begin(head.room.room_id)
|
|
};
|
|
|
|
for(; it; ++it)
|
|
{
|
|
const event::id &event_id
|
|
{
|
|
dbs::room_head_key(it->first)
|
|
};
|
|
|
|
const event::idx &event_idx
|
|
{
|
|
byte_view<event::idx>{it->second}
|
|
};
|
|
|
|
if(!closure(event_idx, event_id))
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
//
|
|
// room::auth
|
|
//
|
|
|
|
ircd::json::array
|
|
ircd::m::room::auth::make_refs(const mutable_buffer &buf,
|
|
const types &types,
|
|
const m::id::user &user)
|
|
const
|
|
{
|
|
json::stack out{buf};
|
|
json::stack::array array{out};
|
|
make_refs(array, types, user);
|
|
array.~array();
|
|
return json::array{out.completed()};
|
|
}
|
|
|
|
void
|
|
ircd::m::room::auth::make_refs(json::stack::array &out,
|
|
const types &types,
|
|
const m::id::user &user)
|
|
const
|
|
{
|
|
make_refs(*this, out, types, user);
|
|
}
|
|
|
|
void
|
|
ircd::m::room::auth::for_each(const closure &c)
|
|
const
|
|
{
|
|
for_each(closure_bool{[this, &c]
|
|
(const auto &event_idx)
|
|
{
|
|
c(event_idx);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::auth::for_each(const closure_bool &c)
|
|
const
|
|
{
|
|
return for_each(*this, c);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::auth::for_each(const auth &a,
|
|
const closure_bool &closure)
|
|
{
|
|
const m::room &room{a.room};
|
|
const auto &event_id{room.event_id};
|
|
if(!event_id)
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::auth::make_refs(const auth &auth,
|
|
json::stack::array &out,
|
|
const types &types,
|
|
const user::id &user_id)
|
|
{
|
|
const m::room::state state
|
|
{
|
|
auth.room
|
|
};
|
|
|
|
const auto fetch{[&out, &state]
|
|
(const string_view &type, const string_view &state_key)
|
|
{
|
|
state.get(std::nothrow, type, state_key, m::event::id::closure{[&out]
|
|
(const auto &event_id)
|
|
{
|
|
json::stack::array auth{out};
|
|
auth.append(event_id);
|
|
{
|
|
json::stack::object hash{auth};
|
|
json::stack::member will
|
|
{
|
|
hash, "", ""
|
|
};
|
|
}
|
|
}});
|
|
}};
|
|
|
|
for(const auto &type : types)
|
|
fetch(type, "");
|
|
|
|
if(user_id)
|
|
fetch("m.room.member", user_id);
|
|
}
|
|
|
|
//
|
|
// room::aliases
|
|
//
|
|
|
|
size_t
|
|
ircd::m::room::aliases::count()
|
|
const
|
|
{
|
|
return count(string_view{});
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::aliases::count(const string_view &server)
|
|
const
|
|
{
|
|
size_t ret(0);
|
|
for_each(server, [&ret](const auto &a)
|
|
{
|
|
++ret;
|
|
return true;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::aliases::has(const alias &alias)
|
|
const
|
|
{
|
|
return !for_each(alias.host(), [&alias]
|
|
(const id::room_alias &a)
|
|
{
|
|
assert(a.host() == alias.host());
|
|
return a == alias? false : true; // false to break on found
|
|
});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::aliases::for_each(const closure_bool &closure)
|
|
const
|
|
{
|
|
const room::state state
|
|
{
|
|
room
|
|
};
|
|
|
|
return state.for_each("m.room.aliases", room::state::keys_bool{[this, &closure]
|
|
(const string_view &state_key)
|
|
{
|
|
return for_each(state_key, closure);
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::aliases::for_each(const string_view &server,
|
|
const closure_bool &closure)
|
|
const
|
|
{
|
|
if(!server)
|
|
return for_each(closure);
|
|
|
|
return for_each(room, server, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::aliases::for_each(const m::room &room,
|
|
const string_view &server,
|
|
const closure_bool &closure)
|
|
{
|
|
using prototype = bool (const m::room &, const string_view &, const closure_bool &);
|
|
|
|
static mods::import<prototype> call
|
|
{
|
|
"m_room_aliases", "ircd::m::room::aliases::for_each"
|
|
};
|
|
|
|
return call(room, server, closure);
|
|
}
|
|
|
|
//
|
|
// room::aliases::cache
|
|
//
|
|
|
|
bool
|
|
ircd::m::room::aliases::cache::del(const alias &a)
|
|
{
|
|
using prototype = bool (const alias &);
|
|
|
|
static mods::import<prototype> call
|
|
{
|
|
"m_room_aliases", "ircd::m::room::aliases::cache::del"
|
|
};
|
|
|
|
return call(a);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::aliases::cache::set(const alias &a,
|
|
const id &i)
|
|
{
|
|
using prototype = bool (const alias &, const id &);
|
|
|
|
static mods::import<prototype> call
|
|
{
|
|
"m_room_aliases", "ircd::m::room::aliases::cache::set"
|
|
};
|
|
|
|
return call(a, i);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::aliases::cache::fetch(std::nothrow_t,
|
|
const alias &a,
|
|
const net::hostport &hp)
|
|
try
|
|
{
|
|
fetch(a, hp);
|
|
return true;
|
|
}
|
|
catch(const std::exception &e)
|
|
{
|
|
thread_local char buf[384];
|
|
log::error
|
|
{
|
|
log, "Failed to fetch room_id for %s from %s :%s",
|
|
string_view{a},
|
|
string(buf, hp),
|
|
e.what(),
|
|
};
|
|
|
|
return false;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::aliases::cache::fetch(const alias &a,
|
|
const net::hostport &hp)
|
|
{
|
|
using prototype = void (const alias &, const net::hostport &);
|
|
|
|
static mods::import<prototype> call
|
|
{
|
|
"m_room_aliases", "ircd::m::room::aliases::cache::fetch"
|
|
};
|
|
|
|
return call(a, hp);
|
|
}
|
|
|
|
ircd::m::room::id::buf
|
|
ircd::m::room::aliases::cache::get(const alias &a)
|
|
{
|
|
id::buf ret;
|
|
get(a, [&ret]
|
|
(const id &room_id)
|
|
{
|
|
ret = room_id;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
ircd::m::room::id::buf
|
|
ircd::m::room::aliases::cache::get(std::nothrow_t,
|
|
const alias &a)
|
|
{
|
|
id::buf ret;
|
|
get(std::nothrow, a, [&ret]
|
|
(const id &room_id)
|
|
{
|
|
ret = room_id;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::aliases::cache::get(const alias &a,
|
|
const id::closure &c)
|
|
{
|
|
if(!get(std::nothrow, a, c))
|
|
throw m::NOT_FOUND
|
|
{
|
|
"Cannot find room_id for %s",
|
|
string_view{a}
|
|
};
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::aliases::cache::get(std::nothrow_t,
|
|
const alias &a,
|
|
const id::closure &c)
|
|
{
|
|
using prototype = bool (std::nothrow_t, const alias &, const id::closure &);
|
|
|
|
static mods::import<prototype> call
|
|
{
|
|
"m_room_aliases", "ircd::m::room::aliases::cache::get"
|
|
};
|
|
|
|
return call(std::nothrow, a, c);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::aliases::cache::has(const alias &a)
|
|
{
|
|
using prototype = bool (const alias &);
|
|
|
|
static mods::import<prototype> call
|
|
{
|
|
"m_room_aliases", "ircd::m::room::aliases::cache::has"
|
|
};
|
|
|
|
return call(a);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::aliases::cache::for_each(const closure_bool &c)
|
|
{
|
|
return for_each(string_view{}, c);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::aliases::cache::for_each(const string_view &s,
|
|
const closure_bool &c)
|
|
{
|
|
using prototype = bool (const string_view &, const closure_bool &);
|
|
|
|
static mods::import<prototype> call
|
|
{
|
|
"m_room_aliases", "ircd::m::room::aliases::cache::for_each"
|
|
};
|
|
|
|
return call(s, c);
|
|
}
|
|
|
|
//
|
|
// room::power
|
|
//
|
|
|
|
decltype(ircd::m::room::power::default_creator_level)
|
|
ircd::m::room::power::default_creator_level
|
|
{
|
|
100
|
|
};
|
|
|
|
decltype(ircd::m::room::power::default_power_level)
|
|
ircd::m::room::power::default_power_level
|
|
{
|
|
50
|
|
};
|
|
|
|
decltype(ircd::m::room::power::default_event_level)
|
|
ircd::m::room::power::default_event_level
|
|
{
|
|
0
|
|
};
|
|
|
|
decltype(ircd::m::room::power::default_user_level)
|
|
ircd::m::room::power::default_user_level
|
|
{
|
|
0
|
|
};
|
|
|
|
ircd::json::object
|
|
ircd::m::room::power::default_content(const mutable_buffer &buf,
|
|
const m::user::id &creator)
|
|
{
|
|
json::stack out{buf};
|
|
json::stack::object content{out};
|
|
|
|
assert(default_power_level == 50);
|
|
json::stack::member
|
|
{
|
|
content, "ban", json::value(default_power_level)
|
|
};
|
|
|
|
json::stack::object
|
|
{
|
|
content, "events"
|
|
};
|
|
|
|
assert(default_event_level == 0);
|
|
json::stack::member
|
|
{
|
|
content, "events_default", json::value(default_event_level)
|
|
};
|
|
|
|
json::stack::member
|
|
{
|
|
content, "invite", json::value(default_power_level)
|
|
};
|
|
|
|
json::stack::member
|
|
{
|
|
content, "kick", json::value(default_power_level)
|
|
};
|
|
|
|
{
|
|
json::stack::object notifications
|
|
{
|
|
content, "notifications"
|
|
};
|
|
|
|
json::stack::member
|
|
{
|
|
notifications, "room", json::value(default_power_level)
|
|
};
|
|
}
|
|
|
|
json::stack::member
|
|
{
|
|
content, "redact", json::value(default_power_level)
|
|
};
|
|
|
|
json::stack::member
|
|
{
|
|
content, "state_default", json::value(default_power_level)
|
|
};
|
|
|
|
{
|
|
json::stack::object users
|
|
{
|
|
content, "users"
|
|
};
|
|
|
|
assert(default_creator_level == 100);
|
|
json::stack::member
|
|
{
|
|
users, creator, json::value(default_creator_level)
|
|
};
|
|
}
|
|
|
|
assert(default_user_level == 0);
|
|
json::stack::member
|
|
{
|
|
content, "users_default", json::value(default_user_level)
|
|
};
|
|
|
|
content.~object();
|
|
return json::object{out.completed()};
|
|
}
|
|
|
|
//
|
|
// room::power::power
|
|
//
|
|
|
|
ircd::m::room::power::power(const m::room &room)
|
|
:power
|
|
{
|
|
room, room.get(std::nothrow, "m.room.power_levels", "")
|
|
}
|
|
{
|
|
}
|
|
|
|
ircd::m::room::power::power(const m::room &room,
|
|
const event::idx &power_event_idx)
|
|
:room
|
|
{
|
|
room
|
|
}
|
|
,power_event_idx
|
|
{
|
|
power_event_idx
|
|
}
|
|
{
|
|
}
|
|
|
|
ircd::m::room::power::power(const m::event &power_event,
|
|
const m::event &create_event)
|
|
:power
|
|
{
|
|
power_event, m::user::id(unquote(json::get<"content"_>(create_event).get("creator")))
|
|
}
|
|
{
|
|
}
|
|
|
|
ircd::m::room::power::power(const m::event &power_event,
|
|
const m::user::id &room_creator_id)
|
|
:power
|
|
{
|
|
json::get<"content"_>(power_event), room_creator_id
|
|
}
|
|
{
|
|
}
|
|
|
|
ircd::m::room::power::power(const json::object &power_event_content,
|
|
const m::user::id &room_creator_id)
|
|
:power_event_content
|
|
{
|
|
power_event_content
|
|
}
|
|
,room_creator_id
|
|
{
|
|
room_creator_id
|
|
}
|
|
{
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::power::operator()(const m::user::id &user_id,
|
|
const string_view &prop,
|
|
const string_view &type,
|
|
const string_view &state_key)
|
|
const
|
|
{
|
|
const auto &user_level
|
|
{
|
|
level_user(user_id)
|
|
};
|
|
|
|
const auto &required_level
|
|
{
|
|
empty(prop) || prop == "events"?
|
|
level_event(type, state_key):
|
|
level(prop)
|
|
};
|
|
|
|
return user_level >= required_level;
|
|
}
|
|
|
|
int64_t
|
|
ircd::m::room::power::level_user(const m::user::id &user_id)
|
|
const try
|
|
{
|
|
int64_t ret
|
|
{
|
|
default_user_level
|
|
};
|
|
|
|
const auto closure{[&user_id, &ret]
|
|
(const json::object &content)
|
|
{
|
|
const auto users_default
|
|
{
|
|
content.get<int64_t>("users_default", default_user_level)
|
|
};
|
|
|
|
const json::object &users
|
|
{
|
|
content.get("users")
|
|
};
|
|
|
|
ret = users.get<int64_t>(user_id, users_default);
|
|
}};
|
|
|
|
const bool has_power_levels_event
|
|
{
|
|
view(closure)
|
|
};
|
|
|
|
if(!has_power_levels_event)
|
|
{
|
|
if(room_creator_id && user_id == room_creator_id)
|
|
ret = default_creator_level;
|
|
|
|
if(room.room_id && creator(room, user_id))
|
|
ret = default_creator_level;
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
catch(const json::error &e)
|
|
{
|
|
return default_user_level;
|
|
}
|
|
|
|
int64_t
|
|
ircd::m::room::power::level_event(const string_view &type)
|
|
const try
|
|
{
|
|
int64_t ret
|
|
{
|
|
default_event_level
|
|
};
|
|
|
|
const auto closure{[&type, &ret]
|
|
(const json::object &content)
|
|
{
|
|
const auto &events_default
|
|
{
|
|
content.get<int64_t>("events_default", default_event_level)
|
|
};
|
|
|
|
const json::object &events
|
|
{
|
|
content.get("events")
|
|
};
|
|
|
|
ret = events.get<int64_t>(type, events_default);
|
|
}};
|
|
|
|
const bool has_power_levels_event
|
|
{
|
|
view(closure)
|
|
};
|
|
|
|
return ret;
|
|
}
|
|
catch(const json::error &e)
|
|
{
|
|
return default_event_level;
|
|
}
|
|
|
|
int64_t
|
|
ircd::m::room::power::level_event(const string_view &type,
|
|
const string_view &state_key)
|
|
const try
|
|
{
|
|
if(!defined(state_key))
|
|
return level_event(type);
|
|
|
|
int64_t ret
|
|
{
|
|
default_power_level
|
|
};
|
|
|
|
const auto closure{[&type, &ret]
|
|
(const json::object &content)
|
|
{
|
|
const auto &state_default
|
|
{
|
|
content.get<int64_t>("state_default", default_power_level)
|
|
};
|
|
|
|
const json::object &events
|
|
{
|
|
content.get("events")
|
|
};
|
|
|
|
ret = events.get<int64_t>(type, state_default);
|
|
}};
|
|
|
|
const bool has_power_levels_event
|
|
{
|
|
view(closure)
|
|
};
|
|
|
|
return ret;
|
|
}
|
|
catch(const json::error &e)
|
|
{
|
|
return default_power_level;
|
|
}
|
|
|
|
int64_t
|
|
ircd::m::room::power::level(const string_view &prop)
|
|
const try
|
|
{
|
|
int64_t ret
|
|
{
|
|
default_power_level
|
|
};
|
|
|
|
view([&prop, &ret]
|
|
(const json::object &content)
|
|
{
|
|
ret = content.at<int64_t>(prop);
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
catch(const json::error &e)
|
|
{
|
|
return default_power_level;
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::power::count_levels()
|
|
const
|
|
{
|
|
size_t ret{0};
|
|
for_each([&ret]
|
|
(const string_view &, const int64_t &)
|
|
{
|
|
++ret;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::power::count_collections()
|
|
const
|
|
{
|
|
size_t ret{0};
|
|
view([&ret]
|
|
(const json::object &content)
|
|
{
|
|
for(const auto &member : content)
|
|
ret += json::type(member.second) == json::OBJECT;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::power::count(const string_view &prop)
|
|
const
|
|
{
|
|
size_t ret{0};
|
|
for_each(prop, [&ret]
|
|
(const string_view &, const int64_t &)
|
|
{
|
|
++ret;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::power::has_event(const string_view &type)
|
|
const try
|
|
{
|
|
bool ret{false};
|
|
view([&type, &ret]
|
|
(const json::object &content)
|
|
{
|
|
const json::object &events
|
|
{
|
|
content.at("events")
|
|
};
|
|
|
|
const string_view &level
|
|
{
|
|
unquote(events.at(type))
|
|
};
|
|
|
|
ret = json::type(level) == json::NUMBER;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
catch(const json::error &)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::power::has_user(const m::user::id &user_id)
|
|
const try
|
|
{
|
|
bool ret{false};
|
|
view([&user_id, &ret]
|
|
(const json::object &content)
|
|
{
|
|
const json::object &users
|
|
{
|
|
content.at("users")
|
|
};
|
|
|
|
const string_view &level
|
|
{
|
|
unquote(users.at(user_id))
|
|
};
|
|
|
|
ret = json::type(level) == json::NUMBER;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
catch(const json::error &)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::power::has_collection(const string_view &prop)
|
|
const
|
|
{
|
|
bool ret{false};
|
|
view([&prop, &ret]
|
|
(const json::object &content)
|
|
{
|
|
const auto &value{content.get(prop)};
|
|
if(value && json::type(value) == json::OBJECT)
|
|
ret = true;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::power::has_level(const string_view &prop)
|
|
const
|
|
{
|
|
bool ret{false};
|
|
view([&prop, &ret]
|
|
(const json::object &content)
|
|
{
|
|
const auto &value(unquote(content.get(prop)));
|
|
if(value && json::type(value) == json::NUMBER)
|
|
ret = true;
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
void
|
|
ircd::m::room::power::for_each(const closure &closure)
|
|
const
|
|
{
|
|
for_each(string_view{}, closure);
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::power::for_each(const closure_bool &closure)
|
|
const
|
|
{
|
|
return for_each(string_view{}, closure);
|
|
}
|
|
|
|
void
|
|
ircd::m::room::power::for_each(const string_view &prop,
|
|
const closure &closure)
|
|
const
|
|
{
|
|
for_each(prop, closure_bool{[&closure]
|
|
(const string_view &key, const int64_t &level)
|
|
{
|
|
closure(key, level);
|
|
return true;
|
|
}});
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::power::for_each(const string_view &prop,
|
|
const closure_bool &closure)
|
|
const
|
|
{
|
|
bool ret{true};
|
|
view([&prop, &closure, &ret]
|
|
(const json::object &content)
|
|
{
|
|
const json::object &collection
|
|
{
|
|
// This little cmov gimmick sets collection to be the outer object
|
|
// itself if no property was given, allowing us to reuse this func
|
|
// for all iterations of key -> level mappings.
|
|
prop? json::object{content.get(prop)} : content
|
|
};
|
|
|
|
if(prop && json::type(string_view{collection}) != json::OBJECT)
|
|
return;
|
|
|
|
for(auto it(begin(collection)); it != end(collection) && ret; ++it)
|
|
{
|
|
const auto &member(*it);
|
|
if(json::type(unquote(member.second)) != json::NUMBER)
|
|
continue;
|
|
|
|
const auto &key
|
|
{
|
|
unquote(member.first)
|
|
};
|
|
|
|
const auto &val
|
|
{
|
|
lex_cast<int64_t>(member.second)
|
|
};
|
|
|
|
ret = closure(key, val);
|
|
}
|
|
});
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool
|
|
ircd::m::room::power::view(const std::function<void (const json::object &)> &closure)
|
|
const
|
|
{
|
|
if(power_event_idx)
|
|
if(m::get(std::nothrow, power_event_idx, "content", closure))
|
|
return true;
|
|
|
|
closure(power_event_content);
|
|
return !empty(power_event_content);
|
|
}
|
|
|
|
//
|
|
// room::stats
|
|
//
|
|
|
|
size_t
|
|
__attribute__((noreturn))
|
|
ircd::m::room::stats::bytes_total(const m::room &room)
|
|
{
|
|
throw m::UNSUPPORTED
|
|
{
|
|
"Not yet implemented."
|
|
};
|
|
}
|
|
|
|
size_t
|
|
__attribute__((noreturn))
|
|
ircd::m::room::stats::bytes_total_compressed(const m::room &room)
|
|
{
|
|
throw m::UNSUPPORTED
|
|
{
|
|
"Not yet implemented."
|
|
};
|
|
}
|
|
|
|
size_t
|
|
ircd::m::room::stats::bytes_json(const m::room &room)
|
|
{
|
|
size_t ret(0);
|
|
for(m::room::messages it(room); it; --it)
|
|
{
|
|
const m::event::idx &event_idx
|
|
{
|
|
it.event_idx()
|
|
};
|
|
|
|
const byte_view<string_view> key
|
|
{
|
|
event_idx
|
|
};
|
|
|
|
static const db::gopts gopts
|
|
{
|
|
db::get::NO_CACHE
|
|
};
|
|
|
|
ret += db::bytes_value(m::dbs::event_json, key, gopts);
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
size_t
|
|
__attribute__((noreturn))
|
|
ircd::m::room::stats::bytes_json_compressed(const m::room &room)
|
|
{
|
|
throw m::UNSUPPORTED
|
|
{
|
|
"Not yet implemented."
|
|
};
|
|
}
|
|
|
|
//TODO: temp
|
|
namespace ircd::m
|
|
{
|
|
extern "C" void room_herd(const m::room &, const m::user &, const milliseconds &);
|
|
extern "C" size_t dagree_histogram(const m::room &, std::vector<size_t> &);
|
|
}
|
|
|
|
void
|
|
ircd::m::room_herd(const m::room &room,
|
|
const m::user &user,
|
|
const milliseconds &timeout)
|
|
{
|
|
using closure_prototype = bool (const string_view &,
|
|
std::exception_ptr,
|
|
const json::object &);
|
|
|
|
using prototype = void (const m::room::id &,
|
|
const m::user::id &,
|
|
const milliseconds &,
|
|
const std::function<closure_prototype> &);
|
|
|
|
static mods::import<prototype> feds__head
|
|
{
|
|
"federation_federation", "feds__head"
|
|
};
|
|
|
|
std::set<std::string> event_ids;
|
|
feds__head(room.room_id, user.user_id, timeout, [&event_ids]
|
|
(const string_view &origin, std::exception_ptr eptr, const json::object &event)
|
|
{
|
|
if(eptr)
|
|
return true;
|
|
|
|
const json::array prev_events
|
|
{
|
|
event.at("prev_events")
|
|
};
|
|
|
|
for(const json::array prev_event : prev_events)
|
|
{
|
|
const auto &prev_event_id
|
|
{
|
|
unquote(prev_event.at(0))
|
|
};
|
|
|
|
event_ids.emplace(prev_event_id);
|
|
};
|
|
|
|
return true;
|
|
});
|
|
|
|
size_t i(0);
|
|
for(const m::event::id &event_id : event_ids)
|
|
if(exists(event_id))
|
|
{
|
|
m::room::head::modify(event_id, db::op::SET, false);
|
|
++i;
|
|
}
|
|
|
|
const m::room::head head
|
|
{
|
|
room
|
|
};
|
|
|
|
for(; i + 1 >= 1 && head.count() > 1; --i)
|
|
{
|
|
const auto eid
|
|
{
|
|
send(room, user, "ircd.room.revelation", json::object{})
|
|
};
|
|
|
|
ctx::sleep(seconds(2));
|
|
}
|
|
}
|
|
|
|
size_t
|
|
ircd::m::dagree_histogram(const m::room &room,
|
|
std::vector<size_t> &vec)
|
|
{
|
|
static const m::event::fetch::opts fopts
|
|
{
|
|
{ db::get::NO_CACHE },
|
|
m::event::keys::include
|
|
{
|
|
"event_id",
|
|
"prev_events",
|
|
}
|
|
};
|
|
|
|
m::room::messages it
|
|
{
|
|
room, &fopts
|
|
};
|
|
|
|
size_t ret{0};
|
|
for(; it; --it)
|
|
{
|
|
const m::event event{*it};
|
|
const size_t num{degree(event)};
|
|
if(unlikely(num >= vec.size()))
|
|
{
|
|
log::warning
|
|
{
|
|
m::log, "Event '%s' had %zu prev events (ignored)",
|
|
string_view(at<"event_id"_>(event))
|
|
};
|
|
|
|
continue;
|
|
}
|
|
|
|
++vec[num];
|
|
++ret;
|
|
}
|
|
|
|
return ret;
|
|
}
|