62
55
return BazaarObjectStore(repo, mapping)
65
MAX_TREE_CACHE_SIZE = 50 * 1024 * 1024
68
class LRUTreeCache(object):
58
MAX_INV_CACHE_SIZE = 50 * 1024 * 1024
61
class LRUInventoryCache(object):
70
63
def __init__(self, repository):
71
def approx_tree_size(tree):
64
def approx_inv_size(inv):
72
65
# Very rough estimate, 1k per inventory entry
73
return len(tree.inventory) * 1024
66
return len(inv) * 1024
74
67
self.repository = repository
75
self._cache = lru_cache.LRUSizeCache(max_size=MAX_TREE_CACHE_SIZE,
76
after_cleanup_size=None, compute_size=approx_tree_size)
68
self._cache = lru_cache.LRUSizeCache(max_size=MAX_INV_CACHE_SIZE,
69
after_cleanup_size=None, compute_size=approx_inv_size)
78
def revision_tree(self, revid):
71
def get_inventory(self, revid):
80
tree = self._cache[revid]
73
return self._cache[revid]
82
tree = self.repository.revision_tree(revid)
84
assert tree.get_revision_id() == tree.inventory.revision_id
87
def iter_revision_trees(self, revids):
92
tree = self._cache[revid]
96
assert tree.get_revision_id() == revid
97
assert tree.inventory.revision_id == revid
99
for tree in self.repository.revision_trees(todo):
100
trees[tree.get_revision_id()] = tree
102
return (trees[r] for r in revids)
104
def revision_trees(self, revids):
105
return list(self.iter_revision_trees(revids))
108
self._cache.add(tree.get_revision_id(), tree)
111
def _find_missing_bzr_revids(get_parent_map, want, have):
112
"""Find the revisions that have to be pushed.
114
:param get_parent_map: Function that returns the parents for a sequence
116
:param want: Revisions the target wants
117
:param have: Revisions the target already has
118
:return: Set of revisions to fetch
120
pending = want - have
124
processed.update(pending)
125
next_map = get_parent_map(pending)
127
for item in next_map.iteritems():
131
next_pending.update(p for p in item[1] if p not in processed)
132
pending = next_pending
133
if NULL_REVISION in todo:
134
todo.remove(NULL_REVISION)
75
inv = self.repository.get_inventory(revid)
76
self._cache.add(revid, inv)
79
def iter_inventories(self, revids):
80
invs = dict([(k, self._cache.get(k)) for k in revids])
81
for inv in self.repository.iter_inventories(
82
[r for r, v in invs.iteritems() if v is None]):
83
invs[inv.revision_id] = inv
84
self._cache.add(inv.revision_id, inv)
85
return (invs[r] for r in revids)
87
def get_inventories(self, revids):
88
return list(self.iter_inventories(revids))
90
def add(self, revid, inv):
91
self._cache.add(revid, inv)
138
94
def _check_expected_sha(expected_sha, object):
159
def _tree_to_objects(tree, parent_trees, idmap, unusual_modes,
160
dummy_file_name=None):
115
def _inventory_to_objects(inv, parent_invs, parent_invshamaps,
116
unusual_modes, iter_files_bytes, has_ghost_parents):
161
117
"""Iterate over the objects that were introduced in a revision.
164
:param parent_trees: Parent revision trees
165
:param unusual_modes: Unusual file modes dictionary
166
:param dummy_file_name: File name to use for dummy files
167
in empty directories. None to skip empty directories
168
:return: Yields (path, object, ie) entries
119
:param inv: Inventory to process
120
:param parent_invs: parent inventory SHA maps
121
:param parent_invshamaps: parent inventory SHA Map
122
:param unusual_modes: Unusual file modes
123
:param iter_files_bytes: Repository.iter_files_bytes-like callback
124
:return: Yields (path, object) entries
174
base_tree = parent_trees[0]
175
other_parent_trees = parent_trees[1:]
177
base_tree = tree._repository.revision_tree(NULL_REVISION)
178
other_parent_trees = []
179
def find_unchanged_parent_ie(ie, parent_trees):
180
assert ie.kind in ("symlink", "file")
181
for ptree in parent_trees:
183
pie = ptree.inventory[ie.file_id]
184
except errors.NoSuchId:
187
if (pie.text_sha1 == ie.text_sha1 and
188
pie.kind == ie.kind and
189
pie.symlink_target == ie.symlink_target):
193
# Find all the changed blobs
194
for (file_id, path, changed_content, versioned, parent, name, kind,
195
executable) in tree.iter_changes(base_tree):
196
if kind[1] == "file":
197
ie = tree.inventory[file_id]
200
pie = find_unchanged_parent_ie(ie, other_parent_trees)
129
for path, ie in inv.entries():
130
if ie.kind == "file":
131
if ie.revision != inv.revision_id:
132
for (pinv, pinvshamap) in zip(parent_invs, parent_invshamaps):
205
shamap[ie.file_id] = idmap.lookup_blob_id(
206
pie.file_id, pie.revision)
210
blob.data = tree.get_file_text(ie.file_id)
211
shamap[ie.file_id] = blob.id
212
if not file_id in shamap:
213
new_blobs.append((path[1], ie))
214
new_trees[posixpath.dirname(path[1])] = parent[1]
215
elif kind[1] == "symlink":
216
ie = tree.inventory[file_id]
218
blob = symlink_to_blob(ie)
219
shamap[file_id] = blob.id
221
find_unchanged_parent_ie(ie, other_parent_trees)
223
yield path[1], blob, ie
224
new_trees[posixpath.dirname(path[1])] = parent[1]
225
elif kind[1] not in (None, "directory"):
226
raise AssertionError(kind[1])
227
if (path[0] not in (None, "") and
228
parent[0] in tree.inventory and
229
tree.inventory[parent[0]].kind == "directory"):
231
new_trees[posixpath.dirname(path[0])] = parent[0]
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] = pinvshamap.lookup_blob(
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, pinvshamap) in zip(parent_invs, parent_invshamaps):
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] = pinvshamap.lookup_tree(
173
except (NotImplementedError, KeyError):
178
new_trees[path] = ie.file_id
180
raise AssertionError(ie.kind)
233
# Fetch contents of the blobs that were changed
234
for (path, ie), chunks in tree.iter_files_bytes(
235
[(ie.file_id, (path, ie)) for (path, ie) in new_blobs]):
182
for (path, fid), chunks in iter_files_bytes(
183
[(ie.file_id, ie.revision, (path, ie.file_id))
184
for (path, ie) in new_blobs]):
239
shamap[ie.file_id] = obj.id
241
for path in unusual_modes:
242
parent_path = posixpath.dirname(path)
243
new_trees[parent_path] = tree.path2id(parent_path)
186
obj.data = "".join(chunks)
190
for fid in unusual_modes:
191
new_trees[inv.id2path(fid)] = inv[fid].parent_id
247
195
items = new_trees.items()
249
197
for path, file_id in items:
250
parent_id = tree.inventory[file_id].parent_id
198
parent_id = inv[file_id].parent_id
251
199
if parent_id is not None:
252
200
parent_path = urlutils.dirname(path)
253
201
new_trees[parent_path] = parent_id
341
274
def __iter__(self):
342
275
self._update_sha_map()
343
return iter(self._cache.idmap.sha1s())
345
def _reconstruct_commit(self, rev, tree_sha, roundtrip, verifiers):
346
"""Reconstruct a Commit object.
348
:param rev: Revision object
349
:param tree_sha: SHA1 of the root tree object
350
:param roundtrip: Whether or not to roundtrip bzr metadata
351
:param verifiers: Verifiers for the commits
352
:return: Commit object
276
return iter(self._idmap.sha1s())
278
def _revision_to_commit(self, rev, tree_sha):
354
279
def parent_lookup(revid):
356
281
return self._lookup_revision_sha1(revid)
357
282
except errors.NoSuchRevision:
283
trace.warning("Ignoring ghost parent %s", revid)
359
return self.mapping.export_commit(rev, tree_sha, parent_lookup,
360
roundtrip, verifiers)
362
def _create_fileid_map_blob(self, inv):
363
# FIXME: This can probably be a lot more efficient,
364
# not all files necessarily have to be processed.
366
for (path, ie) in inv.iter_entries():
367
if self.mapping.generate_file_id(path) != ie.file_id:
368
file_ids[path] = ie.file_id
369
return self.mapping.export_fileid_map(file_ids)
371
def _revision_to_objects(self, rev, tree, roundtrip):
372
"""Convert a revision to a set of git objects.
374
:param rev: Bazaar revision object
375
:param tree: Bazaar revision tree
376
:param roundtrip: Whether to roundtrip all Bazaar revision data
285
return self.mapping.export_commit(rev, tree_sha, parent_lookup)
287
def _revision_to_objects(self, rev, inv):
378
288
unusual_modes = extract_unusual_modes(rev)
379
289
present_parents = self.repository.has_revisions(rev.parent_ids)
380
parent_trees = self.tree_cache.revision_trees(
290
has_ghost_parents = (len(rev.parent_ids) < len(present_parents))
291
parent_invs = self.parent_invs_cache.get_inventories(
381
292
[p for p in rev.parent_ids if p in present_parents])
383
for path, obj, ie in _tree_to_objects(tree, parent_trees,
384
self._cache.idmap, unusual_modes, self.mapping.BZR_DUMMY_FILE):
293
parent_invshamaps = [self._idmap.get_inventory_sha_map(r) for r in rev.parent_ids if r in present_parents]
295
for path, obj in _inventory_to_objects(inv, parent_invs,
296
parent_invshamaps, unusual_modes,
297
self.repository.iter_files_bytes, has_ghost_parents):
388
# Don't yield just yet
391
if root_tree is None:
392
# Pointless commit - get the tree sha elsewhere
393
302
if not rev.parent_ids:
396
base_sha1 = self._lookup_revision_sha1(rev.parent_ids[0])
397
root_tree = self[self[base_sha1].tree]
398
root_ie = tree.inventory.root
399
if roundtrip and self.mapping.BZR_FILE_IDS_FILE is not None:
400
b = self._create_fileid_map_blob(tree.inventory)
402
root_tree[self.mapping.BZR_FILE_IDS_FILE] = ((stat.S_IFREG | 0644), b.id)
403
yield self.mapping.BZR_FILE_IDS_FILE, b, None
404
yield "", root_tree, root_ie
406
testament3 = StrictTestament3(rev, tree.inventory)
407
verifiers = { "testament3-sha1": testament3.as_sha1() }
410
commit_obj = self._reconstruct_commit(rev, root_tree.id,
411
roundtrip=roundtrip, verifiers=verifiers)
305
tree_sha = parent_invshamaps[0][inv.root.file_id]
306
commit_obj = self._revision_to_commit(rev, tree_sha)
413
foreign_revid, mapping = mapping_registry.parse_revision_id(
308
foreign_revid, mapping = mapping_registry.parse_revision_id(rev.revision_id)
415
309
except errors.InvalidRevisionId:
418
312
_check_expected_sha(foreign_revid, commit_obj)
419
yield None, commit_obj, None
421
def _get_updater(self, rev):
422
return self._cache.get_updater(rev)
313
yield None, commit_obj
424
315
def _update_sha_map_revision(self, revid):
425
316
rev = self.repository.get_revision(revid)
426
tree = self.tree_cache.revision_tree(rev.revision_id)
427
updater = self._get_updater(rev)
428
for path, obj, ie in self._revision_to_objects(rev, tree,
430
if isinstance(obj, Commit):
431
testament3 = StrictTestament3(rev, tree.inventory)
432
ie = { "testament3-sha1": testament3.as_sha1() }
433
updater.add_object(obj, ie, path)
434
commit_obj = updater.finish()
317
inv = self.parent_invs_cache.get_inventory(rev.revision_id)
320
for path, obj in self._revision_to_objects(rev, inv):
321
if obj.type_name == "commit":
323
elif obj.type_name in ("blob", "tree"):
324
file_id = inv.path2id(path)
326
if obj.type_name == "blob":
327
revision = ie.revision
330
entries.append((file_id, obj.type_name, obj.id, revision))
333
self._idmap.add_entries(revid, rev.parent_ids, commit_obj.id,
334
commit_obj.tree, entries)
435
335
return commit_obj.id
437
def _reconstruct_blobs(self, keys):
337
def _get_blob(self, fileid, revision, expected_sha):
438
338
"""Return a Git Blob object from a fileid and revision stored in bzr.
440
340
:param fileid: File id of the text
441
341
:param revision: Revision of the text
443
stream = self.repository.iter_files_bytes(
444
((key[0], key[1], key) for key in keys))
445
for (fileid, revision, expected_sha), chunks in stream:
447
blob.chunked = chunks
448
if blob.id != expected_sha and blob.data == "":
449
# Perhaps it's a symlink ?
450
tree = self.tree_cache.revision_tree(revision)
451
entry = tree.inventory[fileid]
452
if entry.kind == 'symlink':
453
blob = symlink_to_blob(entry)
454
_check_expected_sha(expected_sha, blob)
344
chunks = self.repository.iter_files_bytes([(fileid, revision, None)]).next()[1]
345
blob.data = "".join(chunks)
346
if blob.id != expected_sha:
347
# Perhaps it's a symlink ?
348
inv = self.parent_invs_cache.get_inventory(revision)
350
assert entry.kind == 'symlink'
351
blob = symlink_to_blob(entry)
352
_check_expected_sha(expected_sha, blob)
457
def _reconstruct_tree(self, fileid, revid, inv, unusual_modes,
355
def _get_tree(self, fileid, revid, inv, unusual_modes, expected_sha=None):
459
356
"""Return a Git Tree object from a file id and a revision stored in bzr.
461
358
:param fileid: fileid in the tree.
462
359
:param revision: Revision of the tree.
361
invshamap = self._idmap.get_inventory_sha_map(inv.revision_id)
464
362
def get_ie_sha1(entry):
465
363
if entry.kind == "directory":
467
return self._cache.idmap.lookup_tree_id(entry.file_id,
365
return invshamap.lookup_tree(entry.file_id)
469
366
except (NotImplementedError, KeyError):
470
obj = self._reconstruct_tree(entry.file_id, revid, inv,
367
obj = self._get_tree(entry.file_id, revid, inv,
476
373
elif entry.kind in ("file", "symlink"):
478
return self._cache.idmap.lookup_blob_id(entry.file_id,
482
return self._reconstruct_blobs(
483
[(entry.file_id, entry.revision, None)]).next().id
374
return invshamap.lookup_blob(entry.file_id, entry.revision)
485
376
raise AssertionError("unknown entry kind '%s'" % entry.kind)
486
tree = directory_to_tree(inv[fileid], get_ie_sha1, unusual_modes,
487
self.mapping.BZR_DUMMY_FILE)
488
if (inv.root.file_id == fileid and
489
self.mapping.BZR_FILE_IDS_FILE is not None):
490
b = self._create_fileid_map_blob(inv)
491
# If this is the root tree, add the file ids
492
tree[self.mapping.BZR_FILE_IDS_FILE] = ((stat.S_IFREG | 0644), b.id)
377
tree = directory_to_tree(inv[fileid], get_ie_sha1, unusual_modes)
493
378
_check_expected_sha(expected_sha, tree)
545
def lookup_git_shas(self, shas, update_map=True):
546
from dulwich.protocol import ZERO_SHA
550
ret[sha] = ("commit", (NULL_REVISION, None, {}))
553
ret[sha] = self._cache.idmap.lookup_git_sha(sha)
556
# if not, see if there are any unconverted revisions and add
557
# them to the map, search for sha in map again
558
self._update_sha_map()
561
ret[sha] = self._cache.idmap.lookup_git_sha(sha)
566
def lookup_git_sha(self, sha, update_map=True):
567
return self.lookup_git_shas([sha], update_map=update_map)[sha]
425
def _lookup_git_sha(self, sha):
426
# See if sha is in map
428
return self._idmap.lookup_git_sha(sha)
430
# if not, see if there are any unconverted revisions and add them
431
# to the map, search for sha in map again
432
self._update_sha_map()
433
return self._idmap.lookup_git_sha(sha)
569
435
def __getitem__(self, sha):
570
if self._cache.content_cache is not None:
572
return self._cache.content_cache[sha]
575
(type, type_data) = self.lookup_git_sha(sha)
436
(type, type_data) = self._lookup_git_sha(sha)
576
437
# convert object to git object
577
438
if type == "commit":
578
(revid, tree_sha, verifiers) = type_data
439
(revid, tree_sha) = type_data
580
441
rev = self.repository.get_revision(revid)
581
442
except errors.NoSuchRevision:
582
trace.mutter('entry for %s %s in shamap: %r, but not found in '
583
'repository', type, sha, type_data)
443
trace.mutter('entry for %s %s in shamap: %r, but not found in repository', type, sha, type_data)
584
444
raise KeyError(sha)
585
commit = self._reconstruct_commit(rev, tree_sha, roundtrip=True,
445
commit = self._revision_to_commit(rev, tree_sha)
587
446
_check_expected_sha(sha, commit)
589
448
elif type == "blob":
590
449
(fileid, revision) = type_data
591
return self._reconstruct_blobs([(fileid, revision, sha)]).next()
450
return self._get_blob(fileid, revision, expected_sha=sha)
592
451
elif type == "tree":
593
452
(fileid, revid) = type_data
595
tree = self.tree_cache.revision_tree(revid)
454
inv = self.parent_invs_cache.get_inventory(revid)
596
455
rev = self.repository.get_revision(revid)
597
456
except errors.NoSuchRevision:
598
457
trace.mutter('entry for %s %s in shamap: %r, but not found in repository', type, sha, type_data)
599
458
raise KeyError(sha)
600
459
unusual_modes = extract_unusual_modes(rev)
602
return self._reconstruct_tree(fileid, revid, tree.inventory,
461
return self._get_tree(fileid, revid, inv,
603
462
unusual_modes, expected_sha=sha)
604
463
except errors.NoSuchRevision:
605
464
raise KeyError(sha)
607
466
raise AssertionError("Unknown object type '%s'" % type)
609
def generate_lossy_pack_contents(self, have, want, progress=None,
611
return self.generate_pack_contents(have, want, progress, get_tagged,
614
def generate_pack_contents(self, have, want, progress=None,
615
get_tagged=None, lossy=False):
468
def generate_pack_contents(self, have, want):
616
469
"""Iterate over the contents of a pack file.
618
471
:param have: List of SHA1s of objects that should not be sent
619
472
:param want: List of SHA1s of objects that should be sent
621
474
processed = set()
622
ret = self.lookup_git_shas(have + want)
623
475
for commit_sha in have:
625
(type, (revid, tree_sha)) = ret[commit_sha]
477
(type, (revid, tree_sha)) = self._lookup_git_sha(commit_sha)