pthread_mutex_lock.c 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
  1. /*
  2. * pthread_mutex_lock.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 <stdio.h>
  43. #include <stdlib.h>
  44. #include "pthread.h"
  45. #include "implement.h"
  46. int
  47. pthread_mutex_lock (pthread_mutex_t * mutex)
  48. {
  49. int result = 0;
  50. pthread_mutex_t mx;
  51. /*
  52. * Let the system deal with invalid pointers.
  53. */
  54. if (*mutex == NULL)
  55. {
  56. return EINVAL;
  57. }
  58. /*
  59. * We do a quick check to see if we need to do more work
  60. * to initialise a static mutex. We check
  61. * again inside the guarded section of pte_mutex_check_need_init()
  62. * to avoid race conditions.
  63. */
  64. if (*mutex >= PTHREAD_ERRORCHECK_MUTEX_INITIALIZER)
  65. {
  66. if ((result = pte_mutex_check_need_init (mutex)) != 0)
  67. {
  68. return (result);
  69. }
  70. }
  71. mx = *mutex;
  72. if (mx->kind == PTHREAD_MUTEX_NORMAL)
  73. {
  74. if (PTE_ATOMIC_EXCHANGE(
  75. &mx->lock_idx,
  76. 1) != 0)
  77. {
  78. while (PTE_ATOMIC_EXCHANGE(&mx->lock_idx,-1) != 0)
  79. {
  80. if (pte_osSemaphorePend(mx->handle,NULL) != PTE_OS_OK)
  81. {
  82. result = EINVAL;
  83. break;
  84. }
  85. }
  86. }
  87. }
  88. else
  89. {
  90. pthread_t self = pthread_self();
  91. if (PTE_ATOMIC_COMPARE_EXCHANGE(&mx->lock_idx,1,0) == 0)
  92. {
  93. mx->recursive_count = 1;
  94. mx->ownerThread = self;
  95. }
  96. else
  97. {
  98. if (pthread_equal (mx->ownerThread, self))
  99. {
  100. if (mx->kind == PTHREAD_MUTEX_RECURSIVE)
  101. {
  102. mx->recursive_count++;
  103. }
  104. else
  105. {
  106. result = EDEADLK;
  107. }
  108. }
  109. else
  110. {
  111. while (PTE_ATOMIC_EXCHANGE(&mx->lock_idx,-1) != 0)
  112. {
  113. if (pte_osSemaphorePend(mx->handle,NULL) != PTE_OS_OK)
  114. {
  115. result = EINVAL;
  116. break;
  117. }
  118. }
  119. if (0 == result)
  120. {
  121. mx->recursive_count = 1;
  122. mx->ownerThread = self;
  123. }
  124. }
  125. }
  126. }
  127. return (result);
  128. }