nptl/pthread_mutex_trylock.c

   1 /* Copyright (C) 2002-2014 Free Software Foundation, Inc.
   2    This file is part of the GNU C Library.
   3    Contributed by Ulrich Drepper <drepper@redhat.com>, 2002.
   4
   5    The GNU C Library is free software; you can redistribute it and/or
   6    modify it under the terms of the GNU Lesser General Public
   7    License as published by the Free Software Foundation; either
   8    version 2.1 of the License, or (at your option) any later version.
   9
  10    The GNU C Library is distributed in the hope that it will be useful,
  11    but WITHOUT ANY WARRANTY; without even the implied warranty of
  12    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13    Lesser General Public License for more details.
  14
  15    You should have received a copy of the GNU Lesser General Public
  16    License along with the GNU C Library; if not, see
  17    <http://www.gnu.org/licenses/>.  */
  18
  19 #include <assert.h>
  20 #include <errno.h>
  21 #include <stdlib.h>
  22 #include "pthreadP.h"
  23 #include <lowlevellock.h>
  24
  25 #ifndef lll_trylock_elision
  26 #define lll_trylock_elision(a,t) lll_trylock(a)
  27 #endif
  28
  29 #ifndef DO_ELISION
  30 #define DO_ELISION(m) 0
  31 #endif
  32
  33 /* We don't force elision in trylock, because this can lead to inconsistent
  34    lock state if the lock was actually busy.  */
  35
  36 int
  37 __pthread_mutex_trylock (mutex)
  38      pthread_mutex_t *mutex;
  39 {
  40   int oldval;
  41   pid_t id = THREAD_GETMEM (THREAD_SELF, tid);
  42
  43   switch (__builtin_expect (PTHREAD_MUTEX_TYPE_ELISION (mutex),
  44                             PTHREAD_MUTEX_TIMED_NP))
  45     {
  46       /* Recursive mutex.  */
  47     case PTHREAD_MUTEX_RECURSIVE_NP|PTHREAD_MUTEX_ELISION_NP:
  48     case PTHREAD_MUTEX_RECURSIVE_NP:
  49       /* Check whether we already hold the mutex.  */
  50       if (mutex->__data.__owner == id)
  51         {
  52           /* Just bump the counter.  */
  53           if (__glibc_unlikely (mutex->__data.__count + 1 == 0))
  54             /* Overflow of the counter.  */
  55             return EAGAIN;
  56
  57           ++mutex->__data.__count;
  58           return 0;
  59         }
  60
  61       if (lll_trylock (mutex->__data.__lock) == 0)
  62         {
  63           /* Record the ownership.  */
  64           mutex->__data.__owner = id;
  65           mutex->__data.__count = 1;
  66           ++mutex->__data.__nusers;
  67           return 0;
  68         }
  69       break;
  70
  71     case PTHREAD_MUTEX_TIMED_ELISION_NP:
  72     elision:
  73       if (lll_trylock_elision (mutex->__data.__lock,
  74                                mutex->__data.__elision) != 0)
  75         break;
  76       /* Don't record the ownership.  */
  77       return 0;
  78
  79     case PTHREAD_MUTEX_TIMED_NP:
  80       if (DO_ELISION (mutex))
  81         goto elision;
  82       /*FALL THROUGH*/
  83     case PTHREAD_MUTEX_ADAPTIVE_NP:
  84     case PTHREAD_MUTEX_ERRORCHECK_NP:
  85       if (lll_trylock (mutex->__data.__lock) != 0)
  86         break;
  87
  88       /* Record the ownership.  */
  89       mutex->__data.__owner = id;
  90       ++mutex->__data.__nusers;
  91
  92       return 0;
  93
  94     case PTHREAD_MUTEX_ROBUST_RECURSIVE_NP:
  95     case PTHREAD_MUTEX_ROBUST_ERRORCHECK_NP:
  96     case PTHREAD_MUTEX_ROBUST_NORMAL_NP:
  97     case PTHREAD_MUTEX_ROBUST_ADAPTIVE_NP:
  98       THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending,
  99                      &mutex->__data.__list.__next);
 100
 101       oldval = mutex->__data.__lock;
 102       do
 103         {
 104         again:
 105           if ((oldval & FUTEX_OWNER_DIED) != 0)
 106             {
 107               /* The previous owner died.  Try locking the mutex.  */
 108               int newval = id | (oldval & FUTEX_WAITERS);
 109
 110               newval
 111                 = atomic_compare_and_exchange_val_acq (&mutex->__data.__lock,
 112                                                        newval, oldval);
 113
 114               if (newval != oldval)
 115                 {
 116                   oldval = newval;
 117                   goto again;
 118                 }
 119
 120               /* We got the mutex.  */
 121               mutex->__data.__count = 1;
 122               /* But it is inconsistent unless marked otherwise.  */
 123               mutex->__data.__owner = PTHREAD_MUTEX_INCONSISTENT;
 124
 125               ENQUEUE_MUTEX (mutex);
 126               THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending, NULL);
 127
 128               /* Note that we deliberately exist here.  If we fall
 129                  through to the end of the function __nusers would be
 130                  incremented which is not correct because the old
 131                  owner has to be discounted.  */
 132               return EOWNERDEAD;
 133             }
 134
 135           /* Check whether we already hold the mutex.  */
 136           if (__glibc_unlikely ((oldval & FUTEX_TID_MASK) == id))
 137             {
 138               int kind = PTHREAD_MUTEX_TYPE (mutex);
 139               if (kind == PTHREAD_MUTEX_ROBUST_ERRORCHECK_NP)
 140                 {
 141                   THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending,
 142                                  NULL);
 143                   return EDEADLK;
 144                 }
 145
 146               if (kind == PTHREAD_MUTEX_ROBUST_RECURSIVE_NP)
 147                 {
 148                   THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending,
 149                                  NULL);
 150
 151                   /* Just bump the counter.  */
 152                   if (__glibc_unlikely (mutex->__data.__count + 1 == 0))
 153                     /* Overflow of the counter.  */
 154                     return EAGAIN;
 155
 156                   ++mutex->__data.__count;
 157
 158                   return 0;
 159                 }
 160             }
 161
 162           oldval = atomic_compare_and_exchange_val_acq (&mutex->__data.__lock,
 163                                                         id, 0);
 164           if (oldval != 0 && (oldval & FUTEX_OWNER_DIED) == 0)
 165             {
 166               THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending, NULL);
 167
 168               return EBUSY;
 169             }
 170
 171           if (__builtin_expect (mutex->__data.__owner
 172                                 == PTHREAD_MUTEX_NOTRECOVERABLE, 0))
 173             {
 174               /* This mutex is now not recoverable.  */
 175               mutex->__data.__count = 0;
 176               if (oldval == id)
 177                 lll_unlock (mutex->__data.__lock,
 178                             PTHREAD_ROBUST_MUTEX_PSHARED (mutex));
 179               THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending, NULL);
 180               return ENOTRECOVERABLE;
 181             }
 182         }
 183       while ((oldval & FUTEX_OWNER_DIED) != 0);
 184
 185       ENQUEUE_MUTEX (mutex);
 186       THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending, NULL);
 187
 188       mutex->__data.__owner = id;
 189       ++mutex->__data.__nusers;
 190       mutex->__data.__count = 1;
 191
 192       return 0;
 193
 194     case PTHREAD_MUTEX_PI_RECURSIVE_NP:
 195     case PTHREAD_MUTEX_PI_ERRORCHECK_NP:
 196     case PTHREAD_MUTEX_PI_NORMAL_NP:
 197     case PTHREAD_MUTEX_PI_ADAPTIVE_NP:
 198     case PTHREAD_MUTEX_PI_ROBUST_RECURSIVE_NP:
 199     case PTHREAD_MUTEX_PI_ROBUST_ERRORCHECK_NP:
 200     case PTHREAD_MUTEX_PI_ROBUST_NORMAL_NP:
 201     case PTHREAD_MUTEX_PI_ROBUST_ADAPTIVE_NP:
 202       {
 203         int kind = mutex->__data.__kind & PTHREAD_MUTEX_KIND_MASK_NP;
 204         int robust = mutex->__data.__kind & PTHREAD_MUTEX_ROBUST_NORMAL_NP;
 205
 206         if (robust)
 207           /* Note: robust PI futexes are signaled by setting bit 0.  */
 208           THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending,
 209                          (void *) (((uintptr_t) &mutex->__data.__list.__next)
 210                                    | 1));
 211
 212         oldval = mutex->__data.__lock;
 213
 214         /* Check whether we already hold the mutex.  */
 215         if (__glibc_unlikely ((oldval & FUTEX_TID_MASK) == id))
 216           {
 217             if (kind == PTHREAD_MUTEX_ERRORCHECK_NP)
 218               {
 219                 THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending, NULL);
 220                 return EDEADLK;
 221               }
 222
 223             if (kind == PTHREAD_MUTEX_RECURSIVE_NP)
 224               {
 225                 THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending, NULL);
 226
 227                 /* Just bump the counter.  */
 228                 if (__glibc_unlikely (mutex->__data.__count + 1 == 0))
 229                   /* Overflow of the counter.  */
 230                   return EAGAIN;
 231
 232                 ++mutex->__data.__count;
 233
 234                 return 0;
 235               }
 236           }
 237
 238         oldval
 239           = atomic_compare_and_exchange_val_acq (&mutex->__data.__lock,
 240                                                  id, 0);
 241
 242         if (oldval != 0)
 243           {
 244             if ((oldval & FUTEX_OWNER_DIED) == 0)
 245               {
 246                 THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending, NULL);
 247
 248                 return EBUSY;
 249               }
 250
 251             assert (robust);
 252
 253             /* The mutex owner died.  The kernel will now take care of
 254                everything.  */
 255             int private = (robust
 256                            ? PTHREAD_ROBUST_MUTEX_PSHARED (mutex)
 257                            : PTHREAD_MUTEX_PSHARED (mutex));
 258             INTERNAL_SYSCALL_DECL (__err);
 259             int e = INTERNAL_SYSCALL (futex, __err, 4, &mutex->__data.__lock,
 260                                       __lll_private_flag (FUTEX_TRYLOCK_PI,
 261                                                           private), 0, 0);
 262
 263             if (INTERNAL_SYSCALL_ERROR_P (e, __err)
 264                 && INTERNAL_SYSCALL_ERRNO (e, __err) == EWOULDBLOCK)
 265               {
 266                 THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending, NULL);
 267
 268                 return EBUSY;
 269               }
 270
 271             oldval = mutex->__data.__lock;
 272           }
 273
 274         if (__glibc_unlikely (oldval & FUTEX_OWNER_DIED))
 275           {
 276             atomic_and (&mutex->__data.__lock, ~FUTEX_OWNER_DIED);
 277
 278             /* We got the mutex.  */
 279             mutex->__data.__count = 1;
 280             /* But it is inconsistent unless marked otherwise.  */
 281             mutex->__data.__owner = PTHREAD_MUTEX_INCONSISTENT;
 282
 283             ENQUEUE_MUTEX (mutex);
 284             THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending, NULL);
 285
 286             /* Note that we deliberately exit here.  If we fall
 287                through to the end of the function __nusers would be
 288                incremented which is not correct because the old owner
 289                has to be discounted.  */
 290             return EOWNERDEAD;
 291           }
 292
 293         if (robust
 294             && __builtin_expect (mutex->__data.__owner
 295                                  == PTHREAD_MUTEX_NOTRECOVERABLE, 0))
 296           {
 297             /* This mutex is now not recoverable.  */
 298             mutex->__data.__count = 0;
 299
 300             INTERNAL_SYSCALL_DECL (__err);
 301             INTERNAL_SYSCALL (futex, __err, 4, &mutex->__data.__lock,
 302                               __lll_private_flag (FUTEX_UNLOCK_PI,
 303                                                   PTHREAD_ROBUST_MUTEX_PSHARED (mutex)),
 304                               0, 0);
 305
 306             THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending, NULL);
 307             return ENOTRECOVERABLE;
 308           }
 309
 310         if (robust)
 311           {
 312             ENQUEUE_MUTEX_PI (mutex);
 313             THREAD_SETMEM (THREAD_SELF, robust_head.list_op_pending, NULL);
 314           }
 315
 316         mutex->__data.__owner = id;
 317         ++mutex->__data.__nusers;
 318         mutex->__data.__count = 1;
 319
 320         return 0;
 321       }
 322
 323     case PTHREAD_MUTEX_PP_RECURSIVE_NP:
 324     case PTHREAD_MUTEX_PP_ERRORCHECK_NP:
 325     case PTHREAD_MUTEX_PP_NORMAL_NP:
 326     case PTHREAD_MUTEX_PP_ADAPTIVE_NP:
 327       {
 328         int kind = mutex->__data.__kind & PTHREAD_MUTEX_KIND_MASK_NP;
 329
 330         oldval = mutex->__data.__lock;
 331
 332         /* Check whether we already hold the mutex.  */
 333         if (mutex->__data.__owner == id)
 334           {
 335             if (kind == PTHREAD_MUTEX_ERRORCHECK_NP)
 336               return EDEADLK;
 337
 338             if (kind == PTHREAD_MUTEX_RECURSIVE_NP)
 339               {
 340                 /* Just bump the counter.  */
 341                 if (__glibc_unlikely (mutex->__data.__count + 1 == 0))
 342                   /* Overflow of the counter.  */
 343                   return EAGAIN;
 344
 345                 ++mutex->__data.__count;
 346
 347                 return 0;
 348               }
 349           }
 350
 351         int oldprio = -1, ceilval;
 352         do
 353           {
 354             int ceiling = (oldval & PTHREAD_MUTEX_PRIO_CEILING_MASK)
 355                           >> PTHREAD_MUTEX_PRIO_CEILING_SHIFT;
 356
 357             if (__pthread_current_priority () > ceiling)
 358               {
 359                 if (oldprio != -1)
 360                   __pthread_tpp_change_priority (oldprio, -1);
 361                 return EINVAL;
 362               }
 363
 364             int retval = __pthread_tpp_change_priority (oldprio, ceiling);
 365             if (retval)
 366               return retval;
 367
 368             ceilval = ceiling << PTHREAD_MUTEX_PRIO_CEILING_SHIFT;
 369             oldprio = ceiling;
 370
 371             oldval
 372               = atomic_compare_and_exchange_val_acq (&mutex->__data.__lock,
 373                                                      ceilval | 1, ceilval);
 374
 375             if (oldval == ceilval)
 376               break;
 377           }
 378         while ((oldval & PTHREAD_MUTEX_PRIO_CEILING_MASK) != ceilval);
 379
 380         if (oldval != ceilval)
 381           {
 382             __pthread_tpp_change_priority (oldprio, -1);
 383             break;
 384           }
 385
 386         assert (mutex->__data.__owner == 0);
 387         /* Record the ownership.  */
 388         mutex->__data.__owner = id;
 389         ++mutex->__data.__nusers;
 390         mutex->__data.__count = 1;
 391
 392         return 0;
 393       }
 394       break;
 395
 396     default:
 397       /* Correct code cannot set any other type.  */
 398       return EINVAL;
 399     }
 400
 401   return EBUSY;
 402 }
 403
 404 #ifndef __pthread_mutex_trylock
 405 #ifndef pthread_mutex_trylock
 406 strong_alias (__pthread_mutex_trylock, pthread_mutex_trylock)
 407 #endif
 408 #endif