visibility.py 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437
  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. import logging
  16. import operator
  17. from six import iteritems, itervalues
  18. from six.moves import map
  19. from twisted.internet import defer
  20. from synapse.api.constants import EventTypes, Membership
  21. from synapse.events.utils import prune_event
  22. from synapse.storage import Storage
  23. from synapse.storage.state import StateFilter
  24. from synapse.types import get_domain_from_id
  25. logger = logging.getLogger(__name__)
  26. VISIBILITY_PRIORITY = ("world_readable", "shared", "invited", "joined")
  27. MEMBERSHIP_PRIORITY = (
  28. Membership.JOIN,
  29. Membership.INVITE,
  30. Membership.KNOCK,
  31. Membership.LEAVE,
  32. Membership.BAN,
  33. )
  34. @defer.inlineCallbacks
  35. def filter_events_for_client(
  36. storage: Storage,
  37. user_id,
  38. events,
  39. is_peeking=False,
  40. always_include_ids=frozenset(),
  41. filter_send_to_client=True,
  42. ):
  43. """
  44. Check which events a user is allowed to see. If the user can see the event but its
  45. sender asked for their data to be erased, prune the content of the event.
  46. Args:
  47. storage
  48. user_id(str): user id to be checked
  49. events(list[synapse.events.EventBase]): sequence of events to be checked
  50. is_peeking(bool): should be True if:
  51. * the user is not currently a member of the room, and:
  52. * the user has not been a member of the room since the given
  53. events
  54. always_include_ids (set(event_id)): set of event ids to specifically
  55. include (unless sender is ignored)
  56. filter_send_to_client (bool): Whether we're checking an event that's going to be
  57. sent to a client. This might not always be the case since this function can
  58. also be called to check whether a user can see the state at a given point.
  59. Returns:
  60. Deferred[list[synapse.events.EventBase]]
  61. """
  62. # Filter out events that have been soft failed so that we don't relay them
  63. # to clients.
  64. events = [e for e in events if not e.internal_metadata.is_soft_failed()]
  65. types = ((EventTypes.RoomHistoryVisibility, ""), (EventTypes.Member, user_id))
  66. event_id_to_state = yield storage.state.get_state_for_events(
  67. frozenset(e.event_id for e in events),
  68. state_filter=StateFilter.from_types(types),
  69. )
  70. ignore_dict_content = yield storage.main.get_global_account_data_by_type_for_user(
  71. "m.ignored_user_list", user_id
  72. )
  73. # FIXME: This will explode if people upload something incorrect.
  74. ignore_list = frozenset(
  75. ignore_dict_content.get("ignored_users", {}).keys()
  76. if ignore_dict_content
  77. else []
  78. )
  79. erased_senders = yield storage.main.are_users_erased((e.sender for e in events))
  80. if filter_send_to_client:
  81. room_ids = {e.room_id for e in events}
  82. retention_policies = {}
  83. for room_id in room_ids:
  84. retention_policies[
  85. room_id
  86. ] = yield storage.main.get_retention_policy_for_room(room_id)
  87. def allowed(event):
  88. """
  89. Args:
  90. event (synapse.events.EventBase): event to check
  91. Returns:
  92. None|EventBase:
  93. None if the user cannot see this event at all
  94. a redacted copy of the event if they can only see a redacted
  95. version
  96. the original event if they can see it as normal.
  97. """
  98. # Only run some checks if these events aren't about to be sent to clients. This is
  99. # because, if this is not the case, we're probably only checking if the users can
  100. # see events in the room at that point in the DAG, and that shouldn't be decided
  101. # on those checks.
  102. if filter_send_to_client:
  103. if event.type == "org.matrix.dummy_event":
  104. return None
  105. if not event.is_state() and event.sender in ignore_list:
  106. return None
  107. # Until MSC2261 has landed we can't redact malicious alias events, so for
  108. # now we temporarily filter out m.room.aliases entirely to mitigate
  109. # abuse, while we spec a better solution to advertising aliases
  110. # on rooms.
  111. if event.type == EventTypes.Aliases:
  112. return None
  113. # Don't try to apply the room's retention policy if the event is a state
  114. # event, as MSC1763 states that retention is only considered for non-state
  115. # events.
  116. if not event.is_state():
  117. retention_policy = retention_policies[event.room_id]
  118. max_lifetime = retention_policy.get("max_lifetime")
  119. if max_lifetime is not None:
  120. oldest_allowed_ts = storage.main.clock.time_msec() - max_lifetime
  121. if event.origin_server_ts < oldest_allowed_ts:
  122. return None
  123. if event.event_id in always_include_ids:
  124. return event
  125. state = event_id_to_state[event.event_id]
  126. # get the room_visibility at the time of the event.
  127. visibility_event = state.get((EventTypes.RoomHistoryVisibility, ""), None)
  128. if visibility_event:
  129. visibility = visibility_event.content.get("history_visibility", "shared")
  130. else:
  131. visibility = "shared"
  132. if visibility not in VISIBILITY_PRIORITY:
  133. visibility = "shared"
  134. # Always allow history visibility events on boundaries. This is done
  135. # by setting the effective visibility to the least restrictive
  136. # of the old vs new.
  137. if event.type == EventTypes.RoomHistoryVisibility:
  138. prev_content = event.unsigned.get("prev_content", {})
  139. prev_visibility = prev_content.get("history_visibility", None)
  140. if prev_visibility not in VISIBILITY_PRIORITY:
  141. prev_visibility = "shared"
  142. new_priority = VISIBILITY_PRIORITY.index(visibility)
  143. old_priority = VISIBILITY_PRIORITY.index(prev_visibility)
  144. if old_priority < new_priority:
  145. visibility = prev_visibility
  146. # likewise, if the event is the user's own membership event, use
  147. # the 'most joined' membership
  148. membership = None
  149. if event.type == EventTypes.Member and event.state_key == user_id:
  150. membership = event.content.get("membership", None)
  151. if membership not in MEMBERSHIP_PRIORITY:
  152. membership = "leave"
  153. prev_content = event.unsigned.get("prev_content", {})
  154. prev_membership = prev_content.get("membership", None)
  155. if prev_membership not in MEMBERSHIP_PRIORITY:
  156. prev_membership = "leave"
  157. # Always allow the user to see their own leave events, otherwise
  158. # they won't see the room disappear if they reject the invite
  159. if membership == "leave" and (
  160. prev_membership == "join" or prev_membership == "invite"
  161. ):
  162. return event
  163. new_priority = MEMBERSHIP_PRIORITY.index(membership)
  164. old_priority = MEMBERSHIP_PRIORITY.index(prev_membership)
  165. if old_priority < new_priority:
  166. membership = prev_membership
  167. # otherwise, get the user's membership at the time of the event.
  168. if membership is None:
  169. membership_event = state.get((EventTypes.Member, user_id), None)
  170. if membership_event:
  171. membership = membership_event.membership
  172. # if the user was a member of the room at the time of the event,
  173. # they can see it.
  174. if membership == Membership.JOIN:
  175. return event
  176. # otherwise, it depends on the room visibility.
  177. if visibility == "joined":
  178. # we weren't a member at the time of the event, so we can't
  179. # see this event.
  180. return None
  181. elif visibility == "invited":
  182. # user can also see the event if they were *invited* at the time
  183. # of the event.
  184. return event if membership == Membership.INVITE else None
  185. elif visibility == "shared" and is_peeking:
  186. # if the visibility is shared, users cannot see the event unless
  187. # they have *subequently* joined the room (or were members at the
  188. # time, of course)
  189. #
  190. # XXX: if the user has subsequently joined and then left again,
  191. # ideally we would share history up to the point they left. But
  192. # we don't know when they left. We just treat it as though they
  193. # never joined, and restrict access.
  194. return None
  195. # the visibility is either shared or world_readable, and the user was
  196. # not a member at the time. We allow it, provided the original sender
  197. # has not requested their data to be erased, in which case, we return
  198. # a redacted version.
  199. if erased_senders[event.sender]:
  200. return prune_event(event)
  201. return event
  202. # check each event: gives an iterable[None|EventBase]
  203. filtered_events = map(allowed, events)
  204. # remove the None entries
  205. filtered_events = filter(operator.truth, filtered_events)
  206. # we turn it into a list before returning it.
  207. return list(filtered_events)
  208. @defer.inlineCallbacks
  209. def filter_events_for_server(
  210. storage: Storage,
  211. server_name,
  212. events,
  213. redact=True,
  214. check_history_visibility_only=False,
  215. ):
  216. """Filter a list of events based on whether given server is allowed to
  217. see them.
  218. Args:
  219. storage
  220. server_name (str)
  221. events (iterable[FrozenEvent])
  222. redact (bool): Whether to return a redacted version of the event, or
  223. to filter them out entirely.
  224. check_history_visibility_only (bool): Whether to only check the
  225. history visibility, rather than things like if the sender has been
  226. erased. This is used e.g. during pagination to decide whether to
  227. backfill or not.
  228. Returns
  229. Deferred[list[FrozenEvent]]
  230. """
  231. def is_sender_erased(event, erased_senders):
  232. if erased_senders and erased_senders[event.sender]:
  233. logger.info("Sender of %s has been erased, redacting", event.event_id)
  234. return True
  235. return False
  236. def check_event_is_visible(event, state):
  237. history = state.get((EventTypes.RoomHistoryVisibility, ""), None)
  238. if history:
  239. visibility = history.content.get("history_visibility", "shared")
  240. if visibility in ["invited", "joined"]:
  241. # We now loop through all state events looking for
  242. # membership states for the requesting server to determine
  243. # if the server is either in the room or has been invited
  244. # into the room.
  245. for ev in itervalues(state):
  246. if ev.type != EventTypes.Member:
  247. continue
  248. try:
  249. domain = get_domain_from_id(ev.state_key)
  250. except Exception:
  251. continue
  252. if domain != server_name:
  253. continue
  254. memtype = ev.membership
  255. if memtype == Membership.JOIN:
  256. return True
  257. elif memtype == Membership.INVITE:
  258. if visibility == "invited":
  259. return True
  260. else:
  261. # server has no users in the room: redact
  262. return False
  263. return True
  264. # Lets check to see if all the events have a history visibility
  265. # of "shared" or "world_readable". If thats the case then we don't
  266. # need to check membership (as we know the server is in the room).
  267. event_to_state_ids = yield storage.state.get_state_ids_for_events(
  268. frozenset(e.event_id for e in events),
  269. state_filter=StateFilter.from_types(
  270. types=((EventTypes.RoomHistoryVisibility, ""),)
  271. ),
  272. )
  273. visibility_ids = set()
  274. for sids in itervalues(event_to_state_ids):
  275. hist = sids.get((EventTypes.RoomHistoryVisibility, ""))
  276. if hist:
  277. visibility_ids.add(hist)
  278. # If we failed to find any history visibility events then the default
  279. # is "shared" visiblity.
  280. if not visibility_ids:
  281. all_open = True
  282. else:
  283. event_map = yield storage.main.get_events(visibility_ids)
  284. all_open = all(
  285. e.content.get("history_visibility") in (None, "shared", "world_readable")
  286. for e in itervalues(event_map)
  287. )
  288. if not check_history_visibility_only:
  289. erased_senders = yield storage.main.are_users_erased((e.sender for e in events))
  290. else:
  291. # We don't want to check whether users are erased, which is equivalent
  292. # to no users having been erased.
  293. erased_senders = {}
  294. if all_open:
  295. # all the history_visibility state affecting these events is open, so
  296. # we don't need to filter by membership state. We *do* need to check
  297. # for user erasure, though.
  298. if erased_senders:
  299. to_return = []
  300. for e in events:
  301. if not is_sender_erased(e, erased_senders):
  302. to_return.append(e)
  303. elif redact:
  304. to_return.append(prune_event(e))
  305. return to_return
  306. # If there are no erased users then we can just return the given list
  307. # of events without having to copy it.
  308. return events
  309. # Ok, so we're dealing with events that have non-trivial visibility
  310. # rules, so we need to also get the memberships of the room.
  311. # first, for each event we're wanting to return, get the event_ids
  312. # of the history vis and membership state at those events.
  313. event_to_state_ids = yield storage.state.get_state_ids_for_events(
  314. frozenset(e.event_id for e in events),
  315. state_filter=StateFilter.from_types(
  316. types=((EventTypes.RoomHistoryVisibility, ""), (EventTypes.Member, None))
  317. ),
  318. )
  319. # We only want to pull out member events that correspond to the
  320. # server's domain.
  321. #
  322. # event_to_state_ids contains lots of duplicates, so it turns out to be
  323. # cheaper to build a complete event_id => (type, state_key) dict, and then
  324. # filter out the ones we don't want
  325. #
  326. event_id_to_state_key = {
  327. event_id: key
  328. for key_to_eid in itervalues(event_to_state_ids)
  329. for key, event_id in iteritems(key_to_eid)
  330. }
  331. def include(typ, state_key):
  332. if typ != EventTypes.Member:
  333. return True
  334. # we avoid using get_domain_from_id here for efficiency.
  335. idx = state_key.find(":")
  336. if idx == -1:
  337. return False
  338. return state_key[idx + 1 :] == server_name
  339. event_map = yield storage.main.get_events(
  340. [
  341. e_id
  342. for e_id, key in iteritems(event_id_to_state_key)
  343. if include(key[0], key[1])
  344. ]
  345. )
  346. event_to_state = {
  347. e_id: {
  348. key: event_map[inner_e_id]
  349. for key, inner_e_id in iteritems(key_to_eid)
  350. if inner_e_id in event_map
  351. }
  352. for e_id, key_to_eid in iteritems(event_to_state_ids)
  353. }
  354. to_return = []
  355. for e in events:
  356. erased = is_sender_erased(e, erased_senders)
  357. visible = check_event_is_visible(e, event_to_state[e.event_id])
  358. if visible and not erased:
  359. to_return.append(e)
  360. elif redact:
  361. to_return.append(prune_event(e))
  362. return to_return