1. 20 Jun, 2014 1 commit
  2. 12 Jun, 2014 1 commit
  3. 11 Jun, 2014 1 commit
  4. 05 Jun, 2014 1 commit
  5. 01 Jun, 2014 2 commits
  6. 25 May, 2014 1 commit
    • Damien George's avatar
      py: Don't automatically intern strings in parser. · 5042bce8
      Damien George authored
      This completes non-automatic interning of strings in the parser, so that
      doc strings don't take up RAM.  It complicates the parser and compiler,
      and bloats stmhal by about 300 bytes.  It's complicated because now
      there are 2 kinds of parse-nodes that can be strings: interned leaves
      and non-interned structs.
      5042bce8
  7. 24 May, 2014 1 commit
  8. 21 May, 2014 1 commit
    • Damien George's avatar
      Tidy up some configuration options. · 58ebde46
      Damien George authored
      MP_ALLOC_* -> MICROPY_ALLOC_*
      MICROPY_PATH_MAX -> MICROPY_ALLOC_PATH_MAX
      MICROPY_ENABLE_REPL_HELPERS -> MICROPY_HELPER_REPL
      MICROPY_ENABLE_LEXER_UNIX -> MICROPY_HELPER_LEXER_UNIX
      MICROPY_EXTRA_* -> MICROPY_PORT_*
      
      See issue #35.
      58ebde46
  9. 19 May, 2014 1 commit
  10. 15 May, 2014 1 commit
  11. 11 May, 2014 1 commit
  12. 10 May, 2014 5 commits
  13. 08 May, 2014 2 commits
  14. 06 May, 2014 1 commit
  15. 05 May, 2014 2 commits
    • Paul Sokolovsky's avatar
      f9e54e0e
    • Damien George's avatar
      py: Turn down amount of RAM parser and compiler use. · 66e18f04
      Damien George authored
      There are 2 locations in parser, and 1 in compiler, where memory
      allocation is not precise.  In the parser it's the rule stack and result
      stack, in the compiler it's the array for the identifiers in the current
      scope.  All other mallocs are exact (ie they don't allocate more than is
      needed).
      
      This patch adds tuning options (MP_ALLOC_*) to mpconfig.h for these 3
      inexact allocations.
      
      The inexact allocations in the parser should actually be close to
      logarithmic: you need an exponentially larger script (absent pathological
      cases) to use up more room on the rule and result stacks.  As such, the
      default allocation policy for these is now to start with a modest sized
      stack, but grow only in small increments.
      
      For the identifier arrays in the compiler, these now start out quite
      small (4 entries, since most functions don't have that many ids), and
      grow incrementally by 6 (since if you have more ids than 4, you probably
      have quite a few more, but it wouldn't be exponentially more).
      
      Partially addresses issue #560.
      66e18f04
  16. 03 May, 2014 1 commit
    • Damien George's avatar
      Add license header to (almost) all files. · 04b9147e
      Damien George authored
      Blanket wide to all .c and .h files.  Some files originating from ST are
      difficult to deal with (license wise) so it was left out of those.
      
      Also merged modpyb.h, modos.h, modstm.h and modtime.h in stmhal/.
      04b9147e
  17. 30 Apr, 2014 2 commits
  18. 26 Apr, 2014 1 commit
  19. 25 Apr, 2014 1 commit
  20. 17 Apr, 2014 3 commits
  21. 15 Apr, 2014 1 commit
  22. 14 Apr, 2014 2 commits
  23. 13 Apr, 2014 3 commits
  24. 11 Apr, 2014 1 commit
  25. 10 Apr, 2014 2 commits
    • Damien George's avatar
      py: Add simple way of looking up constants in compiler. · 57e99ebc
      Damien George authored
      Working towards trying to support compile-time constants (see discussion
      in issue #227), this patch allows the compiler to look inside arbitrary
      uPy objects at compile time.  The objects to search are given by the
      macro MICROPY_EXTRA_CONSTANTS (so they must be constant/ROM objects),
      and the constant folding occures on forms base.attr (both base and attr
      must be id's).
      
      It works, but it breaks strict CPython compatibility, since the lookup
      will succeed even without importing the namespace.
      57e99ebc
    • Paul Sokolovsky's avatar
      py: Start implementing "struct" module. · e9db8404
      Paul Sokolovsky authored
      Only calcsize() and unpack() functions provided so far, for little-endian
      byte order. Format strings don't support repition spec (like "2b3i").
      
      Unfortunately, dealing with all the various binary type sizes and alignments
      will lead to quite a bloated "binary" helper functions  - if optimizing for
      speed. Need to think if using dynamic parametrized algos makes more sense.
      e9db8404
  26. 05 Apr, 2014 1 commit