55
58
return BazaarObjectStore(repo, mapping)
58
MAX_INV_CACHE_SIZE = 50 * 1024 * 1024
61
class LRUInventoryCache(object):
61
MAX_TREE_CACHE_SIZE = 50 * 1024 * 1024
64
class LRUTreeCache(object):
63
66
def __init__(self, repository):
64
def approx_inv_size(inv):
67
def approx_tree_size(tree):
65
68
# Very rough estimate, 1k per inventory entry
66
return len(inv) * 1024
69
return len(tree.inventory) * 1024
67
70
self.repository = repository
68
self._cache = lru_cache.LRUSizeCache(max_size=MAX_INV_CACHE_SIZE,
69
after_cleanup_size=None, compute_size=approx_inv_size)
71
self._cache = lru_cache.LRUSizeCache(max_size=MAX_TREE_CACHE_SIZE,
72
after_cleanup_size=None, compute_size=approx_tree_size)
71
def get_inventory(self, revid):
74
def revision_tree(self, revid):
73
76
return self._cache[revid]
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)
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)
94
124
def _check_expected_sha(expected_sha, object):
115
def _inventory_to_objects(inv, parent_invs, parent_invshamaps,
116
unusual_modes, iter_files_bytes, has_ghost_parents):
145
def _tree_to_objects(tree, parent_trees, idmap, unusual_modes, dummy_file_name=None):
117
146
"""Iterate over the objects that were introduced in a revision.
119
:param inv: Inventory to process
120
:param parent_invs: parent inventory SHA maps
121
:param parent_invshamaps: parent inventory SHA Map
122
149
:param unusual_modes: Unusual file modes
123
:param iter_files_bytes: Repository.iter_files_bytes-like callback
124
:return: Yields (path, object) entries
150
:param dummy_file_name: File name to use for dummy files
151
in empty directories. None to skip empty directories
152
:return: Yields (path, object, ie) entries
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):
158
base_tree = parent_trees[0]
159
other_parent_trees = parent_trees[1:]
161
base_tree = tree._repository.revision_tree(NULL_REVISION)
162
other_parent_trees = []
163
def find_unchanged_parent_ie(ie, parent_trees):
164
assert ie.kind in ("symlink", "file")
165
for ptree in parent_trees:
167
pie = ptree.inventory[ie.file_id]
168
except errors.NoSuchId:
171
if (pie.text_sha1 == ie.text_sha1 and
172
pie.kind == ie.kind and
173
pie.symlink_target == ie.symlink_target):
176
for (file_id, path, changed_content, versioned, parent, name, kind,
177
executable) in tree.iter_changes(base_tree):
178
if kind[1] == "file":
179
ie = tree.inventory[file_id]
182
pie = find_unchanged_parent_ie(ie, other_parent_trees)
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)
187
shamap[ie.file_id] = idmap.lookup_blob_id(
188
pie.file_id, pie.revision)
192
blob.data = tree.get_file_text(ie.file_id)
193
shamap[ie.file_id] = blob.id
194
if not file_id in shamap:
195
new_blobs.append((path[1], ie))
196
new_trees[posixpath.dirname(path[1])] = parent[1]
197
elif kind[1] == "symlink":
198
ie = tree.inventory[file_id]
200
blob = symlink_to_blob(ie)
201
shamap[file_id] = blob.id
203
find_unchanged_parent_ie(ie, other_parent_trees)
205
yield path[1], blob, ie
206
new_trees[posixpath.dirname(path[1])] = parent[1]
207
elif kind[1] not in (None, "directory"):
208
raise AssertionError(kind[1])
209
if path[0] is not None:
210
new_trees[posixpath.dirname(path[0])] = parent[0]
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]):
212
for (path, ie), chunks in tree.iter_files_bytes(
213
[(ie.file_id, (path, ie)) for (path, ie) in new_blobs]):
186
obj.data = "".join(chunks)
217
shamap[ie.file_id] = obj.id
190
for fid in unusual_modes:
191
new_trees[inv.id2path(fid)] = inv[fid].parent_id
219
for path in unusual_modes:
220
parent_path = posixpath.dirname(path)
221
new_trees[parent_path] = tree.path2id(parent_path)
195
225
items = new_trees.items()
197
227
for path, file_id in items:
198
parent_id = inv[file_id].parent_id
229
parent_id = tree.inventory[file_id].parent_id
230
except errors.NoSuchId:
231
# Directory was removed recursively perhaps ?
199
233
if parent_id is not None:
200
234
parent_path = urlutils.dirname(path)
201
235
new_trees[parent_path] = parent_id
274
323
def __iter__(self):
275
324
self._update_sha_map()
276
return iter(self._idmap.sha1s())
325
return iter(self._cache.idmap.sha1s())
278
def _revision_to_commit(self, rev, tree_sha):
327
def _reconstruct_commit(self, rev, tree_sha, roundtrip):
279
328
def parent_lookup(revid):
281
330
return self._lookup_revision_sha1(revid)
282
331
except errors.NoSuchRevision:
283
trace.warning("Ignoring ghost parent %s", revid)
285
return self.mapping.export_commit(rev, tree_sha, parent_lookup)
287
def _revision_to_objects(self, rev, inv):
333
return self.mapping.export_commit(rev, tree_sha, parent_lookup,
336
def _create_fileid_map_blob(self, inv):
337
# FIXME: This can probably be a lot more efficient,
338
# not all files necessarily have to be processed.
340
for (path, ie) in inv.iter_entries():
341
if self.mapping.generate_file_id(path) != ie.file_id:
342
file_ids[path] = ie.file_id
343
return self.mapping.export_fileid_map(file_ids)
345
def _revision_to_objects(self, rev, tree, roundtrip):
346
"""Convert a revision to a set of git objects.
348
:param rev: Bazaar revision object
349
:param tree: Bazaar revision tree
350
:param roundtrip: Whether to roundtrip all Bazaar revision data
288
352
unusual_modes = extract_unusual_modes(rev)
289
353
present_parents = self.repository.has_revisions(rev.parent_ids)
290
has_ghost_parents = (len(rev.parent_ids) < len(present_parents))
291
parent_invs = self.parent_invs_cache.get_inventories(
354
parent_trees = self.tree_cache.revision_trees(
292
355
[p for p in rev.parent_ids if p in present_parents])
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):
357
for path, obj, ie in _tree_to_objects(tree, parent_trees,
358
self._cache.idmap, unusual_modes, self.mapping.BZR_DUMMY_FILE):
362
# Don't yield just yet
365
if root_tree is None:
366
# Pointless commit - get the tree sha elsewhere
302
367
if not rev.parent_ids:
305
tree_sha = parent_invshamaps[0][inv.root.file_id]
306
commit_obj = self._revision_to_commit(rev, tree_sha)
370
base_sha1 = self._lookup_revision_sha1(rev.parent_ids[0])
371
root_tree = self[self[base_sha1].tree]
372
root_ie = tree.inventory.root
373
if roundtrip and self.mapping.BZR_FILE_IDS_FILE is not None:
374
b = self._create_fileid_map_blob(tree.inventory)
376
root_tree[self.mapping.BZR_FILE_IDS_FILE] = ((stat.S_IFREG | 0644), b.id)
377
yield self.mapping.BZR_FILE_IDS_FILE, b, None
378
yield "", root_tree, root_ie
379
commit_obj = self._reconstruct_commit(rev, root_tree.id,
308
foreign_revid, mapping = mapping_registry.parse_revision_id(rev.revision_id)
382
foreign_revid, mapping = mapping_registry.parse_revision_id(
309
384
except errors.InvalidRevisionId:
312
387
_check_expected_sha(foreign_revid, commit_obj)
313
yield None, commit_obj
388
yield None, commit_obj, None
390
def _get_updater(self, rev):
391
return self._cache.get_updater(rev)
315
393
def _update_sha_map_revision(self, revid):
316
394
rev = self.repository.get_revision(revid)
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 == "commit":
323
elif obj._type in ("blob", "tree"):
324
file_id = inv.path2id(path)
326
if obj._type == "blob":
327
revision = ie.revision
330
entries.append((file_id, obj._type, obj.id, revision))
333
self._idmap.add_entries(revid, rev.parent_ids, commit_obj.id,
334
commit_obj.tree, entries)
395
tree = self.tree_cache.revision_tree(rev.revision_id)
396
updater = self._get_updater(rev)
397
for path, obj, ie in self._revision_to_objects(rev, tree,
399
updater.add_object(obj, ie)
400
commit_obj = updater.finish()
335
401
return commit_obj.id
337
def _get_blob(self, fileid, revision, expected_sha):
403
def _reconstruct_blobs(self, keys):
338
404
"""Return a Git Blob object from a fileid and revision stored in bzr.
340
406
:param fileid: File id of the text
341
407
:param revision: Revision of the text
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)
409
stream = self.repository.iter_files_bytes(
410
((key[0], key[1], key) for key in keys))
411
for (fileid, revision, expected_sha), chunks in stream:
413
blob.chunked = chunks
414
if blob.id != expected_sha and blob.data == "":
415
# Perhaps it's a symlink ?
416
tree = self.tree_cache.revision_tree(revision)
417
entry = tree.inventory[fileid]
418
if entry.kind == 'symlink':
419
blob = symlink_to_blob(entry)
420
_check_expected_sha(expected_sha, blob)
355
def _get_tree(self, fileid, revid, inv, unusual_modes, expected_sha=None):
423
def _reconstruct_tree(self, fileid, revid, inv, unusual_modes,
356
425
"""Return a Git Tree object from a file id and a revision stored in bzr.
358
427
:param fileid: fileid in the tree.
359
428
:param revision: Revision of the tree.
361
invshamap = self._idmap.get_inventory_sha_map(inv.revision_id)
362
430
def get_ie_sha1(entry):
363
431
if entry.kind == "directory":
365
return invshamap.lookup_tree(entry.file_id)
433
return self._cache.idmap.lookup_tree_id(entry.file_id,
366
435
except (NotImplementedError, KeyError):
367
obj = self._get_tree(entry.file_id, revid, inv,
436
obj = self._reconstruct_tree(entry.file_id, revid, inv,
373
442
elif entry.kind in ("file", "symlink"):
374
return invshamap.lookup_blob(entry.file_id, entry.revision)
444
return self._cache.idmap.lookup_blob_id(entry.file_id,
448
return self._reconstruct_blobs(
449
[(entry.file_id, entry.revision, None)]).next().id
376
451
raise AssertionError("unknown entry kind '%s'" % entry.kind)
377
tree = directory_to_tree(inv[fileid], get_ie_sha1, unusual_modes)
452
tree = directory_to_tree(inv[fileid], get_ie_sha1, unusual_modes,
453
self.mapping.BZR_DUMMY_FILE)
454
if (inv.root.file_id == fileid and
455
self.mapping.BZR_FILE_IDS_FILE is not None):
456
b = self._create_fileid_map_blob(inv)
457
# If this is the root tree, add the file ids
458
tree[self.mapping.BZR_FILE_IDS_FILE] = ((stat.S_IFREG | 0644), b.id)
378
459
_check_expected_sha(expected_sha, tree)
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)
511
def lookup_git_shas(self, shas, update_map=True):
515
ret[sha] = self._cache.idmap.lookup_git_sha(sha)
518
# if not, see if there are any unconverted revisions and add
519
# them to the map, search for sha in map again
520
self._update_sha_map()
523
ret[sha] = self._cache.idmap.lookup_git_sha(sha)
528
def lookup_git_sha(self, sha, update_map=True):
529
return self.lookup_git_shas([sha], update_map=update_map)[sha]
435
531
def __getitem__(self, sha):
436
(type, type_data) = self._lookup_git_sha(sha)
532
if self._cache.content_cache is not None:
534
return self._cache.content_cache[sha]
537
(type, type_data) = self.lookup_git_sha(sha)
437
538
# convert object to git object
438
539
if type == "commit":
439
540
(revid, tree_sha) = type_data
441
542
rev = self.repository.get_revision(revid)
442
543
except errors.NoSuchRevision:
443
trace.mutter('entry for %s %s in shamap: %r, but not found in repository', type, sha, type_data)
544
trace.mutter('entry for %s %s in shamap: %r, but not found in '
545
'repository', type, sha, type_data)
444
546
raise KeyError(sha)
445
commit = self._revision_to_commit(rev, tree_sha)
547
commit = self._reconstruct_commit(rev, tree_sha, roundtrip=True)
446
548
_check_expected_sha(sha, commit)
448
550
elif type == "blob":
449
551
(fileid, revision) = type_data
450
return self._get_blob(fileid, revision, expected_sha=sha)
552
return self._reconstruct_blobs([(fileid, revision, sha)]).next()
451
553
elif type == "tree":
452
554
(fileid, revid) = type_data
454
inv = self.parent_invs_cache.get_inventory(revid)
556
tree = self.tree_cache.revision_tree(revid)
455
557
rev = self.repository.get_revision(revid)
456
558
except errors.NoSuchRevision:
457
559
trace.mutter('entry for %s %s in shamap: %r, but not found in repository', type, sha, type_data)
458
560
raise KeyError(sha)
459
561
unusual_modes = extract_unusual_modes(rev)
461
return self._get_tree(fileid, revid, inv,
563
return self._reconstruct_tree(fileid, revid, tree.inventory,
462
564
unusual_modes, expected_sha=sha)
463
565
except errors.NoSuchRevision:
464
566
raise KeyError(sha)
466
568
raise AssertionError("Unknown object type '%s'" % type)
468
def generate_pack_contents(self, have, want):
570
def generate_lossy_pack_contents(self, have, want, progress=None,
572
return self.generate_pack_contents(have, want, progress, get_tagged,
575
def generate_pack_contents(self, have, want, progress=None,
576
get_tagged=None, lossy=False):
469
577
"""Iterate over the contents of a pack file.
471
579
:param have: List of SHA1s of objects that should not be sent
472
580
:param want: List of SHA1s of objects that should be sent
474
582
processed = set()
583
ret = self.lookup_git_shas(have + want)
475
584
for commit_sha in have:
477
(type, (revid, tree_sha)) = self._lookup_git_sha(commit_sha)
586
(type, (revid, tree_sha)) = ret[commit_sha]