[f275cb3] | 1 | /*
|
---|
[df4ed85] | 2 | * Copyright (c) 2006 Sergey Bondari
|
---|
[f275cb3] | 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 |
|
---|
[f275cb3] | 29 | #include <print.h>
|
---|
| 30 | #include <test.h>
|
---|
| 31 | #include <mm/page.h>
|
---|
| 32 | #include <mm/frame.h>
|
---|
[085d973] | 33 | #include <mm/slab.h>
|
---|
[f275cb3] | 34 | #include <arch/mm/page.h>
|
---|
| 35 | #include <arch/types.h>
|
---|
| 36 | #include <debug.h>
|
---|
[4a2f4bb] | 37 | #include <align.h>
|
---|
[f275cb3] | 38 |
|
---|
[1093620] | 39 | #define MAX_FRAMES 1024
|
---|
[f275cb3] | 40 | #define MAX_ORDER 8
|
---|
[1093620] | 41 | #define TEST_RUNS 2
|
---|
[f275cb3] | 42 |
|
---|
[95155b0c] | 43 | char * test_falloc1(bool quiet) {
|
---|
[96348adc] | 44 | uintptr_t * frames = (uintptr_t *) malloc(MAX_FRAMES * sizeof(uintptr_t), 0);
|
---|
| 45 | int results[MAX_ORDER + 1];
|
---|
[f275cb3] | 46 |
|
---|
| 47 | int i, order, run;
|
---|
| 48 | int allocated;
|
---|
[7e13972] | 49 |
|
---|
| 50 | if (TEST_RUNS < 2)
|
---|
| 51 | return "Test is compiled with TEST_RUNS < 2";
|
---|
| 52 |
|
---|
[96348adc] | 53 | if (frames == NULL)
|
---|
| 54 | return "Unable to allocate frames";
|
---|
[f275cb3] | 55 |
|
---|
[4a2f4bb] | 56 | for (run = 0; run < TEST_RUNS; run++) {
|
---|
| 57 | for (order = 0; order <= MAX_ORDER; order++) {
|
---|
[deada67] | 58 | if (!quiet)
|
---|
| 59 | printf("Allocating %d frames blocks ... ", 1 << order);
|
---|
| 60 |
|
---|
[f275cb3] | 61 | allocated = 0;
|
---|
[4a2f4bb] | 62 | for (i = 0; i < MAX_FRAMES >> order; i++) {
|
---|
[7f1c620] | 63 | frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
|
---|
[5d2ab23] | 64 |
|
---|
[4a2f4bb] | 65 | if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) {
|
---|
[deada67] | 66 | if (!quiet)
|
---|
| 67 | printf("Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);
|
---|
[96348adc] | 68 | return "Test failed";
|
---|
[5d2ab23] | 69 | }
|
---|
| 70 |
|
---|
[96348adc] | 71 | if (frames[allocated])
|
---|
[f275cb3] | 72 | allocated++;
|
---|
[96348adc] | 73 | else {
|
---|
[deada67] | 74 | if (!quiet)
|
---|
| 75 | printf("done. ");
|
---|
[f275cb3] | 76 | break;
|
---|
| 77 | }
|
---|
| 78 | }
|
---|
[96348adc] | 79 |
|
---|
[deada67] | 80 | if (!quiet)
|
---|
| 81 | printf("%d blocks allocated.\n", allocated);
|
---|
[f275cb3] | 82 |
|
---|
| 83 | if (run) {
|
---|
[96348adc] | 84 | if (results[order] != allocated)
|
---|
| 85 | return "Possible frame leak";
|
---|
[4a2f4bb] | 86 | } else
|
---|
| 87 | results[order] = allocated;
|
---|
[f275cb3] | 88 |
|
---|
[deada67] | 89 | if (!quiet)
|
---|
| 90 | printf("Deallocating ... ");
|
---|
| 91 |
|
---|
[96348adc] | 92 | for (i = 0; i < allocated; i++)
|
---|
[2e9eae2] | 93 | frame_free(KA2PA(frames[i]));
|
---|
[deada67] | 94 |
|
---|
| 95 | if (!quiet)
|
---|
| 96 | printf("done.\n");
|
---|
[f275cb3] | 97 | }
|
---|
| 98 | }
|
---|
| 99 |
|
---|
[1093620] | 100 | free(frames);
|
---|
[f275cb3] | 101 |
|
---|
[96348adc] | 102 | return NULL;
|
---|
[f275cb3] | 103 | }
|
---|