Rev 1062 | Rev 1658 | 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> |
||
| 36 | |||
| 37 | #include <synch/waitq.h> |
||
| 38 | #include <synch/semaphore.h> |
||
| 39 | #include <synch/synch.h> |
||
| 623 | jermar | 40 | #include <synch/spinlock.h> |
| 1 | jermar | 41 | |
| 42 | static semaphore_t sem; |
||
| 43 | |||
| 623 | jermar | 44 | SPINLOCK_INITIALIZE(lock); |
| 1 | jermar | 45 | |
| 46 | static waitq_t can_start; |
||
| 47 | |||
| 475 | jermar | 48 | __u32 seed = 0xdeadbeef; |
| 1 | jermar | 49 | |
| 50 | static __u32 random(__u32 max); |
||
| 51 | |||
| 52 | static void consumer(void *arg); |
||
| 53 | static void failed(void); |
||
| 54 | |||
| 55 | __u32 random(__u32 max) |
||
| 56 | { |
||
| 57 | __u32 rc; |
||
| 58 | |||
| 59 | spinlock_lock(&lock); |
||
| 60 | rc = seed % max; |
||
| 61 | seed = (((seed<<2) ^ (seed>>2)) * 487) + rc; |
||
| 62 | spinlock_unlock(&lock); |
||
| 63 | return rc; |
||
| 64 | } |
||
| 65 | |||
| 66 | |||
| 67 | void consumer(void *arg) |
||
| 68 | { |
||
| 69 | int rc, to; |
||
| 70 | waitq_sleep(&can_start); |
||
| 71 | |||
| 72 | to = random(20000); |
||
| 15 | jermar | 73 | printf("cpu%d, tid %d down+ (%d)\n", CPU->id, THREAD->tid, to); |
| 1 | jermar | 74 | rc = semaphore_down_timeout(&sem, to); |
| 75 | if (SYNCH_FAILED(rc)) { |
||
| 15 | jermar | 76 | printf("cpu%d, tid %d down!\n", CPU->id, THREAD->tid); |
| 1 | jermar | 77 | return; |
| 78 | } |
||
| 79 | |||
| 15 | jermar | 80 | printf("cpu%d, tid %d down=\n", CPU->id, THREAD->tid); |
| 1 | jermar | 81 | thread_usleep(random(30000)); |
| 82 | |||
| 83 | semaphore_up(&sem); |
||
| 15 | jermar | 84 | printf("cpu%d, tid %d up\n", CPU->id, THREAD->tid); |
| 1 | jermar | 85 | } |
| 86 | |||
| 87 | void failed(void) |
||
| 88 | { |
||
| 89 | printf("Test failed prematurely.\n"); |
||
| 90 | thread_exit(); |
||
| 91 | } |
||
| 92 | |||
| 93 | void test(void) |
||
| 94 | { |
||
| 95 | __u32 i, k; |
||
| 96 | |||
| 97 | printf("Semaphore test #2\n"); |
||
| 98 | |||
| 99 | waitq_initialize(&can_start); |
||
| 100 | semaphore_initialize(&sem, 5); |
||
| 101 | |||
| 102 | |||
| 103 | |||
| 104 | for (; ;) { |
||
| 105 | thread_t *thrd; |
||
| 106 | |||
| 107 | k = random(7) + 1; |
||
| 108 | printf("Creating %d consumers\n", k); |
||
| 109 | for (i=0; i<k; i++) { |
||
| 1062 | jermar | 110 | thrd = thread_create(consumer, NULL, TASK, 0, "consumer"); |
| 1 | jermar | 111 | if (thrd) |
| 112 | thread_ready(thrd); |
||
| 113 | else |
||
| 114 | failed(); |
||
| 115 | } |
||
| 116 | |||
| 117 | thread_usleep(20000); |
||
| 118 | waitq_wakeup(&can_start, WAKEUP_ALL); |
||
| 119 | } |
||
| 120 | |||
| 121 | } |