diff options
| author | Aaron Ballman <aaron@aaronballman.com> | 2015-01-29 16:58:29 +0000 |
|---|---|---|
| committer | Aaron Ballman <aaron@aaronballman.com> | 2015-01-29 16:58:29 +0000 |
| commit | ef11698cac5effc0fb7735188ce667fa837d6f88 (patch) | |
| tree | 6b0a1d784599a4253f0b5b54bbafd13920e87d8f /llvm/lib/Fuzzer/FuzzerCrossOver.cpp | |
| parent | 860210bc49555ec7163fb2d3bb3601ea956bbada (diff) | |
| download | bcm5719-llvm-ef11698cac5effc0fb7735188ce667fa837d6f88.tar.gz bcm5719-llvm-ef11698cac5effc0fb7735188ce667fa837d6f88.zip | |
Reverting r227452, which adds back the fuzzer library. Now excluding the fuzzer library based on LLVM_USE_SANITIZE_COVERAGE being set or unset.
llvm-svn: 227464
Diffstat (limited to 'llvm/lib/Fuzzer/FuzzerCrossOver.cpp')
| -rw-r--r-- | llvm/lib/Fuzzer/FuzzerCrossOver.cpp | 47 |
1 files changed, 47 insertions, 0 deletions
diff --git a/llvm/lib/Fuzzer/FuzzerCrossOver.cpp b/llvm/lib/Fuzzer/FuzzerCrossOver.cpp new file mode 100644 index 00000000000..94af6d547ed --- /dev/null +++ b/llvm/lib/Fuzzer/FuzzerCrossOver.cpp @@ -0,0 +1,47 @@ +//===- FuzzerCrossOver.cpp - Cross over two test inputs -------------------===// +// +// The LLVM Compiler Infrastructure +// +// This file is distributed under the University of Illinois Open Source +// License. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// +// Cross over test inputs. +//===----------------------------------------------------------------------===// + +#include "FuzzerInternal.h" +#include <algorithm> + +namespace fuzzer { + +// Cross A and B, store the result (ap to MaxLen bytes) in U. +void CrossOver(const Unit &A, const Unit &B, Unit *U, size_t MaxLen) { + size_t Size = rand() % MaxLen + 1; + U->clear(); + const Unit *V = &A; + size_t PosA = 0; + size_t PosB = 0; + size_t *Pos = &PosA; + while (U->size() < Size && (PosA < A.size() || PosB < B.size())) { + // Merge a part of V into U. + size_t SizeLeftU = Size - U->size(); + if (*Pos < V->size()) { + size_t SizeLeftV = V->size() - *Pos; + size_t MaxExtraSize = std::min(SizeLeftU, SizeLeftV); + size_t ExtraSize = rand() % MaxExtraSize + 1; + U->insert(U->end(), V->begin() + *Pos, V->begin() + *Pos + ExtraSize); + (*Pos) += ExtraSize; + } + + // Use the other Unit on the next iteration. + if (Pos == &PosA) { + Pos = &PosB; + V = &B; + } else { + Pos = &PosA; + V = &A; + } + } +} + +} // namespace fuzzer |

