pthread_rwlock_timedwrlock.c 4.0 KB

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