use crate::prolog_parser::ast::*;
use crate::prolog_parser::parser::*;

use crate::machine::machine_indices::HeapCellValue;
use crate::machine::*;
use crate::rug::ops::Pow;
use crate::rug::Integer;

use std::cell::Cell;
use std::collections::VecDeque;
use std::iter::Rev;
use std::vec::IntoIter;

pub fn fold_by_str<I>(terms: I, mut term: Term, sym: ClauseName) -> Term
where
    I: DoubleEndedIterator<Item = Term>,
{
    for prec in terms.rev() {
        term = Term::Clause(
            Cell::default(),
            sym.clone(),
            vec![Box::new(prec), Box::new(term)],
            None,
        );
    }

    term
}

fn extract_from_list(
    head: Box<Term>,
    tail: Box<Term>,
) -> Result<Rev<IntoIter<Term>>, ParserError>
{
    let mut terms = vec![*head];
    let mut tail = *tail;

    while let Term::Cons(_, head, next_tail) = tail {
        terms.push(*head);
        tail = *next_tail;
    }

    if let Term::Constant(_, Constant::EmptyList) = tail {
        Ok(terms.into_iter().rev())
    } else {
        Err(ParserError::ExpectedTopLevelTerm)
    }
}

#[derive(Debug)]
pub struct TermStream<'a> {
    stack: Vec<Term>,
    pub(crate) wam: &'a mut Machine,
    parser: Parser<'a, Stream>,
    pub(crate) flags: MachineFlags,
    term_expansion_lens: (usize, usize),
    goal_expansion_lens: (usize, usize),
    top_level_terms: Vec<(Term, usize, usize)>, // term, line_num, col_num.
}

#[derive(Debug)]
pub struct ExpansionAdditionResult {
    term_expansion_additions: (Predicate, VecDeque<TopLevel>),
    goal_expansion_additions: (Predicate, VecDeque<TopLevel>),
}

impl ExpansionAdditionResult {
    pub fn take_term_expansions(&mut self) -> (Predicate, VecDeque<TopLevel>) {
        let tes = mem::replace(&mut self.term_expansion_additions.0, Predicate::new());
        let teqs = mem::replace(&mut self.term_expansion_additions.1, VecDeque::from(vec![]));

        (tes, teqs)
    }

    pub fn take_goal_expansions(&mut self) -> (Predicate, VecDeque<TopLevel>) {
        let ges = mem::replace(&mut self.goal_expansion_additions.0, Predicate::new());
        let geqs = mem::replace(&mut self.goal_expansion_additions.1, VecDeque::from(vec![]));

        (ges, geqs)
    }
}

impl<'a> Drop for TermStream<'a> {
    fn drop(&mut self) {
        self.wam.indices.in_situ_code_dir.clear();
        self.wam.indices.in_situ_module_dir.clear();

        self.wam.code_repo.in_situ_code.clear();
        discard_result!(self.rollback_expansion_code());
    }
}

impl<'a> TermStream<'a> {
    pub fn new(
        src: &'a mut ParsingStream<Stream>,
        atom_tbl: TabledData<Atom>,
        flags: MachineFlags,
        wam: &'a mut Machine,
    ) -> Self {
        TermStream {
            stack: Vec::new(),
            term_expansion_lens: wam
                .code_repo
                .term_dir_entry_len((clause_name!("term_expansion"), 2)),
            goal_expansion_lens: wam
                .code_repo
                .term_dir_entry_len((clause_name!("goal_expansion"), 2)),
            wam,
            parser: Parser::new(src, atom_tbl, flags),
            flags,
            top_level_terms: vec![],
        }
    }

    #[inline]
    pub fn top_level_terms(&mut self) -> Vec<(Term, usize, usize)> {
        mem::replace(&mut self.top_level_terms, vec![])
    }

    #[inline]
    pub fn incr_expansion_lens(&mut self, hook: CompileTimeHook, len: usize, queue_len: usize) {
        match hook {
            CompileTimeHook::UserTermExpansion => {
                self.term_expansion_lens.0 += len;
                self.term_expansion_lens.1 += queue_len;
            }
            CompileTimeHook::UserGoalExpansion => {
                self.goal_expansion_lens.0 += len;
                self.goal_expansion_lens.1 += queue_len;
            }
            _ => {}
        }
    }

    #[inline]
    pub fn line_num(&self) -> usize {
        self.parser.line_num()
    }

    #[inline]
    pub fn col_num(&self) -> usize {
        self.parser.col_num()
    }

    #[inline]
    pub fn update_expansion_lens(&mut self) {
        let te_key = (clause_name!("term_expansion"), 2);
        let ge_key = (clause_name!("goal_expansion"), 2);

        let (tes_len, tes_q_len) = self.wam.code_repo.term_dir_entry_len(te_key);

        self.term_expansion_lens.0 = tes_len;
        self.term_expansion_lens.1 = tes_q_len;

        let (ges_len, ges_q_len) = self.wam.code_repo.term_dir_entry_len(ge_key);

        self.goal_expansion_lens.0 = ges_len;
        self.goal_expansion_lens.1 = ges_q_len;
    }

    #[inline]
    pub fn set_atom_tbl(&mut self, atom_tbl: TabledData<Atom>) {
        self.parser.set_atom_tbl(atom_tbl);
    }

    #[inline]
    pub fn eof(&mut self) -> Result<bool, ParserError> {
	    self.parser.devour_whitespace()?; // eliminate dangling comments before checking for EOF.
        Ok(self.stack.is_empty() && self.parser.eof()?)
    }

    pub fn rollback_expansion_code(&mut self) -> Result<ExpansionAdditionResult, ParserError> {
        let te_len = self.term_expansion_lens.0;
        let te_queue_len = self.term_expansion_lens.1;

        let ge_len = self.goal_expansion_lens.0;
        let ge_queue_len = self.goal_expansion_lens.1;

        let term_expansion_additions = self.wam.code_repo.truncate_terms(
            (clause_name!("term_expansion"), 2),
            te_len,
            te_queue_len,
        );

        let goal_expansion_additions = self.wam.code_repo.truncate_terms(
            (clause_name!("goal_expansion"), 2),
            ge_len,
            ge_queue_len,
        );

        self.wam
            .code_repo
            .compile_hook(CompileTimeHook::TermExpansion)?;
        self.wam
            .code_repo
            .compile_hook(CompileTimeHook::GoalExpansion)?;

        Ok(ExpansionAdditionResult {
            term_expansion_additions,
            goal_expansion_additions,
        })
    }

    fn enqueue_term(&mut self, term: Term) -> Result<(), ParserError> {
        match term {
            Term::Cons(_, head, tail) => {
                let iter = extract_from_list(head, tail)?;
                Ok(self.stack.extend(iter))
            }
            Term::Clause(..) | Term::Constant(_, Constant::Atom(..)) => {
                Ok(self.stack.push(term))
            }
            _ => {
                Err(ParserError::ExpectedTopLevelTerm)
            }
        }
    }

    fn parse_expansion_output(
        &self,
        term_string: &str,
        op_dir: &OpDir,
    ) -> Result<Term, ParserError> {
        let mut stream = parsing_stream(term_string.trim().as_bytes())?;
        let mut parser = Parser::new(&mut stream, self.parser.get_atom_tbl(), self.flags);

        parser.read_term(composite_op!(
            false,
            &self.wam.indices.op_dir,
            op_dir
        ))
    }

    pub fn expand_term(&mut self, term: Term, op_dir: &OpDir) -> Result<Term, ParserError> {
        let mut machine_st = MachineState::new();

        self.stack.push(term);

        while let Some(term) = self.stack.pop() {
            match machine_st.try_expand_term(self.wam, &term, CompileTimeHook::TermExpansion) {
                Some(term_string) => {
                    let term = self.parse_expansion_output(term_string.as_str(), op_dir)?;
                    self.enqueue_term(term)?;
                }
                None => {
                    return Ok(term);
                }
            };
        }

        unreachable!()
    }

    pub fn read_term(&mut self, op_dir: &OpDir) -> Result<Term, ParserError> {
        loop {
            if let Some(term) = self.stack.pop() {
                return Ok(self.expand_term(term, op_dir)?);
            }

            self.parser.reset();

            let line_num = self.line_num();
            let col_num = self.col_num();

            let term = self.parser.read_term(composite_op!(
                false,
                &self.wam.indices.op_dir,
                op_dir
            ))?;

            // preserve a copy of the original unexpanded term for warning scans,
            // if that stage is reached.
            self.top_level_terms.push((term.clone(), line_num, col_num));
            self.stack.push(term);
        }
    }

    pub(super)
    fn expand_goals(
        &mut self,
        machine_st: &mut MachineState,
        op_dir: &OpDir,
        mut terms: VecDeque<Term>,
    ) -> Result<Vec<Term>, ParserError> {
        let mut results = vec![];

        while let Some(term) = terms.pop_front() {
            match machine_st.try_expand_term(self.wam, &term, CompileTimeHook::GoalExpansion) {
                Some(term_string) => {
                    let term = self.parse_expansion_output(term_string.as_str(), op_dir)?;

                    match term {
                        Term::Cons(_, head, tail) => {
                            for term in extract_from_list(head, tail)? {
                                terms.push_front(term);
                            }
                        }
                        term => terms.push_front(term),
                    };
                }
                None => results.push(term),
            }
        }

        Ok(results)
    }
}

impl MachineState {
    pub(super)
    fn print_with_locs(&self, addr: Addr, op_dir: &OpDir) -> PrinterOutputter {
        let output = PrinterOutputter::new();
        let mut printer = HCPrinter::from_heap_locs(&self, op_dir, output);
        let mut max_var_length = 0;

        for var in self.heap_locs.keys() {
            max_var_length = std::cmp::max(var.len(), max_var_length);
        }

        printer.quoted = true;
        printer.numbervars = true;

        // the purpose of the offset is to avoid clashes with variable
        // names that might occur after the addresses in the expanded
        // term are substituted with the variable names in the
        // pre-expansion term. This formula ensures that all generated
        // "numbervars"- style variable names will be longer than the
        // keys of the var_dict, and therefore not equal to any of
        // them.
        printer.numbervars_offset = Integer::from(10).pow(max_var_length as u32) * 26;
        printer.print_strings_as_strs = true;
        printer.drop_toplevel_spec();

        printer.see_all_locs();

        let mut output = printer.print(addr);

        output.push_char('.');
        output
    }

    // reset the machine, but keep the heap contents as they were.
    // this prevents clashes between underscored variable names in the
    // same query.
    fn reset_with_heap_preservation(&mut self) {
        let heap = self.heap.take();
        self.reset();
        self.heap = heap;
    }

    fn try_expand_term(
        &mut self,
        wam: &mut Machine,
        term: &Term,
        hook: CompileTimeHook,
    ) -> Option<String> {
        let term_write_result = write_term_to_heap(term, self);
        let h = self.heap.h();

        self[temp_v!(1)] = Addr::HeapCell(term_write_result.heap_loc);
        self.heap.push(HeapCellValue::Addr(Addr::HeapCell(h)));
        self[temp_v!(2)] = Addr::HeapCell(h);

        let code = vec![call_clause!(ClauseType::Hook(hook), 2, 0, true)];
        wam.code_repo.cached_query = code;

        self.cp = LocalCodePtr::TopLevel(0, 0);

        self.at_end_of_expansion = false;
        self.flags.double_quotes = DoubleQuotes::Chars;

        self.query_stepper(
            &mut wam.indices,
            &mut MachinePolicies::default(),
            &mut wam.code_repo,
            &mut readline::input_stream(),
            &mut Stream::stdout(),
        );

        if self.fail || self.at_end_of_expansion {
            self.reset_with_heap_preservation();
            None
        } else {
            let TermWriteResult { var_dict, .. } = term_write_result;

            self.heap_locs = var_dict;
            let output = self.print_with_locs(Addr::HeapCell(h), &wam.indices.op_dir);

            self.reset_with_heap_preservation();

            Some(output.result())
        }
    }
}