WebSVN – HelenOS – Diff – /branches/sparc/kernel/test/synch/rwlock5.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/rwlock.h>
 
#define READERS     50
#define WRITERS     50
 
static rwlock_t rwlock;
 
static waitq_t can_start;
static atomic_t items_read;
static atomic_t items_written;
 
static void writer(void *arg)
{
    thread_detach(THREAD);
 
    waitq_sleep(&can_start);
 
    rwlock_write_lock(&rwlock);
    atomic_inc(&items_written);
    rwlock_write_unlock(&rwlock);
}
 
static void reader(void *arg)
{
    thread_detach(THREAD);
 
    waitq_sleep(&can_start);
   
    rwlock_read_lock(&rwlock);
    atomic_inc(&items_read);
    rwlock_read_unlock(&rwlock);
}
 
char * test_rwlock5(bool quiet)
{
    int i, j, k;
    long readers, writers;
   
    waitq_initialize(&can_start);
    rwlock_initialize(&rwlock);
   
    for (i = 1; i <= 3; i++) {
        thread_t *thrd;
 
        atomic_set(&items_read, 0);
        atomic_set(&items_written, 0);
 
        readers = i * READERS;
        writers = (4 - i) * WRITERS;
 
        printf("Creating %ld readers and %ld writers...", readers, writers);
       
        for (j = 0; j < (READERS + WRITERS) / 2; j++) {
            for (k = 0; k < i; k++) {
                thrd = thread_create(reader, NULL, TASK, 0, "reader", false);
                if (thrd)
                    thread_ready(thrd);
                else
                    printf("Could not create reader %d\n", k);
            }
            for (k = 0; k < (4 - i); k++) {
                thrd = thread_create(writer, NULL, TASK, 0, "writer", false);
                if (thrd)
                    thread_ready(thrd);
                else
                    printf("Could not create writer %d\n", k);
            }
        }
 
        printf("ok\n");
 
        thread_sleep(1);
        waitq_wakeup(&can_start, WAKEUP_ALL);
   
        while ((items_read.count != readers) || (items_written.count != writers)) {
            printf("%d readers remaining, %d writers remaining, readers_in=%d\n", readers - items_read.count, writers - items_written.count, rwlock.readers_in);
            thread_usleep(100000);
        }
    }
   
    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/rwlock.h>	37	#include <synch/rwlock.h>
37		38
38	#define READERS 50	39	#define READERS 50
39	#define WRITERS 50	40	#define WRITERS 50
40		41
41	static rwlock_t rwlock;	42	static rwlock_t rwlock;
42		43
43	static waitq_t can_start;	44	static waitq_t can_start;
44	static atomic_t items_read;	45	static atomic_t items_read;
45	static atomic_t items_written;	46	static atomic_t items_written;
46		47
47	static void writer(void *arg)	48	static void writer(void *arg)
48	{	49	{
49	thread_detach(THREAD);	50	thread_detach(THREAD);
50		51
51	waitq_sleep(&can_start);	52	waitq_sleep(&can_start);
52		53
53	rwlock_write_lock(&rwlock);	54	rwlock_write_lock(&rwlock);
54	atomic_inc(&items_written);	55	atomic_inc(&items_written);
55	rwlock_write_unlock(&rwlock);	56	rwlock_write_unlock(&rwlock);
56	}	57	}
57		58
58	static void reader(void *arg)	59	static void reader(void *arg)
59	{	60	{
60	thread_detach(THREAD);	61	thread_detach(THREAD);
61		62
62	waitq_sleep(&can_start);	63	waitq_sleep(&can_start);
63		64
64	rwlock_read_lock(&rwlock);	65	rwlock_read_lock(&rwlock);
65	atomic_inc(&items_read);	66	atomic_inc(&items_read);
66	rwlock_read_unlock(&rwlock);	67	rwlock_read_unlock(&rwlock);
67	}	68	}
68		69
69	char * test_rwlock5(bool quiet)	70	char * test_rwlock5(bool quiet)
70	{	71	{
71	int i, j, k;	72	int i, j, k;
72	long readers, writers;	73	long readers, writers;
73		74
74	waitq_initialize(&can_start);	75	waitq_initialize(&can_start);
75	rwlock_initialize(&rwlock);	76	rwlock_initialize(&rwlock);
76		77
77	for (i = 1; i <= 3; i++) {	78	for (i = 1; i <= 3; i++) {
78	thread_t *thrd;	79	thread_t *thrd;
79		80
80	atomic_set(&items_read, 0);	81	atomic_set(&items_read, 0);
81	atomic_set(&items_written, 0);	82	atomic_set(&items_written, 0);
82		83
83	readers = i * READERS;	84	readers = i * READERS;
84	writers = (4 - i) * WRITERS;	85	writers = (4 - i) * WRITERS;
85		86
86	printf("Creating %ld readers and %ld writers...", readers, writers);	87	printf("Creating %ld readers and %ld writers...", readers, writers);
87		88
88	for (j = 0; j < (READERS + WRITERS) / 2; j++) {	89	for (j = 0; j < (READERS + WRITERS) / 2; j++) {
89	for (k = 0; k < i; k++) {	90	for (k = 0; k < i; k++) {
90	thrd = thread_create(reader, NULL, TASK, 0, "reader", false);	91	thrd = thread_create(reader, NULL, TASK, 0, "reader", false);
91	if (thrd)	92	if (thrd)
92	thread_ready(thrd);	93	thread_ready(thrd);
93	else	94	else
94	printf("Could not create reader %d\n", k);	95	printf("Could not create reader %d\n", k);
95	}	96	}
96	for (k = 0; k < (4 - i); k++) {	97	for (k = 0; k < (4 - i); k++) {
97	thrd = thread_create(writer, NULL, TASK, 0, "writer", false);	98	thrd = thread_create(writer, NULL, TASK, 0, "writer", false);
98	if (thrd)	99	if (thrd)
99	thread_ready(thrd);	100	thread_ready(thrd);
100	else	101	else
101	printf("Could not create writer %d\n", k);	102	printf("Could not create writer %d\n", k);
102	}	103	}
103	}	104	}
104		105
105	printf("ok\n");	106	printf("ok\n");
106		107
107	thread_sleep(1);	108	thread_sleep(1);
108	waitq_wakeup(&can_start, WAKEUP_ALL);	109	waitq_wakeup(&can_start, WAKEUP_ALL);
109		110
110	while ((items_read.count != readers) \|\| (items_written.count != writers)) {	111	while ((items_read.count != readers) \|\| (items_written.count != writers)) {
111	printf("%d readers remaining, %d writers remaining, readers_in=%d\n", readers - items_read.count, writers - items_written.count, rwlock.readers_in);	112	printf("%d readers remaining, %d writers remaining, readers_in=%d\n", readers - items_read.count, writers - items_written.count, rwlock.readers_in);
112	thread_usleep(100000);	113	thread_usleep(100000);
113	}	114	}
114	}	115	}
115		116
116	return NULL;	117	return NULL;
117	}	118	}
118		119

Subversion Repositories HelenOS

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