1
# Copyright (C) 2005, 2006 Canonical Ltd
2
# Written by Martin Pool.
3
# Modified by Johan Rydberg <jrydberg@gnu.org>
4
# Modified by Robert Collins <robert.collins@canonical.com>
5
# Modified by Aaron Bentley <aaron.bentley@utoronto.ca>
7
# This program is free software; you can redistribute it and/or modify
8
# it under the terms of the GNU General Public License as published by
9
# the Free Software Foundation; either version 2 of the License, or
10
# (at your option) any later version.
12
# This program is distributed in the hope that it will be useful,
13
# but WITHOUT ANY WARRANTY; without even the implied warranty of
14
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15
# GNU General Public License for more details.
17
# You should have received a copy of the GNU General Public License
18
# along with this program; if not, write to the Free Software
19
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21
"""Knit versionedfile implementation.
23
A knit is a versioned file implementation that supports efficient append only
27
lifeless: the data file is made up of "delta records". each delta record has a delta header
28
that contains; (1) a version id, (2) the size of the delta (in lines), and (3) the digest of
29
the -expanded data- (ie, the delta applied to the parent). the delta also ends with a
30
end-marker; simply "end VERSION"
32
delta can be line or full contents.a
33
... the 8's there are the index number of the annotation.
34
version robertc@robertcollins.net-20051003014215-ee2990904cc4c7ad 7 c7d23b2a5bd6ca00e8e266cec0ec228158ee9f9e
38
8 e.set('executable', 'yes')
40
8 if elt.get('executable') == 'yes':
41
8 ie.executable = True
42
end robertc@robertcollins.net-20051003014215-ee2990904cc4c7ad
46
09:33 < jrydberg> lifeless: each index is made up of a tuple of; version id, options, position, size, parents
47
09:33 < jrydberg> lifeless: the parents are currently dictionary compressed
48
09:33 < jrydberg> lifeless: (meaning it currently does not support ghosts)
49
09:33 < lifeless> right
50
09:33 < jrydberg> lifeless: the position and size is the range in the data file
53
so the index sequence is the dictionary compressed sequence number used
54
in the deltas to provide line annotation
59
# 10:16 < lifeless> make partial index writes safe
60
# 10:16 < lifeless> implement 'knit.check()' like weave.check()
61
# 10:17 < lifeless> record known ghosts so we can detect when they are filled in rather than the current 'reweave
63
# move sha1 out of the content so that join is faster at verifying parents
64
# record content length ?
68
from cStringIO import StringIO
70
from itertools import izip, chain
83
from bzrlib.errors import FileExists, NoSuchFile, KnitError, \
84
InvalidRevisionId, KnitCorrupt, KnitHeaderError, \
85
RevisionNotPresent, RevisionAlreadyPresent
86
from bzrlib.tuned_gzip import GzipFile
87
from bzrlib.trace import mutter
88
from bzrlib.osutils import contains_whitespace, contains_linebreaks, \
90
from bzrlib.symbol_versioning import DEPRECATED_PARAMETER, deprecated_passed
91
from bzrlib.tsort import topo_sort
94
from bzrlib.versionedfile import VersionedFile, InterVersionedFile
97
# TODO: Split out code specific to this format into an associated object.
99
# TODO: Can we put in some kind of value to check that the index and data
100
# files belong together?
102
# TODO: accommodate binaries, perhaps by storing a byte count
104
# TODO: function to check whole file
106
# TODO: atomically append data, then measure backwards from the cursor
107
# position after writing to work out where it was located. we may need to
108
# bypass python file buffering.
110
DATA_SUFFIX = '.knit'
111
INDEX_SUFFIX = '.kndx'
114
class KnitContent(object):
115
"""Content of a knit version to which deltas can be applied."""
117
def __init__(self, lines):
120
def annotate_iter(self):
121
"""Yield tuples of (origin, text) for each content line."""
122
return iter(self._lines)
125
"""Return a list of (origin, text) tuples."""
126
return list(self.annotate_iter())
128
def line_delta_iter(self, new_lines):
129
"""Generate line-based delta from this content to new_lines."""
130
new_texts = new_lines.text()
131
old_texts = self.text()
132
s = KnitSequenceMatcher(None, old_texts, new_texts)
133
for tag, i1, i2, j1, j2 in s.get_opcodes():
136
# ofrom, oto, length, data
137
yield i1, i2, j2 - j1, new_lines._lines[j1:j2]
139
def line_delta(self, new_lines):
140
return list(self.line_delta_iter(new_lines))
143
return [text for origin, text in self._lines]
146
return KnitContent(self._lines[:])
149
class _KnitFactory(object):
150
"""Base factory for creating content objects."""
152
def make(self, lines, version):
153
num_lines = len(lines)
154
return KnitContent(zip([version] * num_lines, lines))
157
class KnitAnnotateFactory(_KnitFactory):
158
"""Factory for creating annotated Content objects."""
162
def parse_fulltext(self, content, version):
163
"""Convert fulltext to internal representation
165
fulltext content is of the format
166
revid(utf8) plaintext\n
167
internal representation is of the format:
170
decode_utf8 = cache_utf8.decode
173
origin, text = line.split(' ', 1)
174
lines.append((decode_utf8(origin), text))
175
return KnitContent(lines)
177
def parse_line_delta_iter(self, lines):
178
return iter(self.parse_line_delta(lines))
180
def parse_line_delta(self, lines, version):
181
"""Convert a line based delta into internal representation.
183
line delta is in the form of:
184
intstart intend intcount
186
revid(utf8) newline\n
187
internal representation is
188
(start, end, count, [1..count tuples (revid, newline)])
190
decode_utf8 = cache_utf8.decode
194
# walk through the lines parsing.
196
start, end, count = [int(n) for n in header.split(',')]
200
origin, text = next().split(' ', 1)
202
contents.append((decode_utf8(origin), text))
203
result.append((start, end, count, contents))
206
def lower_fulltext(self, content):
207
"""convert a fulltext content record into a serializable form.
209
see parse_fulltext which this inverts.
211
encode_utf8 = cache_utf8.encode
212
return ['%s %s' % (encode_utf8(o), t) for o, t in content._lines]
214
def lower_line_delta(self, delta):
215
"""convert a delta into a serializable form.
217
See parse_line_delta which this inverts.
219
encode_utf8 = cache_utf8.encode
221
for start, end, c, lines in delta:
222
out.append('%d,%d,%d\n' % (start, end, c))
223
out.extend(encode_utf8(origin) + ' ' + text
224
for origin, text in lines)
228
class KnitPlainFactory(_KnitFactory):
229
"""Factory for creating plain Content objects."""
233
def parse_fulltext(self, content, version):
234
"""This parses an unannotated fulltext.
236
Note that this is not a noop - the internal representation
237
has (versionid, line) - its just a constant versionid.
239
return self.make(content, version)
241
def parse_line_delta_iter(self, lines, version):
243
num_lines = len(lines)
244
while cur < num_lines:
247
start, end, c = [int(n) for n in header.split(',')]
248
yield start, end, c, zip([version] * c, lines[cur:cur+c])
251
def parse_line_delta(self, lines, version):
252
return list(self.parse_line_delta_iter(lines, version))
254
def lower_fulltext(self, content):
255
return content.text()
257
def lower_line_delta(self, delta):
259
for start, end, c, lines in delta:
260
out.append('%d,%d,%d\n' % (start, end, c))
261
out.extend([text for origin, text in lines])
265
def make_empty_knit(transport, relpath):
266
"""Construct a empty knit at the specified location."""
267
k = KnitVersionedFile(transport, relpath, 'w', KnitPlainFactory)
271
class KnitVersionedFile(VersionedFile):
272
"""Weave-like structure with faster random access.
274
A knit stores a number of texts and a summary of the relationships
275
between them. Texts are identified by a string version-id. Texts
276
are normally stored and retrieved as a series of lines, but can
277
also be passed as single strings.
279
Lines are stored with the trailing newline (if any) included, to
280
avoid special cases for files with no final newline. Lines are
281
composed of 8-bit characters, not unicode. The combination of
282
these approaches should mean any 'binary' file can be safely
283
stored and retrieved.
286
def __init__(self, relpath, transport, file_mode=None, access_mode=None,
287
factory=None, basis_knit=DEPRECATED_PARAMETER, delta=True,
288
create=False, create_parent_dir=False, delay_create=False,
290
"""Construct a knit at location specified by relpath.
292
:param create: If not True, only open an existing knit.
293
:param create_parent_dir: If True, create the parent directory if
294
creating the file fails. (This is used for stores with
295
hash-prefixes that may not exist yet)
296
:param delay_create: The calling code is aware that the knit won't
297
actually be created until the first data is stored.
299
if deprecated_passed(basis_knit):
300
warnings.warn("KnitVersionedFile.__(): The basis_knit parameter is"
301
" deprecated as of bzr 0.9.",
302
DeprecationWarning, stacklevel=2)
303
if access_mode is None:
305
super(KnitVersionedFile, self).__init__(access_mode)
306
assert access_mode in ('r', 'w'), "invalid mode specified %r" % access_mode
307
self.transport = transport
308
self.filename = relpath
309
self.factory = factory or KnitAnnotateFactory()
310
self.writable = (access_mode == 'w')
313
self._max_delta_chain = 200
315
self._index = _KnitIndex(transport, relpath + INDEX_SUFFIX,
316
access_mode, create=create, file_mode=file_mode,
317
create_parent_dir=create_parent_dir, delay_create=delay_create,
319
self._data = _KnitData(transport, relpath + DATA_SUFFIX,
320
access_mode, create=create and not len(self), file_mode=file_mode,
321
create_parent_dir=create_parent_dir, delay_create=delay_create,
325
return '%s(%s)' % (self.__class__.__name__,
326
self.transport.abspath(self.filename))
328
def _check_should_delta(self, first_parents):
329
"""Iterate back through the parent listing, looking for a fulltext.
331
This is used when we want to decide whether to add a delta or a new
332
fulltext. It searches for _max_delta_chain parents. When it finds a
333
fulltext parent, it sees if the total size of the deltas leading up to
334
it is large enough to indicate that we want a new full text anyway.
336
Return True if we should create a new delta, False if we should use a
341
delta_parents = first_parents
342
for count in xrange(self._max_delta_chain):
343
parent = delta_parents[0]
344
method = self._index.get_method(parent)
345
pos, size = self._index.get_position(parent)
346
if method == 'fulltext':
350
delta_parents = self._index.get_parents(parent)
352
# We couldn't find a fulltext, so we must create a new one
355
return fulltext_size > delta_size
357
def _add_delta(self, version_id, parents, delta_parent, sha1, noeol, delta):
358
"""See VersionedFile._add_delta()."""
359
self._check_add(version_id, []) # should we check the lines ?
360
self._check_versions_present(parents)
364
for parent in parents:
365
if not self.has_version(parent):
366
ghosts.append(parent)
368
present_parents.append(parent)
370
if delta_parent is None:
371
# reconstitute as full text.
372
assert len(delta) == 1 or len(delta) == 0
374
assert delta[0][0] == 0
375
assert delta[0][1] == 0, delta[0][1]
376
return super(KnitVersionedFile, self)._add_delta(version_id,
387
options.append('no-eol')
389
if delta_parent is not None:
390
# determine the current delta chain length.
391
# To speed the extract of texts the delta chain is limited
392
# to a fixed number of deltas. This should minimize both
393
# I/O and the time spend applying deltas.
394
# The window was changed to a maximum of 200 deltas, but also added
395
# was a check that the total compressed size of the deltas is
396
# smaller than the compressed size of the fulltext.
397
if not self._check_should_delta([delta_parent]):
398
# We don't want a delta here, just do a normal insertion.
399
return super(KnitVersionedFile, self)._add_delta(version_id,
406
options.append('line-delta')
407
store_lines = self.factory.lower_line_delta(delta)
409
where, size = self._data.add_record(version_id, digest, store_lines)
410
self._index.add_version(version_id, options, where, size, parents)
412
def _add_raw_records(self, records, data):
413
"""Add all the records 'records' with data pre-joined in 'data'.
415
:param records: A list of tuples(version_id, options, parents, size).
416
:param data: The data for the records. When it is written, the records
417
are adjusted to have pos pointing into data by the sum of
418
the preceding records sizes.
421
pos = self._data.add_raw_record(data)
424
for (version_id, options, parents, size) in records:
425
index_entries.append((version_id, options, pos+offset,
427
if self._data._do_cache:
428
self._data._cache[version_id] = data[offset:offset+size]
430
self._index.add_versions(index_entries)
432
def enable_cache(self):
433
"""Start caching data for this knit"""
434
self._data.enable_cache()
436
def clear_cache(self):
437
"""Clear the data cache only."""
438
self._data.clear_cache()
440
def copy_to(self, name, transport):
441
"""See VersionedFile.copy_to()."""
442
# copy the current index to a temp index to avoid racing with local
444
transport.put_file_non_atomic(name + INDEX_SUFFIX + '.tmp',
445
self.transport.get(self._index._filename))
447
f = self._data._open_file()
449
transport.put_file(name + DATA_SUFFIX, f)
452
# move the copied index into place
453
transport.move(name + INDEX_SUFFIX + '.tmp', name + INDEX_SUFFIX)
455
def create_empty(self, name, transport, mode=None):
456
return KnitVersionedFile(name, transport, factory=self.factory,
457
delta=self.delta, create=True)
459
def _fix_parents(self, version, new_parents):
460
"""Fix the parents list for version.
462
This is done by appending a new version to the index
463
with identical data except for the parents list.
464
the parents list must be a superset of the current
467
current_values = self._index._cache[version]
468
assert set(current_values[4]).difference(set(new_parents)) == set()
469
self._index.add_version(version,
475
def get_delta(self, version_id):
476
"""Get a delta for constructing version from some other version."""
477
if not self.has_version(version_id):
478
raise RevisionNotPresent(version_id, self.filename)
480
parents = self.get_parents(version_id)
485
data_pos, data_size = self._index.get_position(version_id)
486
data, sha1 = self._data.read_records(((version_id, data_pos, data_size),))[version_id]
487
version_idx = self._index.lookup(version_id)
488
noeol = 'no-eol' in self._index.get_options(version_id)
489
if 'fulltext' == self._index.get_method(version_id):
490
new_content = self.factory.parse_fulltext(data, version_idx)
491
if parent is not None:
492
reference_content = self._get_content(parent)
493
old_texts = reference_content.text()
496
new_texts = new_content.text()
497
delta_seq = KnitSequenceMatcher(None, old_texts, new_texts)
498
return parent, sha1, noeol, self._make_line_delta(delta_seq, new_content)
500
delta = self.factory.parse_line_delta(data, version_idx)
501
return parent, sha1, noeol, delta
503
def get_graph_with_ghosts(self):
504
"""See VersionedFile.get_graph_with_ghosts()."""
505
graph_items = self._index.get_graph()
506
return dict(graph_items)
508
def get_sha1(self, version_id):
509
"""See VersionedFile.get_sha1()."""
510
record_map = self._get_record_map([version_id])
511
method, content, digest, next = record_map[version_id]
516
"""See VersionedFile.get_suffixes()."""
517
return [DATA_SUFFIX, INDEX_SUFFIX]
519
def has_ghost(self, version_id):
520
"""True if there is a ghost reference in the file to version_id."""
522
if self.has_version(version_id):
524
# optimisable if needed by memoising the _ghosts set.
525
items = self._index.get_graph()
526
for node, parents in items:
527
for parent in parents:
528
if parent not in self._index._cache:
529
if parent == version_id:
534
"""See VersionedFile.versions."""
535
return self._index.get_versions()
537
def has_version(self, version_id):
538
"""See VersionedFile.has_version."""
539
return self._index.has_version(version_id)
541
__contains__ = has_version
543
def _merge_annotations(self, content, parents, parent_texts={},
544
delta=None, annotated=None):
545
"""Merge annotations for content. This is done by comparing
546
the annotations based on changed to the text.
550
for parent_id in parents:
551
merge_content = self._get_content(parent_id, parent_texts)
552
seq = patiencediff.PatienceSequenceMatcher(
553
None, merge_content.text(), content.text())
554
if delta_seq is None:
555
# setup a delta seq to reuse.
557
for i, j, n in seq.get_matching_blocks():
560
# this appears to copy (origin, text) pairs across to the new
561
# content for any line that matches the last-checked parent.
562
# FIXME: save the sequence control data for delta compression
563
# against the most relevant parent rather than rediffing.
564
content._lines[j:j+n] = merge_content._lines[i:i+n]
567
reference_content = self._get_content(parents[0], parent_texts)
568
new_texts = content.text()
569
old_texts = reference_content.text()
570
delta_seq = patiencediff.PatienceSequenceMatcher(
571
None, old_texts, new_texts)
572
return self._make_line_delta(delta_seq, content)
574
def _make_line_delta(self, delta_seq, new_content):
575
"""Generate a line delta from delta_seq and new_content."""
577
for op in delta_seq.get_opcodes():
580
diff_hunks.append((op[1], op[2], op[4]-op[3], new_content._lines[op[3]:op[4]]))
583
def _get_components_positions(self, version_ids):
584
"""Produce a map of position data for the components of versions.
586
This data is intended to be used for retrieving the knit records.
588
A dict of version_id to (method, data_pos, data_size, next) is
590
method is the way referenced data should be applied.
591
data_pos is the position of the data in the knit.
592
data_size is the size of the data in the knit.
593
next is the build-parent of the version, or None for fulltexts.
596
for version_id in version_ids:
599
while cursor is not None and cursor not in component_data:
600
method = self._index.get_method(cursor)
601
if method == 'fulltext':
604
next = self.get_parents(cursor)[0]
605
data_pos, data_size = self._index.get_position(cursor)
606
component_data[cursor] = (method, data_pos, data_size, next)
608
return component_data
610
def _get_content(self, version_id, parent_texts={}):
611
"""Returns a content object that makes up the specified
613
if not self.has_version(version_id):
614
raise RevisionNotPresent(version_id, self.filename)
616
cached_version = parent_texts.get(version_id, None)
617
if cached_version is not None:
618
return cached_version
620
text_map, contents_map = self._get_content_maps([version_id])
621
return contents_map[version_id]
623
def _check_versions_present(self, version_ids):
624
"""Check that all specified versions are present."""
625
version_ids = set(version_ids)
626
for r in list(version_ids):
627
if self._index.has_version(r):
628
version_ids.remove(r)
630
raise RevisionNotPresent(list(version_ids)[0], self.filename)
632
def _add_lines_with_ghosts(self, version_id, parents, lines, parent_texts):
633
"""See VersionedFile.add_lines_with_ghosts()."""
634
self._check_add(version_id, lines)
635
return self._add(version_id, lines[:], parents, self.delta, parent_texts)
637
def _add_lines(self, version_id, parents, lines, parent_texts):
638
"""See VersionedFile.add_lines."""
639
self._check_add(version_id, lines)
640
self._check_versions_present(parents)
641
return self._add(version_id, lines[:], parents, self.delta, parent_texts)
643
def _check_add(self, version_id, lines):
644
"""check that version_id and lines are safe to add."""
645
assert self.writable, "knit is not opened for write"
646
### FIXME escape. RBC 20060228
647
if contains_whitespace(version_id):
648
raise InvalidRevisionId(version_id, self.filename)
649
if self.has_version(version_id):
650
raise RevisionAlreadyPresent(version_id, self.filename)
651
self._check_lines_not_unicode(lines)
652
self._check_lines_are_lines(lines)
654
def _add(self, version_id, lines, parents, delta, parent_texts):
655
"""Add a set of lines on top of version specified by parents.
657
If delta is true, compress the text as a line-delta against
660
Any versions not present will be converted into ghosts.
662
# 461 0 6546.0390 43.9100 bzrlib.knit:489(_add)
663
# +400 0 889.4890 418.9790 +bzrlib.knit:192(lower_fulltext)
664
# +461 0 1364.8070 108.8030 +bzrlib.knit:996(add_record)
665
# +461 0 193.3940 41.5720 +bzrlib.knit:898(add_version)
666
# +461 0 134.0590 18.3810 +bzrlib.osutils:361(sha_strings)
667
# +461 0 36.3420 15.4540 +bzrlib.knit:146(make)
668
# +1383 0 8.0370 8.0370 +<len>
669
# +61 0 13.5770 7.9190 +bzrlib.knit:199(lower_line_delta)
670
# +61 0 963.3470 7.8740 +bzrlib.knit:427(_get_content)
671
# +61 0 973.9950 5.2950 +bzrlib.knit:136(line_delta)
672
# +61 0 1918.1800 5.2640 +bzrlib.knit:359(_merge_annotations)
676
if parent_texts is None:
678
for parent in parents:
679
if not self.has_version(parent):
680
ghosts.append(parent)
682
present_parents.append(parent)
684
if delta and not len(present_parents):
687
digest = sha_strings(lines)
690
if lines[-1][-1] != '\n':
691
options.append('no-eol')
692
lines[-1] = lines[-1] + '\n'
694
if len(present_parents) and delta:
695
# To speed the extract of texts the delta chain is limited
696
# to a fixed number of deltas. This should minimize both
697
# I/O and the time spend applying deltas.
698
delta = self._check_should_delta(present_parents)
700
lines = self.factory.make(lines, version_id)
701
if delta or (self.factory.annotated and len(present_parents) > 0):
702
# Merge annotations from parent texts if so is needed.
703
delta_hunks = self._merge_annotations(lines, present_parents, parent_texts,
704
delta, self.factory.annotated)
707
options.append('line-delta')
708
store_lines = self.factory.lower_line_delta(delta_hunks)
710
options.append('fulltext')
711
store_lines = self.factory.lower_fulltext(lines)
713
where, size = self._data.add_record(version_id, digest, store_lines)
714
self._index.add_version(version_id, options, where, size, parents)
717
def check(self, progress_bar=None):
718
"""See VersionedFile.check()."""
720
def _clone_text(self, new_version_id, old_version_id, parents):
721
"""See VersionedFile.clone_text()."""
722
# FIXME RBC 20060228 make fast by only inserting an index with null
724
self.add_lines(new_version_id, parents, self.get_lines(old_version_id))
726
def get_lines(self, version_id):
727
"""See VersionedFile.get_lines()."""
728
return self.get_line_list([version_id])[0]
730
def _get_record_map(self, version_ids):
731
"""Produce a dictionary of knit records.
733
The keys are version_ids, the values are tuples of (method, content,
735
method is the way the content should be applied.
736
content is a KnitContent object.
737
digest is the SHA1 digest of this version id after all steps are done
738
next is the build-parent of the version, i.e. the leftmost ancestor.
739
If the method is fulltext, next will be None.
741
position_map = self._get_components_positions(version_ids)
742
# c = component_id, m = method, p = position, s = size, n = next
743
records = [(c, p, s) for c, (m, p, s, n) in position_map.iteritems()]
745
for component_id, content, digest in \
746
self._data.read_records_iter(records):
747
method, position, size, next = position_map[component_id]
748
record_map[component_id] = method, content, digest, next
752
def get_text(self, version_id):
753
"""See VersionedFile.get_text"""
754
return self.get_texts([version_id])[0]
756
def get_texts(self, version_ids):
757
return [''.join(l) for l in self.get_line_list(version_ids)]
759
def get_line_list(self, version_ids):
760
"""Return the texts of listed versions as a list of strings."""
761
text_map, content_map = self._get_content_maps(version_ids)
762
return [text_map[v] for v in version_ids]
764
def _get_content_maps(self, version_ids):
765
"""Produce maps of text and KnitContents
767
:return: (text_map, content_map) where text_map contains the texts for
768
the requested versions and content_map contains the KnitContents.
769
Both dicts take version_ids as their keys.
771
for version_id in version_ids:
772
if not self.has_version(version_id):
773
raise RevisionNotPresent(version_id, self.filename)
774
record_map = self._get_record_map(version_ids)
779
for version_id in version_ids:
782
while cursor is not None:
783
method, data, digest, next = record_map[cursor]
784
components.append((cursor, method, data, digest))
785
if cursor in content_map:
790
for component_id, method, data, digest in reversed(components):
791
if component_id in content_map:
792
content = content_map[component_id]
794
version_idx = self._index.lookup(component_id)
795
if method == 'fulltext':
796
assert content is None
797
content = self.factory.parse_fulltext(data, version_idx)
798
elif method == 'line-delta':
799
delta = self.factory.parse_line_delta(data, version_idx)
800
content = content.copy()
801
content._lines = self._apply_delta(content._lines,
803
content_map[component_id] = content
805
if 'no-eol' in self._index.get_options(version_id):
806
content = content.copy()
807
line = content._lines[-1][1].rstrip('\n')
808
content._lines[-1] = (content._lines[-1][0], line)
809
final_content[version_id] = content
811
# digest here is the digest from the last applied component.
812
text = content.text()
813
if sha_strings(text) != digest:
814
raise KnitCorrupt(self.filename,
815
'sha-1 does not match %s' % version_id)
817
text_map[version_id] = text
818
return text_map, final_content
820
def iter_lines_added_or_present_in_versions(self, version_ids=None,
822
"""See VersionedFile.iter_lines_added_or_present_in_versions()."""
823
if version_ids is None:
824
version_ids = self.versions()
826
pb = progress.DummyProgress()
827
# we don't care about inclusions, the caller cares.
828
# but we need to setup a list of records to visit.
829
# we need version_id, position, length
830
version_id_records = []
831
requested_versions = set(version_ids)
832
# filter for available versions
833
for version_id in requested_versions:
834
if not self.has_version(version_id):
835
raise RevisionNotPresent(version_id, self.filename)
836
# get a in-component-order queue:
837
for version_id in self.versions():
838
if version_id in requested_versions:
839
data_pos, length = self._index.get_position(version_id)
840
version_id_records.append((version_id, data_pos, length))
842
total = len(version_id_records)
843
for version_idx, (version_id, data, sha_value) in \
844
enumerate(self._data.read_records_iter(version_id_records)):
845
pb.update('Walking content.', version_idx, total)
846
method = self._index.get_method(version_id)
847
version_idx = self._index.lookup(version_id)
848
assert method in ('fulltext', 'line-delta')
849
if method == 'fulltext':
850
content = self.factory.parse_fulltext(data, version_idx)
851
for line in content.text():
854
delta = self.factory.parse_line_delta(data, version_idx)
855
for start, end, count, lines in delta:
856
for origin, line in lines:
858
pb.update('Walking content.', total, total)
860
def num_versions(self):
861
"""See VersionedFile.num_versions()."""
862
return self._index.num_versions()
864
__len__ = num_versions
866
def annotate_iter(self, version_id):
867
"""See VersionedFile.annotate_iter."""
868
content = self._get_content(version_id)
869
for origin, text in content.annotate_iter():
872
def get_parents(self, version_id):
873
"""See VersionedFile.get_parents."""
876
# 52554 calls in 1264 872 internal down from 3674
878
return self._index.get_parents(version_id)
880
raise RevisionNotPresent(version_id, self.filename)
882
def get_parents_with_ghosts(self, version_id):
883
"""See VersionedFile.get_parents."""
885
return self._index.get_parents_with_ghosts(version_id)
887
raise RevisionNotPresent(version_id, self.filename)
889
def get_ancestry(self, versions):
890
"""See VersionedFile.get_ancestry."""
891
if isinstance(versions, basestring):
892
versions = [versions]
895
self._check_versions_present(versions)
896
return self._index.get_ancestry(versions)
898
def get_ancestry_with_ghosts(self, versions):
899
"""See VersionedFile.get_ancestry_with_ghosts."""
900
if isinstance(versions, basestring):
901
versions = [versions]
904
self._check_versions_present(versions)
905
return self._index.get_ancestry_with_ghosts(versions)
907
#@deprecated_method(zero_eight)
908
def walk(self, version_ids):
909
"""See VersionedFile.walk."""
910
# We take the short path here, and extract all relevant texts
911
# and put them in a weave and let that do all the work. Far
912
# from optimal, but is much simpler.
913
# FIXME RB 20060228 this really is inefficient!
914
from bzrlib.weave import Weave
916
w = Weave(self.filename)
917
ancestry = self.get_ancestry(version_ids)
918
sorted_graph = topo_sort(self._index.get_graph())
919
version_list = [vid for vid in sorted_graph if vid in ancestry]
921
for version_id in version_list:
922
lines = self.get_lines(version_id)
923
w.add_lines(version_id, self.get_parents(version_id), lines)
925
for lineno, insert_id, dset, line in w.walk(version_ids):
926
yield lineno, insert_id, dset, line
928
def plan_merge(self, ver_a, ver_b):
929
"""See VersionedFile.plan_merge."""
930
ancestors_b = set(self.get_ancestry(ver_b))
931
def status_a(revision, text):
932
if revision in ancestors_b:
933
return 'killed-b', text
937
ancestors_a = set(self.get_ancestry(ver_a))
938
def status_b(revision, text):
939
if revision in ancestors_a:
940
return 'killed-a', text
944
annotated_a = self.annotate(ver_a)
945
annotated_b = self.annotate(ver_b)
946
plain_a = [t for (a, t) in annotated_a]
947
plain_b = [t for (a, t) in annotated_b]
948
blocks = KnitSequenceMatcher(None, plain_a, plain_b).get_matching_blocks()
951
for ai, bi, l in blocks:
952
# process all mismatched sections
953
# (last mismatched section is handled because blocks always
954
# includes a 0-length last block)
955
for revision, text in annotated_a[a_cur:ai]:
956
yield status_a(revision, text)
957
for revision, text in annotated_b[b_cur:bi]:
958
yield status_b(revision, text)
960
# and now the matched section
963
for text_a, text_b in zip(plain_a[ai:a_cur], plain_b[bi:b_cur]):
964
assert text_a == text_b
965
yield "unchanged", text_a
968
class _KnitComponentFile(object):
969
"""One of the files used to implement a knit database"""
971
def __init__(self, transport, filename, mode, file_mode=None,
972
create_parent_dir=False, dir_mode=None):
973
self._transport = transport
974
self._filename = filename
976
self._file_mode = file_mode
977
self._dir_mode = dir_mode
978
self._create_parent_dir = create_parent_dir
979
self._need_to_create = False
981
def check_header(self, fp):
984
# An empty file can actually be treated as though the file doesn't
986
raise errors.NoSuchFile(self._transport.base + self._filename)
987
if line != self.HEADER:
988
raise KnitHeaderError(badline=line,
989
filename=self._transport.abspath(self._filename))
992
"""Commit is a nop."""
995
return '%s(%s)' % (self.__class__.__name__, self._filename)
998
class _KnitIndex(_KnitComponentFile):
999
"""Manages knit index file.
1001
The index is already kept in memory and read on startup, to enable
1002
fast lookups of revision information. The cursor of the index
1003
file is always pointing to the end, making it easy to append
1006
_cache is a cache for fast mapping from version id to a Index
1009
_history is a cache for fast mapping from indexes to version ids.
1011
The index data format is dictionary compressed when it comes to
1012
parent references; a index entry may only have parents that with a
1013
lover index number. As a result, the index is topological sorted.
1015
Duplicate entries may be written to the index for a single version id
1016
if this is done then the latter one completely replaces the former:
1017
this allows updates to correct version and parent information.
1018
Note that the two entries may share the delta, and that successive
1019
annotations and references MUST point to the first entry.
1021
The index file on disc contains a header, followed by one line per knit
1022
record. The same revision can be present in an index file more than once.
1023
The first occurrence gets assigned a sequence number starting from 0.
1025
The format of a single line is
1026
REVISION_ID FLAGS BYTE_OFFSET LENGTH( PARENT_ID|PARENT_SEQUENCE_ID)* :\n
1027
REVISION_ID is a utf8-encoded revision id
1028
FLAGS is a comma separated list of flags about the record. Values include
1029
no-eol, line-delta, fulltext.
1030
BYTE_OFFSET is the ascii representation of the byte offset in the data file
1031
that the the compressed data starts at.
1032
LENGTH is the ascii representation of the length of the data file.
1033
PARENT_ID a utf-8 revision id prefixed by a '.' that is a parent of
1035
PARENT_SEQUENCE_ID the ascii representation of the sequence number of a
1036
revision id already in the knit that is a parent of REVISION_ID.
1037
The ' :' marker is the end of record marker.
1040
when a write is interrupted to the index file, it will result in a line that
1041
does not end in ' :'. If the ' :' is not present at the end of a line, or at
1042
the end of the file, then the record that is missing it will be ignored by
1045
When writing new records to the index file, the data is preceded by '\n'
1046
to ensure that records always start on new lines even if the last write was
1047
interrupted. As a result its normal for the last line in the index to be
1048
missing a trailing newline. One can be added with no harmful effects.
1051
HEADER = "# bzr knit index 8\n"
1053
# speed of knit parsing went from 280 ms to 280 ms with slots addition.
1054
# __slots__ = ['_cache', '_history', '_transport', '_filename']
1056
def _cache_version(self, version_id, options, pos, size, parents):
1057
"""Cache a version record in the history array and index cache.
1059
This is inlined into __init__ for performance. KEEP IN SYNC.
1060
(It saves 60ms, 25% of the __init__ overhead on local 4000 record
1063
# only want the _history index to reference the 1st index entry
1065
if version_id not in self._cache:
1066
index = len(self._history)
1067
self._history.append(version_id)
1069
index = self._cache[version_id][5]
1070
self._cache[version_id] = (version_id,
1077
def __init__(self, transport, filename, mode, create=False, file_mode=None,
1078
create_parent_dir=False, delay_create=False, dir_mode=None):
1079
_KnitComponentFile.__init__(self, transport, filename, mode,
1080
file_mode=file_mode,
1081
create_parent_dir=create_parent_dir,
1084
# position in _history is the 'official' index for a revision
1085
# but the values may have come from a newer entry.
1086
# so - wc -l of a knit index is != the number of unique names
1089
decode_utf8 = cache_utf8.decode
1090
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1095
pb.update('read knit index', count, total)
1096
fp = self._transport.get(self._filename)
1098
self.check_header(fp)
1099
# readlines reads the whole file at once:
1100
# bad for transports like http, good for local disk
1101
# we save 60 ms doing this one change (
1102
# from calling readline each time to calling
1104
# probably what we want for nice behaviour on
1105
# http is a incremental readlines that yields, or
1106
# a check for local vs non local indexes,
1107
for l in fp.readlines():
1109
if len(rec) < 5 or rec[-1] != ':':
1111
# FIXME: in the future we should determine if its a
1112
# short write - and ignore it
1113
# or a different failure, and raise. RBC 20060407
1117
#pb.update('read knit index', count, total)
1118
# See self._parse_parents
1120
for value in rec[4:-1]:
1122
# uncompressed reference
1123
parents.append(decode_utf8(value[1:]))
1125
# this is 15/4000ms faster than isinstance,
1127
# this function is called thousands of times a
1128
# second so small variations add up.
1129
assert value.__class__ is str
1130
parents.append(self._history[int(value)])
1131
# end self._parse_parents
1132
# self._cache_version(decode_utf8(rec[0]),
1133
# rec[1].split(','),
1137
# --- self._cache_version
1138
# only want the _history index to reference the 1st
1139
# index entry for version_id
1140
version_id = decode_utf8(rec[0])
1141
if version_id not in self._cache:
1142
index = len(self._history)
1143
self._history.append(version_id)
1145
index = self._cache[version_id][5]
1146
self._cache[version_id] = (version_id,
1152
# --- self._cache_version
1155
except NoSuchFile, e:
1156
if mode != 'w' or not create:
1159
self._need_to_create = True
1161
self._transport.put_bytes_non_atomic(self._filename,
1162
self.HEADER, mode=self._file_mode)
1165
pb.update('read knit index', total, total)
1168
def _parse_parents(self, compressed_parents):
1169
"""convert a list of string parent values into version ids.
1171
ints are looked up in the index.
1172
.FOO values are ghosts and converted in to FOO.
1174
NOTE: the function is retained here for clarity, and for possible
1175
use in partial index reads. However bulk processing now has
1176
it inlined in __init__ for inner-loop optimisation.
1179
for value in compressed_parents:
1180
if value[-1] == '.':
1181
# uncompressed reference
1182
result.append(cache_utf8.decode_utf8(value[1:]))
1184
# this is 15/4000ms faster than isinstance,
1185
# this function is called thousands of times a
1186
# second so small variations add up.
1187
assert value.__class__ is str
1188
result.append(self._history[int(value)])
1191
def get_graph(self):
1193
for version_id, index in self._cache.iteritems():
1194
graph.append((version_id, index[4]))
1197
def get_ancestry(self, versions):
1198
"""See VersionedFile.get_ancestry."""
1199
# get a graph of all the mentioned versions:
1201
pending = set(versions)
1203
version = pending.pop()
1204
parents = self._cache[version][4]
1205
# got the parents ok
1207
parents = [parent for parent in parents if parent in self._cache]
1208
for parent in parents:
1209
# if not completed and not a ghost
1210
if parent not in graph:
1212
graph[version] = parents
1213
return topo_sort(graph.items())
1215
def get_ancestry_with_ghosts(self, versions):
1216
"""See VersionedFile.get_ancestry_with_ghosts."""
1217
# get a graph of all the mentioned versions:
1219
pending = set(versions)
1221
version = pending.pop()
1223
parents = self._cache[version][4]
1229
# got the parents ok
1230
for parent in parents:
1231
if parent not in graph:
1233
graph[version] = parents
1234
return topo_sort(graph.items())
1236
def num_versions(self):
1237
return len(self._history)
1239
__len__ = num_versions
1241
def get_versions(self):
1242
return self._history
1244
def idx_to_name(self, idx):
1245
return self._history[idx]
1247
def lookup(self, version_id):
1248
assert version_id in self._cache
1249
return self._cache[version_id][5]
1251
def _version_list_to_index(self, versions):
1252
encode_utf8 = cache_utf8.encode
1254
for version in versions:
1255
if version in self._cache:
1256
# -- inlined lookup() --
1257
result_list.append(str(self._cache[version][5]))
1258
# -- end lookup () --
1260
result_list.append('.' + encode_utf8(version))
1261
return ' '.join(result_list)
1263
def add_version(self, version_id, options, pos, size, parents):
1264
"""Add a version record to the index."""
1265
self.add_versions(((version_id, options, pos, size, parents),))
1267
def add_versions(self, versions):
1268
"""Add multiple versions to the index.
1270
:param versions: a list of tuples:
1271
(version_id, options, pos, size, parents).
1274
encode_utf8 = cache_utf8.encode
1275
orig_history = self._history[:]
1276
orig_cache = self._cache.copy()
1279
for version_id, options, pos, size, parents in versions:
1280
line = "\n%s %s %s %s %s :" % (encode_utf8(version_id),
1284
self._version_list_to_index(parents))
1285
assert isinstance(line, str), \
1286
'content must be utf-8 encoded: %r' % (line,)
1288
self._cache_version(version_id, options, pos, size, parents)
1289
if not self._need_to_create:
1290
self._transport.append_bytes(self._filename, ''.join(lines))
1293
sio.write(self.HEADER)
1294
sio.writelines(lines)
1296
self._transport.put_file_non_atomic(self._filename, sio,
1297
create_parent_dir=self._create_parent_dir,
1298
mode=self._file_mode,
1299
dir_mode=self._dir_mode)
1300
self._need_to_create = False
1302
# If any problems happen, restore the original values and re-raise
1303
self._history = orig_history
1304
self._cache = orig_cache
1307
def has_version(self, version_id):
1308
"""True if the version is in the index."""
1309
return (version_id in self._cache)
1311
def get_position(self, version_id):
1312
"""Return data position and size of specified version."""
1313
return (self._cache[version_id][2], \
1314
self._cache[version_id][3])
1316
def get_method(self, version_id):
1317
"""Return compression method of specified version."""
1318
options = self._cache[version_id][1]
1319
if 'fulltext' in options:
1322
assert 'line-delta' in options
1325
def get_options(self, version_id):
1326
return self._cache[version_id][1]
1328
def get_parents(self, version_id):
1329
"""Return parents of specified version ignoring ghosts."""
1330
return [parent for parent in self._cache[version_id][4]
1331
if parent in self._cache]
1333
def get_parents_with_ghosts(self, version_id):
1334
"""Return parents of specified version with ghosts."""
1335
return self._cache[version_id][4]
1337
def check_versions_present(self, version_ids):
1338
"""Check that all specified versions are present."""
1339
version_ids = set(version_ids)
1340
for version_id in list(version_ids):
1341
if version_id in self._cache:
1342
version_ids.remove(version_id)
1344
raise RevisionNotPresent(list(version_ids)[0], self.filename)
1347
class _KnitData(_KnitComponentFile):
1348
"""Contents of the knit data file"""
1350
def __init__(self, transport, filename, mode, create=False, file_mode=None,
1351
create_parent_dir=False, delay_create=False,
1353
_KnitComponentFile.__init__(self, transport, filename, mode,
1354
file_mode=file_mode,
1355
create_parent_dir=create_parent_dir,
1357
self._checked = False
1358
# TODO: jam 20060713 conceptually, this could spill to disk
1359
# if the cached size gets larger than a certain amount
1360
# but it complicates the model a bit, so for now just use
1361
# a simple dictionary
1363
self._do_cache = False
1366
self._need_to_create = create
1368
self._transport.put_bytes_non_atomic(self._filename, '',
1369
mode=self._file_mode)
1371
def enable_cache(self):
1372
"""Enable caching of reads."""
1373
self._do_cache = True
1375
def clear_cache(self):
1376
"""Clear the record cache."""
1377
self._do_cache = False
1380
def _open_file(self):
1382
return self._transport.get(self._filename)
1387
def _record_to_data(self, version_id, digest, lines):
1388
"""Convert version_id, digest, lines into a raw data block.
1390
:return: (len, a StringIO instance with the raw data ready to read.)
1393
data_file = GzipFile(None, mode='wb', fileobj=sio)
1395
version_id_utf8 = cache_utf8.encode(version_id)
1396
data_file.writelines(chain(
1397
["version %s %d %s\n" % (version_id_utf8,
1401
["end %s\n" % version_id_utf8]))
1408
def add_raw_record(self, raw_data):
1409
"""Append a prepared record to the data file.
1411
:return: the offset in the data file raw_data was written.
1413
assert isinstance(raw_data, str), 'data must be plain bytes'
1414
if not self._need_to_create:
1415
return self._transport.append_bytes(self._filename, raw_data)
1417
self._transport.put_bytes_non_atomic(self._filename, raw_data,
1418
create_parent_dir=self._create_parent_dir,
1419
mode=self._file_mode,
1420
dir_mode=self._dir_mode)
1421
self._need_to_create = False
1424
def add_record(self, version_id, digest, lines):
1425
"""Write new text record to disk. Returns the position in the
1426
file where it was written."""
1427
size, sio = self._record_to_data(version_id, digest, lines)
1429
if not self._need_to_create:
1430
start_pos = self._transport.append_file(self._filename, sio)
1432
self._transport.put_file_non_atomic(self._filename, sio,
1433
create_parent_dir=self._create_parent_dir,
1434
mode=self._file_mode,
1435
dir_mode=self._dir_mode)
1436
self._need_to_create = False
1439
self._cache[version_id] = sio.getvalue()
1440
return start_pos, size
1442
def _parse_record_header(self, version_id, raw_data):
1443
"""Parse a record header for consistency.
1445
:return: the header and the decompressor stream.
1446
as (stream, header_record)
1448
df = GzipFile(mode='rb', fileobj=StringIO(raw_data))
1449
rec = df.readline().split()
1451
raise KnitCorrupt(self._filename, 'unexpected number of elements in record header')
1452
if cache_utf8.decode(rec[1]) != version_id:
1453
raise KnitCorrupt(self._filename,
1454
'unexpected version, wanted %r, got %r' % (
1455
version_id, rec[1]))
1458
def _parse_record(self, version_id, data):
1460
# 4168 calls in 2880 217 internal
1461
# 4168 calls to _parse_record_header in 2121
1462
# 4168 calls to readlines in 330
1463
df, rec = self._parse_record_header(version_id, data)
1464
record_contents = df.readlines()
1465
l = record_contents.pop()
1466
assert len(record_contents) == int(rec[2])
1467
if l != 'end %s\n' % cache_utf8.encode(version_id):
1468
raise KnitCorrupt(self._filename, 'unexpected version end line %r, wanted %r'
1471
return record_contents, rec[3]
1473
def read_records_iter_raw(self, records):
1474
"""Read text records from data file and yield raw data.
1476
This unpacks enough of the text record to validate the id is
1477
as expected but thats all.
1479
# setup an iterator of the external records:
1480
# uses readv so nice and fast we hope.
1482
# grab the disk data needed.
1484
# Don't check _cache if it is empty
1485
needed_offsets = [(pos, size) for version_id, pos, size
1487
if version_id not in self._cache]
1489
needed_offsets = [(pos, size) for version_id, pos, size
1492
raw_records = self._transport.readv(self._filename, needed_offsets)
1495
for version_id, pos, size in records:
1496
if version_id in self._cache:
1497
# This data has already been validated
1498
data = self._cache[version_id]
1500
pos, data = raw_records.next()
1502
self._cache[version_id] = data
1504
# validate the header
1505
df, rec = self._parse_record_header(version_id, data)
1507
yield version_id, data
1509
def read_records_iter(self, records):
1510
"""Read text records from data file and yield result.
1512
The result will be returned in whatever is the fastest to read.
1513
Not by the order requested. Also, multiple requests for the same
1514
record will only yield 1 response.
1515
:param records: A list of (version_id, pos, len) entries
1516
:return: Yields (version_id, contents, digest) in the order
1517
read, not the order requested
1523
# Skip records we have alread seen
1524
yielded_records = set()
1525
needed_records = set()
1526
for record in records:
1527
if record[0] in self._cache:
1528
if record[0] in yielded_records:
1530
yielded_records.add(record[0])
1531
data = self._cache[record[0]]
1532
content, digest = self._parse_record(record[0], data)
1533
yield (record[0], content, digest)
1535
needed_records.add(record)
1536
needed_records = sorted(needed_records, key=operator.itemgetter(1))
1538
needed_records = sorted(set(records), key=operator.itemgetter(1))
1540
if not needed_records:
1543
# The transport optimizes the fetching as well
1544
# (ie, reads continuous ranges.)
1545
readv_response = self._transport.readv(self._filename,
1546
[(pos, size) for version_id, pos, size in needed_records])
1548
for (version_id, pos, size), (pos, data) in \
1549
izip(iter(needed_records), readv_response):
1550
content, digest = self._parse_record(version_id, data)
1552
self._cache[version_id] = data
1553
yield version_id, content, digest
1555
def read_records(self, records):
1556
"""Read records into a dictionary."""
1558
for record_id, content, digest in \
1559
self.read_records_iter(records):
1560
components[record_id] = (content, digest)
1564
class InterKnit(InterVersionedFile):
1565
"""Optimised code paths for knit to knit operations."""
1567
_matching_file_from_factory = KnitVersionedFile
1568
_matching_file_to_factory = KnitVersionedFile
1571
def is_compatible(source, target):
1572
"""Be compatible with knits. """
1574
return (isinstance(source, KnitVersionedFile) and
1575
isinstance(target, KnitVersionedFile))
1576
except AttributeError:
1579
def join(self, pb=None, msg=None, version_ids=None, ignore_missing=False):
1580
"""See InterVersionedFile.join."""
1581
assert isinstance(self.source, KnitVersionedFile)
1582
assert isinstance(self.target, KnitVersionedFile)
1584
version_ids = self._get_source_version_ids(version_ids, ignore_missing)
1589
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1591
version_ids = list(version_ids)
1592
if None in version_ids:
1593
version_ids.remove(None)
1595
self.source_ancestry = set(self.source.get_ancestry(version_ids))
1596
this_versions = set(self.target._index.get_versions())
1597
needed_versions = self.source_ancestry - this_versions
1598
cross_check_versions = self.source_ancestry.intersection(this_versions)
1599
mismatched_versions = set()
1600
for version in cross_check_versions:
1601
# scan to include needed parents.
1602
n1 = set(self.target.get_parents_with_ghosts(version))
1603
n2 = set(self.source.get_parents_with_ghosts(version))
1605
# FIXME TEST this check for cycles being introduced works
1606
# the logic is we have a cycle if in our graph we are an
1607
# ancestor of any of the n2 revisions.
1613
parent_ancestors = self.source.get_ancestry(parent)
1614
if version in parent_ancestors:
1615
raise errors.GraphCycleError([parent, version])
1616
# ensure this parent will be available later.
1617
new_parents = n2.difference(n1)
1618
needed_versions.update(new_parents.difference(this_versions))
1619
mismatched_versions.add(version)
1621
if not needed_versions and not mismatched_versions:
1623
full_list = topo_sort(self.source.get_graph())
1625
version_list = [i for i in full_list if (not self.target.has_version(i)
1626
and i in needed_versions)]
1630
copy_queue_records = []
1632
for version_id in version_list:
1633
options = self.source._index.get_options(version_id)
1634
parents = self.source._index.get_parents_with_ghosts(version_id)
1635
# check that its will be a consistent copy:
1636
for parent in parents:
1637
# if source has the parent, we must :
1638
# * already have it or
1639
# * have it scheduled already
1640
# otherwise we don't care
1641
assert (self.target.has_version(parent) or
1642
parent in copy_set or
1643
not self.source.has_version(parent))
1644
data_pos, data_size = self.source._index.get_position(version_id)
1645
copy_queue_records.append((version_id, data_pos, data_size))
1646
copy_queue.append((version_id, options, parents))
1647
copy_set.add(version_id)
1649
# data suck the join:
1651
total = len(version_list)
1654
for (version_id, raw_data), \
1655
(version_id2, options, parents) in \
1656
izip(self.source._data.read_records_iter_raw(copy_queue_records),
1658
assert version_id == version_id2, 'logic error, inconsistent results'
1660
pb.update("Joining knit", count, total)
1661
raw_records.append((version_id, options, parents, len(raw_data)))
1662
raw_datum.append(raw_data)
1663
self.target._add_raw_records(raw_records, ''.join(raw_datum))
1665
for version in mismatched_versions:
1666
# FIXME RBC 20060309 is this needed?
1667
n1 = set(self.target.get_parents_with_ghosts(version))
1668
n2 = set(self.source.get_parents_with_ghosts(version))
1669
# write a combined record to our history preserving the current
1670
# parents as first in the list
1671
new_parents = self.target.get_parents_with_ghosts(version) + list(n2.difference(n1))
1672
self.target.fix_parents(version, new_parents)
1678
InterVersionedFile.register_optimiser(InterKnit)
1681
class WeaveToKnit(InterVersionedFile):
1682
"""Optimised code paths for weave to knit operations."""
1684
_matching_file_from_factory = bzrlib.weave.WeaveFile
1685
_matching_file_to_factory = KnitVersionedFile
1688
def is_compatible(source, target):
1689
"""Be compatible with weaves to knits."""
1691
return (isinstance(source, bzrlib.weave.Weave) and
1692
isinstance(target, KnitVersionedFile))
1693
except AttributeError:
1696
def join(self, pb=None, msg=None, version_ids=None, ignore_missing=False):
1697
"""See InterVersionedFile.join."""
1698
assert isinstance(self.source, bzrlib.weave.Weave)
1699
assert isinstance(self.target, KnitVersionedFile)
1701
version_ids = self._get_source_version_ids(version_ids, ignore_missing)
1706
pb = bzrlib.ui.ui_factory.nested_progress_bar()
1708
version_ids = list(version_ids)
1710
self.source_ancestry = set(self.source.get_ancestry(version_ids))
1711
this_versions = set(self.target._index.get_versions())
1712
needed_versions = self.source_ancestry - this_versions
1713
cross_check_versions = self.source_ancestry.intersection(this_versions)
1714
mismatched_versions = set()
1715
for version in cross_check_versions:
1716
# scan to include needed parents.
1717
n1 = set(self.target.get_parents_with_ghosts(version))
1718
n2 = set(self.source.get_parents(version))
1719
# if all of n2's parents are in n1, then its fine.
1720
if n2.difference(n1):
1721
# FIXME TEST this check for cycles being introduced works
1722
# the logic is we have a cycle if in our graph we are an
1723
# ancestor of any of the n2 revisions.
1729
parent_ancestors = self.source.get_ancestry(parent)
1730
if version in parent_ancestors:
1731
raise errors.GraphCycleError([parent, version])
1732
# ensure this parent will be available later.
1733
new_parents = n2.difference(n1)
1734
needed_versions.update(new_parents.difference(this_versions))
1735
mismatched_versions.add(version)
1737
if not needed_versions and not mismatched_versions:
1739
full_list = topo_sort(self.source.get_graph())
1741
version_list = [i for i in full_list if (not self.target.has_version(i)
1742
and i in needed_versions)]
1746
total = len(version_list)
1747
for version_id in version_list:
1748
pb.update("Converting to knit", count, total)
1749
parents = self.source.get_parents(version_id)
1750
# check that its will be a consistent copy:
1751
for parent in parents:
1752
# if source has the parent, we must already have it
1753
assert (self.target.has_version(parent))
1754
self.target.add_lines(
1755
version_id, parents, self.source.get_lines(version_id))
1758
for version in mismatched_versions:
1759
# FIXME RBC 20060309 is this needed?
1760
n1 = set(self.target.get_parents_with_ghosts(version))
1761
n2 = set(self.source.get_parents(version))
1762
# write a combined record to our history preserving the current
1763
# parents as first in the list
1764
new_parents = self.target.get_parents_with_ghosts(version) + list(n2.difference(n1))
1765
self.target.fix_parents(version, new_parents)
1771
InterVersionedFile.register_optimiser(WeaveToKnit)
1774
class KnitSequenceMatcher(difflib.SequenceMatcher):
1775
"""Knit tuned sequence matcher.
1777
This is based on profiling of difflib which indicated some improvements
1778
for our usage pattern.
1781
def find_longest_match(self, alo, ahi, blo, bhi):
1782
"""Find longest matching block in a[alo:ahi] and b[blo:bhi].
1784
If isjunk is not defined:
1786
Return (i,j,k) such that a[i:i+k] is equal to b[j:j+k], where
1787
alo <= i <= i+k <= ahi
1788
blo <= j <= j+k <= bhi
1789
and for all (i',j',k') meeting those conditions,
1792
and if i == i', j <= j'
1794
In other words, of all maximal matching blocks, return one that
1795
starts earliest in a, and of all those maximal matching blocks that
1796
start earliest in a, return the one that starts earliest in b.
1798
>>> s = SequenceMatcher(None, " abcd", "abcd abcd")
1799
>>> s.find_longest_match(0, 5, 0, 9)
1802
If isjunk is defined, first the longest matching block is
1803
determined as above, but with the additional restriction that no
1804
junk element appears in the block. Then that block is extended as
1805
far as possible by matching (only) junk elements on both sides. So
1806
the resulting block never matches on junk except as identical junk
1807
happens to be adjacent to an "interesting" match.
1809
Here's the same example as before, but considering blanks to be
1810
junk. That prevents " abcd" from matching the " abcd" at the tail
1811
end of the second sequence directly. Instead only the "abcd" can
1812
match, and matches the leftmost "abcd" in the second sequence:
1814
>>> s = SequenceMatcher(lambda x: x==" ", " abcd", "abcd abcd")
1815
>>> s.find_longest_match(0, 5, 0, 9)
1818
If no blocks match, return (alo, blo, 0).
1820
>>> s = SequenceMatcher(None, "ab", "c")
1821
>>> s.find_longest_match(0, 2, 0, 1)
1825
# CAUTION: stripping common prefix or suffix would be incorrect.
1829
# Longest matching block is "ab", but if common prefix is
1830
# stripped, it's "a" (tied with "b"). UNIX(tm) diff does so
1831
# strip, so ends up claiming that ab is changed to acab by
1832
# inserting "ca" in the middle. That's minimal but unintuitive:
1833
# "it's obvious" that someone inserted "ac" at the front.
1834
# Windiff ends up at the same place as diff, but by pairing up
1835
# the unique 'b's and then matching the first two 'a's.
1837
a, b, b2j, isbjunk = self.a, self.b, self.b2j, self.isbjunk
1838
besti, bestj, bestsize = alo, blo, 0
1839
# find longest junk-free match
1840
# during an iteration of the loop, j2len[j] = length of longest
1841
# junk-free match ending with a[i-1] and b[j]
1845
for i in xrange(alo, ahi):
1846
# look at all instances of a[i] in b; note that because
1847
# b2j has no junk keys, the loop is skipped if a[i] is junk
1848
j2lenget = j2len.get
1851
# changing b2j.get(a[i], nothing) to a try:KeyError pair produced the
1852
# following improvement
1853
# 704 0 4650.5320 2620.7410 bzrlib.knit:1336(find_longest_match)
1854
# +326674 0 1655.1210 1655.1210 +<method 'get' of 'dict' objects>
1855
# +76519 0 374.6700 374.6700 +<method 'has_key' of 'dict' objects>
1857
# 704 0 3733.2820 2209.6520 bzrlib.knit:1336(find_longest_match)
1858
# +211400 0 1147.3520 1147.3520 +<method 'get' of 'dict' objects>
1859
# +76519 0 376.2780 376.2780 +<method 'has_key' of 'dict' objects>
1871
k = newj2len[j] = 1 + j2lenget(-1 + j, 0)
1873
besti, bestj, bestsize = 1 + i-k, 1 + j-k, k
1876
# Extend the best by non-junk elements on each end. In particular,
1877
# "popular" non-junk elements aren't in b2j, which greatly speeds
1878
# the inner loop above, but also means "the best" match so far
1879
# doesn't contain any junk *or* popular non-junk elements.
1880
while besti > alo and bestj > blo and \
1881
not isbjunk(b[bestj-1]) and \
1882
a[besti-1] == b[bestj-1]:
1883
besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
1884
while besti+bestsize < ahi and bestj+bestsize < bhi and \
1885
not isbjunk(b[bestj+bestsize]) and \
1886
a[besti+bestsize] == b[bestj+bestsize]:
1889
# Now that we have a wholly interesting match (albeit possibly
1890
# empty!), we may as well suck up the matching junk on each
1891
# side of it too. Can't think of a good reason not to, and it
1892
# saves post-processing the (possibly considerable) expense of
1893
# figuring out what to do with it. In the case of an empty
1894
# interesting match, this is clearly the right thing to do,
1895
# because no other kind of match is possible in the regions.
1896
while besti > alo and bestj > blo and \
1897
isbjunk(b[bestj-1]) and \
1898
a[besti-1] == b[bestj-1]:
1899
besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
1900
while besti+bestsize < ahi and bestj+bestsize < bhi and \
1901
isbjunk(b[bestj+bestsize]) and \
1902
a[besti+bestsize] == b[bestj+bestsize]:
1903
bestsize = bestsize + 1
1905
return besti, bestj, bestsize
added
removed
bzrlib/knit.py
