2024-04-29 21:01:10 -04:00
|
|
|
// SPDX-FileCopyrightText: 2024 Joshua Goins <josh@redstrate.com>
|
|
|
|
// SPDX-License-Identifier: GPL-3.0-or-later
|
|
|
|
|
2024-05-18 09:42:07 -04:00
|
|
|
use std::io::{Cursor, Seek, SeekFrom};
|
2024-04-29 21:01:10 -04:00
|
|
|
|
2024-05-18 09:42:07 -04:00
|
|
|
use crate::common_file_operations::{Half1, Half3};
|
2024-04-29 21:01:10 -04:00
|
|
|
use crate::ByteSpan;
|
|
|
|
use binrw::BinRead;
|
2024-05-18 09:42:07 -04:00
|
|
|
use binrw::{binrw, BinReaderExt};
|
2024-04-30 18:00:47 -04:00
|
|
|
|
|
|
|
/// Maximum number of elements in one row
|
|
|
|
const MAX_ELEMENTS: usize = 128;
|
2024-04-29 21:01:10 -04:00
|
|
|
|
|
|
|
#[binrw]
|
|
|
|
#[derive(Debug)]
|
|
|
|
#[brw(little)]
|
|
|
|
struct StmHeader {
|
2024-04-30 18:00:47 -04:00
|
|
|
#[br(pad_before = 4)] // TODO: what is this byte?
|
|
|
|
entry_count: i32,
|
|
|
|
|
|
|
|
#[br(count = entry_count)]
|
|
|
|
keys: Vec<u16>,
|
|
|
|
|
|
|
|
#[br(count = entry_count)]
|
2024-05-18 09:42:07 -04:00
|
|
|
offsets: Vec<u16>,
|
2024-04-30 18:00:47 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
#[derive(Debug)]
|
|
|
|
pub struct DyePack {
|
|
|
|
diffuse: [f32; 3],
|
|
|
|
specular: [f32; 3],
|
|
|
|
emissive: [f32; 3],
|
|
|
|
gloss: f32,
|
2024-05-18 09:42:07 -04:00
|
|
|
specular_power: f32,
|
2024-04-30 18:00:47 -04:00
|
|
|
}
|
|
|
|
|
2024-04-29 21:01:10 -04:00
|
|
|
#[derive(Debug)]
|
2024-05-18 09:42:07 -04:00
|
|
|
pub struct StainingTemplate {}
|
2024-04-29 21:01:10 -04:00
|
|
|
|
2024-04-30 18:00:47 -04:00
|
|
|
impl StainingTemplate {
|
2024-04-29 21:01:10 -04:00
|
|
|
/// Reads an existing ULD file
|
|
|
|
pub fn from_existing(buffer: ByteSpan) -> Option<Self> {
|
|
|
|
let mut cursor = Cursor::new(buffer);
|
2024-04-30 18:00:47 -04:00
|
|
|
let header = StmHeader::read(&mut cursor).unwrap();
|
|
|
|
|
|
|
|
for entry_offset in header.offsets {
|
|
|
|
let offset = entry_offset as i32 * 2 + 8 + 4 * header.entry_count;
|
|
|
|
|
|
|
|
// read the stm entry
|
2024-05-18 09:42:07 -04:00
|
|
|
cursor.seek(SeekFrom::Start(offset as u64)).ok()?;
|
2024-04-30 18:00:47 -04:00
|
|
|
|
|
|
|
// read the value offsets
|
|
|
|
let mut ends = [0u16; 5];
|
|
|
|
for end in &mut ends {
|
|
|
|
*end = cursor.read_le::<u16>().unwrap() * 2;
|
|
|
|
}
|
|
|
|
|
2024-05-18 09:42:07 -04:00
|
|
|
/*let new_offset = (offset + 10) as u64;
|
2024-04-30 18:00:47 -04:00
|
|
|
|
|
|
|
let diffuse_entries = StainingTemplate::read_array::<Half3>(&mut cursor, new_offset, ends[0] as usize);
|
|
|
|
let specular_entries = StainingTemplate::read_array::<Half3>(&mut cursor, new_offset + ends[0] as u64, ends[1] as usize - ends[0] as usize);
|
|
|
|
let emissive_entries = StainingTemplate::read_array::<Half3>(&mut cursor, new_offset + ends[1] as u64, ends[2] as usize - ends[1] as usize);
|
|
|
|
let gloss_entries = StainingTemplate::read_array::<Half1>(&mut cursor, new_offset + ends[2] as u64, ends[3] as usize - ends[2] as usize);
|
2024-05-18 09:42:07 -04:00
|
|
|
let specular_power_entries = StainingTemplate::read_array::<Half1>(&mut cursor, new_offset + ends[3] as u64, ends[4] as usize - ends[3] as usize);*/
|
2024-04-30 18:00:47 -04:00
|
|
|
}
|
|
|
|
|
2024-05-18 09:42:07 -04:00
|
|
|
Some(StainingTemplate {})
|
2024-04-30 18:00:47 -04:00
|
|
|
}
|
|
|
|
|
2024-05-18 09:42:07 -04:00
|
|
|
fn read_array<T: binrw::BinRead<Args<'static> = ()> + Default + Clone + Copy>(
|
|
|
|
cursor: &mut Cursor<ByteSpan>,
|
|
|
|
offset: u64,
|
|
|
|
size: usize,
|
|
|
|
) -> Vec<T> {
|
|
|
|
cursor.seek(SeekFrom::Start(offset)).unwrap();
|
2024-04-30 18:00:47 -04:00
|
|
|
|
|
|
|
let array_size = size / std::mem::size_of::<T>();
|
|
|
|
if array_size == 0 {
|
2024-05-18 09:42:07 -04:00
|
|
|
vec![T::default(); MAX_ELEMENTS]
|
2024-04-30 18:00:47 -04:00
|
|
|
} else if array_size == 1 {
|
|
|
|
let element = cursor.read_le::<T>().unwrap();
|
2024-05-18 09:42:07 -04:00
|
|
|
vec![element; MAX_ELEMENTS]
|
2024-04-30 18:00:47 -04:00
|
|
|
} else if array_size < MAX_ELEMENTS {
|
|
|
|
let real_count = array_size - MAX_ELEMENTS / std::mem::size_of::<T>();
|
|
|
|
let mut values = vec![];
|
|
|
|
let mut indices = vec![];
|
|
|
|
values.push(T::default());
|
|
|
|
for _ in 0..real_count {
|
|
|
|
values.push(cursor.read_le::<T>().unwrap());
|
|
|
|
}
|
|
|
|
|
|
|
|
println!("{:#?}", cursor.position());
|
|
|
|
|
|
|
|
let eof_marker = cursor.read_le::<u8>().unwrap();
|
|
|
|
assert_eq!(eof_marker, 0xFF);
|
|
|
|
|
2024-05-18 09:42:07 -04:00
|
|
|
for _ in 0..MAX_ELEMENTS {
|
2024-04-30 18:00:47 -04:00
|
|
|
indices.push(cursor.read_le::<u8>().unwrap());
|
|
|
|
}
|
|
|
|
|
|
|
|
let mut vec = vec![];
|
|
|
|
for index in indices {
|
2024-05-18 09:42:07 -04:00
|
|
|
if (index as usize) < values.len() {
|
2024-04-30 18:00:47 -04:00
|
|
|
vec.push(values[index as usize]);
|
|
|
|
} else {
|
|
|
|
vec.push(T::default());
|
|
|
|
}
|
|
|
|
}
|
2024-04-29 21:01:10 -04:00
|
|
|
|
2024-04-30 18:00:47 -04:00
|
|
|
vec
|
|
|
|
} else if array_size == MAX_ELEMENTS {
|
|
|
|
let mut vec = vec![];
|
|
|
|
for _ in 0..size {
|
|
|
|
vec.push(cursor.read_le::<T>().unwrap());
|
|
|
|
}
|
|
|
|
vec
|
|
|
|
} else {
|
|
|
|
panic!("Too many elements");
|
|
|
|
}
|
2024-04-29 21:01:10 -04:00
|
|
|
}
|
|
|
|
}
|