-
-
Notifications
You must be signed in to change notification settings - Fork 8.2k
Ideas on code size optimization #3319
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Comments
Switch btree.open() to accept cache size in pages, with removal of bytes-to-pages conversion from BerkeleyDB fork: #3257 (comment) . Saves 54 bytes on Xtensa (esp8266). |
Remove uio.open(), nobody uses it anyway. |
Remove ure.DEBUG flag from ure (and assocaited re1.5 compiled re dump code). |
Remove module-level ure.match() and ure.search(). |
-1, they are very useful. |
-1, as this is present since long and may break existing code.
ok: This should not break existing code, and it's output is anyhow hard to understand
True for me, but how do you know? Is there a trigger in it and nobody yet hit it? |
And yet that's the way to get smaller binary code size without losing functionality. This ticket is a raw dump of ideas of different "levels", ideally, all of them implemented, definitely, all implemented in a configurable way, and values for configuration shipped in mainline are different of course. |
also -1 unless they get added in micropython-lib or so: these are like the go-to functions for easy working with regexes |
Otherwise, I'll close this issue because it's quite stale. |
This ticket is intended to collect ideas on how to optimize for code sizes, which aren't carried out immediately for some reason (e.g. they make a breaking change, required big start-up effort, or complicate maintenance).
The text was updated successfully, but these errors were encountered: