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