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
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
|
use crate::architecture::CoreArchitecture;
use crate::rc::{CoreArrayProvider, CoreArrayProviderInner};
use binaryninjacore_sys::*;
use std::borrow::Cow;
use std::ffi::CStr;
use std::fmt::{Debug, Formatter};
use std::hash::Hash;
pub use binaryninjacore_sys::BNImplicitRegisterExtend as ImplicitRegisterExtend;
crate::new_id_type!(RegisterId, u32);
impl RegisterId {
pub fn is_temporary(&self) -> bool {
self.0 & 0x8000_0000 != 0
}
}
crate::new_id_type!(RegisterStackId, u32);
pub trait RegisterInfo: Sized {
type RegType: Register<InfoType = Self>;
fn parent(&self) -> Option<Self::RegType>;
fn size(&self) -> usize;
fn offset(&self) -> usize;
fn implicit_extend(&self) -> ImplicitRegisterExtend;
}
pub trait Register: Debug + Sized + Clone + Copy + Hash + Eq {
type InfoType: RegisterInfo<RegType = Self>;
fn name(&self) -> Cow<'_, str>;
fn info(&self) -> Self::InfoType;
/// Unique identifier for this `Register`.
///
/// *MUST* be in the range [0, 0x7fff_ffff]
fn id(&self) -> RegisterId;
}
pub trait RegisterStackInfo: Sized {
type RegStackType: RegisterStack<InfoType = Self>;
type RegType: Register<InfoType = Self::RegInfoType>;
type RegInfoType: RegisterInfo<RegType = Self::RegType>;
fn storage_regs(&self) -> (Self::RegType, usize);
fn top_relative_regs(&self) -> Option<(Self::RegType, usize)>;
fn stack_top_reg(&self) -> Self::RegType;
}
/// Type for architectures that do not use register stacks. Will panic if accessed as a register stack.
#[derive(Clone, Copy, PartialEq, Eq, Hash)]
pub struct UnusedRegisterStackInfo<R: Register> {
_reg: std::marker::PhantomData<R>,
}
impl<R: Register> RegisterStackInfo for UnusedRegisterStackInfo<R> {
type RegStackType = UnusedRegisterStack<R>;
type RegType = R;
type RegInfoType = R::InfoType;
fn storage_regs(&self) -> (Self::RegType, usize) {
unreachable!()
}
fn top_relative_regs(&self) -> Option<(Self::RegType, usize)> {
unreachable!()
}
fn stack_top_reg(&self) -> Self::RegType {
unreachable!()
}
}
pub trait RegisterStack: Debug + Sized + Clone + Copy {
type InfoType: RegisterStackInfo<
RegType = Self::RegType,
RegInfoType = Self::RegInfoType,
RegStackType = Self,
>;
type RegType: Register<InfoType = Self::RegInfoType>;
type RegInfoType: RegisterInfo<RegType = Self::RegType>;
fn name(&self) -> Cow<'_, str>;
fn info(&self) -> Self::InfoType;
/// Unique identifier for this `RegisterStack`.
///
/// *MUST* be in the range [0, 0x7fff_ffff]
fn id(&self) -> RegisterStackId;
}
/// Type for architectures that do not use register stacks. Will panic if accessed as a register stack.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub struct UnusedRegisterStack<R: Register> {
_reg: std::marker::PhantomData<R>,
}
impl<R: Register> RegisterStack for UnusedRegisterStack<R> {
type InfoType = UnusedRegisterStackInfo<R>;
type RegType = R;
type RegInfoType = R::InfoType;
fn name(&self) -> Cow<'_, str> {
unreachable!()
}
fn info(&self) -> Self::InfoType {
unreachable!()
}
fn id(&self) -> RegisterStackId {
unreachable!()
}
}
#[derive(Debug, Copy, Clone)]
pub struct CoreRegisterInfo {
arch: CoreArchitecture,
id: RegisterId,
info: BNRegisterInfo,
}
impl CoreRegisterInfo {
pub fn new(arch: CoreArchitecture, id: RegisterId, info: BNRegisterInfo) -> Self {
Self { arch, id, info }
}
}
impl RegisterInfo for CoreRegisterInfo {
type RegType = CoreRegister;
fn parent(&self) -> Option<CoreRegister> {
if self.id != RegisterId::from(self.info.fullWidthRegister) {
Some(CoreRegister::new(
self.arch,
RegisterId::from(self.info.fullWidthRegister),
)?)
} else {
None
}
}
fn size(&self) -> usize {
self.info.size
}
fn offset(&self) -> usize {
self.info.offset
}
fn implicit_extend(&self) -> ImplicitRegisterExtend {
self.info.extend
}
}
#[derive(Copy, Clone, Eq, PartialEq, Hash)]
pub struct CoreRegister {
arch: CoreArchitecture,
id: RegisterId,
}
impl CoreRegister {
pub fn new(arch: CoreArchitecture, id: RegisterId) -> Option<Self> {
let register = Self { arch, id };
register.is_valid().then_some(register)
}
fn is_valid(&self) -> bool {
// We check the name to see if the register is actually valid.
let name = unsafe { BNGetArchitectureRegisterName(self.arch.handle, self.id.into()) };
match name.is_null() {
true => false,
false => {
unsafe { BNFreeString(name) };
true
}
}
}
}
impl Register for CoreRegister {
type InfoType = CoreRegisterInfo;
fn name(&self) -> Cow<'_, str> {
unsafe {
let name = BNGetArchitectureRegisterName(self.arch.handle, self.id.into());
// We need to guarantee ownership, as if we're still
// a Borrowed variant we're about to free the underlying
// memory.
let res = CStr::from_ptr(name);
let res = res.to_string_lossy().into_owned().into();
BNFreeString(name);
res
}
}
fn info(&self) -> CoreRegisterInfo {
CoreRegisterInfo::new(self.arch, self.id, unsafe {
BNGetArchitectureRegisterInfo(self.arch.handle, self.id.into())
})
}
fn id(&self) -> RegisterId {
self.id
}
}
impl Debug for CoreRegister {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
f.debug_struct("CoreRegister")
.field("id", &self.id)
.field("name", &self.name())
.finish()
}
}
impl CoreArrayProvider for CoreRegister {
type Raw = u32;
type Context = CoreArchitecture;
type Wrapped<'a> = Self;
}
unsafe impl CoreArrayProviderInner for CoreRegister {
unsafe fn free(raw: *mut Self::Raw, _count: usize, _context: &Self::Context) {
BNFreeRegisterList(raw)
}
unsafe fn wrap_raw<'a>(raw: &'a Self::Raw, context: &'a Self::Context) -> Self::Wrapped<'a> {
Self::new(*context, RegisterId::from(*raw)).expect("Register list contains valid registers")
}
}
#[derive(Debug, Copy, Clone)]
pub struct CoreRegisterStackInfo {
arch: CoreArchitecture,
// TODO: Wrap BNRegisterStackInfo
info: BNRegisterStackInfo,
}
impl CoreRegisterStackInfo {
pub fn new(arch: CoreArchitecture, info: BNRegisterStackInfo) -> Self {
Self { arch, info }
}
}
impl RegisterStackInfo for CoreRegisterStackInfo {
type RegStackType = CoreRegisterStack;
type RegType = CoreRegister;
type RegInfoType = CoreRegisterInfo;
fn storage_regs(&self) -> (Self::RegType, usize) {
(
CoreRegister::new(self.arch, RegisterId::from(self.info.firstStorageReg))
.expect("Storage register is valid"),
self.info.storageCount as usize,
)
}
fn top_relative_regs(&self) -> Option<(Self::RegType, usize)> {
if self.info.topRelativeCount == 0 {
None
} else {
Some((
CoreRegister::new(self.arch, RegisterId::from(self.info.firstTopRelativeReg))
.expect("Top relative register is valid"),
self.info.topRelativeCount as usize,
))
}
}
fn stack_top_reg(&self) -> Self::RegType {
CoreRegister::new(self.arch, RegisterId::from(self.info.stackTopReg))
.expect("Stack top register is valid")
}
}
#[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)]
pub struct CoreRegisterStack {
arch: CoreArchitecture,
id: RegisterStackId,
}
impl CoreRegisterStack {
pub fn new(arch: CoreArchitecture, id: RegisterStackId) -> Option<Self> {
let register_stack = Self { arch, id };
register_stack.is_valid().then_some(register_stack)
}
fn is_valid(&self) -> bool {
// We check the name to see if the stack register is actually valid.
let name = unsafe { BNGetArchitectureRegisterStackName(self.arch.handle, self.id.into()) };
match name.is_null() {
true => false,
false => {
unsafe { BNFreeString(name) };
true
}
}
}
}
impl RegisterStack for CoreRegisterStack {
type InfoType = CoreRegisterStackInfo;
type RegType = CoreRegister;
type RegInfoType = CoreRegisterInfo;
fn name(&self) -> Cow<'_, str> {
unsafe {
let name = BNGetArchitectureRegisterStackName(self.arch.handle, self.id.into());
// We need to guarantee ownership, as if we're still
// a Borrowed variant we're about to free the underlying
// memory.
let res = CStr::from_ptr(name);
let res = res.to_string_lossy().into_owned().into();
BNFreeString(name);
res
}
}
fn info(&self) -> CoreRegisterStackInfo {
CoreRegisterStackInfo::new(self.arch, unsafe {
BNGetArchitectureRegisterStackInfo(self.arch.handle, self.id.into())
})
}
fn id(&self) -> RegisterStackId {
self.id
}
}
|