Wireless device operating system (OS) application programmer's interface (API)

Abstract

The invention relates to various aspects for modeling software, preferably for use in wireless communication devices. One aspect relates to targeting a software model to a plurality of different operating systems/operating system combinations. Another aspect relates to porting the software model to an operating environment common to all operating systems. Another aspect relates to abstracting the operating environment to an operating system/operating system combination. Another aspect relates to handling inter-processor communication. Another aspect relates to a common time manager. Another aspect relates to porting code developed using a single thread modeling tool to a multiple threaded environment. Another aspect relates to synchronizing groups of threads.

Description

FIELD OF INVENTION

[0002] This invention generally relates to wireless devices. In particular, the invention relates to developing software to run on hardware of such devices.

BACKGROUND

[0003] Developing software to effectively use hardware, such as communication processors and system processors, of wireless devices is difficult. Wireless devices have limited memory storage capacity, making it desirable that software operating systems, interfaces and applications have a small footprint. However, using reduced footprint software design techniques limits the flexibility accorded to software designers.

[0004] To illustrate, one tool for producing software modeling language SDL code is Telelogic Tau. That tool allows for software programmers to produce a model of the software and the tool produces code from the model. Telelogic Tau has two potential code generators, C-advanced and C-micro. C-advanced allows a software designer to use all the features of SDL. C-micro limits the available features with the advantage of producing a smaller code footprint.

[0005] Telelogic Tau supports both light and tight integration. In light integration, the entire SDL system executes in a single thread. In tight integration, each SDL process becomes a thread. To minimize the code footprint, C-micro is desirable to be used. However, C-micro only supports light integration and, accordingly, multiple threads of execution are not supported. Accordingly, it is desirable to have code with a reduced footprint that supports multiple threads of execution.

[0006] Another difficulty in wireless device software design is the application programmer's interfaces (APIs). Currently, several alternative open platform operating systems (OSs) are available for wireless devices, such as Symbian EPOC, Microsoft Windows CE and Palm OS, and several alternative real time operating systems (RTOS) are available, such as OSE, DSP BIOS and an alternate RISC RTOS. It is desirable to have an API that is capable of targeting a protocol stack, such as a third generation partnership project (3 GPP) universal mobile telecommunication system (UMTS) protocol stack, to all the different combinations of RTOSs and OSs.

[0007] Additionally, the hardware structures of wireless devices vary. The boundary between a system processor, such as an advanced reduced instruction set processor (RISC), and a communication processor, such as a digital signal processor (DSP), vary from device to device. Accordingly, it is desirable for an API to effectively hide this boundary.

SUMMARY

[0008] The invention relates to various aspects for modeling software, preferably for use in wireless communication devices. One aspect relates to targeting a software model to a plurality of different operating systems/operating system combinations. Another aspect relates to porting the software model to an operating environment common to all operating systems. Another aspect relates to abstracting the operating environment to an operating system/operating system combination. Another aspect relates to handling inter-processor communication. Another aspect relates to a common time manager. Another aspect relates to porting code developed using a single thread modeling tool to a multiple threaded environment. Another aspect relates to synchronizing groups of threads.

BRIEF DESCRIPTION OF THE DRAWING(S)

[0009] FIG. 1 is a simplified diagram of one configuration of a wireless device with software and programmers interface illustrated.

[0010] FIG. 2 is an illustration of messaging between SDL processes using light integration across partitions.

[0011] FIG. 3 is an illustration of messaging between SDL processes within a partition using tight integration.

[0012] FIG. 4 is an illustration of messaging between SDL processes across partitions using tight integration.

[0013] FIG. 5A is a flow chart for processing using thread groups.

[0014] FIG. 5B is an illustration of the structure of SDL C-micro generated data types.

[0015] FIG. 6 is a list of preferred reserved SDL process identities.

[0016] FIG. 7 illustrates the format of an SDL process control block.

[0017] FIGS. 8, 9 and 10 are flow charts of a signal identity translated into a transition identity within the SDL porting layer.

[0018] FIG. 11A is a high-level illustration of the OS abstraction layer.

[0019] FIG. 11B is an illustration the OS API software structures.

[0020] FIG. 12 illustrates the design of the message queue construct.

[0021] FIG. 13 illustrates the message queue control block data structures.

[0022] FIG. 14 is an illustration of an object database implemented in an OS-independent manner.

[0023] FIG. 15 is an illustration of a time manager object.

[0024] FIG. 16 is an illustration of time manager control block functionality.

[0025] FIG. 17 is a flow diagram of a creation/initialization time manager scenario.

[0026] FIG. 18 is a flow diagram of a get OS time time manager scenario.

[0027] FIG. 19 is a flow diagram of a set CallBack time manager scenario.

[0028] FIG. 20 is a flow diagram of a cancel CallBack time manager scenario.

[0029] FIG. 21 is a flow diagram of an execute CallBack time manager scenario.

[0030] FIG. 22 is an illustration of the message queue with IPC elements.

[0031] FIG. 23 is a flow diagram of message queue creation and destruction in context with inter-processor communication.

[0032] FIG. 24 is a flow diagram of message queue opening in context with inter-processor communication.

[0033] FIG. 25 is a flow diagram of message queue remote put in context with inter-processor communication.

[0034] FIG. 26 is an illustration of a message QID database.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

[0035] FIG. 1 is a simplified diagram of one configuration of a wireless device with software and programmers interface also illustrated. One such wireless device is a wireless transmit/receive unit. A wireless transmit/receive unit (WTRU) includes but is not limited to a user equipment, mobile station, fixed or mobile subscriber unit, pager, or any other type of device capable of operating in a wireless environment. Although the preferred embodiment uses the hardware configuration of FIG. 1, alternate hardware configurations can be used with the wireless device software.

[0036] The wireless device has a system processor 100, such as a RISC. The system processor 100 typically runs the system applications, such as web browsing, calendars, etc. A communication processor 102, such as a DSP, typically runs the wireless communication protocols. A communication module 104 allows for communication between the system and communication processor. A shared memory 106 is accessible by both processors 100 and 102 via the communication module 104.

[0037] FIG. 1 also illustrates the preferred software structure of the wireless device and its association with the hardware. The SDL model layer 108 represents the communication protocol stack components at very high level of abstraction. The SDL model environment 108 is composed of SDL processes 1181 to 1186 (118) communicating at a peer-to-peer level via SDL signals. SDL model elements (processes and signals) are transformed into operating environment elements by targeting the code generator to the operating system adaptive port interface (OS API) 120.

[0038] The SDL porting layer 110 represents the conversion of SDL model elements (processes, signals, partitions, etc.) into operating environment constructs through the OS API 120. The operating environment 112 provides an OS/hardware independent environment via the OS API 120. The preferred operating environment 112 operates independent of the underlying OSs. As a result, the software is independent of the operating system. Accordingly, if the underlying OSs change, the software does not have to be rewritten. The OS abstraction layer 114 implements the OS API 120 for a particular underlying operating system and hardware platform. It maps the OS API 120 constructs into their underlying OS representations. The abstraction layer 122 provides a direct implementation for functionality that an underlying OS does not support. For example, if an OS does not support messages and message queues, the OS abstraction layer would provide its own implementation.

[0039] The OS abstraction layer interfaces with the communication module 104 to support inter-processor communication. The preferred OS abstraction layer 122 allows for device drivers to cross processor boundaries. To illustrate, an audio driver may need to be present for the system OS 124, but the audio hardware may be present on the DSP 102. The communication module 104 provides the communication path between the OS API threads 1281 to 1282 (128) across the system/communication processor boundary and is responsible for the transfer for both data and control. As shown in FIG. 1, a queue 1301 to 1302(130) is associated with each thread 128. The communication module 104 provides the communication path between OS API threads across the system/communication processor boundary. It is responsible for the transfer of both data and control. A system OS 124 is associated with the system processor 100 and the communication OS 126 is associated with the communication processor 102.

[0040] Although, all of the layers work together in the preferred software structure, each layer can be typically used with other layers in alternate software structures.

[0041] FIGS. 2 to 4 illustrate of communication between SDL processes 118. FIG. 2 is an illustration of messaging between SDL processes 118 using light integration. SDL processes 118 execute on top of an SDL Kernel (K/E) 1321 to 1322(132). The SDL kernel 132 manages communication between the processes 118, routing signals to their appropriate recipients. The SDL model 108 may be divided into separate light integration partitions. Each partition contains its own SDL kernel 132, and resolves to a single thread 128 with a queue 120 within the operating environment 112. Each partition's SDL kernel 132 manages communication between internal SDL processes 118 without OS assistance. The SDL kernel 132 forwards signals destine for SDL processes 118 external to its partition through the operating environment 112 via messages 1341 to 1342(134).

[0042] Initially, the signal from one SDL process 1182 is converted to an OS message by the SDL kernel 132, in a first environment. The message is routed to an SDL kernel 1322 in a second environment. In other words, the message is “put” in the second environments queue 1302. The SDL kernel 1322 in the second environment detects the message, and converts the received message back to its signal format. The second environment SDL kernel 1322 signals the appropriate process.

[0043] Fundamentally, each SDL light integration partition resolves to a thread with a single message queue within the operating environment. Communication between partitions occurs via messaging. Each SDL kernel/environment knows what SDL processes 118 are internal, and what SDL processes 118 are external. Each SDL kernel/environment knows where to route external signals (i.e. what partition their recipient resides) and each SDL kernel/environment knows how to convert signals to messages, and vice versa.

[0044] FIG. 3 is an illustration of messaging between SDL processes 118 within a partition using tight integration. Using tight integration, the SDL model 118 maps directly to the operating environment 112. All SDL process communication (signaling) takes place through the operating environment 112. The SDL kernel (SDL process scheduler) is not included using tight integration. Specifically, each SDL process resolves to a thread 128 with a single message queue 130 within the operating environment 112. Communication between SDL processes 118 takes place through the operating environment 112. The SDL porting layer 110 converts signals to messages 134, and vice versa.

[0045] For a first SDL process 1181 to signal a second SDL process 1182, the first process 1181 converts the signal into an OS message. That message is routed to the second SDL process thread 1282 via its message queue 1302. That SDL Process thread 1282 wakes up on the message and the message is converted back to a SDL signal. The second SDL Process 1182 receives the signal from first SDL Process 1181.

[0046] FIG. 4 is an illustration of messaging between SDL processes across partitions using tight integration. For a first SDL process 1181 to signal a second SDL process 1182, the first process 1181 converts the signal into an OS message. That message is routed to the first partition external task 1361. This environment is the environment acting as a proxy for all processes external to this partition. That partition external task 1361 forwards the message (signal) to the second partition External Task 1362. The second partition external task 1362 routes the message (signal) to the second process thread 1282 via its message queue 1302. That thread wakes up on the message. The message is converted back to a SDL signal and the second SDL process 1182 receives the signal from the first SDL process 1181.

[0047] This procedure facilitates talking across processor boundaries. The partitions can by targeted to a specific processor and to function across the boundaries external tasks 136 may be used.

[0048] Abbreviations

[0049] ADT—Abstract Data Type

[0050] API—Application Programmer's Interface (Client Interface in this context)

[0051] CPU—Hardware (HW) Processor: system RISC (such as an ARM) or DSP.

[0052] IPC—Inter-processor Communication

[0053] OS—Operating System

[0054] HAL—Hardware Abstraction Layer

[0055] HW—Hardware

[0056] MUX—Mutex

[0057] SoC—System-On-a-Chip

[0058] SW—Software

[0059] Terms and Definitions

[0060] Communications Processor—Embedded CPU (DSP) executing low-level communication protocol stack layers, algorithms, device drivers, etc.

[0061] Operating Environment—Abstract programming environment provided by the OS abstraction layer through the OS API.

[0062] Open Platform—Operating system with a published (or publicly available) API. Third party organizations develop user-level applications to the published API.

[0063] Proxy—Placeholder or surrogate for another object, controlling access to it. Used in the OS Abstraction to present constructs physically located on a remote processor.

[0064] System Processor—General-purpose CPU executing an “Open Platform” operating system or a real time operating system (RTOS) including user-level applications.

[0065] Underlying Operating System—A target OS on which the OS abstraction layer and the OS API are built.

[0066] The operating environment 112 preferably hides the underlying OS and HW structure from its clients via an OS abstraction layer 122. This includes dual processor HW architectures. The operating environment 112 via the OS API preferably provide services to the following clients: SDL processes 118 (protocol stack model) and device drivers and software components.

[0067] The OS constructs are defined in an OS independent manner. Table 1 provides definitions for each of the OS constructs supported by the preferred OS API 120.

TABLE 1
OS
Construct: Definition:
Thread     Independent path of execution. Managed on a priority
           basis.
Process    Independent path of execution (thread) with its own
           protected address space. Note, a process may contain more
           than thread.
Thread     Grouping of threads, managed collectively to synchronize
Group      their execution. Each thread within the group contains an
           independent path of execution, scheduled on a priority
           basis. The thread group synchronizes the initialization of
           all threads within the group.
           Basic Functions:
           Synchronize - Bring-up or start all threads within the
           group, synchronizing them to a common initialization
           point. Specifically, all threads initialize, and block.
           Start - Allow all threads within the group to begin their
           “main” path of execution after initialization and
           synchronization.
Mutex      Thread synchronization element providing mutual exclusion
           to shared resources: memory regions/buffers, hardware
           devices, etc.
           Related terms: Semaphore, Critical Section, etc.
           Basic functions:
           Lock - Block if the MUX is locked by another thread,
           otherwise acquire the MUX and continue.
           Release - unlock or release the MUX.
Event      Thread synchronization element, allowing threads to
           coordinate execution. A thread may inform another thread
           of some condition by signaling an event.
           Basic functions:
           Set - signals the event.
           Wait - blocks until the event is signaled or set.
           Events allow one thread to “pass control” to another thread.
Message    Communication/synchronization element between threads.
           A message allows threads to exchange information through
           a common interface.
           Messages allow one thread to “pass control” and to “pass
           data” to another thread.
Message    Manages message communication between threads.
Queue      Includes transparent communication across the processor
           boundary.
           Basic functions:
           FIFO behavior.
           Put - places a message on the queue.
           Put After- places a message on the queue after an
           indicated delay.
           Wait-returns the message at the head of the queue. If
           no messages reside on the queue, block until one does.
           Get - returns the message at the head of the queue, if
           available. Does not block on empty.
           Variations:
           Priority messages. Messages ordered on the queue
           based on relative priority.
           Across the processor boundary: message data copied from
           the sender's memory space to the receiver's memory space.
           Within a processor: no data copy.
           Pointers cannot be included within a message due to
           processor boundary restrictions.
FIFO       Manages transfer for blocks of data between threads,
           including transparent data transfer across the processor
           boundary. Simpler than messages.
           Basic Functions:
           Put: places a memory block on the FIFO.
           Get: pulls a memory block from the FIFO.
           Wait: pends on the FIFO until a memory block appears.
           Pulls and returns.
           Across the processor boundary: data copied from the
           sender's memory space to the receiver's memory space.
           (This will depended on the HW architecture.)
           Within a processor: no data copy.
Linked     Generic list, providing a common implementation.
List       Basic Functions:
           Add: place elements in the list.
           Get: read elements in the list.
           Remove: pull elements from the list.
           Iterate: provides all three services while iterating over
           the list.

[0068]

TABLE 2
Other miscellaneous OS elements are defined per Table 2.
OS Construct:  Definition:
Memory         Memory allocation/de-allocation management.
Allocation/De- Several variants:
allocation:    General: allocation from a generic system heap.
               Local: allocation from a locally defined heap.
               Communication: allocation of communication buffers
               (i.e. memory buffers passed up and down the protocol
               stack). Such buffers may need to be shared across the
               system/communication processor boundary.
Delay (Sleep)  Allows a thread to pause its execution for a specified
               unit of time (milliseconds).

[0069] The SDL Porting layer 110 takes the SDL model elements, such as processes 118, signals, partitions, etc., and converts them into operating environment constructs. The following is the preferred embodiment of the OS API 120.

[0070] The OS API 120 has API entry points. All API entry points are named using the following convention:

os_<action><construct>( . . . )

[0071] Prefix—All API entry points are preceded with the “os_” prefix for identification.

[0072] Action—<action> field indicates what operation will be performed on the construct.

[0073] Construct Name—<construct> field identifies the construct receiving the action, or operation.

[0074] The OS API data structures are as follows. All the constants, defined in the API, are preceded with the “OS_” prefix for identification. All the API data types are preceded with the “Os_” prefix for identification. Individual enumeration values are preceded with the “OS_” prefix.

[0075] All Operating Environment elements are identified and referred to by a unique handle (Os_Handle_T). When the construct is created or opened, its assigned a handle, and that handle is used whenever the element is utilized.

[0076] All OS API entry points, with a few exceptions, return the generic OS Return Type (Os_Rtn_E). All time-relative API entry points (for example, os_putAfterMsgQ) return an OS Cancel ID to the caller (Os_CancelId_T). The Cancel ID may be used to cancel or terminate the time-relative operation, using an associated cancel entry point (for example, os_cancelPutAfterMsgQ).

[0077] Thread Priority Level (Os_ThreadPriority_E) represents the relative priority assigned to a thread, or a synchronized thread with a thread group. Preferred thread priority levels are per Table 3.

TABLE 3
OS_THREAD_PRIORITY_LEVEL0 Highest priority level.
OS_THREAD_PRIORITY_LEVEL1 .
OS_THREAD_PRIORITY_LEVEL2 .
OS_THREAD_PRIORITY_LEVEL3 .
OS_THREAD_PRIORITY_LEVEL4 .
OS_THREAD_PRIORITY_LEVEL5 .
OS_THREAD_PRIORITY_LEVEL6 .
OS_THREAD_PRIORITY_LEVEL7 Lowest priority level.

[0078] Different operating systems may handle scheduling of threads at the same priority level differently. For example, some round robin “run-able” threads at the same level on a time slice or quantum basis. Others allow “run-able” threads to individually run to completion (i.e. until they block). EPOC falls under the former and OSE the latter. Accordingly, threads assigned to the same priority level are checked prior to the assignment.

[0079] The thread function defines “client provided” entry points into a thread or a synchronized thread. All entry points must be a “C” function accepting a void * argument and returning void, as defined by: Os_ThreadFunction_T.

typedef void (Os_ThreadFunction_T)(void*arg_p)

[0080] The OS Time MS represents time in milliseconds. One count or tick is 1 ms.

typedef Uint32 Os_TimeMS_T

[0081] A Mutex is a fundamental thread synchronization element providing mutual exclusion to shared resources. Mutexs are not shared across processes, or processor boundaries.

[0082] The following are Mutex services. Creates create an operating environment Mutex, allocating all required underlying OS resources. The caller provides a reference to a handle. This call will populate the handle reference with a unique value, identifying the created Mutex.

Prototype:
Os_Rtn_E
os_createMux( Os_Handle_T *handle_p );

[0083]

Parameters:
*handle_p Mutex Handle, filled in by this call on successful
          creation

[0084]

Returns:
OS_RTN_OK    Successful creation.
OS_RTN_ERROR Failed to allocate underlying OS resources.

[0085] The destroy entry point destroys or deletes an operating environment Mutex, releasing all allocated underlying OS resources. After this call, the Mutex Handle is invalid and is no longer utilized.

Prototype:
Os_Rtn_E
os_destroyMux( Os_Handle_T handle );

[0086]

Parameters:
Handle OS Handle, identifying the MUX.

[0087]

Returns:
OS_RTN_OK        Successful deletion.
OS_RTN_BAD_PARAM Invalid Mutex handle.

[0088] The lock entry point locks or acquires an operating environment mutex. If the mutex is locked by another thread, this call will block until the locking thread releases the mutex. If multiple threads are blocked waiting on the mutex, the thread with the highest relative priority will gain access to the mutex. The priority inheritance is proven/verified within the underlying operating system.

Prototype:
Os_Rtn_E
os_lockMux( Os_Handle_T handle );

[0089]

Parameters:
Handle OS Handle, identifying the MUX.

[0090]

Returns:
OS_RTN_OK        Successful, mutex is locked.
OS_RTN_BAD_PARAM Invalid Mutex handle.

[0091] The release entry point releases an acquired or locked mutex. This call will unblock the highest priority thread, pending on the mutex. The priority inheritance is proven/verified within the underlying operating system.

Prototype:
Os_Rtn_E
os_releaseMux( Os_Handle_T handle );

[0092]

Parameters:
handle OS Handle, identifying the MUX.

[0093]

Returns:
OS_RTN_OK        Successful, the mutex was released.
OS_RTN_BAD_PARAM Invalid Mutex handle.

[0094] An Event is a thread synchronization element, allowing a thread to signal another thread of some condition.

[0095] The following are event services. The create entry point creates an operating environment event, allocating all required underlying OS resources. The caller provides a reference to a handle. This call populates the handle reference with a unique value, identifying the created Event.

Prototype:
Os_Rtn_E
os_createEvent( Os_Handle_T *handle_p );

[0096]

Parameters:
*handle_p Event Handle, filled in by this call on successful
          creation

[0097]

Returns:
OS_RTN_OK    Successful creation.
OS_RTN_ERROR Failed to allocate underlying OS resources.

[0098] The destroy entry point destroys or deletes an operating environment event, releasing all allocated underlying OS resources. After this call, the event handle is invalid and is no longer utilized.

Prototype:
Os_Rtn_E
os_destroyEvent( Os_Handle_T handle );

[0099]

Parameters:
handle OS Handle, identifying the Event.

[0100]

Returns:
OS_RTN_OK        Successful deletion.
OS_RTN_BAD_PARAM Invalid Event handle.

[0101] The set entry point sets an operating environment event. This call will unblock all threads, pending on the event.

Prototype:
Os_Rtn_E
os_setEvent( Os_Handle_T handle );

[0102]

Parameters:
Handle OS Handle, identifying the Event.

[0103]

Returns:
OS_RTN_OK        Successful, the event is set.
OS_RTN_BAD_PARAM Invalid Event handle.

[0104] The pend entry point blocks an operating environment event, until it is set or signaled. If the event is set, this call clears the event and returns immediately. Otherwise, it blocks until another thread sets the event. When set, the blocked thread wakes, the event is cleared, and control returned to the caller.

Prototype:
Os_Rtn_E
os_pendEvent( Os_Handle_T handle );

[0105]

Parameters:
handle OS Handle, identifying the Event.

[0106]

Returns:
OS_RTN_OK        Successful, the event has been set, and is
                 now clear.
OS_RTN_BAD_PARAM Invalid Event handle.

[0107] The clear entry point clears an operating environment event. If the event is not set, this service becomes a NOP.

Prototype:
Os_Rtn_E
os_clearEvent( Os_Handle_T handle );

[0108]

Parameters:
Handle OS Handle, identifying the Event.

[0109]

Returns:
OS_RTN_OK        Successful, the event is now clear.
OS_RTN_BAD_PARAM Invalid Event handle.

[0110] The check entry point checks the state of an operating environment event, set or clear.

Prototype:
Bool
os_checkEvent( Os_Handle_T handle );

[0111]

Parameters:
Handle OS Handle, identifying the Event.

[0112]

Returns:
TRUE  Event is set.
FALSE Event is clear, or any error condition.

[0113] A thread represents a single independent path of execution within the operating environment 112 and, in turn, the underlying software system. All threads within the system are scheduled on a priority, time-sliced basis via the underlying operating system. Threads within a single process share a common linear address space.

[0114] The thread services are as follows. The create entry point creates an operating environment thread, allocating all required underlying OS resources. If the suspend flag is clear, the thread will be started immediately, and its “Main Loop” will be invoked by the underlying OS scheduler based on its priority. Otherwise, the thread is suspended, and will not become schedulable until it is explicitly resumed. The “Main Loop” represents the thread's main path of execution. This function should never return. The caller provides a reference to a handle. This call will populate the handle reference with a unique value, identifying the created Thread.

Prototype:
Os_Rtn_E
os_createThread(
Os_Handle_T         *handle_p,
Uint32              stackSize,
Os_ThreadPriority_E priority,
Os_ThreadFunction_T *mainLoop_fp,
Bool                bSuspended,
void                *argument_p);

[0115]

Parameters:
*handle_p    Thread Handle, filled in by this call on successful
             creation.
stackSize    Stack Size for the created Thread in bytes.
Priority     Priority for the created Thread.
*mainLoop_fp Reference to the Thread's Main Loop.
bSuspended   Suspended Flag. TRUE = = create Thread
             suspended.
*argument_p  Argument for the created Thread. Passed to the
             Thread's Main Loop.

[0116]

Returns:
OS_RTN_OK        Successful creation.
OS_RTN_BAD_PARAM Bad input parameter detected.
OS_RTN_ERROR     Failed to allocate underlying OS
                 resources.

[0117] The destroy entry point destroys or deletes an operating environment thread, releasing all allocated underlying OS resources. This call does not free resources that the thread may have allocated internally during its execution. To prevent leaks, all such resources are de-allocated before the thread is destroyed. After this call, the thread handle is invalid and is no longer utilized.

Prototype:
Os_Rtn_E
os_destroyThread( Os_Handle_T handle );

[0118]

Parameters:
Handle OS Handle, identifying the Thread.

[0119]

Returns:
OS_RTN_OK        Successful deletion.
OS_RTN_BAD_PARAM Invalid Thread handle.

[0120] The suspend entry point suspends an operating environment thread. The underlying OS will not schedule the thread until it is resumed.

Prototype:
Os_Rtn_E
os_suspendThread( Os_Handle_T handle );

[0121]

Parameters:
Handle OS Handle, identifying the Thread.

[0122]

Returns:
OS_RTN_OK        Successful.
OS_RTN_BAD_PARAM Invalid Thread handle.

[0123] The resume entry point resumes the execution of a suspended operating environment thread. The underlying OS will schedule the thread based on its priority.

Prototype:
Os_Rtn_E
os_suspendThread( Os_Handle_T handle );

[0124]

Parameters:
handle OS Handle, identifying the Thread.

[0125]

Returns:
OS_RTN_OK        Successful.
OS_RTN_BAD_PARAM Invalid Thread handle.

[0126] A thread Group coordinates/synchronizes the bring-up or initialization of a group of threads. FIG. 5A is a flow chart for processing using thread groups. The thread group provides services to:

[0127] Synchronize a collection of threads (i.e. bring-up all threads in the group to a common initialization or rendezvous point), 494.

[0128] Start the collection, simultaneously (i.e. start each thread's main execution path after synchronization), 496.

[0129] All threads within a group must be specified when the thread group is created.

[0130] Thread groups do not utilize standard threads. Instead, a client provides the group with a set of specialized threads, called “SyncThreads”. A SyncThread expands the base functionality found within a standard thread, extending it to include two entry points: an “Init” function and a “Main Loop” function. When the group is synchronized, the “Init” function will be invoked for each SyncThread within the group, based on its priority. The “Init” function must perform all internal activities required to initialize its thread, and return. For example, create a message queue, allocate some scratch pad memory, initialize a driver or some hardware, etc. When the group is started, the “Main Loop” function will be invoked within each thread by the underlying OS based on its priority. The “Main Loop” represents the thread's main path of execution. This function should never return.

[0131] Similar to standard threads, all SyncThreads within a single process share a common linear address space.

[0132] When a Thread Group is created, the client provides it with a SyncThread data table containing all the information required to create and manage the threads. Each entry in the table contains the Os_SyncThreadData_S data type as per Table 4.

TABLE 4
stackSize  Stack Size in bytes.
priority   Thread Priority
*init_fp   Reference to the “Init” function for this
           SyncThread.
*initArg_p “Init” Argument. Passed to the SyncThread's
           “Init” function.
*loop_fp   Reference to the “Main Loop” function for this
           SyncThread.
*loopArg_p “Main” Argument. Passed to the SyncThread's
           “Main Loop” function.

[0133] The SyncThread data table is terminated with null entry indication:

OS_SYNC_THREAD_NULL.

[0134] This entry point creates an operating environment thread group, creating all the SyncThreads within the group and their underlying OS resources. The create operation does not start the threads. The creating client must explicitly start them via the synchronize and start operations.

[0135] The caller provides a reference to a handle. This call will populate the handle reference with a unique value, identifying the created thread group.

Prototype:
Os_Rtn_E
os_createThreadGroup( Os_Handle_T *handle_p,
Os_SyncThreadData_S*syncTable_p );

[0136]

Parameters:
*handle_p    Thread group handle, filled in by this call on
             successful creation
*syncTable_p Pointer to the first entry in this thread group's
             SyncThread table. The provided table must be
             made up of continuous Os_SyncThreadData_S
             entries, terminated with an
             OS_SYNC_THREAD_NULL.

[0137]

Returns:
OS_RTN_OK        Successful creation.
OS_RTN_BAD_PARAM Bad parameter detected within the
                 SyncThread Table.
OS_RTN_ERROR     Failed to allocate underlying OS
                 resources.

[0138] The destroy entry point destroys or deletes an operating environment thread group; destroying all of the group's SyncThreads and releasing all group allocated underlying OS resources. This call does not free resources that may have been allocated internal to any of the SyncThreads. To prevent leaks, all such resources are de-allocated before the thread group is destroyed. After this call, the thread group handle is invalid and is no longer utilized.

Prototype:
Os_Rtn_E
os_destroyThreadGroup( Os_Handle_T handle );

[0139]

Parameters:
handle OS Handle, identifying the Thread Group.

[0140]

Returns:
OS_RTN_OK        Successful deletion.
OS_RTN_BAD_PARAM Invalid Thread Group handle.

[0141] The initialize/synchronize entry point synchronizes all SyncThreads within an operating environment thread group. It ensures that each SyncThread within the group has initialized. Specifically, this call will not return until all threads execute their “Init” function and return.

Prototype:
Os_Rtn_E
os_initThreadGroup( Os_Handle_T handle );

[0142]

Parameters:
Handle OS Handle, identifying the Thread Group.

[0143]

Returns:
OS_RTN_OK        Successful.
OS_RTN_BAD_PARAM Invalid Thread Group handle.

[0144] The start entry point starts all SyncThreads within an operating environment thread group. This call may only be called after the group has been synchronized. This call allows each SyncThread within the group to enter its “Main Loop” function, which occurs based on the priority of each thread. This call does not wait for the SyncThreads to execute. It just makes them schedulable by the underlying OS, and returns.

Prototype:
Os_Rtn_E
os_startThreadGroup( Os_Handle_T handle );

[0145]

Parameters:
handle OS Handle, identifying the Thread Group.

[0146]

Returns:
OS_RTN_OK        Successful.
OS_RTN_BAD_PARAM Invalid event handle.

[0147] A Message is a thread synchronization element, allowing a thread to signal another thread with both control and data. They must be used in tandem with message queues. Specifically, a thread can allocate a message, populate it with data, and transfer it to another thread by “putting” the message on a message queue. Messages may cross the processor boundary.

[0148] Messages may contain any combination of data types: by value for which the data is contained directly in the message and by reference for which pointers to data is in the message.

[0149] Pointers within messages are used carefully. Pointers will not translate across processor boundaries. Also, if a message must be destroyed internally within OS abstraction layer 122, the OS layer 122 cannot not free data blocks passed by reference within the deleted message. They must be managed externally by the client to prevent leaks. As such, passing data by reference (via pointer) within a message should be avoided.

[0150] The allocate entry point allocates a single message. It returns a void * pointer to the caller, referring to the memory block representing the message. The size of this block equals the required message size (plus a small message header, hidden from the client). After allocating a message, the client may populate the memory block with data.

Prototype:
Os_Rtn_E
os_allocMsg( Uint32 size,
void **msg_pp );

[0151]

Parameters:
Size     Size to allocate for this message.
**msg_pp Pointer to return a void * pointer, referring to the
         allocated message.

[0152]

Returns:
OS_RTN_OK        Successful.
OS_RTN_BAD_PARAM Invalid size.
OS_RTN_MEM_ERROR Insufficient memory available to satisfy
                 this request.

[0153] The free entry point frees or de-allocates a single message.

Prototype:
Os_Rtn_E
os_freeMsg( void *msg_p );

[0154]

Parameters:
*msg_p Pointer to the message.

[0155]

Returns:
OS_RTN_OK        Successful.
OS_RTN_BAD_PARAM Invalid message pointer. Pointer does not
                 refer to a valid message.

[0156] A message queue coordinates the transfer of messages between threads. A message queue manages messages on a “first-in/first-out” basis. An “owning” thread creates the message queue. After which, external clients or “using” threads may open and put messages onto the queue. Only the “owning” thread should retrieve or pull messages from the queue.

[0157] Message queues are independent of the system processor/communication processor boundary. Simply, “using” threads may open and put messages on both local (on same CPU) and remote messages queues, transparently.

[0158] Each message queue is uniquely identified by a globally visible queue identified ID. A queue identifier that uniquely specifies a single message queue. Queue IDs span the entire software system: all processors, and all software components.

typedef Uint32 Os_Qid_T;

[0159] Message priority level (Os_MsgPriority_E) represents the relative priority assigned to a Message. A preferred relative priority is per table 5.

TABLE 5
OS_MSG_PRIORITY_LEVEL0 Highest priority level.
OS_MSG_PRIORITY_LEVEL1 .
OS_MSG_PRIORITY_LEVEL2 .
OS_MSG_PRIORITY_LEVEL3 .
OS_MSG_PRIORITY_LEVEL4 .
OS_MSG_PRIORITY_LEVEL5 .
OS_MSG_PRIORITY_LEVEL6 .
OS_MSG_PRIORITY_LEVEL7 Lowest priority level.

[0160] The create entry point creates an operating environment message queue based on the requested size, allocating all required underlying OS resources. The caller provides a reference to a handle. This call populates the handle reference with a unique value, identifying the created message queue.

Prototype:
Os_Rtn_E
os_createMsgQ( Os_Handle_T *handle_p,
Os_Qid_T qid,
Uint32   size );

[0161]

Parameters:
*handle_p Message Queue Handle, filled in by this call on
          successful creation
Qid       Identifier uniquely specifying this Message
          Queue.
Size      Size of the requested queue: maximum number
          of messages.

[0162]

Returns:
OS_RTN_OK        Successful creation.
OS_RTN_ID_EXISTS Message Queue for the input QID already
                 exists.
OS_RTN_BAD_PARAM Bad input parameter detected.
OS_RTN_MEM_ERROR Failed to allocate required memory.
OS_RTN_ERROR     Failed to allocate underlying OS
                 resources.

[0163] The destroy entry point destroys or deletes an operating environment message queue, releasing all allocated underlying OS resources. This operation, also, deletes or frees all messages currently queued. After this call, the message queue handle is invalid and is no longer utilized.

Prototype:
Os_Rtn_E
os_destroyThread( Os_Handle_T handle );

[0164]

Parameters:
handle OS Handle, identifying the Message Queue.

[0165]

Returns:
OS_RTN_RTN_OK    Successful deletion.
OS_RTN_BAD_PARAM Invalid Message Queue handle.

[0166] The open entry point opens an operating environment message queue. This call binds a “user” thread to a message queue instance, allowing it to transfer messages to the “owning” thread via the queue. The caller provided a reference to a handle. This call will populate this reference with a unique handle, binding the requested Message Queue.

Prototype:
Os_Rtn_E
os_openMsgQ( Os_Handle_T *handle_p,
Os_Qid_T qid );

[0167]

Parameters:
*handle_p Message Queue Handle, filled in by this call on
          successful creation.
Qid       Identifier uniquely specifying the Message Queue
          to open or bind.

[0168]

Returns:
OS_RTN_OK        Successful creation.
OS_RTN_NOT_FOUND Invalid Queue ID, a Message Queue does
                 not exist for this ID.
OS_RTN_ERROR     General error, failed to bind the Message
                 Queue.

[0169] The close entry point closes an operating environment message queue. This call un-binds a “user” thread and a message queue. After this call, the message queue handle is invalid and is no longer utilized. Any message queue API call performed with a closed handle produces undefined behavior.

Prototype:
Os_Rtn_E
os_closeMsgQ( Os_Handle_T_handle );

[0170]

Parameters:
handle OS Handle, identifying the Message Queue.

[0171]

Returns:
OS_RTN_OK        Successful close or un-bind.
OS_RTN_BAD_PARAM Invalid Message Queue handle.

[0172] The put entry point puts a message in an operating environment message queue. The message is placed in the message queue based on its priority. If the “owning” thread is blocked on the message queue, it will wake and receive the message. If the message is successfully queued, the message queue owns the message until it is “pulled” from the queue.

Prototype:
Os_Rtn_E
os_putMsgQ( Os_Handle_T handle,
Os_MsgPriority_E priority,
void                    **msg_pp )

[0173]

Parameters:
handle   OS Handle, identifying the Message Queue.
priority Priority to assign to the input message. Message
         placed in the queue based on this priority.
**msg_pp Reference to a message pointer. If the message is
         queued successfully, the message pointer is
         NULLed.

[0174]

Returns:
OS_RTN_OK         Successful, Message on the tail of the
                  queue.
OS_RTN_BAD_PARAM  Invalid Message Queue handle, or
                  message pointer.
OS_RTN_QUEUE_FULL Message Queue is full, could not put the
                  message on the queue.

[0175] The put after time entry point puts a message on an operating environment message queue after the indicated time delay. The message is placed at the back or tail of the message queue after the delay period expires. This operation provides the requester with a Cancel ID. The requestor may use the Cancel ID to terminate the put operation up until the delay period expires.

[0176] If this operation successfully sets up the requested delay, the message queue owns the message until it is “pulled” from the queue. If an error occurs “putting” the message after the delay, the message is deleted or freed.

Prototype:
Os_Rtn_E
os_putAfterMsgQ( Os_Handle_T handle,
Os_TimeMS_T                  delay,
Os_MsgPriority_E priority,
void                         **msg_pp,
Os_CancelId_T                *cancelId_p );

[0177]

Parameters:
handle      OS Handle, identifying the Message Queue.
delayMS     Delay in milliseconds. Message will be “Put”
            after this delay period.
priority    Priority to assign to the input message. Message
            placed in the queue based on this priority, when
            the delay expires.
**msg_pp    Reference to a message pointer. If the Put After
            Time is set-up successfully, the message pointer
            is NULLed.
*cancelId_p Cancel ID, returned to the caller. This ID may be
            used to cancel or terminate this operation.

[0178]

Returns:
OS_RTN_OK        Successful, Message will be “Put” after the
                 requested delay.
OS_RTN_BAD_PARAM Invalid Message Queue handle, or message
                 pointer

[0179] The cancel after time entry point cancels or terminates a put after time request. The caller requests the cancel using the Cancel ID. This call deletes or frees the Message tied to the put after time request.

Prototype:
Os_Rtn_E
os_cancelPutAfterMsgQ( Os_CancelId_T cancelId );

[0180]

Parameters:
cancelId Identifier specifying the Put After Time request
         to cancel or terminate.

[0181]

Returns:
OS_RTN_OK        Successful, Put After Time terminated, and
                 Message deleted.
OS_RTN_NOT_FOUND Invalid Cancel ID. A Put After Time
                 request was not found for this ID. This is
                 either an invalid request, or the Put After
                 Time operation has already completed.

[0182] The wait entry point blocks or waits on a message queue until a message appears. If messages are queued when invoked, this call returns the message from the head of the queue immediately. Otherwise, this call blocks the calling thread until a put, or put after time expires. At that time, wait returns the “put” message to the caller. On success, the message ownership is transferred to the caller. The message queue owner, specifically the thread who created the message queue, may only invoke this call.

Prototype:
Os_Rtn_E
os_waitMsgQ( Os_Handle_T handle,
void **msg_pp );

[0183]

Parameters:
handle   OS Handle, identifying the Message Queue.
**msg_pp Reference to a message pointer. Filled in with a
         Message on success.

[0184]

Returns:
OS_RTN_OK        Successful, Message pulled from the
                 Message Queue (msg_pp valid).
OS_RTN_BAD_PARAM Invalid Message Queue handle.

[0185] The get entry point pulls a message from a message queue, if present. If at least one message is queued, this call returns the message from the head of the queue immediately. Otherwise, this call returns queue empty status. On success, the message ownership is transferred to the caller. The message queue owner, specifically the thread who created the message queue, should only invoke this call.

Prototype:
Os_Rtn_E
os_getMsgQ ( Os_Handle_T handle,
void **msg_pp );

[0186]

Parameters:
handle   OS Handle, identifying the Message Queue.
**msg_pp Reference to a message pointer. Filled in with a
         Message on success.

[0187]

Returns:
OS_RTN_OK          Successful, Message pulled from the
                   Message Queue (msg_pp valid).
OS_RTN_BAD_PARAM   Invalid Message Queue handle.
OS_RTN_QUEUE_EMPTY Message Queue is empty.

[0188] A Communication Buffer is a thread synchronization element, allowing a thread to pass a data block or packet to another thread. Communication buffers are explicitly provided to support the movement of large data packets through the system. Communication buffers only contain raw data. Buffers do not contain data types, which reference other buffers or data blocks.

[0189] The allocate entry point allocates a single communication buffer. It returns a void * pointer to the caller, referring to the buffer. The buffer is allocated based on the size parameter. After allocating a buffer, the client may populate the buffer with data.

Prototype:
Os_Rtn_E
os_allocCommBuff( Uint32 size,
void **buff_pp );

[0190]

Parameters:
Size      Size to allocate for this buffer.
**buff_pp Pointer to return a void * pointer, referring to the
          allocated buffer. buff_p points to the first client
          useable location within the buffer.

[0191]

Returns:
OS_RTN_OK        Successful.
OS_RTN_BAD_PARAM Invalid size.
OS_RTN_MEM_ERROR Insufficient memory available to satisfy
                 this request.

[0192] The free entry point frees or de-allocates a single communication buffer.

Prototype:
Os_Rtn_E
os_freeCommBuff( void *buff_p );

[0193]

Parameters:
*buff_p Pointer to the buffer.

[0194]

Returns:
OS_RTN_OK        Successful.
OS_RTN_BAD_PARAM Invalid buffer pointer. Pointer does not
                 refer to a valid communication buffer.

[0195] Communication FIFOs manage the transfer of data packets (communication buffers) between threads, including transparent data transfer across the processor boundary. This functionality is provided to support software components that must transfer large amounts of data (i.e. UMTS protocol stack PDUs).

[0196] An “owning” thread creates the FIFO. After which, external clients or “using” threads may open and put communication buffers onto the FIFO. Only the “owning” thread should retrieve or pull buffers from the FIFO. FIFOs are independent of the System Processor/Communication Processor boundary. Simply, “using” threads may open and use both local (same CPU) and remote FIFOs, transparently. Each FIFO is uniquely identified by a globally visible FIFO ID.

[0197] The FIFO ID Identifier uniquely specifies a single FIFO. FIFO IDs span the entire software system: all processors, and all software components.

typedef Uint32 Os_FifoId_T;

[0198] The create entry point creates an operating environment FIFO based on the requested size, allocating all required underlying OS resources.

[0199] The caller provides a reference to a handle. This call populates the handle reference with a unique value, identifying the created FIFO.

Prototype:
Os_Rtn_E
os_createFIFO( Os_Handle_T *handle_p,
Os_FifoId_T fifoId,
Uint32 size );

[0200]

Parameters:
*handle_p FIFO Handle, filled in by this call on successful
          creation
fifoId    Identifier uniquely specifying this FIFO.
size      Size of the requested FIFO: number of buffers
          that the FIFO can manage.

[0201]

Returns:
OS_RTN_OK        Successful creation.
OS_RTN_BAD_PARAM Bad input parameter detected.
OS_RTN_MEM_ERROR Failed to allocate required memory.
OS_RTN_ERROR     Failed to allocate underlying OS resources.

[0202] The destroy entry point destroys or deletes an operating environment FIFO, releasing all allocated underlying OS resources. This operation, also, deletes or frees all communication buffers currently stored in the FIFO. After this call, the FIFO handle is invalid and is no longer utilized.

Prototype:
Os_Rtn_E
os_destroyFIFO( Os_Handle_T handle )

[0203]

Parameters:
handle OS Handle, identifying the FIFO.

[0204]

Returns:
OS_RTN_OK        Successful deletion.
OS_RTN_BAD_PARAM Invalid FIFO handle.

[0205] The open entry point opens an operating environment FIFO. This call binds a “user” thread to a FIFO instance, allowing it to transfer communication buffers to the “owner” thread via the FIFO. The caller provides a reference to a handle. This call populates this reference with a unique handle, binding the requested FIFO.

Prototype:
Os_Rtn_E
os_openFIFO( Os_Handle_T *handle_p,
Os_FifoId_T fifoId );

[0206]

Parameters:
*handle_p FIFO Handle, filled in by this call on successful
          creation.
fifoId    Identifier uniquely specifying the FIFO to open or
          bind.

[0207]

Returns:
OS_RTN_OK        Successful creation.
OS_RTN_NOT_FOUND Invalid FIFO ID, a FIFO does not exist for
                 this ID.
OS_RTN_ERROR     General error, failed to bind the FIFO.

[0208] The close entry point closes an operating environment FIFO. This call un-binds a “user” thread and a FIFO. After this call, the FIFO handle is invalid and is no longer utilized. Any FIFO API call performed with a closed handle produces undefined behavior.

Prototype:
Os_Rtn_E
os_closeFIFO( Os_Handle_T handle );

[0209]

Parameters:
handle OS Handle, identifying the FIFO.

[0210]

Returns:
OS_RTN_OK        Successful close or un-bind.
OS_RTN_BAD_PARAM Invalid FIFO handle.

[0211] The put entry point puts a communication buffer into an operating environment FIFO. The buffer is placed at the back or tail of the FIFO. If this operation is successful, the FIFO owns the communication buffer until it is “pulled” from the FIFO.

Prototype:
Os_Rtn_E
os_putFIFO( Os_Handle_T handle,
void   **buff_pp,
Uint32 size );

[0212]

Parameters:
handle     OS Handle, identifying the FIFO.
**buff _pp Reference to a communication buffer. If the
           buffer is successfully placed on the FIFO, the
           buffer pointer is NULLed.
size       Size of the buffer in bytes.

[0213]

Returns:
OS_RTN_OK         Successful, buffer placed at the end or
                  tail of the FIFO.
OS_RTN_MEM_ERROR  Failed to allocate required memory.
OS_RTN_QUEUE_FULL FIFO is full, could not put the buffer in
                  the FIFO.

[0214] The wait entry point blocks or waits on a FIFO until a communication buffer appears in the FIFO. If the FIFO contains a buffer, this call pulls the buffer and returns the buffer immediately. Otherwise, this call blocks the calling thread until a buffer is “put” in the FIFO. At that time, Wait returns the communication buffer to the caller. On success, the communication buffer ownership is transferred to the caller. The FIFO owner, specifically the thread who created the FIFO, should only invoke this call.

Prototype:
Os_Rtn_E
os_waitFIFO( Os_Handle_T handle,
void   **buff_pp,
Uint32 *size_p );

[0215]

Parameters:
handle   OS Handle, identifying the FIFO.
**buf_pp Reference to a buffer pointer. Filled in with a
         buffer pointer on success.
*size_p  Buffer size. Filled in with the buffer size on
         success.

[0216]

Returns:
OS_RTN_OK        Successful, buffer pulled from the FIFO
                 (buff_pp and size_p valid).
OS_RTN_BAD_PARAM Invalid FIFO handle.

[0217] The get entry point pulls a communication buffer from a FIFO, if present. Otherwise, this call returns FIFO empty status. On success, the buffer ownership is transferred to the caller. The FIFO owner, specifically the thread who created the FIFO, should only invoke this call.

Prototype:
Os_Rtn_E
os_getFIFO( Os_Handle_T handle,
void   **buff_pp,
Uint32 *size_p );

[0218]

Parameters:
handle    OS Handle, identifying the FIFO.
**buff_pp Reference to a buffer pointer. Filled in with a
          buffer pointer on success.
*size_p   Buffer size. Filled in with the buffer size on
          success.

[0219]

Returns:
OS_RTN_OK          Successful, buffer pulled from the FIFO
                   (buff_pp and size_p valid).
OS_RTN_BAD_PARAM   Invalid FIFO handle.
OS_RTN_QUEUE_EMPTY FIFO is empty.

[0220] The OS API provides a generic link list implementation with iterator functionality. This feature is provided so that link lists are utilized via a common mechanism throughout the system.

[0221] The create entry point creates an empty list with iterator referring the list end (i.e. NULL element terminating the list). The caller provides a reference to a handle. This call will populate the handle reference with a unique value, identifying the created list.

Prototype:
Os_Rtn_E
os_createList(Os_Handle_T *handle_p);

[0222]

Parameters:
*handle_p List Handle, filled in by this call on successful
          creation

[0223]

Returns:
OS_RTN_OK        Successful creation.
OS_RTN_MEM_ERROR Failed to allocate required memory.
OS_RTN_ERROR     Failed to allocate underlying OS resources.

[0224] The destroy entry point destroys a list and its iterator. The client empties the list prior to destroying it. Otherwise, all elements remaining in the list are leaked, if they are not managed external to the list. After this call, the list handle is invalid and is no longer utilized.

Prototype:
Os_Rtn_E
os_destroyList ( Os_Handle_T handle )

[0225]

Parameters:
handle OS Handle, identifying the List.

[0226]

Returns:
OS_RTN_OK        Successful deletion.
OS_RTN_BAD_PARAM Invalid List handle.

[0227] The append element entry point appends an element to the end of the list with the following special conditions:

[0228] If the list was empty, its iterator will now point to this element at the head.

[0229] If the iterator had advanced past the end of the list, it will now point to the new entry at the tail.

Prototype:
Os_Rtn_E
os_appendList( Os_Handle_T handle,
void *item_p);

[0230]

Parameters:
Handle  OS Handle, identifying the List.
*item_p Element to place in the list, reference via a void
        pointer.

[0231]

Returns:
OS_RTN_OK        Successful deletion.
OS_RTN_BAD_PARAM Invalid List handle.
OS_RTN_MEM_ERROR Failed to allocate memory required to add
                 the element to the list.

[0232] The insert element before iterator entry point adds an element to the list in front of its iterator, with the following special conditions:

[0233] If the list was empty, the element will be placed at the head, and the iterator will refer to the list end (i.e. NULL element terminating the list).

[0234] If the iterator had advanced past the end of the list, the element will be added at the tail, and the iterator will remain referring to the list end (i.e. NULL element terminating the list).

Prototype:
Os_Rtn_E
os_insertBeforeIterator( Os_Handle_T handle,
void *item_p);

[0235]

Parameters:
handle  OS Handle, identifying the List.
*item_p Element to place in the list, reference via a void
        pointer.

[0236]

Returns:
OS_RTN_OK        Successful deletion.
OS_RTN_BAD_PARAM Invalid List handle.
OS_RTN_MEM_ERROR Failed to allocate memory required to add
                 the element to the list.

[0237] The insert element after iterator entry point adds an element to the list in back of its iterator, with the following Special conditions:

[0238] If the list was empty, this request is rejected with OS_RTN_END_OF_LIST status.

[0239] If the iterator had advanced past the end of the list, this request is rejected with OS_RTN_END_OF_LIST status.

Prototype:
Os_Rtn_E
os_insertAfterIterator( Os_Handle_T handle,
void *item_p);

[0240]

Parameters:
handle  OS Handle, identifying the List.
*item_p Element to place in the list, reference via a void
        pointer.

[0241]

Returns:
OS_RTN_OK          Successful deletion.
OS_RTN_END_OF_LIST Iterator has advanced past the end of
                   the list, cannot insert after it.
OS_RTN_BAD_PARAM   Invalid List handle.
OS_RTN_MEM_ERROR   Failed to allocate memory required to
                   add the element to the list.

[0242] The get element at iterator entry point returns a reference to the element located at the list iterator. The element is not removed from the list, with the following special conditions:

[0243] If the list is empty, this call returns NULL.

[0244] If the iterator has advanced past the end of the list, this call returns NULL.

Prototype:
void*
os_getIteratorItem(Os_Handle_T handle);

[0245]

Parameters:
handle OS Handle, identifying the List.

[0246]

Returns:
NULL      Invalid List, Empty List, or Empty Iterator.
Otherwise Reference to the element located at the Iterator.

[0247] The remove element at iterator entry point removes the element located at the list iterator. The element is returned to the caller with the following special conditions:

[0248] If the list is empty, this call returns NULL.

[0249] If the iterator has advanced past the end of the list, this call returns NULL.

Prototype:
void*
os_removeIteratorItem(Os_Handle_T handle);

[0250]

Parameters:
handle OS Handle, identifying the List.

[0251]

Returns:
NULL      Invalid List, Empty List, or Empty Iterator.
Otherwise Element pulled from the Iterator.

[0252] The advanced iterator entry point advances the list iterator one position, with the special conditions:

[0253] The iterator may advance off the end of the list successfully. However once the iterator reaches the end, further attempts to advance it will return: OS_RTN_END_OF_LIST.

[0254] If the list is empty, this call returns OS_RTN_END_OF_LIST.

Prototype:
Os_Rtn_E
os_advanceIterator(Os_Handle_T handle);

[0255]

Parameters:
handle OS Handle, identifying the List.

[0256]

Returns:
OS_RTN_OK          Iterator advanced to next element.
OS_RTN_END_OF_LIST Cannot advance the iterator, it's at the
                   end of the list.
OS_RTN_BAD_PARAM   Invalid List handle.
OS_RTN_END_OF_LIST Iterator is at the end of the list.

[0257] The reset iterator entry point resets the list iterator to the head or front of the list.

Prototype:
Os_Rtn_E
os_resetIterator(Os_Handle_T handle);

[0258]

Parameters:
handle OS Handle, identifying the List.

[0259]

Returns:
OS_RTN_OK        Iterator advanced to next element.
OS_RTN_BAD_PARAM Invalid List handle.

[0260] The OS API 120 provides a generic hash table implementation. This feature provides a common hash table mechanism throughout the system. The API 120 preferably supports general dynamic memory allocation from the heap, although others may be used.

[0261] The allocate memory entry point allocates a block of memory from the general heap. Location of the general heap is OS dependent. This function exhibits the same behavior as the Standard IO call: malloc. It utilizes over malloc to support Operating System independence.

Prototype:
void*
os_allocMem( Uint32 size );

[0262]

Parameters:
size Request memory block size.

[0263]

Returns:
NULL      Memory allocation error.
Otherwise Reference to the allocated memory.

[0264] The free memory entry point frees or de-allocates a block of memory back to the general heap. Location of the general heap is OS dependent. This function exhibits the same behavior as the Standard IO call: free. It must be utilized over free to support operating system independence. This call is used only with memory references returned from os_allocMem. Other input causes undefined behavior.

Prototype:
void
os_freeMem( void *mem_p );

[0265]

Parameters:
*mem_p Pointer to memory block to free.

[0266] Returns:

[0267] None.

[0268] Other services not falling into the previous categories are as follows. The delay for milli-seconds entry point blocks the calling thread's execution for the indicated number of milli-seconds.

Prototype:
Os_Rtn_E
os_delayMilliSec( Os_TimeMS_T milliseconds );

[0269]

Parameters:
milliseconds Delay period in milli-seconds

[0270]

Returns:
OS_RTN_OK    Delay period complete.
OS_RTN_ERROR Could not execute the delay period.

[0271] The get current time entry point returns the current free running D<HRT> time value (in milliseconds).

Prototype:
Os_TimeMS_T
os_getTime( void );

[0272] Parameters:

[0273] None.

Returns:
Os_TimeMS_T Current time tick value in milliseconds.

[0274] In the preferred embodiment, an SDL porting layer 110 is used. The preferred SDL porting layer allows for software modeled using a single threaded code generation tool to run as multi-threaded software. The most preferred application is to code generated using C-Micro light integration of Telelogic Tau. The SDL porting layer 110 effectively converts the light integration (single thread) to a tight integration (multiple threads). The most preferred application allows for reduced code footprint (C-micro, light integration) with the added benefits a multi-threaded environment.

[0275] In a typical single threaded operating environment, the variables are brought in as global variables. Since the variables operate in a single threat, there is only a need for global variables. To facilitate operating in a multi-threaded environment using single threaded modeling tools, the variables are brought in as parameters/by reference and not global variables. The transition functions are modified to allow this functionality. This functionality prevents one thread from stopping on another threads variable. This facilitates the use of parameter variables by independent threads. The preferred structure to facilitate this is described herein.

[0276] In other embodiments, the other tools can be used without the SDL porting layer. Additionally, aspects of the SDL porting layer can be used with other single thread code generation tools as well as multi-thread code generation tools other than C-micro.

[0277] The basic requirement of the porting layer 110 is to produce the same SDL system behavior as the SDT provided C-micro kernel. This includes the ability to support the following SDL model features (SDT-imposed restrictions in parentheses).

[0278] SDL Feature:

[0279] Multiple processes

[0280] Send-Via signals (no output via all)

[0281] Send-To signals

[0282] Deferred signals

[0283] Multiple instances of a process (finite number only)

[0284] Asterisk input, asterisk state

[0285] Timers (integer duration only)

[0286] Signal w/parameters (no omission of parameters in a signal input)

[0287] Timer w/parameter (one integer parameter only)

[0288] Dynamic process creation (no formal parameters)

[0289] Procedure (no inheritance, no states, no nested procedure call data scope)

[0290] Service

[0291] Predefined Types

[0292] (No RPC)

[0293] (No Service and Priority Input and Output)

[0294] (No Export/Import, View/Reveal)

[0295] (No Enabling condition/Continuous signal)

[0296] (No Any Expression)

[0297] (No Macros)

[0298] (No channel substructure)

[0299] (Names of processes within different blocks must be different)

[0300] A number of options may be available during SDL code generation. The following description is based on the Make window in SDT to perform this step, although others may be used.

[0301] The options chosen for the preferred code generation are as follows, although others may be used.

[0302] Analyze & generate code (only)

[0303] Code generator: C-micro

[0304] Prefix: Full

[0305] Separation: Full

[0306] Capitalization: As defined

[0307] The code generated by SDT consists mainly of data structures. The only pieces that translate to operational code are the transition functions associated with each process. The structure of the generated data types is represented in FIG. 5B.

[0308] The root process table 138 is a global array, sized to the maximum number of process types in the system, plus one to allow for an end marker. This array is composed of process description block entries, one for each process type in the SDL system. The contents of each process description 140 are static variables, placed in the process's source file, along with the transition function. The root process table 138 is placed in the system source file.

[0309] The enumerations (process type and timer/signal IDs) are placed in header files 142. Process types are preferably numbered beginning at 0. To accommodate multiple instances of a single process type running in the system, an instance number is combined with the process type to come up with the process ID, or PID. Instance numbers begin at 0. Timer ID's and signal ID's share a common enumeration. Timers ID's are defined first, beginning at 1 (0 is reserved for the Start signal). FIG. 6 is a list of preferred reserved IDs.

[0310] An SDL system can be partitioned using either automatic or manual partitioning. Automatic partitioning is accomplished preferably via an SDT build script. When the system is partitioned, send-via signals that cross a partition's boundary get translated into signals that are sent-to an “environment” SDL process. The identity of the true intended recipient is lost. Enough information may be available in the SDT-generated PR file to construct a mapping table (signal ID+sending process ID=destination process ID), which the environment process could use to forward the signals. However, this imposes more restrictions on the design of the system and adds extra hops to the signal's route.

[0311] Manual partitioning is done after code generation. A copy is made of the system source file, and the two are edited. The root process table entries for processes not in the partition are replaced with null entries. Next, the files are grouped according to partition and compiled using an appropriate make file. Full separation is required during the code generation step so that this grouping can occur. The main drawback to manual partitioning is the need to edit a generated code file. However, it produces more efficient code, and it does not impose limitations on the system.

[0312] For SDL system startup, each partition within the SDL system is compiled into a single executable (exact form is both OS and HW platform dependent). At startup, the partition's “main” (main thread) loops through the root process table 138. Each non-null entry represents a local process type. The process description 140 for each process type contains an instance data table, sized to the maximum number of instances of the type that can be running simultaneously in the system. A thread group is created, containing a synchronized thread for each possible process instance. A process control block is created for each instance, containing the process ID and a pointer to the process description. A pointer to the process control block is passed to the thread so that it has scoped access to its own information.

[0313] The thread group is directed to synchronize, then to start. During synchronization, each thread creates for itself a message queue, a save list, and an active timer list. The handles for these items are stored in the process control block. If a process instance should be active on startup, as dictated by the generated code, a thread then sends a Start signal to itself. At this point, initialization is complete, and the thread notifies the thread group accordingly. When all threads have checked in, the thread group can be started, and active instances will receive and process their Start signals.

[0314] FIG. 7 illustrates the format of a Process Control Block. The data type and its associated table are extensions to C-Micro to support tight integration to the OS API. The process control block 144 has a PID 154, OS handles 1561 to 1563 and a process description pointer 158. One OS handle 1561 points to a message quene. Another OS handle points to a save list 148 and another 1563 to an active timer list 150. The process description pointer 158 points to a process description 152.

[0315] For SDL signal inputs, each SDL process instance runs in its own operating environment thread. Its responsibility is to receive and react to signals. Signals are received in messages through the thread's associated message queue. There are three ways an SDL process may react to a signal: discard it, save it for later, or initiate a state transition.

[0316] Once a signal has been identified as the current signal, the SDL process decides how to react to it. The framework for processing a signal resides in the porting layer and uses data accessed through the process control block 144. The following is the processing of the signal.

[0317] As illustrated in the flow chart of FIGS. 8, 9 and 10, the signal ID is translated into a transition ID. The process ID 154, stored in the process control block 144, provides the instance number. The instance number is used to index into the state index table 160 in the process description 152, and finds the current state. If the current state is Dormant 162, the transition ID is set to discard 164. If the current state is Start and the signal ID is Start, 166, 170, the transition ID is set to Start and the process returns to Start, 176. Any other signal received while in the Start state results in a transition ID of Discard, 174.

[0318] If the current state is neither Dormant nor Start, the signal is checked to see if it represents a timer, 178. When a timer is set, the sender ID of the signal is set to a reserved Timer process value, and an entry is added to the active timer list 180. If a timer is cancelled, its entry is removed from the list. If a signal 172 is received whose sender has been set to the reserved Timer process value, it is identified as a timer signal. If an entry for that timer is found on the active list 180, 182, the entry is removed and processing continues. If it is not found, the timer is invalid, and the transition ID is set to Discard, 184.

[0319] If the transition ID has not yet been set, the expected signals 188 for the current state are checked. In the state index table, each state maps to an index into the transition table, 190, where the signals expected in that state begin. The transition table entries are state-ordered the same as the state index table, so by also using the subsequent state's index, a range of indices into the Transition Table 190 is obtained. Within this range, if a signal ID is found that matches the current signal 188, or if the Asterisk signal ID is defined for this state, the corresponding transition ID is taken, 194.

[0320] If a valid transition ID has still not been found, the Asterisk State is checked. If the Asterisk State is defined for this process, the first entry in the state index table is not a 0, since the Asterisk state entries in the transition table come first. Therefore, this bottom range is checked the same as the current state.

[0321] If the transition ID is Discard, 198, or if all attempts to obtain a valid transition ID fail, a Null, (the signal is unexpected), the signal is discarded, 208. If the transition ID is “Save”, 200, the signal is saved via advance itorator 210, (on the save list 212). All other transition ID's are fed into the process description's transition function 214, the behavior of which is defined in SDL, and a new state ID is returned.

[0322] If the new state is not Dash, 202, the instance state table 216 is updated to the new state. If the new state is Dormant, 206, all active timers are cancelled, 218, 220. The save list 212 and the message queue are not flushed, 204, but are handled through normal processing. If the process is quickly started again, this may result in stale signals reaching the new process (since Start signals are sent with High priority and could jump ahead of stale signals in the queue). However, this is preferable to mistakenly discarding signals intended for the new process.

[0323] For signal output, SDL processes send signals from within the transition function. A connection is acquired to the destination message queue. Since opening and closing a connection to a message queue each time a message is put on it is undesirable, connections are opened as needed, and kept in a shared area for all threads in the process to use until system shutdown. This is accomplished via a lookup function, provided by the OS abstraction layer 122.

[0324] Timers can be set by an SDL process. When a timer goes off, it is received and processed as a signal. An SDL process can also cancel timers. Once a timer has been cancelled, it should not appear on the incoming message queue.

[0325] A high-level design description of the OS abstraction layer is as follows. The OS abstraction layer implements the OS API, providing clients with the operating environment.

[0326] FIG. 11A provides a high-level illustration of the OS abstraction layer 114. One of the functions of the OS abstraction layer 114 is to map operating environment entities to the underlying OS, such as a system OS or a communication OS. The OS abstraction layer allows for the operating environment to operate independently of the underlying OS platforms or hardware structure. As a result, code generated for use in one underlying OS/hardware environment can be used in other environments by changes to or by changing the OS abstraction layer. As a result, the resources required to be provided to facilitate an OS/hardware platform change are reduced. Although the preferred OS abstraction layer 114 operates with the operating environment described herein, it can be applied to other environments, such as OSE or VS works.

[0327] The abstraction layer 114 provides the operating environment by implementing the OS API 120. Client software components 222 access the operating environment via the API 120, preferably by using a global IDC_OS_API.h header file.

[0328] The abstraction layer is divided into separate modules, based on OS constructs. Each module provides an implementation for a single construct. Complex construct implementations may utilize lower-level constructs to achieve their functionality.

[0329] These modules are either OS dependent modules 226 or OS independent modules 224. OS dependent modules 226 interface, directly, with the underlying OS 228. A separate implementation appears for each target operating system. OS independent modules 224 do not interface with the underlying OS 228. They either provide all required functionality without the OS, or utilize OS dependent constructs via the OS API 120. Their implementation may be used for any target operating system.

[0330] The mixture of dependent and independent modules 226, 224, utilized to create the OS abstraction layer 114, may be tailored based on the characteristics of each operating system, independently. Specifically, one implementation may use an OS independent module 224, and another may use a dependent module 226. For example, EPOC utilizes an independent message queue module. But, OSE uses a dependent message queue module in order to capitalize on the signaling strengths of OSE.

[0331] The following OS abstraction layer naming convention is preferably utilized to specify which modules are OS independent and which are OS dependent (including to which OS).

[0332] OS Independent Modules:

[0333] OS_<construct>.c

[0334] Prefix—All independent modules start with the “OS_” prefix.

[0335] Construct Name—<construct> field identifies the API construct that this module provides.

[0336] OS Dependent Modules:

[0337] <os>_<construct>.c

[0338] Prefix—<os>prefix field identifies which Operating System this module applies.

[0339] Construct Name—<construct> field identifies the API construct that this module provides.

[0340] The software structure for the OS abstraction layer 114 is relatively simple. The OS abstraction layer 114 contains a module for each OS construct specified in the API 120. These modules may be OS dependent 226 or OS independent 224 based on the characteristics of each target operating system.

[0341] The OS modules fall into one of two categories: simple, and complex or compound. Simple modules are self-contained. They provide all required functionality with little assistance from subordinate components. Complex or compound components either require a complex implementation, or require the use of subordinate components to achieve their desired functionality. These may be OS layer internal components, or standard OS constructs. Internal components are accessed via an OS independent internal interface. They provide common services required by several OS abstraction constructs, but they are not published in the OS API 120. Standard OS constructs utilized as subordinates are accessed via the OS API 120.

[0342] FIG. 11B illustrates the OS API software structures. These structures are described in table 6.

TABLE 6
Module:	Description:	File Name:
Simplex 262
Mutex 239	Implements a Mutex.	<os>_Mutex.*
Event 240	Implements an Event.	<os>_Event.*
Thread 231	Implements a Thread.	<os>_Thread.*
Message 233	Implements the basic Message allocation and	<os>_Message.*
	de-allocation services.
Generic List	Implements a generic link list, including a list	<os>_List.*
235 with	iterator.
Iterator 237
Complex/Compound 264
Message	Implements a Message Queue. Message queues	<os>_MsgQ.*
Queue 246	provide IPC capabilities, requiring two	<os>_LocalMsgQ.*
	implementations (or sub-modules): local and	<os>_RemoteMsgQ.*
	remote.
	A local queue resides on same processor as
	its client. It includes all message queue
	capabilities.
	A remote queue provides a proxy for a queue
	located on the opposite processor. It provides
	only “user” capabilities (open, close, and put)
	via the IPC Management module.
FIFO 248	Implements a FIFO. FIFOs provide IPC	<os>_Fifo.*
	capabilities, requiring two implementations (or	<os>_LocalFifo.*
	sub-modules): local and remote.	<os>_RemoteFifo.*
	A local FIFO resides on same processor as
	its client. It includes all FIFO capabilities.
	A remote FIFO provides a proxy for a FIFO
	located on the opposite processor. It provides
	only “user” capabilities (open, close, and put)
	via the IPC Management module.
Thread	Implements a Thread Group. A Thread Group	<os>_ThreadGroup.*
Group 242	manages a collection of Synchronized Threads.
	This module is OS independent, containing
	thread management functionality. It utilizes
	the OS dependent SyncThread module,
	providing a physical thread implementation
	within the context of the underlying OS.
Memory	Provides all Memory Management capabilities.	<os>_Memory.*
Management	Note, this module will be expanded, and may
254	be split into OS dependent and independent
	components.
Log/Debug	Provides the error and debug reporting	<os>_Log.*
Support 256	capabilities. Note, this module will be
	expanded, and may be split into OS dependent
	and independent components.
Internal 266
Time	Provides all time-related functions. This	OS_TimeMgr.c
Management	module is a hybrid, providing both API	<os>_Time.*
258 and OS	services, and OS Abstraction services.
Time 260	API Services: time now, and delay.
	Internal Services: Set CallBack, Cancel
	CallBack. Note, this module is split into
	OS dependent and independent
	components.
IPC	Provides all IPC functionality. Design is	<os>_IPC.*
Management	TBD. This module may be split into
252	common, and OS specific modules.
Synchronized	Implementation of Synchronized Threads.	<os>_SyncThread.*
Thread 244	Note, Thread Group's use this internal
	module exclusively.
Generic	Provides a generic queue implementation.	<os>_Queue.*
Queue 250	Used to create more complex OS
	constructs.

[0343] The OS constructs, regardless of being OS dependent 226 or independent 224, use the following design pattern. Control blocks store all information required to implement an OS construct within the OS abstraction layer. The control block always begins with a marker specific to the construct type. The marker serves two purposes. First, it is used as a defensive programming measure. Functions that accept a reference to a control block as input always verify the marker before accessing data within the block. Secondly, the markers can be used during debug. They allow control blocks to be easily identified in memory. Typically, control blocks are defined privately within their construct's source file, encapsulating their format and implementation. Control blocks are allocated and freed using dedicated functions. This allows their allocation mechanism to be isolated, and changed without effecting the core construct logic.

[0344] An OS handle is assigned to represent or id3entify a construct, when the OS layer creates the construct instance. The OS layer uses the address of the construct's control block as the handle value. When a client inputs a construct handle into an OS API call, the OS layer converts the handle into a pointer referencing the control block for that construct instance. There is no need to perform look-ups or searches. This maximizes performance with little cost to size, and makes the OS layer efficient.

[0345] OS constructs provide both a creation method, and a destruction method. The “Create” method allocates and populates the construct's control block, including creating subordinate objects. The “Destroy” method kills all subordinate objects, and frees the construct's control block.

[0346] OS constructs that include IPC capabilities provide open and close methods. These calls bind and unbind clients to construct instances regardless of where they reside in the software system. IPC capable constructs, also, require unique identifiers (Queue IDs, FIFO IDs, etc.).

[0347] As an implication, this feature introduces the concept of owners and users. An “owning” client creates and may destroy a construct instance. The construct allows its “owning” client access to its full feature set. A “using” client binds and unbinds to a single construct instance via open and close. Closing a construct does not destroy it. Additionally, a construct may restrict “using” clients, allowing them access to a sub-set of construct's features. For example, an owner can “wait on” and “put to” a message queue, but a user can only “put to” the queue.

[0348] FIG. 12 illustrates the design of the message queue construct. Clients 232 use message queues as per the OS API 120. To implement its required functionality, the message queue 230 utilizes the services of several subordinate modules. The local message queue 234 and the remote message queue 236 represent specialized queue instances. These elements provide the functionality required to perform queue operations locally (i.e. on the same processor as the client) and remotely (i.e. on the opposite processor). The generalized message queue 230 forwards service requests to these subordinates based on queue type.

[0349] A local message queue 234 represents the physical queue, and it is self-contained. This object may be either OS dependent or OS independent. A remote message queue 236 represents a proxy for a queue physically located on the opposite processor. It coordinates the transfer of messages to its associated queue via the IPC Manager 238. The IPC Manager 238 transfers messages across the processor boundary, and utilizes the standard message queue “put” service to queue the message in the physical queue. The IPC Manager contains separate components executing on each processor.

[0350] The object database 240 provides storage and management of active objects (Message Queues and Buffer Queues) within the system. The time manager 242 provides a schedulable callback service. The message queue 230 utilizes this feature to perform “PutAfter”, and “CancelPutAfter” requests. This service is provided above (or before) the local/remote distinction. Thus, all “PutAfter” timing executes local to the sending or putting client. This design is used to keep the sending client as close as possible to the timer, coupling the timer to the sender and not the receiver.

[0351] FIG. 13 illustrates the message queue control block data structures and their relationships. Both message queue create and look-up operations return a reference to an OS object structure (control block) 245 as the message queue handle. In the local queue case, the object structure refers to a local message queue control block via an OS handle. The local message queue control block 247 contains information required to control a local queue. The message queue module 230 supplies this handle to the local message queue module 234 whenever it forwards service requests. The remote message queue control block 249 contains information required for control of the remote queue.

[0352] For the local message queue, the control block includes: a linked list 251 used to store messages in priority order, an event 253 used to implement the blocking “Wait” message queue call, and a mutex 255 used to protect the generic queue data structure.

[0353] The buffer queue utilizes the same general framework as message queues with the exception of priority. Buffers cannot be placed into a buffer queue based on priority. They are strictly “first-in-first-out”.

[0354] The object database provides storage and management of active objects within the system. Objects are defined as OS constructs that are explicitly designed to be shared across thread, and processor boundaries, including message queues which support communication between threads (control and data) and buffer queues which support the transfer of large data blocks between threads.

[0355] Objects are identified using the following information types: Object ID which is a unique object identifier within an application, object type which is the type of the object, and message queue, buffer queue, etc., and application ID which is a unique identifier of each application. The application ID field is used for the FDD SoC requirements. Other information stored for each object is: object handle which is a handle for the actual object and a processor which is a processor location: master/slave.

[0356] Similar to the application ID, the need and use of the processor field is determined as the protocol stack design progresses, specifically in regards to IPC. The distributed environment feature of the OS API is optional.

[0357] The object database 260, as shown in FIG. 14, is implemented in an OS-independent manner. Each object has an object structure 258, typically including an object ID, type, application, CPU=Master/Slave and Object reference. The OS client initiates the creation and destruction of these objects. Object references are stored within a hash table 262. A combination of Application ID, Object ID, and Object Type is as the hash table key. The database utilizes a mutex 264 to thread protect the hash table 262.

[0358] The OS layer 114 preferably provides a time management function. The OS layer 114 provides two sets of time-related functionality, API time services and an OS layer internal callback mechanism based on time. The API time services include os_gettime and os_delayMilliSec. The internal callback mechanism allows OS constructs to schedule callbacks based on time (milliseconds). This feature is used to provide their own time related services (for example, the “Put After Time” service provided by Message Queues).

[0359] Time management functionality within the OS layer is divided into two modules as follows:

[0360] OS_TimeMgr: contains the Time Manager (which provides callbacks, see below), and all OS independent API calls (os_getTime).

[0361] <os>_Time: contains the OS specific Timer used by the Time Manager (this object is typically OS dependent), and all OS dependent API calls (os_delayMilliSec).

[0362] The time manager object 266, as shown in FIG. 15, provides most of the time-relative functionality. The API os_getTime entry point is implemented returning the current OS Time (1 ms tick from start-up). It, also, provides the callback service utilized by other OS constructs to provide own time-relative functions. The callback feature allows time manager clients to schedule delayed function calls. They input a function reference, a parameter reference, and a delay. The time manager 266 invokes or “calls back” the function, supplying the indicated parameter, after the delay.

[0363] Callback functions provided to the time manager perform minimal processing in order to maintain timing integrity. Callback execution takes place in the context of the timer thread 270. Extended processing effects other callbacks. As such, complex operations must be handed off to another thread.

[0364] The time manager 266 uses two subordinates to provide this functionality:

[0365] CallBack List 272 is an ordered list of callback requests, earliest (soonest to expire) to latest. This list manages outstanding callbacks, and their information (function, parameter, etc.). The operations of the callback list 272 are to allocate entries 274, delete entries 274, add entries 274, remove entries 274 and to get next expire times.

[0366] Timer 268 provides an internal thread 270 that is woken up or scheduled based on callback delays. Specifically, the time manager 266 sets the timer 268 for the shortest callback delay. When the delay expires, the timer 268 signals the manager 266 to execute the callback. This cycle continues with the time manager 266 always scheduling the shortest delay in the timer 268. When the CallBack List 272 empties, the manager 266 sets the timer 268 for the minimum period required to detect underlying OS tick wrap conditions.

[0367] FIG. 16 illustrates a time manager control block functionality. The time manager control block 276 is associated with Muxs 278, 280 and a generic linked list 282. One of the Muxs is the OS system time MUX 278 and the other is a CallBack list Mux 280. The generic linked list 282 (CallBack List) has a time manager list entry 284. The time manager list entry has a Uint64 expire time CallBack function, a CallBack function reference, a CallBack parameter reference and a cancel ID.

[0368] FIG. 17 is a preferred flow diagram of a creation/initialization time manager scenario. The OS initiates the bring-up 286 of the time manager, 288. The time manager 266 sends an “os_createList(Os_Handle_T*handle_p)” message to empty the Call Back list, 290, 292. The time manager 266 sends an “os_createMux(Os_Handle_T*handle_p)” message to the system time Mux 278 so that a Mux is produced to protect the OS system time, 294, 296. The time manager 266 sends an “os_createMux(Os_Handle_T*handle_p) to the CallBack list Mux 280 so that a Mux is produced to protect the CallBack list, 298, 300.

[0369] The time manager 266 sends an “os_initTimer( )” message to the timer 268 to initialize the time, 302, 303. The timer initialization includes:

[0370] Determining underlying OS tick period.

[0371] Calculating ms/tick.

[0372] Determining the maximum timer value in ms, based on the OS tick period.

[0373] Reading the current OS tick and store it as the “Last Read OS System Tick”.

[0374] Creating the timer thread.

[0375] The time manager 266 initializes itself, 304, which includes setting the current Current OS system time value to 0×0. The manager 266 sends an “os_setTimer(max.timer period) message to the timer 268 so that the indicated timer is set (“Execute CallBacks” called after the indicated delay), 306, 308.

[0376] FIG. 18 is a preferred flow diagram of a get OS time time manager scenario. The OS API client 310 send an “os_getTimer( )” message to the time manager 266 to update the system time (“updateSystemTime( )”), 312, 314. The time manager 266 sends a lock Mux message (“os_lockMutex( )”) to the system time Mux 278, 316. A “os_getElapsedTime( )” message is sent to the timer 268 so that the time elapsed since the last time a call was initiated is determined, 318, 320. The determination includes reading the OS tick, calculating the time based on the current tick, last tick and the tick period, and storing the current tick as the last read tick.

[0377] The time manager 266 updates the current OS system time and adds the elapsed time to the current OS time, 322. A release Mux message (“os_releaseMutex( )”) is sent to the system time Mux 278, 324. The time manager 266 pulls the low word from the current OS system time to return (“Os_TimeMS_T”) and the time is returned to the OS API client 310(“return Os_TimeMS_T”), 326, 328.

[0378] FIG. 19 is a preferred flow diagram of a set CallBack time manager scenario. The time manager client 330 sends an “os_setCallBack” message to the time manager 266, 332. The time manager 266 calculates the CallBack expire time, 334. This calculation includes updating the system time and setting the CallBack time equal to the current system time plus a time delay.

[0379] The time manager 266 sends a loc Mux message (“os_lockMutex( )”) to the CallBack list Mux 280, 336. The manager 266 sends an allocate CallBack entry message (“Alloc CallBack Entry”) to the CallBack list 272, 338. The manager 266 fills in the CallBack Entry with “Expire Time”, “callback_fp”, “arg_p” and “Cancel ID=running cancel ID++”, 340.

[0380] The manager 266 sends an add callback list entry message (“Add CallBack List Entry”) to the CallBack list 272, 342. The CallBack list is preferably an ordered list based on the expire time (earliest and latest). An element is added to the list based on its expiration time. Of the entry is added to the head of the list (soonest to first callback entry), the callback timer is canceled and reset based on this delay. The time manager 266 sends a cancel timer message (“Cancel Timer( )”) to the timer 268, 344. The manager 268 also sends a set timer message (“Set Timer(delay time)”) to the timer 268, 346. The delay time is set to the smaller of the time to the next callback or the maximum timer period. The timer 268 sets the indicated timer (“Execute CallBacks” called after indicated delay), 348. The manager 266 sends a release Mux 350 to the CallBack list Mux 280, 350. The cancel ID is returned to the caller, 351. This occurs sometime after the callback delay expires, 352.

[0381] FIG. 20 is a preferred flow diagram of a cancel CallBack time manager scenario. The time manager client 330 sends a set CallBack message (“os_setCallBack”) to the time manager 266, 354. The time manager 266 schedules a CallBack with the timer active, 356. The time management client 330 sends a cancel CallBack message (“os_cancelCallBack”) to the time manager 266, 358. The manager 266 sends a lock Mux message (“os_lockMutex( )”) to the CallBack list Mutex 280, 360. The manager 266 sends a remove CallBack entry with cancel ID (“Remove CallBack Entry(cancelid)” to the CallBack list 272, 362. The Callback list 272 searches the list for an entry with the input cancel ID and if it fins one, it pulls the element from the list, 364.

[0382] The time manager 266 pulls the arg_p from the CallBack entry, 366. The manager deletes the CallBack entry, 368. A release Mux message (“os_releaseMutex 0”) is sent to the CallBack list Mux 280, 372 and an arg_p is returned to the caller, 370.

[0383] FIG. 21 is a preferred flow diagram of an execute CallBack time manager scenario. The processing illustrated in FIG. 21 is preferably performed in the timer thread. The timer 268 expires at the CallBack delay, 374. The timer executes a CallBack (“Execute CallBack( )”) to the time manager 266, 376.

[0384] A loop executes the CallBacks as follows, 378. The manager 266 updates the system timer (“updateSystemTime( )”), 380. The manager sends a lock Mux message (“os_lockMutex( )”) to the CallBack list Mux 280, 382. The manager 266 setermines if the CallBack is expired by checking the current time against the next expire time. If the current time is greater than the expire time, the following is performed, 384.

[0385] If the next CallBack expires, 386, a pull CallBack entry message is sent to the CallBack list 272, 388. Callback list Mux 280 is released before the callback function is invoked. It may schedule another callback during its execution (i.e. a callback that performs some processing that includes setting another callback). Other clients are allowed to add their requests during callback execution without blocking. The manager 266 sends a release Mux message (“os_releaseMutex( )”) to the CallBack list Mux 280, 390. A “callback_fp(arg_p)”) message is sent to the time manager client, 392. The manager 266 sends a delete CallBack entry message (“deleteCallBackEntry( )”) to the CallBack list 272, 394. The procedure loops back to step 380 until all the expired callbacks are completed, 398. The manager 266 sends a set timer message (“os_setTimer(next delay period)”) to the timer 268. The timer 268 sets the indicated timer (“Execute Callbacks” called after indicated delay), 400.

[0386] In the preferred embodiment, the timer 268 is replaced with an OS independent time manager thread. This thread is an OS API Thread and encapsulates both the timer (set, cancel, etc), and the “execute callback” functionality. Mapping from the code to the design:

[0387] “pauseCurrentThread”—Set Timer

[0388] “wakeCurrentThread”—Cancel Timer

[0389] “timeMgrMain”—Thread's main loop, includes Timer Thread and execute callbacks.

[0390] Inter-processor communication is primarily performed by an inter-processor message queue interface. The following details the preferred interface between the message queue module and the IPC module (IPC manager and QID database).

[0391] As shown in FIG. 22, the message queue 402 has the following IPC elements:

[0392] Message QID Database 408: Used to both register local message queues with the system, and to gain access to remote message queues.

[0393] IPC Manager 406: Remote message queue proxy forwards all “put” requests to its associate queue via the IPC Manager.

[0394] The Message Queue 402 forwards all remote operation to a remote message queue 404. The remote message queue transfers the messages to the IPC manager 406.

[0395] FIG. 23 is a flow diagram of message queue creation and destruction in context with inter-processor communication. A first processor has an associated message queue 4021, message QID database 4081 and IPC manager 4061. A second processor also has an associated message queue 4022, message QID database 4082 and IPC manager 4062. The first processor message queue 4021 receives a create massage, 410. A “qidd_registerMsgQ(qid, handle)” message is sent to the message QID database, 4081, 412. The database 4081 searches the local QID database, 414, the remote QID database, 416, and adds the QID to the local QID database with the QID and the handle, 418.

[0396] The queue is now available on the local (first) processor. The message QID database 4081 sends a “ipc_reportMsgQ(qid, local handle)” to the IPC manager 4061, 420. The manger 4061 sends a “IPC cmds to register Q (QID, and handle)” message across the processor boundary to the second processor IPC manager 4062, 422. The IPC manager 4062 sends a “qidd_registerRemoteMsgQ(qid, handle in remote context)” to the message QID database 4082, 424. The queue is now available to the remote (second) processor. The QID is added to the remote database 4082 with the QID and handle, 426.

[0397] The first processor message queue 4021 receive a destroy massage, 428. A “qidd_removeMsgQ(qid, handle)” message is sent to the message QID database, 4081, 430. The database 4081 searches the local QID database, 432, and removes the QID to the local QID database, 434.

[0398] The message QID database 4081 sends a “ipc_removeMsgQ(qid)” to the IPC manager 4061, 436. The manger 4061 sends a “IPC cmds to remove Q (QID)” message across the processor boundary to the second processor IPC manager 4062, 438. The IPC manager 4062 sends a “qidd_removeRemoteMsgQ(qid)” to the Message QID database 4082, 440. The queue is no longer available on the remote (second) processor. The message QID database 4082 removes the QID from the remote database, 442, and a destroy message proxy (“msgq_DestroyProxy( )”) is sent to the message queue, 444.

[0399] FIG. 24 is a flow diagram of message queue opening in context with inter-processor communication. The message queue 4021 receives an open message, 446. The message queue 4021 sends a “qiddb_getMsgQHandle(qid)” message to the message QID database 4081, 448. The message QID database searches the local QID database for the message registered locally and returns the message queue handle, 450. The local handle is returned.

[0400] At the remote (second processor), if the first remote is open, an open message is received by the message queue 4022, 452. The message queue 4022 sends a “qiddb_getMsgQHandle(qid)” to the message QID database 4082, 454. The message QID database 4082 searches the local QID database and the remote QID database, 456, 458. If the QID not found in the second processor database, it is created. The QID in the remote database is found, without a proxy handle. The CB is allocated for the proxy: QID, remote handle, and remote type. The proxy now exists. The proxy handle is returned to the caller (open). A create proxy message (“msgq_createProxy(QID, Remote Q_Handle)”) is sent to the message Queue 4022., 462, and a proxy is created, 462. The proxy handle is returned by the message QID database 4082, 464.

[0401] If all additional remotes are open, the open message is received by the message queue 4022, 466. The message queue 4022 sends a get message handle message (“qiddb_getMsgQHandle(qid)”) to the message QID database 4082. The message QID database 4082 searches the remote QID database, 470. If the QID is found in the local database with a proxy handle, the proxy handle is returned to the caller (open).

[0402] FIG. 25 is a flow diagram of message queue remote put in context with inter-processor communication. A put message (“Put(msg_p)”) is received by the message queue 4021, 474. The message queue pulls the handle from the MsgQ CB, 476. The “Type” is set to remote and the “handle” is set to Q handle in the remote processor's context. A put message (“Put(handle, msg_p”) is sent to the remote message queue (proxy) 4041, 478. The remote queue 4041 sends a “ipc_sendMsg(remote handle, msg_p)” message to the IPC manager 4061, 480. The IPC manager 4061 commands the message and handle across the processor boundary to the other IPC manager 4062, 482. The physical data movement occurs during IPC manager to IPC manger interaction. That IPC manager 4062 sends a “msgq_putMsgQ(handle, msg_p)” to the message queue 4022, 484. The message is put in the queue, 486 and processing of the local message queue proceeds.

[0403] The message QID database 488 is illustrated in FIG. 26. The message QID database 488 utilizes two lists to manage local 490 and remote queue 492 instances. The local database 490 stores QID and local handle for local queue instances. Similarly, the remote database 492 maintains QID, remote handle, and local proxy handle for remote queues.

[0404] The message queue interface registers the message queue by: verifying the queue does not exist in the system (local or remote), adding the queue to the local message queue database, and informing the remote database of this queue via the IPC manager (IPC report message queue).

[0405] To remove a message queue, the following is performed: deleting the queue from the local message queue database and removing the queue from the remote database via the IPC manager (IPC remove message queue). To get the message queue handle for a local queue, the local queue's handle is returned. For a remote queue, the remote queue's proxy handle is returned. If is does not exist, a proxy creation is triggered via the message queue module (Create Proxy).

[0406] To register a remote message queue, the following is performed: the IPC manager calls when it receives notification that a message queue was created on the opposite processor and the queue is added to the remote message queue database. A proxy is not created until the message queue is opened locally.

[0407] To register a message queue, the following is performed: the IPC Manager calls when it receives notification that a message queue was destroyed on the opposite processor and the queue is removed from the remote message queue database.

Claims

1. A method for exporting a software model to different operating systems, the method comprising: providing a software model; providing a porting layer, the porting layer porting the software model to an operating environment; providing an operating environment, the operating environment common to all the different operating systems; and providing a plurality of operating system abstraction layers, each abstraction layer designed to abstract the operating environment to at least one targeted operating system.

2. The method of claim 1 wherein the at least one targeted operating system is a single operating system.

3. The method of claim 1 wherein the at least one targeted operating system is two operating systems and the method for exporting a software model in a wireless device, a first of the two operating systems is a system operating system and a second of the two operating systems is a communication operating system.

4. The method of claim 3 wherein the system operating system operates on an advanced reduced instruction set processor (RISC) and the communication operating system operates on a digital signal processor (DSP).

5. The method of claim 3 wherein a communication module facilitates communication between the RISC and DSP.

6. The method of claim 5 wherein the communication module has an associated shared memory for use in performing operations of code derived from the software model.

7. The method of claim 1 wherein the at least one target operating system is a plurality of operating systems.

8. The method of claim 1 wherein the operating environment operates independently of processor boundaries.

9. The method of claim 7 wherein the operating system abstraction layer defines the processor boundaries and facilitates communication across the processor boundaries.

10. A wireless communication device comprising: at least one system processor and at least one communication processor; a communication module to facilitate communication between each system and communication processor; a shared memory associated with the communication module; each system processor and communication processor having an associated operating system, the operating system performing code generated from a software model, the software model being ported to an operating environment providing an operating environment, the operating environment common to all the different operating systems, an operating system abstraction layer abstracts the operating environment to each associated operating system.

11. The wireless communication device of claim 10 wherein the wireless communication device is a wireless transmit/receive unit.

12. The wireless communication device of claim 11 wherein the at least one system processor is a advanced reduced instruction set processor and the communication processor is a digital signal processor.

13. The wireless communication device of claim 10 wherein the operating environment operates independently of processor boundaries.

14. The wireless communication device of claim 13 wherein the operating system abstraction layer defines the processor boundaries and facilitates communication across the processor boundaries.

15. A method for porting software developed using a single threaded modeling tool to a multiple threaded environment, the method comprising: using the single threaded modeling tool to model the software; and providing a porting layer, the porting layer performing as follows: porting in variables into a multiple threaded operating environment by reference and not as variables so that each thread can access variables by reference.

16. The method of claim 15 wherein the single threaded modeling tool produces variables as global variables and not using the global variables in operation of a plurality of threads in the multiple threaded operating environment.

17. The method of claim 15 wherein the porting layer comprises a root process table having process description block entries, each process in the process description block entry having static variables.

18. The method of claim 15 wherein a modeling language used in the software development is SDL and the single threaded software tool is Telelogic Tau C-micro with light integration.

19. A wireless communication device comprising: at least one system processor and at least one communication processor; a communication module to facilitate communication between each system and communication processor; a shared memory associated with the communication module; each system processor and communication processor having an associated operating system, the operating system performing code generated from a software model, the software model developed using a single threaded modeling tool, a porting layer ports code generated by the single threaded modeling tool to a multiple threaded environment, the porting layer porting in variables into the multiple threaded operating environment by reference and not as variables so that each thread can access variables by reference.

20. The wireless communication device of claim 19 wherein the single threaded modeling tool produces variables as global variables and not using the global variables in operation of a plurality of threads in the multiple threaded operating environment.

21. The wireless communication device of claim 19 wherein the porting layer comprises a root process table having process description block entries, each process in the process description block entry having static variables.

22. The wireless communication device of claim 19 wherein a modeling language used in the software development is SDL and the single threaded software tool is Telelogic Tau C-micro with light integration.

23. The wireless communication device of claim 19 wherein the wireless communication device is a wireless transmit/receive unit.

24. A method for synchronizing a plurality or threads in a software environment, each thread being an independent path of execution, the method comprising: for a plurality of threads in a thread group requiring synchronization, initiating each of the plurality of threads; awaiting an initiation return from all the threads in the thread group indicating that the initiating of that thread is complete; and starting execution of all the threads in the thread group after the awaiting.

25. The method of claim 24 further comprising providing a plurality of synch threads, each synch thread initiating a thread in the group and starting execution of that thread.

26. The method of claim 25 further comprising providing a synch thread data table, the synch thread data table having a priority for each thread, an initialization function for each thread, an initialization argument for each thread, a reference to a main loop function for each thread and a main loop argument passed to be passed to each thread.

27. A wireless communication device comprising: at least one system processor and at least one communication processor; a communication module to facilitate communication between each system and communication processor; a shared memory associated with the communication module; each system processor and communication processor having an associated operating system, software operating on the operating system synchronizes a plurality of threads within a thread group in a software environment, each thread being an independent path of execution, for the plurality of threads in the thread group requiring synchronization, each of the plurality of threads is initiated; an initiation return is awaited from all the threads in the thread group indicating that the initiating of that thread is complete; and execution of all the threads in the thread group is started after the awaiting.

28. The wireless communication device of claim 27 wherein the software further operates by providing a plurality of synch threads, each synch thread initiating a thread in the group and starting execution of that thread.

29. The wireless communication device of claim 27 wherein the software further operates by providing a synch thread data table, the synch thread data table having a priority for each thread, an initialization function for each thread, an initialization argument for each thread, a reference to a main loop function for each thread and a main loop argument passed to be passed to each thread.

30. The wireless communication device of claim 27 wherein the wireless communication device is a wireless transmit/receive unit.

31. An operating system abstraction layer comprising: an interface with an operating environment, the operating environment operating independent of underlying operating systems; an operating system independent module for performing operations that are not related to a target operating system; an operating system dependent module for performing operations that are related to the target operating system; and an interface with the target operating system.

32. A method for abstracting an operating environment to a plurality of operating systems, the method comprising: providing an operating environment, the operating environment common to all the different operating systems; and providing a plurality of operating system abstraction layers, each abstraction layer designed to abstract the operating environment to at least one targeted operating system.

33. The method of claim 32 wherein each abstraction layer has a same operating system dependent module and a different operating system independent module.

34. A wireless communication device comprising: at least one system processor and at least one communication processor; a communication module to facilitate communication between each system and communication processor; a shared memory associated with the communication module; each system processor and communication processor having an associated operating system, the operating system performing code from an operating system abstraction layer, the abstraction layer interfacing with the operating environment and having an operating system independent module for performing operations that are not related to a target operating system and an operating system dependent module for performing operations that are related to the target operating system.

35. The wireless communication device of claim 34 wherein the wireless communication device is a wireless transmit/receive unit.

36. A method for controlling software timing in a multiple operating system environment, the method comprising: providing a time manager; operating system constructs in each of a plurality of operating systems sending callbacks to the time manger; after a time period specified by each call back, the time manager sending a callback message to the construct of that callback; and the construct operating in response to the received message.

37. The method of claim 36 wherein the time manager has an associated callback list, the associated call back list is an ordered list of callback time requests of the sent callbacks.

38. The method of claim 36 wherein the time manager has a timer, the timer has a plurality of threads that are waken up in response to expiration of callback time requests.

39. The method of claim 36 wherein the time manager has a timer, the timer scheduling a shortest callback delay and after expiration of the shortest callback delay, scheduling a next shortest callback delay.

40. A time manager for controlling software timing in a multiple operating system environment, the time manager comprising: an input configured to receive callbacks sent from operating system constructs in each of a plurality of operating systems; a timer for after a time period specified by each call back, producing a thread to indicate expiration of the callback to the construct of that callback.

41. The time manager of claim 40 wherein the timer scheduling a shortest callback delay and after expiration of the shortest callback delay, scheduling a next shortest callback delay.

42. A wireless communication device comprising: at least one system processor and at least one communication processor; a communication module to facilitate communication between each system and communication processor; a shared memory associated with the communication module; each system processor and communication processor having an associated operating system; and a time manager for controlling software timing in each operating system, the time manager comprising: an input configured to receive callbacks sent from operating system constructs in each of the plurality of operating systems; a timer for after a time period specified by each call back, producing a thread to indicate expiration of the callback to the construct of that callback.

43. The wireless communication device of claim 42 wherein the timer scheduling a shortest callback delay and after expiration of the shortest callback delay, scheduling a next shortest callback delay.

44. The wireless communication device of claim 42 wherein the wireless communication device is a wireless transmit/receive unit.

45. A method for software processes to communicate across processor boundaries, the method comprising: providing a local process associated with a local processor and a remote process associated with a remote processor: providing a local queue for the local process; providing or creating a remote queue for the remote process; the local process having a put request in the local queue indicating a message to be sent to the remote process; and putting the message in the remote queue.

46. A wireless communication device comprising: at least one system processor and at least one communication processor; a communication module to facilitate communication between each system and communication processor; a shared memory associated with the communication module; each system processor and communication processor having an associated operating system; a local process is associated with a local processor of the system and communication processors and a remote process associated with a remote processor of the system and communication processors; a local queue is associated with the local process; and a remote queue is associated with the remote process; and wherein the local process having a put request in the local queue indicating a message to be sent to the remote process; and putting the message in the remote queue.

47. The wireless communication device of claim 46 wherein the wireless communication device is a wireless transmit/receive unit.