pthread_mutex_timedlock.c 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189
  1. /*
  2. * pthread_mutex_timedlock.c
  3. *
  4. * Description:
  5. * This translation unit implements mutual exclusion (mutex) 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 <pte_osal.h>
  43. #include <stdio.h>
  44. #include <stdlib.h>
  45. #include "pthread.h"
  46. #include "implement.h"
  47. static int
  48. pte_timed_eventwait (pte_osSemaphoreHandle event, const struct timespec *abstime)
  49. /*
  50. * ------------------------------------------------------
  51. * DESCRIPTION
  52. * This function waits on an event until signaled or until
  53. * abstime passes.
  54. * If abstime has passed when this routine is called then
  55. * it returns a result to indicate this.
  56. *
  57. * If 'abstime' is a NULL pointer then this function will
  58. * block until it can successfully decrease the value or
  59. * until interrupted by a signal.
  60. *
  61. * This routine is not a cancelation point.
  62. *
  63. * RESULTS
  64. * 0 successfully signaled,
  65. * ETIMEDOUT abstime passed
  66. * EINVAL 'event' is not a valid event,
  67. *
  68. * ------------------------------------------------------
  69. */
  70. {
  71. unsigned int milliseconds;
  72. pte_osResult status;
  73. int retval;
  74. if (abstime == NULL)
  75. {
  76. status = pte_osSemaphorePend(event, NULL);
  77. }
  78. else
  79. {
  80. /*
  81. * Calculate timeout as milliseconds from current system time.
  82. */
  83. milliseconds = pte_relmillisecs (abstime);
  84. status = pte_osSemaphorePend(event, &milliseconds);
  85. }
  86. if (status == PTE_OS_TIMEOUT)
  87. {
  88. retval = ETIMEDOUT;
  89. }
  90. else
  91. {
  92. retval = 0;
  93. }
  94. return retval;
  95. } /* pte_timed_semwait */
  96. int
  97. pthread_mutex_timedlock (pthread_mutex_t * mutex,
  98. const struct timespec *abstime)
  99. {
  100. int result;
  101. pthread_mutex_t mx;
  102. /*
  103. * Let the system deal with invalid pointers.
  104. */
  105. /*
  106. * We do a quick check to see if we need to do more work
  107. * to initialise a static mutex. We check
  108. * again inside the guarded section of pte_mutex_check_need_init()
  109. * to avoid race conditions.
  110. */
  111. if (*mutex >= PTHREAD_ERRORCHECK_MUTEX_INITIALIZER)
  112. {
  113. if ((result = pte_mutex_check_need_init (mutex)) != 0)
  114. {
  115. return (result);
  116. }
  117. }
  118. mx = *mutex;
  119. if (mx->kind == PTHREAD_MUTEX_NORMAL)
  120. {
  121. if (PTE_ATOMIC_EXCHANGE(&mx->lock_idx,1) != 0)
  122. {
  123. while (PTE_ATOMIC_EXCHANGE(&mx->lock_idx,-1) != 0)
  124. {
  125. if (0 != (result = pte_timed_eventwait (mx->handle, abstime)))
  126. {
  127. return result;
  128. }
  129. }
  130. }
  131. }
  132. else
  133. {
  134. pthread_t self = pthread_self();
  135. if (PTE_ATOMIC_COMPARE_EXCHANGE(&mx->lock_idx,1,0) == 0)
  136. {
  137. mx->recursive_count = 1;
  138. mx->ownerThread = self;
  139. }
  140. else
  141. {
  142. if (pthread_equal (mx->ownerThread, self))
  143. {
  144. if (mx->kind == PTHREAD_MUTEX_RECURSIVE)
  145. {
  146. mx->recursive_count++;
  147. }
  148. else
  149. {
  150. return EDEADLK;
  151. }
  152. }
  153. else
  154. {
  155. while (PTE_ATOMIC_EXCHANGE(&mx->lock_idx,-1) != 0)
  156. {
  157. if (0 != (result = pte_timed_eventwait (mx->handle, abstime)))
  158. {
  159. return result;
  160. }
  161. }
  162. mx->recursive_count = 1;
  163. mx->ownerThread = self;
  164. }
  165. }
  166. }
  167. return 0;
  168. }