// revlog.rs

//

// Copyright 2019-2020 Georges Racinet <georges.racinet@octobus.net>

//

// This software may be used and distributed according to the terms of the

// GNU General Public License version 2 or any later version.

use crate::{

    cindex,

    conversion::{rev_pyiter_collect, rev_pyiter_collect_or_else},

    utils::{node_from_py_bytes, node_from_py_object},

    PyRevision,

};

use cpython::{

    buffer::{Element, PyBuffer},

    exc::{IndexError, ValueError},

    ObjectProtocol, PyBool, PyBytes, PyClone, PyDict, PyErr, PyInt, PyList,

    PyModule, PyObject, PyResult, PySet, PyString, PyTuple, Python,

    PythonObject, ToPyObject,

};

use hg::{

    errors::HgError,

    index::{IndexHeader, Phase, RevisionDataParams, SnapshotsCache},

    nodemap::{Block, NodeMapError, NodeTree},

    revlog::{nodemap::NodeMap, NodePrefix, RevlogError, RevlogIndex},

    BaseRevision, Revision, UncheckedRevision, NULL_REVISION,

};

use std::{cell::RefCell, collections::HashMap};

/// Return a Struct implementing the Graph trait

pub(crate) fn pyindex_to_graph(

    py: Python,

    index: PyObject,

) -> PyResult<cindex::Index> {

    match index.extract::<MixedIndex>(py) {

        Ok(midx) => Ok(midx.clone_cindex(py)),

        Err(_) => cindex::Index::new(py, index),

    }

}

py_class!(pub class MixedIndex |py| {

    data cindex: RefCell<cindex::Index>;

    data index: RefCell<hg::index::Index>;

    data nt: RefCell<Option<NodeTree>>;

    data docket: RefCell<Option<PyObject>>;

    // Holds a reference to the mmap'ed persistent nodemap data

    data nodemap_mmap: RefCell<Option<PyBuffer>>;

    // Holds a reference to the mmap'ed persistent index data

    data index_mmap: RefCell<Option<PyBuffer>>;

    def __new__(

        _cls,

        cindex: PyObject,

        data: PyObject,

        default_header: u32,

    ) -> PyResult<MixedIndex> {

        Self::new(py, cindex, data, default_header)

    }

    /// Compatibility layer used for Python consumers needing access to the C index

    ///

    /// Only use case so far is `scmutil.shortesthexnodeidprefix`,

    /// that may need to build a custom `nodetree`, based on a specified revset.

    /// With a Rust implementation of the nodemap, we will be able to get rid of

    /// this, by exposing our own standalone nodemap class,

    /// ready to accept `MixedIndex`.

    def get_cindex(&self) -> PyResult<PyObject> {

        Ok(self.cindex(py).borrow().inner().clone_ref(py))

    }

    // Index API involving nodemap, as defined in mercurial/pure/parsers.py

    /// Return Revision if found, raises a bare `error.RevlogError`

    /// in case of ambiguity, same as C version does

    def get_rev(&self, node: PyBytes) -> PyResult<Option<PyRevision>> {

        let opt = self.get_nodetree(py)?.borrow();

        let nt = opt.as_ref().unwrap();

        let idx = &*self.cindex(py).borrow();

        let ridx = &*self.index(py).borrow();

        let node = node_from_py_bytes(py, &node)?;

        let rust_rev =

            nt.find_bin(ridx, node.into()).map_err(|e| nodemap_error(py, e))?;

        let c_rev =

            nt.find_bin(idx, node.into()).map_err(|e| nodemap_error(py, e))?;

        assert_eq!(rust_rev, c_rev);

        Ok(rust_rev.map(Into::into))

    }

    /// same as `get_rev()` but raises a bare `error.RevlogError` if node

    /// is not found.

    ///

    /// No need to repeat `node` in the exception, `mercurial/revlog.py`

    /// will catch and rewrap with it

    def rev(&self, node: PyBytes) -> PyResult<PyRevision> {

        self.get_rev(py, node)?.ok_or_else(|| revlog_error(py))

    }

    /// return True if the node exist in the index

    def has_node(&self, node: PyBytes) -> PyResult<bool> {

        // TODO OPTIM we could avoid a needless conversion here,

        // to do when scaffolding for pure Rust switch is removed,

        // as `get_rev()` currently does the necessary assertions

        self.get_rev(py, node).map(|opt| opt.is_some())

    }

    /// find length of shortest hex nodeid of a binary ID

    def shortest(&self, node: PyBytes) -> PyResult<usize> {

        let opt = self.get_nodetree(py)?.borrow();

        let nt = opt.as_ref().unwrap();

        let idx = &*self.index(py).borrow();

        match nt.unique_prefix_len_node(idx, &node_from_py_bytes(py, &node)?)

        {

            Ok(Some(l)) => Ok(l),

            Ok(None) => Err(revlog_error(py)),

            Err(e) => Err(nodemap_error(py, e)),

        }

    }

    def partialmatch(&self, node: PyObject) -> PyResult<Option<PyBytes>> {

        let opt = self.get_nodetree(py)?.borrow();

        let nt = opt.as_ref().unwrap();

        let idx = &*self.index(py).borrow();

        let node_as_string = if cfg!(feature = "python3-sys") {

            node.cast_as::<PyString>(py)?.to_string(py)?.to_string()

        }

        else {

            let node = node.extract::<PyBytes>(py)?;

            String::from_utf8_lossy(node.data(py)).to_string()

        };

        let prefix = NodePrefix::from_hex(&node_as_string)

            .map_err(|_| PyErr::new::<ValueError, _>(

                py, format!("Invalid node or prefix '{}'", node_as_string))

            )?;

        nt.find_bin(idx, prefix)

            // TODO make an inner API returning the node directly

            .map(|opt| opt.map(

                |rev| PyBytes::new(py, idx.node(rev).unwrap().as_bytes())))

            .map_err(|e| nodemap_error(py, e))

    }

    /// append an index entry

    def append(&self, tup: PyTuple) -> PyResult<PyObject> {

        if tup.len(py) < 8 {

            // this is better than the panic promised by tup.get_item()

            return Err(

                PyErr::new::<IndexError, _>(py, "tuple index out of range"))

        }

        let node_bytes = tup.get_item(py, 7).extract(py)?;

        let node = node_from_py_object(py, &node_bytes)?;

        let rev = self.len(py)? as BaseRevision;

        let mut idx = self.cindex(py).borrow_mut();

        // This is ok since we will just add the revision to the index

        let rev = Revision(rev);

        idx.append(py, tup.clone_ref(py))?;

        self.index(py)

            .borrow_mut()

            .append(py_tuple_to_revision_data_params(py, tup)?)

            .unwrap();

        self.get_nodetree(py)?.borrow_mut().as_mut().unwrap()

            .insert(&*idx, &node, rev)

            .map_err(|e| nodemap_error(py, e))?;

        Ok(py.None())

    }

    def __delitem__(&self, key: PyObject) -> PyResult<()> {

        // __delitem__ is both for `del idx[r]` and `del idx[r1:r2]`

        self.cindex(py).borrow().inner().del_item(py, &key)?;

        let start = key.getattr(py, "start")?;

        let start = UncheckedRevision(start.extract(py)?);

        let start = self.index(py)

            .borrow()

            .check_revision(start)

            .ok_or_else(|| {

                nodemap_error(py, NodeMapError::RevisionNotInIndex(start))

            })?;

        self.index(py).borrow_mut().remove(start).unwrap();

        let mut opt = self.get_nodetree(py)?.borrow_mut();

        let nt = opt.as_mut().unwrap();

        nt.invalidate_all();

        self.fill_nodemap(py, nt)?;

        Ok(())

    }

    //

    // Reforwarded C index API

    //

    // index_methods (tp_methods). Same ordering as in revlog.c

    /// return the gca set of the given revs

    def ancestors(&self, *args, **kw) -> PyResult<PyObject> {

    }

    /// return the heads of the common ancestors of the given revs

    def commonancestorsheads(&self, *args, **kw) -> PyResult<PyObject> {

    }

    /// Clear the index caches and inner py_class data.

    /// It is Python's responsibility to call `update_nodemap_data` again.

    def clearcaches(&self, *args, **kw) -> PyResult<PyObject> {

        self.nt(py).borrow_mut().take();

        self.docket(py).borrow_mut().take();

        self.nodemap_mmap(py).borrow_mut().take();

        self.index(py).borrow_mut().clear_caches();

        self.call_cindex(py, "clearcaches", args, kw)

    }

    /// return the raw binary string representing a revision

    def entry_binary(&self, *args, **kw) -> PyResult<PyObject> {

        let rindex = self.index(py).borrow();

        let rev = UncheckedRevision(args.get_item(py, 0).extract(py)?);

        let rust_bytes = rindex.check_revision(rev).and_then(

            |r| rindex.entry_binary(r))

            .ok_or_else(|| rev_not_in_index(py, rev))?;

        let rust_res = PyBytes::new(py, rust_bytes).into_object();

        let c_res = self.call_cindex(py, "entry_binary", args, kw)?;

        assert_py_eq(py, "entry_binary", &rust_res, &c_res)?;

        Ok(rust_res)

    }

    /// return a binary packed version of the header

    def pack_header(&self, *args, **kw) -> PyResult<PyObject> {

        let rindex = self.index(py).borrow();

        let packed = rindex.pack_header(args.get_item(py, 0).extract(py)?);

        let rust_res = PyBytes::new(py, &packed).into_object();

        let c_res = self.call_cindex(py, "pack_header", args, kw)?;

        assert_py_eq(py, "pack_header", &rust_res, &c_res)?;

        Ok(rust_res)

    }

    /// compute phases

    def computephasesmapsets(&self, *args, **kw) -> PyResult<PyObject> {

        let py_roots = args.get_item(py, 0).extract::<PyDict>(py)?;

        let rust_res = self.inner_computephasesmapsets(py, py_roots)?;

        let c_res = self.call_cindex(py, "computephasesmapsets", args, kw)?;

        assert_py_eq(py, "computephasesmapsets", &rust_res, &c_res)?;

        Ok(rust_res)

    }

    /// reachableroots

    def reachableroots2(&self, *args, **kw) -> PyResult<PyObject> {

        let rust_res = self.inner_reachableroots2(

            py,

            UncheckedRevision(args.get_item(py, 0).extract(py)?),

            args.get_item(py, 1),

            args.get_item(py, 2),

            args.get_item(py, 3).extract(py)?,

        )?;

        let c_res = self.call_cindex(py, "reachableroots2", args, kw)?;

        // ordering of C result depends on how the computation went, and

        // Rust result ordering is arbitrary. Hence we compare after

        // sorting the results (in Python to avoid reconverting everything

        // back to Rust structs).

        assert_py_eq_normalized(py, "reachableroots2", &rust_res, &c_res,

                                |v| format!("sorted({})", v))?;

        Ok(rust_res)

    }

    /// get head revisions

    def headrevs(&self, *args, **kw) -> PyResult<PyObject> {

        let rust_res = self.inner_headrevs(py)?;

        let c_res = self.call_cindex(py, "headrevs", args, kw)?;

        assert_py_eq(py, "headrevs", &rust_res, &c_res)?;

        Ok(rust_res)

    }

    /// get filtered head revisions

    def headrevsfiltered(&self, *args, **kw) -> PyResult<PyObject> {

        let rust_res = self.inner_headrevsfiltered(py, &args.get_item(py, 0))?;

        let c_res = self.call_cindex(py, "headrevsfiltered", args, kw)?;

        assert_py_eq(py, "headrevsfiltered", &rust_res, &c_res)?;

        Ok(rust_res)

    }

    /// True if the object is a snapshot

    def issnapshot(&self, *args, **kw) -> PyResult<bool> {

        let index = self.index(py).borrow();

        let result = index

            .is_snapshot(UncheckedRevision(args.get_item(py, 0).extract(py)?))

            .map_err(|e| {