Struct libafl::schedulers::minimizer::MinimizerScheduler

source · [−]

pub struct MinimizerScheduler<CS, F, I, M, S> where
    CS: Scheduler<I, S>,
    F: TestcaseScore<I, S>,
    I: Input,
    M: AsSlice<usize> + SerdeAny + HasRefCnt,
    S: HasCorpus<I> + HasMetadata, { /* private fields */ }

Expand description

The MinimizerScheduler employs a genetic algorithm to compute a subset of the corpus that exercise all the requested features (e.g. all the coverage seen so far) prioritizing Testcases using TestcaseScore

Implementations

source

impl<CS, F, I, M, S> MinimizerScheduler<CS, F, I, M, S> where
 CS: Scheduler<I, S>,
 F: TestcaseScore<I, S>,
 I: Input,
 M: AsSlice<usize> + SerdeAny + HasRefCnt,
 S: HasCorpus + HasMetadata + HasRand,

source

pub fn update_score(&self, state: &mut S, idx: usize) -> Result<(), Error>

Update the Corpus score using the MinimizerScheduler

source

pub fn cull(&self, state: &mut S) -> Result<(), Error>

Cull the Corpus using the MinimizerScheduler

source

pub fn base(&self) -> &CS

Get a reference to the base scheduler

source

pub fn new(base: CS) -> Self

Creates a new MinimizerScheduler that wraps a base Scheduler and has a default probability to skip non-faved Testcases of DEFAULT_SKIP_NON_FAVORED_PROB.

source

pub fn with_skip_prob(base: CS, skip_non_favored_prob: u64) -> Self

Creates a new MinimizerScheduler that wraps a base Scheduler and has a non-default probability to skip non-faved Testcases using (skip_non_favored_prob).

Trait Implementations

source

impl<CS: Clone, F: Clone, I: Clone, M: Clone, S: Clone> Clone for MinimizerScheduler<CS, F, I, M, S> where
 CS: Scheduler<I, S>,
 F: TestcaseScore<I, S>,
 I: Input,
 M: AsSlice<usize> + SerdeAny + HasRefCnt,
 S: HasCorpus + HasMetadata,

source

fn clone(&self) -> MinimizerScheduler<CS, F, I, M, S>

Returns a copy of the value. Read more

1.0.0 · source

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

source

impl<CS: Debug, F: Debug, I: Debug, M: Debug, S: Debug> Debug for MinimizerScheduler<CS, F, I, M, S> where
 CS: Scheduler<I, S>,
 F: TestcaseScore<I, S>,
 I: Input,
 M: AsSlice<usize> + SerdeAny + HasRefCnt,
 S: HasCorpus + HasMetadata,

source

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

source

impl<CS, F, I, M, S> Scheduler<I, S> for MinimizerScheduler<CS, F, I, M, S> where
 CS: Scheduler<I, S>,
 F: TestcaseScore<I, S>,
 I: Input,
 M: AsSlice<usize> + SerdeAny + HasRefCnt,
 S: HasCorpus + HasMetadata + HasRand,

source

fn on_add(&self, state: &mut S, idx: usize) -> Result<(), Error>

Add an entry to the corpus and return its index

source

fn on_replace(
 &self,
 state: &mut S,
 idx: usize,
 testcase: &Testcase
) -> Result<(), Error>

Replaces the testcase at the given idx

source

fn on_remove(
 &self,
 state: &mut S,
 idx: usize,
 testcase: &Option<Testcase>
) -> Result<(), Error>

Removes an entry from the corpus, returning M if M was present.

source

fn next(&self, state: &mut S) -> Result<usize, Error>

Gets the next entry

Auto Trait Implementations

impl<CS, F, I, M, S> RefUnwindSafe for MinimizerScheduler<CS, F, I, M, S> where
 CS: RefUnwindSafe,
 F: RefUnwindSafe,
 I: RefUnwindSafe,
 M: RefUnwindSafe,
 S: RefUnwindSafe,

impl<CS, F, I, M, S> Send for MinimizerScheduler<CS, F, I, M, S> where
 CS: Send,
 F: Send,
 I: Send,
 M: Send,
 S: Send,

impl<CS, F, I, M, S> Sync for MinimizerScheduler<CS, F, I, M, S> where
 CS: Sync,
 F: Sync,
 I: Sync,
 M: Sync,
 S: Sync,

impl<CS, F, I, M, S> Unpin for MinimizerScheduler<CS, F, I, M, S> where
 CS: Unpin,
 F: Unpin,
 I: Unpin,
 M: Unpin,
 S: Unpin,

impl<CS, F, I, M, S> UnwindSafe for MinimizerScheduler<CS, F, I, M, S> where
 CS: UnwindSafe,
 F: UnwindSafe,
 I: UnwindSafe,
 M: UnwindSafe,
 S: UnwindSafe,

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<Tail, T> Prepend<T> for Tail

type PreprendResult = Tail

The Resulting TupleList, of an Prepend::prepend() call, including the prepended entry. Read more

source

fn prepend(self, value: T) -> (T, <Tail as Prepend<T>>::PreprendResult)

Prepend a value to this tuple, returning a new tuple with prepended value.

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct libafl::schedulers::minimizer::MinimizerScheduler

Implementations

impl<CS, F, I, M, S> MinimizerScheduler<CS, F, I, M, S> where CS: Scheduler<I, S>, F: TestcaseScore<I, S>, I: Input, M: AsSlice<usize> + SerdeAny + HasRefCnt, S: HasCorpus<I> + HasMetadata + HasRand,

pub fn update_score(&self, state: &mut S, idx: usize) -> Result<(), Error>

pub fn cull(&self, state: &mut S) -> Result<(), Error>

pub fn base(&self) -> &CS

pub fn new(base: CS) -> Self

pub fn with_skip_prob(base: CS, skip_non_favored_prob: u64) -> Self

Trait Implementations

impl<CS: Clone, F: Clone, I: Clone, M: Clone, S: Clone> Clone for MinimizerScheduler<CS, F, I, M, S> where CS: Scheduler<I, S>, F: TestcaseScore<I, S>, I: Input, M: AsSlice<usize> + SerdeAny + HasRefCnt, S: HasCorpus<I> + HasMetadata,

fn clone(&self) -> MinimizerScheduler<CS, F, I, M, S>

fn clone_from(&mut self, source: &Self)

impl<CS: Debug, F: Debug, I: Debug, M: Debug, S: Debug> Debug for MinimizerScheduler<CS, F, I, M, S> where CS: Scheduler<I, S>, F: TestcaseScore<I, S>, I: Input, M: AsSlice<usize> + SerdeAny + HasRefCnt, S: HasCorpus<I> + HasMetadata,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl<CS, F, I, M, S> Scheduler<I, S> for MinimizerScheduler<CS, F, I, M, S> where CS: Scheduler<I, S>, F: TestcaseScore<I, S>, I: Input, M: AsSlice<usize> + SerdeAny + HasRefCnt, S: HasCorpus<I> + HasMetadata + HasRand,

fn on_add(&self, state: &mut S, idx: usize) -> Result<(), Error>

fn on_replace( &self, state: &mut S, idx: usize, testcase: &Testcase<I>) -> Result<(), Error>

fn on_remove( &self, state: &mut S, idx: usize, testcase: &Option<Testcase<I>>) -> Result<(), Error>

fn next(&self, state: &mut S) -> Result<usize, Error>

Auto Trait Implementations

impl<CS, F, I, M, S> RefUnwindSafe for MinimizerScheduler<CS, F, I, M, S> where CS: RefUnwindSafe, F: RefUnwindSafe, I: RefUnwindSafe, M: RefUnwindSafe, S: RefUnwindSafe,

impl<CS, F, I, M, S> Send for MinimizerScheduler<CS, F, I, M, S> where CS: Send, F: Send, I: Send, M: Send, S: Send,

impl<CS, F, I, M, S> Sync for MinimizerScheduler<CS, F, I, M, S> where CS: Sync, F: Sync, I: Sync, M: Sync, S: Sync,

impl<CS, F, I, M, S> Unpin for MinimizerScheduler<CS, F, I, M, S> where CS: Unpin, F: Unpin, I: Unpin, M: Unpin, S: Unpin,

impl<CS, F, I, M, S> UnwindSafe for MinimizerScheduler<CS, F, I, M, S> where CS: UnwindSafe, F: UnwindSafe, I: UnwindSafe, M: UnwindSafe, S: UnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<Tail, T> Prepend<T> for Tail

type PreprendResult = Tail

fn prepend(self, value: T) -> (T, <Tail as Prepend<T>>::PreprendResult)

impl<T> ToOwned for T where T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<CS, F, I, M, S> MinimizerScheduler<CS, F, I, M, S> where
CS: Scheduler<I, S>,
F: TestcaseScore<I, S>,
I: Input,
M: AsSlice<usize> + SerdeAny + HasRefCnt,
S: HasCorpus<I> + HasMetadata + HasRand,

impl<CS: Clone, F: Clone, I: Clone, M: Clone, S: Clone> Clone for MinimizerScheduler<CS, F, I, M, S> where
CS: Scheduler<I, S>,
F: TestcaseScore<I, S>,
I: Input,
M: AsSlice<usize> + SerdeAny + HasRefCnt,
S: HasCorpus<I> + HasMetadata,

impl<CS: Debug, F: Debug, I: Debug, M: Debug, S: Debug> Debug for MinimizerScheduler<CS, F, I, M, S> where
CS: Scheduler<I, S>,
F: TestcaseScore<I, S>,
I: Input,
M: AsSlice<usize> + SerdeAny + HasRefCnt,
S: HasCorpus<I> + HasMetadata,

impl<CS, F, I, M, S> Scheduler<I, S> for MinimizerScheduler<CS, F, I, M, S> where
CS: Scheduler<I, S>,
F: TestcaseScore<I, S>,
I: Input,
M: AsSlice<usize> + SerdeAny + HasRefCnt,
S: HasCorpus<I> + HasMetadata + HasRand,

fn on_replace(
&self,
state: &mut S,
idx: usize,
testcase: &Testcase<I>
) -> Result<(), Error>

fn on_remove(
&self,
state: &mut S,
idx: usize,
testcase: &Option<Testcase<I>>
) -> Result<(), Error>

impl<CS, F, I, M, S> RefUnwindSafe for MinimizerScheduler<CS, F, I, M, S> where
CS: RefUnwindSafe,
F: RefUnwindSafe,
I: RefUnwindSafe,
M: RefUnwindSafe,
S: RefUnwindSafe,

impl<CS, F, I, M, S> Send for MinimizerScheduler<CS, F, I, M, S> where
CS: Send,
F: Send,
I: Send,
M: Send,
S: Send,

impl<CS, F, I, M, S> Sync for MinimizerScheduler<CS, F, I, M, S> where
CS: Sync,
F: Sync,
I: Sync,
M: Sync,
S: Sync,

impl<CS, F, I, M, S> Unpin for MinimizerScheduler<CS, F, I, M, S> where
CS: Unpin,
F: Unpin,
I: Unpin,
M: Unpin,
S: Unpin,

impl<CS, F, I, M, S> UnwindSafe for MinimizerScheduler<CS, F, I, M, S> where
CS: UnwindSafe,
F: UnwindSafe,
I: UnwindSafe,
M: UnwindSafe,
S: UnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,