CircuitPython - a Python implementation for teaching coding with microcontrollers https://git.suspectdevices.com/suspect-devices/circuitpython/atom?h=4.0.0-beta.7 2018-08-09T20:29:30+00:00 2018-08-09T20:29:30+00:00 Scott Shawcroft scott@tannewt.org 2018-08-09T01:24:49+00:00 urn:sha1:96ebf5bc3fb455162286b9bc31e763f3c4f1c457 * Fix finding translations with escaped characters. * Add back \r to translations since its needed by screen. 2018-07-12T18:13:51+00:00 Dan Halbert halbert@halwitz.org 2018-07-12T18:13:51+00:00 urn:sha1:0d27f4d9a66dcb47b545e715d1833094b0c7b484 2018-07-11T20:45:30+00:00 Dan Halbert halbert@halwitz.org 2018-07-11T20:45:30+00:00 urn:sha1:7c219600a246d8956d0b23ea3f5d125a820e6b6a 2018-01-25T02:22:20+00:00 Scott Shawcroft scott.shawcroft@gmail.com 2018-01-17T22:27:28+00:00 urn:sha1:dff744558b32de05bbcf2e7a4804cb3c89e6658e The parser attempts to allocate two large (~512 byte) chunks up front. If it couldn't, then it would error out. This change will cause it to try allocating half the previous attempt until its down to two copies. This is ok upfront because later code checks bounds and tries to extend the allocation if needed. 2017-12-29T02:44:26+00:00 Damien George damien.p.george@gmail.com 2017-12-28T13:53:57+00:00 urn:sha1:c7cb1dfcb9f89eb0a2d2a90a5e496e919c8a0b94 Empty __VA_ARGS__ are not allowed in the C preprocessor so adjust the rule arg offset calculation to not use them. Also, some compilers (eg MSVC) require an extra layer of macro expansion. 2017-12-28T13:13:36+00:00 Damien George damien.p.george@gmail.com 2017-12-26T02:39:26+00:00 urn:sha1:d3fbfa491f46ec7e3f69d12e037cb3da7b3ae984 2017-12-28T13:13:36+00:00 Damien George damien.p.george@gmail.com 2017-12-26T02:39:02+00:00 urn:sha1:0016a45368d8e7272d1c1f891994d6de4effcb40 This is the sixth and final patch in a series of patches to the parser that aims to reduce code size by compressing the data corresponding to the rules of the grammar. Prior to this set of patches the rules were stored as rule_t structs with rule_id, act and arg members. And then there was a big table of pointers which allowed to lookup the address of a rule_t struct given the id of that rule. The changes that have been made are: - Breaking up of the rule_t struct into individual components, with each component in a separate array. - Removal of the rule_id part of the struct because it's not needed. - Put all the rule arg data in a big array. - Change the table of pointers to rules to a table of offsets within the array of rule arg data. The last point is what is done in this patch here and brings about the biggest decreases in code size, because an array of pointers is now an array of bytes. Code size changes for the six patches combined is: bare-arm: -644 minimal x86: -1856 unix x64: -5408 unix nanbox: -2080 stm32: -720 esp8266: -812 cc3200: -712 For the change in parser performance: it was measured on pyboard that these six patches combined gave an increase in script parse time of about 0.4%. This is due to the slightly more complicated way of looking up the data for a rule (since the 9th bit of the offset into the rule arg data table is calculated with an if statement). This is an acceptable increase in parse time considering that parsing is only done once per script (if compiled on the target). 2017-12-28T12:15:36+00:00 Damien George damien.p.george@gmail.com 2017-12-23T13:01:02+00:00 urn:sha1:c2c92ceefc86d7e5cdc358c4ea3226844391ae44 2017-12-28T12:12:10+00:00 Damien George damien.p.george@gmail.com 2017-12-23T12:53:01+00:00 urn:sha1:66d8885d85bb591810b25e763c0921372ab74ef4 2017-12-28T12:11:43+00:00 Damien George damien.p.george@gmail.com 2017-12-23T12:49:48+00:00 urn:sha1:815a8cd1ae3a0a451b0b0b687277093f3392cdab Reduces code size by eliminating quite a few pointer dereferences.