use std::sync::{Arc, LazyLock, Weak};
use strum::{EnumIter, EnumString, IntoStaticStr};
use crate::extension::{ConstFold, ConstFoldResult};
use crate::ops::constant::ValueName;
use crate::ops::{OpName, Value};
use crate::types::Signature;
use crate::{
Extension, IncomingPort,
extension::{
ExtensionId, OpDef, SignatureFunc,
prelude::bool_t,
simple_op::{MakeOpDef, MakeRegisteredOp, OpLoadError, try_from_name},
},
ops,
types::type_param::TypeArg,
utils::sorted_consts,
};
pub const FALSE_NAME: ValueName = ValueName::new_inline("FALSE");
pub const TRUE_NAME: ValueName = ValueName::new_inline("TRUE");
impl ConstFold for LogicOp {
fn fold(&self, _type_args: &[TypeArg], consts: &[(IncomingPort, Value)]) -> ConstFoldResult {
match self {
Self::And => {
let inps = read_inputs(consts)?;
let res = inps.iter().all(|x| *x);
(!res || inps.len() as u64 == 2)
.then_some(vec![(0.into(), ops::Value::from_bool(res))])
}
Self::Or => {
let inps = read_inputs(consts)?;
let res = inps.iter().any(|x| *x);
(res || inps.len() as u64 == 2)
.then_some(vec![(0.into(), ops::Value::from_bool(res))])
}
Self::Eq => {
let inps = read_inputs(consts)?;
let res = inps.iter().copied().reduce(|a, b| a == b)?;
(!res || inps.len() as u64 == 2)
.then_some(vec![(0.into(), ops::Value::from_bool(res))])
}
Self::Not => {
let inps = read_inputs(consts)?;
let res = inps.iter().all(|x| !*x);
(!res || inps.len() as u64 == 1)
.then_some(vec![(0.into(), ops::Value::from_bool(res))])
}
Self::Xor => {
let inps = read_inputs(consts)?;
let res = inps.iter().fold(false, |acc, x| acc ^ *x);
(inps.len() as u64 == 2).then_some(vec![(0.into(), ops::Value::from_bool(res))])
}
}
}
}
#[derive(Clone, Copy, Debug, Hash, PartialEq, Eq, EnumIter, IntoStaticStr, EnumString)]
#[allow(missing_docs)]
#[non_exhaustive]
pub enum LogicOp {
And,
Or,
Eq,
Not,
Xor,
}
impl MakeOpDef for LogicOp {
fn opdef_id(&self) -> OpName {
<&'static str>::from(self).into()
}
fn init_signature(&self, _extension_ref: &Weak<Extension>) -> SignatureFunc {
match self {
LogicOp::And | LogicOp::Or | LogicOp::Eq | LogicOp::Xor => {
Signature::new(vec![bool_t(); 2], vec![bool_t()])
}
LogicOp::Not => Signature::new_endo([bool_t()]),
}
.into()
}
fn extension_ref(&self) -> Weak<Extension> {
Arc::downgrade(&EXTENSION)
}
fn description(&self) -> String {
match self {
LogicOp::And => "logical 'and'",
LogicOp::Or => "logical 'or'",
LogicOp::Eq => "test if bools are equal",
LogicOp::Not => "logical 'not'",
LogicOp::Xor => "logical 'xor'",
}
.to_string()
}
fn from_def(op_def: &OpDef) -> Result<Self, OpLoadError> {
try_from_name(op_def.name(), op_def.extension_id())
}
fn extension(&self) -> ExtensionId {
EXTENSION_ID.clone()
}
fn post_opdef(&self, def: &mut OpDef) {
def.set_constant_folder(*self);
}
}
pub const EXTENSION_ID: ExtensionId = ExtensionId::new_unchecked("logic");
pub const VERSION: semver::Version = semver::Version::new(0, 1, 0);
fn extension() -> Arc<Extension> {
Extension::new_arc(EXTENSION_ID, VERSION, |extension, extension_ref| {
LogicOp::load_all_ops(extension, extension_ref).unwrap();
})
}
pub static EXTENSION: LazyLock<Arc<Extension>> = LazyLock::new(extension);
impl MakeRegisteredOp for LogicOp {
fn extension_id(&self) -> ExtensionId {
EXTENSION_ID.clone()
}
fn extension_ref(&self) -> Arc<Extension> {
EXTENSION.clone()
}
}
fn read_inputs(consts: &[(IncomingPort, ops::Value)]) -> Option<Vec<bool>> {
let true_val = ops::Value::true_val();
let false_val = ops::Value::false_val();
let inps: Option<Vec<bool>> = sorted_consts(consts)
.into_iter()
.map(|c| {
if c == &true_val {
Some(true)
} else if c == &false_val {
Some(false)
} else {
None
}
})
.collect();
let inps = inps?;
Some(inps)
}
#[cfg(test)]
pub(crate) mod test {
use std::sync::Arc;
use super::{LogicOp, extension};
use crate::{
Extension,
extension::simple_op::{MakeOpDef, MakeRegisteredOp},
ops::Value,
};
use rstest::rstest;
use strum::IntoEnumIterator;
#[test]
fn test_logic_extension() {
let r: Arc<Extension> = extension();
assert_eq!(r.name() as &str, "logic");
assert_eq!(r.operations().count(), 5);
for op in LogicOp::iter() {
assert_eq!(
LogicOp::from_def(r.get_op(op.into()).unwrap(),).unwrap(),
op
);
}
}
#[test]
fn test_conversions() {
for o in LogicOp::iter() {
let ext_op = o.to_extension_op().unwrap();
assert_eq!(LogicOp::from_op(&ext_op).unwrap(), o);
}
}
pub(crate) fn and_op() -> LogicOp {
LogicOp::And
}
pub(crate) fn or_op() -> LogicOp {
LogicOp::Or
}
#[rstest]
#[case(LogicOp::And, [true, true], true)]
#[case(LogicOp::And, [true, false], false)]
#[case(LogicOp::Or, [false, true], true)]
#[case(LogicOp::Or, [false, false], false)]
#[case(LogicOp::Eq, [true, false], false)]
#[case(LogicOp::Eq, [false, false], true)]
#[case(LogicOp::Not, [false], true)]
#[case(LogicOp::Not, [true], false)]
#[case(LogicOp::Xor, [true, false], true)]
#[case(LogicOp::Xor, [true, true], false)]
fn const_fold(
#[case] op: LogicOp,
#[case] ins: impl IntoIterator<Item = bool>,
#[case] out: bool,
) {
use itertools::Itertools;
use crate::extension::ConstFold;
let in_vals = ins
.into_iter()
.enumerate()
.map(|(i, b)| (i.into(), Value::from_bool(b)))
.collect_vec();
assert_eq!(
Some(vec![(0.into(), Value::from_bool(out))]),
op.fold(&[(in_vals.len() as u64).into()], &in_vals)
);
}
#[rstest]
#[case(LogicOp::And, [Some(true), None], None)]
#[case(LogicOp::And, [Some(false), None], Some(false))]
#[case(LogicOp::Or, [None, Some(false)], None)]
#[case(LogicOp::Or, [None, Some(true)], Some(true))]
#[case(LogicOp::Eq, [None, Some(true)], None)]
#[case(LogicOp::Not, [None], None)]
#[case(LogicOp::Xor, [None, Some(true)], None)]
fn partial_const_fold(
#[case] op: LogicOp,
#[case] ins: impl IntoIterator<Item = Option<bool>>,
#[case] mb_out: Option<bool>,
) {
use itertools::Itertools;
use crate::extension::ConstFold;
let in_vals0 = ins.into_iter().enumerate().collect_vec();
let num_args = in_vals0.len() as u64;
let in_vals = in_vals0
.into_iter()
.filter_map(|(i, mb_b)| mb_b.map(|b| (i.into(), Value::from_bool(b))))
.collect_vec();
assert_eq!(
mb_out.map(|out| vec![(0.into(), Value::from_bool(out))]),
op.fold(&[num_args.into()], &in_vals)
);
}
}