https://hg.dopieralski.pl/cpython-lru_cache-weakref/ en-us Lib/opcode.py revision history https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/5fe72b9ed48e/Lib/opcode.py computes the stack effect of bytecode instructions.]]> Larry Hastings <larry@hastings.org> Sat, 23 Nov 2013 14:49:22 -0800 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/6db3741e59be/Lib/opcode.py Benjamin Peterson <benjamin@python.org> Thu, 16 May 2013 14:37:25 -0500 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/cf65c7a75f55/Lib/opcode.py Benjamin Peterson <benjamin@python.org> Tue, 30 Apr 2013 09:41:40 -0400 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/22dc0a433b0e/Lib/opcode.py Alexander Belopolsky <alexander.belopolsky@gmail.com> Thu, 07 Jun 2012 14:28:14 -0400 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/d64ac9ab4cd0/Lib/opcode.py Nick Coghlan <ncoghlan@gmail.com> Fri, 13 Jan 2012 21:43:40 +1000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/d30b54ffd5e8/Lib/opcode.py Benjamin Peterson <benjamin@python.org> Sun, 17 Jul 2011 22:49:50 -0500 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/25cc226dc9bd/Lib/opcode.py 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/Lib/opcode.py 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/3aaf2e065db0/Lib/opcode.py 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/643d8d4fc8eb/Lib/opcode.py
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/2ee4653927f7/Lib/opcode.py svn+ssh://pythondev@svn.python.org/python/trunk

........
r67818 | antoine.pitrou | 2008-12-17 01:38:28 +0100 (mer., 17 déc. 2008) | 3 lines

Issue #2183: Simplify and optimize bytecode for list comprehensions.
........]]> Antoine Pitrou <solipsis@pitrou.net> Thu, 18 Dec 2008 11:06:25 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/60535250a62c/Lib/opcode.py Georg Brandl <georg@python.org> Sun, 20 Jul 2008 21:38:50 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/212a1fee6bf9/Lib/opcode.py Benjamin Peterson <benjamin@python.org> Wed, 11 Jun 2008 15:59:43 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/bce69db72e00/Lib/opcode.py Thomas Wouters <thomas@python.org> Tue, 18 Mar 2008 20:13:50 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/4dc01402d78a/Lib/opcode.py svn+ssh://pythondev@svn.python.org/python/trunk

........
r59544 | raymond.hettinger | 2007-12-18 01:13:45 +0100 (Tue, 18 Dec 2007) | 1 line

Add more namedtuple() test cases. Neaten the code and comments.
........
r59545 | christian.heimes | 2007-12-18 04:38:03 +0100 (Tue, 18 Dec 2007) | 3 lines

Fixed for #1601: IDLE not working correctly on Windows (Py30a2/IDLE30a1)

Amaury's ideas works great. Should we build the Python core with WINVER=0x0500 and _WIN32_WINNT=0x0500, too?
........
r59546 | christian.heimes | 2007-12-18 10:00:13 +0100 (Tue, 18 Dec 2007) | 1 line

Make it a bit easier to test Tcl/Tk and idle from a build dir.
........
r59547 | christian.heimes | 2007-12-18 10:12:10 +0100 (Tue, 18 Dec 2007) | 1 line

Removed several unused files from the PCbuild9 directory. They are relics from the past.
........
r59548 | raymond.hettinger | 2007-12-18 19:26:18 +0100 (Tue, 18 Dec 2007) | 29 lines

Speed-up dictionary constructor by about 10%.

New opcode, STORE_MAP saves the compiler from awkward stack manipulations
and specializes for dicts using PyDict_SetItem instead of PyObject_SetItem.

Old disassembly:
0 BUILD_MAP 0
3 DUP_TOP
4 LOAD_CONST 1 (1)
7 ROT_TWO
8 LOAD_CONST 2 ('x')
11 STORE_SUBSCR
12 DUP_TOP
13 LOAD_CONST 3 (2)
16 ROT_TWO
17 LOAD_CONST 4 ('y')
20 STORE_SUBSCR

New disassembly:
0 BUILD_MAP 0
3 LOAD_CONST 1 (1)
6 LOAD_CONST 2 ('x')
9 STORE_MAP
10 LOAD_CONST 3 (2)
13 LOAD_CONST 4 ('y')
16 STORE_MAP
........
r59549 | thomas.heller | 2007-12-18 20:00:34 +0100 (Tue, 18 Dec 2007) | 2 lines

Issue #1642: Fix segfault in ctypes when trying to delete attributes.
........
r59551 | guido.van.rossum | 2007-12-18 21:10:42 +0100 (Tue, 18 Dec 2007) | 2 lines

Issue #1645 by Alberto Bertogli. Fix a comment.
........
r59553 | raymond.hettinger | 2007-12-18 22:24:09 +0100 (Tue, 18 Dec 2007) | 12 lines

Give meaning to the oparg for BUILD_MAP: estimated size of the dictionary.

Allows dictionaries to be pre-sized (upto 255 elements) saving time lost
to re-sizes with their attendant mallocs and re-insertions.

Has zero effect on small dictionaries (5 elements or fewer), a slight
benefit for dicts upto 22 elements (because they had to resize once
anyway), and more benefit for dicts upto 255 elements (saving multiple
resizes during the build-up and reducing the number of collisions on
the first insertions). Beyond 255 elements, there is no addional benefit.
........
r59554 | christian.heimes | 2007-12-18 22:56:09 +0100 (Tue, 18 Dec 2007) | 1 line

Fixed #1649: IDLE error: dictionary changed size during iteration
........
r59557 | raymond.hettinger | 2007-12-18 23:21:27 +0100 (Tue, 18 Dec 2007) | 1 line

Simplify and speedup _asdict() for named tuples.
........
r59558 | christian.heimes | 2007-12-19 00:22:54 +0100 (Wed, 19 Dec 2007) | 3 lines

Applied patch #1635: Float patch for inf and nan on Windows (and other platforms).

The patch unifies float("inf") and repr(float("inf")) on all platforms.
........
r59559 | raymond.hettinger | 2007-12-19 00:51:15 +0100 (Wed, 19 Dec 2007) | 1 line

Users demand iterable input for named tuples. The author capitulates.
........
r59560 | raymond.hettinger | 2007-12-19 01:21:06 +0100 (Wed, 19 Dec 2007) | 1 line

Beef-up tests for dict literals
........
r59561 | raymond.hettinger | 2007-12-19 01:27:21 +0100 (Wed, 19 Dec 2007) | 1 line

Zap a duplicate line
........]]> Christian Heimes <christian@cheimes.de> Wed, 19 Dec 2007 02:07:34 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/4e6b4ba60c3b/Lib/opcode.py Thomas Wouters <thomas@python.org> Thu, 30 Aug 2007 22:57:53 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/060c79f6d919/Lib/opcode.py Nick Coghlan <ncoghlan@gmail.com> Sun, 15 Apr 2007 12:05:43 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/19f7ff443718/Lib/opcode.py The compiler package hasn't been updated yet; test_compiler.py fails.
Otherwise all tests seem to be passing now. There are no occurrences
of __metaclass__ left in the standard library.
Docs have not been updated.]]> Guido van Rossum <guido@python.org> Sun, 18 Mar 2007 15:41:51 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/0ea24f4f2467/Lib/opcode.py Thomas Wouters <thomas@python.org> Fri, 23 Feb 2007 19:56:57 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/e9a6234b26af/Lib/opcode.py * Fix some docstrings and one Print -> print.
* Fix test_{class,code,descrtut,dis,extcall,parser,popen,pkg,subprocess,syntax,traceback}.
These were the ones that generated code with a print statement.
In most remaining failing tests there's an issue with the soft space.]]> Georg Brandl <georg@python.org> Fri, 09 Feb 2007 21:28:07 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/c94f37054f19/Lib/opcode.py Georg Brandl <georg@python.org> Wed, 06 Sep 2006 06:51:57 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/d0b83c4630c0/Lib/opcode.py Guido van Rossum <guido@python.org> Mon, 28 Aug 2006 15:27:34 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/f87a3e61853d/Lib/opcode.py import MAGIC number.]]> Brett Cannon <bcannon@gmail.com> Fri, 25 Aug 2006 05:05:30 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/f7fd11a75a6a/Lib/opcode.py Neal Norwitz <nnorwitz@gmail.com> Fri, 17 Mar 2006 08:59:09 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/25007c155668/Lib/opcode.py Neal Norwitz <nnorwitz@gmail.com> Thu, 16 Mar 2006 06:02:10 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/edfed0e32ced/Lib/opcode.py Alexandre Vassalotti <alexandre@peadrop.com> Mon, 11 Jan 2010 22:36:12 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/c2fdf25329ff/Lib/opcode.py Alexandre Vassalotti <alexandre@peadrop.com> Sat, 09 Jan 2010 23:35:54 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/145376df3ad7/Lib/opcode.py
It speeds up the with statement and correctly looks up the special
methods involved.]]> Benjamin Peterson <benjamin@python.org> Mon, 25 May 2009 13:13:44 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/ef8fe9088696/Lib/opcode.py POP_JUMP_IF_{TRUE,FALSE} and JUMP_IF_{TRUE,FALSE}_OR_POP. This avoids executing
a POP_TOP on each conditional and sometimes allows the peephole optimizer to
skip a JUMP_ABSOLUTE entirely. It speeds up list comprehensions significantly.]]> Jeffrey Yasskin <jyasskin@gmail.com> Sat, 28 Feb 2009 19:03:21 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/94e79d78dff0/Lib/opcode.py Antoine Pitrou <solipsis@pitrou.net> Wed, 17 Dec 2008 00:38:28 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/7ac117b3be37/Lib/opcode.py
Allows dictionaries to be pre-sized (upto 255 elements) saving time lost
to re-sizes with their attendant mallocs and re-insertions.

Has zero effect on small dictionaries (5 elements or fewer), a slight
benefit for dicts upto 22 elements (because they had to resize once
anyway), and more benefit for dicts upto 255 elements (saving multiple
resizes during the build-up and reducing the number of collisions on
the first insertions). Beyond 255 elements, there is no addional benefit.]]> Raymond Hettinger <python@rcn.com> Tue, 18 Dec 2007 21:24:09 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/07aa19170a67/Lib/opcode.py
New opcode, STORE_MAP saves the compiler from awkward stack manipulations
and specializes for dicts using PyDict_SetItem instead of PyObject_SetItem.

Old disassembly:
0 BUILD_MAP 0
3 DUP_TOP
4 LOAD_CONST 1 (1)
7 ROT_TWO
8 LOAD_CONST 2 ('x')
11 STORE_SUBSCR
12 DUP_TOP
13 LOAD_CONST 3 (2)
16 ROT_TWO
17 LOAD_CONST 4 ('y')
20 STORE_SUBSCR

New disassembly:
0 BUILD_MAP 0
3 LOAD_CONST 1 (1)
6 LOAD_CONST 2 ('x')
9 STORE_MAP
10 LOAD_CONST 3 (2)
13 LOAD_CONST 4 ('y')
16 STORE_MAP]]> Raymond Hettinger <python@rcn.com> Tue, 18 Dec 2007 18:26:18 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/b6d2f6fd3e11/Lib/opcode.py
This was started by Mike Bland and completed by Guido
(with help from Neal).

This still needs a __future__ statement added;
Thomas is working on Michael's patch for that aspect.

There's a small amount of code cleanup and refactoring
in ast.c, compile.c and ceval.c (I fixed the lltrace
behavior when EXT_POP is used -- however I had to make
lltrace a static global).]]> Guido van Rossum <guido@python.org> Mon, 27 Feb 2006 22:32:47 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/6bc6abba8659/Lib/opcode.py Reduces the cost of "not" to almost zero.]]> Raymond Hettinger <python@rcn.com> Mon, 21 Jun 2004 16:31:15 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/bc006682acb2/Lib/opcode.py
Add a new opcode, LIST_APPEND, and apply it to the code generation for
list comprehensions. Reduces the per-loop overhead by about a third.]]> Raymond Hettinger <python@rcn.com> Sun, 07 Mar 2004 07:31:06 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/71a294bd7950/Lib/opcode.py
From SF patch #852334.]]> Walter Dörwald <walter@livinglogic.de> Thu, 12 Feb 2004 17:35:32 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/3df0cf16defc/Lib/opcode.py The additional code complexity and new NOP opcode were not worth it.]]> Raymond Hettinger <python@rcn.com> Thu, 24 Apr 2003 05:45:23 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/ab4fbf8ebab3/Lib/opcode.py * Can now test for basic blocks.
* Optimize inverted comparisions.
* Optimize unary_not followed by a conditional jump.
* Added a new opcode, NOP, to keep code size constant.
* Applied NOP to previous transformations where appropriate.

Note, the NOP would not be necessary if other functions were
added to re-target jump addresses and update the co_lnotab mapping.
That would yield slightly faster and cleaner bytecode at the
expense of optimizer simplicity and of keeping it decoupled
from the line-numbering structure.]]> Raymond Hettinger <python@rcn.com> Tue, 22 Apr 2003 06:49:11 +0000 https://hg.dopieralski.pl/cpython-lru_cache-weakref/log/04a93b7bdce4/Lib/opcode.py should be generated automatically]]> Skip Montanaro <skip@pobox.com> Thu, 27 Feb 2003 21:27:52 +0000