Rev 4348 | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 4348 | Rev 4691 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2006 Sergey Bondari |
2 | * Copyright (c) 2006 Sergey Bondari |
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 <print.h> |
29 | #include <print.h> |
30 | #include <test.h> |
30 | #include <test.h> |
31 | #include <mm/page.h> |
31 | #include <mm/page.h> |
32 | #include <mm/frame.h> |
32 | #include <mm/frame.h> |
33 | #include <mm/slab.h> |
33 | #include <mm/slab.h> |
34 | #include <arch/mm/page.h> |
34 | #include <arch/mm/page.h> |
35 | #include <arch/types.h> |
35 | #include <arch/types.h> |
36 | #include <atomic.h> |
36 | #include <atomic.h> |
37 | #include <debug.h> |
37 | #include <debug.h> |
38 | #include <proc/thread.h> |
38 | #include <proc/thread.h> |
39 | #include <memstr.h> |
39 | #include <memstr.h> |
40 | #include <arch.h> |
40 | #include <arch.h> |
41 | 41 | ||
42 | #define MAX_FRAMES 256 |
42 | #define MAX_FRAMES 256 |
43 | #define MAX_ORDER 8 |
43 | #define MAX_ORDER 8 |
44 | 44 | ||
45 | #define THREAD_RUNS 1 |
45 | #define THREAD_RUNS 1 |
46 | #define THREADS 8 |
46 | #define THREADS 8 |
47 | 47 | ||
48 | static atomic_t thread_count; |
48 | static atomic_t thread_count; |
49 | static atomic_t thread_fail; |
49 | static atomic_t thread_fail; |
50 | 50 | ||
51 | static void falloc(void *arg) |
51 | static void falloc(void *arg) |
52 | { |
52 | { |
53 | int order, run, allocated, i; |
53 | int order, run, allocated, i; |
54 | uint8_t val = THREAD->tid % THREADS; |
54 | uint8_t val = THREAD->tid % THREADS; |
55 | index_t k; |
55 | size_t k; |
56 | 56 | ||
57 | void **frames = (void **) malloc(MAX_FRAMES * sizeof(void *), FRAME_ATOMIC); |
57 | void **frames = (void **) malloc(MAX_FRAMES * sizeof(void *), FRAME_ATOMIC); |
58 | if (frames == NULL) { |
58 | if (frames == NULL) { |
59 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Unable to allocate frames\n", THREAD->tid, CPU->id); |
59 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Unable to allocate frames\n", THREAD->tid, CPU->id); |
60 | atomic_inc(&thread_fail); |
60 | atomic_inc(&thread_fail); |
61 | atomic_dec(&thread_count); |
61 | atomic_dec(&thread_count); |
62 | return; |
62 | return; |
63 | } |
63 | } |
64 | 64 | ||
65 | thread_detach(THREAD); |
65 | thread_detach(THREAD); |
66 | 66 | ||
67 | for (run = 0; run < THREAD_RUNS; run++) { |
67 | for (run = 0; run < THREAD_RUNS; run++) { |
68 | for (order = 0; order <= MAX_ORDER; order++) { |
68 | for (order = 0; order <= MAX_ORDER; order++) { |
69 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order); |
69 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order); |
70 | 70 | ||
71 | allocated = 0; |
71 | allocated = 0; |
72 | for (i = 0; i < (MAX_FRAMES >> order); i++) { |
72 | for (i = 0; i < (MAX_FRAMES >> order); i++) { |
73 | frames[allocated] = frame_alloc(order, FRAME_ATOMIC | FRAME_KA); |
73 | frames[allocated] = frame_alloc(order, FRAME_ATOMIC | FRAME_KA); |
74 | if (frames[allocated]) { |
74 | if (frames[allocated]) { |
75 | memsetb(frames[allocated], FRAME_SIZE << order, val); |
75 | memsetb(frames[allocated], FRAME_SIZE << order, val); |
76 | allocated++; |
76 | allocated++; |
77 | } else |
77 | } else |
78 | break; |
78 | break; |
79 | } |
79 | } |
80 | 80 | ||
81 | TPRINTF("Thread #%" PRIu64 " (cpu%u): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated); |
81 | TPRINTF("Thread #%" PRIu64 " (cpu%u): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated); |
82 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Deallocating ... \n", THREAD->tid, CPU->id); |
82 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Deallocating ... \n", THREAD->tid, CPU->id); |
83 | 83 | ||
84 | for (i = 0; i < allocated; i++) { |
84 | for (i = 0; i < allocated; i++) { |
85 | for (k = 0; k <= (((index_t) FRAME_SIZE << order) - 1); k++) { |
85 | for (k = 0; k <= (((size_t) FRAME_SIZE << order) - 1); k++) { |
86 | if (((uint8_t *) frames[i])[k] != val) { |
86 | if (((uint8_t *) frames[i])[k] != val) { |
87 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Unexpected data (%c) in block %p offset %#" PRIi "\n", THREAD->tid, CPU->id, ((char *) frames[i])[k], frames[i], k); |
87 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Unexpected data (%c) in block %p offset %#" PRIs "\n", THREAD->tid, CPU->id, ((char *) frames[i])[k], frames[i], k); |
88 | atomic_inc(&thread_fail); |
88 | atomic_inc(&thread_fail); |
89 | goto cleanup; |
89 | goto cleanup; |
90 | } |
90 | } |
91 | } |
91 | } |
92 | frame_free(KA2PA(frames[i])); |
92 | frame_free(KA2PA(frames[i])); |
93 | } |
93 | } |
94 | 94 | ||
95 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Finished run.\n", THREAD->tid, CPU->id); |
95 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Finished run.\n", THREAD->tid, CPU->id); |
96 | } |
96 | } |
97 | } |
97 | } |
98 | 98 | ||
99 | cleanup: |
99 | cleanup: |
100 | free(frames); |
100 | free(frames); |
101 | 101 | ||
102 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Exiting\n", THREAD->tid, CPU->id); |
102 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Exiting\n", THREAD->tid, CPU->id); |
103 | atomic_dec(&thread_count); |
103 | atomic_dec(&thread_count); |
104 | } |
104 | } |
105 | 105 | ||
106 | char *test_falloc2(void) |
106 | char *test_falloc2(void) |
107 | { |
107 | { |
108 | unsigned int i; |
108 | unsigned int i; |
109 | 109 | ||
110 | atomic_set(&thread_count, THREADS); |
110 | atomic_set(&thread_count, THREADS); |
111 | atomic_set(&thread_fail, 0); |
111 | atomic_set(&thread_fail, 0); |
112 | 112 | ||
113 | for (i = 0; i < THREADS; i++) { |
113 | for (i = 0; i < THREADS; i++) { |
114 | thread_t * thrd = thread_create(falloc, NULL, TASK, 0, "falloc", false); |
114 | thread_t * thrd = thread_create(falloc, NULL, TASK, 0, "falloc", false); |
115 | if (!thrd) { |
115 | if (!thrd) { |
116 | TPRINTF("Could not create thread %u\n", i); |
116 | TPRINTF("Could not create thread %u\n", i); |
117 | break; |
117 | break; |
118 | } |
118 | } |
119 | thread_ready(thrd); |
119 | thread_ready(thrd); |
120 | } |
120 | } |
121 | 121 | ||
122 | while (atomic_get(&thread_count) > 0) { |
122 | while (atomic_get(&thread_count) > 0) { |
123 | TPRINTF("Threads left: %ld\n", atomic_get(&thread_count)); |
123 | TPRINTF("Threads left: %ld\n", atomic_get(&thread_count)); |
124 | thread_sleep(1); |
124 | thread_sleep(1); |
125 | } |
125 | } |
126 | 126 | ||
127 | if (atomic_get(&thread_fail) == 0) |
127 | if (atomic_get(&thread_fail) == 0) |
128 | return NULL; |
128 | return NULL; |
129 | 129 | ||
130 | return "Test failed"; |
130 | return "Test failed"; |
131 | } |
131 | } |
132 | 132 |