
SCIOPTA - Real-Time Kernel
5-4 Manual Version 4.1 User’s Manual
SCIOPTA - Real-Time Kernel
5 Processes
For process scheduling SCIOPTA uses a combination of the module priority and process priority called effective
priority. The kernel determines the effective priority as follows:
Effective Priority = Module Priority + Process Priority
See also chapter 4.3 “Module Priority” on page 4-1.
5.6.3 Writing Prioritized Processes
5.6.3.1 Process Declaration Syntax
All prioritized processes in SCIOPTA must contain the following declaration:
SC_PROCESS (<proc_name>)
{
for (;;)
{
/* Code for process <proc_name> */
}
}
5.6.3.2 Process Template
#include <sciopta.h> /* SCIOPTA standard prototypes and definitions */
SC_PROCESS (proc_name) /* Declaration for prioritized process proc_name */
{
/* Local variables */
/* Process initialization code */
for (;;) /* “for-ever”-loop declaration. */
{ /* A SCIOPTA prioritized process may never return */
/* It is an error to terminate a prioritized process */
/* If a prioritized process terminates and returns */
/* the SCIOPTA kernel will produce an error condition */
/* and call the SCIOPTA error hook */
/* Code for process proc_name */
}
}
Comentários a estes Manuais