frontend 0.4.0

use core::convert::Infallible;
use core::marker::PhantomData;

use crate::rustc_type_ir::search_graph::{self, PathKind};
use crate::rustc_type_ir::solve::{
    AccessedOpaques, CanonicalInput, Certainty, NoSolution, QueryResult, RerunResultExt,
};
use crate::rustc_type_ir::{Interner, MayBeErased, TypingMode};

use crate::rustc_next_trait_solver::canonical::response_no_constraints_raw;
use crate::rustc_next_trait_solver::delegate::SolverDelegate;
use crate::rustc_next_trait_solver::solve::{
    EvalCtxt, FIXPOINT_STEP_LIMIT, has_no_inference_or_external_constraints, inspect,
};

/// This type is never constructed. We only use it to implement `search_graph::Delegate`
/// for all types which impl `SolverDelegate` and doing it directly fails in coherence.
pub(super) struct SearchGraphDelegate<D: SolverDelegate> {
    _marker: PhantomData<D>,
}
pub(super) type SearchGraph<D> = search_graph::SearchGraph<SearchGraphDelegate<D>>;
impl<D, I> search_graph::Delegate for SearchGraphDelegate<D>
where
    D: SolverDelegate<Interner = I>,
    I: Interner,
{
    type Cx = D::Interner;

    const ENABLE_PROVISIONAL_CACHE: bool = true;
    type ValidationScope = Infallible;
    fn enter_validation_scope(
        _cx: Self::Cx,
        _input: CanonicalInput<I>,
    ) -> Option<Self::ValidationScope> {
        None
    }

    const FIXPOINT_STEP_LIMIT: usize = FIXPOINT_STEP_LIMIT;

    type ProofTreeBuilder = inspect::ProofTreeBuilder<D>;
    fn inspect_is_noop(inspect: &mut Self::ProofTreeBuilder) -> bool {
        inspect.is_noop()
    }

    const DIVIDE_AVAILABLE_DEPTH_ON_OVERFLOW: usize = 4;

    fn initial_provisional_result(
        cx: I,
        kind: PathKind,
        input: CanonicalInput<I>,
    ) -> (QueryResult<I>, AccessedOpaques<I>) {
        match kind {
            PathKind::Coinductive => response_no_constraints(cx, input, Certainty::Yes),
            PathKind::Unknown | PathKind::ForcedAmbiguity => {
                response_no_constraints(cx, input, Certainty::overflow(false))
            }
            // Even though we know these cycles to be unproductive, we still return
            // overflow during coherence. This is both as we are not 100% confident in
            // the implementation yet and any incorrect errors would be unsound there.
            // The affected cases are also fairly artificial and not necessarily desirable
            // so keeping this as ambiguity is fine for now.
            //
            // See `tests/ui/traits/next-solver/cycles/unproductive-in-coherence.rs` for an
            // example where this would matter. We likely should change these cycles to `NoSolution`
            // even in coherence once this is a bit more settled.
            PathKind::Inductive => match input.typing_mode.0 {
                TypingMode::Coherence => {
                    response_no_constraints(cx, input, Certainty::overflow(false))
                }
                TypingMode::Typeck { .. }
                | TypingMode::PostTypeckUntilBorrowck { .. }
                | TypingMode::Reflection
                | TypingMode::PostBorrowck { .. }
                | TypingMode::PostAnalysis
                | TypingMode::Codegen
                | TypingMode::ErasedNotCoherence(MayBeErased) => {
                    (Err(NoSolution), AccessedOpaques::default())
                }
            },
        }
    }

    fn is_initial_provisional_result(
        result: (QueryResult<I>, AccessedOpaques<I>),
    ) -> Option<PathKind> {
        match result.0 {
            Ok(response) => {
                if has_no_inference_or_external_constraints(response) {
                    if response.value.certainty == Certainty::Yes {
                        return Some(PathKind::Coinductive);
                    } else if response.value.certainty == Certainty::overflow(false) {
                        return Some(PathKind::Unknown);
                    }
                }

                None
            }
            Err(NoSolution) => Some(PathKind::Inductive),
        }
    }

    fn stack_overflow_result(
        cx: I,
        input: CanonicalInput<I>,
    ) -> (QueryResult<I>, AccessedOpaques<I>) {
        response_no_constraints(cx, input, Certainty::overflow(true))
    }

    const FIXPOINT_OVERFLOW_AMBIGUITY_KIND: Certainty = Certainty::overflow(false);
    fn fixpoint_overflow_result(
        cx: I,
        input: CanonicalInput<I>,
    ) -> (QueryResult<I>, AccessedOpaques<I>) {
        response_no_constraints(cx, input, Certainty::overflow(false))
    }

    fn is_ambiguous_result(result: (QueryResult<I>, AccessedOpaques<I>)) -> Option<Certainty> {
        result.0.ok().and_then(|response| {
            if has_no_inference_or_external_constraints(response)
                && matches!(response.value.certainty, Certainty::Maybe { .. })
            {
                Some(response.value.certainty)
            } else {
                None
            }
        })
    }

    fn compute_goal(
        search_graph: &mut SearchGraph<D>,
        cx: I,
        input: CanonicalInput<I>,
        inspect: &mut Self::ProofTreeBuilder,
    ) -> (QueryResult<I>, AccessedOpaques<I>) {
        EvalCtxt::enter_canonical(cx, search_graph, input, inspect, |ecx, goal| {
            // if we're in `RerunNonErased`, don't even bother with inspect, and immediately return
            let result = ecx.compute_goal(goal).map_err_to_rerun()?;

            ecx.inspect.query_result(result);
            result.map_err(Into::into)
        })
    }
}

fn response_no_constraints<I: Interner>(
    cx: I,
    input: CanonicalInput<I>,
    certainty: Certainty,
) -> (QueryResult<I>, AccessedOpaques<I>) {
    (
        Ok(response_no_constraints_raw(
            cx,
            input.canonical.max_universe,
            input.canonical.var_kinds,
            certainty,
        )),
        AccessedOpaques::default(),
    )
}