Rev 689 | Rev 735 | 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> |
||
| 32 | #include <arch/mm/page.h> |
||
| 33 | #include <arch/types.h> |
||
| 34 | #include <debug.h> |
||
| 35 | |||
| 724 | palkovsky | 36 | #define MAX_FRAMES 2048 |
| 689 | bondari | 37 | #define MAX_ORDER 8 |
| 38 | #define TEST_RUNS 4 |
||
| 39 | |||
| 40 | void test(void) { |
||
| 41 | __address frames[MAX_FRAMES]; |
||
| 42 | int results[MAX_ORDER+1]; |
||
| 43 | |||
| 44 | int i, order, run; |
||
| 45 | int allocated; |
||
| 46 | int status; |
||
| 47 | |||
| 48 | ASSERT(TEST_RUNS > 1); |
||
| 49 | |||
| 50 | for (run=0;run<=TEST_RUNS;run++) { |
||
| 51 | for (order=0;order<=MAX_ORDER;order++) { |
||
| 52 | printf("Allocating %d frames blocks ... ", 1<<order); |
||
| 53 | allocated = 0; |
||
| 54 | for (i=0;i<MAX_FRAMES>>order;i++) { |
||
| 724 | palkovsky | 55 | frames[allocated] = frame_alloc(FRAME_NON_BLOCKING, order, &status); |
| 56 | |||
| 57 | if (frames[allocated] % (FRAME_SIZE << order) != 0) { |
||
| 58 | panic("Test failed. Block at address %X (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10); |
||
| 59 | } |
||
| 60 | |||
| 689 | bondari | 61 | if (status == 0) { |
| 62 | allocated++; |
||
| 63 | } else { |
||
| 64 | printf("done. "); |
||
| 65 | break; |
||
| 66 | } |
||
| 67 | } |
||
| 68 | |||
| 69 | printf("%d blocks alocated.\n", allocated); |
||
| 70 | |||
| 71 | if (run) { |
||
| 72 | if (results[order] != allocated) { |
||
| 73 | panic("Test failed. Frame leak possible.\n"); |
||
| 74 | } |
||
| 75 | } else results[order] = allocated; |
||
| 76 | |||
| 77 | printf("Deallocating ... "); |
||
| 78 | for (i=0;i<allocated;i++) { |
||
| 79 | frame_free(frames[i]); |
||
| 80 | } |
||
| 81 | printf("done.\n"); |
||
| 82 | } |
||
| 83 | } |
||
| 84 | |||
| 85 | |||
| 86 | |||
| 87 | printf("Test passed\n"); |
||
| 88 | } |
||
| 89 |