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