blob: 2c154088cce71e496e431be6136f5d814b5f9b0d [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * Kernel support for the ptrace() and syscall tracing interfaces.
3 *
4 * Copyright (C) 1999-2005 Hewlett-Packard Co
5 * David Mosberger-Tang <davidm@hpl.hp.com>
Shaohua Lic70f8f62008-02-28 16:47:50 +08006 * Copyright (C) 2006 Intel Co
7 * 2006-08-12 - IA64 Native Utrace implementation support added by
8 * Anil S Keshavamurthy <anil.s.keshavamurthy@intel.com>
Linus Torvalds1da177e2005-04-16 15:20:36 -07009 *
10 * Derived from the x86 and Alpha versions.
11 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070012#include <linux/kernel.h>
13#include <linux/sched.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070014#include <linux/mm.h>
15#include <linux/errno.h>
16#include <linux/ptrace.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070017#include <linux/user.h>
18#include <linux/security.h>
19#include <linux/audit.h>
Jesper Juhl7ed20e12005-05-01 08:59:14 -070020#include <linux/signal.h>
Shaohua Lic70f8f62008-02-28 16:47:50 +080021#include <linux/regset.h>
22#include <linux/elf.h>
Shaohua Lif14488c2008-10-06 10:43:06 -070023#include <linux/tracehook.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024
25#include <asm/pgtable.h>
26#include <asm/processor.h>
27#include <asm/ptrace_offsets.h>
28#include <asm/rse.h>
29#include <asm/system.h>
30#include <asm/uaccess.h>
31#include <asm/unwind.h>
32#ifdef CONFIG_PERFMON
33#include <asm/perfmon.h>
34#endif
35
36#include "entry.h"
37
38/*
39 * Bits in the PSR that we allow ptrace() to change:
40 * be, up, ac, mfl, mfh (the user mask; five bits total)
41 * db (debug breakpoint fault; one bit)
42 * id (instruction debug fault disable; one bit)
43 * dd (data debug fault disable; one bit)
44 * ri (restart instruction; two bits)
45 * is (instruction set; one bit)
46 */
47#define IPSR_MASK (IA64_PSR_UM | IA64_PSR_DB | IA64_PSR_IS \
48 | IA64_PSR_ID | IA64_PSR_DD | IA64_PSR_RI)
49
50#define MASK(nbits) ((1UL << (nbits)) - 1) /* mask with NBITS bits set */
51#define PFM_MASK MASK(38)
52
53#define PTRACE_DEBUG 0
54
55#if PTRACE_DEBUG
56# define dprintk(format...) printk(format)
57# define inline
58#else
59# define dprintk(format...)
60#endif
61
62/* Return TRUE if PT was created due to kernel-entry via a system-call. */
63
64static inline int
65in_syscall (struct pt_regs *pt)
66{
67 return (long) pt->cr_ifs >= 0;
68}
69
70/*
71 * Collect the NaT bits for r1-r31 from scratch_unat and return a NaT
72 * bitset where bit i is set iff the NaT bit of register i is set.
73 */
74unsigned long
75ia64_get_scratch_nat_bits (struct pt_regs *pt, unsigned long scratch_unat)
76{
77# define GET_BITS(first, last, unat) \
78 ({ \
79 unsigned long bit = ia64_unat_pos(&pt->r##first); \
80 unsigned long nbits = (last - first + 1); \
81 unsigned long mask = MASK(nbits) << first; \
82 unsigned long dist; \
83 if (bit < first) \
84 dist = 64 + bit - first; \
85 else \
86 dist = bit - first; \
87 ia64_rotr(unat, dist) & mask; \
88 })
89 unsigned long val;
90
91 /*
92 * Registers that are stored consecutively in struct pt_regs
93 * can be handled in parallel. If the register order in
94 * struct_pt_regs changes, this code MUST be updated.
95 */
96 val = GET_BITS( 1, 1, scratch_unat);
97 val |= GET_BITS( 2, 3, scratch_unat);
98 val |= GET_BITS(12, 13, scratch_unat);
99 val |= GET_BITS(14, 14, scratch_unat);
100 val |= GET_BITS(15, 15, scratch_unat);
101 val |= GET_BITS( 8, 11, scratch_unat);
102 val |= GET_BITS(16, 31, scratch_unat);
103 return val;
104
105# undef GET_BITS
106}
107
108/*
109 * Set the NaT bits for the scratch registers according to NAT and
110 * return the resulting unat (assuming the scratch registers are
111 * stored in PT).
112 */
113unsigned long
114ia64_put_scratch_nat_bits (struct pt_regs *pt, unsigned long nat)
115{
116# define PUT_BITS(first, last, nat) \
117 ({ \
118 unsigned long bit = ia64_unat_pos(&pt->r##first); \
119 unsigned long nbits = (last - first + 1); \
120 unsigned long mask = MASK(nbits) << first; \
121 long dist; \
122 if (bit < first) \
123 dist = 64 + bit - first; \
124 else \
125 dist = bit - first; \
126 ia64_rotl(nat & mask, dist); \
127 })
128 unsigned long scratch_unat;
129
130 /*
131 * Registers that are stored consecutively in struct pt_regs
132 * can be handled in parallel. If the register order in
133 * struct_pt_regs changes, this code MUST be updated.
134 */
135 scratch_unat = PUT_BITS( 1, 1, nat);
136 scratch_unat |= PUT_BITS( 2, 3, nat);
137 scratch_unat |= PUT_BITS(12, 13, nat);
138 scratch_unat |= PUT_BITS(14, 14, nat);
139 scratch_unat |= PUT_BITS(15, 15, nat);
140 scratch_unat |= PUT_BITS( 8, 11, nat);
141 scratch_unat |= PUT_BITS(16, 31, nat);
142
143 return scratch_unat;
144
145# undef PUT_BITS
146}
147
148#define IA64_MLX_TEMPLATE 0x2
149#define IA64_MOVL_OPCODE 6
150
151void
152ia64_increment_ip (struct pt_regs *regs)
153{
154 unsigned long w0, ri = ia64_psr(regs)->ri + 1;
155
156 if (ri > 2) {
157 ri = 0;
158 regs->cr_iip += 16;
159 } else if (ri == 2) {
160 get_user(w0, (char __user *) regs->cr_iip + 0);
161 if (((w0 >> 1) & 0xf) == IA64_MLX_TEMPLATE) {
162 /*
163 * rfi'ing to slot 2 of an MLX bundle causes
164 * an illegal operation fault. We don't want
165 * that to happen...
166 */
167 ri = 0;
168 regs->cr_iip += 16;
169 }
170 }
171 ia64_psr(regs)->ri = ri;
172}
173
174void
175ia64_decrement_ip (struct pt_regs *regs)
176{
177 unsigned long w0, ri = ia64_psr(regs)->ri - 1;
178
179 if (ia64_psr(regs)->ri == 0) {
180 regs->cr_iip -= 16;
181 ri = 2;
182 get_user(w0, (char __user *) regs->cr_iip + 0);
183 if (((w0 >> 1) & 0xf) == IA64_MLX_TEMPLATE) {
184 /*
185 * rfi'ing to slot 2 of an MLX bundle causes
186 * an illegal operation fault. We don't want
187 * that to happen...
188 */
189 ri = 1;
190 }
191 }
192 ia64_psr(regs)->ri = ri;
193}
194
195/*
196 * This routine is used to read an rnat bits that are stored on the
197 * kernel backing store. Since, in general, the alignment of the user
198 * and kernel are different, this is not completely trivial. In
199 * essence, we need to construct the user RNAT based on up to two
200 * kernel RNAT values and/or the RNAT value saved in the child's
201 * pt_regs.
202 *
203 * user rbs
204 *
205 * +--------+ <-- lowest address
206 * | slot62 |
207 * +--------+
208 * | rnat | 0x....1f8
209 * +--------+
210 * | slot00 | \
211 * +--------+ |
212 * | slot01 | > child_regs->ar_rnat
213 * +--------+ |
214 * | slot02 | / kernel rbs
215 * +--------+ +--------+
216 * <- child_regs->ar_bspstore | slot61 | <-- krbs
217 * +- - - - + +--------+
218 * | slot62 |
219 * +- - - - + +--------+
220 * | rnat |
221 * +- - - - + +--------+
222 * vrnat | slot00 |
223 * +- - - - + +--------+
224 * = =
225 * +--------+
226 * | slot00 | \
227 * +--------+ |
228 * | slot01 | > child_stack->ar_rnat
229 * +--------+ |
230 * | slot02 | /
231 * +--------+
232 * <--- child_stack->ar_bspstore
233 *
234 * The way to think of this code is as follows: bit 0 in the user rnat
235 * corresponds to some bit N (0 <= N <= 62) in one of the kernel rnat
236 * value. The kernel rnat value holding this bit is stored in
237 * variable rnat0. rnat1 is loaded with the kernel rnat value that
238 * form the upper bits of the user rnat value.
239 *
240 * Boundary cases:
241 *
242 * o when reading the rnat "below" the first rnat slot on the kernel
243 * backing store, rnat0/rnat1 are set to 0 and the low order bits are
244 * merged in from pt->ar_rnat.
245 *
246 * o when reading the rnat "above" the last rnat slot on the kernel
247 * backing store, rnat0/rnat1 gets its value from sw->ar_rnat.
248 */
249static unsigned long
250get_rnat (struct task_struct *task, struct switch_stack *sw,
251 unsigned long *krbs, unsigned long *urnat_addr,
252 unsigned long *urbs_end)
253{
254 unsigned long rnat0 = 0, rnat1 = 0, urnat = 0, *slot0_kaddr;
255 unsigned long umask = 0, mask, m;
256 unsigned long *kbsp, *ubspstore, *rnat0_kaddr, *rnat1_kaddr, shift;
257 long num_regs, nbits;
258 struct pt_regs *pt;
259
Al Viro64505782006-01-12 01:06:06 -0800260 pt = task_pt_regs(task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261 kbsp = (unsigned long *) sw->ar_bspstore;
262 ubspstore = (unsigned long *) pt->ar_bspstore;
263
264 if (urbs_end < urnat_addr)
265 nbits = ia64_rse_num_regs(urnat_addr - 63, urbs_end);
266 else
267 nbits = 63;
268 mask = MASK(nbits);
269 /*
270 * First, figure out which bit number slot 0 in user-land maps
271 * to in the kernel rnat. Do this by figuring out how many
272 * register slots we're beyond the user's backingstore and
273 * then computing the equivalent address in kernel space.
274 */
275 num_regs = ia64_rse_num_regs(ubspstore, urnat_addr + 1);
276 slot0_kaddr = ia64_rse_skip_regs(krbs, num_regs);
277 shift = ia64_rse_slot_num(slot0_kaddr);
278 rnat1_kaddr = ia64_rse_rnat_addr(slot0_kaddr);
279 rnat0_kaddr = rnat1_kaddr - 64;
280
281 if (ubspstore + 63 > urnat_addr) {
282 /* some bits need to be merged in from pt->ar_rnat */
283 umask = MASK(ia64_rse_slot_num(ubspstore)) & mask;
284 urnat = (pt->ar_rnat & umask);
285 mask &= ~umask;
286 if (!mask)
287 return urnat;
288 }
289
290 m = mask << shift;
291 if (rnat0_kaddr >= kbsp)
292 rnat0 = sw->ar_rnat;
293 else if (rnat0_kaddr > krbs)
294 rnat0 = *rnat0_kaddr;
295 urnat |= (rnat0 & m) >> shift;
296
297 m = mask >> (63 - shift);
298 if (rnat1_kaddr >= kbsp)
299 rnat1 = sw->ar_rnat;
300 else if (rnat1_kaddr > krbs)
301 rnat1 = *rnat1_kaddr;
302 urnat |= (rnat1 & m) << (63 - shift);
303 return urnat;
304}
305
306/*
307 * The reverse of get_rnat.
308 */
309static void
310put_rnat (struct task_struct *task, struct switch_stack *sw,
311 unsigned long *krbs, unsigned long *urnat_addr, unsigned long urnat,
312 unsigned long *urbs_end)
313{
314 unsigned long rnat0 = 0, rnat1 = 0, *slot0_kaddr, umask = 0, mask, m;
315 unsigned long *kbsp, *ubspstore, *rnat0_kaddr, *rnat1_kaddr, shift;
316 long num_regs, nbits;
317 struct pt_regs *pt;
318 unsigned long cfm, *urbs_kargs;
319
Al Viro64505782006-01-12 01:06:06 -0800320 pt = task_pt_regs(task);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700321 kbsp = (unsigned long *) sw->ar_bspstore;
322 ubspstore = (unsigned long *) pt->ar_bspstore;
323
324 urbs_kargs = urbs_end;
325 if (in_syscall(pt)) {
326 /*
327 * If entered via syscall, don't allow user to set rnat bits
328 * for syscall args.
329 */
330 cfm = pt->cr_ifs;
331 urbs_kargs = ia64_rse_skip_regs(urbs_end, -(cfm & 0x7f));
332 }
333
334 if (urbs_kargs >= urnat_addr)
335 nbits = 63;
336 else {
337 if ((urnat_addr - 63) >= urbs_kargs)
338 return;
339 nbits = ia64_rse_num_regs(urnat_addr - 63, urbs_kargs);
340 }
341 mask = MASK(nbits);
342
343 /*
344 * First, figure out which bit number slot 0 in user-land maps
345 * to in the kernel rnat. Do this by figuring out how many
346 * register slots we're beyond the user's backingstore and
347 * then computing the equivalent address in kernel space.
348 */
349 num_regs = ia64_rse_num_regs(ubspstore, urnat_addr + 1);
350 slot0_kaddr = ia64_rse_skip_regs(krbs, num_regs);
351 shift = ia64_rse_slot_num(slot0_kaddr);
352 rnat1_kaddr = ia64_rse_rnat_addr(slot0_kaddr);
353 rnat0_kaddr = rnat1_kaddr - 64;
354
355 if (ubspstore + 63 > urnat_addr) {
356 /* some bits need to be place in pt->ar_rnat: */
357 umask = MASK(ia64_rse_slot_num(ubspstore)) & mask;
358 pt->ar_rnat = (pt->ar_rnat & ~umask) | (urnat & umask);
359 mask &= ~umask;
360 if (!mask)
361 return;
362 }
363 /*
364 * Note: Section 11.1 of the EAS guarantees that bit 63 of an
365 * rnat slot is ignored. so we don't have to clear it here.
366 */
367 rnat0 = (urnat << shift);
368 m = mask << shift;
369 if (rnat0_kaddr >= kbsp)
370 sw->ar_rnat = (sw->ar_rnat & ~m) | (rnat0 & m);
371 else if (rnat0_kaddr > krbs)
372 *rnat0_kaddr = ((*rnat0_kaddr & ~m) | (rnat0 & m));
373
374 rnat1 = (urnat >> (63 - shift));
375 m = mask >> (63 - shift);
376 if (rnat1_kaddr >= kbsp)
377 sw->ar_rnat = (sw->ar_rnat & ~m) | (rnat1 & m);
378 else if (rnat1_kaddr > krbs)
379 *rnat1_kaddr = ((*rnat1_kaddr & ~m) | (rnat1 & m));
380}
381
382static inline int
383on_kernel_rbs (unsigned long addr, unsigned long bspstore,
384 unsigned long urbs_end)
385{
386 unsigned long *rnat_addr = ia64_rse_rnat_addr((unsigned long *)
387 urbs_end);
388 return (addr >= bspstore && addr <= (unsigned long) rnat_addr);
389}
390
391/*
392 * Read a word from the user-level backing store of task CHILD. ADDR
393 * is the user-level address to read the word from, VAL a pointer to
394 * the return value, and USER_BSP gives the end of the user-level
395 * backing store (i.e., it's the address that would be in ar.bsp after
396 * the user executed a "cover" instruction).
397 *
398 * This routine takes care of accessing the kernel register backing
399 * store for those registers that got spilled there. It also takes
400 * care of calculating the appropriate RNaT collection words.
401 */
402long
403ia64_peek (struct task_struct *child, struct switch_stack *child_stack,
404 unsigned long user_rbs_end, unsigned long addr, long *val)
405{
406 unsigned long *bspstore, *krbs, regnum, *laddr, *urbs_end, *rnat_addr;
407 struct pt_regs *child_regs;
408 size_t copied;
409 long ret;
410
411 urbs_end = (long *) user_rbs_end;
412 laddr = (unsigned long *) addr;
Al Viro64505782006-01-12 01:06:06 -0800413 child_regs = task_pt_regs(child);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414 bspstore = (unsigned long *) child_regs->ar_bspstore;
415 krbs = (unsigned long *) child + IA64_RBS_OFFSET/8;
416 if (on_kernel_rbs(addr, (unsigned long) bspstore,
417 (unsigned long) urbs_end))
418 {
419 /*
420 * Attempt to read the RBS in an area that's actually
421 * on the kernel RBS => read the corresponding bits in
422 * the kernel RBS.
423 */
424 rnat_addr = ia64_rse_rnat_addr(laddr);
425 ret = get_rnat(child, child_stack, krbs, rnat_addr, urbs_end);
426
427 if (laddr == rnat_addr) {
428 /* return NaT collection word itself */
429 *val = ret;
430 return 0;
431 }
432
433 if (((1UL << ia64_rse_slot_num(laddr)) & ret) != 0) {
434 /*
435 * It is implementation dependent whether the
436 * data portion of a NaT value gets saved on a
437 * st8.spill or RSE spill (e.g., see EAS 2.6,
438 * 4.4.4.6 Register Spill and Fill). To get
439 * consistent behavior across all possible
440 * IA-64 implementations, we return zero in
441 * this case.
442 */
443 *val = 0;
444 return 0;
445 }
446
447 if (laddr < urbs_end) {
448 /*
449 * The desired word is on the kernel RBS and
450 * is not a NaT.
451 */
452 regnum = ia64_rse_num_regs(bspstore, laddr);
453 *val = *ia64_rse_skip_regs(krbs, regnum);
454 return 0;
455 }
456 }
457 copied = access_process_vm(child, addr, &ret, sizeof(ret), 0);
458 if (copied != sizeof(ret))
459 return -EIO;
460 *val = ret;
461 return 0;
462}
463
464long
465ia64_poke (struct task_struct *child, struct switch_stack *child_stack,
466 unsigned long user_rbs_end, unsigned long addr, long val)
467{
468 unsigned long *bspstore, *krbs, regnum, *laddr;
469 unsigned long *urbs_end = (long *) user_rbs_end;
470 struct pt_regs *child_regs;
471
472 laddr = (unsigned long *) addr;
Al Viro64505782006-01-12 01:06:06 -0800473 child_regs = task_pt_regs(child);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700474 bspstore = (unsigned long *) child_regs->ar_bspstore;
475 krbs = (unsigned long *) child + IA64_RBS_OFFSET/8;
476 if (on_kernel_rbs(addr, (unsigned long) bspstore,
477 (unsigned long) urbs_end))
478 {
479 /*
480 * Attempt to write the RBS in an area that's actually
481 * on the kernel RBS => write the corresponding bits
482 * in the kernel RBS.
483 */
484 if (ia64_rse_is_rnat_slot(laddr))
485 put_rnat(child, child_stack, krbs, laddr, val,
486 urbs_end);
487 else {
488 if (laddr < urbs_end) {
489 regnum = ia64_rse_num_regs(bspstore, laddr);
490 *ia64_rse_skip_regs(krbs, regnum) = val;
491 }
492 }
493 } else if (access_process_vm(child, addr, &val, sizeof(val), 1)
494 != sizeof(val))
495 return -EIO;
496 return 0;
497}
498
499/*
500 * Calculate the address of the end of the user-level register backing
501 * store. This is the address that would have been stored in ar.bsp
502 * if the user had executed a "cover" instruction right before
503 * entering the kernel. If CFMP is not NULL, it is used to return the
504 * "current frame mask" that was active at the time the kernel was
505 * entered.
506 */
507unsigned long
508ia64_get_user_rbs_end (struct task_struct *child, struct pt_regs *pt,
509 unsigned long *cfmp)
510{
511 unsigned long *krbs, *bspstore, cfm = pt->cr_ifs;
512 long ndirty;
513
514 krbs = (unsigned long *) child + IA64_RBS_OFFSET/8;
515 bspstore = (unsigned long *) pt->ar_bspstore;
516 ndirty = ia64_rse_num_regs(krbs, krbs + (pt->loadrs >> 19));
517
518 if (in_syscall(pt))
519 ndirty += (cfm & 0x7f);
520 else
521 cfm &= ~(1UL << 63); /* clear valid bit */
522
523 if (cfmp)
524 *cfmp = cfm;
525 return (unsigned long) ia64_rse_skip_regs(bspstore, ndirty);
526}
527
528/*
529 * Synchronize (i.e, write) the RSE backing store living in kernel
530 * space to the VM of the CHILD task. SW and PT are the pointers to
531 * the switch_stack and pt_regs structures, respectively.
532 * USER_RBS_END is the user-level address at which the backing store
533 * ends.
534 */
535long
536ia64_sync_user_rbs (struct task_struct *child, struct switch_stack *sw,
537 unsigned long user_rbs_start, unsigned long user_rbs_end)
538{
539 unsigned long addr, val;
540 long ret;
541
542 /* now copy word for word from kernel rbs to user rbs: */
543 for (addr = user_rbs_start; addr < user_rbs_end; addr += 8) {
544 ret = ia64_peek(child, sw, user_rbs_end, addr, &val);
545 if (ret < 0)
546 return ret;
547 if (access_process_vm(child, addr, &val, sizeof(val), 1)
548 != sizeof(val))
549 return -EIO;
550 }
551 return 0;
552}
553
Petr Tesarik3b2ce0b2007-12-12 15:23:34 +0100554static long
555ia64_sync_kernel_rbs (struct task_struct *child, struct switch_stack *sw,
556 unsigned long user_rbs_start, unsigned long user_rbs_end)
557{
558 unsigned long addr, val;
559 long ret;
560
561 /* now copy word for word from user rbs to kernel rbs: */
562 for (addr = user_rbs_start; addr < user_rbs_end; addr += 8) {
563 if (access_process_vm(child, addr, &val, sizeof(val), 0)
564 != sizeof(val))
565 return -EIO;
566
567 ret = ia64_poke(child, sw, user_rbs_end, addr, val);
568 if (ret < 0)
569 return ret;
570 }
571 return 0;
572}
573
574typedef long (*syncfunc_t)(struct task_struct *, struct switch_stack *,
575 unsigned long, unsigned long);
576
577static void do_sync_rbs(struct unw_frame_info *info, void *arg)
578{
579 struct pt_regs *pt;
580 unsigned long urbs_end;
581 syncfunc_t fn = arg;
582
583 if (unw_unwind_to_user(info) < 0)
584 return;
585 pt = task_pt_regs(info->task);
586 urbs_end = ia64_get_user_rbs_end(info->task, pt, NULL);
587
588 fn(info->task, info->sw, pt->ar_bspstore, urbs_end);
589}
590
591/*
592 * when a thread is stopped (ptraced), debugger might change thread's user
593 * stack (change memory directly), and we must avoid the RSE stored in kernel
594 * to override user stack (user space's RSE is newer than kernel's in the
595 * case). To workaround the issue, we copy kernel RSE to user RSE before the
596 * task is stopped, so user RSE has updated data. we then copy user RSE to
597 * kernel after the task is resummed from traced stop and kernel will use the
598 * newer RSE to return to user. TIF_RESTORE_RSE is the flag to indicate we need
599 * synchronize user RSE to kernel.
600 */
601void ia64_ptrace_stop(void)
602{
603 if (test_and_set_tsk_thread_flag(current, TIF_RESTORE_RSE))
604 return;
Shaohua Lif14488c2008-10-06 10:43:06 -0700605 set_notify_resume(current);
Petr Tesarik3b2ce0b2007-12-12 15:23:34 +0100606 unw_init_running(do_sync_rbs, ia64_sync_user_rbs);
607}
608
609/*
610 * This is called to read back the register backing store.
611 */
612void ia64_sync_krbs(void)
613{
614 clear_tsk_thread_flag(current, TIF_RESTORE_RSE);
Petr Tesarik3b2ce0b2007-12-12 15:23:34 +0100615
616 unw_init_running(do_sync_rbs, ia64_sync_kernel_rbs);
617}
618
Petr Tesarikaa91a2e2007-12-12 15:24:25 +0100619/*
620 * After PTRACE_ATTACH, a thread's register backing store area in user
621 * space is assumed to contain correct data whenever the thread is
622 * stopped. arch_ptrace_stop takes care of this on tracing stops.
623 * But if the child was already stopped for job control when we attach
624 * to it, then it might not ever get into ptrace_stop by the time we
625 * want to examine the user memory containing the RBS.
626 */
627void
628ptrace_attach_sync_user_rbs (struct task_struct *child)
629{
630 int stopped = 0;
631 struct unw_frame_info info;
632
633 /*
634 * If the child is in TASK_STOPPED, we need to change that to
635 * TASK_TRACED momentarily while we operate on it. This ensures
636 * that the child won't be woken up and return to user mode while
637 * we are doing the sync. (It can only be woken up for SIGKILL.)
638 */
639
640 read_lock(&tasklist_lock);
Oleg Nesterovffdf9182010-05-26 14:43:14 -0700641 if (child->sighand) {
Petr Tesarikaa91a2e2007-12-12 15:24:25 +0100642 spin_lock_irq(&child->sighand->siglock);
643 if (child->state == TASK_STOPPED &&
644 !test_and_set_tsk_thread_flag(child, TIF_RESTORE_RSE)) {
Shaohua Lif14488c2008-10-06 10:43:06 -0700645 set_notify_resume(child);
Petr Tesarikaa91a2e2007-12-12 15:24:25 +0100646
647 child->state = TASK_TRACED;
648 stopped = 1;
649 }
650 spin_unlock_irq(&child->sighand->siglock);
651 }
652 read_unlock(&tasklist_lock);
653
654 if (!stopped)
655 return;
656
657 unw_init_from_blocked_task(&info, child);
658 do_sync_rbs(&info, ia64_sync_user_rbs);
659
660 /*
661 * Now move the child back into TASK_STOPPED if it should be in a
662 * job control stop, so that SIGCONT can be used to wake it up.
663 */
664 read_lock(&tasklist_lock);
Oleg Nesterovffdf9182010-05-26 14:43:14 -0700665 if (child->sighand) {
Petr Tesarikaa91a2e2007-12-12 15:24:25 +0100666 spin_lock_irq(&child->sighand->siglock);
667 if (child->state == TASK_TRACED &&
668 (child->signal->flags & SIGNAL_STOP_STOPPED)) {
669 child->state = TASK_STOPPED;
670 }
671 spin_unlock_irq(&child->sighand->siglock);
672 }
673 read_unlock(&tasklist_lock);
674}
675
Linus Torvalds1da177e2005-04-16 15:20:36 -0700676static inline int
677thread_matches (struct task_struct *thread, unsigned long addr)
678{
679 unsigned long thread_rbs_end;
680 struct pt_regs *thread_regs;
681
682 if (ptrace_check_attach(thread, 0) < 0)
683 /*
684 * If the thread is not in an attachable state, we'll
685 * ignore it. The net effect is that if ADDR happens
686 * to overlap with the portion of the thread's
687 * register backing store that is currently residing
688 * on the thread's kernel stack, then ptrace() may end
689 * up accessing a stale value. But if the thread
690 * isn't stopped, that's a problem anyhow, so we're
691 * doing as well as we can...
692 */
693 return 0;
694
Al Viro64505782006-01-12 01:06:06 -0800695 thread_regs = task_pt_regs(thread);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700696 thread_rbs_end = ia64_get_user_rbs_end(thread, thread_regs, NULL);
697 if (!on_kernel_rbs(addr, thread_regs->ar_bspstore, thread_rbs_end))
698 return 0;
699
700 return 1; /* looks like we've got a winner */
701}
702
703/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700704 * Write f32-f127 back to task->thread.fph if it has been modified.
705 */
706inline void
707ia64_flush_fph (struct task_struct *task)
708{
Al Viro64505782006-01-12 01:06:06 -0800709 struct ia64_psr *psr = ia64_psr(task_pt_regs(task));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700710
Peter Chubb05062d92005-06-08 15:50:20 -0700711 /*
712 * Prevent migrating this task while
713 * we're fiddling with the FPU state
714 */
715 preempt_disable();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700716 if (ia64_is_local_fpu_owner(task) && psr->mfh) {
717 psr->mfh = 0;
718 task->thread.flags |= IA64_THREAD_FPH_VALID;
719 ia64_save_fpu(&task->thread.fph[0]);
720 }
Peter Chubb05062d92005-06-08 15:50:20 -0700721 preempt_enable();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722}
723
724/*
725 * Sync the fph state of the task so that it can be manipulated
726 * through thread.fph. If necessary, f32-f127 are written back to
727 * thread.fph or, if the fph state hasn't been used before, thread.fph
728 * is cleared to zeroes. Also, access to f32-f127 is disabled to
729 * ensure that the task picks up the state from thread.fph when it
730 * executes again.
731 */
732void
733ia64_sync_fph (struct task_struct *task)
734{
Al Viro64505782006-01-12 01:06:06 -0800735 struct ia64_psr *psr = ia64_psr(task_pt_regs(task));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700736
737 ia64_flush_fph(task);
738 if (!(task->thread.flags & IA64_THREAD_FPH_VALID)) {
739 task->thread.flags |= IA64_THREAD_FPH_VALID;
740 memset(&task->thread.fph, 0, sizeof(task->thread.fph));
741 }
742 ia64_drop_fpu(task);
743 psr->dfh = 1;
744}
745
Linus Torvalds1da177e2005-04-16 15:20:36 -0700746/*
747 * Change the machine-state of CHILD such that it will return via the normal
748 * kernel exit-path, rather than the syscall-exit path.
749 */
750static void
751convert_to_non_syscall (struct task_struct *child, struct pt_regs *pt,
752 unsigned long cfm)
753{
754 struct unw_frame_info info, prev_info;
David Mosberger-Tang02a017a2005-05-10 11:35:00 -0700755 unsigned long ip, sp, pr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700756
757 unw_init_from_blocked_task(&info, child);
758 while (1) {
759 prev_info = info;
760 if (unw_unwind(&info) < 0)
761 return;
David Mosberger-Tang02a017a2005-05-10 11:35:00 -0700762
763 unw_get_sp(&info, &sp);
764 if ((long)((unsigned long)child + IA64_STK_OFFSET - sp)
765 < IA64_PT_REGS_SIZE) {
766 dprintk("ptrace.%s: ran off the top of the kernel "
Harvey Harrisond4ed8082008-03-04 15:15:00 -0800767 "stack\n", __func__);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700768 return;
David Mosberger-Tang02a017a2005-05-10 11:35:00 -0700769 }
770 if (unw_get_pr (&prev_info, &pr) < 0) {
771 unw_get_rp(&prev_info, &ip);
772 dprintk("ptrace.%s: failed to read "
773 "predicate register (ip=0x%lx)\n",
Harvey Harrisond4ed8082008-03-04 15:15:00 -0800774 __func__, ip);
David Mosberger-Tang02a017a2005-05-10 11:35:00 -0700775 return;
776 }
777 if (unw_is_intr_frame(&info)
778 && (pr & (1UL << PRED_USER_STACK)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700779 break;
780 }
781
David Mosberger-Tang7f9eaed2005-05-10 12:49:00 -0700782 /*
783 * Note: at the time of this call, the target task is blocked
784 * in notify_resume_user() and by clearling PRED_LEAVE_SYSCALL
785 * (aka, "pLvSys") we redirect execution from
786 * .work_pending_syscall_end to .work_processed_kernel.
787 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700788 unw_get_pr(&prev_info, &pr);
David Mosberger-Tang7f9eaed2005-05-10 12:49:00 -0700789 pr &= ~((1UL << PRED_SYSCALL) | (1UL << PRED_LEAVE_SYSCALL));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700790 pr |= (1UL << PRED_NON_SYSCALL);
791 unw_set_pr(&prev_info, pr);
792
793 pt->cr_ifs = (1UL << 63) | cfm;
David Mosberger-Tang7f9eaed2005-05-10 12:49:00 -0700794 /*
795 * Clear the memory that is NOT written on syscall-entry to
796 * ensure we do not leak kernel-state to user when execution
797 * resumes.
798 */
799 pt->r2 = 0;
800 pt->r3 = 0;
801 pt->r14 = 0;
802 memset(&pt->r16, 0, 16*8); /* clear r16-r31 */
803 memset(&pt->f6, 0, 6*16); /* clear f6-f11 */
804 pt->b7 = 0;
805 pt->ar_ccv = 0;
806 pt->ar_csd = 0;
807 pt->ar_ssd = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700808}
809
810static int
811access_nat_bits (struct task_struct *child, struct pt_regs *pt,
812 struct unw_frame_info *info,
813 unsigned long *data, int write_access)
814{
815 unsigned long regnum, nat_bits, scratch_unat, dummy = 0;
816 char nat = 0;
817
818 if (write_access) {
819 nat_bits = *data;
820 scratch_unat = ia64_put_scratch_nat_bits(pt, nat_bits);
821 if (unw_set_ar(info, UNW_AR_UNAT, scratch_unat) < 0) {
822 dprintk("ptrace: failed to set ar.unat\n");
823 return -1;
824 }
825 for (regnum = 4; regnum <= 7; ++regnum) {
826 unw_get_gr(info, regnum, &dummy, &nat);
827 unw_set_gr(info, regnum, dummy,
828 (nat_bits >> regnum) & 1);
829 }
830 } else {
831 if (unw_get_ar(info, UNW_AR_UNAT, &scratch_unat) < 0) {
832 dprintk("ptrace: failed to read ar.unat\n");
833 return -1;
834 }
835 nat_bits = ia64_get_scratch_nat_bits(pt, scratch_unat);
836 for (regnum = 4; regnum <= 7; ++regnum) {
837 unw_get_gr(info, regnum, &dummy, &nat);
838 nat_bits |= (nat != 0) << regnum;
839 }
840 *data = nat_bits;
841 }
842 return 0;
843}
844
845static int
846access_uarea (struct task_struct *child, unsigned long addr,
Shaohua Li4cd8dc82008-02-28 16:09:42 +0800847 unsigned long *data, int write_access);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700848
849static long
850ptrace_getregs (struct task_struct *child, struct pt_all_user_regs __user *ppr)
851{
852 unsigned long psr, ec, lc, rnat, bsp, cfm, nat_bits, val;
853 struct unw_frame_info info;
854 struct ia64_fpreg fpval;
855 struct switch_stack *sw;
856 struct pt_regs *pt;
857 long ret, retval = 0;
858 char nat = 0;
859 int i;
860
861 if (!access_ok(VERIFY_WRITE, ppr, sizeof(struct pt_all_user_regs)))
862 return -EIO;
863
Al Viro64505782006-01-12 01:06:06 -0800864 pt = task_pt_regs(child);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700865 sw = (struct switch_stack *) (child->thread.ksp + 16);
866 unw_init_from_blocked_task(&info, child);
867 if (unw_unwind_to_user(&info) < 0) {
868 return -EIO;
869 }
870
871 if (((unsigned long) ppr & 0x7) != 0) {
872 dprintk("ptrace:unaligned register address %p\n", ppr);
873 return -EIO;
874 }
875
876 if (access_uarea(child, PT_CR_IPSR, &psr, 0) < 0
877 || access_uarea(child, PT_AR_EC, &ec, 0) < 0
878 || access_uarea(child, PT_AR_LC, &lc, 0) < 0
879 || access_uarea(child, PT_AR_RNAT, &rnat, 0) < 0
880 || access_uarea(child, PT_AR_BSP, &bsp, 0) < 0
881 || access_uarea(child, PT_CFM, &cfm, 0)
882 || access_uarea(child, PT_NAT_BITS, &nat_bits, 0))
883 return -EIO;
884
885 /* control regs */
886
887 retval |= __put_user(pt->cr_iip, &ppr->cr_iip);
888 retval |= __put_user(psr, &ppr->cr_ipsr);
889
890 /* app regs */
891
892 retval |= __put_user(pt->ar_pfs, &ppr->ar[PT_AUR_PFS]);
893 retval |= __put_user(pt->ar_rsc, &ppr->ar[PT_AUR_RSC]);
894 retval |= __put_user(pt->ar_bspstore, &ppr->ar[PT_AUR_BSPSTORE]);
895 retval |= __put_user(pt->ar_unat, &ppr->ar[PT_AUR_UNAT]);
896 retval |= __put_user(pt->ar_ccv, &ppr->ar[PT_AUR_CCV]);
897 retval |= __put_user(pt->ar_fpsr, &ppr->ar[PT_AUR_FPSR]);
898
899 retval |= __put_user(ec, &ppr->ar[PT_AUR_EC]);
900 retval |= __put_user(lc, &ppr->ar[PT_AUR_LC]);
901 retval |= __put_user(rnat, &ppr->ar[PT_AUR_RNAT]);
902 retval |= __put_user(bsp, &ppr->ar[PT_AUR_BSP]);
903 retval |= __put_user(cfm, &ppr->cfm);
904
905 /* gr1-gr3 */
906
907 retval |= __copy_to_user(&ppr->gr[1], &pt->r1, sizeof(long));
908 retval |= __copy_to_user(&ppr->gr[2], &pt->r2, sizeof(long) *2);
909
910 /* gr4-gr7 */
911
912 for (i = 4; i < 8; i++) {
913 if (unw_access_gr(&info, i, &val, &nat, 0) < 0)
914 return -EIO;
915 retval |= __put_user(val, &ppr->gr[i]);
916 }
917
918 /* gr8-gr11 */
919
920 retval |= __copy_to_user(&ppr->gr[8], &pt->r8, sizeof(long) * 4);
921
922 /* gr12-gr15 */
923
924 retval |= __copy_to_user(&ppr->gr[12], &pt->r12, sizeof(long) * 2);
925 retval |= __copy_to_user(&ppr->gr[14], &pt->r14, sizeof(long));
926 retval |= __copy_to_user(&ppr->gr[15], &pt->r15, sizeof(long));
927
928 /* gr16-gr31 */
929
930 retval |= __copy_to_user(&ppr->gr[16], &pt->r16, sizeof(long) * 16);
931
932 /* b0 */
933
934 retval |= __put_user(pt->b0, &ppr->br[0]);
935
936 /* b1-b5 */
937
938 for (i = 1; i < 6; i++) {
939 if (unw_access_br(&info, i, &val, 0) < 0)
940 return -EIO;
941 __put_user(val, &ppr->br[i]);
942 }
943
944 /* b6-b7 */
945
946 retval |= __put_user(pt->b6, &ppr->br[6]);
947 retval |= __put_user(pt->b7, &ppr->br[7]);
948
949 /* fr2-fr5 */
950
951 for (i = 2; i < 6; i++) {
952 if (unw_get_fr(&info, i, &fpval) < 0)
953 return -EIO;
954 retval |= __copy_to_user(&ppr->fr[i], &fpval, sizeof (fpval));
955 }
956
957 /* fr6-fr11 */
958
959 retval |= __copy_to_user(&ppr->fr[6], &pt->f6,
960 sizeof(struct ia64_fpreg) * 6);
961
962 /* fp scratch regs(12-15) */
963
964 retval |= __copy_to_user(&ppr->fr[12], &sw->f12,
965 sizeof(struct ia64_fpreg) * 4);
966
967 /* fr16-fr31 */
968
969 for (i = 16; i < 32; i++) {
970 if (unw_get_fr(&info, i, &fpval) < 0)
971 return -EIO;
972 retval |= __copy_to_user(&ppr->fr[i], &fpval, sizeof (fpval));
973 }
974
975 /* fph */
976
977 ia64_flush_fph(child);
978 retval |= __copy_to_user(&ppr->fr[32], &child->thread.fph,
979 sizeof(ppr->fr[32]) * 96);
980
981 /* preds */
982
983 retval |= __put_user(pt->pr, &ppr->pr);
984
985 /* nat bits */
986
987 retval |= __put_user(nat_bits, &ppr->nat);
988
989 ret = retval ? -EIO : 0;
990 return ret;
991}
992
993static long
994ptrace_setregs (struct task_struct *child, struct pt_all_user_regs __user *ppr)
995{
Matthew Chapman4ea78722005-06-21 16:19:20 -0700996 unsigned long psr, rsc, ec, lc, rnat, bsp, cfm, nat_bits, val = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700997 struct unw_frame_info info;
998 struct switch_stack *sw;
999 struct ia64_fpreg fpval;
1000 struct pt_regs *pt;
1001 long ret, retval = 0;
1002 int i;
1003
1004 memset(&fpval, 0, sizeof(fpval));
1005
1006 if (!access_ok(VERIFY_READ, ppr, sizeof(struct pt_all_user_regs)))
1007 return -EIO;
1008
Al Viro64505782006-01-12 01:06:06 -08001009 pt = task_pt_regs(child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001010 sw = (struct switch_stack *) (child->thread.ksp + 16);
1011 unw_init_from_blocked_task(&info, child);
1012 if (unw_unwind_to_user(&info) < 0) {
1013 return -EIO;
1014 }
1015
1016 if (((unsigned long) ppr & 0x7) != 0) {
1017 dprintk("ptrace:unaligned register address %p\n", ppr);
1018 return -EIO;
1019 }
1020
1021 /* control regs */
1022
1023 retval |= __get_user(pt->cr_iip, &ppr->cr_iip);
1024 retval |= __get_user(psr, &ppr->cr_ipsr);
1025
1026 /* app regs */
1027
1028 retval |= __get_user(pt->ar_pfs, &ppr->ar[PT_AUR_PFS]);
Matthew Chapman4ea78722005-06-21 16:19:20 -07001029 retval |= __get_user(rsc, &ppr->ar[PT_AUR_RSC]);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001030 retval |= __get_user(pt->ar_bspstore, &ppr->ar[PT_AUR_BSPSTORE]);
1031 retval |= __get_user(pt->ar_unat, &ppr->ar[PT_AUR_UNAT]);
1032 retval |= __get_user(pt->ar_ccv, &ppr->ar[PT_AUR_CCV]);
1033 retval |= __get_user(pt->ar_fpsr, &ppr->ar[PT_AUR_FPSR]);
1034
1035 retval |= __get_user(ec, &ppr->ar[PT_AUR_EC]);
1036 retval |= __get_user(lc, &ppr->ar[PT_AUR_LC]);
1037 retval |= __get_user(rnat, &ppr->ar[PT_AUR_RNAT]);
1038 retval |= __get_user(bsp, &ppr->ar[PT_AUR_BSP]);
1039 retval |= __get_user(cfm, &ppr->cfm);
1040
1041 /* gr1-gr3 */
1042
1043 retval |= __copy_from_user(&pt->r1, &ppr->gr[1], sizeof(long));
1044 retval |= __copy_from_user(&pt->r2, &ppr->gr[2], sizeof(long) * 2);
1045
1046 /* gr4-gr7 */
1047
1048 for (i = 4; i < 8; i++) {
1049 retval |= __get_user(val, &ppr->gr[i]);
1050 /* NaT bit will be set via PT_NAT_BITS: */
1051 if (unw_set_gr(&info, i, val, 0) < 0)
1052 return -EIO;
1053 }
1054
1055 /* gr8-gr11 */
1056
1057 retval |= __copy_from_user(&pt->r8, &ppr->gr[8], sizeof(long) * 4);
1058
1059 /* gr12-gr15 */
1060
1061 retval |= __copy_from_user(&pt->r12, &ppr->gr[12], sizeof(long) * 2);
1062 retval |= __copy_from_user(&pt->r14, &ppr->gr[14], sizeof(long));
1063 retval |= __copy_from_user(&pt->r15, &ppr->gr[15], sizeof(long));
1064
1065 /* gr16-gr31 */
1066
1067 retval |= __copy_from_user(&pt->r16, &ppr->gr[16], sizeof(long) * 16);
1068
1069 /* b0 */
1070
1071 retval |= __get_user(pt->b0, &ppr->br[0]);
1072
1073 /* b1-b5 */
1074
1075 for (i = 1; i < 6; i++) {
1076 retval |= __get_user(val, &ppr->br[i]);
1077 unw_set_br(&info, i, val);
1078 }
1079
1080 /* b6-b7 */
1081
1082 retval |= __get_user(pt->b6, &ppr->br[6]);
1083 retval |= __get_user(pt->b7, &ppr->br[7]);
1084
1085 /* fr2-fr5 */
1086
1087 for (i = 2; i < 6; i++) {
1088 retval |= __copy_from_user(&fpval, &ppr->fr[i], sizeof(fpval));
1089 if (unw_set_fr(&info, i, fpval) < 0)
1090 return -EIO;
1091 }
1092
1093 /* fr6-fr11 */
1094
1095 retval |= __copy_from_user(&pt->f6, &ppr->fr[6],
1096 sizeof(ppr->fr[6]) * 6);
1097
1098 /* fp scratch regs(12-15) */
1099
1100 retval |= __copy_from_user(&sw->f12, &ppr->fr[12],
1101 sizeof(ppr->fr[12]) * 4);
1102
1103 /* fr16-fr31 */
1104
1105 for (i = 16; i < 32; i++) {
1106 retval |= __copy_from_user(&fpval, &ppr->fr[i],
1107 sizeof(fpval));
1108 if (unw_set_fr(&info, i, fpval) < 0)
1109 return -EIO;
1110 }
1111
1112 /* fph */
1113
1114 ia64_sync_fph(child);
1115 retval |= __copy_from_user(&child->thread.fph, &ppr->fr[32],
1116 sizeof(ppr->fr[32]) * 96);
1117
1118 /* preds */
1119
1120 retval |= __get_user(pt->pr, &ppr->pr);
1121
1122 /* nat bits */
1123
1124 retval |= __get_user(nat_bits, &ppr->nat);
1125
1126 retval |= access_uarea(child, PT_CR_IPSR, &psr, 1);
Matthew Chapman4ea78722005-06-21 16:19:20 -07001127 retval |= access_uarea(child, PT_AR_RSC, &rsc, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001128 retval |= access_uarea(child, PT_AR_EC, &ec, 1);
1129 retval |= access_uarea(child, PT_AR_LC, &lc, 1);
1130 retval |= access_uarea(child, PT_AR_RNAT, &rnat, 1);
1131 retval |= access_uarea(child, PT_AR_BSP, &bsp, 1);
1132 retval |= access_uarea(child, PT_CFM, &cfm, 1);
1133 retval |= access_uarea(child, PT_NAT_BITS, &nat_bits, 1);
1134
1135 ret = retval ? -EIO : 0;
1136 return ret;
1137}
1138
Petr Tesarik8db3f522008-02-11 22:43:38 +01001139void
1140user_enable_single_step (struct task_struct *child)
1141{
1142 struct ia64_psr *child_psr = ia64_psr(task_pt_regs(child));
1143
1144 set_tsk_thread_flag(child, TIF_SINGLESTEP);
1145 child_psr->ss = 1;
1146}
1147
1148void
1149user_enable_block_step (struct task_struct *child)
1150{
1151 struct ia64_psr *child_psr = ia64_psr(task_pt_regs(child));
1152
1153 set_tsk_thread_flag(child, TIF_SINGLESTEP);
1154 child_psr->tb = 1;
1155}
1156
1157void
1158user_disable_single_step (struct task_struct *child)
1159{
1160 struct ia64_psr *child_psr = ia64_psr(task_pt_regs(child));
1161
1162 /* make sure the single step/taken-branch trap bits are not set: */
1163 clear_tsk_thread_flag(child, TIF_SINGLESTEP);
1164 child_psr->ss = 0;
1165 child_psr->tb = 0;
1166}
1167
Linus Torvalds1da177e2005-04-16 15:20:36 -07001168/*
1169 * Called by kernel/ptrace.c when detaching..
1170 *
1171 * Make sure the single step bit is not set.
1172 */
1173void
1174ptrace_disable (struct task_struct *child)
1175{
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001176 user_disable_single_step(child);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001177}
1178
Petr Tesarikeac738e2008-02-11 22:43:05 +01001179long
Namhyung Kim9b05a692010-10-27 15:33:47 -07001180arch_ptrace (struct task_struct *child, long request,
1181 unsigned long addr, unsigned long data)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001182{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001183 switch (request) {
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001184 case PTRACE_PEEKTEXT:
1185 case PTRACE_PEEKDATA:
Linus Torvalds1da177e2005-04-16 15:20:36 -07001186 /* read word at location addr */
Petr Tesarik972559a2008-02-11 22:41:18 +01001187 if (access_process_vm(child, addr, &data, sizeof(data), 0)
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001188 != sizeof(data))
1189 return -EIO;
1190 /* ensure return value is not mistaken for error code */
Petr Tesarik972559a2008-02-11 22:41:18 +01001191 force_successful_syscall_return();
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001192 return data;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001193
Petr Tesarik972559a2008-02-11 22:41:18 +01001194 /* PTRACE_POKETEXT and PTRACE_POKEDATA is handled
1195 * by the generic ptrace_request().
1196 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001197
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001198 case PTRACE_PEEKUSR:
Linus Torvalds1da177e2005-04-16 15:20:36 -07001199 /* read the word at addr in the USER area */
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001200 if (access_uarea(child, addr, &data, 0) < 0)
1201 return -EIO;
1202 /* ensure return value is not mistaken for error code */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001203 force_successful_syscall_return();
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001204 return data;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001205
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001206 case PTRACE_POKEUSR:
Linus Torvalds1da177e2005-04-16 15:20:36 -07001207 /* write the word at addr in the USER area */
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001208 if (access_uarea(child, addr, &data, 1) < 0)
1209 return -EIO;
1210 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001211
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001212 case PTRACE_OLD_GETSIGINFO:
Linus Torvalds1da177e2005-04-16 15:20:36 -07001213 /* for backwards-compatibility */
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001214 return ptrace_request(child, PTRACE_GETSIGINFO, addr, data);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001215
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001216 case PTRACE_OLD_SETSIGINFO:
Linus Torvalds1da177e2005-04-16 15:20:36 -07001217 /* for backwards-compatibility */
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001218 return ptrace_request(child, PTRACE_SETSIGINFO, addr, data);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001219
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001220 case PTRACE_GETREGS:
1221 return ptrace_getregs(child,
1222 (struct pt_all_user_regs __user *) data);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001223
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001224 case PTRACE_SETREGS:
1225 return ptrace_setregs(child,
1226 (struct pt_all_user_regs __user *) data);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001227
Petr Tesarikaa17f6f2008-02-26 12:03:28 +01001228 default:
1229 return ptrace_request(child, request, addr, data);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001230 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001231}
1232
1233
Linus Torvalds1da177e2005-04-16 15:20:36 -07001234/* "asmlinkage" so the input arguments are preserved... */
1235
Shaohua Lif14488c2008-10-06 10:43:06 -07001236asmlinkage long
Linus Torvalds1da177e2005-04-16 15:20:36 -07001237syscall_trace_enter (long arg0, long arg1, long arg2, long arg3,
1238 long arg4, long arg5, long arg6, long arg7,
1239 struct pt_regs regs)
1240{
Shaohua Lif14488c2008-10-06 10:43:06 -07001241 if (test_thread_flag(TIF_SYSCALL_TRACE))
1242 if (tracehook_report_syscall_entry(&regs))
1243 return -ENOSYS;
2fd6f582005-04-29 16:08:28 +01001244
Petr Tesarik3b2ce0b2007-12-12 15:23:34 +01001245 /* copy user rbs to kernel rbs */
1246 if (test_thread_flag(TIF_RESTORE_RSE))
1247 ia64_sync_krbs();
1248
2fd6f582005-04-29 16:08:28 +01001249 if (unlikely(current->audit_context)) {
1250 long syscall;
1251 int arch;
1252
Tony Luck32974ad2010-02-08 10:42:17 -08001253 syscall = regs.r15;
1254 arch = AUDIT_ARCH_IA64;
2fd6f582005-04-29 16:08:28 +01001255
Al Viro5411be52006-03-29 20:23:36 -05001256 audit_syscall_entry(arch, syscall, arg0, arg1, arg2, arg3);
2fd6f582005-04-29 16:08:28 +01001257 }
1258
Shaohua Lif14488c2008-10-06 10:43:06 -07001259 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001260}
1261
1262/* "asmlinkage" so the input arguments are preserved... */
1263
1264asmlinkage void
1265syscall_trace_leave (long arg0, long arg1, long arg2, long arg3,
1266 long arg4, long arg5, long arg6, long arg7,
1267 struct pt_regs regs)
1268{
Shaohua Lif14488c2008-10-06 10:43:06 -07001269 int step;
1270
Eric Parisd7e75282012-01-03 14:23:06 -05001271 audit_syscall_exit(&regs);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001272
Shaohua Lif14488c2008-10-06 10:43:06 -07001273 step = test_thread_flag(TIF_SINGLESTEP);
1274 if (step || test_thread_flag(TIF_SYSCALL_TRACE))
1275 tracehook_report_syscall_exit(&regs, step);
Petr Tesarik3b2ce0b2007-12-12 15:23:34 +01001276
1277 /* copy user rbs to kernel rbs */
1278 if (test_thread_flag(TIF_RESTORE_RSE))
1279 ia64_sync_krbs();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001280}
Shaohua Lic70f8f62008-02-28 16:47:50 +08001281
1282/* Utrace implementation starts here */
1283struct regset_get {
1284 void *kbuf;
1285 void __user *ubuf;
1286};
1287
1288struct regset_set {
1289 const void *kbuf;
1290 const void __user *ubuf;
1291};
1292
1293struct regset_getset {
1294 struct task_struct *target;
1295 const struct user_regset *regset;
1296 union {
1297 struct regset_get get;
1298 struct regset_set set;
1299 } u;
1300 unsigned int pos;
1301 unsigned int count;
1302 int ret;
1303};
1304
1305static int
1306access_elf_gpreg(struct task_struct *target, struct unw_frame_info *info,
1307 unsigned long addr, unsigned long *data, int write_access)
1308{
1309 struct pt_regs *pt;
1310 unsigned long *ptr = NULL;
1311 int ret;
1312 char nat = 0;
1313
1314 pt = task_pt_regs(target);
1315 switch (addr) {
1316 case ELF_GR_OFFSET(1):
1317 ptr = &pt->r1;
1318 break;
1319 case ELF_GR_OFFSET(2):
1320 case ELF_GR_OFFSET(3):
1321 ptr = (void *)&pt->r2 + (addr - ELF_GR_OFFSET(2));
1322 break;
1323 case ELF_GR_OFFSET(4) ... ELF_GR_OFFSET(7):
1324 if (write_access) {
1325 /* read NaT bit first: */
1326 unsigned long dummy;
1327
1328 ret = unw_get_gr(info, addr/8, &dummy, &nat);
1329 if (ret < 0)
1330 return ret;
1331 }
1332 return unw_access_gr(info, addr/8, data, &nat, write_access);
1333 case ELF_GR_OFFSET(8) ... ELF_GR_OFFSET(11):
1334 ptr = (void *)&pt->r8 + addr - ELF_GR_OFFSET(8);
1335 break;
1336 case ELF_GR_OFFSET(12):
1337 case ELF_GR_OFFSET(13):
1338 ptr = (void *)&pt->r12 + addr - ELF_GR_OFFSET(12);
1339 break;
1340 case ELF_GR_OFFSET(14):
1341 ptr = &pt->r14;
1342 break;
1343 case ELF_GR_OFFSET(15):
1344 ptr = &pt->r15;
1345 }
1346 if (write_access)
1347 *ptr = *data;
1348 else
1349 *data = *ptr;
1350 return 0;
1351}
1352
1353static int
1354access_elf_breg(struct task_struct *target, struct unw_frame_info *info,
1355 unsigned long addr, unsigned long *data, int write_access)
1356{
1357 struct pt_regs *pt;
1358 unsigned long *ptr = NULL;
1359
1360 pt = task_pt_regs(target);
1361 switch (addr) {
1362 case ELF_BR_OFFSET(0):
1363 ptr = &pt->b0;
1364 break;
1365 case ELF_BR_OFFSET(1) ... ELF_BR_OFFSET(5):
1366 return unw_access_br(info, (addr - ELF_BR_OFFSET(0))/8,
1367 data, write_access);
1368 case ELF_BR_OFFSET(6):
1369 ptr = &pt->b6;
1370 break;
1371 case ELF_BR_OFFSET(7):
1372 ptr = &pt->b7;
1373 }
1374 if (write_access)
1375 *ptr = *data;
1376 else
1377 *data = *ptr;
1378 return 0;
1379}
1380
1381static int
1382access_elf_areg(struct task_struct *target, struct unw_frame_info *info,
1383 unsigned long addr, unsigned long *data, int write_access)
1384{
1385 struct pt_regs *pt;
1386 unsigned long cfm, urbs_end;
1387 unsigned long *ptr = NULL;
1388
1389 pt = task_pt_regs(target);
1390 if (addr >= ELF_AR_RSC_OFFSET && addr <= ELF_AR_SSD_OFFSET) {
1391 switch (addr) {
1392 case ELF_AR_RSC_OFFSET:
1393 /* force PL3 */
1394 if (write_access)
1395 pt->ar_rsc = *data | (3 << 2);
1396 else
1397 *data = pt->ar_rsc;
1398 return 0;
1399 case ELF_AR_BSP_OFFSET:
1400 /*
1401 * By convention, we use PT_AR_BSP to refer to
1402 * the end of the user-level backing store.
1403 * Use ia64_rse_skip_regs(PT_AR_BSP, -CFM.sof)
1404 * to get the real value of ar.bsp at the time
1405 * the kernel was entered.
1406 *
1407 * Furthermore, when changing the contents of
1408 * PT_AR_BSP (or PT_CFM) while the task is
1409 * blocked in a system call, convert the state
1410 * so that the non-system-call exit
1411 * path is used. This ensures that the proper
1412 * state will be picked up when resuming
1413 * execution. However, it *also* means that
1414 * once we write PT_AR_BSP/PT_CFM, it won't be
1415 * possible to modify the syscall arguments of
1416 * the pending system call any longer. This
1417 * shouldn't be an issue because modifying
1418 * PT_AR_BSP/PT_CFM generally implies that
1419 * we're either abandoning the pending system
1420 * call or that we defer it's re-execution
1421 * (e.g., due to GDB doing an inferior
1422 * function call).
1423 */
1424 urbs_end = ia64_get_user_rbs_end(target, pt, &cfm);
1425 if (write_access) {
1426 if (*data != urbs_end) {
1427 if (in_syscall(pt))
1428 convert_to_non_syscall(target,
1429 pt,
1430 cfm);
1431 /*
1432 * Simulate user-level write
1433 * of ar.bsp:
1434 */
1435 pt->loadrs = 0;
1436 pt->ar_bspstore = *data;
1437 }
1438 } else
1439 *data = urbs_end;
1440 return 0;
1441 case ELF_AR_BSPSTORE_OFFSET:
1442 ptr = &pt->ar_bspstore;
1443 break;
1444 case ELF_AR_RNAT_OFFSET:
1445 ptr = &pt->ar_rnat;
1446 break;
1447 case ELF_AR_CCV_OFFSET:
1448 ptr = &pt->ar_ccv;
1449 break;
1450 case ELF_AR_UNAT_OFFSET:
1451 ptr = &pt->ar_unat;
1452 break;
1453 case ELF_AR_FPSR_OFFSET:
1454 ptr = &pt->ar_fpsr;
1455 break;
1456 case ELF_AR_PFS_OFFSET:
1457 ptr = &pt->ar_pfs;
1458 break;
1459 case ELF_AR_LC_OFFSET:
1460 return unw_access_ar(info, UNW_AR_LC, data,
1461 write_access);
1462 case ELF_AR_EC_OFFSET:
1463 return unw_access_ar(info, UNW_AR_EC, data,
1464 write_access);
1465 case ELF_AR_CSD_OFFSET:
1466 ptr = &pt->ar_csd;
1467 break;
1468 case ELF_AR_SSD_OFFSET:
1469 ptr = &pt->ar_ssd;
1470 }
1471 } else if (addr >= ELF_CR_IIP_OFFSET && addr <= ELF_CR_IPSR_OFFSET) {
1472 switch (addr) {
1473 case ELF_CR_IIP_OFFSET:
1474 ptr = &pt->cr_iip;
1475 break;
1476 case ELF_CFM_OFFSET:
1477 urbs_end = ia64_get_user_rbs_end(target, pt, &cfm);
1478 if (write_access) {
1479 if (((cfm ^ *data) & PFM_MASK) != 0) {
1480 if (in_syscall(pt))
1481 convert_to_non_syscall(target,
1482 pt,
1483 cfm);
1484 pt->cr_ifs = ((pt->cr_ifs & ~PFM_MASK)
1485 | (*data & PFM_MASK));
1486 }
1487 } else
1488 *data = cfm;
1489 return 0;
1490 case ELF_CR_IPSR_OFFSET:
1491 if (write_access) {
1492 unsigned long tmp = *data;
1493 /* psr.ri==3 is a reserved value: SDM 2:25 */
1494 if ((tmp & IA64_PSR_RI) == IA64_PSR_RI)
1495 tmp &= ~IA64_PSR_RI;
1496 pt->cr_ipsr = ((tmp & IPSR_MASK)
1497 | (pt->cr_ipsr & ~IPSR_MASK));
1498 } else
1499 *data = (pt->cr_ipsr & IPSR_MASK);
1500 return 0;
1501 }
1502 } else if (addr == ELF_NAT_OFFSET)
1503 return access_nat_bits(target, pt, info,
1504 data, write_access);
1505 else if (addr == ELF_PR_OFFSET)
1506 ptr = &pt->pr;
1507 else
1508 return -1;
1509
1510 if (write_access)
1511 *ptr = *data;
1512 else
1513 *data = *ptr;
1514
1515 return 0;
1516}
1517
1518static int
1519access_elf_reg(struct task_struct *target, struct unw_frame_info *info,
1520 unsigned long addr, unsigned long *data, int write_access)
1521{
1522 if (addr >= ELF_GR_OFFSET(1) && addr <= ELF_GR_OFFSET(15))
1523 return access_elf_gpreg(target, info, addr, data, write_access);
1524 else if (addr >= ELF_BR_OFFSET(0) && addr <= ELF_BR_OFFSET(7))
1525 return access_elf_breg(target, info, addr, data, write_access);
1526 else
1527 return access_elf_areg(target, info, addr, data, write_access);
1528}
1529
1530void do_gpregs_get(struct unw_frame_info *info, void *arg)
1531{
1532 struct pt_regs *pt;
1533 struct regset_getset *dst = arg;
1534 elf_greg_t tmp[16];
1535 unsigned int i, index, min_copy;
1536
1537 if (unw_unwind_to_user(info) < 0)
1538 return;
1539
1540 /*
1541 * coredump format:
1542 * r0-r31
1543 * NaT bits (for r0-r31; bit N == 1 iff rN is a NaT)
1544 * predicate registers (p0-p63)
1545 * b0-b7
1546 * ip cfm user-mask
1547 * ar.rsc ar.bsp ar.bspstore ar.rnat
1548 * ar.ccv ar.unat ar.fpsr ar.pfs ar.lc ar.ec
1549 */
1550
1551
1552 /* Skip r0 */
1553 if (dst->count > 0 && dst->pos < ELF_GR_OFFSET(1)) {
1554 dst->ret = user_regset_copyout_zero(&dst->pos, &dst->count,
1555 &dst->u.get.kbuf,
1556 &dst->u.get.ubuf,
1557 0, ELF_GR_OFFSET(1));
1558 if (dst->ret || dst->count == 0)
1559 return;
1560 }
1561
1562 /* gr1 - gr15 */
1563 if (dst->count > 0 && dst->pos < ELF_GR_OFFSET(16)) {
1564 index = (dst->pos - ELF_GR_OFFSET(1)) / sizeof(elf_greg_t);
1565 min_copy = ELF_GR_OFFSET(16) > (dst->pos + dst->count) ?
1566 (dst->pos + dst->count) : ELF_GR_OFFSET(16);
1567 for (i = dst->pos; i < min_copy; i += sizeof(elf_greg_t),
1568 index++)
1569 if (access_elf_reg(dst->target, info, i,
1570 &tmp[index], 0) < 0) {
1571 dst->ret = -EIO;
1572 return;
1573 }
1574 dst->ret = user_regset_copyout(&dst->pos, &dst->count,
1575 &dst->u.get.kbuf, &dst->u.get.ubuf, tmp,
1576 ELF_GR_OFFSET(1), ELF_GR_OFFSET(16));
1577 if (dst->ret || dst->count == 0)
1578 return;
1579 }
1580
1581 /* r16-r31 */
1582 if (dst->count > 0 && dst->pos < ELF_NAT_OFFSET) {
1583 pt = task_pt_regs(dst->target);
1584 dst->ret = user_regset_copyout(&dst->pos, &dst->count,
1585 &dst->u.get.kbuf, &dst->u.get.ubuf, &pt->r16,
1586 ELF_GR_OFFSET(16), ELF_NAT_OFFSET);
1587 if (dst->ret || dst->count == 0)
1588 return;
1589 }
1590
1591 /* nat, pr, b0 - b7 */
1592 if (dst->count > 0 && dst->pos < ELF_CR_IIP_OFFSET) {
1593 index = (dst->pos - ELF_NAT_OFFSET) / sizeof(elf_greg_t);
1594 min_copy = ELF_CR_IIP_OFFSET > (dst->pos + dst->count) ?
1595 (dst->pos + dst->count) : ELF_CR_IIP_OFFSET;
1596 for (i = dst->pos; i < min_copy; i += sizeof(elf_greg_t),
1597 index++)
1598 if (access_elf_reg(dst->target, info, i,
1599 &tmp[index], 0) < 0) {
1600 dst->ret = -EIO;
1601 return;
1602 }
1603 dst->ret = user_regset_copyout(&dst->pos, &dst->count,
1604 &dst->u.get.kbuf, &dst->u.get.ubuf, tmp,
1605 ELF_NAT_OFFSET, ELF_CR_IIP_OFFSET);
1606 if (dst->ret || dst->count == 0)
1607 return;
1608 }
1609
1610 /* ip cfm psr ar.rsc ar.bsp ar.bspstore ar.rnat
1611 * ar.ccv ar.unat ar.fpsr ar.pfs ar.lc ar.ec ar.csd ar.ssd
1612 */
1613 if (dst->count > 0 && dst->pos < (ELF_AR_END_OFFSET)) {
1614 index = (dst->pos - ELF_CR_IIP_OFFSET) / sizeof(elf_greg_t);
1615 min_copy = ELF_AR_END_OFFSET > (dst->pos + dst->count) ?
1616 (dst->pos + dst->count) : ELF_AR_END_OFFSET;
1617 for (i = dst->pos; i < min_copy; i += sizeof(elf_greg_t),
1618 index++)
1619 if (access_elf_reg(dst->target, info, i,
1620 &tmp[index], 0) < 0) {
1621 dst->ret = -EIO;
1622 return;
1623 }
1624 dst->ret = user_regset_copyout(&dst->pos, &dst->count,
1625 &dst->u.get.kbuf, &dst->u.get.ubuf, tmp,
1626 ELF_CR_IIP_OFFSET, ELF_AR_END_OFFSET);
1627 }
1628}
1629
1630void do_gpregs_set(struct unw_frame_info *info, void *arg)
1631{
1632 struct pt_regs *pt;
1633 struct regset_getset *dst = arg;
1634 elf_greg_t tmp[16];
1635 unsigned int i, index;
1636
1637 if (unw_unwind_to_user(info) < 0)
1638 return;
1639
1640 /* Skip r0 */
1641 if (dst->count > 0 && dst->pos < ELF_GR_OFFSET(1)) {
1642 dst->ret = user_regset_copyin_ignore(&dst->pos, &dst->count,
1643 &dst->u.set.kbuf,
1644 &dst->u.set.ubuf,
1645 0, ELF_GR_OFFSET(1));
1646 if (dst->ret || dst->count == 0)
1647 return;
1648 }
1649
1650 /* gr1-gr15 */
1651 if (dst->count > 0 && dst->pos < ELF_GR_OFFSET(16)) {
1652 i = dst->pos;
1653 index = (dst->pos - ELF_GR_OFFSET(1)) / sizeof(elf_greg_t);
1654 dst->ret = user_regset_copyin(&dst->pos, &dst->count,
1655 &dst->u.set.kbuf, &dst->u.set.ubuf, tmp,
1656 ELF_GR_OFFSET(1), ELF_GR_OFFSET(16));
1657 if (dst->ret)
1658 return;
1659 for ( ; i < dst->pos; i += sizeof(elf_greg_t), index++)
1660 if (access_elf_reg(dst->target, info, i,
1661 &tmp[index], 1) < 0) {
1662 dst->ret = -EIO;
1663 return;
1664 }
1665 if (dst->count == 0)
1666 return;
1667 }
1668
1669 /* gr16-gr31 */
1670 if (dst->count > 0 && dst->pos < ELF_NAT_OFFSET) {
1671 pt = task_pt_regs(dst->target);
1672 dst->ret = user_regset_copyin(&dst->pos, &dst->count,
1673 &dst->u.set.kbuf, &dst->u.set.ubuf, &pt->r16,
1674 ELF_GR_OFFSET(16), ELF_NAT_OFFSET);
1675 if (dst->ret || dst->count == 0)
1676 return;
1677 }
1678
1679 /* nat, pr, b0 - b7 */
1680 if (dst->count > 0 && dst->pos < ELF_CR_IIP_OFFSET) {
1681 i = dst->pos;
1682 index = (dst->pos - ELF_NAT_OFFSET) / sizeof(elf_greg_t);
1683 dst->ret = user_regset_copyin(&dst->pos, &dst->count,
1684 &dst->u.set.kbuf, &dst->u.set.ubuf, tmp,
1685 ELF_NAT_OFFSET, ELF_CR_IIP_OFFSET);
1686 if (dst->ret)
1687 return;
1688 for (; i < dst->pos; i += sizeof(elf_greg_t), index++)
1689 if (access_elf_reg(dst->target, info, i,
1690 &tmp[index], 1) < 0) {
1691 dst->ret = -EIO;
1692 return;
1693 }
1694 if (dst->count == 0)
1695 return;
1696 }
1697
1698 /* ip cfm psr ar.rsc ar.bsp ar.bspstore ar.rnat
1699 * ar.ccv ar.unat ar.fpsr ar.pfs ar.lc ar.ec ar.csd ar.ssd
1700 */
1701 if (dst->count > 0 && dst->pos < (ELF_AR_END_OFFSET)) {
1702 i = dst->pos;
1703 index = (dst->pos - ELF_CR_IIP_OFFSET) / sizeof(elf_greg_t);
1704 dst->ret = user_regset_copyin(&dst->pos, &dst->count,
1705 &dst->u.set.kbuf, &dst->u.set.ubuf, tmp,
1706 ELF_CR_IIP_OFFSET, ELF_AR_END_OFFSET);
1707 if (dst->ret)
1708 return;
1709 for ( ; i < dst->pos; i += sizeof(elf_greg_t), index++)
1710 if (access_elf_reg(dst->target, info, i,
1711 &tmp[index], 1) < 0) {
1712 dst->ret = -EIO;
1713 return;
1714 }
1715 }
1716}
1717
1718#define ELF_FP_OFFSET(i) (i * sizeof(elf_fpreg_t))
1719
1720void do_fpregs_get(struct unw_frame_info *info, void *arg)
1721{
1722 struct regset_getset *dst = arg;
1723 struct task_struct *task = dst->target;
1724 elf_fpreg_t tmp[30];
1725 int index, min_copy, i;
1726
1727 if (unw_unwind_to_user(info) < 0)
1728 return;
1729
1730 /* Skip pos 0 and 1 */
1731 if (dst->count > 0 && dst->pos < ELF_FP_OFFSET(2)) {
1732 dst->ret = user_regset_copyout_zero(&dst->pos, &dst->count,
1733 &dst->u.get.kbuf,
1734 &dst->u.get.ubuf,
1735 0, ELF_FP_OFFSET(2));
1736 if (dst->count == 0 || dst->ret)
1737 return;
1738 }
1739
1740 /* fr2-fr31 */
1741 if (dst->count > 0 && dst->pos < ELF_FP_OFFSET(32)) {
1742 index = (dst->pos - ELF_FP_OFFSET(2)) / sizeof(elf_fpreg_t);
1743
1744 min_copy = min(((unsigned int)ELF_FP_OFFSET(32)),
1745 dst->pos + dst->count);
1746 for (i = dst->pos; i < min_copy; i += sizeof(elf_fpreg_t),
1747 index++)
1748 if (unw_get_fr(info, i / sizeof(elf_fpreg_t),
1749 &tmp[index])) {
1750 dst->ret = -EIO;
1751 return;
1752 }
1753 dst->ret = user_regset_copyout(&dst->pos, &dst->count,
1754 &dst->u.get.kbuf, &dst->u.get.ubuf, tmp,
1755 ELF_FP_OFFSET(2), ELF_FP_OFFSET(32));
1756 if (dst->count == 0 || dst->ret)
1757 return;
1758 }
1759
1760 /* fph */
1761 if (dst->count > 0) {
1762 ia64_flush_fph(dst->target);
1763 if (task->thread.flags & IA64_THREAD_FPH_VALID)
1764 dst->ret = user_regset_copyout(
1765 &dst->pos, &dst->count,
1766 &dst->u.get.kbuf, &dst->u.get.ubuf,
1767 &dst->target->thread.fph,
1768 ELF_FP_OFFSET(32), -1);
1769 else
1770 /* Zero fill instead. */
1771 dst->ret = user_regset_copyout_zero(
1772 &dst->pos, &dst->count,
1773 &dst->u.get.kbuf, &dst->u.get.ubuf,
1774 ELF_FP_OFFSET(32), -1);
1775 }
1776}
1777
1778void do_fpregs_set(struct unw_frame_info *info, void *arg)
1779{
1780 struct regset_getset *dst = arg;
1781 elf_fpreg_t fpreg, tmp[30];
1782 int index, start, end;
1783
1784 if (unw_unwind_to_user(info) < 0)
1785 return;
1786
1787 /* Skip pos 0 and 1 */
1788 if (dst->count > 0 && dst->pos < ELF_FP_OFFSET(2)) {
1789 dst->ret = user_regset_copyin_ignore(&dst->pos, &dst->count,
1790 &dst->u.set.kbuf,
1791 &dst->u.set.ubuf,
1792 0, ELF_FP_OFFSET(2));
1793 if (dst->count == 0 || dst->ret)
1794 return;
1795 }
1796
1797 /* fr2-fr31 */
1798 if (dst->count > 0 && dst->pos < ELF_FP_OFFSET(32)) {
1799 start = dst->pos;
1800 end = min(((unsigned int)ELF_FP_OFFSET(32)),
1801 dst->pos + dst->count);
1802 dst->ret = user_regset_copyin(&dst->pos, &dst->count,
1803 &dst->u.set.kbuf, &dst->u.set.ubuf, tmp,
1804 ELF_FP_OFFSET(2), ELF_FP_OFFSET(32));
1805 if (dst->ret)
1806 return;
1807
1808 if (start & 0xF) { /* only write high part */
1809 if (unw_get_fr(info, start / sizeof(elf_fpreg_t),
1810 &fpreg)) {
1811 dst->ret = -EIO;
1812 return;
1813 }
1814 tmp[start / sizeof(elf_fpreg_t) - 2].u.bits[0]
1815 = fpreg.u.bits[0];
1816 start &= ~0xFUL;
1817 }
1818 if (end & 0xF) { /* only write low part */
1819 if (unw_get_fr(info, end / sizeof(elf_fpreg_t),
1820 &fpreg)) {
1821 dst->ret = -EIO;
1822 return;
1823 }
1824 tmp[end / sizeof(elf_fpreg_t) - 2].u.bits[1]
1825 = fpreg.u.bits[1];
1826 end = (end + 0xF) & ~0xFUL;
1827 }
1828
1829 for ( ; start < end ; start += sizeof(elf_fpreg_t)) {
1830 index = start / sizeof(elf_fpreg_t);
1831 if (unw_set_fr(info, index, tmp[index - 2])) {
1832 dst->ret = -EIO;
1833 return;
1834 }
1835 }
1836 if (dst->ret || dst->count == 0)
1837 return;
1838 }
1839
1840 /* fph */
1841 if (dst->count > 0 && dst->pos < ELF_FP_OFFSET(128)) {
1842 ia64_sync_fph(dst->target);
1843 dst->ret = user_regset_copyin(&dst->pos, &dst->count,
1844 &dst->u.set.kbuf,
1845 &dst->u.set.ubuf,
1846 &dst->target->thread.fph,
1847 ELF_FP_OFFSET(32), -1);
1848 }
1849}
1850
1851static int
1852do_regset_call(void (*call)(struct unw_frame_info *, void *),
1853 struct task_struct *target,
1854 const struct user_regset *regset,
1855 unsigned int pos, unsigned int count,
1856 const void *kbuf, const void __user *ubuf)
1857{
1858 struct regset_getset info = { .target = target, .regset = regset,
1859 .pos = pos, .count = count,
1860 .u.set = { .kbuf = kbuf, .ubuf = ubuf },
1861 .ret = 0 };
1862
1863 if (target == current)
1864 unw_init_running(call, &info);
1865 else {
1866 struct unw_frame_info ufi;
1867 memset(&ufi, 0, sizeof(ufi));
1868 unw_init_from_blocked_task(&ufi, target);
1869 (*call)(&ufi, &info);
1870 }
1871
1872 return info.ret;
1873}
1874
1875static int
1876gpregs_get(struct task_struct *target,
1877 const struct user_regset *regset,
1878 unsigned int pos, unsigned int count,
1879 void *kbuf, void __user *ubuf)
1880{
1881 return do_regset_call(do_gpregs_get, target, regset, pos, count,
1882 kbuf, ubuf);
1883}
1884
1885static int gpregs_set(struct task_struct *target,
1886 const struct user_regset *regset,
1887 unsigned int pos, unsigned int count,
1888 const void *kbuf, const void __user *ubuf)
1889{
1890 return do_regset_call(do_gpregs_set, target, regset, pos, count,
1891 kbuf, ubuf);
1892}
1893
1894static void do_gpregs_writeback(struct unw_frame_info *info, void *arg)
1895{
1896 do_sync_rbs(info, ia64_sync_user_rbs);
1897}
1898
1899/*
1900 * This is called to write back the register backing store.
1901 * ptrace does this before it stops, so that a tracer reading the user
1902 * memory after the thread stops will get the current register data.
1903 */
1904static int
1905gpregs_writeback(struct task_struct *target,
1906 const struct user_regset *regset,
1907 int now)
1908{
1909 if (test_and_set_tsk_thread_flag(target, TIF_RESTORE_RSE))
1910 return 0;
Shaohua Lif14488c2008-10-06 10:43:06 -07001911 set_notify_resume(target);
Shaohua Lic70f8f62008-02-28 16:47:50 +08001912 return do_regset_call(do_gpregs_writeback, target, regset, 0, 0,
1913 NULL, NULL);
1914}
1915
1916static int
1917fpregs_active(struct task_struct *target, const struct user_regset *regset)
1918{
1919 return (target->thread.flags & IA64_THREAD_FPH_VALID) ? 128 : 32;
1920}
1921
1922static int fpregs_get(struct task_struct *target,
1923 const struct user_regset *regset,
1924 unsigned int pos, unsigned int count,
1925 void *kbuf, void __user *ubuf)
1926{
1927 return do_regset_call(do_fpregs_get, target, regset, pos, count,
1928 kbuf, ubuf);
1929}
1930
1931static int fpregs_set(struct task_struct *target,
1932 const struct user_regset *regset,
1933 unsigned int pos, unsigned int count,
1934 const void *kbuf, const void __user *ubuf)
1935{
1936 return do_regset_call(do_fpregs_set, target, regset, pos, count,
1937 kbuf, ubuf);
1938}
1939
Shaohua Li4cd8dc82008-02-28 16:09:42 +08001940static int
1941access_uarea(struct task_struct *child, unsigned long addr,
1942 unsigned long *data, int write_access)
1943{
1944 unsigned int pos = -1; /* an invalid value */
1945 int ret;
1946 unsigned long *ptr, regnum;
1947
1948 if ((addr & 0x7) != 0) {
1949 dprintk("ptrace: unaligned register address 0x%lx\n", addr);
1950 return -1;
1951 }
1952 if ((addr >= PT_NAT_BITS + 8 && addr < PT_F2) ||
1953 (addr >= PT_R7 + 8 && addr < PT_B1) ||
1954 (addr >= PT_AR_LC + 8 && addr < PT_CR_IPSR) ||
1955 (addr >= PT_AR_SSD + 8 && addr < PT_DBR)) {
1956 dprintk("ptrace: rejecting access to register "
1957 "address 0x%lx\n", addr);
1958 return -1;
1959 }
1960
1961 switch (addr) {
1962 case PT_F32 ... (PT_F127 + 15):
1963 pos = addr - PT_F32 + ELF_FP_OFFSET(32);
1964 break;
1965 case PT_F2 ... (PT_F5 + 15):
1966 pos = addr - PT_F2 + ELF_FP_OFFSET(2);
1967 break;
1968 case PT_F10 ... (PT_F31 + 15):
1969 pos = addr - PT_F10 + ELF_FP_OFFSET(10);
1970 break;
1971 case PT_F6 ... (PT_F9 + 15):
1972 pos = addr - PT_F6 + ELF_FP_OFFSET(6);
1973 break;
1974 }
1975
1976 if (pos != -1) {
1977 if (write_access)
1978 ret = fpregs_set(child, NULL, pos,
1979 sizeof(unsigned long), data, NULL);
1980 else
1981 ret = fpregs_get(child, NULL, pos,
1982 sizeof(unsigned long), data, NULL);
1983 if (ret != 0)
1984 return -1;
1985 return 0;
1986 }
1987
1988 switch (addr) {
1989 case PT_NAT_BITS:
1990 pos = ELF_NAT_OFFSET;
1991 break;
1992 case PT_R4 ... PT_R7:
1993 pos = addr - PT_R4 + ELF_GR_OFFSET(4);
1994 break;
1995 case PT_B1 ... PT_B5:
1996 pos = addr - PT_B1 + ELF_BR_OFFSET(1);
1997 break;
1998 case PT_AR_EC:
1999 pos = ELF_AR_EC_OFFSET;
2000 break;
2001 case PT_AR_LC:
2002 pos = ELF_AR_LC_OFFSET;
2003 break;
2004 case PT_CR_IPSR:
2005 pos = ELF_CR_IPSR_OFFSET;
2006 break;
2007 case PT_CR_IIP:
2008 pos = ELF_CR_IIP_OFFSET;
2009 break;
2010 case PT_CFM:
2011 pos = ELF_CFM_OFFSET;
2012 break;
2013 case PT_AR_UNAT:
2014 pos = ELF_AR_UNAT_OFFSET;
2015 break;
2016 case PT_AR_PFS:
2017 pos = ELF_AR_PFS_OFFSET;
2018 break;
2019 case PT_AR_RSC:
2020 pos = ELF_AR_RSC_OFFSET;
2021 break;
2022 case PT_AR_RNAT:
2023 pos = ELF_AR_RNAT_OFFSET;
2024 break;
2025 case PT_AR_BSPSTORE:
2026 pos = ELF_AR_BSPSTORE_OFFSET;
2027 break;
2028 case PT_PR:
2029 pos = ELF_PR_OFFSET;
2030 break;
2031 case PT_B6:
2032 pos = ELF_BR_OFFSET(6);
2033 break;
2034 case PT_AR_BSP:
2035 pos = ELF_AR_BSP_OFFSET;
2036 break;
2037 case PT_R1 ... PT_R3:
2038 pos = addr - PT_R1 + ELF_GR_OFFSET(1);
2039 break;
2040 case PT_R12 ... PT_R15:
2041 pos = addr - PT_R12 + ELF_GR_OFFSET(12);
2042 break;
2043 case PT_R8 ... PT_R11:
2044 pos = addr - PT_R8 + ELF_GR_OFFSET(8);
2045 break;
2046 case PT_R16 ... PT_R31:
2047 pos = addr - PT_R16 + ELF_GR_OFFSET(16);
2048 break;
2049 case PT_AR_CCV:
2050 pos = ELF_AR_CCV_OFFSET;
2051 break;
2052 case PT_AR_FPSR:
2053 pos = ELF_AR_FPSR_OFFSET;
2054 break;
2055 case PT_B0:
2056 pos = ELF_BR_OFFSET(0);
2057 break;
2058 case PT_B7:
2059 pos = ELF_BR_OFFSET(7);
2060 break;
2061 case PT_AR_CSD:
2062 pos = ELF_AR_CSD_OFFSET;
2063 break;
2064 case PT_AR_SSD:
2065 pos = ELF_AR_SSD_OFFSET;
2066 break;
2067 }
2068
2069 if (pos != -1) {
2070 if (write_access)
2071 ret = gpregs_set(child, NULL, pos,
2072 sizeof(unsigned long), data, NULL);
2073 else
2074 ret = gpregs_get(child, NULL, pos,
2075 sizeof(unsigned long), data, NULL);
2076 if (ret != 0)
2077 return -1;
2078 return 0;
2079 }
2080
2081 /* access debug registers */
2082 if (addr >= PT_IBR) {
2083 regnum = (addr - PT_IBR) >> 3;
2084 ptr = &child->thread.ibr[0];
2085 } else {
2086 regnum = (addr - PT_DBR) >> 3;
2087 ptr = &child->thread.dbr[0];
2088 }
2089
2090 if (regnum >= 8) {
2091 dprintk("ptrace: rejecting access to register "
2092 "address 0x%lx\n", addr);
2093 return -1;
2094 }
2095#ifdef CONFIG_PERFMON
2096 /*
2097 * Check if debug registers are used by perfmon. This
2098 * test must be done once we know that we can do the
2099 * operation, i.e. the arguments are all valid, but
2100 * before we start modifying the state.
2101 *
2102 * Perfmon needs to keep a count of how many processes
2103 * are trying to modify the debug registers for system
2104 * wide monitoring sessions.
2105 *
2106 * We also include read access here, because they may
2107 * cause the PMU-installed debug register state
2108 * (dbr[], ibr[]) to be reset. The two arrays are also
2109 * used by perfmon, but we do not use
2110 * IA64_THREAD_DBG_VALID. The registers are restored
2111 * by the PMU context switch code.
2112 */
2113 if (pfm_use_debug_registers(child))
2114 return -1;
2115#endif
2116
2117 if (!(child->thread.flags & IA64_THREAD_DBG_VALID)) {
2118 child->thread.flags |= IA64_THREAD_DBG_VALID;
2119 memset(child->thread.dbr, 0,
2120 sizeof(child->thread.dbr));
2121 memset(child->thread.ibr, 0,
2122 sizeof(child->thread.ibr));
2123 }
2124
2125 ptr += regnum;
2126
2127 if ((regnum & 1) && write_access) {
2128 /* don't let the user set kernel-level breakpoints: */
2129 *ptr = *data & ~(7UL << 56);
2130 return 0;
2131 }
2132 if (write_access)
2133 *ptr = *data;
2134 else
2135 *data = *ptr;
2136 return 0;
2137}
2138
Shaohua Lic70f8f62008-02-28 16:47:50 +08002139static const struct user_regset native_regsets[] = {
2140 {
2141 .core_note_type = NT_PRSTATUS,
2142 .n = ELF_NGREG,
2143 .size = sizeof(elf_greg_t), .align = sizeof(elf_greg_t),
2144 .get = gpregs_get, .set = gpregs_set,
2145 .writeback = gpregs_writeback
2146 },
2147 {
2148 .core_note_type = NT_PRFPREG,
2149 .n = ELF_NFPREG,
2150 .size = sizeof(elf_fpreg_t), .align = sizeof(elf_fpreg_t),
2151 .get = fpregs_get, .set = fpregs_set, .active = fpregs_active
2152 },
2153};
2154
2155static const struct user_regset_view user_ia64_view = {
2156 .name = "ia64",
2157 .e_machine = EM_IA_64,
2158 .regsets = native_regsets, .n = ARRAY_SIZE(native_regsets)
2159};
2160
2161const struct user_regset_view *task_user_regset_view(struct task_struct *tsk)
2162{
2163 return &user_ia64_view;
2164}
Shaohua Licfb361f2008-09-18 15:49:14 +08002165
2166struct syscall_get_set_args {
2167 unsigned int i;
2168 unsigned int n;
2169 unsigned long *args;
2170 struct pt_regs *regs;
2171 int rw;
2172};
2173
2174static void syscall_get_set_args_cb(struct unw_frame_info *info, void *data)
2175{
2176 struct syscall_get_set_args *args = data;
2177 struct pt_regs *pt = args->regs;
2178 unsigned long *krbs, cfm, ndirty;
2179 int i, count;
2180
2181 if (unw_unwind_to_user(info) < 0)
2182 return;
2183
2184 cfm = pt->cr_ifs;
2185 krbs = (unsigned long *)info->task + IA64_RBS_OFFSET/8;
2186 ndirty = ia64_rse_num_regs(krbs, krbs + (pt->loadrs >> 19));
2187
2188 count = 0;
2189 if (in_syscall(pt))
2190 count = min_t(int, args->n, cfm & 0x7f);
2191
2192 for (i = 0; i < count; i++) {
2193 if (args->rw)
2194 *ia64_rse_skip_regs(krbs, ndirty + i + args->i) =
2195 args->args[i];
2196 else
2197 args->args[i] = *ia64_rse_skip_regs(krbs,
2198 ndirty + i + args->i);
2199 }
2200
2201 if (!args->rw) {
2202 while (i < args->n) {
2203 args->args[i] = 0;
2204 i++;
2205 }
2206 }
2207}
2208
2209void ia64_syscall_get_set_arguments(struct task_struct *task,
2210 struct pt_regs *regs, unsigned int i, unsigned int n,
2211 unsigned long *args, int rw)
2212{
2213 struct syscall_get_set_args data = {
2214 .i = i,
2215 .n = n,
2216 .args = args,
2217 .regs = regs,
2218 .rw = rw,
2219 };
2220
2221 if (task == current)
2222 unw_init_running(syscall_get_set_args_cb, &data);
2223 else {
2224 struct unw_frame_info ufi;
2225 memset(&ufi, 0, sizeof(ufi));
2226 unw_init_from_blocked_task(&ufi, task);
2227 syscall_get_set_args_cb(&ufi, &data);
2228 }
2229}