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