1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
|
/*-
* Copyright (c) 2003 Marcel Moolenaar
* Copyright (c) 2001 Doug Rabson
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $FreeBSD$
*/
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/kernel.h>
#include <sys/proc.h>
#include <sys/sysctl.h>
#include <vm/vm.h>
#include <vm/vm_extern.h>
#include <machine/frame.h>
#include <machine/md_var.h>
#include <ia64/disasm/disasm.h>
static int ia64_unaligned_print = 1; /* warn about unaligned accesses. */
static int ia64_unaligned_sigbus = 0; /* SIGBUS on all unaligned accesses. */
SYSCTL_INT(_machdep, OID_AUTO, unaligned_print, CTLFLAG_RW,
&ia64_unaligned_print, 0, "warn about unaligned accesses");
SYSCTL_INT(_machdep, OID_AUTO, unaligned_sigbus, CTLFLAG_RW,
&ia64_unaligned_sigbus, 0, "do not SIGBUS on fixed-up accesses");
static void *
fpreg_ptr(mcontext_t *mc, int fr)
{
union _ia64_fpreg *p;
if (fr <= 1 || fr >= 128)
return (NULL);
if (fr >= 32) {
p = &mc->mc_high_fp.fr32;
fr -= 32;
} else if (fr >= 16) {
p = &mc->mc_preserved_fp.fr16;
fr -= 16;
} else if (fr >= 6) {
p = &mc->mc_scratch_fp.fr6;
fr -= 6;
} else {
p = &mc->mc_preserved_fp.fr2;
fr -= 2;
}
return ((void*)(p + fr));
}
static void *
greg_ptr(mcontext_t *mc, int gr)
{
uint64_t *p;
int bias, nslots;
if (gr <= 0 || gr >= 32 + (mc->mc_special.cfm & 0x7f))
return (NULL);
if (gr >= 32) {
p = (void*)mc->mc_special.bspstore;
nslots = (mc->mc_special.cfm & 0x7f) - gr + 32;
bias = (0x1f8 - (mc->mc_special.bspstore & 0x1f8)) >> 3;
nslots += (nslots + bias) / 63;
p -= nslots;
gr = 0;
} else if (gr >= 14) {
p = &mc->mc_scratch.gr14;
gr -= 14;
} else if (gr == 13) {
p = &mc->mc_special.tp;
gr = 0;
} else if (gr == 12) {
p = &mc->mc_special.sp;
gr = 0;
} else if (gr >= 8) {
p = &mc->mc_scratch.gr8;
gr -= 8;
} else if (gr >= 4) {
p = &mc->mc_preserved.gr4;
gr -= 4;
} else if (gr >= 2) {
p = &mc->mc_scratch.gr2;
gr -= 2;
} else {
p = &mc->mc_special.gp;
gr = 0;
}
return ((void*)(p + gr));
}
static uint64_t
rdreg(uint64_t *addr)
{
if ((uintptr_t)addr < VM_MAX_ADDRESS)
return (fuword(addr));
return (*addr);
}
static void
wrreg(uint64_t *addr, uint64_t val)
{
if ((uintptr_t)addr < VM_MAX_ADDRESS)
suword(addr, val);
else
*addr = val;
}
static int
fixup(struct asm_inst *i, mcontext_t *mc, uint64_t va)
{
union {
double d;
uint64_t i;
} buf;
void *reg;
uint64_t postinc;
switch (i->i_op) {
case ASM_OP_LD2:
copyin((void*)va, (void*)&buf.i, 2);
reg = greg_ptr(mc, (int)i->i_oper[1].o_value);
if (reg == NULL)
return (EINVAL);
wrreg(reg, buf.i & 0xffffU);
break;
case ASM_OP_LD4:
copyin((void*)va, (void*)&buf.i, 4);
reg = greg_ptr(mc, (int)i->i_oper[1].o_value);
if (reg == NULL)
return (EINVAL);
wrreg(reg, buf.i & 0xffffffffU);
break;
case ASM_OP_LD8:
copyin((void*)va, (void*)&buf.i, 8);
reg = greg_ptr(mc, (int)i->i_oper[1].o_value);
if (reg == NULL)
return (EINVAL);
wrreg(reg, buf.i);
break;
case ASM_OP_LDFD:
copyin((void*)va, (void*)&buf.d, 8);
reg = fpreg_ptr(mc, (int)i->i_oper[1].o_value);
if (reg == NULL)
return (EINVAL);
spillfd((void*)&buf.d, reg);
break;
case ASM_OP_ST2:
reg = greg_ptr(mc, (int)i->i_oper[2].o_value);
if (reg == NULL)
return (EINVAL);
buf.i = rdreg(reg);
copyout((void*)&buf.i, (void*)va, 2);
break;
case ASM_OP_ST4:
reg = greg_ptr(mc, (int)i->i_oper[2].o_value);
if (reg == NULL)
return (EINVAL);
buf.i = rdreg(reg);
copyout((void*)&buf.i, (void*)va, 4);
break;
case ASM_OP_ST8:
reg = greg_ptr(mc, (int)i->i_oper[2].o_value);
if (reg == NULL)
return (EINVAL);
buf.i = rdreg(reg);
copyout((void*)&buf.i, (void*)va, 8);
break;
default:
return (ENOENT);
}
/* Handle post-increment. */
if (i->i_oper[3].o_type == ASM_OPER_GREG) {
reg = greg_ptr(mc, (int)i->i_oper[3].o_value);
if (reg == NULL)
return (EINVAL);
postinc = rdreg(reg);
} else
postinc = (i->i_oper[3].o_type == ASM_OPER_IMM)
? i->i_oper[3].o_value : 0;
if (postinc != 0) {
reg = greg_ptr(mc, (int)i->i_oper[3].o_value);
if (reg == NULL)
return (EINVAL);
postinc += rdreg(reg);
wrreg(reg, postinc);
}
return (0);
}
int
unaligned_fixup(struct trapframe *tf, struct thread *td)
{
mcontext_t context;
struct asm_bundle bundle;
int error, slot;
slot = ((tf->tf_special.psr & IA64_PSR_RI) == IA64_PSR_RI_0) ? 0 :
((tf->tf_special.psr & IA64_PSR_RI) == IA64_PSR_RI_1) ? 1 : 2;
if (ia64_unaligned_print) {
uprintf("pid %d (%s): unaligned access: va=0x%lx, pc=0x%lx\n",
td->td_proc->p_pid, td->td_proc->p_comm,
tf->tf_special.ifa, tf->tf_special.iip + slot);
}
/*
* If PSR.ac is set, then the process wants to know about misaligned
* loads and stores. Send it a SIGBUS so that it can deal with them.
* We also send a SIGBUS if configured to do so.
*/
if ((tf->tf_special.psr & IA64_PSR_AC) || ia64_unaligned_sigbus)
return (SIGBUS);
if (!asm_decode(tf->tf_special.iip, &bundle))
return (SIGILL);
get_mcontext(td, &context, 0);
error = fixup(bundle.b_inst + slot, &context, tf->tf_special.ifa);
if (error == ENOENT) {
printf("unhandled misaligned memory access:\n\t");
asm_print_inst(&bundle, slot, tf->tf_special.iip);
return (SIGILL);
} else if (error != 0)
return (SIGBUS);
set_mcontext(td, &context);
/* Advance to the next instruction. */
if (slot == 2) {
tf->tf_special.psr &= ~IA64_PSR_RI;
tf->tf_special.iip += 16;
} else
tf->tf_special.psr += IA64_PSR_RI_1;
return (0);
}
|
