-
Notifications
You must be signed in to change notification settings - Fork 0
/
search.rs
280 lines (245 loc) · 9.23 KB
/
search.rs
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
use crate::symbolic_base_bro;
use std::collections::VecDeque;
use std::io::Read;
use std::iter::FromIterator;
use log::{debug, info, error};
#[derive(Debug)]
#[derive(PartialEq)]
#[derive(Eq)]
pub struct Search<'search> {
pub location: u64,
pub current_candidate: VecDeque<&'search symbolic_base_bro::OutChar64>,
actual_candidate: &'search Vec<symbolic_base_bro::OutChar64>,
}
#[derive(Debug)]
#[derive(PartialEq)]
#[derive(Eq)]
pub struct PushSearch<'search> {
byte_count: u64,
pub search_stack: Vec<Search<'search>>,
candidates: &'search symbolic_base_bro::Candidates
}
pub fn by_candidates<'search>(candidates: &'search symbolic_base_bro::Candidates) -> PushSearch {
PushSearch { byte_count: 0_u64,
candidates,
search_stack: Vec::new() }
}
fn filter_candidates(candidates: &symbolic_base_bro::Candidates) -> symbolic_base_bro::Candidates {
let symbolic_base_bro::Candidates(f, s, t) = candidates;
let filtered_f = f.iter().filter(|c| **c != symbolic_base_bro::OutChar64::Equals).cloned().collect();
let filtered_s = s.iter().filter(|c| **c != symbolic_base_bro::OutChar64::Equals).cloned().collect();
let filtered_t = t.iter().filter(|c| **c != symbolic_base_bro::OutChar64::Equals).cloned().collect();
symbolic_base_bro::Candidates(filtered_f, filtered_s, filtered_t)
}
pub fn find_in_stream<R: Read>(mut rdr: R, candidates: &symbolic_base_bro::Candidates) {
const BUFFER_SIZE: usize = 1 << 8;
let filterd_candidates = filter_candidates(&candidates);
let mut search = by_candidates(&filterd_candidates);
let mut buffer_vec = Vec::with_capacity(BUFFER_SIZE);
let mut operation = |bytes: &[u8]| {
debug!("Pushing into search {:?}", bytes);
if push_all(&mut search, bytes) {
let found = search.search_stack.iter().find(|s| {
s.current_candidate.is_empty()
});
if let Some(search) = found {
info!("Found at {} byte offset", search.location);
println!("{:?}: ", search.location);
}
}
};
loop {
match rdr.by_ref().take(BUFFER_SIZE as u64).read_to_end(&mut buffer_vec) {
Err(err) => {
error!("Error while reading file: {}", err);
std::process::exit(1);
},
Ok(chunk_size) => {
if chunk_size == 0 {
break;
}
operation(&buffer_vec);
if chunk_size < BUFFER_SIZE {
break;
}
buffer_vec.clear();
}
}
}
}
/// returns true if push has found a position.
pub fn push_all(push_search: &mut PushSearch, input: &[u8]) -> bool {
input.iter().for_each(|byte| {
// drop not matching searches
if *byte != b'\n' {
push_search.search_stack.retain(|prev_search| {
if let Some(outchar64) = prev_search.current_candidate.front() {
byte == *outchar64
} else {
true
}
});
}
let symbolic_base_bro::Candidates(c1, c2, c3) = push_search.candidates;
if byte == c1.first().unwrap() {
push_search.search_stack.push(Search {
location: push_search.byte_count,
actual_candidate: c1,
current_candidate: VecDeque::from_iter(c1.iter())
});
}
if byte == c2.first().unwrap() {
push_search.search_stack.push(Search {
location: push_search.byte_count,
actual_candidate: c2,
current_candidate: VecDeque::from_iter(c2.iter())
});
}
if byte == c3.first().unwrap() {
push_search.search_stack.push(Search {
location: push_search.byte_count,
actual_candidate: c3,
current_candidate: VecDeque::from_iter(c3.iter())
});
}
// move existing searches further
push_search.search_stack.iter_mut().for_each(|prev_search| {
// skip newlines in base64
if *byte != b'\n' {
// pop_front returns an optional. we don't unwrap it, because
// a fail would mean that the Vec is empty and we dont care
// about empty Vecs.
prev_search.current_candidate.pop_front();
}
});
push_search.byte_count += 1;
});
// when a candidate of a search is empty, the search
// has been completed
push_search.search_stack.iter().any(|existing_search| {
existing_search.current_candidate.is_empty()
})
}
impl PartialEq<u8> for symbolic_base_bro::OutChar64 {
fn eq(&self, other: &u8) -> bool {
match self {
symbolic_base_bro::OutChar64::Single(byte) => {
other == byte
},
symbolic_base_bro::OutChar64::Multiple(bytes) => {
bytes.iter().any(|byte| {
other == byte
})
},
symbolic_base_bro::OutChar64::Equals => {
true
//*other == b'='
}
}
}
}
impl PartialEq<symbolic_base_bro::OutChar64> for u8 {
fn eq(&self, other: &symbolic_base_bro::OutChar64) -> bool {
match other {
symbolic_base_bro::OutChar64::Single(byte) => {
self == byte
},
symbolic_base_bro::OutChar64::Multiple(bytes) => {
bytes.iter().any(|byte| {
self == byte
})
},
symbolic_base_bro::OutChar64::Equals => {
//*self == b'='
true
}
}
}
}
#[test]
fn test_push_search_simple_positive() {
let candidates = symbolic_base_bro::generate_candidates("asdf");
let mut search = by_candidates(&candidates);
let input_bytes = b" YXNkZg== ";
let out = push_all(&mut search, input_bytes);
assert!(out);
}
#[test]
fn test_push_search_content_appears_twice() {
let candidates = symbolic_base_bro::generate_candidates("asdf");
let mut search = by_candidates(&candidates);
let input_bytes = b" YXNkZg== YXNkZg== ";
let out = push_all(&mut search, input_bytes);
assert!(out);
let found : Vec<&Search> = search.search_stack.iter().filter(|s| {
s.current_candidate.is_empty()
}).collect();
assert_eq!(found.len(), 2);
}
#[test]
fn test_offset_is_correct_in_find_stream() {
// "hello world"
// (aGVsbG8gd29ybG(Q|R|S|T)
// |(G|W|m|2)hlbGxvIHdvcmxk
// |(B|F|J|N|R|V|Z|d|h|l|p|t|x|1|5|9)oZWxsbyB3b3JsZ(A|B|C|D|E|F|G|H|I|J|K|L|M|N|O|P))
let inputs : Vec<(&[u8], u64)> = vec![(b"aGVsbG8gd29ybGQK", 0),
// " hello world"
(b"IGhlbGxvIHdvcmxkCg==", 1),
// " hello world"
(b"ICBoZWxsbyB3b3JsZAo=", 2),
// " hello world"
(b"ICAgaGVsbG8gd29ybGQK", 4)];
let candidates = filter_candidates(&symbolic_base_bro::generate_candidates("hello world"));
inputs.iter().for_each(|(input_bytes, i)| {
println!("{} {:?}", i, input_bytes);
let mut search = by_candidates(&candidates);
let out = push_all(&mut search, input_bytes);
assert!(out);
let found = search.search_stack.iter().find(|s| {
s.current_candidate.is_empty()
});
assert_eq!(found.unwrap().location, *i, "input_bytes: {:?}, actual candidate: {:?}", input_bytes, found.unwrap().actual_candidate);
});
}
#[test]
fn test_push_search_simple_positive_containing_newline_at_end() {
let candidates = symbolic_base_bro::generate_candidates("asdf");
let mut search = by_candidates(&candidates);
let input_bytes = b"YXNkZg==\n";
let out = push_all(&mut search, input_bytes);
assert!(out);
}
#[test]
fn test_push_search_simple_positive_containing_newline_inbetween() {
let candidates = symbolic_base_bro::generate_candidates("asdf");
let mut search = by_candidates(&candidates);
let input_bytes = b"YXNk\nZg==\n";
let out = push_all(&mut search, input_bytes);
assert!(out);
}
#[test]
fn test_push_search_simple_negative() {
let candidates = symbolic_base_bro::generate_candidates("asdf");
let mut search = by_candidates(&candidates);
let input_bytes = b"YXXNkZg==";
let out = push_all(&mut search, input_bytes);
assert!(!out);
}
#[test]
fn test_search_long_base64() {
let candidates = symbolic_base_bro::generate_candidates("qwer");
let mut search = by_candidates(&candidates);
let input_bytes = b"ICAgICAgcXdlciA=";
let out = push_all(&mut search, input_bytes);
assert!(out);
}
#[test]
fn test_search_push_all_multiple_times() {
let candidates = symbolic_base_bro::generate_candidates("asdf");
let mut search = by_candidates(&candidates);
let multi_input_bytes : Vec<&[u8]> = vec![b"YXN", b"kZ", b"g=="];
assert!(!push_all(&mut search, multi_input_bytes[0]));
assert!(!push_all(&mut search, multi_input_bytes[1]));
// after third w have a match
assert!(push_all(&mut search, multi_input_bytes[2]));
}