|
| 1 | +//! Pushes attr definitions from the inner types of an element to the |
| 2 | +//! top-level element |
| 3 | +//! |
| 4 | +//! This module must compute a transitive closure in case of circular |
| 5 | +//! references: |
| 6 | +//! "Circular reference is not disallowed. [...] The effect is to take the |
| 7 | +//! transitive closure of the reference relation" |
| 8 | +//! https://www.w3.org/TR/xmlschema11-1/#declare-attributeGroup-core |
| 9 | +
|
| 10 | +use std::collections::{HashMap, HashSet}; |
| 11 | + |
| 12 | +use asts; |
| 13 | +use asts::recursive::ComplexType as RComplexType; |
| 14 | +use names::FullName; |
| 15 | +use utils::Bottom; |
| 16 | + |
| 17 | +use processor2::ComplexTypeExtra as InComplexTypeExtra; |
| 18 | +use processor2::OutAttrs as InAttrs; |
| 19 | +use processor2::OutComplexType as InComplexType; |
| 20 | +use processor2::OutSimpleType as InSimpleType; |
| 21 | + |
| 22 | +pub type OutSimpleType<'input> = InSimpleType<'input>; |
| 23 | +pub type OutComplexType<'input> = asts::recursive::ComplexType<'input, OutAttrs<'input>, Bottom>; |
| 24 | +pub type OutAttrs<'input> = InAttrs<'input>; |
| 25 | + |
| 26 | +pub struct AttrsLifter<'input> { |
| 27 | + /// For each type name, stores a list of types that reference it. |
| 28 | + /// So if the former's list of attrs is updated, then the latter's |
| 29 | + /// must be updated as well. |
| 30 | + reverse_deps: HashMap<FullName<'input>, HashSet<FullName<'input>>>, |
| 31 | + |
| 32 | + /// (A subset of) the attrs of each complex type. Can converge to the full |
| 33 | + /// attrs by calling `make_transitive_closure()` |
| 34 | + attrs_of_complex_type: HashMap<FullName<'input>, OutAttrs<'input>>, |
| 35 | + |
| 36 | + /// Set of elements of `attrs_of_complex_type` that are strict subset of |
| 37 | + /// what they should be, and therefore should be updated. |
| 38 | + outdated_complex_types: HashSet<FullName<'input>>, |
| 39 | + |
| 40 | + complex_types: HashMap<FullName<'input>, InComplexType<'input>>, |
| 41 | +} |
| 42 | + |
| 43 | +impl<'input> AttrsLifter<'input> { |
| 44 | + pub fn with_capacity(capacity: usize) -> AttrsLifter<'input> { |
| 45 | + AttrsLifter { |
| 46 | + reverse_deps: HashMap::with_capacity(capacity), |
| 47 | + attrs_of_complex_type: HashMap::with_capacity(capacity), |
| 48 | + outdated_complex_types: HashSet::with_capacity(capacity), |
| 49 | + complex_types: HashMap::with_capacity(capacity), |
| 50 | + } |
| 51 | + } |
| 52 | + |
| 53 | + pub fn add_complex_type( |
| 54 | + &mut self, |
| 55 | + name: FullName<'input>, |
| 56 | + complex_type: InComplexType<'input>, |
| 57 | + ) { |
| 58 | + self.add_reverse_deps(name, &complex_type); |
| 59 | + self.complex_types.insert(name, complex_type); |
| 60 | + self.outdated_complex_types.insert(name); |
| 61 | + } |
| 62 | + |
| 63 | + pub fn make_transitive_closure(&mut self) { |
| 64 | + while let Some(&name) = self.outdated_complex_types.iter().next() { |
| 65 | + let complex_type = self.complex_types.get(&name).expect("Name {} was supposed to be updated, but it missing from AttrsLifter.complex_types."); |
| 66 | + let attrs = self.get_attrs_step(complex_type); |
| 67 | + if self.attrs_of_complex_type.get(&name) != attrs.as_ref() { |
| 68 | + self.outdated_complex_types.insert(name); |
| 69 | + let attrs = attrs.expect( |
| 70 | + "attrs were Some() but became None while computing transitive closure.", |
| 71 | + ); |
| 72 | + self.attrs_of_complex_type.insert(name, attrs); |
| 73 | + } |
| 74 | + } |
| 75 | + } |
| 76 | + |
| 77 | + fn add_reverse_deps( |
| 78 | + &mut self, |
| 79 | + my_name: FullName<'input>, |
| 80 | + complex_type: &InComplexType<'input>, |
| 81 | + ) { |
| 82 | + let add_rev_dep = &mut |rev_dep| { |
| 83 | + self.reverse_deps |
| 84 | + .get_mut(rev_dep) |
| 85 | + .expect(&format!("Reverse deps map is missing {:?} entry", rev_dep)) |
| 86 | + .insert(my_name); |
| 87 | + }; |
| 88 | + |
| 89 | + match complex_type { |
| 90 | + // Trivial cases |
| 91 | + RComplexType::Any => {} |
| 92 | + RComplexType::Empty => {} |
| 93 | + RComplexType::Alias(fullname) => add_rev_dep(fullname), |
| 94 | + // The actual work |
| 95 | + RComplexType::Extension(base, inner) | RComplexType::Restriction(base, inner) => { |
| 96 | + add_rev_dep(base); |
| 97 | + self.add_reverse_deps(my_name, inner); |
| 98 | + } |
| 99 | + RComplexType::ElementRef(_min_occurs, _max_occurs, fullname) => add_rev_dep(fullname), |
| 100 | + RComplexType::Choice(_min_occurs, _max_occurs, inners) |
| 101 | + | RComplexType::Sequence(_min_occurs, _max_occurs, inners) => { |
| 102 | + for inner in inners { |
| 103 | + self.add_reverse_deps(my_name, inner); |
| 104 | + } |
| 105 | + } |
| 106 | + RComplexType::Simple(_simple_type) => {} |
| 107 | + |
| 108 | + RComplexType::Element(_min_occurs, _max_occurs, _fullname, _attrs, inner) => { |
| 109 | + self.add_reverse_deps(my_name, inner); |
| 110 | + } |
| 111 | + RComplexType::GroupRef(_min_occurs, _max_occurs, _fullname) => unimplemented!(), |
| 112 | + RComplexType::Extra(InComplexTypeExtra::AttrDecl(_attrs, inner)) => { |
| 113 | + self.add_reverse_deps(my_name, inner); |
| 114 | + } |
| 115 | + } |
| 116 | + } |
| 117 | + |
| 118 | + fn get_attrs_step(&self, complex_type: &InComplexType<'input>) -> Option<OutAttrs<'input>> { |
| 119 | + let merge_attrs = |attrs1: Option<&OutAttrs<'input>>, attrs2| match (attrs1, attrs2) { |
| 120 | + (None, attrs2) => attrs2, |
| 121 | + (Some(attrs1), None) => Some(attrs1.clone()), |
| 122 | + (Some(attrs1), Some(attrs2)) => { |
| 123 | + let mut attrs: OutAttrs<'input> = attrs1.clone(); |
| 124 | + attrs.extend(attrs2); |
| 125 | + Some(attrs) |
| 126 | + } |
| 127 | + }; |
| 128 | + match complex_type { |
| 129 | + RComplexType::Any => None, |
| 130 | + RComplexType::Empty => None, |
| 131 | + RComplexType::Alias(fullname) => self.attrs_of_complex_type.get(fullname).cloned(), |
| 132 | + |
| 133 | + RComplexType::Extension(base, inner) => merge_attrs( |
| 134 | + self.attrs_of_complex_type.get(base), |
| 135 | + self.get_attrs_step(inner), |
| 136 | + ), |
| 137 | + RComplexType::Restriction(base, inner) => { |
| 138 | + // Attributes are inherited from the base: |
| 139 | + // "However, attribute declarations do not need to be repeated in the derived type definition" |
| 140 | + // https://www.w3.org/TR/xmlschema-0/#DerivByRestrict |
| 141 | + merge_attrs( |
| 142 | + self.attrs_of_complex_type.get(base), |
| 143 | + self.get_attrs_step(inner), |
| 144 | + ) |
| 145 | + } |
| 146 | + RComplexType::ElementRef(_min_occurs, _max_occurs, _fullname) => None, |
| 147 | + |
| 148 | + RComplexType::Choice(_min_occurs, _max_occurs, inners) |
| 149 | + | RComplexType::Sequence(_min_occurs, _max_occurs, inners) => { |
| 150 | + for inner in inners { |
| 151 | + if self.get_attrs_step(inner).is_some() { |
| 152 | + unimplemented!( |
| 153 | + "Sequence/choice got attribute declaration. \ |
| 154 | + I don't know what to do with that." |
| 155 | + ); |
| 156 | + } |
| 157 | + } |
| 158 | + None |
| 159 | + } |
| 160 | + RComplexType::Simple(_simple_type) => None, |
| 161 | + |
| 162 | + RComplexType::Element(_min_occurs, _max_occurs, _fullname, _attrs, _inner) => { |
| 163 | + // Elements capture the attrs for themselves and don't pass any up |
| 164 | + None |
| 165 | + } |
| 166 | + RComplexType::GroupRef(_min_occurs, _max_occurs, fullname) => { |
| 167 | + self.attrs_of_complex_type.get(fullname).cloned() |
| 168 | + } |
| 169 | + RComplexType::Extra(InComplexTypeExtra::AttrDecl(attrs, inner)) => { |
| 170 | + match self.get_attrs_step(inner) { |
| 171 | + Some(inner_attrs) => { |
| 172 | + let mut attrs = attrs.clone(); |
| 173 | + attrs.extend(inner_attrs); |
| 174 | + Some(attrs) |
| 175 | + } |
| 176 | + None => Some(attrs.clone()), |
| 177 | + } |
| 178 | + } |
| 179 | + } |
| 180 | + } |
| 181 | +} |
0 commit comments