# HG changeset patch
# User Pierre-Yves David <pierre-yves.david@octobus.net>
# Date 1709909415 -3600
# Node ID 1a9bdd0e1c444df10e233b047a120e2b869e4088
# Parent  0ddc34330d4147c99f0d6aa1d87ddac8fa166c15
branchcache: write branchmap in subset inheritance order

This way, we can guarantee a valid subset has been written before touching the
branchmap of another filter.

This is especially useful as we are bout to start deleting outdated branchmap
file.

diff -r 0ddc34330d41 -r 1a9bdd0e1c44 mercurial/branchmap.py
--- a/mercurial/branchmap.py	Fri Mar 08 15:06:54 2024 +0100
+++ b/mercurial/branchmap.py	Fri Mar 08 15:50:15 2024 +0100
@@ -166,7 +166,10 @@
 
     def write_delayed(self, repo):
         unfi = repo.unfiltered()
-        for filtername, cache in self._per_filter.items():
+        for filtername in repoviewutil.get_ordered_subset():
+            cache = self._per_filter.get(filtername)
+            if cache is None:
+                continue
             if cache._delayed:
                 if filtername is None:
                     repo = unfi
diff -r 0ddc34330d41 -r 1a9bdd0e1c44 mercurial/utils/repoviewutil.py
--- a/mercurial/utils/repoviewutil.py	Fri Mar 08 15:06:54 2024 +0100
+++ b/mercurial/utils/repoviewutil.py	Fri Mar 08 15:50:15 2024 +0100
@@ -6,6 +6,7 @@
 # This software may be used and distributed according to the terms of the
 # GNU General Public License version 2 or any later version.
 
+from .. import error
 
 ### Nearest subset relation
 # Nearest subset of filter X is a filter Y so that:
@@ -21,3 +22,30 @@
     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