Subversion Repositories HelenOS

Rev

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

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