Rev 475 | Rev 532 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 475 | Rev 501 | ||
---|---|---|---|
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/semaphore.h> |
36 | #include <synch/semaphore.h> |
37 | 37 | ||
38 | #define AT_ONCE 3 |
38 | #define AT_ONCE 3 |
39 | #define PRODUCERS 50 |
39 | #define PRODUCERS 50 |
40 | #define CONSUMERS 50 |
40 | #define CONSUMERS 50 |
41 | 41 | ||
42 | static semaphore_t sem; |
42 | static semaphore_t sem; |
43 | 43 | ||
44 | static waitq_t can_start; |
44 | static waitq_t can_start; |
45 | static atomic_t items_produced; |
45 | static atomic_t items_produced; |
46 | static atomic_t items_consumed; |
46 | static atomic_t items_consumed; |
47 | 47 | ||
48 | static void consumer(void *arg); |
48 | static void consumer(void *arg); |
49 | static void producer(void *arg); |
49 | static void producer(void *arg); |
50 | static void failed(void); |
50 | static void failed(void); |
51 | 51 | ||
52 | void producer(void *arg) |
52 | void producer(void *arg) |
53 | { |
53 | { |
54 | waitq_sleep(&can_start); |
54 | waitq_sleep(&can_start); |
55 | 55 | ||
56 | semaphore_down(&sem); |
56 | semaphore_down(&sem); |
57 | atomic_inc(&items_produced); |
57 | atomic_inc(&items_produced); |
58 | thread_usleep(250); |
58 | thread_usleep(250); |
59 | semaphore_up(&sem); |
59 | semaphore_up(&sem); |
60 | } |
60 | } |
61 | 61 | ||
62 | void consumer(void *arg) |
62 | void consumer(void *arg) |
63 | { |
63 | { |
64 | waitq_sleep(&can_start); |
64 | waitq_sleep(&can_start); |
65 | 65 | ||
66 | semaphore_down(&sem); |
66 | semaphore_down(&sem); |
67 | atomic_inc(&items_consumed); |
67 | atomic_inc(&items_consumed); |
68 | thread_usleep(500); |
68 | thread_usleep(500); |
69 | semaphore_up(&sem); |
69 | semaphore_up(&sem); |
70 | } |
70 | } |
71 | 71 | ||
72 | void failed(void) |
72 | void failed(void) |
73 | { |
73 | { |
74 | printf("Test failed prematurely.\n"); |
74 | printf("Test failed prematurely.\n"); |
75 | thread_exit(); |
75 | thread_exit(); |
76 | } |
76 | } |
77 | 77 | ||
78 | void test(void) |
78 | void test(void) |
79 | { |
79 | { |
80 | int i, j, k; |
80 | int i, j, k; |
81 | int consumers, producers; |
81 | int consumers, producers; |
82 | 82 | ||
83 | printf("Semaphore test #1\n"); |
83 | printf("Semaphore test #1\n"); |
84 | 84 | ||
85 | waitq_initialize(&can_start); |
85 | waitq_initialize(&can_start); |
86 | semaphore_initialize(&sem, AT_ONCE); |
86 | semaphore_initialize(&sem, AT_ONCE); |
87 | 87 | ||
88 | 88 | ||
89 | for (i=1; i<=3; i++) { |
89 | for (i=1; i<=3; i++) { |
90 | thread_t *thrd; |
90 | thread_t *thrd; |
91 | 91 | ||
92 | items_produced = 0; |
92 | items_produced = 0; |
93 | items_consumed = 0; |
93 | items_consumed = 0; |
94 | 94 | ||
95 | consumers = i * CONSUMERS; |
95 | consumers = i * CONSUMERS; |
96 | producers = (4-i) * PRODUCERS; |
96 | producers = (4-i) * PRODUCERS; |
97 | 97 | ||
98 | printf("Creating %d consumers and %d producers...", consumers, producers); |
98 | printf("Creating %d consumers and %d producers...", consumers, producers); |
99 | 99 | ||
100 | for (j=0; j<(CONSUMERS+PRODUCERS)/2; j++) { |
100 | for (j=0; j<(CONSUMERS+PRODUCERS)/2; j++) { |
101 | for (k=0; k<i; k++) { |
101 | for (k=0; k<i; k++) { |
102 | thrd = thread_create(consumer, NULL, TASK, 0); |
102 | thrd = thread_create(consumer, NULL, TASK, 0); |
103 | if (thrd) |
103 | if (thrd) |
104 | thread_ready(thrd); |
104 | thread_ready(thrd); |
105 | else |
105 | else |
106 | failed(); |
106 | failed(); |
107 | } |
107 | } |
108 | for (k=0; k<(4-i); k++) { |
108 | for (k=0; k<(4-i); k++) { |
109 | thrd = thread_create(producer, NULL, TASK, 0); |
109 | thrd = thread_create(producer, NULL, TASK, 0); |
110 | if (thrd) |
110 | if (thrd) |
111 | thread_ready(thrd); |
111 | thread_ready(thrd); |
112 | else |
112 | else |
113 | failed(); |
113 | failed(); |
114 | } |
114 | } |
115 | } |
115 | } |
116 | 116 | ||
117 | printf("ok\n"); |
117 | printf("ok\n"); |
118 | 118 | ||
119 | thread_sleep(1); |
119 | thread_sleep(1); |
120 | waitq_wakeup(&can_start, WAKEUP_ALL); |
120 | waitq_wakeup(&can_start, WAKEUP_ALL); |
121 | 121 | ||
122 | while (items_consumed != consumers || items_produced != producers) { |
122 | while (items_consumed != consumers || items_produced != producers) { |
123 | printf("%d consumers remaining, %d producers remaining\n", consumers - items_consumed, producers - items_produced); |
123 | printf("%d consumers remaining, %d producers remaining\n", consumers - items_consumed, producers - items_produced); |
124 | thread_sleep(1); |
124 | thread_sleep(1); |
125 | } |
125 | } |
126 | } |
126 | } |
127 | printf("Test passed.\n"); |
127 | printf("Test passed.\n"); |
128 | } |
128 | } |
129 | 129 |