source: mainline/kernel/test/mm/slab2.c@ a85aebd

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since a85aebd was cb01e1e, checked in by Martin Decky <martin@…>, 17 years ago

use global variable and a macro for silencing tests

  • Property mode set to 100644
File size: 6.0 KB
RevLine 
[4a5b2b0e]1/*
[df4ed85]2 * Copyright (c) 2006 Ondrej Palkovsky
[4a5b2b0e]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>
[086a600]35#include <memstr.h>
[2a46e10]36#include <synch/condvar.h>
37#include <synch/mutex.h>
[4a5b2b0e]38
[cb01e1e]39#define ITEM_SIZE 256
[4a5b2b0e]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 */
[cb01e1e]45static void totalmemtest(void)
[4a5b2b0e]46{
47 slab_cache_t *cache1;
48 slab_cache_t *cache2;
49 int i;
[cb01e1e]50
[4a5b2b0e]51 void *data1, *data2;
[deada67]52 void *olddata1 = NULL, *olddata2 = NULL;
[4a5b2b0e]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);
[deada67]56
[cb01e1e]57 TPRINTF("Allocating...");
[deada67]58
[4a5b2b0e]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);
[deada67]63 if ((!data1) || (!data2)) {
[4a5b2b0e]64 if (data1)
[deada67]65 slab_free(cache1, data1);
[4a5b2b0e]66 if (data2)
[deada67]67 slab_free(cache2, data2);
[4a5b2b0e]68 break;
69 }
[e32e092]70 memsetb(data1, ITEM_SIZE, 0);
71 memsetb(data2, ITEM_SIZE, 0);
[deada67]72 *((void **) data1) = olddata1;
73 *((void **) data2) = olddata2;
[4a5b2b0e]74 olddata1 = data1;
75 olddata2 = data2;
[cb01e1e]76 } while (true);
[deada67]77
[cb01e1e]78 TPRINTF("done.\n");
79
80 TPRINTF("Deallocating cache2...");
[deada67]81
[4a5b2b0e]82 /* We do not have memory - now deallocate cache2 */
83 while (olddata2) {
[deada67]84 data2 = *((void **) olddata2);
[4a5b2b0e]85 slab_free(cache2, olddata2);
86 olddata2 = data2;
87 }
[deada67]88
[cb01e1e]89 TPRINTF("done.\n");
90
91 TPRINTF("Allocating to cache1...\n");
[deada67]92
93 for (i = 0; i < 30; i++) {
[4a5b2b0e]94 data1 = slab_alloc(cache1, FRAME_ATOMIC);
95 if (!data1) {
[cb01e1e]96 TPRINTF("Incorrect memory size - use another test.");
[7e13972]97 return;
[4a5b2b0e]98 }
[e32e092]99 memsetb(data1, ITEM_SIZE, 0);
[deada67]100 *((void **) data1) = olddata1;
[4a5b2b0e]101 olddata1 = data1;
102 }
[cb01e1e]103 while (true) {
[4a5b2b0e]104 data1 = slab_alloc(cache1, FRAME_ATOMIC);
[deada67]105 if (!data1)
[4a5b2b0e]106 break;
[e32e092]107 memsetb(data1, ITEM_SIZE, 0);
[deada67]108 *((void **) data1) = olddata1;
[4a5b2b0e]109 olddata1 = data1;
110 }
[deada67]111
[cb01e1e]112 TPRINTF("Deallocating cache1...");
[deada67]113
[086a600]114 while (olddata1) {
[deada67]115 data1 = *((void **) olddata1);
[086a600]116 slab_free(cache1, olddata1);
117 olddata1 = data1;
118 }
[deada67]119
[cb01e1e]120 TPRINTF("done.\n");
121
122 slab_print_list();
[deada67]123
[086a600]124 slab_cache_destroy(cache1);
125 slab_cache_destroy(cache2);
[4a5b2b0e]126}
127
[70b6de1]128static slab_cache_t *thr_cache;
129static semaphore_t thr_sem;
130static condvar_t thread_starter;
131static mutex_t starter_mutex;
[c5613b72]132
[cb01e1e]133#define THREADS 8
[c5613b72]134
[ff14c520]135static void slabtest(void *priv)
[c5613b72]136{
[96348adc]137 void *data = NULL, *new;
[deada67]138
[8d6d76a]139 thread_detach(THREAD);
[deada67]140
[2a46e10]141 mutex_lock(&starter_mutex);
142 condvar_wait(&thread_starter,&starter_mutex);
143 mutex_unlock(&starter_mutex);
[deada67]144
[cb01e1e]145 TPRINTF("Starting thread #%" PRIu64 "...\n", THREAD->tid);
[c5613b72]146
147 /* Alloc all */
[cb01e1e]148 TPRINTF("Thread #%" PRIu64 " allocating...\n", THREAD->tid);
[deada67]149
[cb01e1e]150 while (true) {
[c5613b72]151 /* Call with atomic to detect end of memory */
152 new = slab_alloc(thr_cache, FRAME_ATOMIC);
153 if (!new)
154 break;
[deada67]155 *((void **) new) = data;
[c5613b72]156 data = new;
157 }
[deada67]158
[cb01e1e]159 TPRINTF("Thread #%" PRIu64 " releasing...\n", THREAD->tid);
[deada67]160
[c5613b72]161 while (data) {
162 new = *((void **)data);
[deada67]163 *((void **) data) = NULL;
[c5613b72]164 slab_free(thr_cache, data);
165 data = new;
166 }
[deada67]167
[cb01e1e]168 TPRINTF("Thread #%" PRIu64 " allocating...\n", THREAD->tid);
[deada67]169
[cb01e1e]170 while (true) {
[c5613b72]171 /* Call with atomic to detect end of memory */
172 new = slab_alloc(thr_cache, FRAME_ATOMIC);
173 if (!new)
174 break;
[deada67]175 *((void **) new) = data;
[c5613b72]176 data = new;
177 }
[deada67]178
[cb01e1e]179 TPRINTF("Thread #%" PRIu64 " releasing...\n", THREAD->tid);
[deada67]180
[c5613b72]181 while (data) {
182 new = *((void **)data);
[deada67]183 *((void **) data) = NULL;
[c5613b72]184 slab_free(thr_cache, data);
185 data = new;
186 }
[deada67]187
[cb01e1e]188 TPRINTF("Thread #%" PRIu64 " finished\n", THREAD->tid);
[deada67]189
[c5613b72]190 slab_print_list();
191 semaphore_up(&thr_sem);
192}
193
[cb01e1e]194static void multitest(int size)
[c5613b72]195{
196 /* Start 8 threads that just allocate as much as possible,
197 * then release everything, then again allocate, then release
198 */
199 thread_t *t;
200 int i;
[deada67]201
[cb01e1e]202 TPRINTF("Running stress test with size %d\n", size);
[deada67]203
[2a46e10]204 condvar_initialize(&thread_starter);
[08a19ba]205 mutex_initialize(&starter_mutex, MUTEX_PASSIVE);
[cb01e1e]206
[deada67]207 thr_cache = slab_cache_create("thread_cache", size, 0, NULL, NULL, 0);
[c5613b72]208 semaphore_initialize(&thr_sem,0);
[96348adc]209 for (i = 0; i < THREADS; i++) {
[deada67]210 if (!(t = thread_create(slabtest, NULL, TASK, 0, "slabtest", false))) {
[cb01e1e]211 TPRINTF("Could not create thread %d\n", i);
[deada67]212 } else
[96348adc]213 thread_ready(t);
[c5613b72]214 }
[2a46e10]215 thread_sleep(1);
216 condvar_broadcast(&thread_starter);
[cb01e1e]217
[96348adc]218 for (i = 0; i < THREADS; i++)
[c5613b72]219 semaphore_down(&thr_sem);
220
221 slab_cache_destroy(thr_cache);
[cb01e1e]222 TPRINTF("Stress test complete.\n");
[c5613b72]223}
224
[cb01e1e]225char *test_slab2(void)
[4a5b2b0e]226{
[cb01e1e]227 TPRINTF("Running reclaim single-thread test .. pass 1\n");
228 totalmemtest();
229
230 TPRINTF("Running reclaim single-thread test .. pass 2\n");
231 totalmemtest();
232
233 TPRINTF("Reclaim test OK.\n");
234
235 multitest(128);
236 multitest(2048);
237 multitest(8192);
[96348adc]238
239 return NULL;
[4a5b2b0e]240}
Note: See TracBrowser for help on using the repository browser.