mirror of
https://github.com/roc-lang/roc.git
synced 2025-09-29 06:44:46 +00:00
1009 lines
32 KiB
Rust
1009 lines
32 KiB
Rust
use crate::annotation::IntroducedVariables;
|
|
use crate::def::{can_defs_with_return, Def};
|
|
use crate::env::Env;
|
|
use crate::num::{
|
|
finish_parsing_base, finish_parsing_float, finish_parsing_int, float_expr_from_result,
|
|
int_expr_from_result, num_expr_from_result,
|
|
};
|
|
use crate::pattern::{canonicalize_pattern, Pattern};
|
|
use crate::procedure::References;
|
|
use crate::scope::Scope;
|
|
use roc_collections::all::{ImSet, MutMap, MutSet, SendMap};
|
|
use roc_module::ident::{Lowercase, TagName};
|
|
use roc_module::operator::CalledVia;
|
|
use roc_module::symbol::Symbol;
|
|
use roc_parse::ast;
|
|
use roc_parse::pattern::PatternType::*;
|
|
use roc_problem::can::{PrecedenceProblem, Problem, RuntimeError};
|
|
use roc_region::all::{Located, Region};
|
|
use roc_types::subs::{VarStore, Variable};
|
|
use roc_types::types::Alias;
|
|
use std::fmt::Debug;
|
|
use std::i64;
|
|
use std::ops::Neg;
|
|
|
|
#[derive(Clone, Default, Debug, PartialEq)]
|
|
pub struct Output {
|
|
pub references: References,
|
|
pub tail_call: Option<Symbol>,
|
|
pub introduced_variables: IntroducedVariables,
|
|
pub aliases: SendMap<Symbol, Alias>,
|
|
}
|
|
|
|
impl Output {
|
|
pub fn union(&mut self, other: Self) {
|
|
self.references.union_mut(other.references);
|
|
|
|
if let (None, Some(later)) = (self.tail_call, other.tail_call) {
|
|
self.tail_call = Some(later);
|
|
}
|
|
|
|
self.introduced_variables.union(&other.introduced_variables);
|
|
self.aliases.extend(other.aliases);
|
|
}
|
|
}
|
|
|
|
#[derive(Clone, Debug, PartialEq)]
|
|
pub enum Expr {
|
|
// Literals
|
|
|
|
// Num stores the `a` variable in `Num a`. Not the same as the variable
|
|
// stored in Int and Float below, which is strictly for better error messages
|
|
Num(Variable, i64),
|
|
|
|
// Int and Float store a variable to generate better error messages
|
|
Int(Variable, i64),
|
|
Float(Variable, f64),
|
|
Str(Box<str>),
|
|
BlockStr(Box<str>),
|
|
List {
|
|
elem_var: Variable,
|
|
loc_elems: Vec<Located<Expr>>,
|
|
},
|
|
|
|
// Lookups
|
|
Var(Symbol),
|
|
// Branching
|
|
When {
|
|
cond_var: Variable,
|
|
expr_var: Variable,
|
|
region: Region,
|
|
loc_cond: Box<Located<Expr>>,
|
|
branches: Vec<WhenBranch>,
|
|
},
|
|
If {
|
|
cond_var: Variable,
|
|
branch_var: Variable,
|
|
branches: Vec<(Located<Expr>, Located<Expr>)>,
|
|
final_else: Box<Located<Expr>>,
|
|
},
|
|
|
|
// Let
|
|
LetRec(Vec<Def>, Box<Located<Expr>>, Variable, Aliases),
|
|
LetNonRec(Box<Def>, Box<Located<Expr>>, Variable, Aliases),
|
|
|
|
/// This is *only* for calling functions, not for tag application.
|
|
/// The Tag variant contains any applied values inside it.
|
|
Call(
|
|
Box<(Variable, Located<Expr>, Variable)>,
|
|
Vec<(Variable, Located<Expr>)>,
|
|
CalledVia,
|
|
),
|
|
|
|
Closure(
|
|
Variable,
|
|
Symbol,
|
|
Recursive,
|
|
Vec<(Variable, Located<Pattern>)>,
|
|
Box<(Located<Expr>, Variable)>,
|
|
),
|
|
|
|
// Product Types
|
|
Record {
|
|
record_var: Variable,
|
|
fields: SendMap<Lowercase, Field>,
|
|
},
|
|
|
|
/// Empty record constant
|
|
EmptyRecord,
|
|
|
|
/// Look up exactly one field on a record, e.g. (expr).foo.
|
|
Access {
|
|
record_var: Variable,
|
|
ext_var: Variable,
|
|
field_var: Variable,
|
|
loc_expr: Box<Located<Expr>>,
|
|
field: Lowercase,
|
|
},
|
|
/// field accessor as a function, e.g. (.foo) expr
|
|
Accessor {
|
|
record_var: Variable,
|
|
ext_var: Variable,
|
|
field_var: Variable,
|
|
field: Lowercase,
|
|
},
|
|
|
|
Update {
|
|
record_var: Variable,
|
|
ext_var: Variable,
|
|
symbol: Symbol,
|
|
updates: SendMap<Lowercase, Field>,
|
|
},
|
|
|
|
// Sum Types
|
|
Tag {
|
|
variant_var: Variable,
|
|
ext_var: Variable,
|
|
name: TagName,
|
|
arguments: Vec<(Variable, Located<Expr>)>,
|
|
},
|
|
|
|
// Compiles, but will crash if reached
|
|
RuntimeError(RuntimeError),
|
|
}
|
|
|
|
type Aliases = SendMap<Symbol, Alias>;
|
|
|
|
#[derive(Clone, Debug, PartialEq)]
|
|
pub struct Field {
|
|
pub var: Variable,
|
|
// The region of the full `foo: f bar`, rather than just `f bar`
|
|
pub region: Region,
|
|
pub loc_expr: Box<Located<Expr>>,
|
|
}
|
|
|
|
#[derive(Clone, Debug, PartialEq)]
|
|
pub enum Recursive {
|
|
Recursive,
|
|
TailRecursive,
|
|
NotRecursive,
|
|
}
|
|
|
|
#[derive(Clone, Debug, PartialEq)]
|
|
pub struct WhenBranch {
|
|
pub patterns: Vec<Located<Pattern>>,
|
|
pub value: Located<Expr>,
|
|
pub guard: Option<Located<Expr>>,
|
|
}
|
|
|
|
pub fn canonicalize_expr<'a>(
|
|
env: &mut Env<'a>,
|
|
var_store: &VarStore,
|
|
scope: &mut Scope,
|
|
region: Region,
|
|
expr: &'a ast::Expr<'a>,
|
|
) -> (Located<Expr>, Output) {
|
|
use Expr::*;
|
|
|
|
let (expr, output) = match expr {
|
|
ast::Expr::Num(string) => {
|
|
let answer = num_expr_from_result(var_store, finish_parsing_int(*string), env);
|
|
|
|
(answer, Output::default())
|
|
}
|
|
ast::Expr::Float(string) => {
|
|
let answer = float_expr_from_result(var_store, finish_parsing_float(string), env);
|
|
|
|
(answer, Output::default())
|
|
}
|
|
ast::Expr::Record {
|
|
fields,
|
|
update: Some(loc_update),
|
|
} => {
|
|
let (can_update, update_out) =
|
|
canonicalize_expr(env, var_store, scope, loc_update.region, &loc_update.value);
|
|
if let Var(symbol) = &can_update.value {
|
|
let (can_fields, mut output) =
|
|
canonicalize_fields(env, var_store, scope, region, fields);
|
|
|
|
output.references = output.references.union(update_out.references);
|
|
|
|
let answer = Update {
|
|
record_var: var_store.fresh(),
|
|
ext_var: var_store.fresh(),
|
|
symbol: *symbol,
|
|
updates: can_fields,
|
|
};
|
|
|
|
(answer, output)
|
|
} else {
|
|
panic!(
|
|
"TODO canonicalize invalid record update (non-Var in update position)\n{:?}",
|
|
can_update.value
|
|
);
|
|
}
|
|
}
|
|
ast::Expr::Record {
|
|
fields,
|
|
update: None,
|
|
} => {
|
|
if fields.is_empty() {
|
|
(EmptyRecord, Output::default())
|
|
} else {
|
|
let (can_fields, output) =
|
|
canonicalize_fields(env, var_store, scope, region, fields);
|
|
|
|
(
|
|
Record {
|
|
record_var: var_store.fresh(),
|
|
fields: can_fields,
|
|
},
|
|
output,
|
|
)
|
|
}
|
|
}
|
|
ast::Expr::Str(string) => (Str((*string).into()), Output::default()),
|
|
ast::Expr::BlockStr(lines) => {
|
|
let joined = lines.iter().copied().collect::<Vec<&str>>().join("\n");
|
|
|
|
(BlockStr(joined.into()), Output::default())
|
|
}
|
|
ast::Expr::List(loc_elems) => {
|
|
if loc_elems.is_empty() {
|
|
(
|
|
List {
|
|
elem_var: var_store.fresh(),
|
|
loc_elems: Vec::new(),
|
|
},
|
|
Output::default(),
|
|
)
|
|
} else {
|
|
let mut can_elems = Vec::with_capacity(loc_elems.len());
|
|
let mut references = References::new();
|
|
|
|
for loc_elem in loc_elems.iter() {
|
|
let (can_expr, elem_out) =
|
|
canonicalize_expr(env, var_store, scope, loc_elem.region, &loc_elem.value);
|
|
|
|
references = references.union(elem_out.references);
|
|
|
|
can_elems.push(can_expr);
|
|
}
|
|
|
|
let mut output = Output::default();
|
|
|
|
output.references = references;
|
|
|
|
// A list literal is never a tail call!
|
|
output.tail_call = None;
|
|
|
|
(
|
|
List {
|
|
elem_var: var_store.fresh(),
|
|
loc_elems: can_elems,
|
|
},
|
|
output,
|
|
)
|
|
}
|
|
}
|
|
ast::Expr::Apply(loc_fn, loc_args, application_style) => {
|
|
// The expression that evaluates to the function being called, e.g. `foo` in
|
|
// (foo) bar baz
|
|
let fn_region = loc_fn.region;
|
|
|
|
// Canonicalize the function expression and its arguments
|
|
let (fn_expr, mut output) =
|
|
canonicalize_expr(env, var_store, scope, fn_region, &loc_fn.value);
|
|
|
|
// The function's return type
|
|
let mut args = Vec::new();
|
|
let mut outputs = Vec::new();
|
|
|
|
for loc_arg in loc_args {
|
|
let (arg_expr, arg_out) =
|
|
canonicalize_expr(env, var_store, scope, loc_arg.region, &loc_arg.value);
|
|
|
|
args.push((var_store.fresh(), arg_expr));
|
|
outputs.push(arg_out);
|
|
}
|
|
|
|
// Default: We're not tail-calling a symbol (by name), we're tail-calling a function value.
|
|
output.tail_call = None;
|
|
|
|
let expr = match fn_expr.value {
|
|
Var(symbol) => {
|
|
output.references.calls.insert(symbol);
|
|
|
|
// we're tail-calling a symbol by name, check if it's the tail-callable symbol
|
|
output.tail_call = match &env.tailcallable_symbol {
|
|
Some(tc_sym) if *tc_sym == symbol => Some(symbol),
|
|
Some(_) | None => None,
|
|
};
|
|
|
|
Call(
|
|
Box::new((var_store.fresh(), fn_expr, var_store.fresh())),
|
|
args,
|
|
*application_style,
|
|
)
|
|
}
|
|
RuntimeError(_) => {
|
|
// We can't call a runtime error; bail out by propagating it!
|
|
return (fn_expr, output);
|
|
}
|
|
Tag {
|
|
variant_var,
|
|
ext_var,
|
|
name,
|
|
..
|
|
} => Tag {
|
|
variant_var,
|
|
ext_var,
|
|
name,
|
|
arguments: args,
|
|
},
|
|
_ => {
|
|
// This could be something like ((if True then fn1 else fn2) arg1 arg2).
|
|
Call(
|
|
Box::new((var_store.fresh(), fn_expr, var_store.fresh())),
|
|
args,
|
|
*application_style,
|
|
)
|
|
}
|
|
};
|
|
|
|
for arg_out in outputs {
|
|
output.references = output.references.union(arg_out.references);
|
|
}
|
|
|
|
(expr, output)
|
|
}
|
|
ast::Expr::Var { module_name, ident } => {
|
|
canonicalize_lookup(env, scope, module_name, ident, region)
|
|
} //ast::Expr::InterpolatedStr(pairs, suffix) => {
|
|
// let mut output = Output::new();
|
|
// let can_pairs: Vec<(String, Located<Expr>)> = pairs
|
|
// .into_iter()
|
|
// .map(|(string, loc_ident)| {
|
|
// // From a language design perspective, we only permit idents in interpolation.
|
|
// // However, in a canonical Expr we store it as a full Expr, not a Symbol.
|
|
// // This is so that we can resolve it to either Var or Unrecognized; if we
|
|
// // stored it as a Symbol, we couldn't record runtime errors here.
|
|
// let can_expr = match resolve_ident(
|
|
// &env,
|
|
// &scope,
|
|
// loc_ident.value,
|
|
// &mut output.references,
|
|
// ) {
|
|
// Ok(symbol) => Var(symbol),
|
|
// Err(ident) => {
|
|
// let loc_ident = Located {
|
|
// region: loc_ident.region,
|
|
// value: ident,
|
|
// };
|
|
|
|
// env.problem(Problem::LookupNotInScope(loc_ident.clone()));
|
|
|
|
// RuntimeError(LookupNotInScope(loc_ident))
|
|
// }
|
|
// };
|
|
|
|
// (
|
|
// string,
|
|
// Located {
|
|
// region: loc_ident.region,
|
|
// value: can_expr,
|
|
// },
|
|
// )
|
|
// })
|
|
// .collect();
|
|
|
|
// (InterpolatedStr(can_pairs, suffix), output)
|
|
//}
|
|
ast::Expr::Defs(loc_defs, loc_ret) => {
|
|
can_defs_with_return(
|
|
env,
|
|
var_store,
|
|
// The body expression gets a new scope for canonicalization,
|
|
// so clone it.
|
|
scope.clone(),
|
|
loc_defs,
|
|
loc_ret,
|
|
)
|
|
}
|
|
ast::Expr::Closure(loc_arg_patterns, loc_body_expr) => {
|
|
// The globally unique symbol that will refer to this closure once it gets converted
|
|
// into a top-level procedure for code gen.
|
|
//
|
|
// In the Foo module, this will look something like Foo.$1 or Foo.$2.
|
|
let symbol = env.gen_unique_symbol();
|
|
|
|
// The body expression gets a new scope for canonicalization.
|
|
// Shadow `scope` to make sure we don't accidentally use the original one for the
|
|
// rest of this block, but keep the original around for later diffing.
|
|
let original_scope = scope;
|
|
let mut scope = original_scope.clone();
|
|
let mut can_args = Vec::with_capacity(loc_arg_patterns.len());
|
|
|
|
for loc_pattern in loc_arg_patterns.into_iter() {
|
|
let can_arg = canonicalize_pattern(
|
|
env,
|
|
var_store,
|
|
&mut scope,
|
|
FunctionArg,
|
|
&loc_pattern.value,
|
|
loc_pattern.region,
|
|
);
|
|
|
|
can_args.push((var_store.fresh(), can_arg));
|
|
}
|
|
|
|
let (loc_body_expr, mut output) = canonicalize_expr(
|
|
env,
|
|
var_store,
|
|
&mut scope,
|
|
loc_body_expr.region,
|
|
&loc_body_expr.value,
|
|
);
|
|
// Now that we've collected all the references, check to see if any of the args we defined
|
|
// went unreferenced. If any did, report them as unused arguments.
|
|
for (sub_symbol, region) in scope.symbols() {
|
|
if !original_scope.contains_symbol(*sub_symbol) {
|
|
if !output.references.has_lookup(*sub_symbol) {
|
|
// The body never referenced this argument we declared. It's an unused argument!
|
|
env.problem(Problem::UnusedArgument(symbol, *sub_symbol, *region));
|
|
}
|
|
|
|
// We shouldn't ultimately count arguments as referenced locals. Otherwise,
|
|
// we end up with weird conclusions like the expression (\x -> x + 1)
|
|
// references the (nonexistant) local variable x!
|
|
output.references.lookups.remove(sub_symbol);
|
|
}
|
|
}
|
|
|
|
env.register_closure(symbol.clone(), output.references.clone());
|
|
|
|
(
|
|
Closure(
|
|
var_store.fresh(),
|
|
symbol,
|
|
Recursive::NotRecursive,
|
|
can_args,
|
|
Box::new((loc_body_expr, var_store.fresh())),
|
|
),
|
|
output,
|
|
)
|
|
}
|
|
ast::Expr::When(loc_cond, branches) => {
|
|
// Infer the condition expression's type.
|
|
let cond_var = var_store.fresh();
|
|
let (can_cond, mut output) =
|
|
canonicalize_expr(env, var_store, scope, loc_cond.region, &loc_cond.value);
|
|
|
|
// the condition can never be a tail-call
|
|
output.tail_call = None;
|
|
|
|
let mut can_branches = Vec::with_capacity(branches.len());
|
|
|
|
for branch in branches {
|
|
let (can_when_branch, branch_references) =
|
|
canonicalize_when_branch(env, var_store, scope, region, *branch, &mut output);
|
|
|
|
output.references = output.references.union(branch_references);
|
|
|
|
can_branches.push(can_when_branch);
|
|
}
|
|
|
|
// A "when" with no branches is a runtime error, but it will mess things up
|
|
// if code gen mistakenly thinks this is a tail call just because its condition
|
|
// happend to be one. (The condition gave us our initial output value.)
|
|
if branches.is_empty() {
|
|
output.tail_call = None;
|
|
}
|
|
|
|
// Incorporate all three expressions into a combined Output value.
|
|
let expr = When {
|
|
expr_var: var_store.fresh(),
|
|
cond_var,
|
|
region,
|
|
loc_cond: Box::new(can_cond),
|
|
branches: can_branches,
|
|
};
|
|
|
|
(expr, output)
|
|
}
|
|
ast::Expr::Access(record_expr, field) => {
|
|
let (loc_expr, output) = canonicalize_expr(env, var_store, scope, region, record_expr);
|
|
|
|
(
|
|
Access {
|
|
record_var: var_store.fresh(),
|
|
field_var: var_store.fresh(),
|
|
ext_var: var_store.fresh(),
|
|
loc_expr: Box::new(loc_expr),
|
|
field: Lowercase::from(*field),
|
|
},
|
|
output,
|
|
)
|
|
}
|
|
ast::Expr::AccessorFunction(field) => (
|
|
Accessor {
|
|
record_var: var_store.fresh(),
|
|
ext_var: var_store.fresh(),
|
|
field_var: var_store.fresh(),
|
|
field: (*field).into(),
|
|
},
|
|
Output::default(),
|
|
),
|
|
ast::Expr::GlobalTag(tag) => {
|
|
let variant_var = var_store.fresh();
|
|
let ext_var = var_store.fresh();
|
|
|
|
(
|
|
Tag {
|
|
name: TagName::Global((*tag).into()),
|
|
arguments: vec![],
|
|
variant_var,
|
|
ext_var,
|
|
},
|
|
Output::default(),
|
|
)
|
|
}
|
|
ast::Expr::PrivateTag(tag) => {
|
|
let variant_var = var_store.fresh();
|
|
let ext_var = var_store.fresh();
|
|
let tag_ident = env.ident_ids.get_or_insert(&(*tag).into());
|
|
let symbol = Symbol::new(env.home, tag_ident);
|
|
|
|
(
|
|
Tag {
|
|
name: TagName::Private(symbol),
|
|
arguments: vec![],
|
|
variant_var,
|
|
ext_var,
|
|
},
|
|
Output::default(),
|
|
)
|
|
}
|
|
ast::Expr::If(cond, then_branch, else_branch) => {
|
|
let (loc_cond, mut output) =
|
|
canonicalize_expr(env, var_store, scope, cond.region, &cond.value);
|
|
let (loc_then, then_output) = canonicalize_expr(
|
|
env,
|
|
var_store,
|
|
scope,
|
|
then_branch.region,
|
|
&then_branch.value,
|
|
);
|
|
let (loc_else, else_output) = canonicalize_expr(
|
|
env,
|
|
var_store,
|
|
scope,
|
|
else_branch.region,
|
|
&else_branch.value,
|
|
);
|
|
|
|
output.references = output.references.union(then_output.references);
|
|
output.references = output.references.union(else_output.references);
|
|
|
|
(
|
|
If {
|
|
cond_var: var_store.fresh(),
|
|
branch_var: var_store.fresh(),
|
|
branches: vec![(loc_cond, loc_then)],
|
|
final_else: Box::new(loc_else),
|
|
},
|
|
output,
|
|
)
|
|
}
|
|
|
|
ast::Expr::PrecedenceConflict(whole_region, binop1, binop2, _expr) => {
|
|
use roc_problem::can::RuntimeError::*;
|
|
|
|
let problem = PrecedenceProblem::BothNonAssociative(
|
|
*whole_region,
|
|
binop1.clone(),
|
|
binop2.clone(),
|
|
);
|
|
|
|
env.problem(Problem::PrecedenceProblem(problem.clone()));
|
|
|
|
(
|
|
RuntimeError(InvalidPrecedence(problem, region)),
|
|
Output::default(),
|
|
)
|
|
}
|
|
ast::Expr::MalformedClosure => {
|
|
use roc_problem::can::RuntimeError::*;
|
|
(RuntimeError(MalformedClosure(region)), Output::default())
|
|
}
|
|
ast::Expr::MalformedIdent(name) => {
|
|
use roc_problem::can::RuntimeError::*;
|
|
(
|
|
RuntimeError(MalformedIdentifier((*name).into(), region)),
|
|
Output::default(),
|
|
)
|
|
}
|
|
ast::Expr::Nested(sub_expr) => {
|
|
let (answer, output) = canonicalize_expr(env, var_store, scope, region, sub_expr);
|
|
|
|
(answer.value, output)
|
|
}
|
|
ast::Expr::NonBase10Int {
|
|
string,
|
|
base,
|
|
is_negative,
|
|
} => {
|
|
let mut result = finish_parsing_base(string, *base);
|
|
|
|
if *is_negative {
|
|
result = result.map(i64::neg);
|
|
}
|
|
|
|
let answer = int_expr_from_result(var_store, result, env);
|
|
|
|
(answer, Output::default())
|
|
}
|
|
// Below this point, we shouln't see any of these nodes anymore because
|
|
// operator desugaring should have removed them!
|
|
ast::Expr::ParensAround(sub_expr) => {
|
|
panic!(
|
|
"A ParensAround did not get removed during operator desugaring somehow: {:?}",
|
|
sub_expr
|
|
);
|
|
}
|
|
ast::Expr::SpaceBefore(sub_expr, _spaces) => {
|
|
panic!(
|
|
"A SpaceBefore did not get removed during operator desugaring somehow: {:?}",
|
|
sub_expr
|
|
);
|
|
}
|
|
ast::Expr::SpaceAfter(sub_expr, _spaces) => {
|
|
panic!(
|
|
"A SpaceAfter did not get removed during operator desugaring somehow: {:?}",
|
|
sub_expr
|
|
);
|
|
}
|
|
ast::Expr::BinOp((_, loc_op, _)) => {
|
|
panic!(
|
|
"A binary operator did not get desugared somehow: {:?}",
|
|
loc_op
|
|
);
|
|
}
|
|
ast::Expr::UnaryOp(_, loc_op) => {
|
|
panic!(
|
|
"A unary operator did not get desugared somehow: {:?}",
|
|
loc_op
|
|
);
|
|
}
|
|
};
|
|
|
|
if cfg!(debug_assertions) {
|
|
env.home.register_debug_idents(&env.ident_ids);
|
|
}
|
|
|
|
// At the end, diff used_idents and defined_idents to see which were unused.
|
|
// Add warnings for those!
|
|
|
|
// In a later phase, unused top level declarations won't get monomorphized or code-genned.
|
|
// We aren't going to bother with DCE at the level of local defs. It's going to be
|
|
// a rounding error anyway (especially given that they'll be surfaced as warnings), LLVM will
|
|
// DCE them in optimized builds, and it's not worth the bookkeeping for dev builds.
|
|
(
|
|
Located {
|
|
region,
|
|
value: expr,
|
|
},
|
|
output,
|
|
)
|
|
}
|
|
|
|
#[inline(always)]
|
|
fn canonicalize_when_branch<'a>(
|
|
env: &mut Env<'a>,
|
|
var_store: &VarStore,
|
|
scope: &mut Scope,
|
|
_region: Region,
|
|
branch: &'a ast::WhenBranch<'a>,
|
|
output: &mut Output,
|
|
) -> (WhenBranch, References) {
|
|
let mut patterns = Vec::with_capacity(branch.patterns.len());
|
|
|
|
let original_scope = scope;
|
|
let mut scope = original_scope.clone();
|
|
|
|
// TODO report symbols not bound in all patterns
|
|
for loc_pattern in &branch.patterns {
|
|
patterns.push(canonicalize_pattern(
|
|
env,
|
|
var_store,
|
|
&mut scope,
|
|
WhenBranch,
|
|
&loc_pattern.value,
|
|
loc_pattern.region,
|
|
));
|
|
}
|
|
|
|
let (value, mut branch_output) = canonicalize_expr(
|
|
env,
|
|
var_store,
|
|
&mut scope,
|
|
branch.value.region,
|
|
&branch.value.value,
|
|
);
|
|
|
|
let guard = match &branch.guard {
|
|
None => None,
|
|
Some(loc_expr) => {
|
|
let (can_guard, guard_branch_output) =
|
|
canonicalize_expr(env, var_store, &mut scope, loc_expr.region, &loc_expr.value);
|
|
|
|
branch_output.union(guard_branch_output);
|
|
Some(can_guard)
|
|
}
|
|
};
|
|
|
|
// Now that we've collected all the references for this branch, check to see if
|
|
// any of the new idents it defined were unused. If any were, report it.
|
|
for (symbol, region) in scope.symbols() {
|
|
let symbol = *symbol;
|
|
|
|
if !output.references.has_lookup(symbol)
|
|
&& !branch_output.references.has_lookup(symbol)
|
|
&& !original_scope.contains_symbol(symbol)
|
|
{
|
|
env.problem(Problem::UnusedDef(symbol, *region));
|
|
}
|
|
}
|
|
|
|
let references = branch_output.references.clone();
|
|
output.union(branch_output);
|
|
|
|
(
|
|
WhenBranch {
|
|
patterns,
|
|
value,
|
|
guard,
|
|
},
|
|
references,
|
|
)
|
|
}
|
|
|
|
pub fn local_successors<'a>(
|
|
references: &'a References,
|
|
closures: &'a MutMap<Symbol, References>,
|
|
) -> ImSet<Symbol> {
|
|
let mut answer = im_rc::hashset::HashSet::clone(&references.lookups);
|
|
|
|
for call_symbol in references.calls.iter() {
|
|
answer = answer.union(call_successors(*call_symbol, closures));
|
|
}
|
|
|
|
answer
|
|
}
|
|
|
|
fn call_successors<'a>(
|
|
call_symbol: Symbol,
|
|
closures: &'a MutMap<Symbol, References>,
|
|
) -> ImSet<Symbol> {
|
|
let mut answer = im_rc::hashset::HashSet::default();
|
|
let mut seen = MutSet::default();
|
|
let mut queue = vec![call_symbol];
|
|
|
|
while let Some(symbol) = queue.pop() {
|
|
if seen.contains(&symbol) {
|
|
continue;
|
|
}
|
|
|
|
if let Some(references) = closures.get(&symbol) {
|
|
answer.extend(references.lookups.iter().copied());
|
|
queue.extend(references.calls.iter().copied());
|
|
|
|
seen.insert(symbol);
|
|
}
|
|
}
|
|
|
|
answer
|
|
}
|
|
|
|
pub fn references_from_local<'a, T>(
|
|
defined_symbol: Symbol,
|
|
visited: &'a mut MutSet<Symbol>,
|
|
refs_by_def: &'a MutMap<Symbol, (T, References)>,
|
|
closures: &'a MutMap<Symbol, References>,
|
|
) -> References
|
|
where
|
|
T: Debug,
|
|
{
|
|
let mut answer: References = References::new();
|
|
|
|
match refs_by_def.get(&defined_symbol) {
|
|
Some((_, refs)) => {
|
|
visited.insert(defined_symbol);
|
|
|
|
for local in refs.lookups.iter() {
|
|
if !visited.contains(&local) {
|
|
let other_refs: References =
|
|
references_from_local(*local, visited, refs_by_def, closures);
|
|
|
|
answer = answer.union(other_refs);
|
|
}
|
|
|
|
answer.lookups.insert(local.clone());
|
|
}
|
|
|
|
for call in refs.calls.iter() {
|
|
if !visited.contains(&call) {
|
|
let other_refs = references_from_call(*call, visited, refs_by_def, closures);
|
|
|
|
answer = answer.union(other_refs);
|
|
}
|
|
|
|
answer.calls.insert(call.clone());
|
|
}
|
|
|
|
answer
|
|
}
|
|
None => answer,
|
|
}
|
|
}
|
|
|
|
pub fn references_from_call<'a, T>(
|
|
call_symbol: Symbol,
|
|
visited: &'a mut MutSet<Symbol>,
|
|
refs_by_def: &'a MutMap<Symbol, (T, References)>,
|
|
closures: &'a MutMap<Symbol, References>,
|
|
) -> References
|
|
where
|
|
T: Debug,
|
|
{
|
|
match closures.get(&call_symbol) {
|
|
Some(references) => {
|
|
let mut answer = references.clone();
|
|
|
|
visited.insert(call_symbol);
|
|
|
|
for closed_over_local in references.lookups.iter() {
|
|
if !visited.contains(&closed_over_local) {
|
|
let other_refs =
|
|
references_from_local(*closed_over_local, visited, refs_by_def, closures);
|
|
|
|
answer = answer.union(other_refs);
|
|
}
|
|
|
|
answer.lookups.insert(closed_over_local.clone());
|
|
}
|
|
|
|
for call in references.calls.iter() {
|
|
if !visited.contains(&call) {
|
|
let other_refs = references_from_call(*call, visited, refs_by_def, closures);
|
|
|
|
answer = answer.union(other_refs);
|
|
}
|
|
|
|
answer.calls.insert(*call);
|
|
}
|
|
|
|
answer
|
|
}
|
|
None => {
|
|
// If the call symbol was not in the closure map, that means we're calling a non-function and
|
|
// will get a type mismatch later. For now, assume no references as a result of the "call."
|
|
References::new()
|
|
}
|
|
}
|
|
}
|
|
|
|
fn canonicalize_fields<'a>(
|
|
env: &mut Env<'a>,
|
|
var_store: &VarStore,
|
|
scope: &mut Scope,
|
|
region: Region,
|
|
fields: &'a [Located<ast::AssignedField<'a, ast::Expr<'a>>>],
|
|
) -> (SendMap<Lowercase, Field>, Output) {
|
|
let mut can_fields = SendMap::default();
|
|
let mut output = Output::default();
|
|
|
|
for loc_field in fields.iter() {
|
|
let (label, field_expr, field_out, field_var) =
|
|
canonicalize_field(env, var_store, scope, &loc_field.value, loc_field.region);
|
|
|
|
let field = Field {
|
|
var: field_var,
|
|
region: loc_field.region,
|
|
loc_expr: Box::new(field_expr),
|
|
};
|
|
|
|
let replaced = can_fields.insert(label.clone(), field);
|
|
|
|
if let Some(old) = replaced {
|
|
env.problems.push(Problem::DuplicateRecordFieldValue {
|
|
field_name: label,
|
|
field_region: loc_field.region,
|
|
record_region: region,
|
|
replaced_region: old.region,
|
|
});
|
|
}
|
|
|
|
output.references = output.references.union(field_out.references);
|
|
}
|
|
|
|
(can_fields, output)
|
|
}
|
|
|
|
fn canonicalize_field<'a>(
|
|
env: &mut Env<'a>,
|
|
var_store: &VarStore,
|
|
scope: &mut Scope,
|
|
field: &'a ast::AssignedField<'a, ast::Expr<'a>>,
|
|
region: Region,
|
|
) -> (Lowercase, Located<Expr>, Output, Variable) {
|
|
use roc_parse::ast::AssignedField::*;
|
|
|
|
match field {
|
|
// Both a label and a value, e.g. `{ name: "blah" }`
|
|
LabeledValue(label, _, loc_expr) => {
|
|
let field_var = var_store.fresh();
|
|
let (loc_can_expr, output) =
|
|
canonicalize_expr(env, var_store, scope, loc_expr.region, &loc_expr.value);
|
|
|
|
(
|
|
Lowercase::from(label.value),
|
|
loc_can_expr,
|
|
output,
|
|
field_var,
|
|
)
|
|
}
|
|
|
|
// A label with no value, e.g. `{ name }` (this is sugar for { name: name })
|
|
LabelOnly(_) => {
|
|
panic!("Somehow a LabelOnly record field was not desugared!");
|
|
}
|
|
|
|
SpaceBefore(sub_field, _) | SpaceAfter(sub_field, _) => {
|
|
canonicalize_field(env, var_store, scope, sub_field, region)
|
|
}
|
|
|
|
Malformed(_string) => {
|
|
panic!("TODO canonicalize malformed record field");
|
|
}
|
|
}
|
|
}
|
|
|
|
fn canonicalize_lookup(
|
|
env: &mut Env<'_>,
|
|
scope: &mut Scope,
|
|
module_name: &str,
|
|
ident: &str,
|
|
region: Region,
|
|
) -> (Expr, Output) {
|
|
use Expr::*;
|
|
|
|
let mut output = Output::default();
|
|
let can_expr = if module_name.is_empty() {
|
|
// Since module_name was empty, this is an unqualified var.
|
|
// Look it up in scope!
|
|
match scope.lookup(&(*ident).into(), region) {
|
|
Ok(symbol) => {
|
|
output.references.lookups.insert(symbol);
|
|
|
|
Var(symbol)
|
|
}
|
|
Err(problem) => {
|
|
env.problem(Problem::RuntimeError(problem.clone()));
|
|
|
|
RuntimeError(problem)
|
|
}
|
|
}
|
|
} else {
|
|
// Since module_name was nonempty, this is a qualified var.
|
|
// Look it up in the env!
|
|
match env.qualified_lookup(module_name, ident, region) {
|
|
Ok(symbol) => {
|
|
output.references.lookups.insert(symbol);
|
|
|
|
Var(symbol)
|
|
}
|
|
Err(problem) => {
|
|
// Either the module wasn't imported, or
|
|
// it was imported but it doesn't expose this ident.
|
|
env.problem(Problem::RuntimeError(problem.clone()));
|
|
|
|
RuntimeError(problem)
|
|
}
|
|
}
|
|
};
|
|
|
|
// If it's valid, this ident should be in scope already.
|
|
|
|
(can_expr, output)
|
|
}
|