// Copyright (c) Microsoft Corporation.
// Licensed under the MIT License.

use std::{
    collections::hash_map::Entry,
    fmt::Display,
    ops::Add,
    sync::{Arc, RwLock, RwLockReadGuard},
};

use num_traits::FromPrimitive;
use rustc_hash::{FxHashMap, FxHashSet};
use serde::{Deserialize, Serialize};

use crate::Property;
use crate::trace::instruction_ids::instruction_name;

pub mod property_keys;

mod provenance;
pub use provenance::ProvenanceGraph;

#[cfg(test)]
mod tests;

#[derive(Clone)]
pub struct ISA {
    graph: Arc<RwLock<ProvenanceGraph>>,
    nodes: FxHashMap<u64, usize>,
}

impl Default for ISA {
    fn default() -> Self {
        ISA {
            graph: Arc::new(RwLock::new(ProvenanceGraph::new())),
            nodes: FxHashMap::default(),
        }
    }
}

impl ISA {
    #[must_use]
    pub fn new() -> Self {
        Self::default()
    }

    /// Creates an ISA backed by the given shared provenance graph.
    #[must_use]
    pub fn with_graph(graph: Arc<RwLock<ProvenanceGraph>>) -> Self {
        ISA {
            graph,
            nodes: FxHashMap::default(),
        }
    }

    /// Returns a reference to the shared provenance graph.
    #[must_use]
    pub fn graph(&self) -> &Arc<RwLock<ProvenanceGraph>> {
        &self.graph
    }

    /// Adds an instruction to the provenance graph and records its node index.
    /// Returns the node index in the graph.
    pub fn add_instruction(&mut self, instruction: Instruction) -> usize {
        let id = instruction.id;
        let mut graph = self.graph.write().expect("provenance graph lock poisoned");
        let node_idx = graph.add_node(instruction, 0, &[]);
        self.nodes.insert(id, node_idx);
        node_idx
    }

    /// Records an existing provenance graph node in this ISA.
    pub fn add_node(&mut self, instruction_id: u64, node_index: usize) {
        self.nodes.insert(instruction_id, node_index);
    }

    /// Returns the node index for an instruction ID, if present.
    #[must_use]
    pub fn node_index(&self, id: &u64) -> Option<usize> {
        self.nodes.get(id).copied()
    }

    /// Returns a clone of the instruction with the given ID, if present.
    #[must_use]
    pub fn get(&self, id: &u64) -> Option<Instruction> {
        let &node_idx = self.nodes.get(id)?;
        let graph = self.read_graph();
        Some(graph.instruction(node_idx).clone())
    }

    #[must_use]
    pub fn contains(&self, id: &u64) -> bool {
        self.nodes.contains_key(id)
    }

    #[must_use]
    pub fn len(&self) -> usize {
        self.nodes.len()
    }

    #[must_use]
    pub fn is_empty(&self) -> bool {
        self.nodes.is_empty()
    }

    /// Returns a read-locked view of this ISA, enabling zero-clone
    /// instruction access for the lifetime of the returned guard.
    #[must_use]
    pub fn lock(&self) -> LockedISA<'_> {
        LockedISA {
            graph: self.read_graph(),
            nodes: &self.nodes,
        }
    }

    fn read_graph(&self) -> RwLockReadGuard<'_, ProvenanceGraph> {
        self.graph.read().expect("provenance graph lock poisoned")
    }

    /// Returns an iterator over pairs of instruction IDs and node IDs.
    pub fn node_entries(&self) -> impl Iterator<Item = (&u64, &usize)> {
        self.nodes.iter()
    }

    /// Returns all instructions as owned clones.
    #[must_use]
    pub fn instructions(&self) -> Vec<Instruction> {
        let graph = self.read_graph();
        self.nodes
            .values()
            .map(|&idx| graph.instruction(idx).clone())
            .collect()
    }

    #[must_use]
    pub fn satisfies(&self, requirements: &ISARequirements) -> bool {
        let graph = self.read_graph();
        for constraint in requirements.constraints.values() {
            let Some(&node_idx) = self.nodes.get(&constraint.id) else {
                return false;
            };

            let instruction = graph.instruction(node_idx);

            if !constraint.is_satisfied_by(instruction) {
                return false;
            }
        }
        true
    }
}

impl FromIterator<Instruction> for ISA {
    fn from_iter<T: IntoIterator<Item = Instruction>>(iter: T) -> Self {
        let mut isa = ISA::new();
        for instruction in iter {
            isa.add_instruction(instruction);
        }
        isa
    }
}

impl Display for ISA {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        let graph = self.read_graph();
        for &node_idx in self.nodes.values() {
            let instruction = graph.instruction(node_idx);
            writeln!(f, "{instruction}")?;
        }
        Ok(())
    }
}

impl Add<ISA> for ISA {
    type Output = ISA;

    fn add(self, other: ISA) -> ISA {
        let mut combined = self;
        if Arc::ptr_eq(&combined.graph, &other.graph) {
            // Same graph: just merge node maps
            for (id, node_idx) in other.nodes {
                combined.nodes.insert(id, node_idx);
            }
        } else {
            // Different graphs: copy instructions into combined's graph
            let other_graph = other.read_graph();
            let mut self_graph = combined
                .graph
                .write()
                .expect("provenance graph lock poisoned");
            for (id, node_idx) in &other.nodes {
                let instruction = other_graph.instruction(*node_idx).clone();
                let new_idx = self_graph.add_node(instruction, 0, &[]);
                combined.nodes.insert(*id, new_idx);
            }
        }
        combined
    }
}

/// A read-locked view of an ISA. Holds the graph read lock for the
/// lifetime of this struct, enabling zero-clone instruction access.
pub struct LockedISA<'a> {
    graph: RwLockReadGuard<'a, ProvenanceGraph>,
    nodes: &'a FxHashMap<u64, usize>,
}

impl LockedISA<'_> {
    /// Returns a reference to the instruction with the given ID, if present.
    #[must_use]
    pub fn get(&self, id: &u64) -> Option<&Instruction> {
        let &node_idx = self.nodes.get(id)?;
        Some(self.graph.instruction(node_idx))
    }
}

#[derive(Default)]
pub struct ISARequirements {
    constraints: FxHashMap<u64, InstructionConstraint>,
}

impl ISARequirements {
    #[must_use]
    pub fn new() -> Self {
        ISARequirements {
            constraints: FxHashMap::default(),
        }
    }

    pub fn add_constraint(&mut self, constraint: InstructionConstraint) {
        self.constraints.insert(constraint.id, constraint);
    }

    #[must_use]
    pub fn len(&self) -> usize {
        self.constraints.len()
    }

    #[must_use]
    pub fn is_empty(&self) -> bool {
        self.constraints.is_empty()
    }

    pub fn entry(&mut self, id: u64) -> Entry<'_, u64, InstructionConstraint> {
        self.constraints.entry(id)
    }

    /// Returns all instructions as owned clones.
    #[must_use]
    pub fn constraints(&self) -> Vec<InstructionConstraint> {
        self.constraints.values().cloned().collect()
    }
}

impl FromIterator<InstructionConstraint> for ISARequirements {
    fn from_iter<T: IntoIterator<Item = InstructionConstraint>>(iter: T) -> Self {
        let mut reqs = ISARequirements::new();
        for constraint in iter {
            reqs.add_constraint(constraint);
        }
        reqs
    }
}

#[derive(Clone, Serialize, Deserialize)]
pub struct Instruction {
    id: u64,
    encoding: Encoding,
    metrics: Metrics,
    source: usize,
    properties: Option<FxHashMap<u64, Property>>,
}

impl Instruction {
    #[must_use]
    pub fn fixed_arity(
        id: u64,
        encoding: Encoding,
        arity: u64,
        time: u64,
        space: Option<u64>,
        length: Option<u64>,
        error_rate: f64,
    ) -> Self {
        let length = length.unwrap_or(arity);
        let space = space.unwrap_or(length);

        Instruction {
            id,
            encoding,
            metrics: Metrics::FixedArity {
                arity,
                length,
                space,
                time,
                error_rate,
            },
            source: 0,
            properties: None,
        }
    }

    #[must_use]
    pub fn variable_arity(
        id: u64,
        encoding: Encoding,
        time_fn: VariableArityFunction<u64>,
        space_fn: VariableArityFunction<u64>,
        length_fn: Option<VariableArityFunction<u64>>,
        error_rate_fn: VariableArityFunction<f64>,
    ) -> Self {
        let length_fn = length_fn.unwrap_or_else(|| space_fn.clone());

        Instruction {
            id,
            encoding,
            metrics: Metrics::VariableArity {
                length_fn,
                space_fn,
                time_fn,
                error_rate_fn,
            },
            source: 0,
            properties: None,
        }
    }

    #[must_use]
    pub fn with_id(&self, id: u64) -> Self {
        let mut new_instruction = self.clone();
        // reset source for new instruction
        new_instruction.source = 0;
        new_instruction.id = id;
        new_instruction
    }

    #[must_use]
    pub fn id(&self) -> u64 {
        self.id
    }

    #[must_use]
    pub fn encoding(&self) -> Encoding {
        self.encoding
    }

    #[must_use]
    pub fn arity(&self) -> Option<u64> {
        match &self.metrics {
            Metrics::FixedArity { arity, .. } => Some(*arity),
            Metrics::VariableArity { .. } => None,
        }
    }

    #[must_use]
    pub fn space(&self, arity: Option<u64>) -> Option<u64> {
        match &self.metrics {
            Metrics::FixedArity { space, .. } => Some(*space),
            Metrics::VariableArity { space_fn, .. } => arity.map(|a| space_fn.evaluate(a)),
        }
    }

    #[must_use]
    pub fn length(&self, arity: Option<u64>) -> Option<u64> {
        match &self.metrics {
            Metrics::FixedArity { length, .. } => Some(*length),
            Metrics::VariableArity { length_fn, .. } => arity.map(|a| length_fn.evaluate(a)),
        }
    }

    #[must_use]
    pub fn time(&self, arity: Option<u64>) -> Option<u64> {
        match &self.metrics {
            Metrics::FixedArity { time, .. } => Some(*time),
            Metrics::VariableArity { time_fn, .. } => arity.map(|a| time_fn.evaluate(a)),
        }
    }

    #[must_use]
    pub fn error_rate(&self, arity: Option<u64>) -> Option<f64> {
        match &self.metrics {
            Metrics::FixedArity { error_rate, .. } => Some(*error_rate),
            Metrics::VariableArity { error_rate_fn, .. } => {
                arity.map(|a| error_rate_fn.evaluate(a))
            }
        }
    }

    #[must_use]
    pub fn expect_space(&self, arity: Option<u64>) -> u64 {
        self.space(arity)
            .expect("Instruction does not support variable arity")
    }

    #[must_use]
    pub fn expect_length(&self, arity: Option<u64>) -> u64 {
        self.length(arity)
            .expect("Instruction does not support variable arity")
    }

    #[must_use]
    pub fn expect_time(&self, arity: Option<u64>) -> u64 {
        self.time(arity)
            .expect("Instruction does not support variable arity")
    }

    #[must_use]
    pub fn expect_error_rate(&self, arity: Option<u64>) -> f64 {
        self.error_rate(arity)
            .expect("Instruction does not support variable arity")
    }

    pub fn set_source(&mut self, provenance: usize) {
        self.source = provenance;
    }

    #[must_use]
    pub fn source(&self) -> usize {
        self.source
    }

    pub fn set_property(&mut self, key: u64, value: Property) {
        if let Some(ref mut properties) = self.properties {
            properties.insert(key, value);
        } else {
            let mut properties = FxHashMap::default();
            properties.insert(key, value);
            self.properties = Some(properties);
        }
    }

    #[must_use]
    pub fn get_property(&self, key: &u64) -> Option<&Property> {
        self.properties.as_ref()?.get(key)
    }

    #[must_use]
    pub fn has_property(&self, key: &u64) -> bool {
        self.properties
            .as_ref()
            .is_some_and(|props| props.contains_key(key))
    }

    #[must_use]
    pub fn get_property_or<'a>(&'a self, key: &u64, default: &'a Property) -> &'a Property {
        self.get_property(key).unwrap_or(default)
    }
}

impl Display for Instruction {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        let name = instruction_name(self.id).unwrap_or("??");
        match self.metrics {
            Metrics::FixedArity { arity, .. } => {
                write!(f, "{name} |{:?}| arity: {arity}", self.encoding)
            }
            Metrics::VariableArity { .. } => write!(f, "{name} |{:?}|", self.encoding),
        }
    }
}

#[derive(Clone)]
pub struct InstructionConstraint {
    id: u64,
    encoding: Encoding,
    arity: Option<u64>,
    error_rate_fn: Option<ConstraintBound<f64>>,
    properties: FxHashSet<u64>,
}

impl InstructionConstraint {
    #[must_use]
    pub fn new(
        id: u64,
        encoding: Encoding,
        arity: Option<u64>,
        error_rate_fn: Option<ConstraintBound<f64>>,
    ) -> Self {
        InstructionConstraint {
            id,
            encoding,
            arity,
            error_rate_fn,
            properties: FxHashSet::default(),
        }
    }

    /// Adds a property requirement to the constraint.
    pub fn add_property(&mut self, property: u64) {
        self.properties.insert(property);
    }

    /// Checks if the constraint requires a specific property.
    #[must_use]
    pub fn has_property(&self, property: &u64) -> bool {
        self.properties.contains(property)
    }

    /// Returns the set of required properties.
    #[must_use]
    pub fn properties(&self) -> &FxHashSet<u64> {
        &self.properties
    }

    /// Returns the instruction ID this constraint applies to.
    #[must_use]
    pub fn id(&self) -> u64 {
        self.id
    }

    /// Returns the required encoding for this constraint.
    #[must_use]
    pub fn encoding(&self) -> Encoding {
        self.encoding
    }

    #[must_use]
    pub fn arity(&self) -> Option<u64> {
        self.arity
    }

    pub fn set_arity(&mut self, arity: Option<u64>) {
        self.arity = arity;
    }

    #[must_use]
    pub fn error_rate(&self) -> Option<&ConstraintBound<f64>> {
        self.error_rate_fn.as_ref()
    }

    pub fn set_error_rate(&mut self, error_rate_fn: Option<ConstraintBound<f64>>) {
        self.error_rate_fn = error_rate_fn;
    }

    /// Checks whether a given instruction satisfies this constraint.
    #[must_use]
    pub fn is_satisfied_by(&self, instruction: &Instruction) -> bool {
        if instruction.encoding != self.encoding {
            return false;
        }

        match &instruction.metrics {
            Metrics::FixedArity {
                arity, error_rate, ..
            } => {
                // Constraint requires variable arity but instruction is fixed
                let Some(constraint_arity) = self.arity else {
                    return false;
                };
                if *arity != constraint_arity {
                    return false;
                }
                if let Some(ref bound) = self.error_rate_fn
                    && !bound.evaluate(error_rate)
                {
                    return false;
                }
            }
            Metrics::VariableArity { error_rate_fn, .. } => {
                if let (Some(constraint_arity), Some(bound)) = (self.arity, &self.error_rate_fn)
                    && !bound.evaluate(&error_rate_fn.evaluate(constraint_arity))
                {
                    return false;
                }
            }
        }

        for prop in &self.properties {
            if !instruction.has_property(prop) {
                return false;
            }
        }

        true
    }
}

#[derive(Clone, Copy, Debug, Default, PartialEq, Eq, Hash, Serialize, Deserialize)]
pub enum Encoding {
    #[default]
    Physical,
    Logical,
}

#[derive(Clone, Serialize, Deserialize)]
pub enum Metrics {
    FixedArity {
        arity: u64,
        length: u64,
        space: u64,
        time: u64,
        error_rate: f64,
    },
    VariableArity {
        length_fn: VariableArityFunction<u64>,
        space_fn: VariableArityFunction<u64>,
        time_fn: VariableArityFunction<u64>,
        error_rate_fn: VariableArityFunction<f64>,
    },
}

#[derive(Clone, Serialize, Deserialize)]
pub enum VariableArityFunction<T> {
    Constant {
        value: T,
    },
    Linear {
        slope: T,
    },
    BlockLinear {
        block_size: u64,
        slope: T,
        offset: T,
    },
    #[serde(skip)]
    Generic {
        func: Arc<dyn Fn(u64) -> T + Send + Sync>,
    },
}

impl<T: Add<Output = T> + std::ops::Mul<Output = T> + Copy + FromPrimitive>
    VariableArityFunction<T>
{
    pub fn constant(value: T) -> Self {
        VariableArityFunction::Constant { value }
    }

    pub fn linear(slope: T) -> Self {
        VariableArityFunction::Linear { slope }
    }

    pub fn block_linear(block_size: u64, slope: T, offset: T) -> Self {
        VariableArityFunction::BlockLinear {
            block_size,
            slope,
            offset,
        }
    }

    pub fn generic(func: impl Fn(u64) -> T + Send + Sync + 'static) -> Self {
        VariableArityFunction::Generic {
            func: Arc::new(func),
        }
    }

    pub fn generic_from_arc(func: Arc<dyn Fn(u64) -> T + Send + Sync>) -> Self {
        VariableArityFunction::Generic { func }
    }

    pub fn evaluate(&self, arity: u64) -> T {
        match self {
            VariableArityFunction::Constant { value } => *value,
            VariableArityFunction::Linear { slope } => {
                *slope * T::from_u64(arity).expect("Failed to convert u64 to target type")
            }
            VariableArityFunction::BlockLinear {
                block_size,
                slope,
                offset,
            } => {
                let blocks = arity.div_ceil(*block_size);
                *slope * T::from_u64(blocks).expect("Failed to convert u64 to target type")
                    + *offset
            }
            VariableArityFunction::Generic { func } => func(arity),
        }
    }
}

#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
pub enum ConstraintBound<T> {
    LessThan(T),
    LessEqual(T),
    Equal(T),
    GreaterThan(T),
    GreaterEqual(T),
}

impl<T: PartialOrd + PartialEq> ConstraintBound<T> {
    pub fn less_than(value: T) -> Self {
        ConstraintBound::LessThan(value)
    }

    pub fn less_equal(value: T) -> Self {
        ConstraintBound::LessEqual(value)
    }

    pub fn equal(value: T) -> Self {
        ConstraintBound::Equal(value)
    }

    pub fn greater_than(value: T) -> Self {
        ConstraintBound::GreaterThan(value)
    }

    pub fn greater_equal(value: T) -> Self {
        ConstraintBound::GreaterEqual(value)
    }

    pub fn evaluate(&self, other: &T) -> bool {
        match self {
            ConstraintBound::LessThan(v) => other < v,
            ConstraintBound::LessEqual(v) => other <= v,
            ConstraintBound::Equal(v) => other == v,
            ConstraintBound::GreaterThan(v) => other > v,
            ConstraintBound::GreaterEqual(v) => other >= v,
        }
    }
}
