WebSVN – HelenOS – Diff – /trunk/kernel/test/mm/slab1.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 <memstr.h>
 
#define VAL_COUNT   1024
 
static void * data[VAL_COUNT];
 
static void testit(int size, int count)
{
    slab_cache_t *cache;
    int i;
   
    printf("Creating cache, object size: %d.\n", size);
    cache = slab_cache_create("test_cache", size, 0, NULL, NULL,
                  SLAB_CACHE_NOMAGAZINE);  
    printf("Allocating %d items...", count);
    for (i = 0; i < count; i++) {
        data[i] = slab_alloc(cache, 0);
        memsetb((uintptr_t) data[i], size, 0);
    }
    printf("done.\n");
    printf("Freeing %d items...", count);
    for (i = 0; i < count; i++) {
        slab_free(cache, data[i]);
    }
    printf("done.\n");
 
    printf("Allocating %d items...", count);
    for (i = 0; i < count; i++) {
        data[i] = slab_alloc(cache, 0);
        memsetb((uintptr_t) data[i], size, 0);
    }
    printf("done.\n");
 
    printf("Freeing %d items...", count / 2);
    for (i = count - 1; i >= count / 2; i--) {
        slab_free(cache, data[i]);
    }
    printf("done.\n"); 
 
    printf("Allocating %d items...", count / 2);
    for (i = count / 2; i < count; i++) {
        data[i] = slab_alloc(cache, 0);
        memsetb((uintptr_t) data[i], size, 0);
    }
    printf("done.\n");
    printf("Freeing %d items...", count);
    for (i = 0; i < count; i++) {
        slab_free(cache, data[i]);
    }
    printf("done.\n"); 
    slab_cache_destroy(cache);
 
    printf("Test complete.\n");
}
 
static void testsimple(void)
{
    testit(100, VAL_COUNT);
    testit(200, VAL_COUNT);
    testit(1024, VAL_COUNT);
    testit(2048, 512);
    testit(4000, 128);
    testit(8192, 128);
    testit(16384, 128);
    testit(16385, 128);
}
 
#define THREADS     6
#define THR_MEM_COUNT   1024
#define THR_MEM_SIZE    128
 
static void * thr_data[THREADS][THR_MEM_COUNT];
static slab_cache_t *thr_cache;
static semaphore_t thr_sem;
 
static void slabtest(void *data)
{
    int offs = (int) (unative_t) data;
    int i, j;
   
    thread_detach(THREAD);
   
    printf("Starting thread #%d...\n",THREAD->tid);
    for (j = 0; j < 10; j++) {
        for (i = 0; i < THR_MEM_COUNT; i++)
            thr_data[offs][i] = slab_alloc(thr_cache,0);
        for (i = 0; i < THR_MEM_COUNT / 2; i++)
            slab_free(thr_cache, thr_data[offs][i]);
        for (i = 0; i < THR_MEM_COUNT / 2; i++)
            thr_data[offs][i] = slab_alloc(thr_cache, 0);
        for (i = 0; i < THR_MEM_COUNT; i++)
            slab_free(thr_cache, thr_data[offs][i]);
    }
    printf("Thread #%d finished\n", THREAD->tid);
    semaphore_up(&thr_sem);
}
 
static void testthreads(void)
{
    thread_t *t;
    int i;
 
    thr_cache = slab_cache_create("thread_cache", THR_MEM_SIZE, 0,
                      NULL, NULL,
                      SLAB_CACHE_NOMAGAZINE);
    semaphore_initialize(&thr_sem, 0);
    for (i = 0; i < THREADS; i++) {  
        if (!(t = thread_create(slabtest, (void *) (unative_t) i, TASK, 0, "slabtest", false)))
            printf("Could not create thread %d\n", i);
        else
            thread_ready(t);
    }
 
    for (i = 0; i < THREADS; i++)
        semaphore_down(&thr_sem);
   
    slab_cache_destroy(thr_cache);
    printf("Test complete.\n");
   
}
 
char * test_slab1(void)
{
    testsimple();
    testthreads();
   
    return NULL;
}
 

Rev 2029	Rev 2042
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 <memstr.h>	34	#include <memstr.h>
35		35
36	#define VAL_COUNT 1024	36	#define VAL_COUNT 1024
37		37
38	static void * data[VAL_COUNT];	38	static void * data[VAL_COUNT];
39		39
40	static void testit(int size, int count)	40	static void testit(int size, int count)
41	{	41	{
42	slab_cache_t *cache;	42	slab_cache_t *cache;
43	int i;	43	int i;
44		44
45	printf("Creating cache, object size: %d.\n", size);	45	printf("Creating cache, object size: %d.\n", size);
46	cache = slab_cache_create("test_cache", size, 0, NULL, NULL,	46	cache = slab_cache_create("test_cache", size, 0, NULL, NULL,
47	SLAB_CACHE_NOMAGAZINE);	47	SLAB_CACHE_NOMAGAZINE);
48	printf("Allocating %d items...", count);	48	printf("Allocating %d items...", count);
49	for (i = 0; i < count; i++) {	49	for (i = 0; i < count; i++) {
50	data[i] = slab_alloc(cache, 0);	50	data[i] = slab_alloc(cache, 0);
51	memsetb((uintptr_t) data[i], size, 0);	51	memsetb((uintptr_t) data[i], size, 0);
52	}	52	}
53	printf("done.\n");	53	printf("done.\n");
54	printf("Freeing %d items...", count);	54	printf("Freeing %d items...", count);
55	for (i = 0; i < count; i++) {	55	for (i = 0; i < count; i++) {
56	slab_free(cache, data[i]);	56	slab_free(cache, data[i]);
57	}	57	}
58	printf("done.\n");	58	printf("done.\n");
59		59
60	printf("Allocating %d items...", count);	60	printf("Allocating %d items...", count);
61	for (i = 0; i < count; i++) {	61	for (i = 0; i < count; i++) {
62	data[i] = slab_alloc(cache, 0);	62	data[i] = slab_alloc(cache, 0);
63	memsetb((uintptr_t) data[i], size, 0);	63	memsetb((uintptr_t) data[i], size, 0);
64	}	64	}
65	printf("done.\n");	65	printf("done.\n");
66		66
67	printf("Freeing %d items...", count / 2);	67	printf("Freeing %d items...", count / 2);
68	for (i = count - 1; i >= count / 2; i--) {	68	for (i = count - 1; i >= count / 2; i--) {
69	slab_free(cache, data[i]);	69	slab_free(cache, data[i]);
70	}	70	}
71	printf("done.\n");	71	printf("done.\n");
72		72
73	printf("Allocating %d items...", count / 2);	73	printf("Allocating %d items...", count / 2);
74	for (i = count / 2; i < count; i++) {	74	for (i = count / 2; i < count; i++) {
75	data[i] = slab_alloc(cache, 0);	75	data[i] = slab_alloc(cache, 0);
76	memsetb((uintptr_t) data[i], size, 0);	76	memsetb((uintptr_t) data[i], size, 0);
77	}	77	}
78	printf("done.\n");	78	printf("done.\n");
79	printf("Freeing %d items...", count);	79	printf("Freeing %d items...", count);
80	for (i = 0; i < count; i++) {	80	for (i = 0; i < count; i++) {
81	slab_free(cache, data[i]);	81	slab_free(cache, data[i]);
82	}	82	}
83	printf("done.\n");	83	printf("done.\n");
84	slab_cache_destroy(cache);	84	slab_cache_destroy(cache);
85		85
86	printf("Test complete.\n");	86	printf("Test complete.\n");
87	}	87	}
88		88
89	static void testsimple(void)	89	static void testsimple(void)
90	{	90	{
91	testit(100, VAL_COUNT);	91	testit(100, VAL_COUNT);
92	testit(200, VAL_COUNT);	92	testit(200, VAL_COUNT);
93	testit(1024, VAL_COUNT);	93	testit(1024, VAL_COUNT);
94	testit(2048, 512);	94	testit(2048, 512);
95	testit(4000, 128);	95	testit(4000, 128);
96	testit(8192, 128);	96	testit(8192, 128);
97	testit(16384, 128);	97	testit(16384, 128);
98	testit(16385, 128);	98	testit(16385, 128);
99	}	99	}
100		100
101	#define THREADS 6	101	#define THREADS 6
102	#define THR_MEM_COUNT 1024	102	#define THR_MEM_COUNT 1024
103	#define THR_MEM_SIZE 128	103	#define THR_MEM_SIZE 128
104		104
105	static void * thr_data[THREADS][THR_MEM_COUNT];	105	static void * thr_data[THREADS][THR_MEM_COUNT];
106	static slab_cache_t *thr_cache;	106	static slab_cache_t *thr_cache;
107	static semaphore_t thr_sem;	107	static semaphore_t thr_sem;
108		108
109	static void slabtest(void *data)	109	static void slabtest(void *data)
110	{	110	{
111	int offs = (int) (unative_t) data;	111	int offs = (int) (unative_t) data;
112	int i, j;	112	int i, j;
113		113
114	thread_detach(THREAD);	114	thread_detach(THREAD);
115		115
116	printf("Starting thread #%d...\n",THREAD->tid);	116	printf("Starting thread #%d...\n",THREAD->tid);
117	for (j = 0; j < 10; j++) {	117	for (j = 0; j < 10; j++) {
118	for (i = 0; i < THR_MEM_COUNT; i++)	118	for (i = 0; i < THR_MEM_COUNT; i++)
119	thr_data[offs][i] = slab_alloc(thr_cache,0);	119	thr_data[offs][i] = slab_alloc(thr_cache,0);
120	for (i = 0; i < THR_MEM_COUNT / 2; i++)	120	for (i = 0; i < THR_MEM_COUNT / 2; i++)
121	slab_free(thr_cache, thr_data[offs][i]);	121	slab_free(thr_cache, thr_data[offs][i]);
122	for (i = 0; i < THR_MEM_COUNT / 2; i++)	122	for (i = 0; i < THR_MEM_COUNT / 2; i++)
123	thr_data[offs][i] = slab_alloc(thr_cache, 0);	123	thr_data[offs][i] = slab_alloc(thr_cache, 0);
124	for (i = 0; i < THR_MEM_COUNT; i++)	124	for (i = 0; i < THR_MEM_COUNT; i++)
125	slab_free(thr_cache, thr_data[offs][i]);	125	slab_free(thr_cache, thr_data[offs][i]);
126	}	126	}
127	printf("Thread #%d finished\n", THREAD->tid);	127	printf("Thread #%d finished\n", THREAD->tid);
128	semaphore_up(&thr_sem);	128	semaphore_up(&thr_sem);
129	}	129	}
130		130
131	static void testthreads(void)	131	static void testthreads(void)
132	{	132	{
133	thread_t *t;	133	thread_t *t;
134	int i;	134	int i;
135		135
136	thr_cache = slab_cache_create("thread_cache", THR_MEM_SIZE, 0,	136	thr_cache = slab_cache_create("thread_cache", THR_MEM_SIZE, 0,
137	NULL, NULL,	137	NULL, NULL,
138	SLAB_CACHE_NOMAGAZINE);	138	SLAB_CACHE_NOMAGAZINE);
139	semaphore_initialize(&thr_sem, 0);	139	semaphore_initialize(&thr_sem, 0);
140	for (i = 0; i < THREADS; i++) {	140	for (i = 0; i < THREADS; i++) {
141	if (!(t = thread_create(slabtest, (void *) (unative_t) i, TASK, 0, "slabtest")))	141	if (!(t = thread_create(slabtest, (void *) (unative_t) i, TASK, 0, "slabtest", false)))
142	printf("Could not create thread %d\n", i);	142	printf("Could not create thread %d\n", i);
143	else	143	else
144	thread_ready(t);	144	thread_ready(t);
145	}	145	}
146		146
147	for (i = 0; i < THREADS; i++)	147	for (i = 0; i < THREADS; i++)
148	semaphore_down(&thr_sem);	148	semaphore_down(&thr_sem);
149		149
150	slab_cache_destroy(thr_cache);	150	slab_cache_destroy(thr_cache);
151	printf("Test complete.\n");	151	printf("Test complete.\n");
152		152
153	}	153	}
154		154
155	char * test_slab1(void)	155	char * test_slab1(void)
156	{	156	{
157	testsimple();	157	testsimple();
158	testthreads();	158	testthreads();
159		159
160	return NULL;	160	return NULL;
161	}	161	}
162		162

Subversion Repositories HelenOS

(root)/trunk/kernel/test/mm/slab1.c – Rev 2029 → 2042