leo_passes/dead_code_elimination/
dead_code_eliminator.rs

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
// Copyright (C) 2019-2025 Provable 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/>.

use leo_ast::NodeBuilder;
use leo_span::Symbol;

use indexmap::IndexSet;

pub struct DeadCodeEliminator<'a> {
    /// A counter to generate unique node IDs.
    pub(crate) node_builder: &'a NodeBuilder,
    /// The set of used variables in the current function body.
    pub(crate) used_variables: IndexSet<Symbol>,
    /// Whether or not the variables are necessary.
    pub(crate) is_necessary: bool,
    /// Whether or not we are currently traversing an async function.
    pub(crate) is_async: bool,
}

impl<'a> DeadCodeEliminator<'a> {
    /// Initializes a new `DeadCodeEliminator`.
    pub fn new(node_builder: &'a NodeBuilder) -> Self {
        Self { node_builder, used_variables: Default::default(), is_necessary: false, is_async: false }
    }
}