1
# Copyright (C) 2005, 2006, 2007, 2008, 2009 Canonical Ltd
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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
17
from bzrlib.lazy_import import lazy_import
18
lazy_import(globals(), """
40
revision as _mod_revision,
46
from bzrlib.bundle import serializer
47
from bzrlib.revisiontree import RevisionTree
48
from bzrlib.store.versioned import VersionedFileStore
49
from bzrlib.testament import Testament
52
from bzrlib.decorators import needs_read_lock, needs_write_lock, only_raises
53
from bzrlib.inter import InterObject
54
from bzrlib.inventory import (
60
from bzrlib import registry
61
from bzrlib.trace import (
62
log_exception_quietly, note, mutter, mutter_callsite, warning)
65
# Old formats display a warning, but only once
66
_deprecation_warning_done = False
69
class CommitBuilder(object):
70
"""Provides an interface to build up a commit.
72
This allows describing a tree to be committed without needing to
73
know the internals of the format of the repository.
76
# all clients should supply tree roots.
77
record_root_entry = True
78
# the default CommitBuilder does not manage trees whose root is versioned.
79
_versioned_root = False
81
def __init__(self, repository, parents, config, timestamp=None,
82
timezone=None, committer=None, revprops=None,
84
"""Initiate a CommitBuilder.
86
:param repository: Repository to commit to.
87
:param parents: Revision ids of the parents of the new revision.
88
:param config: Configuration to use.
89
:param timestamp: Optional timestamp recorded for commit.
90
:param timezone: Optional timezone for timestamp.
91
:param committer: Optional committer to set for commit.
92
:param revprops: Optional dictionary of revision properties.
93
:param revision_id: Optional revision id.
98
self._committer = self._config.username()
100
self._committer = committer
102
self.new_inventory = Inventory(None)
103
self._new_revision_id = revision_id
104
self.parents = parents
105
self.repository = repository
108
if revprops is not None:
109
self._validate_revprops(revprops)
110
self._revprops.update(revprops)
112
if timestamp is None:
113
timestamp = time.time()
114
# Restrict resolution to 1ms
115
self._timestamp = round(timestamp, 3)
118
self._timezone = osutils.local_time_offset()
120
self._timezone = int(timezone)
122
self._generate_revision_if_needed()
123
self.__heads = graph.HeadsCache(repository.get_graph()).heads
124
self._basis_delta = []
125
# API compatibility, older code that used CommitBuilder did not call
126
# .record_delete(), which means the delta that is computed would not be
127
# valid. Callers that will call record_delete() should call
128
# .will_record_deletes() to indicate that.
129
self._recording_deletes = False
130
# memo'd check for no-op commits.
131
self._any_changes = False
133
def any_changes(self):
134
"""Return True if any entries were changed.
136
This includes merge-only changes. It is the core for the --unchanged
139
:return: True if any changes have occured.
141
return self._any_changes
143
def _validate_unicode_text(self, text, context):
144
"""Verify things like commit messages don't have bogus characters."""
146
raise ValueError('Invalid value for %s: %r' % (context, text))
148
def _validate_revprops(self, revprops):
149
for key, value in revprops.iteritems():
150
# We know that the XML serializers do not round trip '\r'
151
# correctly, so refuse to accept them
152
if not isinstance(value, basestring):
153
raise ValueError('revision property (%s) is not a valid'
154
' (unicode) string: %r' % (key, value))
155
self._validate_unicode_text(value,
156
'revision property (%s)' % (key,))
158
def commit(self, message):
159
"""Make the actual commit.
161
:return: The revision id of the recorded revision.
163
self._validate_unicode_text(message, 'commit message')
164
rev = _mod_revision.Revision(
165
timestamp=self._timestamp,
166
timezone=self._timezone,
167
committer=self._committer,
169
inventory_sha1=self.inv_sha1,
170
revision_id=self._new_revision_id,
171
properties=self._revprops)
172
rev.parent_ids = self.parents
173
self.repository.add_revision(self._new_revision_id, rev,
174
self.new_inventory, self._config)
175
self.repository.commit_write_group()
176
return self._new_revision_id
179
"""Abort the commit that is being built.
181
self.repository.abort_write_group()
183
def revision_tree(self):
184
"""Return the tree that was just committed.
186
After calling commit() this can be called to get a RevisionTree
187
representing the newly committed tree. This is preferred to
188
calling Repository.revision_tree() because that may require
189
deserializing the inventory, while we already have a copy in
192
if self.new_inventory is None:
193
self.new_inventory = self.repository.get_inventory(
194
self._new_revision_id)
195
return RevisionTree(self.repository, self.new_inventory,
196
self._new_revision_id)
198
def finish_inventory(self):
199
"""Tell the builder that the inventory is finished.
201
:return: The inventory id in the repository, which can be used with
202
repository.get_inventory.
204
if self.new_inventory is None:
205
# an inventory delta was accumulated without creating a new
207
basis_id = self.basis_delta_revision
208
self.inv_sha1 = self.repository.add_inventory_by_delta(
209
basis_id, self._basis_delta, self._new_revision_id,
212
if self.new_inventory.root is None:
213
raise AssertionError('Root entry should be supplied to'
214
' record_entry_contents, as of bzr 0.10.')
215
self.new_inventory.add(InventoryDirectory(ROOT_ID, '', None))
216
self.new_inventory.revision_id = self._new_revision_id
217
self.inv_sha1 = self.repository.add_inventory(
218
self._new_revision_id,
222
return self._new_revision_id
224
def _gen_revision_id(self):
225
"""Return new revision-id."""
226
return generate_ids.gen_revision_id(self._config.username(),
229
def _generate_revision_if_needed(self):
230
"""Create a revision id if None was supplied.
232
If the repository can not support user-specified revision ids
233
they should override this function and raise CannotSetRevisionId
234
if _new_revision_id is not None.
236
:raises: CannotSetRevisionId
238
if self._new_revision_id is None:
239
self._new_revision_id = self._gen_revision_id()
240
self.random_revid = True
242
self.random_revid = False
244
def _heads(self, file_id, revision_ids):
245
"""Calculate the graph heads for revision_ids in the graph of file_id.
247
This can use either a per-file graph or a global revision graph as we
248
have an identity relationship between the two graphs.
250
return self.__heads(revision_ids)
252
def _check_root(self, ie, parent_invs, tree):
253
"""Helper for record_entry_contents.
255
:param ie: An entry being added.
256
:param parent_invs: The inventories of the parent revisions of the
258
:param tree: The tree that is being committed.
260
# In this revision format, root entries have no knit or weave When
261
# serializing out to disk and back in root.revision is always
263
ie.revision = self._new_revision_id
265
def _require_root_change(self, tree):
266
"""Enforce an appropriate root object change.
268
This is called once when record_iter_changes is called, if and only if
269
the root was not in the delta calculated by record_iter_changes.
271
:param tree: The tree which is being committed.
273
# NB: if there are no parents then this method is not called, so no
274
# need to guard on parents having length.
275
entry = entry_factory['directory'](tree.path2id(''), '',
277
entry.revision = self._new_revision_id
278
self._basis_delta.append(('', '', entry.file_id, entry))
280
def _get_delta(self, ie, basis_inv, path):
281
"""Get a delta against the basis inventory for ie."""
282
if ie.file_id not in basis_inv:
284
result = (None, path, ie.file_id, ie)
285
self._basis_delta.append(result)
287
elif ie != basis_inv[ie.file_id]:
289
# TODO: avoid tis id2path call.
290
result = (basis_inv.id2path(ie.file_id), path, ie.file_id, ie)
291
self._basis_delta.append(result)
297
def get_basis_delta(self):
298
"""Return the complete inventory delta versus the basis inventory.
300
This has been built up with the calls to record_delete and
301
record_entry_contents. The client must have already called
302
will_record_deletes() to indicate that they will be generating a
305
:return: An inventory delta, suitable for use with apply_delta, or
306
Repository.add_inventory_by_delta, etc.
308
if not self._recording_deletes:
309
raise AssertionError("recording deletes not activated.")
310
return self._basis_delta
312
def record_delete(self, path, file_id):
313
"""Record that a delete occured against a basis tree.
315
This is an optional API - when used it adds items to the basis_delta
316
being accumulated by the commit builder. It cannot be called unless the
317
method will_record_deletes() has been called to inform the builder that
318
a delta is being supplied.
320
:param path: The path of the thing deleted.
321
:param file_id: The file id that was deleted.
323
if not self._recording_deletes:
324
raise AssertionError("recording deletes not activated.")
325
delta = (path, None, file_id, None)
326
self._basis_delta.append(delta)
327
self._any_changes = True
330
def will_record_deletes(self):
331
"""Tell the commit builder that deletes are being notified.
333
This enables the accumulation of an inventory delta; for the resulting
334
commit to be valid, deletes against the basis MUST be recorded via
335
builder.record_delete().
337
self._recording_deletes = True
339
basis_id = self.parents[0]
341
basis_id = _mod_revision.NULL_REVISION
342
self.basis_delta_revision = basis_id
344
def record_entry_contents(self, ie, parent_invs, path, tree,
346
"""Record the content of ie from tree into the commit if needed.
348
Side effect: sets ie.revision when unchanged
350
:param ie: An inventory entry present in the commit.
351
:param parent_invs: The inventories of the parent revisions of the
353
:param path: The path the entry is at in the tree.
354
:param tree: The tree which contains this entry and should be used to
356
:param content_summary: Summary data from the tree about the paths
357
content - stat, length, exec, sha/link target. This is only
358
accessed when the entry has a revision of None - that is when it is
359
a candidate to commit.
360
:return: A tuple (change_delta, version_recorded, fs_hash).
361
change_delta is an inventory_delta change for this entry against
362
the basis tree of the commit, or None if no change occured against
364
version_recorded is True if a new version of the entry has been
365
recorded. For instance, committing a merge where a file was only
366
changed on the other side will return (delta, False).
367
fs_hash is either None, or the hash details for the path (currently
368
a tuple of the contents sha1 and the statvalue returned by
369
tree.get_file_with_stat()).
371
if self.new_inventory.root is None:
372
if ie.parent_id is not None:
373
raise errors.RootMissing()
374
self._check_root(ie, parent_invs, tree)
375
if ie.revision is None:
376
kind = content_summary[0]
378
# ie is carried over from a prior commit
380
# XXX: repository specific check for nested tree support goes here - if
381
# the repo doesn't want nested trees we skip it ?
382
if (kind == 'tree-reference' and
383
not self.repository._format.supports_tree_reference):
384
# mismatch between commit builder logic and repository:
385
# this needs the entry creation pushed down into the builder.
386
raise NotImplementedError('Missing repository subtree support.')
387
self.new_inventory.add(ie)
389
# TODO: slow, take it out of the inner loop.
391
basis_inv = parent_invs[0]
393
basis_inv = Inventory(root_id=None)
395
# ie.revision is always None if the InventoryEntry is considered
396
# for committing. We may record the previous parents revision if the
397
# content is actually unchanged against a sole head.
398
if ie.revision is not None:
399
if not self._versioned_root and path == '':
400
# repositories that do not version the root set the root's
401
# revision to the new commit even when no change occurs (more
402
# specifically, they do not record a revision on the root; and
403
# the rev id is assigned to the root during deserialisation -
404
# this masks when a change may have occurred against the basis.
405
# To match this we always issue a delta, because the revision
406
# of the root will always be changing.
407
if ie.file_id in basis_inv:
408
delta = (basis_inv.id2path(ie.file_id), path,
412
delta = (None, path, ie.file_id, ie)
413
self._basis_delta.append(delta)
414
return delta, False, None
416
# we don't need to commit this, because the caller already
417
# determined that an existing revision of this file is
418
# appropriate. If its not being considered for committing then
419
# it and all its parents to the root must be unaltered so
420
# no-change against the basis.
421
if ie.revision == self._new_revision_id:
422
raise AssertionError("Impossible situation, a skipped "
423
"inventory entry (%r) claims to be modified in this "
424
"commit (%r).", (ie, self._new_revision_id))
425
return None, False, None
426
# XXX: Friction: parent_candidates should return a list not a dict
427
# so that we don't have to walk the inventories again.
428
parent_candiate_entries = ie.parent_candidates(parent_invs)
429
head_set = self._heads(ie.file_id, parent_candiate_entries.keys())
431
for inv in parent_invs:
432
if ie.file_id in inv:
433
old_rev = inv[ie.file_id].revision
434
if old_rev in head_set:
435
heads.append(inv[ie.file_id].revision)
436
head_set.remove(inv[ie.file_id].revision)
439
# now we check to see if we need to write a new record to the
441
# We write a new entry unless there is one head to the ancestors, and
442
# the kind-derived content is unchanged.
444
# Cheapest check first: no ancestors, or more the one head in the
445
# ancestors, we write a new node.
449
# There is a single head, look it up for comparison
450
parent_entry = parent_candiate_entries[heads[0]]
451
# if the non-content specific data has changed, we'll be writing a
453
if (parent_entry.parent_id != ie.parent_id or
454
parent_entry.name != ie.name):
456
# now we need to do content specific checks:
458
# if the kind changed the content obviously has
459
if kind != parent_entry.kind:
461
# Stat cache fingerprint feedback for the caller - None as we usually
462
# don't generate one.
465
if content_summary[2] is None:
466
raise ValueError("Files must not have executable = None")
468
# We can't trust a check of the file length because of content
470
if (# if the exec bit has changed we have to store:
471
parent_entry.executable != content_summary[2]):
473
elif parent_entry.text_sha1 == content_summary[3]:
474
# all meta and content is unchanged (using a hash cache
475
# hit to check the sha)
476
ie.revision = parent_entry.revision
477
ie.text_size = parent_entry.text_size
478
ie.text_sha1 = parent_entry.text_sha1
479
ie.executable = parent_entry.executable
480
return self._get_delta(ie, basis_inv, path), False, None
482
# Either there is only a hash change(no hash cache entry,
483
# or same size content change), or there is no change on
485
# Provide the parent's hash to the store layer, so that the
486
# content is unchanged we will not store a new node.
487
nostore_sha = parent_entry.text_sha1
489
# We want to record a new node regardless of the presence or
490
# absence of a content change in the file.
492
ie.executable = content_summary[2]
493
file_obj, stat_value = tree.get_file_with_stat(ie.file_id, path)
495
text = file_obj.read()
499
ie.text_sha1, ie.text_size = self._add_text_to_weave(
500
ie.file_id, text, heads, nostore_sha)
501
# Let the caller know we generated a stat fingerprint.
502
fingerprint = (ie.text_sha1, stat_value)
503
except errors.ExistingContent:
504
# Turns out that the file content was unchanged, and we were
505
# only going to store a new node if it was changed. Carry over
507
ie.revision = parent_entry.revision
508
ie.text_size = parent_entry.text_size
509
ie.text_sha1 = parent_entry.text_sha1
510
ie.executable = parent_entry.executable
511
return self._get_delta(ie, basis_inv, path), False, None
512
elif kind == 'directory':
514
# all data is meta here, nothing specific to directory, so
516
ie.revision = parent_entry.revision
517
return self._get_delta(ie, basis_inv, path), False, None
518
self._add_text_to_weave(ie.file_id, '', heads, None)
519
elif kind == 'symlink':
520
current_link_target = content_summary[3]
522
# symlink target is not generic metadata, check if it has
524
if current_link_target != parent_entry.symlink_target:
527
# unchanged, carry over.
528
ie.revision = parent_entry.revision
529
ie.symlink_target = parent_entry.symlink_target
530
return self._get_delta(ie, basis_inv, path), False, None
531
ie.symlink_target = current_link_target
532
self._add_text_to_weave(ie.file_id, '', heads, None)
533
elif kind == 'tree-reference':
535
if content_summary[3] != parent_entry.reference_revision:
538
# unchanged, carry over.
539
ie.reference_revision = parent_entry.reference_revision
540
ie.revision = parent_entry.revision
541
return self._get_delta(ie, basis_inv, path), False, None
542
ie.reference_revision = content_summary[3]
543
if ie.reference_revision is None:
544
raise AssertionError("invalid content_summary for nested tree: %r"
545
% (content_summary,))
546
self._add_text_to_weave(ie.file_id, '', heads, None)
548
raise NotImplementedError('unknown kind')
549
ie.revision = self._new_revision_id
550
self._any_changes = True
551
return self._get_delta(ie, basis_inv, path), True, fingerprint
553
def record_iter_changes(self, tree, basis_revision_id, iter_changes,
554
_entry_factory=entry_factory):
555
"""Record a new tree via iter_changes.
557
:param tree: The tree to obtain text contents from for changed objects.
558
:param basis_revision_id: The revision id of the tree the iter_changes
559
has been generated against. Currently assumed to be the same
560
as self.parents[0] - if it is not, errors may occur.
561
:param iter_changes: An iter_changes iterator with the changes to apply
562
to basis_revision_id. The iterator must not include any items with
563
a current kind of None - missing items must be either filtered out
564
or errored-on beefore record_iter_changes sees the item.
565
:param _entry_factory: Private method to bind entry_factory locally for
567
:return: A generator of (file_id, relpath, fs_hash) tuples for use with
570
# Create an inventory delta based on deltas between all the parents and
571
# deltas between all the parent inventories. We use inventory delta's
572
# between the inventory objects because iter_changes masks
573
# last-changed-field only changes.
575
# file_id -> change map, change is fileid, paths, changed, versioneds,
576
# parents, names, kinds, executables
578
# {file_id -> revision_id -> inventory entry, for entries in parent
579
# trees that are not parents[0]
583
revtrees = list(self.repository.revision_trees(self.parents))
584
except errors.NoSuchRevision:
585
# one or more ghosts, slow path.
587
for revision_id in self.parents:
589
revtrees.append(self.repository.revision_tree(revision_id))
590
except errors.NoSuchRevision:
592
basis_revision_id = _mod_revision.NULL_REVISION
594
revtrees.append(self.repository.revision_tree(
595
_mod_revision.NULL_REVISION))
596
# The basis inventory from a repository
598
basis_inv = revtrees[0].inventory
600
basis_inv = self.repository.revision_tree(
601
_mod_revision.NULL_REVISION).inventory
602
if len(self.parents) > 0:
603
if basis_revision_id != self.parents[0] and not ghost_basis:
605
"arbitrary basis parents not yet supported with merges")
606
for revtree in revtrees[1:]:
607
for change in revtree.inventory._make_delta(basis_inv):
608
if change[1] is None:
609
# Not present in this parent.
611
if change[2] not in merged_ids:
612
if change[0] is not None:
613
basis_entry = basis_inv[change[2]]
614
merged_ids[change[2]] = [
616
basis_entry.revision,
619
parent_entries[change[2]] = {
621
basis_entry.revision:basis_entry,
623
change[3].revision:change[3],
626
merged_ids[change[2]] = [change[3].revision]
627
parent_entries[change[2]] = {change[3].revision:change[3]}
629
merged_ids[change[2]].append(change[3].revision)
630
parent_entries[change[2]][change[3].revision] = change[3]
633
# Setup the changes from the tree:
634
# changes maps file_id -> (change, [parent revision_ids])
636
for change in iter_changes:
637
# This probably looks up in basis_inv way to much.
638
if change[1][0] is not None:
639
head_candidate = [basis_inv[change[0]].revision]
642
changes[change[0]] = change, merged_ids.get(change[0],
644
unchanged_merged = set(merged_ids) - set(changes)
645
# Extend the changes dict with synthetic changes to record merges of
647
for file_id in unchanged_merged:
648
# Record a merged version of these items that did not change vs the
649
# basis. This can be either identical parallel changes, or a revert
650
# of a specific file after a merge. The recorded content will be
651
# that of the current tree (which is the same as the basis), but
652
# the per-file graph will reflect a merge.
653
# NB:XXX: We are reconstructing path information we had, this
654
# should be preserved instead.
655
# inv delta change: (file_id, (path_in_source, path_in_target),
656
# changed_content, versioned, parent, name, kind,
659
basis_entry = basis_inv[file_id]
660
except errors.NoSuchId:
661
# a change from basis->some_parents but file_id isn't in basis
662
# so was new in the merge, which means it must have changed
663
# from basis -> current, and as it hasn't the add was reverted
664
# by the user. So we discard this change.
668
(basis_inv.id2path(file_id), tree.id2path(file_id)),
670
(basis_entry.parent_id, basis_entry.parent_id),
671
(basis_entry.name, basis_entry.name),
672
(basis_entry.kind, basis_entry.kind),
673
(basis_entry.executable, basis_entry.executable))
674
changes[file_id] = (change, merged_ids[file_id])
675
# changes contains tuples with the change and a set of inventory
676
# candidates for the file.
678
# old_path, new_path, file_id, new_inventory_entry
679
seen_root = False # Is the root in the basis delta?
680
inv_delta = self._basis_delta
681
modified_rev = self._new_revision_id
682
for change, head_candidates in changes.values():
683
if change[3][1]: # versioned in target.
684
# Several things may be happening here:
685
# We may have a fork in the per-file graph
686
# - record a change with the content from tree
687
# We may have a change against < all trees
688
# - carry over the tree that hasn't changed
689
# We may have a change against all trees
690
# - record the change with the content from tree
693
entry = _entry_factory[kind](file_id, change[5][1],
695
head_set = self._heads(change[0], set(head_candidates))
698
for head_candidate in head_candidates:
699
if head_candidate in head_set:
700
heads.append(head_candidate)
701
head_set.remove(head_candidate)
704
# Could be a carry-over situation:
705
parent_entry_revs = parent_entries.get(file_id, None)
706
if parent_entry_revs:
707
parent_entry = parent_entry_revs.get(heads[0], None)
710
if parent_entry is None:
711
# The parent iter_changes was called against is the one
712
# that is the per-file head, so any change is relevant
713
# iter_changes is valid.
714
carry_over_possible = False
716
# could be a carry over situation
717
# A change against the basis may just indicate a merge,
718
# we need to check the content against the source of the
719
# merge to determine if it was changed after the merge
721
if (parent_entry.kind != entry.kind or
722
parent_entry.parent_id != entry.parent_id or
723
parent_entry.name != entry.name):
724
# Metadata common to all entries has changed
725
# against per-file parent
726
carry_over_possible = False
728
carry_over_possible = True
729
# per-type checks for changes against the parent_entry
732
# Cannot be a carry-over situation
733
carry_over_possible = False
734
# Populate the entry in the delta
736
# XXX: There is still a small race here: If someone reverts the content of a file
737
# after iter_changes examines and decides it has changed,
738
# we will unconditionally record a new version even if some
739
# other process reverts it while commit is running (with
740
# the revert happening after iter_changes did it's
743
entry.executable = True
745
entry.executable = False
746
if (carry_over_possible and
747
parent_entry.executable == entry.executable):
748
# Check the file length, content hash after reading
750
nostore_sha = parent_entry.text_sha1
753
file_obj, stat_value = tree.get_file_with_stat(file_id, change[1][1])
755
text = file_obj.read()
759
entry.text_sha1, entry.text_size = self._add_text_to_weave(
760
file_id, text, heads, nostore_sha)
761
yield file_id, change[1][1], (entry.text_sha1, stat_value)
762
except errors.ExistingContent:
763
# No content change against a carry_over parent
764
# Perhaps this should also yield a fs hash update?
766
entry.text_size = parent_entry.text_size
767
entry.text_sha1 = parent_entry.text_sha1
768
elif kind == 'symlink':
770
entry.symlink_target = tree.get_symlink_target(file_id)
771
if (carry_over_possible and
772
parent_entry.symlink_target == entry.symlink_target):
775
self._add_text_to_weave(change[0], '', heads, None)
776
elif kind == 'directory':
777
if carry_over_possible:
780
# Nothing to set on the entry.
781
# XXX: split into the Root and nonRoot versions.
782
if change[1][1] != '' or self.repository.supports_rich_root():
783
self._add_text_to_weave(change[0], '', heads, None)
784
elif kind == 'tree-reference':
785
if not self.repository._format.supports_tree_reference:
786
# This isn't quite sane as an error, but we shouldn't
787
# ever see this code path in practice: tree's don't
788
# permit references when the repo doesn't support tree
790
raise errors.UnsupportedOperation(tree.add_reference,
792
reference_revision = tree.get_reference_revision(change[0])
793
entry.reference_revision = reference_revision
794
if (carry_over_possible and
795
parent_entry.reference_revision == reference_revision):
798
self._add_text_to_weave(change[0], '', heads, None)
800
raise AssertionError('unknown kind %r' % kind)
802
entry.revision = modified_rev
804
entry.revision = parent_entry.revision
807
new_path = change[1][1]
808
inv_delta.append((change[1][0], new_path, change[0], entry))
811
self.new_inventory = None
813
# This should perhaps be guarded by a check that the basis we
814
# commit against is the basis for the commit and if not do a delta
816
self._any_changes = True
818
# housekeeping root entry changes do not affect no-change commits.
819
self._require_root_change(tree)
820
self.basis_delta_revision = basis_revision_id
822
def _add_text_to_weave(self, file_id, new_text, parents, nostore_sha):
823
parent_keys = tuple([(file_id, parent) for parent in parents])
824
return self.repository.texts._add_text(
825
(file_id, self._new_revision_id), parent_keys, new_text,
826
nostore_sha=nostore_sha, random_id=self.random_revid)[0:2]
829
class RootCommitBuilder(CommitBuilder):
830
"""This commitbuilder actually records the root id"""
832
# the root entry gets versioned properly by this builder.
833
_versioned_root = True
835
def _check_root(self, ie, parent_invs, tree):
836
"""Helper for record_entry_contents.
838
:param ie: An entry being added.
839
:param parent_invs: The inventories of the parent revisions of the
841
:param tree: The tree that is being committed.
844
def _require_root_change(self, tree):
845
"""Enforce an appropriate root object change.
847
This is called once when record_iter_changes is called, if and only if
848
the root was not in the delta calculated by record_iter_changes.
850
:param tree: The tree which is being committed.
852
# versioned roots do not change unless the tree found a change.
855
######################################################################
859
class Repository(object):
860
"""Repository holding history for one or more branches.
862
The repository holds and retrieves historical information including
863
revisions and file history. It's normally accessed only by the Branch,
864
which views a particular line of development through that history.
866
The Repository builds on top of some byte storage facilies (the revisions,
867
signatures, inventories, texts and chk_bytes attributes) and a Transport,
868
which respectively provide byte storage and a means to access the (possibly
871
The byte storage facilities are addressed via tuples, which we refer to
872
as 'keys' throughout the code base. Revision_keys, inventory_keys and
873
signature_keys are all 1-tuples: (revision_id,). text_keys are two-tuples:
874
(file_id, revision_id). chk_bytes uses CHK keys - a 1-tuple with a single
875
byte string made up of a hash identifier and a hash value.
876
We use this interface because it allows low friction with the underlying
877
code that implements disk indices, network encoding and other parts of
880
:ivar revisions: A bzrlib.versionedfile.VersionedFiles instance containing
881
the serialised revisions for the repository. This can be used to obtain
882
revision graph information or to access raw serialised revisions.
883
The result of trying to insert data into the repository via this store
884
is undefined: it should be considered read-only except for implementors
886
:ivar signatures: A bzrlib.versionedfile.VersionedFiles instance containing
887
the serialised signatures for the repository. This can be used to
888
obtain access to raw serialised signatures. The result of trying to
889
insert data into the repository via this store is undefined: it should
890
be considered read-only except for implementors of repositories.
891
:ivar inventories: A bzrlib.versionedfile.VersionedFiles instance containing
892
the serialised inventories for the repository. This can be used to
893
obtain unserialised inventories. The result of trying to insert data
894
into the repository via this store is undefined: it should be
895
considered read-only except for implementors of repositories.
896
:ivar texts: A bzrlib.versionedfile.VersionedFiles instance containing the
897
texts of files and directories for the repository. This can be used to
898
obtain file texts or file graphs. Note that Repository.iter_file_bytes
899
is usually a better interface for accessing file texts.
900
The result of trying to insert data into the repository via this store
901
is undefined: it should be considered read-only except for implementors
903
:ivar chk_bytes: A bzrlib.versionedfile.VersionedFiles instance containing
904
any data the repository chooses to store or have indexed by its hash.
905
The result of trying to insert data into the repository via this store
906
is undefined: it should be considered read-only except for implementors
908
:ivar _transport: Transport for file access to repository, typically
909
pointing to .bzr/repository.
912
# What class to use for a CommitBuilder. Often its simpler to change this
913
# in a Repository class subclass rather than to override
914
# get_commit_builder.
915
_commit_builder_class = CommitBuilder
916
# The search regex used by xml based repositories to determine what things
917
# where changed in a single commit.
918
_file_ids_altered_regex = lazy_regex.lazy_compile(
919
r'file_id="(?P<file_id>[^"]+)"'
920
r'.* revision="(?P<revision_id>[^"]+)"'
923
def abort_write_group(self, suppress_errors=False):
924
"""Commit the contents accrued within the current write group.
926
:param suppress_errors: if true, abort_write_group will catch and log
927
unexpected errors that happen during the abort, rather than
928
allowing them to propagate. Defaults to False.
930
:seealso: start_write_group.
932
if self._write_group is not self.get_transaction():
933
# has an unlock or relock occured ?
936
'(suppressed) mismatched lock context and write group. %r, %r',
937
self._write_group, self.get_transaction())
939
raise errors.BzrError(
940
'mismatched lock context and write group. %r, %r' %
941
(self._write_group, self.get_transaction()))
943
self._abort_write_group()
944
except Exception, exc:
945
self._write_group = None
946
if not suppress_errors:
948
mutter('abort_write_group failed')
949
log_exception_quietly()
950
note('bzr: ERROR (ignored): %s', exc)
951
self._write_group = None
953
def _abort_write_group(self):
954
"""Template method for per-repository write group cleanup.
956
This is called during abort before the write group is considered to be
957
finished and should cleanup any internal state accrued during the write
958
group. There is no requirement that data handed to the repository be
959
*not* made available - this is not a rollback - but neither should any
960
attempt be made to ensure that data added is fully commited. Abort is
961
invoked when an error has occured so futher disk or network operations
962
may not be possible or may error and if possible should not be
966
def add_fallback_repository(self, repository):
967
"""Add a repository to use for looking up data not held locally.
969
:param repository: A repository.
971
if not self._format.supports_external_lookups:
972
raise errors.UnstackableRepositoryFormat(self._format, self.base)
974
# This repository will call fallback.unlock() when we transition to
975
# the unlocked state, so we make sure to increment the lock count
976
repository.lock_read()
977
self._check_fallback_repository(repository)
978
self._fallback_repositories.append(repository)
979
self.texts.add_fallback_versioned_files(repository.texts)
980
self.inventories.add_fallback_versioned_files(repository.inventories)
981
self.revisions.add_fallback_versioned_files(repository.revisions)
982
self.signatures.add_fallback_versioned_files(repository.signatures)
983
if self.chk_bytes is not None:
984
self.chk_bytes.add_fallback_versioned_files(repository.chk_bytes)
986
def _check_fallback_repository(self, repository):
987
"""Check that this repository can fallback to repository safely.
989
Raise an error if not.
991
:param repository: A repository to fallback to.
993
return InterRepository._assert_same_model(self, repository)
995
def add_inventory(self, revision_id, inv, parents):
996
"""Add the inventory inv to the repository as revision_id.
998
:param parents: The revision ids of the parents that revision_id
999
is known to have and are in the repository already.
1001
:returns: The validator(which is a sha1 digest, though what is sha'd is
1002
repository format specific) of the serialized inventory.
1004
if not self.is_in_write_group():
1005
raise AssertionError("%r not in write group" % (self,))
1006
_mod_revision.check_not_reserved_id(revision_id)
1007
if not (inv.revision_id is None or inv.revision_id == revision_id):
1008
raise AssertionError(
1009
"Mismatch between inventory revision"
1010
" id and insertion revid (%r, %r)"
1011
% (inv.revision_id, revision_id))
1012
if inv.root is None:
1013
raise AssertionError()
1014
return self._add_inventory_checked(revision_id, inv, parents)
1016
def _add_inventory_checked(self, revision_id, inv, parents):
1017
"""Add inv to the repository after checking the inputs.
1019
This function can be overridden to allow different inventory styles.
1021
:seealso: add_inventory, for the contract.
1023
inv_lines = self._serialise_inventory_to_lines(inv)
1024
return self._inventory_add_lines(revision_id, parents,
1025
inv_lines, check_content=False)
1027
def add_inventory_by_delta(self, basis_revision_id, delta, new_revision_id,
1028
parents, basis_inv=None, propagate_caches=False):
1029
"""Add a new inventory expressed as a delta against another revision.
1031
See the inventory developers documentation for the theory behind
1034
:param basis_revision_id: The inventory id the delta was created
1035
against. (This does not have to be a direct parent.)
1036
:param delta: The inventory delta (see Inventory.apply_delta for
1038
:param new_revision_id: The revision id that the inventory is being
1040
:param parents: The revision ids of the parents that revision_id is
1041
known to have and are in the repository already. These are supplied
1042
for repositories that depend on the inventory graph for revision
1043
graph access, as well as for those that pun ancestry with delta
1045
:param basis_inv: The basis inventory if it is already known,
1047
:param propagate_caches: If True, the caches for this inventory are
1048
copied to and updated for the result if possible.
1050
:returns: (validator, new_inv)
1051
The validator(which is a sha1 digest, though what is sha'd is
1052
repository format specific) of the serialized inventory, and the
1053
resulting inventory.
1055
if not self.is_in_write_group():
1056
raise AssertionError("%r not in write group" % (self,))
1057
_mod_revision.check_not_reserved_id(new_revision_id)
1058
basis_tree = self.revision_tree(basis_revision_id)
1059
basis_tree.lock_read()
1061
# Note that this mutates the inventory of basis_tree, which not all
1062
# inventory implementations may support: A better idiom would be to
1063
# return a new inventory, but as there is no revision tree cache in
1064
# repository this is safe for now - RBC 20081013
1065
if basis_inv is None:
1066
basis_inv = basis_tree.inventory
1067
basis_inv.apply_delta(delta)
1068
basis_inv.revision_id = new_revision_id
1069
return (self.add_inventory(new_revision_id, basis_inv, parents),
1074
def _inventory_add_lines(self, revision_id, parents, lines,
1075
check_content=True):
1076
"""Store lines in inv_vf and return the sha1 of the inventory."""
1077
parents = [(parent,) for parent in parents]
1078
result = self.inventories.add_lines((revision_id,), parents, lines,
1079
check_content=check_content)[0]
1080
self.inventories._access.flush()
1083
def add_revision(self, revision_id, rev, inv=None, config=None):
1084
"""Add rev to the revision store as revision_id.
1086
:param revision_id: the revision id to use.
1087
:param rev: The revision object.
1088
:param inv: The inventory for the revision. if None, it will be looked
1089
up in the inventory storer
1090
:param config: If None no digital signature will be created.
1091
If supplied its signature_needed method will be used
1092
to determine if a signature should be made.
1094
# TODO: jam 20070210 Shouldn't we check rev.revision_id and
1096
_mod_revision.check_not_reserved_id(revision_id)
1097
if config is not None and config.signature_needed():
1099
inv = self.get_inventory(revision_id)
1100
plaintext = Testament(rev, inv).as_short_text()
1101
self.store_revision_signature(
1102
gpg.GPGStrategy(config), plaintext, revision_id)
1103
# check inventory present
1104
if not self.inventories.get_parent_map([(revision_id,)]):
1106
raise errors.WeaveRevisionNotPresent(revision_id,
1109
# yes, this is not suitable for adding with ghosts.
1110
rev.inventory_sha1 = self.add_inventory(revision_id, inv,
1113
key = (revision_id,)
1114
rev.inventory_sha1 = self.inventories.get_sha1s([key])[key]
1115
self._add_revision(rev)
1117
def _add_revision(self, revision):
1118
text = self._serializer.write_revision_to_string(revision)
1119
key = (revision.revision_id,)
1120
parents = tuple((parent,) for parent in revision.parent_ids)
1121
self.revisions.add_lines(key, parents, osutils.split_lines(text))
1123
def all_revision_ids(self):
1124
"""Returns a list of all the revision ids in the repository.
1126
This is conceptually deprecated because code should generally work on
1127
the graph reachable from a particular revision, and ignore any other
1128
revisions that might be present. There is no direct replacement
1131
if 'evil' in debug.debug_flags:
1132
mutter_callsite(2, "all_revision_ids is linear with history.")
1133
return self._all_revision_ids()
1135
def _all_revision_ids(self):
1136
"""Returns a list of all the revision ids in the repository.
1138
These are in as much topological order as the underlying store can
1141
raise NotImplementedError(self._all_revision_ids)
1143
def break_lock(self):
1144
"""Break a lock if one is present from another instance.
1146
Uses the ui factory to ask for confirmation if the lock may be from
1149
self.control_files.break_lock()
1152
def _eliminate_revisions_not_present(self, revision_ids):
1153
"""Check every revision id in revision_ids to see if we have it.
1155
Returns a set of the present revisions.
1158
graph = self.get_graph()
1159
parent_map = graph.get_parent_map(revision_ids)
1160
# The old API returned a list, should this actually be a set?
1161
return parent_map.keys()
1163
def _check_inventories(self, checker):
1164
"""Check the inventories found from the revision scan.
1166
This is responsible for verifying the sha1 of inventories and
1167
creating a pending_keys set that covers data referenced by inventories.
1169
bar = ui.ui_factory.nested_progress_bar()
1171
self._do_check_inventories(checker, bar)
1175
def _do_check_inventories(self, checker, bar):
1176
"""Helper for _check_inventories."""
1178
keys = {'chk_bytes':set(), 'inventories':set(), 'texts':set()}
1179
kinds = ['chk_bytes', 'texts']
1180
count = len(checker.pending_keys)
1181
bar.update("inventories", 0, 2)
1182
current_keys = checker.pending_keys
1183
checker.pending_keys = {}
1184
# Accumulate current checks.
1185
for key in current_keys:
1186
if key[0] != 'inventories' and key[0] not in kinds:
1187
checker._report_items.append('unknown key type %r' % (key,))
1188
keys[key[0]].add(key[1:])
1189
if keys['inventories']:
1190
# NB: output order *should* be roughly sorted - topo or
1191
# inverse topo depending on repository - either way decent
1192
# to just delta against. However, pre-CHK formats didn't
1193
# try to optimise inventory layout on disk. As such the
1194
# pre-CHK code path does not use inventory deltas.
1196
for record in self.inventories.check(keys=keys['inventories']):
1197
if record.storage_kind == 'absent':
1198
checker._report_items.append(
1199
'Missing inventory {%s}' % (record.key,))
1201
last_object = self._check_record('inventories', record,
1202
checker, last_object,
1203
current_keys[('inventories',) + record.key])
1204
del keys['inventories']
1207
bar.update("texts", 1)
1208
while (checker.pending_keys or keys['chk_bytes']
1210
# Something to check.
1211
current_keys = checker.pending_keys
1212
checker.pending_keys = {}
1213
# Accumulate current checks.
1214
for key in current_keys:
1215
if key[0] not in kinds:
1216
checker._report_items.append('unknown key type %r' % (key,))
1217
keys[key[0]].add(key[1:])
1218
# Check the outermost kind only - inventories || chk_bytes || texts
1222
for record in getattr(self, kind).check(keys=keys[kind]):
1223
if record.storage_kind == 'absent':
1224
checker._report_items.append(
1225
'Missing %s {%s}' % (kind, record.key,))
1227
last_object = self._check_record(kind, record,
1228
checker, last_object, current_keys[(kind,) + record.key])
1232
def _check_record(self, kind, record, checker, last_object, item_data):
1233
"""Check a single text from this repository."""
1234
if kind == 'inventories':
1235
rev_id = record.key[0]
1236
inv = self.deserialise_inventory(rev_id,
1237
record.get_bytes_as('fulltext'))
1238
if last_object is not None:
1239
delta = inv._make_delta(last_object)
1240
for old_path, path, file_id, ie in delta:
1243
ie.check(checker, rev_id, inv)
1245
for path, ie in inv.iter_entries():
1246
ie.check(checker, rev_id, inv)
1247
if self._format.fast_deltas:
1249
elif kind == 'chk_bytes':
1250
# No code written to check chk_bytes for this repo format.
1251
checker._report_items.append(
1252
'unsupported key type chk_bytes for %s' % (record.key,))
1253
elif kind == 'texts':
1254
self._check_text(record, checker, item_data)
1256
checker._report_items.append(
1257
'unknown key type %s for %s' % (kind, record.key))
1259
def _check_text(self, record, checker, item_data):
1260
"""Check a single text."""
1261
# Check it is extractable.
1262
# TODO: check length.
1263
if record.storage_kind == 'chunked':
1264
chunks = record.get_bytes_as(record.storage_kind)
1265
sha1 = osutils.sha_strings(chunks)
1266
length = sum(map(len, chunks))
1268
content = record.get_bytes_as('fulltext')
1269
sha1 = osutils.sha_string(content)
1270
length = len(content)
1271
if item_data and sha1 != item_data[1]:
1272
checker._report_items.append(
1273
'sha1 mismatch: %s has sha1 %s expected %s referenced by %s' %
1274
(record.key, sha1, item_data[1], item_data[2]))
1277
def create(a_bzrdir):
1278
"""Construct the current default format repository in a_bzrdir."""
1279
return RepositoryFormat.get_default_format().initialize(a_bzrdir)
1281
def __init__(self, _format, a_bzrdir, control_files):
1282
"""instantiate a Repository.
1284
:param _format: The format of the repository on disk.
1285
:param a_bzrdir: The BzrDir of the repository.
1287
In the future we will have a single api for all stores for
1288
getting file texts, inventories and revisions, then
1289
this construct will accept instances of those things.
1291
super(Repository, self).__init__()
1292
self._format = _format
1293
# the following are part of the public API for Repository:
1294
self.bzrdir = a_bzrdir
1295
self.control_files = control_files
1296
self._transport = control_files._transport
1297
self.base = self._transport.base
1299
self._reconcile_does_inventory_gc = True
1300
self._reconcile_fixes_text_parents = False
1301
self._reconcile_backsup_inventory = True
1302
# not right yet - should be more semantically clear ?
1304
# TODO: make sure to construct the right store classes, etc, depending
1305
# on whether escaping is required.
1306
self._warn_if_deprecated()
1307
self._write_group = None
1308
# Additional places to query for data.
1309
self._fallback_repositories = []
1310
# An InventoryEntry cache, used during deserialization
1311
self._inventory_entry_cache = fifo_cache.FIFOCache(10*1024)
1314
if self._fallback_repositories:
1315
return '%s(%r, fallback_repositories=%r)' % (
1316
self.__class__.__name__,
1318
self._fallback_repositories)
1320
return '%s(%r)' % (self.__class__.__name__,
1323
def _has_same_fallbacks(self, other_repo):
1324
"""Returns true if the repositories have the same fallbacks."""
1325
my_fb = self._fallback_repositories
1326
other_fb = other_repo._fallback_repositories
1327
if len(my_fb) != len(other_fb):
1329
for f, g in zip(my_fb, other_fb):
1330
if not f.has_same_location(g):
1334
def has_same_location(self, other):
1335
"""Returns a boolean indicating if this repository is at the same
1336
location as another repository.
1338
This might return False even when two repository objects are accessing
1339
the same physical repository via different URLs.
1341
if self.__class__ is not other.__class__:
1343
return (self._transport.base == other._transport.base)
1345
def is_in_write_group(self):
1346
"""Return True if there is an open write group.
1348
:seealso: start_write_group.
1350
return self._write_group is not None
1352
def is_locked(self):
1353
return self.control_files.is_locked()
1355
def is_write_locked(self):
1356
"""Return True if this object is write locked."""
1357
return self.is_locked() and self.control_files._lock_mode == 'w'
1359
def lock_write(self, token=None):
1360
"""Lock this repository for writing.
1362
This causes caching within the repository obejct to start accumlating
1363
data during reads, and allows a 'write_group' to be obtained. Write
1364
groups must be used for actual data insertion.
1366
:param token: if this is already locked, then lock_write will fail
1367
unless the token matches the existing lock.
1368
:returns: a token if this instance supports tokens, otherwise None.
1369
:raises TokenLockingNotSupported: when a token is given but this
1370
instance doesn't support using token locks.
1371
:raises MismatchedToken: if the specified token doesn't match the token
1372
of the existing lock.
1373
:seealso: start_write_group.
1375
A token should be passed in if you know that you have locked the object
1376
some other way, and need to synchronise this object's state with that
1379
XXX: this docstring is duplicated in many places, e.g. lockable_files.py
1381
locked = self.is_locked()
1382
result = self.control_files.lock_write(token=token)
1384
for repo in self._fallback_repositories:
1385
# Writes don't affect fallback repos
1387
self._refresh_data()
1390
def lock_read(self):
1391
locked = self.is_locked()
1392
self.control_files.lock_read()
1394
for repo in self._fallback_repositories:
1396
self._refresh_data()
1398
def get_physical_lock_status(self):
1399
return self.control_files.get_physical_lock_status()
1401
def leave_lock_in_place(self):
1402
"""Tell this repository not to release the physical lock when this
1405
If lock_write doesn't return a token, then this method is not supported.
1407
self.control_files.leave_in_place()
1409
def dont_leave_lock_in_place(self):
1410
"""Tell this repository to release the physical lock when this
1411
object is unlocked, even if it didn't originally acquire it.
1413
If lock_write doesn't return a token, then this method is not supported.
1415
self.control_files.dont_leave_in_place()
1418
def gather_stats(self, revid=None, committers=None):
1419
"""Gather statistics from a revision id.
1421
:param revid: The revision id to gather statistics from, if None, then
1422
no revision specific statistics are gathered.
1423
:param committers: Optional parameter controlling whether to grab
1424
a count of committers from the revision specific statistics.
1425
:return: A dictionary of statistics. Currently this contains:
1426
committers: The number of committers if requested.
1427
firstrev: A tuple with timestamp, timezone for the penultimate left
1428
most ancestor of revid, if revid is not the NULL_REVISION.
1429
latestrev: A tuple with timestamp, timezone for revid, if revid is
1430
not the NULL_REVISION.
1431
revisions: The total revision count in the repository.
1432
size: An estimate disk size of the repository in bytes.
1435
if revid and committers:
1436
result['committers'] = 0
1437
if revid and revid != _mod_revision.NULL_REVISION:
1439
all_committers = set()
1440
revisions = self.get_ancestry(revid)
1441
# pop the leading None
1443
first_revision = None
1445
# ignore the revisions in the middle - just grab first and last
1446
revisions = revisions[0], revisions[-1]
1447
for revision in self.get_revisions(revisions):
1448
if not first_revision:
1449
first_revision = revision
1451
all_committers.add(revision.committer)
1452
last_revision = revision
1454
result['committers'] = len(all_committers)
1455
result['firstrev'] = (first_revision.timestamp,
1456
first_revision.timezone)
1457
result['latestrev'] = (last_revision.timestamp,
1458
last_revision.timezone)
1460
# now gather global repository information
1461
# XXX: This is available for many repos regardless of listability.
1462
if self.bzrdir.root_transport.listable():
1463
# XXX: do we want to __define len__() ?
1464
# Maybe the versionedfiles object should provide a different
1465
# method to get the number of keys.
1466
result['revisions'] = len(self.revisions.keys())
1467
# result['size'] = t
1470
def find_branches(self, using=False):
1471
"""Find branches underneath this repository.
1473
This will include branches inside other branches.
1475
:param using: If True, list only branches using this repository.
1477
if using and not self.is_shared():
1479
return [self.bzrdir.open_branch()]
1480
except errors.NotBranchError:
1482
class Evaluator(object):
1485
self.first_call = True
1487
def __call__(self, bzrdir):
1488
# On the first call, the parameter is always the bzrdir
1489
# containing the current repo.
1490
if not self.first_call:
1492
repository = bzrdir.open_repository()
1493
except errors.NoRepositoryPresent:
1496
return False, (None, repository)
1497
self.first_call = False
1499
value = (bzrdir.open_branch(), None)
1500
except errors.NotBranchError:
1501
value = (None, None)
1505
for branch, repository in bzrdir.BzrDir.find_bzrdirs(
1506
self.bzrdir.root_transport, evaluate=Evaluator()):
1507
if branch is not None:
1508
branches.append(branch)
1509
if not using and repository is not None:
1510
branches.extend(repository.find_branches())
1514
def search_missing_revision_ids(self, other, revision_id=None, find_ghosts=True):
1515
"""Return the revision ids that other has that this does not.
1517
These are returned in topological order.
1519
revision_id: only return revision ids included by revision_id.
1521
return InterRepository.get(other, self).search_missing_revision_ids(
1522
revision_id, find_ghosts)
1526
"""Open the repository rooted at base.
1528
For instance, if the repository is at URL/.bzr/repository,
1529
Repository.open(URL) -> a Repository instance.
1531
control = bzrdir.BzrDir.open(base)
1532
return control.open_repository()
1534
def copy_content_into(self, destination, revision_id=None):
1535
"""Make a complete copy of the content in self into destination.
1537
This is a destructive operation! Do not use it on existing
1540
return InterRepository.get(self, destination).copy_content(revision_id)
1542
def commit_write_group(self):
1543
"""Commit the contents accrued within the current write group.
1545
:seealso: start_write_group.
1547
:return: it may return an opaque hint that can be passed to 'pack'.
1549
if self._write_group is not self.get_transaction():
1550
# has an unlock or relock occured ?
1551
raise errors.BzrError('mismatched lock context %r and '
1553
(self.get_transaction(), self._write_group))
1554
result = self._commit_write_group()
1555
self._write_group = None
1558
def _commit_write_group(self):
1559
"""Template method for per-repository write group cleanup.
1561
This is called before the write group is considered to be
1562
finished and should ensure that all data handed to the repository
1563
for writing during the write group is safely committed (to the
1564
extent possible considering file system caching etc).
1567
def suspend_write_group(self):
1568
raise errors.UnsuspendableWriteGroup(self)
1570
def get_missing_parent_inventories(self, check_for_missing_texts=True):
1571
"""Return the keys of missing inventory parents for revisions added in
1574
A revision is not complete if the inventory delta for that revision
1575
cannot be calculated. Therefore if the parent inventories of a
1576
revision are not present, the revision is incomplete, and e.g. cannot
1577
be streamed by a smart server. This method finds missing inventory
1578
parents for revisions added in this write group.
1580
if not self._format.supports_external_lookups:
1581
# This is only an issue for stacked repositories
1583
if not self.is_in_write_group():
1584
raise AssertionError('not in a write group')
1586
# XXX: We assume that every added revision already has its
1587
# corresponding inventory, so we only check for parent inventories that
1588
# might be missing, rather than all inventories.
1589
parents = set(self.revisions._index.get_missing_parents())
1590
parents.discard(_mod_revision.NULL_REVISION)
1591
unstacked_inventories = self.inventories._index
1592
present_inventories = unstacked_inventories.get_parent_map(
1593
key[-1:] for key in parents)
1594
parents.difference_update(present_inventories)
1595
if len(parents) == 0:
1596
# No missing parent inventories.
1598
if not check_for_missing_texts:
1599
return set(('inventories', rev_id) for (rev_id,) in parents)
1600
# Ok, now we have a list of missing inventories. But these only matter
1601
# if the inventories that reference them are missing some texts they
1602
# appear to introduce.
1603
# XXX: Texts referenced by all added inventories need to be present,
1604
# but at the moment we're only checking for texts referenced by
1605
# inventories at the graph's edge.
1606
key_deps = self.revisions._index._key_dependencies
1607
key_deps.satisfy_refs_for_keys(present_inventories)
1608
referrers = frozenset(r[0] for r in key_deps.get_referrers())
1609
file_ids = self.fileids_altered_by_revision_ids(referrers)
1610
missing_texts = set()
1611
for file_id, version_ids in file_ids.iteritems():
1612
missing_texts.update(
1613
(file_id, version_id) for version_id in version_ids)
1614
present_texts = self.texts.get_parent_map(missing_texts)
1615
missing_texts.difference_update(present_texts)
1616
if not missing_texts:
1617
# No texts are missing, so all revisions and their deltas are
1620
# Alternatively the text versions could be returned as the missing
1621
# keys, but this is likely to be less data.
1622
missing_keys = set(('inventories', rev_id) for (rev_id,) in parents)
1625
def refresh_data(self):
1626
"""Re-read any data needed to to synchronise with disk.
1628
This method is intended to be called after another repository instance
1629
(such as one used by a smart server) has inserted data into the
1630
repository. It may not be called during a write group, but may be
1631
called at any other time.
1633
if self.is_in_write_group():
1634
raise errors.InternalBzrError(
1635
"May not refresh_data while in a write group.")
1636
self._refresh_data()
1638
def resume_write_group(self, tokens):
1639
if not self.is_write_locked():
1640
raise errors.NotWriteLocked(self)
1641
if self._write_group:
1642
raise errors.BzrError('already in a write group')
1643
self._resume_write_group(tokens)
1644
# so we can detect unlock/relock - the write group is now entered.
1645
self._write_group = self.get_transaction()
1647
def _resume_write_group(self, tokens):
1648
raise errors.UnsuspendableWriteGroup(self)
1650
def fetch(self, source, revision_id=None, pb=None, find_ghosts=False,
1652
"""Fetch the content required to construct revision_id from source.
1654
If revision_id is None and fetch_spec is None, then all content is
1657
fetch() may not be used when the repository is in a write group -
1658
either finish the current write group before using fetch, or use
1659
fetch before starting the write group.
1661
:param find_ghosts: Find and copy revisions in the source that are
1662
ghosts in the target (and not reachable directly by walking out to
1663
the first-present revision in target from revision_id).
1664
:param revision_id: If specified, all the content needed for this
1665
revision ID will be copied to the target. Fetch will determine for
1666
itself which content needs to be copied.
1667
:param fetch_spec: If specified, a SearchResult or
1668
PendingAncestryResult that describes which revisions to copy. This
1669
allows copying multiple heads at once. Mutually exclusive with
1672
if fetch_spec is not None and revision_id is not None:
1673
raise AssertionError(
1674
"fetch_spec and revision_id are mutually exclusive.")
1675
if self.is_in_write_group():
1676
raise errors.InternalBzrError(
1677
"May not fetch while in a write group.")
1678
# fast path same-url fetch operations
1679
# TODO: lift out to somewhere common with RemoteRepository
1680
# <https://bugs.edge.launchpad.net/bzr/+bug/401646>
1681
if (self.has_same_location(source)
1682
and fetch_spec is None
1683
and self._has_same_fallbacks(source)):
1684
# check that last_revision is in 'from' and then return a
1686
if (revision_id is not None and
1687
not _mod_revision.is_null(revision_id)):
1688
self.get_revision(revision_id)
1690
# if there is no specific appropriate InterRepository, this will get
1691
# the InterRepository base class, which raises an
1692
# IncompatibleRepositories when asked to fetch.
1693
inter = InterRepository.get(source, self)
1694
return inter.fetch(revision_id=revision_id, pb=pb,
1695
find_ghosts=find_ghosts, fetch_spec=fetch_spec)
1697
def create_bundle(self, target, base, fileobj, format=None):
1698
return serializer.write_bundle(self, target, base, fileobj, format)
1700
def get_commit_builder(self, branch, parents, config, timestamp=None,
1701
timezone=None, committer=None, revprops=None,
1703
"""Obtain a CommitBuilder for this repository.
1705
:param branch: Branch to commit to.
1706
:param parents: Revision ids of the parents of the new revision.
1707
:param config: Configuration to use.
1708
:param timestamp: Optional timestamp recorded for commit.
1709
:param timezone: Optional timezone for timestamp.
1710
:param committer: Optional committer to set for commit.
1711
:param revprops: Optional dictionary of revision properties.
1712
:param revision_id: Optional revision id.
1714
if self._fallback_repositories:
1715
raise errors.BzrError("Cannot commit from a lightweight checkout "
1716
"to a stacked branch. See "
1717
"https://bugs.launchpad.net/bzr/+bug/375013 for details.")
1718
result = self._commit_builder_class(self, parents, config,
1719
timestamp, timezone, committer, revprops, revision_id)
1720
self.start_write_group()
1723
@only_raises(errors.LockNotHeld, errors.LockBroken)
1725
if (self.control_files._lock_count == 1 and
1726
self.control_files._lock_mode == 'w'):
1727
if self._write_group is not None:
1728
self.abort_write_group()
1729
self.control_files.unlock()
1730
raise errors.BzrError(
1731
'Must end write groups before releasing write locks.')
1732
self.control_files.unlock()
1733
if self.control_files._lock_count == 0:
1734
self._inventory_entry_cache.clear()
1735
for repo in self._fallback_repositories:
1739
def clone(self, a_bzrdir, revision_id=None):
1740
"""Clone this repository into a_bzrdir using the current format.
1742
Currently no check is made that the format of this repository and
1743
the bzrdir format are compatible. FIXME RBC 20060201.
1745
:return: The newly created destination repository.
1747
# TODO: deprecate after 0.16; cloning this with all its settings is
1748
# probably not very useful -- mbp 20070423
1749
dest_repo = self._create_sprouting_repo(a_bzrdir, shared=self.is_shared())
1750
self.copy_content_into(dest_repo, revision_id)
1753
def start_write_group(self):
1754
"""Start a write group in the repository.
1756
Write groups are used by repositories which do not have a 1:1 mapping
1757
between file ids and backend store to manage the insertion of data from
1758
both fetch and commit operations.
1760
A write lock is required around the start_write_group/commit_write_group
1761
for the support of lock-requiring repository formats.
1763
One can only insert data into a repository inside a write group.
1767
if not self.is_write_locked():
1768
raise errors.NotWriteLocked(self)
1769
if self._write_group:
1770
raise errors.BzrError('already in a write group')
1771
self._start_write_group()
1772
# so we can detect unlock/relock - the write group is now entered.
1773
self._write_group = self.get_transaction()
1775
def _start_write_group(self):
1776
"""Template method for per-repository write group startup.
1778
This is called before the write group is considered to be
1783
def sprout(self, to_bzrdir, revision_id=None):
1784
"""Create a descendent repository for new development.
1786
Unlike clone, this does not copy the settings of the repository.
1788
dest_repo = self._create_sprouting_repo(to_bzrdir, shared=False)
1789
dest_repo.fetch(self, revision_id=revision_id)
1792
def _create_sprouting_repo(self, a_bzrdir, shared):
1793
if not isinstance(a_bzrdir._format, self.bzrdir._format.__class__):
1794
# use target default format.
1795
dest_repo = a_bzrdir.create_repository()
1797
# Most control formats need the repository to be specifically
1798
# created, but on some old all-in-one formats it's not needed
1800
dest_repo = self._format.initialize(a_bzrdir, shared=shared)
1801
except errors.UninitializableFormat:
1802
dest_repo = a_bzrdir.open_repository()
1805
def _get_sink(self):
1806
"""Return a sink for streaming into this repository."""
1807
return StreamSink(self)
1809
def _get_source(self, to_format):
1810
"""Return a source for streaming from this repository."""
1811
return StreamSource(self, to_format)
1814
def has_revision(self, revision_id):
1815
"""True if this repository has a copy of the revision."""
1816
return revision_id in self.has_revisions((revision_id,))
1819
def has_revisions(self, revision_ids):
1820
"""Probe to find out the presence of multiple revisions.
1822
:param revision_ids: An iterable of revision_ids.
1823
:return: A set of the revision_ids that were present.
1825
parent_map = self.revisions.get_parent_map(
1826
[(rev_id,) for rev_id in revision_ids])
1828
if _mod_revision.NULL_REVISION in revision_ids:
1829
result.add(_mod_revision.NULL_REVISION)
1830
result.update([key[0] for key in parent_map])
1834
def get_revision(self, revision_id):
1835
"""Return the Revision object for a named revision."""
1836
return self.get_revisions([revision_id])[0]
1839
def get_revision_reconcile(self, revision_id):
1840
"""'reconcile' helper routine that allows access to a revision always.
1842
This variant of get_revision does not cross check the weave graph
1843
against the revision one as get_revision does: but it should only
1844
be used by reconcile, or reconcile-alike commands that are correcting
1845
or testing the revision graph.
1847
return self._get_revisions([revision_id])[0]
1850
def get_revisions(self, revision_ids):
1851
"""Get many revisions at once.
1853
Repositories that need to check data on every revision read should
1854
subclass this method.
1856
return self._get_revisions(revision_ids)
1859
def _get_revisions(self, revision_ids):
1860
"""Core work logic to get many revisions without sanity checks."""
1862
for revid, rev in self._iter_revisions(revision_ids):
1864
raise errors.NoSuchRevision(self, revid)
1866
return [revs[revid] for revid in revision_ids]
1868
def _iter_revisions(self, revision_ids):
1869
"""Iterate over revision objects.
1871
:param revision_ids: An iterable of revisions to examine. None may be
1872
passed to request all revisions known to the repository. Note that
1873
not all repositories can find unreferenced revisions; for those
1874
repositories only referenced ones will be returned.
1875
:return: An iterator of (revid, revision) tuples. Absent revisions (
1876
those asked for but not available) are returned as (revid, None).
1878
if revision_ids is None:
1879
revision_ids = self.all_revision_ids()
1881
for rev_id in revision_ids:
1882
if not rev_id or not isinstance(rev_id, basestring):
1883
raise errors.InvalidRevisionId(revision_id=rev_id, branch=self)
1884
keys = [(key,) for key in revision_ids]
1885
stream = self.revisions.get_record_stream(keys, 'unordered', True)
1886
for record in stream:
1887
revid = record.key[0]
1888
if record.storage_kind == 'absent':
1891
text = record.get_bytes_as('fulltext')
1892
rev = self._serializer.read_revision_from_string(text)
1896
def get_revision_xml(self, revision_id):
1897
# TODO: jam 20070210 This shouldn't be necessary since get_revision
1898
# would have already do it.
1899
# TODO: jam 20070210 Just use _serializer.write_revision_to_string()
1900
# TODO: this can't just be replaced by:
1901
# return self._serializer.write_revision_to_string(
1902
# self.get_revision(revision_id))
1903
# as cStringIO preservers the encoding unlike write_revision_to_string
1904
# or some other call down the path.
1905
rev = self.get_revision(revision_id)
1906
rev_tmp = cStringIO.StringIO()
1907
# the current serializer..
1908
self._serializer.write_revision(rev, rev_tmp)
1910
return rev_tmp.getvalue()
1912
def get_deltas_for_revisions(self, revisions, specific_fileids=None):
1913
"""Produce a generator of revision deltas.
1915
Note that the input is a sequence of REVISIONS, not revision_ids.
1916
Trees will be held in memory until the generator exits.
1917
Each delta is relative to the revision's lefthand predecessor.
1919
:param specific_fileids: if not None, the result is filtered
1920
so that only those file-ids, their parents and their
1921
children are included.
1923
# Get the revision-ids of interest
1924
required_trees = set()
1925
for revision in revisions:
1926
required_trees.add(revision.revision_id)
1927
required_trees.update(revision.parent_ids[:1])
1929
# Get the matching filtered trees. Note that it's more
1930
# efficient to pass filtered trees to changes_from() rather
1931
# than doing the filtering afterwards. changes_from() could
1932
# arguably do the filtering itself but it's path-based, not
1933
# file-id based, so filtering before or afterwards is
1935
if specific_fileids is None:
1936
trees = dict((t.get_revision_id(), t) for
1937
t in self.revision_trees(required_trees))
1939
trees = dict((t.get_revision_id(), t) for
1940
t in self._filtered_revision_trees(required_trees,
1943
# Calculate the deltas
1944
for revision in revisions:
1945
if not revision.parent_ids:
1946
old_tree = self.revision_tree(_mod_revision.NULL_REVISION)
1948
old_tree = trees[revision.parent_ids[0]]
1949
yield trees[revision.revision_id].changes_from(old_tree)
1952
def get_revision_delta(self, revision_id, specific_fileids=None):
1953
"""Return the delta for one revision.
1955
The delta is relative to the left-hand predecessor of the
1958
:param specific_fileids: if not None, the result is filtered
1959
so that only those file-ids, their parents and their
1960
children are included.
1962
r = self.get_revision(revision_id)
1963
return list(self.get_deltas_for_revisions([r],
1964
specific_fileids=specific_fileids))[0]
1967
def store_revision_signature(self, gpg_strategy, plaintext, revision_id):
1968
signature = gpg_strategy.sign(plaintext)
1969
self.add_signature_text(revision_id, signature)
1972
def add_signature_text(self, revision_id, signature):
1973
self.signatures.add_lines((revision_id,), (),
1974
osutils.split_lines(signature))
1976
def find_text_key_references(self):
1977
"""Find the text key references within the repository.
1979
:return: A dictionary mapping text keys ((fileid, revision_id) tuples)
1980
to whether they were referred to by the inventory of the
1981
revision_id that they contain. The inventory texts from all present
1982
revision ids are assessed to generate this report.
1984
revision_keys = self.revisions.keys()
1985
w = self.inventories
1986
pb = ui.ui_factory.nested_progress_bar()
1988
return self._find_text_key_references_from_xml_inventory_lines(
1989
w.iter_lines_added_or_present_in_keys(revision_keys, pb=pb))
1993
def _find_text_key_references_from_xml_inventory_lines(self,
1995
"""Core routine for extracting references to texts from inventories.
1997
This performs the translation of xml lines to revision ids.
1999
:param line_iterator: An iterator of lines, origin_version_id
2000
:return: A dictionary mapping text keys ((fileid, revision_id) tuples)
2001
to whether they were referred to by the inventory of the
2002
revision_id that they contain. Note that if that revision_id was
2003
not part of the line_iterator's output then False will be given -
2004
even though it may actually refer to that key.
2006
if not self._serializer.support_altered_by_hack:
2007
raise AssertionError(
2008
"_find_text_key_references_from_xml_inventory_lines only "
2009
"supported for branches which store inventory as unnested xml"
2010
", not on %r" % self)
2013
# this code needs to read every new line in every inventory for the
2014
# inventories [revision_ids]. Seeing a line twice is ok. Seeing a line
2015
# not present in one of those inventories is unnecessary but not
2016
# harmful because we are filtering by the revision id marker in the
2017
# inventory lines : we only select file ids altered in one of those
2018
# revisions. We don't need to see all lines in the inventory because
2019
# only those added in an inventory in rev X can contain a revision=X
2021
unescape_revid_cache = {}
2022
unescape_fileid_cache = {}
2024
# jam 20061218 In a big fetch, this handles hundreds of thousands
2025
# of lines, so it has had a lot of inlining and optimizing done.
2026
# Sorry that it is a little bit messy.
2027
# Move several functions to be local variables, since this is a long
2029
search = self._file_ids_altered_regex.search
2030
unescape = _unescape_xml
2031
setdefault = result.setdefault
2032
for line, line_key in line_iterator:
2033
match = search(line)
2036
# One call to match.group() returning multiple items is quite a
2037
# bit faster than 2 calls to match.group() each returning 1
2038
file_id, revision_id = match.group('file_id', 'revision_id')
2040
# Inlining the cache lookups helps a lot when you make 170,000
2041
# lines and 350k ids, versus 8.4 unique ids.
2042
# Using a cache helps in 2 ways:
2043
# 1) Avoids unnecessary decoding calls
2044
# 2) Re-uses cached strings, which helps in future set and
2046
# (2) is enough that removing encoding entirely along with
2047
# the cache (so we are using plain strings) results in no
2048
# performance improvement.
2050
revision_id = unescape_revid_cache[revision_id]
2052
unescaped = unescape(revision_id)
2053
unescape_revid_cache[revision_id] = unescaped
2054
revision_id = unescaped
2056
# Note that unconditionally unescaping means that we deserialise
2057
# every fileid, which for general 'pull' is not great, but we don't
2058
# really want to have some many fulltexts that this matters anyway.
2061
file_id = unescape_fileid_cache[file_id]
2063
unescaped = unescape(file_id)
2064
unescape_fileid_cache[file_id] = unescaped
2067
key = (file_id, revision_id)
2068
setdefault(key, False)
2069
if revision_id == line_key[-1]:
2073
def _inventory_xml_lines_for_keys(self, keys):
2074
"""Get a line iterator of the sort needed for findind references.
2076
Not relevant for non-xml inventory repositories.
2078
Ghosts in revision_keys are ignored.
2080
:param revision_keys: The revision keys for the inventories to inspect.
2081
:return: An iterator over (inventory line, revid) for the fulltexts of
2082
all of the xml inventories specified by revision_keys.
2084
stream = self.inventories.get_record_stream(keys, 'unordered', True)
2085
for record in stream:
2086
if record.storage_kind != 'absent':
2087
chunks = record.get_bytes_as('chunked')
2088
revid = record.key[-1]
2089
lines = osutils.chunks_to_lines(chunks)
2093
def _find_file_ids_from_xml_inventory_lines(self, line_iterator,
2095
"""Helper routine for fileids_altered_by_revision_ids.
2097
This performs the translation of xml lines to revision ids.
2099
:param line_iterator: An iterator of lines, origin_version_id
2100
:param revision_keys: The revision ids to filter for. This should be a
2101
set or other type which supports efficient __contains__ lookups, as
2102
the revision key from each parsed line will be looked up in the
2103
revision_keys filter.
2104
:return: a dictionary mapping altered file-ids to an iterable of
2105
revision_ids. Each altered file-ids has the exact revision_ids that
2106
altered it listed explicitly.
2108
seen = set(self._find_text_key_references_from_xml_inventory_lines(
2109
line_iterator).iterkeys())
2110
parent_keys = self._find_parent_keys_of_revisions(revision_keys)
2111
parent_seen = set(self._find_text_key_references_from_xml_inventory_lines(
2112
self._inventory_xml_lines_for_keys(parent_keys)))
2113
new_keys = seen - parent_seen
2115
setdefault = result.setdefault
2116
for key in new_keys:
2117
setdefault(key[0], set()).add(key[-1])
2120
def _find_parent_ids_of_revisions(self, revision_ids):
2121
"""Find all parent ids that are mentioned in the revision graph.
2123
:return: set of revisions that are parents of revision_ids which are
2124
not part of revision_ids themselves
2126
parent_map = self.get_parent_map(revision_ids)
2128
map(parent_ids.update, parent_map.itervalues())
2129
parent_ids.difference_update(revision_ids)
2130
parent_ids.discard(_mod_revision.NULL_REVISION)
2133
def _find_parent_keys_of_revisions(self, revision_keys):
2134
"""Similar to _find_parent_ids_of_revisions, but used with keys.
2136
:param revision_keys: An iterable of revision_keys.
2137
:return: The parents of all revision_keys that are not already in
2140
parent_map = self.revisions.get_parent_map(revision_keys)
2142
map(parent_keys.update, parent_map.itervalues())
2143
parent_keys.difference_update(revision_keys)
2144
parent_keys.discard(_mod_revision.NULL_REVISION)
2147
def fileids_altered_by_revision_ids(self, revision_ids, _inv_weave=None):
2148
"""Find the file ids and versions affected by revisions.
2150
:param revisions: an iterable containing revision ids.
2151
:param _inv_weave: The inventory weave from this repository or None.
2152
If None, the inventory weave will be opened automatically.
2153
:return: a dictionary mapping altered file-ids to an iterable of
2154
revision_ids. Each altered file-ids has the exact revision_ids that
2155
altered it listed explicitly.
2157
selected_keys = set((revid,) for revid in revision_ids)
2158
w = _inv_weave or self.inventories
2159
pb = ui.ui_factory.nested_progress_bar()
2161
return self._find_file_ids_from_xml_inventory_lines(
2162
w.iter_lines_added_or_present_in_keys(
2163
selected_keys, pb=pb),
2168
def iter_files_bytes(self, desired_files):
2169
"""Iterate through file versions.
2171
Files will not necessarily be returned in the order they occur in
2172
desired_files. No specific order is guaranteed.
2174
Yields pairs of identifier, bytes_iterator. identifier is an opaque
2175
value supplied by the caller as part of desired_files. It should
2176
uniquely identify the file version in the caller's context. (Examples:
2177
an index number or a TreeTransform trans_id.)
2179
bytes_iterator is an iterable of bytestrings for the file. The
2180
kind of iterable and length of the bytestrings are unspecified, but for
2181
this implementation, it is a list of bytes produced by
2182
VersionedFile.get_record_stream().
2184
:param desired_files: a list of (file_id, revision_id, identifier)
2188
for file_id, revision_id, callable_data in desired_files:
2189
text_keys[(file_id, revision_id)] = callable_data
2190
for record in self.texts.get_record_stream(text_keys, 'unordered', True):
2191
if record.storage_kind == 'absent':
2192
raise errors.RevisionNotPresent(record.key, self)
2193
yield text_keys[record.key], record.get_bytes_as('chunked')
2195
def _generate_text_key_index(self, text_key_references=None,
2197
"""Generate a new text key index for the repository.
2199
This is an expensive function that will take considerable time to run.
2201
:return: A dict mapping text keys ((file_id, revision_id) tuples) to a
2202
list of parents, also text keys. When a given key has no parents,
2203
the parents list will be [NULL_REVISION].
2205
# All revisions, to find inventory parents.
2206
if ancestors is None:
2207
graph = self.get_graph()
2208
ancestors = graph.get_parent_map(self.all_revision_ids())
2209
if text_key_references is None:
2210
text_key_references = self.find_text_key_references()
2211
pb = ui.ui_factory.nested_progress_bar()
2213
return self._do_generate_text_key_index(ancestors,
2214
text_key_references, pb)
2218
def _do_generate_text_key_index(self, ancestors, text_key_references, pb):
2219
"""Helper for _generate_text_key_index to avoid deep nesting."""
2220
revision_order = tsort.topo_sort(ancestors)
2221
invalid_keys = set()
2223
for revision_id in revision_order:
2224
revision_keys[revision_id] = set()
2225
text_count = len(text_key_references)
2226
# a cache of the text keys to allow reuse; costs a dict of all the
2227
# keys, but saves a 2-tuple for every child of a given key.
2229
for text_key, valid in text_key_references.iteritems():
2231
invalid_keys.add(text_key)
2233
revision_keys[text_key[1]].add(text_key)
2234
text_key_cache[text_key] = text_key
2235
del text_key_references
2237
text_graph = graph.Graph(graph.DictParentsProvider(text_index))
2238
NULL_REVISION = _mod_revision.NULL_REVISION
2239
# Set a cache with a size of 10 - this suffices for bzr.dev but may be
2240
# too small for large or very branchy trees. However, for 55K path
2241
# trees, it would be easy to use too much memory trivially. Ideally we
2242
# could gauge this by looking at available real memory etc, but this is
2243
# always a tricky proposition.
2244
inventory_cache = lru_cache.LRUCache(10)
2245
batch_size = 10 # should be ~150MB on a 55K path tree
2246
batch_count = len(revision_order) / batch_size + 1
2248
pb.update("Calculating text parents", processed_texts, text_count)
2249
for offset in xrange(batch_count):
2250
to_query = revision_order[offset * batch_size:(offset + 1) *
2254
for revision_id in to_query:
2255
parent_ids = ancestors[revision_id]
2256
for text_key in revision_keys[revision_id]:
2257
pb.update("Calculating text parents", processed_texts)
2258
processed_texts += 1
2259
candidate_parents = []
2260
for parent_id in parent_ids:
2261
parent_text_key = (text_key[0], parent_id)
2263
check_parent = parent_text_key not in \
2264
revision_keys[parent_id]
2266
# the parent parent_id is a ghost:
2267
check_parent = False
2268
# truncate the derived graph against this ghost.
2269
parent_text_key = None
2271
# look at the parent commit details inventories to
2272
# determine possible candidates in the per file graph.
2275
inv = inventory_cache[parent_id]
2277
inv = self.revision_tree(parent_id).inventory
2278
inventory_cache[parent_id] = inv
2280
parent_entry = inv[text_key[0]]
2281
except (KeyError, errors.NoSuchId):
2283
if parent_entry is not None:
2285
text_key[0], parent_entry.revision)
2287
parent_text_key = None
2288
if parent_text_key is not None:
2289
candidate_parents.append(
2290
text_key_cache[parent_text_key])
2291
parent_heads = text_graph.heads(candidate_parents)
2292
new_parents = list(parent_heads)
2293
new_parents.sort(key=lambda x:candidate_parents.index(x))
2294
if new_parents == []:
2295
new_parents = [NULL_REVISION]
2296
text_index[text_key] = new_parents
2298
for text_key in invalid_keys:
2299
text_index[text_key] = [NULL_REVISION]
2302
def item_keys_introduced_by(self, revision_ids, _files_pb=None):
2303
"""Get an iterable listing the keys of all the data introduced by a set
2306
The keys will be ordered so that the corresponding items can be safely
2307
fetched and inserted in that order.
2309
:returns: An iterable producing tuples of (knit-kind, file-id,
2310
versions). knit-kind is one of 'file', 'inventory', 'signatures',
2311
'revisions'. file-id is None unless knit-kind is 'file'.
2313
for result in self._find_file_keys_to_fetch(revision_ids, _files_pb):
2316
for result in self._find_non_file_keys_to_fetch(revision_ids):
2319
def _find_file_keys_to_fetch(self, revision_ids, pb):
2320
# XXX: it's a bit weird to control the inventory weave caching in this
2321
# generator. Ideally the caching would be done in fetch.py I think. Or
2322
# maybe this generator should explicitly have the contract that it
2323
# should not be iterated until the previously yielded item has been
2325
inv_w = self.inventories
2327
# file ids that changed
2328
file_ids = self.fileids_altered_by_revision_ids(revision_ids, inv_w)
2330
num_file_ids = len(file_ids)
2331
for file_id, altered_versions in file_ids.iteritems():
2333
pb.update("Fetch texts", count, num_file_ids)
2335
yield ("file", file_id, altered_versions)
2337
def _find_non_file_keys_to_fetch(self, revision_ids):
2339
yield ("inventory", None, revision_ids)
2342
# XXX: Note ATM no callers actually pay attention to this return
2343
# instead they just use the list of revision ids and ignore
2344
# missing sigs. Consider removing this work entirely
2345
revisions_with_signatures = set(self.signatures.get_parent_map(
2346
[(r,) for r in revision_ids]))
2347
revisions_with_signatures = set(
2348
[r for (r,) in revisions_with_signatures])
2349
revisions_with_signatures.intersection_update(revision_ids)
2350
yield ("signatures", None, revisions_with_signatures)
2353
yield ("revisions", None, revision_ids)
2356
def get_inventory(self, revision_id):
2357
"""Get Inventory object by revision id."""
2358
return self.iter_inventories([revision_id]).next()
2360
def iter_inventories(self, revision_ids, ordering=None):
2361
"""Get many inventories by revision_ids.
2363
This will buffer some or all of the texts used in constructing the
2364
inventories in memory, but will only parse a single inventory at a
2367
:param revision_ids: The expected revision ids of the inventories.
2368
:param ordering: optional ordering, e.g. 'topological'. If not
2369
specified, the order of revision_ids will be preserved (by
2370
buffering if necessary).
2371
:return: An iterator of inventories.
2373
if ((None in revision_ids)
2374
or (_mod_revision.NULL_REVISION in revision_ids)):
2375
raise ValueError('cannot get null revision inventory')
2376
return self._iter_inventories(revision_ids, ordering)
2378
def _iter_inventories(self, revision_ids, ordering):
2379
"""single-document based inventory iteration."""
2380
inv_xmls = self._iter_inventory_xmls(revision_ids, ordering)
2381
for text, revision_id in inv_xmls:
2382
yield self.deserialise_inventory(revision_id, text)
2384
def _iter_inventory_xmls(self, revision_ids, ordering):
2385
if ordering is None:
2386
order_as_requested = True
2387
ordering = 'unordered'
2389
order_as_requested = False
2390
keys = [(revision_id,) for revision_id in revision_ids]
2393
if order_as_requested:
2394
key_iter = iter(keys)
2395
next_key = key_iter.next()
2396
stream = self.inventories.get_record_stream(keys, ordering, True)
2398
for record in stream:
2399
if record.storage_kind != 'absent':
2400
chunks = record.get_bytes_as('chunked')
2401
if order_as_requested:
2402
text_chunks[record.key] = chunks
2404
yield ''.join(chunks), record.key[-1]
2406
raise errors.NoSuchRevision(self, record.key)
2407
if order_as_requested:
2408
# Yield as many results as we can while preserving order.
2409
while next_key in text_chunks:
2410
chunks = text_chunks.pop(next_key)
2411
yield ''.join(chunks), next_key[-1]
2413
next_key = key_iter.next()
2414
except StopIteration:
2415
# We still want to fully consume the get_record_stream,
2416
# just in case it is not actually finished at this point
2420
def deserialise_inventory(self, revision_id, xml):
2421
"""Transform the xml into an inventory object.
2423
:param revision_id: The expected revision id of the inventory.
2424
:param xml: A serialised inventory.
2426
result = self._serializer.read_inventory_from_string(xml, revision_id,
2427
entry_cache=self._inventory_entry_cache)
2428
if result.revision_id != revision_id:
2429
raise AssertionError('revision id mismatch %s != %s' % (
2430
result.revision_id, revision_id))
2433
def serialise_inventory(self, inv):
2434
return self._serializer.write_inventory_to_string(inv)
2436
def _serialise_inventory_to_lines(self, inv):
2437
return self._serializer.write_inventory_to_lines(inv)
2439
def get_serializer_format(self):
2440
return self._serializer.format_num
2443
def get_inventory_xml(self, revision_id):
2444
"""Get inventory XML as a file object."""
2445
texts = self._iter_inventory_xmls([revision_id], 'unordered')
2447
text, revision_id = texts.next()
2448
except StopIteration:
2449
raise errors.HistoryMissing(self, 'inventory', revision_id)
2453
def get_inventory_sha1(self, revision_id):
2454
"""Return the sha1 hash of the inventory entry
2456
return self.get_revision(revision_id).inventory_sha1
2458
def get_rev_id_for_revno(self, revno, known_pair):
2459
"""Return the revision id of a revno, given a later (revno, revid)
2460
pair in the same history.
2462
:return: if found (True, revid). If the available history ran out
2463
before reaching the revno, then this returns
2464
(False, (closest_revno, closest_revid)).
2466
known_revno, known_revid = known_pair
2467
partial_history = [known_revid]
2468
distance_from_known = known_revno - revno
2469
if distance_from_known < 0:
2471
'requested revno (%d) is later than given known revno (%d)'
2472
% (revno, known_revno))
2475
self, partial_history, stop_index=distance_from_known)
2476
except errors.RevisionNotPresent, err:
2477
if err.revision_id == known_revid:
2478
# The start revision (known_revid) wasn't found.
2480
# This is a stacked repository with no fallbacks, or a there's a
2481
# left-hand ghost. Either way, even though the revision named in
2482
# the error isn't in this repo, we know it's the next step in this
2483
# left-hand history.
2484
partial_history.append(err.revision_id)
2485
if len(partial_history) <= distance_from_known:
2486
# Didn't find enough history to get a revid for the revno.
2487
earliest_revno = known_revno - len(partial_history) + 1
2488
return (False, (earliest_revno, partial_history[-1]))
2489
if len(partial_history) - 1 > distance_from_known:
2490
raise AssertionError('_iter_for_revno returned too much history')
2491
return (True, partial_history[-1])
2493
def iter_reverse_revision_history(self, revision_id):
2494
"""Iterate backwards through revision ids in the lefthand history
2496
:param revision_id: The revision id to start with. All its lefthand
2497
ancestors will be traversed.
2499
graph = self.get_graph()
2500
next_id = revision_id
2502
if next_id in (None, _mod_revision.NULL_REVISION):
2505
parents = graph.get_parent_map([next_id])[next_id]
2507
raise errors.RevisionNotPresent(next_id, self)
2509
if len(parents) == 0:
2512
next_id = parents[0]
2515
def get_revision_inventory(self, revision_id):
2516
"""Return inventory of a past revision."""
2517
# TODO: Unify this with get_inventory()
2518
# bzr 0.0.6 and later imposes the constraint that the inventory_id
2519
# must be the same as its revision, so this is trivial.
2520
if revision_id is None:
2521
# This does not make sense: if there is no revision,
2522
# then it is the current tree inventory surely ?!
2523
# and thus get_root_id() is something that looks at the last
2524
# commit on the branch, and the get_root_id is an inventory check.
2525
raise NotImplementedError
2526
# return Inventory(self.get_root_id())
2528
return self.get_inventory(revision_id)
2530
def is_shared(self):
2531
"""Return True if this repository is flagged as a shared repository."""
2532
raise NotImplementedError(self.is_shared)
2535
def reconcile(self, other=None, thorough=False):
2536
"""Reconcile this repository."""
2537
from bzrlib.reconcile import RepoReconciler
2538
reconciler = RepoReconciler(self, thorough=thorough)
2539
reconciler.reconcile()
2542
def _refresh_data(self):
2543
"""Helper called from lock_* to ensure coherency with disk.
2545
The default implementation does nothing; it is however possible
2546
for repositories to maintain loaded indices across multiple locks
2547
by checking inside their implementation of this method to see
2548
whether their indices are still valid. This depends of course on
2549
the disk format being validatable in this manner. This method is
2550
also called by the refresh_data() public interface to cause a refresh
2551
to occur while in a write lock so that data inserted by a smart server
2552
push operation is visible on the client's instance of the physical
2557
def revision_tree(self, revision_id):
2558
"""Return Tree for a revision on this branch.
2560
`revision_id` may be NULL_REVISION for the empty tree revision.
2562
revision_id = _mod_revision.ensure_null(revision_id)
2563
# TODO: refactor this to use an existing revision object
2564
# so we don't need to read it in twice.
2565
if revision_id == _mod_revision.NULL_REVISION:
2566
return RevisionTree(self, Inventory(root_id=None),
2567
_mod_revision.NULL_REVISION)
2569
inv = self.get_revision_inventory(revision_id)
2570
return RevisionTree(self, inv, revision_id)
2572
def revision_trees(self, revision_ids):
2573
"""Return Trees for revisions in this repository.
2575
:param revision_ids: a sequence of revision-ids;
2576
a revision-id may not be None or 'null:'
2578
inventories = self.iter_inventories(revision_ids)
2579
for inv in inventories:
2580
yield RevisionTree(self, inv, inv.revision_id)
2582
def _filtered_revision_trees(self, revision_ids, file_ids):
2583
"""Return Tree for a revision on this branch with only some files.
2585
:param revision_ids: a sequence of revision-ids;
2586
a revision-id may not be None or 'null:'
2587
:param file_ids: if not None, the result is filtered
2588
so that only those file-ids, their parents and their
2589
children are included.
2591
inventories = self.iter_inventories(revision_ids)
2592
for inv in inventories:
2593
# Should we introduce a FilteredRevisionTree class rather
2594
# than pre-filter the inventory here?
2595
filtered_inv = inv.filter(file_ids)
2596
yield RevisionTree(self, filtered_inv, filtered_inv.revision_id)
2599
def get_ancestry(self, revision_id, topo_sorted=True):
2600
"""Return a list of revision-ids integrated by a revision.
2602
The first element of the list is always None, indicating the origin
2603
revision. This might change when we have history horizons, or
2604
perhaps we should have a new API.
2606
This is topologically sorted.
2608
if _mod_revision.is_null(revision_id):
2610
if not self.has_revision(revision_id):
2611
raise errors.NoSuchRevision(self, revision_id)
2612
graph = self.get_graph()
2614
search = graph._make_breadth_first_searcher([revision_id])
2617
found, ghosts = search.next_with_ghosts()
2618
except StopIteration:
2621
if _mod_revision.NULL_REVISION in keys:
2622
keys.remove(_mod_revision.NULL_REVISION)
2624
parent_map = graph.get_parent_map(keys)
2625
keys = tsort.topo_sort(parent_map)
2626
return [None] + list(keys)
2628
def pack(self, hint=None):
2629
"""Compress the data within the repository.
2631
This operation only makes sense for some repository types. For other
2632
types it should be a no-op that just returns.
2634
This stub method does not require a lock, but subclasses should use
2635
@needs_write_lock as this is a long running call its reasonable to
2636
implicitly lock for the user.
2638
:param hint: If not supplied, the whole repository is packed.
2639
If supplied, the repository may use the hint parameter as a
2640
hint for the parts of the repository to pack. A hint can be
2641
obtained from the result of commit_write_group(). Out of
2642
date hints are simply ignored, because concurrent operations
2643
can obsolete them rapidly.
2646
def get_transaction(self):
2647
return self.control_files.get_transaction()
2649
def get_parent_map(self, revision_ids):
2650
"""See graph.StackedParentsProvider.get_parent_map"""
2651
# revisions index works in keys; this just works in revisions
2652
# therefore wrap and unwrap
2655
for revision_id in revision_ids:
2656
if revision_id == _mod_revision.NULL_REVISION:
2657
result[revision_id] = ()
2658
elif revision_id is None:
2659
raise ValueError('get_parent_map(None) is not valid')
2661
query_keys.append((revision_id ,))
2662
for ((revision_id,), parent_keys) in \
2663
self.revisions.get_parent_map(query_keys).iteritems():
2665
result[revision_id] = tuple(parent_revid
2666
for (parent_revid,) in parent_keys)
2668
result[revision_id] = (_mod_revision.NULL_REVISION,)
2671
def _make_parents_provider(self):
2674
def get_graph(self, other_repository=None):
2675
"""Return the graph walker for this repository format"""
2676
parents_provider = self._make_parents_provider()
2677
if (other_repository is not None and
2678
not self.has_same_location(other_repository)):
2679
parents_provider = graph.StackedParentsProvider(
2680
[parents_provider, other_repository._make_parents_provider()])
2681
return graph.Graph(parents_provider)
2683
def _get_versioned_file_checker(self, text_key_references=None,
2685
"""Return an object suitable for checking versioned files.
2687
:param text_key_references: if non-None, an already built
2688
dictionary mapping text keys ((fileid, revision_id) tuples)
2689
to whether they were referred to by the inventory of the
2690
revision_id that they contain. If None, this will be
2692
:param ancestors: Optional result from
2693
self.get_graph().get_parent_map(self.all_revision_ids()) if already
2696
return _VersionedFileChecker(self,
2697
text_key_references=text_key_references, ancestors=ancestors)
2699
def revision_ids_to_search_result(self, result_set):
2700
"""Convert a set of revision ids to a graph SearchResult."""
2701
result_parents = set()
2702
for parents in self.get_graph().get_parent_map(
2703
result_set).itervalues():
2704
result_parents.update(parents)
2705
included_keys = result_set.intersection(result_parents)
2706
start_keys = result_set.difference(included_keys)
2707
exclude_keys = result_parents.difference(result_set)
2708
result = graph.SearchResult(start_keys, exclude_keys,
2709
len(result_set), result_set)
2713
def set_make_working_trees(self, new_value):
2714
"""Set the policy flag for making working trees when creating branches.
2716
This only applies to branches that use this repository.
2718
The default is 'True'.
2719
:param new_value: True to restore the default, False to disable making
2722
raise NotImplementedError(self.set_make_working_trees)
2724
def make_working_trees(self):
2725
"""Returns the policy for making working trees on new branches."""
2726
raise NotImplementedError(self.make_working_trees)
2729
def sign_revision(self, revision_id, gpg_strategy):
2730
plaintext = Testament.from_revision(self, revision_id).as_short_text()
2731
self.store_revision_signature(gpg_strategy, plaintext, revision_id)
2734
def has_signature_for_revision_id(self, revision_id):
2735
"""Query for a revision signature for revision_id in the repository."""
2736
if not self.has_revision(revision_id):
2737
raise errors.NoSuchRevision(self, revision_id)
2738
sig_present = (1 == len(
2739
self.signatures.get_parent_map([(revision_id,)])))
2743
def get_signature_text(self, revision_id):
2744
"""Return the text for a signature."""
2745
stream = self.signatures.get_record_stream([(revision_id,)],
2747
record = stream.next()
2748
if record.storage_kind == 'absent':
2749
raise errors.NoSuchRevision(self, revision_id)
2750
return record.get_bytes_as('fulltext')
2753
def check(self, revision_ids=None, callback_refs=None, check_repo=True):
2754
"""Check consistency of all history of given revision_ids.
2756
Different repository implementations should override _check().
2758
:param revision_ids: A non-empty list of revision_ids whose ancestry
2759
will be checked. Typically the last revision_id of a branch.
2760
:param callback_refs: A dict of check-refs to resolve and callback
2761
the check/_check method on the items listed as wanting the ref.
2763
:param check_repo: If False do not check the repository contents, just
2764
calculate the data callback_refs requires and call them back.
2766
return self._check(revision_ids, callback_refs=callback_refs,
2767
check_repo=check_repo)
2769
def _check(self, revision_ids, callback_refs, check_repo):
2770
result = check.Check(self, check_repo=check_repo)
2771
result.check(callback_refs)
2774
def _warn_if_deprecated(self):
2775
global _deprecation_warning_done
2776
if _deprecation_warning_done:
2778
_deprecation_warning_done = True
2779
warning("Format %s for %s is deprecated - please use 'bzr upgrade' to get better performance"
2780
% (self._format, self.bzrdir.transport.base))
2782
def supports_rich_root(self):
2783
return self._format.rich_root_data
2785
def _check_ascii_revisionid(self, revision_id, method):
2786
"""Private helper for ascii-only repositories."""
2787
# weave repositories refuse to store revisionids that are non-ascii.
2788
if revision_id is not None:
2789
# weaves require ascii revision ids.
2790
if isinstance(revision_id, unicode):
2792
revision_id.encode('ascii')
2793
except UnicodeEncodeError:
2794
raise errors.NonAsciiRevisionId(method, self)
2797
revision_id.decode('ascii')
2798
except UnicodeDecodeError:
2799
raise errors.NonAsciiRevisionId(method, self)
2801
def revision_graph_can_have_wrong_parents(self):
2802
"""Is it possible for this repository to have a revision graph with
2805
If True, then this repository must also implement
2806
_find_inconsistent_revision_parents so that check and reconcile can
2807
check for inconsistencies before proceeding with other checks that may
2808
depend on the revision index being consistent.
2810
raise NotImplementedError(self.revision_graph_can_have_wrong_parents)
2813
# remove these delegates a while after bzr 0.15
2814
def __make_delegated(name, from_module):
2815
def _deprecated_repository_forwarder():
2816
symbol_versioning.warn('%s moved to %s in bzr 0.15'
2817
% (name, from_module),
2820
m = __import__(from_module, globals(), locals(), [name])
2822
return getattr(m, name)
2823
except AttributeError:
2824
raise AttributeError('module %s has no name %s'
2826
globals()[name] = _deprecated_repository_forwarder
2829
'AllInOneRepository',
2830
'WeaveMetaDirRepository',
2831
'PreSplitOutRepositoryFormat',
2832
'RepositoryFormat4',
2833
'RepositoryFormat5',
2834
'RepositoryFormat6',
2835
'RepositoryFormat7',
2837
__make_delegated(_name, 'bzrlib.repofmt.weaverepo')
2841
'RepositoryFormatKnit',
2842
'RepositoryFormatKnit1',
2844
__make_delegated(_name, 'bzrlib.repofmt.knitrepo')
2847
def install_revision(repository, rev, revision_tree):
2848
"""Install all revision data into a repository."""
2849
install_revisions(repository, [(rev, revision_tree, None)])
2852
def install_revisions(repository, iterable, num_revisions=None, pb=None):
2853
"""Install all revision data into a repository.
2855
Accepts an iterable of revision, tree, signature tuples. The signature
2858
repository.start_write_group()
2860
inventory_cache = lru_cache.LRUCache(10)
2861
for n, (revision, revision_tree, signature) in enumerate(iterable):
2862
_install_revision(repository, revision, revision_tree, signature,
2865
pb.update('Transferring revisions', n + 1, num_revisions)
2867
repository.abort_write_group()
2870
repository.commit_write_group()
2873
def _install_revision(repository, rev, revision_tree, signature,
2875
"""Install all revision data into a repository."""
2876
present_parents = []
2878
for p_id in rev.parent_ids:
2879
if repository.has_revision(p_id):
2880
present_parents.append(p_id)
2881
parent_trees[p_id] = repository.revision_tree(p_id)
2883
parent_trees[p_id] = repository.revision_tree(
2884
_mod_revision.NULL_REVISION)
2886
inv = revision_tree.inventory
2887
entries = inv.iter_entries()
2888
# backwards compatibility hack: skip the root id.
2889
if not repository.supports_rich_root():
2890
path, root = entries.next()
2891
if root.revision != rev.revision_id:
2892
raise errors.IncompatibleRevision(repr(repository))
2894
for path, ie in entries:
2895
text_keys[(ie.file_id, ie.revision)] = ie
2896
text_parent_map = repository.texts.get_parent_map(text_keys)
2897
missing_texts = set(text_keys) - set(text_parent_map)
2898
# Add the texts that are not already present
2899
for text_key in missing_texts:
2900
ie = text_keys[text_key]
2902
# FIXME: TODO: The following loop overlaps/duplicates that done by
2903
# commit to determine parents. There is a latent/real bug here where
2904
# the parents inserted are not those commit would do - in particular
2905
# they are not filtered by heads(). RBC, AB
2906
for revision, tree in parent_trees.iteritems():
2907
if ie.file_id not in tree:
2909
parent_id = tree.inventory[ie.file_id].revision
2910
if parent_id in text_parents:
2912
text_parents.append((ie.file_id, parent_id))
2913
lines = revision_tree.get_file(ie.file_id).readlines()
2914
repository.texts.add_lines(text_key, text_parents, lines)
2916
# install the inventory
2917
if repository._format._commit_inv_deltas and len(rev.parent_ids):
2918
# Cache this inventory
2919
inventory_cache[rev.revision_id] = inv
2921
basis_inv = inventory_cache[rev.parent_ids[0]]
2923
repository.add_inventory(rev.revision_id, inv, present_parents)
2925
delta = inv._make_delta(basis_inv)
2926
repository.add_inventory_by_delta(rev.parent_ids[0], delta,
2927
rev.revision_id, present_parents)
2929
repository.add_inventory(rev.revision_id, inv, present_parents)
2930
except errors.RevisionAlreadyPresent:
2932
if signature is not None:
2933
repository.add_signature_text(rev.revision_id, signature)
2934
repository.add_revision(rev.revision_id, rev, inv)
2937
class MetaDirRepository(Repository):
2938
"""Repositories in the new meta-dir layout.
2940
:ivar _transport: Transport for access to repository control files,
2941
typically pointing to .bzr/repository.
2944
def __init__(self, _format, a_bzrdir, control_files):
2945
super(MetaDirRepository, self).__init__(_format, a_bzrdir, control_files)
2946
self._transport = control_files._transport
2948
def is_shared(self):
2949
"""Return True if this repository is flagged as a shared repository."""
2950
return self._transport.has('shared-storage')
2953
def set_make_working_trees(self, new_value):
2954
"""Set the policy flag for making working trees when creating branches.
2956
This only applies to branches that use this repository.
2958
The default is 'True'.
2959
:param new_value: True to restore the default, False to disable making
2964
self._transport.delete('no-working-trees')
2965
except errors.NoSuchFile:
2968
self._transport.put_bytes('no-working-trees', '',
2969
mode=self.bzrdir._get_file_mode())
2971
def make_working_trees(self):
2972
"""Returns the policy for making working trees on new branches."""
2973
return not self._transport.has('no-working-trees')
2976
class MetaDirVersionedFileRepository(MetaDirRepository):
2977
"""Repositories in a meta-dir, that work via versioned file objects."""
2979
def __init__(self, _format, a_bzrdir, control_files):
2980
super(MetaDirVersionedFileRepository, self).__init__(_format, a_bzrdir,
2984
network_format_registry = registry.FormatRegistry()
2985
"""Registry of formats indexed by their network name.
2987
The network name for a repository format is an identifier that can be used when
2988
referring to formats with smart server operations. See
2989
RepositoryFormat.network_name() for more detail.
2993
format_registry = registry.FormatRegistry(network_format_registry)
2994
"""Registry of formats, indexed by their BzrDirMetaFormat format string.
2996
This can contain either format instances themselves, or classes/factories that
2997
can be called to obtain one.
3001
#####################################################################
3002
# Repository Formats
3004
class RepositoryFormat(object):
3005
"""A repository format.
3007
Formats provide four things:
3008
* An initialization routine to construct repository data on disk.
3009
* a optional format string which is used when the BzrDir supports
3011
* an open routine which returns a Repository instance.
3012
* A network name for referring to the format in smart server RPC
3015
There is one and only one Format subclass for each on-disk format. But
3016
there can be one Repository subclass that is used for several different
3017
formats. The _format attribute on a Repository instance can be used to
3018
determine the disk format.
3020
Formats are placed in a registry by their format string for reference
3021
during opening. These should be subclasses of RepositoryFormat for
3024
Once a format is deprecated, just deprecate the initialize and open
3025
methods on the format class. Do not deprecate the object, as the
3026
object may be created even when a repository instance hasn't been
3029
Common instance attributes:
3030
_matchingbzrdir - the bzrdir format that the repository format was
3031
originally written to work with. This can be used if manually
3032
constructing a bzrdir and repository, or more commonly for test suite
3036
# Set to True or False in derived classes. True indicates that the format
3037
# supports ghosts gracefully.
3038
supports_ghosts = None
3039
# Can this repository be given external locations to lookup additional
3040
# data. Set to True or False in derived classes.
3041
supports_external_lookups = None
3042
# Does this format support CHK bytestring lookups. Set to True or False in
3044
supports_chks = None
3045
# Should commit add an inventory, or an inventory delta to the repository.
3046
_commit_inv_deltas = True
3047
# What order should fetch operations request streams in?
3048
# The default is unordered as that is the cheapest for an origin to
3050
_fetch_order = 'unordered'
3051
# Does this repository format use deltas that can be fetched as-deltas ?
3052
# (E.g. knits, where the knit deltas can be transplanted intact.
3053
# We default to False, which will ensure that enough data to get
3054
# a full text out of any fetch stream will be grabbed.
3055
_fetch_uses_deltas = False
3056
# Should fetch trigger a reconcile after the fetch? Only needed for
3057
# some repository formats that can suffer internal inconsistencies.
3058
_fetch_reconcile = False
3059
# Does this format have < O(tree_size) delta generation. Used to hint what
3060
# code path for commit, amongst other things.
3062
# Does doing a pack operation compress data? Useful for the pack UI command
3063
# (so if there is one pack, the operation can still proceed because it may
3064
# help), and for fetching when data won't have come from the same
3066
pack_compresses = False
3067
# Does the repository inventory storage understand references to trees?
3068
supports_tree_reference = None
3071
return "<%s>" % self.__class__.__name__
3073
def __eq__(self, other):
3074
# format objects are generally stateless
3075
return isinstance(other, self.__class__)
3077
def __ne__(self, other):
3078
return not self == other
3081
def find_format(klass, a_bzrdir):
3082
"""Return the format for the repository object in a_bzrdir.
3084
This is used by bzr native formats that have a "format" file in
3085
the repository. Other methods may be used by different types of
3089
transport = a_bzrdir.get_repository_transport(None)
3090
format_string = transport.get("format").read()
3091
return format_registry.get(format_string)
3092
except errors.NoSuchFile:
3093
raise errors.NoRepositoryPresent(a_bzrdir)
3095
raise errors.UnknownFormatError(format=format_string,
3099
def register_format(klass, format):
3100
format_registry.register(format.get_format_string(), format)
3103
def unregister_format(klass, format):
3104
format_registry.remove(format.get_format_string())
3107
def get_default_format(klass):
3108
"""Return the current default format."""
3109
from bzrlib import bzrdir
3110
return bzrdir.format_registry.make_bzrdir('default').repository_format
3112
def get_format_string(self):
3113
"""Return the ASCII format string that identifies this format.
3115
Note that in pre format ?? repositories the format string is
3116
not permitted nor written to disk.
3118
raise NotImplementedError(self.get_format_string)
3120
def get_format_description(self):
3121
"""Return the short description for this format."""
3122
raise NotImplementedError(self.get_format_description)
3124
# TODO: this shouldn't be in the base class, it's specific to things that
3125
# use weaves or knits -- mbp 20070207
3126
def _get_versioned_file_store(self,
3131
versionedfile_class=None,
3132
versionedfile_kwargs={},
3134
if versionedfile_class is None:
3135
versionedfile_class = self._versionedfile_class
3136
weave_transport = control_files._transport.clone(name)
3137
dir_mode = control_files._dir_mode
3138
file_mode = control_files._file_mode
3139
return VersionedFileStore(weave_transport, prefixed=prefixed,
3141
file_mode=file_mode,
3142
versionedfile_class=versionedfile_class,
3143
versionedfile_kwargs=versionedfile_kwargs,
3146
def initialize(self, a_bzrdir, shared=False):
3147
"""Initialize a repository of this format in a_bzrdir.
3149
:param a_bzrdir: The bzrdir to put the new repository in it.
3150
:param shared: The repository should be initialized as a sharable one.
3151
:returns: The new repository object.
3153
This may raise UninitializableFormat if shared repository are not
3154
compatible the a_bzrdir.
3156
raise NotImplementedError(self.initialize)
3158
def is_supported(self):
3159
"""Is this format supported?
3161
Supported formats must be initializable and openable.
3162
Unsupported formats may not support initialization or committing or
3163
some other features depending on the reason for not being supported.
3167
def network_name(self):
3168
"""A simple byte string uniquely identifying this format for RPC calls.
3170
MetaDir repository formats use their disk format string to identify the
3171
repository over the wire. All in one formats such as bzr < 0.8, and
3172
foreign formats like svn/git and hg should use some marker which is
3173
unique and immutable.
3175
raise NotImplementedError(self.network_name)
3177
def check_conversion_target(self, target_format):
3178
if self.rich_root_data and not target_format.rich_root_data:
3179
raise errors.BadConversionTarget(
3180
'Does not support rich root data.', target_format,
3182
if (self.supports_tree_reference and
3183
not getattr(target_format, 'supports_tree_reference', False)):
3184
raise errors.BadConversionTarget(
3185
'Does not support nested trees', target_format,
3188
def open(self, a_bzrdir, _found=False):
3189
"""Return an instance of this format for the bzrdir a_bzrdir.
3191
_found is a private parameter, do not use it.
3193
raise NotImplementedError(self.open)
3196
class MetaDirRepositoryFormat(RepositoryFormat):
3197
"""Common base class for the new repositories using the metadir layout."""
3199
rich_root_data = False
3200
supports_tree_reference = False
3201
supports_external_lookups = False
3204
def _matchingbzrdir(self):
3205
matching = bzrdir.BzrDirMetaFormat1()
3206
matching.repository_format = self
3210
super(MetaDirRepositoryFormat, self).__init__()
3212
def _create_control_files(self, a_bzrdir):
3213
"""Create the required files and the initial control_files object."""
3214
# FIXME: RBC 20060125 don't peek under the covers
3215
# NB: no need to escape relative paths that are url safe.
3216
repository_transport = a_bzrdir.get_repository_transport(self)
3217
control_files = lockable_files.LockableFiles(repository_transport,
3218
'lock', lockdir.LockDir)
3219
control_files.create_lock()
3220
return control_files
3222
def _upload_blank_content(self, a_bzrdir, dirs, files, utf8_files, shared):
3223
"""Upload the initial blank content."""
3224
control_files = self._create_control_files(a_bzrdir)
3225
control_files.lock_write()
3226
transport = control_files._transport
3228
utf8_files += [('shared-storage', '')]
3230
transport.mkdir_multi(dirs, mode=a_bzrdir._get_dir_mode())
3231
for (filename, content_stream) in files:
3232
transport.put_file(filename, content_stream,
3233
mode=a_bzrdir._get_file_mode())
3234
for (filename, content_bytes) in utf8_files:
3235
transport.put_bytes_non_atomic(filename, content_bytes,
3236
mode=a_bzrdir._get_file_mode())
3238
control_files.unlock()
3240
def network_name(self):
3241
"""Metadir formats have matching disk and network format strings."""
3242
return self.get_format_string()
3245
# Pre-0.8 formats that don't have a disk format string (because they are
3246
# versioned by the matching control directory). We use the control directories
3247
# disk format string as a key for the network_name because they meet the
3248
# constraints (simple string, unique, immutable).
3249
network_format_registry.register_lazy(
3250
"Bazaar-NG branch, format 5\n",
3251
'bzrlib.repofmt.weaverepo',
3252
'RepositoryFormat5',
3254
network_format_registry.register_lazy(
3255
"Bazaar-NG branch, format 6\n",
3256
'bzrlib.repofmt.weaverepo',
3257
'RepositoryFormat6',
3260
# formats which have no format string are not discoverable or independently
3261
# creatable on disk, so are not registered in format_registry. They're
3262
# all in bzrlib.repofmt.weaverepo now. When an instance of one of these is
3263
# needed, it's constructed directly by the BzrDir. Non-native formats where
3264
# the repository is not separately opened are similar.
3266
format_registry.register_lazy(
3267
'Bazaar-NG Repository format 7',
3268
'bzrlib.repofmt.weaverepo',
3272
format_registry.register_lazy(
3273
'Bazaar-NG Knit Repository Format 1',
3274
'bzrlib.repofmt.knitrepo',
3275
'RepositoryFormatKnit1',
3278
format_registry.register_lazy(
3279
'Bazaar Knit Repository Format 3 (bzr 0.15)\n',
3280
'bzrlib.repofmt.knitrepo',
3281
'RepositoryFormatKnit3',
3284
format_registry.register_lazy(
3285
'Bazaar Knit Repository Format 4 (bzr 1.0)\n',
3286
'bzrlib.repofmt.knitrepo',
3287
'RepositoryFormatKnit4',
3290
# Pack-based formats. There is one format for pre-subtrees, and one for
3291
# post-subtrees to allow ease of testing.
3292
# NOTE: These are experimental in 0.92. Stable in 1.0 and above
3293
format_registry.register_lazy(
3294
'Bazaar pack repository format 1 (needs bzr 0.92)\n',
3295
'bzrlib.repofmt.pack_repo',
3296
'RepositoryFormatKnitPack1',
3298
format_registry.register_lazy(
3299
'Bazaar pack repository format 1 with subtree support (needs bzr 0.92)\n',
3300
'bzrlib.repofmt.pack_repo',
3301
'RepositoryFormatKnitPack3',
3303
format_registry.register_lazy(
3304
'Bazaar pack repository format 1 with rich root (needs bzr 1.0)\n',
3305
'bzrlib.repofmt.pack_repo',
3306
'RepositoryFormatKnitPack4',
3308
format_registry.register_lazy(
3309
'Bazaar RepositoryFormatKnitPack5 (bzr 1.6)\n',
3310
'bzrlib.repofmt.pack_repo',
3311
'RepositoryFormatKnitPack5',
3313
format_registry.register_lazy(
3314
'Bazaar RepositoryFormatKnitPack5RichRoot (bzr 1.6.1)\n',
3315
'bzrlib.repofmt.pack_repo',
3316
'RepositoryFormatKnitPack5RichRoot',
3318
format_registry.register_lazy(
3319
'Bazaar RepositoryFormatKnitPack5RichRoot (bzr 1.6)\n',
3320
'bzrlib.repofmt.pack_repo',
3321
'RepositoryFormatKnitPack5RichRootBroken',
3323
format_registry.register_lazy(
3324
'Bazaar RepositoryFormatKnitPack6 (bzr 1.9)\n',
3325
'bzrlib.repofmt.pack_repo',
3326
'RepositoryFormatKnitPack6',
3328
format_registry.register_lazy(
3329
'Bazaar RepositoryFormatKnitPack6RichRoot (bzr 1.9)\n',
3330
'bzrlib.repofmt.pack_repo',
3331
'RepositoryFormatKnitPack6RichRoot',
3334
# Development formats.
3335
# Obsolete but kept pending a CHK based subtree format.
3336
format_registry.register_lazy(
3337
("Bazaar development format 2 with subtree support "
3338
"(needs bzr.dev from before 1.8)\n"),
3339
'bzrlib.repofmt.pack_repo',
3340
'RepositoryFormatPackDevelopment2Subtree',
3343
# 1.14->1.16 go below here
3344
format_registry.register_lazy(
3345
'Bazaar development format - group compression and chk inventory'
3346
' (needs bzr.dev from 1.14)\n',
3347
'bzrlib.repofmt.groupcompress_repo',
3348
'RepositoryFormatCHK1',
3351
format_registry.register_lazy(
3352
'Bazaar development format - chk repository with bencode revision '
3353
'serialization (needs bzr.dev from 1.16)\n',
3354
'bzrlib.repofmt.groupcompress_repo',
3355
'RepositoryFormatCHK2',
3357
format_registry.register_lazy(
3358
'Bazaar repository format 2a (needs bzr 1.16 or later)\n',
3359
'bzrlib.repofmt.groupcompress_repo',
3360
'RepositoryFormat2a',
3364
class InterRepository(InterObject):
3365
"""This class represents operations taking place between two repositories.
3367
Its instances have methods like copy_content and fetch, and contain
3368
references to the source and target repositories these operations can be
3371
Often we will provide convenience methods on 'repository' which carry out
3372
operations with another repository - they will always forward to
3373
InterRepository.get(other).method_name(parameters).
3376
_walk_to_common_revisions_batch_size = 50
3378
"""The available optimised InterRepository types."""
3381
def copy_content(self, revision_id=None):
3382
"""Make a complete copy of the content in self into destination.
3384
This is a destructive operation! Do not use it on existing
3387
:param revision_id: Only copy the content needed to construct
3388
revision_id and its parents.
3391
self.target.set_make_working_trees(self.source.make_working_trees())
3392
except NotImplementedError:
3394
self.target.fetch(self.source, revision_id=revision_id)
3397
def fetch(self, revision_id=None, pb=None, find_ghosts=False,
3399
"""Fetch the content required to construct revision_id.
3401
The content is copied from self.source to self.target.
3403
:param revision_id: if None all content is copied, if NULL_REVISION no
3405
:param pb: optional progress bar to use for progress reports. If not
3406
provided a default one will be created.
3409
from bzrlib.fetch import RepoFetcher
3410
f = RepoFetcher(to_repository=self.target,
3411
from_repository=self.source,
3412
last_revision=revision_id,
3413
fetch_spec=fetch_spec,
3414
pb=pb, find_ghosts=find_ghosts)
3416
def _walk_to_common_revisions(self, revision_ids):
3417
"""Walk out from revision_ids in source to revisions target has.
3419
:param revision_ids: The start point for the search.
3420
:return: A set of revision ids.
3422
target_graph = self.target.get_graph()
3423
revision_ids = frozenset(revision_ids)
3424
missing_revs = set()
3425
source_graph = self.source.get_graph()
3426
# ensure we don't pay silly lookup costs.
3427
searcher = source_graph._make_breadth_first_searcher(revision_ids)
3428
null_set = frozenset([_mod_revision.NULL_REVISION])
3429
searcher_exhausted = False
3433
# Iterate the searcher until we have enough next_revs
3434
while len(next_revs) < self._walk_to_common_revisions_batch_size:
3436
next_revs_part, ghosts_part = searcher.next_with_ghosts()
3437
next_revs.update(next_revs_part)
3438
ghosts.update(ghosts_part)
3439
except StopIteration:
3440
searcher_exhausted = True
3442
# If there are ghosts in the source graph, and the caller asked for
3443
# them, make sure that they are present in the target.
3444
# We don't care about other ghosts as we can't fetch them and
3445
# haven't been asked to.
3446
ghosts_to_check = set(revision_ids.intersection(ghosts))
3447
revs_to_get = set(next_revs).union(ghosts_to_check)
3449
have_revs = set(target_graph.get_parent_map(revs_to_get))
3450
# we always have NULL_REVISION present.
3451
have_revs = have_revs.union(null_set)
3452
# Check if the target is missing any ghosts we need.
3453
ghosts_to_check.difference_update(have_revs)
3455
# One of the caller's revision_ids is a ghost in both the
3456
# source and the target.
3457
raise errors.NoSuchRevision(
3458
self.source, ghosts_to_check.pop())
3459
missing_revs.update(next_revs - have_revs)
3460
# Because we may have walked past the original stop point, make
3461
# sure everything is stopped
3462
stop_revs = searcher.find_seen_ancestors(have_revs)
3463
searcher.stop_searching_any(stop_revs)
3464
if searcher_exhausted:
3466
return searcher.get_result()
3469
def search_missing_revision_ids(self, revision_id=None, find_ghosts=True):
3470
"""Return the revision ids that source has that target does not.
3472
:param revision_id: only return revision ids included by this
3474
:param find_ghosts: If True find missing revisions in deep history
3475
rather than just finding the surface difference.
3476
:return: A bzrlib.graph.SearchResult.
3478
# stop searching at found target revisions.
3479
if not find_ghosts and revision_id is not None:
3480
return self._walk_to_common_revisions([revision_id])
3481
# generic, possibly worst case, slow code path.
3482
target_ids = set(self.target.all_revision_ids())
3483
if revision_id is not None:
3484
source_ids = self.source.get_ancestry(revision_id)
3485
if source_ids[0] is not None:
3486
raise AssertionError()
3489
source_ids = self.source.all_revision_ids()
3490
result_set = set(source_ids).difference(target_ids)
3491
return self.source.revision_ids_to_search_result(result_set)
3494
def _same_model(source, target):
3495
"""True if source and target have the same data representation.
3497
Note: this is always called on the base class; overriding it in a
3498
subclass will have no effect.
3501
InterRepository._assert_same_model(source, target)
3503
except errors.IncompatibleRepositories, e:
3507
def _assert_same_model(source, target):
3508
"""Raise an exception if two repositories do not use the same model.
3510
if source.supports_rich_root() != target.supports_rich_root():
3511
raise errors.IncompatibleRepositories(source, target,
3512
"different rich-root support")
3513
if source._serializer != target._serializer:
3514
raise errors.IncompatibleRepositories(source, target,
3515
"different serializers")
3518
class InterSameDataRepository(InterRepository):
3519
"""Code for converting between repositories that represent the same data.
3521
Data format and model must match for this to work.
3525
def _get_repo_format_to_test(self):
3526
"""Repository format for testing with.
3528
InterSameData can pull from subtree to subtree and from non-subtree to
3529
non-subtree, so we test this with the richest repository format.
3531
from bzrlib.repofmt import knitrepo
3532
return knitrepo.RepositoryFormatKnit3()
3535
def is_compatible(source, target):
3536
return InterRepository._same_model(source, target)
3539
class InterWeaveRepo(InterSameDataRepository):
3540
"""Optimised code paths between Weave based repositories.
3542
This should be in bzrlib/repofmt/weaverepo.py but we have not yet
3543
implemented lazy inter-object optimisation.
3547
def _get_repo_format_to_test(self):
3548
from bzrlib.repofmt import weaverepo
3549
return weaverepo.RepositoryFormat7()
3552
def is_compatible(source, target):
3553
"""Be compatible with known Weave formats.
3555
We don't test for the stores being of specific types because that
3556
could lead to confusing results, and there is no need to be
3559
from bzrlib.repofmt.weaverepo import (
3565
return (isinstance(source._format, (RepositoryFormat5,
3567
RepositoryFormat7)) and
3568
isinstance(target._format, (RepositoryFormat5,
3570
RepositoryFormat7)))
3571
except AttributeError:
3575
def copy_content(self, revision_id=None):
3576
"""See InterRepository.copy_content()."""
3577
# weave specific optimised path:
3579
self.target.set_make_working_trees(self.source.make_working_trees())
3580
except (errors.RepositoryUpgradeRequired, NotImplemented):
3582
# FIXME do not peek!
3583
if self.source._transport.listable():
3584
pb = ui.ui_factory.nested_progress_bar()
3586
self.target.texts.insert_record_stream(
3587
self.source.texts.get_record_stream(
3588
self.source.texts.keys(), 'topological', False))
3589
pb.update('Copying inventory', 0, 1)
3590
self.target.inventories.insert_record_stream(
3591
self.source.inventories.get_record_stream(
3592
self.source.inventories.keys(), 'topological', False))
3593
self.target.signatures.insert_record_stream(
3594
self.source.signatures.get_record_stream(
3595
self.source.signatures.keys(),
3597
self.target.revisions.insert_record_stream(
3598
self.source.revisions.get_record_stream(
3599
self.source.revisions.keys(),
3600
'topological', True))
3604
self.target.fetch(self.source, revision_id=revision_id)
3607
def search_missing_revision_ids(self, revision_id=None, find_ghosts=True):
3608
"""See InterRepository.missing_revision_ids()."""
3609
# we want all revisions to satisfy revision_id in source.
3610
# but we don't want to stat every file here and there.
3611
# we want then, all revisions other needs to satisfy revision_id
3612
# checked, but not those that we have locally.
3613
# so the first thing is to get a subset of the revisions to
3614
# satisfy revision_id in source, and then eliminate those that
3615
# we do already have.
3616
# this is slow on high latency connection to self, but as this
3617
# disk format scales terribly for push anyway due to rewriting
3618
# inventory.weave, this is considered acceptable.
3620
if revision_id is not None:
3621
source_ids = self.source.get_ancestry(revision_id)
3622
if source_ids[0] is not None:
3623
raise AssertionError()
3626
source_ids = self.source._all_possible_ids()
3627
source_ids_set = set(source_ids)
3628
# source_ids is the worst possible case we may need to pull.
3629
# now we want to filter source_ids against what we actually
3630
# have in target, but don't try to check for existence where we know
3631
# we do not have a revision as that would be pointless.
3632
target_ids = set(self.target._all_possible_ids())
3633
possibly_present_revisions = target_ids.intersection(source_ids_set)
3634
actually_present_revisions = set(
3635
self.target._eliminate_revisions_not_present(possibly_present_revisions))
3636
required_revisions = source_ids_set.difference(actually_present_revisions)
3637
if revision_id is not None:
3638
# we used get_ancestry to determine source_ids then we are assured all
3639
# revisions referenced are present as they are installed in topological order.
3640
# and the tip revision was validated by get_ancestry.
3641
result_set = required_revisions
3643
# if we just grabbed the possibly available ids, then
3644
# we only have an estimate of whats available and need to validate
3645
# that against the revision records.
3647
self.source._eliminate_revisions_not_present(required_revisions))
3648
return self.source.revision_ids_to_search_result(result_set)
3651
class InterKnitRepo(InterSameDataRepository):
3652
"""Optimised code paths between Knit based repositories."""
3655
def _get_repo_format_to_test(self):
3656
from bzrlib.repofmt import knitrepo
3657
return knitrepo.RepositoryFormatKnit1()
3660
def is_compatible(source, target):
3661
"""Be compatible with known Knit formats.
3663
We don't test for the stores being of specific types because that
3664
could lead to confusing results, and there is no need to be
3667
from bzrlib.repofmt.knitrepo import RepositoryFormatKnit
3669
are_knits = (isinstance(source._format, RepositoryFormatKnit) and
3670
isinstance(target._format, RepositoryFormatKnit))
3671
except AttributeError:
3673
return are_knits and InterRepository._same_model(source, target)
3676
def search_missing_revision_ids(self, revision_id=None, find_ghosts=True):
3677
"""See InterRepository.missing_revision_ids()."""
3678
if revision_id is not None:
3679
source_ids = self.source.get_ancestry(revision_id)
3680
if source_ids[0] is not None:
3681
raise AssertionError()
3684
source_ids = self.source.all_revision_ids()
3685
source_ids_set = set(source_ids)
3686
# source_ids is the worst possible case we may need to pull.
3687
# now we want to filter source_ids against what we actually
3688
# have in target, but don't try to check for existence where we know
3689
# we do not have a revision as that would be pointless.
3690
target_ids = set(self.target.all_revision_ids())
3691
possibly_present_revisions = target_ids.intersection(source_ids_set)
3692
actually_present_revisions = set(
3693
self.target._eliminate_revisions_not_present(possibly_present_revisions))
3694
required_revisions = source_ids_set.difference(actually_present_revisions)
3695
if revision_id is not None:
3696
# we used get_ancestry to determine source_ids then we are assured all
3697
# revisions referenced are present as they are installed in topological order.
3698
# and the tip revision was validated by get_ancestry.
3699
result_set = required_revisions
3701
# if we just grabbed the possibly available ids, then
3702
# we only have an estimate of whats available and need to validate
3703
# that against the revision records.
3705
self.source._eliminate_revisions_not_present(required_revisions))
3706
return self.source.revision_ids_to_search_result(result_set)
3709
class InterDifferingSerializer(InterRepository):
3712
def _get_repo_format_to_test(self):
3716
def is_compatible(source, target):
3717
"""Be compatible with Knit2 source and Knit3 target"""
3718
# This is redundant with format.check_conversion_target(), however that
3719
# raises an exception, and we just want to say "False" as in we won't
3720
# support converting between these formats.
3721
if 'IDS_never' in debug.debug_flags:
3723
if source.supports_rich_root() and not target.supports_rich_root():
3725
if (source._format.supports_tree_reference
3726
and not target._format.supports_tree_reference):
3728
if target._fallback_repositories and target._format.supports_chks:
3729
# IDS doesn't know how to copy CHKs for the parent inventories it
3730
# adds to stacked repos.
3732
if 'IDS_always' in debug.debug_flags:
3734
# Only use this code path for local source and target. IDS does far
3735
# too much IO (both bandwidth and roundtrips) over a network.
3736
if not source.bzrdir.transport.base.startswith('file:///'):
3738
if not target.bzrdir.transport.base.startswith('file:///'):
3742
def _get_trees(self, revision_ids, cache):
3744
for rev_id in revision_ids:
3746
possible_trees.append((rev_id, cache[rev_id]))
3748
# Not cached, but inventory might be present anyway.
3750
tree = self.source.revision_tree(rev_id)
3751
except errors.NoSuchRevision:
3752
# Nope, parent is ghost.
3755
cache[rev_id] = tree
3756
possible_trees.append((rev_id, tree))
3757
return possible_trees
3759
def _get_delta_for_revision(self, tree, parent_ids, possible_trees):
3760
"""Get the best delta and base for this revision.
3762
:return: (basis_id, delta)
3765
# Generate deltas against each tree, to find the shortest.
3766
texts_possibly_new_in_tree = set()
3767
for basis_id, basis_tree in possible_trees:
3768
delta = tree.inventory._make_delta(basis_tree.inventory)
3769
for old_path, new_path, file_id, new_entry in delta:
3770
if new_path is None:
3771
# This file_id isn't present in the new rev, so we don't
3775
# Rich roots are handled elsewhere...
3777
kind = new_entry.kind
3778
if kind != 'directory' and kind != 'file':
3779
# No text record associated with this inventory entry.
3781
# This is a directory or file that has changed somehow.
3782
texts_possibly_new_in_tree.add((file_id, new_entry.revision))
3783
deltas.append((len(delta), basis_id, delta))
3785
return deltas[0][1:]
3787
def _fetch_parent_invs_for_stacking(self, parent_map, cache):
3788
"""Find all parent revisions that are absent, but for which the
3789
inventory is present, and copy those inventories.
3791
This is necessary to preserve correctness when the source is stacked
3792
without fallbacks configured. (Note that in cases like upgrade the
3793
source may be not have _fallback_repositories even though it is
3797
for parents in parent_map.values():
3798
parent_revs.update(parents)
3799
present_parents = self.source.get_parent_map(parent_revs)
3800
absent_parents = set(parent_revs).difference(present_parents)
3801
parent_invs_keys_for_stacking = self.source.inventories.get_parent_map(
3802
(rev_id,) for rev_id in absent_parents)
3803
parent_inv_ids = [key[-1] for key in parent_invs_keys_for_stacking]
3804
for parent_tree in self.source.revision_trees(parent_inv_ids):
3805
current_revision_id = parent_tree.get_revision_id()
3806
parents_parents_keys = parent_invs_keys_for_stacking[
3807
(current_revision_id,)]
3808
parents_parents = [key[-1] for key in parents_parents_keys]
3809
basis_id = _mod_revision.NULL_REVISION
3810
basis_tree = self.source.revision_tree(basis_id)
3811
delta = parent_tree.inventory._make_delta(basis_tree.inventory)
3812
self.target.add_inventory_by_delta(
3813
basis_id, delta, current_revision_id, parents_parents)
3814
cache[current_revision_id] = parent_tree
3816
def _fetch_batch(self, revision_ids, basis_id, cache):
3817
"""Fetch across a few revisions.
3819
:param revision_ids: The revisions to copy
3820
:param basis_id: The revision_id of a tree that must be in cache, used
3821
as a basis for delta when no other base is available
3822
:param cache: A cache of RevisionTrees that we can use.
3823
:return: The revision_id of the last converted tree. The RevisionTree
3824
for it will be in cache
3826
# Walk though all revisions; get inventory deltas, copy referenced
3827
# texts that delta references, insert the delta, revision and
3829
root_keys_to_create = set()
3832
pending_revisions = []
3833
parent_map = self.source.get_parent_map(revision_ids)
3834
self._fetch_parent_invs_for_stacking(parent_map, cache)
3835
for tree in self.source.revision_trees(revision_ids):
3836
# Find a inventory delta for this revision.
3837
# Find text entries that need to be copied, too.
3838
current_revision_id = tree.get_revision_id()
3839
parent_ids = parent_map.get(current_revision_id, ())
3840
parent_trees = self._get_trees(parent_ids, cache)
3841
possible_trees = list(parent_trees)
3842
if len(possible_trees) == 0:
3843
# There either aren't any parents, or the parents are ghosts,
3844
# so just use the last converted tree.
3845
possible_trees.append((basis_id, cache[basis_id]))
3846
basis_id, delta = self._get_delta_for_revision(tree, parent_ids,
3848
revision = self.source.get_revision(current_revision_id)
3849
pending_deltas.append((basis_id, delta,
3850
current_revision_id, revision.parent_ids))
3851
if self._converting_to_rich_root:
3852
self._revision_id_to_root_id[current_revision_id] = \
3854
# Determine which texts are in present in this revision but not in
3855
# any of the available parents.
3856
texts_possibly_new_in_tree = set()
3857
for old_path, new_path, file_id, entry in delta:
3858
if new_path is None:
3859
# This file_id isn't present in the new rev
3863
if not self.target.supports_rich_root():
3864
# The target doesn't support rich root, so we don't
3867
if self._converting_to_rich_root:
3868
# This can't be copied normally, we have to insert
3870
root_keys_to_create.add((file_id, entry.revision))
3873
texts_possibly_new_in_tree.add((file_id, entry.revision))
3874
for basis_id, basis_tree in possible_trees:
3875
basis_inv = basis_tree.inventory
3876
for file_key in list(texts_possibly_new_in_tree):
3877
file_id, file_revision = file_key
3879
entry = basis_inv[file_id]
3880
except errors.NoSuchId:
3882
if entry.revision == file_revision:
3883
texts_possibly_new_in_tree.remove(file_key)
3884
text_keys.update(texts_possibly_new_in_tree)
3885
pending_revisions.append(revision)
3886
cache[current_revision_id] = tree
3887
basis_id = current_revision_id
3889
from_texts = self.source.texts
3890
to_texts = self.target.texts
3891
if root_keys_to_create:
3892
from bzrlib.fetch import _new_root_data_stream
3893
root_stream = _new_root_data_stream(
3894
root_keys_to_create, self._revision_id_to_root_id, parent_map,
3896
to_texts.insert_record_stream(root_stream)
3897
to_texts.insert_record_stream(from_texts.get_record_stream(
3898
text_keys, self.target._format._fetch_order,
3899
not self.target._format._fetch_uses_deltas))
3900
# insert inventory deltas
3901
for delta in pending_deltas:
3902
self.target.add_inventory_by_delta(*delta)
3903
if self.target._fallback_repositories:
3904
# Make sure this stacked repository has all the parent inventories
3905
# for the new revisions that we are about to insert. We do this
3906
# before adding the revisions so that no revision is added until
3907
# all the inventories it may depend on are added.
3908
# Note that this is overzealous, as we may have fetched these in an
3911
revision_ids = set()
3912
for revision in pending_revisions:
3913
revision_ids.add(revision.revision_id)
3914
parent_ids.update(revision.parent_ids)
3915
parent_ids.difference_update(revision_ids)
3916
parent_ids.discard(_mod_revision.NULL_REVISION)
3917
parent_map = self.source.get_parent_map(parent_ids)
3918
# we iterate over parent_map and not parent_ids because we don't
3919
# want to try copying any revision which is a ghost
3920
for parent_tree in self.source.revision_trees(parent_map):
3921
current_revision_id = parent_tree.get_revision_id()
3922
parents_parents = parent_map[current_revision_id]
3923
possible_trees = self._get_trees(parents_parents, cache)
3924
if len(possible_trees) == 0:
3925
# There either aren't any parents, or the parents are
3926
# ghosts, so just use the last converted tree.
3927
possible_trees.append((basis_id, cache[basis_id]))
3928
basis_id, delta = self._get_delta_for_revision(parent_tree,
3929
parents_parents, possible_trees)
3930
self.target.add_inventory_by_delta(
3931
basis_id, delta, current_revision_id, parents_parents)
3932
# insert signatures and revisions
3933
for revision in pending_revisions:
3935
signature = self.source.get_signature_text(
3936
revision.revision_id)
3937
self.target.add_signature_text(revision.revision_id,
3939
except errors.NoSuchRevision:
3941
self.target.add_revision(revision.revision_id, revision)
3944
def _fetch_all_revisions(self, revision_ids, pb):
3945
"""Fetch everything for the list of revisions.
3947
:param revision_ids: The list of revisions to fetch. Must be in
3949
:param pb: A ProgressTask
3952
basis_id, basis_tree = self._get_basis(revision_ids[0])
3954
cache = lru_cache.LRUCache(100)
3955
cache[basis_id] = basis_tree
3956
del basis_tree # We don't want to hang on to it here
3958
for offset in range(0, len(revision_ids), batch_size):
3959
self.target.start_write_group()
3961
pb.update('Transferring revisions', offset,
3963
batch = revision_ids[offset:offset+batch_size]
3964
basis_id = self._fetch_batch(batch, basis_id, cache)
3966
self.target.abort_write_group()
3969
hint = self.target.commit_write_group()
3972
if hints and self.target._format.pack_compresses:
3973
self.target.pack(hint=hints)
3974
pb.update('Transferring revisions', len(revision_ids),
3978
def fetch(self, revision_id=None, pb=None, find_ghosts=False,
3980
"""See InterRepository.fetch()."""
3981
if fetch_spec is not None:
3982
raise AssertionError("Not implemented yet...")
3983
if (not self.source.supports_rich_root()
3984
and self.target.supports_rich_root()):
3985
self._converting_to_rich_root = True
3986
self._revision_id_to_root_id = {}
3988
self._converting_to_rich_root = False
3989
revision_ids = self.target.search_missing_revision_ids(self.source,
3990
revision_id, find_ghosts=find_ghosts).get_keys()
3991
if not revision_ids:
3993
revision_ids = tsort.topo_sort(
3994
self.source.get_graph().get_parent_map(revision_ids))
3995
if not revision_ids:
3997
# Walk though all revisions; get inventory deltas, copy referenced
3998
# texts that delta references, insert the delta, revision and
4001
my_pb = ui.ui_factory.nested_progress_bar()
4004
symbol_versioning.warn(
4005
symbol_versioning.deprecated_in((1, 14, 0))
4006
% "pb parameter to fetch()")
4009
self._fetch_all_revisions(revision_ids, pb)
4011
if my_pb is not None:
4013
return len(revision_ids), 0
4015
def _get_basis(self, first_revision_id):
4016
"""Get a revision and tree which exists in the target.
4018
This assumes that first_revision_id is selected for transmission
4019
because all other ancestors are already present. If we can't find an
4020
ancestor we fall back to NULL_REVISION since we know that is safe.
4022
:return: (basis_id, basis_tree)
4024
first_rev = self.source.get_revision(first_revision_id)
4026
basis_id = first_rev.parent_ids[0]
4027
# only valid as a basis if the target has it
4028
self.target.get_revision(basis_id)
4029
# Try to get a basis tree - if its a ghost it will hit the
4030
# NoSuchRevision case.
4031
basis_tree = self.source.revision_tree(basis_id)
4032
except (IndexError, errors.NoSuchRevision):
4033
basis_id = _mod_revision.NULL_REVISION
4034
basis_tree = self.source.revision_tree(basis_id)
4035
return basis_id, basis_tree
4038
InterRepository.register_optimiser(InterDifferingSerializer)
4039
InterRepository.register_optimiser(InterSameDataRepository)
4040
InterRepository.register_optimiser(InterWeaveRepo)
4041
InterRepository.register_optimiser(InterKnitRepo)
4044
class CopyConverter(object):
4045
"""A repository conversion tool which just performs a copy of the content.
4047
This is slow but quite reliable.
4050
def __init__(self, target_format):
4051
"""Create a CopyConverter.
4053
:param target_format: The format the resulting repository should be.
4055
self.target_format = target_format
4057
def convert(self, repo, pb):
4058
"""Perform the conversion of to_convert, giving feedback via pb.
4060
:param to_convert: The disk object to convert.
4061
:param pb: a progress bar to use for progress information.
4066
# this is only useful with metadir layouts - separated repo content.
4067
# trigger an assertion if not such
4068
repo._format.get_format_string()
4069
self.repo_dir = repo.bzrdir
4070
self.step('Moving repository to repository.backup')
4071
self.repo_dir.transport.move('repository', 'repository.backup')
4072
backup_transport = self.repo_dir.transport.clone('repository.backup')
4073
repo._format.check_conversion_target(self.target_format)
4074
self.source_repo = repo._format.open(self.repo_dir,
4076
_override_transport=backup_transport)
4077
self.step('Creating new repository')
4078
converted = self.target_format.initialize(self.repo_dir,
4079
self.source_repo.is_shared())
4080
converted.lock_write()
4082
self.step('Copying content')
4083
self.source_repo.copy_content_into(converted)
4086
self.step('Deleting old repository content')
4087
self.repo_dir.transport.delete_tree('repository.backup')
4088
ui.ui_factory.note('repository converted')
4090
def step(self, message):
4091
"""Update the pb by a step."""
4093
self.pb.update(message, self.count, self.total)
4105
def _unescaper(match, _map=_unescape_map):
4106
code = match.group(1)
4110
if not code.startswith('#'):
4112
return unichr(int(code[1:])).encode('utf8')
4118
def _unescape_xml(data):
4119
"""Unescape predefined XML entities in a string of data."""
4121
if _unescape_re is None:
4122
_unescape_re = re.compile('\&([^;]*);')
4123
return _unescape_re.sub(_unescaper, data)
4126
class _VersionedFileChecker(object):
4128
def __init__(self, repository, text_key_references=None, ancestors=None):
4129
self.repository = repository
4130
self.text_index = self.repository._generate_text_key_index(
4131
text_key_references=text_key_references, ancestors=ancestors)
4133
def calculate_file_version_parents(self, text_key):
4134
"""Calculate the correct parents for a file version according to
4137
parent_keys = self.text_index[text_key]
4138
if parent_keys == [_mod_revision.NULL_REVISION]:
4140
return tuple(parent_keys)
4142
def check_file_version_parents(self, texts, progress_bar=None):
4143
"""Check the parents stored in a versioned file are correct.
4145
It also detects file versions that are not referenced by their
4146
corresponding revision's inventory.
4148
:returns: A tuple of (wrong_parents, dangling_file_versions).
4149
wrong_parents is a dict mapping {revision_id: (stored_parents,
4150
correct_parents)} for each revision_id where the stored parents
4151
are not correct. dangling_file_versions is a set of (file_id,
4152
revision_id) tuples for versions that are present in this versioned
4153
file, but not used by the corresponding inventory.
4155
local_progress = None
4156
if progress_bar is None:
4157
local_progress = ui.ui_factory.nested_progress_bar()
4158
progress_bar = local_progress
4160
return self._check_file_version_parents(texts, progress_bar)
4163
local_progress.finished()
4165
def _check_file_version_parents(self, texts, progress_bar):
4166
"""See check_file_version_parents."""
4168
self.file_ids = set([file_id for file_id, _ in
4169
self.text_index.iterkeys()])
4170
# text keys is now grouped by file_id
4171
n_versions = len(self.text_index)
4172
progress_bar.update('loading text store', 0, n_versions)
4173
parent_map = self.repository.texts.get_parent_map(self.text_index)
4174
# On unlistable transports this could well be empty/error...
4175
text_keys = self.repository.texts.keys()
4176
unused_keys = frozenset(text_keys) - set(self.text_index)
4177
for num, key in enumerate(self.text_index.iterkeys()):
4178
progress_bar.update('checking text graph', num, n_versions)
4179
correct_parents = self.calculate_file_version_parents(key)
4181
knit_parents = parent_map[key]
4182
except errors.RevisionNotPresent:
4185
if correct_parents != knit_parents:
4186
wrong_parents[key] = (knit_parents, correct_parents)
4187
return wrong_parents, unused_keys
4190
def _old_get_graph(repository, revision_id):
4191
"""DO NOT USE. That is all. I'm serious."""
4192
graph = repository.get_graph()
4193
revision_graph = dict(((key, value) for key, value in
4194
graph.iter_ancestry([revision_id]) if value is not None))
4195
return _strip_NULL_ghosts(revision_graph)
4198
def _strip_NULL_ghosts(revision_graph):
4199
"""Also don't use this. more compatibility code for unmigrated clients."""
4200
# Filter ghosts, and null:
4201
if _mod_revision.NULL_REVISION in revision_graph:
4202
del revision_graph[_mod_revision.NULL_REVISION]
4203
for key, parents in revision_graph.items():
4204
revision_graph[key] = tuple(parent for parent in parents if parent
4206
return revision_graph
4209
class StreamSink(object):
4210
"""An object that can insert a stream into a repository.
4212
This interface handles the complexity of reserialising inventories and
4213
revisions from different formats, and allows unidirectional insertion into
4214
stacked repositories without looking for the missing basis parents
4218
def __init__(self, target_repo):
4219
self.target_repo = target_repo
4221
def insert_stream(self, stream, src_format, resume_tokens):
4222
"""Insert a stream's content into the target repository.
4224
:param src_format: a bzr repository format.
4226
:return: a list of resume tokens and an iterable of keys additional
4227
items required before the insertion can be completed.
4229
self.target_repo.lock_write()
4232
self.target_repo.resume_write_group(resume_tokens)
4235
self.target_repo.start_write_group()
4238
# locked_insert_stream performs a commit|suspend.
4239
return self._locked_insert_stream(stream, src_format, is_resume)
4241
self.target_repo.abort_write_group(suppress_errors=True)
4244
self.target_repo.unlock()
4246
def _locked_insert_stream(self, stream, src_format, is_resume):
4247
to_serializer = self.target_repo._format._serializer
4248
src_serializer = src_format._serializer
4250
if to_serializer == src_serializer:
4251
# If serializers match and the target is a pack repository, set the
4252
# write cache size on the new pack. This avoids poor performance
4253
# on transports where append is unbuffered (such as
4254
# RemoteTransport). This is safe to do because nothing should read
4255
# back from the target repository while a stream with matching
4256
# serialization is being inserted.
4257
# The exception is that a delta record from the source that should
4258
# be a fulltext may need to be expanded by the target (see
4259
# test_fetch_revisions_with_deltas_into_pack); but we take care to
4260
# explicitly flush any buffered writes first in that rare case.
4262
new_pack = self.target_repo._pack_collection._new_pack
4263
except AttributeError:
4264
# Not a pack repository
4267
new_pack.set_write_cache_size(1024*1024)
4268
for substream_type, substream in stream:
4269
if 'stream' in debug.debug_flags:
4270
mutter('inserting substream: %s', substream_type)
4271
if substream_type == 'texts':
4272
self.target_repo.texts.insert_record_stream(substream)
4273
elif substream_type == 'inventories':
4274
if src_serializer == to_serializer:
4275
self.target_repo.inventories.insert_record_stream(
4278
self._extract_and_insert_inventories(
4279
substream, src_serializer)
4280
elif substream_type == 'inventory-deltas':
4281
self._extract_and_insert_inventory_deltas(
4282
substream, src_serializer)
4283
elif substream_type == 'chk_bytes':
4284
# XXX: This doesn't support conversions, as it assumes the
4285
# conversion was done in the fetch code.
4286
self.target_repo.chk_bytes.insert_record_stream(substream)
4287
elif substream_type == 'revisions':
4288
# This may fallback to extract-and-insert more often than
4289
# required if the serializers are different only in terms of
4291
if src_serializer == to_serializer:
4292
self.target_repo.revisions.insert_record_stream(
4295
self._extract_and_insert_revisions(substream,
4297
elif substream_type == 'signatures':
4298
self.target_repo.signatures.insert_record_stream(substream)
4300
raise AssertionError('kaboom! %s' % (substream_type,))
4301
# Done inserting data, and the missing_keys calculations will try to
4302
# read back from the inserted data, so flush the writes to the new pack
4303
# (if this is pack format).
4304
if new_pack is not None:
4305
new_pack._write_data('', flush=True)
4306
# Find all the new revisions (including ones from resume_tokens)
4307
missing_keys = self.target_repo.get_missing_parent_inventories(
4308
check_for_missing_texts=is_resume)
4310
for prefix, versioned_file in (
4311
('texts', self.target_repo.texts),
4312
('inventories', self.target_repo.inventories),
4313
('revisions', self.target_repo.revisions),
4314
('signatures', self.target_repo.signatures),
4315
('chk_bytes', self.target_repo.chk_bytes),
4317
if versioned_file is None:
4319
missing_keys.update((prefix,) + key for key in
4320
versioned_file.get_missing_compression_parent_keys())
4321
except NotImplementedError:
4322
# cannot even attempt suspending, and missing would have failed
4323
# during stream insertion.
4324
missing_keys = set()
4327
# suspend the write group and tell the caller what we is
4328
# missing. We know we can suspend or else we would not have
4329
# entered this code path. (All repositories that can handle
4330
# missing keys can handle suspending a write group).
4331
write_group_tokens = self.target_repo.suspend_write_group()
4332
return write_group_tokens, missing_keys
4333
hint = self.target_repo.commit_write_group()
4334
if (to_serializer != src_serializer and
4335
self.target_repo._format.pack_compresses):
4336
self.target_repo.pack(hint=hint)
4339
def _extract_and_insert_inventory_deltas(self, substream, serializer):
4340
target_rich_root = self.target_repo._format.rich_root_data
4341
target_tree_refs = self.target_repo._format.supports_tree_reference
4342
for record in substream:
4343
# Insert the delta directly
4344
inventory_delta_bytes = record.get_bytes_as('fulltext')
4345
deserialiser = inventory_delta.InventoryDeltaDeserializer()
4347
parse_result = deserialiser.parse_text_bytes(
4348
inventory_delta_bytes)
4349
except inventory_delta.IncompatibleInventoryDelta, err:
4350
trace.mutter("Incompatible delta: %s", err.msg)
4351
raise errors.IncompatibleRevision(self.target_repo._format)
4352
basis_id, new_id, rich_root, tree_refs, inv_delta = parse_result
4353
revision_id = new_id
4354
parents = [key[0] for key in record.parents]
4355
self.target_repo.add_inventory_by_delta(
4356
basis_id, inv_delta, revision_id, parents)
4358
def _extract_and_insert_inventories(self, substream, serializer,
4360
"""Generate a new inventory versionedfile in target, converting data.
4362
The inventory is retrieved from the source, (deserializing it), and
4363
stored in the target (reserializing it in a different format).
4365
target_rich_root = self.target_repo._format.rich_root_data
4366
target_tree_refs = self.target_repo._format.supports_tree_reference
4367
for record in substream:
4368
# It's not a delta, so it must be a fulltext in the source
4369
# serializer's format.
4370
bytes = record.get_bytes_as('fulltext')
4371
revision_id = record.key[0]
4372
inv = serializer.read_inventory_from_string(bytes, revision_id)
4373
parents = [key[0] for key in record.parents]
4374
self.target_repo.add_inventory(revision_id, inv, parents)
4375
# No need to keep holding this full inv in memory when the rest of
4376
# the substream is likely to be all deltas.
4379
def _extract_and_insert_revisions(self, substream, serializer):
4380
for record in substream:
4381
bytes = record.get_bytes_as('fulltext')
4382
revision_id = record.key[0]
4383
rev = serializer.read_revision_from_string(bytes)
4384
if rev.revision_id != revision_id:
4385
raise AssertionError('wtf: %s != %s' % (rev, revision_id))
4386
self.target_repo.add_revision(revision_id, rev)
4389
if self.target_repo._format._fetch_reconcile:
4390
self.target_repo.reconcile()
4393
class StreamSource(object):
4394
"""A source of a stream for fetching between repositories."""
4396
def __init__(self, from_repository, to_format):
4397
"""Create a StreamSource streaming from from_repository."""
4398
self.from_repository = from_repository
4399
self.to_format = to_format
4401
def delta_on_metadata(self):
4402
"""Return True if delta's are permitted on metadata streams.
4404
That is on revisions and signatures.
4406
src_serializer = self.from_repository._format._serializer
4407
target_serializer = self.to_format._serializer
4408
return (self.to_format._fetch_uses_deltas and
4409
src_serializer == target_serializer)
4411
def _fetch_revision_texts(self, revs):
4412
# fetch signatures first and then the revision texts
4413
# may need to be a InterRevisionStore call here.
4414
from_sf = self.from_repository.signatures
4415
# A missing signature is just skipped.
4416
keys = [(rev_id,) for rev_id in revs]
4417
signatures = versionedfile.filter_absent(from_sf.get_record_stream(
4419
self.to_format._fetch_order,
4420
not self.to_format._fetch_uses_deltas))
4421
# If a revision has a delta, this is actually expanded inside the
4422
# insert_record_stream code now, which is an alternate fix for
4424
from_rf = self.from_repository.revisions
4425
revisions = from_rf.get_record_stream(
4427
self.to_format._fetch_order,
4428
not self.delta_on_metadata())
4429
return [('signatures', signatures), ('revisions', revisions)]
4431
def _generate_root_texts(self, revs):
4432
"""This will be called by get_stream between fetching weave texts and
4433
fetching the inventory weave.
4435
if self._rich_root_upgrade():
4437
return bzrlib.fetch.Inter1and2Helper(
4438
self.from_repository).generate_root_texts(revs)
4442
def get_stream(self, search):
4444
revs = search.get_keys()
4445
graph = self.from_repository.get_graph()
4446
revs = tsort.topo_sort(graph.get_parent_map(revs))
4447
data_to_fetch = self.from_repository.item_keys_introduced_by(revs)
4449
for knit_kind, file_id, revisions in data_to_fetch:
4450
if knit_kind != phase:
4452
# Make a new progress bar for this phase
4453
if knit_kind == "file":
4454
# Accumulate file texts
4455
text_keys.extend([(file_id, revision) for revision in
4457
elif knit_kind == "inventory":
4458
# Now copy the file texts.
4459
from_texts = self.from_repository.texts
4460
yield ('texts', from_texts.get_record_stream(
4461
text_keys, self.to_format._fetch_order,
4462
not self.to_format._fetch_uses_deltas))
4463
# Cause an error if a text occurs after we have done the
4466
# Before we process the inventory we generate the root
4467
# texts (if necessary) so that the inventories references
4469
for _ in self._generate_root_texts(revs):
4471
# we fetch only the referenced inventories because we do not
4472
# know for unselected inventories whether all their required
4473
# texts are present in the other repository - it could be
4475
for info in self._get_inventory_stream(revs):
4477
elif knit_kind == "signatures":
4478
# Nothing to do here; this will be taken care of when
4479
# _fetch_revision_texts happens.
4481
elif knit_kind == "revisions":
4482
for record in self._fetch_revision_texts(revs):
4485
raise AssertionError("Unknown knit kind %r" % knit_kind)
4487
def get_stream_for_missing_keys(self, missing_keys):
4488
# missing keys can only occur when we are byte copying and not
4489
# translating (because translation means we don't send
4490
# unreconstructable deltas ever).
4492
keys['texts'] = set()
4493
keys['revisions'] = set()
4494
keys['inventories'] = set()
4495
keys['chk_bytes'] = set()
4496
keys['signatures'] = set()
4497
for key in missing_keys:
4498
keys[key[0]].add(key[1:])
4499
if len(keys['revisions']):
4500
# If we allowed copying revisions at this point, we could end up
4501
# copying a revision without copying its required texts: a
4502
# violation of the requirements for repository integrity.
4503
raise AssertionError(
4504
'cannot copy revisions to fill in missing deltas %s' % (
4505
keys['revisions'],))
4506
for substream_kind, keys in keys.iteritems():
4507
vf = getattr(self.from_repository, substream_kind)
4508
if vf is None and keys:
4509
raise AssertionError(
4510
"cannot fill in keys for a versioned file we don't"
4511
" have: %s needs %s" % (substream_kind, keys))
4513
# No need to stream something we don't have
4515
if substream_kind == 'inventories':
4516
# Some missing keys are genuinely ghosts, filter those out.
4517
present = self.from_repository.inventories.get_parent_map(keys)
4518
revs = [key[0] for key in present]
4519
# Get the inventory stream more-or-less as we do for the
4520
# original stream; there's no reason to assume that records
4521
# direct from the source will be suitable for the sink. (Think
4522
# e.g. 2a -> 1.9-rich-root).
4523
for info in self._get_inventory_stream(revs, missing=True):
4527
# Ask for full texts always so that we don't need more round trips
4528
# after this stream.
4529
# Some of the missing keys are genuinely ghosts, so filter absent
4530
# records. The Sink is responsible for doing another check to
4531
# ensure that ghosts don't introduce missing data for future
4533
stream = versionedfile.filter_absent(vf.get_record_stream(keys,
4534
self.to_format._fetch_order, True))
4535
yield substream_kind, stream
4537
def inventory_fetch_order(self):
4538
if self._rich_root_upgrade():
4539
return 'topological'
4541
return self.to_format._fetch_order
4543
def _rich_root_upgrade(self):
4544
return (not self.from_repository._format.rich_root_data and
4545
self.to_format.rich_root_data)
4547
def _get_inventory_stream(self, revision_ids, missing=False):
4548
from_format = self.from_repository._format
4549
if (from_format.supports_chks and self.to_format.supports_chks and
4550
from_format.network_name() == self.to_format.network_name()):
4551
raise AssertionError(
4552
"this case should be handled by GroupCHKStreamSource")
4553
elif 'forceinvdeltas' in debug.debug_flags:
4554
return self._get_convertable_inventory_stream(revision_ids,
4555
delta_versus_null=missing)
4556
elif from_format.network_name() == self.to_format.network_name():
4558
return self._get_simple_inventory_stream(revision_ids,
4560
elif (not from_format.supports_chks and not self.to_format.supports_chks
4561
and from_format._serializer == self.to_format._serializer):
4562
# Essentially the same format.
4563
return self._get_simple_inventory_stream(revision_ids,
4566
# Any time we switch serializations, we want to use an
4567
# inventory-delta based approach.
4568
return self._get_convertable_inventory_stream(revision_ids,
4569
delta_versus_null=missing)
4571
def _get_simple_inventory_stream(self, revision_ids, missing=False):
4572
# NB: This currently reopens the inventory weave in source;
4573
# using a single stream interface instead would avoid this.
4574
from_weave = self.from_repository.inventories
4576
delta_closure = True
4578
delta_closure = not self.delta_on_metadata()
4579
yield ('inventories', from_weave.get_record_stream(
4580
[(rev_id,) for rev_id in revision_ids],
4581
self.inventory_fetch_order(), delta_closure))
4583
def _get_convertable_inventory_stream(self, revision_ids,
4584
delta_versus_null=False):
4585
# The source is using CHKs, but the target either doesn't or it has a
4586
# different serializer. The StreamSink code expects to be able to
4587
# convert on the target, so we need to put bytes-on-the-wire that can
4588
# be converted. That means inventory deltas (if the remote is <1.19,
4589
# RemoteStreamSink will fallback to VFS to insert the deltas).
4590
yield ('inventory-deltas',
4591
self._stream_invs_as_deltas(revision_ids,
4592
delta_versus_null=delta_versus_null))
4594
def _stream_invs_as_deltas(self, revision_ids, delta_versus_null=False):
4595
"""Return a stream of inventory-deltas for the given rev ids.
4597
:param revision_ids: The list of inventories to transmit
4598
:param delta_versus_null: Don't try to find a minimal delta for this
4599
entry, instead compute the delta versus the NULL_REVISION. This
4600
effectively streams a complete inventory. Used for stuff like
4601
filling in missing parents, etc.
4603
from_repo = self.from_repository
4604
revision_keys = [(rev_id,) for rev_id in revision_ids]
4605
parent_map = from_repo.inventories.get_parent_map(revision_keys)
4606
# XXX: possibly repos could implement a more efficient iter_inv_deltas
4608
inventories = self.from_repository.iter_inventories(
4609
revision_ids, 'topological')
4610
format = from_repo._format
4611
invs_sent_so_far = set([_mod_revision.NULL_REVISION])
4612
inventory_cache = lru_cache.LRUCache(50)
4613
null_inventory = from_repo.revision_tree(
4614
_mod_revision.NULL_REVISION).inventory
4615
# XXX: ideally the rich-root/tree-refs flags would be per-revision, not
4616
# per-repo (e.g. streaming a non-rich-root revision out of a rich-root
4617
# repo back into a non-rich-root repo ought to be allowed)
4618
serializer = inventory_delta.InventoryDeltaSerializer(
4619
versioned_root=format.rich_root_data,
4620
tree_references=format.supports_tree_reference)
4621
for inv in inventories:
4622
key = (inv.revision_id,)
4623
parent_keys = parent_map.get(key, ())
4625
if not delta_versus_null and parent_keys:
4626
# The caller did not ask for complete inventories and we have
4627
# some parents that we can delta against. Make a delta against
4628
# each parent so that we can find the smallest.
4629
parent_ids = [parent_key[0] for parent_key in parent_keys]
4630
for parent_id in parent_ids:
4631
if parent_id not in invs_sent_so_far:
4632
# We don't know that the remote side has this basis, so
4635
if parent_id == _mod_revision.NULL_REVISION:
4636
parent_inv = null_inventory
4638
parent_inv = inventory_cache.get(parent_id, None)
4639
if parent_inv is None:
4640
parent_inv = from_repo.get_inventory(parent_id)
4641
candidate_delta = inv._make_delta(parent_inv)
4642
if (delta is None or
4643
len(delta) > len(candidate_delta)):
4644
delta = candidate_delta
4645
basis_id = parent_id
4647
# Either none of the parents ended up being suitable, or we
4648
# were asked to delta against NULL
4649
basis_id = _mod_revision.NULL_REVISION
4650
delta = inv._make_delta(null_inventory)
4651
invs_sent_so_far.add(inv.revision_id)
4652
inventory_cache[inv.revision_id] = inv
4653
delta_serialized = ''.join(
4654
serializer.delta_to_lines(basis_id, key[-1], delta))
4655
yield versionedfile.FulltextContentFactory(
4656
key, parent_keys, None, delta_serialized)
4659
def _iter_for_revno(repo, partial_history_cache, stop_index=None,
4660
stop_revision=None):
4661
"""Extend the partial history to include a given index
4663
If a stop_index is supplied, stop when that index has been reached.
4664
If a stop_revision is supplied, stop when that revision is
4665
encountered. Otherwise, stop when the beginning of history is
4668
:param stop_index: The index which should be present. When it is
4669
present, history extension will stop.
4670
:param stop_revision: The revision id which should be present. When
4671
it is encountered, history extension will stop.
4673
start_revision = partial_history_cache[-1]
4674
iterator = repo.iter_reverse_revision_history(start_revision)
4676
#skip the last revision in the list
4679
if (stop_index is not None and
4680
len(partial_history_cache) > stop_index):
4682
if partial_history_cache[-1] == stop_revision:
4684
revision_id = iterator.next()
4685
partial_history_cache.append(revision_id)
4686
except StopIteration:
added
removed
bzrlib/repository.py
