event_federation.py 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492
  1. # -*- coding: utf-8 -*-
  2. # Copyright 2014-2016 OpenMarket Ltd
  3. #
  4. # Licensed under the Apache License, Version 2.0 (the "License");
  5. # you may not use this file except in compliance with the License.
  6. # You may obtain a copy of the License at
  7. #
  8. # http://www.apache.org/licenses/LICENSE-2.0
  9. #
  10. # Unless required by applicable law or agreed to in writing, software
  11. # distributed under the License is distributed on an "AS IS" BASIS,
  12. # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. # See the License for the specific language governing permissions and
  14. # limitations under the License.
  15. from twisted.internet import defer
  16. from ._base import SQLBaseStore
  17. from synapse.api.errors import StoreError
  18. from synapse.util.caches.descriptors import cached
  19. from unpaddedbase64 import encode_base64
  20. import logging
  21. from Queue import PriorityQueue, Empty
  22. logger = logging.getLogger(__name__)
  23. class EventFederationStore(SQLBaseStore):
  24. """ Responsible for storing and serving up the various graphs associated
  25. with an event. Including the main event graph and the auth chains for an
  26. event.
  27. Also has methods for getting the front (latest) and back (oldest) edges
  28. of the event graphs. These are used to generate the parents for new events
  29. and backfilling from another server respectively.
  30. """
  31. def __init__(self, hs):
  32. super(EventFederationStore, self).__init__(hs)
  33. hs.get_clock().looping_call(
  34. self._delete_old_forward_extrem_cache, 60 * 60 * 1000
  35. )
  36. def get_auth_chain(self, event_ids):
  37. return self.get_auth_chain_ids(event_ids).addCallback(self._get_events)
  38. def get_auth_chain_ids(self, event_ids):
  39. return self.runInteraction(
  40. "get_auth_chain_ids",
  41. self._get_auth_chain_ids_txn,
  42. event_ids
  43. )
  44. def _get_auth_chain_ids_txn(self, txn, event_ids):
  45. results = set()
  46. base_sql = (
  47. "SELECT auth_id FROM event_auth WHERE event_id IN (%s)"
  48. )
  49. front = set(event_ids)
  50. while front:
  51. new_front = set()
  52. front_list = list(front)
  53. chunks = [
  54. front_list[x:x + 100]
  55. for x in xrange(0, len(front), 100)
  56. ]
  57. for chunk in chunks:
  58. txn.execute(
  59. base_sql % (",".join(["?"] * len(chunk)),),
  60. chunk
  61. )
  62. new_front.update([r[0] for r in txn.fetchall()])
  63. new_front -= results
  64. front = new_front
  65. results.update(front)
  66. return list(results)
  67. def get_oldest_events_in_room(self, room_id):
  68. return self.runInteraction(
  69. "get_oldest_events_in_room",
  70. self._get_oldest_events_in_room_txn,
  71. room_id,
  72. )
  73. def get_oldest_events_with_depth_in_room(self, room_id):
  74. return self.runInteraction(
  75. "get_oldest_events_with_depth_in_room",
  76. self.get_oldest_events_with_depth_in_room_txn,
  77. room_id,
  78. )
  79. def get_oldest_events_with_depth_in_room_txn(self, txn, room_id):
  80. sql = (
  81. "SELECT b.event_id, MAX(e.depth) FROM events as e"
  82. " INNER JOIN event_edges as g"
  83. " ON g.event_id = e.event_id AND g.room_id = e.room_id"
  84. " INNER JOIN event_backward_extremities as b"
  85. " ON g.prev_event_id = b.event_id AND g.room_id = b.room_id"
  86. " WHERE b.room_id = ? AND g.is_state is ?"
  87. " GROUP BY b.event_id"
  88. )
  89. txn.execute(sql, (room_id, False,))
  90. return dict(txn.fetchall())
  91. def _get_oldest_events_in_room_txn(self, txn, room_id):
  92. return self._simple_select_onecol_txn(
  93. txn,
  94. table="event_backward_extremities",
  95. keyvalues={
  96. "room_id": room_id,
  97. },
  98. retcol="event_id",
  99. )
  100. def get_latest_event_ids_and_hashes_in_room(self, room_id):
  101. return self.runInteraction(
  102. "get_latest_event_ids_and_hashes_in_room",
  103. self._get_latest_event_ids_and_hashes_in_room,
  104. room_id,
  105. )
  106. @cached(max_entries=5000, iterable=True)
  107. def get_latest_event_ids_in_room(self, room_id):
  108. return self._simple_select_onecol(
  109. table="event_forward_extremities",
  110. keyvalues={
  111. "room_id": room_id,
  112. },
  113. retcol="event_id",
  114. desc="get_latest_event_ids_in_room",
  115. )
  116. def _get_latest_event_ids_and_hashes_in_room(self, txn, room_id):
  117. sql = (
  118. "SELECT e.event_id, e.depth FROM events as e "
  119. "INNER JOIN event_forward_extremities as f "
  120. "ON e.event_id = f.event_id "
  121. "AND e.room_id = f.room_id "
  122. "WHERE f.room_id = ?"
  123. )
  124. txn.execute(sql, (room_id, ))
  125. results = []
  126. for event_id, depth in txn.fetchall():
  127. hashes = self._get_event_reference_hashes_txn(txn, event_id)
  128. prev_hashes = {
  129. k: encode_base64(v) for k, v in hashes.items()
  130. if k == "sha256"
  131. }
  132. results.append((event_id, prev_hashes, depth))
  133. return results
  134. def get_min_depth(self, room_id):
  135. """ For hte given room, get the minimum depth we have seen for it.
  136. """
  137. return self.runInteraction(
  138. "get_min_depth",
  139. self._get_min_depth_interaction,
  140. room_id,
  141. )
  142. @defer.inlineCallbacks
  143. def get_max_depth_of_events(self, event_ids):
  144. sql = (
  145. "SELECT MAX(depth) FROM events WHERE event_id IN (%s)"
  146. ) % (",".join(["?"] * len(event_ids)),)
  147. rows = yield self._execute(
  148. "get_max_depth_of_events", None,
  149. sql, *event_ids
  150. )
  151. if rows:
  152. defer.returnValue(rows[0][0])
  153. else:
  154. defer.returnValue(1)
  155. def _get_min_depth_interaction(self, txn, room_id):
  156. min_depth = self._simple_select_one_onecol_txn(
  157. txn,
  158. table="room_depth",
  159. keyvalues={"room_id": room_id},
  160. retcol="min_depth",
  161. allow_none=True,
  162. )
  163. return int(min_depth) if min_depth is not None else None
  164. def _update_min_depth_for_room_txn(self, txn, room_id, depth):
  165. min_depth = self._get_min_depth_interaction(txn, room_id)
  166. do_insert = depth < min_depth if min_depth else True
  167. if do_insert:
  168. self._simple_upsert_txn(
  169. txn,
  170. table="room_depth",
  171. keyvalues={
  172. "room_id": room_id,
  173. },
  174. values={
  175. "min_depth": depth,
  176. },
  177. )
  178. def _handle_mult_prev_events(self, txn, events):
  179. """
  180. For the given event, update the event edges table and forward and
  181. backward extremities tables.
  182. """
  183. self._simple_insert_many_txn(
  184. txn,
  185. table="event_edges",
  186. values=[
  187. {
  188. "event_id": ev.event_id,
  189. "prev_event_id": e_id,
  190. "room_id": ev.room_id,
  191. "is_state": False,
  192. }
  193. for ev in events
  194. for e_id, _ in ev.prev_events
  195. ],
  196. )
  197. self._update_backward_extremeties(txn, events)
  198. def _update_backward_extremeties(self, txn, events):
  199. """Updates the event_backward_extremities tables based on the new/updated
  200. events being persisted.
  201. This is called for new events *and* for events that were outliers, but
  202. are now being persisted as non-outliers.
  203. Forward extremities are handled when we first start persisting the events.
  204. """
  205. events_by_room = {}
  206. for ev in events:
  207. events_by_room.setdefault(ev.room_id, []).append(ev)
  208. query = (
  209. "INSERT INTO event_backward_extremities (event_id, room_id)"
  210. " SELECT ?, ? WHERE NOT EXISTS ("
  211. " SELECT 1 FROM event_backward_extremities"
  212. " WHERE event_id = ? AND room_id = ?"
  213. " )"
  214. " AND NOT EXISTS ("
  215. " SELECT 1 FROM events WHERE event_id = ? AND room_id = ? "
  216. " AND outlier = ?"
  217. " )"
  218. )
  219. txn.executemany(query, [
  220. (e_id, ev.room_id, e_id, ev.room_id, e_id, ev.room_id, False)
  221. for ev in events for e_id, _ in ev.prev_events
  222. if not ev.internal_metadata.is_outlier()
  223. ])
  224. query = (
  225. "DELETE FROM event_backward_extremities"
  226. " WHERE event_id = ? AND room_id = ?"
  227. )
  228. txn.executemany(
  229. query,
  230. [
  231. (ev.event_id, ev.room_id) for ev in events
  232. if not ev.internal_metadata.is_outlier()
  233. ]
  234. )
  235. def get_forward_extremeties_for_room(self, room_id, stream_ordering):
  236. # We want to make the cache more effective, so we clamp to the last
  237. # change before the given ordering.
  238. last_change = self._events_stream_cache.get_max_pos_of_last_change(room_id)
  239. # We don't always have a full stream_to_exterm_id table, e.g. after
  240. # the upgrade that introduced it, so we make sure we never ask for a
  241. # try and pin to a stream_ordering from before a restart
  242. last_change = max(self._stream_order_on_start, last_change)
  243. if last_change > self.stream_ordering_month_ago:
  244. stream_ordering = min(last_change, stream_ordering)
  245. return self._get_forward_extremeties_for_room(room_id, stream_ordering)
  246. @cached(max_entries=5000, num_args=2)
  247. def _get_forward_extremeties_for_room(self, room_id, stream_ordering):
  248. """For a given room_id and stream_ordering, return the forward
  249. extremeties of the room at that point in "time".
  250. Throws a StoreError if we have since purged the index for
  251. stream_orderings from that point.
  252. """
  253. if stream_ordering <= self.stream_ordering_month_ago:
  254. raise StoreError(400, "stream_ordering too old")
  255. sql = ("""
  256. SELECT event_id FROM stream_ordering_to_exterm
  257. INNER JOIN (
  258. SELECT room_id, MAX(stream_ordering) AS stream_ordering
  259. FROM stream_ordering_to_exterm
  260. WHERE stream_ordering <= ? GROUP BY room_id
  261. ) AS rms USING (room_id, stream_ordering)
  262. WHERE room_id = ?
  263. """)
  264. def get_forward_extremeties_for_room_txn(txn):
  265. txn.execute(sql, (stream_ordering, room_id))
  266. rows = txn.fetchall()
  267. return [event_id for event_id, in rows]
  268. return self.runInteraction(
  269. "get_forward_extremeties_for_room",
  270. get_forward_extremeties_for_room_txn
  271. )
  272. def _delete_old_forward_extrem_cache(self):
  273. def _delete_old_forward_extrem_cache_txn(txn):
  274. # Delete entries older than a month, while making sure we don't delete
  275. # the only entries for a room.
  276. sql = ("""
  277. DELETE FROM stream_ordering_to_exterm
  278. WHERE
  279. room_id IN (
  280. SELECT room_id
  281. FROM stream_ordering_to_exterm
  282. WHERE stream_ordering > ?
  283. ) AND stream_ordering < ?
  284. """)
  285. txn.execute(
  286. sql,
  287. (self.stream_ordering_month_ago, self.stream_ordering_month_ago,)
  288. )
  289. return self.runInteraction(
  290. "_delete_old_forward_extrem_cache",
  291. _delete_old_forward_extrem_cache_txn
  292. )
  293. def get_backfill_events(self, room_id, event_list, limit):
  294. """Get a list of Events for a given topic that occurred before (and
  295. including) the events in event_list. Return a list of max size `limit`
  296. Args:
  297. txn
  298. room_id (str)
  299. event_list (list)
  300. limit (int)
  301. """
  302. return self.runInteraction(
  303. "get_backfill_events",
  304. self._get_backfill_events, room_id, event_list, limit
  305. ).addCallback(
  306. self._get_events
  307. ).addCallback(
  308. lambda l: sorted(l, key=lambda e: -e.depth)
  309. )
  310. def _get_backfill_events(self, txn, room_id, event_list, limit):
  311. logger.debug(
  312. "_get_backfill_events: %s, %s, %s",
  313. room_id, repr(event_list), limit
  314. )
  315. event_results = set()
  316. # We want to make sure that we do a breadth-first, "depth" ordered
  317. # search.
  318. query = (
  319. "SELECT depth, prev_event_id FROM event_edges"
  320. " INNER JOIN events"
  321. " ON prev_event_id = events.event_id"
  322. " AND event_edges.room_id = events.room_id"
  323. " WHERE event_edges.room_id = ? AND event_edges.event_id = ?"
  324. " AND event_edges.is_state = ?"
  325. " LIMIT ?"
  326. )
  327. queue = PriorityQueue()
  328. for event_id in event_list:
  329. depth = self._simple_select_one_onecol_txn(
  330. txn,
  331. table="events",
  332. keyvalues={
  333. "event_id": event_id,
  334. },
  335. retcol="depth",
  336. allow_none=True,
  337. )
  338. if depth:
  339. queue.put((-depth, event_id))
  340. while not queue.empty() and len(event_results) < limit:
  341. try:
  342. _, event_id = queue.get_nowait()
  343. except Empty:
  344. break
  345. if event_id in event_results:
  346. continue
  347. event_results.add(event_id)
  348. txn.execute(
  349. query,
  350. (room_id, event_id, False, limit - len(event_results))
  351. )
  352. for row in txn.fetchall():
  353. if row[1] not in event_results:
  354. queue.put((-row[0], row[1]))
  355. return event_results
  356. @defer.inlineCallbacks
  357. def get_missing_events(self, room_id, earliest_events, latest_events,
  358. limit, min_depth):
  359. ids = yield self.runInteraction(
  360. "get_missing_events",
  361. self._get_missing_events,
  362. room_id, earliest_events, latest_events, limit, min_depth
  363. )
  364. events = yield self._get_events(ids)
  365. events = sorted(
  366. [ev for ev in events if ev.depth >= min_depth],
  367. key=lambda e: e.depth,
  368. )
  369. defer.returnValue(events[:limit])
  370. def _get_missing_events(self, txn, room_id, earliest_events, latest_events,
  371. limit, min_depth):
  372. earliest_events = set(earliest_events)
  373. front = set(latest_events) - earliest_events
  374. event_results = set()
  375. query = (
  376. "SELECT prev_event_id FROM event_edges "
  377. "WHERE room_id = ? AND event_id = ? AND is_state = ? "
  378. "LIMIT ?"
  379. )
  380. while front and len(event_results) < limit:
  381. new_front = set()
  382. for event_id in front:
  383. txn.execute(
  384. query,
  385. (room_id, event_id, False, limit - len(event_results))
  386. )
  387. for e_id, in txn.fetchall():
  388. new_front.add(e_id)
  389. new_front -= earliest_events
  390. new_front -= event_results
  391. front = new_front
  392. event_results |= new_front
  393. return event_results
  394. def clean_room_for_join(self, room_id):
  395. return self.runInteraction(
  396. "clean_room_for_join",
  397. self._clean_room_for_join_txn,
  398. room_id,
  399. )
  400. def _clean_room_for_join_txn(self, txn, room_id):
  401. query = "DELETE FROM event_forward_extremities WHERE room_id = ?"
  402. txn.execute(query, (room_id,))
  403. txn.call_after(self.get_latest_event_ids_in_room.invalidate, (room_id,))