duskphantom_middle/analysis/
reachability.rs

1// Copyright 2024 Duskphantom Authors
2//
3// Licensed under the Apache License, Version 2.0 (the "License");
4// you may not use this file except in compliance with the License.
5// You may obtain a copy of the License at
6//
7//     http://www.apache.org/licenses/LICENSE-2.0
8//
9// Unless required by applicable law or agreed to in writing, software
10// distributed under the License is distributed on an "AS IS" BASIS,
11// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12// See the License for the specific language governing permissions and
13// limitations under the License.
14//
15// SPDX-License-Identifier: Apache-2.0
16
17use std::collections::HashSet;
18
19use crate::ir::{BBPtr, FunPtr};
20
21pub struct Reachability {
22    reachable: HashSet<BBPtr>,
23}
24
25impl Reachability {
26    pub fn new(func: FunPtr) -> Self {
27        let mut reachable = HashSet::new();
28        for bb in func.dfs_iter() {
29            reachable.insert(bb);
30        }
31        Self { reachable }
32    }
33
34    pub fn is_reachable(&self, bb: BBPtr) -> bool {
35        self.reachable.contains(&bb)
36    }
37}