Changes between Version 114 and Version 115 of Developer/OpenProjects


Ignore:
Timestamp:
Mar 24, 2009, 4:49:22 AM (10 years ago)
Author:
ChrisJohns
Comment:

Update the project's details and change the name.

Legend:

Unmodified
Added
Removed
Modified
  • Developer/OpenProjects

    v114 v115  
    186186individual drivers on an as needed basis than a large collection of
    187187untested drivers.
    188 = RTEMS Initialization By Constructor =
     188= RTEMS Sequenced Initialization =
    189189
    190190
    191191'''Status:''' [wiki:ChrisJohns ChrisJohns] has filed a PR with a prototype.
    192192
    193 Add an ordered constructor type system for automatic manager
    194 initialization. This should be general enough to support RTEMS managers,
    195 drivers and BSD sysctl type nodes.  This is expected to significantly
    196 impact the [wiki:Projects/TinyRTEMS TinyRTEMS] effort as it would provide a central mechanism
    197 to eliminate code.  If you don't reference it, the initialization code
    198 would automatically drop out.
     193  '''Note:''' this project was called "RTEMS Initialization By Constructor".
     194
     195This project adds to RTEMS a Sequencer that calls user defined functions held in an unordered table in a specific order. An example of its use is the RTEMS Managers initialisation. The initialisation of the RTEMS Managers is a specific ordered sequence of calls currently hard coded into RTEMS. The sequencing code will take a table of nodes that is un-order, determine the order and make calls to the user provided functios which in this case is the manager initialisation calls.
     196
     197The solution should be general enough to support RTEMS managers, drivers and BSD sysctl type nodes. The result of this work is expected to impact the [wiki:Projects/TinyRTEMS TinyRTEMS] effort as it would provide a central mechanism to automatically eliminate unused code. If you don't reference a part of the RTEMS API the initialization code would automatically drop out. The automatic part here refers to the creation of the table of nodes.
     198
     199A prototype of the work can be found in [https://www.rtems.org/bugzilla/show_bug.cgi?id=1253 PR1253]. This work combines the call sequencing with the automatic generation of the table of nodes. The solution is not suitable as it uses the word "constructor" which we have since decided should not be used, as well as too much RAM. The ideal solution should use little if any RAM and all nodes and tables be held in ROM type memory. A typical small foot print CPU which would use a [wiki:Projects/TinyRTEMS TinyRTEMS] solution has much more ROM than RAM. Also this is a once off initialisation procedure and so using RAM means it is gone from application use.
     200
     201The automatic table generation uses the same linker technique used to create C++ static object constructor and destructor tables. Consider the RTEMS Message API. In the Message Manager's initialisation call's source file you create a {{{static const</code> structure with the specific fields needed by the sequencer code then reference this variable from the source file containing the {{{rtems_message_queue_create</code> code. The application must make a call to {{{rtems_message_queue_create</code> or all the other Message API calls will fail therefore this API needs only one reference from a single source file. The application call of {{{rtems_message_queue_create</code> will pull in its code and as this code references the node in the initialisation call's file it is also pulled in along with the initialisation code. We also create a variable that is a pointer to the sequencer node and this is placed in a special section using the GCC "attribute" modifier. The linker command file for BSP is modified to group all these pointers together in one location in ROM. This creates the table that is passed to the sequencer code.
     202
     203The sequencer code iterates over the table calling entries in the order specified. The order could be a number or it could be relative. The relative order design makes for a more robust system because you have moved away from specific numbers. The idea here is to allow high level ordering operators, for example "first", "last", "after", "before", "just after", "just before", etc. You can then say "message" is "after" "heap" and the order is determined at runtime. Most system parts are relative not absolute. It may even be possible to allow relative and absolute ordering to be mixed. Priorities are similar. At the end of the day we do not need 256 levels if we only use 4. Typically all we need is to say is this task is higher or lower than another task. Sequencing cab viewed the same way.
    199204= BSPs for CPU Simulators =
    200205