SYS-OSS/FRET-LibAFL
4
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

small build fixes

Browse Source
This commit is contained in:
Alwin Berger 2023-06-12 12:13:28 +02:00
parent 53ef9ae96e
commit 92da68af6f
3 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
fuzzers/FRET/src/fuzzer.rs
View File

@ -270,7 +270,7 @@ pub fn fuzz() {
let mut feedback = feedback_or!( let mut feedback = feedback_or!(
feedback, feedback,
// New maximization map feedback linked to the edges observer and the feedback state // New maximization map feedback linked to the edges observer and the feedback state
MaxMapFeedback::new_tracking(&edges_observer, true, true) MaxMapFeedback::tracking(&edges_observer, true, true)
); );
#[cfg(feature = "feed_longest")] #[cfg(feature = "feed_longest")]
let mut feedback = feedback_or!( let mut feedback = feedback_or!(

2
fuzzers/FRET/src/mutational.rs
View File

@ -206,7 +206,7 @@ where
} }
#[cfg(not(feature = "feed_systemtrace"))] #[cfg(not(feature = "feed_systemtrace"))]
{ {
let metadata = state.metadata(); let metadata = state.metadata_map();
let hist = metadata.get::<IcHist>().unwrap(); let hist = metadata.get::<IcHist>().unwrap();
let maxtick : u64 = hist.1.0; let maxtick : u64 = hist.1.0;
// let maxtick : u64 = (_input.exec_time().expect("No duration found").as_nanos() >> 4).try_into().unwrap(); // let maxtick : u64 = (_input.exec_time().expect("No duration found").as_nanos() >> 4).try_into().unwrap();

2
fuzzers/FRET/src/worst.rs
View File

@ -309,7 +309,7 @@ where
) -> Result<(), Error> { ) -> Result<(), Error> {
#[cfg(feature = "feed_afl")] #[cfg(feature = "feed_afl")]
if self.last_is_longest { if self.last_is_longest {
let mim : Option<&mut MapIndexesMetadata>= testcase.metadata_mut().get_mut(); let mim : Option<&mut MapIndexesMetadata>= testcase.metadata_map_mut().get_mut();
// pretend that the longest input alone excercises some non-existing edge, to keep it relevant // pretend that the longest input alone excercises some non-existing edge, to keep it relevant
mim.unwrap().list.push(usize::MAX); mim.unwrap().list.push(usize::MAX);
}; };