Home
last modified time | relevance | path

Searched refs:STORE_FAST (Results 1 - 5 of 5) sorted by relevance

/third_party/python/Include/internal/
H A Dpycore_opcode.h215 [STORE_FAST] = STORE_FAST,
216 [STORE_FAST__LOAD_FAST] = STORE_FAST,
217 [STORE_FAST__STORE_FAST] = STORE_FAST,
367 [STORE_FAST] = "STORE_FAST",
/third_party/python/Include/
H A Dopcode.h83 #define STORE_FAST 125 macro
/third_party/python/Python/
H A Dspecialize.c293 case STORE_FAST: in _PyCode_Quicken()
303 case STORE_FAST: in _PyCode_Quicken()
304 if (previous_opcode == STORE_FAST) { in _PyCode_Quicken()
1788 bool to_store = (_Py_OPCODE(next) == STORE_FAST || in _Py_Specialize_BinaryOp()
H A Dceval.c1820 TARGET(STORE_FAST) {
1821 PREDICTED(STORE_FAST);
2064 assert(_Py_OPCODE(true_next) == STORE_FAST ||
2088 // The STORE_FAST is already done.
4344 PREDICT(STORE_FAST);
H A Dcompile.c1107 case STORE_FAST: in stack_effect()
4312 case Store: op = STORE_FAST; break; in compiler_nameop()
8700 ((opcode) == STORE_FAST || (opcode) == POP_TOP)
8703 (((instr).i_opcode == STORE_FAST) ? (instr).i_oparg : -1)
8727 // stack items. For example, we can replace SWAP(2), POP_TOP, STORE_FAST(42)
8728 // with the more efficient NOP, STORE_FAST(42), POP_TOP.

Completed in 26 milliseconds