Subversion Repositories HelenOS

Rev

Rev 4296 | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
692 bondari 1
/*
2071 jermar 2
 * Copyright (c) 2006 Sergey Bondari
692 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
 
4296 trochtova 42
#define MAX_FRAMES  256
43
#define MAX_ORDER   8
692 bondari 44
 
4296 trochtova 45
#define THREAD_RUNS  1
46
#define THREADS      8
692 bondari 47
 
48
static atomic_t thread_count;
2028 decky 49
static atomic_t thread_fail;
692 bondari 50
 
4296 trochtova 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;
4537 trochtova 55
	size_t k;
692 bondari 56
 
4055 trochtova 57
	void **frames =  (void **) malloc(MAX_FRAMES * sizeof(void *), FRAME_ATOMIC);
2028 decky 58
	if (frames == NULL) {
4296 trochtova 59
		TPRINTF("Thread #%" PRIu64 " (cpu%u): Unable to allocate frames\n", THREAD->tid, CPU->id);
2028 decky 60
		atomic_inc(&thread_fail);
61
		atomic_dec(&thread_count);
62
		return;
63
	}
1658 vana 64
 
65
	thread_detach(THREAD);
4296 trochtova 66
 
745 jermar 67
	for (run = 0; run < THREAD_RUNS; run++) {
68
		for (order = 0; order <= MAX_ORDER; order++) {
4296 trochtova 69
			TPRINTF("Thread #%" PRIu64 " (cpu%u): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order);
2053 decky 70
 
692 bondari 71
			allocated = 0;
745 jermar 72
			for (i = 0; i < (MAX_FRAMES >> order); i++) {
4055 trochtova 73
				frames[allocated] = frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
1767 palkovsky 74
				if (frames[allocated]) {
745 jermar 75
					memsetb(frames[allocated], FRAME_SIZE << order, val);
692 bondari 76
					allocated++;
2028 decky 77
				} else
692 bondari 78
					break;
79
			}
2053 decky 80
 
4296 trochtova 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);
2053 decky 83
 
745 jermar 84
			for (i = 0; i < allocated; i++) {
4537 trochtova 85
				for (k = 0; k <= (((size_t) FRAME_SIZE << order) - 1); k++) {
1780 jermar 86
					if (((uint8_t *) frames[i])[k] != val) {
4537 trochtova 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);
2028 decky 88
						atomic_inc(&thread_fail);
89
						goto cleanup;
733 bondari 90
					}
91
				}
1760 palkovsky 92
				frame_free(KA2PA(frames[i]));
692 bondari 93
			}
2053 decky 94
 
4296 trochtova 95
			TPRINTF("Thread #%" PRIu64 " (cpu%u): Finished run.\n", THREAD->tid, CPU->id);
692 bondari 96
		}
97
	}
4296 trochtova 98
 
99
cleanup:
745 jermar 100
	free(frames);
2053 decky 101
 
4296 trochtova 102
	TPRINTF("Thread #%" PRIu64 " (cpu%u): Exiting\n", THREAD->tid, CPU->id);
692 bondari 103
	atomic_dec(&thread_count);
104
}
105
 
4296 trochtova 106
char *test_falloc2(void)
745 jermar 107
{
2028 decky 108
	unsigned int i;
4296 trochtova 109
 
692 bondari 110
	atomic_set(&thread_count, THREADS);
2028 decky 111
	atomic_set(&thread_fail, 0);
4296 trochtova 112
 
745 jermar 113
	for (i = 0; i < THREADS; i++) {
2042 decky 114
		thread_t * thrd = thread_create(falloc, NULL, TASK, 0, "falloc", false);
2028 decky 115
		if (!thrd) {
4296 trochtova 116
			TPRINTF("Could not create thread %u\n", i);
2028 decky 117
			break;
118
		}
119
		thread_ready(thrd);
692 bondari 120
	}
121
 
2028 decky 122
	while (atomic_get(&thread_count) > 0) {
4296 trochtova 123
		TPRINTF("Threads left: %ld\n", atomic_get(&thread_count));
2028 decky 124
		thread_sleep(1);
125
	}
126
 
127
	if (atomic_get(&thread_fail) == 0)
128
		return NULL;
129
 
130
	return "Test failed";
692 bondari 131
}