/* * charybdis: 21st Century IRC++d * * Copyright (C) 2016 Charybdis Development Team * Copyright (C) 2016 Jason Volk * * 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. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. * */ #pragma once #define HAVE_IRCD_M_EVENT_H #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wsubobject-linkage" /////////////////////////////////////////////////////////////////////////////// // Protocol notes // // 10.4 // The total size of any event MUST NOT exceed 65 KB. // // There are additional restrictions on sizes per key: // sender MUST NOT exceed 255 bytes (including domain). // room_id MUST NOT exceed 255 bytes. // state_key MUST NOT exceed 255 bytes. // type MUST NOT exceed 255 bytes. // event_id MUST NOT exceed 255 bytes. // // Some event types have additional size restrictions which are specified in // the description of the event. Additional keys have no limit other than that // implied by the total 65 KB limit on events. // namespace ircd::m { struct event; } namespace ircd::m::name { constexpr const char *const auth_events {"auth_events"}; constexpr const char *const content {"content"}; constexpr const char *const depth {"depth"}; constexpr const char *const event_id {"event_id"}; constexpr const char *const hashes {"hashes"}; constexpr const char *const is_state {"is_state"}; constexpr const char *const membership {"membership"}; constexpr const char *const origin {"origin"}; constexpr const char *const origin_server_ts {"origin_server_ts"}; constexpr const char *const prev_events {"prev_events"}; constexpr const char *const prev_state {"prev_state"}; constexpr const char *const room_id {"room_id"}; constexpr const char *const sender {"sender"}; constexpr const char *const signatures {"signatures"}; constexpr const char *const state_key {"state_key"}; constexpr const char *const type {"type"}; constexpr const char *const unsigned_ {"unsigned"}; } struct ircd::m::event :json::tuple < json::property, json::property, json::property, json::property, json::property, json::property, json::property, json::property, json::property, json::property, json::property, json::property, json::property, json::property, json::property, json::property, json::property > { enum lineage : int; enum temporality : int; struct fetch; struct prev; using id = m::id::event; static database *events; using cursor = db::cursor; using const_iterator = cursor::const_iterator; using iterator = const_iterator; using where = db::where; template using query = cursor::query_type; static const_iterator find(const id &); using super_type::tuple; using super_type::operator=; }; struct ircd::m::event::prev :json::tuple < json::property, json::property, json::property > { enum cond :int; using super_type::tuple; using super_type::operator=; }; enum ircd::m::event::prev::cond :int { SELF_LOOP, }; namespace ircd::m { size_t outdegree(const event::prev &); size_t outdegree(const event &); std::string pretty(const event &); std::string pretty(const event::prev &); std::string pretty_oneline(const event &); std::string pretty_oneline(const event::prev &); string_view reflect(const event::temporality &); string_view reflect(const event::lineage &); event::temporality temporality(const event &, const int64_t &rel); event::lineage lineage(const event &); } enum ircd::m::event::temporality :int { FUTURE = 1, ///< Event has a depth 1 or more into the future. PRESENT = 0, ///< Event has a depth equal to the current depth. PAST = -1, ///< Event has a depth less than the current depth. }; enum ircd::m::event::lineage :int { ROOT = 0, ///< Event has no parents (must be m.room.create then) FORWARD = 1, ///< Event has one parent at the previous depth MERGE = 2, ///< Event has multiple parents at the previous depth }; inline size_t ircd::m::outdegree(const event &event) { return outdegree(event::prev{event}); } inline size_t ircd::m::outdegree(const event::prev &prev) { size_t ret(0); for_each(prev, [&ret](const auto &key, const json::array &val) { ret += val.count(); }); return ret; } #pragma GCC diagnostic pop