users/edef/refscan/src/main.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

use std::{
    collections::BTreeSet as Set,
    convert::TryInto,
    io::{self, Read},
    str,
};

fn main() {
    let max_refs: Set<[u8; 32]> = include_str!("../testdata/maxrefs")
        .lines()
        .map(|l| l.as_bytes().try_into().unwrap())
        .collect();

    let input = {
        let stdin = io::stdin();
        let mut buffer = Vec::new();
        stdin.lock().read_to_end(&mut buffer).unwrap();
        buffer
    };

    let base = input.as_ptr() as usize;
    let mut input: &[u8] = &input;
    while input.len() >= 32 {
        match refscan::scan_clean(&input) {
            Ok(buffer) | Err(buffer) => {
                let n = buffer.len();
                input = &input[n..];
            }
        }

        let buffer = {
            let idx = input.iter().position(|x| match x {
                b'a'..=b'z' | b'0'..=b'9' => false,
                _ => true,
            });
            idx.map(|idx| &input[..idx]).unwrap_or(input)
        };

        for chunk in buffer.windows(32) {
            let offset = (chunk.as_ptr() as usize) - base;
            let chunk = {
                let mut fixed = [0u8; 32];
                fixed.copy_from_slice(chunk);
                fixed
            };
            if max_refs.contains(&chunk) {
                let seen = unsafe { str::from_utf8_unchecked(&chunk) };
                println!("{} {}", seen, offset);
            }
        }

        let n = buffer.len();
        input = &input[n..];
    }
}