barrier5.c 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118
  1. /*
  2. * barrier5.c
  3. *
  4. *
  5. * --------------------------------------------------------------------------
  6. *
  7. * Pthreads-win32 - POSIX Threads Library for Win32
  8. * Copyright(C) 1998 John E. Bossom
  9. * Copyright(C) 1999,2005 Pthreads-win32 contributors
  10. *
  11. * Contact Email: [email protected]
  12. *
  13. * The current list of contributors is contained
  14. * in the file CONTRIBUTORS included with the source
  15. * code distribution. The list can also be seen at the
  16. * following World Wide Web location:
  17. * http://sources.redhat.com/pthreads-win32/contributors.html
  18. *
  19. * This library is free software; you can redistribute it and/or
  20. * modify it under the terms of the GNU Lesser General Public
  21. * License as published by the Free Software Foundation; either
  22. * version 2 of the License, or (at your option) any later version.
  23. *
  24. * This library is distributed in the hope that it will be useful,
  25. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  26. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  27. * Lesser General Public License for more details.
  28. *
  29. * You should have received a copy of the GNU Lesser General Public
  30. * License along with this library in the file COPYING.LIB;
  31. * if not, write to the Free Software Foundation, Inc.,
  32. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
  33. *
  34. * --------------------------------------------------------------------------
  35. *
  36. * Set up a series of barriers at different heights and test various numbers
  37. * of threads accessing, especially cases where there are more threads than the
  38. * barrier height (count), i.e. test contention when the barrier is released.
  39. */
  40. #include "test.h"
  41. enum {
  42. NUMTHREADS = 15,
  43. HEIGHT = 10,
  44. BARRIERMULTIPLE = 1000
  45. };
  46. pthread_barrier_t barrier = NULL;
  47. pthread_mutex_t mx = PTHREAD_MUTEX_INITIALIZER;
  48. LONG totalThreadCrossings;
  49. void *
  50. func(void * crossings)
  51. {
  52. int result;
  53. int serialThreads = 0;
  54. while ((LONG)(size_t)crossings >= (LONG)InterlockedIncrement((LPLONG)&totalThreadCrossings))
  55. {
  56. result = pthread_barrier_wait(&barrier);
  57. if (result == PTHREAD_BARRIER_SERIAL_THREAD)
  58. {
  59. serialThreads++;
  60. }
  61. else if (result != 0)
  62. {
  63. printf("Barrier failed: result = %s\n", error_string[result]);
  64. fflush(stdout);
  65. return NULL;
  66. }
  67. }
  68. return (void*)(size_t)serialThreads;
  69. }
  70. int
  71. main()
  72. {
  73. int i, j;
  74. void* result;
  75. int serialThreadsTotal;
  76. LONG Crossings;
  77. pthread_t t[NUMTHREADS + 1];
  78. for (j = 1; j <= NUMTHREADS; j++)
  79. {
  80. int height = j<HEIGHT?j:HEIGHT;
  81. totalThreadCrossings = 0;
  82. Crossings = height * BARRIERMULTIPLE;
  83. printf("Threads=%d, Barrier height=%d\n", j, height);
  84. assert(pthread_barrier_init(&barrier, NULL, height) == 0);
  85. for (i = 1; i <= j; i++)
  86. {
  87. assert(pthread_create(&t[i], NULL, func, (void *)(size_t)Crossings) == 0);
  88. }
  89. serialThreadsTotal = 0;
  90. for (i = 1; i <= j; i++)
  91. {
  92. assert(pthread_join(t[i], &result) == 0);
  93. serialThreadsTotal += (int)(size_t)result;
  94. }
  95. assert(serialThreadsTotal == BARRIERMULTIPLE);
  96. assert(pthread_barrier_destroy(&barrier) == 0);
  97. }
  98. assert(pthread_mutex_destroy(&mx) == 0);
  99. return 0;
  100. }