Subversion Repositories HelenOS-historic

Rev

Rev 780 | Rev 1062 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
767 palkovsky 1
/*
2
 * Copyright (C) 2006 Ondrej Palkovsky
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 <mm/slab.h>
31
#include <print.h>
32
#include <proc/thread.h>
33
#include <arch.h>
34
#include <panic.h>
35
#include <mm/frame.h>
768 palkovsky 36
#include <memstr.h>
842 palkovsky 37
#include <synch/condvar.h>
38
#include <synch/mutex.h>
767 palkovsky 39
 
40
#define ITEM_SIZE 256
41
 
42
/** Fill memory with 2 caches, when allocation fails,
43
 *  free one of the caches. We should have everything in magazines,
44
 *  now allocation should clean magazines and allow for full allocation.
45
 */
46
static void totalmemtest(void)
47
{
48
    slab_cache_t *cache1;
49
    slab_cache_t *cache2;
50
    int i;
51
 
52
    void *data1, *data2;
53
    void *olddata1=NULL, *olddata2=NULL;
54
 
55
    cache1 = slab_cache_create("cache1_tst", ITEM_SIZE, 0, NULL, NULL, 0);
56
    cache2 = slab_cache_create("cache2_tst", ITEM_SIZE, 0, NULL, NULL, 0);
57
 
58
    printf("Allocating...");
59
    /* Use atomic alloc, so that we find end of memory */
60
    do {
61
        data1 = slab_alloc(cache1, FRAME_ATOMIC);
62
        data2 = slab_alloc(cache2, FRAME_ATOMIC);
63
        if (!data1 || !data2) {
64
            if (data1)
65
                slab_free(cache1,data1);
66
            if (data2)
67
                slab_free(cache2,data2);
68
            break;
69
        }
768 palkovsky 70
        memsetb((__address)data1, ITEM_SIZE, 0);
71
        memsetb((__address)data2, ITEM_SIZE, 0);
767 palkovsky 72
        *((void **)data1) = olddata1;
73
        *((void **)data2) = olddata2;
74
        olddata1 = data1;
75
        olddata2 = data2;
76
    }while(1);
77
    printf("done.\n");
78
    /* We do not have memory - now deallocate cache2 */
79
    printf("Deallocating cache2...");
80
    while (olddata2) {
81
        data2 = *((void **)olddata2);
82
        slab_free(cache2, olddata2);
83
        olddata2 = data2;
84
    }
85
    printf("done.\n");
86
 
87
    printf("Allocating to cache1...\n");
88
    for (i=0; i<30; i++) {
89
        data1 = slab_alloc(cache1, FRAME_ATOMIC);
90
        if (!data1) {
91
            panic("Incorrect memory size - use another test.");
92
        }
768 palkovsky 93
        memsetb((__address)data1, ITEM_SIZE, 0);
767 palkovsky 94
        *((void **)data1) = olddata1;
95
        olddata1 = data1;
96
    }
97
    while (1) {
98
        data1 = slab_alloc(cache1, FRAME_ATOMIC);
99
        if (!data1) {
100
            break;
101
        }
768 palkovsky 102
        memsetb((__address)data1, ITEM_SIZE, 0);
767 palkovsky 103
        *((void **)data1) = olddata1;
104
        olddata1 = data1;
105
    }
768 palkovsky 106
    printf("Deallocating cache1...");
107
    while (olddata1) {
108
        data1 = *((void **)olddata1);
109
        slab_free(cache1, olddata1);
110
        olddata1 = data1;
111
    }
112
    printf("done.\n");
113
    slab_print_list();
114
    slab_cache_destroy(cache1);
115
    slab_cache_destroy(cache2);
767 palkovsky 116
}
117
 
773 palkovsky 118
slab_cache_t *thr_cache;
119
semaphore_t thr_sem;
842 palkovsky 120
condvar_t thread_starter;
121
mutex_t starter_mutex;
773 palkovsky 122
 
123
#define THREADS 8
124
 
125
static void thread(void *priv)
126
{
127
    void *data=NULL, *new;
128
 
842 palkovsky 129
    mutex_lock(&starter_mutex);
130
    condvar_wait(&thread_starter,&starter_mutex);
131
    mutex_unlock(&starter_mutex);
132
 
773 palkovsky 133
    printf("Starting thread #%d...\n",THREAD->tid);
134
 
135
    /* Alloc all */
136
    printf("Thread #%d allocating...\n", THREAD->tid);
137
    while (1) {
138
        /* Call with atomic to detect end of memory */
139
        new = slab_alloc(thr_cache, FRAME_ATOMIC);
140
        if (!new)
141
            break;
142
        *((void **)new) = data;
143
        data = new;
144
    }
145
    printf("Thread #%d releasing...\n", THREAD->tid);
146
    while (data) {
147
        new = *((void **)data);
148
        slab_free(thr_cache, data);
149
        data = new;
150
    }
151
    printf("Thread #%d allocating...\n", THREAD->tid);
152
    while (1) {
153
        /* Call with atomic to detect end of memory */
154
        new = slab_alloc(thr_cache, FRAME_ATOMIC);
155
        if (!new)
156
            break;
157
        *((void **)new) = data;
158
        data = new;
159
    }
160
    printf("Thread #%d releasing...\n", THREAD->tid);
161
    while (data) {
162
        new = *((void **)data);
163
        slab_free(thr_cache, data);
164
        data = new;
165
    }
166
 
167
 
168
    printf("Thread #%d finished\n", THREAD->tid);
169
    slab_print_list();
170
    semaphore_up(&thr_sem);
171
}
172
 
173
 
174
static void multitest(int size)
175
{
176
    /* Start 8 threads that just allocate as much as possible,
177
     * then release everything, then again allocate, then release
178
     */
179
    thread_t *t;
180
    int i;
181
 
182
    printf("Running stress test with size %d\n", size);
842 palkovsky 183
    condvar_initialize(&thread_starter);
184
    mutex_initialize(&starter_mutex);
185
 
773 palkovsky 186
    thr_cache = slab_cache_create("thread_cache", size, 0,
187
                      NULL, NULL,
188
                      0);
189
    semaphore_initialize(&thr_sem,0);
190
    for (i=0; i<THREADS; i++) {  
191
        if (!(t = thread_create(thread, NULL, TASK, 0)))
192
            panic("could not create thread\n");
193
        thread_ready(t);
194
    }
842 palkovsky 195
    thread_sleep(1);
196
    condvar_broadcast(&thread_starter);
773 palkovsky 197
 
198
    for (i=0; i<THREADS; i++)
199
        semaphore_down(&thr_sem);
200
 
201
    slab_cache_destroy(thr_cache);
202
    printf("Stress test complete.\n");
203
}
204
 
767 palkovsky 205
void test(void)
206
{
773 palkovsky 207
    printf("Running reclaim single-thread test .. pass1\n");
767 palkovsky 208
    totalmemtest();
773 palkovsky 209
    printf("Running reclaim single-thread test .. pass2\n");
768 palkovsky 210
    totalmemtest();
211
    printf("Reclaim test OK.\n");
773 palkovsky 212
 
213
    multitest(128);
214
    multitest(2048);
780 palkovsky 215
    multitest(8192);
773 palkovsky 216
    printf("All done.\n");
767 palkovsky 217
}