https://hg.dopieralski.pl/cpython-lru_cache-weakref/ en-us Python/opcode_targets.h revision history https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/6db3741e59be/Python/opcode_targets.h Benjamin Peterson <benjamin@python.org> Thu, 16 May 2013 14:37:25 -0500 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/cf65c7a75f55/Python/opcode_targets.h Benjamin Peterson <benjamin@python.org> Tue, 30 Apr 2013 09:41:40 -0400 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/d64ac9ab4cd0/Python/opcode_targets.h Nick Coghlan <ncoghlan@gmail.com> Fri, 13 Jan 2012 21:43:40 +1000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/3c9232a684ae/Python/opcode_targets.h Georg Brandl <georg@python.org> Sat, 05 Mar 2011 15:15:55 +0100 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/25cc226dc9bd/Python/opcode_targets.h namespace if it occurs as a free variable in a nested block. This limitation
of the compiler has been lifted, and a new opcode introduced (DELETE_DEREF).

This sample was valid in 2.6, but fails to compile in 3.x without this change::

>>> def f():
... def print_error():
... print(e)
... try:
... something
... except Exception as e:
... print_error()
... # implicit "del e" here


This sample has always been invalid in Python, and now works::

>>> def outer(x):
... def inner():
... return x
... inner()
... del x

There is no need to bump the PYC magic number: the new opcode is used
for code that did not compile before.]]> Amaury Forgeot d'Arc <amauryfa@gmail.com> Fri, 10 Sep 2010 21:39:53 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/725231211273/Python/opcode_targets.h by the new (and simpler) DUP_TOP_TWO. Performance isn't changed, but
our bytecode is a bit simplified. Patch by Demur Rumed.]]> Antoine Pitrou <solipsis@pitrou.net> Sat, 04 Sep 2010 18:43:52 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/cab14be0ada1/Python/opcode_targets.h svn+ssh://pythondev@svn.python.org/python/trunk

........
r81029 | antoine.pitrou | 2010-05-09 16:46:46 +0200 (dim., 09 mai 2010) | 3 lines

Untabify C files. Will watch buildbots.
........]]> Antoine Pitrou <solipsis@pitrou.net> Sun, 09 May 2010 15:52:27 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/3aaf2e065db0/Python/opcode_targets.h svn+ssh://pythondev@svn.python.org/python/trunk

........
r72912 | benjamin.peterson | 2009-05-25 08:13:44 -0500 (Mon, 25 May 2009) | 5 lines

add a SETUP_WITH opcode

It speeds up the with statement and correctly looks up the special
methods involved.
........
r72920 | benjamin.peterson | 2009-05-25 15:12:57 -0500 (Mon, 25 May 2009) | 1 line

take into account the fact that SETUP_WITH pushes a finally block
........
r72940 | benjamin.peterson | 2009-05-26 07:49:59 -0500 (Tue, 26 May 2009) | 1 line

teach the peepholer about SETUP_WITH
........]]> Benjamin Peterson <benjamin@python.org> Sun, 28 Jun 2009 03:18:59 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/f197407bdba2/Python/opcode_targets.h svn+ssh://pythondev@svn.python.org/python/branches/py3k

................
r81032 | antoine.pitrou | 2010-05-09 17:52:27 +0200 (dim., 09 mai 2010) | 9 lines

Recorded merge of revisions 81029 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk

........
r81029 | antoine.pitrou | 2010-05-09 16:46:46 +0200 (dim., 09 mai 2010) | 3 lines

Untabify C files. Will watch buildbots.
........
................]]> Antoine Pitrou <solipsis@pitrou.net> Sun, 09 May 2010 16:14:21 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/643d8d4fc8eb/Python/opcode_targets.h
This patch by Antoine Pitrou optimizes the bytecode for conditional branches by
merging the following "POP_TOP" instruction into the conditional jump. For
example, the list comprehension "[x for x in l if not x]" produced the
following bytecode:

1 0 BUILD_LIST 0
3 LOAD_FAST 0 (.0)
>> 6 FOR_ITER 23 (to 32)
9 STORE_FAST 1 (x)
12 LOAD_FAST 1 (x)
15 JUMP_IF_TRUE 10 (to 28)
18 POP_TOP
19 LOAD_FAST 1 (x)
22 LIST_APPEND 2
25 JUMP_ABSOLUTE 6
>> 28 POP_TOP
29 JUMP_ABSOLUTE 6
>> 32 RETURN_VALUE

but after the patch it produces the following bytecode:

1 0 BUILD_LIST 0
3 LOAD_FAST 0 (.0)
>> 6 FOR_ITER 18 (to 27)
9 STORE_FAST 1 (x)
12 LOAD_FAST 1 (x)
15 POP_JUMP_IF_TRUE 6
18 LOAD_FAST 1 (x)
21 LIST_APPEND 2
24 JUMP_ABSOLUTE 6
>> 27 RETURN_VALUE

Notice that not only the code is shorter, but the conditional jump
(POP_JUMP_IF_TRUE) jumps right to the start of the loop instead of going through
the JUMP_ABSOLUTE at the end. "continue" statements are helped
similarly.

Furthermore, the old jump opcodes (JUMP_IF_FALSE, JUMP_IF_TRUE) have been
replaced by two new opcodes:
- JUMP_IF_TRUE_OR_POP, which jumps if true and pops otherwise
- JUMP_IF_FALSE_OR_POP, which jumps if false and pops otherwise]]> Jeffrey Yasskin <jyasskin@gmail.com> Wed, 25 Feb 2009 02:25:04 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/d86e23318b41/Python/opcode_targets.h on compilers that support it (notably: gcc, SunPro, icc), the bytecode
evaluation loop is compiled with a new dispatch mechanism which gives
speedups of up to 20%, depending on the system, on various benchmarks.]]> Antoine Pitrou <solipsis@pitrou.net> Sun, 25 Jan 2009 16:34:23 +0000