Subversion Repositories HelenOS

Rev

Rev 1787 | Rev 2028 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
689 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
 */
28
#include <print.h>
29
#include <test.h>
30
#include <mm/page.h>
31
#include <mm/frame.h>
814 palkovsky 32
#include <mm/slab.h>
689 bondari 33
#include <arch/mm/page.h>
34
#include <arch/types.h>
35
#include <debug.h>
745 jermar 36
#include <align.h>
689 bondari 37
 
2021 decky 38
#ifdef CONFIG_BENCH
39
#include <arch/cycle.h>
40
#endif
41
 
735 bondari 42
#define MAX_FRAMES 1024
689 bondari 43
#define MAX_ORDER 8
735 bondari 44
#define TEST_RUNS 2
689 bondari 45
 
2021 decky 46
void test_falloc1(void) {
47
#ifdef CONFIG_BENCH
48
	uint64_t t0 = get_cycle();
49
#endif
1780 jermar 50
	uintptr_t * frames = (uintptr_t *) malloc(MAX_FRAMES*sizeof(uintptr_t), 0);
689 bondari 51
	int results[MAX_ORDER+1];
52
 
53
	int i, order, run;
54
	int allocated;
55
 
56
	ASSERT(TEST_RUNS > 1);
745 jermar 57
	ASSERT(frames != NULL)
689 bondari 58
 
745 jermar 59
	for (run = 0; run < TEST_RUNS; run++) {
60
		for (order = 0; order <= MAX_ORDER; order++) {
61
			printf("Allocating %d frames blocks ... ", 1 << order);
689 bondari 62
			allocated = 0;
745 jermar 63
			for (i = 0; i < MAX_FRAMES >> order; i++) {
1780 jermar 64
				frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
724 palkovsky 65
 
745 jermar 66
				if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) {
1221 decky 67
					panic("Test failed. Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);
724 palkovsky 68
				}
69
 
1767 palkovsky 70
				if (frames[allocated]) {
689 bondari 71
					allocated++;
72
				} else {
73
					printf("done. ");
74
					break;
75
				}
76
			}
77
 
745 jermar 78
			printf("%d blocks allocated.\n", allocated);
689 bondari 79
 
80
			if (run) {
81
				if (results[order] != allocated) {
82
					panic("Test failed. Frame leak possible.\n");
83
				}
745 jermar 84
			} else
85
				results[order] = allocated;
689 bondari 86
 
87
			printf("Deallocating ... ");
745 jermar 88
			for (i = 0; i < allocated; i++) {
1760 palkovsky 89
				frame_free(KA2PA(frames[i]));
689 bondari 90
			}
91
			printf("done.\n");
92
		}
93
	}
94
 
735 bondari 95
	free(frames);
689 bondari 96
 
745 jermar 97
	printf("Test passed.\n");
2021 decky 98
#ifdef CONFIG_BENCH
99
	uint64_t dt = get_cycle() - t0;
100
	printf("Time: %.*d cycles\n", sizeof(dt) * 2, dt);
101
#endif
689 bondari 102
}
103