1*db3296cfSderaadt /* $OpenBSD: sleep.c,v 1.4 2003/07/31 21:48:06 deraadt Exp $ */
2b2ea75c1Sfgsch /*
3b2ea75c1Sfgsch * Copyright (c) 1993, 1994, 1995, 1996 by Chris Provenzano and contributors,
4b2ea75c1Sfgsch * proven@mit.edu All rights reserved.
5b2ea75c1Sfgsch *
6b2ea75c1Sfgsch * Redistribution and use in source and binary forms, with or without
7b2ea75c1Sfgsch * modification, are permitted provided that the following conditions
8b2ea75c1Sfgsch * are met:
9b2ea75c1Sfgsch * 1. Redistributions of source code must retain the above copyright
10b2ea75c1Sfgsch * notice, this list of conditions and the following disclaimer.
11b2ea75c1Sfgsch * 2. Redistributions in binary form must reproduce the above copyright
12b2ea75c1Sfgsch * notice, this list of conditions and the following disclaimer in the
13b2ea75c1Sfgsch * documentation and/or other materials provided with the distribution.
14b2ea75c1Sfgsch * 3. All advertising materials mentioning features or use of this software
15b2ea75c1Sfgsch * must display the following acknowledgement:
16b2ea75c1Sfgsch * This product includes software developed by Chris Provenzano,
17b2ea75c1Sfgsch * the University of California, Berkeley, and contributors.
18b2ea75c1Sfgsch * 4. Neither the name of Chris Provenzano, the University, nor the names of
19b2ea75c1Sfgsch * contributors may be used to endorse or promote products derived
20b2ea75c1Sfgsch * from this software without specific prior written permission.
21b2ea75c1Sfgsch *
22b2ea75c1Sfgsch * THIS SOFTWARE IS PROVIDED BY CHRIS PROVENZANO AND CONTRIBUTORS ``AS IS'' AND
23b2ea75c1Sfgsch * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24b2ea75c1Sfgsch * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25b2ea75c1Sfgsch * ARE DISCLAIMED. IN NO EVENT SHALL CHRIS PROVENZANO, THE REGENTS OR
26b2ea75c1Sfgsch * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
27b2ea75c1Sfgsch * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
28b2ea75c1Sfgsch * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
29b2ea75c1Sfgsch * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
30b2ea75c1Sfgsch * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
31b2ea75c1Sfgsch * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
32b2ea75c1Sfgsch * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33b2ea75c1Sfgsch */
34b2ea75c1Sfgsch
35b2ea75c1Sfgsch /* ==== test_sleep.c =========================================================
36b2ea75c1Sfgsch * Copyright (c) 1993 by Chris Provenzano, proven@athena.mit.edu
37b2ea75c1Sfgsch *
38b2ea75c1Sfgsch * Description : Test context switch functionality.
39b2ea75c1Sfgsch *
40b2ea75c1Sfgsch * 1.00 93/08/04 proven
41b2ea75c1Sfgsch * -Started coding this file.
42b2ea75c1Sfgsch */
43b2ea75c1Sfgsch
44b2ea75c1Sfgsch #include <pthread.h>
45b2ea75c1Sfgsch #include <stdio.h>
46b2ea75c1Sfgsch #include <unistd.h>
478445c537Stodd #include <stdlib.h>
48b2ea75c1Sfgsch #include "test.h"
49b2ea75c1Sfgsch
50b2ea75c1Sfgsch const char buf[] = "abcdefghijklimnopqrstuvwxyz";
51b2ea75c1Sfgsch int fd = 1;
52b2ea75c1Sfgsch
53*db3296cfSderaadt static void *
new_thread(void * arg)54*db3296cfSderaadt new_thread(void* arg)
55b2ea75c1Sfgsch {
56b2ea75c1Sfgsch int i;
57b2ea75c1Sfgsch
58b2ea75c1Sfgsch for (i = 0; i < 10; i++) {
59b2ea75c1Sfgsch write(fd, buf + (long) arg, 1);
60b2ea75c1Sfgsch sleep(1);
61b2ea75c1Sfgsch }
62b2ea75c1Sfgsch return NULL;
63b2ea75c1Sfgsch }
64b2ea75c1Sfgsch
65b2ea75c1Sfgsch int
main(int argc,char * argv[])66*db3296cfSderaadt main(int argc, char *argv[])
67b2ea75c1Sfgsch {
68b2ea75c1Sfgsch pthread_t thread[2];
69b2ea75c1Sfgsch int count = sizeof thread/sizeof thread[0];
70b2ea75c1Sfgsch long i;
71b2ea75c1Sfgsch
72b2ea75c1Sfgsch printf("Going to sleep\n");
73b2ea75c1Sfgsch sleep(3);
74b2ea75c1Sfgsch printf("Done sleeping\n");
75b2ea75c1Sfgsch
76b2ea75c1Sfgsch for(i = 0; i < count; i++)
77b2ea75c1Sfgsch CHECKr(pthread_create(&thread[i], NULL, new_thread,
78b2ea75c1Sfgsch (void *) i));
79b2ea75c1Sfgsch
80b2ea75c1Sfgsch for (i = 0; i < count; i++)
81b2ea75c1Sfgsch CHECKr(pthread_join(thread[i], NULL));
82b2ea75c1Sfgsch
83c0a6f2a4Smarc CHECKe(write(STDOUT_FILENO, "\n", 1));
84b2ea75c1Sfgsch SUCCEED;
85b2ea75c1Sfgsch }
86