Blog

Protect the shared predicate with a mutex, test it while holding that mutex, and wait in a loop that rechecks it after every return. A condition-variable signal tells a waiter to reconsider shared state. It does not reserve an item or prove that the state is still suitable when the waiter regains the mutex. This…

portMAX_DELAY is not a universal “forever” argument. In FreeRTOS Kernel V11.1.0, an ordinary queue wait can treat it as indefinite when INCLUDE_vTaskSuspend is enabled. A delay call does not necessarily use that interpretation. Check the API path, effective configuration and selected port’s tick type together. This article focuses on that sentinel decision in upstream V11.1.0….

xQueueReset() empties the queue’s stored-item state, but it is not a cancellation request to every task using that queue. In FreeRTOS Kernel V11.1.0 it can unblock a pending sender, which may immediately repopulate the queue. A reset call returning successfully therefore does not prove that no old producer can publish afterward. This guide examines ordinary…

When no application task reaches its entry point, locate the last completed startup dependency before changing priorities or enlarging every stack. Creating application tasks is only part of startup: the kernel must also create its idle task and, when enabled, the timer-service infrastructure before handing control to the processor port. This procedure uses upstream FreeRTOS…

A recursive mutex becomes available to another task only after its owner has matched every successful recursive take with a recursive give. Audit that balance along complete call paths, including callbacks and early returns. A log containing an “unlock” entry does not prove the outermost owner released the mutex. The concrete implementation here is FreeRTOS…

A repeated barrier needs a policy for a participant that times out, skips a cycle or arrives after everyone else has abandoned it. xEventGroupSync() combines setting arrival bits with waiting for a mask; those bits do not carry a cycle number. Once a rendezvous can be abandoned, define how the application prevents arrivals from different…

A successful xQueuePeek() copies the current head item without removing it. It does not reserve that item for the caller. If work must be processed exactly once by one consumer, perform the successful receive that claims the item before taking an irreversible action. This article targets FreeRTOS Kernel V11.1.0 ordinary queues. It examines peek/receive ordering,…

Use xQueueOverwrite() only with a queue created to hold exactly one item. It replaces that slot even when occupied; it is not a general operation that removes the oldest member of a longer queue. Make the length-one restriction part of the mailbox’s construction contract, then test both replacement and consumption order. This guide targets upstream…