Rev 397 | Go to most recent revision | Details | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
396 | jermar | 1 | /* |
2 | * Copyright (C) 2005 Jakub Jermar |
||
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 | |||
36 | #define PAGE0 0x10000000 |
||
37 | #define PAGE1 (PAGE0+PAGE_SIZE) |
||
38 | |||
39 | #define VALUE0 0x01234567 |
||
40 | #define VALUE1 0x89abcdef |
||
41 | |||
42 | void test(void) |
||
43 | { |
||
44 | __address frame0, frame1; |
||
45 | __u32 v0, v1; |
||
46 | |||
47 | printf("Memory management test mapping #1\n"); |
||
48 | |||
49 | frame0 = frame_alloc(FRAME_KA); |
||
50 | frame1 = frame_alloc(FRAME_KA); |
||
51 | |||
52 | *((__u32 *) frame0) = VALUE0; |
||
53 | *((__u32 *) frame1) = VALUE1; |
||
54 | |||
55 | printf("Mapping %X to %X.\n", PAGE0, KA2PA(frame0)); |
||
56 | map_page_to_frame(PAGE0, KA2PA(frame0), PAGE_PRESENT, 0); |
||
57 | printf("Mapping %X to %X.\n", PAGE1, KA2PA(frame1)); |
||
58 | map_page_to_frame(PAGE1, KA2PA(frame1), PAGE_PRESENT, 0); |
||
59 | |||
60 | printf("Value at %X is %X.\n", PAGE0, v0 = *((__u32 *) PAGE0)); |
||
61 | printf("Value at %X is %X.\n", PAGE1, v1 = *((__u32 *) PAGE1)); |
||
62 | |||
63 | ASSERT(v0 == VALUE0); |
||
64 | ASSERT(v1 == VALUE1); |
||
65 | |||
66 | printf("Writing 0 to %X.\n", PAGE0); |
||
67 | *((__u32 *) PAGE0) = 0; |
||
68 | printf("Writing 0 to %X.\n", PAGE1); |
||
69 | *((__u32 *) PAGE1) = 0; |
||
70 | |||
71 | printf("Value at %X is %X.\n", PAGE0, v0 = *((__u32 *) PAGE0)); |
||
72 | printf("Value at %X is %X.\n", PAGE1, v1 = *((__u32 *) PAGE1)); |
||
73 | |||
74 | ASSERT(v0 == 0); |
||
75 | ASSERT(v1 == 0); |
||
76 | |||
77 | printf("Test passed.\n"); |
||
78 | |||
79 | } |