Mercurial > hg
view contrib/fuzz/bdiff.cc @ 43231:30570a056fa8
sidedatacopies: only store an entry if it has values
This will make for a shorter storage and help use to write faster code in simple
case. This change already provided a speed boost for copy tracing.
For example here is combined time of running copies tracing on a 6989 pairs of
revision on the pypy repos:
before: 771s
after: 631s - 18%
This also has a very positive impact on changelog size. For example here are the
number for the `00changelog.d` file of pypy.
before: 30449712 Bytes
after: 24973718 Bytes - 18%
This give an overall quite acceptable overhead for storing copies into the
changelog:
filelog-only: 23370586
sidedata: 24973718 Bytes + 7%
Differential Revision: https://phab.mercurial-scm.org/D7068
author | Pierre-Yves David <pierre-yves.david@octobus.net> |
---|---|
date | Wed, 02 Oct 2019 14:38:34 -0400 |
parents | fa0ddd5e8fff |
children | dbc39f028c9f |
line wrap: on
line source
/* * bdiff.cc - fuzzer harness for bdiff.c * * Copyright 2018, Google Inc. * * This software may be used and distributed according to the terms of * the GNU General Public License, incorporated herein by reference. */ #include <memory> #include <stdlib.h> #include "fuzzutil.h" extern "C" { #include "bdiff.h" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { auto maybe_inputs = SplitInputs(Data, Size); if (!maybe_inputs) { return 0; } auto inputs = std::move(maybe_inputs.value()); struct bdiff_line *a, *b; int an = bdiff_splitlines(inputs.left.get(), inputs.left_size, &a); int bn = bdiff_splitlines(inputs.right.get(), inputs.right_size, &b); struct bdiff_hunk l; bdiff_diff(a, an, b, bn, &l); free(a); free(b); bdiff_freehunks(l.next); return 0; // Non-zero return values are reserved for future use. } #ifdef HG_FUZZER_INCLUDE_MAIN int main(int argc, char **argv) { const char data[] = "asdf"; return LLVMFuzzerTestOneInput((const uint8_t *)data, 4); } #endif } // extern "C"