blob: 4e30bfc3cdd5506d29c464d326a629cc628f1fae [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#include <asm/branch.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07002#include <asm/cacheflush.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07003#include <asm/fpu_emulator.h>
Ralf Baechlecd8ee342014-04-16 02:09:53 +02004#include <asm/inst.h>
5#include <asm/mipsregs.h>
6#include <asm/uaccess.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07007
8#include "ieee754.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -07009
Linus Torvalds1da177e2005-04-16 15:20:36 -070010/*
11 * Emulate the arbritrary instruction ir at xcp->cp0_epc. Required when
12 * we have to emulate the instruction in a COP1 branch delay slot. Do
13 * not change cp0_epc due to the instruction
14 *
15 * According to the spec:
Lucas De Marchi25985ed2011-03-30 22:57:33 -030016 * 1) it shouldn't be a branch :-)
Linus Torvalds1da177e2005-04-16 15:20:36 -070017 * 2) it can be a COP instruction :-(
18 * 3) if we are tring to run a protected memory space we must take
19 * special care on memory access instructions :-(
20 */
21
22/*
23 * "Trampoline" return routine to catch exception following
24 * execution of delay-slot instruction execution.
25 */
26
27struct emuframe {
28 mips_instruction emul;
29 mips_instruction badinst;
30 mips_instruction cookie;
Ralf Baechle333d1f62005-02-28 17:55:57 +000031 unsigned long epc;
Linus Torvalds1da177e2005-04-16 15:20:36 -070032};
33
Maciej W. Rozyckie4553572016-01-22 05:20:26 +000034/*
35 * Set up an emulation frame for instruction IR, from a delay slot of
36 * a branch jumping to CPC. Return 0 if successful, -1 if no emulation
37 * required, otherwise a signal number causing a frame setup failure.
38 */
Ralf Baechle333d1f62005-02-28 17:55:57 +000039int mips_dsemul(struct pt_regs *regs, mips_instruction ir, unsigned long cpc)
Linus Torvalds1da177e2005-04-16 15:20:36 -070040{
Atsushi Nemoto5e0373b2007-07-13 23:02:42 +090041 struct emuframe __user *fr;
Linus Torvalds1da177e2005-04-16 15:20:36 -070042 int err;
43
Maciej W. Rozyckie4553572016-01-22 05:20:26 +000044 /* NOP is easy */
Leonid Yegoshin102cedc2013-03-25 12:09:02 -050045 if ((get_isa16_mode(regs->cp0_epc) && ((ir >> 16) == MM_NOP16)) ||
Maciej W. Rozyckie4553572016-01-22 05:20:26 +000046 (ir == 0))
47 return -1;
Linus Torvalds1da177e2005-04-16 15:20:36 -070048
Ralf Baechle92df0f82014-04-19 14:03:37 +020049 pr_debug("dsemul %lx %lx\n", regs->cp0_epc, cpc);
Linus Torvalds1da177e2005-04-16 15:20:36 -070050
51 /*
52 * The strategy is to push the instruction onto the user stack
53 * and put a trap after it which we can catch and jump to
54 * the required address any alternative apart from full
55 * instruction emulation!!.
56 *
57 * Algorithmics used a system call instruction, and
58 * borrowed that vector. MIPS/Linux version is a bit
59 * more heavyweight in the interests of portability and
60 * multiprocessor support. For Linux we generate a
61 * an unaligned access and force an address error exception.
62 *
63 * For embedded systems (stand-alone) we prefer to use a
64 * non-existing CP1 instruction. This prevents us from emulating
65 * branches, but gives us a cleaner interface to the exception
66 * handler (single entry point).
67 */
68
69 /* Ensure that the two instructions are in the same cache line */
Atsushi Nemoto5e0373b2007-07-13 23:02:42 +090070 fr = (struct emuframe __user *)
71 ((regs->regs[29] - sizeof(struct emuframe)) & ~0x7);
Linus Torvalds1da177e2005-04-16 15:20:36 -070072
73 /* Verify that the stack pointer is not competely insane */
74 if (unlikely(!access_ok(VERIFY_WRITE, fr, sizeof(struct emuframe))))
75 return SIGBUS;
76
Leonid Yegoshin102cedc2013-03-25 12:09:02 -050077 if (get_isa16_mode(regs->cp0_epc)) {
Maciej W. Rozyckia87265c2016-01-22 05:20:37 +000078 err = __put_user(ir >> 16,
79 (u16 __user *)(&fr->emul));
80 err |= __put_user(ir & 0xffff,
81 (u16 __user *)((long)(&fr->emul) + 2));
82 err |= __put_user(BREAK_MATH >> 16,
83 (u16 __user *)(&fr->badinst));
84 err |= __put_user(BREAK_MATH & 0xffff,
85 (u16 __user *)((long)(&fr->badinst) + 2));
Leonid Yegoshin102cedc2013-03-25 12:09:02 -050086 } else {
87 err = __put_user(ir, &fr->emul);
88 err |= __put_user((mips_instruction)BREAK_MATH, &fr->badinst);
89 }
90
Linus Torvalds1da177e2005-04-16 15:20:36 -070091 err |= __put_user((mips_instruction)BD_COOKIE, &fr->cookie);
92 err |= __put_user(cpc, &fr->epc);
93
94 if (unlikely(err)) {
David Daneyb6ee75e2009-11-05 11:34:26 -080095 MIPS_FPU_EMU_INC_STATS(errors);
Linus Torvalds1da177e2005-04-16 15:20:36 -070096 return SIGBUS;
97 }
98
Leonid Yegoshin102cedc2013-03-25 12:09:02 -050099 regs->cp0_epc = ((unsigned long) &fr->emul) |
100 get_isa16_mode(regs->cp0_epc);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101
Maciej W. Rozycki7737b202015-04-03 23:26:37 +0100102 flush_cache_sigtramp((unsigned long)&fr->emul);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103
Maciej W. Rozycki9ab44712015-04-03 23:26:56 +0100104 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105}
106
107int do_dsemulret(struct pt_regs *xcp)
108{
Atsushi Nemoto5e0373b2007-07-13 23:02:42 +0900109 struct emuframe __user *fr;
Ralf Baechle333d1f62005-02-28 17:55:57 +0000110 unsigned long epc;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700111 u32 insn, cookie;
112 int err = 0;
Leonid Yegoshin102cedc2013-03-25 12:09:02 -0500113 u16 instr[2];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700114
Atsushi Nemoto5e0373b2007-07-13 23:02:42 +0900115 fr = (struct emuframe __user *)
Leonid Yegoshin102cedc2013-03-25 12:09:02 -0500116 (msk_isa16_mode(xcp->cp0_epc) - sizeof(mips_instruction));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117
118 /*
119 * If we can't even access the area, something is very wrong, but we'll
120 * leave that to the default handling
121 */
122 if (!access_ok(VERIFY_READ, fr, sizeof(struct emuframe)))
123 return 0;
124
125 /*
126 * Do some sanity checking on the stackframe:
127 *
Ralf Baechleba3049e2008-10-28 17:38:42 +0000128 * - Is the instruction pointed to by the EPC an BREAK_MATH?
Linus Torvalds1da177e2005-04-16 15:20:36 -0700129 * - Is the following memory word the BD_COOKIE?
130 */
Leonid Yegoshin102cedc2013-03-25 12:09:02 -0500131 if (get_isa16_mode(xcp->cp0_epc)) {
Maciej W. Rozyckia87265c2016-01-22 05:20:37 +0000132 err = __get_user(instr[0],
133 (u16 __user *)(&fr->badinst));
134 err |= __get_user(instr[1],
135 (u16 __user *)((long)(&fr->badinst) + 2));
Leonid Yegoshin102cedc2013-03-25 12:09:02 -0500136 insn = (instr[0] << 16) | instr[1];
137 } else {
138 err = __get_user(insn, &fr->badinst);
139 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140 err |= __get_user(cookie, &fr->cookie);
141
Ralf Baechleba3049e2008-10-28 17:38:42 +0000142 if (unlikely(err || (insn != BREAK_MATH) || (cookie != BD_COOKIE))) {
David Daneyb6ee75e2009-11-05 11:34:26 -0800143 MIPS_FPU_EMU_INC_STATS(errors);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700144 return 0;
145 }
146
147 /*
148 * At this point, we are satisfied that it's a BD emulation trap. Yes,
149 * a user might have deliberately put two malformed and useless
150 * instructions in a row in his program, in which case he's in for a
151 * nasty surprise - the next instruction will be treated as a
152 * continuation address! Alas, this seems to be the only way that we
153 * can handle signals, recursion, and longjmps() in the context of
154 * emulating the branch delay instruction.
155 */
156
Ralf Baechle92df0f82014-04-19 14:03:37 +0200157 pr_debug("dsemulret\n");
158
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159 if (__get_user(epc, &fr->epc)) { /* Saved EPC */
160 /* This is not a good situation to be in */
161 force_sig(SIGBUS, current);
162
163 return 0;
164 }
165
166 /* Set EPC to return to post-branch instruction */
167 xcp->cp0_epc = epc;
David Daney2707cd22014-12-03 11:12:23 -0800168 MIPS_FPU_EMU_INC_STATS(ds_emul);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169 return 1;
170}