# commands.py - command processing for mercurial

#

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

#

# This software may be used and distributed according to the terms

# of the GNU General Public License, incorporated herein by reference.

from demandload import demandload

from node import *

from i18n import gettext as _

demandload(globals(), "os re sys signal shutil imp urllib pdb")

demandload(globals(), "fancyopts ui hg util lock revlog templater bundlerepo")

demandload(globals(), "fnmatch hgweb mdiff random signal tempfile time")

demandload(globals(), "traceback errno socket version struct atexit sets bz2")

class UnknownCommand(Exception):

    """Exception raised if command is not in the command table."""

class AmbiguousCommand(Exception):

    """Exception raised if command shortcut matches more than one command."""

def filterfiles(filters, files):

    l = [x for x in files if x in filters]

    for t in filters:

        if t and t[-1] != "/":

            t += "/"

        l += [x for x in files if x.startswith(t)]

    return l

def relpath(repo, args):

    cwd = repo.getcwd()

    if cwd:

        return [util.normpath(os.path.join(cwd, x)) for x in args]

    return args

def matchpats(repo, pats=[], opts={}, head=''):

    cwd = repo.getcwd()

    if not pats and cwd:

        opts['include'] = [os.path.join(cwd, i) for i in opts['include']]

        opts['exclude'] = [os.path.join(cwd, x) for x in opts['exclude']]

        cwd = ''

    return util.cmdmatcher(repo.root, cwd, pats or ['.'], opts.get('include'),

                           opts.get('exclude'), head)

def makewalk(repo, pats, opts, node=None, head=''):

    files, matchfn, anypats = matchpats(repo, pats, opts, head)

    exact = dict(zip(files, files))

    def walk():

        for src, fn in repo.walk(node=node, files=files, match=matchfn):

            yield src, fn, util.pathto(repo.getcwd(), fn), fn in exact

    return files, matchfn, walk()

def walk(repo, pats, opts, node=None, head=''):

    files, matchfn, results = makewalk(repo, pats, opts, node, head)

    for r in results:

        yield r

def walkchangerevs(ui, repo, pats, opts):

    '''Iterate over files and the revs they changed in.

    Callers most commonly need to iterate backwards over the history

    it is interested in.  Doing so has awful (quadratic-looking)

    performance, so we use iterators in a "windowed" way.

    We walk a window of revisions in the desired order.  Within the

    window, we first walk forwards to gather data, then in the desired

    order (usually backwards) to display it.

    This function returns an (iterator, getchange, matchfn) tuple.  The

    getchange function returns the changelog entry for a numeric

    revision.  The iterator yields 3-tuples.  They will be of one of

    the following forms:

    "window", incrementing, lastrev: stepping through a window,

    positive if walking forwards through revs, last rev in the

    sequence iterated over - use to reset state for the current window

    "add", rev, fns: out-of-order traversal of the given file names

    fns, which changed during revision rev - use to gather data for

    possible display

    "iter", rev, None: in-order traversal of the revs earlier iterated

    over with "add" - use to display data'''

    def increasing_windows(start, end, windowsize=8, sizelimit=512):

        if start < end:

            while start < end:

                yield start, min(windowsize, end-start)

                start += windowsize

                if windowsize < sizelimit:

                    windowsize *= 2

        else:

            while start > end:

                yield start, min(windowsize, start-end-1)

                start -= windowsize

                if windowsize < sizelimit:

                    windowsize *= 2

    files, matchfn, anypats = matchpats(repo, pats, opts)

    if repo.changelog.count() == 0:

        return [], False, matchfn

    revs = map(int, revrange(ui, repo, opts['rev'] or ['tip:0']))

    wanted = {}

    slowpath = anypats

    fncache = {}

    chcache = {}

    def getchange(rev):

        ch = chcache.get(rev)

        if ch is None:

            chcache[rev] = ch = repo.changelog.read(repo.lookup(str(rev)))

        return ch

    if not slowpath and not files:

        # No files, no patterns.  Display all revs.

        wanted = dict(zip(revs, revs))

    if not slowpath:

        # Only files, no patterns.  Check the history of each file.

        def filerevgen(filelog):

            for i, window in increasing_windows(filelog.count()-1, -1):

                revs = []

                for j in xrange(i - window, i + 1):

                    revs.append(filelog.linkrev(filelog.node(j)))

                revs.reverse()

                for rev in revs:

                    yield rev

        minrev, maxrev = min(revs), max(revs)

        for file_ in files:

            filelog = repo.file(file_)

            # A zero count may be a directory or deleted file, so

            # try to find matching entries on the slow path.

            if filelog.count() == 0:

                slowpath = True

                break

            for rev in filerevgen(filelog):

                if rev <= maxrev:

                    if rev < minrev:

                        break

                    fncache.setdefault(rev, [])

                    fncache[rev].append(file_)

                    wanted[rev] = 1

    if slowpath:

        # The slow path checks files modified in every changeset.

        def changerevgen():

            for i, window in increasing_windows(repo.changelog.count()-1, -1):

                for j in xrange(i - window, i + 1):

                    yield j, getchange(j)[3]

        for rev, changefiles in changerevgen():

            matches = filter(matchfn, changefiles)

            if matches:

                fncache[rev] = matches

                wanted[rev] = 1

    def iterate():

        for i, window in increasing_windows(0, len(revs)):

            yield 'window', revs[0] < revs[-1], revs[-1]

            nrevs = [rev for rev in revs[i:i+window]

                     if rev in wanted]

            srevs = list(nrevs)

            srevs.sort()

            for rev in srevs:

                fns = fncache.get(rev) or filter(matchfn, getchange(rev)[3])

                yield 'add', rev, fns

            for rev in nrevs:

                yield 'iter', rev, None

    return iterate(), getchange, matchfn

revrangesep = ':'

def revrange(ui, repo, revs, revlog=None):

    """Yield revision as strings from a list of revision specifications."""

    if revlog is None:

        revlog = repo.changelog

    revcount = revlog.count()

    def fix(val, defval):

        if not val:

            return defval

        try:

            num = int(val)

            if str(num) != val:

                raise ValueError

            if num < 0:

                num += revcount

            if num < 0:

                num = 0

            elif num >= revcount:

                raise ValueError

        except ValueError:

            try:

                num = repo.changelog.rev(repo.lookup(val))

            except KeyError:

                try:

                    num = revlog.rev(revlog.lookup(val))

                except KeyError:

                    raise util.Abort(_('invalid revision identifier %s'), val)

        return num

    seen = {}

    for spec in revs:

        if spec.find(revrangesep) >= 0:

            start, end = spec.split(revrangesep, 1)

            start = fix(start, 0)

            end = fix(end, revcount - 1)

            step = start > end and -1 or 1

            for rev in xrange(start, end+step, step):

                if rev in seen:

                    continue

                seen[rev] = 1

                yield str(rev)

        else:

            rev = fix(spec, None)

            if rev in seen:

                continue

            seen[rev] = 1

            yield str(rev)

def make_filename(repo, r, pat, node=None,

                  total=None, seqno=None, revwidth=None, pathname=None):

    node_expander = {

        'H': lambda: hex(node),

        'R': lambda: str(r.rev(node)),

        'h': lambda: short(node),

        }

    expander = {

        '%': lambda: '%',

        'b': lambda: os.path.basename(repo.root),

        }

    try:

        if node:

            expander.update(node_expander)

        if node and revwidth is not None:

            expander['r'] = lambda: str(r.rev(node)).zfill(revwidth)

        if total is not None:

            expander['N'] = lambda: str(total)

        if seqno is not None:

            expander['n'] = lambda: str(seqno)

        if total is not None and seqno is not None:

            expander['n'] = lambda:str(seqno).zfill(len(str(total)))

        if pathname is not None:

            expander['s'] = lambda: os.path.basename(pathname)

            expander['d'] = lambda: os.path.dirname(pathname) or '.'

            expander['p'] = lambda: pathname

        newname = []

        patlen = len(pat)

        i = 0

        while i < patlen:

            c = pat[i]

            if c == '%':

                i += 1

                c = pat[i]

                c = expander[c]()

            newname.append(c)

            i += 1

        return ''.join(newname)

    except KeyError, inst:

        raise util.Abort(_("invalid format spec '%%%s' in output file name"),

                    inst.args[0])

def make_file(repo, r, pat, node=None,

              total=None, seqno=None, revwidth=None, mode='wb', pathname=None):

    if not pat or pat == '-':

        return 'w' in mode and sys.stdout or sys.stdin

    if hasattr(pat, 'write') and 'w' in mode:

        return pat

    if hasattr(pat, 'read') and 'r' in mode:

        return pat

    return open(make_filename(repo, r, pat, node, total, seqno, revwidth,

                              pathname),

                mode)

def write_bundle(cg, filename=None, compress=True):

    """Write a bundle file and return its filename.

    Existing files will not be overwritten.

    If no filename is specified, a temporary file is created.

    bz2 compression can be turned off.

    The bundle file will be deleted in case of errors.

    """

    class nocompress(object):

        def compress(self, x):

            return x

        def flush(self):

            return ""

    fh = None

    cleanup = None

    try:

        if filename:

            if os.path.exists(filename):

                raise util.Abort(_("file '%s' already exists"), filename)

            fh = open(filename, "wb")

        else:

            fd, filename = tempfile.mkstemp(suffix=".hg", prefix="hg-bundle-")

            fh = os.fdopen(fd, "wb")

        cleanup = filename

        if compress:

            fh.write("HG10")

            z = bz2.BZ2Compressor(9)

        else:

            z = nocompress()

        while 1:

            chunk = cg.read(4096)

            if not chunk:

                break

            fh.write(z.compress(chunk))

        fh.write(z.flush())

        cleanup = None

        return filename

    finally:

        if fh is not None:

            fh.close()

        if cleanup is not None:

            os.unlink(cleanup)

def dodiff(fp, ui, repo, node1, node2, files=None, match=util.always,

           changes=None, text=False, opts={}):

    if not node1:

        node1 = repo.dirstate.parents()[0]

    # reading the data for node1 early allows it to play nicely

    # with repo.changes and the revlog cache.

    change = repo.changelog.read(node1)

    mmap = repo.manifest.read(change[0])

    date1 = util.datestr(change[2])

    if not changes:

        changes = repo.changes(node1, node2, files, match=match)

    modified, added, removed, deleted, unknown = changes

    if files:

        modified, added, removed = map(lambda x: filterfiles(files, x),

                                       (modified, added, removed))

    if not modified and not added and not removed:

        return

    if node2:

        change = repo.changelog.read(node2)

        mmap2 = repo.manifest.read(change[0])

        date2 = util.datestr(change[2])

        def read(f):

            return repo.file(f).read(mmap2[f])

    else:

        date2 = util.datestr()

        def read(f):

            return repo.wread(f)

    if ui.quiet:

        r = None

    else:

        hexfunc = ui.verbose and hex or short

        r = [hexfunc(node) for node in [node1, node2] if node]

    diffopts = ui.diffopts()

    showfunc = opts.get('show_function') or diffopts['showfunc']

    ignorews = opts.get('ignore_all_space') or diffopts['ignorews']

    for f in modified:

        to = None

        if f in mmap:

            to = repo.file(f).read(mmap[f])

        tn = read(f)

        fp.write(mdiff.unidiff(to, date1, tn, date2, f, r, text=text,

                               showfunc=showfunc, ignorews=ignorews))

    for f in added:

        to = None

        tn = read(f)

        fp.write(mdiff.unidiff(to, date1, tn, date2, f, r, text=text,

                               showfunc=showfunc, ignorews=ignorews))

    for f in removed:

        to = repo.file(f).read(mmap[f])

        tn = None

        fp.write(mdiff.unidiff(to, date1, tn, date2, f, r, text=text,

                               showfunc=showfunc, ignorews=ignorews))

def trimuser(ui, name, rev, revcache):

    """trim the name of the user who committed a change"""

    user = revcache.get(rev)

    if user is None:

        user = revcache[rev] = ui.shortuser(name)

    return user

class changeset_templater(object):

    '''use templater module to format changeset information.'''

    def __init__(self, ui, repo, mapfile):

        self.t = templater.templater(mapfile, templater.common_filters,

                                     cache={'parent': '{rev}:{node|short} ',

                                            'manifest': '{rev}:{node|short}'})

        self.ui = ui

        self.repo = repo

    def use_template(self, t):

        '''set template string to use'''

        self.t.cache['changeset'] = t

    def write(self, thing):

        '''write expanded template.

        uses in-order recursive traverse of iterators.'''

        for t in thing:

            if hasattr(t, '__iter__'):

                self.write(t)

            else:

                self.ui.write(t)

    def show(self, rev=0, changenode=None, brinfo=None):

        '''show a single changeset or file revision'''

        log = self.repo.changelog

        if changenode is None:

            changenode = log.node(rev)

        elif not rev:

            rev = log.rev(changenode)

        changes = log.read(changenode)

        def showlist(name, values, plural=None, **args):

            '''expand set of values.

            name is name of key in template map.

            values is list of strings or dicts.

            plural is plural of name, if not simply name + 's'.

            expansion works like this, given name 'foo'.

            if values is empty, expand 'no_foos'.

            if 'foo' not in template map, return values as a string,

            joined by space.

            expand 'start_foos'.

            for each value, expand 'foo'. if 'last_foo' in template

            map, expand it instead of 'foo' for last key.

            expand 'end_foos'.

            '''

            if plural: names = plural

            else: names = name + 's'

            if not values:

                noname = 'no_' + names

                if noname in self.t:

                    yield self.t(noname, **args)

                return

            if name not in self.t:

                if isinstance(values[0], str):

                    yield ' '.join(values)

                else:

                    for v in values:

                        yield dict(v, **args)

                return

            startname = 'start_' + names

            if startname in self.t:

                yield self.t(startname, **args)

            vargs = args.copy()

            def one(v, tag=name):

                try:

                    vargs.update(v)

                except (AttributeError, ValueError):

                    try:

                        for a, b in v:

                            vargs[a] = b

                    except ValueError:

                        vargs[name] = v

                return self.t(tag, **vargs)

            lastname = 'last_' + name

            if lastname in self.t:

                last = values.pop()

            else:

                last = None

            for v in values:

                yield one(v)

            if last is not None:

                yield one(last, tag=lastname)

            endname = 'end_' + names

            if endname in self.t:

                yield self.t(endname, **args)

        if brinfo:

            def showbranches(**args):