leo_passes/dead_code_elimination/
eliminate_program.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
39
40
41
42
43
// 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 crate::DeadCodeEliminator;

use leo_ast::{Function, ProgramReconstructor, StatementReconstructor};

impl ProgramReconstructor for DeadCodeEliminator<'_> {
    fn reconstruct_function(&mut self, input: Function) -> Function {
        // Reset the state of the dead code eliminator.
        self.used_variables.clear();
        self.is_necessary = false;
        self.is_async = input.variant.is_async_function();

        // Traverse the function body.
        let block = self.reconstruct_block(input.block).0;

        Function {
            annotations: input.annotations,
            variant: input.variant,
            identifier: input.identifier,
            input: input.input,
            output: input.output,
            output_type: input.output_type,
            block,
            span: input.span,
            id: input.id,
        }
    }
}