Mutexes are used to prevent multiple threads from causing a data race by accessing the same shared resource at the same time. Sometimes, when locking mutexes, multiple threads hold each other's lock, and the program consequently deadlocks. Four conditions are required for deadlock to occur:
- Mutual mutual exclusion (at At least one nonshareable resource must be held.),
- Hold hold and wait (a A thread must hold a resource while awaiting availability of another resource.),
- No no preemption (resources Resources cannot be taken away from a thread while they are in-use.), and
- Circular circular wait (a A thread must await a resource held by another thread which is, in turn, awaiting a resource held by the first thread.).
Deadlock needs all four conditions, so preventing deadlock requires preventing any one of the four conditions. One simple solution is to lock the mutexes in a predefined order, which prevents circular wait.
...
This compliant solution uses Standard Template Library facilities to ensure that deadlock does not occur due to circular wait conditions. The std::lock()
function takes a variable number of lockable objects and attempts to lock them such that deadlock does not occur [ISO/IEC 14882-2014]. In typical implementations, this is done by using a combination of lock()
, try_lock()
, and unlock()
to attempt to lock the object and backing off if the lock is not acquired, which may have worse performance than a solution that locks in predefined order explicitly.
Code Block | ||||
---|---|---|---|---|
| ||||
#include <mutex> #include <thread> class BankAccount { int balance; public: std::mutex balanceMutex; BankAccount() = delete; explicit BankAccount(int initialAmount) : balance(initialAmount) {} int get_balance() const { return balance; } void set_balance(int amount) { balance = amount; } }; int deposit(BankAccount *from, BankAccount *to, int amount) { // Create lock objects but defer locking them until later. std::unique_lock<std::mutex> lk1(from->balanceMutex, std::defer_lock); std::unique_lock<std::mutex> lk2(to->balanceMutex, std::defer_lock); // Lock allboth of the lock objects simultaneously. std::lock(lk1, lk2); if (from->get_balance() >= amount) { from->set_balance(from->get_balance() - amount); to->set_balance(to->get_balance() + amount); return 0; } return -1; } void f(BankAccount *ba1, BankAccount *ba2) { // Perform the deposits. std::thread thr1(deposit, ba1, ba2, 100); std::thread thr2(deposit, ba2, ba1, 100); thr1.join(); thr2.join(); } |
...
Deadlock prevents multiple threads from progressing, halting program execution. A denial-of-service attack is possible if the attacker can create the conditions for deadlock.
Rule | Severity | Likelihood | Remediation Cost | Priority | Level |
---|---|---|---|---|---|
CON53-CPP | Low | Probable | Medium | P4 | L3 |
Automated Detection
Tool | Version | Checker | Description | ||||||
---|---|---|---|---|---|---|---|---|---|
CodeSonar |
| CONCURRENCY.LOCK.ORDER | Conflicting lock order | ||||||
Coverity | 6.5 | DEADLOCK | Fully implemented | ||||||
Helix QAC |
| C++1772, C++1773 | |||||||
Parasoft C/C++test |
| CERT_CPP-CON53-a | Do not acquire locks in different order | |||||||
Polyspace Bug Finder |
| CERT C++: CON53-CPP | Checks for deadlocks |
Related Vulnerabilities
Search for vulnerabilities resulting from the violation of this rule on the CERT website.
Related Guidelines
CERT Oracle Secure Coding Standard for Java | LCK07-J. Avoid deadlock by requesting and releasing locks in the same order |
MITRE CWE | CWE-764, Multiple Locks of a Critical Resource |
Bibliography
[ISO/IEC 14882-2014] | Subclause 30.4, "Mutual Exclusion" |
...