source: mainline/test/mm/slab1/test.c@ 8d6d76a

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 8d6d76a was 8d6d76a, checked in by Jakub Vana <jakub.vana@…>, 19 years ago

Detaching threads in tests

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