pthread_barrier_wait.c 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101
  1. /*
  2. * pthread_barrier_wait.c
  3. *
  4. * Description:
  5. * This translation unit implements barrier 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 "pthread.h"
  43. #include "implement.h"
  44. int
  45. pthread_barrier_wait (pthread_barrier_t * barrier)
  46. {
  47. int result;
  48. int step;
  49. pthread_barrier_t b;
  50. if (barrier == NULL || *barrier == (pthread_barrier_t) PTE_OBJECT_INVALID)
  51. {
  52. return EINVAL;
  53. }
  54. b = *barrier;
  55. step = b->iStep;
  56. if (0 == PTE_ATOMIC_DECREMENT ((int *) &(b->nCurrentBarrierHeight)))
  57. {
  58. /* Must be done before posting the semaphore. */
  59. b->nCurrentBarrierHeight = b->nInitialBarrierHeight;
  60. /*
  61. * There is no race condition between the semaphore wait and post
  62. * because we are using two alternating semas and all threads have
  63. * entered barrier_wait and checked nCurrentBarrierHeight before this
  64. * barrier's sema can be posted. Any threads that have not quite
  65. * entered sem_wait below when the multiple_post has completed
  66. * will nevertheless continue through the semaphore (barrier)
  67. * and will not be left stranded.
  68. */
  69. result = (b->nInitialBarrierHeight > 1
  70. ? sem_post_multiple (&(b->semBarrierBreeched[step]),
  71. b->nInitialBarrierHeight - 1) : 0);
  72. }
  73. else
  74. {
  75. /*
  76. * Use the non-cancelable version of sem_wait().
  77. */
  78. result = sem_wait (&(b->semBarrierBreeched[step]));
  79. // result = sem_wait_nocancel (&(b->semBarrierBreeched[step]));
  80. }
  81. /*
  82. * The first thread across will be the PTHREAD_BARRIER_SERIAL_THREAD.
  83. * This also sets up the alternate semaphore as the next barrier.
  84. */
  85. if (0 == result)
  86. {
  87. result = (step ==
  88. PTE_ATOMIC_COMPARE_EXCHANGE (& (b->iStep),(1L - step),step) ?
  89. PTHREAD_BARRIER_SERIAL_THREAD : 0);
  90. }
  91. return (result);
  92. }