Grcov report - assertions.rs

1

//! Debug-only structural assertions for AST/model integrity.

2

//!

3

//! The assertions in this module validate a few key invariants:

4

//! - `Root` exists exactly once, at the top-level model root, and nowhere else.

5

//! - all referenced names resolve to declarations present in reachable symbol tables.

6

//! - a combined model well-formedness check that applies all assertions.

7

8

use super::Model;

9

10

#[cfg(debug_assertions)]

11

use std::collections::{BTreeSet, HashSet};

12

13

#[cfg(debug_assertions)]

14

use super::{Expression, Name, Reference, SymbolTablePtr, serde::HasId};

15

#[cfg(debug_assertions)]

16

use uniplate::Biplate;

17

18

/// Debug-assert that a model is well-formed by applying all AST assertions in this module.

19

#[cfg(debug_assertions)]

20

156470

pub fn debug_assert_model_well_formed(model: &Model, origin: &str) {

21

156470

    debug_assert_root_at_top_level_only(model, origin);

22

156470

    debug_assert_all_names_resolved(model, origin);

23

156470

24

25

/// Debug-assert that a model is well-formed by applying all AST assertions in this module.

26

#[cfg(not(debug_assertions))]

27

pub fn debug_assert_model_well_formed(_model: &Model, _origin: &str) {}

28

29

/// Debug-assert that all names referenced by expressions/domains resolve to declared symbols.

30

#[cfg(debug_assertions)]

31

156470

pub fn debug_assert_all_names_resolved(model: &Model, origin: &str) {

32

156470

    let mut declared_names: BTreeSet<Name> = BTreeSet::new();

33

156470

    let mut referenced_names: BTreeSet<Name> = BTreeSet::new();

34

35

228857

    for table_ptr in collect_reachable_symbol_tables(model) {

36

228857

        let table = table_ptr.read();

37

38

6636944

        for (name, decl) in table.iter_local() {

39

6636944

            declared_names.insert(name.clone());

40

41

6636944

            if let Some(expr) = decl.as_value_letting() {

42

140868

                referenced_names.extend(Biplate::<Reference>::universe_bi(&*expr).into_iter().map(

43

169533

                    |reference| {

44

169533

                        let name = reference.name();

45

169533

                        canonical_resolution_name(&name).clone()

46

169533

},

47

));

48

6496076

49

50

6636944

            if let Some(domain) = decl.domain() {

51

6636818

                referenced_names.extend(

52

6636818

                    Biplate::<Reference>::universe_bi(domain.as_ref())

53

6636818

                        .into_iter()

54

6636818

                        .map(|reference| {

55

148659

                            let name = reference.name();

56

148659

                            canonical_resolution_name(&name).clone()

57

148659

}),

58

);

59

126

60

61

62

63

156470

    referenced_names.extend(

64

156470

        Biplate::<Reference>::universe_bi(model.root())

65

156470

            .into_iter()

66

3104912

            .map(|reference| {

67

3104892

                let name = reference.name();

68

3104892

                canonical_resolution_name(&name).clone()

69

3104892

}),

70

);

71

72

156470

    if let Some(dominance) = &model.dominance {

73

        referenced_names.extend(

74

            Biplate::<Reference>::universe_bi(dominance)

75

                .into_iter()

76

                .map(|reference| {

77

                    let name = reference.name();

78

                    canonical_resolution_name(&name).clone()

79

}),

80

);

81

156470

82

83

10793369

    for clause in model.clauses() {

84

23226105

        for literal in clause.iter() {

85

23226105

            referenced_names.extend(Biplate::<Reference>::universe_bi(literal).into_iter().map(

86

23226105

                |reference| {

87

23226105

                    let name = reference.name();

88

23226105

                    canonical_resolution_name(&name).clone()

89

23226105

},

90

));

91

92

93

94

156470

    let unresolved: Vec<Name> = referenced_names

95

156470

        .difference(&declared_names)

96

156470

        .cloned()

97

156470

        .collect();

98

99

156470

    debug_assert!(

100

156470

        unresolved.is_empty(),

101

        "Model from '{origin}' contains unresolved names: {unresolved:?}"

102

);

103

156470

104

105

/// Debug-assert that all names referenced by expressions/domains resolve to declared symbols.

106

#[cfg(not(debug_assertions))]

107

pub fn debug_assert_all_names_resolved(_model: &Model, _origin: &str) {}

108

109

#[cfg(debug_assertions)]

110

26815047

fn canonical_resolution_name(name: &Name) -> &Name {

111

26815047

    match name {

112

        // Names wrapped in a selected representation still resolve through the source declaration.

113

165858

        Name::WithRepresentation(inner, _) => canonical_resolution_name(inner),

114

26649189

        _ => name,

115

116

26815047

117

118

/// Debug-assert that there is exactly one `Root` expression, and it is the model's top-level root.

119

#[cfg(debug_assertions)]

120

156470

pub fn debug_assert_root_at_top_level_only(model: &Model, origin: &str) {

121

156470

    debug_assert!(

122

156470

        matches!(model.root(), Expression::Root(_, _)),

123

        "Model from '{origin}' does not have Root at top-level"

124

);

125

126

156470

    let root_count_in_main_tree = Biplate::<Expression>::universe_bi(model)

127

156470

        .iter()

128

6825450

        .filter(|expr| matches!(expr, Expression::Root(_, _)))

129

156470

        .count();

130

131

156470

    let root_count_in_clauses = model

132

156470

        .clauses()

133

156470

        .iter()

134

10793369

        .flat_map(|clause| clause.iter())

135

23226125

        .map(|expr| {

136

23226105

            Biplate::<Expression>::universe_bi(expr)

137

23226105

                .iter()

138

36562071

                .filter(|inner| matches!(inner, Expression::Root(_, _)))

139

23226105

                .count()

140

23226105

})

141

156470

        .sum::<usize>();

142

143

156470

    let total_root_count = root_count_in_main_tree + root_count_in_clauses;

144

156470

    debug_assert_eq!(

145

        total_root_count, 1,

146

        "Model from '{origin}' should contain exactly one Root expression at top-level, found {total_root_count}"

147

);

148

156470

149

150

/// Debug-assert that there is exactly one `Root` expression, and it is the model's top-level root.

151

#[cfg(not(debug_assertions))]

152

pub fn debug_assert_root_at_top_level_only(_model: &Model, _origin: &str) {}

153

154

#[cfg(debug_assertions)]

155

156470

fn collect_reachable_symbol_tables(model: &Model) -> Vec<SymbolTablePtr> {

156

156470

    let mut pending_tables: Vec<SymbolTablePtr> = vec![model.symbols_ptr_unchecked().clone()];

157

156470

    pending_tables.extend(Biplate::<SymbolTablePtr>::universe_bi(model.root()));

158

159

156470

    if let Some(dominance) = &model.dominance {

160

        pending_tables.extend(Biplate::<SymbolTablePtr>::universe_bi(dominance));

161

156470

162

163

10793369

    for clause in model.clauses() {

164

23226105

        for literal in clause.iter() {

165

23226105

            pending_tables.extend(Biplate::<SymbolTablePtr>::universe_bi(literal));

166

23226105

167

168

169

156470

    let mut seen_tables = HashSet::new();

170

156470

    let mut out = Vec::new();

171

172

408364

    while let Some(table_ptr) = pending_tables.pop() {

173

251894

        if !seen_tables.insert(table_ptr.id()) {

174

23037

            continue;

175

228857

176

177

228857

        let parent = table_ptr.read().parent().clone();

178

228857

        if let Some(parent) = parent {

179

72387

            pending_tables.push(parent);

180

156470

181

182

228857

        out.push(table_ptr);

183

184

185

156470

out

186

156470