forked from M-Labs/nac3
338 lines
9.6 KiB
Rust
338 lines
9.6 KiB
Rust
use crate::typecheck::{
|
|
type_inferencer::*,
|
|
typedef::{FunSignature, FuncArg, Type, TypeEnum, Unifier},
|
|
};
|
|
use nac3parser::ast::StrRef;
|
|
use nac3parser::ast::{Cmpop, Operator, Unaryop};
|
|
use std::collections::HashMap;
|
|
use std::rc::Rc;
|
|
|
|
#[must_use]
|
|
pub fn binop_name(op: &Operator) -> &'static str {
|
|
match op {
|
|
Operator::Add => "__add__",
|
|
Operator::Sub => "__sub__",
|
|
Operator::Div => "__truediv__",
|
|
Operator::Mod => "__mod__",
|
|
Operator::Mult => "__mul__",
|
|
Operator::Pow => "__pow__",
|
|
Operator::BitOr => "__or__",
|
|
Operator::BitXor => "__xor__",
|
|
Operator::BitAnd => "__and__",
|
|
Operator::LShift => "__lshift__",
|
|
Operator::RShift => "__rshift__",
|
|
Operator::FloorDiv => "__floordiv__",
|
|
Operator::MatMult => "__matmul__",
|
|
}
|
|
}
|
|
|
|
#[must_use]
|
|
pub fn binop_assign_name(op: &Operator) -> &'static str {
|
|
match op {
|
|
Operator::Add => "__iadd__",
|
|
Operator::Sub => "__isub__",
|
|
Operator::Div => "__itruediv__",
|
|
Operator::Mod => "__imod__",
|
|
Operator::Mult => "__imul__",
|
|
Operator::Pow => "__ipow__",
|
|
Operator::BitOr => "__ior__",
|
|
Operator::BitXor => "__ixor__",
|
|
Operator::BitAnd => "__iand__",
|
|
Operator::LShift => "__ilshift__",
|
|
Operator::RShift => "__irshift__",
|
|
Operator::FloorDiv => "__ifloordiv__",
|
|
Operator::MatMult => "__imatmul__",
|
|
}
|
|
}
|
|
|
|
#[must_use]
|
|
pub fn unaryop_name(op: &Unaryop) -> &'static str {
|
|
match op {
|
|
Unaryop::UAdd => "__pos__",
|
|
Unaryop::USub => "__neg__",
|
|
Unaryop::Not => "__not__",
|
|
Unaryop::Invert => "__inv__",
|
|
}
|
|
}
|
|
|
|
#[must_use]
|
|
pub fn comparison_name(op: &Cmpop) -> Option<&'static str> {
|
|
match op {
|
|
Cmpop::Lt => Some("__lt__"),
|
|
Cmpop::LtE => Some("__le__"),
|
|
Cmpop::Gt => Some("__gt__"),
|
|
Cmpop::GtE => Some("__ge__"),
|
|
Cmpop::Eq => Some("__eq__"),
|
|
Cmpop::NotEq => Some("__ne__"),
|
|
_ => None,
|
|
}
|
|
}
|
|
|
|
pub(super) fn with_fields<F>(unifier: &mut Unifier, ty: Type, f: F)
|
|
where
|
|
F: FnOnce(&mut Unifier, &mut HashMap<StrRef, (Type, bool)>),
|
|
{
|
|
let (id, mut fields, params) =
|
|
if let TypeEnum::TObj { obj_id, fields, params } = &*unifier.get_ty(ty) {
|
|
(*obj_id, fields.clone(), params.clone())
|
|
} else {
|
|
unreachable!()
|
|
};
|
|
f(unifier, &mut fields);
|
|
unsafe {
|
|
let unification_table = unifier.get_unification_table();
|
|
unification_table.set_value(ty, Rc::new(TypeEnum::TObj { obj_id: id, fields, params }));
|
|
}
|
|
}
|
|
|
|
pub fn impl_binop(
|
|
unifier: &mut Unifier,
|
|
_store: &PrimitiveStore,
|
|
ty: Type,
|
|
other_ty: &[Type],
|
|
ret_ty: Type,
|
|
ops: &[Operator],
|
|
) {
|
|
with_fields(unifier, ty, |unifier, fields| {
|
|
let (other_ty, other_var_id) = if other_ty.len() == 1 {
|
|
(other_ty[0], None)
|
|
} else {
|
|
let (ty, var_id) = unifier.get_fresh_var_with_range(other_ty, Some("N".into()), None);
|
|
(ty, Some(var_id))
|
|
};
|
|
|
|
let function_vars = if let Some(var_id) = other_var_id {
|
|
vec![(var_id, other_ty)].into_iter().collect::<HashMap<_, _>>()
|
|
} else {
|
|
HashMap::new()
|
|
};
|
|
|
|
for op in ops {
|
|
fields.insert(binop_name(op).into(), {
|
|
(
|
|
unifier.add_ty(TypeEnum::TFunc(FunSignature {
|
|
ret: ret_ty,
|
|
vars: function_vars.clone(),
|
|
args: vec![FuncArg {
|
|
ty: other_ty,
|
|
default_value: None,
|
|
name: "other".into(),
|
|
}],
|
|
})),
|
|
false,
|
|
)
|
|
});
|
|
|
|
fields.insert(binop_assign_name(op).into(), {
|
|
(
|
|
unifier.add_ty(TypeEnum::TFunc(FunSignature {
|
|
ret: ret_ty,
|
|
vars: function_vars.clone(),
|
|
args: vec![FuncArg {
|
|
ty: other_ty,
|
|
default_value: None,
|
|
name: "other".into(),
|
|
}],
|
|
})),
|
|
false,
|
|
)
|
|
});
|
|
}
|
|
});
|
|
}
|
|
|
|
pub fn impl_unaryop(unifier: &mut Unifier, ty: Type, ret_ty: Type, ops: &[Unaryop]) {
|
|
with_fields(unifier, ty, |unifier, fields| {
|
|
for op in ops {
|
|
fields.insert(
|
|
unaryop_name(op).into(),
|
|
(
|
|
unifier.add_ty(TypeEnum::TFunc(FunSignature {
|
|
ret: ret_ty,
|
|
vars: HashMap::new(),
|
|
args: vec![],
|
|
})),
|
|
false,
|
|
),
|
|
);
|
|
}
|
|
});
|
|
}
|
|
|
|
pub fn impl_cmpop(
|
|
unifier: &mut Unifier,
|
|
store: &PrimitiveStore,
|
|
ty: Type,
|
|
other_ty: Type,
|
|
ops: &[Cmpop],
|
|
) {
|
|
with_fields(unifier, ty, |unifier, fields| {
|
|
for op in ops {
|
|
fields.insert(
|
|
comparison_name(op).unwrap().into(),
|
|
(
|
|
unifier.add_ty(TypeEnum::TFunc(FunSignature {
|
|
ret: store.bool,
|
|
vars: HashMap::new(),
|
|
args: vec![FuncArg {
|
|
ty: other_ty,
|
|
default_value: None,
|
|
name: "other".into(),
|
|
}],
|
|
})),
|
|
false,
|
|
),
|
|
);
|
|
}
|
|
});
|
|
}
|
|
|
|
/// `Add`, `Sub`, `Mult`
|
|
pub fn impl_basic_arithmetic(
|
|
unifier: &mut Unifier,
|
|
store: &PrimitiveStore,
|
|
ty: Type,
|
|
other_ty: &[Type],
|
|
ret_ty: Type,
|
|
) {
|
|
impl_binop(
|
|
unifier,
|
|
store,
|
|
ty,
|
|
other_ty,
|
|
ret_ty,
|
|
&[Operator::Add, Operator::Sub, Operator::Mult],
|
|
);
|
|
}
|
|
|
|
/// `Pow`
|
|
pub fn impl_pow(
|
|
unifier: &mut Unifier,
|
|
store: &PrimitiveStore,
|
|
ty: Type,
|
|
other_ty: &[Type],
|
|
ret_ty: Type,
|
|
) {
|
|
impl_binop(unifier, store, ty, other_ty, ret_ty, &[Operator::Pow]);
|
|
}
|
|
|
|
/// `BitOr`, `BitXor`, `BitAnd`
|
|
pub fn impl_bitwise_arithmetic(unifier: &mut Unifier, store: &PrimitiveStore, ty: Type) {
|
|
impl_binop(
|
|
unifier,
|
|
store,
|
|
ty,
|
|
&[ty],
|
|
ty,
|
|
&[Operator::BitAnd, Operator::BitOr, Operator::BitXor],
|
|
);
|
|
}
|
|
|
|
/// `LShift`, `RShift`
|
|
pub fn impl_bitwise_shift(unifier: &mut Unifier, store: &PrimitiveStore, ty: Type) {
|
|
impl_binop(unifier, store, ty, &[store.int32, store.uint32], ty, &[Operator::LShift, Operator::RShift]);
|
|
}
|
|
|
|
/// `Div`
|
|
pub fn impl_div(unifier: &mut Unifier, store: &PrimitiveStore, ty: Type, other_ty: &[Type]) {
|
|
impl_binop(unifier, store, ty, other_ty, store.float, &[Operator::Div]);
|
|
}
|
|
|
|
/// `FloorDiv`
|
|
pub fn impl_floordiv(
|
|
unifier: &mut Unifier,
|
|
store: &PrimitiveStore,
|
|
ty: Type,
|
|
other_ty: &[Type],
|
|
ret_ty: Type,
|
|
) {
|
|
impl_binop(unifier, store, ty, other_ty, ret_ty, &[Operator::FloorDiv]);
|
|
}
|
|
|
|
/// `Mod`
|
|
pub fn impl_mod(
|
|
unifier: &mut Unifier,
|
|
store: &PrimitiveStore,
|
|
ty: Type,
|
|
other_ty: &[Type],
|
|
ret_ty: Type,
|
|
) {
|
|
impl_binop(unifier, store, ty, other_ty, ret_ty, &[Operator::Mod]);
|
|
}
|
|
|
|
/// `UAdd`, `USub`
|
|
pub fn impl_sign(unifier: &mut Unifier, _store: &PrimitiveStore, ty: Type) {
|
|
impl_unaryop(unifier, ty, ty, &[Unaryop::UAdd, Unaryop::USub]);
|
|
}
|
|
|
|
/// `Invert`
|
|
pub fn impl_invert(unifier: &mut Unifier, _store: &PrimitiveStore, ty: Type) {
|
|
impl_unaryop(unifier, ty, ty, &[Unaryop::Invert]);
|
|
}
|
|
|
|
/// `Not`
|
|
pub fn impl_not(unifier: &mut Unifier, store: &PrimitiveStore, ty: Type) {
|
|
impl_unaryop(unifier, ty, store.bool, &[Unaryop::Not]);
|
|
}
|
|
|
|
/// `Lt`, `LtE`, `Gt`, `GtE`
|
|
pub fn impl_comparison(unifier: &mut Unifier, store: &PrimitiveStore, ty: Type, other_ty: Type) {
|
|
impl_cmpop(
|
|
unifier,
|
|
store,
|
|
ty,
|
|
other_ty,
|
|
&[Cmpop::Lt, Cmpop::Gt, Cmpop::LtE, Cmpop::GtE],
|
|
);
|
|
}
|
|
|
|
/// `Eq`, `NotEq`
|
|
pub fn impl_eq(unifier: &mut Unifier, store: &PrimitiveStore, ty: Type) {
|
|
impl_cmpop(unifier, store, ty, ty, &[Cmpop::Eq, Cmpop::NotEq]);
|
|
}
|
|
|
|
pub fn set_primitives_magic_methods(store: &PrimitiveStore, unifier: &mut Unifier) {
|
|
let PrimitiveStore {
|
|
int32: int32_t,
|
|
int64: int64_t,
|
|
float: float_t,
|
|
bool: bool_t,
|
|
uint32: uint32_t,
|
|
uint64: uint64_t,
|
|
..
|
|
} = *store;
|
|
|
|
/* int ======== */
|
|
for t in [int32_t, int64_t, uint32_t, uint64_t] {
|
|
impl_basic_arithmetic(unifier, store, t, &[t], t);
|
|
impl_pow(unifier, store, t, &[t], t);
|
|
impl_bitwise_arithmetic(unifier, store, t);
|
|
impl_bitwise_shift(unifier, store, t);
|
|
impl_div(unifier, store, t, &[t]);
|
|
impl_floordiv(unifier, store, t, &[t], t);
|
|
impl_mod(unifier, store, t, &[t], t);
|
|
impl_invert(unifier, store, t);
|
|
impl_not(unifier, store, t);
|
|
impl_comparison(unifier, store, t, t);
|
|
impl_eq(unifier, store, t);
|
|
}
|
|
for t in [int32_t, int64_t] {
|
|
impl_sign(unifier, store, t);
|
|
}
|
|
|
|
/* float ======== */
|
|
impl_basic_arithmetic(unifier, store, float_t, &[float_t], float_t);
|
|
impl_pow(unifier, store, float_t, &[int32_t, float_t], float_t);
|
|
impl_div(unifier, store, float_t, &[float_t]);
|
|
impl_floordiv(unifier, store, float_t, &[float_t], float_t);
|
|
impl_mod(unifier, store, float_t, &[float_t], float_t);
|
|
impl_sign(unifier, store, float_t);
|
|
impl_not(unifier, store, float_t);
|
|
impl_comparison(unifier, store, float_t, float_t);
|
|
impl_eq(unifier, store, float_t);
|
|
|
|
/* bool ======== */
|
|
impl_not(unifier, store, bool_t);
|
|
impl_eq(unifier, store, bool_t);
|
|
}
|