13
13
# You should have received a copy of the GNU General Public License
14
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
from cStringIO import StringIO
15
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19
17
from bzrlib.lazy_import import lazy_import
20
18
lazy_import(globals(), """
24
23
from bzrlib import (
38
41
revision as _mod_revision,
48
from bzrlib.bundle import serializer
43
49
from bzrlib.revisiontree import RevisionTree
44
50
from bzrlib.store.versioned import VersionedFileStore
45
from bzrlib.store.text import TextStore
46
51
from bzrlib.testament import Testament
50
from bzrlib.decorators import needs_read_lock, needs_write_lock
59
from bzrlib.decorators import needs_read_lock, needs_write_lock, only_raises
51
60
from bzrlib.inter import InterObject
52
from bzrlib.inventory import Inventory, InventoryDirectory, ROOT_ID
53
from bzrlib.symbol_versioning import (
57
from bzrlib.trace import mutter, note, warning
61
from bzrlib.inventory import (
67
from bzrlib.recordcounter import RecordCounter
68
from bzrlib.lock import _RelockDebugMixin, LogicalLockResult
69
from bzrlib.trace import (
70
log_exception_quietly, note, mutter, mutter_callsite, warning)
60
73
# Old formats display a warning, but only once
61
74
_deprecation_warning_done = False
77
class IsInWriteGroupError(errors.InternalBzrError):
79
_fmt = "May not refresh_data of repo %(repo)s while in a write group."
81
def __init__(self, repo):
82
errors.InternalBzrError.__init__(self, repo=repo)
85
class CommitBuilder(object):
86
"""Provides an interface to build up a commit.
88
This allows describing a tree to be committed without needing to
89
know the internals of the format of the repository.
92
# all clients should supply tree roots.
93
record_root_entry = True
94
# the default CommitBuilder does not manage trees whose root is versioned.
95
_versioned_root = False
97
def __init__(self, repository, parents, config, timestamp=None,
98
timezone=None, committer=None, revprops=None,
100
"""Initiate a CommitBuilder.
102
:param repository: Repository to commit to.
103
:param parents: Revision ids of the parents of the new revision.
104
:param config: Configuration to use.
105
:param timestamp: Optional timestamp recorded for commit.
106
:param timezone: Optional timezone for timestamp.
107
:param committer: Optional committer to set for commit.
108
:param revprops: Optional dictionary of revision properties.
109
:param revision_id: Optional revision id.
111
self._config = config
113
if committer is None:
114
self._committer = self._config.username()
116
self._committer = committer
118
self.new_inventory = Inventory(None)
119
self._new_revision_id = revision_id
120
self.parents = parents
121
self.repository = repository
124
if revprops is not None:
125
self._validate_revprops(revprops)
126
self._revprops.update(revprops)
128
if timestamp is None:
129
timestamp = time.time()
130
# Restrict resolution to 1ms
131
self._timestamp = round(timestamp, 3)
134
self._timezone = osutils.local_time_offset()
136
self._timezone = int(timezone)
138
self._generate_revision_if_needed()
139
self.__heads = graph.HeadsCache(repository.get_graph()).heads
140
self._basis_delta = []
141
# API compatibility, older code that used CommitBuilder did not call
142
# .record_delete(), which means the delta that is computed would not be
143
# valid. Callers that will call record_delete() should call
144
# .will_record_deletes() to indicate that.
145
self._recording_deletes = False
146
# memo'd check for no-op commits.
147
self._any_changes = False
149
def any_changes(self):
150
"""Return True if any entries were changed.
152
This includes merge-only changes. It is the core for the --unchanged
155
:return: True if any changes have occured.
157
return self._any_changes
159
def _validate_unicode_text(self, text, context):
160
"""Verify things like commit messages don't have bogus characters."""
162
raise ValueError('Invalid value for %s: %r' % (context, text))
164
def _validate_revprops(self, revprops):
165
for key, value in revprops.iteritems():
166
# We know that the XML serializers do not round trip '\r'
167
# correctly, so refuse to accept them
168
if not isinstance(value, basestring):
169
raise ValueError('revision property (%s) is not a valid'
170
' (unicode) string: %r' % (key, value))
171
self._validate_unicode_text(value,
172
'revision property (%s)' % (key,))
174
def commit(self, message):
175
"""Make the actual commit.
177
:return: The revision id of the recorded revision.
179
self._validate_unicode_text(message, 'commit message')
180
rev = _mod_revision.Revision(
181
timestamp=self._timestamp,
182
timezone=self._timezone,
183
committer=self._committer,
185
inventory_sha1=self.inv_sha1,
186
revision_id=self._new_revision_id,
187
properties=self._revprops)
188
rev.parent_ids = self.parents
189
self.repository.add_revision(self._new_revision_id, rev,
190
self.new_inventory, self._config)
191
self.repository.commit_write_group()
192
return self._new_revision_id
195
"""Abort the commit that is being built.
197
self.repository.abort_write_group()
199
def revision_tree(self):
200
"""Return the tree that was just committed.
202
After calling commit() this can be called to get a RevisionTree
203
representing the newly committed tree. This is preferred to
204
calling Repository.revision_tree() because that may require
205
deserializing the inventory, while we already have a copy in
208
if self.new_inventory is None:
209
self.new_inventory = self.repository.get_inventory(
210
self._new_revision_id)
211
return RevisionTree(self.repository, self.new_inventory,
212
self._new_revision_id)
214
def finish_inventory(self):
215
"""Tell the builder that the inventory is finished.
217
:return: The inventory id in the repository, which can be used with
218
repository.get_inventory.
220
if self.new_inventory is None:
221
# an inventory delta was accumulated without creating a new
223
basis_id = self.basis_delta_revision
224
# We ignore the 'inventory' returned by add_inventory_by_delta
225
# because self.new_inventory is used to hint to the rest of the
226
# system what code path was taken
227
self.inv_sha1, _ = self.repository.add_inventory_by_delta(
228
basis_id, self._basis_delta, self._new_revision_id,
231
if self.new_inventory.root is None:
232
raise AssertionError('Root entry should be supplied to'
233
' record_entry_contents, as of bzr 0.10.')
234
self.new_inventory.add(InventoryDirectory(ROOT_ID, '', None))
235
self.new_inventory.revision_id = self._new_revision_id
236
self.inv_sha1 = self.repository.add_inventory(
237
self._new_revision_id,
241
return self._new_revision_id
243
def _gen_revision_id(self):
244
"""Return new revision-id."""
245
return generate_ids.gen_revision_id(self._config.username(),
248
def _generate_revision_if_needed(self):
249
"""Create a revision id if None was supplied.
251
If the repository can not support user-specified revision ids
252
they should override this function and raise CannotSetRevisionId
253
if _new_revision_id is not None.
255
:raises: CannotSetRevisionId
257
if self._new_revision_id is None:
258
self._new_revision_id = self._gen_revision_id()
259
self.random_revid = True
261
self.random_revid = False
263
def _heads(self, file_id, revision_ids):
264
"""Calculate the graph heads for revision_ids in the graph of file_id.
266
This can use either a per-file graph or a global revision graph as we
267
have an identity relationship between the two graphs.
269
return self.__heads(revision_ids)
271
def _check_root(self, ie, parent_invs, tree):
272
"""Helper for record_entry_contents.
274
:param ie: An entry being added.
275
:param parent_invs: The inventories of the parent revisions of the
277
:param tree: The tree that is being committed.
279
# In this revision format, root entries have no knit or weave When
280
# serializing out to disk and back in root.revision is always
282
ie.revision = self._new_revision_id
284
def _require_root_change(self, tree):
285
"""Enforce an appropriate root object change.
287
This is called once when record_iter_changes is called, if and only if
288
the root was not in the delta calculated by record_iter_changes.
290
:param tree: The tree which is being committed.
292
if len(self.parents) == 0:
293
raise errors.RootMissing()
294
entry = entry_factory['directory'](tree.path2id(''), '',
296
entry.revision = self._new_revision_id
297
self._basis_delta.append(('', '', entry.file_id, entry))
299
def _get_delta(self, ie, basis_inv, path):
300
"""Get a delta against the basis inventory for ie."""
301
if ie.file_id not in basis_inv:
303
result = (None, path, ie.file_id, ie)
304
self._basis_delta.append(result)
306
elif ie != basis_inv[ie.file_id]:
308
# TODO: avoid tis id2path call.
309
result = (basis_inv.id2path(ie.file_id), path, ie.file_id, ie)
310
self._basis_delta.append(result)
316
def get_basis_delta(self):
317
"""Return the complete inventory delta versus the basis inventory.
319
This has been built up with the calls to record_delete and
320
record_entry_contents. The client must have already called
321
will_record_deletes() to indicate that they will be generating a
324
:return: An inventory delta, suitable for use with apply_delta, or
325
Repository.add_inventory_by_delta, etc.
327
if not self._recording_deletes:
328
raise AssertionError("recording deletes not activated.")
329
return self._basis_delta
331
def record_delete(self, path, file_id):
332
"""Record that a delete occured against a basis tree.
334
This is an optional API - when used it adds items to the basis_delta
335
being accumulated by the commit builder. It cannot be called unless the
336
method will_record_deletes() has been called to inform the builder that
337
a delta is being supplied.
339
:param path: The path of the thing deleted.
340
:param file_id: The file id that was deleted.
342
if not self._recording_deletes:
343
raise AssertionError("recording deletes not activated.")
344
delta = (path, None, file_id, None)
345
self._basis_delta.append(delta)
346
self._any_changes = True
349
def will_record_deletes(self):
350
"""Tell the commit builder that deletes are being notified.
352
This enables the accumulation of an inventory delta; for the resulting
353
commit to be valid, deletes against the basis MUST be recorded via
354
builder.record_delete().
356
self._recording_deletes = True
358
basis_id = self.parents[0]
360
basis_id = _mod_revision.NULL_REVISION
361
self.basis_delta_revision = basis_id
363
def record_entry_contents(self, ie, parent_invs, path, tree,
365
"""Record the content of ie from tree into the commit if needed.
367
Side effect: sets ie.revision when unchanged
369
:param ie: An inventory entry present in the commit.
370
:param parent_invs: The inventories of the parent revisions of the
372
:param path: The path the entry is at in the tree.
373
:param tree: The tree which contains this entry and should be used to
375
:param content_summary: Summary data from the tree about the paths
376
content - stat, length, exec, sha/link target. This is only
377
accessed when the entry has a revision of None - that is when it is
378
a candidate to commit.
379
:return: A tuple (change_delta, version_recorded, fs_hash).
380
change_delta is an inventory_delta change for this entry against
381
the basis tree of the commit, or None if no change occured against
383
version_recorded is True if a new version of the entry has been
384
recorded. For instance, committing a merge where a file was only
385
changed on the other side will return (delta, False).
386
fs_hash is either None, or the hash details for the path (currently
387
a tuple of the contents sha1 and the statvalue returned by
388
tree.get_file_with_stat()).
390
if self.new_inventory.root is None:
391
if ie.parent_id is not None:
392
raise errors.RootMissing()
393
self._check_root(ie, parent_invs, tree)
394
if ie.revision is None:
395
kind = content_summary[0]
397
# ie is carried over from a prior commit
399
# XXX: repository specific check for nested tree support goes here - if
400
# the repo doesn't want nested trees we skip it ?
401
if (kind == 'tree-reference' and
402
not self.repository._format.supports_tree_reference):
403
# mismatch between commit builder logic and repository:
404
# this needs the entry creation pushed down into the builder.
405
raise NotImplementedError('Missing repository subtree support.')
406
self.new_inventory.add(ie)
408
# TODO: slow, take it out of the inner loop.
410
basis_inv = parent_invs[0]
412
basis_inv = Inventory(root_id=None)
414
# ie.revision is always None if the InventoryEntry is considered
415
# for committing. We may record the previous parents revision if the
416
# content is actually unchanged against a sole head.
417
if ie.revision is not None:
418
if not self._versioned_root and path == '':
419
# repositories that do not version the root set the root's
420
# revision to the new commit even when no change occurs (more
421
# specifically, they do not record a revision on the root; and
422
# the rev id is assigned to the root during deserialisation -
423
# this masks when a change may have occurred against the basis.
424
# To match this we always issue a delta, because the revision
425
# of the root will always be changing.
426
if ie.file_id in basis_inv:
427
delta = (basis_inv.id2path(ie.file_id), path,
431
delta = (None, path, ie.file_id, ie)
432
self._basis_delta.append(delta)
433
return delta, False, None
435
# we don't need to commit this, because the caller already
436
# determined that an existing revision of this file is
437
# appropriate. If its not being considered for committing then
438
# it and all its parents to the root must be unaltered so
439
# no-change against the basis.
440
if ie.revision == self._new_revision_id:
441
raise AssertionError("Impossible situation, a skipped "
442
"inventory entry (%r) claims to be modified in this "
443
"commit (%r).", (ie, self._new_revision_id))
444
return None, False, None
445
# XXX: Friction: parent_candidates should return a list not a dict
446
# so that we don't have to walk the inventories again.
447
parent_candiate_entries = ie.parent_candidates(parent_invs)
448
head_set = self._heads(ie.file_id, parent_candiate_entries.keys())
450
for inv in parent_invs:
451
if ie.file_id in inv:
452
old_rev = inv[ie.file_id].revision
453
if old_rev in head_set:
454
heads.append(inv[ie.file_id].revision)
455
head_set.remove(inv[ie.file_id].revision)
458
# now we check to see if we need to write a new record to the
460
# We write a new entry unless there is one head to the ancestors, and
461
# the kind-derived content is unchanged.
463
# Cheapest check first: no ancestors, or more the one head in the
464
# ancestors, we write a new node.
468
# There is a single head, look it up for comparison
469
parent_entry = parent_candiate_entries[heads[0]]
470
# if the non-content specific data has changed, we'll be writing a
472
if (parent_entry.parent_id != ie.parent_id or
473
parent_entry.name != ie.name):
475
# now we need to do content specific checks:
477
# if the kind changed the content obviously has
478
if kind != parent_entry.kind:
480
# Stat cache fingerprint feedback for the caller - None as we usually
481
# don't generate one.
484
if content_summary[2] is None:
485
raise ValueError("Files must not have executable = None")
487
# We can't trust a check of the file length because of content
489
if (# if the exec bit has changed we have to store:
490
parent_entry.executable != content_summary[2]):
492
elif parent_entry.text_sha1 == content_summary[3]:
493
# all meta and content is unchanged (using a hash cache
494
# hit to check the sha)
495
ie.revision = parent_entry.revision
496
ie.text_size = parent_entry.text_size
497
ie.text_sha1 = parent_entry.text_sha1
498
ie.executable = parent_entry.executable
499
return self._get_delta(ie, basis_inv, path), False, None
501
# Either there is only a hash change(no hash cache entry,
502
# or same size content change), or there is no change on
504
# Provide the parent's hash to the store layer, so that the
505
# content is unchanged we will not store a new node.
506
nostore_sha = parent_entry.text_sha1
508
# We want to record a new node regardless of the presence or
509
# absence of a content change in the file.
511
ie.executable = content_summary[2]
512
file_obj, stat_value = tree.get_file_with_stat(ie.file_id, path)
514
text = file_obj.read()
518
ie.text_sha1, ie.text_size = self._add_text_to_weave(
519
ie.file_id, text, heads, nostore_sha)
520
# Let the caller know we generated a stat fingerprint.
521
fingerprint = (ie.text_sha1, stat_value)
522
except errors.ExistingContent:
523
# Turns out that the file content was unchanged, and we were
524
# only going to store a new node if it was changed. Carry over
526
ie.revision = parent_entry.revision
527
ie.text_size = parent_entry.text_size
528
ie.text_sha1 = parent_entry.text_sha1
529
ie.executable = parent_entry.executable
530
return self._get_delta(ie, basis_inv, path), False, None
531
elif kind == 'directory':
533
# all data is meta here, nothing specific to directory, so
535
ie.revision = parent_entry.revision
536
return self._get_delta(ie, basis_inv, path), False, None
537
self._add_text_to_weave(ie.file_id, '', heads, None)
538
elif kind == 'symlink':
539
current_link_target = content_summary[3]
541
# symlink target is not generic metadata, check if it has
543
if current_link_target != parent_entry.symlink_target:
546
# unchanged, carry over.
547
ie.revision = parent_entry.revision
548
ie.symlink_target = parent_entry.symlink_target
549
return self._get_delta(ie, basis_inv, path), False, None
550
ie.symlink_target = current_link_target
551
self._add_text_to_weave(ie.file_id, '', heads, None)
552
elif kind == 'tree-reference':
554
if content_summary[3] != parent_entry.reference_revision:
557
# unchanged, carry over.
558
ie.reference_revision = parent_entry.reference_revision
559
ie.revision = parent_entry.revision
560
return self._get_delta(ie, basis_inv, path), False, None
561
ie.reference_revision = content_summary[3]
562
if ie.reference_revision is None:
563
raise AssertionError("invalid content_summary for nested tree: %r"
564
% (content_summary,))
565
self._add_text_to_weave(ie.file_id, '', heads, None)
567
raise NotImplementedError('unknown kind')
568
ie.revision = self._new_revision_id
569
self._any_changes = True
570
return self._get_delta(ie, basis_inv, path), True, fingerprint
572
def record_iter_changes(self, tree, basis_revision_id, iter_changes,
573
_entry_factory=entry_factory):
574
"""Record a new tree via iter_changes.
576
:param tree: The tree to obtain text contents from for changed objects.
577
:param basis_revision_id: The revision id of the tree the iter_changes
578
has been generated against. Currently assumed to be the same
579
as self.parents[0] - if it is not, errors may occur.
580
:param iter_changes: An iter_changes iterator with the changes to apply
581
to basis_revision_id. The iterator must not include any items with
582
a current kind of None - missing items must be either filtered out
583
or errored-on beefore record_iter_changes sees the item.
584
:param _entry_factory: Private method to bind entry_factory locally for
586
:return: A generator of (file_id, relpath, fs_hash) tuples for use with
589
# Create an inventory delta based on deltas between all the parents and
590
# deltas between all the parent inventories. We use inventory delta's
591
# between the inventory objects because iter_changes masks
592
# last-changed-field only changes.
594
# file_id -> change map, change is fileid, paths, changed, versioneds,
595
# parents, names, kinds, executables
597
# {file_id -> revision_id -> inventory entry, for entries in parent
598
# trees that are not parents[0]
602
revtrees = list(self.repository.revision_trees(self.parents))
603
except errors.NoSuchRevision:
604
# one or more ghosts, slow path.
606
for revision_id in self.parents:
608
revtrees.append(self.repository.revision_tree(revision_id))
609
except errors.NoSuchRevision:
611
basis_revision_id = _mod_revision.NULL_REVISION
613
revtrees.append(self.repository.revision_tree(
614
_mod_revision.NULL_REVISION))
615
# The basis inventory from a repository
617
basis_inv = revtrees[0].inventory
619
basis_inv = self.repository.revision_tree(
620
_mod_revision.NULL_REVISION).inventory
621
if len(self.parents) > 0:
622
if basis_revision_id != self.parents[0] and not ghost_basis:
624
"arbitrary basis parents not yet supported with merges")
625
for revtree in revtrees[1:]:
626
for change in revtree.inventory._make_delta(basis_inv):
627
if change[1] is None:
628
# Not present in this parent.
630
if change[2] not in merged_ids:
631
if change[0] is not None:
632
basis_entry = basis_inv[change[2]]
633
merged_ids[change[2]] = [
635
basis_entry.revision,
638
parent_entries[change[2]] = {
640
basis_entry.revision:basis_entry,
642
change[3].revision:change[3],
645
merged_ids[change[2]] = [change[3].revision]
646
parent_entries[change[2]] = {change[3].revision:change[3]}
648
merged_ids[change[2]].append(change[3].revision)
649
parent_entries[change[2]][change[3].revision] = change[3]
652
# Setup the changes from the tree:
653
# changes maps file_id -> (change, [parent revision_ids])
655
for change in iter_changes:
656
# This probably looks up in basis_inv way to much.
657
if change[1][0] is not None:
658
head_candidate = [basis_inv[change[0]].revision]
661
changes[change[0]] = change, merged_ids.get(change[0],
663
unchanged_merged = set(merged_ids) - set(changes)
664
# Extend the changes dict with synthetic changes to record merges of
666
for file_id in unchanged_merged:
667
# Record a merged version of these items that did not change vs the
668
# basis. This can be either identical parallel changes, or a revert
669
# of a specific file after a merge. The recorded content will be
670
# that of the current tree (which is the same as the basis), but
671
# the per-file graph will reflect a merge.
672
# NB:XXX: We are reconstructing path information we had, this
673
# should be preserved instead.
674
# inv delta change: (file_id, (path_in_source, path_in_target),
675
# changed_content, versioned, parent, name, kind,
678
basis_entry = basis_inv[file_id]
679
except errors.NoSuchId:
680
# a change from basis->some_parents but file_id isn't in basis
681
# so was new in the merge, which means it must have changed
682
# from basis -> current, and as it hasn't the add was reverted
683
# by the user. So we discard this change.
687
(basis_inv.id2path(file_id), tree.id2path(file_id)),
689
(basis_entry.parent_id, basis_entry.parent_id),
690
(basis_entry.name, basis_entry.name),
691
(basis_entry.kind, basis_entry.kind),
692
(basis_entry.executable, basis_entry.executable))
693
changes[file_id] = (change, merged_ids[file_id])
694
# changes contains tuples with the change and a set of inventory
695
# candidates for the file.
697
# old_path, new_path, file_id, new_inventory_entry
698
seen_root = False # Is the root in the basis delta?
699
inv_delta = self._basis_delta
700
modified_rev = self._new_revision_id
701
for change, head_candidates in changes.values():
702
if change[3][1]: # versioned in target.
703
# Several things may be happening here:
704
# We may have a fork in the per-file graph
705
# - record a change with the content from tree
706
# We may have a change against < all trees
707
# - carry over the tree that hasn't changed
708
# We may have a change against all trees
709
# - record the change with the content from tree
712
entry = _entry_factory[kind](file_id, change[5][1],
714
head_set = self._heads(change[0], set(head_candidates))
717
for head_candidate in head_candidates:
718
if head_candidate in head_set:
719
heads.append(head_candidate)
720
head_set.remove(head_candidate)
723
# Could be a carry-over situation:
724
parent_entry_revs = parent_entries.get(file_id, None)
725
if parent_entry_revs:
726
parent_entry = parent_entry_revs.get(heads[0], None)
729
if parent_entry is None:
730
# The parent iter_changes was called against is the one
731
# that is the per-file head, so any change is relevant
732
# iter_changes is valid.
733
carry_over_possible = False
735
# could be a carry over situation
736
# A change against the basis may just indicate a merge,
737
# we need to check the content against the source of the
738
# merge to determine if it was changed after the merge
740
if (parent_entry.kind != entry.kind or
741
parent_entry.parent_id != entry.parent_id or
742
parent_entry.name != entry.name):
743
# Metadata common to all entries has changed
744
# against per-file parent
745
carry_over_possible = False
747
carry_over_possible = True
748
# per-type checks for changes against the parent_entry
751
# Cannot be a carry-over situation
752
carry_over_possible = False
753
# Populate the entry in the delta
755
# XXX: There is still a small race here: If someone reverts the content of a file
756
# after iter_changes examines and decides it has changed,
757
# we will unconditionally record a new version even if some
758
# other process reverts it while commit is running (with
759
# the revert happening after iter_changes did it's
762
entry.executable = True
764
entry.executable = False
765
if (carry_over_possible and
766
parent_entry.executable == entry.executable):
767
# Check the file length, content hash after reading
769
nostore_sha = parent_entry.text_sha1
772
file_obj, stat_value = tree.get_file_with_stat(file_id, change[1][1])
774
text = file_obj.read()
778
entry.text_sha1, entry.text_size = self._add_text_to_weave(
779
file_id, text, heads, nostore_sha)
780
yield file_id, change[1][1], (entry.text_sha1, stat_value)
781
except errors.ExistingContent:
782
# No content change against a carry_over parent
783
# Perhaps this should also yield a fs hash update?
785
entry.text_size = parent_entry.text_size
786
entry.text_sha1 = parent_entry.text_sha1
787
elif kind == 'symlink':
789
entry.symlink_target = tree.get_symlink_target(file_id)
790
if (carry_over_possible and
791
parent_entry.symlink_target == entry.symlink_target):
794
self._add_text_to_weave(change[0], '', heads, None)
795
elif kind == 'directory':
796
if carry_over_possible:
799
# Nothing to set on the entry.
800
# XXX: split into the Root and nonRoot versions.
801
if change[1][1] != '' or self.repository.supports_rich_root():
802
self._add_text_to_weave(change[0], '', heads, None)
803
elif kind == 'tree-reference':
804
if not self.repository._format.supports_tree_reference:
805
# This isn't quite sane as an error, but we shouldn't
806
# ever see this code path in practice: tree's don't
807
# permit references when the repo doesn't support tree
809
raise errors.UnsupportedOperation(tree.add_reference,
811
reference_revision = tree.get_reference_revision(change[0])
812
entry.reference_revision = reference_revision
813
if (carry_over_possible and
814
parent_entry.reference_revision == reference_revision):
817
self._add_text_to_weave(change[0], '', heads, None)
819
raise AssertionError('unknown kind %r' % kind)
821
entry.revision = modified_rev
823
entry.revision = parent_entry.revision
826
new_path = change[1][1]
827
inv_delta.append((change[1][0], new_path, change[0], entry))
830
self.new_inventory = None
832
# This should perhaps be guarded by a check that the basis we
833
# commit against is the basis for the commit and if not do a delta
835
self._any_changes = True
837
# housekeeping root entry changes do not affect no-change commits.
838
self._require_root_change(tree)
839
self.basis_delta_revision = basis_revision_id
841
def _add_text_to_weave(self, file_id, new_text, parents, nostore_sha):
842
parent_keys = tuple([(file_id, parent) for parent in parents])
843
return self.repository.texts._add_text(
844
(file_id, self._new_revision_id), parent_keys, new_text,
845
nostore_sha=nostore_sha, random_id=self.random_revid)[0:2]
848
class RootCommitBuilder(CommitBuilder):
849
"""This commitbuilder actually records the root id"""
851
# the root entry gets versioned properly by this builder.
852
_versioned_root = True
854
def _check_root(self, ie, parent_invs, tree):
855
"""Helper for record_entry_contents.
857
:param ie: An entry being added.
858
:param parent_invs: The inventories of the parent revisions of the
860
:param tree: The tree that is being committed.
863
def _require_root_change(self, tree):
864
"""Enforce an appropriate root object change.
866
This is called once when record_iter_changes is called, if and only if
867
the root was not in the delta calculated by record_iter_changes.
869
:param tree: The tree which is being committed.
871
# versioned roots do not change unless the tree found a change.
874
class RepositoryWriteLockResult(LogicalLockResult):
875
"""The result of write locking a repository.
877
:ivar repository_token: The token obtained from the underlying lock, or
879
:ivar unlock: A callable which will unlock the lock.
882
def __init__(self, unlock, repository_token):
883
LogicalLockResult.__init__(self, unlock)
884
self.repository_token = repository_token
887
return "RepositoryWriteLockResult(%s, %s)" % (self.repository_token,
64
891
######################################################################
67
class Repository(object):
895
class Repository(_RelockDebugMixin, bzrdir.ControlComponent):
68
896
"""Repository holding history for one or more branches.
70
898
The repository holds and retrieves historical information including
71
899
revisions and file history. It's normally accessed only by the Branch,
72
900
which views a particular line of development through that history.
74
The Repository builds on top of Stores and a Transport, which respectively
75
describe the disk data format and the way of accessing the (possibly
902
The Repository builds on top of some byte storage facilies (the revisions,
903
signatures, inventories, texts and chk_bytes attributes) and a Transport,
904
which respectively provide byte storage and a means to access the (possibly
907
The byte storage facilities are addressed via tuples, which we refer to
908
as 'keys' throughout the code base. Revision_keys, inventory_keys and
909
signature_keys are all 1-tuples: (revision_id,). text_keys are two-tuples:
910
(file_id, revision_id). chk_bytes uses CHK keys - a 1-tuple with a single
911
byte string made up of a hash identifier and a hash value.
912
We use this interface because it allows low friction with the underlying
913
code that implements disk indices, network encoding and other parts of
916
:ivar revisions: A bzrlib.versionedfile.VersionedFiles instance containing
917
the serialised revisions for the repository. This can be used to obtain
918
revision graph information or to access raw serialised revisions.
919
The result of trying to insert data into the repository via this store
920
is undefined: it should be considered read-only except for implementors
922
:ivar signatures: A bzrlib.versionedfile.VersionedFiles instance containing
923
the serialised signatures for the repository. This can be used to
924
obtain access to raw serialised signatures. The result of trying to
925
insert data into the repository via this store is undefined: it should
926
be considered read-only except for implementors of repositories.
927
:ivar inventories: A bzrlib.versionedfile.VersionedFiles instance containing
928
the serialised inventories for the repository. This can be used to
929
obtain unserialised inventories. The result of trying to insert data
930
into the repository via this store is undefined: it should be
931
considered read-only except for implementors of repositories.
932
:ivar texts: A bzrlib.versionedfile.VersionedFiles instance containing the
933
texts of files and directories for the repository. This can be used to
934
obtain file texts or file graphs. Note that Repository.iter_file_bytes
935
is usually a better interface for accessing file texts.
936
The result of trying to insert data into the repository via this store
937
is undefined: it should be considered read-only except for implementors
939
:ivar chk_bytes: A bzrlib.versionedfile.VersionedFiles instance containing
940
any data the repository chooses to store or have indexed by its hash.
941
The result of trying to insert data into the repository via this store
942
is undefined: it should be considered read-only except for implementors
944
:ivar _transport: Transport for file access to repository, typically
945
pointing to .bzr/repository.
948
# What class to use for a CommitBuilder. Often its simpler to change this
949
# in a Repository class subclass rather than to override
950
# get_commit_builder.
951
_commit_builder_class = CommitBuilder
952
# The search regex used by xml based repositories to determine what things
953
# where changed in a single commit.
79
954
_file_ids_altered_regex = lazy_regex.lazy_compile(
80
955
r'file_id="(?P<file_id>[^"]+)"'
81
r'.*revision="(?P<revision_id>[^"]+)"'
956
r'.* revision="(?P<revision_id>[^"]+)"'
959
def abort_write_group(self, suppress_errors=False):
960
"""Commit the contents accrued within the current write group.
962
:param suppress_errors: if true, abort_write_group will catch and log
963
unexpected errors that happen during the abort, rather than
964
allowing them to propagate. Defaults to False.
966
:seealso: start_write_group.
968
if self._write_group is not self.get_transaction():
969
# has an unlock or relock occured ?
972
'(suppressed) mismatched lock context and write group. %r, %r',
973
self._write_group, self.get_transaction())
975
raise errors.BzrError(
976
'mismatched lock context and write group. %r, %r' %
977
(self._write_group, self.get_transaction()))
979
self._abort_write_group()
980
except Exception, exc:
981
self._write_group = None
982
if not suppress_errors:
984
mutter('abort_write_group failed')
985
log_exception_quietly()
986
note('bzr: ERROR (ignored): %s', exc)
987
self._write_group = None
989
def _abort_write_group(self):
990
"""Template method for per-repository write group cleanup.
992
This is called during abort before the write group is considered to be
993
finished and should cleanup any internal state accrued during the write
994
group. There is no requirement that data handed to the repository be
995
*not* made available - this is not a rollback - but neither should any
996
attempt be made to ensure that data added is fully commited. Abort is
997
invoked when an error has occured so futher disk or network operations
998
may not be possible or may error and if possible should not be
1002
def add_fallback_repository(self, repository):
1003
"""Add a repository to use for looking up data not held locally.
1005
:param repository: A repository.
1007
if not self._format.supports_external_lookups:
1008
raise errors.UnstackableRepositoryFormat(self._format, self.base)
1009
if self.is_locked():
1010
# This repository will call fallback.unlock() when we transition to
1011
# the unlocked state, so we make sure to increment the lock count
1012
repository.lock_read()
1013
self._check_fallback_repository(repository)
1014
self._fallback_repositories.append(repository)
1015
self.texts.add_fallback_versioned_files(repository.texts)
1016
self.inventories.add_fallback_versioned_files(repository.inventories)
1017
self.revisions.add_fallback_versioned_files(repository.revisions)
1018
self.signatures.add_fallback_versioned_files(repository.signatures)
1019
if self.chk_bytes is not None:
1020
self.chk_bytes.add_fallback_versioned_files(repository.chk_bytes)
1022
def _check_fallback_repository(self, repository):
1023
"""Check that this repository can fallback to repository safely.
1025
Raise an error if not.
1027
:param repository: A repository to fallback to.
1029
return InterRepository._assert_same_model(self, repository)
85
1031
def add_inventory(self, revision_id, inv, parents):
86
1032
"""Add the inventory inv to the repository as revision_id.
88
1034
:param parents: The revision ids of the parents that revision_id
89
1035
is known to have and are in the repository already.
91
returns the sha1 of the serialized inventory.
1037
:returns: The validator(which is a sha1 digest, though what is sha'd is
1038
repository format specific) of the serialized inventory.
93
revision_id = osutils.safe_revision_id(revision_id)
1040
if not self.is_in_write_group():
1041
raise AssertionError("%r not in write group" % (self,))
94
1042
_mod_revision.check_not_reserved_id(revision_id)
95
assert inv.revision_id is None or inv.revision_id == revision_id, \
96
"Mismatch between inventory revision" \
97
" id and insertion revid (%r, %r)" % (inv.revision_id, revision_id)
98
assert inv.root is not None
99
inv_text = self.serialise_inventory(inv)
100
inv_sha1 = osutils.sha_string(inv_text)
101
inv_vf = self.control_weaves.get_weave('inventory',
102
self.get_transaction())
103
self._inventory_add_lines(inv_vf, revision_id, parents,
104
osutils.split_lines(inv_text))
107
def _inventory_add_lines(self, inv_vf, revision_id, parents, lines):
109
for parent in parents:
111
final_parents.append(parent)
113
inv_vf.add_lines(revision_id, final_parents, lines)
1043
if not (inv.revision_id is None or inv.revision_id == revision_id):
1044
raise AssertionError(
1045
"Mismatch between inventory revision"
1046
" id and insertion revid (%r, %r)"
1047
% (inv.revision_id, revision_id))
1048
if inv.root is None:
1049
raise errors.RootMissing()
1050
return self._add_inventory_checked(revision_id, inv, parents)
1052
def _add_inventory_checked(self, revision_id, inv, parents):
1053
"""Add inv to the repository after checking the inputs.
1055
This function can be overridden to allow different inventory styles.
1057
:seealso: add_inventory, for the contract.
1059
inv_lines = self._serializer.write_inventory_to_lines(inv)
1060
return self._inventory_add_lines(revision_id, parents,
1061
inv_lines, check_content=False)
1063
def add_inventory_by_delta(self, basis_revision_id, delta, new_revision_id,
1064
parents, basis_inv=None, propagate_caches=False):
1065
"""Add a new inventory expressed as a delta against another revision.
1067
See the inventory developers documentation for the theory behind
1070
:param basis_revision_id: The inventory id the delta was created
1071
against. (This does not have to be a direct parent.)
1072
:param delta: The inventory delta (see Inventory.apply_delta for
1074
:param new_revision_id: The revision id that the inventory is being
1076
:param parents: The revision ids of the parents that revision_id is
1077
known to have and are in the repository already. These are supplied
1078
for repositories that depend on the inventory graph for revision
1079
graph access, as well as for those that pun ancestry with delta
1081
:param basis_inv: The basis inventory if it is already known,
1083
:param propagate_caches: If True, the caches for this inventory are
1084
copied to and updated for the result if possible.
1086
:returns: (validator, new_inv)
1087
The validator(which is a sha1 digest, though what is sha'd is
1088
repository format specific) of the serialized inventory, and the
1089
resulting inventory.
1091
if not self.is_in_write_group():
1092
raise AssertionError("%r not in write group" % (self,))
1093
_mod_revision.check_not_reserved_id(new_revision_id)
1094
basis_tree = self.revision_tree(basis_revision_id)
1095
basis_tree.lock_read()
1097
# Note that this mutates the inventory of basis_tree, which not all
1098
# inventory implementations may support: A better idiom would be to
1099
# return a new inventory, but as there is no revision tree cache in
1100
# repository this is safe for now - RBC 20081013
1101
if basis_inv is None:
1102
basis_inv = basis_tree.inventory
1103
basis_inv.apply_delta(delta)
1104
basis_inv.revision_id = new_revision_id
1105
return (self.add_inventory(new_revision_id, basis_inv, parents),
1110
def _inventory_add_lines(self, revision_id, parents, lines,
1111
check_content=True):
1112
"""Store lines in inv_vf and return the sha1 of the inventory."""
1113
parents = [(parent,) for parent in parents]
1114
result = self.inventories.add_lines((revision_id,), parents, lines,
1115
check_content=check_content)[0]
1116
self.inventories._access.flush()
116
1119
def add_revision(self, revision_id, rev, inv=None, config=None):
117
1120
"""Add rev to the revision store as revision_id.
188
1191
Returns a set of the present revisions.
191
for id in revision_ids:
192
if self.has_revision(id):
1194
graph = self.get_graph()
1195
parent_map = graph.get_parent_map(revision_ids)
1196
# The old API returned a list, should this actually be a set?
1197
return parent_map.keys()
1199
def _check_inventories(self, checker):
1200
"""Check the inventories found from the revision scan.
1202
This is responsible for verifying the sha1 of inventories and
1203
creating a pending_keys set that covers data referenced by inventories.
1205
bar = ui.ui_factory.nested_progress_bar()
1207
self._do_check_inventories(checker, bar)
1211
def _do_check_inventories(self, checker, bar):
1212
"""Helper for _check_inventories."""
1214
keys = {'chk_bytes':set(), 'inventories':set(), 'texts':set()}
1215
kinds = ['chk_bytes', 'texts']
1216
count = len(checker.pending_keys)
1217
bar.update("inventories", 0, 2)
1218
current_keys = checker.pending_keys
1219
checker.pending_keys = {}
1220
# Accumulate current checks.
1221
for key in current_keys:
1222
if key[0] != 'inventories' and key[0] not in kinds:
1223
checker._report_items.append('unknown key type %r' % (key,))
1224
keys[key[0]].add(key[1:])
1225
if keys['inventories']:
1226
# NB: output order *should* be roughly sorted - topo or
1227
# inverse topo depending on repository - either way decent
1228
# to just delta against. However, pre-CHK formats didn't
1229
# try to optimise inventory layout on disk. As such the
1230
# pre-CHK code path does not use inventory deltas.
1232
for record in self.inventories.check(keys=keys['inventories']):
1233
if record.storage_kind == 'absent':
1234
checker._report_items.append(
1235
'Missing inventory {%s}' % (record.key,))
1237
last_object = self._check_record('inventories', record,
1238
checker, last_object,
1239
current_keys[('inventories',) + record.key])
1240
del keys['inventories']
1243
bar.update("texts", 1)
1244
while (checker.pending_keys or keys['chk_bytes']
1246
# Something to check.
1247
current_keys = checker.pending_keys
1248
checker.pending_keys = {}
1249
# Accumulate current checks.
1250
for key in current_keys:
1251
if key[0] not in kinds:
1252
checker._report_items.append('unknown key type %r' % (key,))
1253
keys[key[0]].add(key[1:])
1254
# Check the outermost kind only - inventories || chk_bytes || texts
1258
for record in getattr(self, kind).check(keys=keys[kind]):
1259
if record.storage_kind == 'absent':
1260
checker._report_items.append(
1261
'Missing %s {%s}' % (kind, record.key,))
1263
last_object = self._check_record(kind, record,
1264
checker, last_object, current_keys[(kind,) + record.key])
1268
def _check_record(self, kind, record, checker, last_object, item_data):
1269
"""Check a single text from this repository."""
1270
if kind == 'inventories':
1271
rev_id = record.key[0]
1272
inv = self._deserialise_inventory(rev_id,
1273
record.get_bytes_as('fulltext'))
1274
if last_object is not None:
1275
delta = inv._make_delta(last_object)
1276
for old_path, path, file_id, ie in delta:
1279
ie.check(checker, rev_id, inv)
1281
for path, ie in inv.iter_entries():
1282
ie.check(checker, rev_id, inv)
1283
if self._format.fast_deltas:
1285
elif kind == 'chk_bytes':
1286
# No code written to check chk_bytes for this repo format.
1287
checker._report_items.append(
1288
'unsupported key type chk_bytes for %s' % (record.key,))
1289
elif kind == 'texts':
1290
self._check_text(record, checker, item_data)
1292
checker._report_items.append(
1293
'unknown key type %s for %s' % (kind, record.key))
1295
def _check_text(self, record, checker, item_data):
1296
"""Check a single text."""
1297
# Check it is extractable.
1298
# TODO: check length.
1299
if record.storage_kind == 'chunked':
1300
chunks = record.get_bytes_as(record.storage_kind)
1301
sha1 = osutils.sha_strings(chunks)
1302
length = sum(map(len, chunks))
1304
content = record.get_bytes_as('fulltext')
1305
sha1 = osutils.sha_string(content)
1306
length = len(content)
1307
if item_data and sha1 != item_data[1]:
1308
checker._report_items.append(
1309
'sha1 mismatch: %s has sha1 %s expected %s referenced by %s' %
1310
(record.key, sha1, item_data[1], item_data[2]))
197
1313
def create(a_bzrdir):
198
1314
"""Construct the current default format repository in a_bzrdir."""
199
1315
return RepositoryFormat.get_default_format().initialize(a_bzrdir)
201
def __init__(self, _format, a_bzrdir, control_files, _revision_store, control_store, text_store):
1317
def __init__(self, _format, a_bzrdir, control_files):
202
1318
"""instantiate a Repository.
204
1320
:param _format: The format of the repository on disk.
205
1321
:param a_bzrdir: The BzrDir of the repository.
207
In the future we will have a single api for all stores for
208
getting file texts, inventories and revisions, then
209
this construct will accept instances of those things.
1323
# In the future we will have a single api for all stores for
1324
# getting file texts, inventories and revisions, then
1325
# this construct will accept instances of those things.
211
1326
super(Repository, self).__init__()
212
1327
self._format = _format
213
1328
# the following are part of the public API for Repository:
214
1329
self.bzrdir = a_bzrdir
215
1330
self.control_files = control_files
216
self._revision_store = _revision_store
217
self.text_store = text_store
218
# backwards compatibility
219
self.weave_store = text_store
220
# not right yet - should be more semantically clear ?
222
self.control_store = control_store
223
self.control_weaves = control_store
224
# TODO: make sure to construct the right store classes, etc, depending
225
# on whether escaping is required.
226
self._warn_if_deprecated()
1331
self._transport = control_files._transport
1332
self.base = self._transport.base
1334
self._reconcile_does_inventory_gc = True
1335
self._reconcile_fixes_text_parents = False
1336
self._reconcile_backsup_inventory = True
1337
self._write_group = None
1338
# Additional places to query for data.
1339
self._fallback_repositories = []
1340
# An InventoryEntry cache, used during deserialization
1341
self._inventory_entry_cache = fifo_cache.FIFOCache(10*1024)
1342
# Is it safe to return inventory entries directly from the entry cache,
1343
# rather copying them?
1344
self._safe_to_return_from_cache = False
1347
def user_transport(self):
1348
return self.bzrdir.user_transport
1351
def control_transport(self):
1352
return self._transport
228
1354
def __repr__(self):
229
return '%s(%r)' % (self.__class__.__name__,
230
self.bzrdir.transport.base)
1355
if self._fallback_repositories:
1356
return '%s(%r, fallback_repositories=%r)' % (
1357
self.__class__.__name__,
1359
self._fallback_repositories)
1361
return '%s(%r)' % (self.__class__.__name__,
1364
def _has_same_fallbacks(self, other_repo):
1365
"""Returns true if the repositories have the same fallbacks."""
1366
my_fb = self._fallback_repositories
1367
other_fb = other_repo._fallback_repositories
1368
if len(my_fb) != len(other_fb):
1370
for f, g in zip(my_fb, other_fb):
1371
if not f.has_same_location(g):
1375
def has_same_location(self, other):
1376
"""Returns a boolean indicating if this repository is at the same
1377
location as another repository.
1379
This might return False even when two repository objects are accessing
1380
the same physical repository via different URLs.
1382
if self.__class__ is not other.__class__:
1384
return (self._transport.base == other._transport.base)
1386
def is_in_write_group(self):
1387
"""Return True if there is an open write group.
1389
:seealso: start_write_group.
1391
return self._write_group is not None
232
1393
def is_locked(self):
233
1394
return self.control_files.is_locked()
1396
def is_write_locked(self):
1397
"""Return True if this object is write locked."""
1398
return self.is_locked() and self.control_files._lock_mode == 'w'
235
1400
def lock_write(self, token=None):
236
1401
"""Lock this repository for writing.
1403
This causes caching within the repository obejct to start accumlating
1404
data during reads, and allows a 'write_group' to be obtained. Write
1405
groups must be used for actual data insertion.
1407
A token should be passed in if you know that you have locked the object
1408
some other way, and need to synchronise this object's state with that
1411
XXX: this docstring is duplicated in many places, e.g. lockable_files.py
238
1413
:param token: if this is already locked, then lock_write will fail
239
1414
unless the token matches the existing lock.
240
1415
:returns: a token if this instance supports tokens, otherwise None.
424
1848
dest_repo = a_bzrdir.open_repository()
425
1849
return dest_repo
1851
def _get_sink(self):
1852
"""Return a sink for streaming into this repository."""
1853
return StreamSink(self)
1855
def _get_source(self, to_format):
1856
"""Return a source for streaming from this repository."""
1857
return StreamSource(self, to_format)
427
1859
@needs_read_lock
428
1860
def has_revision(self, revision_id):
429
1861
"""True if this repository has a copy of the revision."""
430
revision_id = osutils.safe_revision_id(revision_id)
431
return self._revision_store.has_revision_id(revision_id,
432
self.get_transaction())
1862
return revision_id in self.has_revisions((revision_id,))
1865
def has_revisions(self, revision_ids):
1866
"""Probe to find out the presence of multiple revisions.
1868
:param revision_ids: An iterable of revision_ids.
1869
:return: A set of the revision_ids that were present.
1871
parent_map = self.revisions.get_parent_map(
1872
[(rev_id,) for rev_id in revision_ids])
1874
if _mod_revision.NULL_REVISION in revision_ids:
1875
result.add(_mod_revision.NULL_REVISION)
1876
result.update([key[0] for key in parent_map])
1880
def get_revision(self, revision_id):
1881
"""Return the Revision object for a named revision."""
1882
return self.get_revisions([revision_id])[0]
434
1884
@needs_read_lock
435
1885
def get_revision_reconcile(self, revision_id):
436
1886
"""'reconcile' helper routine that allows access to a revision always.
438
1888
This variant of get_revision does not cross check the weave graph
439
1889
against the revision one as get_revision does: but it should only
440
1890
be used by reconcile, or reconcile-alike commands that are correcting
441
1891
or testing the revision graph.
443
if not revision_id or not isinstance(revision_id, basestring):
444
raise errors.InvalidRevisionId(revision_id=revision_id,
446
return self.get_revisions([revision_id])[0]
1893
return self._get_revisions([revision_id])[0]
448
1895
@needs_read_lock
449
1896
def get_revisions(self, revision_ids):
450
revision_ids = [osutils.safe_revision_id(r) for r in revision_ids]
451
revs = self._revision_store.get_revisions(revision_ids,
452
self.get_transaction())
454
assert not isinstance(rev.revision_id, unicode)
455
for parent_id in rev.parent_ids:
456
assert not isinstance(parent_id, unicode)
460
def get_revision_xml(self, revision_id):
461
# TODO: jam 20070210 This shouldn't be necessary since get_revision
462
# would have already do it.
463
# TODO: jam 20070210 Just use _serializer.write_revision_to_string()
464
revision_id = osutils.safe_revision_id(revision_id)
465
rev = self.get_revision(revision_id)
467
# the current serializer..
468
self._revision_store._serializer.write_revision(rev, rev_tmp)
470
return rev_tmp.getvalue()
473
def get_revision(self, revision_id):
474
"""Return the Revision object for a named revision"""
475
# TODO: jam 20070210 get_revision_reconcile should do this for us
476
revision_id = osutils.safe_revision_id(revision_id)
477
r = self.get_revision_reconcile(revision_id)
478
# weave corruption can lead to absent revision markers that should be
480
# the following test is reasonably cheap (it needs a single weave read)
481
# and the weave is cached in read transactions. In write transactions
482
# it is not cached but typically we only read a small number of
483
# revisions. For knits when they are introduced we will probably want
484
# to ensure that caching write transactions are in use.
485
inv = self.get_inventory_weave()
486
self._check_revision_parents(r, inv)
490
def get_deltas_for_revisions(self, revisions):
1897
"""Get many revisions at once.
1899
Repositories that need to check data on every revision read should
1900
subclass this method.
1902
return self._get_revisions(revision_ids)
1905
def _get_revisions(self, revision_ids):
1906
"""Core work logic to get many revisions without sanity checks."""
1908
for revid, rev in self._iter_revisions(revision_ids):
1910
raise errors.NoSuchRevision(self, revid)
1912
return [revs[revid] for revid in revision_ids]
1914
def _iter_revisions(self, revision_ids):
1915
"""Iterate over revision objects.
1917
:param revision_ids: An iterable of revisions to examine. None may be
1918
passed to request all revisions known to the repository. Note that
1919
not all repositories can find unreferenced revisions; for those
1920
repositories only referenced ones will be returned.
1921
:return: An iterator of (revid, revision) tuples. Absent revisions (
1922
those asked for but not available) are returned as (revid, None).
1924
if revision_ids is None:
1925
revision_ids = self.all_revision_ids()
1927
for rev_id in revision_ids:
1928
if not rev_id or not isinstance(rev_id, basestring):
1929
raise errors.InvalidRevisionId(revision_id=rev_id, branch=self)
1930
keys = [(key,) for key in revision_ids]
1931
stream = self.revisions.get_record_stream(keys, 'unordered', True)
1932
for record in stream:
1933
revid = record.key[0]
1934
if record.storage_kind == 'absent':
1937
text = record.get_bytes_as('fulltext')
1938
rev = self._serializer.read_revision_from_string(text)
1941
def get_deltas_for_revisions(self, revisions, specific_fileids=None):
491
1942
"""Produce a generator of revision deltas.
493
1944
Note that the input is a sequence of REVISIONS, not revision_ids.
494
1945
Trees will be held in memory until the generator exits.
495
1946
Each delta is relative to the revision's lefthand predecessor.
1948
:param specific_fileids: if not None, the result is filtered
1949
so that only those file-ids, their parents and their
1950
children are included.
1952
# Get the revision-ids of interest
497
1953
required_trees = set()
498
1954
for revision in revisions:
499
1955
required_trees.add(revision.revision_id)
500
1956
required_trees.update(revision.parent_ids[:1])
501
trees = dict((t.get_revision_id(), t) for
502
t in self.revision_trees(required_trees))
1958
# Get the matching filtered trees. Note that it's more
1959
# efficient to pass filtered trees to changes_from() rather
1960
# than doing the filtering afterwards. changes_from() could
1961
# arguably do the filtering itself but it's path-based, not
1962
# file-id based, so filtering before or afterwards is
1964
if specific_fileids is None:
1965
trees = dict((t.get_revision_id(), t) for
1966
t in self.revision_trees(required_trees))
1968
trees = dict((t.get_revision_id(), t) for
1969
t in self._filtered_revision_trees(required_trees,
1972
# Calculate the deltas
503
1973
for revision in revisions:
504
1974
if not revision.parent_ids:
505
old_tree = self.revision_tree(None)
1975
old_tree = self.revision_tree(_mod_revision.NULL_REVISION)
507
1977
old_tree = trees[revision.parent_ids[0]]
508
1978
yield trees[revision.revision_id].changes_from(old_tree)
510
1980
@needs_read_lock
511
def get_revision_delta(self, revision_id):
1981
def get_revision_delta(self, revision_id, specific_fileids=None):
512
1982
"""Return the delta for one revision.
514
1984
The delta is relative to the left-hand predecessor of the
1987
:param specific_fileids: if not None, the result is filtered
1988
so that only those file-ids, their parents and their
1989
children are included.
517
1991
r = self.get_revision(revision_id)
518
return list(self.get_deltas_for_revisions([r]))[0]
520
def _check_revision_parents(self, revision, inventory):
521
"""Private to Repository and Fetch.
523
This checks the parentage of revision in an inventory weave for
524
consistency and is only applicable to inventory-weave-for-ancestry
525
using repository formats & fetchers.
527
weave_parents = inventory.get_parents(revision.revision_id)
528
weave_names = inventory.versions()
529
for parent_id in revision.parent_ids:
530
if parent_id in weave_names:
531
# this parent must not be a ghost.
532
if not parent_id in weave_parents:
534
raise errors.CorruptRepository(self)
1992
return list(self.get_deltas_for_revisions([r],
1993
specific_fileids=specific_fileids))[0]
536
1995
@needs_write_lock
537
1996
def store_revision_signature(self, gpg_strategy, plaintext, revision_id):
538
revision_id = osutils.safe_revision_id(revision_id)
539
1997
signature = gpg_strategy.sign(plaintext)
540
self._revision_store.add_revision_signature_text(revision_id,
542
self.get_transaction())
544
def fileids_altered_by_revision_ids(self, revision_ids):
545
"""Find the file ids and versions affected by revisions.
547
:param revisions: an iterable containing revision ids.
548
:return: a dictionary mapping altered file-ids to an iterable of
549
revision_ids. Each altered file-ids has the exact revision_ids that
550
altered it listed explicitly.
552
assert self._serializer.support_altered_by_hack, \
553
("fileids_altered_by_revision_ids only supported for branches "
554
"which store inventory as unnested xml, not on %r" % self)
555
selected_revision_ids = set(osutils.safe_revision_id(r)
556
for r in revision_ids)
557
w = self.get_inventory_weave()
1998
self.add_signature_text(revision_id, signature)
2001
def add_signature_text(self, revision_id, signature):
2002
self.signatures.add_lines((revision_id,), (),
2003
osutils.split_lines(signature))
2005
def find_text_key_references(self):
2006
"""Find the text key references within the repository.
2008
:return: A dictionary mapping text keys ((fileid, revision_id) tuples)
2009
to whether they were referred to by the inventory of the
2010
revision_id that they contain. The inventory texts from all present
2011
revision ids are assessed to generate this report.
2013
revision_keys = self.revisions.keys()
2014
w = self.inventories
2015
pb = ui.ui_factory.nested_progress_bar()
2017
return self._find_text_key_references_from_xml_inventory_lines(
2018
w.iter_lines_added_or_present_in_keys(revision_keys, pb=pb))
2022
def _find_text_key_references_from_xml_inventory_lines(self,
2024
"""Core routine for extracting references to texts from inventories.
2026
This performs the translation of xml lines to revision ids.
2028
:param line_iterator: An iterator of lines, origin_version_id
2029
:return: A dictionary mapping text keys ((fileid, revision_id) tuples)
2030
to whether they were referred to by the inventory of the
2031
revision_id that they contain. Note that if that revision_id was
2032
not part of the line_iterator's output then False will be given -
2033
even though it may actually refer to that key.
2035
if not self._serializer.support_altered_by_hack:
2036
raise AssertionError(
2037
"_find_text_key_references_from_xml_inventory_lines only "
2038
"supported for branches which store inventory as unnested xml"
2039
", not on %r" % self)
560
2042
# this code needs to read every new line in every inventory for the
561
2043
# inventories [revision_ids]. Seeing a line twice is ok. Seeing a line
562
# not present in one of those inventories is unnecessary but not
2044
# not present in one of those inventories is unnecessary but not
563
2045
# harmful because we are filtering by the revision id marker in the
564
# inventory lines : we only select file ids altered in one of those
2046
# inventory lines : we only select file ids altered in one of those
565
2047
# revisions. We don't need to see all lines in the inventory because
566
2048
# only those added in an inventory in rev X can contain a revision=X
576
2058
search = self._file_ids_altered_regex.search
577
2059
unescape = _unescape_xml
578
2060
setdefault = result.setdefault
2061
for line, line_key in line_iterator:
2062
match = search(line)
2065
# One call to match.group() returning multiple items is quite a
2066
# bit faster than 2 calls to match.group() each returning 1
2067
file_id, revision_id = match.group('file_id', 'revision_id')
2069
# Inlining the cache lookups helps a lot when you make 170,000
2070
# lines and 350k ids, versus 8.4 unique ids.
2071
# Using a cache helps in 2 ways:
2072
# 1) Avoids unnecessary decoding calls
2073
# 2) Re-uses cached strings, which helps in future set and
2075
# (2) is enough that removing encoding entirely along with
2076
# the cache (so we are using plain strings) results in no
2077
# performance improvement.
2079
revision_id = unescape_revid_cache[revision_id]
2081
unescaped = unescape(revision_id)
2082
unescape_revid_cache[revision_id] = unescaped
2083
revision_id = unescaped
2085
# Note that unconditionally unescaping means that we deserialise
2086
# every fileid, which for general 'pull' is not great, but we don't
2087
# really want to have some many fulltexts that this matters anyway.
2090
file_id = unescape_fileid_cache[file_id]
2092
unescaped = unescape(file_id)
2093
unescape_fileid_cache[file_id] = unescaped
2096
key = (file_id, revision_id)
2097
setdefault(key, False)
2098
if revision_id == line_key[-1]:
2102
def _inventory_xml_lines_for_keys(self, keys):
2103
"""Get a line iterator of the sort needed for findind references.
2105
Not relevant for non-xml inventory repositories.
2107
Ghosts in revision_keys are ignored.
2109
:param revision_keys: The revision keys for the inventories to inspect.
2110
:return: An iterator over (inventory line, revid) for the fulltexts of
2111
all of the xml inventories specified by revision_keys.
2113
stream = self.inventories.get_record_stream(keys, 'unordered', True)
2114
for record in stream:
2115
if record.storage_kind != 'absent':
2116
chunks = record.get_bytes_as('chunked')
2117
revid = record.key[-1]
2118
lines = osutils.chunks_to_lines(chunks)
2122
def _find_file_ids_from_xml_inventory_lines(self, line_iterator,
2124
"""Helper routine for fileids_altered_by_revision_ids.
2126
This performs the translation of xml lines to revision ids.
2128
:param line_iterator: An iterator of lines, origin_version_id
2129
:param revision_keys: The revision ids to filter for. This should be a
2130
set or other type which supports efficient __contains__ lookups, as
2131
the revision key from each parsed line will be looked up in the
2132
revision_keys filter.
2133
:return: a dictionary mapping altered file-ids to an iterable of
2134
revision_ids. Each altered file-ids has the exact revision_ids that
2135
altered it listed explicitly.
2137
seen = set(self._find_text_key_references_from_xml_inventory_lines(
2138
line_iterator).iterkeys())
2139
parent_keys = self._find_parent_keys_of_revisions(revision_keys)
2140
parent_seen = set(self._find_text_key_references_from_xml_inventory_lines(
2141
self._inventory_xml_lines_for_keys(parent_keys)))
2142
new_keys = seen - parent_seen
2144
setdefault = result.setdefault
2145
for key in new_keys:
2146
setdefault(key[0], set()).add(key[-1])
2149
def _find_parent_ids_of_revisions(self, revision_ids):
2150
"""Find all parent ids that are mentioned in the revision graph.
2152
:return: set of revisions that are parents of revision_ids which are
2153
not part of revision_ids themselves
2155
parent_map = self.get_parent_map(revision_ids)
2157
map(parent_ids.update, parent_map.itervalues())
2158
parent_ids.difference_update(revision_ids)
2159
parent_ids.discard(_mod_revision.NULL_REVISION)
2162
def _find_parent_keys_of_revisions(self, revision_keys):
2163
"""Similar to _find_parent_ids_of_revisions, but used with keys.
2165
:param revision_keys: An iterable of revision_keys.
2166
:return: The parents of all revision_keys that are not already in
2169
parent_map = self.revisions.get_parent_map(revision_keys)
2171
map(parent_keys.update, parent_map.itervalues())
2172
parent_keys.difference_update(revision_keys)
2173
parent_keys.discard(_mod_revision.NULL_REVISION)
2176
def fileids_altered_by_revision_ids(self, revision_ids, _inv_weave=None):
2177
"""Find the file ids and versions affected by revisions.
2179
:param revisions: an iterable containing revision ids.
2180
:param _inv_weave: The inventory weave from this repository or None.
2181
If None, the inventory weave will be opened automatically.
2182
:return: a dictionary mapping altered file-ids to an iterable of
2183
revision_ids. Each altered file-ids has the exact revision_ids that
2184
altered it listed explicitly.
2186
selected_keys = set((revid,) for revid in revision_ids)
2187
w = _inv_weave or self.inventories
2188
return self._find_file_ids_from_xml_inventory_lines(
2189
w.iter_lines_added_or_present_in_keys(
2190
selected_keys, pb=None),
2193
def iter_files_bytes(self, desired_files):
2194
"""Iterate through file versions.
2196
Files will not necessarily be returned in the order they occur in
2197
desired_files. No specific order is guaranteed.
2199
Yields pairs of identifier, bytes_iterator. identifier is an opaque
2200
value supplied by the caller as part of desired_files. It should
2201
uniquely identify the file version in the caller's context. (Examples:
2202
an index number or a TreeTransform trans_id.)
2204
bytes_iterator is an iterable of bytestrings for the file. The
2205
kind of iterable and length of the bytestrings are unspecified, but for
2206
this implementation, it is a list of bytes produced by
2207
VersionedFile.get_record_stream().
2209
:param desired_files: a list of (file_id, revision_id, identifier)
2213
for file_id, revision_id, callable_data in desired_files:
2214
text_keys[(file_id, revision_id)] = callable_data
2215
for record in self.texts.get_record_stream(text_keys, 'unordered', True):
2216
if record.storage_kind == 'absent':
2217
raise errors.RevisionNotPresent(record.key, self)
2218
yield text_keys[record.key], record.get_bytes_as('chunked')
2220
def _generate_text_key_index(self, text_key_references=None,
2222
"""Generate a new text key index for the repository.
2224
This is an expensive function that will take considerable time to run.
2226
:return: A dict mapping text keys ((file_id, revision_id) tuples) to a
2227
list of parents, also text keys. When a given key has no parents,
2228
the parents list will be [NULL_REVISION].
2230
# All revisions, to find inventory parents.
2231
if ancestors is None:
2232
graph = self.get_graph()
2233
ancestors = graph.get_parent_map(self.all_revision_ids())
2234
if text_key_references is None:
2235
text_key_references = self.find_text_key_references()
579
2236
pb = ui.ui_factory.nested_progress_bar()
581
for line in w.iter_lines_added_or_present_in_versions(
582
selected_revision_ids, pb=pb):
586
# One call to match.group() returning multiple items is quite a
587
# bit faster than 2 calls to match.group() each returning 1
588
file_id, revision_id = match.group('file_id', 'revision_id')
590
# Inlining the cache lookups helps a lot when you make 170,000
591
# lines and 350k ids, versus 8.4 unique ids.
592
# Using a cache helps in 2 ways:
593
# 1) Avoids unnecessary decoding calls
594
# 2) Re-uses cached strings, which helps in future set and
596
# (2) is enough that removing encoding entirely along with
597
# the cache (so we are using plain strings) results in no
598
# performance improvement.
600
revision_id = unescape_revid_cache[revision_id]
602
unescaped = unescape(revision_id)
603
unescape_revid_cache[revision_id] = unescaped
604
revision_id = unescaped
606
if revision_id in selected_revision_ids:
608
file_id = unescape_fileid_cache[file_id]
610
unescaped = unescape(file_id)
611
unescape_fileid_cache[file_id] = unescaped
613
setdefault(file_id, set()).add(revision_id)
2238
return self._do_generate_text_key_index(ancestors,
2239
text_key_references, pb)
619
def get_inventory_weave(self):
620
return self.control_weaves.get_weave('inventory',
621
self.get_transaction())
2243
def _do_generate_text_key_index(self, ancestors, text_key_references, pb):
2244
"""Helper for _generate_text_key_index to avoid deep nesting."""
2245
revision_order = tsort.topo_sort(ancestors)
2246
invalid_keys = set()
2248
for revision_id in revision_order:
2249
revision_keys[revision_id] = set()
2250
text_count = len(text_key_references)
2251
# a cache of the text keys to allow reuse; costs a dict of all the
2252
# keys, but saves a 2-tuple for every child of a given key.
2254
for text_key, valid in text_key_references.iteritems():
2256
invalid_keys.add(text_key)
2258
revision_keys[text_key[1]].add(text_key)
2259
text_key_cache[text_key] = text_key
2260
del text_key_references
2262
text_graph = graph.Graph(graph.DictParentsProvider(text_index))
2263
NULL_REVISION = _mod_revision.NULL_REVISION
2264
# Set a cache with a size of 10 - this suffices for bzr.dev but may be
2265
# too small for large or very branchy trees. However, for 55K path
2266
# trees, it would be easy to use too much memory trivially. Ideally we
2267
# could gauge this by looking at available real memory etc, but this is
2268
# always a tricky proposition.
2269
inventory_cache = lru_cache.LRUCache(10)
2270
batch_size = 10 # should be ~150MB on a 55K path tree
2271
batch_count = len(revision_order) / batch_size + 1
2273
pb.update("Calculating text parents", processed_texts, text_count)
2274
for offset in xrange(batch_count):
2275
to_query = revision_order[offset * batch_size:(offset + 1) *
2279
for revision_id in to_query:
2280
parent_ids = ancestors[revision_id]
2281
for text_key in revision_keys[revision_id]:
2282
pb.update("Calculating text parents", processed_texts)
2283
processed_texts += 1
2284
candidate_parents = []
2285
for parent_id in parent_ids:
2286
parent_text_key = (text_key[0], parent_id)
2288
check_parent = parent_text_key not in \
2289
revision_keys[parent_id]
2291
# the parent parent_id is a ghost:
2292
check_parent = False
2293
# truncate the derived graph against this ghost.
2294
parent_text_key = None
2296
# look at the parent commit details inventories to
2297
# determine possible candidates in the per file graph.
2300
inv = inventory_cache[parent_id]
2302
inv = self.revision_tree(parent_id).inventory
2303
inventory_cache[parent_id] = inv
2305
parent_entry = inv[text_key[0]]
2306
except (KeyError, errors.NoSuchId):
2308
if parent_entry is not None:
2310
text_key[0], parent_entry.revision)
2312
parent_text_key = None
2313
if parent_text_key is not None:
2314
candidate_parents.append(
2315
text_key_cache[parent_text_key])
2316
parent_heads = text_graph.heads(candidate_parents)
2317
new_parents = list(parent_heads)
2318
new_parents.sort(key=lambda x:candidate_parents.index(x))
2319
if new_parents == []:
2320
new_parents = [NULL_REVISION]
2321
text_index[text_key] = new_parents
2323
for text_key in invalid_keys:
2324
text_index[text_key] = [NULL_REVISION]
2327
def item_keys_introduced_by(self, revision_ids, _files_pb=None):
2328
"""Get an iterable listing the keys of all the data introduced by a set
2331
The keys will be ordered so that the corresponding items can be safely
2332
fetched and inserted in that order.
2334
:returns: An iterable producing tuples of (knit-kind, file-id,
2335
versions). knit-kind is one of 'file', 'inventory', 'signatures',
2336
'revisions'. file-id is None unless knit-kind is 'file'.
2338
for result in self._find_file_keys_to_fetch(revision_ids, _files_pb):
2341
for result in self._find_non_file_keys_to_fetch(revision_ids):
2344
def _find_file_keys_to_fetch(self, revision_ids, pb):
2345
# XXX: it's a bit weird to control the inventory weave caching in this
2346
# generator. Ideally the caching would be done in fetch.py I think. Or
2347
# maybe this generator should explicitly have the contract that it
2348
# should not be iterated until the previously yielded item has been
2350
inv_w = self.inventories
2352
# file ids that changed
2353
file_ids = self.fileids_altered_by_revision_ids(revision_ids, inv_w)
2355
num_file_ids = len(file_ids)
2356
for file_id, altered_versions in file_ids.iteritems():
2358
pb.update("Fetch texts", count, num_file_ids)
2360
yield ("file", file_id, altered_versions)
2362
def _find_non_file_keys_to_fetch(self, revision_ids):
2364
yield ("inventory", None, revision_ids)
2367
# XXX: Note ATM no callers actually pay attention to this return
2368
# instead they just use the list of revision ids and ignore
2369
# missing sigs. Consider removing this work entirely
2370
revisions_with_signatures = set(self.signatures.get_parent_map(
2371
[(r,) for r in revision_ids]))
2372
revisions_with_signatures = set(
2373
[r for (r,) in revisions_with_signatures])
2374
revisions_with_signatures.intersection_update(revision_ids)
2375
yield ("signatures", None, revisions_with_signatures)
2378
yield ("revisions", None, revision_ids)
623
2380
@needs_read_lock
624
2381
def get_inventory(self, revision_id):
625
"""Get Inventory object by hash."""
626
# TODO: jam 20070210 Technically we don't need to sanitize, since all
627
# called functions must sanitize.
628
revision_id = osutils.safe_revision_id(revision_id)
629
return self.deserialise_inventory(
630
revision_id, self.get_inventory_xml(revision_id))
632
def deserialise_inventory(self, revision_id, xml):
633
"""Transform the xml into an inventory object.
2382
"""Get Inventory object by revision id."""
2383
return self.iter_inventories([revision_id]).next()
2385
def iter_inventories(self, revision_ids, ordering=None):
2386
"""Get many inventories by revision_ids.
2388
This will buffer some or all of the texts used in constructing the
2389
inventories in memory, but will only parse a single inventory at a
2392
:param revision_ids: The expected revision ids of the inventories.
2393
:param ordering: optional ordering, e.g. 'topological'. If not
2394
specified, the order of revision_ids will be preserved (by
2395
buffering if necessary).
2396
:return: An iterator of inventories.
2398
if ((None in revision_ids)
2399
or (_mod_revision.NULL_REVISION in revision_ids)):
2400
raise ValueError('cannot get null revision inventory')
2401
return self._iter_inventories(revision_ids, ordering)
2403
def _iter_inventories(self, revision_ids, ordering):
2404
"""single-document based inventory iteration."""
2405
inv_xmls = self._iter_inventory_xmls(revision_ids, ordering)
2406
for text, revision_id in inv_xmls:
2407
yield self._deserialise_inventory(revision_id, text)
2409
def _iter_inventory_xmls(self, revision_ids, ordering):
2410
if ordering is None:
2411
order_as_requested = True
2412
ordering = 'unordered'
2414
order_as_requested = False
2415
keys = [(revision_id,) for revision_id in revision_ids]
2418
if order_as_requested:
2419
key_iter = iter(keys)
2420
next_key = key_iter.next()
2421
stream = self.inventories.get_record_stream(keys, ordering, True)
2423
for record in stream:
2424
if record.storage_kind != 'absent':
2425
chunks = record.get_bytes_as('chunked')
2426
if order_as_requested:
2427
text_chunks[record.key] = chunks
2429
yield ''.join(chunks), record.key[-1]
2431
raise errors.NoSuchRevision(self, record.key)
2432
if order_as_requested:
2433
# Yield as many results as we can while preserving order.
2434
while next_key in text_chunks:
2435
chunks = text_chunks.pop(next_key)
2436
yield ''.join(chunks), next_key[-1]
2438
next_key = key_iter.next()
2439
except StopIteration:
2440
# We still want to fully consume the get_record_stream,
2441
# just in case it is not actually finished at this point
2445
def _deserialise_inventory(self, revision_id, xml):
2446
"""Transform the xml into an inventory object.
635
2448
:param revision_id: The expected revision id of the inventory.
636
2449
:param xml: A serialised inventory.
638
revision_id = osutils.safe_revision_id(revision_id)
639
result = self._serializer.read_inventory_from_string(xml)
640
result.root.revision = revision_id
2451
result = self._serializer.read_inventory_from_string(xml, revision_id,
2452
entry_cache=self._inventory_entry_cache,
2453
return_from_cache=self._safe_to_return_from_cache)
2454
if result.revision_id != revision_id:
2455
raise AssertionError('revision id mismatch %s != %s' % (
2456
result.revision_id, revision_id))
643
def serialise_inventory(self, inv):
644
return self._serializer.write_inventory_to_string(inv)
2459
def get_serializer_format(self):
2460
return self._serializer.format_num
646
2462
@needs_read_lock
647
def get_inventory_xml(self, revision_id):
648
"""Get inventory XML as a file object."""
649
revision_id = osutils.safe_revision_id(revision_id)
2463
def _get_inventory_xml(self, revision_id):
2464
"""Get serialized inventory as a string."""
2465
texts = self._iter_inventory_xmls([revision_id], 'unordered')
651
assert isinstance(revision_id, str), type(revision_id)
652
iw = self.get_inventory_weave()
653
return iw.get_text(revision_id)
2467
text, revision_id = texts.next()
2468
except StopIteration:
655
2469
raise errors.HistoryMissing(self, 'inventory', revision_id)
658
def get_inventory_sha1(self, revision_id):
659
"""Return the sha1 hash of the inventory entry
661
# TODO: jam 20070210 Shouldn't this be deprecated / removed?
662
revision_id = osutils.safe_revision_id(revision_id)
663
return self.get_revision(revision_id).inventory_sha1
666
def get_revision_graph(self, revision_id=None):
667
"""Return a dictionary containing the revision graph.
669
:param revision_id: The revision_id to get a graph from. If None, then
670
the entire revision graph is returned. This is a deprecated mode of
671
operation and will be removed in the future.
672
:return: a dictionary of revision_id->revision_parents_list.
674
# special case NULL_REVISION
675
if revision_id == _mod_revision.NULL_REVISION:
677
revision_id = osutils.safe_revision_id(revision_id)
678
a_weave = self.get_inventory_weave()
679
all_revisions = self._eliminate_revisions_not_present(
681
entire_graph = dict([(node, a_weave.get_parents(node)) for
682
node in all_revisions])
683
if revision_id is None:
685
elif revision_id not in entire_graph:
686
raise errors.NoSuchRevision(self, revision_id)
688
# add what can be reached from revision_id
690
pending = set([revision_id])
691
while len(pending) > 0:
693
result[node] = entire_graph[node]
694
for revision_id in result[node]:
695
if revision_id not in result:
696
pending.add(revision_id)
700
def get_revision_graph_with_ghosts(self, revision_ids=None):
701
"""Return a graph of the revisions with ghosts marked as applicable.
703
:param revision_ids: an iterable of revisions to graph or None for all.
704
:return: a Graph object with the graph reachable from revision_ids.
706
result = deprecated_graph.Graph()
708
pending = set(self.all_revision_ids())
711
pending = set(osutils.safe_revision_id(r) for r in revision_ids)
712
# special case NULL_REVISION
713
if _mod_revision.NULL_REVISION in pending:
714
pending.remove(_mod_revision.NULL_REVISION)
715
required = set(pending)
718
revision_id = pending.pop()
720
rev = self.get_revision(revision_id)
721
except errors.NoSuchRevision:
722
if revision_id in required:
725
result.add_ghost(revision_id)
727
for parent_id in rev.parent_ids:
728
# is this queued or done ?
729
if (parent_id not in pending and
730
parent_id not in done):
732
pending.add(parent_id)
733
result.add_node(revision_id, rev.parent_ids)
734
done.add(revision_id)
737
def _get_history_vf(self):
738
"""Get a versionedfile whose history graph reflects all revisions.
740
For weave repositories, this is the inventory weave.
742
return self.get_inventory_weave()
2472
def get_rev_id_for_revno(self, revno, known_pair):
2473
"""Return the revision id of a revno, given a later (revno, revid)
2474
pair in the same history.
2476
:return: if found (True, revid). If the available history ran out
2477
before reaching the revno, then this returns
2478
(False, (closest_revno, closest_revid)).
2480
known_revno, known_revid = known_pair
2481
partial_history = [known_revid]
2482
distance_from_known = known_revno - revno
2483
if distance_from_known < 0:
2485
'requested revno (%d) is later than given known revno (%d)'
2486
% (revno, known_revno))
2489
self, partial_history, stop_index=distance_from_known)
2490
except errors.RevisionNotPresent, err:
2491
if err.revision_id == known_revid:
2492
# The start revision (known_revid) wasn't found.
2494
# This is a stacked repository with no fallbacks, or a there's a
2495
# left-hand ghost. Either way, even though the revision named in
2496
# the error isn't in this repo, we know it's the next step in this
2497
# left-hand history.
2498
partial_history.append(err.revision_id)
2499
if len(partial_history) <= distance_from_known:
2500
# Didn't find enough history to get a revid for the revno.
2501
earliest_revno = known_revno - len(partial_history) + 1
2502
return (False, (earliest_revno, partial_history[-1]))
2503
if len(partial_history) - 1 > distance_from_known:
2504
raise AssertionError('_iter_for_revno returned too much history')
2505
return (True, partial_history[-1])
744
2507
def iter_reverse_revision_history(self, revision_id):
745
2508
"""Iterate backwards through revision ids in the lefthand history
789
2537
reconciler.reconcile()
790
2538
return reconciler
2540
def _refresh_data(self):
2541
"""Helper called from lock_* to ensure coherency with disk.
2543
The default implementation does nothing; it is however possible
2544
for repositories to maintain loaded indices across multiple locks
2545
by checking inside their implementation of this method to see
2546
whether their indices are still valid. This depends of course on
2547
the disk format being validatable in this manner. This method is
2548
also called by the refresh_data() public interface to cause a refresh
2549
to occur while in a write lock so that data inserted by a smart server
2550
push operation is visible on the client's instance of the physical
792
2554
@needs_read_lock
793
2555
def revision_tree(self, revision_id):
794
2556
"""Return Tree for a revision on this branch.
796
`revision_id` may be None for the empty tree revision.
2558
`revision_id` may be NULL_REVISION for the empty tree revision.
2560
revision_id = _mod_revision.ensure_null(revision_id)
798
2561
# TODO: refactor this to use an existing revision object
799
2562
# so we don't need to read it in twice.
800
if revision_id is None or revision_id == _mod_revision.NULL_REVISION:
801
return RevisionTree(self, Inventory(root_id=None),
2563
if revision_id == _mod_revision.NULL_REVISION:
2564
return RevisionTree(self, Inventory(root_id=None),
802
2565
_mod_revision.NULL_REVISION)
804
revision_id = osutils.safe_revision_id(revision_id)
805
inv = self.get_revision_inventory(revision_id)
2567
inv = self.get_inventory(revision_id)
806
2568
return RevisionTree(self, inv, revision_id)
809
2570
def revision_trees(self, revision_ids):
810
"""Return Tree for a revision on this branch.
812
`revision_id` may not be None or 'null:'"""
813
assert None not in revision_ids
814
assert _mod_revision.NULL_REVISION not in revision_ids
815
texts = self.get_inventory_weave().get_texts(revision_ids)
816
for text, revision_id in zip(texts, revision_ids):
817
inv = self.deserialise_inventory(revision_id, text)
818
yield RevisionTree(self, inv, revision_id)
2571
"""Return Trees for revisions in this repository.
2573
:param revision_ids: a sequence of revision-ids;
2574
a revision-id may not be None or 'null:'
2576
inventories = self.iter_inventories(revision_ids)
2577
for inv in inventories:
2578
yield RevisionTree(self, inv, inv.revision_id)
2580
def _filtered_revision_trees(self, revision_ids, file_ids):
2581
"""Return Tree for a revision on this branch with only some files.
2583
:param revision_ids: a sequence of revision-ids;
2584
a revision-id may not be None or 'null:'
2585
:param file_ids: if not None, the result is filtered
2586
so that only those file-ids, their parents and their
2587
children are included.
2589
inventories = self.iter_inventories(revision_ids)
2590
for inv in inventories:
2591
# Should we introduce a FilteredRevisionTree class rather
2592
# than pre-filter the inventory here?
2593
filtered_inv = inv.filter(file_ids)
2594
yield RevisionTree(self, filtered_inv, filtered_inv.revision_id)
820
2596
@needs_read_lock
821
2597
def get_ancestry(self, revision_id, topo_sorted=True):
822
2598
"""Return a list of revision-ids integrated by a revision.
824
The first element of the list is always None, indicating the origin
825
revision. This might change when we have history horizons, or
2600
The first element of the list is always None, indicating the origin
2601
revision. This might change when we have history horizons, or
826
2602
perhaps we should have a new API.
828
2604
This is topologically sorted.
830
if revision_id is None:
2606
if _mod_revision.is_null(revision_id):
832
revision_id = osutils.safe_revision_id(revision_id)
833
2608
if not self.has_revision(revision_id):
834
2609
raise errors.NoSuchRevision(self, revision_id)
835
w = self.get_inventory_weave()
836
candidates = w.get_ancestry(revision_id, topo_sorted)
837
return [None] + candidates # self._eliminate_revisions_not_present(candidates)
840
def print_file(self, file, revision_id):
841
"""Print `file` to stdout.
843
FIXME RBC 20060125 as John Meinel points out this is a bad api
844
- it writes to stdout, it assumes that that is valid etc. Fix
845
by creating a new more flexible convenience function.
2610
graph = self.get_graph()
2612
search = graph._make_breadth_first_searcher([revision_id])
2615
found, ghosts = search.next_with_ghosts()
2616
except StopIteration:
2619
if _mod_revision.NULL_REVISION in keys:
2620
keys.remove(_mod_revision.NULL_REVISION)
2622
parent_map = graph.get_parent_map(keys)
2623
keys = tsort.topo_sort(parent_map)
2624
return [None] + list(keys)
2626
def pack(self, hint=None, clean_obsolete_packs=False):
2627
"""Compress the data within the repository.
2629
This operation only makes sense for some repository types. For other
2630
types it should be a no-op that just returns.
2632
This stub method does not require a lock, but subclasses should use
2633
@needs_write_lock as this is a long running call its reasonable to
2634
implicitly lock for the user.
2636
:param hint: If not supplied, the whole repository is packed.
2637
If supplied, the repository may use the hint parameter as a
2638
hint for the parts of the repository to pack. A hint can be
2639
obtained from the result of commit_write_group(). Out of
2640
date hints are simply ignored, because concurrent operations
2641
can obsolete them rapidly.
2643
:param clean_obsolete_packs: Clean obsolete packs immediately after
847
revision_id = osutils.safe_revision_id(revision_id)
848
tree = self.revision_tree(revision_id)
849
# use inventory as it was in that revision
850
file_id = tree.inventory.path2id(file)
852
# TODO: jam 20060427 Write a test for this code path
853
# it had a bug in it, and was raising the wrong
855
raise errors.BzrError("%r is not present in revision %s" % (file, revision_id))
856
tree.print_file(file_id)
858
2647
def get_transaction(self):
859
2648
return self.control_files.get_transaction()
861
def revision_parents(self, revision_id):
862
revision_id = osutils.safe_revision_id(revision_id)
863
return self.get_inventory_weave().parent_names(revision_id)
865
def get_parents(self, revision_ids):
866
"""See StackedParentsProvider.get_parents"""
2650
def get_parent_map(self, revision_ids):
2651
"""See graph.StackedParentsProvider.get_parent_map"""
2652
# revisions index works in keys; this just works in revisions
2653
# therefore wrap and unwrap
868
2656
for revision_id in revision_ids:
869
2657
if revision_id == _mod_revision.NULL_REVISION:
873
parents = self.get_revision(revision_id).parent_ids
874
except errors.NoSuchRevision:
877
if len(parents) == 0:
878
parents = [_mod_revision.NULL_REVISION]
879
parents_list.append(parents)
2658
result[revision_id] = ()
2659
elif revision_id is None:
2660
raise ValueError('get_parent_map(None) is not valid')
2662
query_keys.append((revision_id ,))
2663
for ((revision_id,), parent_keys) in \
2664
self.revisions.get_parent_map(query_keys).iteritems():
2666
result[revision_id] = tuple([parent_revid
2667
for (parent_revid,) in parent_keys])
2669
result[revision_id] = (_mod_revision.NULL_REVISION,)
882
2672
def _make_parents_provider(self):
2676
def get_known_graph_ancestry(self, revision_ids):
2677
"""Return the known graph for a set of revision ids and their ancestors.
2679
st = static_tuple.StaticTuple
2680
revision_keys = [st(r_id).intern() for r_id in revision_ids]
2681
known_graph = self.revisions.get_known_graph_ancestry(revision_keys)
2682
return graph.GraphThunkIdsToKeys(known_graph)
885
2684
def get_graph(self, other_repository=None):
886
2685
"""Return the graph walker for this repository format"""
887
2686
parents_provider = self._make_parents_provider()
888
2687
if (other_repository is not None and
889
other_repository.bzrdir.transport.base !=
890
self.bzrdir.transport.base):
891
parents_provider = graph._StackedParentsProvider(
2688
not self.has_same_location(other_repository)):
2689
parents_provider = graph.StackedParentsProvider(
892
2690
[parents_provider, other_repository._make_parents_provider()])
893
2691
return graph.Graph(parents_provider)
2693
def _get_versioned_file_checker(self, text_key_references=None,
2695
"""Return an object suitable for checking versioned files.
2697
:param text_key_references: if non-None, an already built
2698
dictionary mapping text keys ((fileid, revision_id) tuples)
2699
to whether they were referred to by the inventory of the
2700
revision_id that they contain. If None, this will be
2702
:param ancestors: Optional result from
2703
self.get_graph().get_parent_map(self.all_revision_ids()) if already
2706
return _VersionedFileChecker(self,
2707
text_key_references=text_key_references, ancestors=ancestors)
2709
def revision_ids_to_search_result(self, result_set):
2710
"""Convert a set of revision ids to a graph SearchResult."""
2711
result_parents = set()
2712
for parents in self.get_graph().get_parent_map(
2713
result_set).itervalues():
2714
result_parents.update(parents)
2715
included_keys = result_set.intersection(result_parents)
2716
start_keys = result_set.difference(included_keys)
2717
exclude_keys = result_parents.difference(result_set)
2718
result = graph.SearchResult(start_keys, exclude_keys,
2719
len(result_set), result_set)
895
2722
@needs_write_lock
896
2723
def set_make_working_trees(self, new_value):
897
2724
"""Set the policy flag for making working trees when creating branches.
1361
3403
InterRepository.get(other).method_name(parameters).
3406
_walk_to_common_revisions_batch_size = 50
1364
3407
_optimisers = []
1365
3408
"""The available optimised InterRepository types."""
1367
3411
def copy_content(self, revision_id=None):
1368
raise NotImplementedError(self.copy_content)
1370
def fetch(self, revision_id=None, pb=None):
3412
"""Make a complete copy of the content in self into destination.
3414
This is a destructive operation! Do not use it on existing
3417
:param revision_id: Only copy the content needed to construct
3418
revision_id and its parents.
3421
self.target.set_make_working_trees(self.source.make_working_trees())
3422
except NotImplementedError:
3424
self.target.fetch(self.source, revision_id=revision_id)
3427
def fetch(self, revision_id=None, pb=None, find_ghosts=False,
1371
3429
"""Fetch the content required to construct revision_id.
1373
3431
The content is copied from self.source to self.target.
1375
3433
:param revision_id: if None all content is copied, if NULL_REVISION no
1376
3434
content is copied.
1377
:param pb: optional progress bar to use for progress reports. If not
1378
provided a default one will be created.
1380
Returns the copied revision count and the failed revisions in a tuple:
1383
raise NotImplementedError(self.fetch)
3438
ui.ui_factory.warn_experimental_format_fetch(self)
3439
from bzrlib.fetch import RepoFetcher
3440
# See <https://launchpad.net/bugs/456077> asking for a warning here
3441
if self.source._format.network_name() != self.target._format.network_name():
3442
ui.ui_factory.show_user_warning('cross_format_fetch',
3443
from_format=self.source._format,
3444
to_format=self.target._format)
3445
f = RepoFetcher(to_repository=self.target,
3446
from_repository=self.source,
3447
last_revision=revision_id,
3448
fetch_spec=fetch_spec,
3449
find_ghosts=find_ghosts)
3451
def _walk_to_common_revisions(self, revision_ids):
3452
"""Walk out from revision_ids in source to revisions target has.
3454
:param revision_ids: The start point for the search.
3455
:return: A set of revision ids.
3457
target_graph = self.target.get_graph()
3458
revision_ids = frozenset(revision_ids)
3459
missing_revs = set()
3460
source_graph = self.source.get_graph()
3461
# ensure we don't pay silly lookup costs.
3462
searcher = source_graph._make_breadth_first_searcher(revision_ids)
3463
null_set = frozenset([_mod_revision.NULL_REVISION])
3464
searcher_exhausted = False
3468
# Iterate the searcher until we have enough next_revs
3469
while len(next_revs) < self._walk_to_common_revisions_batch_size:
3471
next_revs_part, ghosts_part = searcher.next_with_ghosts()
3472
next_revs.update(next_revs_part)
3473
ghosts.update(ghosts_part)
3474
except StopIteration:
3475
searcher_exhausted = True
3477
# If there are ghosts in the source graph, and the caller asked for
3478
# them, make sure that they are present in the target.
3479
# We don't care about other ghosts as we can't fetch them and
3480
# haven't been asked to.
3481
ghosts_to_check = set(revision_ids.intersection(ghosts))
3482
revs_to_get = set(next_revs).union(ghosts_to_check)
3484
have_revs = set(target_graph.get_parent_map(revs_to_get))
3485
# we always have NULL_REVISION present.
3486
have_revs = have_revs.union(null_set)
3487
# Check if the target is missing any ghosts we need.
3488
ghosts_to_check.difference_update(have_revs)
3490
# One of the caller's revision_ids is a ghost in both the
3491
# source and the target.
3492
raise errors.NoSuchRevision(
3493
self.source, ghosts_to_check.pop())
3494
missing_revs.update(next_revs - have_revs)
3495
# Because we may have walked past the original stop point, make
3496
# sure everything is stopped
3497
stop_revs = searcher.find_seen_ancestors(have_revs)
3498
searcher.stop_searching_any(stop_revs)
3499
if searcher_exhausted:
3501
return searcher.get_result()
1385
3503
@needs_read_lock
1386
def missing_revision_ids(self, revision_id=None):
3504
def search_missing_revision_ids(self, revision_id=None, find_ghosts=True):
1387
3505
"""Return the revision ids that source has that target does not.
1389
These are returned in topological order.
1391
3507
:param revision_id: only return revision ids included by this
3509
:param find_ghosts: If True find missing revisions in deep history
3510
rather than just finding the surface difference.
3511
:return: A bzrlib.graph.SearchResult.
3513
# stop searching at found target revisions.
3514
if not find_ghosts and revision_id is not None:
3515
return self._walk_to_common_revisions([revision_id])
1394
3516
# generic, possibly worst case, slow code path.
1395
3517
target_ids = set(self.target.all_revision_ids())
1396
3518
if revision_id is not None:
1397
# TODO: jam 20070210 InterRepository is internal enough that it
1398
# should assume revision_ids are already utf-8
1399
revision_id = osutils.safe_revision_id(revision_id)
1400
3519
source_ids = self.source.get_ancestry(revision_id)
1401
assert source_ids[0] is None
3520
if source_ids[0] is not None:
3521
raise AssertionError()
1402
3522
source_ids.pop(0)
1404
3524
source_ids = self.source.all_revision_ids()
1405
3525
result_set = set(source_ids).difference(target_ids)
1406
# this may look like a no-op: its not. It preserves the ordering
1407
# other_ids had while only returning the members from other_ids
1408
# that we've decided we need.
1409
return [rev_id for rev_id in source_ids if rev_id in result_set]
3526
return self.source.revision_ids_to_search_result(result_set)
3529
def _same_model(source, target):
3530
"""True if source and target have the same data representation.
3532
Note: this is always called on the base class; overriding it in a
3533
subclass will have no effect.
3536
InterRepository._assert_same_model(source, target)
3538
except errors.IncompatibleRepositories, e:
3542
def _assert_same_model(source, target):
3543
"""Raise an exception if two repositories do not use the same model.
3545
if source.supports_rich_root() != target.supports_rich_root():
3546
raise errors.IncompatibleRepositories(source, target,
3547
"different rich-root support")
3548
if source._serializer != target._serializer:
3549
raise errors.IncompatibleRepositories(source, target,
3550
"different serializers")
1412
3553
class InterSameDataRepository(InterRepository):
1413
3554
"""Code for converting between repositories that represent the same data.
1415
3556
Data format and model must match for this to work.
1419
3560
def _get_repo_format_to_test(self):
1420
"""Repository format for testing with."""
1421
return RepositoryFormat.get_default_format()
3561
"""Repository format for testing with.
3563
InterSameData can pull from subtree to subtree and from non-subtree to
3564
non-subtree, so we test this with the richest repository format.
3566
from bzrlib.repofmt import knitrepo
3567
return knitrepo.RepositoryFormatKnit3()
1424
3570
def is_compatible(source, target):
1425
if source.supports_rich_root() != target.supports_rich_root():
1427
if source._serializer != target._serializer:
1432
def copy_content(self, revision_id=None):
1433
"""Make a complete copy of the content in self into destination.
1435
This copies both the repository's revision data, and configuration information
1436
such as the make_working_trees setting.
1438
This is a destructive operation! Do not use it on existing
1441
:param revision_id: Only copy the content needed to construct
1442
revision_id and its parents.
1445
self.target.set_make_working_trees(self.source.make_working_trees())
1446
except NotImplementedError:
1448
# TODO: jam 20070210 This is fairly internal, so we should probably
1449
# just assert that revision_id is not unicode.
1450
revision_id = osutils.safe_revision_id(revision_id)
1451
# but don't bother fetching if we have the needed data now.
1452
if (revision_id not in (None, _mod_revision.NULL_REVISION) and
1453
self.target.has_revision(revision_id)):
1455
self.target.fetch(self.source, revision_id=revision_id)
1458
def fetch(self, revision_id=None, pb=None):
1459
"""See InterRepository.fetch()."""
1460
from bzrlib.fetch import GenericRepoFetcher
1461
mutter("Using fetch logic to copy between %s(%s) and %s(%s)",
1462
self.source, self.source._format, self.target,
1463
self.target._format)
1464
# TODO: jam 20070210 This should be an assert, not a translate
1465
revision_id = osutils.safe_revision_id(revision_id)
1466
f = GenericRepoFetcher(to_repository=self.target,
1467
from_repository=self.source,
1468
last_revision=revision_id,
1470
return f.count_copied, f.failed_revisions
3571
return InterRepository._same_model(source, target)
1473
3574
class InterWeaveRepo(InterSameDataRepository):
1474
"""Optimised code paths between Weave based repositories."""
3575
"""Optimised code paths between Weave based repositories.
3577
This should be in bzrlib/repofmt/weaverepo.py but we have not yet
3578
implemented lazy inter-object optimisation.
1477
3582
def _get_repo_format_to_test(self):
1601
3695
def is_compatible(source, target):
1602
3696
"""Be compatible with known Knit formats.
1604
3698
We don't test for the stores being of specific types because that
1605
could lead to confusing results, and there is no need to be
3699
could lead to confusing results, and there is no need to be
1606
3700
overly general.
1608
from bzrlib.repofmt.knitrepo import RepositoryFormatKnit1
3702
from bzrlib.repofmt.knitrepo import RepositoryFormatKnit
1610
return (isinstance(source._format, (RepositoryFormatKnit1)) and
1611
isinstance(target._format, (RepositoryFormatKnit1)))
3704
are_knits = (isinstance(source._format, RepositoryFormatKnit) and
3705
isinstance(target._format, RepositoryFormatKnit))
1612
3706
except AttributeError:
1616
def fetch(self, revision_id=None, pb=None):
1617
"""See InterRepository.fetch()."""
1618
from bzrlib.fetch import KnitRepoFetcher
1619
mutter("Using fetch logic to copy between %s(%s) and %s(%s)",
1620
self.source, self.source._format, self.target, self.target._format)
1621
# TODO: jam 20070210 This should be an assert, not a translate
1622
revision_id = osutils.safe_revision_id(revision_id)
1623
f = KnitRepoFetcher(to_repository=self.target,
1624
from_repository=self.source,
1625
last_revision=revision_id,
1627
return f.count_copied, f.failed_revisions
3708
return are_knits and InterRepository._same_model(source, target)
1629
3710
@needs_read_lock
1630
def missing_revision_ids(self, revision_id=None):
3711
def search_missing_revision_ids(self, revision_id=None, find_ghosts=True):
1631
3712
"""See InterRepository.missing_revision_ids()."""
1632
3713
if revision_id is not None:
1633
3714
source_ids = self.source.get_ancestry(revision_id)
1634
assert source_ids[0] is None
3715
if source_ids[0] is not None:
3716
raise AssertionError()
1635
3717
source_ids.pop(0)
1637
source_ids = self.source._all_possible_ids()
3719
source_ids = self.source.all_revision_ids()
1638
3720
source_ids_set = set(source_ids)
1639
3721
# source_ids is the worst possible case we may need to pull.
1640
3722
# now we want to filter source_ids against what we actually
1641
3723
# have in target, but don't try to check for existence where we know
1642
3724
# we do not have a revision as that would be pointless.
1643
target_ids = set(self.target._all_possible_ids())
3725
target_ids = set(self.target.all_revision_ids())
1644
3726
possibly_present_revisions = target_ids.intersection(source_ids_set)
1645
actually_present_revisions = set(self.target._eliminate_revisions_not_present(possibly_present_revisions))
3727
actually_present_revisions = set(
3728
self.target._eliminate_revisions_not_present(possibly_present_revisions))
1646
3729
required_revisions = source_ids_set.difference(actually_present_revisions)
1647
required_topo_revisions = [rev_id for rev_id in source_ids if rev_id in required_revisions]
1648
3730
if revision_id is not None:
1649
3731
# we used get_ancestry to determine source_ids then we are assured all
1650
3732
# revisions referenced are present as they are installed in topological order.
1651
3733
# and the tip revision was validated by get_ancestry.
1652
return required_topo_revisions
3734
result_set = required_revisions
1654
# if we just grabbed the possibly available ids, then
3736
# if we just grabbed the possibly available ids, then
1655
3737
# we only have an estimate of whats available and need to validate
1656
3738
# that against the revision records.
1657
return self.source._eliminate_revisions_not_present(required_topo_revisions)
1660
class InterModel1and2(InterRepository):
1663
def _get_repo_format_to_test(self):
1667
def is_compatible(source, target):
1668
if not source.supports_rich_root() and target.supports_rich_root():
1674
def fetch(self, revision_id=None, pb=None):
1675
"""See InterRepository.fetch()."""
1676
from bzrlib.fetch import Model1toKnit2Fetcher
1677
# TODO: jam 20070210 This should be an assert, not a translate
1678
revision_id = osutils.safe_revision_id(revision_id)
1679
f = Model1toKnit2Fetcher(to_repository=self.target,
1680
from_repository=self.source,
1681
last_revision=revision_id,
1683
return f.count_copied, f.failed_revisions
1686
def copy_content(self, revision_id=None):
1687
"""Make a complete copy of the content in self into destination.
1689
This is a destructive operation! Do not use it on existing
1692
:param revision_id: Only copy the content needed to construct
1693
revision_id and its parents.
1696
self.target.set_make_working_trees(self.source.make_working_trees())
1697
except NotImplementedError:
1699
# TODO: jam 20070210 Internal, assert, don't translate
1700
revision_id = osutils.safe_revision_id(revision_id)
1701
# but don't bother fetching if we have the needed data now.
1702
if (revision_id not in (None, _mod_revision.NULL_REVISION) and
1703
self.target.has_revision(revision_id)):
1705
self.target.fetch(self.source, revision_id=revision_id)
1708
class InterKnit1and2(InterKnitRepo):
1711
def _get_repo_format_to_test(self):
1715
def is_compatible(source, target):
1716
"""Be compatible with Knit1 source and Knit3 target"""
1717
from bzrlib.repofmt.knitrepo import RepositoryFormatKnit3
1719
from bzrlib.repofmt.knitrepo import RepositoryFormatKnit1, \
1720
RepositoryFormatKnit3
1721
return (isinstance(source._format, (RepositoryFormatKnit1)) and
1722
isinstance(target._format, (RepositoryFormatKnit3)))
1723
except AttributeError:
1727
def fetch(self, revision_id=None, pb=None):
1728
"""See InterRepository.fetch()."""
1729
from bzrlib.fetch import Knit1to2Fetcher
1730
mutter("Using fetch logic to copy between %s(%s) and %s(%s)",
1731
self.source, self.source._format, self.target,
1732
self.target._format)
1733
# TODO: jam 20070210 This should be an assert, not a translate
1734
revision_id = osutils.safe_revision_id(revision_id)
1735
f = Knit1to2Fetcher(to_repository=self.target,
1736
from_repository=self.source,
1737
last_revision=revision_id,
1739
return f.count_copied, f.failed_revisions
1742
class InterRemoteRepository(InterRepository):
1743
"""Code for converting between RemoteRepository objects.
1745
This just gets an non-remote repository from the RemoteRepository, and calls
1746
InterRepository.get again.
1749
def __init__(self, source, target):
1750
if isinstance(source, remote.RemoteRepository):
1751
source._ensure_real()
1752
real_source = source._real_repository
1754
real_source = source
1755
if isinstance(target, remote.RemoteRepository):
1756
target._ensure_real()
1757
real_target = target._real_repository
1759
real_target = target
1760
self.real_inter = InterRepository.get(real_source, real_target)
1763
def is_compatible(source, target):
1764
if isinstance(source, remote.RemoteRepository):
1766
if isinstance(target, remote.RemoteRepository):
1770
def copy_content(self, revision_id=None):
1771
self.real_inter.copy_content(revision_id=revision_id)
1773
def fetch(self, revision_id=None, pb=None):
1774
self.real_inter.fetch(revision_id=revision_id, pb=pb)
1777
def _get_repo_format_to_test(self):
3740
self.source._eliminate_revisions_not_present(required_revisions))
3741
return self.source.revision_ids_to_search_result(result_set)
3744
class InterDifferingSerializer(InterRepository):
3747
def _get_repo_format_to_test(self):
3751
def is_compatible(source, target):
3752
"""Be compatible with Knit2 source and Knit3 target"""
3753
# This is redundant with format.check_conversion_target(), however that
3754
# raises an exception, and we just want to say "False" as in we won't
3755
# support converting between these formats.
3756
if 'IDS_never' in debug.debug_flags:
3758
if source.supports_rich_root() and not target.supports_rich_root():
3760
if (source._format.supports_tree_reference
3761
and not target._format.supports_tree_reference):
3763
if target._fallback_repositories and target._format.supports_chks:
3764
# IDS doesn't know how to copy CHKs for the parent inventories it
3765
# adds to stacked repos.
3767
if 'IDS_always' in debug.debug_flags:
3769
# Only use this code path for local source and target. IDS does far
3770
# too much IO (both bandwidth and roundtrips) over a network.
3771
if not source.bzrdir.transport.base.startswith('file:///'):
3773
if not target.bzrdir.transport.base.startswith('file:///'):
3777
def _get_trees(self, revision_ids, cache):
3779
for rev_id in revision_ids:
3781
possible_trees.append((rev_id, cache[rev_id]))
3783
# Not cached, but inventory might be present anyway.
3785
tree = self.source.revision_tree(rev_id)
3786
except errors.NoSuchRevision:
3787
# Nope, parent is ghost.
3790
cache[rev_id] = tree
3791
possible_trees.append((rev_id, tree))
3792
return possible_trees
3794
def _get_delta_for_revision(self, tree, parent_ids, possible_trees):
3795
"""Get the best delta and base for this revision.
3797
:return: (basis_id, delta)
3800
# Generate deltas against each tree, to find the shortest.
3801
texts_possibly_new_in_tree = set()
3802
for basis_id, basis_tree in possible_trees:
3803
delta = tree.inventory._make_delta(basis_tree.inventory)
3804
for old_path, new_path, file_id, new_entry in delta:
3805
if new_path is None:
3806
# This file_id isn't present in the new rev, so we don't
3810
# Rich roots are handled elsewhere...
3812
kind = new_entry.kind
3813
if kind != 'directory' and kind != 'file':
3814
# No text record associated with this inventory entry.
3816
# This is a directory or file that has changed somehow.
3817
texts_possibly_new_in_tree.add((file_id, new_entry.revision))
3818
deltas.append((len(delta), basis_id, delta))
3820
return deltas[0][1:]
3822
def _fetch_parent_invs_for_stacking(self, parent_map, cache):
3823
"""Find all parent revisions that are absent, but for which the
3824
inventory is present, and copy those inventories.
3826
This is necessary to preserve correctness when the source is stacked
3827
without fallbacks configured. (Note that in cases like upgrade the
3828
source may be not have _fallback_repositories even though it is
3832
for parents in parent_map.values():
3833
parent_revs.update(parents)
3834
present_parents = self.source.get_parent_map(parent_revs)
3835
absent_parents = set(parent_revs).difference(present_parents)
3836
parent_invs_keys_for_stacking = self.source.inventories.get_parent_map(
3837
(rev_id,) for rev_id in absent_parents)
3838
parent_inv_ids = [key[-1] for key in parent_invs_keys_for_stacking]
3839
for parent_tree in self.source.revision_trees(parent_inv_ids):
3840
current_revision_id = parent_tree.get_revision_id()
3841
parents_parents_keys = parent_invs_keys_for_stacking[
3842
(current_revision_id,)]
3843
parents_parents = [key[-1] for key in parents_parents_keys]
3844
basis_id = _mod_revision.NULL_REVISION
3845
basis_tree = self.source.revision_tree(basis_id)
3846
delta = parent_tree.inventory._make_delta(basis_tree.inventory)
3847
self.target.add_inventory_by_delta(
3848
basis_id, delta, current_revision_id, parents_parents)
3849
cache[current_revision_id] = parent_tree
3851
def _fetch_batch(self, revision_ids, basis_id, cache, a_graph=None):
3852
"""Fetch across a few revisions.
3854
:param revision_ids: The revisions to copy
3855
:param basis_id: The revision_id of a tree that must be in cache, used
3856
as a basis for delta when no other base is available
3857
:param cache: A cache of RevisionTrees that we can use.
3858
:param a_graph: A Graph object to determine the heads() of the
3859
rich-root data stream.
3860
:return: The revision_id of the last converted tree. The RevisionTree
3861
for it will be in cache
3863
# Walk though all revisions; get inventory deltas, copy referenced
3864
# texts that delta references, insert the delta, revision and
3866
root_keys_to_create = set()
3869
pending_revisions = []
3870
parent_map = self.source.get_parent_map(revision_ids)
3871
self._fetch_parent_invs_for_stacking(parent_map, cache)
3872
self.source._safe_to_return_from_cache = True
3873
for tree in self.source.revision_trees(revision_ids):
3874
# Find a inventory delta for this revision.
3875
# Find text entries that need to be copied, too.
3876
current_revision_id = tree.get_revision_id()
3877
parent_ids = parent_map.get(current_revision_id, ())
3878
parent_trees = self._get_trees(parent_ids, cache)
3879
possible_trees = list(parent_trees)
3880
if len(possible_trees) == 0:
3881
# There either aren't any parents, or the parents are ghosts,
3882
# so just use the last converted tree.
3883
possible_trees.append((basis_id, cache[basis_id]))
3884
basis_id, delta = self._get_delta_for_revision(tree, parent_ids,
3886
revision = self.source.get_revision(current_revision_id)
3887
pending_deltas.append((basis_id, delta,
3888
current_revision_id, revision.parent_ids))
3889
if self._converting_to_rich_root:
3890
self._revision_id_to_root_id[current_revision_id] = \
3892
# Determine which texts are in present in this revision but not in
3893
# any of the available parents.
3894
texts_possibly_new_in_tree = set()
3895
for old_path, new_path, file_id, entry in delta:
3896
if new_path is None:
3897
# This file_id isn't present in the new rev
3901
if not self.target.supports_rich_root():
3902
# The target doesn't support rich root, so we don't
3905
if self._converting_to_rich_root:
3906
# This can't be copied normally, we have to insert
3908
root_keys_to_create.add((file_id, entry.revision))
3911
texts_possibly_new_in_tree.add((file_id, entry.revision))
3912
for basis_id, basis_tree in possible_trees:
3913
basis_inv = basis_tree.inventory
3914
for file_key in list(texts_possibly_new_in_tree):
3915
file_id, file_revision = file_key
3917
entry = basis_inv[file_id]
3918
except errors.NoSuchId:
3920
if entry.revision == file_revision:
3921
texts_possibly_new_in_tree.remove(file_key)
3922
text_keys.update(texts_possibly_new_in_tree)
3923
pending_revisions.append(revision)
3924
cache[current_revision_id] = tree
3925
basis_id = current_revision_id
3926
self.source._safe_to_return_from_cache = False
3928
from_texts = self.source.texts
3929
to_texts = self.target.texts
3930
if root_keys_to_create:
3931
root_stream = _mod_fetch._new_root_data_stream(
3932
root_keys_to_create, self._revision_id_to_root_id, parent_map,
3933
self.source, graph=a_graph)
3934
to_texts.insert_record_stream(root_stream)
3935
to_texts.insert_record_stream(from_texts.get_record_stream(
3936
text_keys, self.target._format._fetch_order,
3937
not self.target._format._fetch_uses_deltas))
3938
# insert inventory deltas
3939
for delta in pending_deltas:
3940
self.target.add_inventory_by_delta(*delta)
3941
if self.target._fallback_repositories:
3942
# Make sure this stacked repository has all the parent inventories
3943
# for the new revisions that we are about to insert. We do this
3944
# before adding the revisions so that no revision is added until
3945
# all the inventories it may depend on are added.
3946
# Note that this is overzealous, as we may have fetched these in an
3949
revision_ids = set()
3950
for revision in pending_revisions:
3951
revision_ids.add(revision.revision_id)
3952
parent_ids.update(revision.parent_ids)
3953
parent_ids.difference_update(revision_ids)
3954
parent_ids.discard(_mod_revision.NULL_REVISION)
3955
parent_map = self.source.get_parent_map(parent_ids)
3956
# we iterate over parent_map and not parent_ids because we don't
3957
# want to try copying any revision which is a ghost
3958
for parent_tree in self.source.revision_trees(parent_map):
3959
current_revision_id = parent_tree.get_revision_id()
3960
parents_parents = parent_map[current_revision_id]
3961
possible_trees = self._get_trees(parents_parents, cache)
3962
if len(possible_trees) == 0:
3963
# There either aren't any parents, or the parents are
3964
# ghosts, so just use the last converted tree.
3965
possible_trees.append((basis_id, cache[basis_id]))
3966
basis_id, delta = self._get_delta_for_revision(parent_tree,
3967
parents_parents, possible_trees)
3968
self.target.add_inventory_by_delta(
3969
basis_id, delta, current_revision_id, parents_parents)
3970
# insert signatures and revisions
3971
for revision in pending_revisions:
3973
signature = self.source.get_signature_text(
3974
revision.revision_id)
3975
self.target.add_signature_text(revision.revision_id,
3977
except errors.NoSuchRevision:
3979
self.target.add_revision(revision.revision_id, revision)
3982
def _fetch_all_revisions(self, revision_ids, pb):
3983
"""Fetch everything for the list of revisions.
3985
:param revision_ids: The list of revisions to fetch. Must be in
3987
:param pb: A ProgressTask
3990
basis_id, basis_tree = self._get_basis(revision_ids[0])
3992
cache = lru_cache.LRUCache(100)
3993
cache[basis_id] = basis_tree
3994
del basis_tree # We don't want to hang on to it here
3996
if self._converting_to_rich_root and len(revision_ids) > 100:
3997
a_graph = _mod_fetch._get_rich_root_heads_graph(self.source,
4002
for offset in range(0, len(revision_ids), batch_size):
4003
self.target.start_write_group()
4005
pb.update('Transferring revisions', offset,
4007
batch = revision_ids[offset:offset+batch_size]
4008
basis_id = self._fetch_batch(batch, basis_id, cache,
4011
self.source._safe_to_return_from_cache = False
4012
self.target.abort_write_group()
4015
hint = self.target.commit_write_group()
4018
if hints and self.target._format.pack_compresses:
4019
self.target.pack(hint=hints)
4020
pb.update('Transferring revisions', len(revision_ids),
4024
def fetch(self, revision_id=None, pb=None, find_ghosts=False,
4026
"""See InterRepository.fetch()."""
4027
if fetch_spec is not None:
4028
raise AssertionError("Not implemented yet...")
4029
ui.ui_factory.warn_experimental_format_fetch(self)
4030
if (not self.source.supports_rich_root()
4031
and self.target.supports_rich_root()):
4032
self._converting_to_rich_root = True
4033
self._revision_id_to_root_id = {}
4035
self._converting_to_rich_root = False
4036
# See <https://launchpad.net/bugs/456077> asking for a warning here
4037
if self.source._format.network_name() != self.target._format.network_name():
4038
ui.ui_factory.show_user_warning('cross_format_fetch',
4039
from_format=self.source._format,
4040
to_format=self.target._format)
4041
revision_ids = self.target.search_missing_revision_ids(self.source,
4042
revision_id, find_ghosts=find_ghosts).get_keys()
4043
if not revision_ids:
4045
revision_ids = tsort.topo_sort(
4046
self.source.get_graph().get_parent_map(revision_ids))
4047
if not revision_ids:
4049
# Walk though all revisions; get inventory deltas, copy referenced
4050
# texts that delta references, insert the delta, revision and
4053
my_pb = ui.ui_factory.nested_progress_bar()
4056
symbol_versioning.warn(
4057
symbol_versioning.deprecated_in((1, 14, 0))
4058
% "pb parameter to fetch()")
4061
self._fetch_all_revisions(revision_ids, pb)
4063
if my_pb is not None:
4065
return len(revision_ids), 0
4067
def _get_basis(self, first_revision_id):
4068
"""Get a revision and tree which exists in the target.
4070
This assumes that first_revision_id is selected for transmission
4071
because all other ancestors are already present. If we can't find an
4072
ancestor we fall back to NULL_REVISION since we know that is safe.
4074
:return: (basis_id, basis_tree)
4076
first_rev = self.source.get_revision(first_revision_id)
4078
basis_id = first_rev.parent_ids[0]
4079
# only valid as a basis if the target has it
4080
self.target.get_revision(basis_id)
4081
# Try to get a basis tree - if its a ghost it will hit the
4082
# NoSuchRevision case.
4083
basis_tree = self.source.revision_tree(basis_id)
4084
except (IndexError, errors.NoSuchRevision):
4085
basis_id = _mod_revision.NULL_REVISION
4086
basis_tree = self.source.revision_tree(basis_id)
4087
return basis_id, basis_tree
4090
InterRepository.register_optimiser(InterDifferingSerializer)
1781
4091
InterRepository.register_optimiser(InterSameDataRepository)
1782
4092
InterRepository.register_optimiser(InterWeaveRepo)
1783
4093
InterRepository.register_optimiser(InterKnitRepo)
1784
InterRepository.register_optimiser(InterModel1and2)
1785
InterRepository.register_optimiser(InterKnit1and2)
1786
InterRepository.register_optimiser(InterRemoteRepository)
1789
4096
class CopyConverter(object):
1790
4097
"""A repository conversion tool which just performs a copy of the content.
1792
4099
This is slow but quite reliable.
1798
4105
:param target_format: The format the resulting repository should be.
1800
4107
self.target_format = target_format
1802
4109
def convert(self, repo, pb):
1803
4110
"""Perform the conversion of to_convert, giving feedback via pb.
1805
4112
:param to_convert: The disk object to convert.
1806
4113
:param pb: a progress bar to use for progress information.
4115
pb = ui.ui_factory.nested_progress_bar()
1811
4118
# this is only useful with metadir layouts - separated repo content.
1812
4119
# trigger an assertion if not such
1813
4120
repo._format.get_format_string()
1814
4121
self.repo_dir = repo.bzrdir
1815
self.step('Moving repository to repository.backup')
4122
pb.update('Moving repository to repository.backup')
1816
4123
self.repo_dir.transport.move('repository', 'repository.backup')
1817
4124
backup_transport = self.repo_dir.transport.clone('repository.backup')
1818
4125
repo._format.check_conversion_target(self.target_format)
1819
4126
self.source_repo = repo._format.open(self.repo_dir,
1821
4128
_override_transport=backup_transport)
1822
self.step('Creating new repository')
4129
pb.update('Creating new repository')
1823
4130
converted = self.target_format.initialize(self.repo_dir,
1824
4131
self.source_repo.is_shared())
1825
4132
converted.lock_write()
1827
self.step('Copying content into repository.')
4134
pb.update('Copying content')
1828
4135
self.source_repo.copy_content_into(converted)
1830
4137
converted.unlock()
1831
self.step('Deleting old repository content.')
4138
pb.update('Deleting old repository content')
1832
4139
self.repo_dir.transport.delete_tree('repository.backup')
1833
self.pb.note('repository converted')
1835
def step(self, message):
1836
"""Update the pb by a step."""
1838
self.pb.update(message, self.count, self.total)
1841
class CommitBuilder(object):
1842
"""Provides an interface to build up a commit.
1844
This allows describing a tree to be committed without needing to
1845
know the internals of the format of the repository.
1848
record_root_entry = False
1849
def __init__(self, repository, parents, config, timestamp=None,
1850
timezone=None, committer=None, revprops=None,
1852
"""Initiate a CommitBuilder.
1854
:param repository: Repository to commit to.
1855
:param parents: Revision ids of the parents of the new revision.
1856
:param config: Configuration to use.
1857
:param timestamp: Optional timestamp recorded for commit.
1858
:param timezone: Optional timezone for timestamp.
1859
:param committer: Optional committer to set for commit.
1860
:param revprops: Optional dictionary of revision properties.
1861
:param revision_id: Optional revision id.
1863
self._config = config
1865
if committer is None:
1866
self._committer = self._config.username()
1868
assert isinstance(committer, basestring), type(committer)
1869
self._committer = committer
1871
self.new_inventory = Inventory(None)
1872
self._new_revision_id = osutils.safe_revision_id(revision_id)
1873
self.parents = parents
1874
self.repository = repository
1877
if revprops is not None:
1878
self._revprops.update(revprops)
1880
if timestamp is None:
1881
timestamp = time.time()
1882
# Restrict resolution to 1ms
1883
self._timestamp = round(timestamp, 3)
1885
if timezone is None:
1886
self._timezone = osutils.local_time_offset()
1888
self._timezone = int(timezone)
1890
self._generate_revision_if_needed()
1892
def commit(self, message):
1893
"""Make the actual commit.
1895
:return: The revision id of the recorded revision.
1897
rev = _mod_revision.Revision(
1898
timestamp=self._timestamp,
1899
timezone=self._timezone,
1900
committer=self._committer,
1902
inventory_sha1=self.inv_sha1,
1903
revision_id=self._new_revision_id,
1904
properties=self._revprops)
1905
rev.parent_ids = self.parents
1906
self.repository.add_revision(self._new_revision_id, rev,
1907
self.new_inventory, self._config)
1908
return self._new_revision_id
1910
def revision_tree(self):
1911
"""Return the tree that was just committed.
1913
After calling commit() this can be called to get a RevisionTree
1914
representing the newly committed tree. This is preferred to
1915
calling Repository.revision_tree() because that may require
1916
deserializing the inventory, while we already have a copy in
1919
return RevisionTree(self.repository, self.new_inventory,
1920
self._new_revision_id)
1922
def finish_inventory(self):
1923
"""Tell the builder that the inventory is finished."""
1924
if self.new_inventory.root is None:
1925
symbol_versioning.warn('Root entry should be supplied to'
1926
' record_entry_contents, as of bzr 0.10.',
1927
DeprecationWarning, stacklevel=2)
1928
self.new_inventory.add(InventoryDirectory(ROOT_ID, '', None))
1929
self.new_inventory.revision_id = self._new_revision_id
1930
self.inv_sha1 = self.repository.add_inventory(
1931
self._new_revision_id,
1936
def _gen_revision_id(self):
1937
"""Return new revision-id."""
1938
return generate_ids.gen_revision_id(self._config.username(),
1941
def _generate_revision_if_needed(self):
1942
"""Create a revision id if None was supplied.
1944
If the repository can not support user-specified revision ids
1945
they should override this function and raise CannotSetRevisionId
1946
if _new_revision_id is not None.
1948
:raises: CannotSetRevisionId
1950
if self._new_revision_id is None:
1951
self._new_revision_id = self._gen_revision_id()
1953
def record_entry_contents(self, ie, parent_invs, path, tree):
1954
"""Record the content of ie from tree into the commit if needed.
1956
Side effect: sets ie.revision when unchanged
1958
:param ie: An inventory entry present in the commit.
1959
:param parent_invs: The inventories of the parent revisions of the
1961
:param path: The path the entry is at in the tree.
1962
:param tree: The tree which contains this entry and should be used to
1965
if self.new_inventory.root is None and ie.parent_id is not None:
1966
symbol_versioning.warn('Root entry should be supplied to'
1967
' record_entry_contents, as of bzr 0.10.',
1968
DeprecationWarning, stacklevel=2)
1969
self.record_entry_contents(tree.inventory.root.copy(), parent_invs,
1971
self.new_inventory.add(ie)
1973
# ie.revision is always None if the InventoryEntry is considered
1974
# for committing. ie.snapshot will record the correct revision
1975
# which may be the sole parent if it is untouched.
1976
if ie.revision is not None:
1979
# In this revision format, root entries have no knit or weave
1980
if ie is self.new_inventory.root:
1981
# When serializing out to disk and back in
1982
# root.revision is always _new_revision_id
1983
ie.revision = self._new_revision_id
1985
previous_entries = ie.find_previous_heads(
1987
self.repository.weave_store,
1988
self.repository.get_transaction())
1989
# we are creating a new revision for ie in the history store
1991
ie.snapshot(self._new_revision_id, path, previous_entries, tree, self)
1993
def modified_directory(self, file_id, file_parents):
1994
"""Record the presence of a symbolic link.
1996
:param file_id: The file_id of the link to record.
1997
:param file_parents: The per-file parent revision ids.
1999
self._add_text_to_weave(file_id, [], file_parents.keys())
2001
def modified_reference(self, file_id, file_parents):
2002
"""Record the modification of a reference.
2004
:param file_id: The file_id of the link to record.
2005
:param file_parents: The per-file parent revision ids.
2007
self._add_text_to_weave(file_id, [], file_parents.keys())
2009
def modified_file_text(self, file_id, file_parents,
2010
get_content_byte_lines, text_sha1=None,
2012
"""Record the text of file file_id
2014
:param file_id: The file_id of the file to record the text of.
2015
:param file_parents: The per-file parent revision ids.
2016
:param get_content_byte_lines: A callable which will return the byte
2018
:param text_sha1: Optional SHA1 of the file contents.
2019
:param text_size: Optional size of the file contents.
2021
# mutter('storing text of file {%s} in revision {%s} into %r',
2022
# file_id, self._new_revision_id, self.repository.weave_store)
2023
# special case to avoid diffing on renames or
2025
if (len(file_parents) == 1
2026
and text_sha1 == file_parents.values()[0].text_sha1
2027
and text_size == file_parents.values()[0].text_size):
2028
previous_ie = file_parents.values()[0]
2029
versionedfile = self.repository.weave_store.get_weave(file_id,
2030
self.repository.get_transaction())
2031
versionedfile.clone_text(self._new_revision_id,
2032
previous_ie.revision, file_parents.keys())
2033
return text_sha1, text_size
2035
new_lines = get_content_byte_lines()
2036
# TODO: Rather than invoking sha_strings here, _add_text_to_weave
2037
# should return the SHA1 and size
2038
self._add_text_to_weave(file_id, new_lines, file_parents.keys())
2039
return osutils.sha_strings(new_lines), \
2040
sum(map(len, new_lines))
2042
def modified_link(self, file_id, file_parents, link_target):
2043
"""Record the presence of a symbolic link.
2045
:param file_id: The file_id of the link to record.
2046
:param file_parents: The per-file parent revision ids.
2047
:param link_target: Target location of this link.
2049
self._add_text_to_weave(file_id, [], file_parents.keys())
2051
def _add_text_to_weave(self, file_id, new_lines, parents):
2052
versionedfile = self.repository.weave_store.get_weave_or_empty(
2053
file_id, self.repository.get_transaction())
2054
versionedfile.add_lines(self._new_revision_id, parents, new_lines)
2055
versionedfile.clear_cache()
2058
class _CommitBuilder(CommitBuilder):
2059
"""Temporary class so old CommitBuilders are detected properly
2061
Note: CommitBuilder works whether or not root entry is recorded.
2064
record_root_entry = True
2067
class RootCommitBuilder(CommitBuilder):
2068
"""This commitbuilder actually records the root id"""
2070
record_root_entry = True
2072
def record_entry_contents(self, ie, parent_invs, path, tree):
2073
"""Record the content of ie from tree into the commit if needed.
2075
Side effect: sets ie.revision when unchanged
2077
:param ie: An inventory entry present in the commit.
2078
:param parent_invs: The inventories of the parent revisions of the
2080
:param path: The path the entry is at in the tree.
2081
:param tree: The tree which contains this entry and should be used to
2084
assert self.new_inventory.root is not None or ie.parent_id is None
2085
self.new_inventory.add(ie)
2087
# ie.revision is always None if the InventoryEntry is considered
2088
# for committing. ie.snapshot will record the correct revision
2089
# which may be the sole parent if it is untouched.
2090
if ie.revision is not None:
2093
previous_entries = ie.find_previous_heads(
2095
self.repository.weave_store,
2096
self.repository.get_transaction())
2097
# we are creating a new revision for ie in the history store
2099
ie.snapshot(self._new_revision_id, path, previous_entries, tree, self)
4140
ui.ui_factory.note('repository converted')
2102
4144
_unescape_map = {
2127
4169
if _unescape_re is None:
2128
4170
_unescape_re = re.compile('\&([^;]*);')
2129
4171
return _unescape_re.sub(_unescaper, data)
4174
class _VersionedFileChecker(object):
4176
def __init__(self, repository, text_key_references=None, ancestors=None):
4177
self.repository = repository
4178
self.text_index = self.repository._generate_text_key_index(
4179
text_key_references=text_key_references, ancestors=ancestors)
4181
def calculate_file_version_parents(self, text_key):
4182
"""Calculate the correct parents for a file version according to
4185
parent_keys = self.text_index[text_key]
4186
if parent_keys == [_mod_revision.NULL_REVISION]:
4188
return tuple(parent_keys)
4190
def check_file_version_parents(self, texts, progress_bar=None):
4191
"""Check the parents stored in a versioned file are correct.
4193
It also detects file versions that are not referenced by their
4194
corresponding revision's inventory.
4196
:returns: A tuple of (wrong_parents, dangling_file_versions).
4197
wrong_parents is a dict mapping {revision_id: (stored_parents,
4198
correct_parents)} for each revision_id where the stored parents
4199
are not correct. dangling_file_versions is a set of (file_id,
4200
revision_id) tuples for versions that are present in this versioned
4201
file, but not used by the corresponding inventory.
4203
local_progress = None
4204
if progress_bar is None:
4205
local_progress = ui.ui_factory.nested_progress_bar()
4206
progress_bar = local_progress
4208
return self._check_file_version_parents(texts, progress_bar)
4211
local_progress.finished()
4213
def _check_file_version_parents(self, texts, progress_bar):
4214
"""See check_file_version_parents."""
4216
self.file_ids = set([file_id for file_id, _ in
4217
self.text_index.iterkeys()])
4218
# text keys is now grouped by file_id
4219
n_versions = len(self.text_index)
4220
progress_bar.update('loading text store', 0, n_versions)
4221
parent_map = self.repository.texts.get_parent_map(self.text_index)
4222
# On unlistable transports this could well be empty/error...
4223
text_keys = self.repository.texts.keys()
4224
unused_keys = frozenset(text_keys) - set(self.text_index)
4225
for num, key in enumerate(self.text_index.iterkeys()):
4226
progress_bar.update('checking text graph', num, n_versions)
4227
correct_parents = self.calculate_file_version_parents(key)
4229
knit_parents = parent_map[key]
4230
except errors.RevisionNotPresent:
4233
if correct_parents != knit_parents:
4234
wrong_parents[key] = (knit_parents, correct_parents)
4235
return wrong_parents, unused_keys
4238
def _old_get_graph(repository, revision_id):
4239
"""DO NOT USE. That is all. I'm serious."""
4240
graph = repository.get_graph()
4241
revision_graph = dict(((key, value) for key, value in
4242
graph.iter_ancestry([revision_id]) if value is not None))
4243
return _strip_NULL_ghosts(revision_graph)
4246
def _strip_NULL_ghosts(revision_graph):
4247
"""Also don't use this. more compatibility code for unmigrated clients."""
4248
# Filter ghosts, and null:
4249
if _mod_revision.NULL_REVISION in revision_graph:
4250
del revision_graph[_mod_revision.NULL_REVISION]
4251
for key, parents in revision_graph.items():
4252
revision_graph[key] = tuple(parent for parent in parents if parent
4254
return revision_graph
4257
class StreamSink(object):
4258
"""An object that can insert a stream into a repository.
4260
This interface handles the complexity of reserialising inventories and
4261
revisions from different formats, and allows unidirectional insertion into
4262
stacked repositories without looking for the missing basis parents
4266
def __init__(self, target_repo):
4267
self.target_repo = target_repo
4269
def insert_stream(self, stream, src_format, resume_tokens):
4270
"""Insert a stream's content into the target repository.
4272
:param src_format: a bzr repository format.
4274
:return: a list of resume tokens and an iterable of keys additional
4275
items required before the insertion can be completed.
4277
self.target_repo.lock_write()
4280
self.target_repo.resume_write_group(resume_tokens)
4283
self.target_repo.start_write_group()
4286
# locked_insert_stream performs a commit|suspend.
4287
return self._locked_insert_stream(stream, src_format,
4290
self.target_repo.abort_write_group(suppress_errors=True)
4293
self.target_repo.unlock()
4295
def _locked_insert_stream(self, stream, src_format, is_resume):
4296
to_serializer = self.target_repo._format._serializer
4297
src_serializer = src_format._serializer
4299
if to_serializer == src_serializer:
4300
# If serializers match and the target is a pack repository, set the
4301
# write cache size on the new pack. This avoids poor performance
4302
# on transports where append is unbuffered (such as
4303
# RemoteTransport). This is safe to do because nothing should read
4304
# back from the target repository while a stream with matching
4305
# serialization is being inserted.
4306
# The exception is that a delta record from the source that should
4307
# be a fulltext may need to be expanded by the target (see
4308
# test_fetch_revisions_with_deltas_into_pack); but we take care to
4309
# explicitly flush any buffered writes first in that rare case.
4311
new_pack = self.target_repo._pack_collection._new_pack
4312
except AttributeError:
4313
# Not a pack repository
4316
new_pack.set_write_cache_size(1024*1024)
4317
for substream_type, substream in stream:
4318
if 'stream' in debug.debug_flags:
4319
mutter('inserting substream: %s', substream_type)
4320
if substream_type == 'texts':
4321
self.target_repo.texts.insert_record_stream(substream)
4322
elif substream_type == 'inventories':
4323
if src_serializer == to_serializer:
4324
self.target_repo.inventories.insert_record_stream(
4327
self._extract_and_insert_inventories(
4328
substream, src_serializer)
4329
elif substream_type == 'inventory-deltas':
4330
self._extract_and_insert_inventory_deltas(
4331
substream, src_serializer)
4332
elif substream_type == 'chk_bytes':
4333
# XXX: This doesn't support conversions, as it assumes the
4334
# conversion was done in the fetch code.
4335
self.target_repo.chk_bytes.insert_record_stream(substream)
4336
elif substream_type == 'revisions':
4337
# This may fallback to extract-and-insert more often than
4338
# required if the serializers are different only in terms of
4340
if src_serializer == to_serializer:
4341
self.target_repo.revisions.insert_record_stream(substream)
4343
self._extract_and_insert_revisions(substream,
4345
elif substream_type == 'signatures':
4346
self.target_repo.signatures.insert_record_stream(substream)
4348
raise AssertionError('kaboom! %s' % (substream_type,))
4349
# Done inserting data, and the missing_keys calculations will try to
4350
# read back from the inserted data, so flush the writes to the new pack
4351
# (if this is pack format).
4352
if new_pack is not None:
4353
new_pack._write_data('', flush=True)
4354
# Find all the new revisions (including ones from resume_tokens)
4355
missing_keys = self.target_repo.get_missing_parent_inventories(
4356
check_for_missing_texts=is_resume)
4358
for prefix, versioned_file in (
4359
('texts', self.target_repo.texts),
4360
('inventories', self.target_repo.inventories),
4361
('revisions', self.target_repo.revisions),
4362
('signatures', self.target_repo.signatures),
4363
('chk_bytes', self.target_repo.chk_bytes),
4365
if versioned_file is None:
4367
# TODO: key is often going to be a StaticTuple object
4368
# I don't believe we can define a method by which
4369
# (prefix,) + StaticTuple will work, though we could
4370
# define a StaticTuple.sq_concat that would allow you to
4371
# pass in either a tuple or a StaticTuple as the second
4372
# object, so instead we could have:
4373
# StaticTuple(prefix) + key here...
4374
missing_keys.update((prefix,) + key for key in
4375
versioned_file.get_missing_compression_parent_keys())
4376
except NotImplementedError:
4377
# cannot even attempt suspending, and missing would have failed
4378
# during stream insertion.
4379
missing_keys = set()
4382
# suspend the write group and tell the caller what we is
4383
# missing. We know we can suspend or else we would not have
4384
# entered this code path. (All repositories that can handle
4385
# missing keys can handle suspending a write group).
4386
write_group_tokens = self.target_repo.suspend_write_group()
4387
return write_group_tokens, missing_keys
4388
hint = self.target_repo.commit_write_group()
4389
if (to_serializer != src_serializer and
4390
self.target_repo._format.pack_compresses):
4391
self.target_repo.pack(hint=hint)
4394
def _extract_and_insert_inventory_deltas(self, substream, serializer):
4395
target_rich_root = self.target_repo._format.rich_root_data
4396
target_tree_refs = self.target_repo._format.supports_tree_reference
4397
for record in substream:
4398
# Insert the delta directly
4399
inventory_delta_bytes = record.get_bytes_as('fulltext')
4400
deserialiser = inventory_delta.InventoryDeltaDeserializer()
4402
parse_result = deserialiser.parse_text_bytes(
4403
inventory_delta_bytes)
4404
except inventory_delta.IncompatibleInventoryDelta, err:
4405
trace.mutter("Incompatible delta: %s", err.msg)
4406
raise errors.IncompatibleRevision(self.target_repo._format)
4407
basis_id, new_id, rich_root, tree_refs, inv_delta = parse_result
4408
revision_id = new_id
4409
parents = [key[0] for key in record.parents]
4410
self.target_repo.add_inventory_by_delta(
4411
basis_id, inv_delta, revision_id, parents)
4413
def _extract_and_insert_inventories(self, substream, serializer,
4415
"""Generate a new inventory versionedfile in target, converting data.
4417
The inventory is retrieved from the source, (deserializing it), and
4418
stored in the target (reserializing it in a different format).
4420
target_rich_root = self.target_repo._format.rich_root_data
4421
target_tree_refs = self.target_repo._format.supports_tree_reference
4422
for record in substream:
4423
# It's not a delta, so it must be a fulltext in the source
4424
# serializer's format.
4425
bytes = record.get_bytes_as('fulltext')
4426
revision_id = record.key[0]
4427
inv = serializer.read_inventory_from_string(bytes, revision_id)
4428
parents = [key[0] for key in record.parents]
4429
self.target_repo.add_inventory(revision_id, inv, parents)
4430
# No need to keep holding this full inv in memory when the rest of
4431
# the substream is likely to be all deltas.
4434
def _extract_and_insert_revisions(self, substream, serializer):
4435
for record in substream:
4436
bytes = record.get_bytes_as('fulltext')
4437
revision_id = record.key[0]
4438
rev = serializer.read_revision_from_string(bytes)
4439
if rev.revision_id != revision_id:
4440
raise AssertionError('wtf: %s != %s' % (rev, revision_id))
4441
self.target_repo.add_revision(revision_id, rev)
4444
if self.target_repo._format._fetch_reconcile:
4445
self.target_repo.reconcile()
4448
class StreamSource(object):
4449
"""A source of a stream for fetching between repositories."""
4451
def __init__(self, from_repository, to_format):
4452
"""Create a StreamSource streaming from from_repository."""
4453
self.from_repository = from_repository
4454
self.to_format = to_format
4455
self._record_counter = RecordCounter()
4457
def delta_on_metadata(self):
4458
"""Return True if delta's are permitted on metadata streams.
4460
That is on revisions and signatures.
4462
src_serializer = self.from_repository._format._serializer
4463
target_serializer = self.to_format._serializer
4464
return (self.to_format._fetch_uses_deltas and
4465
src_serializer == target_serializer)
4467
def _fetch_revision_texts(self, revs):
4468
# fetch signatures first and then the revision texts
4469
# may need to be a InterRevisionStore call here.
4470
from_sf = self.from_repository.signatures
4471
# A missing signature is just skipped.
4472
keys = [(rev_id,) for rev_id in revs]
4473
signatures = versionedfile.filter_absent(from_sf.get_record_stream(
4475
self.to_format._fetch_order,
4476
not self.to_format._fetch_uses_deltas))
4477
# If a revision has a delta, this is actually expanded inside the
4478
# insert_record_stream code now, which is an alternate fix for
4480
from_rf = self.from_repository.revisions
4481
revisions = from_rf.get_record_stream(
4483
self.to_format._fetch_order,
4484
not self.delta_on_metadata())
4485
return [('signatures', signatures), ('revisions', revisions)]
4487
def _generate_root_texts(self, revs):
4488
"""This will be called by get_stream between fetching weave texts and
4489
fetching the inventory weave.
4491
if self._rich_root_upgrade():
4492
return _mod_fetch.Inter1and2Helper(
4493
self.from_repository).generate_root_texts(revs)
4497
def get_stream(self, search):
4499
revs = search.get_keys()
4500
graph = self.from_repository.get_graph()
4501
revs = tsort.topo_sort(graph.get_parent_map(revs))
4502
data_to_fetch = self.from_repository.item_keys_introduced_by(revs)
4504
for knit_kind, file_id, revisions in data_to_fetch:
4505
if knit_kind != phase:
4507
# Make a new progress bar for this phase
4508
if knit_kind == "file":
4509
# Accumulate file texts
4510
text_keys.extend([(file_id, revision) for revision in
4512
elif knit_kind == "inventory":
4513
# Now copy the file texts.
4514
from_texts = self.from_repository.texts
4515
yield ('texts', from_texts.get_record_stream(
4516
text_keys, self.to_format._fetch_order,
4517
not self.to_format._fetch_uses_deltas))
4518
# Cause an error if a text occurs after we have done the
4521
# Before we process the inventory we generate the root
4522
# texts (if necessary) so that the inventories references
4524
for _ in self._generate_root_texts(revs):
4526
# we fetch only the referenced inventories because we do not
4527
# know for unselected inventories whether all their required
4528
# texts are present in the other repository - it could be
4530
for info in self._get_inventory_stream(revs):
4532
elif knit_kind == "signatures":
4533
# Nothing to do here; this will be taken care of when
4534
# _fetch_revision_texts happens.
4536
elif knit_kind == "revisions":
4537
for record in self._fetch_revision_texts(revs):
4540
raise AssertionError("Unknown knit kind %r" % knit_kind)
4542
def get_stream_for_missing_keys(self, missing_keys):
4543
# missing keys can only occur when we are byte copying and not
4544
# translating (because translation means we don't send
4545
# unreconstructable deltas ever).
4547
keys['texts'] = set()
4548
keys['revisions'] = set()
4549
keys['inventories'] = set()
4550
keys['chk_bytes'] = set()
4551
keys['signatures'] = set()
4552
for key in missing_keys:
4553
keys[key[0]].add(key[1:])
4554
if len(keys['revisions']):
4555
# If we allowed copying revisions at this point, we could end up
4556
# copying a revision without copying its required texts: a
4557
# violation of the requirements for repository integrity.
4558
raise AssertionError(
4559
'cannot copy revisions to fill in missing deltas %s' % (
4560
keys['revisions'],))
4561
for substream_kind, keys in keys.iteritems():
4562
vf = getattr(self.from_repository, substream_kind)
4563
if vf is None and keys:
4564
raise AssertionError(
4565
"cannot fill in keys for a versioned file we don't"
4566
" have: %s needs %s" % (substream_kind, keys))
4568
# No need to stream something we don't have
4570
if substream_kind == 'inventories':
4571
# Some missing keys are genuinely ghosts, filter those out.
4572
present = self.from_repository.inventories.get_parent_map(keys)
4573
revs = [key[0] for key in present]
4574
# Get the inventory stream more-or-less as we do for the
4575
# original stream; there's no reason to assume that records
4576
# direct from the source will be suitable for the sink. (Think
4577
# e.g. 2a -> 1.9-rich-root).
4578
for info in self._get_inventory_stream(revs, missing=True):
4582
# Ask for full texts always so that we don't need more round trips
4583
# after this stream.
4584
# Some of the missing keys are genuinely ghosts, so filter absent
4585
# records. The Sink is responsible for doing another check to
4586
# ensure that ghosts don't introduce missing data for future
4588
stream = versionedfile.filter_absent(vf.get_record_stream(keys,
4589
self.to_format._fetch_order, True))
4590
yield substream_kind, stream
4592
def inventory_fetch_order(self):
4593
if self._rich_root_upgrade():
4594
return 'topological'
4596
return self.to_format._fetch_order
4598
def _rich_root_upgrade(self):
4599
return (not self.from_repository._format.rich_root_data and
4600
self.to_format.rich_root_data)
4602
def _get_inventory_stream(self, revision_ids, missing=False):
4603
from_format = self.from_repository._format
4604
if (from_format.supports_chks and self.to_format.supports_chks and
4605
from_format.network_name() == self.to_format.network_name()):
4606
raise AssertionError(
4607
"this case should be handled by GroupCHKStreamSource")
4608
elif 'forceinvdeltas' in debug.debug_flags:
4609
return self._get_convertable_inventory_stream(revision_ids,
4610
delta_versus_null=missing)
4611
elif from_format.network_name() == self.to_format.network_name():
4613
return self._get_simple_inventory_stream(revision_ids,
4615
elif (not from_format.supports_chks and not self.to_format.supports_chks
4616
and from_format._serializer == self.to_format._serializer):
4617
# Essentially the same format.
4618
return self._get_simple_inventory_stream(revision_ids,
4621
# Any time we switch serializations, we want to use an
4622
# inventory-delta based approach.
4623
return self._get_convertable_inventory_stream(revision_ids,
4624
delta_versus_null=missing)
4626
def _get_simple_inventory_stream(self, revision_ids, missing=False):
4627
# NB: This currently reopens the inventory weave in source;
4628
# using a single stream interface instead would avoid this.
4629
from_weave = self.from_repository.inventories
4631
delta_closure = True
4633
delta_closure = not self.delta_on_metadata()
4634
yield ('inventories', from_weave.get_record_stream(
4635
[(rev_id,) for rev_id in revision_ids],
4636
self.inventory_fetch_order(), delta_closure))
4638
def _get_convertable_inventory_stream(self, revision_ids,
4639
delta_versus_null=False):
4640
# The two formats are sufficiently different that there is no fast
4641
# path, so we need to send just inventorydeltas, which any
4642
# sufficiently modern client can insert into any repository.
4643
# The StreamSink code expects to be able to
4644
# convert on the target, so we need to put bytes-on-the-wire that can
4645
# be converted. That means inventory deltas (if the remote is <1.19,
4646
# RemoteStreamSink will fallback to VFS to insert the deltas).
4647
yield ('inventory-deltas',
4648
self._stream_invs_as_deltas(revision_ids,
4649
delta_versus_null=delta_versus_null))
4651
def _stream_invs_as_deltas(self, revision_ids, delta_versus_null=False):
4652
"""Return a stream of inventory-deltas for the given rev ids.
4654
:param revision_ids: The list of inventories to transmit
4655
:param delta_versus_null: Don't try to find a minimal delta for this
4656
entry, instead compute the delta versus the NULL_REVISION. This
4657
effectively streams a complete inventory. Used for stuff like
4658
filling in missing parents, etc.
4660
from_repo = self.from_repository
4661
revision_keys = [(rev_id,) for rev_id in revision_ids]
4662
parent_map = from_repo.inventories.get_parent_map(revision_keys)
4663
# XXX: possibly repos could implement a more efficient iter_inv_deltas
4665
inventories = self.from_repository.iter_inventories(
4666
revision_ids, 'topological')
4667
format = from_repo._format
4668
invs_sent_so_far = set([_mod_revision.NULL_REVISION])
4669
inventory_cache = lru_cache.LRUCache(50)
4670
null_inventory = from_repo.revision_tree(
4671
_mod_revision.NULL_REVISION).inventory
4672
# XXX: ideally the rich-root/tree-refs flags would be per-revision, not
4673
# per-repo (e.g. streaming a non-rich-root revision out of a rich-root
4674
# repo back into a non-rich-root repo ought to be allowed)
4675
serializer = inventory_delta.InventoryDeltaSerializer(
4676
versioned_root=format.rich_root_data,
4677
tree_references=format.supports_tree_reference)
4678
for inv in inventories:
4679
key = (inv.revision_id,)
4680
parent_keys = parent_map.get(key, ())
4682
if not delta_versus_null and parent_keys:
4683
# The caller did not ask for complete inventories and we have
4684
# some parents that we can delta against. Make a delta against
4685
# each parent so that we can find the smallest.
4686
parent_ids = [parent_key[0] for parent_key in parent_keys]
4687
for parent_id in parent_ids:
4688
if parent_id not in invs_sent_so_far:
4689
# We don't know that the remote side has this basis, so
4692
if parent_id == _mod_revision.NULL_REVISION:
4693
parent_inv = null_inventory
4695
parent_inv = inventory_cache.get(parent_id, None)
4696
if parent_inv is None:
4697
parent_inv = from_repo.get_inventory(parent_id)
4698
candidate_delta = inv._make_delta(parent_inv)
4699
if (delta is None or
4700
len(delta) > len(candidate_delta)):
4701
delta = candidate_delta
4702
basis_id = parent_id
4704
# Either none of the parents ended up being suitable, or we
4705
# were asked to delta against NULL
4706
basis_id = _mod_revision.NULL_REVISION
4707
delta = inv._make_delta(null_inventory)
4708
invs_sent_so_far.add(inv.revision_id)
4709
inventory_cache[inv.revision_id] = inv
4710
delta_serialized = ''.join(
4711
serializer.delta_to_lines(basis_id, key[-1], delta))
4712
yield versionedfile.FulltextContentFactory(
4713
key, parent_keys, None, delta_serialized)
4716
def _iter_for_revno(repo, partial_history_cache, stop_index=None,
4717
stop_revision=None):
4718
"""Extend the partial history to include a given index
4720
If a stop_index is supplied, stop when that index has been reached.
4721
If a stop_revision is supplied, stop when that revision is
4722
encountered. Otherwise, stop when the beginning of history is
4725
:param stop_index: The index which should be present. When it is
4726
present, history extension will stop.
4727
:param stop_revision: The revision id which should be present. When
4728
it is encountered, history extension will stop.
4730
start_revision = partial_history_cache[-1]
4731
iterator = repo.iter_reverse_revision_history(start_revision)
4733
#skip the last revision in the list
4736
if (stop_index is not None and
4737
len(partial_history_cache) > stop_index):
4739
if partial_history_cache[-1] == stop_revision:
4741
revision_id = iterator.next()
4742
partial_history_cache.append(revision_id)
4743
except StopIteration:
added
removed
bzrlib/repository.py
