libafl_libfuzzer 0.16.0

libFuzzer shim which uses LibAFL with common defaults
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

use std::{collections::BTreeSet, marker::PhantomData};

use hashbrown::HashMap;
use libafl::{
    Error, HasMetadata,
    corpus::{Corpus, CorpusId, Testcase},
    feedbacks::MapNoveltiesMetadata,
    inputs::Input,
    schedulers::{RemovableScheduler, Scheduler},
    state::HasCorpus,
};

#[derive(Debug, Clone)]
pub struct MergeScheduler<I, S> {
    mapping: HashMap<usize, CorpusId>,
    all: BTreeSet<CorpusId>,
    phantom: PhantomData<(I, S)>,
}

impl<I, S> RemovableScheduler<I, S> for MergeScheduler<I, S>
where
    I: Input,
    S: HasCorpus<I>,
{
    fn on_remove(
        &mut self,
        _state: &mut S,
        id: CorpusId,
        _testcase: &Option<Testcase<I>>,
    ) -> Result<(), Error> {
        self.all.remove(&id);
        Ok(())
    }
}

impl<I, S> Scheduler<I, S> for MergeScheduler<I, S>
where
    S: HasCorpus<I>,
{
    fn on_add(&mut self, state: &mut S, id: CorpusId) -> Result<(), Error> {
        self.all.insert(id);
        let testcase = state.corpus().get(id)?.borrow();
        let meta = testcase.metadata::<MapNoveltiesMetadata>()?;
        for cov_ in &meta.list {
            self.mapping.insert(*cov_, id);
        }
        Ok(())
    }

    fn next(&mut self, _state: &mut S) -> Result<CorpusId, Error> {
        unimplemented!("Not suitable for actual scheduling.");
    }

    fn set_current_scheduled(
        &mut self,
        state: &mut S,
        next_id: Option<CorpusId>,
    ) -> Result<(), Error> {
        *state.corpus_mut().current_mut() = next_id;
        Ok(())
    }
}

impl<I, S> MergeScheduler<I, S> {
    pub fn new() -> Self {
        Self {
            mapping: HashMap::default(),
            all: BTreeSet::default(),
            phantom: PhantomData,
        }
    }

    pub fn removable(&self) -> BTreeSet<CorpusId> {
        self.all
            .difference(&self.mapping.values().copied().collect())
            .copied()
            .collect()
    }

    pub fn current(&self) -> &BTreeSet<CorpusId> {
        &self.all
    }
}