openmano-mpy - MicroPython source and hardware configuration for OpenMano

Age	Commit message (Collapse)	Author
2014-02-16	Support passing positional args as keywords to bytecode functions.	Paul Sokolovsky
	For this, record argument names along with each bytecode function. The code still includes extensive debug logging support so far.
2014-02-15	py: Pass all scope flags through to runtime.	Damien George

2014-02-02	py: Partially fix native emitter to work with latest runtime.	Damien George
	Native emitter has been broken since stack order has changed from reverse to standard. This fix gets it partially working.
2014-02-01	py: Tidy up BINARY_OPs; negation done by special NOT bytecode.	Damien George
	IS_NOT and NOT_IN are now compiled to IS + NOT and IN + NOT, with a new special NOT bytecode.
2014-01-30	Implement __bool__ and __len__ via unary_op virtual method for all types.	Paul Sokolovsky
	__bool__() and __len__() are just the same as __neg__() or __invert__(), and require efficient dispatching implementation (not requiring search/lookup). type->unary_op() is just the right choice for this short of adding standalone virtual method(s) to already big mp_obj_type_t structure.
2014-01-29	py: Simplify fastn in VM; reduce size of unique code struct.	Damien George
	We still have FAST_[0,1,2] byte codes, but they now just access the fastn array (before they had special local variables). It's now simpler, a bit faster, and uses a bit less stack space (on STM at least, which is most important). The only reason now to keep FAST_[0,1,2] byte codes is for compressed byte code size.
2014-01-28	py: Implement 'not' in compiler, and improve rt_is_true.	Damien George

2014-01-11	py: Fix emitcpy and emitnative's binary_op.	Damien George

2014-01-11	unified the bops	John R. Lenton

2014-01-04	Split qstr into pools, and put initial pool in ROM.	Damien George
	Qstr's are now split into a linked-list of qstr pools. This has 2 benefits: the first pool can be in ROM (huge benefit, since we no longer use RAM for the core qstrs), and subsequent pools use m_new for the next pool instead of m_renew (thus avoiding a huge single table for all the qstrs). Still would be better to use a hash table, but this scheme takes us part of the way (eventually convert the pools to hash tables). Also fixed bug with import. Also improved the way the module code is referenced (not magic number 1 anymore).
2013-12-30	py: make closures work.	Damien George

2013-12-21	Change object representation from 1 big union to individual structs.	Damien
	A big change. Micro Python objects are allocated as individual structs with the first element being a pointer to the type information (which is itself an object). This scheme follows CPython. Much more flexible, not necessarily slower, uses same heap memory, and can allocate objects statically. Also change name prefix, from py_ to mp_ (mp for Micro Python).