# hgweb/webutil.py - utility library for the web interface.

#

# Copyright 21 May 2005 - (c) 2005 Jake Edge <jake@edge2.net>

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

import difflib

import os

import re

from ..i18n import _

from ..node import hex, nullid, short

from .common import (

    ErrorResponse,

    HTTP_BAD_REQUEST,

    HTTP_NOT_FOUND,

    paritygen,

)

from .. import (

    context,

    error,

    match,

    mdiff,

    patch,

    pathutil,

    templatefilters,

    ui as uimod,

    util,

)

def up(p):

    if p[0] != "/":

        p = "/" + p

    if p[-1] == "/":

        p = p[:-1]

    up = os.path.dirname(p)

    if up == "/":

        return "/"

    return up + "/"

def _navseq(step, firststep=None):

    if firststep:

        yield firststep

        if firststep >= 20 and firststep <= 40:

            firststep = 50

            yield firststep

        assert step > 0

        assert firststep > 0

        while step <= firststep:

            step *= 10

    while True:

        yield 1 * step

        yield 3 * step

        step *= 10

class revnav(object):

    def __init__(self, repo):

        """Navigation generation object

        :repo: repo object we generate nav for

        """

        # used for hex generation

        self._revlog = repo.changelog

    def __nonzero__(self):

        """return True if any revision to navigate over"""

        return self._first() is not None

    __bool__ = __nonzero__

    def _first(self):

        """return the minimum non-filtered changeset or None"""

        try:

            return next(iter(self._revlog))

        except StopIteration:

            return None

    def hex(self, rev):

        return hex(self._revlog.node(rev))

    def gen(self, pos, pagelen, limit):

        """computes label and revision id for navigation link

        :pos: is the revision relative to which we generate navigation.

        :pagelen: the size of each navigation page

        :limit: how far shall we link

        The return is:

            - a single element tuple

            - containing a dictionary with a `before` and `after` key

            - values are generator functions taking arbitrary number of kwargs

            - yield items are dictionaries with `label` and `node` keys

        """

        if not self:

            # empty repo

            return ({'before': (), 'after': ()},)

        targets = []

        for f in _navseq(1, pagelen):

            if f > limit:

                break

            targets.append(pos + f)

            targets.append(pos - f)

        targets.sort()

        first = self._first()

        navbefore = [("(%i)" % first, self.hex(first))]

        navafter = []

        for rev in targets:

            if rev not in self._revlog:

                continue

            if pos < rev < limit:

                navafter.append(("+%d" % abs(rev - pos), self.hex(rev)))

            if 0 < rev < pos:

                navbefore.append(("-%d" % abs(rev - pos), self.hex(rev)))

        navafter.append(("tip", "tip"))

        data = lambda i: {"label": i[0], "node": i[1]}

        return ({'before': lambda **map: (data(i) for i in navbefore),

                 'after':  lambda **map: (data(i) for i in navafter)},)

class filerevnav(revnav):

    def __init__(self, repo, path):

        """Navigation generation object

        :repo: repo object we generate nav for

        :path: path of the file we generate nav for

        """

        # used for iteration

        self._changelog = repo.unfiltered().changelog

        # used for hex generation

        self._revlog = repo.file(path)

    def hex(self, rev):

        return hex(self._changelog.node(self._revlog.linkrev(rev)))

class _siblings(object):

    def __init__(self, siblings=None, hiderev=None):

        if siblings is None:

            siblings = []

        self.siblings = [s for s in siblings if s.node() != nullid]

        if len(self.siblings) == 1 and self.siblings[0].rev() == hiderev:

            self.siblings = []

    def __iter__(self):

        for s in self.siblings:

            d = {

                'node': s.hex(),

                'rev': s.rev(),

                'user': s.user(),

                'date': s.date(),

                'description': s.description(),

                'branch': s.branch(),

            }

            if util.safehasattr(s, 'path'):

                d['file'] = s.path()

            yield d

    def __len__(self):

        return len(self.siblings)

def difffeatureopts(req, ui, section):

    diffopts = patch.difffeatureopts(ui, untrusted=True,

                                     section=section, whitespace=True)

    for k in ('ignorews', 'ignorewsamount', 'ignorewseol', 'ignoreblanklines'):

        v = req.form.get(k, [None])[0]

        if v is not None:

            v = util.parsebool(v)

            setattr(diffopts, k, v if v is not None else True)

    return diffopts

def annotate(req, fctx, ui):

    diffopts = difffeatureopts(req, ui, 'annotate')

    return fctx.annotate(follow=True, linenumber=True, diffopts=diffopts)

def parents(ctx, hide=None):

    if isinstance(ctx, context.basefilectx):

        introrev = ctx.introrev()

        if ctx.changectx().rev() != introrev:

            return _siblings([ctx.repo()[introrev]], hide)

    return _siblings(ctx.parents(), hide)

def children(ctx, hide=None):

    return _siblings(ctx.children(), hide)

def renamelink(fctx):

    r = fctx.renamed()

    if r:

        return [{'file': r[0], 'node': hex(r[1])}]

    return []

def nodetagsdict(repo, node):

    return [{"name": i} for i in repo.nodetags(node)]

def nodebookmarksdict(repo, node):

    return [{"name": i} for i in repo.nodebookmarks(node)]

def nodebranchdict(repo, ctx):

    branches = []

    branch = ctx.branch()

    # If this is an empty repo, ctx.node() == nullid,

    # ctx.branch() == 'default'.

    try:

        branchnode = repo.branchtip(branch)

    except error.RepoLookupError:

        branchnode = None

    if branchnode == ctx.node():

        branches.append({"name": branch})

    return branches

def nodeinbranch(repo, ctx):

    branches = []

    branch = ctx.branch()

    try:

        branchnode = repo.branchtip(branch)

    except error.RepoLookupError:

        branchnode = None

    if branch != 'default' and branchnode != ctx.node():

        branches.append({"name": branch})

    return branches

def nodebranchnodefault(ctx):

    branches = []

    branch = ctx.branch()

    if branch != 'default':

        branches.append({"name": branch})

    return branches

def showtag(repo, tmpl, t1, node=nullid, **args):

    for t in repo.nodetags(node):

        yield tmpl(t1, tag=t, **args)

def showbookmark(repo, tmpl, t1, node=nullid, **args):

    for t in repo.nodebookmarks(node):

        yield tmpl(t1, bookmark=t, **args)

def branchentries(repo, stripecount, limit=0):

    tips = []

    heads = repo.heads()

    parity = paritygen(stripecount)

    sortkey = lambda item: (not item[1], item[0].rev())

    def entries(**map):

        count = 0

        if not tips:

            for tag, hs, tip, closed in repo.branchmap().iterbranches():

                tips.append((repo[tip], closed))

        for ctx, closed in sorted(tips, key=sortkey, reverse=True):

            if limit > 0 and count >= limit:

                return

            count += 1

            if closed:

                status = 'closed'

            elif ctx.node() not in heads:

                status = 'inactive'

            else:

                status = 'open'

            yield {

                'parity': next(parity),

                'branch': ctx.branch(),

                'status': status,

                'node': ctx.hex(),

                'date': ctx.date()

            }

    return entries

def cleanpath(repo, path):

    path = path.lstrip('/')

    return pathutil.canonpath(repo.root, '', path)

def changeidctx(repo, changeid):

    try:

        ctx = repo[changeid]

    except error.RepoError:

        man = repo.manifestlog._revlog

        ctx = repo[man.linkrev(man.rev(man.lookup(changeid)))]

    return ctx

def changectx(repo, req):

    changeid = "tip"

    if 'node' in req.form:

        changeid = req.form['node'][0]

        ipos = changeid.find(':')

        if ipos != -1:

            changeid = changeid[(ipos + 1):]

    elif 'manifest' in req.form:

        changeid = req.form['manifest'][0]

    return changeidctx(repo, changeid)

def basechangectx(repo, req):

    if 'node' in req.form:

        changeid = req.form['node'][0]

        ipos = changeid.find(':')

        if ipos != -1:

            changeid = changeid[:ipos]

            return changeidctx(repo, changeid)

    return None

def filectx(repo, req):

    if 'file' not in req.form:

        raise ErrorResponse(HTTP_NOT_FOUND, 'file not given')

    path = cleanpath(repo, req.form['file'][0])

    if 'node' in req.form:

        changeid = req.form['node'][0]

    elif 'filenode' in req.form:

        changeid = req.form['filenode'][0]

    else:

        raise ErrorResponse(HTTP_NOT_FOUND, 'node or filenode not given')

    try:

        fctx = repo[changeid][path]

    except error.RepoError:

        fctx = repo.filectx(path, fileid=changeid)

    return fctx

def linerange(req):

    linerange = req.form.get('linerange')

    if linerange is None:

        return None

    if len(linerange) > 1:

        raise ErrorResponse(HTTP_BAD_REQUEST,

                            'redundant linerange parameter')

    try:

        fromline, toline = map(int, linerange[0].split(':', 1))

    except ValueError:

        raise ErrorResponse(HTTP_BAD_REQUEST,

                            'invalid linerange parameter')

    try:

        return util.processlinerange(fromline, toline)

    except error.ParseError as exc:

        raise ErrorResponse(HTTP_BAD_REQUEST, str(exc))

def formatlinerange(fromline, toline):

    return '%d:%d' % (fromline + 1, toline)

def commonentry(repo, ctx):

    node = ctx.node()

    return {

        'rev': ctx.rev(),

        'node': hex(node),

        'author': ctx.user(),

        'desc': ctx.description(),

        'date': ctx.date(),

        'extra': ctx.extra(),

        'phase': ctx.phasestr(),

        'branch': nodebranchnodefault(ctx),

        'inbranch': nodeinbranch(repo, ctx),

        'branches': nodebranchdict(repo, ctx),

        'tags': nodetagsdict(repo, node),

        'bookmarks': nodebookmarksdict(repo, node),

        'parent': lambda **x: parents(ctx),

        'child': lambda **x: children(ctx),

    }