visibility.py 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421
  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. apply_retention_policies=True,
  42. ):
  43. """
  44. Check which events a user is allowed to see
  45. Args:
  46. storage
  47. user_id(str): user id to be checked
  48. events(list[synapse.events.EventBase]): sequence of events to be checked
  49. is_peeking(bool): should be True if:
  50. * the user is not currently a member of the room, and:
  51. * the user has not been a member of the room since the given
  52. events
  53. always_include_ids (set(event_id)): set of event ids to specifically
  54. include (unless sender is ignored)
  55. apply_retention_policies (bool): Whether to filter out events that's older than
  56. allowed by the room's retention policy. Useful when this function is called
  57. to e.g. check whether a user should be allowed to see the state at a given
  58. event rather than to know if it should send an event to a user's client(s).
  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 = list(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 apply_retention_policies:
  81. room_ids = set(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. if not event.is_state() and event.sender in ignore_list:
  99. return None
  100. # Don't try to apply the room's retention policy if the event is a state event, as
  101. # MSC1763 states that retention is only considered for non-state events.
  102. if apply_retention_policies and not event.is_state():
  103. retention_policy = retention_policies[event.room_id]
  104. max_lifetime = retention_policy.get("max_lifetime")
  105. if max_lifetime is not None:
  106. oldest_allowed_ts = storage.main.clock.time_msec() - max_lifetime
  107. if event.origin_server_ts < oldest_allowed_ts:
  108. return None
  109. if event.event_id in always_include_ids:
  110. return event
  111. state = event_id_to_state[event.event_id]
  112. # get the room_visibility at the time of the event.
  113. visibility_event = state.get((EventTypes.RoomHistoryVisibility, ""), None)
  114. if visibility_event:
  115. visibility = visibility_event.content.get("history_visibility", "shared")
  116. else:
  117. visibility = "shared"
  118. if visibility not in VISIBILITY_PRIORITY:
  119. visibility = "shared"
  120. # Always allow history visibility events on boundaries. This is done
  121. # by setting the effective visibility to the least restrictive
  122. # of the old vs new.
  123. if event.type == EventTypes.RoomHistoryVisibility:
  124. prev_content = event.unsigned.get("prev_content", {})
  125. prev_visibility = prev_content.get("history_visibility", None)
  126. if prev_visibility not in VISIBILITY_PRIORITY:
  127. prev_visibility = "shared"
  128. new_priority = VISIBILITY_PRIORITY.index(visibility)
  129. old_priority = VISIBILITY_PRIORITY.index(prev_visibility)
  130. if old_priority < new_priority:
  131. visibility = prev_visibility
  132. # likewise, if the event is the user's own membership event, use
  133. # the 'most joined' membership
  134. membership = None
  135. if event.type == EventTypes.Member and event.state_key == user_id:
  136. membership = event.content.get("membership", None)
  137. if membership not in MEMBERSHIP_PRIORITY:
  138. membership = "leave"
  139. prev_content = event.unsigned.get("prev_content", {})
  140. prev_membership = prev_content.get("membership", None)
  141. if prev_membership not in MEMBERSHIP_PRIORITY:
  142. prev_membership = "leave"
  143. # Always allow the user to see their own leave events, otherwise
  144. # they won't see the room disappear if they reject the invite
  145. if membership == "leave" and (
  146. prev_membership == "join" or prev_membership == "invite"
  147. ):
  148. return event
  149. new_priority = MEMBERSHIP_PRIORITY.index(membership)
  150. old_priority = MEMBERSHIP_PRIORITY.index(prev_membership)
  151. if old_priority < new_priority:
  152. membership = prev_membership
  153. # otherwise, get the user's membership at the time of the event.
  154. if membership is None:
  155. membership_event = state.get((EventTypes.Member, user_id), None)
  156. if membership_event:
  157. membership = membership_event.membership
  158. # if the user was a member of the room at the time of the event,
  159. # they can see it.
  160. if membership == Membership.JOIN:
  161. return event
  162. # otherwise, it depends on the room visibility.
  163. if visibility == "joined":
  164. # we weren't a member at the time of the event, so we can't
  165. # see this event.
  166. return None
  167. elif visibility == "invited":
  168. # user can also see the event if they were *invited* at the time
  169. # of the event.
  170. return event if membership == Membership.INVITE else None
  171. elif visibility == "shared" and is_peeking:
  172. # if the visibility is shared, users cannot see the event unless
  173. # they have *subequently* joined the room (or were members at the
  174. # time, of course)
  175. #
  176. # XXX: if the user has subsequently joined and then left again,
  177. # ideally we would share history up to the point they left. But
  178. # we don't know when they left. We just treat it as though they
  179. # never joined, and restrict access.
  180. return None
  181. # the visibility is either shared or world_readable, and the user was
  182. # not a member at the time. We allow it, provided the original sender
  183. # has not requested their data to be erased, in which case, we return
  184. # a redacted version.
  185. if erased_senders[event.sender]:
  186. return prune_event(event)
  187. return event
  188. # check each event: gives an iterable[None|EventBase]
  189. filtered_events = map(allowed, events)
  190. # remove the None entries
  191. filtered_events = filter(operator.truth, filtered_events)
  192. # we turn it into a list before returning it.
  193. return list(filtered_events)
  194. @defer.inlineCallbacks
  195. def filter_events_for_server(
  196. storage: Storage,
  197. server_name,
  198. events,
  199. redact=True,
  200. check_history_visibility_only=False,
  201. ):
  202. """Filter a list of events based on whether given server is allowed to
  203. see them.
  204. Args:
  205. storage
  206. server_name (str)
  207. events (iterable[FrozenEvent])
  208. redact (bool): Whether to return a redacted version of the event, or
  209. to filter them out entirely.
  210. check_history_visibility_only (bool): Whether to only check the
  211. history visibility, rather than things like if the sender has been
  212. erased. This is used e.g. during pagination to decide whether to
  213. backfill or not.
  214. Returns
  215. Deferred[list[FrozenEvent]]
  216. """
  217. def is_sender_erased(event, erased_senders):
  218. if erased_senders and erased_senders[event.sender]:
  219. logger.info("Sender of %s has been erased, redacting", event.event_id)
  220. return True
  221. return False
  222. def check_event_is_visible(event, state):
  223. history = state.get((EventTypes.RoomHistoryVisibility, ""), None)
  224. if history:
  225. visibility = history.content.get("history_visibility", "shared")
  226. if visibility in ["invited", "joined"]:
  227. # We now loop through all state events looking for
  228. # membership states for the requesting server to determine
  229. # if the server is either in the room or has been invited
  230. # into the room.
  231. for ev in itervalues(state):
  232. if ev.type != EventTypes.Member:
  233. continue
  234. try:
  235. domain = get_domain_from_id(ev.state_key)
  236. except Exception:
  237. continue
  238. if domain != server_name:
  239. continue
  240. memtype = ev.membership
  241. if memtype == Membership.JOIN:
  242. return True
  243. elif memtype == Membership.INVITE:
  244. if visibility == "invited":
  245. return True
  246. else:
  247. # server has no users in the room: redact
  248. return False
  249. return True
  250. # Lets check to see if all the events have a history visibility
  251. # of "shared" or "world_readable". If thats the case then we don't
  252. # need to check membership (as we know the server is in the room).
  253. event_to_state_ids = yield storage.state.get_state_ids_for_events(
  254. frozenset(e.event_id for e in events),
  255. state_filter=StateFilter.from_types(
  256. types=((EventTypes.RoomHistoryVisibility, ""),)
  257. ),
  258. )
  259. visibility_ids = set()
  260. for sids in itervalues(event_to_state_ids):
  261. hist = sids.get((EventTypes.RoomHistoryVisibility, ""))
  262. if hist:
  263. visibility_ids.add(hist)
  264. # If we failed to find any history visibility events then the default
  265. # is "shared" visiblity.
  266. if not visibility_ids:
  267. all_open = True
  268. else:
  269. event_map = yield storage.main.get_events(visibility_ids)
  270. all_open = all(
  271. e.content.get("history_visibility") in (None, "shared", "world_readable")
  272. for e in itervalues(event_map)
  273. )
  274. if not check_history_visibility_only:
  275. erased_senders = yield storage.main.are_users_erased((e.sender for e in events))
  276. else:
  277. # We don't want to check whether users are erased, which is equivalent
  278. # to no users having been erased.
  279. erased_senders = {}
  280. if all_open:
  281. # all the history_visibility state affecting these events is open, so
  282. # we don't need to filter by membership state. We *do* need to check
  283. # for user erasure, though.
  284. if erased_senders:
  285. to_return = []
  286. for e in events:
  287. if not is_sender_erased(e, erased_senders):
  288. to_return.append(e)
  289. elif redact:
  290. to_return.append(prune_event(e))
  291. return to_return
  292. # If there are no erased users then we can just return the given list
  293. # of events without having to copy it.
  294. return events
  295. # Ok, so we're dealing with events that have non-trivial visibility
  296. # rules, so we need to also get the memberships of the room.
  297. # first, for each event we're wanting to return, get the event_ids
  298. # of the history vis and membership state at those events.
  299. event_to_state_ids = yield storage.state.get_state_ids_for_events(
  300. frozenset(e.event_id for e in events),
  301. state_filter=StateFilter.from_types(
  302. types=((EventTypes.RoomHistoryVisibility, ""), (EventTypes.Member, None))
  303. ),
  304. )
  305. # We only want to pull out member events that correspond to the
  306. # server's domain.
  307. #
  308. # event_to_state_ids contains lots of duplicates, so it turns out to be
  309. # cheaper to build a complete event_id => (type, state_key) dict, and then
  310. # filter out the ones we don't want
  311. #
  312. event_id_to_state_key = {
  313. event_id: key
  314. for key_to_eid in itervalues(event_to_state_ids)
  315. for key, event_id in iteritems(key_to_eid)
  316. }
  317. def include(typ, state_key):
  318. if typ != EventTypes.Member:
  319. return True
  320. # we avoid using get_domain_from_id here for efficiency.
  321. idx = state_key.find(":")
  322. if idx == -1:
  323. return False
  324. return state_key[idx + 1 :] == server_name
  325. event_map = yield storage.main.get_events(
  326. [
  327. e_id
  328. for e_id, key in iteritems(event_id_to_state_key)
  329. if include(key[0], key[1])
  330. ]
  331. )
  332. event_to_state = {
  333. e_id: {
  334. key: event_map[inner_e_id]
  335. for key, inner_e_id in iteritems(key_to_eid)
  336. if inner_e_id in event_map
  337. }
  338. for e_id, key_to_eid in iteritems(event_to_state_ids)
  339. }
  340. to_return = []
  341. for e in events:
  342. erased = is_sender_erased(e, erased_senders)
  343. visible = check_event_is_visible(e, event_to_state[e.event_id])
  344. if visible and not erased:
  345. to_return.append(e)
  346. elif redact:
  347. to_return.append(prune_event(e))
  348. return to_return