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 (
24
from dulwich.object_store import (
35
from bzrlib.revision import (
39
from bzrlib.plugins.git.mapping import (
42
extract_unusual_modes,
46
from bzrlib.plugins.git.cache import (
47
from_repository as cache_from_repository,
54
def get_object_store(repo, mapping=None):
55
git = getattr(repo, "_git", None)
57
return git.object_store
58
return BazaarObjectStore(repo, mapping)
61
MAX_TREE_CACHE_SIZE = 50 * 1024 * 1024
64
class LRUTreeCache(object):
66
def __init__(self, repository):
67
def approx_tree_size(tree):
68
# Very rough estimate, 1k per inventory entry
69
return len(tree.inventory) * 1024
70
self.repository = repository
71
self._cache = lru_cache.LRUSizeCache(max_size=MAX_TREE_CACHE_SIZE,
72
after_cleanup_size=None, compute_size=approx_tree_size)
74
def revision_tree(self, revid):
76
return self._cache[revid]
78
tree = self.repository.revision_tree(revid)
82
def iter_revision_trees(self, revids):
83
trees = dict([(k, self._cache.get(k)) for k in revids])
84
for tree in self.repository.revision_trees(
85
[r for r, v in trees.iteritems() if v is None]):
86
trees[tree.get_revision_id()] = tree
88
return (trees[r] for r in revids)
90
def revision_trees(self, revids):
91
return list(self.iter_revision_trees(revids))
94
self._cache.add(tree.get_revision_id(), tree)
97
def _find_missing_bzr_revids(get_parent_map, want, have):
98
"""Find the revisions that have to be pushed.
100
:param get_parent_map: Function that returns the parents for a sequence
102
:param want: Revisions the target wants
103
:param have: Revisions the target already has
104
:return: Set of revisions to fetch
106
pending = want - have
110
processed.update(pending)
111
next_map = get_parent_map(pending)
113
for item in next_map.iteritems():
117
next_pending.update(p for p in item[1] if p not in processed)
118
pending = next_pending
119
if NULL_REVISION in todo:
120
todo.remove(NULL_REVISION)
124
def _check_expected_sha(expected_sha, object):
125
"""Check whether an object matches an expected SHA.
127
:param expected_sha: None or expected SHA as either binary or as hex digest
128
:param object: Object to verify
130
if expected_sha is None:
132
if len(expected_sha) == 40:
133
if expected_sha != object.sha().hexdigest():
134
raise AssertionError("Invalid sha for %r: %s" % (object,
136
elif len(expected_sha) == 20:
137
if expected_sha != object.sha().digest():
138
raise AssertionError("Invalid sha for %r: %s" % (object,
139
sha_to_hex(expected_sha)))
141
raise AssertionError("Unknown length %d for %r" % (len(expected_sha),
145
def _tree_to_objects(tree, parent_trees, idmap, unusual_modes,
146
dummy_file_name=None):
147
"""Iterate over the objects that were introduced in a revision.
150
:param parent_trees: Parent revision trees
151
:param unusual_modes: Unusual file modes dictionary
152
:param dummy_file_name: File name to use for dummy files
153
in empty directories. None to skip empty directories
154
:return: Yields (path, object, ie) entries
160
base_tree = parent_trees[0]
161
other_parent_trees = parent_trees[1:]
163
base_tree = tree._repository.revision_tree(NULL_REVISION)
164
other_parent_trees = []
165
def find_unchanged_parent_ie(ie, parent_trees):
166
assert ie.kind in ("symlink", "file")
167
for ptree in parent_trees:
169
pie = ptree.inventory[ie.file_id]
170
except errors.NoSuchId:
173
if (pie.text_sha1 == ie.text_sha1 and
174
pie.kind == ie.kind and
175
pie.symlink_target == ie.symlink_target):
179
# Find all the changed blobs
180
for (file_id, path, changed_content, versioned, parent, name, kind,
181
executable) in tree.iter_changes(base_tree):
182
if kind[1] == "file":
183
ie = tree.inventory[file_id]
186
pie = find_unchanged_parent_ie(ie, other_parent_trees)
191
shamap[ie.file_id] = idmap.lookup_blob_id(
192
pie.file_id, pie.revision)
196
blob.data = tree.get_file_text(ie.file_id)
197
shamap[ie.file_id] = blob.id
198
if not file_id in shamap:
199
new_blobs.append((path[1], ie))
200
new_trees[posixpath.dirname(path[1])] = parent[1]
201
elif kind[1] == "symlink":
202
ie = tree.inventory[file_id]
204
blob = symlink_to_blob(ie)
205
shamap[file_id] = blob.id
207
find_unchanged_parent_ie(ie, other_parent_trees)
209
yield path[1], blob, ie
210
new_trees[posixpath.dirname(path[1])] = parent[1]
211
elif kind[1] not in (None, "directory"):
212
raise AssertionError(kind[1])
213
if path[0] is not None and parent[0] in tree.inventory and tree.inventory[parent[0]].kind == "directory":
215
new_trees[posixpath.dirname(path[0])] = parent[0]
217
# Fetch contents of the blobs that were changed
218
for (path, ie), chunks in tree.iter_files_bytes(
219
[(ie.file_id, (path, ie)) for (path, ie) in new_blobs]):
223
shamap[ie.file_id] = obj.id
225
for path in unusual_modes:
226
parent_path = posixpath.dirname(path)
227
new_trees[parent_path] = tree.path2id(parent_path)
231
items = new_trees.items()
233
for path, file_id in items:
234
parent_id = tree.inventory[file_id].parent_id
235
if parent_id is not None:
236
parent_path = urlutils.dirname(path)
237
new_trees[parent_path] = parent_id
238
trees[path] = file_id
240
def ie_to_hexsha(ie):
242
return shamap[ie.file_id]
244
# FIXME: Should be the same as in parent
245
if ie.kind in ("file", "symlink"):
247
return idmap.lookup_blob_id(ie.file_id, ie.revision)
251
blob.data = tree.get_file_text(ie.file_id)
253
elif ie.kind == "directory":
254
# Not all cache backends store the tree information,
255
# calculate again from scratch
256
ret = directory_to_tree(ie, ie_to_hexsha, unusual_modes,
264
for path in sorted(trees.keys(), reverse=True):
265
ie = tree.inventory[trees[path]]
266
assert ie.kind == "directory"
267
obj = directory_to_tree(ie, ie_to_hexsha, unusual_modes,
271
shamap[ie.file_id] = obj.id
274
class BazaarObjectStore(BaseObjectStore):
275
"""A Git-style object store backed onto a Bazaar repository."""
277
def __init__(self, repository, mapping=None):
278
self.repository = repository
280
self.mapping = default_mapping
282
self.mapping = mapping
283
self._cache = cache_from_repository(repository)
284
self._content_cache_types = ("tree")
285
self.start_write_group = self._cache.idmap.start_write_group
286
self.abort_write_group = self._cache.idmap.abort_write_group
287
self.commit_write_group = self._cache.idmap.commit_write_group
288
self.tree_cache = LRUTreeCache(self.repository)
290
def _update_sha_map(self, stop_revision=None):
291
graph = self.repository.get_graph()
292
if stop_revision is None:
293
heads = graph.heads(self.repository.all_revision_ids())
295
heads = set([stop_revision])
296
missing_revids = self._cache.idmap.missing_revisions(heads)
298
parents = graph.get_parent_map(heads)
300
for p in parents.values():
301
todo.update([x for x in p if x not in missing_revids])
302
heads = self._cache.idmap.missing_revisions(todo)
303
missing_revids.update(heads)
304
if NULL_REVISION in missing_revids:
305
missing_revids.remove(NULL_REVISION)
306
missing_revids = self.repository.has_revisions(missing_revids)
307
if not missing_revids:
309
self.start_write_group()
311
pb = ui.ui_factory.nested_progress_bar()
313
for i, revid in enumerate(graph.iter_topo_order(missing_revids)):
314
trace.mutter('processing %r', revid)
315
pb.update("updating git map", i, len(missing_revids))
316
self._update_sha_map_revision(revid)
320
self.abort_write_group()
323
self.commit_write_group()
326
self._update_sha_map()
327
return iter(self._cache.idmap.sha1s())
329
def _reconstruct_commit(self, rev, tree_sha, roundtrip):
330
def parent_lookup(revid):
332
return self._lookup_revision_sha1(revid)
333
except errors.NoSuchRevision:
335
return self.mapping.export_commit(rev, tree_sha, parent_lookup,
338
def _create_fileid_map_blob(self, inv):
339
# FIXME: This can probably be a lot more efficient,
340
# not all files necessarily have to be processed.
342
for (path, ie) in inv.iter_entries():
343
if self.mapping.generate_file_id(path) != ie.file_id:
344
file_ids[path] = ie.file_id
345
return self.mapping.export_fileid_map(file_ids)
347
def _revision_to_objects(self, rev, tree, roundtrip):
348
"""Convert a revision to a set of git objects.
350
:param rev: Bazaar revision object
351
:param tree: Bazaar revision tree
352
:param roundtrip: Whether to roundtrip all Bazaar revision data
354
unusual_modes = extract_unusual_modes(rev)
355
present_parents = self.repository.has_revisions(rev.parent_ids)
356
parent_trees = self.tree_cache.revision_trees(
357
[p for p in rev.parent_ids if p in present_parents])
359
for path, obj, ie in _tree_to_objects(tree, parent_trees,
360
self._cache.idmap, unusual_modes, self.mapping.BZR_DUMMY_FILE):
364
# Don't yield just yet
367
if root_tree is None:
368
# Pointless commit - get the tree sha elsewhere
369
if not rev.parent_ids:
372
base_sha1 = self._lookup_revision_sha1(rev.parent_ids[0])
373
root_tree = self[self[base_sha1].tree]
374
root_ie = tree.inventory.root
375
if roundtrip and self.mapping.BZR_FILE_IDS_FILE is not None:
376
b = self._create_fileid_map_blob(tree.inventory)
378
root_tree[self.mapping.BZR_FILE_IDS_FILE] = ((stat.S_IFREG | 0644), b.id)
379
yield self.mapping.BZR_FILE_IDS_FILE, b, None
380
yield "", root_tree, root_ie
381
commit_obj = self._reconstruct_commit(rev, root_tree.id,
384
foreign_revid, mapping = mapping_registry.parse_revision_id(
386
except errors.InvalidRevisionId:
389
_check_expected_sha(foreign_revid, commit_obj)
390
yield None, commit_obj, None
392
def _get_updater(self, rev):
393
return self._cache.get_updater(rev)
395
def _update_sha_map_revision(self, revid):
396
rev = self.repository.get_revision(revid)
397
tree = self.tree_cache.revision_tree(rev.revision_id)
398
updater = self._get_updater(rev)
399
for path, obj, ie in self._revision_to_objects(rev, tree,
401
updater.add_object(obj, ie, path)
402
commit_obj = updater.finish()
405
def _reconstruct_blobs(self, keys):
406
"""Return a Git Blob object from a fileid and revision stored in bzr.
408
:param fileid: File id of the text
409
:param revision: Revision of the text
411
stream = self.repository.iter_files_bytes(
412
((key[0], key[1], key) for key in keys))
413
for (fileid, revision, expected_sha), chunks in stream:
415
blob.chunked = chunks
416
if blob.id != expected_sha and blob.data == "":
417
# Perhaps it's a symlink ?
418
tree = self.tree_cache.revision_tree(revision)
419
entry = tree.inventory[fileid]
420
if entry.kind == 'symlink':
421
blob = symlink_to_blob(entry)
422
_check_expected_sha(expected_sha, blob)
425
def _reconstruct_tree(self, fileid, revid, inv, unusual_modes,
427
"""Return a Git Tree object from a file id and a revision stored in bzr.
429
:param fileid: fileid in the tree.
430
:param revision: Revision of the tree.
432
def get_ie_sha1(entry):
433
if entry.kind == "directory":
435
return self._cache.idmap.lookup_tree_id(entry.file_id,
437
except (NotImplementedError, KeyError):
438
obj = self._reconstruct_tree(entry.file_id, revid, inv,
444
elif entry.kind in ("file", "symlink"):
446
return self._cache.idmap.lookup_blob_id(entry.file_id,
450
return self._reconstruct_blobs(
451
[(entry.file_id, entry.revision, None)]).next().id
453
raise AssertionError("unknown entry kind '%s'" % entry.kind)
454
tree = directory_to_tree(inv[fileid], get_ie_sha1, unusual_modes,
455
self.mapping.BZR_DUMMY_FILE)
456
if (inv.root.file_id == fileid and
457
self.mapping.BZR_FILE_IDS_FILE is not None):
458
b = self._create_fileid_map_blob(inv)
459
# If this is the root tree, add the file ids
460
tree[self.mapping.BZR_FILE_IDS_FILE] = ((stat.S_IFREG | 0644), b.id)
461
_check_expected_sha(expected_sha, tree)
464
def get_parents(self, sha):
465
"""Retrieve the parents of a Git commit by SHA1.
467
:param sha: SHA1 of the commit
468
:raises: KeyError, NotCommitError
470
return self[sha].parents
472
def _lookup_revision_sha1(self, revid):
473
"""Return the SHA1 matching a Bazaar revision."""
474
from dulwich.protocol import ZERO_SHA
475
if revid == NULL_REVISION:
478
return self._cache.idmap.lookup_commit(revid)
481
return mapping_registry.parse_revision_id(revid)[0]
482
except errors.InvalidRevisionId:
483
self.repository.lock_read()
485
self._update_sha_map(revid)
487
self.repository.unlock()
488
return self._cache.idmap.lookup_commit(revid)
490
def get_raw(self, sha):
491
"""Get the raw representation of a Git object by SHA1.
493
:param sha: SHA1 of the git object
496
return (obj.type, obj.as_raw_string())
498
def __contains__(self, sha):
499
# See if sha is in map
501
(type, type_data) = self.lookup_git_sha(sha)
503
return self.repository.has_revision(type_data[0])
505
return self.repository.texts.has_key(type_data)
507
return self.repository.has_revision(type_data[1])
509
raise AssertionError("Unknown object type '%s'" % type)
513
def lookup_git_shas(self, shas, update_map=True):
514
from dulwich.protocol import ZERO_SHA
518
ret[sha] = NULL_REVISION
521
ret[sha] = self._cache.idmap.lookup_git_sha(sha)
524
# if not, see if there are any unconverted revisions and add
525
# them to the map, search for sha in map again
526
self._update_sha_map()
529
ret[sha] = self._cache.idmap.lookup_git_sha(sha)
534
def lookup_git_sha(self, sha, update_map=True):
535
return self.lookup_git_shas([sha], update_map=update_map)[sha]
537
def __getitem__(self, sha):
538
if self._cache.content_cache is not None:
540
return self._cache.content_cache[sha]
543
(type, type_data) = self.lookup_git_sha(sha)
544
# convert object to git object
546
(revid, tree_sha) = type_data
548
rev = self.repository.get_revision(revid)
549
except errors.NoSuchRevision:
550
trace.mutter('entry for %s %s in shamap: %r, but not found in '
551
'repository', type, sha, type_data)
553
commit = self._reconstruct_commit(rev, tree_sha, roundtrip=True)
554
_check_expected_sha(sha, commit)
557
(fileid, revision) = type_data
558
return self._reconstruct_blobs([(fileid, revision, sha)]).next()
560
(fileid, revid) = type_data
562
tree = self.tree_cache.revision_tree(revid)
563
rev = self.repository.get_revision(revid)
564
except errors.NoSuchRevision:
565
trace.mutter('entry for %s %s in shamap: %r, but not found in repository', type, sha, type_data)
567
unusual_modes = extract_unusual_modes(rev)
569
return self._reconstruct_tree(fileid, revid, tree.inventory,
570
unusual_modes, expected_sha=sha)
571
except errors.NoSuchRevision:
574
raise AssertionError("Unknown object type '%s'" % type)
576
def generate_lossy_pack_contents(self, have, want, progress=None,
578
return self.generate_pack_contents(have, want, progress, get_tagged,
581
def generate_pack_contents(self, have, want, progress=None,
582
get_tagged=None, lossy=False):
583
"""Iterate over the contents of a pack file.
585
:param have: List of SHA1s of objects that should not be sent
586
:param want: List of SHA1s of objects that should be sent
589
ret = self.lookup_git_shas(have + want)
590
for commit_sha in have:
592
(type, (revid, tree_sha)) = ret[commit_sha]
596
assert type == "commit"
599
for commit_sha in want:
600
if commit_sha in have:
603
(type, (revid, tree_sha)) = ret[commit_sha]
607
assert type == "commit"
610
todo = _find_missing_bzr_revids(self.repository.get_parent_map,
612
trace.mutter('sending revisions %r', todo)
614
pb = ui.ui_factory.nested_progress_bar()
616
for i, revid in enumerate(todo):
617
pb.update("generating git objects", i, len(todo))
618
rev = self.repository.get_revision(revid)
619
tree = self.tree_cache.revision_tree(revid)
620
for path, obj, ie in self._revision_to_objects(rev, tree,
621
roundtrip=not lossy):
622
ret.append((obj, path))
627
def add_thin_pack(self):
630
fd, path = tempfile.mkstemp(suffix=".pack")
631
f = os.fdopen(fd, 'wb')
633
from dulwich.pack import PackData, Pack
634
from bzrlib.plugins.git.fetch import import_git_objects
637
if os.path.getsize(path) == 0:
640
pd.create_index_v2(path[:-5]+".idx", self.object_store.get_raw)
643
self.repository.lock_write()
645
self.repository.start_write_group()
647
import_git_objects(self.repository, self.mapping,
648
p.iterobjects(get_raw=self.get_raw),
651
self.repository.abort_write_group()
654
self.repository.commit_write_group()
656
self.repository.unlock()
659
# The pack isn't kept around anyway, so no point
660
# in treating full packs different from thin packs
661
add_pack = add_thin_pack