ferrijs-std 0.2.3

// Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
mod crypto_key;
mod derive_algorithm;
mod derive_bits;
mod derive_keys;
mod digest;
mod encapsulation;
mod encryption;
mod encryption_algorithm;
#[cfg(feature = "_subtle-full")]
mod export_key;
mod generate_key;
mod get_public_key;
mod import_key;
#[cfg(feature = "_subtle-full")]
mod key_algorithm;
mod sign;
mod sign_algorithm;
mod supports;
mod util;
mod verify;
#[cfg(feature = "_subtle-full")]
mod wrapping;

pub use crypto_key::CryptoKey;
pub use derive_bits::subtle_derive_bits;
pub use derive_keys::subtle_derive_key;
pub use digest::subtle_digest;
pub use encapsulation::{
    subtle_decapsulate_bits, subtle_decapsulate_key, subtle_encapsulate_bits,
    subtle_encapsulate_key,
};
pub use encryption::subtle_decrypt;
pub use encryption::subtle_encrypt;
#[cfg(feature = "_subtle-full")]
pub use export_key::subtle_export_key;
pub use generate_key::subtle_generate_key;
pub use get_public_key::subtle_get_public_key;
#[cfg(feature = "_subtle-full")]
pub use import_key::subtle_import_key;
#[cfg(feature = "_subtle-full")]
use key_algorithm::KeyAlgorithm;
pub use sign::subtle_sign;
use supports::subtle_supports;
pub use verify::subtle_verify;
#[cfg(feature = "_subtle-full")]
pub use wrapping::subtle_unwrap_key;
#[cfg(feature = "_subtle-full")]
pub use wrapping::subtle_wrap_key;

// Stub implementations for limited crypto providers (no _subtle-full)
#[cfg(not(feature = "_subtle-full"))]
mod key_algorithm;
#[cfg(not(feature = "_subtle-full"))]
use key_algorithm::KeyAlgorithm;

use crate::exceptions::DOMException;
use crate::str_enum;
use crate::utils::{object::ObjectExt};
use rquickjs::{
    atom::PredefinedAtom, prelude::Opt, Array, Class, Coerced, Ctx, Error, Exception, FromJs,
    Object, Result, Value,
};

use crate::crypto::provider::{CryptoProvider, SimpleDigest};

use crate::crypto::hash::HashAlgorithm;

#[rquickjs::class]
#[derive(rquickjs::JsLifetime, rquickjs::class::Trace)]
pub struct SubtleCrypto {}

#[rquickjs::methods]
impl SubtleCrypto {
    #[qjs(constructor)]
    pub fn new(ctx: Ctx<'_>) -> Result<Self> {
        Err(Exception::throw_type(&ctx, "Illegal constructor"))
    }

    #[qjs(prop, rename = PredefinedAtom::SymbolToStringTag, configurable)]
    pub fn to_string_tag() -> &'static str {
        stringify!(SubtleCrypto)
    }

    #[qjs(rename = "getPublicKey")]
    pub async fn get_public_key<'js>(
        &self,
        ctx: Ctx<'js>,
        key: Class<'js, CryptoKey<'js>>,
        usages: Array<'js>,
    ) -> Result<Class<'js, CryptoKey<'js>>> {
        subtle_get_public_key(ctx, key, usages).await
    }

    #[qjs(static)]
    pub fn supports<'js>(
        ctx: Ctx<'js>,
        operation: Coerced<String>,
        algorithm: Value<'js>,
        additional: Opt<Value<'js>>,
    ) -> Result<bool> {
        subtle_supports(ctx, operation, algorithm, additional)
    }
}

#[derive(Debug, Clone, Copy, PartialEq)]
pub enum EllipticCurve {
    P256,
    P384,
    P521,
}

str_enum!(EllipticCurve,P256 => "P-256", P384 => "P-384", P521 => "P-521");

pub enum EncryptionMode {
    Encryption,
    #[allow(dead_code)]
    Wrapping(u8), //padding byte
}

pub fn rsa_hash_digest<'a>(
    ctx: &Ctx<'_>,
    key: &'a CryptoKey,
    data: &'a [u8],
    algorithm_name: &str,
) -> Result<(&'a HashAlgorithm, Vec<u8>)> {
    let hash = match &key.algorithm {
        KeyAlgorithm::Rsa { hash, .. } => hash,
        _ => return algorithm_mismatch_error(ctx, algorithm_name),
    };
    if !matches!(
        hash,
        HashAlgorithm::Sha1 | HashAlgorithm::Sha256 | HashAlgorithm::Sha384 | HashAlgorithm::Sha512
    ) {
        return Err(Exception::throw_message(
            ctx,
            "Only SHA-1, SHA-256, SHA-384 or SHA-512 is supported for RSA",
        ));
    }

    let mut hasher = crate::crypto::CRYPTO_PROVIDER.digest(*hash);
    hasher.update(data);
    let digest = hasher.finalize();

    Ok((hash, digest))
}

pub fn validate_rsa_pss_salt_length(
    ctx: &Ctx<'_>,
    key: &CryptoKey<'_>,
    hash: &HashAlgorithm,
    salt_length: u32,
) -> Result<()> {
    let KeyAlgorithm::Rsa { modulus_length, .. } = key.algorithm else {
        return algorithm_mismatch_error(ctx, "RSA-PSS");
    };
    if !rsa_pss_salt_length_fits(modulus_length, hash, salt_length) {
        return Err(DOMException::operation_error(
            ctx,
            "RSA-PSS saltLength exceeds the key limit",
        ));
    }
    Ok(())
}

pub fn rsa_pss_salt_length_is_valid(
    key: &CryptoKey<'_>,
    hash: &HashAlgorithm,
    salt_length: u32,
) -> bool {
    let KeyAlgorithm::Rsa { modulus_length, .. } = key.algorithm else {
        return false;
    };
    rsa_pss_salt_length_fits(modulus_length, hash, salt_length)
}

fn rsa_pss_salt_length_fits(modulus_length: u32, hash: &HashAlgorithm, salt_length: u32) -> bool {
    let encoded_message_length = modulus_length.saturating_sub(1).div_ceil(8) as usize;
    encoded_message_length
        .checked_sub(hash.digest_len() + 2)
        .is_some_and(|maximum| salt_length as usize <= maximum)
}

pub fn to_name_and_maybe_object<'js>(
    ctx: &Ctx<'js>,
    value: Value<'js>,
) -> Result<(String, Result<Object<'js>>)> {
    let obj;
    let name = if let Some(string) = value.as_string() {
        obj = Err(Error::new_from_js_message(
            "string",
            "object",
            "algorithm is not an object",
        ));
        string.to_string()?
    } else if let Some(object) = value.into_object() {
        let name = object.get_required("name", "algorithm")?;
        obj = Ok(object);
        name
    } else {
        return Err(Exception::throw_message(
            ctx,
            "algorithm must be a string or an object",
        ));
    };
    Ok((name, obj))
}

pub fn normalize_algorithm_name(name: &str) -> String {
    let name = name.to_ascii_uppercase();
    match name.as_str() {
        "CHACHA20-POLY1305" => "ChaCha20-Poly1305".to_string(),
        "ED25519" => "Ed25519".to_string(),
        "RSASSA-PKCS1-V1_5" => "RSASSA-PKCS1-v1_5".to_string(),
        _ => name,
    }
}

pub fn get_required_dictionary_value<'js>(
    object: &Object<'js>,
    name: &str,
    object_name: &str,
) -> Result<Value<'js>> {
    let value: Value = object.get(name)?;
    if value.is_undefined() {
        return Err(Exception::throw_type(
            object.ctx(),
            &[object_name, " '", name, "' property required"].concat(),
        ));
    }
    Ok(value)
}

pub fn get_optional_dictionary_value<'js>(
    object: &Object<'js>,
    name: &str,
) -> Result<Option<Value<'js>>> {
    let value: Value = object.get(name)?;
    Ok((!value.is_undefined()).then_some(value))
}

fn enforce_range_unsigned<'js>(
    ctx: &Ctx<'js>,
    value: Value<'js>,
    name: &str,
    upper_bound: f64,
) -> Result<f64> {
    let number = Coerced::<f64>::from_js(ctx, value)?.0;
    if !number.is_finite() {
        return Err(Exception::throw_type(
            ctx,
            &format!("{name} must be finite"),
        ));
    }
    let integer = number.trunc();
    if integer < 0.0 || integer > upper_bound {
        return Err(Exception::throw_type(
            ctx,
            &format!("{name} is outside the accepted range"),
        ));
    }
    Ok(integer)
}

pub fn enforce_range_u16<'js>(ctx: &Ctx<'js>, value: Value<'js>, name: &str) -> Result<u16> {
    Ok(enforce_range_unsigned(ctx, value, name, u16::MAX as f64)? as u16)
}

pub fn enforce_range_u8<'js>(ctx: &Ctx<'js>, value: Value<'js>, name: &str) -> Result<u8> {
    Ok(enforce_range_unsigned(ctx, value, name, u8::MAX as f64)? as u8)
}

pub fn enforce_range_u32<'js>(ctx: &Ctx<'js>, value: Value<'js>, name: &str) -> Result<u32> {
    Ok(enforce_range_unsigned(ctx, value, name, u32::MAX as f64)? as u32)
}

pub fn algorithm_mismatch_error<T>(ctx: &Ctx<'_>, expected_algorithm: &str) -> Result<T> {
    Err(DOMException::type_mismatch_error(
        ctx,
        ["Key algorithm must be ", expected_algorithm].concat(),
    ))
}

pub fn algorithm_not_supported_error<T>(ctx: &Ctx<'_>) -> Result<T> {
    Err(DOMException::not_supported_error(
        ctx,
        "Algorithm not supported",
    ))
}

pub fn algorithm_invalid_access_error<T>(ctx: &Ctx<'_>, expected_algorithm: &str) -> Result<T> {
    Err(DOMException::invalid_access_error(
        ctx,
        ["Key algorithm must be ", expected_algorithm].concat(),
    ))
}

// Stub implementations for providers without _subtle-full
#[cfg(not(feature = "_subtle-full"))]
mod stubs;
#[cfg(not(feature = "_subtle-full"))]
pub use stubs::subtle_export_key;
#[cfg(not(feature = "_subtle-full"))]
pub use stubs::subtle_import_key;
#[cfg(not(feature = "_subtle-full"))]
pub use stubs::subtle_unwrap_key;
#[cfg(not(feature = "_subtle-full"))]
pub use stubs::subtle_wrap_key;