Rev 2053 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 689 | bondari | 1 | /* |
| 2071 | jermar | 2 | * Copyright (c) 2006 Sergey Bondari |
| 689 | 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 | |
| 689 | 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> |
| 689 | bondari | 34 | #include <arch/mm/page.h> |
| 35 | #include <arch/types.h> |
||
| 36 | #include <debug.h> |
||
| 745 | jermar | 37 | #include <align.h> |
| 689 | bondari | 38 | |
| 735 | bondari | 39 | #define MAX_FRAMES 1024 |
| 689 | bondari | 40 | #define MAX_ORDER 8 |
| 735 | bondari | 41 | #define TEST_RUNS 2 |
| 689 | bondari | 42 | |
| 2050 | decky | 43 | char * test_falloc1(bool quiet) { |
| 2028 | decky | 44 | uintptr_t * frames = (uintptr_t *) malloc(MAX_FRAMES * sizeof(uintptr_t), 0); |
| 45 | int results[MAX_ORDER + 1]; |
||
| 689 | bondari | 46 | |
| 47 | int i, order, run; |
||
| 48 | int allocated; |
||
| 2029 | decky | 49 | |
| 50 | if (TEST_RUNS < 2) |
||
| 51 | return "Test is compiled with TEST_RUNS < 2"; |
||
| 52 | |||
| 2028 | decky | 53 | if (frames == NULL) |
| 54 | return "Unable to allocate frames"; |
||
| 689 | bondari | 55 | |
| 745 | jermar | 56 | for (run = 0; run < TEST_RUNS; run++) { |
| 57 | for (order = 0; order <= MAX_ORDER; order++) { |
||
| 2053 | decky | 58 | if (!quiet) |
| 59 | printf("Allocating %d frames blocks ... ", 1 << order); |
||
| 60 | |||
| 689 | bondari | 61 | allocated = 0; |
| 745 | jermar | 62 | for (i = 0; i < MAX_FRAMES >> order; i++) { |
| 1780 | jermar | 63 | frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC | FRAME_KA); |
| 724 | palkovsky | 64 | |
| 745 | jermar | 65 | if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) { |
| 2053 | decky | 66 | if (!quiet) |
| 67 | printf("Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10); |
||
| 2028 | decky | 68 | return "Test failed"; |
| 724 | palkovsky | 69 | } |
| 70 | |||
| 2028 | decky | 71 | if (frames[allocated]) |
| 689 | bondari | 72 | allocated++; |
| 2028 | decky | 73 | else { |
| 2053 | decky | 74 | if (!quiet) |
| 75 | printf("done. "); |
||
| 689 | bondari | 76 | break; |
| 77 | } |
||
| 78 | } |
||
| 2028 | decky | 79 | |
| 2053 | decky | 80 | if (!quiet) |
| 81 | printf("%d blocks allocated.\n", allocated); |
||
| 689 | bondari | 82 | |
| 83 | if (run) { |
||
| 2028 | decky | 84 | if (results[order] != allocated) |
| 85 | return "Possible frame leak"; |
||
| 745 | jermar | 86 | } else |
| 87 | results[order] = allocated; |
||
| 689 | bondari | 88 | |
| 2053 | decky | 89 | if (!quiet) |
| 90 | printf("Deallocating ... "); |
||
| 91 | |||
| 2028 | decky | 92 | for (i = 0; i < allocated; i++) |
| 1760 | palkovsky | 93 | frame_free(KA2PA(frames[i])); |
| 2053 | decky | 94 | |
| 95 | if (!quiet) |
||
| 96 | printf("done.\n"); |
||
| 689 | bondari | 97 | } |
| 98 | } |
||
| 99 | |||
| 735 | bondari | 100 | free(frames); |
| 689 | bondari | 101 | |
| 2028 | decky | 102 | return NULL; |
| 689 | bondari | 103 | } |