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
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
|
use crate::settings::LoadSettings;
use binaryninja::binary_view::{BinaryView, BinaryViewExt};
use binaryninja::confidence::{Conf, MAX_CONFIDENCE};
use binaryninja::data_buffer::DataBuffer;
use binaryninja::rc::Ref;
use binaryninja::section::{SectionBuilder, Semantics};
use binaryninja::segment::{SegmentBuilder, SegmentFlags};
use binaryninja::symbol::{SymbolBuilder, SymbolType};
use binaryninja::types::{
BaseStructure, EnumerationBuilder, MemberAccess, MemberScope, NamedTypeReference,
NamedTypeReferenceClass, StructureBuilder, StructureMember, StructureType, Type, TypeBuilder,
};
use std::collections::{BTreeMap, HashMap};
use std::num::NonZeroUsize;
use svd_parser::svd::{
Access, AddressBlock, AddressBlockUsage, DataType, Device, EnumeratedValues, Field, FieldInfo,
Peripheral, PeripheralInfo, Register, RegisterCluster, RegisterInfo, Usage,
};
pub fn byte_aligned(bit_width: u32) -> bool {
bit_width % 8 == 0
}
/// Byte aligned width for bit-width
pub fn byte_width(bit_width: u32) -> u32 {
if byte_aligned(bit_width) {
bit_width / 8
} else {
(bit_width / 8) + 1
}
}
#[derive(Clone, Debug)]
pub struct AddressBlockMemoryInfo {
pub segment: SegmentBuilder,
pub segment_flags: SegmentFlags,
pub section: SectionBuilder,
}
pub struct DeviceMapper {
settings: LoadSettings,
device: Device,
address_size: usize,
}
impl DeviceMapper {
pub fn new(settings: LoadSettings, address_size: usize, mut device: Device) -> Self {
svd_parser::expand_properties(&mut device);
// TODO: Until https://github.com/rust-embedded/svd/issues/288 is fixed
let mut new_device = device.clone();
new_device.peripherals.clear();
for peripheral in &device.peripherals {
let mut new_peripheral = peripheral.clone();
if let Some(derived_periph_name) = &peripheral.derived_from {
// Add derived address blocks.
// TODO: Should this not be done by svd_parser::expand?
// TODO: Should this be recursive?
if let Some(derived_peripheral) = device.get_peripheral(derived_periph_name) {
if let Some(address_blocks) = &derived_peripheral.address_block {
new_peripheral
.address_block
.get_or_insert_with(Vec::new)
.extend(address_blocks.to_owned());
}
}
}
new_device.peripherals.push(new_peripheral);
}
// TODO: Return error instead.
let expanded_device = svd_parser::expand(&new_device).expect("Failed to expand device!");
Self {
settings,
device: expanded_device,
address_size,
}
}
pub fn map_to_view(&self, view: &BinaryView) {
tracing::info!("Mapping device... {}", self.device.name);
for peripheral in &self.device.peripherals {
match peripheral {
Peripheral::Single(info) => {
self.map_peripheral_to_view(view, info);
}
Peripheral::Array(_info, _elem) => {
// TODO: How do we handle this?
// TODO: I guess we will need to update the base address?
// TODO: expand feature solves this.
}
}
}
}
// TODO: Add address blocks from derived peripherals?
pub fn map_peripheral_to_view(&self, view: &BinaryView, peripheral: &PeripheralInfo) {
// Get the size to extend the current block by.
let extend_block_size = |current_block: &AddressBlock, new_block: &AddressBlock| {
(new_block.offset + new_block.size - current_block.offset).max(current_block.size)
};
let merge_blocks = |mut coalesced_blocks: Vec<AddressBlock>,
new_block: AddressBlock|
-> Vec<AddressBlock> {
if let Some(current_block) = coalesced_blocks.last_mut() {
// Check if the new block can be merged with the last block.
// TODO: We don't account for the offset between the blocks
// TODO: Because we dont that means a register block 0x1000 away from another register block
// TODO: will still be merged, which is undesirable considering that SVD address blocks
// TODO: are suppose to be distinct memory regions!
if current_block.usage == new_block.usage {
current_block.size = extend_block_size(current_block, &new_block);
return coalesced_blocks;
}
}
// Push as a new block if not mergeable.
coalesced_blocks.push(new_block);
coalesced_blocks
};
if let Some(address_blocks) = &peripheral.address_block {
// Because some SVD authors decided to create address blocks for sub-regions
// we must first coalesce all contiguous register address blocks.
let mut sorted_blocks = address_blocks.clone();
sorted_blocks.sort_by_key(|block| block.offset);
let merged_blocks: Vec<AddressBlock> =
sorted_blocks.into_iter().fold(Vec::new(), merge_blocks);
// Update the peripheral so downstream usage sees only merged blocks.
let mut updated_peripheral = peripheral.clone();
updated_peripheral.address_block = Some(merged_blocks.clone());
for address_block in merged_blocks {
self.map_peripheral_block_to_view(view, &updated_peripheral, &address_block);
}
}
}
pub fn map_peripheral_block_to_view(
&self,
view: &BinaryView,
peripheral: &PeripheralInfo,
address_block: &AddressBlock,
) {
let block_addr = peripheral.base_address + address_block.offset as u64;
tracing::info!(
"Mapping peripheral block @ 0x{:x} for {}",
block_addr,
peripheral.name
);
// We don't postfix the block offset in case we only have a single peripheral address block
// as it is unnecessary to talk about a unique block in that case.
let periph_block_len = peripheral.address_block.as_ref().unwrap().len();
let block_name = if address_block.offset == 0 || periph_block_len == 1 {
// Block name: "PERIPH"
peripheral.name.to_owned()
} else {
// Block name: "PERIPH_0x40"
format!("{}_0x{:x}", peripheral.name, address_block.offset)
};
let memory_info =
self.peripheral_block_memory_info(peripheral, address_block, block_name.clone());
// Add the block segment, section and backing memory (optional).
if self.settings.add_backing_regions {
// Because adding a memory region will add a possibly large memory buffer in the BNDB, this
// is optional. if a user disables this, they cannot write to the segment until they add a backing memory region.
let data_memory = DataBuffer::new(&vec![0; address_block.size as usize]);
let added_memory = view.memory_map().add_data_memory_region(
&block_name,
block_addr,
&data_memory,
Some(memory_info.segment_flags),
);
if !added_memory {
tracing::error!(
"Failed to add memory for peripheral block! {} @ 0x{:x}",
block_name,
block_addr
);
}
}
view.add_segment(memory_info.segment);
view.add_section(memory_info.section);
// Handle usage specific stuff like adding registers.
match address_block.usage {
AddressBlockUsage::Registers => {
// Registers get comments
if self.settings.add_comments {
if let Some(periph_desc) = &peripheral.description {
// Add peripheral description
view.set_comment_at(block_addr, periph_desc);
}
// Add register descriptions
self.add_comments_for_registers(view, peripheral);
}
// Registers will get the peripheral type.
let peripheral_ty = self.peripheral_type(peripheral, address_block);
let peripheral_ty_id = format!("SVD:{}", peripheral.name);
let id = view.define_auto_type_with_id(
&peripheral.name,
&peripheral_ty_id,
&peripheral_ty,
);
let ntr =
NamedTypeReference::new(NamedTypeReferenceClass::StructNamedTypeClass, id);
view.define_auto_data_var(block_addr, &Type::named_type(&ntr));
let symbol =
SymbolBuilder::new(SymbolType::Data, peripheral.name.to_owned(), block_addr)
.create();
view.define_auto_symbol(&symbol);
}
AddressBlockUsage::Buffer => {
let array_ty = Type::array(&Type::int(1, false), address_block.size as u64);
view.define_auto_data_var(block_addr, &array_ty);
let symbol_name = format!("buffer_0x{:x}", block_addr);
let symbol = SymbolBuilder::new(SymbolType::Data, symbol_name, block_addr).create();
view.define_auto_symbol(&symbol);
view.set_comment_at(
block_addr,
&format!("Buffer block with size {}", address_block.size),
);
}
AddressBlockUsage::Reserved => {
// TODO: What to do for reserved blocks?
view.set_comment_at(
block_addr,
&format!("Reserved block with size {}", address_block.size),
);
}
}
}
pub fn add_comments_for_registers(&self, view: &BinaryView, peripheral: &PeripheralInfo) {
// Adding comments will add a bunch of undo actions.
let undo_id = view.file().begin_undo_actions(true);
for register in peripheral.all_registers() {
// Turns out the "enclosing element" seems to always be the peripheral base address?
let register_addr = peripheral.base_address + register.address_offset as u64;
if let Some(description) = ®ister.description {
view.set_comment_at(register_addr, description);
}
// TODO: Add a setting to disable field comments
if let Some(fields) = ®ister.fields {
let (aligned, unaligned): (Vec<_>, Vec<_>) = fields.iter().partition(|f| {
byte_aligned(f.bit_range.width) && byte_aligned(f.bit_range.offset)
});
for field in aligned {
let field_byte_offset = field.bit_range.offset / 8;
let field_addr = register_addr + field_byte_offset as u64;
if let Some(description) = &field.description {
view.set_comment_at(field_addr, description);
}
}
let mut unaligned_comments = HashMap::new();
for field in unaligned {
// For unaligned fields we want to provide more information such as the bit offset and width.
let field_byte_offset = field.bit_range.offset / 8;
let field_bit_width = field.bit_range.width;
let field_addr = register_addr + field_byte_offset as u64;
let mut field_comment = format!(
"{}-{} {}",
field.bit_range.offset,
field.bit_range.offset + field_bit_width - 1,
field.name
);
if let Some(description) = &field.description {
field_comment.push_str(&format!(": {}", description));
}
unaligned_comments
.entry(field_addr)
.or_insert_with(Vec::new)
.push(field_comment);
}
for (field_addr, comments) in unaligned_comments {
let comment = comments.join("\n");
view.set_comment_at(field_addr, &comment);
}
}
}
view.file().commit_undo_actions(&undo_id);
}
pub fn peripheral_block_memory_info(
&self,
peripheral: &PeripheralInfo,
address_block: &AddressBlock,
block_name: String,
) -> AddressBlockMemoryInfo {
let block_addr = peripheral.base_address + address_block.offset as u64;
let block_range = block_addr..(block_addr + address_block.size as u64);
let block_access = peripheral.default_register_properties.access;
let semantics = match block_access {
Some(Access::ReadOnly) => Semantics::ReadOnlyData,
Some(Access::ReadWrite | Access::ReadWriteOnce) => Semantics::ReadWriteData,
// NOTE: Binary Ninja has no concept of write-only section semantics.
Some(Access::WriteOnce | Access::WriteOnly) => Semantics::ReadWriteData,
// TODO: This should never happen. We use the expand feature of svd_parser
None => Semantics::ReadWriteData,
};
let (readable, writable) = match block_access {
Some(Access::ReadOnly) => (true, false),
Some(Access::ReadWrite | Access::ReadWriteOnce) => (true, true),
Some(Access::WriteOnce | Access::WriteOnly) => (false, true),
None => (true, true),
};
let section_type_str = match address_block.protection {
Some(protection) => {
// Section type: "peripheral:s"
format!("peripheral:{}", protection.as_str())
}
None => {
// Section type: "peripheral"
"peripheral".to_string()
}
};
let section = SectionBuilder::new(block_name, block_range.clone())
.section_type(section_type_str)
.semantics(semantics);
let segment_flags = SegmentFlags::new()
.contains_code(false)
.contains_data(true)
.deny_execute(true)
.readable(readable)
.writable(writable);
let segment = SegmentBuilder::new(block_range).flags(segment_flags);
AddressBlockMemoryInfo {
segment,
segment_flags,
section,
}
}
// TODO: In the future we might need to have partial types for each [`AddressBlock`]
// TODO: Support using header name, this requires we define the peripheral type id as the real peripheral name.
// TODO: cont. the reason is so that we can resolve the derived peripheral.
pub fn peripheral_type(
&self,
peripheral: &PeripheralInfo,
address_block: &AddressBlock,
) -> Ref<Type> {
let mut peripheral_struct = StructureBuilder::new();
if let Some(derived_periph_name) = &peripheral.derived_from {
// We will create an NTR to ref the derived peripheral type.
let ntr = NamedTypeReference::new(
NamedTypeReferenceClass::StructNamedTypeClass,
derived_periph_name,
);
let base_struct = BaseStructure::new(ntr, 0, 0);
peripheral_struct.base_structures(&[base_struct]);
}
// Take the address block size and use it as the structure width.
// TODO: Support non-contiguous register address blocks (i.e. partial types).
peripheral_struct.width(address_block.size as u64);
if let Some(register_clusters) = &peripheral.registers {
// Collect registers by offset so we can handle overlapping registers by creating a union.
let mut registers_by_offset: BTreeMap<u64, Vec<&Register>> = BTreeMap::new();
for register_cluster in register_clusters {
match register_cluster {
RegisterCluster::Register(register) => {
registers_by_offset
.entry(register.address_offset as u64)
.or_default()
.push(register);
}
RegisterCluster::Cluster(_cluster) => {
// TODO: Support clusters
}
}
}
for (offset, registers) in registers_by_offset {
match registers.as_slice() {
[register] => {
// We only have one register at this offset, just insert it.
let mut register_member = self.register_member(register);
register_member.offset -= address_block.offset as u64;
peripheral_struct.insert_member(register_member, false);
}
_ => {
// We have multiple registers at the same offset, create a union of them.
// This happens typically when there is some mode field that changes the
// behavior of the register region.
// NOTE: Typically overlapping registers are specified with an alternate register.
let mut union_builder = StructureBuilder::new();
union_builder.structure_type(StructureType::UnionStructureType);
for register in registers {
let mut register_member = self.register_member(register);
register_member.offset = 0;
union_builder.insert_member(register_member, false);
}
let union_ty = Type::structure(&union_builder.finalize());
let union_member = StructureMember::new(
Conf::new(union_ty, MAX_CONFIDENCE),
"".to_string(),
offset - address_block.offset as u64,
MemberAccess::PublicAccess,
MemberScope::NoScope,
);
peripheral_struct.insert_member(union_member, false);
}
}
}
}
Type::structure(&peripheral_struct.finalize())
}
pub fn register_member(&self, register: &Register) -> StructureMember {
let register_ty = self.register_type(register);
let conf_register_ty = Conf::new(register_ty, MAX_CONFIDENCE);
StructureMember::new(
conf_register_ty,
register.name.to_owned(),
register.address_offset as u64,
MemberAccess::PublicAccess,
MemberScope::NoScope,
)
}
pub fn register_type(&self, register: &Register) -> Ref<Type> {
match register {
Register::Single(info) => self.single_register_type(info),
Register::Array(info, elem) => {
// TODO: dimIncrement tells us the stride. We should consult that to
// TODO: make sure that the accesses are aligned.
Type::array(&self.single_register_type(info), elem.dim as u64)
}
}
}
pub fn single_register_type(&self, register: &RegisterInfo) -> Ref<Type> {
match register.datatype {
Some(data_type) => self.data_type(&data_type),
None => {
// No data type means we have a structure!
let mut register_struct = StructureBuilder::new();
// Constrain the width of the struct to the register size if available.
if let Some(register_size) = register.properties.size {
let register_byte_size = byte_width(register_size);
register_struct.width(register_byte_size as u64);
}
if let Some(derived_register_name) = ®ister.derived_from {
// We will create an NTR to ref the derived register type.
let ntr = NamedTypeReference::new(
NamedTypeReferenceClass::StructNamedTypeClass,
derived_register_name,
);
let base_struct = BaseStructure::new(ntr, 0, 0);
register_struct.base_structures(&[base_struct]);
}
let type_builder = match register.fields.clone() {
Some(mut fields) => {
// Order the fields by offset so that rendering of the structure will not
// insert "offset" fields, which happens when fields are unordered.
fields.sort_by(|a, b| a.bit_range.offset.cmp(&b.bit_range.offset));
for field in fields {
let field_member = self.field_member(&field);
let overwrites = true; // TODO: Handle overwrites?
register_struct.insert_member(field_member, overwrites);
}
TypeBuilder::structure(®ister_struct.finalize())
}
None if register.derived_from.is_some() => {
// Use the structure so that we get the base fields.
TypeBuilder::structure(®ister_struct.finalize())
}
None => {
// We don't have any fields, or a derived register, attempt to construct type ourselves.
match register.properties.size {
Some(bit_width) => {
// We have a sized register, convert to byte aligned int.
let byte_aligned_width = byte_width(bit_width);
TypeBuilder::int(byte_aligned_width as usize, false)
}
None => {
// TODO: How can we construct a type here?
panic!("Register {} has no size!", register.name);
}
}
}
};
if let Some(Access::ReadOnly) = register.properties.access {
type_builder.set_const(true);
}
type_builder.finalize()
}
}
}
// TODO: Register access should be consulted to see if we should set as const.
pub fn data_type(&self, data_type: &DataType) -> Ref<Type> {
match data_type {
DataType::U8 => Type::int(1, false),
DataType::U16 => Type::int(2, false),
DataType::U32 => Type::int(4, false),
DataType::U64 => Type::int(8, false),
DataType::I8 => Type::int(1, true),
DataType::I16 => Type::int(2, true),
DataType::I32 => Type::int(4, true),
DataType::I64 => Type::int(8, true),
// TODO: This can be cleaned up...
DataType::U8Ptr => {
Type::pointer_of_width(&Type::int(1, false), self.address_size, false, false, None)
}
DataType::U16Ptr => {
Type::pointer_of_width(&Type::int(2, false), self.address_size, false, false, None)
}
DataType::U32Ptr => {
Type::pointer_of_width(&Type::int(4, false), self.address_size, false, false, None)
}
DataType::U64Ptr => {
Type::pointer_of_width(&Type::int(8, false), self.address_size, false, false, None)
}
DataType::I8Ptr => {
Type::pointer_of_width(&Type::int(1, true), self.address_size, false, false, None)
}
DataType::I16Ptr => {
Type::pointer_of_width(&Type::int(2, true), self.address_size, false, false, None)
}
DataType::I32Ptr => {
Type::pointer_of_width(&Type::int(4, true), self.address_size, false, false, None)
}
DataType::I64Ptr => {
Type::pointer_of_width(&Type::int(8, true), self.address_size, false, false, None)
}
}
}
pub fn field_member(&self, field: &Field) -> StructureMember {
let field_ty = self.field_type(field);
let conf_field_ty = Conf::new(field_ty, MAX_CONFIDENCE);
StructureMember::new_bitfield(
conf_field_ty,
field.name.to_owned(),
field.bit_offset() as u64,
field.bit_width() as u8,
MemberAccess::PublicAccess,
MemberScope::NoScope,
)
}
pub fn field_type(&self, field: &Field) -> Ref<Type> {
match field {
Field::Single(info) => self.single_field_type(info),
Field::Array(info, elem) => {
// TODO: dimIncrement tells us the stride. We should consult that to
// TODO: make sure that the accesses are aligned.
Type::array(&self.single_field_type(info), elem.dim as u64)
}
}
}
// TODO: Handle enum type.
// TODO: Fields can derive from one another.
pub fn single_field_type(&self, field: &FieldInfo) -> Ref<Type> {
match field.enumerated_values.len() {
0 => self.single_field_int_type(field),
1 => {
// Unlike normal fields, enums must be registered with the view separately.
// If you do not register the enum with the view than you cannot view the enum type!
// TODO: Register enum type so they can be viewed.
self.single_field_enumerated_type(field, &field.enumerated_values[0])
}
arr_len => {
// TODO: Untested, I guess this works?
let enum_value_ty =
self.single_field_enumerated_type(field, &field.enumerated_values[0]);
Type::array(&enum_value_ty, arr_len as u64)
}
}
}
pub fn single_field_int_type(&self, field: &FieldInfo) -> Ref<Type> {
// Get the closest 8-bit aligned integer and use that.
let width = field.bit_width();
let byte_aligned_width = byte_width(width);
let type_builder = TypeBuilder::int(byte_aligned_width as usize, false);
if let Some(Access::ReadOnly) = field.access {
// We set fields to volatile as well to prevent constant value propagation.
type_builder.set_volatile(true);
type_builder.set_const(true);
}
type_builder.finalize()
}
// TODO: EnumeratedValues can derive from one another.
pub fn single_field_enumerated_type(
&self,
field: &FieldInfo,
enumerated_values: &EnumeratedValues,
) -> Ref<Type> {
// Get the closest 8-bit aligned integer and use that.
let width = field.bit_width();
let byte_aligned_width = byte_width(width);
let mut enum_builder = EnumerationBuilder::new();
let mut current_value = 0;
for enumerated_value in &enumerated_values.values {
current_value = enumerated_value.value.unwrap_or(current_value + 1);
// TODO: The Rust API needs to expose this...
let _is_default = enumerated_value.is_default.unwrap_or(false);
enum_builder.insert(&enumerated_value.name, current_value);
}
let enum_width = NonZeroUsize::new(byte_aligned_width as usize).unwrap();
let type_builder = TypeBuilder::enumeration(&enum_builder.finalize(), enum_width, false);
if let Some(Usage::Read) = enumerated_values.usage {
// We set fields to volatile as well to prevent constant value propagation.
type_builder.set_volatile(true);
type_builder.set_const(true);
}
type_builder.finalize()
}
}
|