test_object_store.py 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490
  1. # test_object_store.py -- tests for object_store.py
  2. # Copyright (C) 2008 Jelmer Vernooij <jelmer@samba.org>
  3. #
  4. # Dulwich is dual-licensed under the Apache License, Version 2.0 and the GNU
  5. # General Public License as public by the Free Software Foundation; version 2.0
  6. # or (at your option) any later version. You can redistribute it and/or
  7. # modify it under the terms of either of these two licenses.
  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. #
  15. # You should have received a copy of the licenses; if not, see
  16. # <http://www.gnu.org/licenses/> for a copy of the GNU General Public License
  17. # and <http://www.apache.org/licenses/LICENSE-2.0> for a copy of the Apache
  18. # License, Version 2.0.
  19. #
  20. """Tests for the object store interface."""
  21. from contextlib import closing
  22. from io import BytesIO
  23. import os
  24. import shutil
  25. import tempfile
  26. from dulwich.index import (
  27. commit_tree,
  28. )
  29. from dulwich.errors import (
  30. NotTreeError,
  31. )
  32. from dulwich.objects import (
  33. sha_to_hex,
  34. Blob,
  35. Tree,
  36. TreeEntry,
  37. )
  38. from dulwich.object_store import (
  39. DiskObjectStore,
  40. MemoryObjectStore,
  41. ObjectStoreGraphWalker,
  42. tree_lookup_path,
  43. )
  44. from dulwich.pack import (
  45. REF_DELTA,
  46. write_pack_objects,
  47. )
  48. from dulwich.tests import (
  49. TestCase,
  50. )
  51. from dulwich.tests.utils import (
  52. make_object,
  53. make_tag,
  54. build_pack,
  55. )
  56. testobject = make_object(Blob, data=b"yummy data")
  57. class ObjectStoreTests(object):
  58. def test_determine_wants_all(self):
  59. self.assertEqual(
  60. [b"1" * 40],
  61. self.store.determine_wants_all({b"refs/heads/foo": b"1" * 40}))
  62. def test_determine_wants_all_zero(self):
  63. self.assertEqual(
  64. [], self.store.determine_wants_all({b"refs/heads/foo": b"0" * 40}))
  65. def test_iter(self):
  66. self.assertEqual([], list(self.store))
  67. def test_get_nonexistant(self):
  68. self.assertRaises(KeyError, lambda: self.store[b"a" * 40])
  69. def test_contains_nonexistant(self):
  70. self.assertFalse((b"a" * 40) in self.store)
  71. def test_add_objects_empty(self):
  72. self.store.add_objects([])
  73. def test_add_commit(self):
  74. # TODO: Argh, no way to construct Git commit objects without
  75. # access to a serialized form.
  76. self.store.add_objects([])
  77. def test_store_resilience(self):
  78. """Test if updating an existing stored object doesn't erase the
  79. object from the store.
  80. """
  81. test_object = make_object(Blob, data=b'data')
  82. self.store.add_object(test_object)
  83. test_object_id = test_object.id
  84. test_object.data = test_object.data + b'update'
  85. stored_test_object = self.store[test_object_id]
  86. self.assertNotEqual(test_object.id, stored_test_object.id)
  87. self.assertEqual(stored_test_object.id, test_object_id)
  88. def test_add_object(self):
  89. self.store.add_object(testobject)
  90. self.assertEqual(set([testobject.id]), set(self.store))
  91. self.assertTrue(testobject.id in self.store)
  92. r = self.store[testobject.id]
  93. self.assertEqual(r, testobject)
  94. def test_add_objects(self):
  95. data = [(testobject, "mypath")]
  96. self.store.add_objects(data)
  97. self.assertEqual(set([testobject.id]), set(self.store))
  98. self.assertTrue(testobject.id in self.store)
  99. r = self.store[testobject.id]
  100. self.assertEqual(r, testobject)
  101. def test_tree_changes(self):
  102. blob_a1 = make_object(Blob, data=b'a1')
  103. blob_a2 = make_object(Blob, data=b'a2')
  104. blob_b = make_object(Blob, data=b'b')
  105. for blob in [blob_a1, blob_a2, blob_b]:
  106. self.store.add_object(blob)
  107. blobs_1 = [(b'a', blob_a1.id, 0o100644), (b'b', blob_b.id, 0o100644)]
  108. tree1_id = commit_tree(self.store, blobs_1)
  109. blobs_2 = [(b'a', blob_a2.id, 0o100644), (b'b', blob_b.id, 0o100644)]
  110. tree2_id = commit_tree(self.store, blobs_2)
  111. change_a = ((b'a', b'a'), (0o100644, 0o100644), (blob_a1.id, blob_a2.id))
  112. self.assertEqual([change_a],
  113. list(self.store.tree_changes(tree1_id, tree2_id)))
  114. self.assertEqual(
  115. [change_a, ((b'b', b'b'), (0o100644, 0o100644), (blob_b.id, blob_b.id))],
  116. list(self.store.tree_changes(tree1_id, tree2_id, want_unchanged=True)))
  117. def test_iter_tree_contents(self):
  118. blob_a = make_object(Blob, data=b'a')
  119. blob_b = make_object(Blob, data=b'b')
  120. blob_c = make_object(Blob, data=b'c')
  121. for blob in [blob_a, blob_b, blob_c]:
  122. self.store.add_object(blob)
  123. blobs = [
  124. (b'a', blob_a.id, 0o100644),
  125. (b'ad/b', blob_b.id, 0o100644),
  126. (b'ad/bd/c', blob_c.id, 0o100755),
  127. (b'ad/c', blob_c.id, 0o100644),
  128. (b'c', blob_c.id, 0o100644),
  129. ]
  130. tree_id = commit_tree(self.store, blobs)
  131. self.assertEqual([TreeEntry(p, m, h) for (p, h, m) in blobs],
  132. list(self.store.iter_tree_contents(tree_id)))
  133. def test_iter_tree_contents_include_trees(self):
  134. blob_a = make_object(Blob, data=b'a')
  135. blob_b = make_object(Blob, data=b'b')
  136. blob_c = make_object(Blob, data=b'c')
  137. for blob in [blob_a, blob_b, blob_c]:
  138. self.store.add_object(blob)
  139. blobs = [
  140. (b'a', blob_a.id, 0o100644),
  141. (b'ad/b', blob_b.id, 0o100644),
  142. (b'ad/bd/c', blob_c.id, 0o100755),
  143. ]
  144. tree_id = commit_tree(self.store, blobs)
  145. tree = self.store[tree_id]
  146. tree_ad = self.store[tree[b'ad'][1]]
  147. tree_bd = self.store[tree_ad[b'bd'][1]]
  148. expected = [
  149. TreeEntry(b'', 0o040000, tree_id),
  150. TreeEntry(b'a', 0o100644, blob_a.id),
  151. TreeEntry(b'ad', 0o040000, tree_ad.id),
  152. TreeEntry(b'ad/b', 0o100644, blob_b.id),
  153. TreeEntry(b'ad/bd', 0o040000, tree_bd.id),
  154. TreeEntry(b'ad/bd/c', 0o100755, blob_c.id),
  155. ]
  156. actual = self.store.iter_tree_contents(tree_id, include_trees=True)
  157. self.assertEqual(expected, list(actual))
  158. def make_tag(self, name, obj):
  159. tag = make_tag(obj, name=name)
  160. self.store.add_object(tag)
  161. return tag
  162. def test_peel_sha(self):
  163. self.store.add_object(testobject)
  164. tag1 = self.make_tag(b'1', testobject)
  165. tag2 = self.make_tag(b'2', testobject)
  166. tag3 = self.make_tag(b'3', testobject)
  167. for obj in [testobject, tag1, tag2, tag3]:
  168. self.assertEqual(testobject, self.store.peel_sha(obj.id))
  169. def test_get_raw(self):
  170. self.store.add_object(testobject)
  171. self.assertEqual((Blob.type_num, b'yummy data'),
  172. self.store.get_raw(testobject.id))
  173. def test_close(self):
  174. # For now, just check that close doesn't barf.
  175. self.store.add_object(testobject)
  176. self.store.close()
  177. class MemoryObjectStoreTests(ObjectStoreTests, TestCase):
  178. def setUp(self):
  179. TestCase.setUp(self)
  180. self.store = MemoryObjectStore()
  181. def test_add_pack(self):
  182. o = MemoryObjectStore()
  183. f, commit, abort = o.add_pack()
  184. try:
  185. b = make_object(Blob, data=b"more yummy data")
  186. write_pack_objects(f, [(b, None)])
  187. except:
  188. abort()
  189. raise
  190. else:
  191. commit()
  192. def test_add_pack_emtpy(self):
  193. o = MemoryObjectStore()
  194. f, commit, abort = o.add_pack()
  195. commit()
  196. def test_add_thin_pack(self):
  197. o = MemoryObjectStore()
  198. blob = make_object(Blob, data=b'yummy data')
  199. o.add_object(blob)
  200. f = BytesIO()
  201. entries = build_pack(f, [
  202. (REF_DELTA, (blob.id, b'more yummy data')),
  203. ], store=o)
  204. o.add_thin_pack(f.read, None)
  205. packed_blob_sha = sha_to_hex(entries[0][3])
  206. self.assertEqual((Blob.type_num, b'more yummy data'),
  207. o.get_raw(packed_blob_sha))
  208. def test_add_thin_pack_empty(self):
  209. o = MemoryObjectStore()
  210. f = BytesIO()
  211. entries = build_pack(f, [], store=o)
  212. self.assertEqual([], entries)
  213. o.add_thin_pack(f.read, None)
  214. class PackBasedObjectStoreTests(ObjectStoreTests):
  215. def tearDown(self):
  216. for pack in self.store.packs:
  217. pack.close()
  218. def test_empty_packs(self):
  219. self.assertEqual([], list(self.store.packs))
  220. def test_pack_loose_objects(self):
  221. b1 = make_object(Blob, data=b"yummy data")
  222. self.store.add_object(b1)
  223. b2 = make_object(Blob, data=b"more yummy data")
  224. self.store.add_object(b2)
  225. self.assertEqual([], list(self.store.packs))
  226. self.assertEqual(2, self.store.pack_loose_objects())
  227. self.assertNotEqual([], list(self.store.packs))
  228. self.assertEqual(0, self.store.pack_loose_objects())
  229. class DiskObjectStoreTests(PackBasedObjectStoreTests, TestCase):
  230. def setUp(self):
  231. TestCase.setUp(self)
  232. self.store_dir = tempfile.mkdtemp()
  233. self.addCleanup(shutil.rmtree, self.store_dir)
  234. self.store = DiskObjectStore.init(self.store_dir)
  235. def tearDown(self):
  236. TestCase.tearDown(self)
  237. PackBasedObjectStoreTests.tearDown(self)
  238. def test_alternates(self):
  239. alternate_dir = tempfile.mkdtemp()
  240. self.addCleanup(shutil.rmtree, alternate_dir)
  241. alternate_store = DiskObjectStore(alternate_dir)
  242. b2 = make_object(Blob, data=b"yummy data")
  243. alternate_store.add_object(b2)
  244. store = DiskObjectStore(self.store_dir)
  245. self.assertRaises(KeyError, store.__getitem__, b2.id)
  246. store.add_alternate_path(alternate_dir)
  247. self.assertIn(b2.id, store)
  248. self.assertEqual(b2, store[b2.id])
  249. def test_add_alternate_path(self):
  250. store = DiskObjectStore(self.store_dir)
  251. self.assertEqual([], list(store._read_alternate_paths()))
  252. store.add_alternate_path("/foo/path")
  253. self.assertEqual(["/foo/path"], list(store._read_alternate_paths()))
  254. store.add_alternate_path("/bar/path")
  255. self.assertEqual(
  256. ["/foo/path", "/bar/path"],
  257. list(store._read_alternate_paths()))
  258. def test_rel_alternative_path(self):
  259. alternate_dir = tempfile.mkdtemp()
  260. self.addCleanup(shutil.rmtree, alternate_dir)
  261. alternate_store = DiskObjectStore(alternate_dir)
  262. b2 = make_object(Blob, data=b"yummy data")
  263. alternate_store.add_object(b2)
  264. store = DiskObjectStore(self.store_dir)
  265. self.assertRaises(KeyError, store.__getitem__, b2.id)
  266. store.add_alternate_path(
  267. os.path.relpath(alternate_dir, self.store_dir))
  268. self.assertEqual(list(alternate_store), list(store.alternates[0]))
  269. self.assertIn(b2.id, store)
  270. self.assertEqual(b2, store[b2.id])
  271. def test_pack_dir(self):
  272. o = DiskObjectStore(self.store_dir)
  273. self.assertEqual(os.path.join(self.store_dir, "pack"), o.pack_dir)
  274. def test_add_pack(self):
  275. o = DiskObjectStore(self.store_dir)
  276. f, commit, abort = o.add_pack()
  277. try:
  278. b = make_object(Blob, data=b"more yummy data")
  279. write_pack_objects(f, [(b, None)])
  280. except:
  281. abort()
  282. raise
  283. else:
  284. commit()
  285. def test_add_thin_pack(self):
  286. o = DiskObjectStore(self.store_dir)
  287. try:
  288. blob = make_object(Blob, data=b'yummy data')
  289. o.add_object(blob)
  290. f = BytesIO()
  291. entries = build_pack(f, [
  292. (REF_DELTA, (blob.id, b'more yummy data')),
  293. ], store=o)
  294. with o.add_thin_pack(f.read, None) as pack:
  295. packed_blob_sha = sha_to_hex(entries[0][3])
  296. pack.check_length_and_checksum()
  297. self.assertEqual(
  298. sorted([blob.id, packed_blob_sha]), list(pack))
  299. self.assertTrue(o.contains_packed(packed_blob_sha))
  300. self.assertTrue(o.contains_packed(blob.id))
  301. self.assertEqual((Blob.type_num, b'more yummy data'),
  302. o.get_raw(packed_blob_sha))
  303. finally:
  304. o.close()
  305. def test_add_thin_pack_empty(self):
  306. with closing(DiskObjectStore(self.store_dir)) as o:
  307. f = BytesIO()
  308. entries = build_pack(f, [], store=o)
  309. self.assertEqual([], entries)
  310. o.add_thin_pack(f.read, None)
  311. class TreeLookupPathTests(TestCase):
  312. def setUp(self):
  313. TestCase.setUp(self)
  314. self.store = MemoryObjectStore()
  315. blob_a = make_object(Blob, data=b'a')
  316. blob_b = make_object(Blob, data=b'b')
  317. blob_c = make_object(Blob, data=b'c')
  318. for blob in [blob_a, blob_b, blob_c]:
  319. self.store.add_object(blob)
  320. blobs = [
  321. (b'a', blob_a.id, 0o100644),
  322. (b'ad/b', blob_b.id, 0o100644),
  323. (b'ad/bd/c', blob_c.id, 0o100755),
  324. (b'ad/c', blob_c.id, 0o100644),
  325. (b'c', blob_c.id, 0o100644),
  326. ]
  327. self.tree_id = commit_tree(self.store, blobs)
  328. def get_object(self, sha):
  329. return self.store[sha]
  330. def test_lookup_blob(self):
  331. o_id = tree_lookup_path(self.get_object, self.tree_id, b'a')[1]
  332. self.assertTrue(isinstance(self.store[o_id], Blob))
  333. def test_lookup_tree(self):
  334. o_id = tree_lookup_path(self.get_object, self.tree_id, b'ad')[1]
  335. self.assertTrue(isinstance(self.store[o_id], Tree))
  336. o_id = tree_lookup_path(self.get_object, self.tree_id, b'ad/bd')[1]
  337. self.assertTrue(isinstance(self.store[o_id], Tree))
  338. o_id = tree_lookup_path(self.get_object, self.tree_id, b'ad/bd/')[1]
  339. self.assertTrue(isinstance(self.store[o_id], Tree))
  340. def test_lookup_nonexistent(self):
  341. self.assertRaises(
  342. KeyError, tree_lookup_path, self.get_object, self.tree_id, b'j')
  343. def test_lookup_not_tree(self):
  344. self.assertRaises(
  345. NotTreeError, tree_lookup_path, self.get_object, self.tree_id,
  346. b'ad/b/j')
  347. class ObjectStoreGraphWalkerTests(TestCase):
  348. def get_walker(self, heads, parent_map):
  349. new_parent_map = dict([
  350. (k * 40, [(p * 40) for p in ps]) for (k, ps) in parent_map.items()])
  351. return ObjectStoreGraphWalker([x * 40 for x in heads],
  352. new_parent_map.__getitem__)
  353. def test_ack_invalid_value(self):
  354. gw = self.get_walker([], {})
  355. self.assertRaises(ValueError, gw.ack, "tooshort")
  356. def test_empty(self):
  357. gw = self.get_walker([], {})
  358. self.assertIs(None, next(gw))
  359. gw.ack(b"a" * 40)
  360. self.assertIs(None, next(gw))
  361. def test_descends(self):
  362. gw = self.get_walker([b"a"], {b"a": [b"b"], b"b": []})
  363. self.assertEqual(b"a" * 40, next(gw))
  364. self.assertEqual(b"b" * 40, next(gw))
  365. def test_present(self):
  366. gw = self.get_walker([b"a"], {b"a": [b"b"], b"b": []})
  367. gw.ack(b"a" * 40)
  368. self.assertIs(None, next(gw))
  369. def test_parent_present(self):
  370. gw = self.get_walker([b"a"], {b"a": [b"b"], b"b": []})
  371. self.assertEqual(b"a" * 40, next(gw))
  372. gw.ack(b"a" * 40)
  373. self.assertIs(None, next(gw))
  374. def test_child_ack_later(self):
  375. gw = self.get_walker([b"a"], {b"a": [b"b"], b"b": [b"c"], b"c": []})
  376. self.assertEqual(b"a" * 40, next(gw))
  377. self.assertEqual(b"b" * 40, next(gw))
  378. gw.ack(b"a" * 40)
  379. self.assertIs(None, next(gw))
  380. def test_only_once(self):
  381. # a b
  382. # | |
  383. # c d
  384. # \ /
  385. # e
  386. gw = self.get_walker([b"a", b"b"], {
  387. b"a": [b"c"],
  388. b"b": [b"d"],
  389. b"c": [b"e"],
  390. b"d": [b"e"],
  391. b"e": [],
  392. })
  393. walk = []
  394. acked = False
  395. walk.append(next(gw))
  396. walk.append(next(gw))
  397. # A branch (a, c) or (b, d) may be done after 2 steps or 3 depending on
  398. # the order walked: 3-step walks include (a, b, c) and (b, a, d), etc.
  399. if walk == [b"a" * 40, b"c" * 40] or walk == [b"b" * 40, b"d" * 40]:
  400. gw.ack(walk[0])
  401. acked = True
  402. walk.append(next(gw))
  403. if not acked and walk[2] == b"c" * 40:
  404. gw.ack(b"a" * 40)
  405. elif not acked and walk[2] == b"d" * 40:
  406. gw.ack(b"b" * 40)
  407. walk.append(next(gw))
  408. self.assertIs(None, next(gw))
  409. self.assertEqual([b"a" * 40, b"b" * 40, b"c" * 40, b"d" * 40], sorted(walk))
  410. self.assertLess(walk.index(b"a" * 40), walk.index(b"c" * 40))
  411. self.assertLess(walk.index(b"b" * 40), walk.index(b"d" * 40))