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