errors: raise InputError when line range to followlines() is out of bounds

Differential Revision: https://phab.mercurial-scm.org/D9333

mercurial/mdiff.py

@@ -1,556 +1,556 b''
 # mdiff.py - diff and patch routines for mercurial
 #
 # Copyright 2005, 2006 Matt Mackall <[e-mail]>
 #
 # This software may be used and distributed according to the terms of the
 # GNU General Public License version 2 or any later version.
 
 from __future__ import absolute_import
 
 import re
 import struct
 import zlib
 
 from .i18n import _
 from .pycompat import (
     getattr,
     setattr,
 )
 from . import (
     diffhelper,
     encoding,
     error,
     policy,
     pycompat,
     util,
 )
 from .utils import dateutil
 
 bdiff = policy.importmod('bdiff')
 mpatch = policy.importmod('mpatch')
 
 blocks = bdiff.blocks
 fixws = bdiff.fixws
 patches = mpatch.patches
 patchedsize = mpatch.patchedsize
 textdiff = bdiff.bdiff
 splitnewlines = bdiff.splitnewlines
 
 
 # TODO: this looks like it could be an attrs, which might help pytype
 class diffopts(object):
     '''context is the number of context lines
     text treats all files as text
     showfunc enables diff -p output
     git enables the git extended patch format
     nodates removes dates from diff headers
     nobinary ignores binary files
     noprefix disables the 'a/' and 'b/' prefixes (ignored in plain mode)
     ignorews ignores all whitespace changes in the diff
     ignorewsamount ignores changes in the amount of whitespace
     ignoreblanklines ignores changes whose lines are all blank
     upgrade generates git diffs to avoid data loss
     '''
 
     _HAS_DYNAMIC_ATTRIBUTES = True
 
     defaults = {
         b'context': 3,
         b'text': False,
         b'showfunc': False,
         b'git': False,
         b'nodates': False,
         b'nobinary': False,
         b'noprefix': False,
         b'index': 0,
         b'ignorews': False,
         b'ignorewsamount': False,
         b'ignorewseol': False,
         b'ignoreblanklines': False,
         b'upgrade': False,
         b'showsimilarity': False,
         b'worddiff': False,
         b'xdiff': False,
     }
 
     def __init__(self, **opts):
         opts = pycompat.byteskwargs(opts)
         for k in self.defaults.keys():
             v = opts.get(k)
             if v is None:
                 v = self.defaults[k]
             setattr(self, k, v)
 
         try:
             self.context = int(self.context)
         except ValueError:
             raise error.Abort(
                 _(b'diff context lines count must be an integer, not %r')
                 % pycompat.bytestr(self.context)
             )
 
     def copy(self, **kwargs):
         opts = {k: getattr(self, k) for k in self.defaults}
         opts = pycompat.strkwargs(opts)
         opts.update(kwargs)
         return diffopts(**opts)
 
 
 defaultopts = diffopts()
 
 
 def wsclean(opts, text, blank=True):
     if opts.ignorews:
         text = bdiff.fixws(text, 1)
     elif opts.ignorewsamount:
         text = bdiff.fixws(text, 0)
     if blank and opts.ignoreblanklines:
         text = re.sub(b'\n+', b'\n', text).strip(b'\n')
     if opts.ignorewseol:
         text = re.sub(br'[ \t\r\f]+\n', br'\n', text)
     return text
 
 
 def splitblock(base1, lines1, base2, lines2, opts):
     # The input lines matches except for interwoven blank lines. We
     # transform it into a sequence of matching blocks and blank blocks.
     lines1 = [(wsclean(opts, l) and 1 or 0) for l in lines1]
     lines2 = [(wsclean(opts, l) and 1 or 0) for l in lines2]
     s1, e1 = 0, len(lines1)
     s2, e2 = 0, len(lines2)
     while s1 < e1 or s2 < e2:
         i1, i2, btype = s1, s2, b'='
         if i1 >= e1 or lines1[i1] == 0 or i2 >= e2 or lines2[i2] == 0:
             # Consume the block of blank lines
             btype = b'~'
             while i1 < e1 and lines1[i1] == 0:
                 i1 += 1
             while i2 < e2 and lines2[i2] == 0:
                 i2 += 1
         else:
             # Consume the matching lines
             while i1 < e1 and lines1[i1] == 1 and lines2[i2] == 1:
                 i1 += 1
                 i2 += 1
         yield [base1 + s1, base1 + i1, base2 + s2, base2 + i2], btype
         s1 = i1
         s2 = i2
 
 
 def hunkinrange(hunk, linerange):
     """Return True if `hunk` defined as (start, length) is in `linerange`
     defined as (lowerbound, upperbound).
 
     >>> hunkinrange((5, 10), (2, 7))
     True
     >>> hunkinrange((5, 10), (6, 12))
     True
     >>> hunkinrange((5, 10), (13, 17))
     True
     >>> hunkinrange((5, 10), (3, 17))
     True
     >>> hunkinrange((5, 10), (1, 3))
     False
     >>> hunkinrange((5, 10), (18, 20))
     False
     >>> hunkinrange((5, 10), (1, 5))
     False
     >>> hunkinrange((5, 10), (15, 27))
     False
     """
     start, length = hunk
     lowerbound, upperbound = linerange
     return lowerbound < start + length and start < upperbound
 
 
 def blocksinrange(blocks, rangeb):
     """filter `blocks` like (a1, a2, b1, b2) from items outside line range
     `rangeb` from ``(b1, b2)`` point of view.
 
     Return `filteredblocks, rangea` where:
 
     * `filteredblocks` is list of ``block = (a1, a2, b1, b2), stype`` items of
       `blocks` that are inside `rangeb` from ``(b1, b2)`` point of view; a
       block ``(b1, b2)`` being inside `rangeb` if
       ``rangeb[0] < b2 and b1 < rangeb[1]``;
     * `rangea` is the line range w.r.t. to ``(a1, a2)`` parts of `blocks`.
     """
     lbb, ubb = rangeb
     lba, uba = None, None
     filteredblocks = []
     for block in blocks:
         (a1, a2, b1, b2), stype = block
         if lbb >= b1 and ubb <= b2 and stype == b'=':
             # rangeb is within a single "=" hunk, restrict back linerange1
             # by offsetting rangeb
             lba = lbb - b1 + a1
             uba = ubb - b1 + a1
         else:
             if b1 <= lbb < b2:
                 if stype == b'=':
                     lba = a2 - (b2 - lbb)
                 else:
                     lba = a1
             if b1 < ubb <= b2:
                 if stype == b'=':
                     uba = a1 + (ubb - b1)
                 else:
                     uba = a2
         if hunkinrange((b1, (b2 - b1)), rangeb):
             filteredblocks.append(block)
     if lba is None or uba is None or uba < lba:
-        raise error.Abort(_(b'line range exceeds file size'))
+        raise error.InputError(_(b'line range exceeds file size'))
     return filteredblocks, (lba, uba)
 
 
 def chooseblocksfunc(opts=None):
     if (
         opts is None
         or not opts.xdiff
         or not util.safehasattr(bdiff, b'xdiffblocks')
     ):
         return bdiff.blocks
     else:
         return bdiff.xdiffblocks
 
 
 def allblocks(text1, text2, opts=None, lines1=None, lines2=None):
     """Return (block, type) tuples, where block is an mdiff.blocks
     line entry. type is '=' for blocks matching exactly one another
     (bdiff blocks), '!' for non-matching blocks and '~' for blocks
     matching only after having filtered blank lines.
     line1 and line2 are text1 and text2 split with splitnewlines() if
     they are already available.
     """
     if opts is None:
         opts = defaultopts
     if opts.ignorews or opts.ignorewsamount or opts.ignorewseol:
         text1 = wsclean(opts, text1, False)
         text2 = wsclean(opts, text2, False)
     diff = chooseblocksfunc(opts)(text1, text2)
     for i, s1 in enumerate(diff):
         # The first match is special.
         # we've either found a match starting at line 0 or a match later
         # in the file.  If it starts later, old and new below will both be
         # empty and we'll continue to the next match.
         if i > 0:
             s = diff[i - 1]
         else:
             s = [0, 0, 0, 0]
         s = [s[1], s1[0], s[3], s1[2]]
 
         # bdiff sometimes gives huge matches past eof, this check eats them,
         # and deals with the special first match case described above
         if s[0] != s[1] or s[2] != s[3]:
             type = b'!'
             if opts.ignoreblanklines:
                 if lines1 is None:
                     lines1 = splitnewlines(text1)
                 if lines2 is None:
                     lines2 = splitnewlines(text2)
                 old = wsclean(opts, b"".join(lines1[s[0] : s[1]]))
                 new = wsclean(opts, b"".join(lines2[s[2] : s[3]]))
                 if old == new:
                     type = b'~'
             yield s, type
         yield s1, b'='
 
 
 def unidiff(a, ad, b, bd, fn1, fn2, binary, opts=defaultopts):
     """Return a unified diff as a (headers, hunks) tuple.
 
     If the diff is not null, `headers` is a list with unified diff header
     lines "--- <original>" and "+++ <new>" and `hunks` is a generator yielding
     (hunkrange, hunklines) coming from _unidiff().
     Otherwise, `headers` and `hunks` are empty.
 
     Set binary=True if either a or b should be taken as a binary file.
     """
 
     def datetag(date, fn=None):
         if not opts.git and not opts.nodates:
             return b'\t%s' % date
         if fn and b' ' in fn:
             return b'\t'
         return b''
 
     sentinel = [], ()
     if not a and not b:
         return sentinel
 
     if opts.noprefix:
         aprefix = bprefix = b''
     else:
         aprefix = b'a/'
         bprefix = b'b/'
 
     epoch = dateutil.datestr((0, 0))
 
     fn1 = util.pconvert(fn1)
     fn2 = util.pconvert(fn2)
 
     if binary:
         if a and b and len(a) == len(b) and a == b:
             return sentinel
         headerlines = []
         hunks = ((None, [b'Binary file %s has changed\n' % fn1]),)
     elif not a:
         without_newline = not b.endswith(b'\n')
         b = splitnewlines(b)
         if a is None:
             l1 = b'--- /dev/null%s' % datetag(epoch)
         else:
             l1 = b"--- %s%s%s" % (aprefix, fn1, datetag(ad, fn1))
         l2 = b"+++ %s%s" % (bprefix + fn2, datetag(bd, fn2))
         headerlines = [l1, l2]
         size = len(b)
         hunkrange = (0, 0, 1, size)
         hunklines = [b"@@ -0,0 +1,%d @@\n" % size] + [b"+" + e for e in b]
         if without_newline:
             hunklines[-1] += b'\n'
             hunklines.append(diffhelper.MISSING_NEWLINE_MARKER)
         hunks = ((hunkrange, hunklines),)
     elif not b:
         without_newline = not a.endswith(b'\n')
         a = splitnewlines(a)
         l1 = b"--- %s%s%s" % (aprefix, fn1, datetag(ad, fn1))
         if b is None:
             l2 = b'+++ /dev/null%s' % datetag(epoch)
         else:
             l2 = b"+++ %s%s%s" % (bprefix, fn2, datetag(bd, fn2))
         headerlines = [l1, l2]
         size = len(a)
         hunkrange = (1, size, 0, 0)
         hunklines = [b"@@ -1,%d +0,0 @@\n" % size] + [b"-" + e for e in a]
         if without_newline:
             hunklines[-1] += b'\n'
             hunklines.append(diffhelper.MISSING_NEWLINE_MARKER)
         hunks = ((hunkrange, hunklines),)
     else:
         hunks = _unidiff(a, b, opts=opts)
         if not next(hunks):
             return sentinel
 
         headerlines = [
             b"--- %s%s%s" % (aprefix, fn1, datetag(ad, fn1)),
             b"+++ %s%s%s" % (bprefix, fn2, datetag(bd, fn2)),
         ]
 
     return headerlines, hunks
 
 
 def _unidiff(t1, t2, opts=defaultopts):
     """Yield hunks of a headerless unified diff from t1 and t2 texts.
 
     Each hunk consists of a (hunkrange, hunklines) tuple where `hunkrange` is a
     tuple (s1, l1, s2, l2) representing the range information of the hunk to
     form the '@@ -s1,l1 +s2,l2 @@' header and `hunklines` is a list of lines
     of the hunk combining said header followed by line additions and
     deletions.
 
     The hunks are prefixed with a bool.
     """
     l1 = splitnewlines(t1)
     l2 = splitnewlines(t2)
 
     def contextend(l, len):
         ret = l + opts.context
         if ret > len:
             ret = len
         return ret
 
     def contextstart(l):
         ret = l - opts.context
         if ret < 0:
             return 0
         return ret
 
     lastfunc = [0, b'']
 
     def yieldhunk(hunk):
         (astart, a2, bstart, b2, delta) = hunk
         aend = contextend(a2, len(l1))
         alen = aend - astart
         blen = b2 - bstart + aend - a2
 
         func = b""
         if opts.showfunc:
             lastpos, func = lastfunc
             # walk backwards from the start of the context up to the start of
             # the previous hunk context until we find a line starting with an
             # alphanumeric char.
             for i in pycompat.xrange(astart - 1, lastpos - 1, -1):
                 if l1[i][0:1].isalnum():
                     func = b' ' + l1[i].rstrip()
                     # split long function name if ASCII. otherwise we have no
                     # idea where the multi-byte boundary is, so just leave it.
                     if encoding.isasciistr(func):
                         func = func[:41]
                     lastfunc[1] = func
                     break
             # by recording this hunk's starting point as the next place to
             # start looking for function lines, we avoid reading any line in
             # the file more than once.
             lastfunc[0] = astart
 
         # zero-length hunk ranges report their start line as one less
         if alen:
             astart += 1
         if blen:
             bstart += 1
 
         hunkrange = astart, alen, bstart, blen
         hunklines = (
             [b"@@ -%d,%d +%d,%d @@%s\n" % (hunkrange + (func,))]
             + delta
             + [b' ' + l1[x] for x in pycompat.xrange(a2, aend)]
         )
         # If either file ends without a newline and the last line of
         # that file is part of a hunk, a marker is printed. If the
         # last line of both files is identical and neither ends in
         # a newline, print only one marker. That's the only case in
         # which the hunk can end in a shared line without a newline.
         skip = False
         if not t1.endswith(b'\n') and astart + alen == len(l1) + 1:
             for i in pycompat.xrange(len(hunklines) - 1, -1, -1):
                 if hunklines[i].startswith((b'-', b' ')):
                     if hunklines[i].startswith(b' '):
                         skip = True
                     hunklines[i] += b'\n'
                     hunklines.insert(i + 1, diffhelper.MISSING_NEWLINE_MARKER)
                     break
         if not skip and not t2.endswith(b'\n') and bstart + blen == len(l2) + 1:
             for i in pycompat.xrange(len(hunklines) - 1, -1, -1):
                 if hunklines[i].startswith(b'+'):
                     hunklines[i] += b'\n'
                     hunklines.insert(i + 1, diffhelper.MISSING_NEWLINE_MARKER)
                     break
         yield hunkrange, hunklines
 
     # bdiff.blocks gives us the matching sequences in the files.  The loop
     # below finds the spaces between those matching sequences and translates
     # them into diff output.
     #
     hunk = None
     ignoredlines = 0
     has_hunks = False
     for s, stype in allblocks(t1, t2, opts, l1, l2):
         a1, a2, b1, b2 = s
         if stype != b'!':
             if stype == b'~':
                 # The diff context lines are based on t1 content. When
                 # blank lines are ignored, the new lines offsets must
                 # be adjusted as if equivalent blocks ('~') had the
                 # same sizes on both sides.
                 ignoredlines += (b2 - b1) - (a2 - a1)
             continue
         delta = []
         old = l1[a1:a2]
         new = l2[b1:b2]
 
         b1 -= ignoredlines
         b2 -= ignoredlines
         astart = contextstart(a1)
         bstart = contextstart(b1)
         prev = None
         if hunk:
             # join with the previous hunk if it falls inside the context
             if astart < hunk[1] + opts.context + 1:
                 prev = hunk
                 astart = hunk[1]
                 bstart = hunk[3]
             else:
                 if not has_hunks:
                     has_hunks = True
                     yield True
                 for x in yieldhunk(hunk):
                     yield x
         if prev:
             # we've joined the previous hunk, record the new ending points.
             hunk[1] = a2
             hunk[3] = b2
             delta = hunk[4]
         else:
             # create a new hunk
             hunk = [astart, a2, bstart, b2, delta]
 
         delta[len(delta) :] = [b' ' + x for x in l1[astart:a1]]
         delta[len(delta) :] = [b'-' + x for x in old]
         delta[len(delta) :] = [b'+' + x for x in new]
 
     if hunk:
         if not has_hunks:
             has_hunks = True
             yield True
         for x in yieldhunk(hunk):
             yield x
     elif not has_hunks:
         yield False
 
 
 def b85diff(to, tn):
     '''print base85-encoded binary diff'''
 
     def fmtline(line):
         l = len(line)
         if l <= 26:
             l = pycompat.bytechr(ord(b'A') + l - 1)
         else:
             l = pycompat.bytechr(l - 26 + ord(b'a') - 1)
         return b'%c%s\n' % (l, util.b85encode(line, True))
 
     def chunk(text, csize=52):
         l = len(text)
         i = 0
         while i < l:
             yield text[i : i + csize]
             i += csize
 
     if to is None:
         to = b''
     if tn is None:
         tn = b''
 
     if to == tn:
         return b''
 
     # TODO: deltas
     ret = []
     ret.append(b'GIT binary patch\n')
     ret.append(b'literal %d\n' % len(tn))
     for l in chunk(zlib.compress(tn)):
         ret.append(fmtline(l))
     ret.append(b'\n')
 
     return b''.join(ret)
 
 
 def patchtext(bin):
     pos = 0
     t = []
     while pos < len(bin):
         p1, p2, l = struct.unpack(b">lll", bin[pos : pos + 12])
         pos += 12
         t.append(bin[pos : pos + l])
         pos += l
     return b"".join(t)
 
 
 def patch(a, bin):
     if len(a) == 0:
         # skip over trivial delta header
         return util.buffer(bin, 12)
     return mpatch.patches(a, [bin])
 
 
 # similar to difflib.SequenceMatcher.get_matching_blocks
 def get_matching_blocks(a, b):
     return [(d[0], d[2], d[1] - d[0]) for d in bdiff.blocks(a, b)]
 
 
 def trivialdiffheader(length):
     return struct.pack(b">lll", 0, 0, length) if length else b''
 
 
 def replacediffheader(oldlen, newlen):
     return struct.pack(b">lll", 0, oldlen, newlen)

tests/test-annotate.t

@@ -1,1202 +1,1202 b''
   $ cat >> "$HGRCPATH" << EOF
   > [ui]
   > merge = :merge3
   > EOF
 
 init
 
   $ hg init repo
   $ cd repo
 
 commit
 
   $ echo 'a' > a
   $ hg ci -A -m test -u nobody -d '1 0'
   adding a
 
 annotate -c
 
   $ hg annotate -c a
   8435f90966e4: a
 
 annotate -cl
 
   $ hg annotate -cl a
   8435f90966e4:1: a
 
 annotate -d
 
   $ hg annotate -d a
   Thu Jan 01 00:00:01 1970 +0000: a
 
 annotate -n
 
   $ hg annotate -n a
   0: a
 
 annotate -nl
 
   $ hg annotate -nl a
   0:1: a
 
 annotate -u
 
   $ hg annotate -u a
   nobody: a
 
 annotate -cdnu
 
   $ hg annotate -cdnu a
   nobody 0 8435f90966e4 Thu Jan 01 00:00:01 1970 +0000: a
 
 annotate -cdnul
 
   $ hg annotate -cdnul a
   nobody 0 8435f90966e4 Thu Jan 01 00:00:01 1970 +0000:1: a
 
 annotate (JSON)
 
   $ hg annotate -Tjson a
   [
    {
     "lines": [{"line": "a\n", "rev": 0}],
     "path": "a"
    }
   ]
 
   $ hg annotate -Tjson -cdfnul a
   [
    {
     "lines": [{"date": [1.0, 0], "line": "a\n", "lineno": 1, "node": "8435f90966e442695d2ded29fdade2bac5ad8065", "path": "a", "rev": 0, "user": "nobody"}],
     "path": "a"
    }
   ]
 
 log-like templating
 
   $ hg annotate -T'{lines % "{rev} {node|shortest}: {line}"}' a
   0 8435: a
 
 '{lineno}' field should be populated as necessary
 
   $ hg annotate -T'{lines % "{rev}:{lineno}: {line}"}' a
   0:1: a
   $ hg annotate -Ta a \
   > --config templates.a='"{lines % "{rev}:{lineno}: {line}"}"'
   0:1: a
 
   $ cat <<EOF >>a
   > a
   > a
   > EOF
   $ hg ci -ma1 -d '1 0'
   $ hg cp a b
   $ hg ci -mb -d '1 0'
   $ cat <<EOF >> b
   > b4
   > b5
   > b6
   > EOF
   $ hg ci -mb2 -d '2 0'
 
 default output of '{lines}' should be readable
 
   $ hg annotate -T'{lines}' a
   0: a
   1: a
   1: a
   $ hg annotate -T'{join(lines, "\n")}' a
   0: a
   
   1: a
   
   1: a
 
 several filters can be applied to '{lines}'
 
   $ hg annotate -T'{lines|json}\n' a
   [{"line": "a\n", "rev": 0}, {"line": "a\n", "rev": 1}, {"line": "a\n", "rev": 1}]
   $ hg annotate -T'{lines|stringify}' a
   0: a
   1: a
   1: a
   $ hg annotate -T'{lines|count}\n' a
   3
 
 annotate multiple files (JSON)
 
   $ hg annotate -Tjson a b
   [
    {
     "lines": [{"line": "a\n", "rev": 0}, {"line": "a\n", "rev": 1}, {"line": "a\n", "rev": 1}],
     "path": "a"
    },
    {
     "lines": [{"line": "a\n", "rev": 0}, {"line": "a\n", "rev": 1}, {"line": "a\n", "rev": 1}, {"line": "b4\n", "rev": 3}, {"line": "b5\n", "rev": 3}, {"line": "b6\n", "rev": 3}],
     "path": "b"
    }
   ]
 
 annotate multiple files (template)
 
   $ hg annotate -T'== {path} ==\n{lines % "{rev}: {line}"}' a b
   == a ==
   0: a
   1: a
   1: a
   == b ==
   0: a
   1: a
   1: a
   3: b4
   3: b5
   3: b6
 
 annotate -n b
 
   $ hg annotate -n b
   0: a
   1: a
   1: a
   3: b4
   3: b5
   3: b6
 
 annotate --no-follow b
 
   $ hg annotate --no-follow b
   2: a
   2: a
   2: a
   3: b4
   3: b5
   3: b6
 
 annotate -nl b
 
   $ hg annotate -nl b
   0:1: a
   1:2: a
   1:3: a
   3:4: b4
   3:5: b5
   3:6: b6
 
 annotate -nf b
 
   $ hg annotate -nf b
   0 a: a
   1 a: a
   1 a: a
   3 b: b4
   3 b: b5
   3 b: b6
 
 annotate -nlf b
 
   $ hg annotate -nlf b
   0 a:1: a
   1 a:2: a
   1 a:3: a
   3 b:4: b4
   3 b:5: b5
   3 b:6: b6
 
   $ hg up -C 2
   1 files updated, 0 files merged, 0 files removed, 0 files unresolved
   $ cat <<EOF >> b
   > b4
   > c
   > b5
   > EOF
   $ hg ci -mb2.1 -d '2 0'
   created new head
   $ hg merge
   merging b
   warning: conflicts while merging b! (edit, then use 'hg resolve --mark')
   0 files updated, 0 files merged, 0 files removed, 1 files unresolved
   use 'hg resolve' to retry unresolved file merges or 'hg merge --abort' to abandon
   [1]
   $ cat b
   a
   a
   a
   <<<<<<< working copy: 5fbdc1152d97 - test: b2.1
   b4
   c
   b5
   ||||||| base
   =======
   b4
   b5
   b6
   >>>>>>> merge rev:    37ec9f5c3d1f - test: b2
   $ cat <<EOF > b
   > a
   > a
   > a
   > b4
   > c
   > b5
   > EOF
   $ hg resolve --mark -q
   $ rm b.orig
   $ hg ci -mmergeb -d '3 0'
 
 annotate after merge
 
   $ hg annotate -nf b
   0 a: a
   1 a: a
   1 a: a
   3 b: b4
   4 b: c
   3 b: b5
 
 annotate after merge with -l
 
   $ hg annotate -nlf b
   0 a:1: a
   1 a:2: a
   1 a:3: a
   3 b:4: b4
   4 b:5: c
   3 b:5: b5
 
   $ hg up -C 1
   0 files updated, 0 files merged, 1 files removed, 0 files unresolved
   $ hg cp a b
   $ cat <<EOF > b
   > a
   > z
   > a
   > EOF
   $ hg ci -mc -d '3 0'
   created new head
 Work around the pure version not resolving the conflict like native code
 #if pure
   $ hg merge
   merging b
   warning: conflicts while merging b! (edit, then use 'hg resolve --mark')
   0 files updated, 0 files merged, 0 files removed, 1 files unresolved
   use 'hg resolve' to retry unresolved file merges or 'hg merge --abort' to abandon
   [1]
   $ cat <<EOF > b
   > a
   > z
   > a
   > b4
   > c
   > b5
   > EOF
   $ hg resolve -m b
   (no more unresolved files)
   $ rm b.orig
 #else
   $ hg merge
   merging b
   0 files updated, 1 files merged, 0 files removed, 0 files unresolved
   (branch merge, don't forget to commit)
 #endif
   $ echo d >> b
   $ hg ci -mmerge2 -d '4 0'
 
 annotate after rename merge
 
   $ hg annotate -nf b
   0 a: a
   6 b: z
   1 a: a
   3 b: b4
   4 b: c
   3 b: b5
   7 b: d
 
 annotate after rename merge with -l
 
   $ hg annotate -nlf b
   0 a:1: a
   6 b:2: z
   1 a:3: a
   3 b:4: b4
   4 b:5: c
   3 b:5: b5
   7 b:7: d
 
 --skip nothing (should be the same as no --skip at all)
 
   $ hg annotate -nlf b --skip '1::0'
   0 a:1: a
   6 b:2: z
   1 a:3: a
   3 b:4: b4
   4 b:5: c
   3 b:5: b5
   7 b:7: d
 
 --skip a modified line. Note a slight behavior difference in pure - this is
 because the pure code comes up with slightly different deltas internally.
 
   $ hg annotate -nlf b --skip 6
   0 a:1: a
   1 a:2* z (no-pure !)
   0 a:1* z (pure !)
   1 a:3: a
   3 b:4: b4
   4 b:5: c
   3 b:5: b5
   7 b:7: d
 
 --skip added lines (and test multiple skip)
 
   $ hg annotate -nlf b --skip 3
   0 a:1: a
   6 b:2: z
   1 a:3: a
   1 a:3* b4
   4 b:5: c
   1 a:3* b5
   7 b:7: d
 
   $ hg annotate -nlf b --skip 4
   0 a:1: a
   6 b:2: z
   1 a:3: a
   3 b:4: b4
   1 a:3* c
   3 b:5: b5
   7 b:7: d
 
   $ hg annotate -nlf b --skip 3 --skip 4
   0 a:1: a
   6 b:2: z
   1 a:3: a
   1 a:3* b4
   1 a:3* c
   1 a:3* b5
   7 b:7: d
 
   $ hg annotate -nlf b --skip 'merge()'
   0 a:1: a
   6 b:2: z
   1 a:3: a
   3 b:4: b4
   4 b:5: c
   3 b:5: b5
   3 b:5* d
 
 --skip everything -- use the revision the file was introduced in
 
   $ hg annotate -nlf b --skip 'all()'
   0 a:1: a
   0 a:1* z
   0 a:1* a
   0 a:1* b4
   0 a:1* c
   0 a:1* b5
   0 a:1* d
 
 Issue2807: alignment of line numbers with -l
 
   $ echo more >> b
   $ hg ci -mmore -d '5 0'
   $ echo more >> b
   $ hg ci -mmore -d '6 0'
   $ echo more >> b
   $ hg ci -mmore -d '7 0'
   $ hg annotate -nlf b
    0 a: 1: a
    6 b: 2: z
    1 a: 3: a
    3 b: 4: b4
    4 b: 5: c
    3 b: 5: b5
    7 b: 7: d
    8 b: 8: more
    9 b: 9: more
   10 b:10: more
 
 linkrev vs rev
 
   $ hg annotate -r tip -n a
   0: a
   1: a
   1: a
 
 linkrev vs rev with -l
 
   $ hg annotate -r tip -nl a
   0:1: a
   1:2: a
   1:3: a
 
 Issue589: "undelete" sequence leads to crash
 
 annotate was crashing when trying to --follow something
 
 like A -> B -> A
 
 generate ABA rename configuration
 
   $ echo foo > foo
   $ hg add foo
   $ hg ci -m addfoo
   $ hg rename foo bar
   $ hg ci -m renamefoo
   $ hg rename bar foo
   $ hg ci -m renamebar
 
 annotate after ABA with follow
 
   $ hg annotate --follow foo
   foo: foo
 
 missing file
 
   $ hg ann nosuchfile
   abort: nosuchfile: no such file in rev e9e6b4fa872f
   [255]
 
 annotate file without '\n' on last line
 
   $ printf "" > c
   $ hg ci -A -m test -u nobody -d '1 0'
   adding c
   $ hg annotate c
   $ printf "a\nb" > c
   $ hg ci -m test
   $ hg annotate c
   [0-9]+: a (re)
   [0-9]+: b (re)
 
 Issue3841: check annotation of the file of which filelog includes
 merging between the revision and its ancestor
 
 to reproduce the situation with recent Mercurial, this script uses (1)
 "hg debugsetparents" to merge without ancestor check by "hg merge",
 and (2) the extension to allow filelog merging between the revision
 and its ancestor by overriding "repo._filecommit".
 
   $ cat > ../legacyrepo.py <<EOF
   > from __future__ import absolute_import
   > from mercurial import commit, error, extensions, node
   > def _filecommit(orig, repo, fctx, manifest1, manifest2,
   >                 linkrev, tr, includecopymeta, ms):
   >     fname = fctx.path()
   >     text = fctx.data()
   >     flog = repo.file(fname)
   >     fparent1 = manifest1.get(fname, node.nullid)
   >     fparent2 = manifest2.get(fname, node.nullid)
   >     meta = {}
   >     copy = fctx.copysource()
   >     if copy and copy != fname:
   >         raise error.Abort('copying is not supported')
   >     if fparent2 != node.nullid:
   >         return flog.add(text, meta, tr, linkrev,
   >                         fparent1, fparent2), 'modified'
   >     raise error.Abort('only merging is supported')
   > def uisetup(ui):
   >     extensions.wrapfunction(commit, '_filecommit', _filecommit)
   > EOF
 
   $ cat > baz <<EOF
   > 1
   > 2
   > 3
   > 4
   > 5
   > EOF
   $ hg add baz
   $ hg commit -m "baz:0"
 
   $ cat > baz <<EOF
   > 1 baz:1
   > 2
   > 3
   > 4
   > 5
   > EOF
   $ hg commit -m "baz:1"
 
   $ cat > baz <<EOF
   > 1 baz:1
   > 2 baz:2
   > 3
   > 4
   > 5
   > EOF
   $ hg debugsetparents 17 17
   $ hg --config extensions.legacyrepo=../legacyrepo.py  commit -m "baz:2"
   $ hg debugindexdot baz
   digraph G {
   	-1 -> 0
   	0 -> 1
   	1 -> 2
   	1 -> 2
   }
   $ hg annotate baz
   17: 1 baz:1
   18: 2 baz:2
   16: 3
   16: 4
   16: 5
 
   $ cat > baz <<EOF
   > 1 baz:1
   > 2 baz:2
   > 3 baz:3
   > 4
   > 5
   > EOF
   $ hg commit -m "baz:3"
 
   $ cat > baz <<EOF
   > 1 baz:1
   > 2 baz:2
   > 3 baz:3
   > 4 baz:4
   > 5
   > EOF
   $ hg debugsetparents 19 18
   $ hg --config extensions.legacyrepo=../legacyrepo.py  commit -m "baz:4"
   $ hg debugindexdot baz
   digraph G {
   	-1 -> 0
   	0 -> 1
   	1 -> 2
   	1 -> 2
   	2 -> 3
   	3 -> 4
   	2 -> 4
   }
   $ hg annotate baz
   17: 1 baz:1
   18: 2 baz:2
   19: 3 baz:3
   20: 4 baz:4
   16: 5
 
 annotate clean file
 
   $ hg annotate -ncr "wdir()" foo
   11 472b18db256d : foo
 
 annotate modified file
 
   $ echo foofoo >> foo
   $ hg annotate -r "wdir()" foo
   11 : foo
   20+: foofoo
 
   $ hg annotate -cr "wdir()" foo
   472b18db256d : foo
   b6bedd5477e7+: foofoo
 
   $ hg annotate -ncr "wdir()" foo
   11 472b18db256d : foo
   20 b6bedd5477e7+: foofoo
 
   $ hg annotate --debug -ncr "wdir()" foo
   11 472b18db256d1e8282064eab4bfdaf48cbfe83cd : foo
   20 b6bedd5477e797f25e568a6402d4697f3f895a72+: foofoo
 
   $ hg annotate -udr "wdir()" foo
   test Thu Jan 01 00:00:00 1970 +0000: foo
   test [A-Za-z0-9:+ ]+: foofoo (re)
 
   $ hg annotate -ncr "wdir()" -Tjson foo
   [
    {
     "lines": [{"line": "foo\n", "node": "472b18db256d1e8282064eab4bfdaf48cbfe83cd", "rev": 11}, {"line": "foofoo\n", "node": "ffffffffffffffffffffffffffffffffffffffff", "rev": 2147483647}],
     "path": "foo"
    }
   ]
 
 annotate added file
 
   $ echo bar > bar
   $ hg add bar
   $ hg annotate -ncr "wdir()" bar
   20 b6bedd5477e7+: bar
 
 annotate renamed file
 
   $ hg rename foo renamefoo2
   $ hg annotate -ncr "wdir()" renamefoo2
   11 472b18db256d : foo
   20 b6bedd5477e7+: foofoo
 
 annotate missing file
 
   $ rm baz
 
   $ hg annotate -ncr "wdir()" baz
   abort: $TESTTMP\repo\baz: $ENOENT$ (windows !)
   abort: $ENOENT$: '$TESTTMP/repo/baz' (no-windows !)
   [255]
 
 annotate removed file
 
   $ hg rm baz
 
   $ hg annotate -ncr "wdir()" baz
   abort: $TESTTMP\repo\baz: $ENOENT$ (windows !)
   abort: $ENOENT$: '$TESTTMP/repo/baz' (no-windows !)
   [255]
 
   $ hg revert --all --no-backup --quiet
   $ hg id -n
   20
 
 Test followlines() revset; we usually check both followlines(pat, range) and
 followlines(pat, range, descend=True) to make sure both give the same result
 when they should.
 
   $ echo a >> foo
   $ hg ci -m 'foo: add a'
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 3:5)'
   16: baz:0
   19: baz:3
   20: baz:4
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 3:5, startrev=20)'
   16: baz:0
   19: baz:3
   20: baz:4
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 3:5, startrev=19)'
   16: baz:0
   19: baz:3
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 3:5, startrev=19, descend=True)'
   19: baz:3
   20: baz:4
   $ printf "0\n0\n" | cat - baz > baz1
   $ mv baz1 baz
   $ hg ci -m 'added two lines with 0'
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 5:7)'
   16: baz:0
   19: baz:3
   20: baz:4
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 3:5, descend=true, startrev=19)'
   19: baz:3
   20: baz:4
   $ echo 6 >> baz
   $ hg ci -m 'added line 8'
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 5:7)'
   16: baz:0
   19: baz:3
   20: baz:4
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 3:5, startrev=19, descend=1)'
   19: baz:3
   20: baz:4
   $ sed 's/3/3+/' baz > baz.new
   $ mv baz.new baz
   $ hg ci -m 'baz:3->3+'
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 5:7, descend=0)'
   16: baz:0
   19: baz:3
   20: baz:4
   24: baz:3->3+
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 3:5, startrev=17, descend=True)'
   19: baz:3
   20: baz:4
   24: baz:3->3+
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 1:2, descend=false)'
   22: added two lines with 0
 
 file patterns are okay
   $ hg log -T '{rev}: {desc}\n' -r 'followlines("path:baz", 1:2)'
   22: added two lines with 0
 
 renames are followed
   $ hg mv baz qux
   $ sed 's/4/4+/' qux > qux.new
   $ mv qux.new qux
   $ hg ci -m 'qux:4->4+'
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(qux, 5:7)'
   16: baz:0
   19: baz:3
   20: baz:4
   24: baz:3->3+
   25: qux:4->4+
 
 but are missed when following children
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 5:7, startrev=22, descend=True)'
   24: baz:3->3+
 
 merge
   $ hg up 24 --quiet
   $ echo 7 >> baz
   $ hg ci -m 'one more line, out of line range'
   created new head
   $ sed 's/3+/3-/' baz > baz.new
   $ mv baz.new baz
   $ hg ci -m 'baz:3+->3-'
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 5:7)'
   16: baz:0
   19: baz:3
   20: baz:4
   24: baz:3->3+
   27: baz:3+->3-
   $ hg merge 25
   merging baz and qux to qux
   warning: conflicts while merging qux! (edit, then use 'hg resolve --mark')
   0 files updated, 0 files merged, 0 files removed, 1 files unresolved
   use 'hg resolve' to retry unresolved file merges or 'hg merge --abort' to abandon
   [1]
   $ cat qux
   0
   0
   1 baz:1
   2 baz:2
   <<<<<<< working copy: 863de62655ef - test: baz:3+->3-
   3- baz:3
   4 baz:4
   ||||||| base
   3+ baz:3
   4 baz:4
   =======
   3+ baz:3
   4+ baz:4
   >>>>>>> merge rev:    cb8df70ae185 - test: qux:4->4+
   5
   6
   7
   $ cat > qux <<EOF
   > 0
   > 0
   > 1 baz:1
   > 2 baz:2
   > 3- baz:3
   > 4 baz:4
   > 5
   > 6
   > 7
   > EOF
   $ hg resolve --mark -q
   $ rm qux.orig
   $ hg ci -m merge
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(qux, 5:7)'
   16: baz:0
   19: baz:3
   20: baz:4
   24: baz:3->3+
   25: qux:4->4+
   27: baz:3+->3-
   28: merge
   $ hg up 25 --quiet
   $ hg merge 27
   merging qux and baz to qux
   warning: conflicts while merging qux! (edit, then use 'hg resolve --mark')
   0 files updated, 0 files merged, 0 files removed, 1 files unresolved
   use 'hg resolve' to retry unresolved file merges or 'hg merge --abort' to abandon
   [1]
   $ cat qux
   0
   0
   1 baz:1
   2 baz:2
   <<<<<<< working copy: cb8df70ae185 - test: qux:4->4+
   3+ baz:3
   4+ baz:4
   ||||||| base
   3+ baz:3
   4 baz:4
   =======
   3- baz:3
   4 baz:4
   >>>>>>> merge rev:    863de62655ef - test: baz:3+->3-
   5
   6
   7
   $ cat > qux <<EOF
   > 0
   > 0
   > 1 baz:1
   > 2 baz:2
   > 3+ baz:3
   > 4+ baz:4
   > 5
   > 6
   > EOF
   $ hg resolve --mark -q
   $ rm qux.orig
   $ hg ci -m 'merge from other side'
   created new head
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(qux, 5:7)'
   16: baz:0
   19: baz:3
   20: baz:4
   24: baz:3->3+
   25: qux:4->4+
   27: baz:3+->3-
   29: merge from other side
   $ hg up 24 --quiet
 
 we are missing the branch with rename when following children
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 5:7, startrev=26, descend=True)'
   27: baz:3+->3-
 
 we follow all branches in descending direction
   $ hg up 23 --quiet
   $ sed 's/3/+3/' baz > baz.new
   $ mv baz.new baz
   $ hg ci -m 'baz:3->+3'
   created new head
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 2:5, startrev=16, descend=True)' --graph
   @  30: baz:3->+3
   :
   : o  27: baz:3+->3-
   : :
   : o  24: baz:3->3+
   :/
   o    20: baz:4
   |\
   | o  19: baz:3
   |/
   o  18: baz:2
   :
   o  16: baz:0
   |
   ~
 
 Issue5595: on a merge changeset with different line ranges depending on
 parent, be conservative and use the surrounding interval to avoid loosing
 track of possible further descendants in specified range.
 
   $ hg up 23 --quiet
   $ hg cat baz -r 24
   0
   0
   1 baz:1
   2 baz:2
   3+ baz:3
   4 baz:4
   5
   6
   $ cat > baz << EOF
   > 0
   > 0
   > a
   > b
   > 3+ baz:3
   > 4 baz:4
   > y
   > z
   > EOF
   $ hg ci -m 'baz: mostly rewrite with some content from 24'
   created new head
   $ hg merge --tool :merge-other 24
   merging baz
   1 files updated, 0 files merged, 0 files removed, 0 files unresolved
   (branch merge, don't forget to commit)
   $ hg ci -m 'merge forgetting about baz rewrite'
   $ cat > baz << EOF
   > 0
   > 0
   > 1 baz:1
   > 2+ baz:2
   > 3+ baz:3
   > 4 baz:4
   > 5
   > 6
   > EOF
   $ hg ci -m 'baz: narrow change (2->2+)'
   $ hg log -T '{rev}: {desc}\n' -r 'followlines(baz, 3:4, startrev=20, descend=True)' --graph
   @  33: baz: narrow change (2->2+)
   |
   o    32: merge forgetting about baz rewrite
   |\
   | o  31: baz: mostly rewrite with some content from 24
   | :
   | : o  30: baz:3->+3
   | :/
   +---o  27: baz:3+->3-
   | :
   o :  24: baz:3->3+
   :/
   o    20: baz:4
   |\
   ~ ~
 
 An integer as a line range, which is parsed as '1:1'
 
   $ hg log -r 'followlines(baz, 1)'
   changeset:   22:2174d0bf352a
   user:        test
   date:        Thu Jan 01 00:00:00 1970 +0000
   summary:     added two lines with 0
   
 
 check error cases
   $ hg up 24 --quiet
   $ hg log -r 'followlines()'
   hg: parse error: followlines takes at least 1 positional arguments
   [255]
   $ hg log -r 'followlines(baz)'
   hg: parse error: followlines requires a line range
   [255]
   $ hg log -r 'followlines(baz, x)'
   hg: parse error: followlines expects a line number or a range
   [255]
   $ hg log -r 'followlines(baz, 1:2, startrev=desc("b"))'
   hg: parse error: followlines expects exactly one revision
   [255]
   $ hg log -r 'followlines("glob:*", 1:2)'
   hg: parse error: followlines expects exactly one file
   [255]
   $ hg log -r 'followlines(baz, 1:)'
   hg: parse error: line range bounds must be integers
   [255]
   $ hg log -r 'followlines(baz, :1)'
   hg: parse error: line range bounds must be integers
   [255]
   $ hg log -r 'followlines(baz, x:4)'
   hg: parse error: line range bounds must be integers
   [255]
   $ hg log -r 'followlines(baz, 5:4)'
   hg: parse error: line range must be positive
   [255]
   $ hg log -r 'followlines(baz, 0:4)'
   hg: parse error: fromline must be strictly positive
   [255]
   $ hg log -r 'followlines(baz, 2:40)'
   abort: line range exceeds file size
-  [255]
+  [10]
   $ hg log -r 'followlines(baz, 2:4, startrev=20, descend=[1])'
   hg: parse error at 43: not a prefix: [
   (followlines(baz, 2:4, startrev=20, descend=[1])
                                               ^ here)
   [255]
   $ hg log -r 'followlines(baz, 2:4, startrev=20, descend=a)'
   hg: parse error: descend argument must be a boolean
   [255]
 
 Test empty annotate output
 
   $ printf '\0' > binary
   $ touch empty
   $ hg ci -qAm 'add binary and empty files'
 
   $ hg annotate binary empty
   binary: binary file
 
   $ hg annotate -Tjson binary empty
   [
    {
     "path": "binary"
    },
    {
     "lines": [],
     "path": "empty"
    }
   ]
 
 Test annotate with whitespace options
 
   $ cd ..
   $ hg init repo-ws
   $ cd repo-ws
   $ cat > a <<EOF
   > aa
   > 
   > b b
   > EOF
   $ hg ci -Am "adda"
   adding a
   $ sed 's/EOL$//g' > a <<EOF
   > a  a
   > 
   >  EOL
   > b  b
   > EOF
   $ hg ci -m "changea"
 
 Annotate with no option
 
   $ hg annotate a
   1: a  a
   0: 
   1:  
   1: b  b
 
 Annotate with --ignore-space-change
 
   $ hg annotate --ignore-space-change a
   1: a  a
   1: 
   0:  
   0: b  b
 
 Annotate with --ignore-all-space
 
   $ hg annotate --ignore-all-space a
   0: a  a
   0: 
   1:  
   0: b  b
 
 Annotate with --ignore-blank-lines (similar to no options case)
 
   $ hg annotate --ignore-blank-lines a
   1: a  a
   0: 
   1:  
   1: b  b
 
   $ cd ..
 
 Annotate with orphaned CR (issue5798)
 -------------------------------------
 
   $ hg init repo-cr
   $ cd repo-cr
 
   $ cat <<'EOF' >> "$TESTTMP/substcr.py"
   > import sys
   > from mercurial.utils import procutil
   > procutil.setbinary(sys.stdin)
   > procutil.setbinary(sys.stdout)
   > stdin = getattr(sys.stdin, 'buffer', sys.stdin)
   > stdout = getattr(sys.stdout, 'buffer', sys.stdout)
   > stdout.write(stdin.read().replace(b'\r', b'[CR]'))
   > EOF
 
   >>> with open('a', 'wb') as f:
   ...     f.write(b'0a\r0b\r\n0c\r0d\r\n0e\n0f\n0g') and None
   $ hg ci -qAm0
   >>> with open('a', 'wb') as f:
   ...     f.write(b'0a\r0b\r\n1c\r1d\r\n0e\n1f\n0g') and None
   $ hg ci -m1
 
   $ hg annotate -r0 a | "$PYTHON" "$TESTTMP/substcr.py"
   0: 0a[CR]0b[CR]
   0: 0c[CR]0d[CR]
   0: 0e
   0: 0f
   0: 0g
   $ hg annotate -r1 a | "$PYTHON" "$TESTTMP/substcr.py"
   0: 0a[CR]0b[CR]
   1: 1c[CR]1d[CR]
   0: 0e
   1: 1f
   0: 0g
 
   $ cd ..
 
 Annotate with linkrev pointing to another branch
 ------------------------------------------------
 
 create history with a filerev whose linkrev points to another branch
 
   $ hg init branchedlinkrev
   $ cd branchedlinkrev
   $ echo A > a
   $ hg commit -Am 'contentA'
   adding a
   $ echo B >> a
   $ hg commit -m 'contentB'
   $ hg up --rev 'desc(contentA)'
   1 files updated, 0 files merged, 0 files removed, 0 files unresolved
   $ echo unrelated > unrelated
   $ hg commit -Am 'unrelated'
   adding unrelated
   created new head
   $ hg graft -r 'desc(contentB)'
   grafting 1:fd27c222e3e6 "contentB"
   $ echo C >> a
   $ hg commit -m 'contentC'
   $ echo W >> a
   $ hg log -G
   @  changeset:   4:072f1e8df249
   |  tag:         tip
   |  user:        test
   |  date:        Thu Jan 01 00:00:00 1970 +0000
   |  summary:     contentC
   |
   o  changeset:   3:ff38df03cc4b
   |  user:        test
   |  date:        Thu Jan 01 00:00:00 1970 +0000
   |  summary:     contentB
   |
   o  changeset:   2:62aaf3f6fc06
   |  parent:      0:f0932f74827e
   |  user:        test
   |  date:        Thu Jan 01 00:00:00 1970 +0000
   |  summary:     unrelated
   |
   | o  changeset:   1:fd27c222e3e6
   |/   user:        test
   |    date:        Thu Jan 01 00:00:00 1970 +0000
   |    summary:     contentB
   |
   o  changeset:   0:f0932f74827e
      user:        test
      date:        Thu Jan 01 00:00:00 1970 +0000
      summary:     contentA
   
 
 Annotate should list ancestor of starting revision only
 
   $ hg annotate a
   0: A
   3: B
   4: C
 
   $ hg annotate a -r 'wdir()'
   0 : A
   3 : B
   4 : C
   4+: W
 
 Even when the starting revision is the linkrev-shadowed one:
 
   $ hg annotate a -r 3
   0: A
   3: B
 
   $ cd ..
 
 Issue5360: Deleted chunk in p1 of a merge changeset
 
   $ hg init repo-5360
   $ cd repo-5360
   $ echo 1 > a
   $ hg commit -A a -m 1
   $ echo 2 >> a
   $ hg commit -m 2
   $ echo a > a
   $ hg commit -m a
   $ hg update '.^' -q
   $ echo 3 >> a
   $ hg commit -m 3 -q
   $ hg merge 2 -q
   warning: conflicts while merging a! (edit, then use 'hg resolve --mark')
   [1]
   $ cat a
   <<<<<<< working copy: 0a068f0261cf - test: 3
   1
   2
   3
   ||||||| base
   1
   2
   =======
   a
   >>>>>>> merge rev:    9409851bc20a - test: a
   $ cat > a << EOF
   > b
   > 1
   > 2
   > 3
   > a
   > EOF
   $ hg resolve --mark -q
   $ rm a.orig
   $ hg commit -m m
   $ hg annotate a
   4: b
   0: 1
   1: 2
   3: 3
   2: a
 
   $ cd ..