Rev 2050 | Rev 2216 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1 | jermar | 1 | /* |
2 | * Copyright (C) 2001-2004 Jakub 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 | #include <arch/types.h> |
||
35 | #include <arch/context.h> |
||
205 | jermar | 36 | #include <context.h> |
1 | jermar | 37 | |
38 | #include <synch/waitq.h> |
||
39 | #include <synch/rwlock.h> |
||
40 | #include <synch/synch.h> |
||
623 | jermar | 41 | #include <synch/spinlock.h> |
1 | jermar | 42 | |
43 | #define READERS 50 |
||
44 | #define WRITERS 50 |
||
45 | |||
2053 | decky | 46 | static atomic_t thread_count; |
1 | jermar | 47 | static rwlock_t rwlock; |
2029 | decky | 48 | static atomic_t threads_fault; |
2053 | decky | 49 | static bool sh_quiet; |
1 | jermar | 50 | |
2024 | decky | 51 | SPINLOCK_INITIALIZE(rw_lock); |
1 | jermar | 52 | |
53 | static waitq_t can_start; |
||
54 | |||
2022 | decky | 55 | static uint32_t seed = 0xdeadbeef; |
1 | jermar | 56 | |
2022 | decky | 57 | static uint32_t random(uint32_t max) |
1 | jermar | 58 | { |
1780 | jermar | 59 | uint32_t rc; |
1 | jermar | 60 | |
2024 | decky | 61 | spinlock_lock(&rw_lock); |
1 | jermar | 62 | rc = seed % max; |
63 | seed = (((seed<<2) ^ (seed>>2)) * 487) + rc; |
||
2024 | decky | 64 | spinlock_unlock(&rw_lock); |
1 | jermar | 65 | return rc; |
66 | } |
||
67 | |||
2022 | decky | 68 | static void writer(void *arg) |
1 | jermar | 69 | { |
70 | int rc, to; |
||
1658 | vana | 71 | thread_detach(THREAD); |
1 | jermar | 72 | waitq_sleep(&can_start); |
73 | |||
74 | to = random(40000); |
||
2053 | decky | 75 | |
76 | if (!sh_quiet) |
||
77 | printf("cpu%d, tid %d w+ (%d)\n", CPU->id, THREAD->tid, to); |
||
78 | |||
1 | jermar | 79 | rc = rwlock_write_lock_timeout(&rwlock, to); |
80 | if (SYNCH_FAILED(rc)) { |
||
2053 | decky | 81 | if (!sh_quiet) |
82 | printf("cpu%d, tid %d w!\n", CPU->id, THREAD->tid); |
||
83 | atomic_dec(&thread_count); |
||
1 | jermar | 84 | return; |
2028 | decky | 85 | } |
2053 | decky | 86 | |
87 | if (!sh_quiet) |
||
88 | printf("cpu%d, tid %d w=\n", CPU->id, THREAD->tid); |
||
1 | jermar | 89 | |
2029 | decky | 90 | if (rwlock.readers_in) { |
2053 | decky | 91 | if (!sh_quiet) |
92 | printf("Oops."); |
||
2029 | decky | 93 | atomic_inc(&threads_fault); |
2053 | decky | 94 | atomic_dec(&thread_count); |
2029 | decky | 95 | return; |
96 | } |
||
1 | jermar | 97 | thread_usleep(random(1000000)); |
2029 | decky | 98 | if (rwlock.readers_in) { |
2053 | decky | 99 | if (!sh_quiet) |
100 | printf("Oops."); |
||
2029 | decky | 101 | atomic_inc(&threads_fault); |
2053 | decky | 102 | atomic_dec(&thread_count); |
2029 | decky | 103 | return; |
104 | } |
||
1 | jermar | 105 | |
106 | rwlock_write_unlock(&rwlock); |
||
2053 | decky | 107 | |
108 | if (!sh_quiet) |
||
109 | printf("cpu%d, tid %d w-\n", CPU->id, THREAD->tid); |
||
110 | atomic_dec(&thread_count); |
||
1 | jermar | 111 | } |
112 | |||
2022 | decky | 113 | static void reader(void *arg) |
1 | jermar | 114 | { |
115 | int rc, to; |
||
1658 | vana | 116 | thread_detach(THREAD); |
1 | jermar | 117 | waitq_sleep(&can_start); |
118 | |||
119 | to = random(2000); |
||
2053 | decky | 120 | |
121 | if (!sh_quiet) |
||
122 | printf("cpu%d, tid %d r+ (%d)\n", CPU->id, THREAD->tid, to); |
||
123 | |||
1 | jermar | 124 | rc = rwlock_read_lock_timeout(&rwlock, to); |
125 | if (SYNCH_FAILED(rc)) { |
||
2053 | decky | 126 | if (!sh_quiet) |
127 | printf("cpu%d, tid %d r!\n", CPU->id, THREAD->tid); |
||
128 | atomic_dec(&thread_count); |
||
1 | jermar | 129 | return; |
130 | } |
||
2053 | decky | 131 | |
132 | if (!sh_quiet) |
||
133 | printf("cpu%d, tid %d r=\n", CPU->id, THREAD->tid); |
||
134 | |||
1 | jermar | 135 | thread_usleep(30000); |
136 | rwlock_read_unlock(&rwlock); |
||
2053 | decky | 137 | |
138 | if (!sh_quiet) |
||
139 | printf("cpu%d, tid %d r-\n", CPU->id, THREAD->tid); |
||
140 | atomic_dec(&thread_count); |
||
1 | jermar | 141 | } |
142 | |||
2050 | decky | 143 | char * test_rwlock4(bool quiet) |
1 | jermar | 144 | { |
145 | context_t ctx; |
||
2053 | decky | 146 | uint32_t i; |
147 | sh_quiet = quiet; |
||
1 | jermar | 148 | |
149 | waitq_initialize(&can_start); |
||
150 | rwlock_initialize(&rwlock); |
||
2029 | decky | 151 | atomic_set(&threads_fault, 0); |
1 | jermar | 152 | |
2053 | decky | 153 | uint32_t rd = random(7) + 1; |
154 | uint32_t wr = random(5) + 1; |
||
155 | |||
156 | atomic_set(&thread_count, rd + wr); |
||
157 | |||
2028 | decky | 158 | thread_t *thrd; |
159 | |||
160 | context_save(&ctx); |
||
2053 | decky | 161 | if (!quiet) { |
162 | printf("sp=%#x, readers_in=%d\n", ctx.sp, rwlock.readers_in); |
||
163 | printf("Creating %d readers\n", rd); |
||
164 | } |
||
2028 | decky | 165 | |
2053 | decky | 166 | for (i = 0; i < rd; i++) { |
2042 | decky | 167 | thrd = thread_create(reader, NULL, TASK, 0, "reader", false); |
2028 | decky | 168 | if (thrd) |
169 | thread_ready(thrd); |
||
2053 | decky | 170 | else if (!quiet) |
2028 | decky | 171 | printf("Could not create reader %d\n", i); |
172 | } |
||
1 | jermar | 173 | |
2053 | decky | 174 | if (!quiet) |
175 | printf("Creating %d writers\n", wr); |
||
176 | |||
177 | for (i = 0; i < wr; i++) { |
||
2042 | decky | 178 | thrd = thread_create(writer, NULL, TASK, 0, "writer", false); |
2028 | decky | 179 | if (thrd) |
180 | thread_ready(thrd); |
||
2053 | decky | 181 | else if (!quiet) |
2028 | decky | 182 | printf("Could not create writer %d\n", i); |
183 | } |
||
184 | |||
185 | thread_usleep(20000); |
||
186 | waitq_wakeup(&can_start, WAKEUP_ALL); |
||
187 | |||
2053 | decky | 188 | while (atomic_get(&thread_count) > 0) { |
189 | if (!quiet) |
||
190 | printf("Threads left: %d\n", atomic_get(&thread_count)); |
||
191 | thread_sleep(1); |
||
192 | } |
||
193 | |||
2029 | decky | 194 | if (atomic_get(&threads_fault) == 0) |
195 | return NULL; |
||
196 | |||
197 | return "Test failed"; |
||
1 | jermar | 198 | } |