ExternalVendorCode/AFLplusplus
1
0
Fork 0
mirror of https://github.com/AFLplusplus/AFLplusplus.git synced 2025-06-13 18:48:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Also remove declaration

Browse Source
This commit is contained in:
mio
2025-04-09 21:14:47 +08:00
parent eb0b8b2c5c
commit 6b71ca7809
2 changed files with 14 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
include/coverage-32.h
View File

@ -9,7 +9,6 @@
u32 skim(const u32 *virgin, const u32 *current, const u32 *current_end); u32 skim(const u32 *virgin, const u32 *current, const u32 *current_end);
u32 classify_word(u32 word); u32 classify_word(u32 word);
void classify_counts_mem(u32 *mem, u32 size);
inline u32 classify_word(u32 word) { inline u32 classify_word(u32 word) {
@ -24,22 +23,6 @@ inline u32 classify_word(u32 word) {
} }
inline void classify_counts_mem(u32 *mem, u32 size) {
u32 i = (size >> 2);
while (i--) {
/* Optimize for sparse bitmaps. */
if (unlikely(*mem)) { *mem = classify_word(*mem); }
mem++;
}
}
void simplify_trace(afl_state_t *afl, u8 *bytes) { void simplify_trace(afl_state_t *afl, u8 *bytes) {
u32 *mem = (u32 *)bytes; u32 *mem = (u32 *)bytes;
@ -69,7 +52,18 @@ void simplify_trace(afl_state_t *afl, u8 *bytes) {
} }
inline void classify_counts(afl_forkserver_t *fsrv) { inline void classify_counts(afl_forkserver_t *fsrv) {
classify_counts_mem((u32 *)fsrv->trace_bits, fsrv->map_size); u32 *mem = (u32 *)fsrv->trace_bits;
u32 i = (fsrv->map_size >> 2);
while (i--) {
/* Optimize for sparse bitmaps. */
if (unlikely(*mem)) { *mem = classify_word(*mem); }
mem++;
}
} }
/* Updates the virgin bits, then reflects whether a new count or a new tuple is /* Updates the virgin bits, then reflects whether a new count or a new tuple is

10
include/coverage-64.h
View File

@ -13,7 +13,6 @@
u32 skim(const u64 *virgin, const u64 *current, const u64 *current_end); u32 skim(const u64 *virgin, const u64 *current, const u64 *current_end);
u64 classify_word(u64 word); u64 classify_word(u64 word);
void classify_counts_mem(u64 *mem, u32 size);
inline u64 classify_word(u64 word) { inline u64 classify_word(u64 word) {
@ -63,12 +62,8 @@ void simplify_trace(afl_state_t *afl, u8 *bytes) {
} }
inline void classify_counts(afl_forkserver_t *fsrv) { inline void classify_counts(afl_forkserver_t *fsrv) {
classify_counts_mem((u64 *)fsrv->trace_bits, fsrv->map_size); u64 *mem = (u64 *)fsrv->trace_bits;
} u32 i = (fsrv->map_size >> 3);
inline void classify_counts_mem(u64 *mem, u32 size) {
u32 i = (size >> 3);
while (i--) { while (i--) {
@ -79,7 +74,6 @@ inline void classify_counts_mem(u64 *mem, u32 size) {
mem++; mem++;
} }
} }
/* Updates the virgin bits, then reflects whether a new count or a new tuple is /* Updates the virgin bits, then reflects whether a new count or a new tuple is