WebSVN – HelenOS-historic – Diff – /kernel/trunk/test/mm/slab1/test.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 <panic.h>
#include <memstr.h>
 
#define VAL_COUNT   1024
 
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((__address)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((__address)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((__address)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
 
void * thr_data[THREADS][THR_MEM_COUNT];
slab_cache_t *thr_cache;
semaphore_t thr_sem;
 
static void slabtest(void *data)
{
    int offs = (int)(__native) 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 *)(__native)i, TASK, 0, "slabtest")))
            panic("could not create thread\n");
        thread_ready(t);
    }
 
    for (i=0; i<THREADS; i++)
        semaphore_down(&thr_sem);
   
    slab_cache_destroy(thr_cache);
    printf("Test complete.\n");
   
}
 
void test(void)
{
    testsimple();
    testthreads();
}
 

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

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/test/mm/slab1/test.c – Rev 1062 → 1658