Rev 1062 | Rev 1221 | 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> |
81 | jermar | 37 | #include <panic.h> |
1 | jermar | 38 | |
39 | #include <synch/waitq.h> |
||
40 | #include <synch/rwlock.h> |
||
41 | #include <synch/synch.h> |
||
623 | jermar | 42 | #include <synch/spinlock.h> |
1 | jermar | 43 | |
44 | #define READERS 50 |
||
45 | #define WRITERS 50 |
||
46 | |||
47 | static rwlock_t rwlock; |
||
48 | |||
623 | jermar | 49 | SPINLOCK_INITIALIZE(lock); |
1 | jermar | 50 | |
51 | static waitq_t can_start; |
||
52 | |||
475 | jermar | 53 | __u32 seed = 0xdeadbeef; |
1 | jermar | 54 | |
55 | static __u32 random(__u32 max); |
||
56 | |||
57 | static void writer(void *arg); |
||
58 | static void reader(void *arg); |
||
59 | static void failed(void); |
||
60 | |||
61 | __u32 random(__u32 max) |
||
62 | { |
||
63 | __u32 rc; |
||
64 | |||
65 | spinlock_lock(&lock); |
||
66 | rc = seed % max; |
||
67 | seed = (((seed<<2) ^ (seed>>2)) * 487) + rc; |
||
68 | spinlock_unlock(&lock); |
||
69 | return rc; |
||
70 | } |
||
71 | |||
72 | |||
73 | void writer(void *arg) |
||
74 | { |
||
75 | int rc, to; |
||
76 | waitq_sleep(&can_start); |
||
77 | |||
78 | to = random(40000); |
||
15 | jermar | 79 | printf("cpu%d, tid %d w+ (%d)\n", CPU->id, THREAD->tid, to); |
1 | jermar | 80 | rc = rwlock_write_lock_timeout(&rwlock, to); |
81 | if (SYNCH_FAILED(rc)) { |
||
15 | jermar | 82 | printf("cpu%d, tid %d w!\n", CPU->id, THREAD->tid); |
1 | jermar | 83 | return; |
84 | }; |
||
15 | jermar | 85 | printf("cpu%d, tid %d w=\n", CPU->id, THREAD->tid); |
1 | jermar | 86 | |
87 | if (rwlock.readers_in) panic("Oops."); |
||
88 | thread_usleep(random(1000000)); |
||
89 | if (rwlock.readers_in) panic("Oops."); |
||
90 | |||
91 | rwlock_write_unlock(&rwlock); |
||
15 | jermar | 92 | printf("cpu%d, tid %d w-\n", CPU->id, THREAD->tid); |
1 | jermar | 93 | } |
94 | |||
95 | void reader(void *arg) |
||
96 | { |
||
97 | int rc, to; |
||
98 | waitq_sleep(&can_start); |
||
99 | |||
100 | to = random(2000); |
||
15 | jermar | 101 | printf("cpu%d, tid %d r+ (%d)\n", CPU->id, THREAD->tid, to); |
1 | jermar | 102 | rc = rwlock_read_lock_timeout(&rwlock, to); |
103 | if (SYNCH_FAILED(rc)) { |
||
15 | jermar | 104 | printf("cpu%d, tid %d r!\n", CPU->id, THREAD->tid); |
1 | jermar | 105 | return; |
106 | } |
||
15 | jermar | 107 | printf("cpu%d, tid %d r=\n", CPU->id, THREAD->tid); |
1 | jermar | 108 | thread_usleep(30000); |
109 | rwlock_read_unlock(&rwlock); |
||
15 | jermar | 110 | printf("cpu%d, tid %d r-\n", CPU->id, THREAD->tid); |
1 | jermar | 111 | } |
112 | |||
113 | void failed(void) |
||
114 | { |
||
115 | printf("Test failed prematurely.\n"); |
||
116 | thread_exit(); |
||
117 | } |
||
118 | |||
119 | void test(void) |
||
120 | { |
||
121 | context_t ctx; |
||
122 | __u32 i, k; |
||
123 | |||
124 | printf("Read/write locks test #4\n"); |
||
125 | |||
126 | waitq_initialize(&can_start); |
||
127 | rwlock_initialize(&rwlock); |
||
128 | |||
129 | |||
130 | |||
131 | for (; ;) { |
||
132 | thread_t *thrd; |
||
133 | |||
134 | context_save(&ctx); |
||
135 | printf("sp=%X, readers_in=%d\n", ctx.sp, rwlock.readers_in); |
||
136 | |||
137 | k = random(7) + 1; |
||
138 | printf("Creating %d readers\n", k); |
||
139 | for (i=0; i<k; i++) { |
||
1062 | jermar | 140 | thrd = thread_create(reader, NULL, TASK, 0, "reader"); |
1 | jermar | 141 | if (thrd) |
142 | thread_ready(thrd); |
||
143 | else |
||
144 | failed(); |
||
145 | } |
||
146 | |||
147 | k = random(5) + 1; |
||
148 | printf("Creating %d writers\n", k); |
||
149 | for (i=0; i<k; i++) { |
||
1062 | jermar | 150 | thrd = thread_create(writer, NULL, TASK, 0, "writer"); |
1 | jermar | 151 | if (thrd) |
152 | thread_ready(thrd); |
||
153 | else |
||
154 | failed(); |
||
155 | } |
||
156 | |||
157 | thread_usleep(20000); |
||
158 | waitq_wakeup(&can_start, WAKEUP_ALL); |
||
159 | } |
||
160 | |||
161 | } |