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
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
#[macro_use] extern crate nom;
#[macro_use] extern crate lazy_static;
extern crate petgraph;
use std::collections::HashMap;
use std::collections::HashSet;
use petgraph::prelude::*;
mod fdo_magic;
mod basetype;
pub struct TypeStruct {
pub graph: DiGraph<String, u32>,
pub hash: HashMap<String, NodeIndex>
}
lazy_static! {
pub static ref TYPE: TypeStruct = {
graph_init().unwrap_or( TypeStruct{graph: DiGraph::new(), hash: HashMap::new()} )
};
}
fn graph_init() -> Result<TypeStruct, std::io::Error> {
let mut graph = DiGraph::<String, u32>::new();
let mut added_mimes = HashMap::<String, NodeIndex>::new();
let mut mimelist = fdo_magic::init::get_supported();
mimelist.extend(basetype::init::get_supported());
mimelist.sort();
mimelist.dedup();
let mimelist = mimelist;
for mimetype in mimelist.iter() {
let node = graph.add_node(mimetype.clone());
added_mimes.insert(mimetype.clone(), node);
}
let mut edge_list_raw = basetype::init::get_subclasses();
edge_list_raw.extend(fdo_magic::init::get_subclasses());
let mut edge_list = HashSet::<(NodeIndex, NodeIndex)>::with_capacity(edge_list_raw.len());
for x in edge_list_raw {
let child_raw = x.0;
let parent_raw = x.1;
let parent = match added_mimes.get(&parent_raw) {
Some(node) => *node,
None => {continue;}
};
let child = match added_mimes.get(&child_raw) {
Some(node) => *node,
None => {continue;}
};
edge_list.insert( (child, parent) );
}
graph.extend_with_edges(&edge_list);
let added_mimes_tmp = added_mimes.clone();
let node_text = match added_mimes_tmp.get("text/plain"){
Some(x) => *x,
None => {
let node = graph.add_node("text/plain".to_string());
added_mimes.insert("text/plain".to_string(), node);
node
}
};
let node_octet = match added_mimes_tmp.get("application/octet-stream"){
Some(x) => *x,
None => {
let node = graph.add_node("application/octet-stream".to_string());
added_mimes.insert("application/octet-stream".to_string(), node);
node
}
};
let node_allall = match added_mimes_tmp.get("all/all"){
Some(x) => *x,
None => {
let node = graph.add_node("all/all".to_string());
added_mimes.insert("all/all".to_string(), node);
node
}
};
let node_allfiles = match added_mimes_tmp.get("all/allfiles"){
Some(x) => *x,
None => {
let node = graph.add_node("all/allfiles".to_string());
added_mimes.insert("all/allfiles".to_string(), node);
node
}
};
let mut edge_list_2 = HashSet::<(NodeIndex, NodeIndex)>::new();
for mimenode in graph.externals(Incoming) {
let ref mimetype = graph[mimenode];
let toplevel = mimetype.split("/").nth(0).unwrap_or("");
if mimenode == node_text || mimenode == node_octet ||
mimenode == node_allfiles || mimenode == node_allall
{
continue;
}
if toplevel == "text" {
edge_list_2.insert( (node_text, mimenode) );
} else if toplevel == "inode" {
edge_list_2.insert( (node_allall, mimenode) );
} else {
edge_list_2.insert( (node_octet, mimenode) );
}
}
graph.extend_with_edges(edge_list_2.difference(&edge_list));
let graph = graph;
let added_mimes = added_mimes;
Ok( TypeStruct{graph: graph, hash: added_mimes} )
}
pub fn match_u8(mimetype: &str, bytes: &[u8], len: usize) -> bool
{
let result: bool;
if basetype::test::can_check(&mimetype){
result = basetype::test::from_u8(bytes, len, &mimetype);
} else if fdo_magic::test::can_check(&mimetype) {
result = fdo_magic::test::from_u8(bytes, len, &mimetype);
} else {
result = false;
}
result
}
pub fn from_u8_node(parentnode: NodeIndex, bytes: &[u8], len: usize) -> Option<String>
{
let children = TYPE.graph.neighbors_directed(parentnode, Outgoing);
for childnode in children {
let ref mimetype = TYPE.graph[childnode];
match match_u8(mimetype, bytes, len) {
true => {
match from_u8_node(
childnode, bytes, len
) {
Some(foundtype) => return Some(foundtype),
None => return Some(mimetype.clone()),
}
}
false => continue,
}
}
None
}
pub fn from_u8(bytes: &[u8], len: usize) -> Option<String>
{
let node = match TYPE.graph.externals(Incoming).next() {
Some(foundnode) => foundnode,
None => return None
};
from_u8_node(node, bytes, len)
}
pub fn match_vec_u8(bytes: Vec<u8>, mimetype: &str) -> bool
{
let len = bytes.len();
match_u8(mimetype, bytes.as_slice(), len)
}
pub fn from_vec_u8_node(parentnode: NodeIndex, bytes: Vec<u8>) -> Option<String>
{
let len = bytes.len();
from_u8_node(parentnode, bytes.as_slice(), len)
}
pub fn from_vec_u8(bytes: Vec<u8>) -> Option<String> {
let node = match TYPE.graph.externals(Incoming).next() {
Some(foundnode) => foundnode,
None => return None
};
from_vec_u8_node(node, bytes)
}
pub fn match_filepath(mimetype: &str, filepath: &str) -> Result<bool, std::io::Error> {
let result: Result<bool, std::io::Error>;
if basetype::test::can_check(&mimetype){
result = basetype::test::from_filepath(filepath, &mimetype);
} else if fdo_magic::test::can_check(&mimetype) {
result = fdo_magic::test::from_filepath(filepath, &mimetype);
} else {
result = Ok(false);
}
result
}
pub fn from_filepath_node(parentnode: NodeIndex, filepath: &str) -> Option<String>
{
let children = TYPE.graph.neighbors_directed(parentnode, Outgoing);
for childnode in children {
let ref mimetype = TYPE.graph[childnode];
match match_filepath(mimetype, filepath) {
Ok(res) => match res {
true => {
match from_filepath_node(
childnode, filepath
) {
Some(foundtype) => return Some(foundtype),
None => return Some(mimetype.clone()),
}
}
false => continue,
},
Err(_) => return None
}
}
None
}
pub fn from_filepath(filepath: &str) -> Option<String> {
let node = match TYPE.graph.externals(Incoming).next() {
Some(foundnode) => foundnode,
None => return None
};
from_filepath_node(node, filepath)
}