events.py 88 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337
  1. # -*- coding: utf-8 -*-
  2. # Copyright 2014-2016 OpenMarket Ltd
  3. # Copyright 2018 New Vector Ltd
  4. #
  5. # Licensed under the Apache License, Version 2.0 (the "License");
  6. # you may not use this file except in compliance with the License.
  7. # You may obtain a copy of the License at
  8. #
  9. # http://www.apache.org/licenses/LICENSE-2.0
  10. #
  11. # Unless required by applicable law or agreed to in writing, software
  12. # distributed under the License is distributed on an "AS IS" BASIS,
  13. # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  14. # See the License for the specific language governing permissions and
  15. # limitations under the License.
  16. import itertools
  17. import logging
  18. from collections import OrderedDict, deque, namedtuple
  19. from functools import wraps
  20. from six import iteritems, text_type
  21. from six.moves import range
  22. from canonicaljson import json
  23. from prometheus_client import Counter
  24. from twisted.internet import defer
  25. import synapse.metrics
  26. from synapse.api.constants import EventTypes
  27. from synapse.api.errors import SynapseError
  28. # these are only included to make the type annotations work
  29. from synapse.events import EventBase # noqa: F401
  30. from synapse.events.snapshot import EventContext # noqa: F401
  31. from synapse.metrics.background_process_metrics import run_as_background_process
  32. from synapse.state import StateResolutionStore
  33. from synapse.storage.background_updates import BackgroundUpdateStore
  34. from synapse.storage.event_federation import EventFederationStore
  35. from synapse.storage.events_worker import EventsWorkerStore
  36. from synapse.storage.state import StateGroupWorkerStore
  37. from synapse.types import RoomStreamToken, get_domain_from_id
  38. from synapse.util import batch_iter
  39. from synapse.util.async_helpers import ObservableDeferred
  40. from synapse.util.caches.descriptors import cached, cachedInlineCallbacks
  41. from synapse.util.frozenutils import frozendict_json_encoder
  42. from synapse.util.logcontext import PreserveLoggingContext, make_deferred_yieldable
  43. from synapse.util.logutils import log_function
  44. from synapse.util.metrics import Measure
  45. logger = logging.getLogger(__name__)
  46. persist_event_counter = Counter("synapse_storage_events_persisted_events", "")
  47. event_counter = Counter("synapse_storage_events_persisted_events_sep", "",
  48. ["type", "origin_type", "origin_entity"])
  49. # The number of times we are recalculating the current state
  50. state_delta_counter = Counter("synapse_storage_events_state_delta", "")
  51. # The number of times we are recalculating state when there is only a
  52. # single forward extremity
  53. state_delta_single_event_counter = Counter(
  54. "synapse_storage_events_state_delta_single_event", "")
  55. # The number of times we are reculating state when we could have resonably
  56. # calculated the delta when we calculated the state for an event we were
  57. # persisting.
  58. state_delta_reuse_delta_counter = Counter(
  59. "synapse_storage_events_state_delta_reuse_delta", "")
  60. def encode_json(json_object):
  61. """
  62. Encode a Python object as JSON and return it in a Unicode string.
  63. """
  64. out = frozendict_json_encoder.encode(json_object)
  65. if isinstance(out, bytes):
  66. out = out.decode('utf8')
  67. return out
  68. class _EventPeristenceQueue(object):
  69. """Queues up events so that they can be persisted in bulk with only one
  70. concurrent transaction per room.
  71. """
  72. _EventPersistQueueItem = namedtuple("_EventPersistQueueItem", (
  73. "events_and_contexts", "backfilled", "deferred",
  74. ))
  75. def __init__(self):
  76. self._event_persist_queues = {}
  77. self._currently_persisting_rooms = set()
  78. def add_to_queue(self, room_id, events_and_contexts, backfilled):
  79. """Add events to the queue, with the given persist_event options.
  80. NB: due to the normal usage pattern of this method, it does *not*
  81. follow the synapse logcontext rules, and leaves the logcontext in
  82. place whether or not the returned deferred is ready.
  83. Args:
  84. room_id (str):
  85. events_and_contexts (list[(EventBase, EventContext)]):
  86. backfilled (bool):
  87. Returns:
  88. defer.Deferred: a deferred which will resolve once the events are
  89. persisted. Runs its callbacks *without* a logcontext.
  90. """
  91. queue = self._event_persist_queues.setdefault(room_id, deque())
  92. if queue:
  93. # if the last item in the queue has the same `backfilled` setting,
  94. # we can just add these new events to that item.
  95. end_item = queue[-1]
  96. if end_item.backfilled == backfilled:
  97. end_item.events_and_contexts.extend(events_and_contexts)
  98. return end_item.deferred.observe()
  99. deferred = ObservableDeferred(defer.Deferred(), consumeErrors=True)
  100. queue.append(self._EventPersistQueueItem(
  101. events_and_contexts=events_and_contexts,
  102. backfilled=backfilled,
  103. deferred=deferred,
  104. ))
  105. return deferred.observe()
  106. def handle_queue(self, room_id, per_item_callback):
  107. """Attempts to handle the queue for a room if not already being handled.
  108. The given callback will be invoked with for each item in the queue,
  109. of type _EventPersistQueueItem. The per_item_callback will continuously
  110. be called with new items, unless the queue becomnes empty. The return
  111. value of the function will be given to the deferreds waiting on the item,
  112. exceptions will be passed to the deferreds as well.
  113. This function should therefore be called whenever anything is added
  114. to the queue.
  115. If another callback is currently handling the queue then it will not be
  116. invoked.
  117. """
  118. if room_id in self._currently_persisting_rooms:
  119. return
  120. self._currently_persisting_rooms.add(room_id)
  121. @defer.inlineCallbacks
  122. def handle_queue_loop():
  123. try:
  124. queue = self._get_drainining_queue(room_id)
  125. for item in queue:
  126. try:
  127. ret = yield per_item_callback(item)
  128. except Exception:
  129. with PreserveLoggingContext():
  130. item.deferred.errback()
  131. else:
  132. with PreserveLoggingContext():
  133. item.deferred.callback(ret)
  134. finally:
  135. queue = self._event_persist_queues.pop(room_id, None)
  136. if queue:
  137. self._event_persist_queues[room_id] = queue
  138. self._currently_persisting_rooms.discard(room_id)
  139. # set handle_queue_loop off in the background
  140. run_as_background_process("persist_events", handle_queue_loop)
  141. def _get_drainining_queue(self, room_id):
  142. queue = self._event_persist_queues.setdefault(room_id, deque())
  143. try:
  144. while True:
  145. yield queue.popleft()
  146. except IndexError:
  147. # Queue has been drained.
  148. pass
  149. _EventCacheEntry = namedtuple("_EventCacheEntry", ("event", "redacted_event"))
  150. def _retry_on_integrity_error(func):
  151. """Wraps a database function so that it gets retried on IntegrityError,
  152. with `delete_existing=True` passed in.
  153. Args:
  154. func: function that returns a Deferred and accepts a `delete_existing` arg
  155. """
  156. @wraps(func)
  157. @defer.inlineCallbacks
  158. def f(self, *args, **kwargs):
  159. try:
  160. res = yield func(self, *args, **kwargs)
  161. except self.database_engine.module.IntegrityError:
  162. logger.exception("IntegrityError, retrying.")
  163. res = yield func(self, *args, delete_existing=True, **kwargs)
  164. defer.returnValue(res)
  165. return f
  166. # inherits from EventFederationStore so that we can call _update_backward_extremities
  167. # and _handle_mult_prev_events (though arguably those could both be moved in here)
  168. class EventsStore(StateGroupWorkerStore, EventFederationStore, EventsWorkerStore,
  169. BackgroundUpdateStore):
  170. EVENT_ORIGIN_SERVER_TS_NAME = "event_origin_server_ts"
  171. EVENT_FIELDS_SENDER_URL_UPDATE_NAME = "event_fields_sender_url"
  172. def __init__(self, db_conn, hs):
  173. super(EventsStore, self).__init__(db_conn, hs)
  174. self.register_background_update_handler(
  175. self.EVENT_ORIGIN_SERVER_TS_NAME, self._background_reindex_origin_server_ts
  176. )
  177. self.register_background_update_handler(
  178. self.EVENT_FIELDS_SENDER_URL_UPDATE_NAME,
  179. self._background_reindex_fields_sender,
  180. )
  181. self.register_background_index_update(
  182. "event_contains_url_index",
  183. index_name="event_contains_url_index",
  184. table="events",
  185. columns=["room_id", "topological_ordering", "stream_ordering"],
  186. where_clause="contains_url = true AND outlier = false",
  187. )
  188. # an event_id index on event_search is useful for the purge_history
  189. # api. Plus it means we get to enforce some integrity with a UNIQUE
  190. # clause
  191. self.register_background_index_update(
  192. "event_search_event_id_idx",
  193. index_name="event_search_event_id_idx",
  194. table="event_search",
  195. columns=["event_id"],
  196. unique=True,
  197. psql_only=True,
  198. )
  199. self._event_persist_queue = _EventPeristenceQueue()
  200. self._state_resolution_handler = hs.get_state_resolution_handler()
  201. @defer.inlineCallbacks
  202. def persist_events(self, events_and_contexts, backfilled=False):
  203. """
  204. Write events to the database
  205. Args:
  206. events_and_contexts: list of tuples of (event, context)
  207. backfilled (bool): Whether the results are retrieved from federation
  208. via backfill or not. Used to determine if they're "new" events
  209. which might update the current state etc.
  210. Returns:
  211. Deferred[int]: the stream ordering of the latest persisted event
  212. """
  213. partitioned = {}
  214. for event, ctx in events_and_contexts:
  215. partitioned.setdefault(event.room_id, []).append((event, ctx))
  216. deferreds = []
  217. for room_id, evs_ctxs in iteritems(partitioned):
  218. d = self._event_persist_queue.add_to_queue(
  219. room_id, evs_ctxs,
  220. backfilled=backfilled,
  221. )
  222. deferreds.append(d)
  223. for room_id in partitioned:
  224. self._maybe_start_persisting(room_id)
  225. yield make_deferred_yieldable(
  226. defer.gatherResults(deferreds, consumeErrors=True)
  227. )
  228. max_persisted_id = yield self._stream_id_gen.get_current_token()
  229. defer.returnValue(max_persisted_id)
  230. @defer.inlineCallbacks
  231. @log_function
  232. def persist_event(self, event, context, backfilled=False):
  233. """
  234. Args:
  235. event (EventBase):
  236. context (EventContext):
  237. backfilled (bool):
  238. Returns:
  239. Deferred: resolves to (int, int): the stream ordering of ``event``,
  240. and the stream ordering of the latest persisted event
  241. """
  242. deferred = self._event_persist_queue.add_to_queue(
  243. event.room_id, [(event, context)],
  244. backfilled=backfilled,
  245. )
  246. self._maybe_start_persisting(event.room_id)
  247. yield make_deferred_yieldable(deferred)
  248. max_persisted_id = yield self._stream_id_gen.get_current_token()
  249. defer.returnValue((event.internal_metadata.stream_ordering, max_persisted_id))
  250. def _maybe_start_persisting(self, room_id):
  251. @defer.inlineCallbacks
  252. def persisting_queue(item):
  253. with Measure(self._clock, "persist_events"):
  254. yield self._persist_events(
  255. item.events_and_contexts,
  256. backfilled=item.backfilled,
  257. )
  258. self._event_persist_queue.handle_queue(room_id, persisting_queue)
  259. @_retry_on_integrity_error
  260. @defer.inlineCallbacks
  261. def _persist_events(self, events_and_contexts, backfilled=False,
  262. delete_existing=False):
  263. """Persist events to db
  264. Args:
  265. events_and_contexts (list[(EventBase, EventContext)]):
  266. backfilled (bool):
  267. delete_existing (bool):
  268. Returns:
  269. Deferred: resolves when the events have been persisted
  270. """
  271. if not events_and_contexts:
  272. return
  273. if backfilled:
  274. stream_ordering_manager = self._backfill_id_gen.get_next_mult(
  275. len(events_and_contexts)
  276. )
  277. else:
  278. stream_ordering_manager = self._stream_id_gen.get_next_mult(
  279. len(events_and_contexts)
  280. )
  281. with stream_ordering_manager as stream_orderings:
  282. for (event, context), stream, in zip(
  283. events_and_contexts, stream_orderings
  284. ):
  285. event.internal_metadata.stream_ordering = stream
  286. chunks = [
  287. events_and_contexts[x:x + 100]
  288. for x in range(0, len(events_and_contexts), 100)
  289. ]
  290. for chunk in chunks:
  291. # We can't easily parallelize these since different chunks
  292. # might contain the same event. :(
  293. # NB: Assumes that we are only persisting events for one room
  294. # at a time.
  295. # map room_id->list[event_ids] giving the new forward
  296. # extremities in each room
  297. new_forward_extremeties = {}
  298. # map room_id->(type,state_key)->event_id tracking the full
  299. # state in each room after adding these events.
  300. # This is simply used to prefill the get_current_state_ids
  301. # cache
  302. current_state_for_room = {}
  303. # map room_id->(to_delete, to_insert) where to_delete is a list
  304. # of type/state keys to remove from current state, and to_insert
  305. # is a map (type,key)->event_id giving the state delta in each
  306. # room
  307. state_delta_for_room = {}
  308. if not backfilled:
  309. with Measure(self._clock, "_calculate_state_and_extrem"):
  310. # Work out the new "current state" for each room.
  311. # We do this by working out what the new extremities are and then
  312. # calculating the state from that.
  313. events_by_room = {}
  314. for event, context in chunk:
  315. events_by_room.setdefault(event.room_id, []).append(
  316. (event, context)
  317. )
  318. for room_id, ev_ctx_rm in iteritems(events_by_room):
  319. latest_event_ids = yield self.get_latest_event_ids_in_room(
  320. room_id
  321. )
  322. new_latest_event_ids = yield self._calculate_new_extremities(
  323. room_id, ev_ctx_rm, latest_event_ids
  324. )
  325. latest_event_ids = set(latest_event_ids)
  326. if new_latest_event_ids == latest_event_ids:
  327. # No change in extremities, so no change in state
  328. continue
  329. # there should always be at least one forward extremity.
  330. # (except during the initial persistence of the send_join
  331. # results, in which case there will be no existing
  332. # extremities, so we'll `continue` above and skip this bit.)
  333. assert new_latest_event_ids, "No forward extremities left!"
  334. new_forward_extremeties[room_id] = new_latest_event_ids
  335. len_1 = (
  336. len(latest_event_ids) == 1
  337. and len(new_latest_event_ids) == 1
  338. )
  339. if len_1:
  340. all_single_prev_not_state = all(
  341. len(event.prev_event_ids()) == 1
  342. and not event.is_state()
  343. for event, ctx in ev_ctx_rm
  344. )
  345. # Don't bother calculating state if they're just
  346. # a long chain of single ancestor non-state events.
  347. if all_single_prev_not_state:
  348. continue
  349. state_delta_counter.inc()
  350. if len(new_latest_event_ids) == 1:
  351. state_delta_single_event_counter.inc()
  352. # This is a fairly handwavey check to see if we could
  353. # have guessed what the delta would have been when
  354. # processing one of these events.
  355. # What we're interested in is if the latest extremities
  356. # were the same when we created the event as they are
  357. # now. When this server creates a new event (as opposed
  358. # to receiving it over federation) it will use the
  359. # forward extremities as the prev_events, so we can
  360. # guess this by looking at the prev_events and checking
  361. # if they match the current forward extremities.
  362. for ev, _ in ev_ctx_rm:
  363. prev_event_ids = set(ev.prev_event_ids())
  364. if latest_event_ids == prev_event_ids:
  365. state_delta_reuse_delta_counter.inc()
  366. break
  367. logger.info(
  368. "Calculating state delta for room %s", room_id,
  369. )
  370. with Measure(
  371. self._clock,
  372. "persist_events.get_new_state_after_events",
  373. ):
  374. res = yield self._get_new_state_after_events(
  375. room_id,
  376. ev_ctx_rm,
  377. latest_event_ids,
  378. new_latest_event_ids,
  379. )
  380. current_state, delta_ids = res
  381. # If either are not None then there has been a change,
  382. # and we need to work out the delta (or use that
  383. # given)
  384. if delta_ids is not None:
  385. # If there is a delta we know that we've
  386. # only added or replaced state, never
  387. # removed keys entirely.
  388. state_delta_for_room[room_id] = ([], delta_ids)
  389. elif current_state is not None:
  390. with Measure(
  391. self._clock,
  392. "persist_events.calculate_state_delta",
  393. ):
  394. delta = yield self._calculate_state_delta(
  395. room_id, current_state,
  396. )
  397. state_delta_for_room[room_id] = delta
  398. # If we have the current_state then lets prefill
  399. # the cache with it.
  400. if current_state is not None:
  401. current_state_for_room[room_id] = current_state
  402. yield self.runInteraction(
  403. "persist_events",
  404. self._persist_events_txn,
  405. events_and_contexts=chunk,
  406. backfilled=backfilled,
  407. delete_existing=delete_existing,
  408. state_delta_for_room=state_delta_for_room,
  409. new_forward_extremeties=new_forward_extremeties,
  410. )
  411. persist_event_counter.inc(len(chunk))
  412. if not backfilled:
  413. # backfilled events have negative stream orderings, so we don't
  414. # want to set the event_persisted_position to that.
  415. synapse.metrics.event_persisted_position.set(
  416. chunk[-1][0].internal_metadata.stream_ordering,
  417. )
  418. for event, context in chunk:
  419. if context.app_service:
  420. origin_type = "local"
  421. origin_entity = context.app_service.id
  422. elif self.hs.is_mine_id(event.sender):
  423. origin_type = "local"
  424. origin_entity = "*client*"
  425. else:
  426. origin_type = "remote"
  427. origin_entity = get_domain_from_id(event.sender)
  428. event_counter.labels(event.type, origin_type, origin_entity).inc()
  429. for room_id, new_state in iteritems(current_state_for_room):
  430. self.get_current_state_ids.prefill(
  431. (room_id, ), new_state
  432. )
  433. for room_id, latest_event_ids in iteritems(new_forward_extremeties):
  434. self.get_latest_event_ids_in_room.prefill(
  435. (room_id,), list(latest_event_ids)
  436. )
  437. @defer.inlineCallbacks
  438. def _calculate_new_extremities(self, room_id, event_contexts, latest_event_ids):
  439. """Calculates the new forward extremities for a room given events to
  440. persist.
  441. Assumes that we are only persisting events for one room at a time.
  442. """
  443. # we're only interested in new events which aren't outliers and which aren't
  444. # being rejected.
  445. new_events = [
  446. event for event, ctx in event_contexts
  447. if not event.internal_metadata.is_outlier() and not ctx.rejected
  448. ]
  449. # start with the existing forward extremities
  450. result = set(latest_event_ids)
  451. # add all the new events to the list
  452. result.update(
  453. event.event_id for event in new_events
  454. )
  455. # Now remove all events which are prev_events of any of the new events
  456. result.difference_update(
  457. e_id
  458. for event in new_events
  459. for e_id in event.prev_event_ids()
  460. )
  461. # Finally, remove any events which are prev_events of any existing events.
  462. existing_prevs = yield self._get_events_which_are_prevs(result)
  463. result.difference_update(existing_prevs)
  464. defer.returnValue(result)
  465. @defer.inlineCallbacks
  466. def _get_events_which_are_prevs(self, event_ids):
  467. """Filter the supplied list of event_ids to get those which are prev_events of
  468. existing (non-outlier/rejected) events.
  469. Args:
  470. event_ids (Iterable[str]): event ids to filter
  471. Returns:
  472. Deferred[List[str]]: filtered event ids
  473. """
  474. results = []
  475. def _get_events(txn, batch):
  476. sql = """
  477. SELECT prev_event_id
  478. FROM event_edges
  479. INNER JOIN events USING (event_id)
  480. LEFT JOIN rejections USING (event_id)
  481. WHERE
  482. prev_event_id IN (%s)
  483. AND NOT events.outlier
  484. AND rejections.event_id IS NULL
  485. """ % (
  486. ",".join("?" for _ in batch),
  487. )
  488. txn.execute(sql, batch)
  489. results.extend(r[0] for r in txn)
  490. for chunk in batch_iter(event_ids, 100):
  491. yield self.runInteraction(
  492. "_get_events_which_are_prevs",
  493. _get_events,
  494. chunk,
  495. )
  496. defer.returnValue(results)
  497. @defer.inlineCallbacks
  498. def _get_new_state_after_events(self, room_id, events_context, old_latest_event_ids,
  499. new_latest_event_ids):
  500. """Calculate the current state dict after adding some new events to
  501. a room
  502. Args:
  503. room_id (str):
  504. room to which the events are being added. Used for logging etc
  505. events_context (list[(EventBase, EventContext)]):
  506. events and contexts which are being added to the room
  507. old_latest_event_ids (iterable[str]):
  508. the old forward extremities for the room.
  509. new_latest_event_ids (iterable[str]):
  510. the new forward extremities for the room.
  511. Returns:
  512. Deferred[tuple[dict[(str,str), str]|None, dict[(str,str), str]|None]]:
  513. Returns a tuple of two state maps, the first being the full new current
  514. state and the second being the delta to the existing current state.
  515. If both are None then there has been no change.
  516. If there has been a change then we only return the delta if its
  517. already been calculated. Conversely if we do know the delta then
  518. the new current state is only returned if we've already calculated
  519. it.
  520. """
  521. # map from state_group to ((type, key) -> event_id) state map
  522. state_groups_map = {}
  523. # Map from (prev state group, new state group) -> delta state dict
  524. state_group_deltas = {}
  525. for ev, ctx in events_context:
  526. if ctx.state_group is None:
  527. # This should only happen for outlier events.
  528. if not ev.internal_metadata.is_outlier():
  529. raise Exception(
  530. "Context for new event %s has no state "
  531. "group" % (ev.event_id, ),
  532. )
  533. continue
  534. if ctx.state_group in state_groups_map:
  535. continue
  536. # We're only interested in pulling out state that has already
  537. # been cached in the context. We'll pull stuff out of the DB later
  538. # if necessary.
  539. current_state_ids = ctx.get_cached_current_state_ids()
  540. if current_state_ids is not None:
  541. state_groups_map[ctx.state_group] = current_state_ids
  542. if ctx.prev_group:
  543. state_group_deltas[(ctx.prev_group, ctx.state_group)] = ctx.delta_ids
  544. # We need to map the event_ids to their state groups. First, let's
  545. # check if the event is one we're persisting, in which case we can
  546. # pull the state group from its context.
  547. # Otherwise we need to pull the state group from the database.
  548. # Set of events we need to fetch groups for. (We know none of the old
  549. # extremities are going to be in events_context).
  550. missing_event_ids = set(old_latest_event_ids)
  551. event_id_to_state_group = {}
  552. for event_id in new_latest_event_ids:
  553. # First search in the list of new events we're adding.
  554. for ev, ctx in events_context:
  555. if event_id == ev.event_id and ctx.state_group is not None:
  556. event_id_to_state_group[event_id] = ctx.state_group
  557. break
  558. else:
  559. # If we couldn't find it, then we'll need to pull
  560. # the state from the database
  561. missing_event_ids.add(event_id)
  562. if missing_event_ids:
  563. # Now pull out the state groups for any missing events from DB
  564. event_to_groups = yield self._get_state_group_for_events(
  565. missing_event_ids,
  566. )
  567. event_id_to_state_group.update(event_to_groups)
  568. # State groups of old_latest_event_ids
  569. old_state_groups = set(
  570. event_id_to_state_group[evid] for evid in old_latest_event_ids
  571. )
  572. # State groups of new_latest_event_ids
  573. new_state_groups = set(
  574. event_id_to_state_group[evid] for evid in new_latest_event_ids
  575. )
  576. # If they old and new groups are the same then we don't need to do
  577. # anything.
  578. if old_state_groups == new_state_groups:
  579. defer.returnValue((None, None))
  580. if len(new_state_groups) == 1 and len(old_state_groups) == 1:
  581. # If we're going from one state group to another, lets check if
  582. # we have a delta for that transition. If we do then we can just
  583. # return that.
  584. new_state_group = next(iter(new_state_groups))
  585. old_state_group = next(iter(old_state_groups))
  586. delta_ids = state_group_deltas.get(
  587. (old_state_group, new_state_group,), None
  588. )
  589. if delta_ids is not None:
  590. # We have a delta from the existing to new current state,
  591. # so lets just return that. If we happen to already have
  592. # the current state in memory then lets also return that,
  593. # but it doesn't matter if we don't.
  594. new_state = state_groups_map.get(new_state_group)
  595. defer.returnValue((new_state, delta_ids))
  596. # Now that we have calculated new_state_groups we need to get
  597. # their state IDs so we can resolve to a single state set.
  598. missing_state = new_state_groups - set(state_groups_map)
  599. if missing_state:
  600. group_to_state = yield self._get_state_for_groups(missing_state)
  601. state_groups_map.update(group_to_state)
  602. if len(new_state_groups) == 1:
  603. # If there is only one state group, then we know what the current
  604. # state is.
  605. defer.returnValue((state_groups_map[new_state_groups.pop()], None))
  606. # Ok, we need to defer to the state handler to resolve our state sets.
  607. state_groups = {
  608. sg: state_groups_map[sg] for sg in new_state_groups
  609. }
  610. events_map = {ev.event_id: ev for ev, _ in events_context}
  611. room_version = yield self.get_room_version(room_id)
  612. logger.debug("calling resolve_state_groups from preserve_events")
  613. res = yield self._state_resolution_handler.resolve_state_groups(
  614. room_id, room_version, state_groups, events_map,
  615. state_res_store=StateResolutionStore(self)
  616. )
  617. defer.returnValue((res.state, None))
  618. @defer.inlineCallbacks
  619. def _calculate_state_delta(self, room_id, current_state):
  620. """Calculate the new state deltas for a room.
  621. Assumes that we are only persisting events for one room at a time.
  622. Returns:
  623. tuple[list, dict] (to_delete, to_insert): where to_delete are the
  624. type/state_keys to remove from current_state_events and `to_insert`
  625. are the updates to current_state_events.
  626. """
  627. existing_state = yield self.get_current_state_ids(room_id)
  628. to_delete = [
  629. key for key in existing_state
  630. if key not in current_state
  631. ]
  632. to_insert = {
  633. key: ev_id for key, ev_id in iteritems(current_state)
  634. if ev_id != existing_state.get(key)
  635. }
  636. defer.returnValue((to_delete, to_insert))
  637. @log_function
  638. def _persist_events_txn(self, txn, events_and_contexts, backfilled,
  639. delete_existing=False, state_delta_for_room={},
  640. new_forward_extremeties={}):
  641. """Insert some number of room events into the necessary database tables.
  642. Rejected events are only inserted into the events table, the events_json table,
  643. and the rejections table. Things reading from those table will need to check
  644. whether the event was rejected.
  645. Args:
  646. txn (twisted.enterprise.adbapi.Connection): db connection
  647. events_and_contexts (list[(EventBase, EventContext)]):
  648. events to persist
  649. backfilled (bool): True if the events were backfilled
  650. delete_existing (bool): True to purge existing table rows for the
  651. events from the database. This is useful when retrying due to
  652. IntegrityError.
  653. state_delta_for_room (dict[str, (list, dict)]):
  654. The current-state delta for each room. For each room, a tuple
  655. (to_delete, to_insert), being a list of type/state keys to be
  656. removed from the current state, and a state set to be added to
  657. the current state.
  658. new_forward_extremeties (dict[str, list[str]]):
  659. The new forward extremities for each room. For each room, a
  660. list of the event ids which are the forward extremities.
  661. """
  662. all_events_and_contexts = events_and_contexts
  663. max_stream_order = events_and_contexts[-1][0].internal_metadata.stream_ordering
  664. self._update_current_state_txn(txn, state_delta_for_room, max_stream_order)
  665. self._update_forward_extremities_txn(
  666. txn,
  667. new_forward_extremities=new_forward_extremeties,
  668. max_stream_order=max_stream_order,
  669. )
  670. # Ensure that we don't have the same event twice.
  671. events_and_contexts = self._filter_events_and_contexts_for_duplicates(
  672. events_and_contexts,
  673. )
  674. self._update_room_depths_txn(
  675. txn,
  676. events_and_contexts=events_and_contexts,
  677. backfilled=backfilled,
  678. )
  679. # _update_outliers_txn filters out any events which have already been
  680. # persisted, and returns the filtered list.
  681. events_and_contexts = self._update_outliers_txn(
  682. txn,
  683. events_and_contexts=events_and_contexts,
  684. )
  685. # From this point onwards the events are only events that we haven't
  686. # seen before.
  687. if delete_existing:
  688. # For paranoia reasons, we go and delete all the existing entries
  689. # for these events so we can reinsert them.
  690. # This gets around any problems with some tables already having
  691. # entries.
  692. self._delete_existing_rows_txn(
  693. txn,
  694. events_and_contexts=events_and_contexts,
  695. )
  696. self._store_event_txn(
  697. txn,
  698. events_and_contexts=events_and_contexts,
  699. )
  700. # Insert into event_to_state_groups.
  701. self._store_event_state_mappings_txn(txn, events_and_contexts)
  702. # We want to store event_auth mappings for rejected events, as they're
  703. # used in state res v2.
  704. # This is only necessary if the rejected event appears in an accepted
  705. # event's auth chain, but its easier for now just to store them (and
  706. # it doesn't take much storage compared to storing the entire event
  707. # anyway).
  708. self._simple_insert_many_txn(
  709. txn,
  710. table="event_auth",
  711. values=[
  712. {
  713. "event_id": event.event_id,
  714. "room_id": event.room_id,
  715. "auth_id": auth_id,
  716. }
  717. for event, _ in events_and_contexts
  718. for auth_id in event.auth_event_ids()
  719. if event.is_state()
  720. ],
  721. )
  722. # _store_rejected_events_txn filters out any events which were
  723. # rejected, and returns the filtered list.
  724. events_and_contexts = self._store_rejected_events_txn(
  725. txn,
  726. events_and_contexts=events_and_contexts,
  727. )
  728. # From this point onwards the events are only ones that weren't
  729. # rejected.
  730. self._update_metadata_tables_txn(
  731. txn,
  732. events_and_contexts=events_and_contexts,
  733. all_events_and_contexts=all_events_and_contexts,
  734. backfilled=backfilled,
  735. )
  736. def _update_current_state_txn(self, txn, state_delta_by_room, max_stream_order):
  737. for room_id, current_state_tuple in iteritems(state_delta_by_room):
  738. to_delete, to_insert = current_state_tuple
  739. # First we add entries to the current_state_delta_stream. We
  740. # do this before updating the current_state_events table so
  741. # that we can use it to calculate the `prev_event_id`. (This
  742. # allows us to not have to pull out the existing state
  743. # unnecessarily).
  744. sql = """
  745. INSERT INTO current_state_delta_stream
  746. (stream_id, room_id, type, state_key, event_id, prev_event_id)
  747. SELECT ?, ?, ?, ?, ?, (
  748. SELECT event_id FROM current_state_events
  749. WHERE room_id = ? AND type = ? AND state_key = ?
  750. )
  751. """
  752. txn.executemany(sql, (
  753. (
  754. max_stream_order, room_id, etype, state_key, None,
  755. room_id, etype, state_key,
  756. )
  757. for etype, state_key in to_delete
  758. # We sanity check that we're deleting rather than updating
  759. if (etype, state_key) not in to_insert
  760. ))
  761. txn.executemany(sql, (
  762. (
  763. max_stream_order, room_id, etype, state_key, ev_id,
  764. room_id, etype, state_key,
  765. )
  766. for (etype, state_key), ev_id in iteritems(to_insert)
  767. ))
  768. # Now we actually update the current_state_events table
  769. txn.executemany(
  770. "DELETE FROM current_state_events"
  771. " WHERE room_id = ? AND type = ? AND state_key = ?",
  772. (
  773. (room_id, etype, state_key)
  774. for etype, state_key in itertools.chain(to_delete, to_insert)
  775. ),
  776. )
  777. self._simple_insert_many_txn(
  778. txn,
  779. table="current_state_events",
  780. values=[
  781. {
  782. "event_id": ev_id,
  783. "room_id": room_id,
  784. "type": key[0],
  785. "state_key": key[1],
  786. }
  787. for key, ev_id in iteritems(to_insert)
  788. ],
  789. )
  790. txn.call_after(
  791. self._curr_state_delta_stream_cache.entity_has_changed,
  792. room_id, max_stream_order,
  793. )
  794. # Invalidate the various caches
  795. # Figure out the changes of membership to invalidate the
  796. # `get_rooms_for_user` cache.
  797. # We find out which membership events we may have deleted
  798. # and which we have added, then we invlidate the caches for all
  799. # those users.
  800. members_changed = set(
  801. state_key
  802. for ev_type, state_key in itertools.chain(to_delete, to_insert)
  803. if ev_type == EventTypes.Member
  804. )
  805. for member in members_changed:
  806. self._invalidate_cache_and_stream(
  807. txn, self.get_rooms_for_user_with_stream_ordering, (member,)
  808. )
  809. for host in set(get_domain_from_id(u) for u in members_changed):
  810. self._invalidate_cache_and_stream(
  811. txn, self.is_host_joined, (room_id, host)
  812. )
  813. self._invalidate_cache_and_stream(
  814. txn, self.was_host_joined, (room_id, host)
  815. )
  816. self._invalidate_cache_and_stream(
  817. txn, self.get_users_in_room, (room_id,)
  818. )
  819. self._invalidate_cache_and_stream(
  820. txn, self.get_room_summary, (room_id,)
  821. )
  822. self._invalidate_cache_and_stream(
  823. txn, self.get_current_state_ids, (room_id,)
  824. )
  825. def _update_forward_extremities_txn(self, txn, new_forward_extremities,
  826. max_stream_order):
  827. for room_id, new_extrem in iteritems(new_forward_extremities):
  828. self._simple_delete_txn(
  829. txn,
  830. table="event_forward_extremities",
  831. keyvalues={"room_id": room_id},
  832. )
  833. txn.call_after(
  834. self.get_latest_event_ids_in_room.invalidate, (room_id,)
  835. )
  836. self._simple_insert_many_txn(
  837. txn,
  838. table="event_forward_extremities",
  839. values=[
  840. {
  841. "event_id": ev_id,
  842. "room_id": room_id,
  843. }
  844. for room_id, new_extrem in iteritems(new_forward_extremities)
  845. for ev_id in new_extrem
  846. ],
  847. )
  848. # We now insert into stream_ordering_to_exterm a mapping from room_id,
  849. # new stream_ordering to new forward extremeties in the room.
  850. # This allows us to later efficiently look up the forward extremeties
  851. # for a room before a given stream_ordering
  852. self._simple_insert_many_txn(
  853. txn,
  854. table="stream_ordering_to_exterm",
  855. values=[
  856. {
  857. "room_id": room_id,
  858. "event_id": event_id,
  859. "stream_ordering": max_stream_order,
  860. }
  861. for room_id, new_extrem in iteritems(new_forward_extremities)
  862. for event_id in new_extrem
  863. ]
  864. )
  865. @classmethod
  866. def _filter_events_and_contexts_for_duplicates(cls, events_and_contexts):
  867. """Ensure that we don't have the same event twice.
  868. Pick the earliest non-outlier if there is one, else the earliest one.
  869. Args:
  870. events_and_contexts (list[(EventBase, EventContext)]):
  871. Returns:
  872. list[(EventBase, EventContext)]: filtered list
  873. """
  874. new_events_and_contexts = OrderedDict()
  875. for event, context in events_and_contexts:
  876. prev_event_context = new_events_and_contexts.get(event.event_id)
  877. if prev_event_context:
  878. if not event.internal_metadata.is_outlier():
  879. if prev_event_context[0].internal_metadata.is_outlier():
  880. # To ensure correct ordering we pop, as OrderedDict is
  881. # ordered by first insertion.
  882. new_events_and_contexts.pop(event.event_id, None)
  883. new_events_and_contexts[event.event_id] = (event, context)
  884. else:
  885. new_events_and_contexts[event.event_id] = (event, context)
  886. return list(new_events_and_contexts.values())
  887. def _update_room_depths_txn(self, txn, events_and_contexts, backfilled):
  888. """Update min_depth for each room
  889. Args:
  890. txn (twisted.enterprise.adbapi.Connection): db connection
  891. events_and_contexts (list[(EventBase, EventContext)]): events
  892. we are persisting
  893. backfilled (bool): True if the events were backfilled
  894. """
  895. depth_updates = {}
  896. for event, context in events_and_contexts:
  897. # Remove the any existing cache entries for the event_ids
  898. txn.call_after(self._invalidate_get_event_cache, event.event_id)
  899. if not backfilled:
  900. txn.call_after(
  901. self._events_stream_cache.entity_has_changed,
  902. event.room_id, event.internal_metadata.stream_ordering,
  903. )
  904. if not event.internal_metadata.is_outlier() and not context.rejected:
  905. depth_updates[event.room_id] = max(
  906. event.depth, depth_updates.get(event.room_id, event.depth)
  907. )
  908. for room_id, depth in iteritems(depth_updates):
  909. self._update_min_depth_for_room_txn(txn, room_id, depth)
  910. def _update_outliers_txn(self, txn, events_and_contexts):
  911. """Update any outliers with new event info.
  912. This turns outliers into ex-outliers (unless the new event was
  913. rejected).
  914. Args:
  915. txn (twisted.enterprise.adbapi.Connection): db connection
  916. events_and_contexts (list[(EventBase, EventContext)]): events
  917. we are persisting
  918. Returns:
  919. list[(EventBase, EventContext)] new list, without events which
  920. are already in the events table.
  921. """
  922. txn.execute(
  923. "SELECT event_id, outlier FROM events WHERE event_id in (%s)" % (
  924. ",".join(["?"] * len(events_and_contexts)),
  925. ),
  926. [event.event_id for event, _ in events_and_contexts]
  927. )
  928. have_persisted = {
  929. event_id: outlier
  930. for event_id, outlier in txn
  931. }
  932. to_remove = set()
  933. for event, context in events_and_contexts:
  934. if event.event_id not in have_persisted:
  935. continue
  936. to_remove.add(event)
  937. if context.rejected:
  938. # If the event is rejected then we don't care if the event
  939. # was an outlier or not.
  940. continue
  941. outlier_persisted = have_persisted[event.event_id]
  942. if not event.internal_metadata.is_outlier() and outlier_persisted:
  943. # We received a copy of an event that we had already stored as
  944. # an outlier in the database. We now have some state at that
  945. # so we need to update the state_groups table with that state.
  946. # insert into event_to_state_groups.
  947. try:
  948. self._store_event_state_mappings_txn(txn, ((event, context),))
  949. except Exception:
  950. logger.exception("")
  951. raise
  952. metadata_json = encode_json(
  953. event.internal_metadata.get_dict()
  954. )
  955. sql = (
  956. "UPDATE event_json SET internal_metadata = ?"
  957. " WHERE event_id = ?"
  958. )
  959. txn.execute(
  960. sql,
  961. (metadata_json, event.event_id,)
  962. )
  963. # Add an entry to the ex_outlier_stream table to replicate the
  964. # change in outlier status to our workers.
  965. stream_order = event.internal_metadata.stream_ordering
  966. state_group_id = context.state_group
  967. self._simple_insert_txn(
  968. txn,
  969. table="ex_outlier_stream",
  970. values={
  971. "event_stream_ordering": stream_order,
  972. "event_id": event.event_id,
  973. "state_group": state_group_id,
  974. }
  975. )
  976. sql = (
  977. "UPDATE events SET outlier = ?"
  978. " WHERE event_id = ?"
  979. )
  980. txn.execute(
  981. sql,
  982. (False, event.event_id,)
  983. )
  984. # Update the event_backward_extremities table now that this
  985. # event isn't an outlier any more.
  986. self._update_backward_extremeties(txn, [event])
  987. return [
  988. ec for ec in events_and_contexts if ec[0] not in to_remove
  989. ]
  990. @classmethod
  991. def _delete_existing_rows_txn(cls, txn, events_and_contexts):
  992. if not events_and_contexts:
  993. # nothing to do here
  994. return
  995. logger.info("Deleting existing")
  996. for table in (
  997. "events",
  998. "event_auth",
  999. "event_json",
  1000. "event_content_hashes",
  1001. "event_destinations",
  1002. "event_edge_hashes",
  1003. "event_edges",
  1004. "event_forward_extremities",
  1005. "event_reference_hashes",
  1006. "event_search",
  1007. "event_signatures",
  1008. "event_to_state_groups",
  1009. "guest_access",
  1010. "history_visibility",
  1011. "local_invites",
  1012. "room_names",
  1013. "state_events",
  1014. "rejections",
  1015. "redactions",
  1016. "room_memberships",
  1017. "topics"
  1018. ):
  1019. txn.executemany(
  1020. "DELETE FROM %s WHERE event_id = ?" % (table,),
  1021. [(ev.event_id,) for ev, _ in events_and_contexts]
  1022. )
  1023. for table in (
  1024. "event_push_actions",
  1025. ):
  1026. txn.executemany(
  1027. "DELETE FROM %s WHERE room_id = ? AND event_id = ?" % (table,),
  1028. [(ev.room_id, ev.event_id) for ev, _ in events_and_contexts]
  1029. )
  1030. def _store_event_txn(self, txn, events_and_contexts):
  1031. """Insert new events into the event and event_json tables
  1032. Args:
  1033. txn (twisted.enterprise.adbapi.Connection): db connection
  1034. events_and_contexts (list[(EventBase, EventContext)]): events
  1035. we are persisting
  1036. """
  1037. if not events_and_contexts:
  1038. # nothing to do here
  1039. return
  1040. def event_dict(event):
  1041. d = event.get_dict()
  1042. d.pop("redacted", None)
  1043. d.pop("redacted_because", None)
  1044. return d
  1045. self._simple_insert_many_txn(
  1046. txn,
  1047. table="event_json",
  1048. values=[
  1049. {
  1050. "event_id": event.event_id,
  1051. "room_id": event.room_id,
  1052. "internal_metadata": encode_json(
  1053. event.internal_metadata.get_dict()
  1054. ),
  1055. "json": encode_json(event_dict(event)),
  1056. }
  1057. for event, _ in events_and_contexts
  1058. ],
  1059. )
  1060. self._simple_insert_many_txn(
  1061. txn,
  1062. table="events",
  1063. values=[
  1064. {
  1065. "stream_ordering": event.internal_metadata.stream_ordering,
  1066. "topological_ordering": event.depth,
  1067. "depth": event.depth,
  1068. "event_id": event.event_id,
  1069. "room_id": event.room_id,
  1070. "type": event.type,
  1071. "processed": True,
  1072. "outlier": event.internal_metadata.is_outlier(),
  1073. "origin_server_ts": int(event.origin_server_ts),
  1074. "received_ts": self._clock.time_msec(),
  1075. "sender": event.sender,
  1076. "contains_url": (
  1077. "url" in event.content
  1078. and isinstance(event.content["url"], text_type)
  1079. ),
  1080. }
  1081. for event, _ in events_and_contexts
  1082. ],
  1083. )
  1084. def _store_rejected_events_txn(self, txn, events_and_contexts):
  1085. """Add rows to the 'rejections' table for received events which were
  1086. rejected
  1087. Args:
  1088. txn (twisted.enterprise.adbapi.Connection): db connection
  1089. events_and_contexts (list[(EventBase, EventContext)]): events
  1090. we are persisting
  1091. Returns:
  1092. list[(EventBase, EventContext)] new list, without the rejected
  1093. events.
  1094. """
  1095. # Remove the rejected events from the list now that we've added them
  1096. # to the events table and the events_json table.
  1097. to_remove = set()
  1098. for event, context in events_and_contexts:
  1099. if context.rejected:
  1100. # Insert the event_id into the rejections table
  1101. self._store_rejections_txn(
  1102. txn, event.event_id, context.rejected
  1103. )
  1104. to_remove.add(event)
  1105. return [
  1106. ec for ec in events_and_contexts if ec[0] not in to_remove
  1107. ]
  1108. def _update_metadata_tables_txn(self, txn, events_and_contexts,
  1109. all_events_and_contexts, backfilled):
  1110. """Update all the miscellaneous tables for new events
  1111. Args:
  1112. txn (twisted.enterprise.adbapi.Connection): db connection
  1113. events_and_contexts (list[(EventBase, EventContext)]): events
  1114. we are persisting
  1115. all_events_and_contexts (list[(EventBase, EventContext)]): all
  1116. events that we were going to persist. This includes events
  1117. we've already persisted, etc, that wouldn't appear in
  1118. events_and_context.
  1119. backfilled (bool): True if the events were backfilled
  1120. """
  1121. # Insert all the push actions into the event_push_actions table.
  1122. self._set_push_actions_for_event_and_users_txn(
  1123. txn,
  1124. events_and_contexts=events_and_contexts,
  1125. all_events_and_contexts=all_events_and_contexts,
  1126. )
  1127. if not events_and_contexts:
  1128. # nothing to do here
  1129. return
  1130. for event, context in events_and_contexts:
  1131. if event.type == EventTypes.Redaction and event.redacts is not None:
  1132. # Remove the entries in the event_push_actions table for the
  1133. # redacted event.
  1134. self._remove_push_actions_for_event_id_txn(
  1135. txn, event.room_id, event.redacts
  1136. )
  1137. # Update the event_forward_extremities, event_backward_extremities and
  1138. # event_edges tables.
  1139. self._handle_mult_prev_events(
  1140. txn,
  1141. events=[event for event, _ in events_and_contexts],
  1142. )
  1143. for event, _ in events_and_contexts:
  1144. if event.type == EventTypes.Name:
  1145. # Insert into the room_names and event_search tables.
  1146. self._store_room_name_txn(txn, event)
  1147. elif event.type == EventTypes.Topic:
  1148. # Insert into the topics table and event_search table.
  1149. self._store_room_topic_txn(txn, event)
  1150. elif event.type == EventTypes.Message:
  1151. # Insert into the event_search table.
  1152. self._store_room_message_txn(txn, event)
  1153. elif event.type == EventTypes.Redaction:
  1154. # Insert into the redactions table.
  1155. self._store_redaction(txn, event)
  1156. elif event.type == EventTypes.RoomHistoryVisibility:
  1157. # Insert into the event_search table.
  1158. self._store_history_visibility_txn(txn, event)
  1159. elif event.type == EventTypes.GuestAccess:
  1160. # Insert into the event_search table.
  1161. self._store_guest_access_txn(txn, event)
  1162. # Insert into the room_memberships table.
  1163. self._store_room_members_txn(
  1164. txn,
  1165. [
  1166. event
  1167. for event, _ in events_and_contexts
  1168. if event.type == EventTypes.Member
  1169. ],
  1170. backfilled=backfilled,
  1171. )
  1172. # Insert event_reference_hashes table.
  1173. self._store_event_reference_hashes_txn(
  1174. txn, [event for event, _ in events_and_contexts]
  1175. )
  1176. state_events_and_contexts = [
  1177. ec for ec in events_and_contexts if ec[0].is_state()
  1178. ]
  1179. state_values = []
  1180. for event, context in state_events_and_contexts:
  1181. vals = {
  1182. "event_id": event.event_id,
  1183. "room_id": event.room_id,
  1184. "type": event.type,
  1185. "state_key": event.state_key,
  1186. }
  1187. # TODO: How does this work with backfilling?
  1188. if hasattr(event, "replaces_state"):
  1189. vals["prev_state"] = event.replaces_state
  1190. state_values.append(vals)
  1191. self._simple_insert_many_txn(
  1192. txn,
  1193. table="state_events",
  1194. values=state_values,
  1195. )
  1196. self._simple_insert_many_txn(
  1197. txn,
  1198. table="event_edges",
  1199. values=[
  1200. {
  1201. "event_id": event.event_id,
  1202. "prev_event_id": prev_id,
  1203. "room_id": event.room_id,
  1204. "is_state": True,
  1205. }
  1206. for event, _ in state_events_and_contexts
  1207. for prev_id, _ in event.prev_state
  1208. ],
  1209. )
  1210. # Prefill the event cache
  1211. self._add_to_cache(txn, events_and_contexts)
  1212. def _add_to_cache(self, txn, events_and_contexts):
  1213. to_prefill = []
  1214. rows = []
  1215. N = 200
  1216. for i in range(0, len(events_and_contexts), N):
  1217. ev_map = {
  1218. e[0].event_id: e[0]
  1219. for e in events_and_contexts[i:i + N]
  1220. }
  1221. if not ev_map:
  1222. break
  1223. sql = (
  1224. "SELECT "
  1225. " e.event_id as event_id, "
  1226. " r.redacts as redacts,"
  1227. " rej.event_id as rejects "
  1228. " FROM events as e"
  1229. " LEFT JOIN rejections as rej USING (event_id)"
  1230. " LEFT JOIN redactions as r ON e.event_id = r.redacts"
  1231. " WHERE e.event_id IN (%s)"
  1232. ) % (",".join(["?"] * len(ev_map)),)
  1233. txn.execute(sql, list(ev_map))
  1234. rows = self.cursor_to_dict(txn)
  1235. for row in rows:
  1236. event = ev_map[row["event_id"]]
  1237. if not row["rejects"] and not row["redacts"]:
  1238. to_prefill.append(_EventCacheEntry(
  1239. event=event,
  1240. redacted_event=None,
  1241. ))
  1242. def prefill():
  1243. for cache_entry in to_prefill:
  1244. self._get_event_cache.prefill((cache_entry[0].event_id,), cache_entry)
  1245. txn.call_after(prefill)
  1246. def _store_redaction(self, txn, event):
  1247. # invalidate the cache for the redacted event
  1248. txn.call_after(self._invalidate_get_event_cache, event.redacts)
  1249. txn.execute(
  1250. "INSERT INTO redactions (event_id, redacts) VALUES (?,?)",
  1251. (event.event_id, event.redacts)
  1252. )
  1253. @defer.inlineCallbacks
  1254. def count_daily_messages(self):
  1255. """
  1256. Returns an estimate of the number of messages sent in the last day.
  1257. If it has been significantly less or more than one day since the last
  1258. call to this function, it will return None.
  1259. """
  1260. def _count_messages(txn):
  1261. sql = """
  1262. SELECT COALESCE(COUNT(*), 0) FROM events
  1263. WHERE type = 'm.room.message'
  1264. AND stream_ordering > ?
  1265. """
  1266. txn.execute(sql, (self.stream_ordering_day_ago,))
  1267. count, = txn.fetchone()
  1268. return count
  1269. ret = yield self.runInteraction("count_messages", _count_messages)
  1270. defer.returnValue(ret)
  1271. @defer.inlineCallbacks
  1272. def count_daily_sent_messages(self):
  1273. def _count_messages(txn):
  1274. # This is good enough as if you have silly characters in your own
  1275. # hostname then thats your own fault.
  1276. like_clause = "%:" + self.hs.hostname
  1277. sql = """
  1278. SELECT COALESCE(COUNT(*), 0) FROM events
  1279. WHERE type = 'm.room.message'
  1280. AND sender LIKE ?
  1281. AND stream_ordering > ?
  1282. """
  1283. txn.execute(sql, (like_clause, self.stream_ordering_day_ago,))
  1284. count, = txn.fetchone()
  1285. return count
  1286. ret = yield self.runInteraction("count_daily_sent_messages", _count_messages)
  1287. defer.returnValue(ret)
  1288. @defer.inlineCallbacks
  1289. def count_daily_active_rooms(self):
  1290. def _count(txn):
  1291. sql = """
  1292. SELECT COALESCE(COUNT(DISTINCT room_id), 0) FROM events
  1293. WHERE type = 'm.room.message'
  1294. AND stream_ordering > ?
  1295. """
  1296. txn.execute(sql, (self.stream_ordering_day_ago,))
  1297. count, = txn.fetchone()
  1298. return count
  1299. ret = yield self.runInteraction("count_daily_active_rooms", _count)
  1300. defer.returnValue(ret)
  1301. @defer.inlineCallbacks
  1302. def _background_reindex_fields_sender(self, progress, batch_size):
  1303. target_min_stream_id = progress["target_min_stream_id_inclusive"]
  1304. max_stream_id = progress["max_stream_id_exclusive"]
  1305. rows_inserted = progress.get("rows_inserted", 0)
  1306. INSERT_CLUMP_SIZE = 1000
  1307. def reindex_txn(txn):
  1308. sql = (
  1309. "SELECT stream_ordering, event_id, json FROM events"
  1310. " INNER JOIN event_json USING (event_id)"
  1311. " WHERE ? <= stream_ordering AND stream_ordering < ?"
  1312. " ORDER BY stream_ordering DESC"
  1313. " LIMIT ?"
  1314. )
  1315. txn.execute(sql, (target_min_stream_id, max_stream_id, batch_size))
  1316. rows = txn.fetchall()
  1317. if not rows:
  1318. return 0
  1319. min_stream_id = rows[-1][0]
  1320. update_rows = []
  1321. for row in rows:
  1322. try:
  1323. event_id = row[1]
  1324. event_json = json.loads(row[2])
  1325. sender = event_json["sender"]
  1326. content = event_json["content"]
  1327. contains_url = "url" in content
  1328. if contains_url:
  1329. contains_url &= isinstance(content["url"], text_type)
  1330. except (KeyError, AttributeError):
  1331. # If the event is missing a necessary field then
  1332. # skip over it.
  1333. continue
  1334. update_rows.append((sender, contains_url, event_id))
  1335. sql = (
  1336. "UPDATE events SET sender = ?, contains_url = ? WHERE event_id = ?"
  1337. )
  1338. for index in range(0, len(update_rows), INSERT_CLUMP_SIZE):
  1339. clump = update_rows[index:index + INSERT_CLUMP_SIZE]
  1340. txn.executemany(sql, clump)
  1341. progress = {
  1342. "target_min_stream_id_inclusive": target_min_stream_id,
  1343. "max_stream_id_exclusive": min_stream_id,
  1344. "rows_inserted": rows_inserted + len(rows)
  1345. }
  1346. self._background_update_progress_txn(
  1347. txn, self.EVENT_FIELDS_SENDER_URL_UPDATE_NAME, progress
  1348. )
  1349. return len(rows)
  1350. result = yield self.runInteraction(
  1351. self.EVENT_FIELDS_SENDER_URL_UPDATE_NAME, reindex_txn
  1352. )
  1353. if not result:
  1354. yield self._end_background_update(self.EVENT_FIELDS_SENDER_URL_UPDATE_NAME)
  1355. defer.returnValue(result)
  1356. @defer.inlineCallbacks
  1357. def _background_reindex_origin_server_ts(self, progress, batch_size):
  1358. target_min_stream_id = progress["target_min_stream_id_inclusive"]
  1359. max_stream_id = progress["max_stream_id_exclusive"]
  1360. rows_inserted = progress.get("rows_inserted", 0)
  1361. INSERT_CLUMP_SIZE = 1000
  1362. def reindex_search_txn(txn):
  1363. sql = (
  1364. "SELECT stream_ordering, event_id FROM events"
  1365. " WHERE ? <= stream_ordering AND stream_ordering < ?"
  1366. " ORDER BY stream_ordering DESC"
  1367. " LIMIT ?"
  1368. )
  1369. txn.execute(sql, (target_min_stream_id, max_stream_id, batch_size))
  1370. rows = txn.fetchall()
  1371. if not rows:
  1372. return 0
  1373. min_stream_id = rows[-1][0]
  1374. event_ids = [row[1] for row in rows]
  1375. rows_to_update = []
  1376. chunks = [
  1377. event_ids[i:i + 100]
  1378. for i in range(0, len(event_ids), 100)
  1379. ]
  1380. for chunk in chunks:
  1381. ev_rows = self._simple_select_many_txn(
  1382. txn,
  1383. table="event_json",
  1384. column="event_id",
  1385. iterable=chunk,
  1386. retcols=["event_id", "json"],
  1387. keyvalues={},
  1388. )
  1389. for row in ev_rows:
  1390. event_id = row["event_id"]
  1391. event_json = json.loads(row["json"])
  1392. try:
  1393. origin_server_ts = event_json["origin_server_ts"]
  1394. except (KeyError, AttributeError):
  1395. # If the event is missing a necessary field then
  1396. # skip over it.
  1397. continue
  1398. rows_to_update.append((origin_server_ts, event_id))
  1399. sql = (
  1400. "UPDATE events SET origin_server_ts = ? WHERE event_id = ?"
  1401. )
  1402. for index in range(0, len(rows_to_update), INSERT_CLUMP_SIZE):
  1403. clump = rows_to_update[index:index + INSERT_CLUMP_SIZE]
  1404. txn.executemany(sql, clump)
  1405. progress = {
  1406. "target_min_stream_id_inclusive": target_min_stream_id,
  1407. "max_stream_id_exclusive": min_stream_id,
  1408. "rows_inserted": rows_inserted + len(rows_to_update)
  1409. }
  1410. self._background_update_progress_txn(
  1411. txn, self.EVENT_ORIGIN_SERVER_TS_NAME, progress
  1412. )
  1413. return len(rows_to_update)
  1414. result = yield self.runInteraction(
  1415. self.EVENT_ORIGIN_SERVER_TS_NAME, reindex_search_txn
  1416. )
  1417. if not result:
  1418. yield self._end_background_update(self.EVENT_ORIGIN_SERVER_TS_NAME)
  1419. defer.returnValue(result)
  1420. def get_current_backfill_token(self):
  1421. """The current minimum token that backfilled events have reached"""
  1422. return -self._backfill_id_gen.get_current_token()
  1423. def get_current_events_token(self):
  1424. """The current maximum token that events have reached"""
  1425. return self._stream_id_gen.get_current_token()
  1426. def get_all_new_forward_event_rows(self, last_id, current_id, limit):
  1427. if last_id == current_id:
  1428. return defer.succeed([])
  1429. def get_all_new_forward_event_rows(txn):
  1430. sql = (
  1431. "SELECT e.stream_ordering, e.event_id, e.room_id, e.type,"
  1432. " state_key, redacts"
  1433. " FROM events AS e"
  1434. " LEFT JOIN redactions USING (event_id)"
  1435. " LEFT JOIN state_events USING (event_id)"
  1436. " WHERE ? < stream_ordering AND stream_ordering <= ?"
  1437. " ORDER BY stream_ordering ASC"
  1438. " LIMIT ?"
  1439. )
  1440. txn.execute(sql, (last_id, current_id, limit))
  1441. new_event_updates = txn.fetchall()
  1442. if len(new_event_updates) == limit:
  1443. upper_bound = new_event_updates[-1][0]
  1444. else:
  1445. upper_bound = current_id
  1446. sql = (
  1447. "SELECT event_stream_ordering, e.event_id, e.room_id, e.type,"
  1448. " state_key, redacts"
  1449. " FROM events AS e"
  1450. " INNER JOIN ex_outlier_stream USING (event_id)"
  1451. " LEFT JOIN redactions USING (event_id)"
  1452. " LEFT JOIN state_events USING (event_id)"
  1453. " WHERE ? < event_stream_ordering"
  1454. " AND event_stream_ordering <= ?"
  1455. " ORDER BY event_stream_ordering DESC"
  1456. )
  1457. txn.execute(sql, (last_id, upper_bound))
  1458. new_event_updates.extend(txn)
  1459. return new_event_updates
  1460. return self.runInteraction(
  1461. "get_all_new_forward_event_rows", get_all_new_forward_event_rows
  1462. )
  1463. def get_all_new_backfill_event_rows(self, last_id, current_id, limit):
  1464. if last_id == current_id:
  1465. return defer.succeed([])
  1466. def get_all_new_backfill_event_rows(txn):
  1467. sql = (
  1468. "SELECT -e.stream_ordering, e.event_id, e.room_id, e.type,"
  1469. " state_key, redacts"
  1470. " FROM events AS e"
  1471. " LEFT JOIN redactions USING (event_id)"
  1472. " LEFT JOIN state_events USING (event_id)"
  1473. " WHERE ? > stream_ordering AND stream_ordering >= ?"
  1474. " ORDER BY stream_ordering ASC"
  1475. " LIMIT ?"
  1476. )
  1477. txn.execute(sql, (-last_id, -current_id, limit))
  1478. new_event_updates = txn.fetchall()
  1479. if len(new_event_updates) == limit:
  1480. upper_bound = new_event_updates[-1][0]
  1481. else:
  1482. upper_bound = current_id
  1483. sql = (
  1484. "SELECT -event_stream_ordering, e.event_id, e.room_id, e.type,"
  1485. " state_key, redacts"
  1486. " FROM events AS e"
  1487. " INNER JOIN ex_outlier_stream USING (event_id)"
  1488. " LEFT JOIN redactions USING (event_id)"
  1489. " LEFT JOIN state_events USING (event_id)"
  1490. " WHERE ? > event_stream_ordering"
  1491. " AND event_stream_ordering >= ?"
  1492. " ORDER BY event_stream_ordering DESC"
  1493. )
  1494. txn.execute(sql, (-last_id, -upper_bound))
  1495. new_event_updates.extend(txn.fetchall())
  1496. return new_event_updates
  1497. return self.runInteraction(
  1498. "get_all_new_backfill_event_rows", get_all_new_backfill_event_rows
  1499. )
  1500. @cached(num_args=5, max_entries=10)
  1501. def get_all_new_events(self, last_backfill_id, last_forward_id,
  1502. current_backfill_id, current_forward_id, limit):
  1503. """Get all the new events that have arrived at the server either as
  1504. new events or as backfilled events"""
  1505. have_backfill_events = last_backfill_id != current_backfill_id
  1506. have_forward_events = last_forward_id != current_forward_id
  1507. if not have_backfill_events and not have_forward_events:
  1508. return defer.succeed(AllNewEventsResult([], [], [], [], []))
  1509. def get_all_new_events_txn(txn):
  1510. sql = (
  1511. "SELECT e.stream_ordering, e.event_id, e.room_id, e.type,"
  1512. " state_key, redacts"
  1513. " FROM events AS e"
  1514. " LEFT JOIN redactions USING (event_id)"
  1515. " LEFT JOIN state_events USING (event_id)"
  1516. " WHERE ? < stream_ordering AND stream_ordering <= ?"
  1517. " ORDER BY stream_ordering ASC"
  1518. " LIMIT ?"
  1519. )
  1520. if have_forward_events:
  1521. txn.execute(sql, (last_forward_id, current_forward_id, limit))
  1522. new_forward_events = txn.fetchall()
  1523. if len(new_forward_events) == limit:
  1524. upper_bound = new_forward_events[-1][0]
  1525. else:
  1526. upper_bound = current_forward_id
  1527. sql = (
  1528. "SELECT event_stream_ordering, event_id, state_group"
  1529. " FROM ex_outlier_stream"
  1530. " WHERE ? > event_stream_ordering"
  1531. " AND event_stream_ordering >= ?"
  1532. " ORDER BY event_stream_ordering DESC"
  1533. )
  1534. txn.execute(sql, (last_forward_id, upper_bound))
  1535. forward_ex_outliers = txn.fetchall()
  1536. else:
  1537. new_forward_events = []
  1538. forward_ex_outliers = []
  1539. sql = (
  1540. "SELECT -e.stream_ordering, e.event_id, e.room_id, e.type,"
  1541. " state_key, redacts"
  1542. " FROM events AS e"
  1543. " LEFT JOIN redactions USING (event_id)"
  1544. " LEFT JOIN state_events USING (event_id)"
  1545. " WHERE ? > stream_ordering AND stream_ordering >= ?"
  1546. " ORDER BY stream_ordering DESC"
  1547. " LIMIT ?"
  1548. )
  1549. if have_backfill_events:
  1550. txn.execute(sql, (-last_backfill_id, -current_backfill_id, limit))
  1551. new_backfill_events = txn.fetchall()
  1552. if len(new_backfill_events) == limit:
  1553. upper_bound = new_backfill_events[-1][0]
  1554. else:
  1555. upper_bound = current_backfill_id
  1556. sql = (
  1557. "SELECT -event_stream_ordering, event_id, state_group"
  1558. " FROM ex_outlier_stream"
  1559. " WHERE ? > event_stream_ordering"
  1560. " AND event_stream_ordering >= ?"
  1561. " ORDER BY event_stream_ordering DESC"
  1562. )
  1563. txn.execute(sql, (-last_backfill_id, -upper_bound))
  1564. backward_ex_outliers = txn.fetchall()
  1565. else:
  1566. new_backfill_events = []
  1567. backward_ex_outliers = []
  1568. return AllNewEventsResult(
  1569. new_forward_events, new_backfill_events,
  1570. forward_ex_outliers, backward_ex_outliers,
  1571. )
  1572. return self.runInteraction("get_all_new_events", get_all_new_events_txn)
  1573. def purge_history(
  1574. self, room_id, token, delete_local_events,
  1575. ):
  1576. """Deletes room history before a certain point
  1577. Args:
  1578. room_id (str):
  1579. token (str): A topological token to delete events before
  1580. delete_local_events (bool):
  1581. if True, we will delete local events as well as remote ones
  1582. (instead of just marking them as outliers and deleting their
  1583. state groups).
  1584. """
  1585. return self.runInteraction(
  1586. "purge_history",
  1587. self._purge_history_txn, room_id, token,
  1588. delete_local_events,
  1589. )
  1590. def _purge_history_txn(
  1591. self, txn, room_id, token_str, delete_local_events,
  1592. ):
  1593. token = RoomStreamToken.parse(token_str)
  1594. # Tables that should be pruned:
  1595. # event_auth
  1596. # event_backward_extremities
  1597. # event_content_hashes
  1598. # event_destinations
  1599. # event_edge_hashes
  1600. # event_edges
  1601. # event_forward_extremities
  1602. # event_json
  1603. # event_push_actions
  1604. # event_reference_hashes
  1605. # event_search
  1606. # event_signatures
  1607. # event_to_state_groups
  1608. # events
  1609. # rejections
  1610. # room_depth
  1611. # state_groups
  1612. # state_groups_state
  1613. # we will build a temporary table listing the events so that we don't
  1614. # have to keep shovelling the list back and forth across the
  1615. # connection. Annoyingly the python sqlite driver commits the
  1616. # transaction on CREATE, so let's do this first.
  1617. #
  1618. # furthermore, we might already have the table from a previous (failed)
  1619. # purge attempt, so let's drop the table first.
  1620. txn.execute("DROP TABLE IF EXISTS events_to_purge")
  1621. txn.execute(
  1622. "CREATE TEMPORARY TABLE events_to_purge ("
  1623. " event_id TEXT NOT NULL,"
  1624. " should_delete BOOLEAN NOT NULL"
  1625. ")"
  1626. )
  1627. # First ensure that we're not about to delete all the forward extremeties
  1628. txn.execute(
  1629. "SELECT e.event_id, e.depth FROM events as e "
  1630. "INNER JOIN event_forward_extremities as f "
  1631. "ON e.event_id = f.event_id "
  1632. "AND e.room_id = f.room_id "
  1633. "WHERE f.room_id = ?",
  1634. (room_id,)
  1635. )
  1636. rows = txn.fetchall()
  1637. max_depth = max(row[1] for row in rows)
  1638. if max_depth < token.topological:
  1639. # We need to ensure we don't delete all the events from the database
  1640. # otherwise we wouldn't be able to send any events (due to not
  1641. # having any backwards extremeties)
  1642. raise SynapseError(
  1643. 400, "topological_ordering is greater than forward extremeties"
  1644. )
  1645. logger.info("[purge] looking for events to delete")
  1646. should_delete_expr = "state_key IS NULL"
  1647. should_delete_params = ()
  1648. if not delete_local_events:
  1649. should_delete_expr += " AND event_id NOT LIKE ?"
  1650. # We include the parameter twice since we use the expression twice
  1651. should_delete_params += (
  1652. "%:" + self.hs.hostname,
  1653. "%:" + self.hs.hostname,
  1654. )
  1655. should_delete_params += (room_id, token.topological)
  1656. # Note that we insert events that are outliers and aren't going to be
  1657. # deleted, as nothing will happen to them.
  1658. txn.execute(
  1659. "INSERT INTO events_to_purge"
  1660. " SELECT event_id, %s"
  1661. " FROM events AS e LEFT JOIN state_events USING (event_id)"
  1662. " WHERE (NOT outlier OR (%s)) AND e.room_id = ? AND topological_ordering < ?"
  1663. % (
  1664. should_delete_expr,
  1665. should_delete_expr,
  1666. ),
  1667. should_delete_params,
  1668. )
  1669. # We create the indices *after* insertion as that's a lot faster.
  1670. # create an index on should_delete because later we'll be looking for
  1671. # the should_delete / shouldn't_delete subsets
  1672. txn.execute(
  1673. "CREATE INDEX events_to_purge_should_delete"
  1674. " ON events_to_purge(should_delete)",
  1675. )
  1676. # We do joins against events_to_purge for e.g. calculating state
  1677. # groups to purge, etc., so lets make an index.
  1678. txn.execute(
  1679. "CREATE INDEX events_to_purge_id"
  1680. " ON events_to_purge(event_id)",
  1681. )
  1682. txn.execute(
  1683. "SELECT event_id, should_delete FROM events_to_purge"
  1684. )
  1685. event_rows = txn.fetchall()
  1686. logger.info(
  1687. "[purge] found %i events before cutoff, of which %i can be deleted",
  1688. len(event_rows), sum(1 for e in event_rows if e[1]),
  1689. )
  1690. logger.info("[purge] Finding new backward extremities")
  1691. # We calculate the new entries for the backward extremeties by finding
  1692. # events to be purged that are pointed to by events we're not going to
  1693. # purge.
  1694. txn.execute(
  1695. "SELECT DISTINCT e.event_id FROM events_to_purge AS e"
  1696. " INNER JOIN event_edges AS ed ON e.event_id = ed.prev_event_id"
  1697. " LEFT JOIN events_to_purge AS ep2 ON ed.event_id = ep2.event_id"
  1698. " WHERE ep2.event_id IS NULL",
  1699. )
  1700. new_backwards_extrems = txn.fetchall()
  1701. logger.info("[purge] replacing backward extremities: %r", new_backwards_extrems)
  1702. txn.execute(
  1703. "DELETE FROM event_backward_extremities WHERE room_id = ?",
  1704. (room_id,)
  1705. )
  1706. # Update backward extremeties
  1707. txn.executemany(
  1708. "INSERT INTO event_backward_extremities (room_id, event_id)"
  1709. " VALUES (?, ?)",
  1710. [
  1711. (room_id, event_id) for event_id, in new_backwards_extrems
  1712. ]
  1713. )
  1714. logger.info("[purge] finding redundant state groups")
  1715. # Get all state groups that are referenced by events that are to be
  1716. # deleted. We then go and check if they are referenced by other events
  1717. # or state groups, and if not we delete them.
  1718. txn.execute("""
  1719. SELECT DISTINCT state_group FROM events_to_purge
  1720. INNER JOIN event_to_state_groups USING (event_id)
  1721. """)
  1722. referenced_state_groups = set(sg for sg, in txn)
  1723. logger.info(
  1724. "[purge] found %i referenced state groups",
  1725. len(referenced_state_groups),
  1726. )
  1727. logger.info("[purge] finding state groups that can be deleted")
  1728. state_groups_to_delete, remaining_state_groups = (
  1729. self._find_unreferenced_groups_during_purge(
  1730. txn, referenced_state_groups,
  1731. )
  1732. )
  1733. logger.info(
  1734. "[purge] found %i state groups to delete",
  1735. len(state_groups_to_delete),
  1736. )
  1737. logger.info(
  1738. "[purge] de-delta-ing %i remaining state groups",
  1739. len(remaining_state_groups),
  1740. )
  1741. # Now we turn the state groups that reference to-be-deleted state
  1742. # groups to non delta versions.
  1743. for sg in remaining_state_groups:
  1744. logger.info("[purge] de-delta-ing remaining state group %s", sg)
  1745. curr_state = self._get_state_groups_from_groups_txn(
  1746. txn, [sg],
  1747. )
  1748. curr_state = curr_state[sg]
  1749. self._simple_delete_txn(
  1750. txn,
  1751. table="state_groups_state",
  1752. keyvalues={
  1753. "state_group": sg,
  1754. }
  1755. )
  1756. self._simple_delete_txn(
  1757. txn,
  1758. table="state_group_edges",
  1759. keyvalues={
  1760. "state_group": sg,
  1761. }
  1762. )
  1763. self._simple_insert_many_txn(
  1764. txn,
  1765. table="state_groups_state",
  1766. values=[
  1767. {
  1768. "state_group": sg,
  1769. "room_id": room_id,
  1770. "type": key[0],
  1771. "state_key": key[1],
  1772. "event_id": state_id,
  1773. }
  1774. for key, state_id in iteritems(curr_state)
  1775. ],
  1776. )
  1777. logger.info("[purge] removing redundant state groups")
  1778. txn.executemany(
  1779. "DELETE FROM state_groups_state WHERE state_group = ?",
  1780. ((sg,) for sg in state_groups_to_delete),
  1781. )
  1782. txn.executemany(
  1783. "DELETE FROM state_groups WHERE id = ?",
  1784. ((sg,) for sg in state_groups_to_delete),
  1785. )
  1786. logger.info("[purge] removing events from event_to_state_groups")
  1787. txn.execute(
  1788. "DELETE FROM event_to_state_groups "
  1789. "WHERE event_id IN (SELECT event_id from events_to_purge)"
  1790. )
  1791. for event_id, _ in event_rows:
  1792. txn.call_after(self._get_state_group_for_event.invalidate, (
  1793. event_id,
  1794. ))
  1795. # Delete all remote non-state events
  1796. for table in (
  1797. "events",
  1798. "event_json",
  1799. "event_auth",
  1800. "event_content_hashes",
  1801. "event_destinations",
  1802. "event_edge_hashes",
  1803. "event_edges",
  1804. "event_forward_extremities",
  1805. "event_reference_hashes",
  1806. "event_search",
  1807. "event_signatures",
  1808. "rejections",
  1809. ):
  1810. logger.info("[purge] removing events from %s", table)
  1811. txn.execute(
  1812. "DELETE FROM %s WHERE event_id IN ("
  1813. " SELECT event_id FROM events_to_purge WHERE should_delete"
  1814. ")" % (table,),
  1815. )
  1816. # event_push_actions lacks an index on event_id, and has one on
  1817. # (room_id, event_id) instead.
  1818. for table in (
  1819. "event_push_actions",
  1820. ):
  1821. logger.info("[purge] removing events from %s", table)
  1822. txn.execute(
  1823. "DELETE FROM %s WHERE room_id = ? AND event_id IN ("
  1824. " SELECT event_id FROM events_to_purge WHERE should_delete"
  1825. ")" % (table,),
  1826. (room_id, )
  1827. )
  1828. # Mark all state and own events as outliers
  1829. logger.info("[purge] marking remaining events as outliers")
  1830. txn.execute(
  1831. "UPDATE events SET outlier = ?"
  1832. " WHERE event_id IN ("
  1833. " SELECT event_id FROM events_to_purge "
  1834. " WHERE NOT should_delete"
  1835. ")",
  1836. (True,),
  1837. )
  1838. # synapse tries to take out an exclusive lock on room_depth whenever it
  1839. # persists events (because upsert), and once we run this update, we
  1840. # will block that for the rest of our transaction.
  1841. #
  1842. # So, let's stick it at the end so that we don't block event
  1843. # persistence.
  1844. #
  1845. # We do this by calculating the minimum depth of the backwards
  1846. # extremities. However, the events in event_backward_extremities
  1847. # are ones we don't have yet so we need to look at the events that
  1848. # point to it via event_edges table.
  1849. txn.execute("""
  1850. SELECT COALESCE(MIN(depth), 0)
  1851. FROM event_backward_extremities AS eb
  1852. INNER JOIN event_edges AS eg ON eg.prev_event_id = eb.event_id
  1853. INNER JOIN events AS e ON e.event_id = eg.event_id
  1854. WHERE eb.room_id = ?
  1855. """, (room_id,))
  1856. min_depth, = txn.fetchone()
  1857. logger.info("[purge] updating room_depth to %d", min_depth)
  1858. txn.execute(
  1859. "UPDATE room_depth SET min_depth = ? WHERE room_id = ?",
  1860. (min_depth, room_id,)
  1861. )
  1862. # finally, drop the temp table. this will commit the txn in sqlite,
  1863. # so make sure to keep this actually last.
  1864. txn.execute(
  1865. "DROP TABLE events_to_purge"
  1866. )
  1867. logger.info("[purge] done")
  1868. def _find_unreferenced_groups_during_purge(self, txn, state_groups):
  1869. """Used when purging history to figure out which state groups can be
  1870. deleted and which need to be de-delta'ed (due to one of its prev groups
  1871. being scheduled for deletion).
  1872. Args:
  1873. txn
  1874. state_groups (set[int]): Set of state groups referenced by events
  1875. that are going to be deleted.
  1876. Returns:
  1877. tuple[set[int], set[int]]: The set of state groups that can be
  1878. deleted and the set of state groups that need to be de-delta'ed
  1879. """
  1880. # Graph of state group -> previous group
  1881. graph = {}
  1882. # Set of events that we have found to be referenced by events
  1883. referenced_groups = set()
  1884. # Set of state groups we've already seen
  1885. state_groups_seen = set(state_groups)
  1886. # Set of state groups to handle next.
  1887. next_to_search = set(state_groups)
  1888. while next_to_search:
  1889. # We bound size of groups we're looking up at once, to stop the
  1890. # SQL query getting too big
  1891. if len(next_to_search) < 100:
  1892. current_search = next_to_search
  1893. next_to_search = set()
  1894. else:
  1895. current_search = set(itertools.islice(next_to_search, 100))
  1896. next_to_search -= current_search
  1897. # Check if state groups are referenced
  1898. sql = """
  1899. SELECT DISTINCT state_group FROM event_to_state_groups
  1900. LEFT JOIN events_to_purge AS ep USING (event_id)
  1901. WHERE state_group IN (%s) AND ep.event_id IS NULL
  1902. """ % (",".join("?" for _ in current_search),)
  1903. txn.execute(sql, list(current_search))
  1904. referenced = set(sg for sg, in txn)
  1905. referenced_groups |= referenced
  1906. # We don't continue iterating up the state group graphs for state
  1907. # groups that are referenced.
  1908. current_search -= referenced
  1909. rows = self._simple_select_many_txn(
  1910. txn,
  1911. table="state_group_edges",
  1912. column="prev_state_group",
  1913. iterable=current_search,
  1914. keyvalues={},
  1915. retcols=("prev_state_group", "state_group",),
  1916. )
  1917. prevs = set(row["state_group"] for row in rows)
  1918. # We don't bother re-handling groups we've already seen
  1919. prevs -= state_groups_seen
  1920. next_to_search |= prevs
  1921. state_groups_seen |= prevs
  1922. for row in rows:
  1923. # Note: Each state group can have at most one prev group
  1924. graph[row["state_group"]] = row["prev_state_group"]
  1925. to_delete = state_groups_seen - referenced_groups
  1926. to_dedelta = set()
  1927. for sg in referenced_groups:
  1928. prev_sg = graph.get(sg)
  1929. if prev_sg and prev_sg in to_delete:
  1930. to_dedelta.add(sg)
  1931. return to_delete, to_dedelta
  1932. @defer.inlineCallbacks
  1933. def is_event_after(self, event_id1, event_id2):
  1934. """Returns True if event_id1 is after event_id2 in the stream
  1935. """
  1936. to_1, so_1 = yield self._get_event_ordering(event_id1)
  1937. to_2, so_2 = yield self._get_event_ordering(event_id2)
  1938. defer.returnValue((to_1, so_1) > (to_2, so_2))
  1939. @cachedInlineCallbacks(max_entries=5000)
  1940. def _get_event_ordering(self, event_id):
  1941. res = yield self._simple_select_one(
  1942. table="events",
  1943. retcols=["topological_ordering", "stream_ordering"],
  1944. keyvalues={"event_id": event_id},
  1945. allow_none=True
  1946. )
  1947. if not res:
  1948. raise SynapseError(404, "Could not find event %s" % (event_id,))
  1949. defer.returnValue((int(res["topological_ordering"]), int(res["stream_ordering"])))
  1950. def get_max_current_state_delta_stream_id(self):
  1951. return self._stream_id_gen.get_current_token()
  1952. def get_all_updated_current_state_deltas(self, from_token, to_token, limit):
  1953. def get_all_updated_current_state_deltas_txn(txn):
  1954. sql = """
  1955. SELECT stream_id, room_id, type, state_key, event_id
  1956. FROM current_state_delta_stream
  1957. WHERE ? < stream_id AND stream_id <= ?
  1958. ORDER BY stream_id ASC LIMIT ?
  1959. """
  1960. txn.execute(sql, (from_token, to_token, limit))
  1961. return txn.fetchall()
  1962. return self.runInteraction(
  1963. "get_all_updated_current_state_deltas",
  1964. get_all_updated_current_state_deltas_txn,
  1965. )
  1966. AllNewEventsResult = namedtuple("AllNewEventsResult", [
  1967. "new_forward_events", "new_backfill_events",
  1968. "forward_ex_outliers", "backward_ex_outliers",
  1969. ])