Rev 1658 | Rev 2022 | 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 | |||
| 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 | |
| 47 | static void writer(void *arg); |
||
| 48 | static void reader(void *arg); |
||
| 49 | static void failed(void); |
||
| 50 | |||
| 51 | void writer(void *arg) |
||
| 52 | { |
||
| 1658 | vana | 53 | thread_detach(THREAD); |
| 54 | |||
| 1 | jermar | 55 | waitq_sleep(&can_start); |
| 56 | |||
| 57 | rwlock_write_lock(&rwlock); |
||
| 58 | atomic_inc(&items_written); |
||
| 59 | rwlock_write_unlock(&rwlock); |
||
| 60 | } |
||
| 61 | |||
| 62 | void reader(void *arg) |
||
| 63 | { |
||
| 1658 | vana | 64 | thread_detach(THREAD); |
| 65 | |||
| 1 | jermar | 66 | waitq_sleep(&can_start); |
| 67 | |||
| 68 | rwlock_read_lock(&rwlock); |
||
| 69 | atomic_inc(&items_read); |
||
| 70 | rwlock_read_unlock(&rwlock); |
||
| 71 | } |
||
| 72 | |||
| 73 | void failed(void) |
||
| 74 | { |
||
| 75 | printf("Test failed prematurely.\n"); |
||
| 76 | thread_exit(); |
||
| 77 | } |
||
| 78 | |||
| 79 | void test(void) |
||
| 80 | { |
||
| 81 | int i, j, k; |
||
| 483 | jermar | 82 | count_t readers, writers; |
| 1 | jermar | 83 | |
| 84 | printf("Read/write locks test #5\n"); |
||
| 85 | |||
| 86 | waitq_initialize(&can_start); |
||
| 87 | rwlock_initialize(&rwlock); |
||
| 88 | |||
| 89 | for (i=1; i<=3; i++) { |
||
| 90 | thread_t *thrd; |
||
| 91 | |||
| 627 | jermar | 92 | atomic_set(&items_read, 0); |
| 93 | atomic_set(&items_written, 0); |
||
| 1 | jermar | 94 | |
| 95 | readers = i*READERS; |
||
| 96 | writers = (4-i)*WRITERS; |
||
| 97 | |||
| 1196 | cejka | 98 | printf("Creating %ld readers and %ld writers...", readers, writers); |
| 1 | jermar | 99 | |
| 100 | for (j=0; j<(READERS+WRITERS)/2; j++) { |
||
| 101 | for (k=0; k<i; k++) { |
||
| 1062 | jermar | 102 | thrd = thread_create(reader, NULL, TASK, 0, "reader"); |
| 1 | jermar | 103 | if (thrd) |
| 104 | thread_ready(thrd); |
||
| 105 | else |
||
| 106 | failed(); |
||
| 107 | } |
||
| 108 | for (k=0; k<(4-i); k++) { |
||
| 1062 | jermar | 109 | thrd = thread_create(writer, NULL, TASK, 0, "writer"); |
| 1 | jermar | 110 | if (thrd) |
| 111 | thread_ready(thrd); |
||
| 112 | else |
||
| 113 | failed(); |
||
| 114 | } |
||
| 115 | } |
||
| 116 | |||
| 117 | printf("ok\n"); |
||
| 118 | |||
| 119 | thread_sleep(1); |
||
| 120 | waitq_wakeup(&can_start, WAKEUP_ALL); |
||
| 121 | |||
| 627 | jermar | 122 | while (items_read.count != readers || items_written.count != writers) { |
| 1196 | cejka | 123 | printf("%zd readers remaining, %zd writers remaining, readers_in=%zd\n", readers - items_read.count, writers - items_written.count, rwlock.readers_in); |
| 1 | jermar | 124 | thread_usleep(100000); |
| 125 | } |
||
| 126 | } |
||
| 127 | printf("Test passed.\n"); |
||
| 128 | } |