WebSVN – HelenOS – Diff – /trunk/kernel/test/mm/slab2.c


/*
 * Copyright (C) 2006 Ondrej Palkovsky
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <test.h>
#include <mm/slab.h>
#include <print.h>
#include <proc/thread.h>
#include <arch.h>
 
#include <mm/frame.h>
#include <memstr.h>
#include <synch/condvar.h>
#include <synch/mutex.h>
 
#define ITEM_SIZE 256
 
/** Fill memory with 2 caches, when allocation fails,
 *  free one of the caches. We should have everything in magazines,
 *  now allocation should clean magazines and allow for full allocation.
 */
static void totalmemtest(void)
{
    slab_cache_t *cache1;
    slab_cache_t *cache2;
    int i;
 
    void *data1, *data2;
    void *olddata1=NULL, *olddata2=NULL;
   
    cache1 = slab_cache_create("cache1_tst", ITEM_SIZE, 0, NULL, NULL, 0);
    cache2 = slab_cache_create("cache2_tst", ITEM_SIZE, 0, NULL, NULL, 0);
 
    printf("Allocating...");
    /* Use atomic alloc, so that we find end of memory */
    do {
        data1 = slab_alloc(cache1, FRAME_ATOMIC);
        data2 = slab_alloc(cache2, FRAME_ATOMIC);
        if (!data1 || !data2) {
            if (data1)
                slab_free(cache1,data1);
            if (data2)
                slab_free(cache2,data2);
            break;
        }
        memsetb((uintptr_t)data1, ITEM_SIZE, 0);
        memsetb((uintptr_t)data2, ITEM_SIZE, 0);
        *((void **)data1) = olddata1;
        *((void **)data2) = olddata2;
        olddata1 = data1;
        olddata2 = data2;
    } while(1);
    printf("done.\n");
    /* We do not have memory - now deallocate cache2 */
    printf("Deallocating cache2...");
    while (olddata2) {
        data2 = *((void **)olddata2);
        slab_free(cache2, olddata2);
        olddata2 = data2;
    }
    printf("done.\n");
 
    printf("Allocating to cache1...\n");
    for (i=0; i<30; i++) {
        data1 = slab_alloc(cache1, FRAME_ATOMIC);
        if (!data1) {
            printf("Incorrect memory size - use another test.");
            return;
        }
        memsetb((uintptr_t)data1, ITEM_SIZE, 0);
        *((void **)data1) = olddata1;
        olddata1 = data1;
    }
    while (1) {
        data1 = slab_alloc(cache1, FRAME_ATOMIC);
        if (!data1) {
            break;
        }
        memsetb((uintptr_t)data1, ITEM_SIZE, 0);
        *((void **)data1) = olddata1;
        olddata1 = data1;
    }
    printf("Deallocating cache1...");
    while (olddata1) {
        data1 = *((void **)olddata1);
        slab_free(cache1, olddata1);
        olddata1 = data1;
    }
    printf("done.\n");
    slab_print_list();
    slab_cache_destroy(cache1);
    slab_cache_destroy(cache2);
}
 
static slab_cache_t *thr_cache;
static semaphore_t thr_sem;
static condvar_t thread_starter;
static mutex_t starter_mutex;
 
#define THREADS 8
 
static void slabtest(void *priv)
{
    void *data = NULL, *new;
 
    thread_detach(THREAD);
 
    mutex_lock(&starter_mutex);
    condvar_wait(&thread_starter,&starter_mutex);
    mutex_unlock(&starter_mutex);
       
    printf("Starting thread #%d...\n",THREAD->tid);
 
    /* Alloc all */
    printf("Thread #%d allocating...\n", THREAD->tid);
    while (1) {
        /* Call with atomic to detect end of memory */
        new = slab_alloc(thr_cache, FRAME_ATOMIC);
        if (!new)
            break;
        *((void **)new) = data;
        data = new;
    }
    printf("Thread #%d releasing...\n", THREAD->tid);
    while (data) {
        new = *((void **)data);
        *((void **)data) = NULL;
        slab_free(thr_cache, data);
        data = new;
    }
    printf("Thread #%d allocating...\n", THREAD->tid);
    while (1) {
        /* Call with atomic to detect end of memory */
        new = slab_alloc(thr_cache, FRAME_ATOMIC);
        if (!new)
            break;
        *((void **)new) = data;
        data = new;
    }
    printf("Thread #%d releasing...\n", THREAD->tid);
    while (data) {
        new = *((void **)data);
        *((void **)data) = NULL;
        slab_free(thr_cache, data);
        data = new;
    }
 
    printf("Thread #%d finished\n", THREAD->tid);
    slab_print_list();
    semaphore_up(&thr_sem);
}
 
static void multitest(int size)
{
    /* Start 8 threads that just allocate as much as possible,
     * then release everything, then again allocate, then release
     */
    thread_t *t;
    int i;
 
    printf("Running stress test with size %d\n", size);
    condvar_initialize(&thread_starter);
    mutex_initialize(&starter_mutex);
 
    thr_cache = slab_cache_create("thread_cache", size, 0,
                      NULL, NULL,
                      0);
    semaphore_initialize(&thr_sem,0);
    for (i = 0; i < THREADS; i++) {  
        if (!(t = thread_create(slabtest, NULL, TASK, 0, "slabtest")))
            printf("Could not create thread %d\n", i);
        else
            thread_ready(t);
    }
    thread_sleep(1);
    condvar_broadcast(&thread_starter);
 
    for (i = 0; i < THREADS; i++)
        semaphore_down(&thr_sem);
   
    slab_cache_destroy(thr_cache);
    printf("Stress test complete.\n");
}
 
char * test_slab2(void)
{
    printf("Running reclaim single-thread test .. pass 1\n");
    totalmemtest();
    printf("Running reclaim single-thread test .. pass 2\n");
    totalmemtest();
    printf("Reclaim test OK.\n");
 
    multitest(128);
    multitest(2048);
    multitest(8192);
    printf("All done.\n");
   
    return NULL;
}
 

Rev 2028	Rev 2029
1	/*	1	/*
2	* Copyright (C) 2006 Ondrej Palkovsky	2	* Copyright (C) 2006 Ondrej Palkovsky
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	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	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.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	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	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	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	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	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	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.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	#include <test.h>	29	#include <test.h>
30	#include <mm/slab.h>	30	#include <mm/slab.h>
31	#include <print.h>	31	#include <print.h>
32	#include <proc/thread.h>	32	#include <proc/thread.h>
33	#include <arch.h>	33	#include <arch.h>
34	#include <panic.h>	-
35	#include <mm/frame.h>	34	#include <mm/frame.h>
36	#include <memstr.h>	35	#include <memstr.h>
37	#include <synch/condvar.h>	36	#include <synch/condvar.h>
38	#include <synch/mutex.h>	37	#include <synch/mutex.h>
39		38
40	#define ITEM_SIZE 256	39	#define ITEM_SIZE 256
41		40
42	/** Fill memory with 2 caches, when allocation fails,	41	/** Fill memory with 2 caches, when allocation fails,
43	* free one of the caches. We should have everything in magazines,	42	* free one of the caches. We should have everything in magazines,
44	* now allocation should clean magazines and allow for full allocation.	43	* now allocation should clean magazines and allow for full allocation.
45	*/	44	*/
46	static void totalmemtest(void)	45	static void totalmemtest(void)
47	{	46	{
48	slab_cache_t *cache1;	47	slab_cache_t *cache1;
49	slab_cache_t *cache2;	48	slab_cache_t *cache2;
50	int i;	49	int i;
51		50
52	void data1, data2;	51	void data1, data2;
53	void olddata1=NULL, olddata2=NULL;	52	void olddata1=NULL, olddata2=NULL;
54		53
55	cache1 = slab_cache_create("cache1_tst", ITEM_SIZE, 0, NULL, NULL, 0);	54	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);	55	cache2 = slab_cache_create("cache2_tst", ITEM_SIZE, 0, NULL, NULL, 0);
57		56
58	printf("Allocating...");	57	printf("Allocating...");
59	/* Use atomic alloc, so that we find end of memory */	58	/* Use atomic alloc, so that we find end of memory */
60	do {	59	do {
61	data1 = slab_alloc(cache1, FRAME_ATOMIC);	60	data1 = slab_alloc(cache1, FRAME_ATOMIC);
62	data2 = slab_alloc(cache2, FRAME_ATOMIC);	61	data2 = slab_alloc(cache2, FRAME_ATOMIC);
63	if (!data1 \|\| !data2) {	62	if (!data1 \|\| !data2) {
64	if (data1)	63	if (data1)
65	slab_free(cache1,data1);	64	slab_free(cache1,data1);
66	if (data2)	65	if (data2)
67	slab_free(cache2,data2);	66	slab_free(cache2,data2);
68	break;	67	break;
69	}	68	}
70	memsetb((uintptr_t)data1, ITEM_SIZE, 0);	69	memsetb((uintptr_t)data1, ITEM_SIZE, 0);
71	memsetb((uintptr_t)data2, ITEM_SIZE, 0);	70	memsetb((uintptr_t)data2, ITEM_SIZE, 0);
72	((void *)data1) = olddata1;	71	((void *)data1) = olddata1;
73	((void *)data2) = olddata2;	72	((void *)data2) = olddata2;
74	olddata1 = data1;	73	olddata1 = data1;
75	olddata2 = data2;	74	olddata2 = data2;
76	} while(1);	75	} while(1);
77	printf("done.\n");	76	printf("done.\n");
78	/* We do not have memory - now deallocate cache2 */	77	/* We do not have memory - now deallocate cache2 */
79	printf("Deallocating cache2...");	78	printf("Deallocating cache2...");
80	while (olddata2) {	79	while (olddata2) {
81	data2 = ((void *)olddata2);	80	data2 = ((void *)olddata2);
82	slab_free(cache2, olddata2);	81	slab_free(cache2, olddata2);
83	olddata2 = data2;	82	olddata2 = data2;
84	}	83	}
85	printf("done.\n");	84	printf("done.\n");
86		85
87	printf("Allocating to cache1...\n");	86	printf("Allocating to cache1...\n");
88	for (i=0; i<30; i++) {	87	for (i=0; i<30; i++) {
89	data1 = slab_alloc(cache1, FRAME_ATOMIC);	88	data1 = slab_alloc(cache1, FRAME_ATOMIC);
90	if (!data1) {	89	if (!data1) {
91	panic("Incorrect memory size - use another test.");	90	printf("Incorrect memory size - use another test.");
-		91	return;
92	}	92	}
93	memsetb((uintptr_t)data1, ITEM_SIZE, 0);	93	memsetb((uintptr_t)data1, ITEM_SIZE, 0);
94	((void *)data1) = olddata1;	94	((void *)data1) = olddata1;
95	olddata1 = data1;	95	olddata1 = data1;
96	}	96	}
97	while (1) {	97	while (1) {
98	data1 = slab_alloc(cache1, FRAME_ATOMIC);	98	data1 = slab_alloc(cache1, FRAME_ATOMIC);
99	if (!data1) {	99	if (!data1) {
100	break;	100	break;
101	}	101	}
102	memsetb((uintptr_t)data1, ITEM_SIZE, 0);	102	memsetb((uintptr_t)data1, ITEM_SIZE, 0);
103	((void *)data1) = olddata1;	103	((void *)data1) = olddata1;
104	olddata1 = data1;	104	olddata1 = data1;
105	}	105	}
106	printf("Deallocating cache1...");	106	printf("Deallocating cache1...");
107	while (olddata1) {	107	while (olddata1) {
108	data1 = ((void *)olddata1);	108	data1 = ((void *)olddata1);
109	slab_free(cache1, olddata1);	109	slab_free(cache1, olddata1);
110	olddata1 = data1;	110	olddata1 = data1;
111	}	111	}
112	printf("done.\n");	112	printf("done.\n");
113	slab_print_list();	113	slab_print_list();
114	slab_cache_destroy(cache1);	114	slab_cache_destroy(cache1);
115	slab_cache_destroy(cache2);	115	slab_cache_destroy(cache2);
116	}	116	}
117		117
118	static slab_cache_t *thr_cache;	118	static slab_cache_t *thr_cache;
119	static semaphore_t thr_sem;	119	static semaphore_t thr_sem;
120	static condvar_t thread_starter;	120	static condvar_t thread_starter;
121	static mutex_t starter_mutex;	121	static mutex_t starter_mutex;
122		122
123	#define THREADS 8	123	#define THREADS 8
124		124
125	static void slabtest(void *priv)	125	static void slabtest(void *priv)
126	{	126	{
127	void data = NULL, new;	127	void data = NULL, new;
128		128
129	thread_detach(THREAD);	129	thread_detach(THREAD);
130		130
131	mutex_lock(&starter_mutex);	131	mutex_lock(&starter_mutex);
132	condvar_wait(&thread_starter,&starter_mutex);	132	condvar_wait(&thread_starter,&starter_mutex);
133	mutex_unlock(&starter_mutex);	133	mutex_unlock(&starter_mutex);
134		134
135	printf("Starting thread #%d...\n",THREAD->tid);	135	printf("Starting thread #%d...\n",THREAD->tid);
136		136
137	/* Alloc all */	137	/* Alloc all */
138	printf("Thread #%d allocating...\n", THREAD->tid);	138	printf("Thread #%d allocating...\n", THREAD->tid);
139	while (1) {	139	while (1) {
140	/* Call with atomic to detect end of memory */	140	/* Call with atomic to detect end of memory */
141	new = slab_alloc(thr_cache, FRAME_ATOMIC);	141	new = slab_alloc(thr_cache, FRAME_ATOMIC);
142	if (!new)	142	if (!new)
143	break;	143	break;
144	((void *)new) = data;	144	((void *)new) = data;
145	data = new;	145	data = new;
146	}	146	}
147	printf("Thread #%d releasing...\n", THREAD->tid);	147	printf("Thread #%d releasing...\n", THREAD->tid);
148	while (data) {	148	while (data) {
149	new = ((void *)data);	149	new = ((void *)data);
150	((void *)data) = NULL;	150	((void *)data) = NULL;
151	slab_free(thr_cache, data);	151	slab_free(thr_cache, data);
152	data = new;	152	data = new;
153	}	153	}
154	printf("Thread #%d allocating...\n", THREAD->tid);	154	printf("Thread #%d allocating...\n", THREAD->tid);
155	while (1) {	155	while (1) {
156	/* Call with atomic to detect end of memory */	156	/* Call with atomic to detect end of memory */
157	new = slab_alloc(thr_cache, FRAME_ATOMIC);	157	new = slab_alloc(thr_cache, FRAME_ATOMIC);
158	if (!new)	158	if (!new)
159	break;	159	break;
160	((void *)new) = data;	160	((void *)new) = data;
161	data = new;	161	data = new;
162	}	162	}
163	printf("Thread #%d releasing...\n", THREAD->tid);	163	printf("Thread #%d releasing...\n", THREAD->tid);
164	while (data) {	164	while (data) {
165	new = ((void *)data);	165	new = ((void *)data);
166	((void *)data) = NULL;	166	((void *)data) = NULL;
167	slab_free(thr_cache, data);	167	slab_free(thr_cache, data);
168	data = new;	168	data = new;
169	}	169	}
170		170
171	printf("Thread #%d finished\n", THREAD->tid);	171	printf("Thread #%d finished\n", THREAD->tid);
172	slab_print_list();	172	slab_print_list();
173	semaphore_up(&thr_sem);	173	semaphore_up(&thr_sem);
174	}	174	}
175		175
176	static void multitest(int size)	176	static void multitest(int size)
177	{	177	{
178	/* Start 8 threads that just allocate as much as possible,	178	/* Start 8 threads that just allocate as much as possible,
179	* then release everything, then again allocate, then release	179	* then release everything, then again allocate, then release
180	*/	180	*/
181	thread_t *t;	181	thread_t *t;
182	int i;	182	int i;
183		183
184	printf("Running stress test with size %d\n", size);	184	printf("Running stress test with size %d\n", size);
185	condvar_initialize(&thread_starter);	185	condvar_initialize(&thread_starter);
186	mutex_initialize(&starter_mutex);	186	mutex_initialize(&starter_mutex);
187		187
188	thr_cache = slab_cache_create("thread_cache", size, 0,	188	thr_cache = slab_cache_create("thread_cache", size, 0,
189	NULL, NULL,	189	NULL, NULL,
190	0);	190	0);
191	semaphore_initialize(&thr_sem,0);	191	semaphore_initialize(&thr_sem,0);
192	for (i = 0; i < THREADS; i++) {	192	for (i = 0; i < THREADS; i++) {
193	if (!(t = thread_create(slabtest, NULL, TASK, 0, "slabtest")))	193	if (!(t = thread_create(slabtest, NULL, TASK, 0, "slabtest")))
194	printf("Could not create thread %d\n", i);	194	printf("Could not create thread %d\n", i);
195	else	195	else
196	thread_ready(t);	196	thread_ready(t);
197	}	197	}
198	thread_sleep(1);	198	thread_sleep(1);
199	condvar_broadcast(&thread_starter);	199	condvar_broadcast(&thread_starter);
200		200
201	for (i = 0; i < THREADS; i++)	201	for (i = 0; i < THREADS; i++)
202	semaphore_down(&thr_sem);	202	semaphore_down(&thr_sem);
203		203
204	slab_cache_destroy(thr_cache);	204	slab_cache_destroy(thr_cache);
205	printf("Stress test complete.\n");	205	printf("Stress test complete.\n");
206	}	206	}
207		207
208	char * test_slab2(void)	208	char * test_slab2(void)
209	{	209	{
210	printf("Running reclaim single-thread test .. pass 1\n");	210	printf("Running reclaim single-thread test .. pass 1\n");
211	totalmemtest();	211	totalmemtest();
212	printf("Running reclaim single-thread test .. pass 2\n");	212	printf("Running reclaim single-thread test .. pass 2\n");
213	totalmemtest();	213	totalmemtest();
214	printf("Reclaim test OK.\n");	214	printf("Reclaim test OK.\n");
215		215
216	multitest(128);	216	multitest(128);
217	multitest(2048);	217	multitest(2048);
218	multitest(8192);	218	multitest(8192);
219	printf("All done.\n");	219	printf("All done.\n");
220		220
221	return NULL;	221	return NULL;
222	}	222	}
223		223

Subversion Repositories HelenOS

(root)/trunk/kernel/test/mm/slab2.c – Rev 2028 → 2029