mirror of
https://github.com/matrix-construct/construct
synced 2024-11-02 20:09:16 +01:00
139 lines
2.7 KiB
C++
139 lines
2.7 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.
|
|
|
|
namespace ircd::m::sync
|
|
{
|
|
static bool room_state_polylog_events(data &);
|
|
static bool room_state_polylog(data &);
|
|
|
|
static bool room_state_linear_events(data &);
|
|
static bool room_state_linear(data &);
|
|
|
|
extern const event::keys::include _default_keys;
|
|
extern event::fetch::opts _default_fopts;
|
|
|
|
extern item room_state;
|
|
}
|
|
|
|
ircd::mapi::header
|
|
IRCD_MODULE
|
|
{
|
|
"Client Sync :Room State", []
|
|
{
|
|
ircd::m::sync::_default_fopts.query_json_force = true;
|
|
}
|
|
};
|
|
|
|
decltype(ircd::m::sync::room_state)
|
|
ircd::m::sync::room_state
|
|
{
|
|
"rooms.state",
|
|
room_state_polylog,
|
|
room_state_linear
|
|
};
|
|
|
|
decltype(ircd::m::sync::_default_keys)
|
|
ircd::m::sync::_default_keys
|
|
{
|
|
"content",
|
|
"depth",
|
|
"event_id",
|
|
"origin_server_ts",
|
|
"redacts",
|
|
"room_id",
|
|
"sender",
|
|
"state_key",
|
|
"type",
|
|
};
|
|
|
|
decltype(ircd::m::sync::_default_fopts)
|
|
ircd::m::sync::_default_fopts
|
|
{
|
|
_default_keys
|
|
};
|
|
|
|
bool
|
|
ircd::m::sync::room_state_linear(data &data)
|
|
{
|
|
// if since token is non-zero, any events in the range are
|
|
// included in the timeline array and not the state array.
|
|
if(data.range.first)
|
|
return false;
|
|
|
|
if(!data.event_idx)
|
|
return false;
|
|
|
|
assert(data.event);
|
|
if(!json::get<"state_key"_>(*data.event))
|
|
return false;
|
|
|
|
json::stack::array array
|
|
{
|
|
*data.out, "events"
|
|
};
|
|
|
|
array.append(*data.event);
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
ircd::m::sync::room_state_polylog(data &data)
|
|
{
|
|
if(!apropos(data, data.room_head))
|
|
return false;
|
|
|
|
return room_state_polylog_events(data);
|
|
}
|
|
|
|
bool
|
|
ircd::m::sync::room_state_polylog_events(data &data)
|
|
{
|
|
const m::room &room{*data.room};
|
|
const m::room::state state{room};
|
|
json::stack::array array
|
|
{
|
|
*data.out, "events"
|
|
};
|
|
|
|
bool ret{false};
|
|
ctx::mutex mutex;
|
|
const event::closure_idx each_idx{[&data, &array, &mutex, &ret]
|
|
(const m::event::idx event_idx)
|
|
{
|
|
const event::fetch event
|
|
{
|
|
event_idx, std::nothrow, _default_fopts
|
|
};
|
|
|
|
//assert(event.valid);
|
|
if(unlikely(!event.valid))
|
|
return;
|
|
|
|
const std::lock_guard<decltype(mutex)> lock{mutex};
|
|
array.append(event);
|
|
ret = true;
|
|
}};
|
|
|
|
//TODO: conf
|
|
std::array<event::idx, 64> md;
|
|
ctx::parallel<event::idx> parallel
|
|
{
|
|
m::sync::pool, md, each_idx
|
|
};
|
|
|
|
state.for_each([&data, ¶llel]
|
|
(const m::event::idx &event_idx)
|
|
{
|
|
if(apropos(data, event_idx))
|
|
parallel(event_idx);
|
|
});
|
|
|
|
return ret;
|
|
}
|