source: mainline/kernel/test/mm/falloc2.c@ 11b285d

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 11b285d was 11b285d, checked in by Jiří Zárevúcky <jiri.zarevucky@…>, 7 years ago

Use standard signature for malloc() in kernel.

The remaining instances of blocking allocation are replaced with
a new separate function named nfmalloc (short for non-failing malloc).

  • Property mode set to 100644
File size: 4.2 KB
RevLine 
[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>
[44a7ee5]39#include <mem.h>
[4a2f4bb]40#include <arch.h>
[078a0a1]41
[b0c2075]42#define MAX_FRAMES 256
[078a0a1]43
[cb01e1e]44#define THREAD_RUNS 1
45#define THREADS 8
[078a0a1]46
47static atomic_t thread_count;
[96348adc]48static atomic_t thread_fail;
[078a0a1]49
[cb01e1e]50static void falloc(void *arg)
[4a2f4bb]51{
[7f1c620]52 uint8_t val = THREAD->tid % THREADS;
[a35b458]53
[8cbf1c3]54 uintptr_t *frames = (uintptr_t *)
[11b285d]55 malloc(MAX_FRAMES * sizeof(uintptr_t));
[96348adc]56 if (frames == NULL) {
[abfc9f3]57 TPRINTF("Thread #%" PRIu64 " (cpu%u): "
58 "Unable to allocate frames\n", THREAD->tid, CPU->id);
[96348adc]59 atomic_inc(&thread_fail);
60 atomic_dec(&thread_count);
61 return;
62 }
[a35b458]63
[8d6d76a]64 thread_detach(THREAD);
[a35b458]65
[abfc9f3]66 for (unsigned int run = 0; run < THREAD_RUNS; run++) {
[b0c2075]67 for (size_t count = 1; count <= MAX_FRAMES; count++) {
68 size_t bytes = FRAMES2SIZE(count);
[a35b458]69
[abfc9f3]70 TPRINTF("Thread #%" PRIu64 " (cpu%u): "
[b0c2075]71 "Allocating %zu frames blocks (%zu bytes) ... \n", THREAD->tid,
72 CPU->id, count, bytes);
[a35b458]73
[abfc9f3]74 unsigned int allocated = 0;
[b0c2075]75 for (unsigned int i = 0; i < (MAX_FRAMES / count); i++) {
[cd3b380]76 frames[allocated] = frame_alloc(count, FRAME_ATOMIC, 0);
[7ee0e2f]77 if (frames[allocated]) {
[cd3b380]78 memsetb((void *) PA2KA(frames[allocated]), bytes, val);
[078a0a1]79 allocated++;
[96348adc]80 } else
[078a0a1]81 break;
82 }
[a35b458]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);
[a35b458]89
[abfc9f3]90 for (unsigned int i = 0; i < allocated; i++) {
[b0c2075]91 for (size_t k = 0; k < bytes; k++) {
[cd3b380]92 if (((uint8_t *) PA2KA(frames[i]))[k] != val) {
[abfc9f3]93 TPRINTF("Thread #%" PRIu64 " (cpu%u): "
[8cbf1c3]94 "Unexpected data (%c) in block %zu offset %zu\n",
[cd3b380]95 THREAD->tid, CPU->id, ((char *) PA2KA(frames[i]))[k],
[abfc9f3]96 frames[i], k);
[96348adc]97 atomic_inc(&thread_fail);
98 goto cleanup;
[bd6e392]99 }
100 }
[cd3b380]101 frame_free(frames[i], count);
[078a0a1]102 }
[a35b458]103
[abfc9f3]104 TPRINTF("Thread #%" PRIu64 " (cpu%u): "
105 "Finished run.\n", THREAD->tid, CPU->id);
[078a0a1]106 }
107 }
[a35b458]108
[cb01e1e]109cleanup:
[4a2f4bb]110 free(frames);
[a35b458]111
[abfc9f3]112 TPRINTF("Thread #%" PRIu64 " (cpu%u): Exiting\n",
113 THREAD->tid, CPU->id);
[078a0a1]114 atomic_dec(&thread_count);
115}
116
[a000878c]117const char *test_falloc2(void)
[4a2f4bb]118{
[078a0a1]119 atomic_set(&thread_count, THREADS);
[96348adc]120 atomic_set(&thread_fail, 0);
[a35b458]121
[abfc9f3]122 for (unsigned int i = 0; i < THREADS; i++) {
[6eef3c4]123 thread_t *thrd = thread_create(falloc, NULL, TASK,
124 THREAD_FLAG_NONE, "falloc2");
[96348adc]125 if (!thrd) {
[cb01e1e]126 TPRINTF("Could not create thread %u\n", i);
[96348adc]127 break;
128 }
129 thread_ready(thrd);
[078a0a1]130 }
[a35b458]131
[96348adc]132 while (atomic_get(&thread_count) > 0) {
[abfc9f3]133 TPRINTF("Threads left: %" PRIua "\n",
134 atomic_get(&thread_count));
[96348adc]135 thread_sleep(1);
136 }
[a35b458]137
[96348adc]138 if (atomic_get(&thread_fail) == 0)
139 return NULL;
[a35b458]140
[96348adc]141 return "Test failed";
[078a0a1]142}
Note: See TracBrowser for help on using the repository browser.