# HG changeset patch
# User wenzelm
# Date 1676909599 -3600
# Node ID b8ec3c0455dba71418aae444621ce5eb4ba79cd0
# Parent  d17b0851a61a9ed97e2239e2a3c820b4fc5f0a9e
clarified modules: NUMA is managed by Build_Process;

diff -r d17b0851a61a -r b8ec3c0455db src/Pure/System/numa.scala
--- a/src/Pure/System/numa.scala	Mon Feb 20 17:10:22 2023 +0100
+++ b/src/Pure/System/numa.scala	Mon Feb 20 17:13:19 2023 +0100
@@ -62,21 +62,4 @@
         case _ => true
       })
   }
-
-  class Nodes(enabled: Boolean = true) {
-    private val available = nodes().zipWithIndex
-    private var next_index = 0
-
-    def next(used: Int => Boolean = _ => false): Option[Int] = synchronized {
-      if (!enabled || available.isEmpty) None
-      else {
-        val candidates = available.drop(next_index) ::: available.take(next_index)
-        val (n, i) =
-          candidates.find({ case (n, i) => i == next_index && !used(n) }) orElse
-            candidates.find({ case (n, _) => !used(n) }) getOrElse candidates.head
-        next_index = (i + 1) % available.length
-        Some(n)
-      }
-    }
-  }
 }
diff -r d17b0851a61a -r b8ec3c0455db src/Pure/Tools/build_process.scala
--- a/src/Pure/Tools/build_process.scala	Mon Feb 20 17:10:22 2023 +0100
+++ b/src/Pure/Tools/build_process.scala	Mon Feb 20 17:13:19 2023 +0100
@@ -119,9 +119,10 @@
             }
         }
 
-      new Context(store, deps, sessions, ordering, progress,
-        build_heap = build_heap, numa_shuffling = numa_shuffling, max_jobs = max_jobs,
-        fresh_build = fresh_build, no_build = no_build, verbose = verbose, session_setup)
+      val numa_nodes = if (numa_shuffling) NUMA.nodes() else Nil
+      new Context(store, deps, sessions, ordering, progress, numa_nodes,
+        build_heap = build_heap, max_jobs = max_jobs, fresh_build = fresh_build,
+        no_build = no_build, verbose = verbose, session_setup)
     }
   }
 
@@ -131,8 +132,8 @@
     sessions: Map[String, Session_Context],
     val ordering: Ordering[String],
     val progress: Progress,
+    val numa_nodes: List[Int],
     val build_heap: Boolean,
-    val numa_shuffling: Boolean,
     val max_jobs: Int,
     val fresh_build: Boolean,
     val no_build: Boolean,
@@ -191,7 +192,7 @@
     }
 
   // global state
-  private val _numa_nodes = new NUMA.Nodes(build_context.numa_shuffling)
+  private var _numa_index = 0
   private var _pending: List[Build_Process.Entry] =
     (for ((name, (_, (preds, _))) <- build_context.sessions_structure.build_graph.iterator)
       yield Build_Process.Entry(name, preds.toList)).toList
@@ -214,8 +215,18 @@
   }
 
   private def next_numa_node(): Option[Int] = synchronized {
-    _numa_nodes.next(used =
-      Set.from(for { job <- _running.valuesIterator; i <- job.numa_node } yield i))
+    val available = build_context.numa_nodes.zipWithIndex
+    if (available.isEmpty) None
+    else {
+      val used = Set.from(for (job <- _running.valuesIterator; i <- job.numa_node) yield i)
+      val index = _numa_index
+      val candidates = available.drop(index) ::: available.take(index)
+      val (n, i) =
+        candidates.find({ case (n, i) => i == index && !used(n) }) orElse
+        candidates.find({ case (n, _) => !used(n) }) getOrElse candidates.head
+      _numa_index = (i + 1) % available.length
+      Some(n)
+    }
   }
 
   private def stop_running(): Unit = synchronized { _running.valuesIterator.foreach(_.terminate()) }