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

// Copyright (C) 2019-2024 Aleo Systems Inc.
// This file is part of the Leo library.

// The Leo library is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.

// The Leo library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with the Leo library. If not, see <https://www.gnu.org/licenses/>.

mod await_checker;

pub mod check_expressions;

pub mod check_program;

pub mod check_statements;

pub mod checker;

mod scope_state;

pub use checker::*;

use crate::{CallGraph, Pass, StructGraph, SymbolTable, TypeTable};

use leo_ast::{Ast, ProgramVisitor};
use leo_errors::{Result, emitter::Handler};

use snarkvm::prelude::Network;

impl<'a, N: Network> Pass for TypeChecker<'a, N> {
    type Input = (&'a Ast, &'a Handler, SymbolTable, &'a TypeTable, usize, bool);
    type Output = Result<(SymbolTable, StructGraph, CallGraph)>;

    fn do_pass((ast, handler, st, tt, max_depth, await_checking): Self::Input) -> Self::Output {
        let mut visitor = TypeChecker::<N>::new(st, tt, handler, max_depth, await_checking);
        visitor.visit_program(ast.as_repr());
        handler.last_err().map_err(|e| *e)?;

        // Remove unused structs from the struct graph.
        // This prevents unused struct definitions from being included in the generated bytecode.
        visitor.struct_graph.retain_nodes(&visitor.used_structs);
        Ok((visitor.symbol_table.take(), visitor.struct_graph, visitor.call_graph))
    }
}