Rev 1972 | Rev 1978 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1972 | Rev 1977 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2005 Martin Decky |
2 | * Copyright (C) 2005 Martin Decky |
- | 3 | * Copyright (C) 2006 Jakub Jermar |
|
3 | * All rights reserved. |
4 | * All rights reserved. |
4 | * |
5 | * |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
7 | * modification, are permitted provided that the following conditions |
7 | * are met: |
8 | * are met: |
8 | * |
9 | * |
9 | * - Redistributions of source code must retain the above copyright |
10 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
14 | * 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 | * - 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 | * derived from this software without specific prior written permission. |
16 | * |
17 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * 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 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * 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 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * 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 | * (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 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
28 | */ |
28 | 29 | ||
29 | #include "main.h" |
30 | #include "main.h" |
30 | #include <printf.h> |
31 | #include <printf.h> |
31 | #include "asm.h" |
32 | #include "asm.h" |
32 | #include "_components.h" |
33 | #include "_components.h" |
33 | #include <balloc.h> |
34 | #include <balloc.h> |
34 | #include <ofw.h> |
35 | #include <ofw.h> |
35 | #include <ofw_tree.h> |
36 | #include <ofw_tree.h> |
36 | #include "ofwarch.h" |
37 | #include "ofwarch.h" |
37 | #include <align.h> |
38 | #include <align.h> |
38 | 39 | ||
39 | bootinfo_t bootinfo; |
40 | bootinfo_t bootinfo; |
40 | component_t components[COMPONENTS]; |
41 | component_t components[COMPONENTS]; |
41 | 42 | ||
42 | void bootstrap(void) |
43 | void bootstrap(void) |
43 | { |
44 | { |
44 | printf("HelenOS SPARC64 Bootloader\n"); |
45 | printf("HelenOS SPARC64 Bootloader\n"); |
45 | 46 | ||
46 | init_components(components); |
47 | init_components(components); |
47 | 48 | ||
48 | if (!ofw_memmap(&bootinfo.memmap)) { |
49 | if (!ofw_memmap(&bootinfo.memmap)) { |
49 | printf("Error: unable to get memory map, halting.\n"); |
50 | printf("Error: unable to get memory map, halting.\n"); |
50 | halt(); |
51 | halt(); |
51 | } |
52 | } |
52 | 53 | ||
53 | if (bootinfo.memmap.total == 0) { |
54 | if (bootinfo.memmap.total == 0) { |
54 | printf("Error: no memory detected, halting.\n"); |
55 | printf("Error: no memory detected, halting.\n"); |
55 | halt(); |
56 | halt(); |
56 | } |
57 | } |
57 | 58 | ||
58 | printf("\nSystem info\n"); |
59 | printf("\nSystem info\n"); |
59 | printf(" memory: %dM\n", bootinfo.memmap.total>>20); |
60 | printf(" memory: %dM\n", bootinfo.memmap.total>>20); |
60 | 61 | ||
61 | printf("\nMemory statistics\n"); |
62 | printf("\nMemory statistics\n"); |
62 | printf(" kernel entry point at %P\n", KERNEL_VIRTUAL_ADDRESS); |
63 | printf(" kernel entry point at %P\n", KERNEL_VIRTUAL_ADDRESS); |
63 | printf(" %P: boot info structure\n", &bootinfo); |
64 | printf(" %P: boot info structure\n", &bootinfo); |
64 | 65 | ||
65 | unsigned int i; |
66 | unsigned int i; |
66 | for (i = 0; i < COMPONENTS; i++) |
67 | for (i = 0; i < COMPONENTS; i++) |
67 | printf(" %P: %s image (size %d bytes)\n", components[i].start, components[i].name, components[i].size); |
68 | printf(" %P: %s image (size %d bytes)\n", components[i].start, components[i].name, components[i].size); |
68 | 69 | ||
69 | void * base = (void *) KERNEL_VIRTUAL_ADDRESS; |
70 | void * base = (void *) KERNEL_VIRTUAL_ADDRESS; |
70 | unsigned int top = 0; |
71 | unsigned int top = 0; |
71 | 72 | ||
72 | printf("\nCopying components\n"); |
73 | printf("\nCopying components\n"); |
73 | bootinfo.taskmap.count = 0; |
74 | bootinfo.taskmap.count = 0; |
74 | for (i = 0; i < COMPONENTS; i++) { |
75 | for (i = 0; i < COMPONENTS; i++) { |
75 | printf(" %s...", components[i].name); |
76 | printf(" %s...", components[i].name); |
76 | top = ALIGN_UP(top, PAGE_SIZE); |
77 | top = ALIGN_UP(top, PAGE_SIZE); |
77 | memcpy(base + top, components[i].start, components[i].size); |
78 | memcpy(base + top, components[i].start, components[i].size); |
78 | if (i > 0) { |
79 | if (i > 0) { |
79 | bootinfo.taskmap.tasks[bootinfo.taskmap.count].addr = base + top; |
80 | bootinfo.taskmap.tasks[bootinfo.taskmap.count].addr = base + top; |
80 | bootinfo.taskmap.tasks[bootinfo.taskmap.count].size = components[i].size; |
81 | bootinfo.taskmap.tasks[bootinfo.taskmap.count].size = components[i].size; |
81 | bootinfo.taskmap.count++; |
82 | bootinfo.taskmap.count++; |
82 | } |
83 | } |
83 | top += components[i].size; |
84 | top += components[i].size; |
84 | printf("done.\n"); |
85 | printf("done.\n"); |
85 | } |
86 | } |
86 | 87 | ||
87 | balloc_init(&bootinfo.ballocs, ALIGN_UP(((uintptr_t) base) + top, PAGE_SIZE)); |
88 | balloc_init(&bootinfo.ballocs, ALIGN_UP(((uintptr_t) base) + top, PAGE_SIZE)); |
88 | 89 | ||
89 | printf("\nCanonizing OpenFirmware device tree..."); |
90 | printf("\nCanonizing OpenFirmware device tree..."); |
90 | bootinfo.ofw_root = ofw_tree_build(); |
91 | bootinfo.ofw_root = ofw_tree_build(); |
91 | printf("done.\n"); |
92 | printf("done.\n"); |
92 | 93 | ||
93 | printf("\nChecking for secondary processors..."); |
94 | printf("\nChecking for secondary processors..."); |
94 | if (!ofw_cpu()) |
95 | if (!ofw_cpu()) |
95 | printf("Error: unable to get cpu properties\n"); |
96 | printf("Error: unable to get cpu properties\n"); |
96 | printf("done.\n"); |
97 | printf("done.\n"); |
97 | 98 | ||
98 | printf("\nBooting the kernel...\n"); |
99 | printf("\nBooting the kernel...\n"); |
99 | jump_to_kernel((void *) KERNEL_VIRTUAL_ADDRESS, 1, &bootinfo, sizeof(bootinfo)); |
100 | jump_to_kernel((void *) KERNEL_VIRTUAL_ADDRESS, 1, &bootinfo, sizeof(bootinfo)); |
100 | } |
101 | } |
101 | 102 |