 |
Contiki-NG
|
|
Contiki-NG
|
Protothreads are a type of lightweight stackless threads designed for severly memory constrained systems such as deeply embedded systems or sensor network nodes. More...
Modules | |
| Local continuations | |
| Local continuations form the basis for implementing protothreads. | |
| Protothread semaphores | |
| This module implements counting semaphores on top of protothreads. | |
Files | |
| file | pt.h |
| Protothreads implementation. | |
Initialization | |
| #define | PT_INIT(pt) |
| Initialize a protothread. More... | |
Declaration and definition | |
| #define | PT_THREAD(name_args) |
| Declaration of a protothread. More... | |
| #define | PT_BEGIN(pt) |
| Declare the start of a protothread inside the C function implementing the protothread. More... | |
| #define | PT_END(pt) |
| Declare the end of a protothread. More... | |
Blocked wait | |
| #define | PT_WAIT_UNTIL(pt, condition) |
| Block and wait until condition is true. More... | |
| #define | PT_WAIT_WHILE(pt, cond) |
| Block and wait while condition is true. More... | |
Hierarchical protothreads | |
| #define | PT_WAIT_THREAD(pt, thread) |
| Block and wait until a child protothread completes. More... | |
| #define | PT_SPAWN(pt, child, thread) |
| Spawn a child protothread and wait until it exits. More... | |
Exiting and restarting | |
| #define | PT_RESTART(pt) |
| Restart the protothread. More... | |
| #define | PT_EXIT(pt) |
| Exit the protothread. More... | |
Calling a protothread | |
| #define | PT_SCHEDULE(f) |
| Schedule a protothread. More... | |
Yielding from a protothread | |
| #define | PT_YIELD(pt) |
| Yield from the current protothread. More... | |
| #define | PT_YIELD_UNTIL(pt, cond) |
| Yield from the protothread until a condition occurs. More... | |
Protothreads are a type of lightweight stackless threads designed for severly memory constrained systems such as deeply embedded systems or sensor network nodes.
Protothreads provides linear code execution for event-driven systems implemented in C. Protothreads can be used with or without an RTOS.
Protothreads are a extremely lightweight, stackless type of threads that provides a blocking context on top of an event-driven system, without the overhead of per-thread stacks. The purpose of protothreads is to implement sequential flow of control without complex state machines or full multi-threading. Protothreads provides conditional blocking inside C functions.
The advantage of protothreads over a purely event-driven approach is that protothreads provides a sequential code structure that allows for blocking functions. In purely event-driven systems, blocking must be implemented by manually breaking the function into two pieces - one for the piece of code before the blocking call and one for the code after the blocking call. This makes it hard to use control structures such as if() conditionals and while() loops.
The advantage of protothreads over ordinary threads is that a protothread does not require a separate stack. In memory constrained systems, the overhead of allocating multiple stacks can consume large amounts of the available memory. In contrast, each protothread only requires between two and twelve bytes of state, depending on the architecture.
Main features:
Examples applications:
The protothreads API consists of four basic operations: initialization: PT_INIT(), execution: PT_BEGIN(), conditional blocking: PT_WAIT_UNTIL() and exit: PT_END(). On top of these, two convenience functions are built: reversed condition blocking: PT_WAIT_WHILE() and protothread blocking: PT_WAIT_THREAD().
The protothreads library is released under a BSD-style license that allows for both non-commercial and commercial usage. The only requirement is that credit is given.
The protothreads library was written by Adam Dunkels adam@.nosp@m.sics.nosp@m..se with support from Oliver Schmidt ol.sc.nosp@m.@web.nosp@m..de.
Protothreads are a extremely lightweight, stackless threads that provides a blocking context on top of an event-driven system, without the overhead of per-thread stacks. The purpose of protothreads is to implement sequential flow of control without using complex state machines or full multi-threading. Protothreads provides conditional blocking inside a C function.
In memory constrained systems, such as deeply embedded systems, traditional multi-threading may have a too large memory overhead. In traditional multi-threading, each thread requires its own stack, that typically is over-provisioned. The stacks may use large parts of the available memory.
The main advantage of protothreads over ordinary threads is that protothreads are very lightweight: a protothread does not require its own stack. Rather, all protothreads run on the same stack and context switching is done by stack rewinding. This is advantageous in memory constrained systems, where a stack for a thread might use a large part of the available memory. A protothread only requires only two bytes of memory per protothread. Moreover, protothreads are implemented in pure C and do not require any machine-specific assembler code.
A protothread runs within a single C function and cannot span over other functions. A protothread may call normal C functions, but cannot block inside a called function. Blocking inside nested function calls is instead made by spawning a separate protothread for each potentially blocking function. The advantage of this approach is that blocking is explicit: the programmer knows exactly which functions that block that which functions the never blocks.
Protothreads are similar to asymmetric co-routines. The main difference is that co-routines uses a separate stack for each co-routine, whereas protothreads are stackless. The most similar mechanism to protothreads are Python generators. These are also stackless constructs, but have a different purpose. Protothreads provides blocking contexts inside a C function, whereas Python generators provide multiple exit points from a generator function.
A protothread is driven by repeated calls to the function in which the protothread is running. Each time the function is called, the protothread will run until it blocks or exits. Thus the scheduling of protothreads is done by the application that uses protothreads.
Protothreads are implemented using local continuations. A local continuation represents the current state of execution at a particular place in the program, but does not provide any call history or local variables. A local continuation can be set in a specific function to capture the state of the function. After a local continuation has been set can be resumed in order to restore the state of the function at the point where the local continuation was set.
Local continuations can be implemented in a variety of ways:
The first way works by saving and restoring the processor state, except for stack pointers, and requires between 16 and 32 bytes of memory per protothread. The exact amount of memory required depends on the architecture.
The standard C implementation requires only two bytes of state per protothread and utilizes the C switch() statement in a non-obvious way that is similar to Duff's device. This implementation does, however, impose a slight restriction to the code that uses protothreads in that the code cannot use switch() statements itself.
Certain compilers has C extensions that can be used to implement protothreads. GCC supports label pointers that can be used for this purpose. With this implementation, protothreads require 4 bytes of RAM per protothread.
| PT_BEGIN | ( | pt | ) |
Declare the start of a protothread inside the C function implementing the protothread.
This macro is used to declare the starting point of a protothread. It should be placed at the start of the function in which the protothread runs. All C statements above the PT_BEGIN() invokation will be executed each time the protothread is scheduled.
| pt | A pointer to the protothread control structure. |
| PT_END | ( | pt | ) |
Declare the end of a protothread.
This macro is used for declaring that a protothread ends. It must always be used together with a matching PT_BEGIN() macro.
| pt | A pointer to the protothread control structure. |
| #define PT_EXIT | ( | pt | ) |
| #define PT_INIT | ( | pt | ) |
Initialize a protothread.
Initializes a protothread. Initialization must be done prior to starting to execute the protothread.
| pt | A pointer to the protothread control structure. |
| #define PT_RESTART | ( | pt | ) |
Restart the protothread.
This macro will block and cause the running protothread to restart its execution at the place of the PT_BEGIN() call.
| pt | A pointer to the protothread control structure. |
| #define PT_SCHEDULE | ( | f | ) |
| #define PT_SPAWN | ( | pt, | |
| child, | |||
| thread | |||
| ) |
Spawn a child protothread and wait until it exits.
This macro spawns a child protothread and waits until it exits. The macro can only be used within a protothread.
| pt | A pointer to the protothread control structure. |
| child | A pointer to the child protothread's control structure. |
| thread | The child protothread with arguments |
| #define PT_THREAD | ( | name_args | ) |
| #define PT_WAIT_THREAD | ( | pt, | |
| thread | |||
| ) |
Block and wait until a child protothread completes.
This macro schedules a child protothread. The current protothread will block until the child protothread completes.
| pt | A pointer to the protothread control structure. |
| thread | The child protothread with arguments |
| #define PT_WAIT_UNTIL | ( | pt, | |
| condition | |||
| ) |
| #define PT_WAIT_WHILE | ( | pt, | |
| cond | |||
| ) |
Block and wait while condition is true.
This function blocks and waits while condition is true. See PT_WAIT_UNTIL().
| pt | A pointer to the protothread control structure. |
| cond | The condition. |
| #define PT_YIELD | ( | pt | ) |
1.9.4