summaryrefslogtreecommitdiff
path: root/tests/reuse2.c
diff options
context:
space:
mode:
authorrpj <rpj>2003-08-19 02:45:59 +0000
committerrpj <rpj>2003-08-19 02:45:59 +0000
commit22657c4252e43c2b3211b39b3fc55f5df977c986 (patch)
tree5f1ac94b9988bdb9af157bdb072992fa32e05317 /tests/reuse2.c
parent2f7a306542a00c6920c296cfc2f34b8732c64ca1 (diff)
Fix missing constants.
Diffstat (limited to 'tests/reuse2.c')
-rw-r--r--tests/reuse2.c214
1 files changed, 108 insertions, 106 deletions
diff --git a/tests/reuse2.c b/tests/reuse2.c
index 341dfcc..08cdb0f 100644
--- a/tests/reuse2.c
+++ b/tests/reuse2.c
@@ -1,131 +1,133 @@
-/*
- * 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:
+/*
+ * File: reuse2.c
+ *
+ *
+ * --------------------------------------------------------------------------
+ *
+ * --------------------------------------------------------------------------
+ *
+ * Pthreads-win32 - POSIX Threads Library for Win32
+ * Copyright(C) 1998 John E. Bossom
+ * Copyright(C) 1999,2002 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.,
+ * 59 Temple Place - Suite 330, Boston, MA 02111-1307, 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 =
-};
+ * - 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 = 10000
+};
static int done = ;
-void * func(void * arg)
-{
+void * func(void * arg)
+{
sched_yield();
InterlockedIncrement((void *) &done);
- return (void *) ;
-}
-
-int
-main()
-{
+ return (void *) 0;
+}
+
+int
+main()
+{
pthread_t t[NUMTHREADS];
- pthread_attr_t attr;
+ pthread_attr_t attr;
int i, j;
int reuse,
- reuseMax = ,
+ reuseMax = 0,
reuseMin = NUMTHREADS,
- idTotal = ;
+ idTotal = 0;
- pthread_attr_init(&attr);
- pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);
+ assert(pthread_attr_init(&attr) == 0);
+ assert(pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED) == 0);
- for (i = ; i < NUMTHREADS; i++)
- {
- assert(pthread_create(&t[i], &attr, func, NULL) == );
- }
+ for (i = 0; i < NUMTHREADS; i++)
+ {
+ assert(pthread_create(&t[i], &attr, func, NULL) == 0);
+ }
while (NUMTHREADS > done)
- Sleep();
+ Sleep(100);
+
+ Sleep(100);
/*
- * Analyse reuse by computing min and max times pthread_create()
+ * Analyse reuse by computing min and max number of times pthread_create()
* returned the same pthread_t value.
*/
- for (i = ; i < NUMTHREADS; i++)
+ for (i = 0; i < NUMTHREADS; i++)
{
- reuse = ;
+ reuse = 0;
if (t[i] == NULL)
continue;
- for (j = ; j < i; j++)
+ for (j = 0; j < i; j++)
{
if (t[j] == t[i])
{
@@ -133,7 +135,7 @@ main()
t[j] = NULL;
}
}
- for (j = i + ; j < NUMTHREADS; j++)
+ for (j = i + 1; j < NUMTHREADS; j++)
{
if (t[j] == t[i])
{
@@ -147,7 +149,7 @@ main()
reuseMin = reuse;
}
- for (i = ; i < NUMTHREADS; i++)
+ for (i = 0; i < NUMTHREADS; i++)
{
if (t[i] != NULL)
idTotal++;
@@ -158,5 +160,5 @@ main()
printf("Reuse minimum = %d\n", reuseMin);
printf("Total thread IDs allocated = %d\n", idTotal);
- return ;
-}
+ return 0;
+}