pthread_rwlock_timedwrlock.c 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139
  1. /*
  2. * pthread_rwlock_timedwrlock.c
  3. *
  4. * Description:
  5. * This translation unit implements read/write lock primitives.
  6. *
  7. * --------------------------------------------------------------------------
  8. *
  9. * Pthreads-win32 - POSIX Threads Library for Win32
  10. * Copyright(C) 1998 John E. Bossom
  11. * Copyright(C) 1999,2005 Pthreads-win32 contributors
  12. *
  13. * Contact Email: [email protected]
  14. *
  15. * The current list of contributors is contained
  16. * in the file CONTRIBUTORS included with the source
  17. * code distribution. The list can also be seen at the
  18. * following World Wide Web location:
  19. * http://sources.redhat.com/pthreads-win32/contributors.html
  20. *
  21. * This library is free software; you can redistribute it and/or
  22. * modify it under the terms of the GNU Lesser General Public
  23. * License as published by the Free Software Foundation; either
  24. * version 2 of the License, or (at your option) any later version.
  25. *
  26. * This library is distributed in the hope that it will be useful,
  27. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  28. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  29. * Lesser General Public License for more details.
  30. *
  31. * You should have received a copy of the GNU Lesser General Public
  32. * License along with this library in the file COPYING.LIB;
  33. * if not, write to the Free Software Foundation, Inc.,
  34. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
  35. */
  36. #include <limits.h>
  37. #include "pthread.h"
  38. #include "implement.h"
  39. int
  40. pthread_rwlock_timedwrlock (pthread_rwlock_t * rwlock,
  41. const struct timespec *abstime)
  42. {
  43. int result;
  44. pthread_rwlock_t rwl;
  45. if (rwlock == NULL || *rwlock == NULL)
  46. {
  47. return EINVAL;
  48. }
  49. /*
  50. * We do a quick check to see if we need to do more work
  51. * to initialise a static rwlock. We check
  52. * again inside the guarded section of ptw32_rwlock_check_need_init()
  53. * to avoid race conditions.
  54. */
  55. if (*rwlock == PTHREAD_RWLOCK_INITIALIZER)
  56. {
  57. result = ptw32_rwlock_check_need_init (rwlock);
  58. if (result != 0 && result != EBUSY)
  59. {
  60. return result;
  61. }
  62. }
  63. rwl = *rwlock;
  64. if (rwl->nMagic != PTW32_RWLOCK_MAGIC)
  65. {
  66. return EINVAL;
  67. }
  68. if ((result =
  69. pthread_mutex_timedlock (&(rwl->mtxExclusiveAccess), abstime)) != 0)
  70. {
  71. return result;
  72. }
  73. if ((result =
  74. pthread_mutex_timedlock (&(rwl->mtxSharedAccessCompleted),
  75. abstime)) != 0)
  76. {
  77. (void) pthread_mutex_unlock (&(rwl->mtxExclusiveAccess));
  78. return result;
  79. }
  80. if (rwl->nExclusiveAccessCount == 0)
  81. {
  82. if (rwl->nCompletedSharedAccessCount > 0)
  83. {
  84. rwl->nSharedAccessCount -= rwl->nCompletedSharedAccessCount;
  85. rwl->nCompletedSharedAccessCount = 0;
  86. }
  87. if (rwl->nSharedAccessCount > 0)
  88. {
  89. rwl->nCompletedSharedAccessCount = -rwl->nSharedAccessCount;
  90. /*
  91. * This routine may be a cancelation point
  92. * according to POSIX 1003.1j section 18.1.2.
  93. */
  94. #if defined(_MSC_VER) && _MSC_VER < 1400
  95. #pragma inline_depth(0)
  96. #endif
  97. pthread_cleanup_push (ptw32_rwlock_cancelwrwait, (void *) rwl);
  98. do
  99. {
  100. result =
  101. pthread_cond_timedwait (&(rwl->cndSharedAccessCompleted),
  102. &(rwl->mtxSharedAccessCompleted),
  103. abstime);
  104. }
  105. while (result == 0 && rwl->nCompletedSharedAccessCount < 0);
  106. pthread_cleanup_pop ((result != 0) ? 1 : 0);
  107. #if defined(_MSC_VER) && _MSC_VER < 1400
  108. #pragma inline_depth()
  109. #endif
  110. if (result == 0)
  111. {
  112. rwl->nSharedAccessCount = 0;
  113. }
  114. }
  115. }
  116. if (result == 0)
  117. {
  118. rwl->nExclusiveAccessCount++;
  119. }
  120. return result;
  121. }