Tasks are implemented as simple forever loops in functions that never return. Context switching is accomplished with setjmp()/longjmp(). Each task must make promises as regards how much stack it will ever need. Instrumentation is provided to check for stack overflows in user supplied code. Also the utility function 'StackInfo' is provided to assess the aftermath of library calls.alphabetic index hierarchy of classes
Copyright © 1996
Eliot W. Dudley
All rights reserved.
|
generated by doc++