# commands.py - command processing for mercurial

#

# Copyright 2005, 2006 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 imp urllib pdb shlex")

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

demandload(globals(), "difflib patch tempfile time")

demandload(globals(), "traceback errno version atexit bz2")

demandload(globals(), "archival changegroup cmdutil hgweb.server sshserver")

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 bail_if_changed(repo):

    modified, added, removed, deleted = repo.status()[:4]

    if modified or added or removed or deleted:

        raise util.Abort(_("outstanding uncommitted changes"))

def relpath(repo, args):

    cwd = repo.getcwd()

    if cwd:

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

    return args

def logmessage(opts):

    """ get the log message according to -m and -l option """

    message = opts['message']

    logfile = opts['logfile']

    if message and logfile:

        raise util.Abort(_('options --message and --logfile are mutually '

                           'exclusive'))

    if not message and logfile:

        try:

            if logfile == '-':

                message = sys.stdin.read()

            else:

                message = open(logfile).read()

        except IOError, inst:

            raise util.Abort(_("can't read commit message '%s': %s") %

                             (logfile, inst.strerror))

    return message

def walkchangerevs(ui, repo, pats, change, 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, matchfn) tuple. 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 = cmdutil.matchpats(repo, pats, opts)

    follow = opts.get('follow') or opts.get('follow_first')

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

        return [], matchfn

    if follow:

        defrange = '%s:0' % repo.changectx().rev()

    else:

        defrange = 'tip:0'

    revs = cmdutil.revrange(ui, repo, opts['rev'] or [defrange])

    wanted = {}

    slowpath = anypats

    fncache = {}

    if not slowpath and not files:

        # No files, no patterns.  Display all revs.

        wanted = dict.fromkeys(revs)

    copies = []

    if not slowpath:

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

        def filerevgen(filelog, node):

            cl_count = repo.changelog.count()

            if node is None:

                last = filelog.count() - 1

            else:

                last = filelog.rev(node)

            for i, window in increasing_windows(last, nullrev):

                revs = []

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

                    n = filelog.node(j)

                    revs.append((filelog.linkrev(n),

                                 follow and filelog.renamed(n)))

                revs.reverse()

                for rev in revs:

                    # only yield rev for which we have the changelog, it can

                    # happen while doing "hg log" during a pull or commit

                    if rev[0] < cl_count:

                        yield rev

        def iterfiles():

            for filename in files:

                yield filename, None

            for filename_node in copies:

                yield filename_node

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

        for file_, node in iterfiles():

            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, copied in filerevgen(filelog, node):

                if rev <= maxrev:

                    if rev < minrev:

                        break

                    fncache.setdefault(rev, [])

                    fncache[rev].append(file_)

                    wanted[rev] = 1

                    if follow and copied:

                        copies.append(copied)

    if slowpath:

        if follow:

            raise util.Abort(_('can only follow copies/renames for explicit '

                               'file names'))

        # The slow path checks files modified in every changeset.

        def changerevgen():

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

                                                nullrev):

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

                    yield j, change(j)[3]

        for rev, changefiles in changerevgen():

            matches = filter(matchfn, changefiles)

            if matches:

                fncache[rev] = matches

                wanted[rev] = 1

    class followfilter:

        def __init__(self, onlyfirst=False):

            self.startrev = nullrev

            self.roots = []

            self.onlyfirst = onlyfirst

        def match(self, rev):

            def realparents(rev):

                if self.onlyfirst:

                    return repo.changelog.parentrevs(rev)[0:1]

                else:

                    return filter(lambda x: x != nullrev,

                                  repo.changelog.parentrevs(rev))

            if self.startrev == nullrev:

                self.startrev = rev

                return True

            if rev > self.startrev:

                # forward: all descendants

                if not self.roots:

                    self.roots.append(self.startrev)

                for parent in realparents(rev):

                    if parent in self.roots:

                        self.roots.append(rev)

                        return True

            else:

                # backwards: all parents

                if not self.roots:

                    self.roots.extend(realparents(self.startrev))

                if rev in self.roots:

                    self.roots.remove(rev)

                    self.roots.extend(realparents(rev))

                    return True

            return False

    # it might be worthwhile to do this in the iterator if the rev range

    # is descending and the prune args are all within that range

    for rev in opts.get('prune', ()):

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

        ff = followfilter()

        stop = min(revs[0], revs[-1])

        for x in xrange(rev, stop-1, -1):

            if ff.match(x) and x in wanted:

                del wanted[x]

    def iterate():

        if follow and not files:

            ff = followfilter(onlyfirst=opts.get('follow_first'))

            def want(rev):

                if ff.match(rev) and rev in wanted:

                    return True

                return False

        else:

            def want(rev):

                return rev in wanted

        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 want(rev)]

            srevs = list(nrevs)

            srevs.sort()

            for rev in srevs:

                fns = fncache.get(rev)

                if not fns:

                    def fns_generator():

                        for f in change(rev)[3]:

                            if matchfn(f):

                                yield f

                    fns = fns_generator()

                yield 'add', rev, fns

            for rev in nrevs:

                yield 'iter', rev, None

    return iterate(), matchfn

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(prefix="hg-bundle-", suffix=".hg")

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

        cleanup = filename

        if compress:

            fh.write("HG10")

            z = bz2.BZ2Compressor(9)

        else:

            fh.write("HG10UN")

            z = nocompress()

        # parse the changegroup data, otherwise we will block

        # in case of sshrepo because we don't know the end of the stream

        # an empty chunkiter is the end of the changegroup

        empty = False

        while not empty:

            empty = True

            for chunk in changegroup.chunkiter(cg):

                empty = False

                fh.write(z.compress(changegroup.genchunk(chunk)))

            fh.write(z.compress(changegroup.closechunk()))

        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 setremoteconfig(ui, opts):

    "copy remote options to ui tree"

    if opts.get('ssh'):

        ui.setconfig("ui", "ssh", opts['ssh'])

    if opts.get('remotecmd'):

        ui.setconfig("ui", "remotecmd", opts['remotecmd'])

def show_version(ui):

    """output version and copyright information"""

    ui.write(_("Mercurial Distributed SCM (version %s)\n")

             % version.get_version())

    ui.status(_(

        "\nCopyright (C) 2005, 2006 Matt Mackall <mpm@selenic.com>\n"

        "This is free software; see the source for copying conditions. "

        "There is NO\nwarranty; "

        "not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n"

    ))

def help_(ui, name=None, with_version=False):

    """show help for a command, extension, or list of commands

    With no arguments, print a list of commands and short help.

    Given a command name, print help for that command.

    Given an extension name, print help for that extension, and the

    commands it provides."""

    option_lists = []

    def helpcmd(name):

        if with_version:

            show_version(ui)

            ui.write('\n')

        aliases, i = findcmd(ui, name)

        # synopsis

        ui.write("%s\n\n" % i[2])

        # description

        doc = i[0].__doc__

        if not doc:

            doc = _("(No help text available)")

        if ui.quiet:

            doc = doc.splitlines(0)[0]

        ui.write("%s\n" % doc.rstrip())

        if not ui.quiet:

            # aliases

            if len(aliases) > 1:

                ui.write(_("\naliases: %s\n") % ', '.join(aliases[1:]))

            # options

            if i[1]:

                option_lists.append(("options", i[1]))

    def helplist(select=None):

        h = {}

        cmds = {}

        for c, e in table.items():

            f = c.split("|", 1)[0]

            if select and not select(f):

                continue

            if name == "shortlist" and not f.startswith("^"):

                continue

            f = f.lstrip("^")

            if not ui.debugflag and f.startswith("debug"):

                continue

            doc = e[0].__doc__

            if not doc:

                doc = _("(No help text available)")

            h[f] = doc.splitlines(0)[0].rstrip()

            cmds[f] = c.lstrip("^")

        fns = h.keys()

        fns.sort()

        m = max(map(len, fns))