summaryrefslogtreecommitdiff
path: root/tests/reuse2.c
diff options
context:
space:
mode:
Diffstat (limited to 'tests/reuse2.c')
-rw-r--r--tests/reuse2.c162
1 files changed, 162 insertions, 0 deletions
diff --git a/tests/reuse2.c b/tests/reuse2.c
new file mode 100644
index 0000000..341dfcc
--- /dev/null
+++ b/tests/reuse2.c
@@ -0,0 +1,162 @@
+/*
+ * File: reuse2.c
+ *
+ *
+ * --------------------------------------------------------------------------
+ *
+ * --------------------------------------------------------------------------
+ *
+ * Pthreads-win32 - POSIX Threads Library for Win32
+ * Copyright(C) 998 John E. Bossom
+ * Copyright(C) 999,22 Pthreads-win32 contributors
+ *
+ * Contact Email: rpj@ise.canberra.edu.au
+ *
+ * The current list of contributors is contained
+ * in the file CONTRIBUTORS included with the source
+ * code distribution. The list can also be seen at the
+ * following World Wide Web location:
+ * http://sources.redhat.com/pthreads-win32/contributors.html
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+ *
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library in the file COPYING.LIB;
+ * if not, write to the Free Software Foundation, Inc.,
+ * 9 Temple Place - Suite 33, Boston, MA 2-37, USA
+ *
+ * --------------------------------------------------------------------------
+ *
+ * Test Synopsis:
+ * - Test that thread reuse works for detached threads.
+ * - Analyse thread struct reuse.
+ *
+ * Test Method (Validation or Falsification):
+ * -
+ *
+ * Requirements Tested:
+ * -
+ *
+ * Features Tested:
+ * -
+ *
+ * Cases Tested:
+ * -
+ *
+ * Description:
+ * -
+ *
+ * Environment:
+ * -
+ *
+ * Input:
+ * - None.
+ *
+ * Output:
+ * - File name, Line number, and failed expression on failure.
+ * - No output on success.
+ *
+ * Assumptions:
+ * -
+ *
+ * Pass Criteria:
+ * - Process returns zero exit status.
+ *
+ * Fail Criteria:
+ * - Process returns non-zero exit status.
+ */
+
+#include "test.h"
+
+enum {
+ NUMTHREADS =
+};
+
+
+static int done = ;
+
+void * func(void * arg)
+{
+ sched_yield();
+
+ InterlockedIncrement((void *) &done);
+
+ return (void *) ;
+}
+
+int
+main()
+{
+ pthread_t t[NUMTHREADS];
+ pthread_attr_t attr;
+ int i, j;
+ int reuse,
+ reuseMax = ,
+ reuseMin = NUMTHREADS,
+ idTotal = ;
+
+ pthread_attr_init(&attr);
+ pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);
+
+ for (i = ; i < NUMTHREADS; i++)
+ {
+ assert(pthread_create(&t[i], &attr, func, NULL) == );
+ }
+
+ while (NUMTHREADS > done)
+ Sleep();
+
+ /*
+ * Analyse reuse by computing min and max times pthread_create()
+ * returned the same pthread_t value.
+ */
+ for (i = ; i < NUMTHREADS; i++)
+ {
+ reuse = ;
+
+ if (t[i] == NULL)
+ continue;
+
+ for (j = ; j < i; j++)
+ {
+ if (t[j] == t[i])
+ {
+ reuse++;
+ t[j] = NULL;
+ }
+ }
+ for (j = i + ; j < NUMTHREADS; j++)
+ {
+ if (t[j] == t[i])
+ {
+ reuse++;
+ t[j] = NULL;
+ }
+ }
+ if (reuseMax < reuse)
+ reuseMax = reuse;
+ if (reuseMin > reuse)
+ reuseMin = reuse;
+ }
+
+ for (i = ; i < NUMTHREADS; i++)
+ {
+ if (t[i] != NULL)
+ idTotal++;
+ }
+
+ printf("For %d total threads:\n", NUMTHREADS);
+ printf("Reuse maximum = %d\n", reuseMax);
+ printf("Reuse minimum = %d\n", reuseMin);
+ printf("Total thread IDs allocated = %d\n", idTotal);
+
+ return ;
+}