Rev 4055 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
759 | palkovsky | 1 | /* |
2071 | jermar | 2 | * Copyright (c) 2006 Ondrej Palkovsky |
759 | 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> |
||
762 | palkovsky | 31 | #include <print.h> |
766 | palkovsky | 32 | #include <proc/thread.h> |
33 | #include <arch.h> |
||
768 | palkovsky | 34 | #include <memstr.h> |
759 | palkovsky | 35 | |
4296 | trochtova | 36 | #define VAL_COUNT 1024 |
762 | palkovsky | 37 | |
4296 | trochtova | 38 | static void *data[VAL_COUNT]; |
762 | palkovsky | 39 | |
4296 | trochtova | 40 | static void testit(int size, int count) |
759 | palkovsky | 41 | { |
762 | palkovsky | 42 | slab_cache_t *cache; |
43 | int i; |
||
44 | |||
4296 | trochtova | 45 | TPRINTF("Creating cache, object size: %d.\n", size); |
2053 | decky | 46 | |
47 | cache = slab_cache_create("test_cache", size, 0, NULL, NULL, |
||
4296 | trochtova | 48 | SLAB_CACHE_NOMAGAZINE); |
2053 | decky | 49 | |
4296 | trochtova | 50 | TPRINTF("Allocating %d items...", count); |
2053 | decky | 51 | |
2028 | decky | 52 | for (i = 0; i < count; i++) { |
762 | palkovsky | 53 | data[i] = slab_alloc(cache, 0); |
4055 | trochtova | 54 | memsetb(data[i], size, 0); |
762 | palkovsky | 55 | } |
2053 | decky | 56 | |
4296 | trochtova | 57 | TPRINTF("done.\n"); |
2053 | decky | 58 | |
4296 | trochtova | 59 | TPRINTF("Freeing %d items...", count); |
60 | |||
2053 | decky | 61 | for (i = 0; i < count; i++) |
762 | palkovsky | 62 | slab_free(cache, data[i]); |
2053 | decky | 63 | |
4296 | trochtova | 64 | TPRINTF("done.\n"); |
2053 | decky | 65 | |
4296 | trochtova | 66 | TPRINTF("Allocating %d items...", count); |
67 | |||
2028 | decky | 68 | for (i = 0; i < count; i++) { |
764 | palkovsky | 69 | data[i] = slab_alloc(cache, 0); |
4055 | trochtova | 70 | memsetb(data[i], size, 0); |
764 | palkovsky | 71 | } |
2053 | decky | 72 | |
4296 | trochtova | 73 | TPRINTF("done.\n"); |
2053 | decky | 74 | |
4296 | trochtova | 75 | TPRINTF("Freeing %d items...", count / 2); |
76 | |||
2053 | decky | 77 | for (i = count - 1; i >= count / 2; i--) |
764 | palkovsky | 78 | slab_free(cache, data[i]); |
2053 | decky | 79 | |
4296 | trochtova | 80 | TPRINTF("done.\n"); |
2053 | decky | 81 | |
4296 | trochtova | 82 | TPRINTF("Allocating %d items...", count / 2); |
83 | |||
2028 | decky | 84 | for (i = count / 2; i < count; i++) { |
764 | palkovsky | 85 | data[i] = slab_alloc(cache, 0); |
4055 | trochtova | 86 | memsetb(data[i], size, 0); |
764 | palkovsky | 87 | } |
2053 | decky | 88 | |
4296 | trochtova | 89 | TPRINTF("done.\n"); |
2053 | decky | 90 | |
4296 | trochtova | 91 | TPRINTF("Freeing %d items...", count); |
92 | |||
2053 | decky | 93 | for (i = 0; i < count; i++) |
764 | palkovsky | 94 | slab_free(cache, data[i]); |
2053 | decky | 95 | |
4296 | trochtova | 96 | TPRINTF("done.\n"); |
97 | |||
764 | palkovsky | 98 | slab_cache_destroy(cache); |
2053 | decky | 99 | |
4296 | trochtova | 100 | TPRINTF("Test complete.\n"); |
759 | palkovsky | 101 | } |
766 | palkovsky | 102 | |
4296 | trochtova | 103 | static void testsimple(void) |
766 | palkovsky | 104 | { |
4296 | trochtova | 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); |
||
766 | palkovsky | 113 | } |
114 | |||
4296 | trochtova | 115 | #define THREADS 6 |
116 | #define THR_MEM_COUNT 1024 |
||
117 | #define THR_MEM_SIZE 128 |
||
766 | palkovsky | 118 | |
4296 | trochtova | 119 | static void *thr_data[THREADS][THR_MEM_COUNT]; |
2028 | decky | 120 | static slab_cache_t *thr_cache; |
121 | static semaphore_t thr_sem; |
||
766 | palkovsky | 122 | |
1062 | jermar | 123 | static void slabtest(void *data) |
766 | palkovsky | 124 | { |
2028 | decky | 125 | int offs = (int) (unative_t) data; |
126 | int i, j; |
||
1658 | vana | 127 | |
128 | thread_detach(THREAD); |
||
129 | |||
4296 | trochtova | 130 | TPRINTF("Starting thread #%" PRIu64 "...\n", THREAD->tid); |
2053 | decky | 131 | |
2028 | decky | 132 | for (j = 0; j < 10; j++) { |
133 | for (i = 0; i < THR_MEM_COUNT; i++) |
||
766 | palkovsky | 134 | thr_data[offs][i] = slab_alloc(thr_cache,0); |
2028 | decky | 135 | for (i = 0; i < THR_MEM_COUNT / 2; i++) |
766 | palkovsky | 136 | slab_free(thr_cache, thr_data[offs][i]); |
2028 | decky | 137 | for (i = 0; i < THR_MEM_COUNT / 2; i++) |
766 | palkovsky | 138 | thr_data[offs][i] = slab_alloc(thr_cache, 0); |
2028 | decky | 139 | for (i = 0; i < THR_MEM_COUNT; i++) |
766 | palkovsky | 140 | slab_free(thr_cache, thr_data[offs][i]); |
141 | } |
||
2053 | decky | 142 | |
4296 | trochtova | 143 | TPRINTF("Thread #%" PRIu64 " finished\n", THREAD->tid); |
2053 | decky | 144 | |
766 | palkovsky | 145 | semaphore_up(&thr_sem); |
146 | } |
||
147 | |||
4296 | trochtova | 148 | static void testthreads(void) |
766 | palkovsky | 149 | { |
150 | thread_t *t; |
||
151 | int i; |
||
4296 | trochtova | 152 | |
2053 | decky | 153 | thr_cache = slab_cache_create("thread_cache", THR_MEM_SIZE, 0, NULL, NULL, |
4296 | trochtova | 154 | SLAB_CACHE_NOMAGAZINE); |
155 | |||
2028 | decky | 156 | semaphore_initialize(&thr_sem, 0); |
157 | for (i = 0; i < THREADS; i++) { |
||
2053 | decky | 158 | if (!(t = thread_create(slabtest, (void *) (unative_t) i, TASK, 0, "slabtest", false))) { |
4296 | trochtova | 159 | TPRINTF("Could not create thread %d\n", i); |
2053 | decky | 160 | } else |
2028 | decky | 161 | thread_ready(t); |
766 | palkovsky | 162 | } |
163 | |||
2028 | decky | 164 | for (i = 0; i < THREADS; i++) |
766 | palkovsky | 165 | semaphore_down(&thr_sem); |
166 | |||
167 | slab_cache_destroy(thr_cache); |
||
168 | |||
4296 | trochtova | 169 | TPRINTF("Test complete.\n"); |
766 | palkovsky | 170 | } |
171 | |||
4296 | trochtova | 172 | char *test_slab1(void) |
766 | palkovsky | 173 | { |
4296 | trochtova | 174 | testsimple(); |
175 | testthreads(); |
||
2028 | decky | 176 | |
177 | return NULL; |
||
766 | palkovsky | 178 | } |