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

clang-format 16->17

Browse Source
This commit is contained in:
vanhauser-thc
2023-11-06 10:13:59 +01:00
parent 053334f35d
commit f3d2127fd8
13 changed files with 65 additions and 65 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
.custom-format.py
View File

@ -24,7 +24,7 @@ import importlib.metadata
# string_re = re.compile('(\\"(\\\\.|[^"\\\\])*\\")') # TODO: for future use # string_re = re.compile('(\\"(\\\\.|[^"\\\\])*\\")') # TODO: for future use
CURRENT_LLVM = os.getenv('LLVM_VERSION', 16) CURRENT_LLVM = os.getenv('LLVM_VERSION', 17)
CLANG_FORMAT_BIN = os.getenv("CLANG_FORMAT_BIN", "") CLANG_FORMAT_BIN = os.getenv("CLANG_FORMAT_BIN", "")

2
include/afl-mutations.h
View File

@ -1854,7 +1854,7 @@ inline u32 afl_mutate(afl_state_t *afl, u8 *buf, u32 len, u32 steps,
for (u32 step = 0; step < steps; ++step) { for (u32 step = 0; step < steps; ++step) {
retry_havoc_step : { retry_havoc_step: {
u32 r = rand_below(afl, MUT_STRATEGY_ARRAY_SIZE), item; u32 r = rand_below(afl, MUT_STRATEGY_ARRAY_SIZE), item;

6
qemu_mode/libqasan/dlmalloc.c
View File

@ -1661,9 +1661,9 @@ extern size_t getpagesize();
/* the number of bytes to offset an address to align it */ /* the number of bytes to offset an address to align it */
#define align_offset(A) \ #define align_offset(A) \
((((size_t)(A)&CHUNK_ALIGN_MASK) == 0) \ ((((size_t)(A) & CHUNK_ALIGN_MASK) == 0) \
? 0 \ ? 0 \
: ((MALLOC_ALIGNMENT - ((size_t)(A)&CHUNK_ALIGN_MASK)) & \ : ((MALLOC_ALIGNMENT - ((size_t)(A) & CHUNK_ALIGN_MASK)) & \
CHUNK_ALIGN_MASK)) CHUNK_ALIGN_MASK))
/* -------------------------- MMAP preliminaries ------------------------- */ /* -------------------------- MMAP preliminaries ------------------------- */
@ -3077,7 +3077,7 @@ static size_t traverse_and_check(mstate m);
/* The size of the smallest chunk held in bin with index i */ /* The size of the smallest chunk held in bin with index i */
#define minsize_for_tree_index(i) \ #define minsize_for_tree_index(i) \
((SIZE_T_ONE << (((i) >> 1) + TREEBIN_SHIFT)) | \ ((SIZE_T_ONE << (((i) >> 1) + TREEBIN_SHIFT)) | \
(((size_t)((i)&SIZE_T_ONE)) << (((i) >> 1) + TREEBIN_SHIFT - 1))) (((size_t)((i) & SIZE_T_ONE)) << (((i) >> 1) + TREEBIN_SHIFT - 1)))
/* ------------------------ Operations on bin maps ----------------------- */ /* ------------------------ Operations on bin maps ----------------------- */

6
src/afl-fuzz-one.c
View File

@ -582,7 +582,7 @@ u8 fuzz_one_original(afl_state_t *afl) {
\ \
u8 *_arf = (u8 *)(_ar); \ u8 *_arf = (u8 *)(_ar); \
u32 _bf = (_b); \ u32 _bf = (_b); \
_arf[(_bf) >> 3] ^= (128 >> ((_bf)&7)); \ _arf[(_bf) >> 3] ^= (128 >> ((_bf) & 7)); \
\ \
} while (0) } while (0)
@ -2216,7 +2216,7 @@ havoc_stage:
} }
retry_havoc_step : { retry_havoc_step: {
u32 r = rand_below(afl, rand_max), item; u32 r = rand_below(afl, rand_max), item;
@ -3708,7 +3708,7 @@ static u8 mopt_common_fuzzing(afl_state_t *afl, MOpt_globals_t MOpt_globals) {
\ \
u8 *_arf = (u8 *)(_ar); \ u8 *_arf = (u8 *)(_ar); \
u32 _bf = (_b); \ u32 _bf = (_b); \
_arf[(_bf) >> 3] ^= (128 >> ((_bf)&7)); \ _arf[(_bf) >> 3] ^= (128 >> ((_bf) & 7)); \
\ \
} while (0) } while (0)

2
utils/libtokencap/libtokencap.so.c
View File

@ -55,7 +55,7 @@
#elif defined __HAIKU__ #elif defined __HAIKU__
#include <kernel/image.h> #include <kernel/image.h>
#elif defined __sun #elif defined __sun
/* For map addresses the old struct is enough */ /* For map addresses the old struct is enough */
#include <sys/procfs.h> #include <sys/procfs.h>
#include <limits.h> #include <limits.h>
#endif #endif