]> CyberLeo.Net >> Repos - FreeBSD/FreeBSD.git/blob - sys/mips/mips/stack_machdep.c
Merge ^/head r319548 through r319778.
[FreeBSD/FreeBSD.git] / sys / mips / mips / stack_machdep.c
1 /*-
2  * Copyright (c) 2005 Antoine Brodin
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  *    notice, this list of conditions and the following disclaimer in the
12  *    documentation and/or other materials provided with the distribution.
13  *
14  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24  * SUCH DAMAGE.
25  */
26
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD$");
29
30 #include <sys/types.h>
31 #include <sys/systm.h>
32 #include <sys/param.h>
33 #include <sys/proc.h>
34 #include <sys/stack.h>
35
36 #include <machine/mips_opcode.h>
37
38 #include <machine/pcb.h>
39 #include <machine/regnum.h>
40
41 static u_register_t
42 stack_register_fetch(u_register_t sp, u_register_t stack_pos)
43 {
44         u_register_t * stack = 
45             ((u_register_t *)(intptr_t)sp + (size_t)stack_pos/sizeof(u_register_t));
46
47         return *stack;
48 }
49
50 static void
51 stack_capture(struct stack *st, u_register_t pc, u_register_t sp)
52 {
53         u_register_t  ra = 0, i, stacksize;
54         short ra_stack_pos = 0;
55         InstFmt insn;
56
57         stack_zero(st);
58
59         for (;;) {
60                 stacksize = 0;
61                 if (pc <= (u_register_t)(intptr_t)btext)
62                         break;
63                 for (i = pc; i >= (u_register_t)(intptr_t)btext; i -= sizeof (insn)) {
64                         bcopy((void *)(intptr_t)i, &insn, sizeof insn);
65                         switch (insn.IType.op) {
66                         case OP_ADDI:
67                         case OP_ADDIU:
68                         case OP_DADDI:
69                         case OP_DADDIU:
70                                 if (insn.IType.rs != SP || insn.IType.rt != SP)
71                                         break;
72                                 stacksize = -(short)insn.IType.imm;
73                                 break;
74
75                         case OP_SW:
76                         case OP_SD:
77                                 if (insn.IType.rs != SP || insn.IType.rt != RA)
78                                         break;
79                                 ra_stack_pos = (short)insn.IType.imm;
80                                 break;
81                         default:
82                                 break;
83                         }
84
85                         if (stacksize)
86                                 break;
87                 }
88
89                 if (stack_put(st, pc) == -1)
90                         break;
91
92                 for (i = pc; !ra; i += sizeof (insn)) {
93                         bcopy((void *)(intptr_t)i, &insn, sizeof insn);
94
95                         switch (insn.IType.op) {
96                         case OP_SPECIAL:
97                                 if (insn.RType.func == OP_JR) {
98                                         if (ra >= (u_register_t)(intptr_t)btext)
99                                                 break;
100                                         if (insn.RType.rs != RA)
101                                                 break;
102                                         ra = stack_register_fetch(sp, 
103                                             ra_stack_pos);
104                                         if (!ra)
105                                                 goto done;
106                                         ra -= 8;
107                                 }
108                                 break;
109                         default:
110                                 break;
111                         }
112                         /* eret */
113                         if (insn.word == 0x42000018)
114                                 goto done;
115                 }
116
117                 if (pc == ra && stacksize == 0)
118                         break;
119
120                 sp += stacksize;
121                 pc = ra;
122                 ra = 0;
123         }
124 done:
125         return;
126 }
127
128 void
129 stack_save_td(struct stack *st, struct thread *td)
130 {
131         u_register_t pc, sp;
132
133         if (TD_IS_SWAPPED(td))
134                 panic("stack_save_td: swapped");
135         if (TD_IS_RUNNING(td))
136                 panic("stack_save_td: running");
137
138         pc = td->td_pcb->pcb_regs.pc;
139         sp = td->td_pcb->pcb_regs.sp;
140         stack_capture(st, pc, sp);
141 }
142
143 int
144 stack_save_td_running(struct stack *st, struct thread *td)
145 {
146
147         return (EOPNOTSUPP);
148 }
149
150 void
151 stack_save(struct stack *st)
152 {
153         u_register_t pc, sp;
154
155         if (curthread == NULL)
156                 panic("stack_save: curthread == NULL");
157
158         pc = curthread->td_pcb->pcb_regs.pc;
159         sp = curthread->td_pcb->pcb_regs.sp;
160         stack_capture(st, pc, sp);
161 }