754
339
for start, end, c, lines in delta:
755
340
out.append('%d,%d,%d\n' % (start, end, c))
341
out.extend([text for origin, text in lines])
759
def annotate(self, knit, key):
760
annotator = _KnitAnnotator(knit)
761
return annotator.annotate_flat(key)
765
def make_file_factory(annotated, mapper):
766
"""Create a factory for creating a file based KnitVersionedFiles.
768
This is only functional enough to run interface tests, it doesn't try to
769
provide a full pack environment.
771
:param annotated: knit annotations are wanted.
772
:param mapper: The mapper from keys to paths.
774
def factory(transport):
775
index = _KndxIndex(transport, mapper, lambda:None, lambda:True, lambda:True)
776
access = _KnitKeyAccess(transport, mapper)
777
return KnitVersionedFiles(index, access, annotated=annotated)
781
def make_pack_factory(graph, delta, keylength):
782
"""Create a factory for creating a pack based VersionedFiles.
784
This is only functional enough to run interface tests, it doesn't try to
785
provide a full pack environment.
787
:param graph: Store a graph.
788
:param delta: Delta compress contents.
789
:param keylength: How long should keys be.
791
def factory(transport):
792
parents = graph or delta
798
max_delta_chain = 200
801
graph_index = _mod_index.InMemoryGraphIndex(reference_lists=ref_length,
802
key_elements=keylength)
803
stream = transport.open_write_stream('newpack')
804
writer = pack.ContainerWriter(stream.write)
806
index = _KnitGraphIndex(graph_index, lambda:True, parents=parents,
807
deltas=delta, add_callback=graph_index.add_nodes)
808
access = _DirectPackAccess({})
809
access.set_writer(writer, graph_index, (transport, 'newpack'))
810
result = KnitVersionedFiles(index, access,
811
max_delta_chain=max_delta_chain)
812
result.stream = stream
813
result.writer = writer
818
def cleanup_pack_knit(versioned_files):
819
versioned_files.stream.close()
820
versioned_files.writer.end()
823
def _get_total_build_size(self, keys, positions):
824
"""Determine the total bytes to build these keys.
826
(helper function because _KnitGraphIndex and _KndxIndex work the same, but
827
don't inherit from a common base.)
829
:param keys: Keys that we want to build
830
:param positions: dict of {key, (info, index_memo, comp_parent)} (such
831
as returned by _get_components_positions)
832
:return: Number of bytes to build those keys
834
all_build_index_memos = {}
838
for key in build_keys:
839
# This is mostly for the 'stacked' case
840
# Where we will be getting the data from a fallback
841
if key not in positions:
843
_, index_memo, compression_parent = positions[key]
844
all_build_index_memos[key] = index_memo
845
if compression_parent not in all_build_index_memos:
846
next_keys.add(compression_parent)
847
build_keys = next_keys
848
return sum([index_memo[2] for index_memo
849
in all_build_index_memos.itervalues()])
852
class KnitVersionedFiles(VersionedFiles):
853
"""Storage for many versioned files using knit compression.
855
Backend storage is managed by indices and data objects.
857
:ivar _index: A _KnitGraphIndex or similar that can describe the
858
parents, graph, compression and data location of entries in this
859
KnitVersionedFiles. Note that this is only the index for
860
*this* vfs; if there are fallbacks they must be queried separately.
863
def __init__(self, index, data_access, max_delta_chain=200,
864
annotated=False, reload_func=None):
865
"""Create a KnitVersionedFiles with index and data_access.
867
:param index: The index for the knit data.
868
:param data_access: The access object to store and retrieve knit
870
:param max_delta_chain: The maximum number of deltas to permit during
871
insertion. Set to 0 to prohibit the use of deltas.
872
:param annotated: Set to True to cause annotations to be calculated and
873
stored during insertion.
874
:param reload_func: An function that can be called if we think we need
875
to reload the pack listing and try again. See
876
'bzrlib.repofmt.pack_repo.AggregateIndex' for the signature.
345
def make_empty_knit(transport, relpath):
346
"""Construct a empty knit at the specified location."""
347
k = KnitVersionedFile(transport, relpath, 'w', KnitPlainFactory)
350
class KnitVersionedFile(VersionedFile):
351
"""Weave-like structure with faster random access.
353
A knit stores a number of texts and a summary of the relationships
354
between them. Texts are identified by a string version-id. Texts
355
are normally stored and retrieved as a series of lines, but can
356
also be passed as single strings.
358
Lines are stored with the trailing newline (if any) included, to
359
avoid special cases for files with no final newline. Lines are
360
composed of 8-bit characters, not unicode. The combination of
361
these approaches should mean any 'binary' file can be safely
362
stored and retrieved.
365
def __init__(self, relpath, transport, file_mode=None, access_mode=None,
366
factory=None, basis_knit=DEPRECATED_PARAMETER, delta=True,
367
create=False, create_parent_dir=False, delay_create=False,
368
dir_mode=None, index=None, access_method=None):
369
"""Construct a knit at location specified by relpath.
371
:param create: If not True, only open an existing knit.
372
:param create_parent_dir: If True, create the parent directory if
373
creating the file fails. (This is used for stores with
374
hash-prefixes that may not exist yet)
375
:param delay_create: The calling code is aware that the knit won't
376
actually be created until the first data is stored.
377
:param index: An index to use for the knit.
879
self._access = data_access
880
self._max_delta_chain = max_delta_chain
882
self._factory = KnitAnnotateFactory()
884
self._factory = KnitPlainFactory()
885
self._fallback_vfs = []
886
self._reload_func = reload_func
379
if deprecated_passed(basis_knit):
380
warnings.warn("KnitVersionedFile.__(): The basis_knit parameter is"
381
" deprecated as of bzr 0.9.",
382
DeprecationWarning, stacklevel=2)
383
if access_mode is None:
385
super(KnitVersionedFile, self).__init__(access_mode)
386
assert access_mode in ('r', 'w'), "invalid mode specified %r" % access_mode
387
self.transport = transport
388
self.filename = relpath
389
self.factory = factory or KnitAnnotateFactory()
390
self.writable = (access_mode == 'w')
393
self._max_delta_chain = 200
396
self._index = _KnitIndex(transport, relpath + INDEX_SUFFIX,
397
access_mode, create=create, file_mode=file_mode,
398
create_parent_dir=create_parent_dir, delay_create=delay_create,
402
if access_method is None:
403
_access = _KnitAccess(transport, relpath + DATA_SUFFIX, file_mode, dir_mode,
404
((create and not len(self)) and delay_create), create_parent_dir)
406
_access = access_method
407
if create and not len(self) and not delay_create:
409
self._data = _KnitData(_access)
888
411
def __repr__(self):
889
return "%s(%r, %r)" % (
890
self.__class__.__name__,
894
def add_fallback_versioned_files(self, a_versioned_files):
895
"""Add a source of texts for texts not present in this knit.
897
:param a_versioned_files: A VersionedFiles object.
899
self._fallback_vfs.append(a_versioned_files)
901
def add_lines(self, key, parents, lines, parent_texts=None,
902
left_matching_blocks=None, nostore_sha=None, random_id=False,
904
"""See VersionedFiles.add_lines()."""
905
self._index._check_write_ok()
906
self._check_add(key, lines, random_id, check_content)
908
# The caller might pass None if there is no graph data, but kndx
909
# indexes can't directly store that, so we give them
910
# an empty tuple instead.
912
line_bytes = ''.join(lines)
913
return self._add(key, lines, parents,
914
parent_texts, left_matching_blocks, nostore_sha, random_id,
915
line_bytes=line_bytes)
917
def _add_text(self, key, parents, text, nostore_sha=None, random_id=False):
918
"""See VersionedFiles._add_text()."""
919
self._index._check_write_ok()
920
self._check_add(key, None, random_id, check_content=False)
921
if text.__class__ is not str:
922
raise errors.BzrBadParameterUnicode("text")
924
# The caller might pass None if there is no graph data, but kndx
925
# indexes can't directly store that, so we give them
926
# an empty tuple instead.
928
return self._add(key, None, parents,
929
None, None, nostore_sha, random_id,
932
def _add(self, key, lines, parents, parent_texts,
933
left_matching_blocks, nostore_sha, random_id,
935
"""Add a set of lines on top of version specified by parents.
937
Any versions not present will be converted into ghosts.
939
:param lines: A list of strings where each one is a single line (has a
940
single newline at the end of the string) This is now optional
941
(callers can pass None). It is left in its location for backwards
942
compatibility. It should ''.join(lines) must == line_bytes
943
:param line_bytes: A single string containing the content
945
We pass both lines and line_bytes because different routes bring the
946
values to this function. And for memory efficiency, we don't want to
947
have to split/join on-demand.
949
# first thing, if the content is something we don't need to store, find
951
digest = sha_string(line_bytes)
952
if nostore_sha == digest:
953
raise errors.ExistingContent
956
if parent_texts is None:
958
# Do a single query to ascertain parent presence; we only compress
959
# against parents in the same kvf.
960
present_parent_map = self._index.get_parent_map(parents)
961
for parent in parents:
962
if parent in present_parent_map:
963
present_parents.append(parent)
965
# Currently we can only compress against the left most present parent.
966
if (len(present_parents) == 0 or
967
present_parents[0] != parents[0]):
970
# To speed the extract of texts the delta chain is limited
971
# to a fixed number of deltas. This should minimize both
972
# I/O and the time spend applying deltas.
973
delta = self._check_should_delta(present_parents[0])
975
text_length = len(line_bytes)
978
# Note: line_bytes is not modified to add a newline, that is tracked
979
# via the no_eol flag. 'lines' *is* modified, because that is the
980
# general values needed by the Content code.
981
if line_bytes and line_bytes[-1] != '\n':
982
options.append('no-eol')
984
# Copy the existing list, or create a new one
986
lines = osutils.split_lines(line_bytes)
989
# Replace the last line with one that ends in a final newline
990
lines[-1] = lines[-1] + '\n'
992
lines = osutils.split_lines(line_bytes)
994
for element in key[:-1]:
995
if type(element) is not str:
996
raise TypeError("key contains non-strings: %r" % (key,))
998
key = key[:-1] + ('sha1:' + digest,)
999
elif type(key[-1]) is not str:
1000
raise TypeError("key contains non-strings: %r" % (key,))
1001
# Knit hunks are still last-element only
1002
version_id = key[-1]
1003
content = self._factory.make(lines, version_id)
1005
# Hint to the content object that its text() call should strip the
1007
content._should_strip_eol = True
1008
if delta or (self._factory.annotated and len(present_parents) > 0):
1009
# Merge annotations from parent texts if needed.
1010
delta_hunks = self._merge_annotations(content, present_parents,
1011
parent_texts, delta, self._factory.annotated,
1012
left_matching_blocks)
1015
options.append('line-delta')
1016
store_lines = self._factory.lower_line_delta(delta_hunks)
1017
size, bytes = self._record_to_data(key, digest,
1020
options.append('fulltext')
1021
# isinstance is slower and we have no hierarchy.
1022
if self._factory.__class__ is KnitPlainFactory:
1023
# Use the already joined bytes saving iteration time in
1025
dense_lines = [line_bytes]
1027
dense_lines.append('\n')
1028
size, bytes = self._record_to_data(key, digest,
1031
# get mixed annotation + content and feed it into the
1033
store_lines = self._factory.lower_fulltext(content)
1034
size, bytes = self._record_to_data(key, digest,
1037
access_memo = self._access.add_raw_records([(key, size)], bytes)[0]
1038
self._index.add_records(
1039
((key, options, access_memo, parents),),
1040
random_id=random_id)
1041
return digest, text_length, content
1043
def annotate(self, key):
1044
"""See VersionedFiles.annotate."""
1045
return self._factory.annotate(self, key)
1047
def get_annotator(self):
1048
return _KnitAnnotator(self)
1050
def check(self, progress_bar=None, keys=None):
1051
"""See VersionedFiles.check()."""
1053
return self._logical_check()
1055
# At the moment, check does not extra work over get_record_stream
1056
return self.get_record_stream(keys, 'unordered', True)
1058
def _logical_check(self):
1059
# This doesn't actually test extraction of everything, but that will
1060
# impact 'bzr check' substantially, and needs to be integrated with
1061
# care. However, it does check for the obvious problem of a delta with
1063
keys = self._index.keys()
1064
parent_map = self.get_parent_map(keys)
1066
if self._index.get_method(key) != 'fulltext':
1067
compression_parent = parent_map[key][0]
1068
if compression_parent not in parent_map:
1069
raise errors.KnitCorrupt(self,
1070
"Missing basis parent %s for %s" % (
1071
compression_parent, key))
1072
for fallback_vfs in self._fallback_vfs:
1073
fallback_vfs.check()
1075
def _check_add(self, key, lines, random_id, check_content):
1076
"""check that version_id and lines are safe to add."""
1077
version_id = key[-1]
1078
if version_id is not None:
1079
if contains_whitespace(version_id):
1080
raise InvalidRevisionId(version_id, self)
1081
self.check_not_reserved_id(version_id)
1082
# TODO: If random_id==False and the key is already present, we should
1083
# probably check that the existing content is identical to what is
1084
# being inserted, and otherwise raise an exception. This would make
1085
# the bundle code simpler.
1087
self._check_lines_not_unicode(lines)
1088
self._check_lines_are_lines(lines)
1090
def _check_header(self, key, line):
1091
rec = self._split_header(line)
1092
self._check_header_version(rec, key[-1])
1095
def _check_header_version(self, rec, version_id):
1096
"""Checks the header version on original format knit records.
1098
These have the last component of the key embedded in the record.
1100
if rec[1] != version_id:
1101
raise KnitCorrupt(self,
1102
'unexpected version, wanted %r, got %r' % (version_id, rec[1]))
1104
def _check_should_delta(self, parent):
412
return '%s(%s)' % (self.__class__.__name__,
413
self.transport.abspath(self.filename))
415
def _check_should_delta(self, first_parents):
1105
416
"""Iterate back through the parent listing, looking for a fulltext.
1107
418
This is used when we want to decide whether to add a delta or a new
1116
427
fulltext_size = None
428
delta_parents = first_parents
1117
429
for count in xrange(self._max_delta_chain):
1119
# Note that this only looks in the index of this particular
1120
# KnitVersionedFiles, not in the fallbacks. This ensures that
1121
# we won't store a delta spanning physical repository
1123
build_details = self._index.get_build_details([parent])
1124
parent_details = build_details[parent]
1125
except (RevisionNotPresent, KeyError), e:
1126
# Some basis is not locally present: always fulltext
1128
index_memo, compression_parent, _, _ = parent_details
1129
_, _, size = index_memo
1130
if compression_parent is None:
430
parent = delta_parents[0]
431
method = self._index.get_method(parent)
432
index, pos, size = self._index.get_position(parent)
433
if method == 'fulltext':
1131
434
fulltext_size = size
1133
436
delta_size += size
1134
# We don't explicitly check for presence because this is in an
1135
# inner loop, and if it's missing it'll fail anyhow.
1136
parent = compression_parent
437
delta_parents = self._index.get_parents(parent)
1138
439
# We couldn't find a fulltext, so we must create a new one
1140
# Simple heuristic - if the total I/O wold be greater as a delta than
1141
# the originally installed fulltext, we create a new fulltext.
1142
442
return fulltext_size > delta_size
1144
def _build_details_to_components(self, build_details):
1145
"""Convert a build_details tuple to a position tuple."""
1146
# record_details, access_memo, compression_parent
1147
return build_details[3], build_details[0], build_details[1]
1149
def _get_components_positions(self, keys, allow_missing=False):
1150
"""Produce a map of position data for the components of keys.
444
def _add_delta(self, version_id, parents, delta_parent, sha1, noeol, delta):
445
"""See VersionedFile._add_delta()."""
446
self._check_add(version_id, []) # should we check the lines ?
447
self._check_versions_present(parents)
451
for parent in parents:
452
if not self.has_version(parent):
453
ghosts.append(parent)
455
present_parents.append(parent)
457
if delta_parent is None:
458
# reconstitute as full text.
459
assert len(delta) == 1 or len(delta) == 0
461
assert delta[0][0] == 0
462
assert delta[0][1] == 0, delta[0][1]
463
return super(KnitVersionedFile, self)._add_delta(version_id,
474
options.append('no-eol')
476
if delta_parent is not None:
477
# determine the current delta chain length.
478
# To speed the extract of texts the delta chain is limited
479
# to a fixed number of deltas. This should minimize both
480
# I/O and the time spend applying deltas.
481
# The window was changed to a maximum of 200 deltas, but also added
482
# was a check that the total compressed size of the deltas is
483
# smaller than the compressed size of the fulltext.
484
if not self._check_should_delta([delta_parent]):
485
# We don't want a delta here, just do a normal insertion.
486
return super(KnitVersionedFile, self)._add_delta(version_id,
493
options.append('line-delta')
494
store_lines = self.factory.lower_line_delta(delta)
496
access_memo = self._data.add_record(version_id, digest, store_lines)
497
self._index.add_version(version_id, options, access_memo, parents)
499
def _add_raw_records(self, records, data):
500
"""Add all the records 'records' with data pre-joined in 'data'.
502
:param records: A list of tuples(version_id, options, parents, size).
503
:param data: The data for the records. When it is written, the records
504
are adjusted to have pos pointing into data by the sum of
505
the preceding records sizes.
508
raw_record_sizes = [record[3] for record in records]
509
positions = self._data.add_raw_records(raw_record_sizes, data)
512
for (version_id, options, parents, size), access_memo in zip(
514
index_entries.append((version_id, options, access_memo, parents))
515
if self._data._do_cache:
516
self._data._cache[version_id] = data[offset:offset+size]
518
self._index.add_versions(index_entries)
520
def enable_cache(self):
521
"""Start caching data for this knit"""
522
self._data.enable_cache()
524
def clear_cache(self):
525
"""Clear the data cache only."""
526
self._data.clear_cache()
528
def copy_to(self, name, transport):
529
"""See VersionedFile.copy_to()."""
530
# copy the current index to a temp index to avoid racing with local
532
transport.put_file_non_atomic(name + INDEX_SUFFIX + '.tmp',
533
self.transport.get(self._index._filename))
535
f = self._data._open_file()
537
transport.put_file(name + DATA_SUFFIX, f)
540
# move the copied index into place
541
transport.move(name + INDEX_SUFFIX + '.tmp', name + INDEX_SUFFIX)
543
def create_empty(self, name, transport, mode=None):
544
return KnitVersionedFile(name, transport, factory=self.factory,
545
delta=self.delta, create=True)
547
def _fix_parents(self, version_id, new_parents):
548
"""Fix the parents list for version.
550
This is done by appending a new version to the index
551
with identical data except for the parents list.
552
the parents list must be a superset of the current
555
current_values = self._index._cache[version_id]
556
assert set(current_values[4]).difference(set(new_parents)) == set()
557
self._index.add_version(version_id,
559
(None, current_values[2], current_values[3]),
562
def _extract_blocks(self, version_id, source, target):
563
if self._index.get_method(version_id) != 'line-delta':
565
parent, sha1, noeol, delta = self.get_delta(version_id)
566
return KnitContent.get_line_delta_blocks(delta, source, target)
568
def get_delta(self, version_id):
569
"""Get a delta for constructing version from some other version."""
570
version_id = osutils.safe_revision_id(version_id)
571
self.check_not_reserved_id(version_id)
572
if not self.has_version(version_id):
573
raise RevisionNotPresent(version_id, self.filename)
575
parents = self.get_parents(version_id)
580
index_memo = self._index.get_position(version_id)
581
data, sha1 = self._data.read_records(((version_id, index_memo),))[version_id]
582
noeol = 'no-eol' in self._index.get_options(version_id)
583
if 'fulltext' == self._index.get_method(version_id):
584
new_content = self.factory.parse_fulltext(data, version_id)
585
if parent is not None:
586
reference_content = self._get_content(parent)
587
old_texts = reference_content.text()
590
new_texts = new_content.text()
591
delta_seq = KnitSequenceMatcher(None, old_texts, new_texts)
592
return parent, sha1, noeol, self._make_line_delta(delta_seq, new_content)
594
delta = self.factory.parse_line_delta(data, version_id)
595
return parent, sha1, noeol, delta
597
def get_graph_with_ghosts(self):
598
"""See VersionedFile.get_graph_with_ghosts()."""
599
graph_items = self._index.get_graph()
600
return dict(graph_items)
602
def get_sha1(self, version_id):
603
return self.get_sha1s([version_id])[0]
605
def get_sha1s(self, version_ids):
606
"""See VersionedFile.get_sha1()."""
607
version_ids = [osutils.safe_revision_id(v) for v in version_ids]
608
record_map = self._get_record_map(version_ids)
609
# record entry 2 is the 'digest'.
610
return [record_map[v][2] for v in version_ids]
614
"""See VersionedFile.get_suffixes()."""
615
return [DATA_SUFFIX, INDEX_SUFFIX]
617
def has_ghost(self, version_id):
618
"""True if there is a ghost reference in the file to version_id."""
619
version_id = osutils.safe_revision_id(version_id)
621
if self.has_version(version_id):
623
# optimisable if needed by memoising the _ghosts set.
624
items = self._index.get_graph()
625
for node, parents in items:
626
for parent in parents:
627
if parent not in self._index._cache:
628
if parent == version_id:
633
"""See VersionedFile.versions."""
634
return self._index.get_versions()
636
def has_version(self, version_id):
637
"""See VersionedFile.has_version."""
638
version_id = osutils.safe_revision_id(version_id)
639
return self._index.has_version(version_id)
641
__contains__ = has_version
643
def _merge_annotations(self, content, parents, parent_texts={},
644
delta=None, annotated=None):
645
"""Merge annotations for content. This is done by comparing
646
the annotations based on changed to the text.
650
for parent_id in parents:
651
merge_content = self._get_content(parent_id, parent_texts)
652
seq = patiencediff.PatienceSequenceMatcher(
653
None, merge_content.text(), content.text())
654
if delta_seq is None:
655
# setup a delta seq to reuse.
657
for i, j, n in seq.get_matching_blocks():
660
# this appears to copy (origin, text) pairs across to the new
661
# content for any line that matches the last-checked parent.
662
# FIXME: save the sequence control data for delta compression
663
# against the most relevant parent rather than rediffing.
664
content._lines[j:j+n] = merge_content._lines[i:i+n]
667
reference_content = self._get_content(parents[0], parent_texts)
668
new_texts = content.text()
669
old_texts = reference_content.text()
670
delta_seq = patiencediff.PatienceSequenceMatcher(
671
None, old_texts, new_texts)
672
return self._make_line_delta(delta_seq, content)
674
def _make_line_delta(self, delta_seq, new_content):
675
"""Generate a line delta from delta_seq and new_content."""
677
for op in delta_seq.get_opcodes():
680
diff_hunks.append((op[1], op[2], op[4]-op[3], new_content._lines[op[3]:op[4]]))
683
def _get_components_positions(self, version_ids):
684
"""Produce a map of position data for the components of versions.
1152
686
This data is intended to be used for retrieving the knit records.
1154
A dict of key to (record_details, index_memo, next, parents) is
688
A dict of version_id to (method, data_pos, data_size, next) is
1156
690
method is the way referenced data should be applied.
1157
index_memo is the handle to pass to the data access to actually get the
691
data_pos is the position of the data in the knit.
692
data_size is the size of the data in the knit.
1159
693
next is the build-parent of the version, or None for fulltexts.
1160
parents is the version_ids of the parents of this version
1162
:param allow_missing: If True do not raise an error on a missing component,
1165
695
component_data = {}
1166
pending_components = keys
1167
while pending_components:
1168
build_details = self._index.get_build_details(pending_components)
1169
current_components = set(pending_components)
1170
pending_components = set()
1171
for key, details in build_details.iteritems():
1172
(index_memo, compression_parent, parents,
1173
record_details) = details
1174
method = record_details[0]
1175
if compression_parent is not None:
1176
pending_components.add(compression_parent)
1177
component_data[key] = self._build_details_to_components(details)
1178
missing = current_components.difference(build_details)
1179
if missing and not allow_missing:
1180
raise errors.RevisionNotPresent(missing.pop(), self)
696
for version_id in version_ids:
699
while cursor is not None and cursor not in component_data:
700
method = self._index.get_method(cursor)
701
if method == 'fulltext':
704
next = self.get_parents(cursor)[0]
705
index_memo = self._index.get_position(cursor)
706
component_data[cursor] = (method, index_memo, next)
1181
708
return component_data
1183
def _get_content(self, key, parent_texts={}):
710
def _get_content(self, version_id, parent_texts={}):
1184
711
"""Returns a content object that makes up the specified
1186
cached_version = parent_texts.get(key, None)
713
if not self.has_version(version_id):
714
raise RevisionNotPresent(version_id, self.filename)
716
cached_version = parent_texts.get(version_id, None)
1187
717
if cached_version is not None:
1188
# Ensure the cache dict is valid.
1189
if not self.get_parent_map([key]):
1190
raise RevisionNotPresent(key, self)
1191
718
return cached_version
1192
generator = _VFContentMapGenerator(self, [key])
1193
return generator._get_content(key)
1195
def get_known_graph_ancestry(self, keys):
1196
"""Get a KnownGraph instance with the ancestry of keys."""
1197
parent_map, missing_keys = self._index.find_ancestry(keys)
1198
for fallback in self._fallback_vfs:
1199
if not missing_keys:
1201
(f_parent_map, f_missing_keys) = fallback._index.find_ancestry(
1203
parent_map.update(f_parent_map)
1204
missing_keys = f_missing_keys
1205
kg = _mod_graph.KnownGraph(parent_map)
1208
def get_parent_map(self, keys):
1209
"""Get a map of the graph parents of keys.
1211
:param keys: The keys to look up parents for.
1212
:return: A mapping from keys to parents. Absent keys are absent from
1215
return self._get_parent_map_with_sources(keys)[0]
1217
def _get_parent_map_with_sources(self, keys):
1218
"""Get a map of the parents of keys.
1220
:param keys: The keys to look up parents for.
1221
:return: A tuple. The first element is a mapping from keys to parents.
1222
Absent keys are absent from the mapping. The second element is a
1223
list with the locations each key was found in. The first element
1224
is the in-this-knit parents, the second the first fallback source,
1228
sources = [self._index] + self._fallback_vfs
1231
for source in sources:
1234
new_result = source.get_parent_map(missing)
1235
source_results.append(new_result)
1236
result.update(new_result)
1237
missing.difference_update(set(new_result))
1238
return result, source_results
1240
def _get_record_map(self, keys, allow_missing=False):
720
text_map, contents_map = self._get_content_maps([version_id])
721
return contents_map[version_id]
723
def _check_versions_present(self, version_ids):
724
"""Check that all specified versions are present."""
725
self._index.check_versions_present(version_ids)
727
def _add_lines_with_ghosts(self, version_id, parents, lines, parent_texts):
728
"""See VersionedFile.add_lines_with_ghosts()."""
729
self._check_add(version_id, lines)
730
return self._add(version_id, lines[:], parents, self.delta, parent_texts)
732
def _add_lines(self, version_id, parents, lines, parent_texts):
733
"""See VersionedFile.add_lines."""
734
self._check_add(version_id, lines)
735
self._check_versions_present(parents)
736
return self._add(version_id, lines[:], parents, self.delta, parent_texts)
738
def _check_add(self, version_id, lines):
739
"""check that version_id and lines are safe to add."""
740
assert self.writable, "knit is not opened for write"
741
### FIXME escape. RBC 20060228
742
if contains_whitespace(version_id):
743
raise InvalidRevisionId(version_id, self.filename)
744
self.check_not_reserved_id(version_id)
745
if self.has_version(version_id):
746
raise RevisionAlreadyPresent(version_id, self.filename)
747
self._check_lines_not_unicode(lines)
748
self._check_lines_are_lines(lines)
750
def _add(self, version_id, lines, parents, delta, parent_texts):
751
"""Add a set of lines on top of version specified by parents.
753
If delta is true, compress the text as a line-delta against
756
Any versions not present will be converted into ghosts.
758
# 461 0 6546.0390 43.9100 bzrlib.knit:489(_add)
759
# +400 0 889.4890 418.9790 +bzrlib.knit:192(lower_fulltext)
760
# +461 0 1364.8070 108.8030 +bzrlib.knit:996(add_record)
761
# +461 0 193.3940 41.5720 +bzrlib.knit:898(add_version)
762
# +461 0 134.0590 18.3810 +bzrlib.osutils:361(sha_strings)
763
# +461 0 36.3420 15.4540 +bzrlib.knit:146(make)
764
# +1383 0 8.0370 8.0370 +<len>
765
# +61 0 13.5770 7.9190 +bzrlib.knit:199(lower_line_delta)
766
# +61 0 963.3470 7.8740 +bzrlib.knit:427(_get_content)
767
# +61 0 973.9950 5.2950 +bzrlib.knit:136(line_delta)
768
# +61 0 1918.1800 5.2640 +bzrlib.knit:359(_merge_annotations)
772
if parent_texts is None:
774
for parent in parents:
775
if not self.has_version(parent):
776
ghosts.append(parent)
778
present_parents.append(parent)
780
if delta and not len(present_parents):
783
digest = sha_strings(lines)
786
if lines[-1][-1] != '\n':
787
options.append('no-eol')
788
lines[-1] = lines[-1] + '\n'
790
if len(present_parents) and delta:
791
# To speed the extract of texts the delta chain is limited
792
# to a fixed number of deltas. This should minimize both
793
# I/O and the time spend applying deltas.
794
delta = self._check_should_delta(present_parents)
796
assert isinstance(version_id, str)
797
lines = self.factory.make(lines, version_id)
798
if delta or (self.factory.annotated and len(present_parents) > 0):
799
# Merge annotations from parent texts if so is needed.
800
delta_hunks = self._merge_annotations(lines, present_parents, parent_texts,
801
delta, self.factory.annotated)
804
options.append('line-delta')
805
store_lines = self.factory.lower_line_delta(delta_hunks)
807
options.append('fulltext')
808
store_lines = self.factory.lower_fulltext(lines)
810
access_memo = self._data.add_record(version_id, digest, store_lines)
811
self._index.add_version(version_id, options, access_memo, parents)
814
def check(self, progress_bar=None):
815
"""See VersionedFile.check()."""
817
def _clone_text(self, new_version_id, old_version_id, parents):
818
"""See VersionedFile.clone_text()."""
819
# FIXME RBC 20060228 make fast by only inserting an index with null
821
self.add_lines(new_version_id, parents, self.get_lines(old_version_id))
823
def get_lines(self, version_id):
824
"""See VersionedFile.get_lines()."""
825
return self.get_line_list([version_id])[0]
827
def _get_record_map(self, version_ids):
1241
828
"""Produce a dictionary of knit records.
1243
:return: {key:(record, record_details, digest, next)}
1245
data returned from read_records (a KnitContentobject)
1247
opaque information to pass to parse_record
1249
SHA1 digest of the full text after all steps are done
1251
build-parent of the version, i.e. the leftmost ancestor.
1252
Will be None if the record is not a delta.
1253
:param keys: The keys to build a map for
1254
:param allow_missing: If some records are missing, rather than
1255
error, just return the data that could be generated.
1257
raw_map = self._get_record_map_unparsed(keys,
1258
allow_missing=allow_missing)
1259
return self._raw_map_to_record_map(raw_map)
1261
def _raw_map_to_record_map(self, raw_map):
1262
"""Parse the contents of _get_record_map_unparsed.
1264
:return: see _get_record_map.
1268
data, record_details, next = raw_map[key]
1269
content, digest = self._parse_record(key[-1], data)
1270
result[key] = content, record_details, digest, next
1273
def _get_record_map_unparsed(self, keys, allow_missing=False):
1274
"""Get the raw data for reconstructing keys without parsing it.
1276
:return: A dict suitable for parsing via _raw_map_to_record_map.
1277
key-> raw_bytes, (method, noeol), compression_parent
1279
# This retries the whole request if anything fails. Potentially we
1280
# could be a bit more selective. We could track the keys whose records
1281
# we have successfully found, and then only request the new records
1282
# from there. However, _get_components_positions grabs the whole build
1283
# chain, which means we'll likely try to grab the same records again
1284
# anyway. Also, can the build chains change as part of a pack
1285
# operation? We wouldn't want to end up with a broken chain.
1288
position_map = self._get_components_positions(keys,
1289
allow_missing=allow_missing)
1290
# key = component_id, r = record_details, i_m = index_memo,
1292
records = [(key, i_m) for key, (r, i_m, n)
1293
in position_map.iteritems()]
1294
# Sort by the index memo, so that we request records from the
1295
# same pack file together, and in forward-sorted order
1296
records.sort(key=operator.itemgetter(1))
1298
for key, data in self._read_records_iter_unchecked(records):
1299
(record_details, index_memo, next) = position_map[key]
1300
raw_record_map[key] = data, record_details, next
1301
return raw_record_map
1302
except errors.RetryWithNewPacks, e:
1303
self._access.reload_or_raise(e)
1306
def _split_by_prefix(cls, keys):
1307
"""For the given keys, split them up based on their prefix.
1309
To keep memory pressure somewhat under control, split the
1310
requests back into per-file-id requests, otherwise "bzr co"
1311
extracts the full tree into memory before writing it to disk.
1312
This should be revisited if _get_content_maps() can ever cross
1315
The keys for a given file_id are kept in the same relative order.
1316
Ordering between file_ids is not, though prefix_order will return the
1317
order that the key was first seen.
1319
:param keys: An iterable of key tuples
1320
:return: (split_map, prefix_order)
1321
split_map A dictionary mapping prefix => keys
1322
prefix_order The order that we saw the various prefixes
1324
split_by_prefix = {}
1332
if prefix in split_by_prefix:
1333
split_by_prefix[prefix].append(key)
1335
split_by_prefix[prefix] = [key]
1336
prefix_order.append(prefix)
1337
return split_by_prefix, prefix_order
1339
def _group_keys_for_io(self, keys, non_local_keys, positions,
1340
_min_buffer_size=_STREAM_MIN_BUFFER_SIZE):
1341
"""For the given keys, group them into 'best-sized' requests.
1343
The idea is to avoid making 1 request per file, but to never try to
1344
unpack an entire 1.5GB source tree in a single pass. Also when
1345
possible, we should try to group requests to the same pack file
1348
:return: list of (keys, non_local) tuples that indicate what keys
1349
should be fetched next.
1351
# TODO: Ideally we would group on 2 factors. We want to extract texts
1352
# from the same pack file together, and we want to extract all
1353
# the texts for a given build-chain together. Ultimately it
1354
# probably needs a better global view.
1355
total_keys = len(keys)
1356
prefix_split_keys, prefix_order = self._split_by_prefix(keys)
1357
prefix_split_non_local_keys, _ = self._split_by_prefix(non_local_keys)
1359
cur_non_local = set()
1363
for prefix in prefix_order:
1364
keys = prefix_split_keys[prefix]
1365
non_local = prefix_split_non_local_keys.get(prefix, [])
1367
this_size = self._index._get_total_build_size(keys, positions)
1368
cur_size += this_size
1369
cur_keys.extend(keys)
1370
cur_non_local.update(non_local)
1371
if cur_size > _min_buffer_size:
1372
result.append((cur_keys, cur_non_local))
1373
sizes.append(cur_size)
1375
cur_non_local = set()
1378
result.append((cur_keys, cur_non_local))
1379
sizes.append(cur_size)
1382
def get_record_stream(self, keys, ordering, include_delta_closure):
1383
"""Get a stream of records for keys.
1385
:param keys: The keys to include.
1386
:param ordering: Either 'unordered' or 'topological'. A topologically
1387
sorted stream has compression parents strictly before their
1389
:param include_delta_closure: If True then the closure across any
1390
compression parents will be included (in the opaque data).
1391
:return: An iterator of ContentFactory objects, each of which is only
1392
valid until the iterator is advanced.
1394
# keys might be a generator
1398
if not self._index.has_graph:
1399
# Cannot sort when no graph has been stored.
1400
ordering = 'unordered'
1402
remaining_keys = keys
1405
keys = set(remaining_keys)
1406
for content_factory in self._get_remaining_record_stream(keys,
1407
ordering, include_delta_closure):
1408
remaining_keys.discard(content_factory.key)
1409
yield content_factory
1411
except errors.RetryWithNewPacks, e:
1412
self._access.reload_or_raise(e)
1414
def _get_remaining_record_stream(self, keys, ordering,
1415
include_delta_closure):
1416
"""This function is the 'retry' portion for get_record_stream."""
1417
if include_delta_closure:
1418
positions = self._get_components_positions(keys, allow_missing=True)
1420
build_details = self._index.get_build_details(keys)
1422
# (record_details, access_memo, compression_parent_key)
1423
positions = dict((key, self._build_details_to_components(details))
1424
for key, details in build_details.iteritems())
1425
absent_keys = keys.difference(set(positions))
1426
# There may be more absent keys : if we're missing the basis component
1427
# and are trying to include the delta closure.
1428
# XXX: We should not ever need to examine remote sources because we do
1429
# not permit deltas across versioned files boundaries.
1430
if include_delta_closure:
1431
needed_from_fallback = set()
1432
# Build up reconstructable_keys dict. key:True in this dict means
1433
# the key can be reconstructed.
1434
reconstructable_keys = {}
1438
chain = [key, positions[key][2]]
1440
needed_from_fallback.add(key)
1443
while chain[-1] is not None:
1444
if chain[-1] in reconstructable_keys:
1445
result = reconstructable_keys[chain[-1]]
1449
chain.append(positions[chain[-1]][2])
1451
# missing basis component
1452
needed_from_fallback.add(chain[-1])
1455
for chain_key in chain[:-1]:
1456
reconstructable_keys[chain_key] = result
1458
needed_from_fallback.add(key)
1459
# Double index lookups here : need a unified api ?
1460
global_map, parent_maps = self._get_parent_map_with_sources(keys)
1461
if ordering in ('topological', 'groupcompress'):
1462
if ordering == 'topological':
1463
# Global topological sort
1464
present_keys = tsort.topo_sort(global_map)
1466
present_keys = sort_groupcompress(global_map)
1467
# Now group by source:
1469
current_source = None
1470
for key in present_keys:
1471
for parent_map in parent_maps:
1472
if key in parent_map:
1473
key_source = parent_map
1475
if current_source is not key_source:
1476
source_keys.append((key_source, []))
1477
current_source = key_source
1478
source_keys[-1][1].append(key)
1480
if ordering != 'unordered':
1481
raise AssertionError('valid values for ordering are:'
1482
' "unordered", "groupcompress" or "topological" not: %r'
1484
# Just group by source; remote sources first.
1487
for parent_map in reversed(parent_maps):
1488
source_keys.append((parent_map, []))
1489
for key in parent_map:
1490
present_keys.append(key)
1491
source_keys[-1][1].append(key)
1492
# We have been requested to return these records in an order that
1493
# suits us. So we ask the index to give us an optimally sorted
1495
for source, sub_keys in source_keys:
1496
if source is parent_maps[0]:
1497
# Only sort the keys for this VF
1498
self._index._sort_keys_by_io(sub_keys, positions)
1499
absent_keys = keys - set(global_map)
1500
for key in absent_keys:
1501
yield AbsentContentFactory(key)
1502
# restrict our view to the keys we can answer.
1503
# XXX: Memory: TODO: batch data here to cap buffered data at (say) 1MB.
1504
# XXX: At that point we need to consider the impact of double reads by
1505
# utilising components multiple times.
1506
if include_delta_closure:
1507
# XXX: get_content_maps performs its own index queries; allow state
1509
non_local_keys = needed_from_fallback - absent_keys
1510
for keys, non_local_keys in self._group_keys_for_io(present_keys,
1513
generator = _VFContentMapGenerator(self, keys, non_local_keys,
1516
for record in generator.get_record_stream():
1519
for source, keys in source_keys:
1520
if source is parent_maps[0]:
1521
# this KnitVersionedFiles
1522
records = [(key, positions[key][1]) for key in keys]
1523
for key, raw_data in self._read_records_iter_unchecked(records):
1524
(record_details, index_memo, _) = positions[key]
1525
yield KnitContentFactory(key, global_map[key],
1526
record_details, None, raw_data, self._factory.annotated, None)
1528
vf = self._fallback_vfs[parent_maps.index(source) - 1]
1529
for record in vf.get_record_stream(keys, ordering,
1530
include_delta_closure):
1533
def get_sha1s(self, keys):
1534
"""See VersionedFiles.get_sha1s()."""
1536
record_map = self._get_record_map(missing, allow_missing=True)
1538
for key, details in record_map.iteritems():
1539
if key not in missing:
1541
# record entry 2 is the 'digest'.
1542
result[key] = details[2]
1543
missing.difference_update(set(result))
1544
for source in self._fallback_vfs:
1547
new_result = source.get_sha1s(missing)
1548
result.update(new_result)
1549
missing.difference_update(set(new_result))
1552
def insert_record_stream(self, stream):
1553
"""Insert a record stream into this container.
1555
:param stream: A stream of records to insert.
1557
:seealso VersionedFiles.get_record_stream:
1559
def get_adapter(adapter_key):
1561
return adapters[adapter_key]
1563
adapter_factory = adapter_registry.get(adapter_key)
1564
adapter = adapter_factory(self)
1565
adapters[adapter_key] = adapter
1568
if self._factory.annotated:
1569
# self is annotated, we need annotated knits to use directly.
1570
annotated = "annotated-"
1573
# self is not annotated, but we can strip annotations cheaply.
1575
convertibles = set(["knit-annotated-ft-gz"])
1576
if self._max_delta_chain:
1577
delta_types.add("knit-annotated-delta-gz")
1578
convertibles.add("knit-annotated-delta-gz")
1579
# The set of types we can cheaply adapt without needing basis texts.
1580
native_types = set()
1581
if self._max_delta_chain:
1582
native_types.add("knit-%sdelta-gz" % annotated)
1583
delta_types.add("knit-%sdelta-gz" % annotated)
1584
native_types.add("knit-%sft-gz" % annotated)
1585
knit_types = native_types.union(convertibles)
1587
# Buffer all index entries that we can't add immediately because their
1588
# basis parent is missing. We don't buffer all because generating
1589
# annotations may require access to some of the new records. However we
1590
# can't generate annotations from new deltas until their basis parent
1591
# is present anyway, so we get away with not needing an index that
1592
# includes the new keys.
1594
# See <http://launchpad.net/bugs/300177> about ordering of compression
1595
# parents in the records - to be conservative, we insist that all
1596
# parents must be present to avoid expanding to a fulltext.
1598
# key = basis_parent, value = index entry to add
1599
buffered_index_entries = {}
1600
for record in stream:
1601
kind = record.storage_kind
1602
if kind.startswith('knit-') and kind.endswith('-gz'):
1603
# Check that the ID in the header of the raw knit bytes matches
1604
# the record metadata.
1605
raw_data = record._raw_record
1606
df, rec = self._parse_record_header(record.key, raw_data)
1609
parents = record.parents
1610
if record.storage_kind in delta_types:
1611
# TODO: eventually the record itself should track
1612
# compression_parent
1613
compression_parent = parents[0]
1615
compression_parent = None
1616
# Raise an error when a record is missing.
1617
if record.storage_kind == 'absent':
1618
raise RevisionNotPresent([record.key], self)
1619
elif ((record.storage_kind in knit_types)
1620
and (compression_parent is None
1621
or not self._fallback_vfs
1622
or self._index.has_key(compression_parent)
1623
or not self.has_key(compression_parent))):
1624
# we can insert the knit record literally if either it has no
1625
# compression parent OR we already have its basis in this kvf
1626
# OR the basis is not present even in the fallbacks. In the
1627
# last case it will either turn up later in the stream and all
1628
# will be well, or it won't turn up at all and we'll raise an
1631
# TODO: self.has_key is somewhat redundant with
1632
# self._index.has_key; we really want something that directly
1633
# asks if it's only present in the fallbacks. -- mbp 20081119
1634
if record.storage_kind not in native_types:
1636
adapter_key = (record.storage_kind, "knit-delta-gz")
1637
adapter = get_adapter(adapter_key)
1639
adapter_key = (record.storage_kind, "knit-ft-gz")
1640
adapter = get_adapter(adapter_key)
1641
bytes = adapter.get_bytes(record)
1643
# It's a knit record, it has a _raw_record field (even if
1644
# it was reconstituted from a network stream).
1645
bytes = record._raw_record
1646
options = [record._build_details[0]]
1647
if record._build_details[1]:
1648
options.append('no-eol')
1649
# Just blat it across.
1650
# Note: This does end up adding data on duplicate keys. As
1651
# modern repositories use atomic insertions this should not
1652
# lead to excessive growth in the event of interrupted fetches.
1653
# 'knit' repositories may suffer excessive growth, but as a
1654
# deprecated format this is tolerable. It can be fixed if
1655
# needed by in the kndx index support raising on a duplicate
1656
# add with identical parents and options.
1657
access_memo = self._access.add_raw_records(
1658
[(record.key, len(bytes))], bytes)[0]
1659
index_entry = (record.key, options, access_memo, parents)
1660
if 'fulltext' not in options:
1661
# Not a fulltext, so we need to make sure the compression
1662
# parent will also be present.
1663
# Note that pack backed knits don't need to buffer here
1664
# because they buffer all writes to the transaction level,
1665
# but we don't expose that difference at the index level. If
1666
# the query here has sufficient cost to show up in
1667
# profiling we should do that.
1669
# They're required to be physically in this
1670
# KnitVersionedFiles, not in a fallback.
1671
if not self._index.has_key(compression_parent):
1672
pending = buffered_index_entries.setdefault(
1673
compression_parent, [])
1674
pending.append(index_entry)
1677
self._index.add_records([index_entry])
1678
elif record.storage_kind == 'chunked':
1679
self.add_lines(record.key, parents,
1680
osutils.chunks_to_lines(record.get_bytes_as('chunked')))
1682
# Not suitable for direct insertion as a
1683
# delta, either because it's not the right format, or this
1684
# KnitVersionedFiles doesn't permit deltas (_max_delta_chain ==
1685
# 0) or because it depends on a base only present in the
1687
self._access.flush()
1689
# Try getting a fulltext directly from the record.
1690
bytes = record.get_bytes_as('fulltext')
1691
except errors.UnavailableRepresentation:
1692
adapter_key = record.storage_kind, 'fulltext'
1693
adapter = get_adapter(adapter_key)
1694
bytes = adapter.get_bytes(record)
1695
lines = split_lines(bytes)
1697
self.add_lines(record.key, parents, lines)
1698
except errors.RevisionAlreadyPresent:
1700
# Add any records whose basis parent is now available.
1702
added_keys = [record.key]
1704
key = added_keys.pop(0)
1705
if key in buffered_index_entries:
1706
index_entries = buffered_index_entries[key]
1707
self._index.add_records(index_entries)
1709
[index_entry[0] for index_entry in index_entries])
1710
del buffered_index_entries[key]
1711
if buffered_index_entries:
1712
# There were index entries buffered at the end of the stream,
1713
# So these need to be added (if the index supports holding such
1714
# entries for later insertion)
1716
for key in buffered_index_entries:
1717
index_entries = buffered_index_entries[key]
1718
all_entries.extend(index_entries)
1719
self._index.add_records(
1720
all_entries, missing_compression_parents=True)
1722
def get_missing_compression_parent_keys(self):
1723
"""Return an iterable of keys of missing compression parents.
1725
Check this after calling insert_record_stream to find out if there are
1726
any missing compression parents. If there are, the records that
1727
depend on them are not able to be inserted safely. For atomic
1728
KnitVersionedFiles built on packs, the transaction should be aborted or
1729
suspended - commit will fail at this point. Nonatomic knits will error
1730
earlier because they have no staging area to put pending entries into.
1732
return self._index.get_missing_compression_parents()
1734
def iter_lines_added_or_present_in_keys(self, keys, pb=None):
1735
"""Iterate over the lines in the versioned files from keys.
1737
This may return lines from other keys. Each item the returned
1738
iterator yields is a tuple of a line and a text version that that line
1739
is present in (not introduced in).
1741
Ordering of results is in whatever order is most suitable for the
1742
underlying storage format.
1744
If a progress bar is supplied, it may be used to indicate progress.
1745
The caller is responsible for cleaning up progress bars (because this
1749
* Lines are normalised by the underlying store: they will all have \\n
1751
* Lines are returned in arbitrary order.
1752
* If a requested key did not change any lines (or didn't have any
1753
lines), it may not be mentioned at all in the result.
1755
:param pb: Progress bar supplied by caller.
1756
:return: An iterator over (line, key).
1759
pb = ui.ui_factory.nested_progress_bar()
1765
# we don't care about inclusions, the caller cares.
1766
# but we need to setup a list of records to visit.
1767
# we need key, position, length
1769
build_details = self._index.get_build_details(keys)
1770
for key, details in build_details.iteritems():
1772
key_records.append((key, details[0]))
1773
records_iter = enumerate(self._read_records_iter(key_records))
1774
for (key_idx, (key, data, sha_value)) in records_iter:
1775
pb.update('Walking content', key_idx, total)
1776
compression_parent = build_details[key][1]
1777
if compression_parent is None:
1779
line_iterator = self._factory.get_fulltext_content(data)
1782
line_iterator = self._factory.get_linedelta_content(data)
1783
# Now that we are yielding the data for this key, remove it
1786
# XXX: It might be more efficient to yield (key,
1787
# line_iterator) in the future. However for now, this is a
1788
# simpler change to integrate into the rest of the
1789
# codebase. RBC 20071110
1790
for line in line_iterator:
1793
except errors.RetryWithNewPacks, e:
1794
self._access.reload_or_raise(e)
1795
# If there are still keys we've not yet found, we look in the fallback
1796
# vfs, and hope to find them there. Note that if the keys are found
1797
# but had no changes or no content, the fallback may not return
1799
if keys and not self._fallback_vfs:
1800
# XXX: strictly the second parameter is meant to be the file id
1801
# but it's not easily accessible here.
1802
raise RevisionNotPresent(keys, repr(self))
1803
for source in self._fallback_vfs:
1807
for line, key in source.iter_lines_added_or_present_in_keys(keys):
1808
source_keys.add(key)
1810
keys.difference_update(source_keys)
1811
pb.update('Walking content', total, total)
1813
def _make_line_delta(self, delta_seq, new_content):
1814
"""Generate a line delta from delta_seq and new_content."""
1816
for op in delta_seq.get_opcodes():
1817
if op[0] == 'equal':
1819
diff_hunks.append((op[1], op[2], op[4]-op[3], new_content._lines[op[3]:op[4]]))
1822
def _merge_annotations(self, content, parents, parent_texts={},
1823
delta=None, annotated=None,
1824
left_matching_blocks=None):
1825
"""Merge annotations for content and generate deltas.
1827
This is done by comparing the annotations based on changes to the text
1828
and generating a delta on the resulting full texts. If annotations are
1829
not being created then a simple delta is created.
1831
if left_matching_blocks is not None:
1832
delta_seq = diff._PrematchedMatcher(left_matching_blocks)
1836
for parent_key in parents:
1837
merge_content = self._get_content(parent_key, parent_texts)
1838
if (parent_key == parents[0] and delta_seq is not None):
1841
seq = patiencediff.PatienceSequenceMatcher(
1842
None, merge_content.text(), content.text())
1843
for i, j, n in seq.get_matching_blocks():
1846
# this copies (origin, text) pairs across to the new
1847
# content for any line that matches the last-checked
1849
content._lines[j:j+n] = merge_content._lines[i:i+n]
1850
# XXX: Robert says the following block is a workaround for a
1851
# now-fixed bug and it can probably be deleted. -- mbp 20080618
1852
if content._lines and content._lines[-1][1][-1] != '\n':
1853
# The copied annotation was from a line without a trailing EOL,
1854
# reinstate one for the content object, to ensure correct
1856
line = content._lines[-1][1] + '\n'
1857
content._lines[-1] = (content._lines[-1][0], line)
1859
if delta_seq is None:
1860
reference_content = self._get_content(parents[0], parent_texts)
1861
new_texts = content.text()
1862
old_texts = reference_content.text()
1863
delta_seq = patiencediff.PatienceSequenceMatcher(
1864
None, old_texts, new_texts)
1865
return self._make_line_delta(delta_seq, content)
1867
def _parse_record(self, version_id, data):
1868
"""Parse an original format knit record.
1870
These have the last element of the key only present in the stored data.
1872
rec, record_contents = self._parse_record_unchecked(data)
1873
self._check_header_version(rec, version_id)
1874
return record_contents, rec[3]
1876
def _parse_record_header(self, key, raw_data):
1877
"""Parse a record header for consistency.
1879
:return: the header and the decompressor stream.
1880
as (stream, header_record)
1882
df = tuned_gzip.GzipFile(mode='rb', fileobj=StringIO(raw_data))
1885
rec = self._check_header(key, df.readline())
1886
except Exception, e:
1887
raise KnitCorrupt(self,
1888
"While reading {%s} got %s(%s)"
1889
% (key, e.__class__.__name__, str(e)))
1892
def _parse_record_unchecked(self, data):
1894
# 4168 calls in 2880 217 internal
1895
# 4168 calls to _parse_record_header in 2121
1896
# 4168 calls to readlines in 330
1897
df = tuned_gzip.GzipFile(mode='rb', fileobj=StringIO(data))
1899
record_contents = df.readlines()
1900
except Exception, e:
1901
raise KnitCorrupt(self, "Corrupt compressed record %r, got %s(%s)" %
1902
(data, e.__class__.__name__, str(e)))
1903
header = record_contents.pop(0)
1904
rec = self._split_header(header)
1905
last_line = record_contents.pop()
1906
if len(record_contents) != int(rec[2]):
1907
raise KnitCorrupt(self,
1908
'incorrect number of lines %s != %s'
1909
' for version {%s} %s'
1910
% (len(record_contents), int(rec[2]),
1911
rec[1], record_contents))
1912
if last_line != 'end %s\n' % rec[1]:
1913
raise KnitCorrupt(self,
1914
'unexpected version end line %r, wanted %r'
1915
% (last_line, rec[1]))
1917
return rec, record_contents
1919
def _read_records_iter(self, records):
1920
"""Read text records from data file and yield result.
1922
The result will be returned in whatever is the fastest to read.
1923
Not by the order requested. Also, multiple requests for the same
1924
record will only yield 1 response.
1925
:param records: A list of (key, access_memo) entries
1926
:return: Yields (key, contents, digest) in the order
1927
read, not the order requested
1932
# XXX: This smells wrong, IO may not be getting ordered right.
1933
needed_records = sorted(set(records), key=operator.itemgetter(1))
1934
if not needed_records:
1937
# The transport optimizes the fetching as well
1938
# (ie, reads continuous ranges.)
1939
raw_data = self._access.get_raw_records(
1940
[index_memo for key, index_memo in needed_records])
1942
for (key, index_memo), data in \
1943
izip(iter(needed_records), raw_data):
1944
content, digest = self._parse_record(key[-1], data)
1945
yield key, content, digest
1947
def _read_records_iter_raw(self, records):
1948
"""Read text records from data file and yield raw data.
1950
This unpacks enough of the text record to validate the id is
1951
as expected but thats all.
1953
Each item the iterator yields is (key, bytes,
1954
expected_sha1_of_full_text).
1956
for key, data in self._read_records_iter_unchecked(records):
1957
# validate the header (note that we can only use the suffix in
1958
# current knit records).
1959
df, rec = self._parse_record_header(key, data)
1961
yield key, data, rec[3]
1963
def _read_records_iter_unchecked(self, records):
1964
"""Read text records from data file and yield raw data.
1966
No validation is done.
1968
Yields tuples of (key, data).
1970
# setup an iterator of the external records:
1971
# uses readv so nice and fast we hope.
1973
# grab the disk data needed.
1974
needed_offsets = [index_memo for key, index_memo
1976
raw_records = self._access.get_raw_records(needed_offsets)
1978
for key, index_memo in records:
1979
data = raw_records.next()
1982
def _record_to_data(self, key, digest, lines, dense_lines=None):
1983
"""Convert key, digest, lines into a raw data block.
1985
:param key: The key of the record. Currently keys are always serialised
1986
using just the trailing component.
1987
:param dense_lines: The bytes of lines but in a denser form. For
1988
instance, if lines is a list of 1000 bytestrings each ending in \n,
1989
dense_lines may be a list with one line in it, containing all the
1990
1000's lines and their \n's. Using dense_lines if it is already
1991
known is a win because the string join to create bytes in this
1992
function spends less time resizing the final string.
1993
:return: (len, a StringIO instance with the raw data ready to read.)
1995
chunks = ["version %s %d %s\n" % (key[-1], len(lines), digest)]
1996
chunks.extend(dense_lines or lines)
1997
chunks.append("end %s\n" % key[-1])
1998
for chunk in chunks:
1999
if type(chunk) is not str:
2000
raise AssertionError(
2001
'data must be plain bytes was %s' % type(chunk))
2002
if lines and lines[-1][-1] != '\n':
2003
raise ValueError('corrupt lines value %r' % lines)
2004
compressed_bytes = tuned_gzip.chunks_to_gzip(chunks)
2005
return len(compressed_bytes), compressed_bytes
2007
def _split_header(self, line):
2010
raise KnitCorrupt(self,
2011
'unexpected number of elements in record header')
2015
"""See VersionedFiles.keys."""
2016
if 'evil' in debug.debug_flags:
2017
trace.mutter_callsite(2, "keys scales with size of history")
2018
sources = [self._index] + self._fallback_vfs
2020
for source in sources:
2021
result.update(source.keys())
2025
class _ContentMapGenerator(object):
2026
"""Generate texts or expose raw deltas for a set of texts."""
2028
def __init__(self, ordering='unordered'):
2029
self._ordering = ordering
2031
def _get_content(self, key):
2032
"""Get the content object for key."""
2033
# Note that _get_content is only called when the _ContentMapGenerator
2034
# has been constructed with just one key requested for reconstruction.
2035
if key in self.nonlocal_keys:
2036
record = self.get_record_stream().next()
2037
# Create a content object on the fly
2038
lines = osutils.chunks_to_lines(record.get_bytes_as('chunked'))
2039
return PlainKnitContent(lines, record.key)
2041
# local keys we can ask for directly
2042
return self._get_one_work(key)
2044
def get_record_stream(self):
2045
"""Get a record stream for the keys requested during __init__."""
2046
for record in self._work():
2050
"""Produce maps of text and KnitContents as dicts.
830
The keys are version_ids, the values are tuples of (method, content,
832
method is the way the content should be applied.
833
content is a KnitContent object.
834
digest is the SHA1 digest of this version id after all steps are done
835
next is the build-parent of the version, i.e. the leftmost ancestor.
836
If the method is fulltext, next will be None.
838
position_map = self._get_components_positions(version_ids)
839
# c = component_id, m = method, i_m = index_memo, n = next
840
records = [(c, i_m) for c, (m, i_m, n) in position_map.iteritems()]
842
for component_id, content, digest in \
843
self._data.read_records_iter(records):
844
method, index_memo, next = position_map[component_id]
845
record_map[component_id] = method, content, digest, next
849
def get_text(self, version_id):
850
"""See VersionedFile.get_text"""
851
return self.get_texts([version_id])[0]
853
def get_texts(self, version_ids):
854
return [''.join(l) for l in self.get_line_list(version_ids)]
856
def get_line_list(self, version_ids):
857
"""Return the texts of listed versions as a list of strings."""
858
version_ids = [osutils.safe_revision_id(v) for v in version_ids]
859
for version_id in version_ids:
860
self.check_not_reserved_id(version_id)
861
text_map, content_map = self._get_content_maps(version_ids)
862
return [text_map[v] for v in version_ids]
864
_get_lf_split_line_list = get_line_list
866
def _get_content_maps(self, version_ids):
867
"""Produce maps of text and KnitContents
2052
869
:return: (text_map, content_map) where text_map contains the texts for
2053
the requested versions and content_map contains the KnitContents.
870
the requested versions and content_map contains the KnitContents.
871
Both dicts take version_ids as their keys.
2055
# NB: By definition we never need to read remote sources unless texts
2056
# are requested from them: we don't delta across stores - and we
2057
# explicitly do not want to to prevent data loss situations.
2058
if self.global_map is None:
2059
self.global_map = self.vf.get_parent_map(self.keys)
2060
nonlocal_keys = self.nonlocal_keys
2062
missing_keys = set(nonlocal_keys)
2063
# Read from remote versioned file instances and provide to our caller.
2064
for source in self.vf._fallback_vfs:
2065
if not missing_keys:
2067
# Loop over fallback repositories asking them for texts - ignore
2068
# any missing from a particular fallback.
2069
for record in source.get_record_stream(missing_keys,
2070
self._ordering, True):
2071
if record.storage_kind == 'absent':
2072
# Not in thie particular stream, may be in one of the
2073
# other fallback vfs objects.
2075
missing_keys.remove(record.key)
2078
if self._raw_record_map is None:
2079
raise AssertionError('_raw_record_map should have been filled')
2081
for key in self.keys:
2082
if key in self.nonlocal_keys:
2084
yield LazyKnitContentFactory(key, self.global_map[key], self, first)
2087
def _get_one_work(self, requested_key):
2088
# Now, if we have calculated everything already, just return the
2090
if requested_key in self._contents_map:
2091
return self._contents_map[requested_key]
2092
# To simplify things, parse everything at once - code that wants one text
2093
# probably wants them all.
2094
# FUTURE: This function could be improved for the 'extract many' case
2095
# by tracking each component and only doing the copy when the number of
2096
# children than need to apply delta's to it is > 1 or it is part of the
2098
multiple_versions = len(self.keys) != 1
2099
if self._record_map is None:
2100
self._record_map = self.vf._raw_map_to_record_map(
2101
self._raw_record_map)
2102
record_map = self._record_map
2103
# raw_record_map is key:
2104
# Have read and parsed records at this point.
2105
for key in self.keys:
2106
if key in self.nonlocal_keys:
873
for version_id in version_ids:
874
if not self.has_version(version_id):
875
raise RevisionNotPresent(version_id, self.filename)
876
record_map = self._get_record_map(version_ids)
881
for version_id in version_ids:
2111
884
while cursor is not None:
2113
record, record_details, digest, next = record_map[cursor]
2115
raise RevisionNotPresent(cursor, self)
2116
components.append((cursor, record, record_details, digest))
2118
if cursor in self._contents_map:
2119
# no need to plan further back
2120
components.append((cursor, None, None, None))
885
method, data, digest, next = record_map[cursor]
886
components.append((cursor, method, data, digest))
887
if cursor in content_map:
2124
for (component_id, record, record_details,
2125
digest) in reversed(components):
2126
if component_id in self._contents_map:
2127
content = self._contents_map[component_id]
892
for component_id, method, data, digest in reversed(components):
893
if component_id in content_map:
894
content = content_map[component_id]
2129
content, delta = self._factory.parse_record(key[-1],
2130
record, record_details, content,
2131
copy_base_content=multiple_versions)
2132
if multiple_versions:
2133
self._contents_map[component_id] = content
896
if method == 'fulltext':
897
assert content is None
898
content = self.factory.parse_fulltext(data, version_id)
899
elif method == 'line-delta':
900
delta = self.factory.parse_line_delta(data, version_id)
901
content = content.copy()
902
content._lines = self._apply_delta(content._lines,
904
content_map[component_id] = content
906
if 'no-eol' in self._index.get_options(version_id):
907
content = content.copy()
908
line = content._lines[-1][1].rstrip('\n')
909
content._lines[-1] = (content._lines[-1][0], line)
910
final_content[version_id] = content
2135
912
# digest here is the digest from the last applied component.
2136
913
text = content.text()
2137
actual_sha = sha_strings(text)
2138
if actual_sha != digest:
2139
raise SHA1KnitCorrupt(self, actual_sha, digest, key, text)
2140
if multiple_versions:
2141
return self._contents_map[requested_key]
2145
def _wire_bytes(self):
2146
"""Get the bytes to put on the wire for 'key'.
2148
The first collection of bytes asked for returns the serialised
2149
raw_record_map and the additional details (key, parent) for key.
2150
Subsequent calls return just the additional details (key, parent).
2151
The wire storage_kind given for the first key is 'knit-delta-closure',
2152
For subsequent keys it is 'knit-delta-closure-ref'.
2154
:param key: A key from the content generator.
2155
:return: Bytes to put on the wire.
2158
# kind marker for dispatch on the far side,
2159
lines.append('knit-delta-closure')
2161
if self.vf._factory.annotated:
2162
lines.append('annotated')
2165
# then the list of keys
2166
lines.append('\t'.join(['\x00'.join(key) for key in self.keys
2167
if key not in self.nonlocal_keys]))
2168
# then the _raw_record_map in serialised form:
2170
# for each item in the map:
2172
# 1 line with parents if the key is to be yielded (None: for None, '' for ())
2173
# one line with method
2174
# one line with noeol
2175
# one line with next ('' for None)
2176
# one line with byte count of the record bytes
2178
for key, (record_bytes, (method, noeol), next) in \
2179
self._raw_record_map.iteritems():
2180
key_bytes = '\x00'.join(key)
2181
parents = self.global_map.get(key, None)
2183
parent_bytes = 'None:'
2185
parent_bytes = '\t'.join('\x00'.join(key) for key in parents)
2186
method_bytes = method
2192
next_bytes = '\x00'.join(next)
2195
map_byte_list.append('%s\n%s\n%s\n%s\n%s\n%d\n%s' % (
2196
key_bytes, parent_bytes, method_bytes, noeol_bytes, next_bytes,
2197
len(record_bytes), record_bytes))
2198
map_bytes = ''.join(map_byte_list)
2199
lines.append(map_bytes)
2200
bytes = '\n'.join(lines)
2204
class _VFContentMapGenerator(_ContentMapGenerator):
2205
"""Content map generator reading from a VersionedFiles object."""
2207
def __init__(self, versioned_files, keys, nonlocal_keys=None,
2208
global_map=None, raw_record_map=None, ordering='unordered'):
2209
"""Create a _ContentMapGenerator.
2211
:param versioned_files: The versioned files that the texts are being
2213
:param keys: The keys to produce content maps for.
2214
:param nonlocal_keys: An iterable of keys(possibly intersecting keys)
2215
which are known to not be in this knit, but rather in one of the
2217
:param global_map: The result of get_parent_map(keys) (or a supermap).
2218
This is required if get_record_stream() is to be used.
2219
:param raw_record_map: A unparsed raw record map to use for answering
2222
_ContentMapGenerator.__init__(self, ordering=ordering)
2223
# The vf to source data from
2224
self.vf = versioned_files
2226
self.keys = list(keys)
2227
# Keys known to be in fallback vfs objects
2228
if nonlocal_keys is None:
2229
self.nonlocal_keys = set()
2231
self.nonlocal_keys = frozenset(nonlocal_keys)
2232
# Parents data for keys to be returned in get_record_stream
2233
self.global_map = global_map
2234
# The chunked lists for self.keys in text form
2236
# A cache of KnitContent objects used in extracting texts.
2237
self._contents_map = {}
2238
# All the knit records needed to assemble the requested keys as full
2240
self._record_map = None
2241
if raw_record_map is None:
2242
self._raw_record_map = self.vf._get_record_map_unparsed(keys,
2245
self._raw_record_map = raw_record_map
2246
# the factory for parsing records
2247
self._factory = self.vf._factory
2250
class _NetworkContentMapGenerator(_ContentMapGenerator):
2251
"""Content map generator sourced from a network stream."""
2253
def __init__(self, bytes, line_end):
2254
"""Construct a _NetworkContentMapGenerator from a bytes block."""
2256
self.global_map = {}
2257
self._raw_record_map = {}
2258
self._contents_map = {}
2259
self._record_map = None
2260
self.nonlocal_keys = []
2261
# Get access to record parsing facilities
2262
self.vf = KnitVersionedFiles(None, None)
2265
line_end = bytes.find('\n', start)
2266
line = bytes[start:line_end]
2267
start = line_end + 1
2268
if line == 'annotated':
2269
self._factory = KnitAnnotateFactory()
2271
self._factory = KnitPlainFactory()
2272
# list of keys to emit in get_record_stream
2273
line_end = bytes.find('\n', start)
2274
line = bytes[start:line_end]
2275
start = line_end + 1
2277
tuple(segment.split('\x00')) for segment in line.split('\t')
2279
# now a loop until the end. XXX: It would be nice if this was just a
2280
# bunch of the same records as get_record_stream(..., False) gives, but
2281
# there is a decent sized gap stopping that at the moment.
2285
line_end = bytes.find('\n', start)
2286
key = tuple(bytes[start:line_end].split('\x00'))
2287
start = line_end + 1
2288
# 1 line with parents (None: for None, '' for ())
2289
line_end = bytes.find('\n', start)
2290
line = bytes[start:line_end]
2295
[tuple(segment.split('\x00')) for segment in line.split('\t')
2297
self.global_map[key] = parents
2298
start = line_end + 1
2299
# one line with method
2300
line_end = bytes.find('\n', start)
2301
line = bytes[start:line_end]
2303
start = line_end + 1
2304
# one line with noeol
2305
line_end = bytes.find('\n', start)
2306
line = bytes[start:line_end]
2308
start = line_end + 1
2309
# one line with next ('' for None)
2310
line_end = bytes.find('\n', start)
2311
line = bytes[start:line_end]
2315
next = tuple(bytes[start:line_end].split('\x00'))
2316
start = line_end + 1
2317
# one line with byte count of the record bytes
2318
line_end = bytes.find('\n', start)
2319
line = bytes[start:line_end]
2321
start = line_end + 1
2323
record_bytes = bytes[start:start+count]
2324
start = start + count
2326
self._raw_record_map[key] = (record_bytes, (method, noeol), next)
2328
def get_record_stream(self):
2329
"""Get a record stream for for keys requested by the bytestream."""
2331
for key in self.keys:
2332
yield LazyKnitContentFactory(key, self.global_map[key], self, first)
2335
def _wire_bytes(self):
2339
class _KndxIndex(object):
2340
"""Manages knit index files
2342
The index is kept in memory and read on startup, to enable
914
if sha_strings(text) != digest:
915
raise KnitCorrupt(self.filename,
916
'sha-1 does not match %s' % version_id)
918
text_map[version_id] = text
919
return text_map, final_content
921
def iter_lines_added_or_present_in_versions(self, version_ids=None,
923
"""See VersionedFile.iter_lines_added_or_present_in_versions()."""
924
if version_ids is None:
925
version_ids = self.versions()
927
version_ids = [osutils.safe_revision_id(v) for v in version_ids]
929
pb = progress.DummyProgress()
930
# we don't care about inclusions, the caller cares.
931
# but we need to setup a list of records to visit.
932
# we need version_id, position, length
933
version_id_records = []
934
requested_versions = set(version_ids)
935
# filter for available versions
936
for version_id in requested_versions:
937
if not self.has_version(version_id):
938
raise RevisionNotPresent(version_id, self.filename)
939
# get a in-component-order queue:
940
for version_id in self.versions():
941
if version_id in requested_versions:
942
index_memo = self._index.get_position(version_id)
943
version_id_records.append((version_id, index_memo))
945
total = len(version_id_records)
946
for version_idx, (version_id, data, sha_value) in \
947
enumerate(self._data.read_records_iter(version_id_records)):
948
pb.update('Walking content.', version_idx, total)
949
method = self._index.get_method(version_id)
951
assert method in ('fulltext', 'line-delta')
952
if method == 'fulltext':
953
line_iterator = self.factory.get_fulltext_content(data)
955
line_iterator = self.factory.get_linedelta_content(data)
956
for line in line_iterator:
959
pb.update('Walking content.', total, total)
961
def iter_parents(self, version_ids):
962
"""Iterate through the parents for many version ids.
964
:param version_ids: An iterable yielding version_ids.
965
:return: An iterator that yields (version_id, parents). Requested
966
version_ids not present in the versioned file are simply skipped.
967
The order is undefined, allowing for different optimisations in
968
the underlying implementation.
970
version_ids = [osutils.safe_revision_id(version_id) for
971
version_id in version_ids]
972
return self._index.iter_parents(version_ids)
974
def num_versions(self):
975
"""See VersionedFile.num_versions()."""
976
return self._index.num_versions()
978
__len__ = num_versions
980
def annotate_iter(self, version_id):
981
"""See VersionedFile.annotate_iter."""
982
version_id = osutils.safe_revision_id(version_id)
983
content = self._get_content(version_id)
984
for origin, text in content.annotate_iter():
987
def get_parents(self, version_id):
988
"""See VersionedFile.get_parents."""
991
# 52554 calls in 1264 872 internal down from 3674
992
version_id = osutils.safe_revision_id(version_id)
994
return self._index.get_parents(version_id)
996
raise RevisionNotPresent(version_id, self.filename)
998
def get_parents_with_ghosts(self, version_id):
999
"""See VersionedFile.get_parents."""
1000
version_id = osutils.safe_revision_id(version_id)
1002
return self._index.get_parents_with_ghosts(version_id)
1004
raise RevisionNotPresent(version_id, self.filename)
1006
def get_ancestry(self, versions, topo_sorted=True):
1007
"""See VersionedFile.get_ancestry."""
1008
if isinstance(versions, basestring):
1009
versions = [versions]
1012
versions = [osutils.safe_revision_id(v) for v in versions]
1013
return self._index.get_ancestry(versions, topo_sorted)
1015
def get_ancestry_with_ghosts(self, versions):
1016
"""See VersionedFile.get_ancestry_with_ghosts."""
1017
if isinstance(versions, basestring):
1018
versions = [versions]
1021
versions = [osutils.safe_revision_id(v) for v in versions]
1022
return self._index.get_ancestry_with_ghosts(versions)
1024
#@deprecated_method(zero_eight)
1025
def walk(self, version_ids):
1026
"""See VersionedFile.walk."""
1027
# We take the short path here, and extract all relevant texts
1028
# and put them in a weave and let that do all the work. Far
1029
# from optimal, but is much simpler.
1030
# FIXME RB 20060228 this really is inefficient!
1031
from bzrlib.weave import Weave
1033
w = Weave(self.filename)
1034
ancestry = set(self.get_ancestry(version_ids, topo_sorted=False))
1035
sorted_graph = topo_sort(self._index.get_graph())
1036
version_list = [vid for vid in sorted_graph if vid in ancestry]
1038
for version_id in version_list:
1039
lines = self.get_lines(version_id)
1040
w.add_lines(version_id, self.get_parents(version_id), lines)
1042
for lineno, insert_id, dset, line in w.walk(version_ids):
1043
yield lineno, insert_id, dset, line
1045
def plan_merge(self, ver_a, ver_b):
1046
"""See VersionedFile.plan_merge."""
1047
ver_a = osutils.safe_revision_id(ver_a)
1048
ver_b = osutils.safe_revision_id(ver_b)
1049
ancestors_b = set(self.get_ancestry(ver_b, topo_sorted=False))
1051
ancestors_a = set(self.get_ancestry(ver_a, topo_sorted=False))
1052
annotated_a = self.annotate(ver_a)
1053
annotated_b = self.annotate(ver_b)
1054
return merge._plan_annotate_merge(annotated_a, annotated_b,
1055
ancestors_a, ancestors_b)
1058
class _KnitComponentFile(object):
1059
"""One of the files used to implement a knit database"""
1061
def __init__(self, transport, filename, mode, file_mode=None,
1062
create_parent_dir=False, dir_mode=None):
1063
self._transport = transport
1064
self._filename = filename
1066
self._file_mode = file_mode
1067
self._dir_mode = dir_mode
1068
self._create_parent_dir = create_parent_dir
1069
self._need_to_create = False
1071
def _full_path(self):
1072
"""Return the full path to this file."""
1073
return self._transport.base + self._filename
1075
def check_header(self, fp):
1076
line = fp.readline()
1078
# An empty file can actually be treated as though the file doesn't
1080
raise errors.NoSuchFile(self._full_path())
1081
if line != self.HEADER:
1082
raise KnitHeaderError(badline=line,
1083
filename=self._transport.abspath(self._filename))
1086
return '%s(%s)' % (self.__class__.__name__, self._filename)
1089
class _KnitIndex(_KnitComponentFile):
1090
"""Manages knit index file.
1092
The index is already kept in memory and read on startup, to enable
2343
1093
fast lookups of revision information. The cursor of the index
2344
1094
file is always pointing to the end, making it easy to append
2387
1137
to ensure that records always start on new lines even if the last write was
2388
1138
interrupted. As a result its normal for the last line in the index to be
2389
1139
missing a trailing newline. One can be added with no harmful effects.
2391
:ivar _kndx_cache: dict from prefix to the old state of KnitIndex objects,
2392
where prefix is e.g. the (fileid,) for .texts instances or () for
2393
constant-mapped things like .revisions, and the old state is
2394
tuple(history_vector, cache_dict). This is used to prevent having an
2395
ABI change with the C extension that reads .kndx files.
2398
1142
HEADER = "# bzr knit index 8\n"
2400
def __init__(self, transport, mapper, get_scope, allow_writes, is_locked):
2401
"""Create a _KndxIndex on transport using mapper."""
2402
self._transport = transport
2403
self._mapper = mapper
2404
self._get_scope = get_scope
2405
self._allow_writes = allow_writes
2406
self._is_locked = is_locked
2408
self.has_graph = True
2410
def add_records(self, records, random_id=False, missing_compression_parents=False):
2411
"""Add multiple records to the index.
2413
:param records: a list of tuples:
2414
(key, options, access_memo, parents).
2415
:param random_id: If True the ids being added were randomly generated
2416
and no check for existence will be performed.
2417
:param missing_compression_parents: If True the records being added are
2418
only compressed against texts already in the index (or inside
2419
records). If False the records all refer to unavailable texts (or
2420
texts inside records) as compression parents.
2422
if missing_compression_parents:
2423
# It might be nice to get the edge of the records. But keys isn't
2425
keys = sorted(record[0] for record in records)
2426
raise errors.RevisionNotPresent(keys, self)
2428
for record in records:
2431
path = self._mapper.map(key) + '.kndx'
2432
path_keys = paths.setdefault(path, (prefix, []))
2433
path_keys[1].append(record)
2434
for path in sorted(paths):
2435
prefix, path_keys = paths[path]
2436
self._load_prefixes([prefix])
2438
orig_history = self._kndx_cache[prefix][1][:]
2439
orig_cache = self._kndx_cache[prefix][0].copy()
2442
for key, options, (_, pos, size), parents in path_keys:
2444
# kndx indices cannot be parentless.
2446
line = "\n%s %s %s %s %s :" % (
2447
key[-1], ','.join(options), pos, size,
2448
self._dictionary_compress(parents))
2449
if type(line) is not str:
2450
raise AssertionError(
2451
'data must be utf8 was %s' % type(line))
2453
self._cache_key(key, options, pos, size, parents)
2454
if len(orig_history):
2455
self._transport.append_bytes(path, ''.join(lines))
2457
self._init_index(path, lines)
2459
# If any problems happen, restore the original values and re-raise
2460
self._kndx_cache[prefix] = (orig_cache, orig_history)
2463
def scan_unvalidated_index(self, graph_index):
2464
"""See _KnitGraphIndex.scan_unvalidated_index."""
2465
# Because kndx files do not support atomic insertion via separate index
2466
# files, they do not support this method.
2467
raise NotImplementedError(self.scan_unvalidated_index)
2469
def get_missing_compression_parents(self):
2470
"""See _KnitGraphIndex.get_missing_compression_parents."""
2471
# Because kndx files do not support atomic insertion via separate index
2472
# files, they do not support this method.
2473
raise NotImplementedError(self.get_missing_compression_parents)
2475
def _cache_key(self, key, options, pos, size, parent_keys):
1144
# speed of knit parsing went from 280 ms to 280 ms with slots addition.
1145
# __slots__ = ['_cache', '_history', '_transport', '_filename']
1147
def _cache_version(self, version_id, options, pos, size, parents):
2476
1148
"""Cache a version record in the history array and index cache.
2478
1150
This is inlined into _load_data for performance. KEEP IN SYNC.
2479
1151
(It saves 60ms, 25% of the __init__ overhead on local 4000 record
2483
version_id = key[-1]
2484
# last-element only for compatibilty with the C load_data.
2485
parents = tuple(parent[-1] for parent in parent_keys)
2486
for parent in parent_keys:
2487
if parent[:-1] != prefix:
2488
raise ValueError("mismatched prefixes for %r, %r" % (
2490
cache, history = self._kndx_cache[prefix]
2491
1154
# only want the _history index to reference the 1st index entry
2492
1155
# for version_id
2493
if version_id not in cache:
2494
index = len(history)
2495
history.append(version_id)
1156
if version_id not in self._cache:
1157
index = len(self._history)
1158
self._history.append(version_id)
2497
index = cache[version_id][5]
2498
cache[version_id] = (version_id,
1160
index = self._cache[version_id][5]
1161
self._cache[version_id] = (version_id,
2505
def check_header(self, fp):
2506
line = fp.readline()
2508
# An empty file can actually be treated as though the file doesn't
2510
raise errors.NoSuchFile(self)
2511
if line != self.HEADER:
2512
raise KnitHeaderError(badline=line, filename=self)
2514
def _check_read(self):
2515
if not self._is_locked():
2516
raise errors.ObjectNotLocked(self)
2517
if self._get_scope() != self._scope:
2520
def _check_write_ok(self):
2521
"""Assert if not writes are permitted."""
2522
if not self._is_locked():
2523
raise errors.ObjectNotLocked(self)
2524
if self._get_scope() != self._scope:
2526
if self._mode != 'w':
2527
raise errors.ReadOnlyObjectDirtiedError(self)
2529
def get_build_details(self, keys):
2530
"""Get the method, index_memo and compression parent for keys.
2532
Ghosts are omitted from the result.
2534
:param keys: An iterable of keys.
2535
:return: A dict of key:(index_memo, compression_parent, parents,
2538
opaque structure to pass to read_records to extract the raw
2541
Content that this record is built upon, may be None
2543
Logical parents of this node
2545
extra information about the content which needs to be passed to
2546
Factory.parse_record
2548
parent_map = self.get_parent_map(keys)
2551
if key not in parent_map:
2553
method = self.get_method(key)
2554
parents = parent_map[key]
2555
if method == 'fulltext':
2556
compression_parent = None
2558
compression_parent = parents[0]
2559
noeol = 'no-eol' in self.get_options(key)
2560
index_memo = self.get_position(key)
2561
result[key] = (index_memo, compression_parent,
2562
parents, (method, noeol))
2565
def get_method(self, key):
2566
"""Return compression method of specified key."""
2567
options = self.get_options(key)
2568
if 'fulltext' in options:
2570
elif 'line-delta' in options:
2573
raise errors.KnitIndexUnknownMethod(self, options)
2575
def get_options(self, key):
2576
"""Return a list representing options.
2580
prefix, suffix = self._split_key(key)
2581
self._load_prefixes([prefix])
1168
def __init__(self, transport, filename, mode, create=False, file_mode=None,
1169
create_parent_dir=False, delay_create=False, dir_mode=None):
1170
_KnitComponentFile.__init__(self, transport, filename, mode,
1171
file_mode=file_mode,
1172
create_parent_dir=create_parent_dir,
1175
# position in _history is the 'official' index for a revision
1176
# but the values may have come from a newer entry.
1177
# so - wc -l of a knit index is != the number of unique names
2583
return self._kndx_cache[prefix][0][suffix][1]
2585
raise RevisionNotPresent(key, self)
2587
def find_ancestry(self, keys):
2588
"""See CombinedGraphIndex.find_ancestry()"""
2589
prefixes = set(key[:-1] for key in keys)
2590
self._load_prefixes(prefixes)
2593
missing_keys = set()
2594
pending_keys = list(keys)
2595
# This assumes that keys will not reference parents in a different
2596
# prefix, which is accurate so far.
2598
key = pending_keys.pop()
2599
if key in parent_map:
2603
suffix_parents = self._kndx_cache[prefix][0][key[-1]][4]
2605
missing_keys.add(key)
2607
parent_keys = tuple([prefix + (suffix,)
2608
for suffix in suffix_parents])
2609
parent_map[key] = parent_keys
2610
pending_keys.extend([p for p in parent_keys
2611
if p not in parent_map])
2612
return parent_map, missing_keys
2614
def get_parent_map(self, keys):
2615
"""Get a map of the parents of keys.
2617
:param keys: The keys to look up parents for.
2618
:return: A mapping from keys to parents. Absent keys are absent from
1181
fp = self._transport.get(self._filename)
1183
# _load_data may raise NoSuchFile if the target knit is
1185
_load_data(self, fp)
1189
if mode != 'w' or not create:
1192
self._need_to_create = True
1194
self._transport.put_bytes_non_atomic(
1195
self._filename, self.HEADER, mode=self._file_mode)
1197
def get_graph(self):
1198
"""Return a list of the node:parents lists from this knit index."""
1199
return [(vid, idx[4]) for vid, idx in self._cache.iteritems()]
1201
def get_ancestry(self, versions, topo_sorted=True):
1202
"""See VersionedFile.get_ancestry."""
1203
# get a graph of all the mentioned versions:
1205
pending = set(versions)
1208
version = pending.pop()
1211
parents = [p for p in cache[version][4] if p in cache]
1213
raise RevisionNotPresent(version, self._filename)
1214
# if not completed and not a ghost
1215
pending.update([p for p in parents if p not in graph])
1216
graph[version] = parents
1219
return topo_sort(graph.items())
1221
def get_ancestry_with_ghosts(self, versions):
1222
"""See VersionedFile.get_ancestry_with_ghosts."""
1223
# get a graph of all the mentioned versions:
1224
self.check_versions_present(versions)
1227
pending = set(versions)
1229
version = pending.pop()
1231
parents = cache[version][4]
1237
pending.update([p for p in parents if p not in graph])
1238
graph[version] = parents
1239
return topo_sort(graph.items())
1241
def iter_parents(self, version_ids):
1242
"""Iterate through the parents for many version ids.
1244
:param version_ids: An iterable yielding version_ids.
1245
:return: An iterator that yields (version_id, parents). Requested
1246
version_ids not present in the versioned file are simply skipped.
1247
The order is undefined, allowing for different optimisations in
1248
the underlying implementation.
2621
# Parse what we need to up front, this potentially trades off I/O
2622
# locality (.kndx and .knit in the same block group for the same file
2623
# id) for less checking in inner loops.
2624
prefixes = set(key[:-1] for key in keys)
2625
self._load_prefixes(prefixes)
1250
for version_id in version_ids:
2630
suffix_parents = self._kndx_cache[prefix][0][key[-1]][4]
1252
yield version_id, tuple(self.get_parents(version_id))
2631
1253
except KeyError:
2634
result[key] = tuple(prefix + (suffix,) for
2635
suffix in suffix_parents)
2638
def get_position(self, key):
2639
"""Return details needed to access the version.
2641
:return: a tuple (key, data position, size) to hand to the access
2642
logic to get the record.
2644
prefix, suffix = self._split_key(key)
2645
self._load_prefixes([prefix])
2646
entry = self._kndx_cache[prefix][0][suffix]
2647
return key, entry[2], entry[3]
2649
has_key = _mod_index._has_key_from_parent_map
2651
def _init_index(self, path, extra_lines=[]):
2652
"""Initialize an index."""
2654
sio.write(self.HEADER)
2655
sio.writelines(extra_lines)
2657
self._transport.put_file_non_atomic(path, sio,
2658
create_parent_dir=True)
2659
# self._create_parent_dir)
2660
# mode=self._file_mode,
2661
# dir_mode=self._dir_mode)
2664
"""Get all the keys in the collection.
2666
The keys are not ordered.
2669
# Identify all key prefixes.
2670
# XXX: A bit hacky, needs polish.
2671
if type(self._mapper) is ConstantMapper:
2675
for quoted_relpath in self._transport.iter_files_recursive():
2676
path, ext = os.path.splitext(quoted_relpath)
2678
prefixes = [self._mapper.unmap(path) for path in relpaths]
2679
self._load_prefixes(prefixes)
2680
for prefix in prefixes:
2681
for suffix in self._kndx_cache[prefix][1]:
2682
result.add(prefix + (suffix,))
2685
def _load_prefixes(self, prefixes):
2686
"""Load the indices for prefixes."""
2688
for prefix in prefixes:
2689
if prefix not in self._kndx_cache:
2690
# the load_data interface writes to these variables.
2693
self._filename = prefix
2695
path = self._mapper.map(prefix) + '.kndx'
2696
fp = self._transport.get(path)
2698
# _load_data may raise NoSuchFile if the target knit is
2700
_load_data(self, fp)
2703
self._kndx_cache[prefix] = (self._cache, self._history)
2708
self._kndx_cache[prefix] = ({}, [])
2709
if type(self._mapper) is ConstantMapper:
2710
# preserve behaviour for revisions.kndx etc.
2711
self._init_index(path)
2716
missing_keys = _mod_index._missing_keys_from_parent_map
2718
def _partition_keys(self, keys):
2719
"""Turn keys into a dict of prefix:suffix_list."""
2722
prefix_keys = result.setdefault(key[:-1], [])
2723
prefix_keys.append(key[-1])
2726
def _dictionary_compress(self, keys):
2727
"""Dictionary compress keys.
2729
:param keys: The keys to generate references to.
2730
:return: A string representation of keys. keys which are present are
2731
dictionary compressed, and others are emitted as fulltext with a
1256
def num_versions(self):
1257
return len(self._history)
1259
__len__ = num_versions
1261
def get_versions(self):
1262
"""Get all the versions in the file. not topologically sorted."""
1263
return self._history
1265
def _version_list_to_index(self, versions):
2736
1266
result_list = []
2737
prefix = keys[0][:-1]
2738
cache = self._kndx_cache[prefix][0]
2740
if key[:-1] != prefix:
2741
# kndx indices cannot refer across partitioned storage.
2742
raise ValueError("mismatched prefixes for %r" % keys)
2743
if key[-1] in cache:
1268
for version in versions:
1269
if version in cache:
2744
1270
# -- inlined lookup() --
2745
result_list.append(str(cache[key[-1]][5]))
1271
result_list.append(str(cache[version][5]))
2746
1272
# -- end lookup () --
2748
result_list.append('.' + key[-1])
1274
result_list.append('.' + version)
2749
1275
return ' '.join(result_list)
2751
def _reset_cache(self):
2752
# Possibly this should be a LRU cache. A dictionary from key_prefix to
2753
# (cache_dict, history_vector) for parsed kndx files.
2754
self._kndx_cache = {}
2755
self._scope = self._get_scope()
2756
allow_writes = self._allow_writes()
2762
def _sort_keys_by_io(self, keys, positions):
2763
"""Figure out an optimal order to read the records for the given keys.
2765
Sort keys, grouped by index and sorted by position.
2767
:param keys: A list of keys whose records we want to read. This will be
2769
:param positions: A dict, such as the one returned by
2770
_get_components_positions()
1277
def add_version(self, version_id, options, index_memo, parents):
1278
"""Add a version record to the index."""
1279
self.add_versions(((version_id, options, index_memo, parents),))
1281
def add_versions(self, versions):
1282
"""Add multiple versions to the index.
1284
:param versions: a list of tuples:
1285
(version_id, options, pos, size, parents).
2773
def get_sort_key(key):
2774
index_memo = positions[key][1]
2775
# Group by prefix and position. index_memo[0] is the key, so it is
2776
# (file_id, revision_id) and we don't want to sort on revision_id,
2777
# index_memo[1] is the position, and index_memo[2] is the size,
2778
# which doesn't matter for the sort
2779
return index_memo[0][:-1], index_memo[1]
2780
return keys.sort(key=get_sort_key)
2782
_get_total_build_size = _get_total_build_size
2784
def _split_key(self, key):
2785
"""Split key into a prefix and suffix."""
2786
return key[:-1], key[-1]
2789
class _KeyRefs(object):
2791
def __init__(self, track_new_keys=False):
2792
# dict mapping 'key' to 'set of keys referring to that key'
2795
# set remembering all new keys
2796
self.new_keys = set()
2798
self.new_keys = None
2804
self.new_keys.clear()
2806
def add_references(self, key, refs):
2807
# Record the new references
2808
for referenced in refs:
2810
needed_by = self.refs[referenced]
2812
needed_by = self.refs[referenced] = set()
2814
# Discard references satisfied by the new key
2817
def get_new_keys(self):
2818
return self.new_keys
2820
def get_unsatisfied_refs(self):
2821
return self.refs.iterkeys()
2823
def _satisfy_refs_for_key(self, key):
1288
orig_history = self._history[:]
1289
orig_cache = self._cache.copy()
2827
# No keys depended on this key. That's ok.
2830
def add_key(self, key):
2831
# satisfy refs for key, and remember that we've seen this key.
2832
self._satisfy_refs_for_key(key)
2833
if self.new_keys is not None:
2834
self.new_keys.add(key)
2836
def satisfy_refs_for_keys(self, keys):
2838
self._satisfy_refs_for_key(key)
2840
def get_referrers(self):
2842
for referrers in self.refs.itervalues():
2843
result.update(referrers)
2847
class _KnitGraphIndex(object):
2848
"""A KnitVersionedFiles index layered on GraphIndex."""
2850
def __init__(self, graph_index, is_locked, deltas=False, parents=True,
2851
add_callback=None, track_external_parent_refs=False):
1292
for version_id, options, (index, pos, size), parents in versions:
1293
line = "\n%s %s %s %s %s :" % (version_id,
1297
self._version_list_to_index(parents))
1298
assert isinstance(line, str), \
1299
'content must be utf-8 encoded: %r' % (line,)
1301
self._cache_version(version_id, options, pos, size, parents)
1302
if not self._need_to_create:
1303
self._transport.append_bytes(self._filename, ''.join(lines))
1306
sio.write(self.HEADER)
1307
sio.writelines(lines)
1309
self._transport.put_file_non_atomic(self._filename, sio,
1310
create_parent_dir=self._create_parent_dir,
1311
mode=self._file_mode,
1312
dir_mode=self._dir_mode)
1313
self._need_to_create = False
1315
# If any problems happen, restore the original values and re-raise
1316
self._history = orig_history
1317
self._cache = orig_cache
1320
def has_version(self, version_id):
1321
"""True if the version is in the index."""
1322
return version_id in self._cache
1324
def get_position(self, version_id):
1325
"""Return details needed to access the version.
1327
.kndx indices do not support split-out data, so return None for the
1330
:return: a tuple (None, data position, size) to hand to the access
1331
logic to get the record.
1333
entry = self._cache[version_id]
1334
return None, entry[2], entry[3]
1336
def get_method(self, version_id):
1337
"""Return compression method of specified version."""
1338
options = self._cache[version_id][1]
1339
if 'fulltext' in options:
1342
if 'line-delta' not in options:
1343
raise errors.KnitIndexUnknownMethod(self._full_path(), options)
1346
def get_options(self, version_id):
1347
"""Return a string represention options.
1351
return self._cache[version_id][1]
1353
def get_parents(self, version_id):
1354
"""Return parents of specified version ignoring ghosts."""
1355
return [parent for parent in self._cache[version_id][4]
1356
if parent in self._cache]
1358
def get_parents_with_ghosts(self, version_id):
1359
"""Return parents of specified version with ghosts."""
1360
return self._cache[version_id][4]
1362
def check_versions_present(self, version_ids):
1363
"""Check that all specified versions are present."""
1365
for version_id in version_ids:
1366
if version_id not in cache:
1367
raise RevisionNotPresent(version_id, self._filename)
1370
class KnitGraphIndex(object):
1371
"""A knit index that builds on GraphIndex."""
1373
def __init__(self, graph_index, deltas=False, parents=True, add_callback=None):
2852
1374
"""Construct a KnitGraphIndex on a graph_index.
2854
1376
:param graph_index: An implementation of bzrlib.index.GraphIndex.
2855
:param is_locked: A callback to check whether the object should answer
2857
1377
:param deltas: Allow delta-compressed records.
2858
:param parents: If True, record knits parents, if not do not record
2860
1378
:param add_callback: If not None, allow additions to the index and call
2861
1379
this callback with a list of added GraphIndex nodes:
2862
1380
[(node, value, node_refs), ...]
2863
:param is_locked: A callback, returns True if the index is locked and
2865
:param track_external_parent_refs: If True, record all external parent
2866
references parents from added records. These can be retrieved
2867
later by calling get_missing_parents().
1381
:param parents: If True, record knits parents, if not do not record
2869
self._add_callback = add_callback
2870
1384
self._graph_index = graph_index
2871
1385
self._deltas = deltas
1386
self._add_callback = add_callback
2872
1387
self._parents = parents
2873
1388
if deltas and not parents:
2874
# XXX: TODO: Delta tree and parent graph should be conceptually
2876
1389
raise KnitCorrupt(self, "Cannot do delta compression without "
2877
1390
"parent tracking.")
2878
self.has_graph = parents
2879
self._is_locked = is_locked
2880
self._missing_compression_parents = set()
2881
if track_external_parent_refs:
2882
self._key_dependencies = _KeyRefs()
2884
self._key_dependencies = None
2887
return "%s(%r)" % (self.__class__.__name__, self._graph_index)
2889
def add_records(self, records, random_id=False,
2890
missing_compression_parents=False):
2891
"""Add multiple records to the index.
1392
def _get_entries(self, keys, check_present=False):
1393
"""Get the entries for keys.
1395
:param keys: An iterable of index keys, - 1-tuples.
1400
for node in self._graph_index.iter_entries(keys):
1402
found_keys.add(node[1])
1404
# adapt parentless index to the rest of the code.
1405
for node in self._graph_index.iter_entries(keys):
1406
yield node[0], node[1], node[2], ()
1407
found_keys.add(node[1])
1409
missing_keys = keys.difference(found_keys)
1411
raise RevisionNotPresent(missing_keys.pop(), self)
1413
def _present_keys(self, version_ids):
1415
node[1] for node in self._get_entries(version_ids)])
1417
def _parentless_ancestry(self, versions):
1418
"""Honour the get_ancestry API for parentless knit indices."""
1419
wanted_keys = self._version_ids_to_keys(versions)
1420
present_keys = self._present_keys(wanted_keys)
1421
missing = set(wanted_keys).difference(present_keys)
1423
raise RevisionNotPresent(missing.pop(), self)
1424
return list(self._keys_to_version_ids(present_keys))
1426
def get_ancestry(self, versions, topo_sorted=True):
1427
"""See VersionedFile.get_ancestry."""
1428
if not self._parents:
1429
return self._parentless_ancestry(versions)
1430
# XXX: This will do len(history) index calls - perhaps
1431
# it should be altered to be a index core feature?
1432
# get a graph of all the mentioned versions:
1435
versions = self._version_ids_to_keys(versions)
1436
pending = set(versions)
1438
# get all pending nodes
1439
this_iteration = pending
1440
new_nodes = self._get_entries(this_iteration)
1443
for (index, key, value, node_refs) in new_nodes:
1444
# dont ask for ghosties - otherwise
1445
# we we can end up looping with pending
1446
# being entirely ghosted.
1447
graph[key] = [parent for parent in node_refs[0]
1448
if parent not in ghosts]
1450
for parent in graph[key]:
1451
# dont examine known nodes again
1456
ghosts.update(this_iteration.difference(found))
1457
if versions.difference(graph):
1458
raise RevisionNotPresent(versions.difference(graph).pop(), self)
1460
result_keys = topo_sort(graph.items())
1462
result_keys = graph.iterkeys()
1463
return [key[0] for key in result_keys]
1465
def get_ancestry_with_ghosts(self, versions):
1466
"""See VersionedFile.get_ancestry."""
1467
if not self._parents:
1468
return self._parentless_ancestry(versions)
1469
# XXX: This will do len(history) index calls - perhaps
1470
# it should be altered to be a index core feature?
1471
# get a graph of all the mentioned versions:
1473
versions = self._version_ids_to_keys(versions)
1474
pending = set(versions)
1476
# get all pending nodes
1477
this_iteration = pending
1478
new_nodes = self._get_entries(this_iteration)
1480
for (index, key, value, node_refs) in new_nodes:
1481
graph[key] = node_refs[0]
1483
for parent in graph[key]:
1484
# dont examine known nodes again
1488
missing_versions = this_iteration.difference(graph)
1489
missing_needed = versions.intersection(missing_versions)
1491
raise RevisionNotPresent(missing_needed.pop(), self)
1492
for missing_version in missing_versions:
1493
# add a key, no parents
1494
graph[missing_version] = []
1495
pending.discard(missing_version) # don't look for it
1496
result_keys = topo_sort(graph.items())
1497
return [key[0] for key in result_keys]
1499
def get_graph(self):
1500
"""Return a list of the node:parents lists from this knit index."""
1501
if not self._parents:
1502
return [(key, ()) for key in self.get_versions()]
1504
for index, key, value, refs in self._graph_index.iter_all_entries():
1505
result.append((key[0], tuple([ref[0] for ref in refs[0]])))
1508
def iter_parents(self, version_ids):
1509
"""Iterate through the parents for many version ids.
1511
:param version_ids: An iterable yielding version_ids.
1512
:return: An iterator that yields (version_id, parents). Requested
1513
version_ids not present in the versioned file are simply skipped.
1514
The order is undefined, allowing for different optimisations in
1515
the underlying implementation.
1518
all_nodes = set(self._get_entries(self._version_ids_to_keys(version_ids)))
1520
present_parents = set()
1521
for node in all_nodes:
1522
all_parents.update(node[3][0])
1523
# any node we are querying must be present
1524
present_parents.add(node[1])
1525
unknown_parents = all_parents.difference(present_parents)
1526
present_parents.update(self._present_keys(unknown_parents))
1527
for node in all_nodes:
1529
for parent in node[3][0]:
1530
if parent in present_parents:
1531
parents.append(parent[0])
1532
yield node[1][0], tuple(parents)
1534
for node in self._get_entries(self._version_ids_to_keys(version_ids)):
1535
yield node[1][0], ()
1537
def num_versions(self):
1538
return len(list(self._graph_index.iter_all_entries()))
1540
__len__ = num_versions
1542
def get_versions(self):
1543
"""Get all the versions in the file. not topologically sorted."""
1544
return [node[1][0] for node in self._graph_index.iter_all_entries()]
1546
def has_version(self, version_id):
1547
"""True if the version is in the index."""
1548
return len(self._present_keys(self._version_ids_to_keys([version_id]))) == 1
1550
def _keys_to_version_ids(self, keys):
1551
return tuple(key[0] for key in keys)
1553
def get_position(self, version_id):
1554
"""Return details needed to access the version.
1556
:return: a tuple (index, data position, size) to hand to the access
1557
logic to get the record.
1559
node = self._get_node(version_id)
1560
bits = node[2][1:].split(' ')
1561
return node[0], int(bits[0]), int(bits[1])
1563
def get_method(self, version_id):
1564
"""Return compression method of specified version."""
1565
if not self._deltas:
1567
return self._parent_compression(self._get_node(version_id)[3][1])
1569
def _parent_compression(self, reference_list):
1570
# use the second reference list to decide if this is delta'd or not.
1571
if len(reference_list):
1576
def _get_node(self, version_id):
1577
return list(self._get_entries(self._version_ids_to_keys([version_id])))[0]
1579
def get_options(self, version_id):
1580
"""Return a string represention options.
1584
node = self._get_node(version_id)
1585
if not self._deltas:
1586
options = ['fulltext']
1588
options = [self._parent_compression(node[3][1])]
1589
if node[2][0] == 'N':
1590
options.append('no-eol')
1593
def get_parents(self, version_id):
1594
"""Return parents of specified version ignoring ghosts."""
1595
parents = list(self.iter_parents([version_id]))
1598
raise errors.RevisionNotPresent(version_id, self)
1599
return parents[0][1]
1601
def get_parents_with_ghosts(self, version_id):
1602
"""Return parents of specified version with ghosts."""
1603
nodes = list(self._get_entries(self._version_ids_to_keys([version_id]),
1604
check_present=True))
1605
if not self._parents:
1607
return self._keys_to_version_ids(nodes[0][3][0])
1609
def check_versions_present(self, version_ids):
1610
"""Check that all specified versions are present."""
1611
keys = self._version_ids_to_keys(version_ids)
1612
present = self._present_keys(keys)
1613
missing = keys.difference(present)
1615
raise RevisionNotPresent(missing.pop(), self)
1617
def add_version(self, version_id, options, access_memo, parents):
1618
"""Add a version record to the index."""
1619
return self.add_versions(((version_id, options, access_memo, parents),))
1621
def add_versions(self, versions):
1622
"""Add multiple versions to the index.
2893
1624
This function does not insert data into the Immutable GraphIndex
2894
1625
backing the KnitGraphIndex, instead it prepares data for insertion by
2895
1626
the caller and checks that it is safe to insert then calls
2896
1627
self._add_callback with the prepared GraphIndex nodes.
2898
:param records: a list of tuples:
2899
(key, options, access_memo, parents).
2900
:param random_id: If True the ids being added were randomly generated
2901
and no check for existence will be performed.
2902
:param missing_compression_parents: If True the records being added are
2903
only compressed against texts already in the index (or inside
2904
records). If False the records all refer to unavailable texts (or
2905
texts inside records) as compression parents.
1629
:param versions: a list of tuples:
1630
(version_id, options, pos, size, parents).
2907
1632
if not self._add_callback:
2908
1633
raise errors.ReadOnlyError(self)
2909
1634
# we hope there are no repositories with inconsistent parentage
2913
compression_parents = set()
2914
key_dependencies = self._key_dependencies
2915
for (key, options, access_memo, parents) in records:
2917
parents = tuple(parents)
2918
if key_dependencies is not None:
2919
key_dependencies.add_references(key, parents)
1639
for (version_id, options, access_memo, parents) in versions:
2920
1640
index, pos, size = access_memo
1641
key = (version_id, )
1642
parents = tuple((parent, ) for parent in parents)
2921
1643
if 'no-eol' in options:
2964
1676
for key, (value, node_refs) in keys.iteritems():
2965
1677
result.append((key, value))
2966
1678
self._add_callback(result)
2967
if missing_compression_parents:
2968
# This may appear to be incorrect (it does not check for
2969
# compression parents that are in the existing graph index),
2970
# but such records won't have been buffered, so this is
2971
# actually correct: every entry when
2972
# missing_compression_parents==True either has a missing parent, or
2973
# a parent that is one of the keys in records.
2974
compression_parents.difference_update(keys)
2975
self._missing_compression_parents.update(compression_parents)
2976
# Adding records may have satisfied missing compression parents.
2977
self._missing_compression_parents.difference_update(keys)
2979
def scan_unvalidated_index(self, graph_index):
2980
"""Inform this _KnitGraphIndex that there is an unvalidated index.
2982
This allows this _KnitGraphIndex to keep track of any missing
2983
compression parents we may want to have filled in to make those
2986
:param graph_index: A GraphIndex
2989
new_missing = graph_index.external_references(ref_list_num=1)
2990
new_missing.difference_update(self.get_parent_map(new_missing))
2991
self._missing_compression_parents.update(new_missing)
2992
if self._key_dependencies is not None:
2993
# Add parent refs from graph_index (and discard parent refs that
2994
# the graph_index has).
2995
for node in graph_index.iter_all_entries():
2996
self._key_dependencies.add_references(node[1], node[3][0])
2998
def get_missing_compression_parents(self):
2999
"""Return the keys of missing compression parents.
3001
Missing compression parents occur when a record stream was missing
3002
basis texts, or a index was scanned that had missing basis texts.
3004
return frozenset(self._missing_compression_parents)
3006
def get_missing_parents(self):
3007
"""Return the keys of missing parents."""
3008
# If updating this, you should also update
3009
# groupcompress._GCGraphIndex.get_missing_parents
3010
# We may have false positives, so filter those out.
3011
self._key_dependencies.satisfy_refs_for_keys(
3012
self.get_parent_map(self._key_dependencies.get_unsatisfied_refs()))
3013
return frozenset(self._key_dependencies.get_unsatisfied_refs())
3015
def _check_read(self):
3016
"""raise if reads are not permitted."""
3017
if not self._is_locked():
3018
raise errors.ObjectNotLocked(self)
3020
def _check_write_ok(self):
3021
"""Assert if writes are not permitted."""
3022
if not self._is_locked():
3023
raise errors.ObjectNotLocked(self)
3025
def _compression_parent(self, an_entry):
3026
# return the key that an_entry is compressed against, or None
3027
# Grab the second parent list (as deltas implies parents currently)
3028
compression_parents = an_entry[3][1]
3029
if not compression_parents:
3031
if len(compression_parents) != 1:
3032
raise AssertionError(
3033
"Too many compression parents: %r" % compression_parents)
3034
return compression_parents[0]
3036
def get_build_details(self, keys):
3037
"""Get the method, index_memo and compression parent for version_ids.
3039
Ghosts are omitted from the result.
3041
:param keys: An iterable of keys.
3042
:return: A dict of key:
3043
(index_memo, compression_parent, parents, record_details).
3045
opaque structure to pass to read_records to extract the raw
3048
Content that this record is built upon, may be None
3050
Logical parents of this node
3052
extra information about the content which needs to be passed to
3053
Factory.parse_record
3057
entries = self._get_entries(keys, False)
3058
for entry in entries:
3060
if not self._parents:
3063
parents = entry[3][0]
3064
if not self._deltas:
3065
compression_parent_key = None
3067
compression_parent_key = self._compression_parent(entry)
3068
noeol = (entry[2][0] == 'N')
3069
if compression_parent_key:
3070
method = 'line-delta'
3073
result[key] = (self._node_to_position(entry),
3074
compression_parent_key, parents,
3078
def _get_entries(self, keys, check_present=False):
3079
"""Get the entries for keys.
3081
:param keys: An iterable of index key tuples.
3086
for node in self._graph_index.iter_entries(keys):
3088
found_keys.add(node[1])
3090
# adapt parentless index to the rest of the code.
3091
for node in self._graph_index.iter_entries(keys):
3092
yield node[0], node[1], node[2], ()
3093
found_keys.add(node[1])
3095
missing_keys = keys.difference(found_keys)
3097
raise RevisionNotPresent(missing_keys.pop(), self)
3099
def get_method(self, key):
3100
"""Return compression method of specified key."""
3101
return self._get_method(self._get_node(key))
3103
def _get_method(self, node):
3104
if not self._deltas:
3106
if self._compression_parent(node):
3111
def _get_node(self, key):
3113
return list(self._get_entries([key]))[0]
3115
raise RevisionNotPresent(key, self)
3117
def get_options(self, key):
3118
"""Return a list representing options.
3122
node = self._get_node(key)
3123
options = [self._get_method(node)]
3124
if node[2][0] == 'N':
3125
options.append('no-eol')
3128
def find_ancestry(self, keys):
3129
"""See CombinedGraphIndex.find_ancestry()"""
3130
return self._graph_index.find_ancestry(keys, 0)
3132
def get_parent_map(self, keys):
3133
"""Get a map of the parents of keys.
3135
:param keys: The keys to look up parents for.
3136
:return: A mapping from keys to parents. Absent keys are absent from
3140
nodes = self._get_entries(keys)
3144
result[node[1]] = node[3][0]
3147
result[node[1]] = None
3150
def get_position(self, key):
3151
"""Return details needed to access the version.
3153
:return: a tuple (index, data position, size) to hand to the access
3154
logic to get the record.
3156
node = self._get_node(key)
3157
return self._node_to_position(node)
3159
has_key = _mod_index._has_key_from_parent_map
3162
"""Get all the keys in the collection.
3164
The keys are not ordered.
3167
return [node[1] for node in self._graph_index.iter_all_entries()]
3169
missing_keys = _mod_index._missing_keys_from_parent_map
3171
def _node_to_position(self, node):
3172
"""Convert an index value to position details."""
3173
bits = node[2][1:].split(' ')
3174
return node[0], int(bits[0]), int(bits[1])
3176
def _sort_keys_by_io(self, keys, positions):
3177
"""Figure out an optimal order to read the records for the given keys.
3179
Sort keys, grouped by index and sorted by position.
3181
:param keys: A list of keys whose records we want to read. This will be
3183
:param positions: A dict, such as the one returned by
3184
_get_components_positions()
3187
def get_index_memo(key):
3188
# index_memo is at offset [1]. It is made up of (GraphIndex,
3189
# position, size). GI is an object, which will be unique for each
3190
# pack file. This causes us to group by pack file, then sort by
3191
# position. Size doesn't matter, but it isn't worth breaking up the
3193
return positions[key][1]
3194
return keys.sort(key=get_index_memo)
3196
_get_total_build_size = _get_total_build_size
3199
class _KnitKeyAccess(object):
3200
"""Access to records in .knit files."""
3202
def __init__(self, transport, mapper):
3203
"""Create a _KnitKeyAccess with transport and mapper.
3205
:param transport: The transport the access object is rooted at.
3206
:param mapper: The mapper used to map keys to .knit files.
1680
def _version_ids_to_keys(self, version_ids):
1681
return set((version_id, ) for version_id in version_ids)
1684
class _KnitAccess(object):
1685
"""Access to knit records in a .knit file."""
1687
def __init__(self, transport, filename, _file_mode, _dir_mode,
1688
_need_to_create, _create_parent_dir):
1689
"""Create a _KnitAccess for accessing and inserting data.
1691
:param transport: The transport the .knit is located on.
1692
:param filename: The filename of the .knit.
3208
1694
self._transport = transport
3209
self._mapper = mapper
1695
self._filename = filename
1696
self._file_mode = _file_mode
1697
self._dir_mode = _dir_mode
1698
self._need_to_create = _need_to_create
1699
self._create_parent_dir = _create_parent_dir
3211
def add_raw_records(self, key_sizes, raw_data):
1701
def add_raw_records(self, sizes, raw_data):
3212
1702
"""Add raw knit bytes to a storage area.
3214
The data is spooled to the container writer in one bytes-record per
1704
The data is spooled to whereever the access method is storing data.
3217
:param sizes: An iterable of tuples containing the key and size of each
1706
:param sizes: An iterable containing the size of each raw data segment.
3219
1707
:param raw_data: A bytestring containing the data.
3220
:return: A list of memos to retrieve the record later. Each memo is an
3221
opaque index memo. For _KnitKeyAccess the memo is (key, pos,
3222
length), where the key is the record key.
1708
:return: A list of memos to retrieve the record later. Each memo is a
1709
tuple - (index, pos, length), where the index field is always None
1710
for the .knit access method.
3224
if type(raw_data) is not str:
3225
raise AssertionError(
3226
'data must be plain bytes was %s' % type(raw_data))
1712
assert type(raw_data) == str, \
1713
'data must be plain bytes was %s' % type(raw_data)
1714
if not self._need_to_create:
1715
base = self._transport.append_bytes(self._filename, raw_data)
1717
self._transport.put_bytes_non_atomic(self._filename, raw_data,
1718
create_parent_dir=self._create_parent_dir,
1719
mode=self._file_mode,
1720
dir_mode=self._dir_mode)
1721
self._need_to_create = False
3229
# TODO: This can be tuned for writing to sftp and other servers where
3230
# append() is relatively expensive by grouping the writes to each key
3232
for key, size in key_sizes:
3233
path = self._mapper.map(key)
3235
base = self._transport.append_bytes(path + '.knit',
3236
raw_data[offset:offset+size])
3237
except errors.NoSuchFile:
3238
self._transport.mkdir(osutils.dirname(path))
3239
base = self._transport.append_bytes(path + '.knit',
3240
raw_data[offset:offset+size])
3244
result.append((key, base, size))
1725
result.append((None, base, size))
3248
"""Flush pending writes on this access object.
3250
For .knit files this is a no-op.
1730
"""IFF this data access has its own storage area, initialise it.
1734
self._transport.put_bytes_non_atomic(self._filename, '',
1735
mode=self._file_mode)
1737
def open_file(self):
1738
"""IFF this data access can be represented as a single file, open it.
1740
For knits that are not mapped to a single file on disk this will
1743
:return: None or a file handle.
1746
return self._transport.get(self._filename)
3254
1751
def get_raw_records(self, memos_for_retrieval):
3255
1752
"""Get the raw bytes for a records.
3257
:param memos_for_retrieval: An iterable containing the access memo for
3258
retrieving the bytes.
1754
:param memos_for_retrieval: An iterable containing the (index, pos,
1755
length) memo for retrieving the bytes. The .knit method ignores
1756
the index as there is always only a single file.
3259
1757
:return: An iterator over the bytes of the records.
3261
# first pass, group into same-index request to minimise readv's issued.
3263
current_prefix = None
3264
for (key, offset, length) in memos_for_retrieval:
3265
if current_prefix == key[:-1]:
3266
current_list.append((offset, length))
3268
if current_prefix is not None:
3269
request_lists.append((current_prefix, current_list))
3270
current_prefix = key[:-1]
3271
current_list = [(offset, length)]
3272
# handle the last entry
3273
if current_prefix is not None:
3274
request_lists.append((current_prefix, current_list))
3275
for prefix, read_vector in request_lists:
3276
path = self._mapper.map(prefix) + '.knit'
3277
for pos, data in self._transport.readv(path, read_vector):
3281
class _DirectPackAccess(object):
3282
"""Access to data in one or more packs with less translation."""
3284
def __init__(self, index_to_packs, reload_func=None, flush_func=None):
3285
"""Create a _DirectPackAccess object.
1759
read_vector = [(pos, size) for (index, pos, size) in memos_for_retrieval]
1760
for pos, data in self._transport.readv(self._filename, read_vector):
1764
class _PackAccess(object):
1765
"""Access to knit records via a collection of packs."""
1767
def __init__(self, index_to_packs, writer=None):
1768
"""Create a _PackAccess object.
3287
1770
:param index_to_packs: A dict mapping index objects to the transport
3288
1771
and file names for obtaining data.
3289
:param reload_func: A function to call if we determine that the pack
3290
files have moved and we need to reload our caches. See
3291
bzrlib.repo_fmt.pack_repo.AggregateIndex for more details.
1772
:param writer: A tuple (pack.ContainerWriter, write_index) which
1773
contains the pack to write, and the index that reads from it will
3293
self._container_writer = None
3294
self._write_index = None
3295
self._indices = index_to_packs
3296
self._reload_func = reload_func
3297
self._flush_func = flush_func
1777
self.container_writer = writer[0]
1778
self.write_index = writer[1]
1780
self.container_writer = None
1781
self.write_index = None
1782
self.indices = index_to_packs
3299
def add_raw_records(self, key_sizes, raw_data):
1784
def add_raw_records(self, sizes, raw_data):
3300
1785
"""Add raw knit bytes to a storage area.
3302
1787
The data is spooled to the container writer in one bytes-record per
3305
:param sizes: An iterable of tuples containing the key and size of each
1790
:param sizes: An iterable containing the size of each raw data segment.
3307
1791
:param raw_data: A bytestring containing the data.
3308
:return: A list of memos to retrieve the record later. Each memo is an
3309
opaque index memo. For _DirectPackAccess the memo is (index, pos,
3310
length), where the index field is the write_index object supplied
3311
to the PackAccess object.
1792
:return: A list of memos to retrieve the record later. Each memo is a
1793
tuple - (index, pos, length), where the index field is the
1794
write_index object supplied to the PackAccess object.
3313
if type(raw_data) is not str:
3314
raise AssertionError(
3315
'data must be plain bytes was %s' % type(raw_data))
1796
assert type(raw_data) == str, \
1797
'data must be plain bytes was %s' % type(raw_data)
3318
for key, size in key_sizes:
3319
p_offset, p_length = self._container_writer.add_bytes_record(
1801
p_offset, p_length = self.container_writer.add_bytes_record(
3320
1802
raw_data[offset:offset+size], [])
3322
result.append((self._write_index, p_offset, p_length))
1804
result.append((self.write_index, p_offset, p_length))
3326
"""Flush pending writes on this access object.
1808
"""Pack based knits do not get individually created."""
3328
This will flush any buffered writes to a NewPack.
3330
if self._flush_func is not None:
3333
1810
def get_raw_records(self, memos_for_retrieval):
3334
1811
"""Get the raw bytes for a records.
3336
:param memos_for_retrieval: An iterable containing the (index, pos,
1813
:param memos_for_retrieval: An iterable containing the (index, pos,
3337
1814
length) memo for retrieving the bytes. The Pack access method
3338
1815
looks up the pack to use for a given record in its index_to_pack
3354
1831
if current_index is not None:
3355
1832
request_lists.append((current_index, current_list))
3356
1833
for index, offsets in request_lists:
3358
transport, path = self._indices[index]
3360
# A KeyError here indicates that someone has triggered an index
3361
# reload, and this index has gone missing, we need to start
3363
if self._reload_func is None:
3364
# If we don't have a _reload_func there is nothing that can
3367
raise errors.RetryWithNewPacks(index,
3368
reload_occurred=True,
3369
exc_info=sys.exc_info())
3371
reader = pack.make_readv_reader(transport, path, offsets)
3372
for names, read_func in reader.iter_records():
3373
yield read_func(None)
3374
except errors.NoSuchFile:
3375
# A NoSuchFile error indicates that a pack file has gone
3376
# missing on disk, we need to trigger a reload, and start over.
3377
if self._reload_func is None:
3379
raise errors.RetryWithNewPacks(transport.abspath(path),
3380
reload_occurred=False,
3381
exc_info=sys.exc_info())
3383
def set_writer(self, writer, index, transport_packname):
1834
transport, path = self.indices[index]
1835
reader = pack.make_readv_reader(transport, path, offsets)
1836
for names, read_func in reader.iter_records():
1837
yield read_func(None)
1839
def open_file(self):
1840
"""Pack based knits have no single file."""
1843
def set_writer(self, writer, index, (transport, packname)):
3384
1844
"""Set a writer to use for adding data."""
3385
if index is not None:
3386
self._indices[index] = transport_packname
3387
self._container_writer = writer
3388
self._write_index = index
3390
def reload_or_raise(self, retry_exc):
3391
"""Try calling the reload function, or re-raise the original exception.
3393
This should be called after _DirectPackAccess raises a
3394
RetryWithNewPacks exception. This function will handle the common logic
3395
of determining when the error is fatal versus being temporary.
3396
It will also make sure that the original exception is raised, rather
3397
than the RetryWithNewPacks exception.
3399
If this function returns, then the calling function should retry
3400
whatever operation was being performed. Otherwise an exception will
3403
:param retry_exc: A RetryWithNewPacks exception.
3406
if self._reload_func is None:
3408
elif not self._reload_func():
3409
# The reload claimed that nothing changed
3410
if not retry_exc.reload_occurred:
3411
# If there wasn't an earlier reload, then we really were
3412
# expecting to find changes. We didn't find them, so this is a
3416
exc_class, exc_value, exc_traceback = retry_exc.exc_info
3417
raise exc_class, exc_value, exc_traceback
3420
def annotate_knit(knit, revision_id):
3421
"""Annotate a knit with no cached annotations.
3423
This implementation is for knits with no cached annotations.
3424
It will work for knits with cached annotations, but this is not
3427
annotator = _KnitAnnotator(knit)
3428
return iter(annotator.annotate_flat(revision_id))
3431
class _KnitAnnotator(annotate.Annotator):
3432
"""Build up the annotations for a text."""
3434
def __init__(self, vf):
3435
annotate.Annotator.__init__(self, vf)
3437
# TODO: handle Nodes which cannot be extracted
3438
# self._ghosts = set()
3440
# Map from (key, parent_key) => matching_blocks, should be 'use once'
3441
self._matching_blocks = {}
3443
# KnitContent objects
3444
self._content_objects = {}
3445
# The number of children that depend on this fulltext content object
3446
self._num_compression_children = {}
3447
# Delta records that need their compression parent before they can be
3449
self._pending_deltas = {}
3450
# Fulltext records that are waiting for their parents fulltexts before
3451
# they can be yielded for annotation
3452
self._pending_annotation = {}
3454
self._all_build_details = {}
3456
def _get_build_graph(self, key):
3457
"""Get the graphs for building texts and annotations.
3459
The data you need for creating a full text may be different than the
3460
data you need to annotate that text. (At a minimum, you need both
3461
parents to create an annotation, but only need 1 parent to generate the
3464
:return: A list of (key, index_memo) records, suitable for
3465
passing to read_records_iter to start reading in the raw data from
3468
pending = set([key])
3471
self._num_needed_children[key] = 1
3473
# get all pending nodes
3474
this_iteration = pending
3475
build_details = self._vf._index.get_build_details(this_iteration)
3476
self._all_build_details.update(build_details)
3477
# new_nodes = self._vf._index._get_entries(this_iteration)
3479
for key, details in build_details.iteritems():
3480
(index_memo, compression_parent, parent_keys,
3481
record_details) = details
3482
self._parent_map[key] = parent_keys
3483
self._heads_provider = None
3484
records.append((key, index_memo))
3485
# Do we actually need to check _annotated_lines?
3486
pending.update([p for p in parent_keys
3487
if p not in self._all_build_details])
3489
for parent_key in parent_keys:
3490
if parent_key in self._num_needed_children:
3491
self._num_needed_children[parent_key] += 1
3493
self._num_needed_children[parent_key] = 1
3494
if compression_parent:
3495
if compression_parent in self._num_compression_children:
3496
self._num_compression_children[compression_parent] += 1
3498
self._num_compression_children[compression_parent] = 1
3500
missing_versions = this_iteration.difference(build_details.keys())
3501
if missing_versions:
3502
for key in missing_versions:
3503
if key in self._parent_map and key in self._text_cache:
3504
# We already have this text ready, we just need to
3505
# yield it later so we get it annotated
3507
parent_keys = self._parent_map[key]
3508
for parent_key in parent_keys:
3509
if parent_key in self._num_needed_children:
3510
self._num_needed_children[parent_key] += 1
3512
self._num_needed_children[parent_key] = 1
3513
pending.update([p for p in parent_keys
3514
if p not in self._all_build_details])
3516
raise errors.RevisionNotPresent(key, self._vf)
3517
# Generally we will want to read the records in reverse order, because
3518
# we find the parent nodes after the children
3520
return records, ann_keys
3522
def _get_needed_texts(self, key, pb=None):
3523
# if True or len(self._vf._fallback_vfs) > 0:
3524
if len(self._vf._fallback_vfs) > 0:
3525
# If we have fallbacks, go to the generic path
3526
for v in annotate.Annotator._get_needed_texts(self, key, pb=pb):
1845
self.indices[index] = (transport, packname)
1846
self.container_writer = writer
1847
self.write_index = index
1850
class _KnitData(object):
1851
"""Manage extraction of data from a KnitAccess, caching and decompressing.
1853
The KnitData class provides the logic for parsing and using knit records,
1854
making use of an access method for the low level read and write operations.
1857
def __init__(self, access):
1858
"""Create a KnitData object.
1860
:param access: The access method to use. Access methods such as
1861
_KnitAccess manage the insertion of raw records and the subsequent
1862
retrieval of the same.
1864
self._access = access
1865
self._checked = False
1866
# TODO: jam 20060713 conceptually, this could spill to disk
1867
# if the cached size gets larger than a certain amount
1868
# but it complicates the model a bit, so for now just use
1869
# a simple dictionary
1871
self._do_cache = False
1873
def enable_cache(self):
1874
"""Enable caching of reads."""
1875
self._do_cache = True
1877
def clear_cache(self):
1878
"""Clear the record cache."""
1879
self._do_cache = False
1882
def _open_file(self):
1883
return self._access.open_file()
1885
def _record_to_data(self, version_id, digest, lines):
1886
"""Convert version_id, digest, lines into a raw data block.
1888
:return: (len, a StringIO instance with the raw data ready to read.)
1891
data_file = GzipFile(None, mode='wb', fileobj=sio)
1893
assert isinstance(version_id, str)
1894
data_file.writelines(chain(
1895
["version %s %d %s\n" % (version_id,
1899
["end %s\n" % version_id]))
1906
def add_raw_records(self, sizes, raw_data):
1907
"""Append a prepared record to the data file.
1909
:param sizes: An iterable containing the size of each raw data segment.
1910
:param raw_data: A bytestring containing the data.
1911
:return: a list of index data for the way the data was stored.
1912
See the access method add_raw_records documentation for more
1915
return self._access.add_raw_records(sizes, raw_data)
1917
def add_record(self, version_id, digest, lines):
1918
"""Write new text record to disk.
1920
Returns index data for retrieving it later, as per add_raw_records.
1922
size, sio = self._record_to_data(version_id, digest, lines)
1923
result = self.add_raw_records([size], sio.getvalue())
1925
self._cache[version_id] = sio.getvalue()
1928
def _parse_record_header(self, version_id, raw_data):
1929
"""Parse a record header for consistency.
1931
:return: the header and the decompressor stream.
1932
as (stream, header_record)
1934
df = GzipFile(mode='rb', fileobj=StringIO(raw_data))
1936
rec = self._check_header(version_id, df.readline())
1937
except Exception, e:
1938
raise KnitCorrupt(self._access,
1939
"While reading {%s} got %s(%s)"
1940
% (version_id, e.__class__.__name__, str(e)))
1943
def _check_header(self, version_id, line):
1946
raise KnitCorrupt(self._access,
1947
'unexpected number of elements in record header')
1948
if rec[1] != version_id:
1949
raise KnitCorrupt(self._access,
1950
'unexpected version, wanted %r, got %r'
1951
% (version_id, rec[1]))
1954
def _parse_record(self, version_id, data):
1956
# 4168 calls in 2880 217 internal
1957
# 4168 calls to _parse_record_header in 2121
1958
# 4168 calls to readlines in 330
1959
df = GzipFile(mode='rb', fileobj=StringIO(data))
1962
record_contents = df.readlines()
1963
except Exception, e:
1964
raise KnitCorrupt(self._access,
1965
"While reading {%s} got %s(%s)"
1966
% (version_id, e.__class__.__name__, str(e)))
1967
header = record_contents.pop(0)
1968
rec = self._check_header(version_id, header)
1970
last_line = record_contents.pop()
1971
if len(record_contents) != int(rec[2]):
1972
raise KnitCorrupt(self._access,
1973
'incorrect number of lines %s != %s'
1975
% (len(record_contents), int(rec[2]),
1977
if last_line != 'end %s\n' % rec[1]:
1978
raise KnitCorrupt(self._access,
1979
'unexpected version end line %r, wanted %r'
1980
% (last_line, version_id))
1982
return record_contents, rec[3]
1984
def read_records_iter_raw(self, records):
1985
"""Read text records from data file and yield raw data.
1987
This unpacks enough of the text record to validate the id is
1988
as expected but thats all.
1990
# setup an iterator of the external records:
1991
# uses readv so nice and fast we hope.
1993
# grab the disk data needed.
1995
# Don't check _cache if it is empty
1996
needed_offsets = [index_memo for version_id, index_memo
1998
if version_id not in self._cache]
2000
needed_offsets = [index_memo for version_id, index_memo
2003
raw_records = self._access.get_raw_records(needed_offsets)
2005
for version_id, index_memo in records:
2006
if version_id in self._cache:
2007
# This data has already been validated
2008
data = self._cache[version_id]
2010
data = raw_records.next()
2012
self._cache[version_id] = data
2014
# validate the header
2015
df, rec = self._parse_record_header(version_id, data)
2017
yield version_id, data
2019
def read_records_iter(self, records):
2020
"""Read text records from data file and yield result.
2022
The result will be returned in whatever is the fastest to read.
2023
Not by the order requested. Also, multiple requests for the same
2024
record will only yield 1 response.
2025
:param records: A list of (version_id, pos, len) entries
2026
:return: Yields (version_id, contents, digest) in the order
2027
read, not the order requested
2033
# Skip records we have alread seen
2034
yielded_records = set()
2035
needed_records = set()
2036
for record in records:
2037
if record[0] in self._cache:
2038
if record[0] in yielded_records:
2040
yielded_records.add(record[0])
2041
data = self._cache[record[0]]
2042
content, digest = self._parse_record(record[0], data)
2043
yield (record[0], content, digest)
2045
needed_records.add(record)
2046
needed_records = sorted(needed_records, key=operator.itemgetter(1))
2048
needed_records = sorted(set(records), key=operator.itemgetter(1))
2050
if not needed_records:
2053
# The transport optimizes the fetching as well
2054
# (ie, reads continuous ranges.)
2055
raw_data = self._access.get_raw_records(
2056
[index_memo for version_id, index_memo in needed_records])
2058
for (version_id, index_memo), data in \
2059
izip(iter(needed_records), raw_data):
2060
content, digest = self._parse_record(version_id, data)
2062
self._cache[version_id] = data
2063
yield version_id, content, digest
2065
def read_records(self, records):
2066
"""Read records into a dictionary."""
2068
for record_id, content, digest in \
2069
self.read_records_iter(records):
2070
components[record_id] = (content, digest)
2074
class InterKnit(InterVersionedFile):
2075
"""Optimised code paths for knit to knit operations."""
2077
_matching_file_from_factory = KnitVersionedFile
2078
_matching_file_to_factory = KnitVersionedFile
2081
def is_compatible(source, target):
2082
"""Be compatible with knits. """
2084
return (isinstance(source, KnitVersionedFile) and
2085
isinstance(target, KnitVersionedFile))
2086
except AttributeError:
2089
def join(self, pb=None, msg=None, version_ids=None, ignore_missing=False):
2090
"""See InterVersionedFile.join."""
2091
assert isinstance(self.source, KnitVersionedFile)
2092
assert isinstance(self.target, KnitVersionedFile)
2094
version_ids = self._get_source_version_ids(version_ids, ignore_missing)
2099
pb = ui.ui_factory.nested_progress_bar()
2101
version_ids = list(version_ids)
2102
if None in version_ids:
2103
version_ids.remove(None)
2105
self.source_ancestry = set(self.source.get_ancestry(version_ids))
2106
this_versions = set(self.target._index.get_versions())
2107
needed_versions = self.source_ancestry - this_versions
2108
cross_check_versions = self.source_ancestry.intersection(this_versions)
2109
mismatched_versions = set()
2110
for version in cross_check_versions:
2111
# scan to include needed parents.
2112
n1 = set(self.target.get_parents_with_ghosts(version))
2113
n2 = set(self.source.get_parents_with_ghosts(version))
2115
# FIXME TEST this check for cycles being introduced works
2116
# the logic is we have a cycle if in our graph we are an
2117
# ancestor of any of the n2 revisions.
2123
parent_ancestors = self.source.get_ancestry(parent)
2124
if version in parent_ancestors:
2125
raise errors.GraphCycleError([parent, version])
2126
# ensure this parent will be available later.
2127
new_parents = n2.difference(n1)
2128
needed_versions.update(new_parents.difference(this_versions))
2129
mismatched_versions.add(version)
2131
if not needed_versions and not mismatched_versions:
2133
full_list = topo_sort(self.source.get_graph())
2135
version_list = [i for i in full_list if (not self.target.has_version(i)
2136
and i in needed_versions)]
2140
copy_queue_records = []
2142
for version_id in version_list:
2143
options = self.source._index.get_options(version_id)
2144
parents = self.source._index.get_parents_with_ghosts(version_id)
2145
# check that its will be a consistent copy:
2146
for parent in parents:
2147
# if source has the parent, we must :
2148
# * already have it or
2149
# * have it scheduled already
2150
# otherwise we don't care
2151
assert (self.target.has_version(parent) or
2152
parent in copy_set or
2153
not self.source.has_version(parent))
2154
index_memo = self.source._index.get_position(version_id)
2155
copy_queue_records.append((version_id, index_memo))
2156
copy_queue.append((version_id, options, parents))
2157
copy_set.add(version_id)
2159
# data suck the join:
2161
total = len(version_list)
2164
for (version_id, raw_data), \
2165
(version_id2, options, parents) in \
2166
izip(self.source._data.read_records_iter_raw(copy_queue_records),
2168
assert version_id == version_id2, 'logic error, inconsistent results'
2170
pb.update("Joining knit", count, total)
2171
raw_records.append((version_id, options, parents, len(raw_data)))
2172
raw_datum.append(raw_data)
2173
self.target._add_raw_records(raw_records, ''.join(raw_datum))
2175
for version in mismatched_versions:
2176
# FIXME RBC 20060309 is this needed?
2177
n1 = set(self.target.get_parents_with_ghosts(version))
2178
n2 = set(self.source.get_parents_with_ghosts(version))
2179
# write a combined record to our history preserving the current
2180
# parents as first in the list
2181
new_parents = self.target.get_parents_with_ghosts(version) + list(n2.difference(n1))
2182
self.target.fix_parents(version, new_parents)
2188
InterVersionedFile.register_optimiser(InterKnit)
2191
class WeaveToKnit(InterVersionedFile):
2192
"""Optimised code paths for weave to knit operations."""
2194
_matching_file_from_factory = bzrlib.weave.WeaveFile
2195
_matching_file_to_factory = KnitVersionedFile
2198
def is_compatible(source, target):
2199
"""Be compatible with weaves to knits."""
2201
return (isinstance(source, bzrlib.weave.Weave) and
2202
isinstance(target, KnitVersionedFile))
2203
except AttributeError:
2206
def join(self, pb=None, msg=None, version_ids=None, ignore_missing=False):
2207
"""See InterVersionedFile.join."""
2208
assert isinstance(self.source, bzrlib.weave.Weave)
2209
assert isinstance(self.target, KnitVersionedFile)
2211
version_ids = self._get_source_version_ids(version_ids, ignore_missing)
2216
pb = ui.ui_factory.nested_progress_bar()
2218
version_ids = list(version_ids)
2220
self.source_ancestry = set(self.source.get_ancestry(version_ids))
2221
this_versions = set(self.target._index.get_versions())
2222
needed_versions = self.source_ancestry - this_versions
2223
cross_check_versions = self.source_ancestry.intersection(this_versions)
2224
mismatched_versions = set()
2225
for version in cross_check_versions:
2226
# scan to include needed parents.
2227
n1 = set(self.target.get_parents_with_ghosts(version))
2228
n2 = set(self.source.get_parents(version))
2229
# if all of n2's parents are in n1, then its fine.
2230
if n2.difference(n1):
2231
# FIXME TEST this check for cycles being introduced works
2232
# the logic is we have a cycle if in our graph we are an
2233
# ancestor of any of the n2 revisions.
2239
parent_ancestors = self.source.get_ancestry(parent)
2240
if version in parent_ancestors:
2241
raise errors.GraphCycleError([parent, version])
2242
# ensure this parent will be available later.
2243
new_parents = n2.difference(n1)
2244
needed_versions.update(new_parents.difference(this_versions))
2245
mismatched_versions.add(version)
2247
if not needed_versions and not mismatched_versions:
2249
full_list = topo_sort(self.source.get_graph())
2251
version_list = [i for i in full_list if (not self.target.has_version(i)
2252
and i in needed_versions)]
2256
total = len(version_list)
2257
for version_id in version_list:
2258
pb.update("Converting to knit", count, total)
2259
parents = self.source.get_parents(version_id)
2260
# check that its will be a consistent copy:
2261
for parent in parents:
2262
# if source has the parent, we must already have it
2263
assert (self.target.has_version(parent))
2264
self.target.add_lines(
2265
version_id, parents, self.source.get_lines(version_id))
2268
for version in mismatched_versions:
2269
# FIXME RBC 20060309 is this needed?
2270
n1 = set(self.target.get_parents_with_ghosts(version))
2271
n2 = set(self.source.get_parents(version))
2272
# write a combined record to our history preserving the current
2273
# parents as first in the list
2274
new_parents = self.target.get_parents_with_ghosts(version) + list(n2.difference(n1))
2275
self.target.fix_parents(version, new_parents)
2281
InterVersionedFile.register_optimiser(WeaveToKnit)
2284
class KnitSequenceMatcher(difflib.SequenceMatcher):
2285
"""Knit tuned sequence matcher.
2287
This is based on profiling of difflib which indicated some improvements
2288
for our usage pattern.
2291
def find_longest_match(self, alo, ahi, blo, bhi):
2292
"""Find longest matching block in a[alo:ahi] and b[blo:bhi].
2294
If isjunk is not defined:
2296
Return (i,j,k) such that a[i:i+k] is equal to b[j:j+k], where
2297
alo <= i <= i+k <= ahi
2298
blo <= j <= j+k <= bhi
2299
and for all (i',j',k') meeting those conditions,
2302
and if i == i', j <= j'
2304
In other words, of all maximal matching blocks, return one that
2305
starts earliest in a, and of all those maximal matching blocks that
2306
start earliest in a, return the one that starts earliest in b.
2308
>>> s = SequenceMatcher(None, " abcd", "abcd abcd")
2309
>>> s.find_longest_match(0, 5, 0, 9)
2312
If isjunk is defined, first the longest matching block is
2313
determined as above, but with the additional restriction that no
2314
junk element appears in the block. Then that block is extended as
2315
far as possible by matching (only) junk elements on both sides. So
2316
the resulting block never matches on junk except as identical junk
2317
happens to be adjacent to an "interesting" match.
2319
Here's the same example as before, but considering blanks to be
2320
junk. That prevents " abcd" from matching the " abcd" at the tail
2321
end of the second sequence directly. Instead only the "abcd" can
2322
match, and matches the leftmost "abcd" in the second sequence:
2324
>>> s = SequenceMatcher(lambda x: x==" ", " abcd", "abcd abcd")
2325
>>> s.find_longest_match(0, 5, 0, 9)
2328
If no blocks match, return (alo, blo, 0).
2330
>>> s = SequenceMatcher(None, "ab", "c")
2331
>>> s.find_longest_match(0, 2, 0, 1)
2335
# CAUTION: stripping common prefix or suffix would be incorrect.
2339
# Longest matching block is "ab", but if common prefix is
2340
# stripped, it's "a" (tied with "b"). UNIX(tm) diff does so
2341
# strip, so ends up claiming that ab is changed to acab by
2342
# inserting "ca" in the middle. That's minimal but unintuitive:
2343
# "it's obvious" that someone inserted "ac" at the front.
2344
# Windiff ends up at the same place as diff, but by pairing up
2345
# the unique 'b's and then matching the first two 'a's.
2347
a, b, b2j, isbjunk = self.a, self.b, self.b2j, self.isbjunk
2348
besti, bestj, bestsize = alo, blo, 0
2349
# find longest junk-free match
2350
# during an iteration of the loop, j2len[j] = length of longest
2351
# junk-free match ending with a[i-1] and b[j]
2355
for i in xrange(alo, ahi):
2356
# look at all instances of a[i] in b; note that because
2357
# b2j has no junk keys, the loop is skipped if a[i] is junk
2358
j2lenget = j2len.get
2361
# changing b2j.get(a[i], nothing) to a try:KeyError pair produced the
2362
# following improvement
2363
# 704 0 4650.5320 2620.7410 bzrlib.knit:1336(find_longest_match)
2364
# +326674 0 1655.1210 1655.1210 +<method 'get' of 'dict' objects>
2365
# +76519 0 374.6700 374.6700 +<method 'has_key' of 'dict' objects>
2367
# 704 0 3733.2820 2209.6520 bzrlib.knit:1336(find_longest_match)
2368
# +211400 0 1147.3520 1147.3520 +<method 'get' of 'dict' objects>
2369
# +76519 0 376.2780 376.2780 +<method 'has_key' of 'dict' objects>
3531
records, ann_keys = self._get_build_graph(key)
3532
for idx, (sub_key, text, num_lines) in enumerate(
3533
self._extract_texts(records)):
3535
pb.update('annotating', idx, len(records))
3536
yield sub_key, text, num_lines
3537
for sub_key in ann_keys:
3538
text = self._text_cache[sub_key]
3539
num_lines = len(text) # bad assumption
3540
yield sub_key, text, num_lines
3542
except errors.RetryWithNewPacks, e:
3543
self._vf._access.reload_or_raise(e)
3544
# The cached build_details are no longer valid
3545
self._all_build_details.clear()
3547
def _cache_delta_blocks(self, key, compression_parent, delta, lines):
3548
parent_lines = self._text_cache[compression_parent]
3549
blocks = list(KnitContent.get_line_delta_blocks(delta, parent_lines, lines))
3550
self._matching_blocks[(key, compression_parent)] = blocks
3552
def _expand_record(self, key, parent_keys, compression_parent, record,
3555
if compression_parent:
3556
if compression_parent not in self._content_objects:
3557
# Waiting for the parent
3558
self._pending_deltas.setdefault(compression_parent, []).append(
3559
(key, parent_keys, record, record_details))
3561
# We have the basis parent, so expand the delta
3562
num = self._num_compression_children[compression_parent]
3565
base_content = self._content_objects.pop(compression_parent)
3566
self._num_compression_children.pop(compression_parent)
3568
self._num_compression_children[compression_parent] = num
3569
base_content = self._content_objects[compression_parent]
3570
# It is tempting to want to copy_base_content=False for the last
3571
# child object. However, whenever noeol=False,
3572
# self._text_cache[parent_key] is content._lines. So mutating it
3573
# gives very bad results.
3574
# The alternative is to copy the lines into text cache, but then we
3575
# are copying anyway, so just do it here.
3576
content, delta = self._vf._factory.parse_record(
3577
key, record, record_details, base_content,
3578
copy_base_content=True)
3581
content, _ = self._vf._factory.parse_record(
3582
key, record, record_details, None)
3583
if self._num_compression_children.get(key, 0) > 0:
3584
self._content_objects[key] = content
3585
lines = content.text()
3586
self._text_cache[key] = lines
3587
if delta is not None:
3588
self._cache_delta_blocks(key, compression_parent, delta, lines)
3591
def _get_parent_annotations_and_matches(self, key, text, parent_key):
3592
"""Get the list of annotations for the parent, and the matching lines.
3594
:param text: The opaque value given by _get_needed_texts
3595
:param parent_key: The key for the parent text
3596
:return: (parent_annotations, matching_blocks)
3597
parent_annotations is a list as long as the number of lines in
3599
matching_blocks is a list of (parent_idx, text_idx, len) tuples
3600
indicating which lines match between the two texts
3602
block_key = (key, parent_key)
3603
if block_key in self._matching_blocks:
3604
blocks = self._matching_blocks.pop(block_key)
3605
parent_annotations = self._annotations_cache[parent_key]
3606
return parent_annotations, blocks
3607
return annotate.Annotator._get_parent_annotations_and_matches(self,
3608
key, text, parent_key)
3610
def _process_pending(self, key):
3611
"""The content for 'key' was just processed.
3613
Determine if there is any more pending work to be processed.
3616
if key in self._pending_deltas:
3617
compression_parent = key
3618
children = self._pending_deltas.pop(key)
3619
for child_key, parent_keys, record, record_details in children:
3620
lines = self._expand_record(child_key, parent_keys,
3622
record, record_details)
3623
if self._check_ready_for_annotations(child_key, parent_keys):
3624
to_return.append(child_key)
3625
# Also check any children that are waiting for this parent to be
3627
if key in self._pending_annotation:
3628
children = self._pending_annotation.pop(key)
3629
to_return.extend([c for c, p_keys in children
3630
if self._check_ready_for_annotations(c, p_keys)])
3633
def _check_ready_for_annotations(self, key, parent_keys):
3634
"""return true if this text is ready to be yielded.
3636
Otherwise, this will return False, and queue the text into
3637
self._pending_annotation
3639
for parent_key in parent_keys:
3640
if parent_key not in self._annotations_cache:
3641
# still waiting on at least one parent text, so queue it up
3642
# Note that if there are multiple parents, we need to wait
3644
self._pending_annotation.setdefault(parent_key,
3645
[]).append((key, parent_keys))
3649
def _extract_texts(self, records):
3650
"""Extract the various texts needed based on records"""
3651
# We iterate in the order read, rather than a strict order requested
3652
# However, process what we can, and put off to the side things that
3653
# still need parents, cleaning them up when those parents are
3656
# 1) As 'records' are read, see if we can expand these records into
3657
# Content objects (and thus lines)
3658
# 2) If a given line-delta is waiting on its compression parent, it
3659
# gets queued up into self._pending_deltas, otherwise we expand
3660
# it, and put it into self._text_cache and self._content_objects
3661
# 3) If we expanded the text, we will then check to see if all
3662
# parents have also been processed. If so, this text gets yielded,
3663
# else this record gets set aside into pending_annotation
3664
# 4) Further, if we expanded the text in (2), we will then check to
3665
# see if there are any children in self._pending_deltas waiting to
3666
# also be processed. If so, we go back to (2) for those
3667
# 5) Further again, if we yielded the text, we can then check if that
3668
# 'unlocks' any of the texts in pending_annotations, which should
3669
# then get yielded as well
3670
# Note that both steps 4 and 5 are 'recursive' in that unlocking one
3671
# compression child could unlock yet another, and yielding a fulltext
3672
# will also 'unlock' the children that are waiting on that annotation.
3673
# (Though also, unlocking 1 parent's fulltext, does not unlock a child
3674
# if other parents are also waiting.)
3675
# We want to yield content before expanding child content objects, so
3676
# that we know when we can re-use the content lines, and the annotation
3677
# code can know when it can stop caching fulltexts, as well.
3679
# Children that are missing their compression parent
3681
for (key, record, digest) in self._vf._read_records_iter(records):
3683
details = self._all_build_details[key]
3684
(_, compression_parent, parent_keys, record_details) = details
3685
lines = self._expand_record(key, parent_keys, compression_parent,
3686
record, record_details)
3688
# Pending delta should be queued up
3690
# At this point, we may be able to yield this content, if all
3691
# parents are also finished
3692
yield_this_text = self._check_ready_for_annotations(key,
3695
# All parents present
3696
yield key, lines, len(lines)
3697
to_process = self._process_pending(key)
3699
this_process = to_process
3701
for key in this_process:
3702
lines = self._text_cache[key]
3703
yield key, lines, len(lines)
3704
to_process.extend(self._process_pending(key))
2381
k = newj2len[j] = 1 + j2lenget(-1 + j, 0)
2383
besti, bestj, bestsize = 1 + i-k, 1 + j-k, k
2386
# Extend the best by non-junk elements on each end. In particular,
2387
# "popular" non-junk elements aren't in b2j, which greatly speeds
2388
# the inner loop above, but also means "the best" match so far
2389
# doesn't contain any junk *or* popular non-junk elements.
2390
while besti > alo and bestj > blo and \
2391
not isbjunk(b[bestj-1]) and \
2392
a[besti-1] == b[bestj-1]:
2393
besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
2394
while besti+bestsize < ahi and bestj+bestsize < bhi and \
2395
not isbjunk(b[bestj+bestsize]) and \
2396
a[besti+bestsize] == b[bestj+bestsize]:
2399
# Now that we have a wholly interesting match (albeit possibly
2400
# empty!), we may as well suck up the matching junk on each
2401
# side of it too. Can't think of a good reason not to, and it
2402
# saves post-processing the (possibly considerable) expense of
2403
# figuring out what to do with it. In the case of an empty
2404
# interesting match, this is clearly the right thing to do,
2405
# because no other kind of match is possible in the regions.
2406
while besti > alo and bestj > blo and \
2407
isbjunk(b[bestj-1]) and \
2408
a[besti-1] == b[bestj-1]:
2409
besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
2410
while besti+bestsize < ahi and bestj+bestsize < bhi and \
2411
isbjunk(b[bestj+bestsize]) and \
2412
a[besti+bestsize] == b[bestj+bestsize]:
2413
bestsize = bestsize + 1
2415
return besti, bestj, bestsize
3707
from bzrlib._knit_load_data_pyx import _load_data_c as _load_data
3708
except ImportError, e:
3709
osutils.failed_to_load_extension(e)
2419
from bzrlib._knit_load_data_c import _load_data_c as _load_data
3710
2421
from bzrlib._knit_load_data_py import _load_data_py as _load_data
added
removed
bzrlib/knit.py
