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