diff options
| -rw-r--r-- | afl-as.c | 2 | ||||
| -rw-r--r-- | afl-fuzz.c | 4 | ||||
| -rw-r--r-- | docs/perf_tips.txt | 2 | ||||
| -rw-r--r-- | docs/power_schedules.txt | 2 | ||||
| -rw-r--r-- | llvm_mode/split-compares-pass.so.cc | 8 | ||||
| -rw-r--r-- | llvm_mode/split-switches-pass.so.cc | 4 |
6 files changed, 11 insertions, 11 deletions
diff --git a/afl-as.c b/afl-as.c index 55b14c9d..94595f24 100644 --- a/afl-as.c +++ b/afl-as.c @@ -377,7 +377,7 @@ static void add_instrumentation(void) { } /* Label of some sort. This may be a branch destination, but we need to - tread carefully and account for several different formatting + read carefully and account for several different formatting conventions. */ #ifdef __APPLE__ diff --git a/afl-fuzz.c b/afl-fuzz.c index 9dc5e6c3..b775803d 100644 --- a/afl-fuzz.c +++ b/afl-fuzz.c @@ -4833,7 +4833,7 @@ static u32 calculate_score(struct queue_entry* q) { break; default: - PFATAL ("Unkown Power Schedule"); + PFATAL ("Unknown Power Schedule"); } if (factor > MAX_FACTOR) factor = MAX_FACTOR; @@ -8085,7 +8085,7 @@ int main(int argc, char** argv) { case LIN: OKF ("Using linear power schedule (LIN)"); break; case QUAD: OKF ("Using quadratic power schedule (QUAD)"); break; case EXPLORE: OKF ("Using exploration-based constant power schedule (EXPLORE)"); break; - default : FATAL ("Unkown power schedule"); break; + default : FATAL ("Unknown power schedule"); break; } if (getenv("AFL_NO_FORKSRV")) no_forkserver = 1; diff --git a/docs/perf_tips.txt b/docs/perf_tips.txt index 287284fc..263065c0 100644 --- a/docs/perf_tips.txt +++ b/docs/perf_tips.txt @@ -191,7 +191,7 @@ There are several OS-level factors that may affect fuzzing speed: - Use the afl-system-config script to set all proc/sys settings above - Disable all the spectre, meltdown etc. security countermeasures in the - kernel if your machine is properly seperated: + kernel if your machine is properly separated: "ibpb=off ibrs=off kpti=off l1tf=off mds=off mitigations=off no_stf_barrier noibpb noibrs nopcid nopti nospec_store_bypass_disable nospectre_v1 nospectre_v2 pcid=off pti=off spec_store_bypass_disable=off diff --git a/docs/power_schedules.txt b/docs/power_schedules.txt index 578ff020..cb4ca6e7 100644 --- a/docs/power_schedules.txt +++ b/docs/power_schedules.txt @@ -27,7 +27,7 @@ where *α(i)* is the performance score that AFL uses to compute for the seed inp More details can be found in our paper that was recently accepted at the [23rd ACM Conference on Computer and Communications Security (CCS'16)](https://www.sigsac.org/ccs/CCS2016/accepted-papers/). -PS: In parallel mode (several instances with shared queue), we suggest to run the master using the exploit schedule (-p exploit) and the slaves with a combination of cut-off-exponential (-p coe), exponential (-p fast; default), and explore (-p explore) schedules. In single mode, the default settings will do. **EDIT:** In parallel mode, AFLFast seems to perform poorly because the path probability estimates are incorrect for the imported seeds. Pull requests to fix this issue by syncing the estimates accross instances are appreciated :) +PS: In parallel mode (several instances with shared queue), we suggest to run the master using the exploit schedule (-p exploit) and the slaves with a combination of cut-off-exponential (-p coe), exponential (-p fast; default), and explore (-p explore) schedules. In single mode, the default settings will do. **EDIT:** In parallel mode, AFLFast seems to perform poorly because the path probability estimates are incorrect for the imported seeds. Pull requests to fix this issue by syncing the estimates across instances are appreciated :) Copyright 2013, 2014, 2015, 2016 Google Inc. All rights reserved. Released under terms and conditions of Apache License, Version 2.0. diff --git a/llvm_mode/split-compares-pass.so.cc b/llvm_mode/split-compares-pass.so.cc index 5c16c408..25ccb3b4 100644 --- a/llvm_mode/split-compares-pass.so.cc +++ b/llvm_mode/split-compares-pass.so.cc @@ -259,7 +259,7 @@ bool SplitComparesTransform::simplifySignedness(Module &M) { Instruction *icmp_inv_sig_cmp; BasicBlock* sign_bb = BasicBlock::Create(C, "sign", end_bb->getParent(), end_bb); if (pred == CmpInst::ICMP_SGT) { - /* if we check for > and the op0 positiv and op1 negative then the final + /* if we check for > and the op0 positive and op1 negative then the final * result is true. if op0 negative and op1 pos, the cmp must result * in false */ @@ -369,7 +369,7 @@ bool SplitComparesTransform::splitCompares(Module &M, unsigned bitw) { BasicBlock* end_bb = bb->splitBasicBlock(BasicBlock::iterator(IcmpInst)); - /* create the comparison of the top halfs of the original operands */ + /* create the comparison of the top halves of the original operands */ Instruction *s_op0, *op0_high, *s_op1, *op1_high, *icmp_high; s_op0 = BinaryOperator::Create(Instruction::LShr, op0, ConstantInt::get(OldIntType, bitw / 2)); @@ -403,7 +403,7 @@ bool SplitComparesTransform::splitCompares(Module &M, unsigned bitw) { cmp_low_bb->getInstList().push_back(icmp_low); BranchInst::Create(end_bb, cmp_low_bb); - /* dependant on the cmp of the high parts go to the end or go on with + /* dependent on the cmp of the high parts go to the end or go on with * the comparison */ auto term = bb->getTerminator(); if (pred == CmpInst::ICMP_EQ) { @@ -448,7 +448,7 @@ bool SplitComparesTransform::splitCompares(Module &M, unsigned bitw) { term->eraseFromParent(); BranchInst::Create(end_bb, inv_cmp_bb, icmp_high, bb); - /* create a bb which handles the cmp of the lower halfs */ + /* create a bb which handles the cmp of the lower halves */ BasicBlock* cmp_low_bb = BasicBlock::Create(C, "injected", end_bb->getParent(), end_bb); op0_low = new TruncInst(op0, NewIntType); cmp_low_bb->getInstList().push_back(op0_low); diff --git a/llvm_mode/split-switches-pass.so.cc b/llvm_mode/split-switches-pass.so.cc index 8d4db292..17cb62c2 100644 --- a/llvm_mode/split-switches-pass.so.cc +++ b/llvm_mode/split-switches-pass.so.cc @@ -152,7 +152,7 @@ BasicBlock* SplitSwitchesTransform::switchConvert(CaseVector Cases, std::vector< } PHINode *PN = cast<PHINode>(I); - /* Only update the first occurence. */ + /* Only update the first occurrence. */ unsigned Idx = 0, E = PN->getNumIncomingValues(); for (; Idx != E; ++Idx) { if (PN->getIncomingBlock(Idx) == OrigBlock) { @@ -276,7 +276,7 @@ bool SplitSwitchesTransform::splitSwitches(Module &M) { } PHINode *PN = cast<PHINode>(I); - /* Only update the first occurence. */ + /* Only update the first occurrence. */ unsigned Idx = 0, E = PN->getNumIncomingValues(); for (; Idx != E; ++Idx) { if (PN->getIncomingBlock(Idx) == OrigBlock) { |