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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
use std::collections::BTreeSet;
use std::fmt::Debug;
use std::hash::Hash;
use std::io::{Read, Seek, SeekFrom};
use strict_encoding::StrictDecode;
use crate::{
KeyType, PrimitiveType, StructField, StructType, TypeConstr, TypeName, TypeRef, TypeSystem,
};
pub trait Verify {
fn verify(&self, ts: &TypeSystem, buf: &mut (impl Read + Seek)) -> bool;
}
impl Verify for TypeName {
fn verify(&self, ts: &TypeSystem, buf: &mut (impl Read + Seek)) -> bool {
match ts.get(self) {
None => false,
Some(ty) => ty.verify(ts, buf),
}
}
}
impl Verify for StructType {
fn verify(&self, ts: &TypeSystem, buf: &mut (impl Read + Seek)) -> bool {
for field in self {
if !field.verify(ts, buf) {
return false;
}
}
true
}
}
impl Verify for StructField {
fn verify(&self, ts: &TypeSystem, mut buf: &mut (impl Read + Seek)) -> bool {
if self.optional {
match u8::strict_decode(&mut buf) {
Err(_) => false,
Ok(0) => true,
Ok(1) => self.ty.verify(ts, buf),
Ok(_) => false,
}
} else {
self.ty.verify(ts, buf)
}
}
}
impl Verify for TypeRef {
fn verify(&self, ts: &TypeSystem, buf: &mut (impl Read + Seek)) -> bool {
match self {
TypeRef::InPlace(ty) => ty.verify(ts, buf),
TypeRef::NameRef(ty) => ty.verify(ts, buf),
}
}
}
impl<T> Verify for TypeConstr<T>
where T: Clone + Ord + Eq + Hash + Debug + Verify
{
fn verify(&self, ts: &TypeSystem, mut buf: &mut (impl Read + Seek)) -> bool {
macro_rules! pos {
() => {
buf.stream_position().expect("medium without stream position")
};
}
macro_rules! read {
($pos_from:expr, $pos_to:expr) => {{
let len = $pos_to - $pos_from;
buf.seek(SeekFrom::Current(-(len as i64))).expect("medium without seek operation");
let mut vec = vec![0u8; len as usize];
buf.read_exact(&mut vec).expect("medium without seek operation");
vec
}};
}
match self {
TypeConstr::Plain(ty) => ty.verify(ts, buf),
TypeConstr::Array(len, ty) => {
for _ in 0..*len {
if !ty.verify(ts, buf) {
return false;
}
}
true
}
TypeConstr::List(ty) => {
let len = match u16::strict_decode(&mut buf) {
Err(_) => return false,
Ok(len) => len,
};
for _ in 0..len {
if !ty.verify(ts, buf) {
return false;
}
}
true
}
TypeConstr::Set(ty) => {
let len = match u16::strict_decode(&mut buf) {
Err(_) => return false,
Ok(len) => len,
};
let mut set = BTreeSet::new();
for _ in 0..len {
let pos_from = pos!();
if !ty.verify(ts, buf) {
return false;
}
let pos_to = pos!();
let val = read!(pos_from, pos_to);
if let Some(last) = set.iter().last() {
if val <= *last {
return false;
}
}
if !set.insert(val) {
return false;
}
}
true
}
TypeConstr::Map(key, val) => {
let len = match u16::strict_decode(&mut buf) {
Err(_) => return false,
Ok(len) => len,
};
let mut set = BTreeSet::new();
for _ in 0..len {
let pos_from = pos!();
if !key.verify(ts, buf) {
return false;
}
let pos_to = pos!();
let k = read!(pos_from, pos_to);
if let Some(last) = set.iter().last() {
if k <= *last {
return false;
}
}
if !set.insert(k) {
return false;
}
if !val.verify(ts, buf) {
return false;
}
}
true
}
}
}
}
impl Verify for KeyType {
fn verify(&self, ts: &TypeSystem, buf: &mut (impl Read + Seek)) -> bool {
match self {
KeyType::Primitive(ty) => ty.verify(ts, buf),
KeyType::Array(len, ty) => TypeConstr::Array(*len, *ty).verify(ts, buf),
KeyType::List(ty) => TypeConstr::List(*ty).verify(ts, buf),
}
}
}
impl Verify for PrimitiveType {
fn verify(&self, _: &TypeSystem, mut buf: &mut (impl Read + Seek)) -> bool {
let len = match self {
PrimitiveType::U8 => 1,
PrimitiveType::U16 => 2,
PrimitiveType::U32 => 4,
PrimitiveType::U64 => 8,
PrimitiveType::U128 => 16,
PrimitiveType::U256 => 32,
PrimitiveType::U512 => 64,
PrimitiveType::U1024 => 128,
PrimitiveType::I8 => 1,
PrimitiveType::I16 => 2,
PrimitiveType::I32 => 4,
PrimitiveType::I64 => 8,
PrimitiveType::I128 => 16,
PrimitiveType::I256 => 32,
PrimitiveType::I512 => 64,
PrimitiveType::I1024 => 128,
PrimitiveType::F16b => 2,
PrimitiveType::F16 => 2,
PrimitiveType::F32 => 4,
PrimitiveType::F64 => 8,
PrimitiveType::F80 => 10,
PrimitiveType::F128 => 16,
PrimitiveType::F256 => 32,
PrimitiveType::F512 => 64,
PrimitiveType::AsciiChar | PrimitiveType::UnicodeChar => {
match u16::strict_decode(&mut buf) {
Err(_) => return false,
Ok(len) => len,
}
}
};
match buf.seek(SeekFrom::Current(len as i64)) {
Err(_) => false,
Ok(_) => true,
}
}
}