semaphore4t.c 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151
  1. /*
  2. * File: semaphore4t.c
  3. *
  4. *
  5. * --------------------------------------------------------------------------
  6. *
  7. * Pthreads-embedded (PTE) - POSIX Threads Library for embedded systems
  8. * Copyright(C) 2008 Jason Schmidlapp
  9. *
  10. * Contact Email: [email protected]
  11. *
  12. *
  13. * Based upon Pthreads-win32 - POSIX Threads Library for Win32
  14. * Copyright(C) 1998 John E. Bossom
  15. * Copyright(C) 1999,2005 Pthreads-win32 contributors
  16. *
  17. * Contact Email: [email protected]
  18. *
  19. * The original list of contributors to the Pthreads-win32 project
  20. * is contained in the file CONTRIBUTORS.ptw32 included with the
  21. * source code distribution. The list can also be seen at the
  22. * following World Wide Web location:
  23. * http://sources.redhat.com/pthreads-win32/contributors.html
  24. *
  25. * This library is free software; you can redistribute it and/or
  26. * modify it under the terms of the GNU Lesser General Public
  27. * License as published by the Free Software Foundation; either
  28. * version 2 of the License, or (at your option) any later version.
  29. *
  30. * This library is distributed in the hope that it will be useful,
  31. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  32. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  33. * Lesser General Public License for more details.
  34. *
  35. * You should have received a copy of the GNU Lesser General Public
  36. * License along with this library in the file COPYING.LIB;
  37. * if not, write to the Free Software Foundation, Inc.,
  38. * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
  39. *
  40. * --------------------------------------------------------------------------
  41. *
  42. * Test Synopsis: Verify sem_getvalue returns the correct number of waiters
  43. * after threads are cancelled.
  44. * -
  45. *
  46. * Test Method (Validation or Falsification):
  47. * - Validation
  48. *
  49. * Requirements Tested:
  50. * - sem_timedwait cancellation.
  51. *
  52. * Features Tested:
  53. * -
  54. *
  55. * Cases Tested:
  56. * -
  57. *
  58. * Description:
  59. * -
  60. *
  61. * Environment:
  62. * -
  63. *
  64. * Input:
  65. * - None.
  66. *
  67. * Output:
  68. * - File name, Line number, and failed expression on failure.
  69. * - No output on success.
  70. *
  71. * Assumptions:
  72. * -
  73. *
  74. * Pass Criteria:
  75. * - Process returns zero exit status.
  76. *
  77. * Fail Criteria:
  78. * - Process returns non-zero exit status.
  79. */
  80. #include "test.h"
  81. #define MAX_COUNT OS_MAX_SIMUL_THREADS
  82. static sem_t s;
  83. static void *
  84. thr (void * arg)
  85. {
  86. if ((int) arg == 5)
  87. {
  88. // We expect this thread to be cancelled,
  89. // so sem_wait should return EINTR.
  90. assert(sem_timedwait(&s,NULL) == -1);
  91. assert(errno == EINTR);
  92. }
  93. else
  94. {
  95. assert(sem_timedwait(&s,NULL) == 0);
  96. }
  97. return NULL;
  98. }
  99. int pthread_test_semaphore4t(void)
  100. {
  101. int value = 0;
  102. int i;
  103. pthread_t t[MAX_COUNT+1];
  104. assert(sem_init(&s, PTHREAD_PROCESS_PRIVATE, 0) == 0);
  105. assert(sem_getvalue(&s, &value) == 0);
  106. assert(value == 0);
  107. for (i = 1; i <= MAX_COUNT; i++)
  108. {
  109. assert(pthread_create(&t[i], NULL, thr, (void *) i) == 0);
  110. do
  111. {
  112. sched_yield();
  113. assert(sem_getvalue(&s, &value) == 0);
  114. }
  115. while (value != -i);
  116. assert(-value == i);
  117. }
  118. assert(sem_getvalue(&s, &value) == 0);
  119. assert(-value == MAX_COUNT);
  120. assert(pthread_cancel(t[5]) == 0);
  121. assert(pthread_join(t[5], NULL) == 0);
  122. assert(sem_getvalue(&s, &value) == 0);
  123. assert(-value == MAX_COUNT - 1);
  124. for (i = MAX_COUNT - 2; i >= 0; i--)
  125. {
  126. assert(sem_post(&s) == 0);
  127. assert(sem_getvalue(&s, &value) == 0);
  128. assert(-value == i);
  129. }
  130. for (i = 1; i <= MAX_COUNT; i++)
  131. {
  132. if (i != 5)
  133. assert(pthread_join(t[i], NULL) == 0);
  134. }
  135. assert(sem_destroy(&s) == 0);
  136. return 0;
  137. }