micropython

TO_DO.txt

445:a1aa6fb9965f
2011-07-05 Paul Boddie Added notes about, and a test of, useful type deduction for loops and similar regions.
     1 Low-Level Instructions and Macro Instructions
     2 =============================================
     3 
     4 Have contexts and values stored separately in memory. This involves eliminating DataValue
     5 and storing attributes using two words.
     6 
     7 Migrate macro instructions such as the *Index instructions to library code implemented
     8 using low-level instructions.
     9 
    10 Consider introducing classic machine level instructions (word addition, subtraction, and
    11 so on) in order to implement all current RSVP instructions.
    12 
    13 Class and Module Attribute Assignment
    14 =====================================
    15 
    16 Verify that the context information is correctly set, particularly for the unoptimised
    17 cases.
    18 
    19   Update docs/assignment.txt.
    20 
    21 Prevent assignments within classes, such as method aliasing, from causing the source of an
    22 assignment from being automatically generated. Instead, only external references should be
    23 registered.
    24 
    25 Prevent "from <module> import ..." statements from registering references to such local
    26 aliases such that they cause the source of each alias to be automatically generated.
    27 
    28 Consider attribute assignment observations, along with the possibility of class and module
    29 attribute assignment.
    30 
    31   (Note direct assignments as usual, indirect assignments via the attribute usage
    32   mechanism. During attribute collection and inference, add assigned values to all
    33   inferred targets.)
    34 
    35   (Since class attributes can be assigned, StoreAttrIndex would no longer need to reject
    36   static attributes, although this might still be necessary where attribute usage analysis
    37   has not been performed.)
    38 
    39   Potentially consider changing static attribute details to use object-relative offsets in
    40   order to simplify the instruction implementations. This might allow us to eliminate the
    41   static attribute flag for attributes in the object table, at least at run-time.
    42 
    43 Dynamic Attribute Access
    44 ========================
    45 
    46 Consider explicit accessor initialisation:
    47 
    48   attr = accessor("attr")
    49   getattr(C, attr)
    50 
    51 Attribute Usage
    52 ===============
    53 
    54 Loop entry points and other places where usage becomes more specific might be used as
    55 places to impose guards. See tests/attribute_access_type_restriction_loop_list.py for an
    56 example.
    57 
    58 Consider attribute usage observations being suspended inside blocks where AttributeError
    59 may be caught (although this doesn't anticipate such exceptions being caught outside a
    60 function altogether).
    61 
    62 Consider type deduction and its consequences where types belong to the same hierarchy
    63 and where a guard could be generated for the most general type.
    64 
    65 Consider permitting multiple class alternatives where the attributes are all identical.
    66 
    67 Support class attribute positioning similar to instance attribute positioning, potentially
    68 (for both) based on usage observations. For example, if __iter__ is used on two classes,
    69 the class attribute could be exposed at a similar relative position to the class (and
    70 potentially accessible using a LoadAttr-style instruction).
    71 
    72 **** Constant attribute users need not maintain usage since they are already resolved. ****
    73 
    74 Consider handling CallFunc in micropython.inspect in order to produce instances of specific classes.
    75 Then, consider adding support for guard removal/verification where known instances are involved.
    76 Consider handling branches of values within namespaces in order to support more precise value usage.
    77 
    78 Frame Optimisations
    79 ===================
    80 
    81 Stack frame replacement where a local frame is unused after a call, such as in a tail call
    82 situation.
    83 
    84 Local assignment detection plus frame re-use. Example: slice.__init__ calls
    85 xrange.__init__ with the same arguments which are unchanged in xrange.__init__. There is
    86 therefore no need to build a new frame for this call, although in some cases the locals
    87 frame might need expanding.
    88 
    89 Inlining
    90 ========
    91 
    92 Where a function or method call can always be determined, the body of the target could be
    93 inlined - copied into place - within the caller. If the target is only ever called by a
    94 single caller it could be moved into place.
    95 
    96 Function Specialisation
    97 =======================
    98 
    99 Specialisation of certain functions, such as isinstance(x, cls) where cls is a known
   100 constant.
   101 
   102 Structure and Object Table Optimisations
   103 ========================================
   104 
   105 Fix object table entries for attributes not provided by any known object, or provide an
   106 error, potentially overridden by options. For example, the augmented assignment methods
   107 are not supported by the built-in objects and thus the operator module functions cause
   108 the compilation to fail. Alternatively, just supply the methods since something has to do
   109 so in the builtins.
   110 
   111 Consider attribute merging where many attributes are just aliases for the same underlying
   112 definition.
   113 
   114 Consider references to defaults as occurring only within the context of a particular
   115 function, thus eliminating default value classes if such functions are not themselves
   116 invoked.
   117 
   118 Scope Handling
   119 ==============
   120 
   121 Consider merging the InspectedModule.store tests with the scope conflict handling.
   122 
   123 Consider labelling _scope on assignments and dealing with the assignment of removed
   124 attributes, possibly removing the entire assignment, and distinguishing between such cases
   125 and unknown names.
   126 
   127 Check name origin where multiple branches could yield multiple scope interpretations:
   128 
   129 ----
   130 try:
   131     set # built-in name
   132 except NameError:
   133     from sets import Set as set # local definition of name
   134 
   135 set # could be confused by the local definition at run-time
   136 ----
   137 
   138 Object Coverage
   139 ===============
   140 
   141 Support __init__ traversal (and other implicit names) more effectively.
   142 
   143 Other
   144 =====
   145 
   146 Support tuple as a function returning any input tuple uncopied.
   147 
   148 Check context_value initialisation (avoiding or handling None effectively).
   149 
   150 __getitem__ could be written in Python, using a native method only to access fragments.
   151 
   152 Consider better "macro" support where new expressions need to be generated and processed.
   153 
   154 Detect TestIdentity results involving constants, potentially optimising status-affected
   155 instructions:
   156 
   157   TestIdentity(x, y) # where x is always y
   158   JumpIfFalse(...)   # would be removed (never false)
   159   JumpIfTrue(...)    # changed to Jump(...)
   160 
   161 Status-affected blocks could be optimised away for such constant-related results.