1
# Copyright (C) 2009-2018 Jelmer Vernooij <jelmer@jelmer.uk>
2
# Copyright (C) 2012 Canonical Ltd
4
# This program is free software; you can redistribute it and/or modify
5
# it under the terms of the GNU General Public License as published by
6
# the Free Software Foundation; either version 2 of the License, or
7
# (at your option) any later version.
9
# This program is distributed in the hope that it will be useful,
10
# but WITHOUT ANY WARRANTY; without even the implied warranty of
11
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12
# GNU General Public License for more details.
14
# You should have received a copy of the GNU General Public License
15
# along with this program; if not, write to the Free Software
16
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
18
"""Map from Git sha's to Bazaar objects."""
20
from __future__ import absolute_import
22
from dulwich.objects import (
29
from dulwich.object_store import (
32
from dulwich.pack import (
45
from ..lock import LogicalLockResult
46
from ..revision import (
49
from ..sixish import viewitems
50
from ..testament import (
55
from_repository as cache_from_repository,
57
from .mapping import (
60
extract_unusual_modes,
64
from .unpeel_map import (
72
BANNED_FILENAMES = ['.git']
75
def get_object_store(repo, mapping=None):
76
git = getattr(repo, "_git", None)
78
git.object_store.unlock = lambda: None
79
git.object_store.lock_read = lambda: LogicalLockResult(lambda: None)
80
git.object_store.lock_write = lambda: LogicalLockResult(lambda: None)
81
return git.object_store
82
return BazaarObjectStore(repo, mapping)
85
MAX_TREE_CACHE_SIZE = 50 * 1024 * 1024
88
class LRUTreeCache(object):
90
def __init__(self, repository):
91
def approx_tree_size(tree):
92
# Very rough estimate, 250 per inventory entry
94
inv = tree.root_inventory
95
except AttributeError:
98
self.repository = repository
99
self._cache = lru_cache.LRUSizeCache(
100
max_size=MAX_TREE_CACHE_SIZE, after_cleanup_size=None,
101
compute_size=approx_tree_size)
103
def revision_tree(self, revid):
105
tree = self._cache[revid]
107
tree = self.repository.revision_tree(revid)
111
def iter_revision_trees(self, revids):
116
tree = self._cache[revid]
120
if tree.get_revision_id() != revid:
121
raise AssertionError(
122
"revision id did not match: %s != %s" % (
123
tree.get_revision_id(), revid))
125
for tree in self.repository.revision_trees(todo):
126
trees[tree.get_revision_id()] = tree
128
return (trees[r] for r in revids)
130
def revision_trees(self, revids):
131
return list(self.iter_revision_trees(revids))
134
self._cache[tree.get_revision_id()] = tree
137
def _find_missing_bzr_revids(graph, want, have):
138
"""Find the revisions that have to be pushed.
140
:param get_parent_map: Function that returns the parents for a sequence
142
:param want: Revisions the target wants
143
:param have: Revisions the target already has
144
:return: Set of revisions to fetch
149
extra_todo = graph.find_unique_ancestors(rev, handled)
150
todo.update(extra_todo)
151
handled.update(extra_todo)
152
if NULL_REVISION in todo:
153
todo.remove(NULL_REVISION)
157
def _check_expected_sha(expected_sha, object):
158
"""Check whether an object matches an expected SHA.
160
:param expected_sha: None or expected SHA as either binary or as hex digest
161
:param object: Object to verify
163
if expected_sha is None:
165
if len(expected_sha) == 40:
166
if expected_sha != object.sha().hexdigest().encode('ascii'):
167
raise AssertionError("Invalid sha for %r: %s" % (object,
169
elif len(expected_sha) == 20:
170
if expected_sha != object.sha().digest():
171
raise AssertionError("Invalid sha for %r: %s" % (
172
object, sha_to_hex(expected_sha)))
174
raise AssertionError("Unknown length %d for %r" % (len(expected_sha),
178
def directory_to_tree(path, children, lookup_ie_sha1, unusual_modes,
179
empty_file_name, allow_empty=False):
180
"""Create a Git Tree object from a Bazaar directory.
182
:param path: directory path
183
:param children: Children inventory entries
184
:param lookup_ie_sha1: Lookup the Git SHA1 for a inventory entry
185
:param unusual_modes: Dictionary with unusual file modes by file ids
186
:param empty_file_name: Name to use for dummy files in empty directories,
187
None to ignore empty directories.
190
for value in children:
191
if value.name in BANNED_FILENAMES:
193
child_path = osutils.pathjoin(path, value.name)
195
mode = unusual_modes[child_path]
197
mode = entry_mode(value)
198
hexsha = lookup_ie_sha1(child_path, value)
199
if hexsha is not None:
200
tree.add(value.name.encode("utf-8"), mode, hexsha)
201
if not allow_empty and len(tree) == 0:
202
# Only the root can be an empty tree
203
if empty_file_name is not None:
204
tree.add(empty_file_name, stat.S_IFREG | 0o644, Blob().id)
210
def _tree_to_objects(tree, parent_trees, idmap, unusual_modes,
211
dummy_file_name=None, add_cache_entry=None):
212
"""Iterate over the objects that were introduced in a revision.
215
:param parent_trees: Parent revision trees
216
:param unusual_modes: Unusual file modes dictionary
217
:param dummy_file_name: File name to use for dummy files
218
in empty directories. None to skip empty directories
219
:return: Yields (path, object, ie) entries
225
base_tree = parent_trees[0]
226
other_parent_trees = parent_trees[1:]
228
base_tree = tree._repository.revision_tree(NULL_REVISION)
229
other_parent_trees = []
231
def find_unchanged_parent_ie(file_id, kind, other, parent_trees):
232
for ptree in parent_trees:
234
ppath = ptree.id2path(file_id)
235
except errors.NoSuchId:
238
pkind = ptree.kind(ppath, file_id)
240
if (pkind == "file" and
241
ptree.get_file_sha1(ppath, file_id) == other):
243
file_id, ptree.get_file_revision(ppath, file_id))
244
if kind == "symlink":
245
if (pkind == "symlink" and
246
ptree.get_symlink_target(ppath, file_id) == other):
248
file_id, ptree.get_file_revision(ppath, file_id))
251
# Find all the changed blobs
252
for (file_id, path, changed_content, versioned, parent, name, kind,
253
executable) in tree.iter_changes(base_tree):
254
if name[1] in BANNED_FILENAMES:
256
if kind[1] == "file":
257
sha1 = tree.get_file_sha1(path[1], file_id)
260
(pfile_id, prevision) = find_unchanged_parent_ie(
261
file_id, kind[1], sha1, other_parent_trees)
265
# It existed in one of the parents, with the same contents.
266
# So no need to yield any new git objects.
268
blob_id = idmap.lookup_blob_id(
271
if not changed_content:
274
blob.data = tree.get_file_text(path[1], file_id)
277
new_blobs.append((path[1], file_id))
279
shamap[path[1]] = blob_id
280
if add_cache_entry is not None:
283
(file_id, tree.get_file_revision(path[1])), path[1])
284
elif kind[1] == "symlink":
285
target = tree.get_symlink_target(path[1], file_id)
286
blob = symlink_to_blob(target)
287
shamap[path[1]] = blob.id
288
if add_cache_entry is not None:
290
blob, (file_id, tree.get_file_revision(path[1])), path[1])
292
find_unchanged_parent_ie(
293
file_id, kind[1], target, other_parent_trees)
296
yield (path[1], blob,
297
(file_id, tree.get_file_revision(path[1], file_id)))
298
elif kind[1] is None:
299
shamap[path[1]] = None
300
elif kind[1] != 'directory':
301
raise AssertionError(kind[1])
305
dirty_dirs.add(osutils.dirname(p))
307
# Fetch contents of the blobs that were changed
308
for (path, file_id), chunks in tree.iter_files_bytes(
309
[(path, (path, file_id)) for (path, file_id) in new_blobs]):
312
if add_cache_entry is not None:
313
add_cache_entry(obj, (file_id, tree.get_file_revision(path)), path)
314
yield path, obj, (file_id, tree.get_file_revision(path))
315
shamap[path] = obj.id
317
for path in unusual_modes:
318
dirty_dirs.add(posixpath.dirname(path))
320
for dir in list(dirty_dirs):
321
for parent in osutils.parent_directories(dir):
322
if parent in dirty_dirs:
324
dirty_dirs.add(parent)
329
def ie_to_hexsha(path, ie):
334
# FIXME: Should be the same as in parent
335
if ie.kind in ("file", "symlink"):
337
return idmap.lookup_blob_id(ie.file_id, ie.revision)
341
blob.data = tree.get_file_text(path, ie.file_id)
342
if add_cache_entry is not None:
343
add_cache_entry(blob, (ie.file_id, ie.revision), path)
345
elif ie.kind == "directory":
346
# Not all cache backends store the tree information,
347
# calculate again from scratch
348
ret = directory_to_tree(
349
path, ie.children.values(), ie_to_hexsha, unusual_modes,
350
dummy_file_name, ie.parent_id is None)
357
for path in sorted(dirty_dirs, reverse=True):
358
if not tree.has_filename(path):
361
if tree.kind(path) != 'directory':
365
for value in tree.iter_child_entries(path):
366
if value.name in BANNED_FILENAMES:
367
trace.warning('not exporting %s with banned filename %s',
368
value.kind, value.name)
370
child_path = osutils.pathjoin(path, value.name)
372
mode = unusual_modes[child_path]
374
mode = entry_mode(value)
375
hexsha = ie_to_hexsha(child_path, value)
376
if hexsha is not None:
377
obj.add(value.name.encode("utf-8"), mode, hexsha)
380
file_id = tree.path2id(path)
381
if add_cache_entry is not None:
382
add_cache_entry(obj, (file_id, tree.get_revision_id()), path)
383
yield path, obj, (file_id, tree.get_revision_id())
384
shamap[path] = obj.id
387
class PackTupleIterable(object):
389
def __init__(self, store):
391
self.store.lock_read()
397
def add(self, sha, path):
398
self.objects[sha] = path
401
return len(self.objects)
404
return ((self.store[object_id], path) for (object_id, path) in
405
viewitems(self.objects))
408
class BazaarObjectStore(BaseObjectStore):
409
"""A Git-style object store backed onto a Bazaar repository."""
411
def __init__(self, repository, mapping=None):
412
self.repository = repository
413
self._map_updated = False
416
self.mapping = default_mapping
418
self.mapping = mapping
419
self._cache = cache_from_repository(repository)
420
self._content_cache_types = ("tree",)
421
self.start_write_group = self._cache.idmap.start_write_group
422
self.abort_write_group = self._cache.idmap.abort_write_group
423
self.commit_write_group = self._cache.idmap.commit_write_group
424
self.tree_cache = LRUTreeCache(self.repository)
425
self.unpeel_map = UnpeelMap.from_repository(self.repository)
427
def _missing_revisions(self, revisions):
428
return self._cache.idmap.missing_revisions(revisions)
430
def _update_sha_map(self, stop_revision=None):
431
if not self.is_locked():
432
raise errors.LockNotHeld(self)
433
if self._map_updated:
435
if (stop_revision is not None and
436
not self._missing_revisions([stop_revision])):
438
graph = self.repository.get_graph()
439
if stop_revision is None:
440
all_revids = self.repository.all_revision_ids()
441
missing_revids = self._missing_revisions(all_revids)
443
heads = set([stop_revision])
444
missing_revids = self._missing_revisions(heads)
446
parents = graph.get_parent_map(heads)
448
for p in parents.values():
449
todo.update([x for x in p if x not in missing_revids])
450
heads = self._missing_revisions(todo)
451
missing_revids.update(heads)
452
if NULL_REVISION in missing_revids:
453
missing_revids.remove(NULL_REVISION)
454
missing_revids = self.repository.has_revisions(missing_revids)
455
if not missing_revids:
456
if stop_revision is None:
457
self._map_updated = True
459
self.start_write_group()
461
pb = ui.ui_factory.nested_progress_bar()
463
for i, revid in enumerate(graph.iter_topo_order(
465
trace.mutter('processing %r', revid)
466
pb.update("updating git map", i, len(missing_revids))
467
self._update_sha_map_revision(revid)
470
if stop_revision is None:
471
self._map_updated = True
472
except BaseException:
473
self.abort_write_group()
476
self.commit_write_group()
479
self._update_sha_map()
480
return iter(self._cache.idmap.sha1s())
482
def _reconstruct_commit(self, rev, tree_sha, lossy, verifiers):
483
"""Reconstruct a Commit object.
485
:param rev: Revision object
486
:param tree_sha: SHA1 of the root tree object
487
:param lossy: Whether or not to roundtrip bzr metadata
488
:param verifiers: Verifiers for the commits
489
:return: Commit object
491
def parent_lookup(revid):
493
return self._lookup_revision_sha1(revid)
494
except errors.NoSuchRevision:
496
return self.mapping.export_commit(rev, tree_sha, parent_lookup,
499
def _create_fileid_map_blob(self, tree):
500
# FIXME: This can probably be a lot more efficient,
501
# not all files necessarily have to be processed.
503
for (path, ie) in tree.iter_entries_by_dir():
504
if self.mapping.generate_file_id(path) != ie.file_id:
505
file_ids[path] = ie.file_id
506
return self.mapping.export_fileid_map(file_ids)
508
def _revision_to_objects(self, rev, tree, lossy, add_cache_entry=None):
509
"""Convert a revision to a set of git objects.
511
:param rev: Bazaar revision object
512
:param tree: Bazaar revision tree
513
:param lossy: Whether to not roundtrip all Bazaar revision data
515
unusual_modes = extract_unusual_modes(rev)
516
present_parents = self.repository.has_revisions(rev.parent_ids)
517
parent_trees = self.tree_cache.revision_trees(
518
[p for p in rev.parent_ids if p in present_parents])
520
for path, obj, bzr_key_data in _tree_to_objects(
521
tree, parent_trees, self._cache.idmap, unusual_modes,
522
self.mapping.BZR_DUMMY_FILE, add_cache_entry):
525
root_key_data = bzr_key_data
526
# Don't yield just yet
529
if root_tree is None:
530
# Pointless commit - get the tree sha elsewhere
531
if not rev.parent_ids:
534
base_sha1 = self._lookup_revision_sha1(rev.parent_ids[0])
535
root_tree = self[self[base_sha1].tree]
536
root_key_data = (tree.get_root_id(), tree.get_revision_id())
537
if not lossy and self.mapping.BZR_FILE_IDS_FILE is not None:
538
b = self._create_fileid_map_blob(tree)
540
root_tree[self.mapping.BZR_FILE_IDS_FILE] = (
541
(stat.S_IFREG | 0o644), b.id)
542
yield self.mapping.BZR_FILE_IDS_FILE, b
543
if add_cache_entry is not None:
544
add_cache_entry(root_tree, root_key_data, "")
547
testament3 = StrictTestament3(rev, tree)
548
verifiers = {"testament3-sha1": testament3.as_sha1()}
551
commit_obj = self._reconstruct_commit(rev, root_tree.id,
552
lossy=lossy, verifiers=verifiers)
554
foreign_revid, mapping = mapping_registry.parse_revision_id(
556
except errors.InvalidRevisionId:
559
_check_expected_sha(foreign_revid, commit_obj)
560
if add_cache_entry is not None:
561
add_cache_entry(commit_obj, verifiers, None)
563
yield None, commit_obj
565
def _get_updater(self, rev):
566
return self._cache.get_updater(rev)
568
def _update_sha_map_revision(self, revid):
569
rev = self.repository.get_revision(revid)
570
tree = self.tree_cache.revision_tree(rev.revision_id)
571
updater = self._get_updater(rev)
572
# FIXME JRV 2011-12-15: Shouldn't we try both values for lossy ?
573
for path, obj in self._revision_to_objects(
574
rev, tree, lossy=(not self.mapping.roundtripping),
575
add_cache_entry=updater.add_object):
576
if isinstance(obj, Commit):
578
commit_obj = updater.finish()
581
def _reconstruct_blobs(self, keys):
582
"""Return a Git Blob object from a fileid and revision stored in bzr.
584
:param fileid: File id of the text
585
:param revision: Revision of the text
587
stream = self.repository.iter_files_bytes(
588
((key[0], key[1], key) for key in keys))
589
for (file_id, revision, expected_sha), chunks in stream:
591
blob.chunked = chunks
592
if blob.id != expected_sha and blob.data == "":
593
# Perhaps it's a symlink ?
594
tree = self.tree_cache.revision_tree(revision)
595
path = tree.id2path(file_id)
596
if tree.kind(path, file_id) == 'symlink':
597
blob = symlink_to_blob(
598
tree.get_symlink_target(path, file_id))
599
_check_expected_sha(expected_sha, blob)
602
def _reconstruct_tree(self, fileid, revid, bzr_tree, unusual_modes,
604
"""Return a Git Tree object from a file id and a revision stored in bzr.
606
:param fileid: fileid in the tree.
607
:param revision: Revision of the tree.
609
def get_ie_sha1(path, entry):
610
if entry.kind == "directory":
612
return self._cache.idmap.lookup_tree_id(entry.file_id,
614
except (NotImplementedError, KeyError):
615
obj = self._reconstruct_tree(
616
entry.file_id, revid, bzr_tree, unusual_modes)
621
elif entry.kind in ("file", "symlink"):
623
return self._cache.idmap.lookup_blob_id(entry.file_id,
627
return next(self._reconstruct_blobs(
628
[(entry.file_id, entry.revision, None)])).id
629
elif entry.kind == 'tree-reference':
630
# FIXME: Make sure the file id is the root id
631
return self._lookup_revision_sha1(entry.reference_revision)
633
raise AssertionError("unknown entry kind '%s'" % entry.kind)
634
path = bzr_tree.id2path(fileid)
635
tree = directory_to_tree(
637
bzr_tree.iter_child_entries(path),
638
get_ie_sha1, unusual_modes, self.mapping.BZR_DUMMY_FILE,
639
bzr_tree.get_root_id() == fileid)
640
if (bzr_tree.get_root_id() == fileid and
641
self.mapping.BZR_FILE_IDS_FILE is not None):
644
b = self._create_fileid_map_blob(bzr_tree)
645
# If this is the root tree, add the file ids
646
tree[self.mapping.BZR_FILE_IDS_FILE] = (
647
(stat.S_IFREG | 0o644), b.id)
649
_check_expected_sha(expected_sha, tree)
652
def get_parents(self, sha):
653
"""Retrieve the parents of a Git commit by SHA1.
655
:param sha: SHA1 of the commit
656
:raises: KeyError, NotCommitError
658
return self[sha].parents
660
def _lookup_revision_sha1(self, revid):
661
"""Return the SHA1 matching a Bazaar revision."""
662
if revid == NULL_REVISION:
665
return self._cache.idmap.lookup_commit(revid)
668
return mapping_registry.parse_revision_id(revid)[0]
669
except errors.InvalidRevisionId:
670
self._update_sha_map(revid)
671
return self._cache.idmap.lookup_commit(revid)
673
def get_raw(self, sha):
674
"""Get the raw representation of a Git object by SHA1.
676
:param sha: SHA1 of the git object
679
sha = sha_to_hex(sha)
681
return (obj.type, obj.as_raw_string())
683
def __contains__(self, sha):
684
# See if sha is in map
686
for (type, type_data) in self.lookup_git_sha(sha):
688
if self.repository.has_revision(type_data[0]):
691
if type_data in self.repository.texts:
694
if self.repository.has_revision(type_data[1]):
697
raise AssertionError("Unknown object type '%s'" % type)
705
self._map_updated = False
706
self.repository.lock_read()
707
return LogicalLockResult(self.unlock)
709
def lock_write(self):
711
self._map_updated = False
712
self.repository.lock_write()
713
return LogicalLockResult(self.unlock)
716
return (self._locked is not None)
720
self._map_updated = False
721
self.repository.unlock()
723
def lookup_git_shas(self, shas):
727
ret[sha] = [("commit", (NULL_REVISION, None, {}))]
730
ret[sha] = list(self._cache.idmap.lookup_git_sha(sha))
732
# if not, see if there are any unconverted revisions and
733
# add them to the map, search for sha in map again
734
self._update_sha_map()
736
ret[sha] = list(self._cache.idmap.lookup_git_sha(sha))
741
def lookup_git_sha(self, sha):
742
return self.lookup_git_shas([sha])[sha]
744
def __getitem__(self, sha):
745
for (kind, type_data) in self.lookup_git_sha(sha):
746
# convert object to git object
748
(revid, tree_sha, verifiers) = type_data
750
rev = self.repository.get_revision(revid)
751
except errors.NoSuchRevision:
752
if revid == NULL_REVISION:
753
raise AssertionError(
754
"should not try to look up NULL_REVISION")
755
trace.mutter('entry for %s %s in shamap: %r, but not '
756
'found in repository', kind, sha, type_data)
758
# FIXME: the type data should say whether conversion was
760
commit = self._reconstruct_commit(
761
rev, tree_sha, lossy=(not self.mapping.roundtripping),
763
_check_expected_sha(sha, commit)
766
(fileid, revision) = type_data
767
blobs = self._reconstruct_blobs([(fileid, revision, sha)])
770
(fileid, revid) = type_data
772
tree = self.tree_cache.revision_tree(revid)
773
rev = self.repository.get_revision(revid)
774
except errors.NoSuchRevision:
776
'entry for %s %s in shamap: %r, but not found in '
777
'repository', kind, sha, type_data)
779
unusual_modes = extract_unusual_modes(rev)
781
return self._reconstruct_tree(
782
fileid, revid, tree, unusual_modes, expected_sha=sha)
783
except errors.NoSuchRevision:
786
raise AssertionError("Unknown object type '%s'" % kind)
790
def generate_lossy_pack_data(self, have, want, progress=None,
791
get_tagged=None, ofs_delta=False):
792
return pack_objects_to_data(
793
self.generate_pack_contents(have, want, progress, get_tagged,
796
def generate_pack_contents(self, have, want, progress=None,
797
ofs_delta=False, get_tagged=None, lossy=False):
798
"""Iterate over the contents of a pack file.
800
:param have: List of SHA1s of objects that should not be sent
801
:param want: List of SHA1s of objects that should be sent
804
ret = self.lookup_git_shas(have + want)
805
for commit_sha in have:
806
commit_sha = self.unpeel_map.peel_tag(commit_sha, commit_sha)
808
for (type, type_data) in ret[commit_sha]:
810
raise AssertionError("Type was %s, not commit" % type)
811
processed.add(type_data[0])
813
trace.mutter("unable to find remote ref %s", commit_sha)
815
for commit_sha in want:
816
if commit_sha in have:
819
for (type, type_data) in ret[commit_sha]:
821
raise AssertionError("Type was %s, not commit" % type)
822
pending.add(type_data[0])
826
graph = self.repository.get_graph()
827
todo = _find_missing_bzr_revids(graph, pending, processed)
828
ret = PackTupleIterable(self)
829
pb = ui.ui_factory.nested_progress_bar()
831
for i, revid in enumerate(graph.iter_topo_order(todo)):
832
pb.update("generating git objects", i, len(todo))
834
rev = self.repository.get_revision(revid)
835
except errors.NoSuchRevision:
837
tree = self.tree_cache.revision_tree(revid)
838
for path, obj in self._revision_to_objects(
839
rev, tree, lossy=lossy):
840
ret.add(obj.id, path)
845
def add_thin_pack(self):
848
fd, path = tempfile.mkstemp(suffix=".pack")
849
f = os.fdopen(fd, 'wb')
852
from .fetch import import_git_objects
855
if os.path.getsize(path) == 0:
858
pd.create_index_v2(path[:-5] + ".idx", self.object_store.get_raw)
861
with self.repository.lock_write():
862
self.repository.start_write_group()
864
import_git_objects(self.repository, self.mapping,
865
p.iterobjects(get_raw=self.get_raw),
867
except BaseException:
868
self.repository.abort_write_group()
871
self.repository.commit_write_group()
874
# The pack isn't kept around anyway, so no point
875
# in treating full packs different from thin packs
876
add_pack = add_thin_pack