kasl-ir 0.3.5

//
//  Copyright 2026 Shuntaro Kasatani
//
//  Licensed under the Apache License, Version 2.0 (the "License");
//  you may not use this file except in compliance with the License.
//  You may obtain a copy of the License at
//
//      http://www.apache.org/licenses/LICENSE-2.0
//
//  Unless required by applicable law or agreed to in writing, software
//  distributed under the License is distributed on an "AS IS" BASIS,
//  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
//  See the License for the specific language governing permissions and
//  limitations under the License.
//

mod const_folding;
mod passes;
mod value_replacement;

use crate::{Const, Function, Value};
use std::collections::HashMap;

#[derive(Default)]
pub struct Optimizer {
    /// Value replacement map for tracking value replacements occured during optimization.
    value_replace_map: HashMap<Value, Value>,
    /// Constant value map for tracking constant values of SSA values.
    const_map: HashMap<Value, Const>,
}

impl Optimizer {
    pub fn optimize(&mut self, mut func: Function) -> Function {
        for block in func.blocks.values_mut() {
            let insts = std::mem::take(&mut block.insts);
            let insts = self.elim_store_load(insts);
            let insts = self.fold_ptr_add(insts);
            self.collect_consts(&insts);
            block.insts = insts;
        }

        for block in func.blocks.values_mut() {
            let insts = std::mem::take(&mut block.insts);
            let insts = self.replace_values_in_block(insts);
            let insts = self.fold_consts(insts);
            block.insts = insts;
        }
        func
    }
}