16
16
# You should have received a copy of the GNU General Public License
17
17
# along with this program; if not, write to the Free Software
18
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20
20
"""Versioned text file storage api."""
23
from copy import deepcopy
24
from unittest import TestSuite
27
import bzrlib.errors as errors
23
from cStringIO import StringIO
26
from zlib import adler32
28
from bzrlib.lazy_import import lazy_import
29
lazy_import(globals(), """
45
from bzrlib.graph import DictParentsProvider, Graph, StackedParentsProvider
46
from bzrlib.transport.memory import MemoryTransport
28
48
from bzrlib.inter import InterObject
49
from bzrlib.registry import Registry
50
from bzrlib.symbol_versioning import *
29
51
from bzrlib.textmerge import TextMerge
30
from bzrlib.transport.memory import MemoryTransport
31
from bzrlib.tsort import topo_sort
33
from bzrlib.symbol_versioning import (deprecated_function,
52
from bzrlib import bencode
55
adapter_registry = Registry()
56
adapter_registry.register_lazy(('knit-delta-gz', 'fulltext'), 'bzrlib.knit',
57
'DeltaPlainToFullText')
58
adapter_registry.register_lazy(('knit-ft-gz', 'fulltext'), 'bzrlib.knit',
60
adapter_registry.register_lazy(('knit-annotated-delta-gz', 'knit-delta-gz'),
61
'bzrlib.knit', 'DeltaAnnotatedToUnannotated')
62
adapter_registry.register_lazy(('knit-annotated-delta-gz', 'fulltext'),
63
'bzrlib.knit', 'DeltaAnnotatedToFullText')
64
adapter_registry.register_lazy(('knit-annotated-ft-gz', 'knit-ft-gz'),
65
'bzrlib.knit', 'FTAnnotatedToUnannotated')
66
adapter_registry.register_lazy(('knit-annotated-ft-gz', 'fulltext'),
67
'bzrlib.knit', 'FTAnnotatedToFullText')
68
# adapter_registry.register_lazy(('knit-annotated-ft-gz', 'chunked'),
69
# 'bzrlib.knit', 'FTAnnotatedToChunked')
72
class ContentFactory(object):
73
"""Abstract interface for insertion and retrieval from a VersionedFile.
75
:ivar sha1: None, or the sha1 of the content fulltext.
76
:ivar storage_kind: The native storage kind of this factory. One of
77
'mpdiff', 'knit-annotated-ft', 'knit-annotated-delta', 'knit-ft',
78
'knit-delta', 'fulltext', 'knit-annotated-ft-gz',
79
'knit-annotated-delta-gz', 'knit-ft-gz', 'knit-delta-gz'.
80
:ivar key: The key of this content. Each key is a tuple with a single
82
:ivar parents: A tuple of parent keys for self.key. If the object has
83
no parent information, None (as opposed to () for an empty list of
88
"""Create a ContentFactory."""
90
self.storage_kind = None
95
class ChunkedContentFactory(ContentFactory):
96
"""Static data content factory.
98
This takes a 'chunked' list of strings. The only requirement on 'chunked' is
99
that ''.join(lines) becomes a valid fulltext. A tuple of a single string
100
satisfies this, as does a list of lines.
102
:ivar sha1: None, or the sha1 of the content fulltext.
103
:ivar storage_kind: The native storage kind of this factory. Always
105
:ivar key: The key of this content. Each key is a tuple with a single
107
:ivar parents: A tuple of parent keys for self.key. If the object has
108
no parent information, None (as opposed to () for an empty list of
112
def __init__(self, key, parents, sha1, chunks):
113
"""Create a ContentFactory."""
115
self.storage_kind = 'chunked'
117
self.parents = parents
118
self._chunks = chunks
120
def get_bytes_as(self, storage_kind):
121
if storage_kind == 'chunked':
123
elif storage_kind == 'fulltext':
124
return ''.join(self._chunks)
125
raise errors.UnavailableRepresentation(self.key, storage_kind,
129
class FulltextContentFactory(ContentFactory):
130
"""Static data content factory.
132
This takes a fulltext when created and just returns that during
133
get_bytes_as('fulltext').
135
:ivar sha1: None, or the sha1 of the content fulltext.
136
:ivar storage_kind: The native storage kind of this factory. Always
138
:ivar key: The key of this content. Each key is a tuple with a single
140
:ivar parents: A tuple of parent keys for self.key. If the object has
141
no parent information, None (as opposed to () for an empty list of
145
def __init__(self, key, parents, sha1, text):
146
"""Create a ContentFactory."""
148
self.storage_kind = 'fulltext'
150
self.parents = parents
153
def get_bytes_as(self, storage_kind):
154
if storage_kind == self.storage_kind:
156
elif storage_kind == 'chunked':
158
raise errors.UnavailableRepresentation(self.key, storage_kind,
162
class AbsentContentFactory(ContentFactory):
163
"""A placeholder content factory for unavailable texts.
166
:ivar storage_kind: 'absent'.
167
:ivar key: The key of this content. Each key is a tuple with a single
172
def __init__(self, key):
173
"""Create a ContentFactory."""
175
self.storage_kind = 'absent'
179
def get_bytes_as(self, storage_kind):
180
raise ValueError('A request was made for key: %s, but that'
181
' content is not available, and the calling'
182
' code does not handle if it is missing.'
186
class AdapterFactory(ContentFactory):
187
"""A content factory to adapt between key prefix's."""
189
def __init__(self, key, parents, adapted):
190
"""Create an adapter factory instance."""
192
self.parents = parents
193
self._adapted = adapted
195
def __getattr__(self, attr):
196
"""Return a member from the adapted object."""
197
if attr in ('key', 'parents'):
198
return self.__dict__[attr]
200
return getattr(self._adapted, attr)
203
def filter_absent(record_stream):
204
"""Adapt a record stream to remove absent records."""
205
for record in record_stream:
206
if record.storage_kind != 'absent':
39
210
class VersionedFile(object):
40
211
"""Versioned text file storage.
42
213
A versioned file manages versions of line-based text files,
43
214
keeping track of the originating version for each line.
166
340
if '\n' in line[:-1]:
167
341
raise errors.BzrBadParameterContainsNewline("lines")
169
def _check_write_ok(self):
170
"""Is the versioned file marked as 'finished' ? Raise if it is."""
172
raise errors.OutSideTransaction()
173
if self._access_mode != 'w':
174
raise errors.ReadOnlyObjectDirtiedError(self)
176
def enable_cache(self):
177
"""Tell this versioned file that it should cache any data it reads.
179
This is advisory, implementations do not have to support caching.
183
def clear_cache(self):
184
"""Remove any data cached in the versioned file object.
186
This only needs to be supported if caches are supported
190
def clone_text(self, new_version_id, old_version_id, parents):
191
"""Add an identical text to old_version_id as new_version_id.
193
Must raise RevisionNotPresent if the old version or any of the
194
parents are not present in file history.
196
Must raise RevisionAlreadyPresent if the new version is
197
already present in file history."""
198
self._check_write_ok()
199
return self._clone_text(new_version_id, old_version_id, parents)
201
def _clone_text(self, new_version_id, old_version_id, parents):
202
"""Helper function to do the _clone_text work."""
203
raise NotImplementedError(self.clone_text)
205
def create_empty(self, name, transport, mode=None):
206
"""Create a new versioned file of this exact type.
208
:param name: the file name
209
:param transport: the transport
210
:param mode: optional file mode.
212
raise NotImplementedError(self.create_empty)
214
def fix_parents(self, version, new_parents):
215
"""Fix the parents list for version.
217
This is done by appending a new version to the index
218
with identical data except for the parents list.
219
the parents list must be a superset of the current
222
self._check_write_ok()
223
return self._fix_parents(version, new_parents)
225
def _fix_parents(self, version, new_parents):
226
"""Helper for fix_parents."""
227
raise NotImplementedError(self.fix_parents)
229
def get_delta(self, version):
230
"""Get a delta for constructing version from some other version.
232
:return: (delta_parent, sha1, noeol, delta)
233
Where delta_parent is a version id or None to indicate no parent.
235
raise NotImplementedError(self.get_delta)
237
def get_deltas(self, versions):
238
"""Get multiple deltas at once for constructing versions.
240
:return: dict(version_id:(delta_parent, sha1, noeol, delta))
241
Where delta_parent is a version id or None to indicate no parent, and
242
version_id is the version_id created by that delta.
245
for version in versions:
246
result[version] = self.get_delta(version)
249
def get_sha1(self, version_id):
250
"""Get the stored sha1 sum for the given revision.
252
:param name: The name of the version to lookup
254
raise NotImplementedError(self.get_sha1)
256
def get_suffixes(self):
257
"""Return the file suffixes associated with this versioned file."""
258
raise NotImplementedError(self.get_suffixes)
343
def get_format_signature(self):
344
"""Get a text description of the data encoding in this file.
348
raise NotImplementedError(self.get_format_signature)
350
def make_mpdiffs(self, version_ids):
351
"""Create multiparent diffs for specified versions."""
352
knit_versions = set()
353
knit_versions.update(version_ids)
354
parent_map = self.get_parent_map(version_ids)
355
for version_id in version_ids:
357
knit_versions.update(parent_map[version_id])
359
raise errors.RevisionNotPresent(version_id, self)
360
# We need to filter out ghosts, because we can't diff against them.
361
knit_versions = set(self.get_parent_map(knit_versions).keys())
362
lines = dict(zip(knit_versions,
363
self._get_lf_split_line_list(knit_versions)))
365
for version_id in version_ids:
366
target = lines[version_id]
368
parents = [lines[p] for p in parent_map[version_id] if p in
371
# I don't know how this could ever trigger.
372
# parent_map[version_id] was already triggered in the previous
373
# for loop, and lines[p] has the 'if p in knit_versions' check,
374
# so we again won't have a KeyError.
375
raise errors.RevisionNotPresent(version_id, self)
377
left_parent_blocks = self._extract_blocks(version_id,
380
left_parent_blocks = None
381
diffs.append(multiparent.MultiParent.from_lines(target, parents,
385
def _extract_blocks(self, version_id, source, target):
388
def add_mpdiffs(self, records):
389
"""Add mpdiffs to this VersionedFile.
391
Records should be iterables of version, parents, expected_sha1,
392
mpdiff. mpdiff should be a MultiParent instance.
394
# Does this need to call self._check_write_ok()? (IanC 20070919)
396
mpvf = multiparent.MultiMemoryVersionedFile()
398
for version, parent_ids, expected_sha1, mpdiff in records:
399
versions.append(version)
400
mpvf.add_diff(mpdiff, version, parent_ids)
401
needed_parents = set()
402
for version, parent_ids, expected_sha1, mpdiff in records:
403
needed_parents.update(p for p in parent_ids
404
if not mpvf.has_version(p))
405
present_parents = set(self.get_parent_map(needed_parents).keys())
406
for parent_id, lines in zip(present_parents,
407
self._get_lf_split_line_list(present_parents)):
408
mpvf.add_version(lines, parent_id, [])
409
for (version, parent_ids, expected_sha1, mpdiff), lines in\
410
zip(records, mpvf.get_line_list(versions)):
411
if len(parent_ids) == 1:
412
left_matching_blocks = list(mpdiff.get_matching_blocks(0,
413
mpvf.get_diff(parent_ids[0]).num_lines()))
415
left_matching_blocks = None
417
_, _, version_text = self.add_lines_with_ghosts(version,
418
parent_ids, lines, vf_parents,
419
left_matching_blocks=left_matching_blocks)
420
except NotImplementedError:
421
# The vf can't handle ghosts, so add lines normally, which will
422
# (reasonably) fail if there are ghosts in the data.
423
_, _, version_text = self.add_lines(version,
424
parent_ids, lines, vf_parents,
425
left_matching_blocks=left_matching_blocks)
426
vf_parents[version] = version_text
427
sha1s = self.get_sha1s(versions)
428
for version, parent_ids, expected_sha1, mpdiff in records:
429
if expected_sha1 != sha1s[version]:
430
raise errors.VersionedFileInvalidChecksum(version)
260
432
def get_text(self, version_id):
261
433
"""Return version contents as a text string.
462
550
unchanged Alive in both a and b (possibly created in both)
463
551
new-a Created in a
464
552
new-b Created in b
465
ghost-a Killed in a, unborn in b
553
ghost-a Killed in a, unborn in b
466
554
ghost-b Killed in b, unborn in a
467
555
irrelevant Not in either revision
469
557
raise NotImplementedError(VersionedFile.plan_merge)
471
def weave_merge(self, plan, a_marker=TextMerge.A_MARKER,
559
def weave_merge(self, plan, a_marker=TextMerge.A_MARKER,
472
560
b_marker=TextMerge.B_MARKER):
473
561
return PlanWeaveMerge(plan, a_marker, b_marker).merge_lines()[0]
564
class RecordingVersionedFilesDecorator(object):
565
"""A minimal versioned files that records calls made on it.
567
Only enough methods have been added to support tests using it to date.
569
:ivar calls: A list of the calls made; can be reset at any time by
573
def __init__(self, backing_vf):
574
"""Create a RecordingVersionedFilesDecorator decorating backing_vf.
576
:param backing_vf: The versioned file to answer all methods.
578
self._backing_vf = backing_vf
581
def add_lines(self, key, parents, lines, parent_texts=None,
582
left_matching_blocks=None, nostore_sha=None, random_id=False,
584
self.calls.append(("add_lines", key, parents, lines, parent_texts,
585
left_matching_blocks, nostore_sha, random_id, check_content))
586
return self._backing_vf.add_lines(key, parents, lines, parent_texts,
587
left_matching_blocks, nostore_sha, random_id, check_content)
590
self._backing_vf.check()
592
def get_parent_map(self, keys):
593
self.calls.append(("get_parent_map", copy(keys)))
594
return self._backing_vf.get_parent_map(keys)
596
def get_record_stream(self, keys, sort_order, include_delta_closure):
597
self.calls.append(("get_record_stream", list(keys), sort_order,
598
include_delta_closure))
599
return self._backing_vf.get_record_stream(keys, sort_order,
600
include_delta_closure)
602
def get_sha1s(self, keys):
603
self.calls.append(("get_sha1s", copy(keys)))
604
return self._backing_vf.get_sha1s(keys)
606
def iter_lines_added_or_present_in_keys(self, keys, pb=None):
607
self.calls.append(("iter_lines_added_or_present_in_keys", copy(keys)))
608
return self._backing_vf.iter_lines_added_or_present_in_keys(keys, pb=pb)
611
self.calls.append(("keys",))
612
return self._backing_vf.keys()
615
class OrderingVersionedFilesDecorator(RecordingVersionedFilesDecorator):
616
"""A VF that records calls, and returns keys in specific order.
618
:ivar calls: A list of the calls made; can be reset at any time by
622
def __init__(self, backing_vf, key_priority):
623
"""Create a RecordingVersionedFilesDecorator decorating backing_vf.
625
:param backing_vf: The versioned file to answer all methods.
626
:param key_priority: A dictionary defining what order keys should be
627
returned from an 'unordered' get_record_stream request.
628
Keys with lower priority are returned first, keys not present in
629
the map get an implicit priority of 0, and are returned in
630
lexicographical order.
632
RecordingVersionedFilesDecorator.__init__(self, backing_vf)
633
self._key_priority = key_priority
635
def get_record_stream(self, keys, sort_order, include_delta_closure):
636
self.calls.append(("get_record_stream", list(keys), sort_order,
637
include_delta_closure))
638
if sort_order == 'unordered':
640
return (self._key_priority.get(key, 0), key)
641
# Use a defined order by asking for the keys one-by-one from the
643
for key in sorted(keys, key=sort_key):
644
for record in self._backing_vf.get_record_stream([key],
645
'unordered', include_delta_closure):
648
for record in self._backing_vf.get_record_stream(keys, sort_order,
649
include_delta_closure):
653
class KeyMapper(object):
654
"""KeyMappers map between keys and underlying partitioned storage."""
657
"""Map key to an underlying storage identifier.
659
:param key: A key tuple e.g. ('file-id', 'revision-id').
660
:return: An underlying storage identifier, specific to the partitioning
663
raise NotImplementedError(self.map)
665
def unmap(self, partition_id):
666
"""Map a partitioned storage id back to a key prefix.
668
:param partition_id: The underlying partition id.
669
:return: As much of a key (or prefix) as is derivable from the partition
672
raise NotImplementedError(self.unmap)
675
class ConstantMapper(KeyMapper):
676
"""A key mapper that maps to a constant result."""
678
def __init__(self, result):
679
"""Create a ConstantMapper which will return result for all maps."""
680
self._result = result
683
"""See KeyMapper.map()."""
687
class URLEscapeMapper(KeyMapper):
688
"""Base class for use with transport backed storage.
690
This provides a map and unmap wrapper that respectively url escape and
691
unescape their outputs and inputs.
695
"""See KeyMapper.map()."""
696
return urllib.quote(self._map(key))
698
def unmap(self, partition_id):
699
"""See KeyMapper.unmap()."""
700
return self._unmap(urllib.unquote(partition_id))
703
class PrefixMapper(URLEscapeMapper):
704
"""A key mapper that extracts the first component of a key.
706
This mapper is for use with a transport based backend.
710
"""See KeyMapper.map()."""
713
def _unmap(self, partition_id):
714
"""See KeyMapper.unmap()."""
715
return (partition_id,)
718
class HashPrefixMapper(URLEscapeMapper):
719
"""A key mapper that combines the first component of a key with a hash.
721
This mapper is for use with a transport based backend.
725
"""See KeyMapper.map()."""
726
prefix = self._escape(key[0])
727
return "%02x/%s" % (adler32(prefix) & 0xff, prefix)
729
def _escape(self, prefix):
730
"""No escaping needed here."""
733
def _unmap(self, partition_id):
734
"""See KeyMapper.unmap()."""
735
return (self._unescape(osutils.basename(partition_id)),)
737
def _unescape(self, basename):
738
"""No unescaping needed for HashPrefixMapper."""
742
class HashEscapedPrefixMapper(HashPrefixMapper):
743
"""Combines the escaped first component of a key with a hash.
745
This mapper is for use with a transport based backend.
748
_safe = "abcdefghijklmnopqrstuvwxyz0123456789-_@,."
750
def _escape(self, prefix):
751
"""Turn a key element into a filesystem safe string.
753
This is similar to a plain urllib.quote, except
754
it uses specific safe characters, so that it doesn't
755
have to translate a lot of valid file ids.
757
# @ does not get escaped. This is because it is a valid
758
# filesystem character we use all the time, and it looks
759
# a lot better than seeing %40 all the time.
760
r = [((c in self._safe) and c or ('%%%02x' % ord(c)))
764
def _unescape(self, basename):
765
"""Escaped names are easily unescaped by urlutils."""
766
return urllib.unquote(basename)
769
def make_versioned_files_factory(versioned_file_factory, mapper):
770
"""Create a ThunkedVersionedFiles factory.
772
This will create a callable which when called creates a
773
ThunkedVersionedFiles on a transport, using mapper to access individual
774
versioned files, and versioned_file_factory to create each individual file.
776
def factory(transport):
777
return ThunkedVersionedFiles(transport, versioned_file_factory, mapper,
782
class VersionedFiles(object):
783
"""Storage for many versioned files.
785
This object allows a single keyspace for accessing the history graph and
786
contents of named bytestrings.
788
Currently no implementation allows the graph of different key prefixes to
789
intersect, but the API does allow such implementations in the future.
791
The keyspace is expressed via simple tuples. Any instance of VersionedFiles
792
may have a different length key-size, but that size will be constant for
793
all texts added to or retrieved from it. For instance, bzrlib uses
794
instances with a key-size of 2 for storing user files in a repository, with
795
the first element the fileid, and the second the version of that file.
797
The use of tuples allows a single code base to support several different
798
uses with only the mapping logic changing from instance to instance.
801
def add_lines(self, key, parents, lines, parent_texts=None,
802
left_matching_blocks=None, nostore_sha=None, random_id=False,
804
"""Add a text to the store.
806
:param key: The key tuple of the text to add. If the last element is
807
None, a CHK string will be generated during the addition.
808
:param parents: The parents key tuples of the text to add.
809
:param lines: A list of lines. Each line must be a bytestring. And all
810
of them except the last must be terminated with \n and contain no
811
other \n's. The last line may either contain no \n's or a single
812
terminating \n. If the lines list does meet this constraint the add
813
routine may error or may succeed - but you will be unable to read
814
the data back accurately. (Checking the lines have been split
815
correctly is expensive and extremely unlikely to catch bugs so it
816
is not done at runtime unless check_content is True.)
817
:param parent_texts: An optional dictionary containing the opaque
818
representations of some or all of the parents of version_id to
819
allow delta optimisations. VERY IMPORTANT: the texts must be those
820
returned by add_lines or data corruption can be caused.
821
:param left_matching_blocks: a hint about which areas are common
822
between the text and its left-hand-parent. The format is
823
the SequenceMatcher.get_matching_blocks format.
824
:param nostore_sha: Raise ExistingContent and do not add the lines to
825
the versioned file if the digest of the lines matches this.
826
:param random_id: If True a random id has been selected rather than
827
an id determined by some deterministic process such as a converter
828
from a foreign VCS. When True the backend may choose not to check
829
for uniqueness of the resulting key within the versioned file, so
830
this should only be done when the result is expected to be unique
832
:param check_content: If True, the lines supplied are verified to be
833
bytestrings that are correctly formed lines.
834
:return: The text sha1, the number of bytes in the text, and an opaque
835
representation of the inserted version which can be provided
836
back to future add_lines calls in the parent_texts dictionary.
838
raise NotImplementedError(self.add_lines)
840
def _add_text(self, key, parents, text, nostore_sha=None, random_id=False):
841
"""Add a text to the store.
843
This is a private function for use by CommitBuilder.
845
:param key: The key tuple of the text to add. If the last element is
846
None, a CHK string will be generated during the addition.
847
:param parents: The parents key tuples of the text to add.
848
:param text: A string containing the text to be committed.
849
:param nostore_sha: Raise ExistingContent and do not add the lines to
850
the versioned file if the digest of the lines matches this.
851
:param random_id: If True a random id has been selected rather than
852
an id determined by some deterministic process such as a converter
853
from a foreign VCS. When True the backend may choose not to check
854
for uniqueness of the resulting key within the versioned file, so
855
this should only be done when the result is expected to be unique
857
:param check_content: If True, the lines supplied are verified to be
858
bytestrings that are correctly formed lines.
859
:return: The text sha1, the number of bytes in the text, and an opaque
860
representation of the inserted version which can be provided
861
back to future _add_text calls in the parent_texts dictionary.
863
# The default implementation just thunks over to .add_lines(),
864
# inefficient, but it works.
865
return self.add_lines(key, parents, osutils.split_lines(text),
866
nostore_sha=nostore_sha,
870
def add_mpdiffs(self, records):
871
"""Add mpdiffs to this VersionedFile.
873
Records should be iterables of version, parents, expected_sha1,
874
mpdiff. mpdiff should be a MultiParent instance.
877
mpvf = multiparent.MultiMemoryVersionedFile()
879
for version, parent_ids, expected_sha1, mpdiff in records:
880
versions.append(version)
881
mpvf.add_diff(mpdiff, version, parent_ids)
882
needed_parents = set()
883
for version, parent_ids, expected_sha1, mpdiff in records:
884
needed_parents.update(p for p in parent_ids
885
if not mpvf.has_version(p))
886
# It seems likely that adding all the present parents as fulltexts can
887
# easily exhaust memory.
888
chunks_to_lines = osutils.chunks_to_lines
889
for record in self.get_record_stream(needed_parents, 'unordered',
891
if record.storage_kind == 'absent':
893
mpvf.add_version(chunks_to_lines(record.get_bytes_as('chunked')),
895
for (key, parent_keys, expected_sha1, mpdiff), lines in\
896
zip(records, mpvf.get_line_list(versions)):
897
if len(parent_keys) == 1:
898
left_matching_blocks = list(mpdiff.get_matching_blocks(0,
899
mpvf.get_diff(parent_keys[0]).num_lines()))
901
left_matching_blocks = None
902
version_sha1, _, version_text = self.add_lines(key,
903
parent_keys, lines, vf_parents,
904
left_matching_blocks=left_matching_blocks)
905
if version_sha1 != expected_sha1:
906
raise errors.VersionedFileInvalidChecksum(version)
907
vf_parents[key] = version_text
909
def annotate(self, key):
910
"""Return a list of (version-key, line) tuples for the text of key.
912
:raise RevisionNotPresent: If the key is not present.
914
raise NotImplementedError(self.annotate)
916
def check(self, progress_bar=None):
917
"""Check this object for integrity.
919
:param progress_bar: A progress bar to output as the check progresses.
920
:param keys: Specific keys within the VersionedFiles to check. When
921
this parameter is not None, check() becomes a generator as per
922
get_record_stream. The difference to get_record_stream is that
923
more or deeper checks will be performed.
924
:return: None, or if keys was supplied a generator as per
927
raise NotImplementedError(self.check)
930
def check_not_reserved_id(version_id):
931
revision.check_not_reserved_id(version_id)
933
def _check_lines_not_unicode(self, lines):
934
"""Check that lines being added to a versioned file are not unicode."""
936
if line.__class__ is not str:
937
raise errors.BzrBadParameterUnicode("lines")
939
def _check_lines_are_lines(self, lines):
940
"""Check that the lines really are full lines without inline EOL."""
942
if '\n' in line[:-1]:
943
raise errors.BzrBadParameterContainsNewline("lines")
945
def get_known_graph_ancestry(self, keys):
946
"""Get a KnownGraph instance with the ancestry of keys."""
947
# most basic implementation is a loop around get_parent_map
951
this_parent_map = self.get_parent_map(pending)
952
parent_map.update(this_parent_map)
954
map(pending.update, this_parent_map.itervalues())
955
pending = pending.difference(parent_map)
956
kg = _mod_graph.KnownGraph(parent_map)
959
def get_parent_map(self, keys):
960
"""Get a map of the parents of keys.
962
:param keys: The keys to look up parents for.
963
:return: A mapping from keys to parents. Absent keys are absent from
966
raise NotImplementedError(self.get_parent_map)
968
def get_record_stream(self, keys, ordering, include_delta_closure):
969
"""Get a stream of records for keys.
971
:param keys: The keys to include.
972
:param ordering: Either 'unordered' or 'topological'. A topologically
973
sorted stream has compression parents strictly before their
975
:param include_delta_closure: If True then the closure across any
976
compression parents will be included (in the opaque data).
977
:return: An iterator of ContentFactory objects, each of which is only
978
valid until the iterator is advanced.
980
raise NotImplementedError(self.get_record_stream)
982
def get_sha1s(self, keys):
983
"""Get the sha1's of the texts for the given keys.
985
:param keys: The names of the keys to lookup
986
:return: a dict from key to sha1 digest. Keys of texts which are not
987
present in the store are not present in the returned
990
raise NotImplementedError(self.get_sha1s)
992
has_key = index._has_key_from_parent_map
994
def get_missing_compression_parent_keys(self):
995
"""Return an iterable of keys of missing compression parents.
997
Check this after calling insert_record_stream to find out if there are
998
any missing compression parents. If there are, the records that
999
depend on them are not able to be inserted safely. The precise
1000
behaviour depends on the concrete VersionedFiles class in use.
1002
Classes that do not support this will raise NotImplementedError.
1004
raise NotImplementedError(self.get_missing_compression_parent_keys)
1006
def insert_record_stream(self, stream):
1007
"""Insert a record stream into this container.
1009
:param stream: A stream of records to insert.
1011
:seealso VersionedFile.get_record_stream:
1013
raise NotImplementedError
1015
def iter_lines_added_or_present_in_keys(self, keys, pb=None):
1016
"""Iterate over the lines in the versioned files from keys.
1018
This may return lines from other keys. Each item the returned
1019
iterator yields is a tuple of a line and a text version that that line
1020
is present in (not introduced in).
1022
Ordering of results is in whatever order is most suitable for the
1023
underlying storage format.
1025
If a progress bar is supplied, it may be used to indicate progress.
1026
The caller is responsible for cleaning up progress bars (because this
1030
* Lines are normalised by the underlying store: they will all have \n
1032
* Lines are returned in arbitrary order.
1034
:return: An iterator over (line, key).
1036
raise NotImplementedError(self.iter_lines_added_or_present_in_keys)
1039
"""Return a iterable of the keys for all the contained texts."""
1040
raise NotImplementedError(self.keys)
1042
def make_mpdiffs(self, keys):
1043
"""Create multiparent diffs for specified keys."""
1044
keys_order = tuple(keys)
1045
keys = frozenset(keys)
1046
knit_keys = set(keys)
1047
parent_map = self.get_parent_map(keys)
1048
for parent_keys in parent_map.itervalues():
1050
knit_keys.update(parent_keys)
1051
missing_keys = keys - set(parent_map)
1053
raise errors.RevisionNotPresent(list(missing_keys)[0], self)
1054
# We need to filter out ghosts, because we can't diff against them.
1055
maybe_ghosts = knit_keys - keys
1056
ghosts = maybe_ghosts - set(self.get_parent_map(maybe_ghosts))
1057
knit_keys.difference_update(ghosts)
1059
chunks_to_lines = osutils.chunks_to_lines
1060
for record in self.get_record_stream(knit_keys, 'topological', True):
1061
lines[record.key] = chunks_to_lines(record.get_bytes_as('chunked'))
1062
# line_block_dict = {}
1063
# for parent, blocks in record.extract_line_blocks():
1064
# line_blocks[parent] = blocks
1065
# line_blocks[record.key] = line_block_dict
1067
for key in keys_order:
1069
parents = parent_map[key] or []
1070
# Note that filtering knit_keys can lead to a parent difference
1071
# between the creation and the application of the mpdiff.
1072
parent_lines = [lines[p] for p in parents if p in knit_keys]
1073
if len(parent_lines) > 0:
1074
left_parent_blocks = self._extract_blocks(key, parent_lines[0],
1077
left_parent_blocks = None
1078
diffs.append(multiparent.MultiParent.from_lines(target,
1079
parent_lines, left_parent_blocks))
1082
missing_keys = index._missing_keys_from_parent_map
1084
def _extract_blocks(self, version_id, source, target):
1088
class ThunkedVersionedFiles(VersionedFiles):
1089
"""Storage for many versioned files thunked onto a 'VersionedFile' class.
1091
This object allows a single keyspace for accessing the history graph and
1092
contents of named bytestrings.
1094
Currently no implementation allows the graph of different key prefixes to
1095
intersect, but the API does allow such implementations in the future.
1098
def __init__(self, transport, file_factory, mapper, is_locked):
1099
"""Create a ThunkedVersionedFiles."""
1100
self._transport = transport
1101
self._file_factory = file_factory
1102
self._mapper = mapper
1103
self._is_locked = is_locked
1105
def add_lines(self, key, parents, lines, parent_texts=None,
1106
left_matching_blocks=None, nostore_sha=None, random_id=False,
1107
check_content=True):
1108
"""See VersionedFiles.add_lines()."""
1109
path = self._mapper.map(key)
1110
version_id = key[-1]
1111
parents = [parent[-1] for parent in parents]
1112
vf = self._get_vf(path)
1115
return vf.add_lines_with_ghosts(version_id, parents, lines,
1116
parent_texts=parent_texts,
1117
left_matching_blocks=left_matching_blocks,
1118
nostore_sha=nostore_sha, random_id=random_id,
1119
check_content=check_content)
1120
except NotImplementedError:
1121
return vf.add_lines(version_id, parents, lines,
1122
parent_texts=parent_texts,
1123
left_matching_blocks=left_matching_blocks,
1124
nostore_sha=nostore_sha, random_id=random_id,
1125
check_content=check_content)
1126
except errors.NoSuchFile:
1127
# parent directory may be missing, try again.
1128
self._transport.mkdir(osutils.dirname(path))
1130
return vf.add_lines_with_ghosts(version_id, parents, lines,
1131
parent_texts=parent_texts,
1132
left_matching_blocks=left_matching_blocks,
1133
nostore_sha=nostore_sha, random_id=random_id,
1134
check_content=check_content)
1135
except NotImplementedError:
1136
return vf.add_lines(version_id, parents, lines,
1137
parent_texts=parent_texts,
1138
left_matching_blocks=left_matching_blocks,
1139
nostore_sha=nostore_sha, random_id=random_id,
1140
check_content=check_content)
1142
def annotate(self, key):
1143
"""Return a list of (version-key, line) tuples for the text of key.
1145
:raise RevisionNotPresent: If the key is not present.
1148
path = self._mapper.map(prefix)
1149
vf = self._get_vf(path)
1150
origins = vf.annotate(key[-1])
1152
for origin, line in origins:
1153
result.append((prefix + (origin,), line))
1156
def get_annotator(self):
1157
return annotate.Annotator(self)
1159
def check(self, progress_bar=None, keys=None):
1160
"""See VersionedFiles.check()."""
1161
# XXX: This is over-enthusiastic but as we only thunk for Weaves today
1162
# this is tolerable. Ideally we'd pass keys down to check() and
1163
# have the older VersiondFile interface updated too.
1164
for prefix, vf in self._iter_all_components():
1166
if keys is not None:
1167
return self.get_record_stream(keys, 'unordered', True)
1169
def get_parent_map(self, keys):
1170
"""Get a map of the parents of keys.
1172
:param keys: The keys to look up parents for.
1173
:return: A mapping from keys to parents. Absent keys are absent from
1176
prefixes = self._partition_keys(keys)
1178
for prefix, suffixes in prefixes.items():
1179
path = self._mapper.map(prefix)
1180
vf = self._get_vf(path)
1181
parent_map = vf.get_parent_map(suffixes)
1182
for key, parents in parent_map.items():
1183
result[prefix + (key,)] = tuple(
1184
prefix + (parent,) for parent in parents)
1187
def _get_vf(self, path):
1188
if not self._is_locked():
1189
raise errors.ObjectNotLocked(self)
1190
return self._file_factory(path, self._transport, create=True,
1191
get_scope=lambda:None)
1193
def _partition_keys(self, keys):
1194
"""Turn keys into a dict of prefix:suffix_list."""
1197
prefix_keys = result.setdefault(key[:-1], [])
1198
prefix_keys.append(key[-1])
1201
def _get_all_prefixes(self):
1202
# Identify all key prefixes.
1203
# XXX: A bit hacky, needs polish.
1204
if type(self._mapper) == ConstantMapper:
1205
paths = [self._mapper.map(())]
1209
for quoted_relpath in self._transport.iter_files_recursive():
1210
path, ext = os.path.splitext(quoted_relpath)
1212
paths = list(relpaths)
1213
prefixes = [self._mapper.unmap(path) for path in paths]
1214
return zip(paths, prefixes)
1216
def get_record_stream(self, keys, ordering, include_delta_closure):
1217
"""See VersionedFiles.get_record_stream()."""
1218
# Ordering will be taken care of by each partitioned store; group keys
1221
for prefix, suffixes, vf in self._iter_keys_vf(keys):
1222
suffixes = [(suffix,) for suffix in suffixes]
1223
for record in vf.get_record_stream(suffixes, ordering,
1224
include_delta_closure):
1225
if record.parents is not None:
1226
record.parents = tuple(
1227
prefix + parent for parent in record.parents)
1228
record.key = prefix + record.key
1231
def _iter_keys_vf(self, keys):
1232
prefixes = self._partition_keys(keys)
1234
for prefix, suffixes in prefixes.items():
1235
path = self._mapper.map(prefix)
1236
vf = self._get_vf(path)
1237
yield prefix, suffixes, vf
1239
def get_sha1s(self, keys):
1240
"""See VersionedFiles.get_sha1s()."""
1242
for prefix,suffixes, vf in self._iter_keys_vf(keys):
1243
vf_sha1s = vf.get_sha1s(suffixes)
1244
for suffix, sha1 in vf_sha1s.iteritems():
1245
sha1s[prefix + (suffix,)] = sha1
1248
def insert_record_stream(self, stream):
1249
"""Insert a record stream into this container.
1251
:param stream: A stream of records to insert.
1253
:seealso VersionedFile.get_record_stream:
1255
for record in stream:
1256
prefix = record.key[:-1]
1257
key = record.key[-1:]
1258
if record.parents is not None:
1259
parents = [parent[-1:] for parent in record.parents]
1262
thunk_record = AdapterFactory(key, parents, record)
1263
path = self._mapper.map(prefix)
1264
# Note that this parses the file many times; we can do better but
1265
# as this only impacts weaves in terms of performance, it is
1267
vf = self._get_vf(path)
1268
vf.insert_record_stream([thunk_record])
1270
def iter_lines_added_or_present_in_keys(self, keys, pb=None):
1271
"""Iterate over the lines in the versioned files from keys.
1273
This may return lines from other keys. Each item the returned
1274
iterator yields is a tuple of a line and a text version that that line
1275
is present in (not introduced in).
1277
Ordering of results is in whatever order is most suitable for the
1278
underlying storage format.
1280
If a progress bar is supplied, it may be used to indicate progress.
1281
The caller is responsible for cleaning up progress bars (because this
1285
* Lines are normalised by the underlying store: they will all have \n
1287
* Lines are returned in arbitrary order.
1289
:return: An iterator over (line, key).
1291
for prefix, suffixes, vf in self._iter_keys_vf(keys):
1292
for line, version in vf.iter_lines_added_or_present_in_versions(suffixes):
1293
yield line, prefix + (version,)
1295
def _iter_all_components(self):
1296
for path, prefix in self._get_all_prefixes():
1297
yield prefix, self._get_vf(path)
1300
"""See VersionedFiles.keys()."""
1302
for prefix, vf in self._iter_all_components():
1303
for suffix in vf.versions():
1304
result.add(prefix + (suffix,))
1308
class _PlanMergeVersionedFile(VersionedFiles):
1309
"""A VersionedFile for uncommitted and committed texts.
1311
It is intended to allow merges to be planned with working tree texts.
1312
It implements only the small part of the VersionedFiles interface used by
1313
PlanMerge. It falls back to multiple versionedfiles for data not stored in
1314
_PlanMergeVersionedFile itself.
1316
:ivar: fallback_versionedfiles a list of VersionedFiles objects that can be
1317
queried for missing texts.
1320
def __init__(self, file_id):
1321
"""Create a _PlanMergeVersionedFile.
1323
:param file_id: Used with _PlanMerge code which is not yet fully
1324
tuple-keyspace aware.
1326
self._file_id = file_id
1327
# fallback locations
1328
self.fallback_versionedfiles = []
1329
# Parents for locally held keys.
1331
# line data for locally held keys.
1333
# key lookup providers
1334
self._providers = [DictParentsProvider(self._parents)]
1336
def plan_merge(self, ver_a, ver_b, base=None):
1337
"""See VersionedFile.plan_merge"""
1338
from bzrlib.merge import _PlanMerge
1340
return _PlanMerge(ver_a, ver_b, self, (self._file_id,)).plan_merge()
1341
old_plan = list(_PlanMerge(ver_a, base, self, (self._file_id,)).plan_merge())
1342
new_plan = list(_PlanMerge(ver_a, ver_b, self, (self._file_id,)).plan_merge())
1343
return _PlanMerge._subtract_plans(old_plan, new_plan)
1345
def plan_lca_merge(self, ver_a, ver_b, base=None):
1346
from bzrlib.merge import _PlanLCAMerge
1348
new_plan = _PlanLCAMerge(ver_a, ver_b, self, (self._file_id,), graph).plan_merge()
1351
old_plan = _PlanLCAMerge(ver_a, base, self, (self._file_id,), graph).plan_merge()
1352
return _PlanLCAMerge._subtract_plans(list(old_plan), list(new_plan))
1354
def add_lines(self, key, parents, lines):
1355
"""See VersionedFiles.add_lines
1357
Lines are added locally, not to fallback versionedfiles. Also, ghosts
1358
are permitted. Only reserved ids are permitted.
1360
if type(key) is not tuple:
1361
raise TypeError(key)
1362
if not revision.is_reserved_id(key[-1]):
1363
raise ValueError('Only reserved ids may be used')
1365
raise ValueError('Parents may not be None')
1367
raise ValueError('Lines may not be None')
1368
self._parents[key] = tuple(parents)
1369
self._lines[key] = lines
1371
def get_record_stream(self, keys, ordering, include_delta_closure):
1374
if key in self._lines:
1375
lines = self._lines[key]
1376
parents = self._parents[key]
1378
yield ChunkedContentFactory(key, parents, None, lines)
1379
for versionedfile in self.fallback_versionedfiles:
1380
for record in versionedfile.get_record_stream(
1381
pending, 'unordered', True):
1382
if record.storage_kind == 'absent':
1385
pending.remove(record.key)
1389
# report absent entries
1391
yield AbsentContentFactory(key)
1393
def get_parent_map(self, keys):
1394
"""See VersionedFiles.get_parent_map"""
1395
# We create a new provider because a fallback may have been added.
1396
# If we make fallbacks private we can update a stack list and avoid
1397
# object creation thrashing.
1400
if revision.NULL_REVISION in keys:
1401
keys.remove(revision.NULL_REVISION)
1402
result[revision.NULL_REVISION] = ()
1403
self._providers = self._providers[:1] + self.fallback_versionedfiles
1405
StackedParentsProvider(self._providers).get_parent_map(keys))
1406
for key, parents in result.iteritems():
1408
result[key] = (revision.NULL_REVISION,)
476
1412
class PlanWeaveMerge(TextMerge):
477
1413
"""Weave merge that takes a plan as its input.
479
1415
This exists so that VersionedFile.plan_merge is implementable.
480
1416
Most callers will want to use WeaveMerge instead.
530
1466
elif state == 'new-b':
532
1468
lines_b.append(line)
1469
elif state == 'conflicted-a':
1471
lines_a.append(line)
1472
elif state == 'conflicted-b':
1474
lines_b.append(line)
1475
elif state == 'killed-both':
1476
# This counts as a change, even though there is no associated
534
assert state in ('irrelevant', 'ghost-a', 'ghost-b',
535
'killed-base', 'killed-both'), state
1480
if state not in ('irrelevant', 'ghost-a', 'ghost-b',
1482
raise AssertionError(state)
536
1483
for struct in outstanding_struct():
540
1487
class WeaveMerge(PlanWeaveMerge):
541
"""Weave merge that takes a VersionedFile and two versions as its input"""
1488
"""Weave merge that takes a VersionedFile and two versions as its input."""
543
def __init__(self, versionedfile, ver_a, ver_b,
1490
def __init__(self, versionedfile, ver_a, ver_b,
544
1491
a_marker=PlanWeaveMerge.A_MARKER, b_marker=PlanWeaveMerge.B_MARKER):
545
1492
plan = versionedfile.plan_merge(ver_a, ver_b)
546
1493
PlanWeaveMerge.__init__(self, plan, a_marker, b_marker)
549
class InterVersionedFile(InterObject):
550
"""This class represents operations taking place between two versionedfiles..
552
Its instances have methods like join, and contain
553
references to the source and target versionedfiles these operations can be
556
Often we will provide convenience methods on 'versionedfile' which carry out
557
operations with another versionedfile - they will always forward to
558
InterVersionedFile.get(other).method_name(parameters).
562
"""The available optimised InterVersionedFile types."""
564
def join(self, pb=None, msg=None, version_ids=None, ignore_missing=False):
565
"""Integrate versions from self.source into self.target.
567
If version_ids is None all versions from source should be
568
incorporated into this versioned file.
570
Must raise RevisionNotPresent if any of the specified versions
571
are not present in the other files history unless ignore_missing is
572
supplied when they are silently skipped.
575
# - if the target is empty, just add all the versions from
576
# source to target, otherwise:
577
# - make a temporary versioned file of type target
578
# - insert the source content into it one at a time
580
if not self.target.versions():
1496
class VirtualVersionedFiles(VersionedFiles):
1497
"""Dummy implementation for VersionedFiles that uses other functions for
1498
obtaining fulltexts and parent maps.
1500
This is always on the bottom of the stack and uses string keys
1501
(rather than tuples) internally.
1504
def __init__(self, get_parent_map, get_lines):
1505
"""Create a VirtualVersionedFiles.
1507
:param get_parent_map: Same signature as Repository.get_parent_map.
1508
:param get_lines: Should return lines for specified key or None if
1511
super(VirtualVersionedFiles, self).__init__()
1512
self._get_parent_map = get_parent_map
1513
self._get_lines = get_lines
1515
def check(self, progressbar=None):
1516
"""See VersionedFiles.check.
1518
:note: Always returns True for VirtualVersionedFiles.
1522
def add_mpdiffs(self, records):
1523
"""See VersionedFiles.mpdiffs.
1525
:note: Not implemented for VirtualVersionedFiles.
1527
raise NotImplementedError(self.add_mpdiffs)
1529
def get_parent_map(self, keys):
1530
"""See VersionedFiles.get_parent_map."""
1531
return dict([((k,), tuple([(p,) for p in v]))
1532
for k,v in self._get_parent_map([k for (k,) in keys]).iteritems()])
1534
def get_sha1s(self, keys):
1535
"""See VersionedFiles.get_sha1s."""
1538
lines = self._get_lines(k)
1539
if lines is not None:
1540
if not isinstance(lines, list):
1541
raise AssertionError
1542
ret[(k,)] = osutils.sha_strings(lines)
1545
def get_record_stream(self, keys, ordering, include_delta_closure):
1546
"""See VersionedFiles.get_record_stream."""
1547
for (k,) in list(keys):
1548
lines = self._get_lines(k)
1549
if lines is not None:
1550
if not isinstance(lines, list):
1551
raise AssertionError
1552
yield ChunkedContentFactory((k,), None,
1553
sha1=osutils.sha_strings(lines),
1556
yield AbsentContentFactory((k,))
1558
def iter_lines_added_or_present_in_keys(self, keys, pb=None):
1559
"""See VersionedFile.iter_lines_added_or_present_in_versions()."""
1560
for i, (key,) in enumerate(keys):
1562
pb.update("Finding changed lines", i, len(keys))
1563
for l in self._get_lines(key):
1567
def network_bytes_to_kind_and_offset(network_bytes):
1568
"""Strip of a record kind from the front of network_bytes.
1570
:param network_bytes: The bytes of a record.
1571
:return: A tuple (storage_kind, offset_of_remaining_bytes)
1573
line_end = network_bytes.find('\n')
1574
storage_kind = network_bytes[:line_end]
1575
return storage_kind, line_end + 1
1578
class NetworkRecordStream(object):
1579
"""A record_stream which reconstitures a serialised stream."""
1581
def __init__(self, bytes_iterator):
1582
"""Create a NetworkRecordStream.
1584
:param bytes_iterator: An iterator of bytes. Each item in this
1585
iterator should have been obtained from a record_streams'
1586
record.get_bytes_as(record.storage_kind) call.
1588
self._bytes_iterator = bytes_iterator
1589
self._kind_factory = {
1590
'fulltext': fulltext_network_to_record,
1591
'groupcompress-block': groupcompress.network_block_to_records,
1592
'knit-ft-gz': knit.knit_network_to_record,
1593
'knit-delta-gz': knit.knit_network_to_record,
1594
'knit-annotated-ft-gz': knit.knit_network_to_record,
1595
'knit-annotated-delta-gz': knit.knit_network_to_record,
1596
'knit-delta-closure': knit.knit_delta_closure_to_records,
1602
:return: An iterator as per VersionedFiles.get_record_stream().
1604
for bytes in self._bytes_iterator:
1605
storage_kind, line_end = network_bytes_to_kind_and_offset(bytes)
1606
for record in self._kind_factory[storage_kind](
1607
storage_kind, bytes, line_end):
1611
def fulltext_network_to_record(kind, bytes, line_end):
1612
"""Convert a network fulltext record to record."""
1613
meta_len, = struct.unpack('!L', bytes[line_end:line_end+4])
1614
record_meta = bytes[line_end+4:line_end+4+meta_len]
1615
key, parents = bencode.bdecode_as_tuple(record_meta)
1616
if parents == 'nil':
1618
fulltext = bytes[line_end+4+meta_len:]
1619
return [FulltextContentFactory(key, parents, None, fulltext)]
1622
def _length_prefix(bytes):
1623
return struct.pack('!L', len(bytes))
1626
def record_to_fulltext_bytes(record):
1627
if record.parents is None:
1630
parents = record.parents
1631
record_meta = bencode.bencode((record.key, parents))
1632
record_content = record.get_bytes_as('fulltext')
1633
return "fulltext\n%s%s%s" % (
1634
_length_prefix(record_meta), record_meta, record_content)
1637
def sort_groupcompress(parent_map):
1638
"""Sort and group the keys in parent_map into groupcompress order.
1640
groupcompress is defined (currently) as reverse-topological order, grouped
1643
:return: A sorted-list of keys
1645
# gc-optimal ordering is approximately reverse topological,
1646
# properly grouped by file-id.
1648
for item in parent_map.iteritems():
1650
if isinstance(key, str) or len(key) == 1:
583
# Make a new target-format versioned file.
584
temp_source = self.target.create_empty("temp", MemoryTransport())
586
version_ids = self._get_source_version_ids(version_ids, ignore_missing)
587
graph = self.source.get_graph(version_ids)
588
order = topo_sort(graph.items())
589
pb = ui.ui_factory.nested_progress_bar()
592
# TODO for incremental cross-format work:
593
# make a versioned file with the following content:
594
# all revisions we have been asked to join
595
# all their ancestors that are *not* in target already.
596
# the immediate parents of the above two sets, with
597
# empty parent lists - these versions are in target already
598
# and the incorrect version data will be ignored.
599
# TODO: for all ancestors that are present in target already,
600
# check them for consistent data, this requires moving sha1 from
602
# TODO: remove parent texts when they are not relevant any more for
603
# memory pressure reduction. RBC 20060313
604
# pb.update('Converting versioned data', 0, len(order))
605
# deltas = self.source.get_deltas(order)
606
for index, version in enumerate(order):
607
pb.update('Converting versioned data', index, len(order))
608
parent_text = target.add_lines(version,
609
self.source.get_parents(version),
610
self.source.get_lines(version),
611
parent_texts=parent_texts)
612
parent_texts[version] = parent_text
613
#delta_parent, sha1, noeol, delta = deltas[version]
614
#target.add_delta(version,
615
# self.source.get_parents(version),
620
#target.get_lines(version)
622
# this should hit the native code path for target
623
if target is not self.target:
624
return self.target.join(temp_source,
632
def _get_source_version_ids(self, version_ids, ignore_missing):
633
"""Determine the version ids to be used from self.source.
635
:param version_ids: The caller-supplied version ids to check. (None
636
for all). If None is in version_ids, it is stripped.
637
:param ignore_missing: if True, remove missing ids from the version
638
list. If False, raise RevisionNotPresent on
639
a missing version id.
640
:return: A set of version ids.
642
if version_ids is None:
643
# None cannot be in source.versions
644
return set(self.source.versions())
647
return set(self.source.versions()).intersection(set(version_ids))
649
new_version_ids = set()
650
for version in version_ids:
653
if not self.source.has_version(version):
654
raise errors.RevisionNotPresent(version, str(self.source))
656
new_version_ids.add(version)
657
return new_version_ids
660
class InterVersionedFileTestProviderAdapter(object):
661
"""A tool to generate a suite testing multiple inter versioned-file classes.
663
This is done by copying the test once for each InterVersionedFile provider
664
and injecting the transport_server, transport_readonly_server,
665
versionedfile_factory and versionedfile_factory_to classes into each copy.
666
Each copy is also given a new id() to make it easy to identify.
669
def __init__(self, transport_server, transport_readonly_server, formats):
670
self._transport_server = transport_server
671
self._transport_readonly_server = transport_readonly_server
672
self._formats = formats
674
def adapt(self, test):
676
for (interversionedfile_class,
677
versionedfile_factory,
678
versionedfile_factory_to) in self._formats:
679
new_test = deepcopy(test)
680
new_test.transport_server = self._transport_server
681
new_test.transport_readonly_server = self._transport_readonly_server
682
new_test.interversionedfile_class = interversionedfile_class
683
new_test.versionedfile_factory = versionedfile_factory
684
new_test.versionedfile_factory_to = versionedfile_factory_to
685
def make_new_test_id():
686
new_id = "%s(%s)" % (new_test.id(), interversionedfile_class.__name__)
687
return lambda: new_id
688
new_test.id = make_new_test_id()
689
result.addTest(new_test)
693
def default_test_list():
694
"""Generate the default list of interversionedfile permutations to test."""
695
from bzrlib.weave import WeaveFile
696
from bzrlib.knit import KnitVersionedFile
698
# test the fallback InterVersionedFile from annotated knits to weave
699
result.append((InterVersionedFile,
702
for optimiser in InterVersionedFile._optimisers:
703
result.append((optimiser,
704
optimiser._matching_file_from_factory,
705
optimiser._matching_file_to_factory
707
# if there are specific combinations we want to use, we can add them
1655
per_prefix_map[prefix].append(item)
1657
per_prefix_map[prefix] = [item]
1660
for prefix in sorted(per_prefix_map):
1661
present_keys.extend(reversed(tsort.topo_sort(per_prefix_map[prefix])))
added
removed
bzrlib/versionedfile.py
