cpython

Commit Graph

Author	SHA1	Message	Date
Raymond Hettinger	f4cf76dd5e	Revert the previous enhancement to the bytecode optimizer. The additional code complexity and new NOP opcode were not worth it.	2003-04-24 05:45:23 +00:00
Raymond Hettinger	060641d511	Improved the bytecode optimizer. * 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.	2003-04-22 06:49:11 +00:00
Skip Montanaro	3249ccd06a	new opcode module - extract opcode definitions from dis.py - eventually should be generated automatically	2003-02-27 21:27:52 +00:00

Author

SHA1

Message

Date

Raymond Hettinger

f4cf76dd5e

Revert the previous enhancement to the bytecode optimizer.

The additional code complexity and new NOP opcode were not worth it.

2003-04-24 05:45:23 +00:00

Raymond Hettinger

060641d511

Improved the bytecode optimizer.

* 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.

2003-04-22 06:49:11 +00:00

Skip Montanaro

3249ccd06a

new opcode module - extract opcode definitions from dis.py - eventually

should be generated automatically

2003-02-27 21:27:52 +00:00

1 2 3 4

153 Commits