123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580 |
- # Copyright 2018 New Vector Ltd
- #
- # Licensed under the Apache License, Version 2.0 (the 'License');
- # you may not use this file except in compliance with the License.
- # You may obtain a copy of the License at
- #
- # http://www.apache.org/licenses/LICENSE-2.0
- #
- # Unless required by applicable law or agreed to in writing, software
- # distributed under the License is distributed on an 'AS IS' BASIS,
- # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- # See the License for the specific language governing permissions and
- # limitations under the License.
- import attr
- from parameterized import parameterized
- from synapse.api.room_versions import RoomVersions
- from synapse.events import _EventInternalMetadata
- from synapse.util import json_encoder
- import tests.unittest
- import tests.utils
- class EventFederationWorkerStoreTestCase(tests.unittest.HomeserverTestCase):
- def prepare(self, reactor, clock, hs):
- self.store = hs.get_datastore()
- def test_get_prev_events_for_room(self):
- room_id = "@ROOM:local"
- # add a bunch of events and hashes to act as forward extremities
- def insert_event(txn, i):
- event_id = "$event_%i:local" % i
- txn.execute(
- (
- "INSERT INTO events ("
- " room_id, event_id, type, depth, topological_ordering,"
- " content, processed, outlier, stream_ordering) "
- "VALUES (?, ?, 'm.test', ?, ?, 'test', ?, ?, ?)"
- ),
- (room_id, event_id, i, i, True, False, i),
- )
- txn.execute(
- (
- "INSERT INTO event_forward_extremities (room_id, event_id) "
- "VALUES (?, ?)"
- ),
- (room_id, event_id),
- )
- txn.execute(
- (
- "INSERT INTO event_reference_hashes "
- "(event_id, algorithm, hash) "
- "VALUES (?, 'sha256', ?)"
- ),
- (event_id, bytearray(b"ffff")),
- )
- for i in range(0, 20):
- self.get_success(
- self.store.db_pool.runInteraction("insert", insert_event, i)
- )
- # this should get the last ten
- r = self.get_success(self.store.get_prev_events_for_room(room_id))
- self.assertEqual(10, len(r))
- for i in range(0, 10):
- self.assertEqual("$event_%i:local" % (19 - i), r[i])
- def test_get_rooms_with_many_extremities(self):
- room1 = "#room1"
- room2 = "#room2"
- room3 = "#room3"
- def insert_event(txn, i, room_id):
- event_id = "$event_%i:local" % i
- txn.execute(
- (
- "INSERT INTO event_forward_extremities (room_id, event_id) "
- "VALUES (?, ?)"
- ),
- (room_id, event_id),
- )
- for i in range(0, 20):
- self.get_success(
- self.store.db_pool.runInteraction("insert", insert_event, i, room1)
- )
- self.get_success(
- self.store.db_pool.runInteraction("insert", insert_event, i, room2)
- )
- self.get_success(
- self.store.db_pool.runInteraction("insert", insert_event, i, room3)
- )
- # Test simple case
- r = self.get_success(self.store.get_rooms_with_many_extremities(5, 5, []))
- self.assertEqual(len(r), 3)
- # Does filter work?
- r = self.get_success(self.store.get_rooms_with_many_extremities(5, 5, [room1]))
- self.assertTrue(room2 in r)
- self.assertTrue(room3 in r)
- self.assertEqual(len(r), 2)
- r = self.get_success(
- self.store.get_rooms_with_many_extremities(5, 5, [room1, room2])
- )
- self.assertEqual(r, [room3])
- # Does filter and limit work?
- r = self.get_success(self.store.get_rooms_with_many_extremities(5, 1, [room1]))
- self.assertTrue(r == [room2] or r == [room3])
- def _setup_auth_chain(self, use_chain_cover_index: bool) -> str:
- room_id = "@ROOM:local"
- # The silly auth graph we use to test the auth difference algorithm,
- # where the top are the most recent events.
- #
- # A B
- # \ /
- # D E
- # \ |
- # ` F C
- # | /|
- # G ´ |
- # | \ |
- # H I
- # | |
- # K J
- auth_graph = {
- "a": ["e"],
- "b": ["e"],
- "c": ["g", "i"],
- "d": ["f"],
- "e": ["f"],
- "f": ["g"],
- "g": ["h", "i"],
- "h": ["k"],
- "i": ["j"],
- "k": [],
- "j": [],
- }
- depth_map = {
- "a": 7,
- "b": 7,
- "c": 4,
- "d": 6,
- "e": 6,
- "f": 5,
- "g": 3,
- "h": 2,
- "i": 2,
- "k": 1,
- "j": 1,
- }
- # Mark the room as maybe having a cover index.
- def store_room(txn):
- self.store.db_pool.simple_insert_txn(
- txn,
- "rooms",
- {
- "room_id": room_id,
- "creator": "room_creator_user_id",
- "is_public": True,
- "room_version": "6",
- "has_auth_chain_index": use_chain_cover_index,
- },
- )
- self.get_success(self.store.db_pool.runInteraction("store_room", store_room))
- # We rudely fiddle with the appropriate tables directly, as that's much
- # easier than constructing events properly.
- def insert_event(txn):
- stream_ordering = 0
- for event_id in auth_graph:
- stream_ordering += 1
- depth = depth_map[event_id]
- self.store.db_pool.simple_insert_txn(
- txn,
- table="events",
- values={
- "event_id": event_id,
- "room_id": room_id,
- "depth": depth,
- "topological_ordering": depth,
- "type": "m.test",
- "processed": True,
- "outlier": False,
- "stream_ordering": stream_ordering,
- },
- )
- self.hs.datastores.persist_events._persist_event_auth_chain_txn(
- txn,
- [
- FakeEvent(event_id, room_id, auth_graph[event_id])
- for event_id in auth_graph
- ],
- )
- self.get_success(
- self.store.db_pool.runInteraction(
- "insert",
- insert_event,
- )
- )
- return room_id
- @parameterized.expand([(True,), (False,)])
- def test_auth_chain_ids(self, use_chain_cover_index: bool):
- room_id = self._setup_auth_chain(use_chain_cover_index)
- # a and b have the same auth chain.
- auth_chain_ids = self.get_success(self.store.get_auth_chain_ids(room_id, ["a"]))
- self.assertCountEqual(auth_chain_ids, ["e", "f", "g", "h", "i", "j", "k"])
- auth_chain_ids = self.get_success(self.store.get_auth_chain_ids(room_id, ["b"]))
- self.assertCountEqual(auth_chain_ids, ["e", "f", "g", "h", "i", "j", "k"])
- auth_chain_ids = self.get_success(
- self.store.get_auth_chain_ids(room_id, ["a", "b"])
- )
- self.assertCountEqual(auth_chain_ids, ["e", "f", "g", "h", "i", "j", "k"])
- auth_chain_ids = self.get_success(self.store.get_auth_chain_ids(room_id, ["c"]))
- self.assertCountEqual(auth_chain_ids, ["g", "h", "i", "j", "k"])
- # d and e have the same auth chain.
- auth_chain_ids = self.get_success(self.store.get_auth_chain_ids(room_id, ["d"]))
- self.assertCountEqual(auth_chain_ids, ["f", "g", "h", "i", "j", "k"])
- auth_chain_ids = self.get_success(self.store.get_auth_chain_ids(room_id, ["e"]))
- self.assertCountEqual(auth_chain_ids, ["f", "g", "h", "i", "j", "k"])
- auth_chain_ids = self.get_success(self.store.get_auth_chain_ids(room_id, ["f"]))
- self.assertCountEqual(auth_chain_ids, ["g", "h", "i", "j", "k"])
- auth_chain_ids = self.get_success(self.store.get_auth_chain_ids(room_id, ["g"]))
- self.assertCountEqual(auth_chain_ids, ["h", "i", "j", "k"])
- auth_chain_ids = self.get_success(self.store.get_auth_chain_ids(room_id, ["h"]))
- self.assertEqual(auth_chain_ids, ["k"])
- auth_chain_ids = self.get_success(self.store.get_auth_chain_ids(room_id, ["i"]))
- self.assertEqual(auth_chain_ids, ["j"])
- # j and k have no parents.
- auth_chain_ids = self.get_success(self.store.get_auth_chain_ids(room_id, ["j"]))
- self.assertEqual(auth_chain_ids, [])
- auth_chain_ids = self.get_success(self.store.get_auth_chain_ids(room_id, ["k"]))
- self.assertEqual(auth_chain_ids, [])
- # More complex input sequences.
- auth_chain_ids = self.get_success(
- self.store.get_auth_chain_ids(room_id, ["b", "c", "d"])
- )
- self.assertCountEqual(auth_chain_ids, ["e", "f", "g", "h", "i", "j", "k"])
- auth_chain_ids = self.get_success(
- self.store.get_auth_chain_ids(room_id, ["h", "i"])
- )
- self.assertCountEqual(auth_chain_ids, ["k", "j"])
- # e gets returned even though include_given is false, but it is in the
- # auth chain of b.
- auth_chain_ids = self.get_success(
- self.store.get_auth_chain_ids(room_id, ["b", "e"])
- )
- self.assertCountEqual(auth_chain_ids, ["e", "f", "g", "h", "i", "j", "k"])
- # Test include_given.
- auth_chain_ids = self.get_success(
- self.store.get_auth_chain_ids(room_id, ["i"], include_given=True)
- )
- self.assertCountEqual(auth_chain_ids, ["i", "j"])
- @parameterized.expand([(True,), (False,)])
- def test_auth_difference(self, use_chain_cover_index: bool):
- room_id = self._setup_auth_chain(use_chain_cover_index)
- # Now actually test that various combinations give the right result:
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}, {"b"}])
- )
- self.assertSetEqual(difference, {"a", "b"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}, {"b"}, {"c"}])
- )
- self.assertSetEqual(difference, {"a", "b", "c", "e", "f"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a", "c"}, {"b"}])
- )
- self.assertSetEqual(difference, {"a", "b", "c"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a", "c"}, {"b", "c"}])
- )
- self.assertSetEqual(difference, {"a", "b"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}, {"b"}, {"d"}])
- )
- self.assertSetEqual(difference, {"a", "b", "d", "e"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}, {"b"}, {"c"}, {"d"}])
- )
- self.assertSetEqual(difference, {"a", "b", "c", "d", "e", "f"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}, {"b"}, {"e"}])
- )
- self.assertSetEqual(difference, {"a", "b"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}])
- )
- self.assertSetEqual(difference, set())
- def test_auth_difference_partial_cover(self):
- """Test that we correctly handle rooms where not all events have a chain
- cover calculated. This can happen in some obscure edge cases, including
- during the background update that calculates the chain cover for old
- rooms.
- """
- room_id = "@ROOM:local"
- # The silly auth graph we use to test the auth difference algorithm,
- # where the top are the most recent events.
- #
- # A B
- # \ /
- # D E
- # \ |
- # ` F C
- # | /|
- # G ´ |
- # | \ |
- # H I
- # | |
- # K J
- auth_graph = {
- "a": ["e"],
- "b": ["e"],
- "c": ["g", "i"],
- "d": ["f"],
- "e": ["f"],
- "f": ["g"],
- "g": ["h", "i"],
- "h": ["k"],
- "i": ["j"],
- "k": [],
- "j": [],
- }
- depth_map = {
- "a": 7,
- "b": 7,
- "c": 4,
- "d": 6,
- "e": 6,
- "f": 5,
- "g": 3,
- "h": 2,
- "i": 2,
- "k": 1,
- "j": 1,
- }
- # We rudely fiddle with the appropriate tables directly, as that's much
- # easier than constructing events properly.
- def insert_event(txn):
- # First insert the room and mark it as having a chain cover.
- self.store.db_pool.simple_insert_txn(
- txn,
- "rooms",
- {
- "room_id": room_id,
- "creator": "room_creator_user_id",
- "is_public": True,
- "room_version": "6",
- "has_auth_chain_index": True,
- },
- )
- stream_ordering = 0
- for event_id in auth_graph:
- stream_ordering += 1
- depth = depth_map[event_id]
- self.store.db_pool.simple_insert_txn(
- txn,
- table="events",
- values={
- "event_id": event_id,
- "room_id": room_id,
- "depth": depth,
- "topological_ordering": depth,
- "type": "m.test",
- "processed": True,
- "outlier": False,
- "stream_ordering": stream_ordering,
- },
- )
- # Insert all events apart from 'B'
- self.hs.datastores.persist_events._persist_event_auth_chain_txn(
- txn,
- [
- FakeEvent(event_id, room_id, auth_graph[event_id])
- for event_id in auth_graph
- if event_id != "b"
- ],
- )
- # Now we insert the event 'B' without a chain cover, by temporarily
- # pretending the room doesn't have a chain cover.
- self.store.db_pool.simple_update_txn(
- txn,
- table="rooms",
- keyvalues={"room_id": room_id},
- updatevalues={"has_auth_chain_index": False},
- )
- self.hs.datastores.persist_events._persist_event_auth_chain_txn(
- txn,
- [FakeEvent("b", room_id, auth_graph["b"])],
- )
- self.store.db_pool.simple_update_txn(
- txn,
- table="rooms",
- keyvalues={"room_id": room_id},
- updatevalues={"has_auth_chain_index": True},
- )
- self.get_success(
- self.store.db_pool.runInteraction(
- "insert",
- insert_event,
- )
- )
- # Now actually test that various combinations give the right result:
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}, {"b"}])
- )
- self.assertSetEqual(difference, {"a", "b"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}, {"b"}, {"c"}])
- )
- self.assertSetEqual(difference, {"a", "b", "c", "e", "f"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a", "c"}, {"b"}])
- )
- self.assertSetEqual(difference, {"a", "b", "c"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a", "c"}, {"b", "c"}])
- )
- self.assertSetEqual(difference, {"a", "b"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}, {"b"}, {"d"}])
- )
- self.assertSetEqual(difference, {"a", "b", "d", "e"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}, {"b"}, {"c"}, {"d"}])
- )
- self.assertSetEqual(difference, {"a", "b", "c", "d", "e", "f"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}, {"b"}, {"e"}])
- )
- self.assertSetEqual(difference, {"a", "b"})
- difference = self.get_success(
- self.store.get_auth_chain_difference(room_id, [{"a"}])
- )
- self.assertSetEqual(difference, set())
- def test_prune_inbound_federation_queue(self):
- "Test that pruning of inbound federation queues work"
- room_id = "some_room_id"
- # Insert a bunch of events that all reference the previous one.
- self.get_success(
- self.store.db_pool.simple_insert_many(
- table="federation_inbound_events_staging",
- values=[
- {
- "origin": "some_origin",
- "room_id": room_id,
- "received_ts": 0,
- "event_id": f"$fake_event_id_{i + 1}",
- "event_json": json_encoder.encode(
- {"prev_events": [f"$fake_event_id_{i}"]}
- ),
- "internal_metadata": "{}",
- }
- for i in range(500)
- ],
- desc="test_prune_inbound_federation_queue",
- )
- )
- # Calling prune once should return True, i.e. a prune happen. The second
- # time it shouldn't.
- pruned = self.get_success(
- self.store.prune_staged_events_in_room(room_id, RoomVersions.V6)
- )
- self.assertTrue(pruned)
- pruned = self.get_success(
- self.store.prune_staged_events_in_room(room_id, RoomVersions.V6)
- )
- self.assertFalse(pruned)
- # Assert that we only have a single event left in the queue, and that it
- # is the last one.
- count = self.get_success(
- self.store.db_pool.simple_select_one_onecol(
- table="federation_inbound_events_staging",
- keyvalues={"room_id": room_id},
- retcol="COUNT(*)",
- desc="test_prune_inbound_federation_queue",
- )
- )
- self.assertEqual(count, 1)
- _, event_id = self.get_success(
- self.store.get_next_staged_event_id_for_room(room_id)
- )
- self.assertEqual(event_id, "$fake_event_id_500")
- @attr.s
- class FakeEvent:
- event_id = attr.ib()
- room_id = attr.ib()
- auth_events = attr.ib()
- type = "foo"
- state_key = "foo"
- internal_metadata = _EventInternalMetadata({})
- def auth_event_ids(self):
- return self.auth_events
- def is_state(self):
- return True
|