use crate::coff::CoffFile;
const MAX_COMMON_ALIGN: u32 = 32;
struct Entry<'data> {
name: &'data [u8],
offset: u32,
size: u32,
}
pub struct CommonsPlan<'data> {
entries: Vec<Entry<'data>>,
size: u32,
}
impl<'data> CommonsPlan<'data> {
pub fn new(inputs: &[CoffFile<'data>]) -> Self {
let mut entries: Vec<Entry<'data>> = Vec::new();
for input in inputs {
for sym in input.symbols().iter() {
if !sym.is_common() {
continue;
}
match entries.iter_mut().find(|e| e.name == sym.name) {
Some(e) => e.size = e.size.max(sym.value),
None => entries.push(Entry {
name: sym.name,
offset: 0,
size: sym.value,
}),
}
}
}
let size = assign_offsets(&mut entries);
Self { entries, size }
}
pub const fn size(&self) -> u32 {
self.size
}
pub fn offset_of(&self, name: &[u8]) -> Option<u32> {
self.entries
.iter()
.find(|e| e.name == name)
.map(|e| e.offset)
}
pub fn iter(&self) -> impl Iterator<Item = (&'data [u8], u32)> + '_ {
self.entries.iter().map(|e| (e.name, e.offset))
}
}
fn assign_offsets(entries: &mut [Entry<'_>]) -> u32 {
let mut cursor: u32 = 0;
for e in entries.iter_mut() {
let align = common_align(e.size);
cursor = cursor.next_multiple_of(align);
e.offset = cursor;
cursor = cursor.saturating_add(e.size);
}
cursor
}
fn common_align(size: u32) -> u32 {
if size == 0 {
return 1;
}
size.checked_next_power_of_two()
.unwrap_or(MAX_COMMON_ALIGN)
.min(MAX_COMMON_ALIGN)
}