nac3/nac3core/src/toplevel/mod.rs

947 lines
41 KiB
Rust
Raw Normal View History

2021-08-27 01:39:15 +08:00
use std::{
borrow::BorrowMut,
collections::{HashMap, HashSet},
iter::FromIterator,
2021-08-27 01:39:15 +08:00
ops::{Deref, DerefMut},
sync::Arc,
};
2021-08-03 13:38:27 +08:00
2021-08-05 14:55:23 +08:00
use super::typecheck::type_inferencer::PrimitiveStore;
use super::typecheck::typedef::{FunSignature, FuncArg, SharedUnifier, Type, TypeEnum, Unifier};
use crate::{
symbol_resolver::SymbolResolver,
typecheck::{type_inferencer::CodeLocation, typedef::CallId},
};
2021-08-23 11:13:45 +08:00
use itertools::{izip, Itertools};
use parking_lot::RwLock;
2021-08-10 21:57:31 +08:00
use rustpython_parser::ast::{self, Stmt};
2021-08-03 13:38:27 +08:00
#[derive(PartialEq, Eq, PartialOrd, Ord, Clone, Copy, Hash)]
pub struct DefinitionId(pub usize);
2021-08-23 02:52:54 +08:00
mod type_annotation;
use type_annotation::*;
2021-08-27 10:21:51 +08:00
mod helper;
2021-08-23 02:52:54 +08:00
#[derive(Clone)]
pub struct FunInstance {
pub body: Vec<Stmt<Option<Type>>>,
pub calls: HashMap<CodeLocation, CallId>,
pub subst: HashMap<u32, Type>,
pub unifier_id: usize,
}
2021-08-03 13:38:27 +08:00
pub enum TopLevelDef {
Class {
// name for error messages and symbols
name: String,
2021-08-03 13:38:27 +08:00
// object ID used for TypeEnum
object_id: DefinitionId,
2021-08-27 01:39:15 +08:00
/// type variables bounded to the class.
type_vars: Vec<Type>,
2021-08-07 15:06:39 +08:00
// class fields
2021-08-03 13:38:27 +08:00
fields: Vec<(String, Type)>,
// class methods, pointing to the corresponding function definition.
2021-08-07 15:06:39 +08:00
methods: Vec<(String, Type, DefinitionId)>,
2021-08-03 13:38:27 +08:00
// ancestor classes, including itself.
2021-08-23 02:52:54 +08:00
ancestors: Vec<TypeAnnotation>,
// symbol resolver of the module defined the class, none if it is built-in type
resolver: Option<Arc<Box<dyn SymbolResolver + Send + Sync>>>,
2021-08-03 13:38:27 +08:00
},
Function {
2021-08-07 15:06:39 +08:00
// prefix for symbol, should be unique globally, and not ending with numbers
name: String,
// function signature.
2021-08-03 13:38:27 +08:00
signature: Type,
// instantiated type variable IDs
var_id: Vec<u32>,
2021-08-03 13:38:27 +08:00
/// Function instance to symbol mapping
/// Key: string representation of type variable values, sorted by variable ID in ascending
/// order, including type variables associated with the class.
/// Value: function symbol name.
instance_to_symbol: HashMap<String, String>,
/// Function instances to annotated AST mapping
/// Key: string representation of type variable values, sorted by variable ID in ascending
/// order, including type variables associated with the class. Excluding rigid type
/// variables.
/// rigid type variables that would be substituted when the function is instantiated.
instance_to_stmt: HashMap<String, FunInstance>,
// symbol resolver of the module defined the class
resolver: Option<Arc<Box<dyn SymbolResolver + Send + Sync>>>,
2021-08-03 13:38:27 +08:00
},
Initializer {
2021-08-10 21:57:31 +08:00
class_id: DefinitionId,
},
2021-08-03 13:38:27 +08:00
}
pub struct TopLevelContext {
pub definitions: Arc<RwLock<Vec<Arc<RwLock<TopLevelDef>>>>>,
2021-08-11 14:37:26 +08:00
pub unifiers: Arc<RwLock<Vec<(SharedUnifier, PrimitiveStore)>>>,
}
pub struct TopLevelComposer {
2021-08-13 02:38:29 +08:00
// list of top level definitions, same as top level context
pub definition_ast_list: Vec<(Arc<RwLock<TopLevelDef>>, Option<ast::Stmt<()>>)>,
2021-08-13 02:38:29 +08:00
// start as a primitive unifier, will add more top_level defs inside
2021-08-17 14:01:18 +08:00
pub unifier: Unifier,
// primitive store
2021-08-23 02:52:54 +08:00
pub primitives_ty: PrimitiveStore,
// keyword list to prevent same user-defined name
pub keyword_list: HashSet<String>,
2021-08-23 02:52:54 +08:00
}
impl Default for TopLevelComposer {
fn default() -> Self {
Self::new()
}
}
impl TopLevelComposer {
/// return a composer and things to make a "primitive" symbol resolver, so that the symbol
2021-08-12 10:50:01 +08:00
/// resolver can later figure out primitive type definitions when passed a primitive type name
pub fn new() -> Self {
let primitives = Self::make_primitives();
2021-08-13 02:38:29 +08:00
let top_level_def_list = vec![
Arc::new(RwLock::new(Self::make_top_level_class_def(0, None, "int32"))),
Arc::new(RwLock::new(Self::make_top_level_class_def(1, None, "int64"))),
Arc::new(RwLock::new(Self::make_top_level_class_def(2, None, "float"))),
Arc::new(RwLock::new(Self::make_top_level_class_def(3, None, "bool"))),
Arc::new(RwLock::new(Self::make_top_level_class_def(4, None, "none"))),
2021-08-13 02:38:29 +08:00
];
let ast_list: Vec<Option<ast::Stmt<()>>> = vec![None, None, None, None, None];
TopLevelComposer {
definition_ast_list: izip!(top_level_def_list, ast_list).collect_vec(),
2021-08-23 02:52:54 +08:00
primitives_ty: primitives.0,
unifier: primitives.1,
// class_method_to_def_id: Default::default(),
// to_be_analyzed_class: Default::default(),
keyword_list: HashSet::from_iter(vec![
2021-08-23 02:52:54 +08:00
"Generic".into(),
"virtual".into(),
"list".into(),
"tuple".into(),
"int32".into(),
"int64".into(),
"float".into(),
"bool".into(),
"none".into(),
"None".into(),
]),
}
}
2021-08-27 10:21:51 +08:00
pub fn make_top_level_context(self) -> TopLevelContext {
TopLevelContext {
definitions: RwLock::new(
self.definition_ast_list.into_iter().map(|(x, ..)| x).collect::<Vec<_>>(),
)
.into(),
// FIXME: all the big unifier or?
unifiers: Default::default(),
}
}
fn extract_def_list(&self) -> Vec<Arc<RwLock<TopLevelDef>>> {
2021-08-23 11:13:45 +08:00
self.definition_ast_list.iter().map(|(def, ..)| def.clone()).collect_vec()
}
/// step 0, register, just remeber the names of top level classes/function
/// and check duplicate class/method/function definition
2021-08-10 21:57:31 +08:00
pub fn register_top_level(
&mut self,
ast: ast::Stmt<()>,
resolver: Option<Arc<Box<dyn SymbolResolver + Send + Sync>>>,
) -> Result<(String, DefinitionId), String> {
let mut defined_class_name: HashSet<String> = HashSet::new();
let mut defined_class_method_name: HashSet<String> = HashSet::new();
let mut defined_function_name: HashSet<String> = HashSet::new();
match &ast.node {
2021-08-10 21:57:31 +08:00
ast::StmtKind::ClassDef { name, body, .. } => {
2021-08-23 02:52:54 +08:00
if self.keyword_list.contains(name) {
2021-08-23 11:13:45 +08:00
return Err("cannot use keyword as a class name".into());
2021-08-23 02:52:54 +08:00
}
if !defined_class_name.insert(name.clone()) {
return Err("duplicate definition of class".into());
}
2021-08-23 11:13:45 +08:00
let class_name = name.to_string();
let class_def_id = self.definition_ast_list.len();
2021-08-11 15:18:21 +08:00
2021-08-13 02:38:29 +08:00
// since later when registering class method, ast will still be used,
// here push None temporarly, later will move the ast inside
let mut class_def_ast = (
2021-08-18 16:33:50 +08:00
Arc::new(RwLock::new(Self::make_top_level_class_def(
class_def_id,
resolver.clone(),
name.as_str(),
2021-08-18 16:33:50 +08:00
))),
None,
);
2021-08-13 13:55:44 +08:00
// parse class def body and register class methods into the def list.
2021-08-12 10:50:01 +08:00
// module's symbol resolver would not know the name of the class methods,
// thus cannot return their definition_id
2021-08-18 16:33:50 +08:00
let mut class_method_name_def_ids: Vec<(
2021-08-23 02:52:54 +08:00
// the simple method name without class name
2021-08-18 16:33:50 +08:00
String,
2021-08-23 02:52:54 +08:00
// in this top level def, method name is prefixed with the class name
2021-08-18 16:33:50 +08:00
Arc<RwLock<TopLevelDef>>,
DefinitionId,
2021-08-23 11:13:45 +08:00
Type,
2021-08-18 16:33:50 +08:00
)> = Vec::new();
// we do not push anything to the def list, so we keep track of the index
// and then push in the correct order after the for loop
let mut class_method_index_offset = 0;
2021-08-10 23:49:58 +08:00
for b in body {
if let ast::StmtKind::FunctionDef { name: method_name, .. } = &b.node {
if self.keyword_list.contains(name) {
return Err("cannot use keyword as a method name".into());
}
let global_class_method_name =
Self::make_class_method_name(class_name.clone(), method_name);
if !defined_class_method_name.insert(global_class_method_name.clone()) {
return Err("duplicate class method definition".into());
}
let method_def_id = self.definition_ast_list.len() + {
// plus 1 here since we already have the class def
class_method_index_offset += 1;
class_method_index_offset
};
// dummy method define here
let dummy_method_type = self.unifier.get_fresh_var();
class_method_name_def_ids.push((
method_name.clone(),
RwLock::new(Self::make_top_level_function_def(
global_class_method_name,
// later unify with parsed type
dummy_method_type.0,
resolver.clone(),
2021-08-18 16:33:50 +08:00
))
.into(),
DefinitionId(method_def_id),
2021-08-23 11:13:45 +08:00
dummy_method_type.0,
));
} else {
// do nothing
2021-08-23 11:13:45 +08:00
continue;
}
2021-08-10 23:49:58 +08:00
}
2021-08-23 11:13:45 +08:00
2021-08-13 02:38:29 +08:00
// move the ast to the entry of the class in the ast_list
class_def_ast.1 = Some(ast);
// get the methods into the class_def
2021-08-23 02:52:54 +08:00
for (name, _, id, ty) in &class_method_name_def_ids {
let mut class_def = class_def_ast.0.write();
if let TopLevelDef::Class { methods, .. } = class_def.deref_mut() {
methods.push((name.clone(), *ty, *id))
2021-08-23 11:13:45 +08:00
} else {
unreachable!()
}
}
// now class_def_ast and class_method_def_ast_ids are ok, put them into actual def list in correct order
self.definition_ast_list.push(class_def_ast);
for (_, def, ..) in class_method_name_def_ids {
self.definition_ast_list.push((def, None));
}
// put the constructor into the def_list
self.definition_ast_list.push((
2021-08-18 16:33:50 +08:00
RwLock::new(TopLevelDef::Initializer { class_id: DefinitionId(class_def_id) })
.into(),
None,
));
Ok((class_name, DefinitionId(class_def_id)))
2021-08-13 02:38:29 +08:00
}
2021-08-10 21:57:31 +08:00
ast::StmtKind::FunctionDef { name, .. } => {
if self.keyword_list.contains(name) {
return Err("cannot use keyword as a top level function name".into());
}
let fun_name = name.to_string();
if !defined_function_name.insert(name.to_string()) {
return Err("duplicate top level function define".into());
}
// add to the definition list
self.definition_ast_list.push((
2021-08-18 16:33:50 +08:00
RwLock::new(Self::make_top_level_function_def(
name.into(),
// unify with correct type later
self.unifier.get_fresh_var().0,
2021-08-18 16:33:50 +08:00
resolver,
))
.into(),
Some(ast),
));
2021-08-13 02:38:29 +08:00
// return
Ok((fun_name, DefinitionId(self.definition_ast_list.len() - 1)))
2021-08-10 21:57:31 +08:00
}
2021-08-10 21:57:31 +08:00
_ => Err("only registrations of top level classes/functions are supprted".into()),
}
}
/// step 1, analyze the type vars associated with top level class
fn analyze_top_level_class_type_var(&mut self) -> Result<(), String> {
2021-08-23 02:52:54 +08:00
let def_list = &self.definition_ast_list;
let temp_def_list = self.extract_def_list();
let unifier = self.unifier.borrow_mut();
let primitives_store = &self.primitives_ty;
for (class_def, class_ast) in def_list {
// only deal with class def here
let mut class_def = class_def.write();
let (class_bases_ast, class_def_type_vars, class_resolver) = {
if let TopLevelDef::Class { type_vars, resolver, .. } = class_def.deref_mut() {
2021-08-16 20:17:08 +08:00
if let Some(ast::Located {
node: ast::StmtKind::ClassDef { bases, .. }, ..
}) = class_ast
{
(bases, type_vars, resolver)
2021-08-16 20:17:08 +08:00
} else {
unreachable!("must be both class")
}
} else {
continue;
}
};
let class_resolver = class_resolver.as_ref().unwrap();
let class_resolver = class_resolver.deref();
2021-08-23 02:52:54 +08:00
let mut is_generic = false;
for b in class_bases_ast {
match &b.node {
// analyze typevars bounded to the class,
// only support things like `class A(Generic[T, V])`,
// things like `class A(Generic[T, V, ImportedModule.T])` is not supported
// i.e. only simple names are allowed in the subscript
// should update the TopLevelDef::Class.typevars and the TypeEnum::TObj.params
ast::ExprKind::Subscript { value, slice, .. }
if {
matches!(
&value.node,
ast::ExprKind::Name { id, .. } if id == "Generic"
)
2021-08-23 11:13:45 +08:00
} =>
{
if !is_generic {
is_generic = true;
} else {
return Err("Only single Generic[...] can be in bases".into());
}
2021-08-23 02:52:54 +08:00
let mut type_var_list: Vec<&ast::Expr<()>> = vec![];
// if `class A(Generic[T, V, G])`
if let ast::ExprKind::Tuple { elts, .. } = &slice.node {
type_var_list.extend(elts.iter());
// `class A(Generic[T])`
} else {
type_var_list.push(slice.deref());
}
2021-08-16 20:17:08 +08:00
// parse the type vars
let type_vars = type_var_list
2021-08-23 02:52:54 +08:00
.into_iter()
.map(|e| {
class_resolver.parse_type_annotation(
&temp_def_list,
unifier,
primitives_store,
2021-08-23 11:13:45 +08:00
e,
2021-08-23 02:52:54 +08:00
)
})
.collect::<Result<Vec<_>, _>>()?;
// check if all are unique type vars
let all_unique_type_var = {
let mut occured_type_var_id: HashSet<u32> = HashSet::new();
type_vars.iter().all(|x| {
let ty = unifier.get_ty(*x);
if let TypeEnum::TVar { id, .. } = ty.as_ref() {
occured_type_var_id.insert(*id)
} else {
false
}
})
};
if !all_unique_type_var {
return Err("expect unique type variables".into());
}
2021-08-23 02:52:54 +08:00
// add to TopLevelDef
class_def_type_vars.extend(type_vars);
2021-08-12 10:50:01 +08:00
}
2021-08-16 20:17:08 +08:00
// if others, do nothing in this function
2021-08-16 20:17:08 +08:00
_ => continue,
}
}
2021-08-16 20:17:08 +08:00
}
Ok(())
}
2021-08-23 02:52:54 +08:00
/// step 2, base classes.
2021-08-25 15:49:24 +08:00
/// now that the type vars of all classes are done, handle base classes and
/// put Self class into the ancestors list. We only allow single inheritance
fn analyze_top_level_class_bases(&mut self) -> Result<(), String> {
2021-08-23 02:52:54 +08:00
let temp_def_list = self.extract_def_list();
let unifier = self.unifier.borrow_mut();
// first, only push direct parent into the list
for (class_def, class_ast) in self.definition_ast_list.iter_mut() {
let mut class_def = class_def.write();
let (class_bases, class_ancestors, class_resolver) = {
if let TopLevelDef::Class { ancestors, resolver, .. } = class_def.deref_mut() {
2021-08-16 20:17:08 +08:00
if let Some(ast::Located {
node: ast::StmtKind::ClassDef { bases, .. }, ..
}) = class_ast
{
(bases, ancestors, resolver)
2021-08-16 20:17:08 +08:00
} else {
unreachable!("must be both class")
}
} else {
continue;
}
};
let class_resolver = class_resolver.as_ref().unwrap();
let class_resolver = class_resolver.deref();
let mut has_base = false;
for b in class_bases {
// type vars have already been handled, so skip on `Generic[...]`
if matches!(
&b.node,
ast::ExprKind::Subscript { value, .. }
if matches!(
&value.node,
ast::ExprKind::Name { id, .. } if id == "Generic"
)
2021-08-23 11:13:45 +08:00
) {
continue;
}
if has_base {
return Err("a class def can only have at most one base class \
2021-08-23 11:13:45 +08:00
declaration and one generic declaration"
.into());
}
2021-08-23 02:52:54 +08:00
has_base = true;
// the function parse_ast_to make sure that no type var occured in
// bast_ty if it is a CustomClassKind
2021-08-23 02:52:54 +08:00
let base_ty = parse_ast_to_type_annotation_kinds(
class_resolver,
&temp_def_list,
unifier,
2021-08-23 02:52:54 +08:00
&self.primitives_ty,
2021-08-23 11:13:45 +08:00
b,
)?;
if let TypeAnnotation::CustomClassKind { .. } = &base_ty {
class_ancestors.push(base_ty);
2021-08-23 02:52:54 +08:00
} else {
2021-08-27 01:39:15 +08:00
return Err("class base declaration can only be custom class".into());
2021-08-23 02:52:54 +08:00
}
}
}
// second get all ancestors
let mut ancestors_store: HashMap<DefinitionId, Vec<TypeAnnotation>> = Default::default();
for (class_def, class_ast) in self.definition_ast_list.iter_mut() {
let mut class_def = class_def.write();
let (class_ancestors, class_id) = {
if let TopLevelDef::Class { ancestors, object_id, .. } = class_def.deref_mut() {
if let Some(ast::Located { node: ast::StmtKind::ClassDef { .. }, .. }) =
class_ast
{
(ancestors, *object_id)
} else {
unreachable!("must be both class")
}
} else {
continue;
}
};
ancestors_store.insert(
class_id,
Self::get_all_ancestors_helper(&class_ancestors[0], temp_def_list.as_slice()),
);
}
// insert the ancestors to the def list
for (class_def, class_ast) in self.definition_ast_list.iter_mut() {
let mut class_def = class_def.write();
let (class_ancestors, class_id) = {
if let TopLevelDef::Class { ancestors, object_id, .. } = class_def.deref_mut() {
if let Some(ast::Located { node: ast::StmtKind::ClassDef { .. }, .. }) =
class_ast
{
(ancestors, *object_id)
} else {
unreachable!("must be both class")
}
} else {
continue;
}
};
let ans = ancestors_store.get_mut(&class_id).unwrap();
class_ancestors.append(ans);
// insert self type annotation
class_ancestors
.insert(0, make_self_type_annotation(temp_def_list.as_slice(), class_id)?);
2021-08-16 20:17:08 +08:00
}
Ok(())
}
/// step 3, class fields and methods
fn analyze_top_level_class_fields_methods(&mut self) -> Result<(), String> {
2021-08-23 02:52:54 +08:00
let temp_def_list = self.extract_def_list();
let unifier = self.unifier.borrow_mut();
let primitives = &self.primitives_ty;
let def_ast_list = &self.definition_ast_list;
2021-08-23 11:13:45 +08:00
2021-08-23 02:52:54 +08:00
let mut type_var_to_concrete_def: HashMap<Type, TypeAnnotation> = HashMap::new();
2021-08-23 02:52:54 +08:00
for (class_def, class_ast) in def_ast_list {
Self::analyze_single_class(
class_def.clone(),
&class_ast.as_ref().unwrap().node,
&temp_def_list,
unifier,
primitives,
2021-08-23 11:13:45 +08:00
&mut type_var_to_concrete_def,
&self.keyword_list,
2021-08-23 02:52:54 +08:00
)?
}
2021-08-23 02:52:54 +08:00
// unification of previously assigned typevar
for (ty, def) in type_var_to_concrete_def {
2021-08-23 11:13:45 +08:00
let target_ty =
get_type_from_type_annotation_kinds(&temp_def_list, unifier, primitives, &def)?;
2021-08-23 02:52:54 +08:00
unifier.unify(ty, target_ty)?;
}
2021-08-23 11:13:45 +08:00
2021-08-23 02:52:54 +08:00
Ok(())
}
2021-08-23 02:52:54 +08:00
/// step 4, after class methods are done
fn analyze_top_level_function(&mut self) -> Result<(), String> {
let def_list = &self.definition_ast_list;
let keyword_list = &self.keyword_list;
2021-08-23 02:52:54 +08:00
let temp_def_list = self.extract_def_list();
let unifier = self.unifier.borrow_mut();
let primitives_store = &self.primitives_ty;
for (function_def, function_ast) in def_list {
let function_def = function_def.read();
let function_def = function_def.deref();
let function_ast = if let Some(function_ast) = function_ast {
function_ast
} else {
// no ast, class method, continue
2021-08-23 02:52:54 +08:00
continue;
};
2021-08-23 02:52:54 +08:00
if let TopLevelDef::Function { signature: dummy_ty, resolver, .. } = function_def {
if let ast::StmtKind::FunctionDef { args, returns, .. } = &function_ast.node {
let resolver = resolver.as_ref();
let resolver = resolver.unwrap();
let resolver = resolver.deref();
2021-08-23 11:13:45 +08:00
let mut function_var_map: HashMap<u32, Type> = HashMap::new();
2021-08-23 02:52:54 +08:00
let arg_types = {
// make sure no duplicate parameter
let mut defined_paramter_name: HashSet<String> = HashSet::new();
let have_unique_fuction_parameter_name = args.args.iter().all(|x| {
defined_paramter_name.insert(x.node.arg.clone())
&& keyword_list.contains(&x.node.arg)
&& "self" != x.node.arg
});
if !have_unique_fuction_parameter_name {
return Err("top level function must have unique parameter names \
and names thould not be the same as the keywords"
.into());
}
2021-08-23 11:13:45 +08:00
args.args
2021-08-23 02:52:54 +08:00
.iter()
.map(|x| -> Result<FuncArg, String> {
let annotation = x
.node
.annotation
.as_ref()
2021-08-23 11:13:45 +08:00
.ok_or_else(|| {
"function parameter type annotation needed".to_string()
})?
2021-08-18 16:33:50 +08:00
.as_ref();
let type_annotation = parse_ast_to_type_annotation_kinds(
resolver,
temp_def_list.as_slice(),
unifier,
primitives_store,
2021-08-27 01:39:15 +08:00
annotation,
)?;
2021-08-27 01:39:15 +08:00
// if there are same type variables appears, we only need to copy them once
2021-08-27 01:39:15 +08:00
let type_vars_within =
get_type_var_contained_in_type_annotation(&type_annotation)
.into_iter()
.map(|x| -> Result<(u32, Type), String> {
if let TypeAnnotation::TypeVarKind(ty) = x {
Ok((get_var_id(ty, unifier)?, ty))
} else {
unreachable!("must be type var annotation kind")
}
})
.collect::<Result<Vec<_>, _>>()?;
for (id, ty) in type_vars_within {
if let Some(prev_ty) = function_var_map.insert(id, ty) {
// if already have the type inserted, make sure they are the same thing
assert_eq!(prev_ty, ty);
}
}
2021-08-27 01:39:15 +08:00
let ty = get_type_from_type_annotation_kinds(
temp_def_list.as_ref(),
unifier,
primitives_store,
&type_annotation,
)?;
2021-08-23 02:52:54 +08:00
Ok(FuncArg {
name: x.node.arg.clone(),
ty,
2021-08-23 11:13:45 +08:00
default_value: Default::default(),
2021-08-23 02:52:54 +08:00
})
})
.collect::<Result<Vec<_>, _>>()?
};
2021-08-18 16:33:50 +08:00
let return_ty_annotation = {
2021-08-23 02:52:54 +08:00
let return_annotation = returns
.as_ref()
.ok_or_else(|| "function return type needed".to_string())?
.as_ref();
2021-08-27 01:39:15 +08:00
parse_ast_to_type_annotation_kinds(
resolver,
&temp_def_list,
2021-08-23 02:52:54 +08:00
unifier,
primitives_store,
2021-08-27 01:39:15 +08:00
return_annotation,
)?
};
let type_vars_within =
get_type_var_contained_in_type_annotation(&return_ty_annotation)
2021-08-27 01:39:15 +08:00
.into_iter()
.map(|x| -> Result<(u32, Type), String> {
if let TypeAnnotation::TypeVarKind(ty) = x {
Ok((get_var_id(ty, unifier)?, ty))
2021-08-27 01:39:15 +08:00
} else {
unreachable!("must be type var here")
}
})
.collect::<Result<Vec<_>, _>>()?;
for (id, ty) in type_vars_within {
if let Some(prev_ty) = function_var_map.insert(id, ty) {
// if already have the type inserted, make sure they are the same thing
assert_eq!(prev_ty, ty);
}
}
2021-08-27 01:39:15 +08:00
let return_ty = get_type_from_type_annotation_kinds(
&temp_def_list,
unifier,
primitives_store,
&return_ty_annotation,
)?;
2021-08-23 11:13:45 +08:00
let function_ty = unifier.add_ty(TypeEnum::TFunc(
FunSignature { args: arg_types, ret: return_ty, vars: function_var_map }
.into(),
2021-08-23 11:13:45 +08:00
));
2021-08-23 02:52:54 +08:00
unifier.unify(*dummy_ty, function_ty)?;
} else {
unreachable!("must be both function");
}
} else {
continue;
}
2021-08-23 11:13:45 +08:00
}
2021-08-23 02:52:54 +08:00
Ok(())
}
/// step 5, field instantiation?
fn analyze_top_level_field_instantiation(&mut self) -> Result<(), String> {
// TODO:
unimplemented!()
}
fn analyze_single_class(
class_def: Arc<RwLock<TopLevelDef>>,
class_ast: &ast::StmtKind<()>,
temp_def_list: &[Arc<RwLock<TopLevelDef>>],
unifier: &mut Unifier,
primitives: &PrimitiveStore,
2021-08-23 11:13:45 +08:00
type_var_to_concrete_def: &mut HashMap<Type, TypeAnnotation>,
keyword_list: &HashSet<String>,
2021-08-23 02:52:54 +08:00
) -> Result<(), String> {
let mut class_def = class_def.write();
let (
class_id,
2021-08-23 02:52:54 +08:00
_class_name,
_class_bases_ast,
class_body_ast,
_class_ancestor_def,
class_fields_def,
class_methods_def,
class_type_vars_def,
2021-08-23 02:52:54 +08:00
class_resolver,
) = if let TopLevelDef::Class {
object_id,
ancestors,
fields,
methods,
resolver,
type_vars,
..
2021-08-23 11:13:45 +08:00
} = class_def.deref_mut()
{
2021-08-23 02:52:54 +08:00
if let ast::StmtKind::ClassDef { name, bases, body, .. } = &class_ast {
2021-08-23 11:13:45 +08:00
(
object_id,
name.clone(),
bases,
body,
ancestors,
fields,
methods,
type_vars,
resolver,
)
2021-08-23 02:52:54 +08:00
} else {
unreachable!("here must be class def ast");
}
} else {
unreachable!("here must be class def ast");
};
let class_resolver = class_resolver.as_ref().unwrap();
let class_resolver = class_resolver.as_ref();
2021-08-18 16:33:50 +08:00
2021-08-23 02:52:54 +08:00
for b in class_body_ast {
if let ast::StmtKind::FunctionDef { args, returns, name, body, .. } = &b.node {
2021-08-23 11:13:45 +08:00
let (method_dummy_ty, ..) =
Self::get_class_method_def_info(class_methods_def, name)?;
// the method var map can surely include the class's generic parameters
2021-08-27 01:39:15 +08:00
let mut method_var_map: HashMap<u32, Type> = class_type_vars_def
.iter()
.map(|ty| {
2021-08-27 01:39:15 +08:00
if let TypeEnum::TVar { id, .. } = unifier.get_ty(*ty).as_ref() {
(*id, *ty)
} else {
unreachable!("must be type var here")
}
})
.collect();
let arg_types: Vec<FuncArg> = {
// check method parameters cannot have same name
let mut defined_paramter_name: HashSet<String> = HashSet::new();
let have_unique_fuction_parameter_name = args.args.iter().all(|x| {
defined_paramter_name.insert(x.node.arg.clone())
&& !keyword_list.contains(&x.node.arg)
});
if !have_unique_fuction_parameter_name {
return Err("class method must have unique parameter names \
and names thould not be the same as the keywords"
.into());
}
2021-08-23 02:52:54 +08:00
let mut result = Vec::new();
2021-08-23 11:13:45 +08:00
for x in &args.args {
2021-08-23 02:52:54 +08:00
let name = x.node.arg.clone();
if name != "self" {
let type_ann = {
let annotation_expr = x
.node
.annotation
.as_ref()
.ok_or_else(|| "type annotation needed".to_string())?
.as_ref();
parse_ast_to_type_annotation_kinds(
class_resolver,
temp_def_list,
unifier,
primitives,
annotation_expr,
)?
};
2021-08-27 01:39:15 +08:00
// find type vars within this method parameter type annotation
let type_vars_within =
get_type_var_contained_in_type_annotation(&type_ann);
// handle the class type var and the method type var
for type_var_within in type_vars_within {
if let TypeAnnotation::TypeVarKind(ty) = type_var_within {
let id = get_var_id(ty, unifier)?;
if let Some(prev_ty) = method_var_map.insert(id, ty) {
// if already in the list, make sure they are the same?
assert_eq!(prev_ty, ty);
}
} else {
unreachable!("must be type var annotation");
}
}
2021-08-27 01:39:15 +08:00
// finish handling type vars
let dummy_func_arg = FuncArg {
name,
ty: unifier.get_fresh_var().0,
// TODO: symbol default value?
default_value: None,
};
// push the dummy type and the type annotation
// into the list for later unification
type_var_to_concrete_def.insert(dummy_func_arg.ty, type_ann.clone());
result.push(dummy_func_arg)
} else {
// if the parameter name is self
// python does not seem to enforce the name
// representing the self class object to be
2021-08-27 01:39:15 +08:00
// `self`??, but we do it here
let dummy_func_arg = FuncArg {
name: "self".into(),
ty: unifier.get_fresh_var().0,
default_value: None,
};
2021-08-27 01:39:15 +08:00
type_var_to_concrete_def.insert(
dummy_func_arg.ty,
make_self_type_annotation(temp_def_list, *class_id)?,
2021-08-27 01:39:15 +08:00
);
result.push(dummy_func_arg);
}
2021-08-23 02:52:54 +08:00
}
result
};
2021-08-27 01:39:15 +08:00
2021-08-23 02:52:54 +08:00
let ret_type = {
if name != "__init__" {
let result = returns
.as_ref()
.ok_or_else(|| "method return type annotation needed".to_string())?
.as_ref();
let annotation = parse_ast_to_type_annotation_kinds(
class_resolver,
temp_def_list,
unifier,
primitives,
result,
)?;
2021-08-27 01:39:15 +08:00
// find type vars within this return type annotation
let type_vars_within =
get_type_var_contained_in_type_annotation(&annotation);
// handle the class type var and the method type var
for type_var_within in type_vars_within {
if let TypeAnnotation::TypeVarKind(ty) = type_var_within {
let id = get_var_id(ty, unifier)?;
if let Some(prev_ty) = method_var_map.insert(id, ty) {
// if already in the list, make sure they are the same?
assert_eq!(prev_ty, ty);
2021-08-27 01:39:15 +08:00
}
} else {
unreachable!("must be type var annotation");
}
}
let dummy_return_type = unifier.get_fresh_var().0;
type_var_to_concrete_def.insert(dummy_return_type, annotation.clone());
dummy_return_type
} else {
// if is the "__init__" function, the return type is self
let dummy_return_type = unifier.get_fresh_var().0;
2021-08-27 01:39:15 +08:00
type_var_to_concrete_def.insert(
dummy_return_type,
make_self_type_annotation(temp_def_list, *class_id)?,
2021-08-27 01:39:15 +08:00
);
dummy_return_type
}
2021-08-23 02:52:54 +08:00
};
2021-08-23 11:13:45 +08:00
let method_type = unifier.add_ty(TypeEnum::TFunc(
FunSignature { args: arg_types, ret: ret_type, vars: method_var_map }.into(),
2021-08-23 11:13:45 +08:00
));
2021-08-27 01:39:15 +08:00
// NOTE: unify now since function type is not in type annotation define
2021-08-23 02:52:54 +08:00
// which is fine since type within method_type will be subst later
unifier.unify(method_dummy_ty, method_type)?;
2021-08-18 16:33:50 +08:00
2021-08-23 02:52:54 +08:00
// class fields
if name == "__init__" {
for b in body {
let mut defined_fields: HashSet<String> = HashSet::new();
// TODO: check the type of value, field instantiation check?
2021-08-23 11:13:45 +08:00
if let ast::StmtKind::AnnAssign { annotation, target, value: _, .. } =
&b.node
{
2021-08-23 02:52:54 +08:00
if let ast::ExprKind::Attribute { value, attr, .. } = &target.node {
2021-08-23 11:13:45 +08:00
if matches!(&value.node, ast::ExprKind::Name { id, .. } if id == "self")
{
2021-08-23 02:52:54 +08:00
if defined_fields.insert(attr.to_string()) {
let dummy_field_type = unifier.get_fresh_var().0;
class_fields_def.push((attr.to_string(), dummy_field_type));
2021-08-27 01:39:15 +08:00
2021-08-23 02:52:54 +08:00
let annotation = parse_ast_to_type_annotation_kinds(
class_resolver,
&temp_def_list,
unifier,
primitives,
2021-08-23 11:13:45 +08:00
annotation.as_ref(),
2021-08-23 02:52:54 +08:00
)?;
2021-08-27 01:39:15 +08:00
// find type vars within this return type annotation
let type_vars_within =
get_type_var_contained_in_type_annotation(&annotation);
// handle the class type var and the method type var
for type_var_within in type_vars_within {
if let TypeAnnotation::TypeVarKind(t) = type_var_within
2021-08-27 01:39:15 +08:00
{
if !class_type_vars_def.contains(&t) {
return Err("class fields can only use type \
vars declared as class generic type vars"
.into());
2021-08-27 01:39:15 +08:00
}
} else {
unreachable!("must be type var annotation");
}
}
2021-08-23 11:13:45 +08:00
type_var_to_concrete_def
.insert(dummy_field_type, annotation);
2021-08-18 16:33:50 +08:00
} else {
2021-08-23 02:52:54 +08:00
return Err("same class fields defined twice".into());
2021-08-18 16:33:50 +08:00
}
}
}
}
}
}
2021-08-18 16:33:50 +08:00
} else {
2021-08-23 02:52:54 +08:00
continue;
}
2021-08-23 11:13:45 +08:00
}
Ok(())
}
2021-08-23 11:13:45 +08:00
}