# 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 shutil imp urllib pdb")

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

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

demandload(globals(), "archival cStringIO changegroup")

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, unknown = repo.changes()

    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 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='', badmatch=None):

    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,

                                 badmatch=badmatch):

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

    return files, matchfn, walk()

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

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

    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)

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

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

        return [], False, matchfn

    if follow:

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

        if p == nullid:

            ui.warn(_('No working directory revision; defaulting to tip\n'))

            start = 'tip'

        else:

            start = repo.changelog.rev(p)

        defrange = '%s:0' % start

    else:

        defrange = 'tip:0'

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

    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))

    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, -1):

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

        class followfilter:

            def __init__(self, onlyfirst=False):

                self.startrev = -1

                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 != -1, repo.changelog.parentrevs(rev))

                if self.startrev == -1:

                    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

        if follow and not files:

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

            def want(rev):

                if rev not in wanted:

                    return False

                return ff.match(rev)

        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) or filter(matchfn, getchange(rev)[3])

                yield 'add', rev, fns

            for rev in nrevs:

                yield 'iter', rev, None

    return iterate(), getchange, matchfn

revrangesep = ':'

def revfix(repo, val, defval):

    '''turn user-level id of changeset into rev number.

    user-level id can be tag, changeset, rev number, or negative rev

    number relative to number of revs (-1 is tip, etc).'''

    if not val:

        return defval

    try:

        num = int(val)

        if str(num) != val:

            raise ValueError

        if num < 0:

            num += repo.changelog.count()

        if num < 0:

            num = 0

        elif num >= repo.changelog.count():

            raise ValueError

    except ValueError:

        try:

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

        except KeyError:

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

    return num

def revpair(ui, repo, revs):

    '''return pair of nodes, given list of revisions. second item can

    be None, meaning use working dir.'''

    if not revs:

        return repo.dirstate.parents()[0], None

    end = None

    if len(revs) == 1:

        start = revs[0]

        if revrangesep in start:

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

            start = revfix(repo, start, 0)

            end = revfix(repo, end, repo.changelog.count() - 1)

        else:

            start = revfix(repo, start, None)

    elif len(revs) == 2:

        if revrangesep in revs[0] or revrangesep in revs[1]:

            raise util.Abort(_('too many revisions specified'))

        start = revfix(repo, revs[0], None)

        end = revfix(repo, revs[1], None)

    else:

        raise util.Abort(_('too many revisions specified'))

    if end is not None: end = repo.lookup(str(end))

    return repo.lookup(str(start)), end

def revrange(ui, repo, revs):

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

    seen = {}

    for spec in revs:

        if revrangesep in spec:

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

            start = revfix(repo, start, 0)

            end = revfix(repo, end, repo.changelog.count() - 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 = revfix(repo, spec, None)

            if rev in seen:

                continue

            seen[rev] = 1

            yield str(rev)

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