 
                            pthread_cond_wait() and pthread_cond_timedwait() take a condition variable and locked mutex as arguments. These functions unlock the mutex until the condition variable is signaled and then re-lock relock the mutex before returning. While a thread is waiting on a particular condition variable and mutex, other threads may only wait on the same condition variable if they also pass the same mutex as an argument. This requirement is noted in the Open Group Base Specifications, Issue 6:
...as As long as at least one thread is blocked on the condition variable. During this time, the effect of an attempt by any thread to wait on that condition variable using a different mutex is undefined.
It also specifies that pthread_cond_wait() “may†may€ fail if:
[EINVAL]
The value specified by cond or mutex is invalid.
[EPERM]
The mutex was not owned by the current thread at the time of the call.
...
In this noncompliant code example, mutex1 protects count1 and mutex2 protects count2. A race condition exists between the waiter1 and waiter2 threads since because they use the same condition variable with different mutexes. If both threads attempt to call pthread_cond_wait() at the same time, one thread will succeed and the other thread will invoke undefined behavior.
...
When the system is built on the following platform,
Red Hat Enterprise Linux Client release 5.5 (Tikanga)
kernel 2.6.18
gcc 4.3.5 with the --D_GNU_SOURCE flag
the above preceding code works as expected. Waiter1 waiter1 and waiter2 increment the variable once they are signaled, and the correct mutex is acquired after pthread_cond_wait returns in each thread.
The man page for pthread_cond_wait on this configuration says that it “may†may€ fail with a return value of EINVAL if “different "different mutexes were supplied for concurrent pthread_cond_timedwait() or pthread_cond_wait() operations on the same condition variable.†" However, this does not happen.
...
When the system is built on the following platform,
OS X 10.6.4 (Snow Leopard)
gcc 4.2.1
pthread_cond_wait() returns EINVAL if it is called when another thread is waiting on the condition variable with a different mutex. This is arguably better since because it forces the coder to fix the problem instead of allowing reliance on undefined behavior.
The man page for pthread_cond_wait()}] simply says that {{EINVAL will be returned if “the "the value specified by cond or the value specified by mutex is invalid,†" but it doesn’t doesn't say what invalid means.
Compliant Solution
This problem can either be solved either by always using the same mutex whenever a particular condition variable is used or by using separate condition variables, depending on how the code is expected to work. Here we will use the “same mutex†€œsame-mutex€ solution.
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| pthread_mutex_t mutex1; /* initialized as PTHREAD_MUTEX_ERRORCHECK */
pthread_cond_t cv;
int count1 = 0, count2 = 0;
void *waiter1() {
  int ret;
  while (count1 < COUNT_LIMIT) {
    if ((ret = pthread_mutex_lock(&mutex1)) != 0) {
      /* handle error */
    }
    if ((ret = pthread_cond_wait(&cv, &mutex1)) != 0) {
      /* handle error */
    }
    printf("count1 = %d\n", ++count1);
    if ((ret = pthread_mutex_unlock(&mutex1)) != 0) {
      /* handle error */
    }
  }
  return NULL;
}
void *waiter2() {
  int ret;
  while (count2 < COUNT_LIMIT) {
    if ((ret = pthread_mutex_lock(&mutex1)) != 0) {
      /* handle error */
    }
    if ((ret = pthread_cond_wait(&cv, &mutex1)) != 0) {
      /* handle error */
    }
    printf("count2 = %d\n", ++count2);
    if ((ret = pthread_mutex_unlock(&mutex1)) != 0) {
      /* handle error */
    }
  }
  return NULL;
}
 | 
...
Waiting on the same condition variable with two different mutexes could cause a thread to be signaled and resume execution with the wrong mutex locked. This It could lead to unexpected program behavior if the same shared data were simultaneously accessed by two threads.
Therefore, the The severity is medium because improperly accessing shared data could lead to data integrity violation. Likelihood is probable because in such an implementation, an error code would not be returned, and remediation cost is high because detection and correction of this problem are both manual.
| Rule | Severity | Likelihood | Remediation Cost | Priority | Level | 
|---|---|---|---|---|---|
| POS53-C | medium | probable | high | P4 | L3 | 
...
Sources
[Open Group 2004] pthread_cond_timedwait()/pthread_cond_wait()
...