upstream/mercurial-mirror Files · mercurial/utils/repoviewutil.py

rev-branch-cache: reenable memory mapping of the revision data...

rev-branch-cache: reenable memory mapping of the revision data Now that we are no longer truncating it, we can mmap it again. This provide a sizeable speedup on repository with a very large amount of revision for example for a mozilla-try clone with 5 793 383 revisions, this provide a speedup of 5ms - 10ms. Since they happens within the "critical" locked path during push. These miliseconds are important. In addition, the v3 branchmap format is use the rev-branch-cache more than the v2 branchmap cache so this will be important. On smaller repository we consistently see an improvement of one or two percents, but the gain in absolute time is usually < 10 ms. #### benchmark.name = hg.command.unbundle # benchmark.variants.issue6528 = disabled # benchmark.variants.reuse-external-delta-parent = yes # benchmark.variants.revs = any-1-extra-rev # benchmark.variants.source = unbundle # benchmark.variants.verbosity = quiet ### data-env-vars.name = mozilla-try-2024-03-26-zstd-sparse-revlog ## bin-env-vars.hg.flavor = default e51161b12c7e: 3.527923 ebdcfe85b070: 3.468178 (-1.69%, -0.06) ## bin-env-vars.hg.flavor = rust e51161b12c7e: 3.580158 ebdcfe85b070: 3.480564 (-2.78%, -0.10) ### data-env-vars.name = mozilla-try-2024-03-26-ds2-pnm ## bin-env-vars.hg.flavor = rust e51161b12c7e: 3.527923 ebdcfe85b070: 3.468178 (-1.69%, -0.06)

Matt Harbison - - Load All Authors

File last commit:

r52756:f4733654 default


                r52803:5d352e36

default

Download file

             repoviewutil.py
        
                    53 lines
            
             | 1.6 KiB
            
                | text/x-python
            
             |
                PythonLexer
            
             / mercurial / utils / repoviewutil.py
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      # repoviewutil.py - constaints data relevant to repoview.py and other module

      #

      # Copyright 2012 Pierre-Yves David <pierre-yves.david@ens-lyon.org>

      #                Logilab SA        <contact@logilab.fr>

      #

      # This software may be used and distributed according to the terms of the

      # GNU General Public License version 2 or any later version.

      from __future__ import annotations

      from .. import error

      ### Nearest subset relation

      # Nearest subset of filter X is a filter Y so that:

      # * Y is included in X,

      # * X - Y is as small as possible.

      # This create and ordering used for branchmap purpose.

      # the ordering may be partial

      subsettable = {

          None: b'visible',

          b'visible-hidden': b'visible',

          b'visible': b'served',

          b'served.hidden': b'served',

          b'served': b'immutable',

          b'immutable': b'base',

      }

      def get_ordered_subset():

          """return a list of subset name from dependencies to dependents"""

          _unfinalized = set(subsettable.values())

          ordered = []

          # the subset table is expected to be small so we do the stupid N² version

          # of the algorithm

          while _unfinalized:

              this_level = []

              for candidate in _unfinalized:

                  dependency = subsettable.get(candidate)

                  if dependency not in _unfinalized:

                      this_level.append(candidate)

              if not this_level:

                  msg = "cyclic dependencies in repoview subset %r"

                  msg %= subsettable

                  raise error.ProgrammingError(msg)

              this_level.sort(key=lambda x: x if x is not None else '')

              ordered.extend(this_level)

              _unfinalized.difference_update(this_level)

          return ordered

	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

				# repoviewutil.py - constaints data relevant to repoview.py and other module
				#
				# Copyright 2012 Pierre-Yves David <pierre-yves.david@ens-lyon.org>
				# Logilab SA <contact@logilab.fr>
				#
				# This software may be used and distributed according to the terms of the
				# GNU General Public License version 2 or any later version.

				from __future__ import annotations

				from .. import error

				### Nearest subset relation
				# Nearest subset of filter X is a filter Y so that:
				# * Y is included in X,
				# * X - Y is as small as possible.
				# This create and ordering used for branchmap purpose.
				# the ordering may be partial
				subsettable = {
				None: b'visible',
				b'visible-hidden': b'visible',
				b'visible': b'served',
				b'served.hidden': b'served',
				b'served': b'immutable',
				b'immutable': b'base',
				}


				def get_ordered_subset():
				"""return a list of subset name from dependencies to dependents"""
				_unfinalized = set(subsettable.values())
				ordered = []

				# the subset table is expected to be small so we do the stupid N² version
				# of the algorithm
				while _unfinalized:
				this_level = []
				for candidate in _unfinalized:
				dependency = subsettable.get(candidate)
				if dependency not in _unfinalized:
				this_level.append(candidate)

				if not this_level:
				msg = "cyclic dependencies in repoview subset %r"
				msg %= subsettable
				raise error.ProgrammingError(msg)

				this_level.sort(key=lambda x: x if x is not None else '')

				ordered.extend(this_level)
				_unfinalized.difference_update(this_level)

				return ordered