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

clone: properly exclude rev-branch-cache from post clone cache warming...

clone: properly exclude rev-branch-cache from post clone cache warming When adding "CACHE_REV_BRANCH" to "CACHES_ALL" in e51161b12c7e, I did not expected it to impact the clone steps. However the "CACHES_POST_CLONE" set is created rather creatively. (we should fix that, but not on stable) The benchmark caught a quite significant slowdown one hardlink and ssh-stream clones. Such slow down can be reduced to around ~5% by fully warming the cache before the clone. However keeping this expensive step away from the clone operation fully fix the slowdown and preserve the initial intend. Example slowdow for hardlink clone ### benchmark.name = hg.command.clone # bin-env-vars.hg.flavor = default # bin-env-vars.hg.py-re2-module = default # benchmark.variants.explicit-rev = none # benchmark.variants.issue6528 = default # benchmark.variants.protocol = local-hardlink # benchmark.variants.pulled-delta-reuse-policy = default # benchmark.variants.resource-usage = default # benchmark.variants.validate = default ## data-env-vars.name = netbeans-2018-08-01-zstd-sparse-revlog 6.8.2: 19.799752 6.9rc0: 29.017493 (+46.55%, +9.22) after: 19.929341 ## data-env-vars.name = mercurial-public-2018-08-01-zstd-sparse-revlog 6.8.2: 0.468020 6.9rc0: 1.701294 (+263.51%, +1.23) after: 0.471934 ## data-env-vars.name = pypy-2024-03-22-zstd-sparse-revlog 6.8.2: 2.397564 6.9rc0: 5.666641 (+137.41%, +3.28) after: 2.428085

Matt Harbison - - Load All Authors

File last commit:

r52756:f4733654 default


                r53138:d57d1606

stable

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