suspect-devices/circuitpython/tests/cmdline, branch v1.9.1CircuitPython - a Python implementation for teaching coding with microcontrollershttps://git.suspectdevices.com/suspect-devices/circuitpython/atom?h=v1.9.12017-04-22T13:39:38+00:00tests: Add tests for calling super and loading a method directly.2017-04-22T13:39:38+00:00Damien Georgedamien.p.george@gmail.com2017-04-18T23:49:48+00:00urn:sha1:30badd1ce1fabd26e54fc445f07846306aa19cefpy/compile: Refactor handling of special super() call.2017-04-22T11:46:32+00:00Damien Georgedamien.p.george@gmail.com2017-04-18T12:52:18+00:00urn:sha1:5335942b599d85263d3c18eb99ff5ebd04a8bc98
This patch refactors the handling of the special super() call within the
compiler. It removes the need for a global (to the compiler) state variable
which keeps track of whether the subject of an expression is super. The
handling of super() is now done entirely within one function, which makes
the compiler a bit cleaner and allows to easily add more optimisations to
super calls.
Changes to the code size are:
bare-arm: +12
minimal: +0
unix x64: +48
unix nanbox: -16
stmhal: +4
cc3200: +0
esp8266: -56
py: Create str/bytes objects in the parser, not the compiler.2017-02-24T02:43:43+00:00Damien Georgedamien.p.george@gmail.com2017-02-24T02:43:43+00:00urn:sha1:5255255fb9ea003db65935fe6cf2ac9d17410faa
Previous to this patch any non-interned str/bytes objects would create a
special parse node that held a copy of the str/bytes data. Then in the
compiler this data would be turned into a str/bytes object. This actually
lead to 2 copies of the data, one in the parse node and one in the object.
The parse node's copy of the data would be freed at the end of the compile
stage but nevertheless it meant that the peak memory usage of the
parse/compile stage was higher than it needed to be (by an amount equal to
the number of bytes in all the non-interned str/bytes objects).
This patch changes the behaviour so that str/bytes objects are created
directly in the parser and the object stored in a const-object parse node
(which already exists for bignum, float and complex const objects). This
reduces peak RAM usage of the parse/compile stage, simplifies the parser
and compiler, and reduces code size by about 170 bytes on Thumb2 archs,
and by about 300 bytes on Xtensa archs.
tests/cmdline/cmd_parsetree: Update to work with changes to grammar.2017-02-17T01:29:51+00:00Damien Georgedamien.p.george@gmail.com2017-02-17T01:29:51+00:00urn:sha1:c889f01b8d72cb72dd4a8c627c43cd5f66c3d4d9tests/cmdline: Update cmd_parsetree test for changes to grammar order.2017-02-16T08:45:07+00:00Damien Georgedamien.p.george@gmail.com2017-02-15T00:55:31+00:00urn:sha1:0ec957d7c519b01010e103197282933bfdcf0993tests/cmdline/cmd_showbc: Update to work with recent changes.2017-02-16T07:38:07+00:00Damien Georgedamien.p.george@gmail.com2017-02-10T04:39:55+00:00urn:sha1:86b3db9cd08c6ec647fae7a1c723e902f47b7e1etests/cmdline: Update tests to pass with latest changes to bytecode.2017-02-16T07:38:07+00:00Damien Georgedamien.p.george@gmail.com2017-01-18T05:53:15+00:00urn:sha1:861b00178370d507516273ea95dd48acd31f36ffpy: Allow bytecode/native to put iter_buf on stack for simple for loops.2017-02-16T07:38:06+00:00Damien Georgedamien.p.george@gmail.com2016-01-09T23:59:52+00:00urn:sha1:f4df3aaa72a0460614b1ab8b7b8a7927a1165e31
So that the "for x in it: ..." statement can now work without using the
heap (so long as the iterator argument fits in an iter_buf structure).
tests/cmdline: Improve repl.c autocomplete test coverage.2016-12-29T06:14:04+00:00Rami Aliflowergrass@users.noreply.github.com2016-12-29T05:54:18+00:00urn:sha1:b7024f0f64a29dded802d88f2dfaa64a6eed0df5tests: Add a coverage test for printing the parse-tree.2016-12-22T00:26:06+00:00Damien Georgedamien.p.george@gmail.com2016-12-22T00:26:06+00:00urn:sha1:cdec7ba30ed6d527c2d007b7fd37413f0c71a1fd