blob: fae2d56641394f766a5fc7bdf5865c08a5517b2b (
plain)
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
|
/* Chrysalide - Outil d'analyse de fichiers binaires
* ##FILE## - traduction d'instructions ARMv7
*
* Copyright (C) 2017 Cyrille Bagard
*
* This file is part of Chrysalide.
*
* Chrysalide is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* Chrysalide is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Chrysalide. If not, see <http://www.gnu.org/licenses/>.
*/
@title RFE
@id 364
@desc {
Return From Exception loads the PC and the CPSR from the word at the specified address and the following word respectively. For information about memory accesses see Memory accesses on page A8-294. RFE is: • UNDEFINED in Hyp mode. • UNPREDICTABLE in: — The cases described in Restrictions on exception return instructions on page B9-1970. Note As identified in Restrictions on exception return instructions on page B9-1970, RFE differs from other exception return instructions in that it can be executed in System mode. — Debug state.
}
@encoding (T1) {
@word 1 1 1 0 1 0 0 0 0 0 W(1) 1 Rn(4) 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0
@syntax {
@subid 2017
@conv {
reg_N = Register(Rn)
wb_reg = WrittenBackReg(reg_N, W)
}
@asm rfedb wb_reg
}
}
@encoding (T2) {
@word 1 1 1 0 1 0 0 1 1 0 W(1) 1 Rn(4) 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0
@syntax {
@subid 2018
@conv {
reg_N = Register(Rn)
wb_reg = WrittenBackReg(reg_N, W)
}
@asm rfeia wb_reg
}
}
@encoding (A1) {
@word 1 1 1 1 1 0 0 P(1) U(1) 0 W(1) 1 Rn(4) 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0
@syntax {
@subid 2019
@assert {
P == 0
U == 0
}
@conv {
reg_N = Register(Rn)
wb_reg = WrittenBackReg(reg_N, W)
}
@asm rfeda wb_reg
}
@syntax {
@subid 2020
@assert {
P == 1
U == 0
}
@conv {
reg_N = Register(Rn)
wb_reg = WrittenBackReg(reg_N, W)
}
@asm rfedb wb_reg
}
@syntax {
@subid 2021
@assert {
P == 0
U == 1
}
@conv {
reg_N = Register(Rn)
wb_reg = WrittenBackReg(reg_N, W)
}
@asm rfeia wb_reg
}
@syntax {
@subid 2022
@assert {
P == 1
U == 1
}
@conv {
reg_N = Register(Rn)
wb_reg = WrittenBackReg(reg_N, W)
}
@asm rfeib wb_reg
}
}
|
