leo_passes/common_subexpression_elimination/
program.rs

1// Copyright (C) 2019-2025 Provable Inc.
2// This file is part of the Leo library.
3
4// The Leo library is free software: you can redistribute it and/or modify
5// it under the terms of the GNU General Public License as published by
6// the Free Software Foundation, either version 3 of the License, or
7// (at your option) any later version.
8
9// The Leo library is distributed in the hope that it will be useful,
10// but WITHOUT ANY WARRANTY; without even the implied warranty of
11// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12// GNU General Public License for more details.
13
14// You should have received a copy of the GNU General Public License
15// along with the Leo library. If not, see <https://www.gnu.org/licenses/>.
16
17use super::CommonSubexpressionEliminatingVisitor;
18
19use leo_ast::{AstReconstructor, Constructor, Function, Module, ProgramReconstructor};
20
21impl ProgramReconstructor for CommonSubexpressionEliminatingVisitor<'_> {
22    fn reconstruct_program_scope(&mut self, mut input: leo_ast::ProgramScope) -> leo_ast::ProgramScope {
23        input.functions = input.functions.into_iter().map(|(i, f)| (i, self.reconstruct_function(f))).collect();
24        input.constructor = input.constructor.map(|c| self.reconstruct_constructor(c));
25        input
26    }
27
28    fn reconstruct_function(&mut self, mut input: Function) -> Function {
29        input.block = self.reconstruct_block(input.block).0;
30        input
31    }
32
33    fn reconstruct_constructor(&mut self, mut input: Constructor) -> Constructor {
34        input.block = self.reconstruct_block(input.block).0;
35        input
36    }
37
38    fn reconstruct_module(&mut self, mut input: Module) -> Module {
39        input.functions = input.functions.into_iter().map(|(i, f)| (i, self.reconstruct_function(f))).collect();
40        input
41    }
42}