-
-
Notifications
You must be signed in to change notification settings - Fork 293
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Implement AflMap #416
Implement AflMap #416
Conversation
Somewhere the (virgin) map also has to be updated correctly. not sure where this is done. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Lookin' good!
I thought about this, and came to the conclusion that it is very easy to implement. We need a reducer that combines the history map + (already reduced hitcountobserver) current map. |
IMHO it is done :) |
fn is_interesting(old: T, new: T) -> bool { | ||
(new == T::one() || new == T::one() || new == T::max_value()) && new > old | ||
fn is_novel(old: T, new: T) -> bool { | ||
(new == T::one() || new == T::max_value()) && new > old |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Technically this also makes sure the new value is larger, so it only makes sense of the values grow
* aflmap * nits * nits * switch implementation * clippy * set fuzzbench fuzzer to afl map * fix monitor display * Remove MapFindFilter and fix names * AndReducer * fixed testcase * always inline * remove inline(always) Co-authored-by: Andrea Fioraldi <andreafioraldi@gmail.com> Co-authored-by: Dominik Maier <domenukk@gmail.com>
@domenukk @andreafioraldi
it compiles so far, not sure it works :)