equeue | A Swiss Army knife scheduler for embedded systems | Job Scheduling library

The in-depth documentation on specific functions can be found in equeue.h. The core of the equeue library is the equeue_t type which represents a single event queue, and the equeue_dispatch function which runs the equeue, providing the context for executing events. On top of this, equeue_call, equeue_call_in, and equeue_call_every provide easy methods for posting events to execute in the context of the equeue_dispatch function. In addition to simple callbacks, an event can be manually allocated with equeue_alloc and posted with equeue_post to allow passing an arbitrary amount of context to the execution of the event. This memory is allocated out of the equeue's buffer, and dynamic memory can be completely avoided. The equeue allocator is designed to minimize jitter in interrupt contexts as well as avoid memory fragmentation on small devices. The allocator achieves both constant-runtime and zero-fragmentation for fixed-size events, however grows linearly as the quantity of differently-sized allocations increases. Additionally, in-flight events can be cancelled with equeue_cancel. Events are given unique ids on post, allowing safe cancellation of expired events. From an architectural standpoint, event queues easily align with module boundaries, where internal state can be implicitly synchronized through event dispatch. On platforms where multiple threads are unavailable, multiple modules can use independent event queues and still be composed through the equeue_chain function.