Subversion Repositories HelenOS-historic

Rev

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