You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

369 lines
12 KiB

  1. # Copyright 2018 New Vector Ltd
  2. #
  3. # Licensed under the Apache License, Version 2.0 (the "License");
  4. # you may not use this file except in compliance with the License.
  5. # You may obtain a copy of the License at
  6. #
  7. # http://www.apache.org/licenses/LICENSE-2.0
  8. #
  9. # Unless required by applicable law or agreed to in writing, software
  10. # distributed under the License is distributed on an "AS IS" BASIS,
  11. # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. # See the License for the specific language governing permissions and
  13. # limitations under the License.
  14. import hashlib
  15. import logging
  16. from typing import (
  17. Awaitable,
  18. Callable,
  19. Dict,
  20. Iterable,
  21. List,
  22. Optional,
  23. Sequence,
  24. Set,
  25. Tuple,
  26. )
  27. from synapse import event_auth
  28. from synapse.api.constants import EventTypes
  29. from synapse.api.errors import AuthError
  30. from synapse.api.room_versions import RoomVersion
  31. from synapse.events import EventBase
  32. from synapse.types import MutableStateMap, StateMap, StrCollection
  33. logger = logging.getLogger(__name__)
  34. POWER_KEY = (EventTypes.PowerLevels, "")
  35. async def resolve_events_with_store(
  36. room_id: str,
  37. room_version: RoomVersion,
  38. state_sets: Sequence[StateMap[str]],
  39. event_map: Optional[Dict[str, EventBase]],
  40. state_map_factory: Callable[[StrCollection], Awaitable[Dict[str, EventBase]]],
  41. ) -> StateMap[str]:
  42. """
  43. Args:
  44. room_id: the room we are working in
  45. state_sets: List of dicts of (type, state_key) -> event_id,
  46. which are the different state groups to resolve.
  47. event_map:
  48. a dict from event_id to event, for any events that we happen to
  49. have in flight (eg, those currently being persisted). This will be
  50. used as a starting point for finding the state we need; any missing
  51. events will be requested via state_map_factory.
  52. If None, all events will be fetched via state_map_factory.
  53. state_map_factory: will be called
  54. with a list of event_ids that are needed, and should return with
  55. an Awaitable that resolves to a dict of event_id to event.
  56. Returns:
  57. A map from (type, state_key) to event_id.
  58. """
  59. if len(state_sets) == 1:
  60. return state_sets[0]
  61. unconflicted_state, conflicted_state = _seperate(state_sets)
  62. needed_events = {
  63. event_id for event_ids in conflicted_state.values() for event_id in event_ids
  64. }
  65. needed_event_count = len(needed_events)
  66. if event_map is not None:
  67. needed_events -= set(event_map.keys())
  68. logger.info(
  69. "Asking for %d/%d conflicted events", len(needed_events), needed_event_count
  70. )
  71. # A map from state event id to event. Only includes the state events which
  72. # are in conflict (and those in event_map).
  73. state_map = await state_map_factory(needed_events)
  74. if event_map is not None:
  75. state_map.update(event_map)
  76. # everything in the state map should be in the right room
  77. for event in state_map.values():
  78. if event.room_id != room_id:
  79. raise Exception(
  80. "Attempting to state-resolve for room %s with event %s which is in %s"
  81. % (
  82. room_id,
  83. event.event_id,
  84. event.room_id,
  85. )
  86. )
  87. # get the ids of the auth events which allow us to authenticate the
  88. # conflicted state, picking only from the unconflicting state.
  89. auth_events = _create_auth_events_from_maps(
  90. room_version, unconflicted_state, conflicted_state, state_map
  91. )
  92. new_needed_events = set(auth_events.values())
  93. new_needed_event_count = len(new_needed_events)
  94. new_needed_events -= needed_events
  95. if event_map is not None:
  96. new_needed_events -= set(event_map.keys())
  97. logger.info(
  98. "Asking for %d/%d auth events", len(new_needed_events), new_needed_event_count
  99. )
  100. state_map_new = await state_map_factory(new_needed_events)
  101. for event in state_map_new.values():
  102. if event.room_id != room_id:
  103. raise Exception(
  104. "Attempting to state-resolve for room %s with event %s which is in %s"
  105. % (
  106. room_id,
  107. event.event_id,
  108. event.room_id,
  109. )
  110. )
  111. state_map.update(state_map_new)
  112. return _resolve_with_state(
  113. room_version, unconflicted_state, conflicted_state, auth_events, state_map
  114. )
  115. def _seperate(
  116. state_sets: Iterable[StateMap[str]],
  117. ) -> Tuple[MutableStateMap[str], MutableStateMap[Set[str]]]:
  118. """Takes the state_sets and figures out which keys are conflicted and
  119. which aren't. i.e., which have multiple different event_ids associated
  120. with them in different state sets.
  121. Args:
  122. state_sets:
  123. List of dicts of (type, state_key) -> event_id, which are the
  124. different state groups to resolve.
  125. Returns:
  126. A tuple of (unconflicted_state, conflicted_state), where:
  127. unconflicted_state is a dict mapping (type, state_key)->event_id
  128. for unconflicted state keys.
  129. conflicted_state is a dict mapping (type, state_key) to a set of
  130. event ids for conflicted state keys.
  131. """
  132. state_set_iterator = iter(state_sets)
  133. unconflicted_state = dict(next(state_set_iterator))
  134. conflicted_state: MutableStateMap[Set[str]] = {}
  135. for state_set in state_set_iterator:
  136. for key, value in state_set.items():
  137. # Check if there is an unconflicted entry for the state key.
  138. unconflicted_value = unconflicted_state.get(key)
  139. if unconflicted_value is None:
  140. # There isn't an unconflicted entry so check if there is a
  141. # conflicted entry.
  142. ls = conflicted_state.get(key)
  143. if ls is None:
  144. # There wasn't a conflicted entry so haven't seen this key before.
  145. # Therefore it isn't conflicted yet.
  146. unconflicted_state[key] = value
  147. else:
  148. # This key is already conflicted, add our value to the conflict set.
  149. ls.add(value)
  150. elif unconflicted_value != value:
  151. # If the unconflicted value is not the same as our value then we
  152. # have a new conflict. So move the key from the unconflicted_state
  153. # to the conflicted state.
  154. conflicted_state[key] = {value, unconflicted_value}
  155. unconflicted_state.pop(key, None)
  156. return unconflicted_state, conflicted_state
  157. def _create_auth_events_from_maps(
  158. room_version: RoomVersion,
  159. unconflicted_state: StateMap[str],
  160. conflicted_state: StateMap[Set[str]],
  161. state_map: Dict[str, EventBase],
  162. ) -> StateMap[str]:
  163. """
  164. Args:
  165. room_version: The room version.
  166. unconflicted_state: The unconflicted state map.
  167. conflicted_state: The conflicted state map.
  168. state_map:
  169. Returns:
  170. A map from state key to event id.
  171. """
  172. auth_events = {}
  173. for event_ids in conflicted_state.values():
  174. for event_id in event_ids:
  175. if event_id in state_map:
  176. keys = event_auth.auth_types_for_event(
  177. room_version, state_map[event_id]
  178. )
  179. for key in keys:
  180. if key not in auth_events:
  181. auth_event_id = unconflicted_state.get(key, None)
  182. if auth_event_id:
  183. auth_events[key] = auth_event_id
  184. return auth_events
  185. def _resolve_with_state(
  186. room_version: RoomVersion,
  187. unconflicted_state_ids: MutableStateMap[str],
  188. conflicted_state_ids: StateMap[Set[str]],
  189. auth_event_ids: StateMap[str],
  190. state_map: Dict[str, EventBase],
  191. ) -> MutableStateMap[str]:
  192. conflicted_state = {}
  193. for key, event_ids in conflicted_state_ids.items():
  194. events = [state_map[ev_id] for ev_id in event_ids if ev_id in state_map]
  195. if len(events) > 1:
  196. conflicted_state[key] = events
  197. elif len(events) == 1:
  198. unconflicted_state_ids[key] = events[0].event_id
  199. auth_events = {
  200. key: state_map[ev_id]
  201. for key, ev_id in auth_event_ids.items()
  202. if ev_id in state_map
  203. }
  204. try:
  205. resolved_state = _resolve_state_events(
  206. room_version, conflicted_state, auth_events
  207. )
  208. except Exception:
  209. logger.exception("Failed to resolve state")
  210. raise
  211. new_state = unconflicted_state_ids
  212. for key, event in resolved_state.items():
  213. new_state[key] = event.event_id
  214. return new_state
  215. def _resolve_state_events(
  216. room_version: RoomVersion,
  217. conflicted_state: StateMap[List[EventBase]],
  218. auth_events: MutableStateMap[EventBase],
  219. ) -> StateMap[EventBase]:
  220. """This is where we actually decide which of the conflicted state to
  221. use.
  222. We resolve conflicts in the following order:
  223. 1. power levels
  224. 2. join rules
  225. 3. memberships
  226. 4. other events.
  227. """
  228. resolved_state = {}
  229. if POWER_KEY in conflicted_state:
  230. events = conflicted_state[POWER_KEY]
  231. logger.debug("Resolving conflicted power levels %r", events)
  232. resolved_state[POWER_KEY] = _resolve_auth_events(
  233. room_version, events, auth_events
  234. )
  235. auth_events.update(resolved_state)
  236. for key, events in conflicted_state.items():
  237. if key[0] == EventTypes.JoinRules:
  238. logger.debug("Resolving conflicted join rules %r", events)
  239. resolved_state[key] = _resolve_auth_events(
  240. room_version, events, auth_events
  241. )
  242. auth_events.update(resolved_state)
  243. for key, events in conflicted_state.items():
  244. if key[0] == EventTypes.Member:
  245. logger.debug("Resolving conflicted member lists %r", events)
  246. resolved_state[key] = _resolve_auth_events(
  247. room_version, events, auth_events
  248. )
  249. auth_events.update(resolved_state)
  250. for key, events in conflicted_state.items():
  251. if key not in resolved_state:
  252. logger.debug("Resolving conflicted state %r:%r", key, events)
  253. resolved_state[key] = _resolve_normal_events(events, auth_events)
  254. return resolved_state
  255. def _resolve_auth_events(
  256. room_version: RoomVersion, events: List[EventBase], auth_events: StateMap[EventBase]
  257. ) -> EventBase:
  258. reverse = list(reversed(_ordered_events(events)))
  259. auth_keys = {
  260. key
  261. for event in events
  262. for key in event_auth.auth_types_for_event(room_version, event)
  263. }
  264. new_auth_events = {}
  265. for key in auth_keys:
  266. auth_event = auth_events.get(key, None)
  267. if auth_event:
  268. new_auth_events[key] = auth_event
  269. auth_events = new_auth_events
  270. prev_event = reverse[0]
  271. for event in reverse[1:]:
  272. auth_events[(prev_event.type, prev_event.state_key)] = prev_event
  273. try:
  274. # The signatures have already been checked at this point
  275. event_auth.check_state_dependent_auth_rules(
  276. event,
  277. auth_events.values(),
  278. )
  279. prev_event = event
  280. except AuthError:
  281. return prev_event
  282. return event
  283. def _resolve_normal_events(
  284. events: List[EventBase], auth_events: StateMap[EventBase]
  285. ) -> EventBase:
  286. for event in _ordered_events(events):
  287. try:
  288. # The signatures have already been checked at this point
  289. event_auth.check_state_dependent_auth_rules(
  290. event,
  291. auth_events.values(),
  292. )
  293. return event
  294. except AuthError:
  295. pass
  296. # Use the last event (the one with the least depth) if they all fail
  297. # the auth check.
  298. return event
  299. def _ordered_events(events: Iterable[EventBase]) -> List[EventBase]:
  300. def key_func(e: EventBase) -> Tuple[int, str]:
  301. # we have to use utf-8 rather than ascii here because it turns out we allow
  302. # people to send us events with non-ascii event IDs :/
  303. return -int(e.depth), hashlib.sha1(e.event_id.encode("utf-8")).hexdigest()
  304. return sorted(events, key=key_func)