Subversion Repositories HelenOS

Rev

Rev 1877 | Rev 2110 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 1877 Rev 2071
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
 
29
#include <arch/register.h>
29
#include <arch/register.h>
30
#include <arch/mm/page.h>
30
#include <arch/mm/page.h>
31
#include <arch/mm/asid.h>
31
#include <arch/mm/asid.h>
32
#include <mm/asid.h>
32
#include <mm/asid.h>
33
 
33
 
34
#define RR_MASK (0xFFFFFFFF00000002)
34
#define RR_MASK (0xFFFFFFFF00000002)
35
#define RID_SHIFT 8
35
#define RID_SHIFT 8
36
#define PS_SHIFT 2
36
#define PS_SHIFT 2
37
 
37
 
38
#define KERNEL_TRANSLATION_I 0x0010000000000661
38
#define KERNEL_TRANSLATION_I 0x0010000000000661
39
#define KERNEL_TRANSLATION_D 0x0010000000000661
39
#define KERNEL_TRANSLATION_D 0x0010000000000661
40
 
40
 
41
.section K_TEXT_START, "ax"
41
.section K_TEXT_START, "ax"
42
 
42
 
43
.global kernel_image_start
43
.global kernel_image_start
44
 
44
 
45
stack0:
45
stack0:
46
kernel_image_start:
46
kernel_image_start:
47
	.auto
47
	.auto
48
 
48
 
49
	# Fill TR.i and TR.d using Region Register #VRN_KERNEL
49
	# Fill TR.i and TR.d using Region Register #VRN_KERNEL
50
 
50
 
51
	movl r8=(VRN_KERNEL<<VRN_SHIFT)
51
	movl r8=(VRN_KERNEL<<VRN_SHIFT)
52
	mov r9=rr[r8]
52
	mov r9=rr[r8]
53
	movl r10=(RR_MASK)
53
	movl r10=(RR_MASK)
54
	and r9=r10,r9
54
	and r9=r10,r9
55
	movl r10=((RID_KERNEL<<RID_SHIFT)|(KERNEL_PAGE_WIDTH<<PS_SHIFT))
55
	movl r10=((RID_KERNEL<<RID_SHIFT)|(KERNEL_PAGE_WIDTH<<PS_SHIFT))
56
	or  r9=r10,r9
56
	or  r9=r10,r9
57
	mov rr[r8]=r9
57
	mov rr[r8]=r9
58
 
58
 
59
	movl r8=(VRN_KERNEL<<VRN_SHIFT)
59
	movl r8=(VRN_KERNEL<<VRN_SHIFT)
60
	mov cr.ifa=r8
60
	mov cr.ifa=r8
61
	movl r10=(KERNEL_PAGE_WIDTH<<PS_SHIFT)
61
	movl r10=(KERNEL_PAGE_WIDTH<<PS_SHIFT)
62
	mov cr.itir=r10
62
	mov cr.itir=r10
63
	movl r10=(KERNEL_TRANSLATION_I)
63
	movl r10=(KERNEL_TRANSLATION_I)
64
	itr.i itr[r0]=r10
64
	itr.i itr[r0]=r10
65
	movl r10=(KERNEL_TRANSLATION_D)
65
	movl r10=(KERNEL_TRANSLATION_D)
66
	itr.d dtr[r0]=r10
66
	itr.d dtr[r0]=r10
67
 
67
 
68
	# initialize PSR
68
	# initialize PSR
69
	mov psr.l = r0
69
	mov psr.l = r0
70
	srlz.i
70
	srlz.i
71
	srlz.d
71
	srlz.d
72
	movl r10=(PSR_DT_MASK|PSR_RT_MASK|PSR_IT_MASK|PSR_IC_MASK)  /* Enable paging */
72
	movl r10=(PSR_DT_MASK|PSR_RT_MASK|PSR_IT_MASK|PSR_IC_MASK)  /* Enable paging */
73
	mov r9=psr
73
	mov r9=psr
74
	or r10=r10,r9
74
	or r10=r10,r9
75
	mov cr.ipsr=r10
75
	mov cr.ipsr=r10
76
	mov cr.ifs=r0
76
	mov cr.ifs=r0
77
	movl r8=paging_start
77
	movl r8=paging_start
78
	mov cr.iip=r8
78
	mov cr.iip=r8
79
	srlz.d
79
	srlz.d
80
	srlz.i
80
	srlz.i
81
 
81
 
82
	.explicit
82
	.explicit
83
	/*
83
	/*
84
	 * Return From Interupt is the only the way to fill upper half word of PSR.
84
	 * Return From Interupt is the only the way to fill upper half word of PSR.
85
	 */
85
	 */
86
	rfi;;
86
	rfi;;
87
 
87
 
88
.global paging_start
88
.global paging_start
89
paging_start:
89
paging_start:
90
 
90
 
91
	/*
91
	/*
92
	 * Now we are paging.
92
	 * Now we are paging.
93
	 */
93
	 */
94
 
94
 
95
	# switch to register bank 1
95
	# switch to register bank 1
96
	bsw.1
96
	bsw.1
97
	
97
	
98
	# initialize register stack
98
	# initialize register stack
99
	mov ar.rsc = r0
99
	mov ar.rsc = r0
100
	movl r8=(VRN_KERNEL<<VRN_SHIFT) ;;
100
	movl r8=(VRN_KERNEL<<VRN_SHIFT) ;;
101
	mov ar.bspstore = r8
101
	mov ar.bspstore = r8
102
	loadrs
102
	loadrs
103
 
103
 
104
	# initialize memory stack to some sane value
104
	# initialize memory stack to some sane value
105
	movl r12 = stack0;;
105
	movl r12 = stack0;;
106
	
106
	
107
	add r12 = - 16, r12	/* allocate a scratch area on the stack */
107
	add r12 = - 16, r12	/* allocate a scratch area on the stack */
108
 
108
 
109
	# initialize gp (Global Pointer) register
109
	# initialize gp (Global Pointer) register
110
	movl r1 = _hardcoded_load_address
110
	movl r1 = _hardcoded_load_address
111
 
111
 
112
	/*
112
	/*
113
	 * Initialize hardcoded_* variables.
113
	 * Initialize hardcoded_* variables.
114
	 */
114
	 */
115
	movl r14 = _hardcoded_ktext_size
115
	movl r14 = _hardcoded_ktext_size
116
	movl r15 = _hardcoded_kdata_size
116
	movl r15 = _hardcoded_kdata_size
117
	movl r16 = _hardcoded_load_address ;;
117
	movl r16 = _hardcoded_load_address ;;
118
	addl r17 = @gprel(hardcoded_ktext_size), gp
118
	addl r17 = @gprel(hardcoded_ktext_size), gp
119
	addl r18 = @gprel(hardcoded_kdata_size), gp
119
	addl r18 = @gprel(hardcoded_kdata_size), gp
120
	addl r19 = @gprel(hardcoded_load_address), gp
120
	addl r19 = @gprel(hardcoded_load_address), gp
121
	;;
121
	;;
122
	st8 [r17] = r14
122
	st8 [r17] = r14
123
	st8 [r18] = r15
123
	st8 [r18] = r15
124
	st8 [r19] = r16
124
	st8 [r19] = r16
125
 
125
 
126
	ssm (1<<19);; /* Disable f32 - f127 */
126
	ssm (1<<19);; /* Disable f32 - f127 */
127
	srlz.i;
127
	srlz.i;
128
	srlz.d;;
128
	srlz.d;;
129
 
129
 
130
	br.call.sptk.many b0 = arch_pre_main
130
	br.call.sptk.many b0 = arch_pre_main
131
 
131
 
132
	movl r18=main_bsp ;;
132
	movl r18=main_bsp ;;
133
	mov b1=r18 ;;
133
	mov b1=r18 ;;
134
	br.call.sptk.many b0=b1
134
	br.call.sptk.many b0=b1
135
 
135
 
136
 
136
 
137
0:
137
0:
138
	br 0b
138
	br 0b
139
 
139