upstream/mercurial-mirror Files · contrib/fuzz/revlog.cc

phases: avoid N² behavior in `advanceboundary`...

phases: avoid N² behavior in `advanceboundary` We allowed duplicated entries in the deque, which each entry could potentially insert all its ancestors. So advancing boundary for the full repository would mean each revision would walk all its ancestors, resulting in O(N²) iteration. For repository of any decent size, N² is quickly insane. We introduce a simple set to avoid this and get back to reasonable performance.

marmoute - - Load All Authors

File last commit:

r50573:efbbc2f9 default


                r52783:c9ceb4f6

6.7 stable

Download file

             revlog.cc
        
                    61 lines
            
             | 1.6 KiB
            
                | text/x-c
            
             |
                CppLexer
            
             / contrib / fuzz / revlog.cc
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      #include <Python.h>

      #include <assert.h>

      #include <stdlib.h>

      #include <unistd.h>

      #include <string>

      #include "pyutil.h"

      extern "C" {

      static PYCODETYPE *code;

      extern "C" int LLVMFuzzerInitialize(int *argc, char ***argv)

      {

      	contrib::initpy(*argv[0]);

      	code = (PYCODETYPE *)Py_CompileString(R"py(

      for inline in (True, False):

          try:

              index, cache = parsers.parse_index2(data, inline)

              index.slicechunktodensity(list(range(len(index))), 0.5, 262144)

              index.stats()

              index.findsnapshots({}, 0, len(index) - 1)

              10 in index

              for rev in range(len(index)):

                  index.reachableroots(0, [len(index)-1], [rev])

                  node = index[rev][7]

                  partial = index.shortest(node)

                  index.partialmatch(node[:partial])

                  index.deltachain(rev, None, True)

          except Exception as e:

              pass

              # uncomment this print if you're editing this Python code

              # to debug failures.

              # print e

      )py",

      	                                      "fuzzer", Py_file_input);

      	return 0;

      }

      int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size)

      {

      	// Don't allow fuzzer inputs larger than 60k, since we'll just bog

      	// down and not accomplish much.

      	if (Size > 60000) {

      		return 0;

      	}

      	PyObject *text =

      	    PyBytes_FromStringAndSize((const char *)Data, (Py_ssize_t)Size);

      	PyObject *locals = PyDict_New();

      	PyDict_SetItemString(locals, "data", text);

      	PyObject *res = PyEval_EvalCode(code, contrib::pyglobals(), locals);

      	if (!res) {

      		PyErr_Print();

      	}

      	Py_XDECREF(res);

      	Py_DECREF(locals);

      	Py_DECREF(text);

      	return 0; // Non-zero return values are reserved for future use.

      }

      }

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				#include <Python.h>
				#include <assert.h>
				#include <stdlib.h>
				#include <unistd.h>

				#include <string>

				#include "pyutil.h"

				extern "C" {

				static PYCODETYPE *code;

				extern "C" int LLVMFuzzerInitialize(int argc, char **argv)
				{
				contrib::initpy(*argv[0]);
				code = (PYCODETYPE *)Py_CompileString(R"py(
				for inline in (True, False):
				try:
				index, cache = parsers.parse_index2(data, inline)
				index.slicechunktodensity(list(range(len(index))), 0.5, 262144)
				index.stats()
				index.findsnapshots({}, 0, len(index) - 1)
				10 in index
				for rev in range(len(index)):
				index.reachableroots(0, [len(index)-1], [rev])
				node = index[rev][7]
				partial = index.shortest(node)
				index.partialmatch(node[:partial])
				index.deltachain(rev, None, True)
				except Exception as e:
				pass
				# uncomment this print if you're editing this Python code
				# to debug failures.
				# print e
				)py",
				"fuzzer", Py_file_input);
				return 0;
				}

				int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size)
				{
				// Don't allow fuzzer inputs larger than 60k, since we'll just bog
				// down and not accomplish much.
				if (Size > 60000) {
				return 0;
				}
				PyObject *text =
				PyBytes_FromStringAndSize((const char *)Data, (Py_ssize_t)Size);
				PyObject *locals = PyDict_New();
				PyDict_SetItemString(locals, "data", text);
				PyObject *res = PyEval_EvalCode(code, contrib::pyglobals(), locals);
				if (!res) {
				PyErr_Print();
				}
				Py_XDECREF(res);
				Py_DECREF(locals);
				Py_DECREF(text);
				return 0; // Non-zero return values are reserved for future use.
				}
				}