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

copies: add test that makes both the merging csets dirty and fails...

copies: add test that makes both the merging csets dirty and fails This patch is a part of series which is about the case when both the merging csets are not descendant of merge base. The existing code assumes if c1 is dirty there shouldn't be any partial copies from c2 i.e both2['incomplete'] and same for c2, if c2 is dirty both1['incomplete'] should be empty, but this is not the right assumption. Now as we know we can have both c1 and c2 dirty at the same time, it is possible that c1 is dirty and both2['incomplete'] has some value. Or if c2 is dirty and both1['incomplete'] has some value. Added test shows that because of this assumption it could fail. Differential Revision: https://phab.mercurial-scm.org/D5962

Yuya Nishihara - - Load All Authors

File last commit:

r38234:a1c0873a default


                r42097:fc4b7a46

default

Download file

             fuzzutil.cc
        
                    27 lines
            
             | 922 B
            
                | text/x-c
            
             |
                CppLexer
            
             / contrib / fuzz / fuzzutil.cc
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      #include "fuzzutil.h"

      #include <cstring>

      #include <utility>

      contrib::optional<two_inputs> SplitInputs(const uint8_t *Data, size_t Size)

      {

      	if (!Size) {

      		return contrib::nullopt;

      	}

      	// figure out a random point in [0, Size] to split our input.

      	size_t left_size = (Data[0] / 255.0) * (Size - 1);

      	// Copy inputs to new allocations so if bdiff over-reads

      	// AddressSanitizer can detect it.

      	std::unique_ptr<char[]> left(new char[left_size]);

      	std::memcpy(left.get(), Data + 1, left_size);

      	// right starts at the next byte after left ends

      	size_t right_size = Size - (left_size + 1);

      	std::unique_ptr<char[]> right(new char[right_size]);

      	std::memcpy(right.get(), Data + 1 + left_size, right_size);

      	LOG(2) << "inputs are  " << left_size << " and " << right_size

      	       << " bytes" << std::endl;

      	two_inputs result = {std::move(right), right_size, std::move(left),

      	                     left_size};

      	return result;

      }

	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 "fuzzutil.h"

				#include <cstring>
				#include <utility>

				contrib::optional<two_inputs> SplitInputs(const uint8_t *Data, size_t Size)
				{
				if (!Size) {
				return contrib::nullopt;
				}
				// figure out a random point in [0, Size] to split our input.
				size_t left_size = (Data[0] / 255.0) * (Size - 1);

				// Copy inputs to new allocations so if bdiff over-reads
				// AddressSanitizer can detect it.
				std::unique_ptr<char[]> left(new char[left_size]);
				std::memcpy(left.get(), Data + 1, left_size);
				// right starts at the next byte after left ends
				size_t right_size = Size - (left_size + 1);
				std::unique_ptr<char[]> right(new char[right_size]);
				std::memcpy(right.get(), Data + 1 + left_size, right_size);
				LOG(2) << "inputs are " << left_size << " and " << right_size
				<< " bytes" << std::endl;
				two_inputs result = {std::move(right), right_size, std::move(left),
				left_size};
				return result;
				}