mirror of
https://github.com/python/cpython.git
synced 2025-10-30 21:21:22 +00:00
431 lines
11 KiB
Python
431 lines
11 KiB
Python
|
||
"""
|
||
opcode module - potentially shared between dis and other modules which
|
||
operate on bytecodes (e.g. peephole optimizers).
|
||
"""
|
||
|
||
__all__ = ["cmp_op", "hasarg", "hasconst", "hasname", "hasjrel", "hasjabs",
|
||
"haslocal", "hascompare", "hasfree", "hasexc", "opname", "opmap",
|
||
"HAVE_ARGUMENT", "EXTENDED_ARG"]
|
||
|
||
# It's a chicken-and-egg I'm afraid:
|
||
# We're imported before _opcode's made.
|
||
# With exception unheeded
|
||
# (stack_effect is not needed)
|
||
# Both our chickens and eggs are allayed.
|
||
# --Larry Hastings, 2013/11/23
|
||
|
||
try:
|
||
from _opcode import stack_effect
|
||
__all__.append('stack_effect')
|
||
except ImportError:
|
||
pass
|
||
|
||
cmp_op = ('<', '<=', '==', '!=', '>', '>=')
|
||
|
||
hasarg = []
|
||
hasconst = []
|
||
hasname = []
|
||
hasjrel = []
|
||
hasjabs = []
|
||
haslocal = []
|
||
hascompare = []
|
||
hasfree = []
|
||
hasexc = []
|
||
|
||
def is_pseudo(op):
|
||
return op >= MIN_PSEUDO_OPCODE and op <= MAX_PSEUDO_OPCODE
|
||
|
||
oplists = [hasarg, hasconst, hasname, hasjrel, hasjabs,
|
||
haslocal, hascompare, hasfree, hasexc]
|
||
|
||
opmap = {}
|
||
|
||
## pseudo opcodes (used in the compiler) mapped to the values
|
||
## they can become in the actual code.
|
||
_pseudo_ops = {}
|
||
|
||
def def_op(name, op):
|
||
opmap[name] = op
|
||
|
||
def name_op(name, op):
|
||
def_op(name, op)
|
||
hasname.append(op)
|
||
|
||
def jrel_op(name, op):
|
||
def_op(name, op)
|
||
hasjrel.append(op)
|
||
|
||
def jabs_op(name, op):
|
||
def_op(name, op)
|
||
hasjabs.append(op)
|
||
|
||
def pseudo_op(name, op, real_ops):
|
||
def_op(name, op)
|
||
_pseudo_ops[name] = real_ops
|
||
# add the pseudo opcode to the lists its targets are in
|
||
for oplist in oplists:
|
||
res = [opmap[rop] in oplist for rop in real_ops]
|
||
if any(res):
|
||
assert all(res)
|
||
oplist.append(op)
|
||
|
||
|
||
# Instruction opcodes for compiled code
|
||
# Blank lines correspond to available opcodes
|
||
|
||
def_op('CACHE', 0)
|
||
def_op('POP_TOP', 1)
|
||
def_op('PUSH_NULL', 2)
|
||
def_op('INTERPRETER_EXIT', 3)
|
||
|
||
def_op('END_FOR', 4)
|
||
|
||
def_op('NOP', 9)
|
||
def_op('UNARY_POSITIVE', 10)
|
||
def_op('UNARY_NEGATIVE', 11)
|
||
def_op('UNARY_NOT', 12)
|
||
|
||
def_op('UNARY_INVERT', 15)
|
||
|
||
def_op('BINARY_SUBSCR', 25)
|
||
def_op('BINARY_SLICE', 26)
|
||
def_op('STORE_SLICE', 27)
|
||
|
||
def_op('GET_LEN', 30)
|
||
def_op('MATCH_MAPPING', 31)
|
||
def_op('MATCH_SEQUENCE', 32)
|
||
def_op('MATCH_KEYS', 33)
|
||
|
||
def_op('PUSH_EXC_INFO', 35)
|
||
def_op('CHECK_EXC_MATCH', 36)
|
||
def_op('CHECK_EG_MATCH', 37)
|
||
|
||
def_op('WITH_EXCEPT_START', 49)
|
||
def_op('GET_AITER', 50)
|
||
def_op('GET_ANEXT', 51)
|
||
def_op('BEFORE_ASYNC_WITH', 52)
|
||
def_op('BEFORE_WITH', 53)
|
||
def_op('END_ASYNC_FOR', 54)
|
||
def_op('CLEANUP_THROW', 55)
|
||
|
||
def_op('STORE_SUBSCR', 60)
|
||
def_op('DELETE_SUBSCR', 61)
|
||
|
||
def_op('STOPITERATION_ERROR', 63)
|
||
|
||
def_op('GET_ITER', 68)
|
||
def_op('GET_YIELD_FROM_ITER', 69)
|
||
def_op('PRINT_EXPR', 70)
|
||
def_op('LOAD_BUILD_CLASS', 71)
|
||
|
||
def_op('LOAD_ASSERTION_ERROR', 74)
|
||
def_op('RETURN_GENERATOR', 75)
|
||
|
||
def_op('LIST_TO_TUPLE', 82)
|
||
def_op('RETURN_VALUE', 83)
|
||
def_op('IMPORT_STAR', 84)
|
||
def_op('SETUP_ANNOTATIONS', 85)
|
||
|
||
def_op('ASYNC_GEN_WRAP', 87)
|
||
def_op('PREP_RERAISE_STAR', 88)
|
||
def_op('POP_EXCEPT', 89)
|
||
|
||
HAVE_ARGUMENT = 90 # real opcodes from here have an argument:
|
||
|
||
name_op('STORE_NAME', 90) # Index in name list
|
||
name_op('DELETE_NAME', 91) # ""
|
||
def_op('UNPACK_SEQUENCE', 92) # Number of tuple items
|
||
jrel_op('FOR_ITER', 93)
|
||
def_op('UNPACK_EX', 94)
|
||
name_op('STORE_ATTR', 95) # Index in name list
|
||
name_op('DELETE_ATTR', 96) # ""
|
||
name_op('STORE_GLOBAL', 97) # ""
|
||
name_op('DELETE_GLOBAL', 98) # ""
|
||
def_op('SWAP', 99)
|
||
def_op('LOAD_CONST', 100) # Index in const list
|
||
hasconst.append(100)
|
||
name_op('LOAD_NAME', 101) # Index in name list
|
||
def_op('BUILD_TUPLE', 102) # Number of tuple items
|
||
def_op('BUILD_LIST', 103) # Number of list items
|
||
def_op('BUILD_SET', 104) # Number of set items
|
||
def_op('BUILD_MAP', 105) # Number of dict entries
|
||
name_op('LOAD_ATTR', 106) # Index in name list
|
||
def_op('COMPARE_OP', 107) # Comparison operator
|
||
hascompare.append(107)
|
||
name_op('IMPORT_NAME', 108) # Index in name list
|
||
name_op('IMPORT_FROM', 109) # Index in name list
|
||
jrel_op('JUMP_FORWARD', 110) # Number of words to skip
|
||
jrel_op('JUMP_IF_FALSE_OR_POP', 111) # Number of words to skip
|
||
jrel_op('JUMP_IF_TRUE_OR_POP', 112) # ""
|
||
jrel_op('POP_JUMP_IF_FALSE', 114)
|
||
jrel_op('POP_JUMP_IF_TRUE', 115)
|
||
name_op('LOAD_GLOBAL', 116) # Index in name list
|
||
def_op('IS_OP', 117)
|
||
def_op('CONTAINS_OP', 118)
|
||
def_op('RERAISE', 119)
|
||
def_op('COPY', 120)
|
||
def_op('BINARY_OP', 122)
|
||
jrel_op('SEND', 123) # Number of bytes to skip
|
||
def_op('LOAD_FAST', 124) # Local variable number, no null check
|
||
haslocal.append(124)
|
||
def_op('STORE_FAST', 125) # Local variable number
|
||
haslocal.append(125)
|
||
def_op('DELETE_FAST', 126) # Local variable number
|
||
haslocal.append(126)
|
||
def_op('LOAD_FAST_CHECK', 127) # Local variable number
|
||
haslocal.append(127)
|
||
jrel_op('POP_JUMP_IF_NOT_NONE', 128)
|
||
jrel_op('POP_JUMP_IF_NONE', 129)
|
||
def_op('RAISE_VARARGS', 130) # Number of raise arguments (1, 2, or 3)
|
||
def_op('GET_AWAITABLE', 131)
|
||
def_op('MAKE_FUNCTION', 132) # Flags
|
||
def_op('BUILD_SLICE', 133) # Number of items
|
||
jrel_op('JUMP_BACKWARD_NO_INTERRUPT', 134) # Number of words to skip (backwards)
|
||
def_op('MAKE_CELL', 135)
|
||
hasfree.append(135)
|
||
def_op('LOAD_CLOSURE', 136)
|
||
hasfree.append(136)
|
||
def_op('LOAD_DEREF', 137)
|
||
hasfree.append(137)
|
||
def_op('STORE_DEREF', 138)
|
||
hasfree.append(138)
|
||
def_op('DELETE_DEREF', 139)
|
||
hasfree.append(139)
|
||
jrel_op('JUMP_BACKWARD', 140) # Number of words to skip (backwards)
|
||
|
||
def_op('CALL_FUNCTION_EX', 142) # Flags
|
||
|
||
def_op('EXTENDED_ARG', 144)
|
||
EXTENDED_ARG = 144
|
||
def_op('LIST_APPEND', 145)
|
||
def_op('SET_ADD', 146)
|
||
def_op('MAP_ADD', 147)
|
||
def_op('LOAD_CLASSDEREF', 148)
|
||
hasfree.append(148)
|
||
def_op('COPY_FREE_VARS', 149)
|
||
def_op('YIELD_VALUE', 150)
|
||
def_op('RESUME', 151) # This must be kept in sync with deepfreeze.py
|
||
def_op('MATCH_CLASS', 152)
|
||
|
||
def_op('FORMAT_VALUE', 155)
|
||
def_op('BUILD_CONST_KEY_MAP', 156)
|
||
def_op('BUILD_STRING', 157)
|
||
|
||
def_op('LIST_EXTEND', 162)
|
||
def_op('SET_UPDATE', 163)
|
||
def_op('DICT_MERGE', 164)
|
||
def_op('DICT_UPDATE', 165)
|
||
|
||
def_op('CALL', 171)
|
||
def_op('KW_NAMES', 172)
|
||
hasconst.append(172)
|
||
|
||
|
||
hasarg.extend([op for op in opmap.values() if op >= HAVE_ARGUMENT])
|
||
|
||
MIN_PSEUDO_OPCODE = 256
|
||
|
||
pseudo_op('SETUP_FINALLY', 256, ['NOP'])
|
||
hasexc.append(256)
|
||
pseudo_op('SETUP_CLEANUP', 257, ['NOP'])
|
||
hasexc.append(257)
|
||
pseudo_op('SETUP_WITH', 258, ['NOP'])
|
||
hasexc.append(258)
|
||
pseudo_op('POP_BLOCK', 259, ['NOP'])
|
||
|
||
pseudo_op('JUMP', 260, ['JUMP_FORWARD', 'JUMP_BACKWARD'])
|
||
pseudo_op('JUMP_NO_INTERRUPT', 261, ['JUMP_FORWARD', 'JUMP_BACKWARD_NO_INTERRUPT'])
|
||
|
||
pseudo_op('LOAD_METHOD', 262, ['LOAD_ATTR'])
|
||
|
||
MAX_PSEUDO_OPCODE = MIN_PSEUDO_OPCODE + len(_pseudo_ops) - 1
|
||
|
||
del def_op, name_op, jrel_op, jabs_op, pseudo_op
|
||
|
||
opname = ['<%r>' % (op,) for op in range(MAX_PSEUDO_OPCODE + 1)]
|
||
for op, i in opmap.items():
|
||
opname[i] = op
|
||
|
||
|
||
_nb_ops = [
|
||
("NB_ADD", "+"),
|
||
("NB_AND", "&"),
|
||
("NB_FLOOR_DIVIDE", "//"),
|
||
("NB_LSHIFT", "<<"),
|
||
("NB_MATRIX_MULTIPLY", "@"),
|
||
("NB_MULTIPLY", "*"),
|
||
("NB_REMAINDER", "%"),
|
||
("NB_OR", "|"),
|
||
("NB_POWER", "**"),
|
||
("NB_RSHIFT", ">>"),
|
||
("NB_SUBTRACT", "-"),
|
||
("NB_TRUE_DIVIDE", "/"),
|
||
("NB_XOR", "^"),
|
||
("NB_INPLACE_ADD", "+="),
|
||
("NB_INPLACE_AND", "&="),
|
||
("NB_INPLACE_FLOOR_DIVIDE", "//="),
|
||
("NB_INPLACE_LSHIFT", "<<="),
|
||
("NB_INPLACE_MATRIX_MULTIPLY", "@="),
|
||
("NB_INPLACE_MULTIPLY", "*="),
|
||
("NB_INPLACE_REMAINDER", "%="),
|
||
("NB_INPLACE_OR", "|="),
|
||
("NB_INPLACE_POWER", "**="),
|
||
("NB_INPLACE_RSHIFT", ">>="),
|
||
("NB_INPLACE_SUBTRACT", "-="),
|
||
("NB_INPLACE_TRUE_DIVIDE", "/="),
|
||
("NB_INPLACE_XOR", "^="),
|
||
]
|
||
|
||
_specializations = {
|
||
"BINARY_OP": [
|
||
"BINARY_OP_ADD_FLOAT",
|
||
"BINARY_OP_ADD_INT",
|
||
"BINARY_OP_ADD_UNICODE",
|
||
"BINARY_OP_INPLACE_ADD_UNICODE",
|
||
"BINARY_OP_MULTIPLY_FLOAT",
|
||
"BINARY_OP_MULTIPLY_INT",
|
||
"BINARY_OP_SUBTRACT_FLOAT",
|
||
"BINARY_OP_SUBTRACT_INT",
|
||
],
|
||
"BINARY_SUBSCR": [
|
||
"BINARY_SUBSCR_DICT",
|
||
"BINARY_SUBSCR_GETITEM",
|
||
"BINARY_SUBSCR_LIST_INT",
|
||
"BINARY_SUBSCR_TUPLE_INT",
|
||
],
|
||
"CALL": [
|
||
"CALL_PY_EXACT_ARGS",
|
||
"CALL_PY_WITH_DEFAULTS",
|
||
"CALL_BOUND_METHOD_EXACT_ARGS",
|
||
"CALL_BUILTIN_CLASS",
|
||
"CALL_BUILTIN_FAST_WITH_KEYWORDS",
|
||
"CALL_METHOD_DESCRIPTOR_FAST_WITH_KEYWORDS",
|
||
"CALL_NO_KW_BUILTIN_FAST",
|
||
"CALL_NO_KW_BUILTIN_O",
|
||
"CALL_NO_KW_ISINSTANCE",
|
||
"CALL_NO_KW_LEN",
|
||
"CALL_NO_KW_LIST_APPEND",
|
||
"CALL_NO_KW_METHOD_DESCRIPTOR_FAST",
|
||
"CALL_NO_KW_METHOD_DESCRIPTOR_NOARGS",
|
||
"CALL_NO_KW_METHOD_DESCRIPTOR_O",
|
||
"CALL_NO_KW_STR_1",
|
||
"CALL_NO_KW_TUPLE_1",
|
||
"CALL_NO_KW_TYPE_1",
|
||
],
|
||
"COMPARE_OP": [
|
||
"COMPARE_OP_FLOAT_JUMP",
|
||
"COMPARE_OP_INT_JUMP",
|
||
"COMPARE_OP_STR_JUMP",
|
||
],
|
||
"FOR_ITER": [
|
||
"FOR_ITER_LIST",
|
||
"FOR_ITER_RANGE",
|
||
"FOR_ITER_GEN",
|
||
],
|
||
"LOAD_ATTR": [
|
||
# These potentially push [NULL, bound method] onto the stack.
|
||
"LOAD_ATTR_CLASS",
|
||
"LOAD_ATTR_GETATTRIBUTE_OVERRIDDEN",
|
||
"LOAD_ATTR_INSTANCE_VALUE",
|
||
"LOAD_ATTR_MODULE",
|
||
"LOAD_ATTR_PROPERTY",
|
||
"LOAD_ATTR_SLOT",
|
||
"LOAD_ATTR_WITH_HINT",
|
||
# These will always push [unbound method, self] onto the stack.
|
||
"LOAD_ATTR_METHOD_LAZY_DICT",
|
||
"LOAD_ATTR_METHOD_NO_DICT",
|
||
"LOAD_ATTR_METHOD_WITH_DICT",
|
||
"LOAD_ATTR_METHOD_WITH_VALUES",
|
||
],
|
||
"LOAD_CONST": [
|
||
"LOAD_CONST__LOAD_FAST",
|
||
],
|
||
"LOAD_FAST": [
|
||
"LOAD_FAST__LOAD_CONST",
|
||
"LOAD_FAST__LOAD_FAST",
|
||
],
|
||
"LOAD_GLOBAL": [
|
||
"LOAD_GLOBAL_BUILTIN",
|
||
"LOAD_GLOBAL_MODULE",
|
||
],
|
||
"STORE_ATTR": [
|
||
"STORE_ATTR_INSTANCE_VALUE",
|
||
"STORE_ATTR_SLOT",
|
||
"STORE_ATTR_WITH_HINT",
|
||
],
|
||
"STORE_FAST": [
|
||
"STORE_FAST__LOAD_FAST",
|
||
"STORE_FAST__STORE_FAST",
|
||
],
|
||
"STORE_SUBSCR": [
|
||
"STORE_SUBSCR_DICT",
|
||
"STORE_SUBSCR_LIST_INT",
|
||
],
|
||
"UNPACK_SEQUENCE": [
|
||
"UNPACK_SEQUENCE_LIST",
|
||
"UNPACK_SEQUENCE_TUPLE",
|
||
"UNPACK_SEQUENCE_TWO_TUPLE",
|
||
],
|
||
}
|
||
_specialized_instructions = [
|
||
opcode for family in _specializations.values() for opcode in family
|
||
]
|
||
_specialization_stats = [
|
||
"success",
|
||
"failure",
|
||
"hit",
|
||
"deferred",
|
||
"miss",
|
||
"deopt",
|
||
]
|
||
|
||
_cache_format = {
|
||
"LOAD_GLOBAL": {
|
||
"counter": 1,
|
||
"index": 1,
|
||
"module_keys_version": 2,
|
||
"builtin_keys_version": 1,
|
||
},
|
||
"BINARY_OP": {
|
||
"counter": 1,
|
||
},
|
||
"UNPACK_SEQUENCE": {
|
||
"counter": 1,
|
||
},
|
||
"COMPARE_OP": {
|
||
"counter": 1,
|
||
"mask": 1,
|
||
},
|
||
"BINARY_SUBSCR": {
|
||
"counter": 1,
|
||
"type_version": 2,
|
||
"func_version": 1,
|
||
},
|
||
"FOR_ITER": {
|
||
"counter": 1,
|
||
},
|
||
"LOAD_ATTR": {
|
||
"counter": 1,
|
||
"version": 2,
|
||
"keys_version": 2,
|
||
"descr": 4,
|
||
},
|
||
"STORE_ATTR": {
|
||
"counter": 1,
|
||
"version": 2,
|
||
"index": 1,
|
||
},
|
||
"CALL": {
|
||
"counter": 1,
|
||
"func_version": 2,
|
||
"min_args": 1,
|
||
},
|
||
"STORE_SUBSCR": {
|
||
"counter": 1,
|
||
},
|
||
}
|
||
|
||
_inline_cache_entries = [
|
||
sum(_cache_format.get(opname[opcode], {}).values()) for opcode in range(256)
|
||
]
|