lambdust 0.1.1

A Scheme dialect with gradual typing and effect systems
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
44
45
46
47
48
49

//! Control flow analysis components.

use crate::ast::Expr;
use crate::diagnostics::Spanned;
use std::collections::HashMap;

/// Control flow graph for a program.
#[derive(Debug, Clone)]
pub struct ControlFlowGraph {
    /// Basic blocks
    pub blocks: HashMap<String, BasicBlock>,
    /// Entry block
    pub entry: String,
    /// Exit blocks
    pub exits: Vec<String>,
    /// Dominator tree
    pub dominators: HashMap<String, String>,
}

/// Basic block in control flow.
#[derive(Debug, Clone)]
pub struct BasicBlock {
    /// Block identifier
    pub id: String,
    /// Expressions in the block
    pub expressions: Vec<Spanned<Expr>>,
    /// Successor blocks
    pub successors: Vec<String>,
    /// Predecessor blocks
    pub predecessors: Vec<String>,
}

impl ControlFlowGraph {
    /// Creates a new empty control flow graph.
    pub fn new() -> Self {
        Self {
            blocks: HashMap::new(),
            entry: String::new(),
            exits: Vec::new(),
            dominators: HashMap::new(),
        }
    }
}

impl Default for ControlFlowGraph {
    fn default() -> Self {
        Self::new()
    }
}