Rev 1766 | 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 | |
| 735 | bondari | 38 | #define MAX_FRAMES 1024 |
| 689 | bondari | 39 | #define MAX_ORDER 8 |
| 735 | bondari | 40 | #define TEST_RUNS 2 |
| 689 | bondari | 41 | |
| 42 | void test(void) { |
||
| 1221 | decky | 43 | __address * frames = (__address *) malloc(MAX_FRAMES*sizeof(__address), 0); |
| 689 | bondari | 44 | int results[MAX_ORDER+1]; |
| 45 | |||
| 46 | int i, order, run; |
||
| 47 | int allocated; |
||
| 48 | |||
| 49 | ASSERT(TEST_RUNS > 1); |
||
| 745 | jermar | 50 | ASSERT(frames != NULL) |
| 689 | bondari | 51 | |
| 745 | jermar | 52 | for (run = 0; run < TEST_RUNS; run++) { |
| 53 | for (order = 0; order <= MAX_ORDER; order++) { |
||
| 54 | printf("Allocating %d frames blocks ... ", 1 << order); |
||
| 689 | bondari | 55 | allocated = 0; |
| 745 | jermar | 56 | for (i = 0; i < MAX_FRAMES >> order; i++) { |
| 1767 | palkovsky | 57 | frames[allocated] = (__address) frame_alloc(order, FRAME_ATOMIC | FRAME_KA); |
| 724 | palkovsky | 58 | |
| 745 | jermar | 59 | if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) { |
| 1221 | decky | 60 | panic("Test failed. Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10); |
| 724 | palkovsky | 61 | } |
| 62 | |||
| 1767 | palkovsky | 63 | if (frames[allocated]) { |
| 689 | bondari | 64 | allocated++; |
| 65 | } else { |
||
| 66 | printf("done. "); |
||
| 67 | break; |
||
| 68 | } |
||
| 69 | } |
||
| 70 | |||
| 745 | jermar | 71 | printf("%d blocks allocated.\n", allocated); |
| 689 | bondari | 72 | |
| 73 | if (run) { |
||
| 74 | if (results[order] != allocated) { |
||
| 75 | panic("Test failed. Frame leak possible.\n"); |
||
| 76 | } |
||
| 745 | jermar | 77 | } else |
| 78 | results[order] = allocated; |
||
| 689 | bondari | 79 | |
| 80 | printf("Deallocating ... "); |
||
| 745 | jermar | 81 | for (i = 0; i < allocated; i++) { |
| 1760 | palkovsky | 82 | frame_free(KA2PA(frames[i])); |
| 689 | bondari | 83 | } |
| 84 | printf("done.\n"); |
||
| 85 | } |
||
| 86 | } |
||
| 87 | |||
| 735 | bondari | 88 | free(frames); |
| 689 | bondari | 89 | |
| 745 | jermar | 90 | printf("Test passed.\n"); |
| 689 | bondari | 91 | } |
| 92 |