Rev 1903 | Rev 1920 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
424 | 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 | |||
1769 | jermar | 29 | /** @addtogroup sparc64 |
1702 | cejka | 30 | * @{ |
31 | */ |
||
32 | /** @file |
||
33 | */ |
||
34 | |||
424 | jermar | 35 | #include <arch.h> |
669 | jermar | 36 | #include <debug.h> |
1860 | jermar | 37 | #include <config.h> |
630 | jermar | 38 | #include <arch/trap/trap.h> |
586 | jermar | 39 | #include <arch/console.h> |
669 | jermar | 40 | #include <proc/thread.h> |
1474 | palkovsky | 41 | #include <console/console.h> |
1790 | jermar | 42 | #include <arch/boot/boot.h> |
1792 | jermar | 43 | #include <arch/arch.h> |
1881 | jermar | 44 | #include <arch/asm.h> |
1860 | jermar | 45 | #include <arch/mm/page.h> |
46 | #include <arch/stack.h> |
||
1895 | jermar | 47 | #include <genarch/ofw/ofw_tree.h> |
1860 | jermar | 48 | #include <userspace.h> |
1919 | jermar | 49 | #include <irq.h> |
424 | jermar | 50 | |
1790 | jermar | 51 | bootinfo_t bootinfo; |
52 | |||
1864 | jermar | 53 | void arch_pre_main(void) |
54 | { |
||
1894 | jermar | 55 | /* Copy init task info. */ |
1864 | jermar | 56 | init.cnt = bootinfo.taskmap.count; |
57 | |||
58 | uint32_t i; |
||
59 | |||
60 | for (i = 0; i < bootinfo.taskmap.count; i++) { |
||
61 | init.tasks[i].addr = PA2KA(bootinfo.taskmap.tasks[i].addr); |
||
62 | init.tasks[i].size = bootinfo.taskmap.tasks[i].size; |
||
63 | } |
||
1894 | jermar | 64 | |
65 | /* Copy boot allocations info. */ |
||
66 | ballocs.base = bootinfo.ballocs.base; |
||
67 | ballocs.size = bootinfo.ballocs.size; |
||
1895 | jermar | 68 | |
69 | ofw_tree_init(bootinfo.ofw_root); |
||
1864 | jermar | 70 | } |
71 | |||
424 | jermar | 72 | void arch_pre_mm_init(void) |
73 | { |
||
1903 | jermar | 74 | if (config.cpu_active == 1) |
75 | trap_init(); |
||
424 | jermar | 76 | } |
77 | |||
78 | void arch_post_mm_init(void) |
||
79 | { |
||
1919 | jermar | 80 | if (config.cpu_active == 1) { |
81 | irq_init(1<<11, 128); |
||
1903 | jermar | 82 | standalone_sparc64_console_init(); |
1919 | jermar | 83 | } |
424 | jermar | 84 | } |
85 | |||
1901 | jermar | 86 | void arch_post_cpu_init(void) |
87 | { |
||
88 | } |
||
89 | |||
503 | jermar | 90 | void arch_pre_smp_init(void) |
424 | jermar | 91 | { |
92 | } |
||
93 | |||
503 | jermar | 94 | void arch_post_smp_init(void) |
95 | { |
||
893 | jermar | 96 | thread_t *t; |
97 | |||
1903 | jermar | 98 | if (config.cpu_active == 1) { |
99 | /* |
||
100 | * Create thread that polls keyboard. |
||
101 | */ |
||
102 | t = thread_create(kkbdpoll, NULL, TASK, 0, "kkbdpoll"); |
||
103 | if (!t) |
||
104 | panic("cannot create kkbdpoll\n"); |
||
105 | thread_ready(t); |
||
106 | } |
||
503 | jermar | 107 | } |
108 | |||
1881 | jermar | 109 | /** Calibrate delay loop. |
110 | * |
||
111 | * On sparc64, we implement delay() by waiting for the TICK register to |
||
112 | * reach a pre-computed value, as opposed to performing some pre-computed |
||
113 | * amount of instructions of known duration. We set the delay_loop_const |
||
114 | * to 1 in order to neutralize the multiplication done by delay(). |
||
115 | */ |
||
424 | jermar | 116 | void calibrate_delay_loop(void) |
117 | { |
||
1881 | jermar | 118 | CPU->delay_loop_const = 1; |
424 | jermar | 119 | } |
1474 | palkovsky | 120 | |
1881 | jermar | 121 | /** Wait several microseconds. |
122 | * |
||
123 | * We assume that interrupts are already disabled. |
||
124 | * |
||
125 | * @param t Microseconds to wait. |
||
126 | */ |
||
127 | void asm_delay_loop(const uint32_t usec) |
||
128 | { |
||
129 | uint64_t stop = tick_read() + (uint64_t) usec * (uint64_t) CPU->arch.clock_frequency / 1000000; |
||
130 | |||
131 | while (tick_read() < stop) |
||
132 | ; |
||
133 | } |
||
134 | |||
1860 | jermar | 135 | /** Switch to userspace. */ |
136 | void userspace(uspace_arg_t *kernel_uarg) |
||
137 | { |
||
138 | switch_to_userspace((uintptr_t) kernel_uarg->uspace_entry, |
||
139 | ((uintptr_t) kernel_uarg->uspace_stack) + STACK_SIZE |
||
1879 | jermar | 140 | - (ALIGN_UP(STACK_ITEM_SIZE, STACK_ALIGNMENT) + STACK_BIAS), |
1864 | jermar | 141 | (uintptr_t) kernel_uarg->uspace_uarg); |
1860 | jermar | 142 | |
143 | for (;;) |
||
144 | ; |
||
145 | /* not reached */ |
||
146 | } |
||
147 | |||
1769 | jermar | 148 | /** @} |
1702 | cejka | 149 | */ |