dscale 0.5.2

A fast & deterministic simulation framework for benchmarking and testing distributed systems
Documentation 
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

use crate::Pid;

#[derive(Clone, Copy, PartialEq, Eq)]
pub(crate) enum LinkState {
    Broken,
    Alive,
}

pub(crate) struct FaultState {
    link_matrix: Vec<Vec<LinkState>>,
}

impl FaultState {
    pub(crate) fn new(size: usize) -> Self {
        Self {
            link_matrix: vec![vec![LinkState::Alive; size]; size],
        }
    }

    pub(crate) fn break_link(&mut self, pid1: Pid, pid2: Pid) {
        self.sym_change_state(pid1, pid2, LinkState::Broken);
    }

    pub(crate) fn isolate(&mut self, pid: Pid) {
        for other in 0..self.link_matrix.len() {
            self.break_link(pid, other);
        }
    }

    pub(crate) fn restore(&mut self, pid: Pid) {
        for other in 0..self.link_matrix.len() {
            self.restore_link(pid, other);
        }
    }

    pub(crate) fn restore_link(&mut self, pid1: Pid, pid2: Pid) {
        self.sym_change_state(pid1, pid2, LinkState::Alive);
    }

    pub(crate) fn is_link_broken(&self, pid1: Pid, pid2: Pid) -> bool {
        self.link_matrix[pid1][pid2] == LinkState::Broken
    }

    fn sym_change_state(&mut self, pid1: Pid, pid2: Pid, state: LinkState) {
        self.link_matrix[pid1][pid2] = state;
        self.link_matrix[pid2][pid1] = state;
    }
}