| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | SF patch #910929: Optimize list comprehensions | Raymond Hettinger | 2004-03-07 | 1 | -0/+1 | |
| | | | | | | 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. | |||||
| * | Replace backticks with repr() or "%r" | Walter Dörwald | 2004-02-12 | 1 | -1/+1 | |
| | | | | | From SF patch #852334. | |||||
| * | Revert the previous enhancement to the bytecode optimizer. | Raymond Hettinger | 2003-04-24 | 1 | -2/+0 | |
| | | | | | The additional code complexity and new NOP opcode were not worth it. | |||||
| * | Improved the bytecode optimizer. | Raymond Hettinger | 2003-04-22 | 1 | -0/+2 | |
| | | | | | | | | | | | | | | | * 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. | |||||
| * | new opcode module - extract opcode definitions from dis.py - eventually | Skip Montanaro | 2003-02-27 | 1 | -0/+188 | |
| should be generated automatically | ||||||
 |
index : delta/cpython-git.git | |
| github.com: python/cpython.git |
| summaryrefslogtreecommitdiff |