Rev 1 | Rev 19 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1 | Rev 15 | ||
---|---|---|---|
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/atomic.h> |
31 | #include <arch/atomic.h> |
32 | #include <print.h> |
32 | #include <print.h> |
33 | #include <proc/thread.h> |
33 | #include <proc/thread.h> |
34 | 34 | ||
35 | #include <synch/waitq.h> |
35 | #include <synch/waitq.h> |
36 | #include <synch/rwlock.h> |
36 | #include <synch/rwlock.h> |
37 | 37 | ||
38 | #define READERS 50 |
38 | #define READERS 50 |
39 | #define WRITERS 50 |
39 | #define WRITERS 50 |
40 | 40 | ||
41 | static rwlock_t rwlock; |
41 | static rwlock_t rwlock; |
42 | 42 | ||
43 | static waitq_t can_start; |
43 | static waitq_t can_start; |
44 | static int items_read; |
44 | static int items_read; |
45 | static int items_written; |
45 | static int items_written; |
46 | 46 | ||
47 | static void writer(void *arg); |
47 | static void writer(void *arg); |
48 | static void reader(void *arg); |
48 | static void reader(void *arg); |
49 | static void failed(void); |
49 | static void failed(void); |
50 | 50 | ||
51 | void writer(void *arg) |
51 | void writer(void *arg) |
52 | { |
52 | { |
53 | waitq_sleep(&can_start); |
53 | waitq_sleep(&can_start); |
54 | 54 | ||
55 | rwlock_write_lock(&rwlock); |
55 | rwlock_write_lock(&rwlock); |
56 | atomic_inc(&items_written); |
56 | atomic_inc(&items_written); |
57 | rwlock_write_unlock(&rwlock); |
57 | rwlock_write_unlock(&rwlock); |
58 | } |
58 | } |
59 | 59 | ||
60 | void reader(void *arg) |
60 | void reader(void *arg) |
61 | { |
61 | { |
62 | waitq_sleep(&can_start); |
62 | waitq_sleep(&can_start); |
63 | 63 | ||
64 | rwlock_read_lock(&rwlock); |
64 | rwlock_read_lock(&rwlock); |
65 | atomic_inc(&items_read); |
65 | atomic_inc(&items_read); |
66 | rwlock_read_unlock(&rwlock); |
66 | rwlock_read_unlock(&rwlock); |
67 | } |
67 | } |
68 | 68 | ||
69 | void failed(void) |
69 | void failed(void) |
70 | { |
70 | { |
71 | printf("Test failed prematurely.\n"); |
71 | printf("Test failed prematurely.\n"); |
72 | thread_exit(); |
72 | thread_exit(); |
73 | } |
73 | } |
74 | 74 | ||
75 | void test(void) |
75 | void test(void) |
76 | { |
76 | { |
77 | int i, j, k; |
77 | int i, j, k; |
78 | int readers, writers; |
78 | int readers, writers; |
79 | 79 | ||
80 | printf("Read/write locks test #5\n"); |
80 | printf("Read/write locks test #5\n"); |
81 | 81 | ||
82 | waitq_initialize(&can_start); |
82 | waitq_initialize(&can_start); |
83 | rwlock_initialize(&rwlock); |
83 | rwlock_initialize(&rwlock); |
84 | 84 | ||
85 | for (i=1; i<=3; i++) { |
85 | for (i=1; i<=3; i++) { |
86 | thread_t *thrd; |
86 | thread_t *thrd; |
87 | 87 | ||
88 | items_read = 0; |
88 | items_read = 0; |
89 | items_written = 0; |
89 | items_written = 0; |
90 | 90 | ||
91 | readers = i*READERS; |
91 | readers = i*READERS; |
92 | writers = (4-i)*WRITERS; |
92 | writers = (4-i)*WRITERS; |
93 | 93 | ||
94 | printf("Creating %d readers and %d writers...", readers, writers); |
94 | printf("Creating %d readers and %d writers...", readers, writers); |
95 | 95 | ||
96 | for (j=0; j<(READERS+WRITERS)/2; j++) { |
96 | for (j=0; j<(READERS+WRITERS)/2; j++) { |
97 | for (k=0; k<i; k++) { |
97 | for (k=0; k<i; k++) { |
98 | thrd = thread_create(reader, NULL, the->task, 0); |
98 | thrd = thread_create(reader, NULL, TASK, 0); |
99 | if (thrd) |
99 | if (thrd) |
100 | thread_ready(thrd); |
100 | thread_ready(thrd); |
101 | else |
101 | else |
102 | failed(); |
102 | failed(); |
103 | } |
103 | } |
104 | for (k=0; k<(4-i); k++) { |
104 | for (k=0; k<(4-i); k++) { |
105 | thrd = thread_create(writer, NULL, the->task, 0); |
105 | thrd = thread_create(writer, NULL, TASK, 0); |
106 | if (thrd) |
106 | if (thrd) |
107 | thread_ready(thrd); |
107 | thread_ready(thrd); |
108 | else |
108 | else |
109 | failed(); |
109 | failed(); |
110 | } |
110 | } |
111 | } |
111 | } |
112 | 112 | ||
113 | printf("ok\n"); |
113 | printf("ok\n"); |
114 | 114 | ||
115 | thread_sleep(1); |
115 | thread_sleep(1); |
116 | waitq_wakeup(&can_start, WAKEUP_ALL); |
116 | waitq_wakeup(&can_start, WAKEUP_ALL); |
117 | 117 | ||
118 | while (items_read != readers || items_written != writers) { |
118 | while (items_read != readers || items_written != writers) { |
119 | printf("%d readers remaining, %d writers remaining, readers_in=%d\n", readers - items_read, writers - items_written, rwlock.readers_in); |
119 | printf("%d readers remaining, %d writers remaining, readers_in=%d\n", readers - items_read, writers - items_written, rwlock.readers_in); |
120 | thread_usleep(100000); |
120 | thread_usleep(100000); |
121 | } |
121 | } |
122 | } |
122 | } |
123 | printf("Test passed.\n"); |
123 | printf("Test passed.\n"); |
124 | } |
124 | } |
125 | 125 |