WebSVN – HelenOS – Diff – /branches/sparc/kernel/test/synch/semaphore1.c


/*
 * Copyright (c) 2001-2004 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <test.h>
#include <arch.h>
#include <arch/asm.h>
#include <atomic.h>
#include <print.h>
#include <proc/thread.h>
 
#include <synch/waitq.h>
#include <synch/semaphore.h>
 
#define AT_ONCE         3
#define PRODUCERS       50
#define CONSUMERS       50
 
static semaphore_t sem;
 
static waitq_t can_start;
static atomic_t items_produced;
static atomic_t items_consumed;
 
static void producer(void *arg)
{
    thread_detach(THREAD); 
 
    waitq_sleep(&can_start);
       
    semaphore_down(&sem);
    atomic_inc(&items_produced);
    thread_usleep(250);
    semaphore_up(&sem);
}
 
static void consumer(void *arg)
{
    thread_detach(THREAD); 
   
    waitq_sleep(&can_start);
   
    semaphore_down(&sem);
    atomic_inc(&items_consumed);
    thread_usleep(500);
    semaphore_up(&sem);
}
 
char * test_semaphore1(bool quiet)
{
    int i, j, k;
    int consumers, producers;
   
    waitq_initialize(&can_start);
    semaphore_initialize(&sem, AT_ONCE);
 
    for (i = 1; i <= 3; i++) {
        thread_t *thrd;
 
        atomic_set(&items_produced, 0);
        atomic_set(&items_consumed, 0);
       
        consumers = i * CONSUMERS;
        producers = (4 - i) * PRODUCERS;
       
        printf("Creating %d consumers and %d producers...", consumers, producers);
   
        for (j = 0; j < (CONSUMERS + PRODUCERS) / 2; j++) {
            for (k = 0; k < i; k++) {
                thrd = thread_create(consumer, NULL, TASK, 0, "consumer", false);
                if (thrd)
                    thread_ready(thrd);
                else
                    printf("could not create consumer %d\n", i);
            }
            for (k = 0; k < (4 - i); k++) {
                thrd = thread_create(producer, NULL, TASK, 0, "producer", false);
                if (thrd)
                    thread_ready(thrd);
                else
                    printf("could not create producer %d\n", i);
            }
        }
 
        printf("ok\n");
 
        thread_sleep(1);
        waitq_wakeup(&can_start, WAKEUP_ALL);
   
        while ((items_consumed.count != consumers) || (items_produced.count != producers)) {
            printf("%d consumers remaining, %d producers remaining\n", consumers - items_consumed.count, producers - items_produced.count);
            thread_sleep(1);
        }
    }
   
    return NULL;
}
 

Rev 3343	Rev 3862
1	/*	1	/*
2	* Copyright (c) 2001-2004 Jakub Jermar	2	* Copyright (c) 2001-2004 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	13	* documentation and/or other materials provided with the distribution.
14	* - The name of the author may not be used to endorse or promote products	14	* - The name of the author may not be used to endorse or promote products
15	* derived from this software without specific prior written permission.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	#include <test.h>	29	#include <test.h>
30	#include <arch.h>	30	#include <arch.h>
-		31	#include <arch/asm.h>
31	#include <atomic.h>	32	#include <atomic.h>
32	#include <print.h>	33	#include <print.h>
33	#include <proc/thread.h>	34	#include <proc/thread.h>
34		35
35	#include <synch/waitq.h>	36	#include <synch/waitq.h>
36	#include <synch/semaphore.h>	37	#include <synch/semaphore.h>
37		38
38	#define AT_ONCE 3	39	#define AT_ONCE 3
39	#define PRODUCERS 50	40	#define PRODUCERS 50
40	#define CONSUMERS 50	41	#define CONSUMERS 50
41		42
42	static semaphore_t sem;	43	static semaphore_t sem;
43		44
44	static waitq_t can_start;	45	static waitq_t can_start;
45	static atomic_t items_produced;	46	static atomic_t items_produced;
46	static atomic_t items_consumed;	47	static atomic_t items_consumed;
47		48
48	static void producer(void *arg)	49	static void producer(void *arg)
49	{	50	{
50	thread_detach(THREAD);	51	thread_detach(THREAD);
51		52
52	waitq_sleep(&can_start);	53	waitq_sleep(&can_start);
53		54
54	semaphore_down(&sem);	55	semaphore_down(&sem);
55	atomic_inc(&items_produced);	56	atomic_inc(&items_produced);
56	thread_usleep(250);	57	thread_usleep(250);
57	semaphore_up(&sem);	58	semaphore_up(&sem);
58	}	59	}
59		60
60	static void consumer(void *arg)	61	static void consumer(void *arg)
61	{	62	{
62	thread_detach(THREAD);	63	thread_detach(THREAD);
63		64
64	waitq_sleep(&can_start);	65	waitq_sleep(&can_start);
65		66
66	semaphore_down(&sem);	67	semaphore_down(&sem);
67	atomic_inc(&items_consumed);	68	atomic_inc(&items_consumed);
68	thread_usleep(500);	69	thread_usleep(500);
69	semaphore_up(&sem);	70	semaphore_up(&sem);
70	}	71	}
71		72
72	char * test_semaphore1(bool quiet)	73	char * test_semaphore1(bool quiet)
73	{	74	{
74	int i, j, k;	75	int i, j, k;
75	int consumers, producers;	76	int consumers, producers;
76		77
77	waitq_initialize(&can_start);	78	waitq_initialize(&can_start);
78	semaphore_initialize(&sem, AT_ONCE);	79	semaphore_initialize(&sem, AT_ONCE);
79		80
80	for (i = 1; i <= 3; i++) {	81	for (i = 1; i <= 3; i++) {
81	thread_t *thrd;	82	thread_t *thrd;
82		83
83	atomic_set(&items_produced, 0);	84	atomic_set(&items_produced, 0);
84	atomic_set(&items_consumed, 0);	85	atomic_set(&items_consumed, 0);
85		86
86	consumers = i * CONSUMERS;	87	consumers = i * CONSUMERS;
87	producers = (4 - i) * PRODUCERS;	88	producers = (4 - i) * PRODUCERS;
88		89
89	printf("Creating %d consumers and %d producers...", consumers, producers);	90	printf("Creating %d consumers and %d producers...", consumers, producers);
90		91
91	for (j = 0; j < (CONSUMERS + PRODUCERS) / 2; j++) {	92	for (j = 0; j < (CONSUMERS + PRODUCERS) / 2; j++) {
92	for (k = 0; k < i; k++) {	93	for (k = 0; k < i; k++) {
93	thrd = thread_create(consumer, NULL, TASK, 0, "consumer", false);	94	thrd = thread_create(consumer, NULL, TASK, 0, "consumer", false);
94	if (thrd)	95	if (thrd)
95	thread_ready(thrd);	96	thread_ready(thrd);
96	else	97	else
97	printf("could not create consumer %d\n", i);	98	printf("could not create consumer %d\n", i);
98	}	99	}
99	for (k = 0; k < (4 - i); k++) {	100	for (k = 0; k < (4 - i); k++) {
100	thrd = thread_create(producer, NULL, TASK, 0, "producer", false);	101	thrd = thread_create(producer, NULL, TASK, 0, "producer", false);
101	if (thrd)	102	if (thrd)
102	thread_ready(thrd);	103	thread_ready(thrd);
103	else	104	else
104	printf("could not create producer %d\n", i);	105	printf("could not create producer %d\n", i);
105	}	106	}
106	}	107	}
107		108
108	printf("ok\n");	109	printf("ok\n");
109		110
110	thread_sleep(1);	111	thread_sleep(1);
111	waitq_wakeup(&can_start, WAKEUP_ALL);	112	waitq_wakeup(&can_start, WAKEUP_ALL);
112		113
113	while ((items_consumed.count != consumers) \|\| (items_produced.count != producers)) {	114	while ((items_consumed.count != consumers) \|\| (items_produced.count != producers)) {
114	printf("%d consumers remaining, %d producers remaining\n", consumers - items_consumed.count, producers - items_produced.count);	115	printf("%d consumers remaining, %d producers remaining\n", consumers - items_consumed.count, producers - items_produced.count);
115	thread_sleep(1);	116	thread_sleep(1);
116	}	117	}
117	}	118	}
118		119
119	return NULL;	120	return NULL;
120	}	121	}
121		122

Subversion Repositories HelenOS

(root)/branches/sparc/kernel/test/synch/semaphore1.c – Rev 3343 → 3862