[078a0a1] | 1 | /*
|
---|
[df4ed85] | 2 | * Copyright (c) 2006 Sergey Bondari
|
---|
[078a0a1] | 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 | */
|
---|
[96348adc] | 28 |
|
---|
[078a0a1] | 29 | #include <print.h>
|
---|
| 30 | #include <test.h>
|
---|
| 31 | #include <mm/page.h>
|
---|
| 32 | #include <mm/frame.h>
|
---|
[085d973] | 33 | #include <mm/slab.h>
|
---|
[078a0a1] | 34 | #include <arch/mm/page.h>
|
---|
[d99c1d2] | 35 | #include <typedefs.h>
|
---|
[23684b7] | 36 | #include <atomic.h>
|
---|
[078a0a1] | 37 | #include <debug.h>
|
---|
| 38 | #include <proc/thread.h>
|
---|
| 39 | #include <memstr.h>
|
---|
[4a2f4bb] | 40 | #include <arch.h>
|
---|
[078a0a1] | 41 |
|
---|
[abfc9f3] | 42 | #define MAX_FRAMES 256U
|
---|
[cb01e1e] | 43 | #define MAX_ORDER 8
|
---|
[078a0a1] | 44 |
|
---|
[cb01e1e] | 45 | #define THREAD_RUNS 1
|
---|
| 46 | #define THREADS 8
|
---|
[078a0a1] | 47 |
|
---|
| 48 | static atomic_t thread_count;
|
---|
[96348adc] | 49 | static atomic_t thread_fail;
|
---|
[078a0a1] | 50 |
|
---|
[cb01e1e] | 51 | static void falloc(void *arg)
|
---|
[4a2f4bb] | 52 | {
|
---|
[7f1c620] | 53 | uint8_t val = THREAD->tid % THREADS;
|
---|
[078a0a1] | 54 |
|
---|
[abfc9f3] | 55 | void **frames = (void **)
|
---|
| 56 | malloc(MAX_FRAMES * sizeof(void *), FRAME_ATOMIC);
|
---|
[96348adc] | 57 | if (frames == NULL) {
|
---|
[abfc9f3] | 58 | TPRINTF("Thread #%" PRIu64 " (cpu%u): "
|
---|
| 59 | "Unable to allocate frames\n", THREAD->tid, CPU->id);
|
---|
[96348adc] | 60 | atomic_inc(&thread_fail);
|
---|
| 61 | atomic_dec(&thread_count);
|
---|
| 62 | return;
|
---|
| 63 | }
|
---|
[8d6d76a] | 64 |
|
---|
| 65 | thread_detach(THREAD);
|
---|
[cb01e1e] | 66 |
|
---|
[abfc9f3] | 67 | for (unsigned int run = 0; run < THREAD_RUNS; run++) {
|
---|
| 68 | for (unsigned int order = 0; order <= MAX_ORDER; order++) {
|
---|
| 69 | TPRINTF("Thread #%" PRIu64 " (cpu%u): "
|
---|
| 70 | "Allocating %u frames blocks ... \n", THREAD->tid,
|
---|
| 71 | CPU->id, 1 << order);
|
---|
[deada67] | 72 |
|
---|
[abfc9f3] | 73 | unsigned int allocated = 0;
|
---|
| 74 | for (unsigned int i = 0; i < (MAX_FRAMES >> order); i++) {
|
---|
| 75 | frames[allocated] =
|
---|
| 76 | frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
|
---|
[7ee0e2f] | 77 | if (frames[allocated]) {
|
---|
[4a2f4bb] | 78 | memsetb(frames[allocated], FRAME_SIZE << order, val);
|
---|
[078a0a1] | 79 | allocated++;
|
---|
[96348adc] | 80 | } else
|
---|
[078a0a1] | 81 | break;
|
---|
| 82 | }
|
---|
[deada67] | 83 |
|
---|
[abfc9f3] | 84 | TPRINTF("Thread #%" PRIu64 " (cpu%u): "
|
---|
| 85 | "%u blocks allocated.\n", THREAD->tid, CPU->id,
|
---|
| 86 | allocated);
|
---|
| 87 | TPRINTF("Thread #%" PRIu64 " (cpu%u): "
|
---|
| 88 | "Deallocating ... \n", THREAD->tid, CPU->id);
|
---|
[deada67] | 89 |
|
---|
[abfc9f3] | 90 | for (unsigned int i = 0; i < allocated; i++) {
|
---|
| 91 | for (size_t k = 0; k <= (((size_t) FRAME_SIZE << order) - 1);
|
---|
| 92 | k++) {
|
---|
[7f1c620] | 93 | if (((uint8_t *) frames[i])[k] != val) {
|
---|
[abfc9f3] | 94 | TPRINTF("Thread #%" PRIu64 " (cpu%u): "
|
---|
| 95 | "Unexpected data (%c) in block %p offset %zu\n",
|
---|
| 96 | THREAD->tid, CPU->id, ((char *) frames[i])[k],
|
---|
| 97 | frames[i], k);
|
---|
[96348adc] | 98 | atomic_inc(&thread_fail);
|
---|
| 99 | goto cleanup;
|
---|
[bd6e392] | 100 | }
|
---|
| 101 | }
|
---|
[2e9eae2] | 102 | frame_free(KA2PA(frames[i]));
|
---|
[078a0a1] | 103 | }
|
---|
[deada67] | 104 |
|
---|
[abfc9f3] | 105 | TPRINTF("Thread #%" PRIu64 " (cpu%u): "
|
---|
| 106 | "Finished run.\n", THREAD->tid, CPU->id);
|
---|
[078a0a1] | 107 | }
|
---|
| 108 | }
|
---|
[cb01e1e] | 109 |
|
---|
| 110 | cleanup:
|
---|
[4a2f4bb] | 111 | free(frames);
|
---|
[deada67] | 112 |
|
---|
[abfc9f3] | 113 | TPRINTF("Thread #%" PRIu64 " (cpu%u): Exiting\n",
|
---|
| 114 | THREAD->tid, CPU->id);
|
---|
[078a0a1] | 115 | atomic_dec(&thread_count);
|
---|
| 116 | }
|
---|
| 117 |
|
---|
[a000878c] | 118 | const char *test_falloc2(void)
|
---|
[4a2f4bb] | 119 | {
|
---|
[078a0a1] | 120 | atomic_set(&thread_count, THREADS);
|
---|
[96348adc] | 121 | atomic_set(&thread_fail, 0);
|
---|
[cb01e1e] | 122 |
|
---|
[abfc9f3] | 123 | for (unsigned int i = 0; i < THREADS; i++) {
|
---|
[6eef3c4] | 124 | thread_t *thrd = thread_create(falloc, NULL, TASK,
|
---|
| 125 | THREAD_FLAG_NONE, "falloc2");
|
---|
[96348adc] | 126 | if (!thrd) {
|
---|
[cb01e1e] | 127 | TPRINTF("Could not create thread %u\n", i);
|
---|
[96348adc] | 128 | break;
|
---|
| 129 | }
|
---|
| 130 | thread_ready(thrd);
|
---|
[078a0a1] | 131 | }
|
---|
| 132 |
|
---|
[96348adc] | 133 | while (atomic_get(&thread_count) > 0) {
|
---|
[abfc9f3] | 134 | TPRINTF("Threads left: %" PRIua "\n",
|
---|
| 135 | atomic_get(&thread_count));
|
---|
[96348adc] | 136 | thread_sleep(1);
|
---|
| 137 | }
|
---|
| 138 |
|
---|
| 139 | if (atomic_get(&thread_fail) == 0)
|
---|
| 140 | return NULL;
|
---|
| 141 |
|
---|
| 142 | return "Test failed";
|
---|
[078a0a1] | 143 | }
|
---|