WebSVN – HelenOS – Diff – /trunk/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 <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(void)
{
    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");
                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");
                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 2022	Rev 2028
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 <atomic.h>	31	#include <atomic.h>
32	#include <print.h>	32	#include <print.h>
33	#include <proc/thread.h>	33	#include <proc/thread.h>
34		34
35	#include <synch/waitq.h>	35	#include <synch/waitq.h>
36	#include <synch/semaphore.h>	36	#include <synch/semaphore.h>
37		37
38	#define AT_ONCE 3	38	#define AT_ONCE 3
39	#define PRODUCERS 50	39	#define PRODUCERS 50
40	#define CONSUMERS 50	40	#define CONSUMERS 50
41		41
42	static semaphore_t sem;	42	static semaphore_t sem;
43		43
44	static waitq_t can_start;	44	static waitq_t can_start;
45	static atomic_t items_produced;	45	static atomic_t items_produced;
46	static atomic_t items_consumed;	46	static atomic_t items_consumed;
47		47
48	static void consumer(void *arg);	-
49	static void producer(void *arg);	-
50	static void failed(void);	-
51		-
52	static void producer(void *arg)	48	static void producer(void *arg)
53	{	49	{
54	thread_detach(THREAD);	50	thread_detach(THREAD);
55		51
56	waitq_sleep(&can_start);	52	waitq_sleep(&can_start);
57		53
58	semaphore_down(&sem);	54	semaphore_down(&sem);
59	atomic_inc(&items_produced);	55	atomic_inc(&items_produced);
60	thread_usleep(250);	56	thread_usleep(250);
61	semaphore_up(&sem);	57	semaphore_up(&sem);
62	}	58	}
63		59
64	static void consumer(void *arg)	60	static void consumer(void *arg)
65	{	61	{
66	thread_detach(THREAD);	62	thread_detach(THREAD);
67		63
68	waitq_sleep(&can_start);	64	waitq_sleep(&can_start);
69		65
70	semaphore_down(&sem);	66	semaphore_down(&sem);
71	atomic_inc(&items_consumed);	67	atomic_inc(&items_consumed);
72	thread_usleep(500);	68	thread_usleep(500);
73	semaphore_up(&sem);	69	semaphore_up(&sem);
74	}	70	}
75		71
76	static void failed(void)	-
77	{	-
78	printf("Test failed prematurely.\n");	-
79	thread_exit();	-
80	}	-
81		-
82	void test_semaphore1(void)	72	char * test_semaphore1(void)
83	{	73	{
84	int i, j, k;	74	int i, j, k;
85	int consumers, producers;	75	int consumers, producers;
86		76
87	printf("Semaphore test #1\n");	-
88		-
89	waitq_initialize(&can_start);	77	waitq_initialize(&can_start);
90	semaphore_initialize(&sem, AT_ONCE);	78	semaphore_initialize(&sem, AT_ONCE);
91		79
92		-
93	for (i=1; i<=3; i++) {	80	for (i = 1; i <= 3; i++) {
94	thread_t *thrd;	81	thread_t *thrd;
95		82
96	atomic_set(&items_produced, 0);	83	atomic_set(&items_produced, 0);
97	atomic_set(&items_consumed, 0);	84	atomic_set(&items_consumed, 0);
98		85
99	consumers = i * CONSUMERS;	86	consumers = i * CONSUMERS;
100	producers = (4-i) * PRODUCERS;	87	producers = (4 - i) * PRODUCERS;
101		88
102	printf("Creating %d consumers and %d producers...", consumers, producers);	89	printf("Creating %d consumers and %d producers...", consumers, producers);
103		90
104	for (j=0; j<(CONSUMERS+PRODUCERS)/2; j++) {	91	for (j = 0; j < (CONSUMERS + PRODUCERS) / 2; j++) {
105	for (k=0; k<i; k++) {	92	for (k = 0; k < i; k++) {
106	thrd = thread_create(consumer, NULL, TASK, 0, "consumer");	93	thrd = thread_create(consumer, NULL, TASK, 0, "consumer");
107	if (thrd)	94	if (thrd)
108	thread_ready(thrd);	95	thread_ready(thrd);
109	else	96	else
110	failed();	97	printf("could not create consumer %d\n", i);
111	}	98	}
112	for (k=0; k<(4-i); k++) {	99	for (k = 0; k < (4 - i); k++) {
113	thrd = thread_create(producer, NULL, TASK, 0, "producer");	100	thrd = thread_create(producer, NULL, TASK, 0, "producer");
114	if (thrd)	101	if (thrd)
115	thread_ready(thrd);	102	thread_ready(thrd);
116	else	103	else
117	failed();	104	printf("could not create producer %d\n", i);
118	}	105	}
119	}	106	}
120		107
121	printf("ok\n");	108	printf("ok\n");
122		109
123	thread_sleep(1);	110	thread_sleep(1);
124	waitq_wakeup(&can_start, WAKEUP_ALL);	111	waitq_wakeup(&can_start, WAKEUP_ALL);
125		112
126	while (items_consumed.count != consumers \|\| items_produced.count != producers) {	113	while ((items_consumed.count != consumers) \|\| (items_produced.count != producers)) {
127	printf("%d consumers remaining, %d producers remaining\n", consumers - items_consumed.count, producers - items_produced.count);	114	printf("%d consumers remaining, %d producers remaining\n", consumers - items_consumed.count, producers - items_produced.count);
128	thread_sleep(1);	115	thread_sleep(1);
129	}	116	}
130	}	117	}
-		118
131	printf("Test passed.\n");	119	return NULL;
132	}	120	}
133		121

Subversion Repositories HelenOS

(root)/trunk/kernel/test/synch/semaphore1.c – Rev 2022 → 2028