cleanup2.c 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217
  1. /*
  2. * File: cleanup2.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. * Test Synopsis: Test cleanup handler executes (when thread is not canceled).
  37. *
  38. * Test Method (Validation or Falsification):
  39. * -
  40. *
  41. * Requirements Tested:
  42. * -
  43. *
  44. * Features Tested:
  45. * -
  46. *
  47. * Cases Tested:
  48. * -
  49. *
  50. * Description:
  51. * -
  52. *
  53. * Environment:
  54. * -
  55. *
  56. * Input:
  57. * - None.
  58. *
  59. * Output:
  60. * - File name, Line number, and failed expression on failure.
  61. * - No output on success.
  62. *
  63. * Assumptions:
  64. * - have working pthread_create, pthread_self, pthread_mutex_lock/unlock
  65. * pthread_testcancel, pthread_cancel, pthread_join
  66. *
  67. * Pass Criteria:
  68. * - Process returns zero exit status.
  69. *
  70. * Fail Criteria:
  71. * - Process returns non-zero exit status.
  72. */
  73. #if defined(_MSC_VER) || defined(__cplusplus)
  74. #include "test.h"
  75. /*
  76. * Create NUMTHREADS threads in addition to the Main thread.
  77. */
  78. enum {
  79. NUMTHREADS = 10
  80. };
  81. typedef struct bag_t_ bag_t;
  82. struct bag_t_ {
  83. int threadnum;
  84. int started;
  85. /* Add more per-thread state variables here */
  86. int count;
  87. };
  88. static bag_t threadbag[NUMTHREADS + 1];
  89. typedef struct {
  90. int i;
  91. CRITICAL_SECTION cs;
  92. } sharedInt_t;
  93. static sharedInt_t pop_count = {0, {0}};
  94. static void
  95. increment_pop_count(void * arg)
  96. {
  97. sharedInt_t * sI = (sharedInt_t *) arg;
  98. EnterCriticalSection(&sI->cs);
  99. sI->i++;
  100. LeaveCriticalSection(&sI->cs);
  101. }
  102. void *
  103. mythread(void * arg)
  104. {
  105. int result = 0;
  106. bag_t * bag = (bag_t *) arg;
  107. assert(bag == &threadbag[bag->threadnum]);
  108. assert(bag->started == 0);
  109. bag->started = 1;
  110. #ifdef _MSC_VER
  111. #pragma inline_depth(0)
  112. #endif
  113. pthread_cleanup_push(increment_pop_count, (void *) &pop_count);
  114. sched_yield();
  115. pthread_cleanup_pop(1);
  116. #ifdef _MSC_VER
  117. #pragma inline_depth()
  118. #endif
  119. return (void *) (size_t)result;
  120. }
  121. int
  122. main()
  123. {
  124. int failed = 0;
  125. int i;
  126. pthread_t t[NUMTHREADS + 1];
  127. InitializeCriticalSection(&pop_count.cs);
  128. assert((t[0] = pthread_self()).p != NULL);
  129. for (i = 1; i <= NUMTHREADS; i++)
  130. {
  131. threadbag[i].started = 0;
  132. threadbag[i].threadnum = i;
  133. assert(pthread_create(&t[i], NULL, mythread, (void *) &threadbag[i]) == 0);
  134. }
  135. /*
  136. * Code to control or munipulate child threads should probably go here.
  137. */
  138. Sleep(1000);
  139. /*
  140. * Standard check that all threads started.
  141. */
  142. for (i = 1; i <= NUMTHREADS; i++)
  143. {
  144. if (!threadbag[i].started)
  145. {
  146. failed |= !threadbag[i].started;
  147. fprintf(stderr, "Thread %d: started %d\n", i, threadbag[i].started);
  148. }
  149. }
  150. assert(!failed);
  151. /*
  152. * Check any results here. Set "failed" and only print output on failure.
  153. */
  154. failed = 0;
  155. for (i = 1; i <= NUMTHREADS; i++)
  156. {
  157. int fail = 0;
  158. void* result = (void*)0;
  159. assert(pthread_join(t[i], &result) == 0);
  160. fail = ((int)(size_t)result != 0);
  161. if (fail)
  162. {
  163. fprintf(stderr, "Thread %d: started %d: result: %d\n",
  164. i,
  165. threadbag[i].started,
  166. (int)(size_t)result);
  167. }
  168. failed = (failed || fail);
  169. }
  170. assert(!failed);
  171. assert(pop_count.i == NUMTHREADS);
  172. DeleteCriticalSection(&pop_count.cs);
  173. /*
  174. * Success.
  175. */
  176. return 0;
  177. }
  178. #else /* defined(_MSC_VER) || defined(__cplusplus) */
  179. int
  180. main()
  181. {
  182. return 0;
  183. }
  184. #endif /* defined(_MSC_VER) || defined(__cplusplus) */