# manifest.py - manifest revision class for mercurial

#

# Copyright 2005-2007 Matt Mackall <mpm@selenic.com>

#

# 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 heapq

import itertools

import struct

import weakref

from .i18n import _

from .node import (

    bin,

    hex,

    nullid,

    nullrev,

)

from .pycompat import getattr

from . import (

    encoding,

    error,

    match as matchmod,

    mdiff,

    pathutil,

    policy,

    pycompat,

    revlog,

    util,

)

from .interfaces import (

    repository,

    util as interfaceutil,

)

parsers = policy.importmod('parsers')

propertycache = util.propertycache

# Allow tests to more easily test the alternate path in manifestdict.fastdelta()

FASTDELTA_TEXTDIFF_THRESHOLD = 1000

def _parse(data):

    # This method does a little bit of excessive-looking

    # precondition checking. This is so that the behavior of this

    # class exactly matches its C counterpart to try and help

    # prevent surprise breakage for anyone that develops against

    # the pure version.

    if data and data[-1:] != b'\n':

        raise ValueError(b'Manifest did not end in a newline.')

    prev = None

    for l in data.splitlines():

        if prev is not None and prev > l:

            raise ValueError(b'Manifest lines not in sorted order.')

        prev = l

        f, n = l.split(b'\0')

        nl = len(n)

        else:

def _text(it):

    files = []

    lines = []

    for f, n, fl in it:

        files.append(f)

        # if this is changed to support newlines in filenames,

        # be sure to check the templates/ dir again (especially *-raw.tmpl)

        lines.append(b"%s\0%s%s\n" % (f, hex(n), fl))

    _checkforbidden(files)

    return b''.join(lines)

class lazymanifestiter(object):

    def __init__(self, lm):

        self.pos = 0

        self.lm = lm

    def __iter__(self):

        return self

    def next(self):

        try:

            data, pos = self.lm._get(self.pos)

        except IndexError:

            raise StopIteration

        if pos == -1:

            self.pos += 1

            return data[0]

        self.pos += 1

        zeropos = data.find(b'\x00', pos)

        return data[pos:zeropos]

    __next__ = next

class lazymanifestiterentries(object):

    def __init__(self, lm):

        self.lm = lm

        self.pos = 0

    def __iter__(self):

        return self

    def next(self):

        try:

            data, pos = self.lm._get(self.pos)

        except IndexError:

            raise StopIteration

        if pos == -1:

            self.pos += 1

            return data

        zeropos = data.find(b'\x00', pos)

        nlpos = data.find(b'\n', pos)

        if zeropos == -1 or nlpos == -1 or nlpos < zeropos:

            raise error.StorageError(b'Invalid manifest line')

        flags = data[nlpos - 1 : nlpos]

        if flags in _manifestflags:

            hlen = nlpos - zeropos - 2

        else:

            hlen = nlpos - zeropos - 1

            flags = b''

        if hlen not in (40, 64):

            raise error.StorageError(b'Invalid manifest line')

        hashval = unhexlify(

            data, self.lm.extrainfo[self.pos], zeropos + 1, hlen

        )

        self.pos += 1

        return (data[pos:zeropos], hashval, flags)

    __next__ = next

def unhexlify(data, extra, pos, length):

    s = bin(data[pos : pos + length])

    if extra:

        s += chr(extra & 0xFF)

    return s

def _cmp(a, b):

    return (a > b) - (a < b)

_manifestflags = {b'', b'l', b't', b'x'}

class _lazymanifest(object):

    """A pure python manifest backed by a byte string.  It is supplimented with

    internal lists as it is modified, until it is compacted back to a pure byte

    string.

    ``data`` is the initial manifest data.

    ``positions`` is a list of offsets, one per manifest entry.  Positive

    values are offsets into ``data``, negative values are offsets into the

    ``extradata`` list.  When an entry is removed, its entry is dropped from

    ``positions``.  The values are encoded such that when walking the list and

    indexing into ``data`` or ``extradata`` as appropriate, the entries are

    sorted by filename.

    ``extradata`` is a list of (key, hash, flags) for entries that were added or

    modified since the manifest was created or compacted.

    """

    def __init__(

        self,

        data,

        positions=None,

        extrainfo=None,

        extradata=None,

        hasremovals=False,

    ):

        if positions is None:

            self.positions = self.findlines(data)

            self.extrainfo = [0] * len(self.positions)

            self.data = data

            self.extradata = []

            self.hasremovals = False

        else:

            self.positions = positions[:]

            self.extrainfo = extrainfo[:]

            self.extradata = extradata[:]

            self.data = data

            self.hasremovals = hasremovals

    def findlines(self, data):

        if not data:

            return []

        pos = data.find(b"\n")

        if pos == -1 or data[-1:] != b'\n':

            raise ValueError(b"Manifest did not end in a newline.")

        positions = [0]

        prev = data[: data.find(b'\x00')]

        while pos < len(data) - 1 and pos != -1:

            positions.append(pos + 1)

            nexts = data[pos + 1 : data.find(b'\x00', pos + 1)]

            if nexts < prev:

                raise ValueError(b"Manifest lines not in sorted order.")

            prev = nexts

            pos = data.find(b"\n", pos + 1)

        return positions

    def _get(self, index):

        # get the position encoded in pos:

        #   positive number is an index in 'data'

        #   negative number is in extrapieces

        pos = self.positions[index]

        if pos >= 0:

            return self.data, pos

        return self.extradata[-pos - 1], -1

    def _getkey(self, pos):

        if pos >= 0:

            return self.data[pos : self.data.find(b'\x00', pos + 1)]

        return self.extradata[-pos - 1][0]

    def bsearch(self, key):

        first = 0

        last = len(self.positions) - 1

        while first <= last:

            midpoint = (first + last) // 2

            nextpos = self.positions[midpoint]

            candidate = self._getkey(nextpos)

            r = _cmp(key, candidate)

            if r == 0:

                return midpoint

            else:

                if r < 0:

                    last = midpoint - 1

                else:

                    first = midpoint + 1

        return -1

    def bsearch2(self, key):

        # same as the above, but will always return the position

        # done for performance reasons

        first = 0

        last = len(self.positions) - 1

        while first <= last:

            midpoint = (first + last) // 2

            nextpos = self.positions[midpoint]

            candidate = self._getkey(nextpos)

            r = _cmp(key, candidate)

            if r == 0:

                return (midpoint, True)

            else:

                if r < 0:

                    last = midpoint - 1

                else:

                    first = midpoint + 1

        return (first, False)

    def __contains__(self, key):

        return self.bsearch(key) != -1

    def __getitem__(self, key):

        if not isinstance(key, bytes):

            raise TypeError(b"getitem: manifest keys must be a bytes.")

        needle = self.bsearch(key)

        if needle == -1:

            raise KeyError

        data, pos = self._get(needle)

        if pos == -1:

            return (data[1], data[2])

        zeropos = data.find(b'\x00', pos)

        nlpos = data.find(b'\n', zeropos)

        assert 0 <= needle <= len(self.positions)

        assert len(self.extrainfo) == len(self.positions)

        if zeropos == -1 or nlpos == -1 or nlpos < zeropos:

            raise error.StorageError(b'Invalid manifest line')

        hlen = nlpos - zeropos - 1

        flags = data[nlpos - 1 : nlpos]

        if flags in _manifestflags:

            hlen -= 1

        else:

            flags = b''

        if hlen not in (40, 64):

            raise error.StorageError(b'Invalid manifest line')

        hashval = unhexlify(data, self.extrainfo[needle], zeropos + 1, hlen)

        return (hashval, flags)

    def __delitem__(self, key):

        needle, found = self.bsearch2(key)

        if not found:

            raise KeyError

        cur = self.positions[needle]

        self.positions = self.positions[:needle] + self.positions[needle + 1 :]

        self.extrainfo = self.extrainfo[:needle] + self.extrainfo[needle + 1 :]

        if cur >= 0:

            # This does NOT unsort the list as far as the search functions are

            # concerned, as they only examine lines mapped by self.positions.

            self.data = self.data[:cur] + b'\x00' + self.data[cur + 1 :]

            self.hasremovals = True

    def __setitem__(self, key, value):

        if not isinstance(key, bytes):

            raise TypeError(b"setitem: manifest keys must be a byte string.")

        if not isinstance(value, tuple) or len(value) != 2:

            raise TypeError(

                b"Manifest values must be a tuple of (node, flags)."

            )

        hashval = value[0]

        # hashes are either 20 or 32 bytes (sha1 or its replacement),

        # and allow one extra byte taht won't be persisted to disk but

        # is sometimes used in memory.

        if not isinstance(hashval, bytes) or not (

            20 <= len(hashval) <= 22 or 32 <= len(hashval) <= 34

        ):

            raise TypeError(b"node must be a 20-byte or 32-byte byte string")

        flags = value[1]

        if len(hashval) == 22:

            hashval = hashval[:-1]

        if not isinstance(flags, bytes) or len(flags) > 1:

            raise TypeError(b"flags must a 0 or 1 byte string, got %r", flags)

        needle, found = self.bsearch2(key)

        if found:

            # put the item

            pos = self.positions[needle]

            if pos < 0:

                self.extradata[-pos - 1] = (key, hashval, value[1])

            else:

                # just don't bother

                self.extradata.append((key, hashval, value[1]))

                self.positions[needle] = -len(self.extradata)

        else:

            # not found, put it in with extra positions

            self.extradata.append((key, hashval, value[1]))

            self.positions = (

                self.positions[:needle]

                + [-len(self.extradata)]

                + self.positions[needle:]

            )

            self.extrainfo = (

                self.extrainfo[:needle] + [0] + self.extrainfo[needle:]

            )

    def copy(self):

        # XXX call _compact like in C?

        return _lazymanifest(

            self.data,

            self.positions,

            self.extrainfo,

            self.extradata,

            self.hasremovals,

        )

    def _compact(self):

        # hopefully not called TOO often

        if len(self.extradata) == 0 and not self.hasremovals:

            return

        l = []

        i = 0

        offset = 0

        self.extrainfo = [0] * len(self.positions)