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.shamap import (
47
from_repository as cache_from_repository,
51
def get_object_store(repo, mapping=None):
52
git = getattr(repo, "_git", None)
54
return git.object_store
55
return BazaarObjectStore(repo, mapping)
58
MAX_TREE_CACHE_SIZE = 50 * 1024 * 1024
61
class LRUTreeCache(object):
63
def __init__(self, repository):
64
def approx_tree_size(tree):
65
# Very rough estimate, 1k per inventory entry
66
return len(tree.inventory) * 1024
67
self.repository = repository
68
self._cache = lru_cache.LRUSizeCache(max_size=MAX_TREE_CACHE_SIZE,
69
after_cleanup_size=None, compute_size=approx_tree_size)
71
def revision_tree(self, revid):
73
return self._cache[revid]
75
tree = self.repository.revision_tree(revid)
79
def iter_revision_trees(self, revids):
80
trees = dict([(k, self._cache.get(k)) for k in revids])
81
for tree in self.repository.revision_trees(
82
[r for r, v in trees.iteritems() if v is None]):
83
trees[tree.get_revision_id()] = tree
85
return (trees[r] for r in revids)
87
def revision_trees(self, revids):
88
return list(self.iter_revision_trees(revids))
91
self._cache.add(tree.get_revision_id(), tree)
94
def _check_expected_sha(expected_sha, object):
95
"""Check whether an object matches an expected SHA.
97
:param expected_sha: None or expected SHA as either binary or as hex digest
98
:param object: Object to verify
100
if expected_sha is None:
102
if len(expected_sha) == 40:
103
if expected_sha != object.sha().hexdigest():
104
raise AssertionError("Invalid sha for %r: %s" % (object,
106
elif len(expected_sha) == 20:
107
if expected_sha != object.sha().digest():
108
raise AssertionError("Invalid sha for %r: %s" % (object,
109
sha_to_hex(expected_sha)))
111
raise AssertionError("Unknown length %d for %r" % (len(expected_sha),
115
def _tree_to_objects(tree, parent_trees, idmap,
116
unusual_modes, iter_files_bytes, has_ghost_parents):
117
"""Iterate over the objects that were introduced in a revision.
120
:param unusual_modes: Unusual file modes
121
:param iter_files_bytes: Repository.iter_files_bytes-like callback
122
:return: Yields (path, object, ie) entries
125
parent_invs = [t.inventory for t in parent_trees]
129
for path, ie in inv.entries():
130
if ie.kind == "file":
131
if ie.revision != inv.revision_id:
132
for pinv in parent_invs:
134
pie = pinv[ie.file_id]
135
except errors.NoSuchId:
138
if (pie.text_sha1 == ie.text_sha1 and
139
pie.kind == ie.kind):
140
shamap[ie.file_id] = idmap.lookup_blob_id(
141
pie.file_id, pie.revision)
143
if not ie.file_id in shamap:
144
new_blobs.append((path, ie))
145
new_trees[urlutils.dirname(path)] = ie.parent_id
146
elif ie.kind == "symlink":
147
blob = symlink_to_blob(ie)
148
for pinv in parent_invs:
150
pie = pinv[ie.file_id]
151
except errors.NoSuchId:
154
if (ie.kind == pie.kind and
155
ie.symlink_target == pie.symlink_target):
159
new_trees[urlutils.dirname(path)] = ie.parent_id
160
shamap[ie.file_id] = blob.id
161
elif ie.kind == "directory":
162
for pinv in parent_invs:
164
pie = pinv[ie.file_id]
165
except errors.NoSuchId:
168
if (pie.kind == ie.kind and
169
pie.children.keys() == ie.children.keys()):
171
shamap[ie.file_id] = idmap.lookup_tree_id(
172
ie.file_id, inv.revision_id)
173
except (NotImplementedError, KeyError):
178
new_trees[path] = ie.file_id
180
raise AssertionError(ie.kind)
182
for (path, ie), chunks in iter_files_bytes(
183
[(ie.file_id, ie.revision, (path, ie))
184
for (path, ie) in new_blobs]):
188
shamap[ie.file_id] = obj.id
190
for fid in unusual_modes:
191
new_trees[inv.id2path(fid)] = inv[fid].parent_id
195
items = new_trees.items()
197
for path, file_id in items:
198
parent_id = inv[file_id].parent_id
199
if parent_id is not None:
200
parent_path = urlutils.dirname(path)
201
new_trees[parent_path] = parent_id
202
trees[path] = file_id
204
def ie_to_hexsha(ie):
206
return shamap[ie.file_id]
208
# Not all cache backends store the tree information,
209
# calculate again from scratch
210
ret = directory_to_tree(ie, ie_to_hexsha, unusual_modes)
215
for path in sorted(trees.keys(), reverse=True):
216
ie = inv[trees[path]]
217
assert ie.kind == "directory"
218
obj = directory_to_tree(ie, ie_to_hexsha, unusual_modes)
221
shamap[ie.file_id] = obj.id
224
class BazaarObjectStore(BaseObjectStore):
225
"""A Git-style object store backed onto a Bazaar repository."""
227
def __init__(self, repository, mapping=None):
228
self.repository = repository
230
self.mapping = default_mapping
232
self.mapping = mapping
233
self._cache = cache_from_repository(repository)
234
self._content_cache_types = ("tree")
235
self.start_write_group = self._cache.idmap.start_write_group
236
self.abort_write_group = self._cache.idmap.abort_write_group
237
self.commit_write_group = self._cache.idmap.commit_write_group
238
self.tree_cache = LRUTreeCache(self.repository)
240
def _update_sha_map(self, stop_revision=None):
241
graph = self.repository.get_graph()
242
if stop_revision is None:
243
heads = graph.heads(self.repository.all_revision_ids())
245
heads = set([stop_revision])
246
missing_revids = self._cache.idmap.missing_revisions(heads)
248
parents = graph.get_parent_map(heads)
250
for p in parents.values():
251
todo.update([x for x in p if x not in missing_revids])
252
heads = self._cache.idmap.missing_revisions(todo)
253
missing_revids.update(heads)
254
if NULL_REVISION in missing_revids:
255
missing_revids.remove(NULL_REVISION)
256
missing_revids = self.repository.has_revisions(missing_revids)
257
if not missing_revids:
259
self.start_write_group()
261
pb = ui.ui_factory.nested_progress_bar()
263
for i, revid in enumerate(graph.iter_topo_order(missing_revids)):
264
trace.mutter('processing %r', revid)
265
pb.update("updating git map", i, len(missing_revids))
266
self._update_sha_map_revision(revid)
270
self.abort_write_group()
273
self.commit_write_group()
276
self._update_sha_map()
277
return iter(self._cache.idmap.sha1s())
279
def _reconstruct_commit(self, rev, tree_sha):
280
def parent_lookup(revid):
282
return self._lookup_revision_sha1(revid)
283
except errors.NoSuchRevision:
284
trace.warning("Ignoring ghost parent %s", revid)
286
return self.mapping.export_commit(rev, tree_sha, parent_lookup)
288
def _revision_to_objects(self, rev, tree):
289
unusual_modes = extract_unusual_modes(rev)
290
present_parents = self.repository.has_revisions(rev.parent_ids)
291
has_ghost_parents = (len(rev.parent_ids) < len(present_parents))
292
parent_trees = self.tree_cache.revision_trees(
293
[p for p in rev.parent_ids if p in present_parents])
295
for path, obj, ie in _tree_to_objects(tree, parent_trees,
296
self._cache.idmap, unusual_modes,
297
self.repository.iter_files_bytes, has_ghost_parents):
302
if not rev.parent_ids:
306
commit_obj = self._reconstruct_commit(rev, tree_sha)
308
foreign_revid, mapping = mapping_registry.parse_revision_id(
310
except errors.InvalidRevisionId:
313
_check_expected_sha(foreign_revid, commit_obj)
314
yield None, commit_obj, None
316
def _get_updater(self, rev):
317
return self._cache.get_updater(rev)
319
def _update_sha_map_revision(self, revid):
320
rev = self.repository.get_revision(revid)
321
tree = self.tree_cache.revision_tree(rev.revision_id)
322
updater = self._get_updater(rev)
323
for path, obj, ie in self._revision_to_objects(rev, tree):
324
updater.add_object(obj, ie)
325
commit_obj = updater.finish()
328
def _reconstruct_blobs(self, keys):
329
"""Return a Git Blob object from a fileid and revision stored in bzr.
331
:param fileid: File id of the text
332
:param revision: Revision of the text
334
stream = self.repository.iter_files_bytes(((key[0], key[1], key) for key in keys))
335
for (fileid, revision, expected_sha), chunks in stream:
337
blob.chunked = chunks
338
if blob.id != expected_sha:
339
# Perhaps it's a symlink ?
340
tree = self.tree_cache.revision_tree(revision)
341
entry = tree.inventory[fileid]
342
assert entry.kind == 'symlink'
343
blob = symlink_to_blob(entry)
344
_check_expected_sha(expected_sha, blob)
347
def _reconstruct_tree(self, fileid, revid, inv, unusual_modes,
349
"""Return a Git Tree object from a file id and a revision stored in bzr.
351
:param fileid: fileid in the tree.
352
:param revision: Revision of the tree.
354
def get_ie_sha1(entry):
355
if entry.kind == "directory":
357
return self._cache.idmap.lookup_tree_id(entry.file_id,
359
except (NotImplementedError, KeyError):
360
obj = self._reconstruct_tree(entry.file_id, revid, inv,
366
elif entry.kind in ("file", "symlink"):
367
return self._cache.idmap.lookup_blob_id(entry.file_id,
370
raise AssertionError("unknown entry kind '%s'" % entry.kind)
371
tree = directory_to_tree(inv[fileid], get_ie_sha1, unusual_modes)
372
_check_expected_sha(expected_sha, tree)
375
def get_parents(self, sha):
376
"""Retrieve the parents of a Git commit by SHA1.
378
:param sha: SHA1 of the commit
379
:raises: KeyError, NotCommitError
381
return self[sha].parents
383
def _lookup_revision_sha1(self, revid):
384
"""Return the SHA1 matching a Bazaar revision."""
385
if revid == NULL_REVISION:
388
return self._cache.idmap.lookup_commit(revid)
391
return mapping_registry.parse_revision_id(revid)[0]
392
except errors.InvalidRevisionId:
393
self._update_sha_map(revid)
394
return self._cache.idmap.lookup_commit(revid)
396
def get_raw(self, sha):
397
"""Get the raw representation of a Git object by SHA1.
399
:param sha: SHA1 of the git object
402
return (obj.type, obj.as_raw_string())
404
def __contains__(self, sha):
405
# See if sha is in map
407
(type, type_data) = self._lookup_git_sha(sha)
409
return self.repository.has_revision(type_data[0])
411
return self.repository.texts.has_version(type_data)
413
return self.repository.has_revision(type_data[1])
415
raise AssertionError("Unknown object type '%s'" % type)
419
def _lookup_git_sha(self, sha):
420
# See if sha is in map
422
return self._cache.idmap.lookup_git_sha(sha)
424
# if not, see if there are any unconverted revisions and add them
425
# to the map, search for sha in map again
426
self._update_sha_map()
427
return self._cache.idmap.lookup_git_sha(sha)
429
def __getitem__(self, sha):
430
if self._cache.content_cache is not None:
432
return self._cache.content_cache[sha]
435
(type, type_data) = self._lookup_git_sha(sha)
436
# convert object to git object
438
(revid, tree_sha) = type_data
440
rev = self.repository.get_revision(revid)
441
except errors.NoSuchRevision:
442
trace.mutter('entry for %s %s in shamap: %r, but not found in '
443
'repository', type, sha, type_data)
445
commit = self._reconstruct_commit(rev, tree_sha)
446
_check_expected_sha(sha, commit)
449
(fileid, revision) = type_data
450
return self._reconstruct_blobs([(fileid, revision, sha)]).next()
452
(fileid, revid) = type_data
454
tree = self.tree_cache.revision_tree(revid)
455
rev = self.repository.get_revision(revid)
456
except errors.NoSuchRevision:
457
trace.mutter('entry for %s %s in shamap: %r, but not found in repository', type, sha, type_data)
459
unusual_modes = extract_unusual_modes(rev)
461
return self._reconstruct_tree(fileid, revid, tree.inventory,
462
unusual_modes, expected_sha=sha)
463
except errors.NoSuchRevision:
466
raise AssertionError("Unknown object type '%s'" % type)
468
def generate_pack_contents(self, have, want):
469
"""Iterate over the contents of a pack file.
471
:param have: List of SHA1s of objects that should not be sent
472
:param want: List of SHA1s of objects that should be sent
475
for commit_sha in have:
477
(type, (revid, tree_sha)) = self._lookup_git_sha(commit_sha)
481
assert type == "commit"
484
for commit_sha in want:
485
if commit_sha in have:
487
(type, (revid, tree_sha)) = self._lookup_git_sha(commit_sha)
488
assert type == "commit"
492
processed.update(pending)
493
next_map = self.repository.get_parent_map(pending)
495
for item in next_map.iteritems():
497
next_pending.update(p for p in item[1] if p not in processed)
498
pending = next_pending
499
if NULL_REVISION in todo:
500
todo.remove(NULL_REVISION)
501
trace.mutter('sending revisions %r', todo)
503
pb = ui.ui_factory.nested_progress_bar()
505
for i, revid in enumerate(todo):
506
pb.update("generating git objects", i, len(todo))
507
rev = self.repository.get_revision(revid)
508
tree = self.tree_cache.revision_tree(revid)
509
for path, obj, ie in self._revision_to_objects(rev, tree):
510
ret.append((obj, path))