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 |
|
---|
29 | #include <test.h>
|
---|
30 | #include <mm/page.h>
|
---|
31 | #include <mm/frame.h>
|
---|
32 | #include <arch/mm/page.h>
|
---|
33 | #include <typedefs.h>
|
---|
34 | #include <align.h>
|
---|
35 | #include <stdlib.h>
|
---|
36 |
|
---|
37 | #define MAX_FRAMES 1024
|
---|
38 | #define MAX_ORDER 8
|
---|
39 | #define TEST_RUNS 2
|
---|
40 |
|
---|
41 | const char *test_falloc1(void)
|
---|
42 | {
|
---|
43 | if (TEST_RUNS < 2)
|
---|
44 | return "Test is compiled with TEST_RUNS < 2";
|
---|
45 |
|
---|
46 | uintptr_t *frames = (uintptr_t *)
|
---|
47 | malloc(MAX_FRAMES * sizeof(uintptr_t));
|
---|
48 | if (frames == NULL)
|
---|
49 | return "Unable to allocate frames";
|
---|
50 |
|
---|
51 | unsigned int results[MAX_FRAMES + 1];
|
---|
52 |
|
---|
53 | for (unsigned int run = 0; run < TEST_RUNS; run++) {
|
---|
54 | for (size_t count = 1; count <= MAX_FRAMES; count++) {
|
---|
55 | size_t bytes = FRAMES2SIZE(count);
|
---|
56 |
|
---|
57 | TPRINTF("Allocating %zu frames blocks (%zu bytes) ... ",
|
---|
58 | count, bytes);
|
---|
59 |
|
---|
60 | unsigned int allocated = 0;
|
---|
61 | for (unsigned int i = 0; i < (MAX_FRAMES / count); i++) {
|
---|
62 | frames[allocated] = frame_alloc(count, FRAME_ATOMIC, 0);
|
---|
63 | if (frames[allocated]) {
|
---|
64 | allocated++;
|
---|
65 | } else {
|
---|
66 | TPRINTF("done. ");
|
---|
67 | break;
|
---|
68 | }
|
---|
69 | }
|
---|
70 |
|
---|
71 | TPRINTF("%d blocks allocated.\n", allocated);
|
---|
72 |
|
---|
73 | if (run > 0) {
|
---|
74 | if (results[count] != allocated)
|
---|
75 | return "Possible frame leak";
|
---|
76 | } else
|
---|
77 | results[count] = allocated;
|
---|
78 |
|
---|
79 | TPRINTF("Deallocating ... ");
|
---|
80 |
|
---|
81 | for (unsigned int i = 0; i < allocated; i++)
|
---|
82 | frame_free(frames[i], count);
|
---|
83 |
|
---|
84 | TPRINTF("done.\n");
|
---|
85 | }
|
---|
86 | }
|
---|
87 |
|
---|
88 | free(frames);
|
---|
89 |
|
---|
90 | return NULL;
|
---|
91 | }
|
---|