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
tree = self._cache[revid]
78
tree = self.repository.revision_tree(revid)
80
assert tree.get_revision_id() == tree.inventory.revision_id
83
def iter_revision_trees(self, revids):
88
tree = self._cache[revid]
92
assert tree.get_revision_id() == revid
93
assert tree.inventory.revision_id == revid
95
for tree in self.repository.revision_trees(todo):
96
trees[tree.get_revision_id()] = tree
98
return (trees[r] for r in revids)
100
def revision_trees(self, revids):
101
return list(self.iter_revision_trees(revids))
104
self._cache.add(tree.get_revision_id(), tree)
107
def _find_missing_bzr_revids(get_parent_map, want, have):
108
"""Find the revisions that have to be pushed.
110
:param get_parent_map: Function that returns the parents for a sequence
112
:param want: Revisions the target wants
113
:param have: Revisions the target already has
114
:return: Set of revisions to fetch
116
pending = want - have
120
processed.update(pending)
121
next_map = get_parent_map(pending)
123
for item in next_map.iteritems():
127
next_pending.update(p for p in item[1] if p not in processed)
128
pending = next_pending
129
if NULL_REVISION in todo:
130
todo.remove(NULL_REVISION)
134
def _check_expected_sha(expected_sha, object):
135
"""Check whether an object matches an expected SHA.
137
:param expected_sha: None or expected SHA as either binary or as hex digest
138
:param object: Object to verify
140
if expected_sha is None:
142
if len(expected_sha) == 40:
143
if expected_sha != object.sha().hexdigest():
144
raise AssertionError("Invalid sha for %r: %s" % (object,
146
elif len(expected_sha) == 20:
147
if expected_sha != object.sha().digest():
148
raise AssertionError("Invalid sha for %r: %s" % (object,
149
sha_to_hex(expected_sha)))
151
raise AssertionError("Unknown length %d for %r" % (len(expected_sha),
155
def _tree_to_objects(tree, parent_trees, idmap, unusual_modes,
156
dummy_file_name=None):
157
"""Iterate over the objects that were introduced in a revision.
160
:param parent_trees: Parent revision trees
161
:param unusual_modes: Unusual file modes dictionary
162
:param dummy_file_name: File name to use for dummy files
163
in empty directories. None to skip empty directories
164
:return: Yields (path, object, ie) entries
170
base_tree = parent_trees[0]
171
other_parent_trees = parent_trees[1:]
173
base_tree = tree._repository.revision_tree(NULL_REVISION)
174
other_parent_trees = []
175
def find_unchanged_parent_ie(ie, parent_trees):
176
assert ie.kind in ("symlink", "file")
177
for ptree in parent_trees:
179
pie = ptree.inventory[ie.file_id]
180
except errors.NoSuchId:
183
if (pie.text_sha1 == ie.text_sha1 and
184
pie.kind == ie.kind and
185
pie.symlink_target == ie.symlink_target):
189
# Find all the changed blobs
190
for (file_id, path, changed_content, versioned, parent, name, kind,
191
executable) in tree.iter_changes(base_tree):
192
if kind[1] == "file":
193
ie = tree.inventory[file_id]
196
pie = find_unchanged_parent_ie(ie, other_parent_trees)
201
shamap[ie.file_id] = idmap.lookup_blob_id(
202
pie.file_id, pie.revision)
206
blob.data = tree.get_file_text(ie.file_id)
207
shamap[ie.file_id] = blob.id
208
if not file_id in shamap:
209
new_blobs.append((path[1], ie))
210
new_trees[posixpath.dirname(path[1])] = parent[1]
211
elif kind[1] == "symlink":
212
ie = tree.inventory[file_id]
214
blob = symlink_to_blob(ie)
215
shamap[file_id] = blob.id
217
find_unchanged_parent_ie(ie, other_parent_trees)
219
yield path[1], blob, ie
220
new_trees[posixpath.dirname(path[1])] = parent[1]
221
elif kind[1] not in (None, "directory"):
222
raise AssertionError(kind[1])
223
if (path[0] not in (None, "") and
224
parent[0] in tree.inventory and
225
tree.inventory[parent[0]].kind == "directory"):
227
new_trees[posixpath.dirname(path[0])] = parent[0]
229
# Fetch contents of the blobs that were changed
230
for (path, ie), chunks in tree.iter_files_bytes(
231
[(ie.file_id, (path, ie)) for (path, ie) in new_blobs]):
235
shamap[ie.file_id] = obj.id
237
for path in unusual_modes:
238
parent_path = posixpath.dirname(path)
239
new_trees[parent_path] = tree.path2id(parent_path)
243
items = new_trees.items()
245
for path, file_id in items:
246
parent_id = tree.inventory[file_id].parent_id
247
if parent_id is not None:
248
parent_path = urlutils.dirname(path)
249
new_trees[parent_path] = parent_id
250
trees[path] = file_id
252
def ie_to_hexsha(ie):
254
return shamap[ie.file_id]
256
# FIXME: Should be the same as in parent
257
if ie.kind in ("file", "symlink"):
259
return idmap.lookup_blob_id(ie.file_id, ie.revision)
263
blob.data = tree.get_file_text(ie.file_id)
265
elif ie.kind == "directory":
266
# Not all cache backends store the tree information,
267
# calculate again from scratch
268
ret = directory_to_tree(ie, ie_to_hexsha, unusual_modes,
276
for path in sorted(trees.keys(), reverse=True):
277
ie = tree.inventory[trees[path]]
278
assert ie.kind == "directory"
279
obj = directory_to_tree(ie, ie_to_hexsha, unusual_modes,
283
shamap[ie.file_id] = obj.id
286
class BazaarObjectStore(BaseObjectStore):
287
"""A Git-style object store backed onto a Bazaar repository."""
289
def __init__(self, repository, mapping=None):
290
self.repository = repository
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
graph = self.repository.get_graph()
304
if stop_revision is None:
305
heads = graph.heads(self.repository.all_revision_ids())
307
heads = set([stop_revision])
308
missing_revids = self._cache.idmap.missing_revisions(heads)
310
parents = graph.get_parent_map(heads)
312
for p in parents.values():
313
todo.update([x for x in p if x not in missing_revids])
314
heads = self._cache.idmap.missing_revisions(todo)
315
missing_revids.update(heads)
316
if NULL_REVISION in missing_revids:
317
missing_revids.remove(NULL_REVISION)
318
missing_revids = self.repository.has_revisions(missing_revids)
319
if not missing_revids:
321
self.start_write_group()
323
pb = ui.ui_factory.nested_progress_bar()
325
for i, revid in enumerate(graph.iter_topo_order(missing_revids)):
326
trace.mutter('processing %r', revid)
327
pb.update("updating git map", i, len(missing_revids))
328
self._update_sha_map_revision(revid)
332
self.abort_write_group()
335
self.commit_write_group()
338
self._update_sha_map()
339
return iter(self._cache.idmap.sha1s())
341
def _reconstruct_commit(self, rev, tree_sha, roundtrip):
342
def parent_lookup(revid):
344
return self._lookup_revision_sha1(revid)
345
except errors.NoSuchRevision:
347
return self.mapping.export_commit(rev, tree_sha, parent_lookup,
350
def _create_fileid_map_blob(self, inv):
351
# FIXME: This can probably be a lot more efficient,
352
# not all files necessarily have to be processed.
354
for (path, ie) in inv.iter_entries():
355
if self.mapping.generate_file_id(path) != ie.file_id:
356
file_ids[path] = ie.file_id
357
return self.mapping.export_fileid_map(file_ids)
359
def _revision_to_objects(self, rev, tree, roundtrip):
360
"""Convert a revision to a set of git objects.
362
:param rev: Bazaar revision object
363
:param tree: Bazaar revision tree
364
:param roundtrip: Whether to roundtrip all Bazaar revision data
366
unusual_modes = extract_unusual_modes(rev)
367
present_parents = self.repository.has_revisions(rev.parent_ids)
368
parent_trees = self.tree_cache.revision_trees(
369
[p for p in rev.parent_ids if p in present_parents])
371
for path, obj, ie in _tree_to_objects(tree, parent_trees,
372
self._cache.idmap, unusual_modes, self.mapping.BZR_DUMMY_FILE):
376
# Don't yield just yet
379
if root_tree is None:
380
# Pointless commit - get the tree sha elsewhere
381
if not rev.parent_ids:
384
base_sha1 = self._lookup_revision_sha1(rev.parent_ids[0])
385
root_tree = self[self[base_sha1].tree]
386
root_ie = tree.inventory.root
387
if roundtrip and self.mapping.BZR_FILE_IDS_FILE is not None:
388
b = self._create_fileid_map_blob(tree.inventory)
390
root_tree[self.mapping.BZR_FILE_IDS_FILE] = ((stat.S_IFREG | 0644), b.id)
391
yield self.mapping.BZR_FILE_IDS_FILE, b, None
392
yield "", root_tree, root_ie
393
commit_obj = self._reconstruct_commit(rev, root_tree.id,
396
foreign_revid, mapping = mapping_registry.parse_revision_id(
398
except errors.InvalidRevisionId:
401
_check_expected_sha(foreign_revid, commit_obj)
402
yield None, commit_obj, None
404
def _get_updater(self, rev):
405
return self._cache.get_updater(rev)
407
def _update_sha_map_revision(self, revid):
408
rev = self.repository.get_revision(revid)
409
tree = self.tree_cache.revision_tree(rev.revision_id)
410
updater = self._get_updater(rev)
411
for path, obj, ie in self._revision_to_objects(rev, tree,
413
updater.add_object(obj, ie, path)
414
commit_obj = updater.finish()
417
def _reconstruct_blobs(self, keys):
418
"""Return a Git Blob object from a fileid and revision stored in bzr.
420
:param fileid: File id of the text
421
:param revision: Revision of the text
423
stream = self.repository.iter_files_bytes(
424
((key[0], key[1], key) for key in keys))
425
for (fileid, revision, expected_sha), chunks in stream:
427
blob.chunked = chunks
428
if blob.id != expected_sha and blob.data == "":
429
# Perhaps it's a symlink ?
430
tree = self.tree_cache.revision_tree(revision)
431
entry = tree.inventory[fileid]
432
if entry.kind == 'symlink':
433
blob = symlink_to_blob(entry)
434
_check_expected_sha(expected_sha, blob)
437
def _reconstruct_tree(self, fileid, revid, inv, unusual_modes,
439
"""Return a Git Tree object from a file id and a revision stored in bzr.
441
:param fileid: fileid in the tree.
442
:param revision: Revision of the tree.
444
def get_ie_sha1(entry):
445
if entry.kind == "directory":
447
return self._cache.idmap.lookup_tree_id(entry.file_id,
449
except (NotImplementedError, KeyError):
450
obj = self._reconstruct_tree(entry.file_id, revid, inv,
456
elif entry.kind in ("file", "symlink"):
458
return self._cache.idmap.lookup_blob_id(entry.file_id,
462
return self._reconstruct_blobs(
463
[(entry.file_id, entry.revision, None)]).next().id
465
raise AssertionError("unknown entry kind '%s'" % entry.kind)
466
tree = directory_to_tree(inv[fileid], get_ie_sha1, unusual_modes,
467
self.mapping.BZR_DUMMY_FILE)
468
if (inv.root.file_id == fileid and
469
self.mapping.BZR_FILE_IDS_FILE is not None):
470
b = self._create_fileid_map_blob(inv)
471
# If this is the root tree, add the file ids
472
tree[self.mapping.BZR_FILE_IDS_FILE] = ((stat.S_IFREG | 0644), b.id)
473
_check_expected_sha(expected_sha, tree)
476
def get_parents(self, sha):
477
"""Retrieve the parents of a Git commit by SHA1.
479
:param sha: SHA1 of the commit
480
:raises: KeyError, NotCommitError
482
return self[sha].parents
484
def _lookup_revision_sha1(self, revid):
485
"""Return the SHA1 matching a Bazaar revision."""
486
from dulwich.protocol import ZERO_SHA
487
if revid == NULL_REVISION:
490
return self._cache.idmap.lookup_commit(revid)
493
return mapping_registry.parse_revision_id(revid)[0]
494
except errors.InvalidRevisionId:
495
self.repository.lock_read()
497
self._update_sha_map(revid)
499
self.repository.unlock()
500
return self._cache.idmap.lookup_commit(revid)
502
def get_raw(self, sha):
503
"""Get the raw representation of a Git object by SHA1.
505
:param sha: SHA1 of the git object
508
return (obj.type, obj.as_raw_string())
510
def __contains__(self, sha):
511
# See if sha is in map
513
(type, type_data) = self.lookup_git_sha(sha)
515
return self.repository.has_revision(type_data[0])
517
return self.repository.texts.has_key(type_data)
519
return self.repository.has_revision(type_data[1])
521
raise AssertionError("Unknown object type '%s'" % type)
525
def lookup_git_shas(self, shas, update_map=True):
526
from dulwich.protocol import ZERO_SHA
530
ret[sha] = ("commit", (NULL_REVISION, None))
533
ret[sha] = self._cache.idmap.lookup_git_sha(sha)
536
# if not, see if there are any unconverted revisions and add
537
# them to the map, search for sha in map again
538
self._update_sha_map()
541
ret[sha] = self._cache.idmap.lookup_git_sha(sha)
546
def lookup_git_sha(self, sha, update_map=True):
547
return self.lookup_git_shas([sha], update_map=update_map)[sha]
549
def __getitem__(self, sha):
550
if self._cache.content_cache is not None:
552
return self._cache.content_cache[sha]
555
(type, type_data) = self.lookup_git_sha(sha)
556
# convert object to git object
558
(revid, tree_sha) = type_data
560
rev = self.repository.get_revision(revid)
561
except errors.NoSuchRevision:
562
trace.mutter('entry for %s %s in shamap: %r, but not found in '
563
'repository', type, sha, type_data)
565
commit = self._reconstruct_commit(rev, tree_sha, roundtrip=True)
566
_check_expected_sha(sha, commit)
569
(fileid, revision) = type_data
570
return self._reconstruct_blobs([(fileid, revision, sha)]).next()
572
(fileid, revid) = type_data
574
tree = self.tree_cache.revision_tree(revid)
575
rev = self.repository.get_revision(revid)
576
except errors.NoSuchRevision:
577
trace.mutter('entry for %s %s in shamap: %r, but not found in repository', type, sha, type_data)
579
unusual_modes = extract_unusual_modes(rev)
581
return self._reconstruct_tree(fileid, revid, tree.inventory,
582
unusual_modes, expected_sha=sha)
583
except errors.NoSuchRevision:
586
raise AssertionError("Unknown object type '%s'" % type)
588
def generate_lossy_pack_contents(self, have, want, progress=None,
590
return self.generate_pack_contents(have, want, progress, get_tagged,
593
def generate_pack_contents(self, have, want, progress=None,
594
get_tagged=None, lossy=False):
595
"""Iterate over the contents of a pack file.
597
:param have: List of SHA1s of objects that should not be sent
598
:param want: List of SHA1s of objects that should be sent
601
ret = self.lookup_git_shas(have + want)
602
for commit_sha in have:
604
(type, (revid, tree_sha)) = ret[commit_sha]
608
assert type == "commit"
611
for commit_sha in want:
612
if commit_sha in have:
615
(type, (revid, tree_sha)) = ret[commit_sha]
619
assert type == "commit"
622
todo = _find_missing_bzr_revids(self.repository.get_parent_map,
624
trace.mutter('sending revisions %r', todo)
626
pb = ui.ui_factory.nested_progress_bar()
628
for i, revid in enumerate(todo):
629
pb.update("generating git objects", i, len(todo))
630
rev = self.repository.get_revision(revid)
631
tree = self.tree_cache.revision_tree(revid)
632
for path, obj, ie in self._revision_to_objects(rev, tree,
633
roundtrip=not lossy):
634
ret.append((obj, path))
639
def add_thin_pack(self):
642
fd, path = tempfile.mkstemp(suffix=".pack")
643
f = os.fdopen(fd, 'wb')
645
from dulwich.pack import PackData, Pack
646
from bzrlib.plugins.git.fetch import import_git_objects
649
if os.path.getsize(path) == 0:
652
pd.create_index_v2(path[:-5]+".idx", self.object_store.get_raw)
655
self.repository.lock_write()
657
self.repository.start_write_group()
659
import_git_objects(self.repository, self.mapping,
660
p.iterobjects(get_raw=self.get_raw),
663
self.repository.abort_write_group()
666
self.repository.commit_write_group()
668
self.repository.unlock()
671
# The pack isn't kept around anyway, so no point
672
# in treating full packs different from thin packs
673
add_pack = add_thin_pack