Serhiy Storchaka <storchaka+cpyt...@gmail.com> added the comment:

Actually moving any of remaining optimizations (including two optimizations 
that are moved by this issue and two other that are left) slightly increases 
the complexity. But instead the optimizations become more general. At the end, 
after moving all optimizations, we could drop the auxiliary code in the 
peepholer (building the table of basic blocks, removing NOPs, fixing up jump 
targets) and the net complexity will be reduced. This can also reduce the time 
and memory consumption of compilation.

Thus getting rid of the peepholer optimizer working with the bytecode is my 
goal. But some peephole optimizations will work with the intermediate 
fixed-size representations used by the compiler, before generating the concrete 
bytecode.

----------

_______________________________________
Python tracker <rep...@bugs.python.org>
<https://bugs.python.org/issue32477>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe: 
https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com

Reply via email to