#include "Python.h"

#ifdef _Py_TIER2

#include "opcode.h"

#include "pycore_interp.h"

#include "pycore_backoff.h"

#include "pycore_bitutils.h" // _Py_popcount32()

#include "pycore_ceval.h" // _Py_set_eval_breaker_bit

#include "pycore_code.h" // _Py_GetBaseCodeUnit

#include "pycore_function.h" // _PyFunction_LookupByVersion()

#include "pycore_interpframe.h"

#include "pycore_object.h" // _PyObject_GC_UNTRACK()

#include "pycore_opcode_metadata.h" // _PyOpcode_OpName[]

#include "pycore_opcode_utils.h" // MAX_REAL_OPCODE

#include "pycore_optimizer.h" // _Py_uop_analyze_and_optimize()

#include "pycore_pystate.h" // _PyInterpreterState_GET()

#include "pycore_tuple.h" // _PyTuple_FromArraySteal

#include "pycore_unicodeobject.h" // _PyUnicode_FromASCII

#include "pycore_uop_ids.h"

#include "pycore_jit.h"

#include <stdbool.h>

#include <stdint.h>

#include <stddef.h>

#define NEED_OPCODE_METADATA

#include "pycore_uop_metadata.h" // Uop tables

#undef NEED_OPCODE_METADATA

#define MAX_EXECUTORS_SIZE 256

// Trace too short, no progress:

// _START_EXECUTOR

// _MAKE_WARM

// _CHECK_VALIDITY

// _SET_IP

// is 4-5 instructions.

#define CODE_SIZE_NO_PROGRESS 5

// We start with _START_EXECUTOR, _MAKE_WARM

#define CODE_SIZE_EMPTY 2

#define _PyExecutorObject_CAST(op) ((_PyExecutorObject *)(op))

static bool

has_space_for_executor(PyCodeObject *code, _Py_CODEUNIT *instr)

{

if (code == (PyCodeObject *)&_Py_InitCleanup) {

return false;

}

if (instr->op.code == ENTER_EXECUTOR) {

return true;

}

if (code->co_executors == NULL) {

return true;

}

return code->co_executors->size < MAX_EXECUTORS_SIZE;

}

static int32_t

get_index_for_executor(PyCodeObject *code, _Py_CODEUNIT *instr)

{

if (instr->op.code == ENTER_EXECUTOR) {

return instr->op.arg;

}

_PyExecutorArray *old = code->co_executors;

int size = 0;

int capacity = 0;

if (old != NULL) {

size = old->size;

capacity = old->capacity;

assert(size < MAX_EXECUTORS_SIZE);

}

assert(size <= capacity);

if (size == capacity) {

/* Array is full. Grow array */

int new_capacity = capacity ? capacity * 2 : 4;

_PyExecutorArray *new = PyMem_Realloc(

old,

offsetof(_PyExecutorArray, executors) +

new_capacity * sizeof(_PyExecutorObject *));

if (new == NULL) {

return -1;

}

new->capacity = new_capacity;

new->size = size;

code->co_executors = new;

}

assert(size < code->co_executors->capacity);

return size;

}

static void

insert_executor(PyCodeObject *code, _Py_CODEUNIT *instr, int index, _PyExecutorObject *executor)

{

Py_INCREF(executor);

if (instr->op.code == ENTER_EXECUTOR) {

assert(index == instr->op.arg);

_Py_ExecutorDetach(code->co_executors->executors[index]);

}

else {

assert(code->co_executors->size == index);

assert(code->co_executors->capacity > index);

code->co_executors->size++;

}

executor->vm_data.opcode = instr->op.code;

executor->vm_data.oparg = instr->op.arg;

executor->vm_data.code = code;

executor->vm_data.index = (int)(instr - _PyCode_CODE(code));

code->co_executors->executors[index] = executor;

assert(index < MAX_EXECUTORS_SIZE);

instr->op.code = ENTER_EXECUTOR;

instr->op.arg = index;

}

static _PyExecutorObject *

make_executor_from_uops(_PyUOpInstruction *buffer, int length, const _PyBloomFilter *dependencies, int chain_depth);

static int

uop_optimize(_PyInterpreterFrame *frame, PyThreadState *tstate,

_PyExecutorObject **exec_ptr,

bool progress_needed);

/* Returns 1 if optimized, 0 if not optimized, and -1 for an error.

* If optimized, *executor_ptr contains a new reference to the executor

*/

// gh-137573: inlining this function causes stack overflows

Py_NO_INLINE int

_PyOptimizer_Optimize(

_PyInterpreterFrame *frame, PyThreadState *tstate)

{

_PyThreadStateImpl *_tstate = (_PyThreadStateImpl *)tstate;

int chain_depth = _tstate->jit_tracer_state.initial_state.chain_depth;

PyInterpreterState *interp = _PyInterpreterState_GET();

if (!interp->jit) {

// gh-140936: It is possible that interp->jit will become false during

// interpreter finalization. However, the specialized JUMP_BACKWARD_JIT

// instruction may still be present. In this case, we should

// return immediately without optimization.

return 0;

}

assert(!interp->compiling);

assert(_tstate->jit_tracer_state.initial_state.stack_depth >= 0);

#ifndef Py_GIL_DISABLED

assert(_tstate->jit_tracer_state.initial_state.func != NULL);

interp->compiling = true;

// The first executor in a chain and the MAX_CHAIN_DEPTH'th executor *must*

// make progress in order to avoid infinite loops or excessively-long

// side-exit chains. We can only insert the executor into the bytecode if

// this is true, since a deopt won't infinitely re-enter the executor:

chain_depth %= MAX_CHAIN_DEPTH;

bool progress_needed = chain_depth == 0;

PyCodeObject *code = (PyCodeObject *)_tstate->jit_tracer_state.initial_state.code;

_Py_CODEUNIT *start = _tstate->jit_tracer_state.initial_state.start_instr;

if (progress_needed && !has_space_for_executor(code, start)) {

interp->compiling = false;

return 0;

}

// One of our dependencies while tracing was invalidated. Not worth compiling.

if (!_tstate->jit_tracer_state.prev_state.dependencies_still_valid) {

interp->compiling = false;

return 0;

}

_PyExecutorObject *executor;

int err = uop_optimize(frame, tstate, &executor, progress_needed);

if (err <= 0) {

interp->compiling = false;

return err;

}

assert(executor != NULL);

if (progress_needed) {

int index = get_index_for_executor(code, start);

if (index < 0) {

/* Out of memory. Don't raise and assume that the

* error will show up elsewhere.

*

* If an optimizer has already produced an executor,

* it might get confused by the executor disappearing,

* but there is not much we can do about that here. */

Py_DECREF(executor);

interp->compiling = false;

return 0;

}

insert_executor(code, start, index, executor);

}

else {

executor->vm_data.code = NULL;

}

_PyExitData *exit = _tstate->jit_tracer_state.initial_state.exit;

if (exit != NULL) {

exit->executor = executor;

}

executor->vm_data.chain_depth = chain_depth;

assert(executor->vm_data.valid);

interp->compiling = false;

return 1;

#else

return 0;

#endif

}

static _PyExecutorObject *

get_executor_lock_held(PyCodeObject *code, int offset)

{

int code_len = (int)Py_SIZE(code);

for (int i = 0 ; i < code_len;) {

if (_PyCode_CODE(code)[i].op.code == ENTER_EXECUTOR && i*2 == offset) {

int oparg = _PyCode_CODE(code)[i].op.arg;

_PyExecutorObject *res = code->co_executors->executors[oparg];

Py_INCREF(res);

return res;

}

i += _PyInstruction_GetLength(code, i);

}

PyErr_SetString(PyExc_ValueError, "no executor at given byte offset");

return NULL;

}

_PyExecutorObject *

_Py_GetExecutor(PyCodeObject *code, int offset)

{

_PyExecutorObject *executor;

Py_BEGIN_CRITICAL_SECTION(code);

executor = get_executor_lock_held(code, offset);

Py_END_CRITICAL_SECTION();

return executor;

}

static PyObject *

is_valid(PyObject *self, PyObject *Py_UNUSED(ignored))

{

return PyBool_FromLong(((_PyExecutorObject *)self)->vm_data.valid);

}

static PyObject *

get_opcode(PyObject *self, PyObject *Py_UNUSED(ignored))

{

return PyLong_FromUnsignedLong(((_PyExecutorObject *)self)->vm_data.opcode);

}

static PyObject *

get_oparg(PyObject *self, PyObject *Py_UNUSED(ignored))

{

return PyLong_FromUnsignedLong(((_PyExecutorObject *)self)->vm_data.oparg);

}

///////////////////// Experimental UOp Optimizer /////////////////////

static int executor_clear(PyObject *executor);

void

_PyExecutor_Free(_PyExecutorObject *self)

{

#ifdef _Py_JIT

_PyJIT_Free(self);

#endif

PyObject_GC_Del(self);

}

static void executor_invalidate(PyObject *op);

static void

executor_clear_exits(_PyExecutorObject *executor)

{

_PyExecutorObject *cold = _PyExecutor_GetColdExecutor();

_PyExecutorObject *cold_dynamic = _PyExecutor_GetColdDynamicExecutor();

for (uint32_t i = 0; i < executor->exit_count; i++) {

_PyExitData *exit = &executor->exits[i];

exit->temperature = initial_unreachable_backoff_counter();

_PyExecutorObject *old = executor->exits[i].executor;

exit->executor = exit->is_dynamic ? cold_dynamic : cold;

Py_DECREF(old);

}

}

void

_Py_ClearExecutorDeletionList(PyInterpreterState *interp)

{

if (interp->executor_deletion_list_head == NULL) {

return;

}

_PyRuntimeState *runtime = &_PyRuntime;

HEAD_LOCK(runtime);

PyThreadState* ts = PyInterpreterState_ThreadHead(interp);

while (ts) {

_PyExecutorObject *current = (_PyExecutorObject *)ts->current_executor;

Py_XINCREF(current);

ts = ts->next;

}

HEAD_UNLOCK(runtime);

_PyExecutorObject *keep_list = NULL;

do {

_PyExecutorObject *exec = interp->executor_deletion_list_head;

interp->executor_deletion_list_head = exec->vm_data.links.next;

if (Py_REFCNT(exec) == 0) {

_PyExecutor_Free(exec);

} else {

exec->vm_data.links.next = keep_list;

keep_list = exec;

}

} while (interp->executor_deletion_list_head != NULL);

interp->executor_deletion_list_head = keep_list;

HEAD_LOCK(runtime);

ts = PyInterpreterState_ThreadHead(interp);

while (ts) {

_PyExecutorObject *current = (_PyExecutorObject *)ts->current_executor;

if (current != NULL) {

_Py_DECREF_NO_DEALLOC((PyObject *)current);

}

ts = ts->next;

}

HEAD_UNLOCK(runtime);

}

static void

add_to_pending_deletion_list(_PyExecutorObject *self)

{

PyInterpreterState *interp = PyInterpreterState_Get();

self->vm_data.links.previous = NULL;

self->vm_data.links.next = interp->executor_deletion_list_head;

interp->executor_deletion_list_head = self;

}

static void

uop_dealloc(PyObject *op) {

_PyExecutorObject *self = _PyExecutorObject_CAST(op);

executor_invalidate(op);

assert(self->vm_data.code == NULL);

add_to_pending_deletion_list(self);

}

const char *

_PyUOpName(int index)

{

if (index < 0 || index > MAX_UOP_REGS_ID) {

return NULL;

}

return _PyOpcode_uop_name[index];

}

#ifdef Py_DEBUG

void

_PyUOpPrint(const _PyUOpInstruction *uop)

{

const char *name = _PyUOpName(uop->opcode);

if (name == NULL) {

printf("<uop %d>", uop->opcode);

}

else {

printf("%s", name);

}

switch(uop->format) {

case UOP_FORMAT_TARGET:

printf(" (%d, target=%d, operand0=%#" PRIx64 ", operand1=%#" PRIx64,

uop->oparg,

uop->target,

(uint64_t)uop->operand0,

(uint64_t)uop->operand1);

break;

case UOP_FORMAT_JUMP:

printf(" (%d, jump_target=%d, operand0=%#" PRIx64 ", operand1=%#" PRIx64,

uop->oparg,

uop->jump_target,

(uint64_t)uop->operand0,

(uint64_t)uop->operand1);

break;

default:

printf(" (%d, Unknown format)", uop->oparg);

}

if (_PyUop_Flags[_PyUop_Uncached[uop->opcode]] & HAS_ERROR_FLAG) {

printf(", error_target=%d", uop->error_target);

}

printf(")");

}

#endif

static Py_ssize_t

uop_len(PyObject *op)

{

_PyExecutorObject *self = _PyExecutorObject_CAST(op);

return self->code_size;

}

static PyObject *

uop_item(PyObject *op, Py_ssize_t index)

{

_PyExecutorObject *self = _PyExecutorObject_CAST(op);

Py_ssize_t len = uop_len(op);

if (index < 0 || index >= len) {

PyErr_SetNone(PyExc_IndexError);

return NULL;

}

int opcode = self->trace[index].opcode;

int base_opcode = _PyUop_Uncached[opcode];

const char *name = _PyUOpName(base_opcode);

if (name == NULL) {

name = "<nil>";

}

PyObject *oname = _PyUnicode_FromASCII(name, strlen(name));

if (oname == NULL) {

return NULL;

}

PyObject *oparg = PyLong_FromUnsignedLong(self->trace[index].oparg);

if (oparg == NULL) {

Py_DECREF(oname);

return NULL;

}

PyObject *target = PyLong_FromUnsignedLong(self->trace[index].target);

if (target == NULL) {

Py_DECREF(oparg);

Py_DECREF(oname);

return NULL;

}

PyObject *operand = PyLong_FromUnsignedLongLong(self->trace[index].operand0);

if (operand == NULL) {

Py_DECREF(target);

Py_DECREF(oparg);

Py_DECREF(oname);

return NULL;

}

PyObject *args[4] = { oname, oparg, target, operand };

return _PyTuple_FromArraySteal(args, 4);

}

PySequenceMethods uop_as_sequence = {

.sq_length = uop_len,

.sq_item = uop_item,

};

static int

executor_traverse(PyObject *o, visitproc visit, void *arg)

{

_PyExecutorObject *executor = _PyExecutorObject_CAST(o);

for (uint32_t i = 0; i < executor->exit_count; i++) {

Py_VISIT(executor->exits[i].executor);

}

return 0;

}

static PyObject *

get_jit_code(PyObject *self, PyObject *Py_UNUSED(ignored))

{

#ifndef _Py_JIT

PyErr_SetString(PyExc_RuntimeError, "JIT support not enabled.");

return NULL;

#else

_PyExecutorObject *executor = _PyExecutorObject_CAST(self);

if (executor->jit_code == NULL || executor->jit_size == 0) {

Py_RETURN_NONE;

}

return PyBytes_FromStringAndSize(executor->jit_code, executor->jit_size);

#endif

}

static PyMethodDef uop_executor_methods[] = {

{ "is_valid", is_valid, METH_NOARGS, NULL },

{ "get_jit_code", get_jit_code, METH_NOARGS, NULL},

{ "get_opcode", get_opcode, METH_NOARGS, NULL },

{ "get_oparg", get_oparg, METH_NOARGS, NULL },

{ NULL, NULL },

};

static int

executor_is_gc(PyObject *o)

{

return !_Py_IsImmortal(o);

}

PyTypeObject _PyUOpExecutor_Type = {

PyVarObject_HEAD_INIT(&PyType_Type, 0)

.tp_name = "uop_executor",

.tp_basicsize = offsetof(_PyExecutorObject, exits),

.tp_itemsize = 1,

.tp_flags = Py_TPFLAGS_DEFAULT | Py_TPFLAGS_DISALLOW_INSTANTIATION | Py_TPFLAGS_HAVE_GC,

.tp_dealloc = uop_dealloc,

.tp_as_sequence = &uop_as_sequence,

.tp_methods = uop_executor_methods,

.tp_traverse = executor_traverse,

.tp_clear = executor_clear,

.tp_is_gc = executor_is_gc,

};

/* TO DO -- Generate these tables */

static const uint16_t

_PyUOp_Replacements[MAX_UOP_ID + 1] = {

[_ITER_JUMP_RANGE] = _GUARD_NOT_EXHAUSTED_RANGE,

[_ITER_JUMP_LIST] = _GUARD_NOT_EXHAUSTED_LIST,

[_ITER_JUMP_TUPLE] = _GUARD_NOT_EXHAUSTED_TUPLE,

[_FOR_ITER] = _FOR_ITER_TIER_TWO,

[_ITER_NEXT_LIST] = _ITER_NEXT_LIST_TIER_TWO,

[_CHECK_PERIODIC_AT_END] = _TIER2_RESUME_CHECK,

};

static const uint8_t

is_for_iter_test[MAX_UOP_ID + 1] = {

[_GUARD_NOT_EXHAUSTED_RANGE] = 1,

[_GUARD_NOT_EXHAUSTED_LIST] = 1,

[_GUARD_NOT_EXHAUSTED_TUPLE] = 1,

[_FOR_ITER_TIER_TWO] = 1,

};

static const uint16_t

BRANCH_TO_GUARD[4][2] = {

[POP_JUMP_IF_FALSE - POP_JUMP_IF_FALSE][0] = _GUARD_IS_TRUE_POP,

[POP_JUMP_IF_FALSE - POP_JUMP_IF_FALSE][1] = _GUARD_IS_FALSE_POP,

[POP_JUMP_IF_TRUE - POP_JUMP_IF_FALSE][0] = _GUARD_IS_FALSE_POP,

[POP_JUMP_IF_TRUE - POP_JUMP_IF_FALSE][1] = _GUARD_IS_TRUE_POP,

[POP_JUMP_IF_NONE - POP_JUMP_IF_FALSE][0] = _GUARD_IS_NOT_NONE_POP,

[POP_JUMP_IF_NONE - POP_JUMP_IF_FALSE][1] = _GUARD_IS_NONE_POP,

[POP_JUMP_IF_NOT_NONE - POP_JUMP_IF_FALSE][0] = _GUARD_IS_NONE_POP,

[POP_JUMP_IF_NOT_NONE - POP_JUMP_IF_FALSE][1] = _GUARD_IS_NOT_NONE_POP,

};

static const uint16_t

guard_ip_uop[MAX_UOP_ID + 1] = {

[_PUSH_FRAME] = _GUARD_IP__PUSH_FRAME,

[_RETURN_GENERATOR] = _GUARD_IP_RETURN_GENERATOR,

[_RETURN_VALUE] = _GUARD_IP_RETURN_VALUE,

[_YIELD_VALUE] = _GUARD_IP_YIELD_VALUE,

};

#define CONFIDENCE_RANGE 1000

#define CONFIDENCE_CUTOFF 333

#ifdef Py_DEBUG

#define DPRINTF(level, ...) \

if (lltrace >= (level)) { printf(__VA_ARGS__); }

#else

#define DPRINTF(level, ...)

#endif

static inline int

add_to_trace(

_PyUOpInstruction *trace,

int trace_length,

uint16_t opcode,

uint16_t oparg,

uint64_t operand,

uint32_t target)

{

trace[trace_length].opcode = opcode;

trace[trace_length].format = UOP_FORMAT_TARGET;

trace[trace_length].target = target;

trace[trace_length].oparg = oparg;

trace[trace_length].operand0 = operand;

#ifdef Py_STATS

trace[trace_length].execution_count = 0;

#endif

return trace_length + 1;

}

#ifdef Py_DEBUG

#define ADD_TO_TRACE(OPCODE, OPARG, OPERAND, TARGET) \

assert(trace_length < max_length); \

trace_length = add_to_trace(trace, trace_length, (OPCODE), (OPARG), (OPERAND), (TARGET)); \

if (lltrace >= 2) { \

printf("%4d ADD_TO_TRACE: ", trace_length); \

_PyUOpPrint(&trace[trace_length-1]); \

printf("\n"); \

}

#else

#define ADD_TO_TRACE(OPCODE, OPARG, OPERAND, TARGET) \

assert(trace_length < max_length); \

trace_length = add_to_trace(trace, trace_length, (OPCODE), (OPARG), (OPERAND), (TARGET));

#endif

#define INSTR_IP(INSTR, CODE) \

((uint32_t)((INSTR) - ((_Py_CODEUNIT *)(CODE)->co_code_adaptive)))

// Reserve space for n uops

#define RESERVE_RAW(n, opname) \

if (trace_length + (n) > max_length) { \

DPRINTF(2, "No room for %s (need %d, got %d)\n", \

(opname), (n), max_length - trace_length); \

OPT_STAT_INC(trace_too_long); \

goto full; \

}

static int

is_terminator(const _PyUOpInstruction *uop)

{

int opcode = _PyUop_Uncached[uop->opcode];

return (

opcode == _EXIT_TRACE ||

opcode == _DEOPT ||

opcode == _JUMP_TO_TOP ||

opcode == _DYNAMIC_EXIT

);

}

/* Returns 1 on success (added to trace), 0 on trace end.

*/

// gh-142543: inlining this function causes stack overflows

Py_NO_INLINE int

_PyJit_translate_single_bytecode_to_trace(

PyThreadState *tstate,

_PyInterpreterFrame *frame,

_Py_CODEUNIT *next_instr,

int stop_tracing_opcode)

{

#ifdef Py_DEBUG

char *python_lltrace = Py_GETENV("PYTHON_LLTRACE");

int lltrace = 0;

if (python_lltrace != NULL && *python_lltrace >= '0') {

lltrace = *python_lltrace - '0'; // TODO: Parse an int and all that

}

#endif

_PyThreadStateImpl *_tstate = (_PyThreadStateImpl *)tstate;

PyCodeObject *old_code = _tstate->jit_tracer_state.prev_state.instr_code;

bool progress_needed = (_tstate->jit_tracer_state.initial_state.chain_depth % MAX_CHAIN_DEPTH) == 0;

_PyBloomFilter *dependencies = &_tstate->jit_tracer_state.prev_state.dependencies;

int trace_length = _tstate->jit_tracer_state.prev_state.code_curr_size;

_PyUOpInstruction *trace = _tstate->jit_tracer_state.code_buffer;

int max_length = _tstate->jit_tracer_state.prev_state.code_max_size;

_Py_CODEUNIT *this_instr = _tstate->jit_tracer_state.prev_state.instr;

_Py_CODEUNIT *target_instr = this_instr;

uint32_t target = 0;

target = Py_IsNone((PyObject *)old_code)

? (int)(target_instr - _Py_INTERPRETER_TRAMPOLINE_INSTRUCTIONS_PTR)

: INSTR_IP(target_instr, old_code);

// Rewind EXTENDED_ARG so that we see the whole thing.

// We must point to the first EXTENDED_ARG when deopting.

int oparg = _tstate->jit_tracer_state.prev_state.instr_oparg;

int opcode = this_instr->op.code;

int rewind_oparg = oparg;

while (rewind_oparg > 255) {

rewind_oparg >>= 8;

target--;

}

if (_PyOpcode_Caches[_PyOpcode_Deopt[opcode]] > 0) {

uint16_t backoff = (this_instr + 1)->counter.value_and_backoff;

// adaptive_counter_cooldown is a fresh specialization.

// trigger_backoff_counter is what we set during tracing.

// All tracing backoffs should be freshly specialized or untouched.

// If not, that indicates a deopt during tracing, and

// thus the "actual" instruction executed is not the one that is

// in the instruction stream, but rather the deopt.

// It's important we check for this, as some specializations might make

// no progress (they can immediately deopt after specializing).

// We do this to improve performance, as otherwise a compiled trace

// will just deopt immediately.

if (backoff != adaptive_counter_cooldown().value_and_backoff &&

backoff != trigger_backoff_counter().value_and_backoff) {

OPT_STAT_INC(trace_immediately_deopts);

opcode = _PyOpcode_Deopt[opcode];

}

}

int old_stack_level = _tstate->jit_tracer_state.prev_state.instr_stacklevel;

// Strange control-flow

bool has_dynamic_jump_taken = OPCODE_HAS_UNPREDICTABLE_JUMP(opcode) &&

(next_instr != this_instr + 1 + _PyOpcode_Caches[_PyOpcode_Deopt[opcode]]);

/* Special case the first instruction,

* so that we can guarantee forward progress */

if (progress_needed && _tstate->jit_tracer_state.prev_state.code_curr_size < CODE_SIZE_NO_PROGRESS) {

if (OPCODE_HAS_EXIT(opcode) || OPCODE_HAS_DEOPT(opcode)) {

opcode = _PyOpcode_Deopt[opcode];

}

assert(!OPCODE_HAS_EXIT(opcode));

assert(!OPCODE_HAS_DEOPT(opcode));

}

bool needs_guard_ip = OPCODE_HAS_NEEDS_GUARD_IP(opcode);

if (has_dynamic_jump_taken && !needs_guard_ip) {

DPRINTF(2, "Unsupported: dynamic jump taken %s\n", _PyOpcode_OpName[opcode]);

goto unsupported;

}

int is_sys_tracing = (tstate->c_tracefunc != NULL) || (tstate->c_profilefunc != NULL);

if (is_sys_tracing) {

goto full;

}

if (stop_tracing_opcode != 0) {

ADD_TO_TRACE(stop_tracing_opcode, 0, 0, target);

goto done;

}

DPRINTF(2, "%p %d: %s(%d) %d %d\n", old_code, target, _PyOpcode_OpName[opcode], oparg, needs_guard_ip, old_stack_level);

#ifdef Py_DEBUG

if (oparg > 255) {

assert(_Py_GetBaseCodeUnit(old_code, target).op.code == EXTENDED_ARG);

}

#endif

// Skip over super instructions.

if (_tstate->jit_tracer_state.prev_state.instr_is_super) {

_tstate->jit_tracer_state.prev_state.instr_is_super = false;

return 1;

}

if (opcode == ENTER_EXECUTOR) {

goto full;

}

if (!_tstate->jit_tracer_state.prev_state.dependencies_still_valid) {

goto done;

}

// This happens when a recursive call happens that we can't trace. Such as Python -> C -> Python calls

// If we haven't guarded the IP, then it's untraceable.

if (frame != _tstate->jit_tracer_state.prev_state.instr_frame && !needs_guard_ip) {

DPRINTF(2, "Unsupported: unguardable jump taken\n");

goto unsupported;

}

if (oparg > 0xFFFF) {

DPRINTF(2, "Unsupported: oparg too large\n");

goto unsupported;

}

// TODO (gh-140277): The constituent use one extra stack slot. So we need to check for headroom.

if (opcode == BINARY_OP_SUBSCR_GETITEM && old_stack_level + 1 > old_code->co_stacksize) {

unsupported:

{

// Rewind to previous instruction and replace with _EXIT_TRACE.

_PyUOpInstruction *curr = &trace[trace_length-1];

while (curr->opcode != _SET_IP && trace_length > 2) {

trace_length--;

curr = &trace[trace_length-1];

}

assert(curr->opcode == _SET_IP || trace_length == 2);

if (curr->opcode == _SET_IP) {

int32_t old_target = (int32_t)uop_get_target(curr);

curr++;

trace_length++;

curr->opcode = _EXIT_TRACE;

curr->format = UOP_FORMAT_TARGET;

curr->target = old_target;

}

goto done;

}

}

if (opcode == NOP) {

return 1;

}

if (opcode == JUMP_FORWARD) {

return 1;

}

if (opcode == EXTENDED_ARG) {

return 1;

}

// One for possible _DEOPT, one because _CHECK_VALIDITY itself might _DEOPT

max_length -= 2;

const struct opcode_macro_expansion *expansion = &_PyOpcode_macro_expansion[opcode];

assert(opcode != ENTER_EXECUTOR && opcode != EXTENDED_ARG);

assert(!_PyErr_Occurred(tstate));

if (OPCODE_HAS_EXIT(opcode)) {

// Make space for side exit and final _EXIT_TRACE:

max_length--;

}

if (OPCODE_HAS_ERROR(opcode)) {

// Make space for error stub and final _EXIT_TRACE:

max_length--;

}

// _GUARD_IP leads to an exit.

max_length -= needs_guard_ip;

RESERVE_RAW(expansion->nuops + needs_guard_ip + 2 + (!OPCODE_HAS_NO_SAVE_IP(opcode)), "uop and various checks");

ADD_TO_TRACE(_CHECK_VALIDITY, 0, 0, target);

if (!OPCODE_HAS_NO_SAVE_IP(opcode)) {

ADD_TO_TRACE(_SET_IP, 0, (uintptr_t)target_instr, target);

}

// Can be NULL for the entry frame.

if (old_code != NULL) {

_Py_BloomFilter_Add(dependencies, old_code);

}

switch (opcode) {

case POP_JUMP_IF_NONE:

case POP_JUMP_IF_NOT_NONE:

case POP_JUMP_IF_FALSE:

case POP_JUMP_IF_TRUE:

{

_Py_CODEUNIT *computed_next_instr_without_modifiers = target_instr + 1 + _PyOpcode_Caches[_PyOpcode_Deopt[opcode]];

_Py_CODEUNIT *computed_next_instr = computed_next_instr_without_modifiers + (computed_next_instr_without_modifiers->op.code == NOT_TAKEN);

_Py_CODEUNIT *computed_jump_instr = computed_next_instr_without_modifiers + oparg;

assert(next_instr == computed_next_instr || next_instr == computed_jump_instr);

int jump_happened = computed_jump_instr == next_instr;

assert(jump_happened == (target_instr[1].cache & 1));

uint32_t uopcode = BRANCH_TO_GUARD[opcode - POP_JUMP_IF_FALSE][jump_happened];

ADD_TO_TRACE(uopcode, 0, 0, INSTR_IP(jump_happened ? computed_next_instr : computed_jump_instr, old_code));

break;

}

case JUMP_BACKWARD_JIT:

// This is possible as the JIT might have re-activated after it was disabled

case JUMP_BACKWARD_NO_JIT:

case JUMP_BACKWARD:

ADD_TO_TRACE(_CHECK_PERIODIC, 0, 0, target);

_Py_FALLTHROUGH;

case JUMP_BACKWARD_NO_INTERRUPT:

{

if ((next_instr != _tstate->jit_tracer_state.initial_state.close_loop_instr) &&

(next_instr != _tstate->jit_tracer_state.initial_state.start_instr) &&

_tstate->jit_tracer_state.prev_state.code_curr_size > CODE_SIZE_NO_PROGRESS &&

// For side exits, we don't want to terminate them early.

_tstate->jit_tracer_state.initial_state.exit == NULL &&

// These are coroutines, and we want to unroll those usually.

opcode != JUMP_BACKWARD_NO_INTERRUPT) {

// We encountered a JUMP_BACKWARD but not to the top of our own loop.

// We don't want to continue tracing as we might get stuck in the

// inner loop. Instead, end the trace where the executor of the

// inner loop might start and let the traces rejoin.

OPT_STAT_INC(inner_loop);

ADD_TO_TRACE(_EXIT_TRACE, 0, 0, target);

trace[trace_length-1].operand1 = true; // is_control_flow

DPRINTF(2, "JUMP_BACKWARD not to top ends trace %p %p %p\n", next_instr,

_tstate->jit_tracer_state.initial_state.close_loop_instr, _tstate->jit_tracer_state.initial_state.start_instr);

goto done;

}

break;

}

case RESUME:

case RESUME_CHECK:

/* Use a special tier 2 version of RESUME_CHECK to allow traces to

* start with RESUME_CHECK */

ADD_TO_TRACE(_TIER2_RESUME_CHECK, 0, 0, target);

break;

default:

{

const struct opcode_macro_expansion *expansion = &_PyOpcode_macro_expansion[opcode];

// Reserve space for nuops (+ _SET_IP + _EXIT_TRACE)

int nuops = expansion->nuops;

if (nuops == 0) {

DPRINTF(2, "Unsupported opcode %s\n", _PyOpcode_OpName[opcode]);

goto unsupported;

}

assert(nuops > 0);

uint32_t orig_oparg = oparg; // For OPARG_TOP/BOTTOM

uint32_t orig_target = target;

for (int i = 0; i < nuops; i++) {

oparg = orig_oparg;

target = orig_target;

uint32_t uop = expansion->uops[i].uop;

uint64_t operand = 0;

// Add one to account for the actual opcode/oparg pair:

int offset = expansion->uops[i].offset + 1;

switch (expansion->uops[i].size) {

case OPARG_SIMPLE:

assert(opcode != _JUMP_BACKWARD_NO_INTERRUPT && opcode != JUMP_BACKWARD);

break;

case OPARG_CACHE_1:

operand = read_u16(&this_instr[offset].cache);

break;

case OPARG_CACHE_2:

operand = read_u32(&this_instr[offset].cache);

break;

case OPARG_CACHE_4:

operand = read_u64(&this_instr[offset].cache);

break;

case OPARG_TOP: // First half of super-instr

assert(orig_oparg <= 255);

oparg = orig_oparg >> 4;

break;

case OPARG_BOTTOM: // Second half of super-instr

assert(orig_oparg <= 255);

oparg = orig_oparg & 0xF;

break;

case OPARG_SAVE_RETURN_OFFSET: // op=_SAVE_RETURN_OFFSET; oparg=return_offset

oparg = offset;

assert(uop == _SAVE_RETURN_OFFSET);

break;

case OPARG_REPLACED:

uop = _PyUOp_Replacements[uop];

assert(uop != 0);

uint32_t next_inst = target + 1 + _PyOpcode_Caches[_PyOpcode_Deopt[opcode]];

if (uop == _TIER2_RESUME_CHECK) {

target = next_inst;

}

else {

int extended_arg = orig_oparg > 255;

uint32_t jump_target = next_inst + orig_oparg + extended_arg;

assert(_Py_GetBaseCodeUnit(old_code, jump_target).op.code == END_FOR);

assert(_Py_GetBaseCodeUnit(old_code, jump_target+1).op.code == POP_ITER);

if (is_for_iter_test[uop]) {

target = jump_target + 1;

}

}

break;

case OPERAND1_1:

assert(trace[trace_length-1].opcode == uop);

operand = read_u16(&this_instr[offset].cache);

trace[trace_length-1].operand1 = operand;

continue;

case OPERAND1_2:

assert(trace[trace_length-1].opcode == uop);

operand = read_u32(&this_instr[offset].cache);

trace[trace_length-1].operand1 = operand;

continue;

case OPERAND1_4:

assert(trace[trace_length-1].opcode == uop);

operand = read_u64(&this_instr[offset].cache);

trace[trace_length-1].operand1 = operand;

continue;

default:

fprintf(stderr,

"opcode=%d, oparg=%d; nuops=%d, i=%d; size=%d, offset=%d\n",

opcode, oparg, nuops, i,

expansion->uops[i].size,

expansion->uops[i].offset);

Py_FatalError("garbled expansion");

}

if (uop == _PUSH_FRAME || uop == _RETURN_VALUE || uop == _RETURN_GENERATOR || uop == _YIELD_VALUE) {

PyCodeObject *new_code = (PyCodeObject *)PyStackRef_AsPyObjectBorrow(frame->f_executable);

PyFunctionObject *new_func = (PyFunctionObject *)PyStackRef_AsPyObjectBorrow(frame->f_funcobj);

operand = 0;

if (frame->owner < FRAME_OWNED_BY_INTERPRETER) {

// Don't add nested code objects to the dependency.

// It causes endless re-traces.

if (new_func != NULL && !Py_IsNone((PyObject*)new_func) && !(new_code->co_flags & CO_NESTED)) {

operand = (uintptr_t)new_func;

DPRINTF(2, "Adding %p func to op\n", (void *)operand);

_Py_BloomFilter_Add(dependencies, new_func);

}

else if (new_code != NULL && !Py_IsNone((PyObject*)new_code)) {

operand = (uintptr_t)new_code | 1;

DPRINTF(2, "Adding %p code to op\n", (void *)operand);

_Py_BloomFilter_Add(dependencies, new_code);

}

}

ADD_TO_TRACE(uop, oparg, operand, target);

trace[trace_length - 1].operand1 = PyStackRef_IsNone(frame->f_executable) ? 2 : ((int)(frame->stackpointer - _PyFrame_Stackbase(frame)));

break;

}

if (uop == _BINARY_OP_INPLACE_ADD_UNICODE) {

assert(i + 1 == nuops);

_Py_CODEUNIT *next = target_instr + 1 + _PyOpcode_Caches[_PyOpcode_Deopt[opcode]];

assert(next->op.code == STORE_FAST);

operand = next->op.arg;

}

// All other instructions

ADD_TO_TRACE(uop, oparg, operand, target);

}

break;

} // End default

} // End switch (opcode)

if (needs_guard_ip) {

uint16_t guard_ip = guard_ip_uop[trace[trace_length-1].opcode];

if (guard_ip == 0) {

DPRINTF(1, "Unknown uop needing guard ip %s\n", _PyOpcode_uop_name[trace[trace_length-1].opcode]);

Py_UNREACHABLE();

}

ADD_TO_TRACE(guard_ip, 0, (uintptr_t)next_instr, 0);

}

// Loop back to the start

int is_first_instr = _tstate->jit_tracer_state.initial_state.close_loop_instr == next_instr ||

_tstate->jit_tracer_state.initial_state.start_instr == next_instr;

if (is_first_instr && _tstate->jit_tracer_state.prev_state.code_curr_size > CODE_SIZE_NO_PROGRESS) {

if (needs_guard_ip) {

ADD_TO_TRACE(_SET_IP, 0, (uintptr_t)next_instr, 0);

}

ADD_TO_TRACE(_JUMP_TO_TOP, 0, 0, 0);

goto done;

}

DPRINTF(2, "Trace continuing\n");

_tstate->jit_tracer_state.prev_state.code_curr_size = trace_length;

_tstate->jit_tracer_state.prev_state.code_max_size = max_length;

return 1;

done:

DPRINTF(2, "Trace done\n");

_tstate->jit_tracer_state.prev_state.code_curr_size = trace_length;

_tstate->jit_tracer_state.prev_state.code_max_size = max_length;

return 0;

full:

DPRINTF(2, "Trace full\n");

if (!is_terminator(&_tstate->jit_tracer_state.code_buffer[trace_length-1])) {

// Undo the last few instructions.

trace_length = _tstate->jit_tracer_state.prev_state.code_curr_size;

max_length = _tstate->jit_tracer_state.prev_state.code_max_size;

// We previously reversed one.

max_length += 1;

ADD_TO_TRACE(_EXIT_TRACE, 0, 0, target);