Subversion Repositories HelenOS

Rev

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