Rev 2021 | Rev 2029 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2021 | Rev 2028 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2005 Jakub Jermar |
2 | * Copyright (C) 2005 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
- | 28 | ||
28 | #include <print.h> |
29 | #include <print.h> |
29 | #include <test.h> |
30 | #include <test.h> |
30 | #include <mm/page.h> |
31 | #include <mm/page.h> |
31 | #include <mm/frame.h> |
32 | #include <mm/frame.h> |
32 | #include <mm/as.h> |
33 | #include <mm/as.h> |
33 | #include <arch/mm/page.h> |
34 | #include <arch/mm/page.h> |
34 | #include <arch/types.h> |
35 | #include <arch/types.h> |
35 | #include <debug.h> |
36 | #include <debug.h> |
36 | 37 | ||
37 | #ifdef CONFIG_BENCH |
- | |
38 | #include <arch/cycle.h> |
- | |
39 | #endif |
- | |
40 | - | ||
41 | #define PAGE0 0x10000000 |
38 | #define PAGE0 0x10000000 |
42 | #define PAGE1 (PAGE0+PAGE_SIZE) |
39 | #define PAGE1 (PAGE0+PAGE_SIZE) |
43 | 40 | ||
44 | #define VALUE0 0x01234567 |
41 | #define VALUE0 0x01234567 |
45 | #define VALUE1 0x89abcdef |
42 | #define VALUE1 0x89abcdef |
46 | 43 | ||
47 | void test_mapping1(void) |
44 | char * test_mapping1(void) |
48 | { |
45 | { |
49 | #ifdef CONFIG_BENCH |
- | |
50 | uint64_t t0 = get_cycle(); |
- | |
51 | #endif |
- | |
52 | uintptr_t frame0, frame1; |
46 | uintptr_t frame0, frame1; |
53 | uint32_t v0, v1; |
47 | uint32_t v0, v1; |
54 | 48 | ||
55 | printf("Memory management test mapping #1\n"); |
- | |
56 | - | ||
57 | frame0 = (uintptr_t) frame_alloc(ONE_FRAME, FRAME_KA); |
49 | frame0 = (uintptr_t) frame_alloc(ONE_FRAME, FRAME_KA); |
58 | frame1 = (uintptr_t) frame_alloc(ONE_FRAME, FRAME_KA); |
50 | frame1 = (uintptr_t) frame_alloc(ONE_FRAME, FRAME_KA); |
59 | 51 | ||
60 | printf("Writing %#x to physical address %p.\n", VALUE0, KA2PA(frame0)); |
52 | printf("Writing %#x to physical address %p.\n", VALUE0, KA2PA(frame0)); |
61 | *((uint32_t *) frame0) = VALUE0; |
53 | *((uint32_t *) frame0) = VALUE0; |
62 | printf("Writing %#x to physical address %p.\n", VALUE1, KA2PA(frame1)); |
54 | printf("Writing %#x to physical address %p.\n", VALUE1, KA2PA(frame1)); |
63 | *((uint32_t *) frame1) = VALUE1; |
55 | *((uint32_t *) frame1) = VALUE1; |
64 | 56 | ||
65 | printf("Mapping virtual address %p to physical address %p.\n", PAGE0, KA2PA(frame0)); |
57 | printf("Mapping virtual address %p to physical address %p.\n", PAGE0, KA2PA(frame0)); |
66 | page_mapping_insert(AS_KERNEL, PAGE0, KA2PA(frame0), PAGE_PRESENT | PAGE_WRITE); |
58 | page_mapping_insert(AS_KERNEL, PAGE0, KA2PA(frame0), PAGE_PRESENT | PAGE_WRITE); |
67 | printf("Mapping virtual address %p to physical address %p.\n", PAGE1, KA2PA(frame1)); |
59 | printf("Mapping virtual address %p to physical address %p.\n", PAGE1, KA2PA(frame1)); |
68 | page_mapping_insert(AS_KERNEL, PAGE1, KA2PA(frame1), PAGE_PRESENT | PAGE_WRITE); |
60 | page_mapping_insert(AS_KERNEL, PAGE1, KA2PA(frame1), PAGE_PRESENT | PAGE_WRITE); |
69 | 61 | ||
70 | printf("Value at virtual address %p is %#x.\n", PAGE0, v0 = *((uint32_t *) PAGE0)); |
62 | printf("Value at virtual address %p is %#x.\n", PAGE0, v0 = *((uint32_t *) PAGE0)); |
71 | printf("Value at virtual address %p is %#x.\n", PAGE1, v1 = *((uint32_t *) PAGE1)); |
63 | printf("Value at virtual address %p is %#x.\n", PAGE1, v1 = *((uint32_t *) PAGE1)); |
72 | 64 | ||
73 | ASSERT(v0 == VALUE0); |
65 | ASSERT(v0 == VALUE0); |
74 | ASSERT(v1 == VALUE1); |
66 | ASSERT(v1 == VALUE1); |
75 | 67 | ||
76 | printf("Writing %#x to virtual address %p.\n", 0, PAGE0); |
68 | printf("Writing %#x to virtual address %p.\n", 0, PAGE0); |
77 | *((uint32_t *) PAGE0) = 0; |
69 | *((uint32_t *) PAGE0) = 0; |
78 | printf("Writing %#x to virtual address %p.\n", 0, PAGE1); |
70 | printf("Writing %#x to virtual address %p.\n", 0, PAGE1); |
79 | *((uint32_t *) PAGE1) = 0; |
71 | *((uint32_t *) PAGE1) = 0; |
80 | 72 | ||
81 | v0 = *((uint32_t *) PAGE0); |
73 | v0 = *((uint32_t *) PAGE0); |
82 | v1 = *((uint32_t *) PAGE1); |
74 | v1 = *((uint32_t *) PAGE1); |
83 | 75 | ||
84 | printf("Value at virtual address %p is %#x.\n", PAGE0, *((uint32_t *) PAGE0)); |
76 | printf("Value at virtual address %p is %#x.\n", PAGE0, *((uint32_t *) PAGE0)); |
85 | printf("Value at virtual address %p is %#x.\n", PAGE1, *((uint32_t *) PAGE1)); |
77 | printf("Value at virtual address %p is %#x.\n", PAGE1, *((uint32_t *) PAGE1)); |
86 | 78 | ||
87 | ASSERT(v0 == 0); |
79 | ASSERT(v0 == 0); |
88 | ASSERT(v1 == 0); |
80 | ASSERT(v1 == 0); |
89 | 81 | ||
90 | printf("Test passed.\n"); |
- | |
91 | #ifdef CONFIG_BENCH |
- | |
92 | uint64_t dt = get_cycle() - t0; |
- | |
93 | printf("Time: %.*d cycles\n", sizeof(dt) * 2, dt); |
- | |
94 | #endif |
82 | return NULL; |
95 | } |
83 | } |
96 | 84 |