upstream/mercurial-mirror Files · contrib/bdiff-torture.py

verify: replace _validpath() by matcher...

verify: replace _validpath() by matcher The verifier calls out to _validpath() to check if it should verify that path and the narrowhg extension overrides _validpath() to tell the verifier to skip that path. In treemanifest repos, the verifier calls the same method to check if it should visit a directory. However, the decision to visit a directory is different from the condition that it's a matching path, and narrowhg was working around it by returning True from its _validpath() override if *either* was true. Similar to how one can do "hg files -I foo/bar/ -X foo/" (making the include pointless), narrowhg can be configured to track the same paths. In that case match("foo/bar/baz") would be false, but match.visitdir("foo/bar/baz") turns out to be true, causing verify to fail. This may seem like a bug in visitdir(), but it's explicitly documented to be undefined for subdirectories of excluded directories. When using treemanifests, the walk would not descend into foo/, so verification would pass. However, when using flat manifests, there is no recursive directory walk and the file path "foo/bar/baz" would be passed to _validpath() without "foo/" (actually without the slash) being passed first. As explained above, _validpath() would return true for the file path and "hg verify" would fail. Replacing the _validpath() method by a matcher seems like the obvious fix. Narrowhg can then pass in its own matcher and not have to conflate the two matching functions (for dirs and files). I think it also makes the code clearer.

Yuya Nishihara - - Load All Authors

File last commit:

r29209:eccfd650 default


                r30866:5249b647

default

Download file

             bdiff-torture.py
        
                    100 lines
            
             | 2.1 KiB
            
                | text/x-python
            
             |
                PythonLexer
            
             / contrib / bdiff-torture.py
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      # Randomized torture test generation for bdiff

      from __future__ import absolute_import, print_function

      import random

      import sys

      from mercurial import (

          bdiff,

          mpatch,

      )

      def reducetest(a, b):

          tries = 0

          reductions = 0

          print("reducing...")

          while tries < 1000:

              a2 = "\n".join(l for l in a.splitlines()

                             if random.randint(0, 100) > 0) + "\n"

              b2 = "\n".join(l for l in b.splitlines()

                             if random.randint(0, 100) > 0) + "\n"

              if a2 == a and b2 == b:

                  continue

              if a2 == b2:

                  continue

              tries += 1

              try:

                  test1(a, b)

              except Exception as inst:

                  reductions += 1

                  tries = 0

                  a = a2

                  b = b2

          print("reduced:", reductions, len(a) + len(b),

                repr(a), repr(b))

          try:

              test1(a, b)

          except Exception as inst:

              print("failed:", inst)

          sys.exit(0)

      def test1(a, b):

          d = bdiff.bdiff(a, b)

          if not d:

              raise ValueError("empty")

          c = mpatch.patches(a, [d])

          if c != b:

              raise ValueError("bad")

      def testwrap(a, b):

          try:

              test1(a, b)

              return

          except Exception as inst:

              pass

          print("exception:", inst)

          reducetest(a, b)

      def test(a, b):

          testwrap(a, b)

          testwrap(b, a)

      def rndtest(size, noise):

          a = []

          src = "                aaaaaaaabbbbccd"

          for x in xrange(size):

              a.append(src[random.randint(0, len(src) - 1)])

          while True:

              b = [c for c in a if random.randint(0, 99) > noise]

              b2 = []

              for c in b:

                  b2.append(c)

                  while random.randint(0, 99) < noise:

                      b2.append(src[random.randint(0, len(src) - 1)])

              if b2 != a:

                  break

          a = "\n".join(a) + "\n"

          b = "\n".join(b2) + "\n"

          test(a, b)

      maxvol = 10000

      startsize = 2

      while True:

          size = startsize

          count = 0

          while size < maxvol:

              print(size)

              volume = 0

              while volume < maxvol:

                  rndtest(size, 2)

                  volume += size

                  count += 2

              size *= 2

          maxvol *= 4

          startsize *= 4

	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

				# Randomized torture test generation for bdiff

				from __future__ import absolute_import, print_function
				import random
				import sys

				from mercurial import (
				bdiff,
				mpatch,
				)

				def reducetest(a, b):
				tries = 0
				reductions = 0
				print("reducing...")
				while tries < 1000:
				a2 = "\n".join(l for l in a.splitlines()
				if random.randint(0, 100) > 0) + "\n"
				b2 = "\n".join(l for l in b.splitlines()
				if random.randint(0, 100) > 0) + "\n"
				if a2 == a and b2 == b:
				continue
				if a2 == b2:
				continue
				tries += 1

				try:
				test1(a, b)
				except Exception as inst:
				reductions += 1
				tries = 0
				a = a2
				b = b2

				print("reduced:", reductions, len(a) + len(b),
				repr(a), repr(b))
				try:
				test1(a, b)
				except Exception as inst:
				print("failed:", inst)

				sys.exit(0)

				def test1(a, b):
				d = bdiff.bdiff(a, b)
				if not d:
				raise ValueError("empty")
				c = mpatch.patches(a, [d])
				if c != b:
				raise ValueError("bad")

				def testwrap(a, b):
				try:
				test1(a, b)
				return
				except Exception as inst:
				pass
				print("exception:", inst)
				reducetest(a, b)

				def test(a, b):
				testwrap(a, b)
				testwrap(b, a)

				def rndtest(size, noise):
				a = []
				src = " aaaaaaaabbbbccd"
				for x in xrange(size):
				a.append(src[random.randint(0, len(src) - 1)])

				while True:
				b = [c for c in a if random.randint(0, 99) > noise]
				b2 = []
				for c in b:
				b2.append(c)
				while random.randint(0, 99) < noise:
				b2.append(src[random.randint(0, len(src) - 1)])
				if b2 != a:
				break

				a = "\n".join(a) + "\n"
				b = "\n".join(b2) + "\n"

				test(a, b)

				maxvol = 10000
				startsize = 2
				while True:
				size = startsize
				count = 0
				while size < maxvol:
				print(size)
				volume = 0
				while volume < maxvol:
				rndtest(size, 2)
				volume += size
				count += 2
				size *= 2
				maxvol *= 4
				startsize *= 4