1185
1073
# The old API returned a list, should this actually be a set?
1186
1074
return parent_map.keys()
1188
def _check_inventories(self, checker):
1189
"""Check the inventories found from the revision scan.
1191
This is responsible for verifying the sha1 of inventories and
1192
creating a pending_keys set that covers data referenced by inventories.
1194
bar = ui.ui_factory.nested_progress_bar()
1196
self._do_check_inventories(checker, bar)
1200
def _do_check_inventories(self, checker, bar):
1201
"""Helper for _check_inventories."""
1203
keys = {'chk_bytes':set(), 'inventories':set(), 'texts':set()}
1204
kinds = ['chk_bytes', 'texts']
1205
count = len(checker.pending_keys)
1206
bar.update("inventories", 0, 2)
1207
current_keys = checker.pending_keys
1208
checker.pending_keys = {}
1209
# Accumulate current checks.
1210
for key in current_keys:
1211
if key[0] != 'inventories' and key[0] not in kinds:
1212
checker._report_items.append('unknown key type %r' % (key,))
1213
keys[key[0]].add(key[1:])
1214
if keys['inventories']:
1215
# NB: output order *should* be roughly sorted - topo or
1216
# inverse topo depending on repository - either way decent
1217
# to just delta against. However, pre-CHK formats didn't
1218
# try to optimise inventory layout on disk. As such the
1219
# pre-CHK code path does not use inventory deltas.
1221
for record in self.inventories.check(keys=keys['inventories']):
1222
if record.storage_kind == 'absent':
1223
checker._report_items.append(
1224
'Missing inventory {%s}' % (record.key,))
1226
last_object = self._check_record('inventories', record,
1227
checker, last_object,
1228
current_keys[('inventories',) + record.key])
1229
del keys['inventories']
1232
bar.update("texts", 1)
1233
while (checker.pending_keys or keys['chk_bytes']
1235
# Something to check.
1236
current_keys = checker.pending_keys
1237
checker.pending_keys = {}
1238
# Accumulate current checks.
1239
for key in current_keys:
1240
if key[0] not in kinds:
1241
checker._report_items.append('unknown key type %r' % (key,))
1242
keys[key[0]].add(key[1:])
1243
# Check the outermost kind only - inventories || chk_bytes || texts
1247
for record in getattr(self, kind).check(keys=keys[kind]):
1248
if record.storage_kind == 'absent':
1249
checker._report_items.append(
1250
'Missing %s {%s}' % (kind, record.key,))
1252
last_object = self._check_record(kind, record,
1253
checker, last_object, current_keys[(kind,) + record.key])
1257
def _check_record(self, kind, record, checker, last_object, item_data):
1258
"""Check a single text from this repository."""
1259
if kind == 'inventories':
1260
rev_id = record.key[0]
1261
inv = self._deserialise_inventory(rev_id,
1262
record.get_bytes_as('fulltext'))
1263
if last_object is not None:
1264
delta = inv._make_delta(last_object)
1265
for old_path, path, file_id, ie in delta:
1268
ie.check(checker, rev_id, inv)
1270
for path, ie in inv.iter_entries():
1271
ie.check(checker, rev_id, inv)
1272
if self._format.fast_deltas:
1274
elif kind == 'chk_bytes':
1275
# No code written to check chk_bytes for this repo format.
1276
checker._report_items.append(
1277
'unsupported key type chk_bytes for %s' % (record.key,))
1278
elif kind == 'texts':
1279
self._check_text(record, checker, item_data)
1281
checker._report_items.append(
1282
'unknown key type %s for %s' % (kind, record.key))
1284
def _check_text(self, record, checker, item_data):
1285
"""Check a single text."""
1286
# Check it is extractable.
1287
# TODO: check length.
1288
if record.storage_kind == 'chunked':
1289
chunks = record.get_bytes_as(record.storage_kind)
1290
sha1 = osutils.sha_strings(chunks)
1291
length = sum(map(len, chunks))
1293
content = record.get_bytes_as('fulltext')
1294
sha1 = osutils.sha_string(content)
1295
length = len(content)
1296
if item_data and sha1 != item_data[1]:
1297
checker._report_items.append(
1298
'sha1 mismatch: %s has sha1 %s expected %s referenced by %s' %
1299
(record.key, sha1, item_data[1], item_data[2]))
1302
1077
def create(a_bzrdir):
1303
1078
"""Construct the current default format repository in a_bzrdir."""
1602
1347
def suspend_write_group(self):
1603
1348
raise errors.UnsuspendableWriteGroup(self)
1605
def get_missing_parent_inventories(self, check_for_missing_texts=True):
1606
"""Return the keys of missing inventory parents for revisions added in
1609
A revision is not complete if the inventory delta for that revision
1610
cannot be calculated. Therefore if the parent inventories of a
1611
revision are not present, the revision is incomplete, and e.g. cannot
1612
be streamed by a smart server. This method finds missing inventory
1613
parents for revisions added in this write group.
1615
if not self._format.supports_external_lookups:
1616
# This is only an issue for stacked repositories
1618
if not self.is_in_write_group():
1619
raise AssertionError('not in a write group')
1621
# XXX: We assume that every added revision already has its
1622
# corresponding inventory, so we only check for parent inventories that
1623
# might be missing, rather than all inventories.
1624
parents = set(self.revisions._index.get_missing_parents())
1625
parents.discard(_mod_revision.NULL_REVISION)
1626
unstacked_inventories = self.inventories._index
1627
present_inventories = unstacked_inventories.get_parent_map(
1628
key[-1:] for key in parents)
1629
parents.difference_update(present_inventories)
1630
if len(parents) == 0:
1631
# No missing parent inventories.
1633
if not check_for_missing_texts:
1634
return set(('inventories', rev_id) for (rev_id,) in parents)
1635
# Ok, now we have a list of missing inventories. But these only matter
1636
# if the inventories that reference them are missing some texts they
1637
# appear to introduce.
1638
# XXX: Texts referenced by all added inventories need to be present,
1639
# but at the moment we're only checking for texts referenced by
1640
# inventories at the graph's edge.
1641
key_deps = self.revisions._index._key_dependencies
1642
key_deps.satisfy_refs_for_keys(present_inventories)
1643
referrers = frozenset(r[0] for r in key_deps.get_referrers())
1644
file_ids = self.fileids_altered_by_revision_ids(referrers)
1645
missing_texts = set()
1646
for file_id, version_ids in file_ids.iteritems():
1647
missing_texts.update(
1648
(file_id, version_id) for version_id in version_ids)
1649
present_texts = self.texts.get_parent_map(missing_texts)
1650
missing_texts.difference_update(present_texts)
1651
if not missing_texts:
1652
# No texts are missing, so all revisions and their deltas are
1655
# Alternatively the text versions could be returned as the missing
1656
# keys, but this is likely to be less data.
1657
missing_keys = set(('inventories', rev_id) for (rev_id,) in parents)
1660
1350
def refresh_data(self):
1661
1351
"""Re-read any data needed to to synchronise with disk.
1884
1565
@needs_read_lock
1885
1566
def get_revisions(self, revision_ids):
1886
"""Get many revisions at once.
1888
Repositories that need to check data on every revision read should
1889
subclass this method.
1567
"""Get many revisions at once."""
1891
1568
return self._get_revisions(revision_ids)
1893
1570
@needs_read_lock
1894
1571
def _get_revisions(self, revision_ids):
1895
1572
"""Core work logic to get many revisions without sanity checks."""
1573
for rev_id in revision_ids:
1574
if not rev_id or not isinstance(rev_id, basestring):
1575
raise errors.InvalidRevisionId(revision_id=rev_id, branch=self)
1576
keys = [(key,) for key in revision_ids]
1577
stream = self.revisions.get_record_stream(keys, 'unordered', True)
1897
for revid, rev in self._iter_revisions(revision_ids):
1899
raise errors.NoSuchRevision(self, revid)
1579
for record in stream:
1580
if record.storage_kind == 'absent':
1581
raise errors.NoSuchRevision(self, record.key[0])
1582
text = record.get_bytes_as('fulltext')
1583
rev = self._serializer.read_revision_from_string(text)
1584
revs[record.key[0]] = rev
1901
1585
return [revs[revid] for revid in revision_ids]
1903
def _iter_revisions(self, revision_ids):
1904
"""Iterate over revision objects.
1906
:param revision_ids: An iterable of revisions to examine. None may be
1907
passed to request all revisions known to the repository. Note that
1908
not all repositories can find unreferenced revisions; for those
1909
repositories only referenced ones will be returned.
1910
:return: An iterator of (revid, revision) tuples. Absent revisions (
1911
those asked for but not available) are returned as (revid, None).
1913
if revision_ids is None:
1914
revision_ids = self.all_revision_ids()
1916
for rev_id in revision_ids:
1917
if not rev_id or not isinstance(rev_id, basestring):
1918
raise errors.InvalidRevisionId(revision_id=rev_id, branch=self)
1919
keys = [(key,) for key in revision_ids]
1920
stream = self.revisions.get_record_stream(keys, 'unordered', True)
1921
for record in stream:
1922
revid = record.key[0]
1923
if record.storage_kind == 'absent':
1926
text = record.get_bytes_as('fulltext')
1927
rev = self._serializer.read_revision_from_string(text)
1588
def get_revision_xml(self, revision_id):
1589
# TODO: jam 20070210 This shouldn't be necessary since get_revision
1590
# would have already do it.
1591
# TODO: jam 20070210 Just use _serializer.write_revision_to_string()
1592
rev = self.get_revision(revision_id)
1593
rev_tmp = cStringIO.StringIO()
1594
# the current serializer..
1595
self._serializer.write_revision(rev, rev_tmp)
1597
return rev_tmp.getvalue()
1930
1599
def get_deltas_for_revisions(self, revisions, specific_fileids=None):
1931
1600
"""Produce a generator of revision deltas.
2371
2014
"""Get Inventory object by revision id."""
2372
2015
return self.iter_inventories([revision_id]).next()
2374
def iter_inventories(self, revision_ids, ordering=None):
2017
def iter_inventories(self, revision_ids):
2375
2018
"""Get many inventories by revision_ids.
2377
2020
This will buffer some or all of the texts used in constructing the
2378
2021
inventories in memory, but will only parse a single inventory at a
2381
:param revision_ids: The expected revision ids of the inventories.
2382
:param ordering: optional ordering, e.g. 'topological'. If not
2383
specified, the order of revision_ids will be preserved (by
2384
buffering if necessary).
2385
2024
:return: An iterator of inventories.
2387
2026
if ((None in revision_ids)
2388
2027
or (_mod_revision.NULL_REVISION in revision_ids)):
2389
2028
raise ValueError('cannot get null revision inventory')
2390
return self._iter_inventories(revision_ids, ordering)
2029
return self._iter_inventories(revision_ids)
2392
def _iter_inventories(self, revision_ids, ordering):
2031
def _iter_inventories(self, revision_ids):
2393
2032
"""single-document based inventory iteration."""
2394
inv_xmls = self._iter_inventory_xmls(revision_ids, ordering)
2395
for text, revision_id in inv_xmls:
2396
yield self._deserialise_inventory(revision_id, text)
2033
for text, revision_id in self._iter_inventory_xmls(revision_ids):
2034
yield self.deserialise_inventory(revision_id, text)
2398
def _iter_inventory_xmls(self, revision_ids, ordering):
2399
if ordering is None:
2400
order_as_requested = True
2401
ordering = 'unordered'
2403
order_as_requested = False
2036
def _iter_inventory_xmls(self, revision_ids):
2404
2037
keys = [(revision_id,) for revision_id in revision_ids]
2407
if order_as_requested:
2408
key_iter = iter(keys)
2409
next_key = key_iter.next()
2410
stream = self.inventories.get_record_stream(keys, ordering, True)
2038
stream = self.inventories.get_record_stream(keys, 'unordered', True)
2411
2039
text_chunks = {}
2412
2040
for record in stream:
2413
2041
if record.storage_kind != 'absent':
2414
chunks = record.get_bytes_as('chunked')
2415
if order_as_requested:
2416
text_chunks[record.key] = chunks
2418
yield ''.join(chunks), record.key[-1]
2042
text_chunks[record.key] = record.get_bytes_as('chunked')
2420
2044
raise errors.NoSuchRevision(self, record.key)
2421
if order_as_requested:
2422
# Yield as many results as we can while preserving order.
2423
while next_key in text_chunks:
2424
chunks = text_chunks.pop(next_key)
2425
yield ''.join(chunks), next_key[-1]
2427
next_key = key_iter.next()
2428
except StopIteration:
2429
# We still want to fully consume the get_record_stream,
2430
# just in case it is not actually finished at this point
2046
chunks = text_chunks.pop(key)
2047
yield ''.join(chunks), key[-1]
2434
def _deserialise_inventory(self, revision_id, xml):
2049
def deserialise_inventory(self, revision_id, xml):
2435
2050
"""Transform the xml into an inventory object.
2437
2052
:param revision_id: The expected revision id of the inventory.
2438
2053
:param xml: A serialised inventory.
2440
2055
result = self._serializer.read_inventory_from_string(xml, revision_id,
2441
entry_cache=self._inventory_entry_cache,
2442
return_from_cache=self._safe_to_return_from_cache)
2056
entry_cache=self._inventory_entry_cache)
2443
2057
if result.revision_id != revision_id:
2444
2058
raise AssertionError('revision id mismatch %s != %s' % (
2445
2059
result.revision_id, revision_id))
2062
def serialise_inventory(self, inv):
2063
return self._serializer.write_inventory_to_string(inv)
2065
def _serialise_inventory_to_lines(self, inv):
2066
return self._serializer.write_inventory_to_lines(inv)
2448
2068
def get_serializer_format(self):
2449
2069
return self._serializer.format_num
2451
2071
@needs_read_lock
2452
def _get_inventory_xml(self, revision_id):
2453
"""Get serialized inventory as a string."""
2454
texts = self._iter_inventory_xmls([revision_id], 'unordered')
2072
def get_inventory_xml(self, revision_id):
2073
"""Get inventory XML as a file object."""
2074
texts = self._iter_inventory_xmls([revision_id])
2456
2076
text, revision_id = texts.next()
2457
2077
except StopIteration:
2458
2078
raise errors.HistoryMissing(self, 'inventory', revision_id)
2461
def get_rev_id_for_revno(self, revno, known_pair):
2462
"""Return the revision id of a revno, given a later (revno, revid)
2463
pair in the same history.
2465
:return: if found (True, revid). If the available history ran out
2466
before reaching the revno, then this returns
2467
(False, (closest_revno, closest_revid)).
2082
def get_inventory_sha1(self, revision_id):
2083
"""Return the sha1 hash of the inventory entry
2469
known_revno, known_revid = known_pair
2470
partial_history = [known_revid]
2471
distance_from_known = known_revno - revno
2472
if distance_from_known < 0:
2474
'requested revno (%d) is later than given known revno (%d)'
2475
% (revno, known_revno))
2478
self, partial_history, stop_index=distance_from_known)
2479
except errors.RevisionNotPresent, err:
2480
if err.revision_id == known_revid:
2481
# The start revision (known_revid) wasn't found.
2483
# This is a stacked repository with no fallbacks, or a there's a
2484
# left-hand ghost. Either way, even though the revision named in
2485
# the error isn't in this repo, we know it's the next step in this
2486
# left-hand history.
2487
partial_history.append(err.revision_id)
2488
if len(partial_history) <= distance_from_known:
2489
# Didn't find enough history to get a revid for the revno.
2490
earliest_revno = known_revno - len(partial_history) + 1
2491
return (False, (earliest_revno, partial_history[-1]))
2492
if len(partial_history) - 1 > distance_from_known:
2493
raise AssertionError('_iter_for_revno returned too much history')
2494
return (True, partial_history[-1])
2085
return self.get_revision(revision_id).inventory_sha1
2496
2087
def iter_reverse_revision_history(self, revision_id):
2497
2088
"""Iterate backwards through revision ids in the lefthand history
2749
2335
return record.get_bytes_as('fulltext')
2751
2337
@needs_read_lock
2752
def check(self, revision_ids=None, callback_refs=None, check_repo=True):
2338
def check(self, revision_ids=None):
2753
2339
"""Check consistency of all history of given revision_ids.
2755
2341
Different repository implementations should override _check().
2757
2343
:param revision_ids: A non-empty list of revision_ids whose ancestry
2758
2344
will be checked. Typically the last revision_id of a branch.
2759
:param callback_refs: A dict of check-refs to resolve and callback
2760
the check/_check method on the items listed as wanting the ref.
2762
:param check_repo: If False do not check the repository contents, just
2763
calculate the data callback_refs requires and call them back.
2765
return self._check(revision_ids, callback_refs=callback_refs,
2766
check_repo=check_repo)
2346
return self._check(revision_ids)
2768
def _check(self, revision_ids, callback_refs, check_repo):
2769
result = check.Check(self, check_repo=check_repo)
2770
result.check(callback_refs)
2348
def _check(self, revision_ids):
2349
result = check.Check(self)
2773
def _warn_if_deprecated(self, branch=None):
2353
def _warn_if_deprecated(self):
2774
2354
global _deprecation_warning_done
2775
2355
if _deprecation_warning_done:
2779
conf = config.GlobalConfig()
2781
conf = branch.get_config()
2782
if conf.suppress_warning('format_deprecation'):
2784
warning("Format %s for %s is deprecated -"
2785
" please use 'bzr upgrade' to get better performance"
2786
% (self._format, self.bzrdir.transport.base))
2788
_deprecation_warning_done = True
2357
_deprecation_warning_done = True
2358
warning("Format %s for %s is deprecated - please use 'bzr upgrade' to get better performance"
2359
% (self._format, self.bzrdir.transport.base))
2790
2361
def supports_rich_root(self):
2791
2362
return self._format.rich_root_data
3730
3242
return self.source.revision_ids_to_search_result(result_set)
3733
class InterDifferingSerializer(InterRepository):
3245
class InterPackRepo(InterSameDataRepository):
3246
"""Optimised code paths between Pack based repositories."""
3249
def _get_repo_format_to_test(self):
3250
from bzrlib.repofmt import pack_repo
3251
return pack_repo.RepositoryFormatKnitPack1()
3254
def is_compatible(source, target):
3255
"""Be compatible with known Pack formats.
3257
We don't test for the stores being of specific types because that
3258
could lead to confusing results, and there is no need to be
3261
from bzrlib.repofmt.pack_repo import RepositoryFormatPack
3263
are_packs = (isinstance(source._format, RepositoryFormatPack) and
3264
isinstance(target._format, RepositoryFormatPack))
3265
except AttributeError:
3267
return are_packs and InterRepository._same_model(source, target)
3270
def fetch(self, revision_id=None, pb=None, find_ghosts=False,
3272
"""See InterRepository.fetch()."""
3273
if (len(self.source._fallback_repositories) > 0 or
3274
len(self.target._fallback_repositories) > 0):
3275
# The pack layer is not aware of fallback repositories, so when
3276
# fetching from a stacked repository or into a stacked repository
3277
# we use the generic fetch logic which uses the VersionedFiles
3278
# attributes on repository.
3279
from bzrlib.fetch import RepoFetcher
3280
fetcher = RepoFetcher(self.target, self.source, revision_id,
3281
pb, find_ghosts, fetch_spec=fetch_spec)
3282
if fetch_spec is not None:
3283
if len(list(fetch_spec.heads)) != 1:
3284
raise AssertionError(
3285
"InterPackRepo.fetch doesn't support "
3286
"fetching multiple heads yet.")
3287
revision_id = list(fetch_spec.heads)[0]
3289
if revision_id is None:
3291
# everything to do - use pack logic
3292
# to fetch from all packs to one without
3293
# inventory parsing etc, IFF nothing to be copied is in the target.
3295
source_revision_ids = frozenset(self.source.all_revision_ids())
3296
revision_ids = source_revision_ids - \
3297
frozenset(self.target.get_parent_map(source_revision_ids))
3298
revision_keys = [(revid,) for revid in revision_ids]
3299
index = self.target._pack_collection.revision_index.combined_index
3300
present_revision_ids = set(item[1][0] for item in
3301
index.iter_entries(revision_keys))
3302
revision_ids = set(revision_ids) - present_revision_ids
3303
# implementing the TODO will involve:
3304
# - detecting when all of a pack is selected
3305
# - avoiding as much as possible pre-selection, so the
3306
# more-core routines such as create_pack_from_packs can filter in
3307
# a just-in-time fashion. (though having a HEADS list on a
3308
# repository might make this a lot easier, because we could
3309
# sensibly detect 'new revisions' without doing a full index scan.
3310
elif _mod_revision.is_null(revision_id):
3315
revision_ids = self.search_missing_revision_ids(revision_id,
3316
find_ghosts=find_ghosts).get_keys()
3317
except errors.NoSuchRevision:
3318
raise errors.InstallFailed([revision_id])
3319
if len(revision_ids) == 0:
3321
return self._pack(self.source, self.target, revision_ids)
3323
def _pack(self, source, target, revision_ids):
3324
from bzrlib.repofmt.pack_repo import Packer
3325
packs = source._pack_collection.all_packs()
3326
pack = Packer(self.target._pack_collection, packs, '.fetch',
3327
revision_ids).pack()
3328
if pack is not None:
3329
self.target._pack_collection._save_pack_names()
3330
copied_revs = pack.get_revision_count()
3331
# Trigger an autopack. This may duplicate effort as we've just done
3332
# a pack creation, but for now it is simpler to think about as
3333
# 'upload data, then repack if needed'.
3334
self.target._pack_collection.autopack()
3335
return (copied_revs, [])
3340
def search_missing_revision_ids(self, revision_id=None, find_ghosts=True):
3341
"""See InterRepository.missing_revision_ids().
3343
:param find_ghosts: Find ghosts throughout the ancestry of
3346
if not find_ghosts and revision_id is not None:
3347
return self._walk_to_common_revisions([revision_id])
3348
elif revision_id is not None:
3349
# Find ghosts: search for revisions pointing from one repository to
3350
# the other, and vice versa, anywhere in the history of revision_id.
3351
graph = self.target.get_graph(other_repository=self.source)
3352
searcher = graph._make_breadth_first_searcher([revision_id])
3356
next_revs, ghosts = searcher.next_with_ghosts()
3357
except StopIteration:
3359
if revision_id in ghosts:
3360
raise errors.NoSuchRevision(self.source, revision_id)
3361
found_ids.update(next_revs)
3362
found_ids.update(ghosts)
3363
found_ids = frozenset(found_ids)
3364
# Double query here: should be able to avoid this by changing the
3365
# graph api further.
3366
result_set = found_ids - frozenset(
3367
self.target.get_parent_map(found_ids))
3369
source_ids = self.source.all_revision_ids()
3370
# source_ids is the worst possible case we may need to pull.
3371
# now we want to filter source_ids against what we actually
3372
# have in target, but don't try to check for existence where we know
3373
# we do not have a revision as that would be pointless.
3374
target_ids = set(self.target.all_revision_ids())
3375
result_set = set(source_ids).difference(target_ids)
3376
return self.source.revision_ids_to_search_result(result_set)
3379
class InterDifferingSerializer(InterKnitRepo):
3736
3382
def _get_repo_format_to_test(self):
3740
3386
def is_compatible(source, target):
3741
3387
"""Be compatible with Knit2 source and Knit3 target"""
3742
# This is redundant with format.check_conversion_target(), however that
3743
# raises an exception, and we just want to say "False" as in we won't
3744
# support converting between these formats.
3745
if 'IDS_never' in debug.debug_flags:
3747
if source.supports_rich_root() and not target.supports_rich_root():
3749
if (source._format.supports_tree_reference
3750
and not target._format.supports_tree_reference):
3752
if target._fallback_repositories and target._format.supports_chks:
3753
# IDS doesn't know how to copy CHKs for the parent inventories it
3754
# adds to stacked repos.
3756
if 'IDS_always' in debug.debug_flags:
3758
# Only use this code path for local source and target. IDS does far
3759
# too much IO (both bandwidth and roundtrips) over a network.
3760
if not source.bzrdir.transport.base.startswith('file:///'):
3762
if not target.bzrdir.transport.base.startswith('file:///'):
3388
if source.supports_rich_root() != target.supports_rich_root():
3390
# Ideally, we'd support fetching if the source had no tree references
3391
# even if it supported them...
3392
if (getattr(source, '_format.supports_tree_reference', False) and
3393
not getattr(target, '_format.supports_tree_reference', False)):
3766
def _get_trees(self, revision_ids, cache):
3768
for rev_id in revision_ids:
3770
possible_trees.append((rev_id, cache[rev_id]))
3772
# Not cached, but inventory might be present anyway.
3774
tree = self.source.revision_tree(rev_id)
3775
except errors.NoSuchRevision:
3776
# Nope, parent is ghost.
3779
cache[rev_id] = tree
3780
possible_trees.append((rev_id, tree))
3781
return possible_trees
3783
def _get_delta_for_revision(self, tree, parent_ids, possible_trees):
3397
def _get_delta_for_revision(self, tree, parent_ids, basis_id, cache):
3784
3398
"""Get the best delta and base for this revision.
3786
3400
:return: (basis_id, delta)
3402
possible_trees = [(parent_id, cache[parent_id])
3403
for parent_id in parent_ids
3404
if parent_id in cache]
3405
if len(possible_trees) == 0:
3406
# There either aren't any parents, or the parents aren't in the
3407
# cache, so just use the last converted tree
3408
possible_trees.append((basis_id, cache[basis_id]))
3789
# Generate deltas against each tree, to find the shortest.
3790
texts_possibly_new_in_tree = set()
3791
3410
for basis_id, basis_tree in possible_trees:
3792
3411
delta = tree.inventory._make_delta(basis_tree.inventory)
3793
for old_path, new_path, file_id, new_entry in delta:
3794
if new_path is None:
3795
# This file_id isn't present in the new rev, so we don't
3799
# Rich roots are handled elsewhere...
3801
kind = new_entry.kind
3802
if kind != 'directory' and kind != 'file':
3803
# No text record associated with this inventory entry.
3805
# This is a directory or file that has changed somehow.
3806
texts_possibly_new_in_tree.add((file_id, new_entry.revision))
3807
3412
deltas.append((len(delta), basis_id, delta))
3809
3414
return deltas[0][1:]
3811
def _fetch_parent_invs_for_stacking(self, parent_map, cache):
3812
"""Find all parent revisions that are absent, but for which the
3813
inventory is present, and copy those inventories.
3815
This is necessary to preserve correctness when the source is stacked
3816
without fallbacks configured. (Note that in cases like upgrade the
3817
source may be not have _fallback_repositories even though it is
3821
for parents in parent_map.values():
3822
parent_revs.update(parents)
3823
present_parents = self.source.get_parent_map(parent_revs)
3824
absent_parents = set(parent_revs).difference(present_parents)
3825
parent_invs_keys_for_stacking = self.source.inventories.get_parent_map(
3826
(rev_id,) for rev_id in absent_parents)
3827
parent_inv_ids = [key[-1] for key in parent_invs_keys_for_stacking]
3828
for parent_tree in self.source.revision_trees(parent_inv_ids):
3829
current_revision_id = parent_tree.get_revision_id()
3830
parents_parents_keys = parent_invs_keys_for_stacking[
3831
(current_revision_id,)]
3832
parents_parents = [key[-1] for key in parents_parents_keys]
3833
basis_id = _mod_revision.NULL_REVISION
3834
basis_tree = self.source.revision_tree(basis_id)
3835
delta = parent_tree.inventory._make_delta(basis_tree.inventory)
3836
self.target.add_inventory_by_delta(
3837
basis_id, delta, current_revision_id, parents_parents)
3838
cache[current_revision_id] = parent_tree
3840
def _fetch_batch(self, revision_ids, basis_id, cache, a_graph=None):
3416
def _fetch_batch(self, revision_ids, basis_id, cache):
3841
3417
"""Fetch across a few revisions.
3843
3419
:param revision_ids: The revisions to copy
3844
3420
:param basis_id: The revision_id of a tree that must be in cache, used
3845
3421
as a basis for delta when no other base is available
3846
3422
:param cache: A cache of RevisionTrees that we can use.
3847
:param a_graph: A Graph object to determine the heads() of the
3848
rich-root data stream.
3849
3423
:return: The revision_id of the last converted tree. The RevisionTree
3850
3424
for it will be in cache
3852
3426
# Walk though all revisions; get inventory deltas, copy referenced
3853
3427
# texts that delta references, insert the delta, revision and
3855
root_keys_to_create = set()
3856
3429
text_keys = set()
3857
3430
pending_deltas = []
3858
3431
pending_revisions = []
3859
3432
parent_map = self.source.get_parent_map(revision_ids)
3860
self._fetch_parent_invs_for_stacking(parent_map, cache)
3861
self.source._safe_to_return_from_cache = True
3862
3433
for tree in self.source.revision_trees(revision_ids):
3863
# Find a inventory delta for this revision.
3864
# Find text entries that need to be copied, too.
3865
3434
current_revision_id = tree.get_revision_id()
3866
3435
parent_ids = parent_map.get(current_revision_id, ())
3867
parent_trees = self._get_trees(parent_ids, cache)
3868
possible_trees = list(parent_trees)
3869
if len(possible_trees) == 0:
3870
# There either aren't any parents, or the parents are ghosts,
3871
# so just use the last converted tree.
3872
possible_trees.append((basis_id, cache[basis_id]))
3873
3436
basis_id, delta = self._get_delta_for_revision(tree, parent_ids,
3438
# Find text entries that need to be copied
3439
for old_path, new_path, file_id, entry in delta:
3440
if new_path is not None:
3441
if not (new_path or self.target.supports_rich_root()):
3442
# We don't copy the text for the root node unless the
3443
# target supports_rich_root.
3445
text_keys.add((file_id, entry.revision))
3875
3446
revision = self.source.get_revision(current_revision_id)
3876
3447
pending_deltas.append((basis_id, delta,
3877
3448
current_revision_id, revision.parent_ids))
3878
if self._converting_to_rich_root:
3879
self._revision_id_to_root_id[current_revision_id] = \
3881
# Determine which texts are in present in this revision but not in
3882
# any of the available parents.
3883
texts_possibly_new_in_tree = set()
3884
for old_path, new_path, file_id, entry in delta:
3885
if new_path is None:
3886
# This file_id isn't present in the new rev
3890
if not self.target.supports_rich_root():
3891
# The target doesn't support rich root, so we don't
3894
if self._converting_to_rich_root:
3895
# This can't be copied normally, we have to insert
3897
root_keys_to_create.add((file_id, entry.revision))
3900
texts_possibly_new_in_tree.add((file_id, entry.revision))
3901
for basis_id, basis_tree in possible_trees:
3902
basis_inv = basis_tree.inventory
3903
for file_key in list(texts_possibly_new_in_tree):
3904
file_id, file_revision = file_key
3906
entry = basis_inv[file_id]
3907
except errors.NoSuchId:
3909
if entry.revision == file_revision:
3910
texts_possibly_new_in_tree.remove(file_key)
3911
text_keys.update(texts_possibly_new_in_tree)
3912
3449
pending_revisions.append(revision)
3913
3450
cache[current_revision_id] = tree
3914
3451
basis_id = current_revision_id
3915
self.source._safe_to_return_from_cache = False
3916
3452
# Copy file texts
3917
3453
from_texts = self.source.texts
3918
3454
to_texts = self.target.texts
3919
if root_keys_to_create:
3920
root_stream = _mod_fetch._new_root_data_stream(
3921
root_keys_to_create, self._revision_id_to_root_id, parent_map,
3922
self.source, graph=a_graph)
3923
to_texts.insert_record_stream(root_stream)
3924
3455
to_texts.insert_record_stream(from_texts.get_record_stream(
3925
3456
text_keys, self.target._format._fetch_order,
3926
3457
not self.target._format._fetch_uses_deltas))
3927
# insert inventory deltas
3928
3459
for delta in pending_deltas:
3929
3460
self.target.add_inventory_by_delta(*delta)
3930
if self.target._fallback_repositories:
3931
# Make sure this stacked repository has all the parent inventories
3932
# for the new revisions that we are about to insert. We do this
3933
# before adding the revisions so that no revision is added until
3934
# all the inventories it may depend on are added.
3935
# Note that this is overzealous, as we may have fetched these in an
3938
revision_ids = set()
3939
for revision in pending_revisions:
3940
revision_ids.add(revision.revision_id)
3941
parent_ids.update(revision.parent_ids)
3942
parent_ids.difference_update(revision_ids)
3943
parent_ids.discard(_mod_revision.NULL_REVISION)
3944
parent_map = self.source.get_parent_map(parent_ids)
3945
# we iterate over parent_map and not parent_ids because we don't
3946
# want to try copying any revision which is a ghost
3947
for parent_tree in self.source.revision_trees(parent_map):
3948
current_revision_id = parent_tree.get_revision_id()
3949
parents_parents = parent_map[current_revision_id]
3950
possible_trees = self._get_trees(parents_parents, cache)
3951
if len(possible_trees) == 0:
3952
# There either aren't any parents, or the parents are
3953
# ghosts, so just use the last converted tree.
3954
possible_trees.append((basis_id, cache[basis_id]))
3955
basis_id, delta = self._get_delta_for_revision(parent_tree,
3956
parents_parents, possible_trees)
3957
self.target.add_inventory_by_delta(
3958
basis_id, delta, current_revision_id, parents_parents)
3959
3461
# insert signatures and revisions
3960
3462
for revision in pending_revisions:
4374
3796
# missing keys can handle suspending a write group).
4375
3797
write_group_tokens = self.target_repo.suspend_write_group()
4376
3798
return write_group_tokens, missing_keys
4377
hint = self.target_repo.commit_write_group()
4378
if (to_serializer != src_serializer and
4379
self.target_repo._format.pack_compresses):
4380
self.target_repo.pack(hint=hint)
3799
self.target_repo.commit_write_group()
4381
3800
return [], set()
4383
def _extract_and_insert_inventory_deltas(self, substream, serializer):
4384
target_rich_root = self.target_repo._format.rich_root_data
4385
target_tree_refs = self.target_repo._format.supports_tree_reference
4386
for record in substream:
4387
# Insert the delta directly
4388
inventory_delta_bytes = record.get_bytes_as('fulltext')
4389
deserialiser = inventory_delta.InventoryDeltaDeserializer()
4391
parse_result = deserialiser.parse_text_bytes(
4392
inventory_delta_bytes)
4393
except inventory_delta.IncompatibleInventoryDelta, err:
4394
trace.mutter("Incompatible delta: %s", err.msg)
4395
raise errors.IncompatibleRevision(self.target_repo._format)
4396
basis_id, new_id, rich_root, tree_refs, inv_delta = parse_result
4397
revision_id = new_id
4398
parents = [key[0] for key in record.parents]
4399
self.target_repo.add_inventory_by_delta(
4400
basis_id, inv_delta, revision_id, parents)
4402
def _extract_and_insert_inventories(self, substream, serializer,
3802
def _extract_and_insert_inventories(self, substream, serializer):
4404
3803
"""Generate a new inventory versionedfile in target, converting data.
4406
3805
The inventory is retrieved from the source, (deserializing it), and
4407
3806
stored in the target (reserializing it in a different format).
4409
target_rich_root = self.target_repo._format.rich_root_data
4410
target_tree_refs = self.target_repo._format.supports_tree_reference
4411
3808
for record in substream:
4412
# It's not a delta, so it must be a fulltext in the source
4413
# serializer's format.
4414
3809
bytes = record.get_bytes_as('fulltext')
4415
3810
revision_id = record.key[0]
4416
3811
inv = serializer.read_inventory_from_string(bytes, revision_id)
4417
3812
parents = [key[0] for key in record.parents]
4418
3813
self.target_repo.add_inventory(revision_id, inv, parents)
4419
# No need to keep holding this full inv in memory when the rest of
4420
# the substream is likely to be all deltas.
4423
3815
def _extract_and_insert_revisions(self, substream, serializer):
4424
3816
for record in substream:
4587
3964
return (not self.from_repository._format.rich_root_data and
4588
3965
self.to_format.rich_root_data)
4590
def _get_inventory_stream(self, revision_ids, missing=False):
4591
from_format = self.from_repository._format
4592
if (from_format.supports_chks and self.to_format.supports_chks and
4593
from_format.network_name() == self.to_format.network_name()):
4594
raise AssertionError(
4595
"this case should be handled by GroupCHKStreamSource")
4596
elif 'forceinvdeltas' in debug.debug_flags:
4597
return self._get_convertable_inventory_stream(revision_ids,
4598
delta_versus_null=missing)
4599
elif from_format.network_name() == self.to_format.network_name():
4601
return self._get_simple_inventory_stream(revision_ids,
4603
elif (not from_format.supports_chks and not self.to_format.supports_chks
4604
and from_format._serializer == self.to_format._serializer):
4605
# Essentially the same format.
4606
return self._get_simple_inventory_stream(revision_ids,
4609
# Any time we switch serializations, we want to use an
4610
# inventory-delta based approach.
4611
return self._get_convertable_inventory_stream(revision_ids,
4612
delta_versus_null=missing)
4614
def _get_simple_inventory_stream(self, revision_ids, missing=False):
4615
# NB: This currently reopens the inventory weave in source;
4616
# using a single stream interface instead would avoid this.
4617
from_weave = self.from_repository.inventories
4619
delta_closure = True
4621
delta_closure = not self.delta_on_metadata()
4622
yield ('inventories', from_weave.get_record_stream(
4623
[(rev_id,) for rev_id in revision_ids],
4624
self.inventory_fetch_order(), delta_closure))
4626
def _get_convertable_inventory_stream(self, revision_ids,
4627
delta_versus_null=False):
4628
# The two formats are sufficiently different that there is no fast
4629
# path, so we need to send just inventorydeltas, which any
4630
# sufficiently modern client can insert into any repository.
4631
# The StreamSink code expects to be able to
4632
# convert on the target, so we need to put bytes-on-the-wire that can
4633
# be converted. That means inventory deltas (if the remote is <1.19,
4634
# RemoteStreamSink will fallback to VFS to insert the deltas).
4635
yield ('inventory-deltas',
4636
self._stream_invs_as_deltas(revision_ids,
4637
delta_versus_null=delta_versus_null))
4639
def _stream_invs_as_deltas(self, revision_ids, delta_versus_null=False):
4640
"""Return a stream of inventory-deltas for the given rev ids.
4642
:param revision_ids: The list of inventories to transmit
4643
:param delta_versus_null: Don't try to find a minimal delta for this
4644
entry, instead compute the delta versus the NULL_REVISION. This
4645
effectively streams a complete inventory. Used for stuff like
4646
filling in missing parents, etc.
4648
from_repo = self.from_repository
4649
revision_keys = [(rev_id,) for rev_id in revision_ids]
4650
parent_map = from_repo.inventories.get_parent_map(revision_keys)
4651
# XXX: possibly repos could implement a more efficient iter_inv_deltas
4653
inventories = self.from_repository.iter_inventories(
4654
revision_ids, 'topological')
4655
format = from_repo._format
4656
invs_sent_so_far = set([_mod_revision.NULL_REVISION])
4657
inventory_cache = lru_cache.LRUCache(50)
4658
null_inventory = from_repo.revision_tree(
4659
_mod_revision.NULL_REVISION).inventory
4660
# XXX: ideally the rich-root/tree-refs flags would be per-revision, not
4661
# per-repo (e.g. streaming a non-rich-root revision out of a rich-root
4662
# repo back into a non-rich-root repo ought to be allowed)
4663
serializer = inventory_delta.InventoryDeltaSerializer(
4664
versioned_root=format.rich_root_data,
4665
tree_references=format.supports_tree_reference)
4666
for inv in inventories:
4667
key = (inv.revision_id,)
4668
parent_keys = parent_map.get(key, ())
4670
if not delta_versus_null and parent_keys:
4671
# The caller did not ask for complete inventories and we have
4672
# some parents that we can delta against. Make a delta against
4673
# each parent so that we can find the smallest.
4674
parent_ids = [parent_key[0] for parent_key in parent_keys]
4675
for parent_id in parent_ids:
4676
if parent_id not in invs_sent_so_far:
4677
# We don't know that the remote side has this basis, so
4680
if parent_id == _mod_revision.NULL_REVISION:
4681
parent_inv = null_inventory
4683
parent_inv = inventory_cache.get(parent_id, None)
4684
if parent_inv is None:
4685
parent_inv = from_repo.get_inventory(parent_id)
4686
candidate_delta = inv._make_delta(parent_inv)
4687
if (delta is None or
4688
len(delta) > len(candidate_delta)):
4689
delta = candidate_delta
4690
basis_id = parent_id
4692
# Either none of the parents ended up being suitable, or we
4693
# were asked to delta against NULL
4694
basis_id = _mod_revision.NULL_REVISION
4695
delta = inv._make_delta(null_inventory)
4696
invs_sent_so_far.add(inv.revision_id)
4697
inventory_cache[inv.revision_id] = inv
4698
delta_serialized = ''.join(
4699
serializer.delta_to_lines(basis_id, key[-1], delta))
4700
yield versionedfile.FulltextContentFactory(
4701
key, parent_keys, None, delta_serialized)
4704
def _iter_for_revno(repo, partial_history_cache, stop_index=None,
4705
stop_revision=None):
4706
"""Extend the partial history to include a given index
4708
If a stop_index is supplied, stop when that index has been reached.
4709
If a stop_revision is supplied, stop when that revision is
4710
encountered. Otherwise, stop when the beginning of history is
4713
:param stop_index: The index which should be present. When it is
4714
present, history extension will stop.
4715
:param stop_revision: The revision id which should be present. When
4716
it is encountered, history extension will stop.
4718
start_revision = partial_history_cache[-1]
4719
iterator = repo.iter_reverse_revision_history(start_revision)
4721
#skip the last revision in the list
4724
if (stop_index is not None and
4725
len(partial_history_cache) > stop_index):
4727
if partial_history_cache[-1] == stop_revision:
4729
revision_id = iterator.next()
4730
partial_history_cache.append(revision_id)
4731
except StopIteration:
added
removed
bzrlib/repository.py
