# 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

import util

from revlog import *

from demandload import *

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

demandload(globals(), "tempfile httprangereader bdiff")

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

        t = self.revision(node)

        if t[:2] != '\1\n':

            return t

        s = t.find('\1\n', 2)

        return t[s+2:]

    def readmeta(self, node):

        t = self.revision(node)

        if t[:2] != '\1\n':

            return t

        s = t.find('\1\n', 2)

        mt = t[2:s]

        for l in mt.splitlines():

            k, v = l.split(": ", 1)

            m[k] = v

        return m

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

        if meta or text[:2] == '\1\n':

            mt = ""

            if meta:

                mt = [ "%s: %s\n" % (k, v) for k,v in meta.items() ]

            text = "\1\n" + "".join(mt) + "\1\n" + text

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

    def annotate(self, node):

        def decorate(text, rev):

            return ([rev] * len(text.splitlines()), text)

        def pair(parent, child):

            for a1, a2, b1, b2 in bdiff.blocks(parent[1], child[1]):

                child[0][b1:b2] = parent[0][a1:a2]

            return child

        # 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 = [ (self.rev(n), n) for n in needed.keys() ]

        visit.sort()

        hist = {}

        for r,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 zip(hist[n][0], hist[n][1].splitlines(1))

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 node == nullid: return {} # don't upset local cache

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

            return self.mapcache[1]

        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 node == nullid: return {} # don't upset local cache

        if not 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, flags)

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

        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

        self.copies = {}

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

            if not st: return

        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]

            if '\0' in f:

                f, c = f.split('\0')

                self.copies[f] = c

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

            pos += l

    def copy(self, source, dest):

        self.read()

        self.dirty = 1

        self.copies[dest] = source

    def copied(self, file):

        return self.copies.get(file, None)

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

            c = self.copied(f)

            if c:

                f = f + "\0" + c

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

            st.write(e + f)

        self.dirty = 0

    def changes(self, files, ignore):

        self.read()

        dc = self.map.copy()

        lookup, changed, added, unknown = [], [], [], []

        # compare all files by default

        if not files: files = [self.root]

        # recursive generator of all files listed

        def walk(files):

            for f in util.unique(files):

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

                if os.path.isdir(f):

                    for dir, subdirs, fl in os.walk(f):

                        d = dir[len(self.root) + 1:]

                        if ".hg" in subdirs: subdirs.remove(".hg")

                        for fn in fl:

                            fn = util.pconvert(os.path.join(d, fn))

                            yield fn

                else:

                    yield f[len(self.root) + 1:]

        for fn in util.unique(walk(files)):

            try: s = os.stat(os.path.join(self.root, fn))

            except: continue

            if fn in dc:

                c = dc[fn]

                del dc[fn]

                if c[0] == 'm':

                    changed.append(fn)

                elif c[0] == 'a':

                    added.append(fn)

                elif c[0] == 'r':

                    unknown.append(fn)

                elif c[2] != s.st_size or (c[1] ^ s.st_mode) & 0100:

                    changed.append(fn)

                elif c[1] != s.st_mode or c[3] != s.st_mtime:

                    lookup.append(fn)

            else:

                if not ignore(fn): unknown.append(fn)

        return (lookup, changed, added, dc.keys(), unknown)

# 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.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", "wb").write(file(f, "rb").read())

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

        return file(f, mode)

    return o

class RepoError(Exception): pass

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

                    oldp = p

                    p = os.path.dirname(p)

                    if p == oldp: raise RepoError("no repo found")

                path = p

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

            if not create and not os.path.isdir(self.path):

                raise RepoError("repository %s not found" % self.path)

        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.tagscache = None

        self.nodetagscache = None

        if not self.remote:

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

            try:

                self.ui.readconfig(self.opener("hgrc"))

            except IOError: pass

    def ignore(self, f):

        if self.ignorelist is None:

            self.ignorelist = []

            try:

                l = file(self.wjoin(".hgignore"))

                for pat in l:

                    if pat != "\n":

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

            except IOError: pass

        for pat in self.ignorelist:

            if pat.search(f): return True

        return False

    def hook(self, name, **args):

        s = self.ui.config("hooks", name)

        if s:

            self.ui.note("running hook %s: %s\n" % (name, s))

            old = {}

            for k, v in args.items():

                k = k.upper()

                old[k] = os.environ.get(k, None)

                os.environ[k] = v

            r = os.system(s)

            for k, v in old.items():

                if v != None:

                    os.environ[k] = v

                else:

                    del os.environ[k]

            if r:

                self.ui.warn("abort: %s hook failed with status %d!\n" %

                             (name, r))

                return False

        return True

    def tags(self):

        '''return a mapping of tag to node'''

        if not self.tagscache:

            self.tagscache = {}

            def addtag(self, k, n):

                try:

                    bin_n = bin(n)

                except TypeError:

                    bin_n = ''

                self.tagscache[k.strip()] = bin_n

            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(" ", 1)

                            addtag(self, k, n)

            except KeyError:

                pass

            try:

                f = self.opener("localtags")

                for l in f:

                    n, k = l.split(" ", 1)

                    addtag(self, k, n)

            except IOError:

                pass

            self.tagscache['tip'] = self.changelog.tip()

        return self.tagscache

    def tagslist(self):

        '''return a list of tags ordered by revision'''

        l = []

        for t, n in self.tags().items():

            try:

                r = self.changelog.rev(n)

            except:

                r = -2 # sort to the beginning of the list if unknown

            l.append((r,t,n))

        l.sort()

        return [(t,n) for r,t,n in l]

    def nodetags(self, node):

        '''return the tags associated with a node'''

        if not self.nodetagscache:

            self.nodetagscache = {}

            for t,n in self.tags().items():

                self.nodetagscache.setdefault(n,[]).append(t)

        return self.nodetagscache.get(node, [])