Rev 1166 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1166 | Rev 1395 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2005 Martin Decky |
2 | * Copyright (C) 2005 Martin Decky |
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 | ||
29 | #include "main.h" |
29 | #include "main.h" |
30 | #include "printf.h" |
30 | #include "printf.h" |
31 | #include "asm.h" |
31 | #include "asm.h" |
32 | - | ||
33 | #define KERNEL_START ((void *) &_binary_____________kernel_kernel_bin_start) |
- | |
34 | #define KERNEL_END ((void *) &_binary_____________kernel_kernel_bin_end) |
32 | #include "_components.h" |
35 | #define KERNEL_SIZE ((unsigned long) KERNEL_END - (unsigned long) KERNEL_START) |
- | |
36 | 33 | ||
37 | #define HEAP_GAP 1024000 |
34 | #define HEAP_GAP 1024000 |
38 | 35 | ||
39 | bootinfo_t bootinfo; |
36 | bootinfo_t bootinfo; |
40 | 37 | ||
41 | 38 | ||
42 | static void check_align(const void *addr, const char *desc) |
39 | static void check_align(const void *addr, const char *desc) |
43 | { |
40 | { |
44 | if ((unsigned long) addr % PAGE_SIZE != 0) { |
41 | if ((unsigned long) addr % PAGE_SIZE != 0) { |
45 | printf("Error: %s not on page boundary, halting.\n", desc); |
42 | printf("Error: %s not on page boundary, halting.\n", desc); |
46 | halt(); |
43 | halt(); |
47 | } |
44 | } |
48 | } |
45 | } |
49 | 46 | ||
50 | 47 | ||
51 | static void fix_overlap(void *va, void **pa, const char *desc, unsigned long *top) |
48 | static void fix_overlap(void *va, void **pa, const char *desc, unsigned long *top) |
52 | { |
49 | { |
53 | if ((unsigned long) *pa + PAGE_SIZE < *top) { |
50 | if ((unsigned long) *pa + PAGE_SIZE < *top) { |
54 | printf("Warning: %s overlaps kernel physical area\n", desc); |
51 | printf("Warning: %s overlaps kernel physical area\n", desc); |
55 | 52 | ||
56 | void *new_va = (void *) (ALIGN_UP((unsigned long) KERNEL_END + HEAP_GAP, PAGE_SIZE) + *top); |
53 | void *new_va = (void *) (ALIGN_UP((unsigned long) KERNEL_END + HEAP_GAP, PAGE_SIZE) + *top); |
57 | void *new_pa = (void *) (HEAP_GAP + *top); |
54 | void *new_pa = (void *) (HEAP_GAP + *top); |
58 | *top += PAGE_SIZE; |
55 | *top += PAGE_SIZE; |
59 | 56 | ||
60 | if (ofw_map(new_pa, new_va, PAGE_SIZE, 0) != 0) { |
57 | if (ofw_map(new_pa, new_va, PAGE_SIZE, 0) != 0) { |
61 | printf("Error: Unable to map page aligned memory at %L (physical %L), halting.\n", new_va, new_pa); |
58 | printf("Error: Unable to map page aligned memory at %L (physical %L), halting.\n", new_va, new_pa); |
62 | halt(); |
59 | halt(); |
63 | } |
60 | } |
64 | 61 | ||
65 | if ((unsigned long) new_pa + PAGE_SIZE < KERNEL_SIZE) { |
62 | if ((unsigned long) new_pa + PAGE_SIZE < KERNEL_SIZE) { |
66 | printf("Error: %s cannot be relocated, halting.\n", desc); |
63 | printf("Error: %s cannot be relocated, halting.\n", desc); |
67 | halt(); |
64 | halt(); |
68 | } |
65 | } |
69 | 66 | ||
70 | printf("Relocating %L -> %L (physical %L -> %L)\n", va, new_va, *pa, new_pa); |
67 | printf("Relocating %L -> %L (physical %L -> %L)\n", va, new_va, *pa, new_pa); |
71 | *pa = new_pa; |
68 | *pa = new_pa; |
72 | memcpy(new_va, va, PAGE_SIZE); |
69 | memcpy(new_va, va, PAGE_SIZE); |
73 | } |
70 | } |
74 | } |
71 | } |
75 | 72 | ||
76 | 73 | ||
77 | void bootstrap(void) |
74 | void bootstrap(void) |
78 | { |
75 | { |
79 | printf("\nHelenOS PPC64 Bootloader\n"); |
76 | printf("\nHelenOS PPC Bootloader\n"); |
- | 77 | ||
- | 78 | init_components(); |
|
- | 79 | ||
- | 80 | unsigned int i; |
|
80 | 81 | ||
- | 82 | for (i = 0; i < COMPONENTS; i++) |
|
81 | check_align(KERNEL_START, "Kernel image"); |
83 | check_align(components[i].start, components[i].name); |
- | 84 | ||
82 | check_align(&real_mode, "Bootstrap trampoline"); |
85 | check_align(&real_mode, "bootstrap trampoline"); |
83 | check_align(&trans, "Translation table"); |
86 | check_align(&trans, "translation table"); |
84 | 87 | ||
85 | if (!ofw_memmap(&bootinfo.memmap)) { |
88 | if (!ofw_memmap(&bootinfo.memmap)) { |
86 | printf("Error: Unable to get memory map, halting.\n"); |
89 | printf("Error: unable to get memory map, halting.\n"); |
87 | halt(); |
90 | halt(); |
88 | } |
91 | } |
89 | 92 | ||
90 | if (bootinfo.memmap.total == 0) { |
93 | if (bootinfo.memmap.total == 0) { |
91 | printf("Error: No memory detected, halting.\n"); |
94 | printf("Error: no memory detected, halting.\n"); |
92 | halt(); |
95 | halt(); |
93 | } |
96 | } |
94 | 97 | ||
95 | if (!ofw_screen(&bootinfo.screen)) { |
98 | if (!ofw_screen(&bootinfo.screen)) { |
96 | printf("Error: Unable to get screen properties, halting.\n"); |
99 | printf("Error: unable to get screen properties, halting.\n"); |
97 | halt(); |
100 | halt(); |
98 | } |
101 | } |
99 | 102 | ||
100 | printf("\nDevice statistics\n"); |
103 | printf("\nDevice statistics\n"); |
101 | printf(" screen at %L, resolution %dx%d, %d bpp (scanline %d bytes)\n", bootinfo.screen.addr, bootinfo.screen.width, bootinfo.screen.height, bootinfo.screen.bpp, bootinfo.screen.scanline); |
104 | printf(" screen at %L, resolution %dx%d, %d bpp (scanline %d bytes)\n", bootinfo.screen.addr, bootinfo.screen.width, bootinfo.screen.height, bootinfo.screen.bpp, bootinfo.screen.scanline); |
102 | 105 | ||
103 | void *real_mode_pa = ofw_translate(&real_mode); |
106 | void *real_mode_pa = ofw_translate(&real_mode); |
104 | void *trans_pa = ofw_translate(&trans); |
107 | void *trans_pa = ofw_translate(&trans); |
105 | void *bootinfo_pa = ofw_translate(&bootinfo); |
108 | void *bootinfo_pa = ofw_translate(&bootinfo); |
106 | void *fb = (void *) (((unsigned long) bootinfo.screen.addr) & ((unsigned long) ~0 << 17)); |
- | |
107 | 109 | ||
108 | printf("\nMemory statistics (total %d MB)\n", bootinfo.memmap.total >> 20); |
110 | printf("\nMemory statistics (total %d MB)\n", bootinfo.memmap.total >> 20); |
109 | printf(" kernel image at %L (size %d bytes)\n", KERNEL_START, KERNEL_SIZE); |
- | |
110 | printf(" boot info at %L (physical %L)\n", &bootinfo, bootinfo_pa); |
111 | printf(" %L: boot info structure (physical %L)\n", &bootinfo, bootinfo_pa); |
111 | printf(" bootstrap trampoline at %L (physical %L)\n", &real_mode, real_mode_pa); |
112 | printf(" %L: bootstrap trampoline (physical %L)\n", &real_mode, real_mode_pa); |
112 | printf(" translation table at %L (physical %L)\n", &trans, trans_pa); |
113 | printf(" %L: translation table (physical %L)\n", &trans, trans_pa); |
- | 114 | for (i = 0; i < COMPONENTS; i++) |
|
- | 115 | printf(" %L: %s image (size %d bytes)\n", components[i].start, components[i].name, components[i].size); |
|
- | 116 | ||
- | 117 | unsigned long top = 0; |
|
- | 118 | for (i = 0; i < COMPONENTS; i++) |
|
- | 119 | top += ALIGN_UP(components[i].size, PAGE_SIZE); |
|
113 | 120 | ||
114 | unsigned long top = ALIGN_UP(KERNEL_SIZE, PAGE_SIZE); |
121 | unsigned long pages = ALIGN_UP(KERNEL_SIZE, PAGE_SIZE) >> PAGE_WIDTH; |
- | 122 | ||
- | 123 | for (i = 0; i < pages; i++) { |
|
- | 124 | void *pa = ofw_translate(KERNEL_START + (i << PAGE_WIDTH)); |
|
- | 125 | fix_overlap(KERNEL_START + (i << PAGE_WIDTH), &pa, "kernel", &top); |
|
- | 126 | trans[i] = pa; |
|
- | 127 | } |
|
- | 128 | ||
- | 129 | bootinfo.taskmap.count = 0; |
|
- | 130 | for (i = 1; i < COMPONENTS; i++) { |
|
- | 131 | unsigned long component_pages = ALIGN_UP(components[i].size, PAGE_SIZE) >> PAGE_WIDTH; |
|
115 | unsigned long addr; |
132 | unsigned long j; |
- | 133 | ||
116 | for (addr = 0; addr < KERNEL_SIZE; addr += PAGE_SIZE) { |
134 | for (j = 0; j < component_pages; j++) { |
117 | void *pa = ofw_translate(KERNEL_START + addr); |
135 | void *pa = ofw_translate(components[i].start + (j << PAGE_WIDTH)); |
118 | fix_overlap(KERNEL_START + addr, &pa, "Kernel image", &top); |
136 | fix_overlap(components[i].start + (j << PAGE_WIDTH), &pa, components[i].name, &top); |
119 | trans[addr >> PAGE_WIDTH] = pa; |
137 | trans[pages + j] = pa; |
- | 138 | if (j == 0) { |
|
- | 139 | bootinfo.taskmap.tasks[bootinfo.taskmap.count].addr = (void *) (pages << PAGE_WIDTH); |
|
- | 140 | bootinfo.taskmap.tasks[bootinfo.taskmap.count].size = components[i].size; |
|
- | 141 | bootinfo.taskmap.count++; |
|
- | 142 | } |
|
- | 143 | } |
|
- | 144 | ||
- | 145 | pages += component_pages; |
|
120 | } |
146 | } |
121 | 147 | ||
122 | fix_overlap(&real_mode, &real_mode_pa, "Bootstrap trampoline", &top); |
148 | fix_overlap(&real_mode, &real_mode_pa, "bootstrap trampoline", &top); |
123 | fix_overlap(&trans, &trans_pa, "Translation table", &top); |
149 | fix_overlap(&trans, &trans_pa, "translation table", &top); |
124 | fix_overlap(&bootinfo, &bootinfo_pa, "Boot info", &top); |
150 | fix_overlap(&bootinfo, &bootinfo_pa, "boot info", &top); |
125 | 151 | ||
126 | printf("\nBooting the kernel...\n"); |
152 | printf("\nBooting the kernel...\n"); |
127 | jump_to_kernel(bootinfo_pa, sizeof(bootinfo), trans_pa, KERNEL_SIZE, fb, real_mode_pa); |
153 | jump_to_kernel(bootinfo_pa, sizeof(bootinfo), trans_pa, pages << PAGE_WIDTH, real_mode_pa); |
128 | } |
154 | } |
129 | 155 |