98b3072da5
py/lexer: Simplify handling of indenting of very first token.
2017-02-17 10:56:06 +11:00
b0599de48e
minimal: Update frozentest.mpy file for new .mpy version.
2017-02-17 10:27:47 +11:00
30f3bcdd29
gitattributes: Remove obsolete lines.
2017-02-17 10:27:34 +11:00
9214e39b3c
gitattributes: Add .mpy files to list of binary files.
2017-02-17 10:23:14 +11:00
6a11048af1
py/persistentcode: Bump .mpy version due to change in bytecode.
2017-02-17 00:19:34 +11:00
c264414746
py/lexer: Don't generate string representation for period or ellipsis.
...
It's not needed.
2017-02-16 20:23:41 +11:00
0ec957d7c5
tests/cmdline: Update cmd_parsetree test for changes to grammar order.
2017-02-16 19:45:07 +11:00
71019ae4f5
py/grammar: Group no-compile grammar rules together to shrink tables.
...
Grammar rules have 2 variants: ones that are attached to a specific
compile function which is called to compile that grammar node, and ones
that don't have a compile function and are instead just inspected to see
what form they take.
In the compiler there is a table of all grammar rules, with each entry
having a pointer to the associated compile function. Those rules with no
compile function have a null pointer. There are 120 such rules, so that's
120 words of essentially wasted code space.
By grouping together the compile vs no-compile rules we can put all the
no-compile rules at the end of the list of rules, and then we don't need
to store the null pointers. We just have a truncated table and it's
guaranteed that when indexing this table we only index the first half,
the half with populated pointers.
This patch implements such a grouping by having a specific macro for the
compile vs no-compile grammar rules (DEF_RULE vs DEF_RULE_NC). It saves
around 460 bytes of code on 32-bit archs.
2017-02-16 19:45:06 +11:00
7839b8b827
tests/micropython/heapalloc_iter: Add tests for contains and unpack.
2017-02-16 19:11:34 +11:00
e6003f466e
py: De-optimise some uses of mp_getiter, so they don't use the C stack.
...
In these cases the heap is anyway used to create a new object so no real
need to use the C stack for iterating. It saves a few bytes of code size.
2017-02-16 19:11:34 +11:00
019048a6dc
tests/micropython: Add test for iterating with the heap locked.
2017-02-16 19:11:34 +11:00
86b3db9cd0
tests/cmdline/cmd_showbc: Update to work with recent changes.
2017-02-16 18:38:07 +11:00
4d2bab1444
py/compile: Optimise list/dict/set comprehensions to use stack iter.
2017-02-16 18:38:07 +11:00
861b001783
tests/cmdline: Update tests to pass with latest changes to bytecode.
2017-02-16 18:38:07 +11:00
cb6300697c
py/runtime: Optimise case of identity iterator so it doesn't alloc RAM.
2017-02-16 18:38:06 +11:00
30b42dd72d
py: Remove unused "use_stack" argument from for_iter_end emit function.
2017-02-16 18:38:06 +11:00
088740ecc4
py: Optimise storage of iterator so it takes only 4 slots on Py stack.
2017-02-16 18:38:06 +11:00
6e769da0da
py: Make FOR_ITER opcode pop 1+4 slots from the stack when finished.
...
The extra 4 slots correspond to the iterator object stored on the stack.
2017-02-16 18:38:06 +11:00
f4df3aaa72
py: Allow bytecode/native to put iter_buf on stack for simple for loops.
...
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).
2017-02-16 18:38:06 +11:00
ae8d867586
py: Add iter_buf to getiter type method.
...
Allows to iterate over the following without allocating on the heap:
- tuple
- list
- string, bytes
- bytearray, array
- dict (not dict.keys, dict.values, dict.items)
- set, frozenset
Allows to call the following without heap memory:
- all, any, min, max, sum
TODO: still need to allocate stack memory in bytecode for iter_buf.
2017-02-16 18:38:06 +11:00
101886f529
py/vm: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:17 +11:00
da36f5232d
py/objint: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:17 +11:00
fa5a591757
py/objexcept: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:17 +11:00
efa629028a
py/objclosure: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:17 +11:00
dbcdb9f8d8
py/objfun: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:16 +11:00
ccc5254224
py/objarray: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:16 +11:00
c0d9500eee
py/objstr: Convert mp_uint_t to size_t (and use int) where appropriate.
2017-02-16 16:51:16 +11:00
68cd3a93f0
py/objset: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:16 +11:00
1ea2f7a8ce
py/objdict: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:16 +11:00
58d9eeb8d9
py/objlist: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:16 +11:00
229823942c
py/objtuple: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:16 +11:00
891dc5c62c
py/persistentcode: Replace mp_uint_t with size_t where appropriate.
2017-02-16 16:51:16 +11:00
6ed77bedbd
py/mpz: Change type of "base" args from mp_uint_t to unsigned int.
2017-02-16 16:51:16 +11:00
eb90edb5c0
py/mpz: Remove obsolete declaration of mpz_as_str_size.
2017-02-16 16:51:16 +11:00
dcdcc43dad
py/mpz: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:13 +11:00
4e3bac2e42
py/runtime: Convert mp_uint_t to size_t where appropriate.
2017-02-16 16:51:13 +11:00
a937750ceb
extmod/modlwip: Add my copyright.
...
Per:
$ git log modlwip.c |grep ^Auth | sort | uniq -c
9 Author: Damien George
2 Author: Galen Hazelwood
43 Author: Paul Sokolovsky
2017-02-15 19:20:46 +03:00
f980c70997
tests/basic/: Make various tests skippable.
...
To run the testsuite on small ports.
2017-02-15 18:11:16 +03:00
b737c9cbc8
tests/gen_yield_from_close: Use range() instead of reversed().
...
As a "more basic" builtin iterator, present even in smaller ports.
2017-02-15 17:05:27 +03:00
eb101a2701
examples/embedding/README: Convert to markdown, grammar and clarity fixes.
2017-02-15 13:27:24 +03:00
e5cc681cb1
stmhal: Use generic interrupt char code.
2017-02-15 16:39:30 +11:00
05a4859585
stmhal: Implement a proper thread scheduler.
...
This patch changes the threading implementation from simple round-robin
with busy waits on mutexs, to proper scheduling whereby threads that are
waiting on a mutex are only scheduled when the mutex becomes available.
2017-02-15 13:28:48 +11:00
f6c22a0679
py/vm: Add MICROPY_PY_THREAD_GIL_VM_DIVISOR option.
...
This improves efficiency of GIL release within the VM, by only doing the
release after a fixed number of jump-opcodes have executed in the current
thread.
2017-02-15 11:28:15 +11:00
234f07f16c
py/modthread: Use system-provided mutexs for _thread locks.
...
It's more efficient using the system mutexs instead of synthetic ones with
a busy-wait loop. The system can do proper scheduling and blocking of the
threads waiting on the mutex.
2017-02-15 11:28:02 +11:00
06a12ada48
tests/thread: Add stress-test for creating many threads.
2017-02-15 11:12:37 +11:00
2847d7431d
tests/thread: Replace busy waiting loops with a loop that sleeps.
...
Depending on the thread scheduler, a busy-wait loop can hog the CPU and
make the tests very slow. So convert such loops to loops that have an
explicit sleep, allowing the worker threads to do their job.
2017-02-15 11:12:37 +11:00
f2d732f459
tests/extmod: Make tests skippable.
2017-02-15 01:56:22 +03:00
7bb146350e
tests/dict_fromkeys: Revert to use reversed() to run in native codegen mode.
2017-02-15 01:30:16 +03:00
83623b2fde
tests/basic/[a-f]*: Make skippable.
...
For small ports which don't have all features enabled.
2017-02-15 00:57:56 +03:00
453f98914e
zephyr/main: Don't unconditionally dump stats on each GC.
...
This was a debug output for initial porting, breaks tests.
2017-02-14 23:31:47 +03:00
Damien George
Paul Sokolovsky