WebSVN – HelenOS-historic – Diff – /kernel/trunk/test/synch/semaphore2/test.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/atomic.h>
#include <print.h>
#include <proc/thread.h>
#include <arch/types.h>
#include <arch/context.h>
 
#include <synch/waitq.h>
#include <synch/semaphore.h>
#include <synch/synch.h>
#include <synch/spinlock.h>
 
static semaphore_t sem;
 
SPINLOCK_INITIALIZE(lock);
 
static waitq_t can_start;
 
__u32 seed = 0xdeadbeef;
 
static __u32 random(__u32 max);
 
static void consumer(void *arg);
static void failed(void);
 
__u32 random(__u32 max)
{
    __u32 rc;
 
    spinlock_lock(&lock);  
    rc = seed % max;
    seed = (((seed<<2) ^ (seed>>2)) * 487) + rc;
    spinlock_unlock(&lock);
    return rc;
}
 
 
void consumer(void *arg)
{
    int rc, to;
    waitq_sleep(&can_start);
   
    to = random(20000);
    printf("cpu%d, tid %d down+ (%d)\n", CPU->id, THREAD->tid, to);
    rc = semaphore_down_timeout(&sem, to);
    if (SYNCH_FAILED(rc)) {
        printf("cpu%d, tid %d down!\n", CPU->id, THREAD->tid);
        return;
    }
   
    printf("cpu%d, tid %d down=\n", CPU->id, THREAD->tid); 
    thread_usleep(random(30000));
   
    semaphore_up(&sem);
    printf("cpu%d, tid %d up\n", CPU->id, THREAD->tid);
}
 
void failed(void)
{
    printf("Test failed prematurely.\n");
    thread_exit();
}
 
void test(void)
{
    context_t ctx;
    __u32 i, k;
   
    printf("Semaphore test #2\n");
   
    waitq_initialize(&can_start);
    semaphore_initialize(&sem, 5);
   
 
   
    for (; ;) {
        thread_t *thrd;
       
        k = random(7) + 1;
        printf("Creating %d consumers\n", k);
        for (i=0; i<k; i++) {
            thrd = thread_create(consumer, NULL, TASK, 0);
            if (thrd)
                thread_ready(thrd);
            else
                failed();
        }
       
        thread_usleep(20000);
        waitq_wakeup(&can_start, WAKEUP_ALL);
    }      
 
}
 

Rev 534	Rev 623
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/atomic.h>	31	#include <arch/atomic.h>
32	#include <print.h>	32	#include <print.h>
33	#include <proc/thread.h>	33	#include <proc/thread.h>
34	#include <arch/types.h>	34	#include <arch/types.h>
35	#include <arch/context.h>	35	#include <arch/context.h>
36		36
37	#include <synch/waitq.h>	37	#include <synch/waitq.h>
38	#include <synch/semaphore.h>	38	#include <synch/semaphore.h>
39	#include <synch/synch.h>	39	#include <synch/synch.h>
-		40	#include <synch/spinlock.h>
40		41
41	static semaphore_t sem;	42	static semaphore_t sem;
42		43
43	static spinlock_t lock;	44	SPINLOCK_INITIALIZE(lock);
44		45
45	static waitq_t can_start;	46	static waitq_t can_start;
46		47
47	__u32 seed = 0xdeadbeef;	48	__u32 seed = 0xdeadbeef;
48		49
49	static __u32 random(__u32 max);	50	static __u32 random(__u32 max);
50		51
51	static void consumer(void *arg);	52	static void consumer(void *arg);
52	static void failed(void);	53	static void failed(void);
53		54
54	__u32 random(__u32 max)	55	__u32 random(__u32 max)
55	{	56	{
56	__u32 rc;	57	__u32 rc;
57		58
58	spinlock_lock(&lock);	59	spinlock_lock(&lock);
59	rc = seed % max;	60	rc = seed % max;
60	seed = (((seed<<2) ^ (seed>>2)) * 487) + rc;	61	seed = (((seed<<2) ^ (seed>>2)) * 487) + rc;
61	spinlock_unlock(&lock);	62	spinlock_unlock(&lock);
62	return rc;	63	return rc;
63	}	64	}
64		65
65		66
66	void consumer(void *arg)	67	void consumer(void *arg)
67	{	68	{
68	int rc, to;	69	int rc, to;
69	waitq_sleep(&can_start);	70	waitq_sleep(&can_start);
70		71
71	to = random(20000);	72	to = random(20000);
72	printf("cpu%d, tid %d down+ (%d)\n", CPU->id, THREAD->tid, to);	73	printf("cpu%d, tid %d down+ (%d)\n", CPU->id, THREAD->tid, to);
73	rc = semaphore_down_timeout(&sem, to);	74	rc = semaphore_down_timeout(&sem, to);
74	if (SYNCH_FAILED(rc)) {	75	if (SYNCH_FAILED(rc)) {
75	printf("cpu%d, tid %d down!\n", CPU->id, THREAD->tid);	76	printf("cpu%d, tid %d down!\n", CPU->id, THREAD->tid);
76	return;	77	return;
77	}	78	}
78		79
79	printf("cpu%d, tid %d down=\n", CPU->id, THREAD->tid);	80	printf("cpu%d, tid %d down=\n", CPU->id, THREAD->tid);
80	thread_usleep(random(30000));	81	thread_usleep(random(30000));
81		82
82	semaphore_up(&sem);	83	semaphore_up(&sem);
83	printf("cpu%d, tid %d up\n", CPU->id, THREAD->tid);	84	printf("cpu%d, tid %d up\n", CPU->id, THREAD->tid);
84	}	85	}
85		86
86	void failed(void)	87	void failed(void)
87	{	88	{
88	printf("Test failed prematurely.\n");	89	printf("Test failed prematurely.\n");
89	thread_exit();	90	thread_exit();
90	}	91	}
91		92
92	void test(void)	93	void test(void)
93	{	94	{
94	context_t ctx;	95	context_t ctx;
95	__u32 i, k;	96	__u32 i, k;
96		97
97	printf("Semaphore test #2\n");	98	printf("Semaphore test #2\n");
98		99
99	waitq_initialize(&can_start);	100	waitq_initialize(&can_start);
100	semaphore_initialize(&sem, 5);	101	semaphore_initialize(&sem, 5);
101		102
102		103
103		104
104	for (; ;) {	105	for (; ;) {
105	thread_t *thrd;	106	thread_t *thrd;
106		107
107	k = random(7) + 1;	108	k = random(7) + 1;
108	printf("Creating %d consumers\n", k);	109	printf("Creating %d consumers\n", k);
109	for (i=0; i<k; i++) {	110	for (i=0; i<k; i++) {
110	thrd = thread_create(consumer, NULL, TASK, 0);	111	thrd = thread_create(consumer, NULL, TASK, 0);
111	if (thrd)	112	if (thrd)
112	thread_ready(thrd);	113	thread_ready(thrd);
113	else	114	else
114	failed();	115	failed();
115	}	116	}
116		117
117	thread_usleep(20000);	118	thread_usleep(20000);
118	waitq_wakeup(&can_start, WAKEUP_ALL);	119	waitq_wakeup(&can_start, WAKEUP_ALL);
119	}	120	}
120		121
121	}	122	}
122		123

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/test/synch/semaphore2/test.c – Rev 534 → 623