sem_post_multiple.c 3.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142
  1. /*
  2. * -------------------------------------------------------------
  3. *
  4. * Module: sem_post_multiple.c
  5. *
  6. * Purpose:
  7. * Semaphores aren't actually part of the PThreads standard.
  8. * They are defined by the POSIX Standard:
  9. *
  10. * POSIX 1003.1b-1993 (POSIX.1b)
  11. *
  12. * -------------------------------------------------------------
  13. *
  14. * --------------------------------------------------------------------------
  15. *
  16. * Pthreads-win32 - POSIX Threads Library for Win32
  17. * Copyright(C) 1998 John E. Bossom
  18. * Copyright(C) 1999,2005 Pthreads-win32 contributors
  19. *
  20. * Contact Email: [email protected]
  21. *
  22. * The current list of contributors is contained
  23. * in the file CONTRIBUTORS included with the source
  24. * code distribution. The list can also be seen at the
  25. * following World Wide Web location:
  26. * http://sources.redhat.com/pthreads-win32/contributors.html
  27. *
  28. * This library is free software; you can redistribute it and/or
  29. * modify it under the terms of the GNU Lesser General Public
  30. * License as published by the Free Software Foundation; either
  31. * version 2 of the License, or (at your option) any later version.
  32. *
  33. * This library is distributed in the hope that it will be useful,
  34. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  35. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  36. * Lesser General Public License for more details.
  37. *
  38. * You should have received a copy of the GNU Lesser General Public
  39. * License along with this library in the file COPYING.LIB;
  40. * if not, write to the Free Software Foundation, Inc.,
  41. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
  42. */
  43. #include "pthread.h"
  44. #include "semaphore.h"
  45. #include "implement.h"
  46. int
  47. sem_post_multiple (sem_t * sem, int count)
  48. /*
  49. * ------------------------------------------------------
  50. * DOCPUBLIC
  51. * This function posts multiple wakeups to a semaphore.
  52. *
  53. * PARAMETERS
  54. * sem
  55. * pointer to an instance of sem_t
  56. *
  57. * count
  58. * counter, must be greater than zero.
  59. *
  60. * DESCRIPTION
  61. * This function posts multiple wakeups to a semaphore. If there
  62. * are waiting threads (or processes), n <= count are awakened;
  63. * the semaphore value is incremented by count - n.
  64. *
  65. * RESULTS
  66. * 0 successfully posted semaphore,
  67. * -1 failed, error in errno
  68. * ERRNO
  69. * EINVAL 'sem' is not a valid semaphore
  70. * or count is less than or equal to zero.
  71. * ERANGE semaphore count is too big
  72. *
  73. * ------------------------------------------------------
  74. */
  75. {
  76. int result = 0;
  77. long waiters;
  78. sem_t s = *sem;
  79. if (s == NULL || count <= 0)
  80. {
  81. result = EINVAL;
  82. }
  83. else if ((result = pthread_mutex_lock (&s->lock)) == 0)
  84. {
  85. /* See sem_destroy.c
  86. */
  87. if (*sem == NULL)
  88. {
  89. (void) pthread_mutex_unlock (&s->lock);
  90. result = EINVAL;
  91. return -1;
  92. }
  93. if (s->value <= (SEM_VALUE_MAX - count))
  94. {
  95. waiters = -s->value;
  96. s->value += count;
  97. if (waiters > 0)
  98. {
  99. #if defined(NEED_SEM)
  100. if (SetEvent(s->sem))
  101. {
  102. waiters--;
  103. s->leftToUnblock += count - 1;
  104. if (s->leftToUnblock > waiters)
  105. {
  106. s->leftToUnblock = waiters;
  107. }
  108. }
  109. #else
  110. if (ReleaseSemaphore (s->sem, (waiters<=count)?waiters:count, 0))
  111. {
  112. /* No action */
  113. }
  114. #endif
  115. else
  116. {
  117. s->value -= count;
  118. result = EINVAL;
  119. }
  120. }
  121. }
  122. else
  123. {
  124. result = ERANGE;
  125. }
  126. (void) pthread_mutex_unlock (&s->lock);
  127. }
  128. if (result != 0)
  129. {
  130. errno = result;
  131. return -1;
  132. }
  133. return 0;
  134. } /* sem_post_multiple */