python
diff --git a/‎Include/internal/pycore_ceval.h
Lines changed: 1 addition & 0 deletions b/‎Include/internal/pycore_ceval.h
Lines changed: 1 addition & 0 deletions
diff --git a/‎Include/internal/pycore_interp.h
Lines changed: 1 addition & 1 deletion b/‎Include/internal/pycore_interp.h
Lines changed: 1 addition & 1 deletion
diff --git a/‎Include/internal/pycore_optimizer.h
Lines changed: 11 additions & 3 deletions b/‎Include/internal/pycore_optimizer.h
Lines changed: 11 additions & 3 deletions
diff --git a/‎Include/internal/pycore_uop_ids.h
Lines changed: 36 additions & 35 deletions b/‎Include/internal/pycore_uop_ids.h
Lines changed: 36 additions & 35 deletions
diff --git a/‎Include/internal/pycore_uop_metadata.h
Lines changed: 4 additions & 0 deletions b/‎Include/internal/pycore_uop_metadata.h
Lines changed: 4 additions & 0 deletions
diff --git a/‎Misc/NEWS.d/next/Core_and_Builtins/2024-08-27-21-44-14.gh-issue-116017.ZY3yBY.rst
Lines changed: 2 additions & 0 deletions b/‎Misc/NEWS.d/next/Core_and_Builtins/2024-08-27-21-44-14.gh-issue-116017.ZY3yBY.rst
Lines changed: 2 additions & 0 deletions
diff --git a/‎Python/bytecodes.c
Lines changed: 8 additions & 0 deletions b/‎Python/bytecodes.c
Lines changed: 8 additions & 0 deletions
diff --git a/‎Python/ceval_gil.c
Lines changed: 6 additions & 0 deletions b/‎Python/ceval_gil.c
Lines changed: 6 additions & 0 deletions
diff --git a/‎Python/executor_cases.c.h
Lines changed: 9 additions & 0 deletions b/‎Python/executor_cases.c.h
Lines changed: 9 additions & 0 deletions
diff --git a/‎Python/optimizer.c
Lines changed: 42 additions & 0 deletions b/‎Python/optimizer.c
Lines changed: 42 additions & 0 deletions
diff --git a/‎Python/optimizer_cases.c.h
Lines changed: 4 additions & 0 deletions b/‎Python/optimizer_cases.c.h
Lines changed: 4 additions & 0 deletions
diff --git a/‎Python/pystate.c
Lines changed: 1 addition & 0 deletions b/‎Python/pystate.c
Lines changed: 1 addition & 0 deletions
diff --git a/‎Tools/cases_generator/analyzer.py
Lines changed: 1 addition & 0 deletions b/‎Tools/cases_generator/analyzer.py
Lines changed: 1 addition & 0 deletions
diff --git a/‎Tools/jit/_targets.py
Lines changed: 3 additions & 0 deletions b/‎Tools/jit/_targets.py
Lines changed: 3 additions & 0 deletions
@@ -283,6 +283,7 @@ PyAPI_FUNC(PyObject *) _PyEval_LoadName(PyThreadState *tstate, _PyInterpreterFra
 #define _PY_GC_SCHEDULED_BIT (1U << 4)
 #define _PY_EVAL_PLEASE_STOP_BIT (1U << 5)
 #define _PY_EVAL_EXPLICIT_MERGE_BIT (1U << 6)
+#define _PY_EVAL_JIT_INVALIDATE_COLD_BIT (1U << 7)
 
 /* Reserve a few bits for future use */
 #define _PY_EVAL_EVENTS_BITS 8
 
@@ -261,7 +261,7 @@ struct _is {
     struct callable_cache callable_cache;
     _PyOptimizerObject *optimizer;
     _PyExecutorObject *executor_list_head;
-
+    size_t trace_run_counter;
     _rare_events rare_events;
     PyDict_WatchCallback builtins_dict_watcher;
 
 
@@ -29,9 +29,10 @@ typedef struct {
 typedef struct {
     uint8_t opcode;
     uint8_t oparg;
-    uint16_t valid:1;
-    uint16_t linked:1;
-    uint16_t chain_depth:14;  // Must be big engough for MAX_CHAIN_DEPTH - 1.
+    uint8_t valid:1;
+    uint8_t linked:1;
+    uint8_t chain_depth:6;  // Must be big enough for MAX_CHAIN_DEPTH - 1.
+    bool warm;
     int index;           // Index of ENTER_EXECUTOR (if code isn't NULL, below).
     _PyBloomFilter bloom;
     _PyExecutorLinkListNode links;
@@ -123,11 +124,18 @@ PyAPI_FUNC(PyObject *) _PyOptimizer_NewUOpOptimizer(void);
 #ifdef _Py_TIER2
 PyAPI_FUNC(void) _Py_Executors_InvalidateDependency(PyInterpreterState *interp, void *obj, int is_invalidation);
 PyAPI_FUNC(void) _Py_Executors_InvalidateAll(PyInterpreterState *interp, int is_invalidation);
+PyAPI_FUNC(void) _Py_Executors_InvalidateCold(PyInterpreterState *interp);
+
 #else
 #  define _Py_Executors_InvalidateDependency(A, B, C) ((void)0)
 #  define _Py_Executors_InvalidateAll(A, B) ((void)0)
+#  define _Py_Executors_InvalidateCold(A) ((void)0)
+
 #endif
 
+// Used as the threshold to trigger executor invalidation when
+// trace_run_counter is greater than this value.
+#define JIT_CLEANUP_THRESHOLD 100000
 
 // This is the length of the trace we project initially.
 #define UOP_MAX_TRACE_LENGTH 800
 
@@ -0,0 +1,2 @@
+Improved JIT memory consumption by periodically freeing memory used by infrequently-executed code.
+This change is especially likely to improve the memory footprint of long-running programs.
@@ -4836,6 +4836,14 @@ dummy_func(
             assert(((_PyExecutorObject *)executor)->vm_data.valid);
         }
 
+        tier2 op(_MAKE_WARM, (--)) {
+            current_executor->vm_data.warm = true;
+            // It's okay if this ends up going negative.
+            if (--tstate->interp->trace_run_counter == 0) {
+                _Py_set_eval_breaker_bit(tstate, _PY_EVAL_JIT_INVALIDATE_COLD_BIT);
+            }
+        }
+
         tier2 op(_FATAL_ERROR, (--)) {
             assert(0);
             Py_FatalError("Fatal error uop executed.");
 
@@ -1289,6 +1289,12 @@ _Py_HandlePending(PyThreadState *tstate)
         _Py_RunGC(tstate);
     }
 
+    if ((breaker & _PY_EVAL_JIT_INVALIDATE_COLD_BIT) != 0) {
+        _Py_unset_eval_breaker_bit(tstate, _PY_EVAL_JIT_INVALIDATE_COLD_BIT);
+        _Py_Executors_InvalidateCold(tstate->interp);
+        tstate->interp->trace_run_counter = JIT_CLEANUP_THRESHOLD;
+    }
+
     /* GIL drop request */
     if ((breaker & _PY_GIL_DROP_REQUEST_BIT) != 0) {
         /* Give another thread a chance */
 
@@ -565,6 +565,7 @@ translate_bytecode_to_trace(
             code->co_firstlineno,
             2 * INSTR_IP(initial_instr, code));
     ADD_TO_TRACE(_START_EXECUTOR, 0, (uintptr_t)instr, INSTR_IP(instr, code));
+    ADD_TO_TRACE(_MAKE_WARM, 0, 0, 0);
     uint32_t target = 0;
 
     for (;;) {
@@ -1194,6 +1195,9 @@ make_executor_from_uops(_PyUOpInstruction *buffer, int length, const _PyBloomFil
     executor->jit_code = NULL;
     executor->jit_side_entry = NULL;
     executor->jit_size = 0;
+    // This is initialized to true so we can prevent the executor
+    // from being immediately detected as cold and invalidated.
+    executor->vm_data.warm = true;
     if (_PyJIT_Compile(executor, executor->trace, length)) {
         Py_DECREF(executor);
         return NULL;
@@ -1659,4 +1663,42 @@ _Py_Executors_InvalidateAll(PyInterpreterState *interp, int is_invalidation)
     }
 }
 
+void
+_Py_Executors_InvalidateCold(PyInterpreterState *interp)
+{
+    /* Walk the list of executors */
+    /* TO DO -- Use a tree to avoid traversing as many objects */
+    PyObject *invalidate = PyList_New(0);
+    if (invalidate == NULL) {
+        goto error;
+    }
+
+    /* Clearing an executor can deallocate others, so we need to make a list of
+     * executors to invalidate first */
+    for (_PyExecutorObject *exec = interp->executor_list_head; exec != NULL;) {
+        assert(exec->vm_data.valid);
+        _PyExecutorObject *next = exec->vm_data.links.next;
+
+        if (!exec->vm_data.warm && PyList_Append(invalidate, (PyObject *)exec) < 0) {
+            goto error;
+        }
+        else {
+            exec->vm_data.warm = false;
+        }
+
+        exec = next;
+    }
+    for (Py_ssize_t i = 0; i < PyList_GET_SIZE(invalidate); i++) {
+        _PyExecutorObject *exec = (_PyExecutorObject *)PyList_GET_ITEM(invalidate, i);
+        executor_clear(exec);
+    }
+    Py_DECREF(invalidate);
+    return;
+error:
+    PyErr_Clear();
+    Py_XDECREF(invalidate);
+    // If we're truly out of memory, wiping out everything is a fine fallback
+    _Py_Executors_InvalidateAll(interp, 0);
+}
+
 #endif /* _Py_TIER2 */
@@ -660,6 +660,7 @@ init_interpreter(PyInterpreterState *interp,
 #ifdef _Py_TIER2
     (void)_Py_SetOptimizer(interp, NULL);
     interp->executor_list_head = NULL;
+    interp->trace_run_counter = JIT_CLEANUP_THRESHOLD;
 #endif
     if (interp != &runtime->_main_interpreter) {
         /* Fix the self-referential, statically initialized fields. */
 
@@ -540,6 +540,7 @@ def has_error_without_pop(op: parser.InstDef) -> bool:
     "_PyList_FromStackRefSteal",
     "_PyTuple_FromArraySteal",
     "_PyTuple_FromStackRefSteal",
+    "_Py_set_eval_breaker_bit"
 )
 
 ESCAPING_FUNCTIONS = (
 
@@ -139,6 +139,9 @@ async def _compile(
             "-fno-plt",
             # Don't call stack-smashing canaries that we can't find or patch:
             "-fno-stack-protector",
+            # On aarch64 Linux, intrinsics were being emitted and this flag
+            # was required to disable them.
+            "-mno-outline-atomics",
             "-std=c11",
             *self.args,
         ]
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,2 @@`
	`1`	`+Improved JIT memory consumption by periodically freeing memory used by infrequently-executed code.`
	`2`	`+This change is especially likely to improve the memory footprint of long-running programs.`
Original file line number	Diff line number	Diff line change
`@@ -540,6 +540,7 @@ def has_error_without_pop(op: parser.InstDef) -> bool:`
`540`	`540`	`"_PyList_FromStackRefSteal",`
`541`	`541`	`"_PyTuple_FromArraySteal",`
`542`	`542`	`"_PyTuple_FromStackRefSteal",`
	`543`	`+ "_Py_set_eval_breaker_bit"`
`543`	`544`	`)`
`544`	`545`
`545`	`546`	`ESCAPING_FUNCTIONS = (`