[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>
|
---|
| 35 | #include <arch/types.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 |
|
---|
[1093620] | 42 | #define MAX_FRAMES 256
|
---|
| 43 | #define MAX_ORDER 8
|
---|
[078a0a1] | 44 |
|
---|
[bd6e392] | 45 | #define THREAD_RUNS 1
|
---|
[1093620] | 46 | #define THREADS 8
|
---|
[078a0a1] | 47 |
|
---|
| 48 | static atomic_t thread_count;
|
---|
[96348adc] | 49 | static atomic_t thread_fail;
|
---|
[deada67] | 50 | static bool sh_quiet;
|
---|
[078a0a1] | 51 |
|
---|
[96348adc] | 52 | static void falloc(void * arg)
|
---|
[4a2f4bb] | 53 | {
|
---|
[7ee0e2f] | 54 | int order, run, allocated, i;
|
---|
[7f1c620] | 55 | uint8_t val = THREAD->tid % THREADS;
|
---|
[bd6e392] | 56 | index_t k;
|
---|
[078a0a1] | 57 |
|
---|
[e32e092] | 58 | void **frames = (void **) malloc(MAX_FRAMES * sizeof(void *), FRAME_ATOMIC);
|
---|
[96348adc] | 59 | if (frames == NULL) {
|
---|
[deada67] | 60 | if (!sh_quiet)
|
---|
[cd8ad52] | 61 | printf("Thread #%" PRIu64 " (cpu%u): Unable to allocate frames\n", THREAD->tid, CPU->id);
|
---|
[96348adc] | 62 | atomic_inc(&thread_fail);
|
---|
| 63 | atomic_dec(&thread_count);
|
---|
| 64 | return;
|
---|
| 65 | }
|
---|
[8d6d76a] | 66 |
|
---|
| 67 | thread_detach(THREAD);
|
---|
[078a0a1] | 68 |
|
---|
[4a2f4bb] | 69 | for (run = 0; run < THREAD_RUNS; run++) {
|
---|
| 70 | for (order = 0; order <= MAX_ORDER; order++) {
|
---|
[deada67] | 71 | if (!sh_quiet)
|
---|
[cd8ad52] | 72 | printf("Thread #%" PRIu64 " (cpu%u): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order);
|
---|
[deada67] | 73 |
|
---|
[078a0a1] | 74 | allocated = 0;
|
---|
[4a2f4bb] | 75 | for (i = 0; i < (MAX_FRAMES >> order); i++) {
|
---|
[e32e092] | 76 | frames[allocated] = 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 |
|
---|
| 84 | if (!sh_quiet)
|
---|
[cd8ad52] | 85 | printf("Thread #%" PRIu64 " (cpu%u): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated);
|
---|
[deada67] | 86 |
|
---|
| 87 | if (!sh_quiet)
|
---|
[cd8ad52] | 88 | printf("Thread #%" PRIu64 " (cpu%u): Deallocating ... \n", THREAD->tid, CPU->id);
|
---|
[deada67] | 89 |
|
---|
[4a2f4bb] | 90 | for (i = 0; i < allocated; i++) {
|
---|
[6c441cf8] | 91 | for (k = 0; k <= (((index_t) FRAME_SIZE << order) - 1); k++) {
|
---|
[7f1c620] | 92 | if (((uint8_t *) frames[i])[k] != val) {
|
---|
[deada67] | 93 | if (!sh_quiet)
|
---|
[cd8ad52] | 94 | printf("Thread #%" PRIu64 " (cpu%u): Unexpected data (%c) in block %p offset %#" PRIi "\n", THREAD->tid, CPU->id, ((char *) frames[i])[k], frames[i], k);
|
---|
[96348adc] | 95 | atomic_inc(&thread_fail);
|
---|
| 96 | goto cleanup;
|
---|
[bd6e392] | 97 | }
|
---|
| 98 | }
|
---|
[2e9eae2] | 99 | frame_free(KA2PA(frames[i]));
|
---|
[078a0a1] | 100 | }
|
---|
[deada67] | 101 |
|
---|
| 102 | if (!sh_quiet)
|
---|
[cd8ad52] | 103 | printf("Thread #%" PRIu64 " (cpu%u): Finished run.\n", THREAD->tid, CPU->id);
|
---|
[078a0a1] | 104 | }
|
---|
| 105 | }
|
---|
[96348adc] | 106 |
|
---|
| 107 | cleanup:
|
---|
[4a2f4bb] | 108 | free(frames);
|
---|
[deada67] | 109 |
|
---|
| 110 | if (!sh_quiet)
|
---|
[cd8ad52] | 111 | printf("Thread #%" PRIu64 " (cpu%u): Exiting\n", THREAD->tid, CPU->id);
|
---|
[078a0a1] | 112 | atomic_dec(&thread_count);
|
---|
| 113 | }
|
---|
| 114 |
|
---|
[95155b0c] | 115 | char * test_falloc2(bool quiet)
|
---|
[4a2f4bb] | 116 | {
|
---|
[96348adc] | 117 | unsigned int i;
|
---|
[deada67] | 118 | sh_quiet = quiet;
|
---|
[078a0a1] | 119 |
|
---|
| 120 | atomic_set(&thread_count, THREADS);
|
---|
[96348adc] | 121 | atomic_set(&thread_fail, 0);
|
---|
[078a0a1] | 122 |
|
---|
[4a2f4bb] | 123 | for (i = 0; i < THREADS; i++) {
|
---|
[62b6d17] | 124 | thread_t * thrd = thread_create(falloc, NULL, TASK, 0, "falloc", false);
|
---|
[96348adc] | 125 | if (!thrd) {
|
---|
[deada67] | 126 | if (!quiet)
|
---|
[cd8ad52] | 127 | printf("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) {
|
---|
[deada67] | 134 | if (!quiet)
|
---|
[cd8ad52] | 135 | printf("Threads left: %ld\n", 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 | }
|
---|