1
# Copyright (C) 2009 Jelmer Vernooij <jelmer@samba.org>
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
# GNU General Public License for more details.
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
"""Map from Git sha's to Bazaar objects."""
19
from dulwich.objects import (
26
from dulwich.object_store import (
37
from bzrlib.lock import LogicalLockResult
38
from bzrlib.revision import (
41
from bzrlib.testament import(
45
from bzrlib.plugins.git.mapping import (
48
extract_unusual_modes,
52
from bzrlib.plugins.git.cache import (
53
from_repository as cache_from_repository,
60
def get_object_store(repo, mapping=None):
61
git = getattr(repo, "_git", None)
63
git.object_store.unlock = lambda x: None
64
git.object_store.lock_read = LogicalLockResult(lambda: None)
65
git.object_store.lock_write = LogicalLockResult(lambda: None)
66
return git.object_store
67
return BazaarObjectStore(repo, mapping)
70
MAX_TREE_CACHE_SIZE = 50 * 1024 * 1024
73
class LRUTreeCache(object):
75
def __init__(self, repository):
76
def approx_tree_size(tree):
77
# Very rough estimate, 1k per inventory entry
78
return len(tree.inventory) * 1024
79
self.repository = repository
80
self._cache = lru_cache.LRUSizeCache(max_size=MAX_TREE_CACHE_SIZE,
81
after_cleanup_size=None, compute_size=approx_tree_size)
83
def revision_tree(self, revid):
85
tree = self._cache[revid]
87
tree = self.repository.revision_tree(revid)
89
assert tree.get_revision_id() == tree.inventory.revision_id
92
def iter_revision_trees(self, revids):
97
tree = self._cache[revid]
101
assert tree.get_revision_id() == revid
103
for tree in self.repository.revision_trees(todo):
104
trees[tree.get_revision_id()] = tree
106
return (trees[r] for r in revids)
108
def revision_trees(self, revids):
109
return list(self.iter_revision_trees(revids))
112
self._cache.add(tree.get_revision_id(), tree)
115
def _find_missing_bzr_revids(graph, want, have):
116
"""Find the revisions that have to be pushed.
118
:param get_parent_map: Function that returns the parents for a sequence
120
:param want: Revisions the target wants
121
:param have: Revisions the target already has
122
:return: Set of revisions to fetch
126
todo.update(graph.find_unique_ancestors(rev, have))
127
if NULL_REVISION in todo:
128
todo.remove(NULL_REVISION)
132
def _check_expected_sha(expected_sha, object):
133
"""Check whether an object matches an expected SHA.
135
:param expected_sha: None or expected SHA as either binary or as hex digest
136
:param object: Object to verify
138
if expected_sha is None:
140
if len(expected_sha) == 40:
141
if expected_sha != object.sha().hexdigest():
142
raise AssertionError("Invalid sha for %r: %s" % (object,
144
elif len(expected_sha) == 20:
145
if expected_sha != object.sha().digest():
146
raise AssertionError("Invalid sha for %r: %s" % (object,
147
sha_to_hex(expected_sha)))
149
raise AssertionError("Unknown length %d for %r" % (len(expected_sha),
153
def _tree_to_objects(tree, parent_trees, idmap, unusual_modes,
154
dummy_file_name=None):
155
"""Iterate over the objects that were introduced in a revision.
158
:param parent_trees: Parent revision trees
159
:param unusual_modes: Unusual file modes dictionary
160
:param dummy_file_name: File name to use for dummy files
161
in empty directories. None to skip empty directories
162
:return: Yields (path, object, ie) entries
168
base_tree = parent_trees[0]
169
other_parent_trees = parent_trees[1:]
171
base_tree = tree._repository.revision_tree(NULL_REVISION)
172
other_parent_trees = []
173
def find_unchanged_parent_ie(ie, parent_trees):
174
assert ie.kind in ("symlink", "file")
175
for ptree in parent_trees:
177
pie = ptree.inventory[ie.file_id]
178
except errors.NoSuchId:
181
if (pie.text_sha1 == ie.text_sha1 and
182
pie.kind == ie.kind and
183
pie.symlink_target == ie.symlink_target):
187
# Find all the changed blobs
188
for (file_id, path, changed_content, versioned, parent, name, kind,
189
executable) in tree.iter_changes(base_tree):
190
if kind[1] == "file":
191
ie = tree.inventory[file_id]
194
pie = find_unchanged_parent_ie(ie, other_parent_trees)
199
shamap[ie.file_id] = idmap.lookup_blob_id(
200
pie.file_id, pie.revision)
204
blob.data = tree.get_file_text(ie.file_id)
205
shamap[ie.file_id] = blob.id
206
if not file_id in shamap:
207
new_blobs.append((path[1], ie))
208
new_trees[posixpath.dirname(path[1])] = parent[1]
209
elif kind[1] == "symlink":
210
ie = tree.inventory[file_id]
212
blob = symlink_to_blob(ie)
213
shamap[file_id] = blob.id
215
find_unchanged_parent_ie(ie, other_parent_trees)
217
yield path[1], blob, ie
218
new_trees[posixpath.dirname(path[1])] = parent[1]
219
elif kind[1] not in (None, "directory"):
220
raise AssertionError(kind[1])
221
if (path[0] not in (None, "") and
222
parent[0] in tree.inventory and
223
tree.inventory[parent[0]].kind == "directory"):
225
new_trees[posixpath.dirname(path[0])] = parent[0]
227
# Fetch contents of the blobs that were changed
228
for (path, ie), chunks in tree.iter_files_bytes(
229
[(ie.file_id, (path, ie)) for (path, ie) in new_blobs]):
233
shamap[ie.file_id] = obj.id
235
for path in unusual_modes:
236
parent_path = posixpath.dirname(path)
237
new_trees[parent_path] = tree.path2id(parent_path)
241
items = new_trees.items()
243
for path, file_id in items:
244
parent_id = tree.inventory[file_id].parent_id
245
if parent_id is not None:
246
parent_path = urlutils.dirname(path)
247
new_trees[parent_path] = parent_id
248
trees[path] = file_id
250
def ie_to_hexsha(ie):
252
return shamap[ie.file_id]
254
# FIXME: Should be the same as in parent
255
if ie.kind in ("file", "symlink"):
257
return idmap.lookup_blob_id(ie.file_id, ie.revision)
261
blob.data = tree.get_file_text(ie.file_id)
263
elif ie.kind == "directory":
264
# Not all cache backends store the tree information,
265
# calculate again from scratch
266
ret = directory_to_tree(ie, ie_to_hexsha, unusual_modes,
274
for path in sorted(trees.keys(), reverse=True):
275
ie = tree.inventory[trees[path]]
276
assert ie.kind == "directory"
277
obj = directory_to_tree(ie, ie_to_hexsha, unusual_modes,
281
shamap[ie.file_id] = obj.id
284
class BazaarObjectStore(BaseObjectStore):
285
"""A Git-style object store backed onto a Bazaar repository."""
287
def __init__(self, repository, mapping=None):
288
self.repository = repository
289
self._map_updated = False
292
self.mapping = default_mapping
294
self.mapping = mapping
295
self._cache = cache_from_repository(repository)
296
self._content_cache_types = ("tree")
297
self.start_write_group = self._cache.idmap.start_write_group
298
self.abort_write_group = self._cache.idmap.abort_write_group
299
self.commit_write_group = self._cache.idmap.commit_write_group
300
self.tree_cache = LRUTreeCache(self.repository)
302
def _update_sha_map(self, stop_revision=None):
303
if not self.is_locked():
304
raise AssertionError()
305
if self._map_updated:
307
graph = self.repository.get_graph()
308
if stop_revision is None:
309
heads = graph.heads(self.repository.all_revision_ids())
311
heads = set([stop_revision])
312
missing_revids = self._cache.idmap.missing_revisions(heads)
314
parents = graph.get_parent_map(heads)
316
for p in parents.values():
317
todo.update([x for x in p if x not in missing_revids])
318
heads = self._cache.idmap.missing_revisions(todo)
319
missing_revids.update(heads)
320
if NULL_REVISION in missing_revids:
321
missing_revids.remove(NULL_REVISION)
322
missing_revids = self.repository.has_revisions(missing_revids)
323
if not missing_revids:
324
self._map_updated = True
326
self.start_write_group()
328
pb = ui.ui_factory.nested_progress_bar()
330
for i, revid in enumerate(graph.iter_topo_order(missing_revids)):
331
trace.mutter('processing %r', revid)
332
pb.update("updating git map", i, len(missing_revids))
333
self._update_sha_map_revision(revid)
336
self._map_updated = True
338
self.abort_write_group()
341
self.commit_write_group()
344
self._update_sha_map()
345
return iter(self._cache.idmap.sha1s())
347
def _reconstruct_commit(self, rev, tree_sha, roundtrip, verifiers):
348
"""Reconstruct a Commit object.
350
:param rev: Revision object
351
:param tree_sha: SHA1 of the root tree object
352
:param roundtrip: Whether or not to roundtrip bzr metadata
353
:param verifiers: Verifiers for the commits
354
:return: Commit object
356
def parent_lookup(revid):
358
return self._lookup_revision_sha1(revid)
359
except errors.NoSuchRevision:
361
return self.mapping.export_commit(rev, tree_sha, parent_lookup,
362
roundtrip, verifiers)
364
def _create_fileid_map_blob(self, inv):
365
# FIXME: This can probably be a lot more efficient,
366
# not all files necessarily have to be processed.
368
for (path, ie) in inv.iter_entries():
369
if self.mapping.generate_file_id(path) != ie.file_id:
370
file_ids[path] = ie.file_id
371
return self.mapping.export_fileid_map(file_ids)
373
def _revision_to_objects(self, rev, tree, roundtrip):
374
"""Convert a revision to a set of git objects.
376
:param rev: Bazaar revision object
377
:param tree: Bazaar revision tree
378
:param roundtrip: Whether to roundtrip all Bazaar revision data
380
unusual_modes = extract_unusual_modes(rev)
381
present_parents = self.repository.has_revisions(rev.parent_ids)
382
parent_trees = self.tree_cache.revision_trees(
383
[p for p in rev.parent_ids if p in present_parents])
385
for path, obj, ie in _tree_to_objects(tree, parent_trees,
386
self._cache.idmap, unusual_modes, self.mapping.BZR_DUMMY_FILE):
390
# Don't yield just yet
393
if root_tree is None:
394
# Pointless commit - get the tree sha elsewhere
395
if not rev.parent_ids:
398
base_sha1 = self._lookup_revision_sha1(rev.parent_ids[0])
399
root_tree = self[self[base_sha1].tree]
400
root_ie = tree.inventory.root
401
if roundtrip and self.mapping.BZR_FILE_IDS_FILE is not None:
402
b = self._create_fileid_map_blob(tree.inventory)
404
root_tree[self.mapping.BZR_FILE_IDS_FILE] = (
405
(stat.S_IFREG | 0644), b.id)
406
yield self.mapping.BZR_FILE_IDS_FILE, b, None
407
yield "", root_tree, root_ie
409
if getattr(StrictTestament3, "from_revision_tree", None):
410
testament3 = StrictTestament3(rev, tree)
412
testament3 = StrictTestament3(rev, tree.inventory)
413
verifiers = { "testament3-sha1": testament3.as_sha1() }
416
commit_obj = self._reconstruct_commit(rev, root_tree.id,
417
roundtrip=roundtrip, verifiers=verifiers)
419
foreign_revid, mapping = mapping_registry.parse_revision_id(
421
except errors.InvalidRevisionId:
424
_check_expected_sha(foreign_revid, commit_obj)
425
yield None, commit_obj, None
427
def _get_updater(self, rev):
428
return self._cache.get_updater(rev)
430
def _update_sha_map_revision(self, revid):
431
rev = self.repository.get_revision(revid)
432
tree = self.tree_cache.revision_tree(rev.revision_id)
433
updater = self._get_updater(rev)
434
for path, obj, ie in self._revision_to_objects(rev, tree,
436
if isinstance(obj, Commit):
437
if getattr(StrictTestament3, "from_revision_tree", None):
438
testament3 = StrictTestament3(rev, tree)
440
testament3 = StrictTestament3(rev, tree.inventory)
441
ie = { "testament3-sha1": testament3.as_sha1() }
442
updater.add_object(obj, ie, path)
443
commit_obj = updater.finish()
446
def _reconstruct_blobs(self, keys):
447
"""Return a Git Blob object from a fileid and revision stored in bzr.
449
:param fileid: File id of the text
450
:param revision: Revision of the text
452
stream = self.repository.iter_files_bytes(
453
((key[0], key[1], key) for key in keys))
454
for (fileid, revision, expected_sha), chunks in stream:
456
blob.chunked = chunks
457
if blob.id != expected_sha and blob.data == "":
458
# Perhaps it's a symlink ?
459
tree = self.tree_cache.revision_tree(revision)
460
entry = tree.inventory[fileid]
461
if entry.kind == 'symlink':
462
blob = symlink_to_blob(entry)
463
_check_expected_sha(expected_sha, blob)
466
def _reconstruct_tree(self, fileid, revid, inv, unusual_modes,
468
"""Return a Git Tree object from a file id and a revision stored in bzr.
470
:param fileid: fileid in the tree.
471
:param revision: Revision of the tree.
473
def get_ie_sha1(entry):
474
if entry.kind == "directory":
476
return self._cache.idmap.lookup_tree_id(entry.file_id,
478
except (NotImplementedError, KeyError):
479
obj = self._reconstruct_tree(entry.file_id, revid, inv,
485
elif entry.kind in ("file", "symlink"):
487
return self._cache.idmap.lookup_blob_id(entry.file_id,
491
return self._reconstruct_blobs(
492
[(entry.file_id, entry.revision, None)]).next().id
494
raise AssertionError("unknown entry kind '%s'" % entry.kind)
495
tree = directory_to_tree(inv[fileid], get_ie_sha1, unusual_modes,
496
self.mapping.BZR_DUMMY_FILE)
497
if (inv.root.file_id == fileid and
498
self.mapping.BZR_FILE_IDS_FILE is not None):
501
b = self._create_fileid_map_blob(inv)
502
# If this is the root tree, add the file ids
503
tree[self.mapping.BZR_FILE_IDS_FILE] = (
504
(stat.S_IFREG | 0644), b.id)
506
_check_expected_sha(expected_sha, tree)
509
def get_parents(self, sha):
510
"""Retrieve the parents of a Git commit by SHA1.
512
:param sha: SHA1 of the commit
513
:raises: KeyError, NotCommitError
515
return self[sha].parents
517
def _lookup_revision_sha1(self, revid):
518
"""Return the SHA1 matching a Bazaar revision."""
519
if revid == NULL_REVISION:
522
return self._cache.idmap.lookup_commit(revid)
525
return mapping_registry.parse_revision_id(revid)[0]
526
except errors.InvalidRevisionId:
527
self.repository.lock_read()
529
self._update_sha_map(revid)
531
self.repository.unlock()
532
return self._cache.idmap.lookup_commit(revid)
534
def get_raw(self, sha):
535
"""Get the raw representation of a Git object by SHA1.
537
:param sha: SHA1 of the git object
540
return (obj.type, obj.as_raw_string())
542
def __contains__(self, sha):
543
# See if sha is in map
545
for (type, type_data) in self.lookup_git_sha(sha):
547
if self.repository.has_revision(type_data[0]):
550
if self.repository.texts.has_key(type_data):
553
if self.repository.has_revision(type_data[1]):
556
raise AssertionError("Unknown object type '%s'" % type)
564
self._map_updated = False
565
self.repository.lock_read()
566
return LogicalLockResult(self.unlock)
568
def lock_write(self):
570
self._map_updated = False
571
self.repository.lock_write()
572
return LogicalLockResult(self.unlock)
575
return (self._locked is not None)
579
self._map_updated = False
580
self.repository.unlock()
582
def lookup_git_shas(self, shas):
586
ret[sha] = [("commit", (NULL_REVISION, None, {}))]
589
ret[sha] = list(self._cache.idmap.lookup_git_sha(sha))
591
# if not, see if there are any unconverted revisions and
592
# add them to the map, search for sha in map again
593
self._update_sha_map()
595
ret[sha] = list(self._cache.idmap.lookup_git_sha(sha))
600
def lookup_git_sha(self, sha):
601
return self.lookup_git_shas([sha])[sha]
603
def __getitem__(self, sha):
604
if self._cache.content_cache is not None:
606
return self._cache.content_cache[sha]
609
for (kind, type_data) in self.lookup_git_sha(sha):
610
# convert object to git object
612
(revid, tree_sha, verifiers) = type_data
614
rev = self.repository.get_revision(revid)
615
except errors.NoSuchRevision:
616
trace.mutter('entry for %s %s in shamap: %r, but not '
617
'found in repository', kind, sha, type_data)
619
commit = self._reconstruct_commit(rev, tree_sha,
620
roundtrip=True, verifiers=verifiers)
621
_check_expected_sha(sha, commit)
624
(fileid, revision) = type_data
625
blobs = self._reconstruct_blobs([(fileid, revision, sha)])
628
(fileid, revid) = type_data
630
tree = self.tree_cache.revision_tree(revid)
631
rev = self.repository.get_revision(revid)
632
except errors.NoSuchRevision:
633
trace.mutter('entry for %s %s in shamap: %r, but not found in repository', kind, sha, type_data)
635
unusual_modes = extract_unusual_modes(rev)
637
return self._reconstruct_tree(fileid, revid,
638
tree.inventory, unusual_modes, expected_sha=sha)
639
except errors.NoSuchRevision:
642
raise AssertionError("Unknown object type '%s'" % kind)
646
def generate_lossy_pack_contents(self, have, want, progress=None,
648
return self.generate_pack_contents(have, want, progress, get_tagged,
651
def generate_pack_contents(self, have, want, progress=None,
652
get_tagged=None, lossy=False):
653
"""Iterate over the contents of a pack file.
655
:param have: List of SHA1s of objects that should not be sent
656
:param want: List of SHA1s of objects that should be sent
659
ret = self.lookup_git_shas(have + want)
660
for commit_sha in have:
662
for (type, type_data) in ret[commit_sha]:
663
assert type == "commit"
664
processed.add(type_data[0])
668
for commit_sha in want:
669
if commit_sha in have:
672
for (type, type_data) in ret[commit_sha]:
673
assert type == "commit"
674
pending.add(type_data[0])
678
graph = self.repository.get_graph()
679
todo = _find_missing_bzr_revids(graph, pending, processed)
680
trace.mutter('sending revisions %r', todo)
682
pb = ui.ui_factory.nested_progress_bar()
684
for i, revid in enumerate(todo):
685
pb.update("generating git objects", i, len(todo))
687
rev = self.repository.get_revision(revid)
688
except errors.NoSuchRevision:
690
tree = self.tree_cache.revision_tree(revid)
691
for path, obj, ie in self._revision_to_objects(rev, tree,
692
roundtrip=not lossy):
693
ret.append((obj, path))
698
def add_thin_pack(self):
701
fd, path = tempfile.mkstemp(suffix=".pack")
702
f = os.fdopen(fd, 'wb')
704
from dulwich.pack import PackData, Pack
705
from bzrlib.plugins.git.fetch import import_git_objects
708
if os.path.getsize(path) == 0:
711
pd.create_index_v2(path[:-5]+".idx", self.object_store.get_raw)
714
self.repository.lock_write()
716
self.repository.start_write_group()
718
import_git_objects(self.repository, self.mapping,
719
p.iterobjects(get_raw=self.get_raw),
722
self.repository.abort_write_group()
725
self.repository.commit_write_group()
727
self.repository.unlock()
730
# The pack isn't kept around anyway, so no point
731
# in treating full packs different from thin packs
732
add_pack = add_thin_pack