Looking for CIFO implementations in standard Ada

Looking for CIFO implementations in standard Ada

[Scott Carter]

I am looking for public domain implementations of certain CIFO entries written 
in standard Ada.  The performance of the code is completely irrelevant, and 
storage leaks are OK.  I do need correct syntax and semantics, though :)  This 
will only be used to do some initial testing of code in benign conditions, 
(with hopefully non-pathological usages), so warranty-free and not terribly 
robust code is also OK.  This will be used for some Space Station code, so the 
desired compatibility is actually with the Alsys vX.Y CIFO (a mix of CIFO 2 
and 3) implementations, but I'll take anything I can get.

The most needed CIFO entry is Synchronous and Asynchronous Task Scheduling 
(however, this entry depends on Events, which I know ExTRA has done in ordinary
 
Ada, and Dynamic Priorities, which seems to be at the least very tricky to do 
in standard Ada).  A PD implementation of Events alone would be moderately 
useful.  We also need Mutually Exclusive Access to Shared Data (is there any 
reason why the obvious implementation with a single hidden task per 
instantiation won't work?).

Priority Inheritance Discipline would be nice but is not necessary.

The target environment is a Rational, which lacks preemptive delay statements 
(this might affect the implementation of the Synchronous and Asynchronous Task 
Scheduling entry).  

Many thanks,

Scott Carter
McDonnell Douglas Electronic Systems Company MS A208
1801 East St Andrew Place, Santa Ana CA 92705
714-566-5741 FAX 714-566-4520
carter@klytus.mdc.com or scarter@cssgi.mdc.com