Rev 2787 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1 | jermar | 1 | /* |
2071 | jermar | 2 | * Copyright (c) 2001-2004 Jakub Jermar |
1 | jermar | 3 | * All rights reserved. |
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
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 |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
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 |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
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 |
||
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 |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
29 | #include <test.h> |
||
30 | #include <arch.h> |
||
1104 | jermar | 31 | #include <atomic.h> |
1 | jermar | 32 | #include <print.h> |
33 | #include <proc/thread.h> |
||
34 | |||
35 | #include <synch/waitq.h> |
||
36 | #include <synch/rwlock.h> |
||
37 | |||
38 | #define READERS 50 |
||
39 | #define WRITERS 50 |
||
40 | |||
41 | static rwlock_t rwlock; |
||
42 | |||
43 | static waitq_t can_start; |
||
475 | jermar | 44 | static atomic_t items_read; |
45 | static atomic_t items_written; |
||
1 | jermar | 46 | |
2028 | decky | 47 | static void writer(void *arg) |
1 | jermar | 48 | { |
1658 | vana | 49 | thread_detach(THREAD); |
50 | |||
1 | jermar | 51 | waitq_sleep(&can_start); |
52 | |||
53 | rwlock_write_lock(&rwlock); |
||
54 | atomic_inc(&items_written); |
||
55 | rwlock_write_unlock(&rwlock); |
||
56 | } |
||
57 | |||
2028 | decky | 58 | static void reader(void *arg) |
1 | jermar | 59 | { |
1658 | vana | 60 | thread_detach(THREAD); |
61 | |||
1 | jermar | 62 | waitq_sleep(&can_start); |
63 | |||
64 | rwlock_read_lock(&rwlock); |
||
65 | atomic_inc(&items_read); |
||
66 | rwlock_read_unlock(&rwlock); |
||
67 | } |
||
68 | |||
2050 | decky | 69 | char * test_rwlock5(bool quiet) |
1 | jermar | 70 | { |
71 | int i, j, k; |
||
2745 | decky | 72 | long readers, writers; |
1 | jermar | 73 | |
74 | waitq_initialize(&can_start); |
||
75 | rwlock_initialize(&rwlock); |
||
76 | |||
2028 | decky | 77 | for (i = 1; i <= 3; i++) { |
1 | jermar | 78 | thread_t *thrd; |
79 | |||
627 | jermar | 80 | atomic_set(&items_read, 0); |
81 | atomic_set(&items_written, 0); |
||
1 | jermar | 82 | |
2028 | decky | 83 | readers = i * READERS; |
84 | writers = (4 - i) * WRITERS; |
||
1 | jermar | 85 | |
1196 | cejka | 86 | printf("Creating %ld readers and %ld writers...", readers, writers); |
1 | jermar | 87 | |
2028 | decky | 88 | for (j = 0; j < (READERS + WRITERS) / 2; j++) { |
89 | for (k = 0; k < i; k++) { |
||
2042 | decky | 90 | thrd = thread_create(reader, NULL, TASK, 0, "reader", false); |
1 | jermar | 91 | if (thrd) |
92 | thread_ready(thrd); |
||
93 | else |
||
2028 | decky | 94 | printf("Could not create reader %d\n", k); |
1 | jermar | 95 | } |
2028 | decky | 96 | for (k = 0; k < (4 - i); k++) { |
2042 | decky | 97 | thrd = thread_create(writer, NULL, TASK, 0, "writer", false); |
1 | jermar | 98 | if (thrd) |
99 | thread_ready(thrd); |
||
100 | else |
||
2028 | decky | 101 | printf("Could not create writer %d\n", k); |
1 | jermar | 102 | } |
103 | } |
||
104 | |||
105 | printf("ok\n"); |
||
106 | |||
107 | thread_sleep(1); |
||
108 | waitq_wakeup(&can_start, WAKEUP_ALL); |
||
109 | |||
2028 | decky | 110 | while ((items_read.count != readers) || (items_written.count != writers)) { |
3424 | svoboda | 111 | printf("%d readers remaining, %d writers remaining, readers_in=%d\n", readers - items_read.count, writers - items_written.count, rwlock.readers_in); |
1 | jermar | 112 | thread_usleep(100000); |
113 | } |
||
114 | } |
||
2028 | decky | 115 | |
116 | return NULL; |
||
1 | jermar | 117 | } |