50
50
# have slight specializations for different ways its used: annotate,
51
51
# basis for add, get, etc.
53
# TODO: Probably the API should work only in names to hide the integer
54
# indexes from the user.
53
# TODO: Perhaps the API should work only in names to hide the integer
54
# indexes from the user?
56
56
# TODO: Is there any potential performance win by having an add()
57
57
# variant that is passed a pre-cooked version of the single basis
60
# TODO: Reweave can possibly be made faster by remembering diffs
61
# where the basis and destination are unchanged.
63
# FIXME: Sometimes we will be given a parents list for a revision
64
# that includes some redundant parents (i.e. already a parent of
65
# something in the list.) We should eliminate them. This can
66
# be done fairly efficiently because the sequence numbers constrain
67
# the possible relationships.
69
# FIXME: the conflict markers should be *7* characters
72
from cStringIO import StringIO
60
# TODO: Have a way to go back and insert a revision V1 that is a parent
61
# of an already-stored revision V2. This means some lines previously
62
# counted as new in V2 will be discovered to have actually come from V1.
63
# It is probably necessary to insert V1, then compute a whole new diff
64
# from the mashed ancestors to V2. This must be repeated for every
65
# direct child of V1. The deltas from V2 to its descendents won't change,
66
# although their location within the weave may change. It may be possible
67
# to just adjust the location of those instructions rather than
68
# re-weaving the whole thing. This is expected to be a fairly rare
69
# operation, only used when inserting data that was previously a ghost.
75
from difflib import SequenceMatcher
78
77
from bzrlib.trace import mutter
79
from bzrlib.errors import (WeaveError, WeaveFormatError, WeaveParentMismatch,
80
RevisionAlreadyPresent,
82
WeaveRevisionAlreadyPresent,
83
WeaveRevisionNotPresent,
85
import bzrlib.errors as errors
86
from bzrlib.osutils import sha_strings
87
import bzrlib.patiencediff
88
from bzrlib.symbol_versioning import (deprecated_method,
92
from bzrlib.tsort import topo_sort
93
from bzrlib.versionedfile import VersionedFile, InterVersionedFile
94
from bzrlib.weavefile import _read_weave_v5, write_weave_v5
97
class Weave(VersionedFile):
80
class WeaveError(Exception):
81
"""Exception in processing weave"""
84
class WeaveFormatError(WeaveError):
85
"""Weave invariant violated"""
88
class WeaveParentMismatch(WeaveError):
89
"""Parents are mismatched between two revisions."""
98
93
"""weave - versioned text file storage.
100
95
A Weave manages versions of line-based text files, keeping track
221
209
return self._parents == other._parents \
222
210
and self._weave == other._weave \
223
211
and self._sha1s == other._sha1s
225
214
def __ne__(self, other):
226
215
return not self.__eq__(other)
228
@deprecated_method(zero_eight)
229
def idx_to_name(self, index):
230
"""Old public interface, the public interface is all names now."""
233
def _idx_to_name(self, version):
234
return self._names[version]
236
@deprecated_method(zero_eight)
218
def maybe_lookup(self, name_or_index):
219
"""Convert possible symbolic name to index, or pass through indexes."""
220
if isinstance(name_or_index, (int, long)):
223
return self.lookup(name_or_index)
237
226
def lookup(self, name):
238
"""Backwards compatibility thunk:
240
Return name, as name is valid in the api now, and spew deprecation
245
def _lookup(self, name):
246
227
"""Convert symbolic version name to index."""
248
229
return self._name_map[name]
250
raise RevisionNotPresent(name, self._weave_name)
252
@deprecated_method(zero_eight)
231
raise WeaveError("name %r not present in weave %r" %
232
(name, self._weave_name))
253
235
def iter_names(self):
254
"""Deprecated convenience function, please see VersionedFile.names()."""
255
return iter(self.names())
257
@deprecated_method(zero_eight)
259
"""See Weave.versions for the current api."""
260
return self.versions()
263
"""See VersionedFile.versions."""
264
return self._names[:]
266
def has_version(self, version_id):
267
"""See VersionedFile.has_version."""
268
return self._name_map.has_key(version_id)
270
__contains__ = has_version
272
def get_delta(self, version_id):
273
"""See VersionedFile.get_delta."""
274
return self.get_deltas([version_id])[version_id]
276
def get_deltas(self, version_ids):
277
"""See VersionedFile.get_deltas."""
278
version_ids = self.get_ancestry(version_ids)
279
for version_id in version_ids:
280
if not self.has_version(version_id):
281
raise RevisionNotPresent(version_id, self)
282
# try extracting all versions; parallel extraction is used
283
nv = self.num_versions()
289
last_parent_lines = {}
291
parent_inclusions = {}
296
# its simplest to generate a full set of prepared variables.
298
name = self._names[i]
299
sha1s[name] = self.get_sha1(name)
300
parents_list = self.get_parents(name)
302
parent = parents_list[0]
303
parents[name] = parent
304
parent_inclusions[name] = inclusions[parent]
307
parent_inclusions[name] = set()
308
# we want to emit start, finish, replacement_length, replacement_lines tuples.
309
diff_hunks[name] = []
310
current_hunks[name] = [0, 0, 0, []] # #start, finish, repl_length, repl_tuples
311
parent_linenums[name] = 0
313
parent_noeols[name] = False
314
last_parent_lines[name] = None
315
new_inc = set([name])
316
for p in self._parents[i]:
317
new_inc.update(inclusions[self._idx_to_name(p)])
318
# debug only, known good so far.
319
#assert set(new_inc) == set(self.get_ancestry(name)), \
320
# 'failed %s != %s' % (set(new_inc), set(self.get_ancestry(name)))
321
inclusions[name] = new_inc
323
nlines = len(self._weave)
325
for lineno, inserted, deletes, line in self._walk_internal():
326
# a line is active in a version if:
327
# insert is in the versions inclusions
329
# deleteset & the versions inclusions is an empty set.
330
# so - if we have a included by mapping - version is included by
331
# children, we get a list of children to examine for deletes affect
332
# ing them, which is less than the entire set of children.
333
for version_id in version_ids:
334
# The active inclusion must be an ancestor,
335
# and no ancestors must have deleted this line,
336
# because we don't support resurrection.
337
parent_inclusion = parent_inclusions[version_id]
338
inclusion = inclusions[version_id]
339
parent_active = inserted in parent_inclusion and not (deletes & parent_inclusion)
340
version_active = inserted in inclusion and not (deletes & inclusion)
341
if not parent_active and not version_active:
342
# unrelated line of ancestry
344
elif parent_active and version_active:
346
parent_linenum = parent_linenums[version_id]
347
if current_hunks[version_id] != [parent_linenum, parent_linenum, 0, []]:
348
diff_hunks[version_id].append(tuple(current_hunks[version_id]))
350
current_hunks[version_id] = [parent_linenum, parent_linenum, 0, []]
351
parent_linenums[version_id] = parent_linenum
354
noeols[version_id] = True
357
elif parent_active and not version_active:
359
current_hunks[version_id][1] += 1
360
parent_linenums[version_id] += 1
361
last_parent_lines[version_id] = line
362
elif not parent_active and version_active:
364
# noeol only occurs at the end of a file because we
365
# diff linewise. We want to show noeol changes as a
366
# empty diff unless the actual eol-less content changed.
369
if last_parent_lines[version_id][-1] != '\n':
370
parent_noeols[version_id] = True
371
except (TypeError, IndexError):
374
if theline[-1] != '\n':
375
noeols[version_id] = True
379
parent_should_go = False
381
if parent_noeols[version_id] == noeols[version_id]:
382
# no noeol toggle, so trust the weaves statement
383
# that this line is changed.
385
if parent_noeols[version_id]:
386
theline = theline + '\n'
387
elif parent_noeols[version_id]:
388
# parent has no eol, we do:
389
# our line is new, report as such..
391
elif noeols[version_id]:
392
# append a eol so that it looks like
394
theline = theline + '\n'
395
if parents[version_id] is not None:
396
#if last_parent_lines[version_id] is not None:
397
parent_should_go = True
398
if last_parent_lines[version_id] != theline:
401
#parent_should_go = False
403
current_hunks[version_id][2] += 1
404
current_hunks[version_id][3].append((inserted, theline))
406
# last hunk last parent line is not eaten
407
current_hunks[version_id][1] -= 1
408
if current_hunks[version_id][1] < 0:
409
current_hunks[version_id][1] = 0
410
# import pdb;pdb.set_trace()
411
# assert current_hunks[version_id][1] >= 0
415
version = self._idx_to_name(i)
416
if current_hunks[version] != [0, 0, 0, []]:
417
diff_hunks[version].append(tuple(current_hunks[version]))
419
for version_id in version_ids:
420
result[version_id] = (
424
diff_hunks[version_id],
428
def get_parents(self, version_id):
429
"""See VersionedFile.get_parent."""
430
return map(self._idx_to_name, self._parents[self._lookup(version_id)])
236
"""Yield a list of all names in this weave."""
237
return iter(self._names)
239
def idx_to_name(self, version):
240
return self._names[version]
432
243
def _check_repeated_add(self, name, parents, text, sha1):
433
244
"""Check that a duplicated add is OK.
435
246
If it is, return the (old) index; otherwise raise an exception.
437
idx = self._lookup(name)
438
if sorted(self._parents[idx]) != sorted(parents) \
439
or sha1 != self._sha1s[idx]:
440
raise RevisionAlreadyPresent(name, self._weave_name)
248
idx = self.lookup(name)
249
if sorted(self._parents[idx]) != sorted(parents):
250
raise WeaveError("name \"%s\" already present in weave "
251
"with different parents" % name)
252
if sha1 != self._sha1s[idx]:
253
raise WeaveError("name \"%s\" already present in weave "
254
"with different text" % name)
443
@deprecated_method(zero_eight)
444
def add_identical(self, old_rev_id, new_rev_id, parents):
445
"""Please use Weave.clone_text now."""
446
return self.clone_text(new_rev_id, old_rev_id, parents)
448
def _add_lines(self, version_id, parents, lines, parent_texts):
449
"""See VersionedFile.add_lines."""
450
return self._add(version_id, lines, map(self._lookup, parents))
452
@deprecated_method(zero_eight)
453
259
def add(self, name, parents, text, sha1=None):
454
"""See VersionedFile.add_lines for the non deprecated api."""
455
return self._add(name, text, map(self._maybe_lookup, parents), sha1)
457
def _add(self, version_id, lines, parents, sha1=None):
458
260
"""Add a single text on top of the weave.
460
262
Returns the index number of the newly added version.
463
265
Symbolic name for this version.
464
266
(Typically the revision-id of the revision that added it.)
467
269
List or set of direct parent version numbers.
470
272
Sequence of lines to be added in the new version.
274
sha -- SHA-1 of the file, if known. This is trusted to be
473
assert isinstance(version_id, basestring)
474
self._check_lines_not_unicode(lines)
475
self._check_lines_are_lines(lines)
477
sha1 = sha_strings(lines)
478
if version_id in self._name_map:
479
return self._check_repeated_add(version_id, parents, lines, sha1)
277
from bzrlib.osutils import sha_strings
279
assert isinstance(name, basestring)
281
sha1 = sha_strings(text)
282
if name in self._name_map:
283
return self._check_repeated_add(name, parents, text, sha1)
285
parents = map(self.maybe_lookup, parents)
481
286
self._check_versions(parents)
482
## self._check_lines(lines)
287
## self._check_lines(text)
483
288
new_version = len(self._parents)
485
291
# if we abort after here the (in-memory) weave will be corrupt because only
486
292
# some fields are updated
487
# XXX: FIXME implement a succeed-or-fail of the rest of this routine.
488
# - Robert Collins 20060226
489
293
self._parents.append(parents[:])
490
294
self._sha1s.append(sha1)
491
self._names.append(version_id)
492
self._name_map[version_id] = new_version
295
self._names.append(name)
296
self._name_map[name] = new_version
629
449
except IndexError:
630
450
raise IndexError("invalid version number %r" % i)
632
def _compatible_parents(self, my_parents, other_parents):
633
"""During join check that other_parents are joinable with my_parents.
635
Joinable is defined as 'is a subset of' - supersets may require
636
regeneration of diffs, but subsets do not.
638
return len(other_parents.difference(my_parents)) == 0
640
def annotate(self, version_id):
641
if isinstance(version_id, int):
642
warnings.warn('Weave.annotate(int) is deprecated. Please use version names'
643
' in all circumstances as of 0.8',
648
for origin, lineno, text in self._extract([version_id]):
649
result.append((origin, text))
652
return super(Weave, self).annotate(version_id)
654
def annotate_iter(self, version_id):
655
"""Yield list of (version-id, line) pairs for the specified version.
453
def annotate(self, name_or_index):
454
return list(self.annotate_iter(name_or_index))
457
def annotate_iter(self, name_or_index):
458
"""Yield list of (index-id, line) pairs for the specified version.
657
460
The index indicates when the line originated in the weave."""
658
incls = [self._lookup(version_id)]
461
incls = [self.maybe_lookup(name_or_index)]
659
462
for origin, lineno, text in self._extract(incls):
660
yield self._idx_to_name(origin), text
662
@deprecated_method(zero_eight)
664
"""_walk has become visit, a supported api."""
665
return self._walk_internal()
667
def iter_lines_added_or_present_in_versions(self, version_ids=None):
668
"""See VersionedFile.iter_lines_added_or_present_in_versions()."""
669
if version_ids is None:
670
version_ids = self.versions()
671
version_ids = set(version_ids)
672
for lineno, inserted, deletes, line in self._walk_internal(version_ids):
673
# if inserted not in version_ids then it was inserted before the
674
# versions we care about, but because weaves cannot represent ghosts
675
# properly, we do not filter down to that
676
# if inserted not in version_ids: continue
682
#@deprecated_method(zero_eight)
683
def walk(self, version_ids=None):
684
"""See VersionedFile.walk."""
685
return self._walk_internal(version_ids)
687
def _walk_internal(self, version_ids=None):
688
"""Helper method for weave actions."""
470
(lineno, insert, deletes, text)
471
for each literal line.
844
assert l.__class__ in (str, unicode)
548
assert isinstance(l, basestring)
845
549
if isactive is None:
846
550
isactive = (not dset) and istack and (istack[-1] in included)
848
552
result.append((istack[-1], lineno, l))
851
raise WeaveFormatError("unclosed insertion blocks "
852
"at end of weave: %s" % istack)
556
raise WFE("unclosed insertion blocks at end of weave",
854
raise WeaveFormatError("unclosed deletion blocks at end of weave: %s"
559
raise WFE("unclosed deletion blocks at end of weave",
858
@deprecated_method(zero_eight)
859
566
def get_iter(self, name_or_index):
860
"""Deprecated, please do not use. Lookups are not not needed.
862
Please use get_lines now.
864
return iter(self.get_lines(self._maybe_lookup(name_or_index)))
866
@deprecated_method(zero_eight)
867
def maybe_lookup(self, name_or_index):
868
"""Deprecated, please do not use. Lookups are not not needed."""
869
return self._maybe_lookup(name_or_index)
871
def _maybe_lookup(self, name_or_index):
872
"""Convert possible symbolic name to index, or pass through indexes.
876
if isinstance(name_or_index, (int, long)):
879
return self._lookup(name_or_index)
881
@deprecated_method(zero_eight)
882
def get(self, version_id):
883
"""Please use either Weave.get_text or Weave.get_lines as desired."""
884
return self.get_lines(version_id)
886
def get_lines(self, version_id):
887
"""See VersionedFile.get_lines()."""
888
int_index = self._maybe_lookup(version_id)
889
result = [line for (origin, lineno, line) in self._extract([int_index])]
890
expected_sha1 = self._sha1s[int_index]
891
measured_sha1 = sha_strings(result)
892
if measured_sha1 != expected_sha1:
893
raise errors.WeaveInvalidChecksum(
894
'file %s, revision %s, expected: %s, measured %s'
895
% (self._weave_name, version_id,
896
expected_sha1, measured_sha1))
899
def get_sha1(self, version_id):
900
"""See VersionedFile.get_sha1()."""
901
return self._sha1s[self._lookup(version_id)]
903
@deprecated_method(zero_eight)
567
"""Yield lines for the specified version."""
568
incls = [self.maybe_lookup(name_or_index)]
569
for origin, lineno, line in self._extract(incls):
573
def get_text(self, name_or_index):
574
return ''.join(self.get_iter(name_or_index))
575
assert isinstance(version, int)
578
def get_lines(self, name_or_index):
579
return list(self.get_iter(name_or_index))
585
def mash_iter(self, included):
586
"""Return composed version of multiple included versions."""
587
included = map(self.maybe_lookup, included)
588
for origin, lineno, text in self._extract(included):
592
def dump(self, to_file):
593
from pprint import pprint
594
print >>to_file, "Weave._weave = ",
595
pprint(self._weave, to_file)
596
print >>to_file, "Weave._parents = ",
597
pprint(self._parents, to_file)
904
601
def numversions(self):
905
"""How many versions are in this weave?
907
Deprecated in favour of num_versions.
909
return self.num_versions()
911
def num_versions(self):
912
"""How many versions are in this weave?"""
913
602
l = len(self._parents)
914
603
assert l == len(self._sha1s)
917
__len__ = num_versions
608
return self.numversions()
919
611
def check(self, progress_bar=None):
920
# TODO evaluate performance hit of using string sets in this routine.
921
# TODO: check no circular inclusions
922
# TODO: create a nested progress bar
923
for version in range(self.num_versions()):
612
# check no circular inclusions
613
for version in range(self.numversions()):
924
614
inclusions = list(self._parents[version])
926
616
inclusions.sort()
928
618
raise WeaveFormatError("invalid included version %d for index %d"
929
619
% (inclusions[-1], version))
931
# try extracting all versions; parallel extraction is used
932
nv = self.num_versions()
937
# For creating the ancestry, IntSet is much faster (3.7s vs 0.17s)
938
# The problem is that set membership is much more expensive
939
name = self._idx_to_name(i)
940
sha1s[name] = sha.new()
942
new_inc = set([name])
943
for p in self._parents[i]:
944
new_inc.update(inclusions[self._idx_to_name(p)])
946
assert set(new_inc) == set(self.get_ancestry(name)), \
947
'failed %s != %s' % (set(new_inc), set(self.get_ancestry(name)))
948
inclusions[name] = new_inc
950
nlines = len(self._weave)
952
update_text = 'checking weave'
954
short_name = os.path.basename(self._weave_name)
955
update_text = 'checking %s' % (short_name,)
956
update_text = update_text[:25]
958
for lineno, insert, deleteset, line in self._walk_internal():
621
# try extracting all versions; this is a bit slow and parallel
622
# extraction could be used
623
nv = self.numversions()
624
for version in range(nv):
960
progress_bar.update(update_text, lineno, nlines)
962
for name, name_inclusions in inclusions.items():
963
# The active inclusion must be an ancestor,
964
# and no ancestors must have deleted this line,
965
# because we don't support resurrection.
966
if (insert in name_inclusions) and not (deleteset & name_inclusions):
967
sha1s[name].update(line)
970
version = self._idx_to_name(i)
971
hd = sha1s[version].hexdigest()
972
expected = self._sha1s[i]
626
progress_bar.update('checking text', version, nv)
628
for l in self.get_iter(version):
631
expected = self._sha1s[version]
973
632
if hd != expected:
974
raise errors.WeaveInvalidChecksum(
975
"mismatched sha1 for version %s: "
976
"got %s, expected %s"
977
% (version, hd, expected))
633
raise WeaveError("mismatched sha1 for version %d; "
634
"got %s, expected %s"
635
% (version, hd, expected))
979
637
# TODO: check insertions are properly nested, that there are
980
638
# no lines outside of insertion blocks, that deletions are
981
639
# properly paired, etc.
983
def _join(self, other, pb, msg, version_ids, ignore_missing):
984
"""Worker routine for join()."""
985
if not other.versions():
643
def merge(self, merge_versions):
644
"""Automerge and mark conflicts between versions.
646
This returns a sequence, each entry describing alternatives
647
for a chunk of the file. Each of the alternatives is given as
650
If there is a chunk of the file where there's no diagreement,
651
only one alternative is given.
653
# approach: find the included versions common to all the
655
raise NotImplementedError()
659
def _delta(self, included, lines):
660
"""Return changes from basis to new revision.
662
The old text for comparison is the union of included revisions.
664
This is used in inserting a new text.
666
Delta is returned as a sequence of
667
(weave1, weave2, newlines).
669
This indicates that weave1:weave2 of the old weave should be
670
replaced by the sequence of lines in newlines. Note that
671
these line numbers are positions in the total weave and don't
672
correspond to the lines in any extracted version, or even the
673
extracted union of included versions.
675
If line1=line2, this is a pure insert; if newlines=[] this is a
676
pure delete. (Similar to difflib.)
678
raise NotImplementedError()
681
def plan_merge(self, ver_a, ver_b):
682
"""Return pseudo-annotation indicating how the two versions merge.
684
This is computed between versions a and b and their common
687
Weave lines present in none of them are skipped entirely.
689
inc_a = self.inclusions([ver_a])
690
inc_b = self.inclusions([ver_b])
691
inc_c = inc_a & inc_b
693
for lineno, insert, deleteset, line in self._walk():
694
if deleteset & inc_c:
695
# killed in parent; can't be in either a or b
696
# not relevant to our work
697
yield 'killed-base', line
698
elif insert in inc_c:
699
# was inserted in base
700
killed_a = bool(deleteset & inc_a)
701
killed_b = bool(deleteset & inc_b)
702
if killed_a and killed_b:
703
yield 'killed-both', line
705
yield 'killed-a', line
707
yield 'killed-b', line
709
yield 'unchanged', line
710
elif insert in inc_a:
711
if deleteset & inc_a:
712
yield 'ghost-a', line
716
elif insert in inc_b:
717
if deleteset & inc_b:
718
yield 'ghost-b', line
722
# not in either revision
723
yield 'irrelevant', line
725
yield 'unchanged', '' # terminator
729
def weave_merge(self, plan):
734
for state, line in plan:
735
if state == 'unchanged' or state == 'killed-both':
736
# resync and flush queued conflicts changes if any
737
if not lines_a and not lines_b:
739
elif ch_a and not ch_b:
741
for l in lines_a: yield l
742
elif ch_b and not ch_a:
743
for l in lines_b: yield l
744
elif lines_a == lines_b:
745
for l in lines_a: yield l
748
for l in lines_a: yield l
750
for l in lines_b: yield l
757
if state == 'unchanged':
760
elif state == 'killed-a':
763
elif state == 'killed-b':
766
elif state == 'new-a':
769
elif state == 'new-b':
773
assert state in ('irrelevant', 'ghost-a', 'ghost-b', 'killed-base',
778
def join(self, other):
779
"""Integrate versions from other into this weave.
781
The resulting weave contains all the history of both weaves;
782
any version you could retrieve from either self or other can be
783
retrieved from self after this call.
785
It is illegal for the two weaves to contain different values
786
or different parents for any version. See also reweave().
788
if other.numversions() == 0:
986
789
return # nothing to update, easy
989
# versions is never none, InterWeave checks this.
992
790
# two loops so that we do not change ourselves before verifying it
994
792
# work through in index order to make sure we get all dependencies
997
# get the selected versions only that are in other.versions.
998
version_ids = set(other.versions()).intersection(set(version_ids))
999
# pull in the referenced graph.
1000
version_ids = other.get_ancestry(version_ids)
1001
pending_graph = [(version, other.get_parents(version)) for
1002
version in version_ids]
1003
for name in topo_sort(pending_graph):
1004
other_idx = other._name_map[name]
1005
# returns True if we have it, False if we need it.
1006
if not self._check_version_consistent(other, other_idx, name):
1007
names_to_join.append((other_idx, name))
1016
for other_idx, name in names_to_join:
1017
# TODO: If all the parents of the other version are already
793
for other_idx, name in enumerate(other._names):
794
if self._check_version_consistent(other, other_idx, name):
796
for other_idx, name in enumerate(other._names):
797
# TODO: If all the parents of the other version are already
1018
798
# present then we can avoid some work by just taking the delta
1019
799
# and adjusting the offsets.
1020
800
new_parents = self._imported_parents(other, other_idx)
801
lines = other.get_lines(other_idx)
1021
802
sha1 = other._sha1s[other_idx]
1026
pb.update(msg, merged, len(names_to_join))
1028
lines = other.get_lines(other_idx)
1029
self._add(name, lines, new_parents, sha1)
1031
mutter("merged = %d, processed = %d, file_id=%s; deltat=%d"%(
1032
merged, processed, self._weave_name, time.time()-time0))
803
self.add(name, new_parents, lines, sha1)
1034
806
def _imported_parents(self, other, other_idx):
1035
807
"""Return list of parents in self corresponding to indexes in other."""
1036
808
new_parents = []
1037
809
for parent_idx in other._parents[other_idx]:
1038
810
parent_name = other._names[parent_idx]
1039
if parent_name not in self._name_map:
811
if parent_name not in self._names:
1040
812
# should not be possible
1041
813
raise WeaveError("missing parent {%s} of {%s} in %r"
1042
814
% (parent_name, other._name_map[other_idx], self))
1074
@deprecated_method(zero_eight)
1075
def reweave(self, other, pb=None, msg=None):
1076
"""reweave has been superseded by plain use of join."""
1077
return self.join(other, pb, msg)
1079
def _reweave(self, other, pb, msg):
1080
"""Reweave self with other - internal helper for join().
1082
:param other: The other weave to merge
1083
:param pb: An optional progress bar, indicating how far done we are
1084
:param msg: An optional message for the progress
1086
new_weave = _reweave(self, other, pb=pb, msg=msg)
1087
self._copy_weave_content(new_weave)
1089
def _copy_weave_content(self, otherweave):
1090
"""adsorb the content from otherweave."""
850
def reweave(self, other):
851
"""Reweave self with other."""
852
new_weave = reweave(self, other)
1091
853
for attr in self.__slots__:
1092
if attr != '_weave_name':
1093
setattr(self, attr, copy(getattr(otherweave, attr)))
1096
class WeaveFile(Weave):
1097
"""A WeaveFile represents a Weave on disk and writes on change."""
1099
WEAVE_SUFFIX = '.weave'
1101
def __init__(self, name, transport, filemode=None, create=False, access_mode='w'):
1102
"""Create a WeaveFile.
1104
:param create: If not True, only open an existing knit.
1106
super(WeaveFile, self).__init__(name, access_mode)
1107
self._transport = transport
1108
self._filemode = filemode
1110
_read_weave_v5(self._transport.get(name + WeaveFile.WEAVE_SUFFIX), self)
1111
except errors.NoSuchFile:
1117
def _add_lines(self, version_id, parents, lines, parent_texts):
1118
"""Add a version and save the weave."""
1119
result = super(WeaveFile, self)._add_lines(version_id, parents, lines,
1124
def _clone_text(self, new_version_id, old_version_id, parents):
1125
"""See VersionedFile.clone_text."""
1126
super(WeaveFile, self)._clone_text(new_version_id, old_version_id, parents)
1129
def copy_to(self, name, transport):
1130
"""See VersionedFile.copy_to()."""
1131
# as we are all in memory always, just serialise to the new place.
1133
write_weave_v5(self, sio)
1135
transport.put(name + WeaveFile.WEAVE_SUFFIX, sio, self._filemode)
1137
def create_empty(self, name, transport, filemode=None):
1138
return WeaveFile(name, transport, filemode, create=True)
1141
"""Save the weave."""
1142
self._check_write_ok()
1144
write_weave_v5(self, sio)
1146
self._transport.put(self._weave_name + WeaveFile.WEAVE_SUFFIX,
1152
"""See VersionedFile.get_suffixes()."""
1153
return [WeaveFile.WEAVE_SUFFIX]
1155
def join(self, other, pb=None, msg=None, version_ids=None,
1156
ignore_missing=False):
1157
"""Join other into self and save."""
1158
super(WeaveFile, self).join(other, pb, msg, version_ids, ignore_missing)
1162
@deprecated_function(zero_eight)
1163
def reweave(wa, wb, pb=None, msg=None):
1164
"""reweaving is deprecation, please just use weave.join()."""
1165
_reweave(wa, wb, pb, msg)
1167
def _reweave(wa, wb, pb=None, msg=None):
854
setattr(self, attr, getattr(new_weave, attr))
1168
858
"""Combine two weaves and return the result.
1170
860
This works even if a revision R has different parents in
1175
865
might be possible but it should only be necessary to do
1176
866
this operation rarely, when a new previously ghost version is
1179
:param pb: An optional progress bar, indicating how far done we are
1180
:param msg: An optional message for the progress
1184
queue_a = range(wa.num_versions())
1185
queue_b = range(wb.num_versions())
871
queue_a = range(wa.numversions())
872
queue_b = range(wb.numversions())
1186
873
# first determine combined parents of all versions
1187
874
# map from version name -> all parent names
1188
875
combined_parents = _reweave_parent_graphs(wa, wb)
1189
876
mutter("combined parents: %r", combined_parents)
1190
order = topo_sort(combined_parents.iteritems())
877
order = _make_reweave_order(wa._names, wb._names, combined_parents)
1191
878
mutter("order to reweave: %r", order)
1196
for idx, name in enumerate(order):
1198
pb.update(msg, idx, len(order))
1199
880
if name in wa._name_map:
1200
881
lines = wa.get_lines(name)
1201
882
if name in wb._name_map:
1202
lines_b = wb.get_lines(name)
1203
if lines != lines_b:
1204
mutter('Weaves differ on content. rev_id {%s}', name)
1205
mutter('weaves: %s, %s', wa._weave_name, wb._weave_name)
1207
lines = list(difflib.unified_diff(lines, lines_b,
1208
wa._weave_name, wb._weave_name))
1209
mutter('lines:\n%s', ''.join(lines))
1210
raise errors.WeaveTextDiffers(name, wa, wb)
883
assert lines == wb.get_lines(name)
1212
885
lines = wb.get_lines(name)
1213
wr._add(name, lines, [wr._lookup(i) for i in combined_parents[name]])
886
wr.add(name, combined_parents[name], lines)
1216
890
def _reweave_parent_graphs(wa, wb):
1217
891
"""Return combined parent ancestry for two weaves.
1409
1124
print ' '.join(map(str, w._parents[int(argv[3])]))
1411
1126
elif cmd == 'plan-merge':
1412
# replaced by 'bzr weave-plan-merge'
1414
1128
for state, line in w.plan_merge(int(argv[3]), int(argv[4])):
1416
1130
print '%14s | %s' % (state, line),
1417
1132
elif cmd == 'merge':
1418
# replaced by 'bzr weave-merge-text'
1420
1134
p = w.plan_merge(int(argv[3]), int(argv[4]))
1421
1135
sys.stdout.writelines(w.weave_merge(p))
1137
elif cmd == 'mash-merge':
1143
v1, v2 = map(int, argv[3:5])
1145
basis = w.inclusions([v1]).intersection(w.inclusions([v2]))
1147
base_lines = list(w.mash_iter(basis))
1148
a_lines = list(w.get(v1))
1149
b_lines = list(w.get(v2))
1151
from bzrlib.merge3 import Merge3
1152
m3 = Merge3(base_lines, a_lines, b_lines)
1154
name_a = 'version %d' % v1
1155
name_b = 'version %d' % v2
1156
sys.stdout.writelines(m3.merge_lines(name_a=name_a, name_b=name_b))
1423
1158
raise ValueError('unknown command %r' % cmd)
1162
def profile_main(argv):
1163
import tempfile, hotshot, hotshot.stats
1165
prof_f = tempfile.NamedTemporaryFile()
1167
prof = hotshot.Profile(prof_f.name)
1169
ret = prof.runcall(main, argv)
1172
stats = hotshot.stats.load(prof_f.name)
1174
stats.sort_stats('cumulative')
1175
## XXX: Might like to write to stderr or the trace file instead but
1176
## print_stats seems hardcoded to stdout
1177
stats.print_stats(20)
1426
1182
if __name__ == '__main__':
1428
sys.exit(main(sys.argv))
1431
class InterWeave(InterVersionedFile):
1432
"""Optimised code paths for weave to weave operations."""
1434
_matching_file_from_factory = staticmethod(WeaveFile)
1435
_matching_file_to_factory = staticmethod(WeaveFile)
1438
def is_compatible(source, target):
1439
"""Be compatible with weaves."""
1441
return (isinstance(source, Weave) and
1442
isinstance(target, Weave))
1443
except AttributeError:
1446
def join(self, pb=None, msg=None, version_ids=None, ignore_missing=False):
1447
"""See InterVersionedFile.join."""
1448
version_ids = self._get_source_version_ids(version_ids, ignore_missing)
1449
if self.target.versions() == [] and version_ids is None:
1450
self.target._copy_weave_content(self.source)
1453
self.target._join(self.source, pb, msg, version_ids, ignore_missing)
1454
except errors.WeaveParentMismatch:
1455
self.target._reweave(self.source, pb, msg)
1458
InterVersionedFile.register_optimiser(InterWeave)
1184
if '--profile' in sys.argv:
1186
args.remove('--profile')
1187
sys.exit(profile_main(args))
1189
sys.exit(main(sys.argv))
added
removed
bzrlib/weave.py
