# hg.py - repository classes 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.

import sys, struct, os

from revlog import *

from demandload import *

demandload(globals(), "re lock urllib urllib2 transaction time socket")

demandload(globals(), "tempfile byterange difflib")

def is_exec(f):

    return (os.stat(f).st_mode & 0100 != 0)

def set_exec(f, mode):

    s = os.stat(f).st_mode

    if (s & 0100 != 0) == mode:

        return

    if mode:

        # Turn on +x for every +r bit when making a file executable

        # and obey umask.

        umask = os.umask(0)

        os.umask(umask)

        os.chmod(f, s | (s & 0444) >> 2 & ~umask)

    else:

        os.chmod(f, s & 0666)

class filelog(revlog):

    def __init__(self, opener, path):

        revlog.__init__(self, opener,

                        os.path.join("data", path + ".i"),

                        os.path.join("data", path + ".d"))

    def read(self, node):

        return self.revision(node)

    def add(self, text, transaction, link, p1=None, p2=None):

        return self.addrevision(text, transaction, link, p1, p2)

    def annotate(self, node):

        def decorate(text, rev):

            return [(rev, l) for l in text.splitlines(1)]

        def strip(annotation):

            return [e[1] for e in annotation]

        def pair(parent, child):

            new = []

            sm = difflib.SequenceMatcher(None, strip(parent), strip(child))

            for o, m, n, s, t in sm.get_opcodes():

                if o == 'equal':

                    new += parent[m:n]

                else:

                    new += child[s:t]

            return new

        # find all ancestors

        needed = {node:1}

        visit = [node]

        while visit:

            n = visit.pop(0)

            for p in self.parents(n):

                if p not in needed:

                    needed[p] = 1

                    visit.append(p)

                else:

                    # count how many times we'll use this

                    needed[p] += 1

        # sort by revision which is a topological order

        visit = needed.keys()

        visit = [ (self.rev(n), n) for n in visit ]

        visit.sort()

        visit = [ p[1] for p in visit ]

        hist = {}

        for n in visit:

            curr = decorate(self.read(n), self.linkrev(n))

            for p in self.parents(n):

                if p != nullid:

                    curr = pair(hist[p], curr)

                    # trim the history of unneeded revs

                    needed[p] -= 1

                    if not needed[p]:

                        del hist[p]

            hist[n] = curr

        return hist[n]

class manifest(revlog):

    def __init__(self, opener):

        self.mapcache = None

        self.listcache = None

        self.addlist = None

        revlog.__init__(self, opener, "00manifest.i", "00manifest.d")

    def read(self, node):

        if self.mapcache and self.mapcache[0] == node:

            return self.mapcache[1].copy()

        text = self.revision(node)

        map = {}

        flag = {}

        self.listcache = (text, text.splitlines(1))

        for l in self.listcache[1]:

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

            map[f] = bin(n[:40])

            flag[f] = (n[40:-1] == "x")

        self.mapcache = (node, map, flag)

        return map

    def readflags(self, node):

        if self.mapcache or self.mapcache[0] != node:

            self.read(node)

        return self.mapcache[2]

    def diff(self, a, b):

        # this is sneaky, as we're not actually using a and b

        if self.listcache and self.addlist and self.listcache[0] == a:

            d = mdiff.diff(self.listcache[1], self.addlist, 1)

            if mdiff.patch(a, d) != b:

                sys.stderr.write("*** sortdiff failed, falling back ***\n")

                return mdiff.textdiff(a, b)

            return d

        else:

            return mdiff.textdiff(a, b)

    def add(self, map, flags, transaction, link, p1=None, p2=None):

        files = map.keys()

        files.sort()

        self.addlist = ["%s\000%s%s\n" %

                        (f, hex(map[f]), flags[f] and "x" or '')

                        for f in files]

        text = "".join(self.addlist)

        n = self.addrevision(text, transaction, link, p1, p2)

        self.mapcache = (n, map)

        self.listcache = (text, self.addlist)

        self.addlist = None

        return n

class changelog(revlog):

    def __init__(self, opener):

        revlog.__init__(self, opener, "00changelog.i", "00changelog.d")

    def extract(self, text):

        if not text:

            return (nullid, "", "0", [], "")

        last = text.index("\n\n")

        desc = text[last + 2:]

        l = text[:last].splitlines()

        manifest = bin(l[0])

        user = l[1]

        date = l[2]

        files = l[3:]

        return (manifest, user, date, files, desc)

    def read(self, node):

        return self.extract(self.revision(node))

    def add(self, manifest, list, desc, transaction, p1=None, p2=None,

                  user=None, date=None):

        user = (user or

                os.environ.get("HGUSER") or

                os.environ.get("EMAIL") or

                os.environ.get("LOGNAME", "unknown") + '@' + socket.getfqdn())

        date = date or "%d %d" % (time.time(), time.timezone)

        list.sort()

        l = [hex(manifest), user, date] + list + ["", desc]

        text = "\n".join(l)

        return self.addrevision(text, transaction, self.count(), p1, p2)

class dirstate:

    def __init__(self, opener, ui, root):

        self.opener = opener

        self.root = root

        self.dirty = 0

        self.ui = ui

        self.map = None

        self.pl = None

    def __del__(self):

        if self.dirty:

            self.write()

    def __getitem__(self, key):

        try:

            return self.map[key]

        except TypeError:

            self.read()

            return self[key]

    def __contains__(self, key):

        if not self.map: self.read()

        return key in self.map

    def parents(self):

        if not self.pl:

            self.read()

        return self.pl

    def setparents(self, p1, p2 = nullid):

        self.dirty = 1

        self.pl = p1, p2

    def state(self, key):

        try:

            return self[key][0]

        except KeyError:

            return "?"

    def read(self):

        if self.map is not None: return self.map

        self.map = {}

        self.pl = [nullid, nullid]

        try:

            st = self.opener("dirstate").read()

        except: return

        self.pl = [st[:20], st[20: 40]]

        pos = 40

        while pos < len(st):

            e = struct.unpack(">cllll", st[pos:pos+17])

            l = e[4]

            pos += 17

            f = st[pos:pos + l]

            self.map[f] = e[:4]

            pos += l

    def update(self, files, state):

        ''' current states:

        n  normal

        m  needs merging

        r  marked for removal

        a  marked for addition'''

        if not files: return

        self.read()

        self.dirty = 1

        for f in files:

            if state == "r":

                self.map[f] = ('r', 0, 0, 0)

            else:

                s = os.stat(os.path.join(self.root, f))

                self.map[f] = (state, s.st_mode, s.st_size, s.st_mtime)

    def forget(self, files):

        if not files: return

        self.read()

        self.dirty = 1

        for f in files:

            try:

                del self.map[f]

            except KeyError:

                self.ui.warn("not in dirstate: %s!\n" % f)

                pass

    def clear(self):

        self.map = {}

        self.dirty = 1

    def write(self):

        st = self.opener("dirstate", "w")

        st.write("".join(self.pl))

        for f, e in self.map.items():

            e = struct.pack(">cllll", e[0], e[1], e[2], e[3], len(f))

            st.write(e + f)

        self.dirty = 0

    def copy(self):

        self.read()

        return self.map.copy()

# used to avoid circular references so destructors work

def opener(base):

    p = base

    def o(path, mode="r"):

        if p[:7] == "http://":

            f = os.path.join(p, urllib.quote(path))

            return httprangereader(f)

        f = os.path.join(p, path)

        mode += "b" # for that other OS

        if mode[0] != "r":

            try:

                s = os.stat(f)

            except OSError:

                d = os.path.dirname(f)

                if not os.path.isdir(d):

                    os.makedirs(d)

            else:

                if s.st_nlink > 1:

                    file(f + ".tmp", "w").write(file(f).read())

                    os.rename(f+".tmp", f)

        return file(f, mode)

    return o

class localrepository:

    def __init__(self, ui, path=None, create=0):

        self.remote = 0

        if path and path[:7] == "http://":

            self.remote = 1

            self.path = path

        else:

            if not path:

                p = os.getcwd()

                while not os.path.isdir(os.path.join(p, ".hg")):

                    p = os.path.dirname(p)

                    if p == "/": raise "No repo found"

                path = p

            self.path = os.path.join(path, ".hg")

        self.root = path

        self.ui = ui

        if create:

            os.mkdir(self.path)  

            os.mkdir(self.join("data"))

        self.opener = opener(self.path)

        self.wopener = opener(self.root)

        self.manifest = manifest(self.opener)

        self.changelog = changelog(self.opener)

        self.ignorelist = None

        self.tags = None

        if not self.remote:

            self.dirstate = dirstate(self.opener, ui, self.root)

    def ignore(self, f):

        if self.ignorelist is None:

            self.ignorelist = []

            try:

                l = self.wfile(".hgignore")

                for pat in l:

                    if pat != "\n":

                        self.ignorelist.append(re.compile(pat[:-1]))

            except IOError: pass

        for pat in self.ignorelist:

            if pat.search(f): return True

        return False

    def lookup(self, key):

        if self.tags is None:

            self.tags = {}

            try:

                # read each head of the tags file, ending with the tip

                # and add each tag found to the map, with "newer" ones

                # taking precedence

                fl = self.file(".hgtags")

                h = fl.heads()

                h.reverse()

                for r in h:

                    for l in fl.revision(r).splitlines():

                        if l:

                            n, k = l.split(" ")

                            self.tags[k] = bin(n)

            except KeyError: pass

        try:

            return self.tags[key]

        except KeyError:

            return self.changelog.lookup(key)

    def join(self, f):

        return os.path.join(self.path, f)

    def wjoin(self, f):

        return os.path.join(self.root, f)

    def file(self, f):

        if f[0] == '/': f = f[1:]

        return filelog(self.opener, f)

    def wfile(self, f, mode='r'):

        return self.wopener(f, mode)

    def transaction(self):

        # save dirstate for undo

        try:

            ds = self.opener("dirstate").read()

        except IOError:

            ds = ""

        self.opener("undo.dirstate", "w").write(ds)

        return transaction.transaction(self.opener, self.join("journal"),

                                       self.join("undo"))

    def recover(self):

        lock = self.lock()

        if os.path.exists(self.join("recover")):

            self.ui.status("attempting to rollback interrupted transaction\n")

            return transaction.rollback(self.opener, self.join("recover"))

        else:

            self.ui.warn("no interrupted transaction available\n")

    def undo(self):

        lock = self.lock()

        if os.path.exists(self.join("undo")):

            self.ui.status("attempting to rollback last transaction\n")

            transaction.rollback(self.opener, self.join("undo"))

            self.dirstate = None

            os.rename(self.join("undo.dirstate"), self.join("dirstate"))

            self.dirstate = dirstate(self.opener, self.ui, self.root)

        else:

            self.ui.warn("no undo information available\n")

    def lock(self, wait = 1):

        try:

            return lock.lock(self.join("lock"), 0)

        except lock.LockHeld, inst:

            if wait:

                self.ui.warn("waiting for lock held by %s\n" % inst.args[0])

                return lock.lock(self.join("lock"), wait)

            raise inst

    def rawcommit(self, files, text, user, date, p1=None, p2=None):

        p1 = p1 or self.dirstate.parents()[0] or nullid

        p2 = p2 or self.dirstate.parents()[1] or nullid

        pchange = self.changelog.read(p1)

        pmmap = self.manifest.read(pchange[0])

        tr = self.transaction()

        mmap = {}

        linkrev = self.changelog.count()

        for f in files:

            try:

                t = file(f).read()

            except IOError:

                self.ui.warn("Read file %s error, skipped\n" % f)

                continue

            r = self.file(f)

            # FIXME - need to find both parents properly

            prev = pmmap.get(f, nullid)

            mmap[f] = r.add(t, tr, linkrev, prev)

        mnode = self.manifest.add(mmap, tr, linkrev, pchange[0])

        n = self.changelog.add(mnode, files, text, tr, p1, p2, user ,date, )

        tr.close()

        self.dirstate.setparents(p1, p2)

        self.dirstate.clear()

        self.dirstate.update(mmap.keys(), "n")

    def commit(self, files = None, text = ""):

        commit = []

        remove = []

        if files:

            for f in files:

                s = self.dirstate.state(f)

                if s in 'nmai':

                    commit.append(f)

                elif s == 'r':

                    remove.append(f)

                else:

                    self.ui.warn("%s not tracked!\n" % f)

        else:

            (c, a, d, u) = self.diffdir(self.root)

            commit = c + a

            remove = d

        if not commit and not remove:

            self.ui.status("nothing changed\n")

            return

        p1, p2 = self.dirstate.parents()

        c1 = self.changelog.read(p1)

        c2 = self.changelog.read(p2)

        m1 = self.manifest.read(c1[0])

        mf1 = self.manifest.readflags(c1[0])

        m2 = self.manifest.read(c2[0])

        lock = self.lock()

        tr = self.transaction()

        # check in files

        new = {}

        linkrev = self.changelog.count()

        commit.sort()

        for f in commit:

            self.ui.note(f + "\n")

            try:

                fp = self.wjoin(f)

                mf1[f] = is_exec(fp)

                t = file(fp).read()

            except IOError:

                self.warn("trouble committing %s!\n" % f)

                raise