1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
use crate::{
declaration_engine::declaration_engine::*, error::*, parse_tree::*, semantic_analysis::*,
type_system::*,
};
use sway_types::{Ident, Spanned};
#[derive(Clone, Debug)]
pub struct TypedModule {
pub submodules: Vec<(DepName, TypedSubmodule)>,
pub namespace: namespace::Module,
pub all_nodes: Vec<TypedAstNode>,
}
#[derive(Clone, Debug)]
pub struct TypedSubmodule {
pub library_name: Ident,
pub module: TypedModule,
}
impl TypedModule {
/// Type-check the given parsed module to produce a typed module.
///
/// Recursively type-checks submodules first.
pub fn type_check(mut ctx: TypeCheckContext, parsed: &ParseModule) -> CompileResult<Self> {
let ParseModule { submodules, tree } = parsed;
// Type-check submodules first in order of declaration.
let mut submodules_res = ok(vec![], vec![], vec![]);
for (name, submodule) in submodules {
let submodule_res = TypedSubmodule::type_check(ctx.by_ref(), name.clone(), submodule);
submodules_res = submodules_res.flat_map(|mut submodules| {
submodule_res.map(|submodule| {
submodules.push((name.clone(), submodule));
submodules
})
});
}
// TODO: Ordering should be solved across all modules prior to the beginning of type-check.
let ordered_nodes_res =
node_dependencies::order_ast_nodes_by_dependency(tree.root_nodes.clone());
let typed_nodes_res = ordered_nodes_res
.flat_map(|ordered_nodes| Self::type_check_nodes(ctx.by_ref(), ordered_nodes));
let validated_nodes_res = typed_nodes_res.flat_map(|typed_nodes| {
let errors = check_supertraits(&typed_nodes, ctx.namespace);
ok(typed_nodes, vec![], errors)
});
submodules_res.flat_map(|submodules| {
validated_nodes_res.map(|all_nodes| Self {
submodules,
namespace: ctx.namespace.module().clone(),
all_nodes,
})
})
}
fn type_check_nodes(
mut ctx: TypeCheckContext,
nodes: Vec<AstNode>,
) -> CompileResult<Vec<TypedAstNode>> {
let mut warnings = Vec::new();
let mut errors = Vec::new();
let typed_nodes = nodes
.into_iter()
.map(|node| TypedAstNode::type_check(ctx.by_ref(), node))
.filter_map(|res| res.ok(&mut warnings, &mut errors))
.collect();
if !errors.is_empty() {
err(warnings, errors)
} else {
ok(typed_nodes, warnings, errors)
}
}
}
impl TypedSubmodule {
pub fn type_check(
parent_ctx: TypeCheckContext,
dep_name: DepName,
submodule: &ParseSubmodule,
) -> CompileResult<Self> {
let ParseSubmodule {
library_name,
module,
} = submodule;
parent_ctx.enter_submodule(dep_name, |submod_ctx| {
let module_res = TypedModule::type_check(submod_ctx, module);
module_res.map(|module| TypedSubmodule {
library_name: library_name.clone(),
module,
})
})
}
}
/// Given a list of typed AST nodes and a namespace, check whether all supertrait constraints are
/// satisfied. We're basically checking the following condition:
/// if trait B is implemented for type T, then trait A_i is also implemented for type T for
/// every A_i such that A_i is a supertrait of B.
///
/// This nicely works for transitive supertraits as well.
///
fn check_supertraits(
typed_tree_nodes: &[TypedAstNode],
namespace: &Namespace,
) -> Vec<CompileError> {
let mut errors = vec![];
for node in typed_tree_nodes {
if let TypedAstNodeContent::Declaration(TypedDeclaration::ImplTrait(decl_id)) =
&node.content
{
let TypedImplTrait {
trait_name,
span,
implementing_for_type_id,
..
} = match de_get_impl_trait(decl_id.clone(), &node.span) {
Ok(impl_trait) => impl_trait,
Err(e) => {
errors.push(e);
return errors;
}
};
if let CompileResult {
value: Some(TypedDeclaration::TraitDeclaration(decl_id)),
..
} = namespace.resolve_call_path(&trait_name)
{
let tr = match de_get_trait(decl_id.clone(), &trait_name.span()) {
Ok(tr) => tr,
Err(e) => {
errors.push(e);
return errors;
}
};
for supertrait in &tr.supertraits {
if !typed_tree_nodes.iter().any(|search_node| {
if let TypedAstNodeContent::Declaration(TypedDeclaration::ImplTrait(
decl_id,
)) = &search_node.content
{
let TypedImplTrait {
trait_name: search_node_trait_name,
implementing_for_type_id: search_node_type_implementing_for,
..
} = match de_get_impl_trait(decl_id.clone(), &search_node.span) {
Ok(impl_trait) => impl_trait,
Err(e) => {
errors.push(e);
return false;
}
};
if let (
CompileResult {
value: Some(TypedDeclaration::TraitDeclaration(decl_id1)),
..
},
CompileResult {
value: Some(TypedDeclaration::TraitDeclaration(decl_id2)),
..
},
) = (
namespace.resolve_call_path(&search_node_trait_name),
namespace.resolve_call_path(&supertrait.name),
) {
let tr1 = match de_get_trait(
decl_id1.clone(),
&search_node_trait_name.span(),
) {
Ok(tr) => tr,
Err(e) => {
errors.push(e);
return false;
}
};
let tr2 =
match de_get_trait(decl_id2.clone(), &supertrait.name.span()) {
Ok(tr) => tr,
Err(e) => {
errors.push(e);
return false;
}
};
return (tr1.name == tr2.name)
&& (look_up_type_id(implementing_for_type_id)
== look_up_type_id(search_node_type_implementing_for));
}
}
false
}) {
// The two errors below should really be a single error (and a "note"),
// but we don't have a way today to point to two separate locations in the
// user code with a single error.
errors.push(CompileError::SupertraitImplMissing {
supertrait_name: supertrait.name.clone(),
type_name: implementing_for_type_id.to_string(),
span: span.clone(),
});
errors.push(CompileError::SupertraitImplRequired {
supertrait_name: supertrait.name.clone(),
trait_name: tr.name.clone(),
span: tr.name.span().clone(),
});
}
}
}
}
}
errors
}