Bird
Raised Fist0
FreeRTOSprogramming~7 mins

Recursive mutex for nested locking in FreeRTOS

Choose your learning style10 modes available
Introduction

A recursive mutex lets a task lock the same mutex multiple times without causing a deadlock. This helps when a function calls another function that also locks the same mutex.

When a task needs to enter multiple functions that each lock the same mutex.
When you want to avoid deadlocks caused by the same task locking a mutex it already owns.
When you have nested function calls that share resources protected by the same mutex.
When you want to keep your code modular but still protect shared data safely.
Syntax
FreeRTOS
/* Create a recursive mutex */
SemaphoreHandle_t xRecursiveMutex = xSemaphoreCreateRecursiveMutex();

/* Lock the recursive mutex */
if (xSemaphoreTakeRecursive(xRecursiveMutex, portMAX_DELAY) == pdTRUE) {
    // Critical section
    xSemaphoreGiveRecursive(xRecursiveMutex); // Unlock
}

Use xSemaphoreCreateRecursiveMutex() to create a recursive mutex.

Use xSemaphoreTakeRecursive() and xSemaphoreGiveRecursive() to lock and unlock recursively.

Examples
This shows locking the same recursive mutex twice in a row and unlocking twice. This is allowed and safe.
FreeRTOS
SemaphoreHandle_t xRecursiveMutex = xSemaphoreCreateRecursiveMutex();

// Lock once
xSemaphoreTakeRecursive(xRecursiveMutex, portMAX_DELAY);

// Lock again (nested)
xSemaphoreTakeRecursive(xRecursiveMutex, portMAX_DELAY);

// Unlock once
xSemaphoreGiveRecursive(xRecursiveMutex);

// Unlock second time
xSemaphoreGiveRecursive(xRecursiveMutex);
Unlocking a recursive mutex without locking it first is a mistake and can cause errors.
FreeRTOS
// Edge case: Unlocking without locking first
SemaphoreHandle_t xRecursiveMutex = xSemaphoreCreateRecursiveMutex();
xSemaphoreGiveRecursive(xRecursiveMutex); // Incorrect usage, may cause error
Locking and unlocking once is the simplest use case.
FreeRTOS
// Edge case: Single lock and unlock
SemaphoreHandle_t xRecursiveMutex = xSemaphoreCreateRecursiveMutex();
xSemaphoreTakeRecursive(xRecursiveMutex, portMAX_DELAY);
xSemaphoreGiveRecursive(xRecursiveMutex);
Always check if the mutex was created successfully before using it.
FreeRTOS
// Edge case: Empty mutex handle
SemaphoreHandle_t xRecursiveMutex = NULL;
if (xRecursiveMutex != NULL) {
    xSemaphoreTakeRecursive(xRecursiveMutex, portMAX_DELAY);
    xSemaphoreGiveRecursive(xRecursiveMutex);
} else {
    // Handle error: mutex not created
}
Sample Program

This program creates a recursive mutex and a task that locks it multiple times recursively. It prints messages when locking and unlocking at each level.

FreeRTOS
#include "FreeRTOS.h"
#include "semphr.h"
#include "task.h"
#include <stdio.h>

SemaphoreHandle_t xRecursiveMutex;

void nestedFunction(int level) {
    if (xSemaphoreTakeRecursive(xRecursiveMutex, portMAX_DELAY) == pdTRUE) {
        printf("Locked mutex at level %d\n", level);
        if (level < 3) {
            nestedFunction(level + 1); // Recursive nested locking
        }
        xSemaphoreGiveRecursive(xRecursiveMutex);
        printf("Unlocked mutex at level %d\n", level);
    }
}

void vTaskFunction(void *pvParameters) {
    printf("Task started\n");
    nestedFunction(1);
    printf("Task finished\n");
    vTaskDelete(NULL);
}

int main(void) {
    xRecursiveMutex = xSemaphoreCreateRecursiveMutex();
    if (xRecursiveMutex == NULL) {
        printf("Failed to create recursive mutex\n");
        return 1;
    }

    xTaskCreate(vTaskFunction, "Task", configMINIMAL_STACK_SIZE, NULL, tskIDLE_PRIORITY + 1, NULL);
    vTaskStartScheduler();

    // Should never reach here
    return 0;
}
OutputSuccess
Important Notes

Time complexity: Locking and unlocking a recursive mutex is O(1).

Space complexity: Uses small fixed memory for the mutex handle.

Common mistake: Forgetting to unlock the mutex the same number of times it was locked causes deadlocks.

Use recursive mutexes only when nested locking is needed; otherwise, use normal mutexes for better performance.

Summary

Recursive mutexes allow the same task to lock the mutex multiple times safely.

Use xSemaphoreTakeRecursive() and xSemaphoreGiveRecursive() to lock and unlock.

Always unlock the mutex the same number of times it was locked to avoid deadlocks.

Practice

(1/5)
1.

What is the main advantage of using a recursive mutex in FreeRTOS?

easy
A. It increases the priority of the task holding the mutex.
B. It automatically unlocks after a fixed time.
C. It allows the same task to lock the mutex multiple times without deadlock.
D. It can be shared between tasks without any locking.

Solution

  1. Step 1: Understand mutex behavior

    Normal mutexes block if the same task tries to lock again, causing deadlock.
  2. Step 2: Role of recursive mutex

    Recursive mutexes allow the same task to lock multiple times safely, avoiding deadlock.
  3. Final Answer:

    It allows the same task to lock the mutex multiple times without deadlock. -> Option C
  4. Quick Check:

    Recursive mutex = multiple locks by same task [OK]
Hint: Recursive mutex lets one task lock repeatedly safely [OK]
Common Mistakes:
  • Thinking mutex unlocks automatically
  • Confusing recursive mutex with priority inheritance
  • Assuming mutex can be shared without locking
2.

Which FreeRTOS function is used to lock a recursive mutex?

SemaphoreHandle_t xMutex = xSemaphoreCreateRecursiveMutex();
// Lock the mutex here
easy
A. xSemaphoreTakeRecursive(xMutex, portMAX_DELAY);
B. xSemaphoreGiveRecursive(xMutex);
C. xSemaphoreTake(xMutex, portMAX_DELAY);
D. xSemaphoreCreateMutex();

Solution

  1. Step 1: Identify locking function for recursive mutex

    Recursive mutexes require xSemaphoreTakeRecursive() to lock safely multiple times.
  2. Step 2: Match function usage

    xSemaphoreTakeRecursive(xMutex, portMAX_DELAY) locks the recursive mutex properly.
  3. Final Answer:

    xSemaphoreTakeRecursive(xMutex, portMAX_DELAY); -> Option A
  4. Quick Check:

    Lock recursive mutex = xSemaphoreTakeRecursive() [OK]
Hint: Use xSemaphoreTakeRecursive() to lock recursive mutex [OK]
Common Mistakes:
  • Using xSemaphoreTake() instead of recursive version
  • Confusing give and take functions
  • Trying to create mutex again instead of locking
3.

What will be the output of the following FreeRTOS code snippet?

SemaphoreHandle_t xMutex = xSemaphoreCreateRecursiveMutex();

void Task(void *params) {
    xSemaphoreTakeRecursive(xMutex, portMAX_DELAY);
    xSemaphoreTakeRecursive(xMutex, portMAX_DELAY);
    xSemaphoreGiveRecursive(xMutex);
    xSemaphoreGiveRecursive(xMutex);
    if (xSemaphoreGiveRecursive(xMutex) == pdFALSE) {
        printf("Mutex fully released\n");
    } else {
        printf("Mutex still locked\n");
    }
}
medium
A. Mutex fully released
B. Mutex still locked
C. Compilation error
D. Deadlock occurs

Solution

  1. Step 1: Count lock and unlock calls

    The mutex is locked twice and unlocked twice, so it is fully released after two gives.
  2. Step 2: Analyze extra unlock call

    The third give returns pdFALSE because mutex is already fully released, triggering "Mutex fully released" print.
  3. Final Answer:

    Mutex fully released -> Option A
  4. Quick Check:

    Extra unlock returns false = fully released [OK]
Hint: Unlock same times as lock to fully release mutex [OK]
Common Mistakes:
  • Assuming extra unlock succeeds
  • Ignoring return value of xSemaphoreGiveRecursive()
  • Thinking deadlock occurs on unlock
4.

Identify the error in this FreeRTOS recursive mutex usage:

SemaphoreHandle_t xMutex = xSemaphoreCreateRecursiveMutex();

void Task(void *params) {
    xSemaphoreTakeRecursive(xMutex, portMAX_DELAY);
    // Some code
    xSemaphoreGive(xMutex);
}
medium
A. Not locking the mutex before unlocking.
B. Using xSemaphoreGive() instead of xSemaphoreGiveRecursive() to unlock.
C. Creating mutex inside the task instead of globally.
D. Using portMAX_DELAY as timeout.

Solution

  1. Step 1: Check unlock function for recursive mutex

    Recursive mutexes must be unlocked with xSemaphoreGiveRecursive(), not xSemaphoreGive().
  2. Step 2: Identify mismatch in lock/unlock

    Using xSemaphoreGive() causes undefined behavior or errors because it is for normal mutexes.
  3. Final Answer:

    Using xSemaphoreGive() instead of xSemaphoreGiveRecursive() to unlock. -> Option B
  4. Quick Check:

    Unlock recursive mutex = xSemaphoreGiveRecursive() [OK]
Hint: Unlock recursive mutex with xSemaphoreGiveRecursive() only [OK]
Common Mistakes:
  • Mixing normal and recursive mutex functions
  • Ignoring correct unlock function
  • Assuming portMAX_DELAY causes error here
5.

You have a recursive mutex locked three times by the same task. What must you do to avoid deadlock when unlocking?

// Pseudocode
xSemaphoreTakeRecursive(xMutex, portMAX_DELAY);
xSemaphoreTakeRecursive(xMutex, portMAX_DELAY);
xSemaphoreTakeRecursive(xMutex, portMAX_DELAY);
// ... critical section ...
// Unlock here
hard
A. Call xSemaphoreTakeRecursive() again to balance locks.
B. Call xSemaphoreGiveRecursive() once to release the mutex fully.
C. Call xSemaphoreGive() three times to release the mutex.
D. Call xSemaphoreGiveRecursive() exactly three times before releasing the mutex.

Solution

  1. Step 1: Understand recursive mutex lock count

    Each lock increments a count; unlocking must decrement the same number of times.
  2. Step 2: Proper unlock calls

    To fully release, call xSemaphoreGiveRecursive() three times matching the three locks.
  3. Final Answer:

    Call xSemaphoreGiveRecursive() exactly three times before releasing the mutex. -> Option D
  4. Quick Check:

    Unlock count = lock count to avoid deadlock [OK]
Hint: Unlock recursive mutex as many times as locked [OK]
Common Mistakes:
  • Unlocking fewer times causing deadlock
  • Using xSemaphoreGive() instead of recursive version
  • Trying to unlock more times than locked
Recommended

Ready to prove it?

Pass the test and this pattern moves unknown strong while earning +1 Grip toward your certificate.

10 questions~5 mineasy hard