allocation related optimizations while parsing

This commit is contained in:
MaxOhn
2021-11-05 17:39:35 +01:00
parent bc8d6d70f8
commit 130fb959cf
2 changed files with 96 additions and 47 deletions
+24 -5
View File
@@ -340,11 +340,30 @@ pub fn strains(map: &Beatmap, mods: impl Mods) -> Strains {
#[test] #[test]
fn custom_osu() { fn custom_osu() {
let file = std::fs::File::open("E:Games/osu!/beatmaps/2753127.osu").unwrap(); use std::{fs::File, time::Instant};
// let file = std::fs::File::open("E:Games/osu!/beatmaps/2571051.osu").unwrap();
let path = "E:Games/osu!/beatmaps/2753127.osu";
// let path = "E:Games/osu!/beatmaps/2571051.osu";
let file = File::open(path).unwrap();
let start = Instant::now();
let map = Beatmap::parse(file).unwrap(); let map = Beatmap::parse(file).unwrap();
let start = std::time::Instant::now(); let iters = 100;
let accum = start.elapsed();
let mut accum = accum;
for _ in 0..iters {
let file = File::open(path).unwrap();
let start = Instant::now();
let _map = Beatmap::parse(file).unwrap();
accum += start.elapsed();
}
println!("Parsing average: {:?}", accum / iters);
let start = Instant::now();
let result = crate::OsuPP::new(&map).mods(0).calculate(); let result = crate::OsuPP::new(&map).mods(0).calculate();
let iters = 500; let iters = 500;
@@ -354,11 +373,11 @@ fn custom_osu() {
// let mut accum = accum; // let mut accum = accum;
// for _ in 0..iters { // for _ in 0..iters {
// let start = std::time::Instant::now(); // let start = Instant::now();
// let _result = crate::OsuPP::new(&map).mods(0).calculate(); // let _result = crate::OsuPP::new(&map).mods(0).calculate();
// accum += start.elapsed(); // accum += start.elapsed();
// } // }
println!("{:#?}", result); println!("{:#?}", result);
println!("Average: {:?}", accum / iters); println!("Calculation average: {:?}", accum / iters);
} }
+72 -42
View File
@@ -16,7 +16,7 @@ pub use hitsound::HitSound;
pub use pos2::Pos2; pub use pos2::Pos2;
use sort::legacy_sort; use sort::legacy_sort;
use std::cmp::Ordering; use std::{cmp::Ordering, mem};
#[cfg(not(any(feature = "async_std", feature = "async_tokio")))] #[cfg(not(any(feature = "async_std", feature = "async_tokio")))]
use std::io::{BufRead, BufReader, Read}; use std::io::{BufRead, BufReader, Read};
@@ -28,11 +28,11 @@ use tokio::io::{AsyncBufReadExt, AsyncRead, BufReader};
use async_std::io::{prelude::BufReadExt, BufReader as AsyncBufReader, Read as AsyncRead}; use async_std::io::{prelude::BufReadExt, BufReader as AsyncBufReader, Read as AsyncRead};
fn sort_unstable<T: PartialOrd>(slice: &mut [T]) { fn sort_unstable<T: PartialOrd>(slice: &mut [T]) {
slice.sort_unstable_by(|p1, p2| p1.partial_cmp(&p2).unwrap_or(Ordering::Equal)); slice.sort_unstable_by(|p1, p2| p1.partial_cmp(p2).unwrap_or(Ordering::Equal));
} }
fn sort<T: PartialOrd>(slice: &mut [T]) { fn sort<T: PartialOrd>(slice: &mut [T]) {
slice.sort_by(|p1, p2| p1.partial_cmp(&p2).unwrap_or(Ordering::Equal)); slice.sort_by(|p1, p2| p1.partial_cmp(p2).unwrap_or(Ordering::Equal));
} }
trait OptionExt<T> { trait OptionExt<T> {
@@ -41,7 +41,7 @@ trait OptionExt<T> {
impl<T> OptionExt<T> for Option<T> { impl<T> OptionExt<T> for Option<T> {
fn next_field(self, field: &'static str) -> Result<T, ParseError> { fn next_field(self, field: &'static str) -> Result<T, ParseError> {
self.ok_or_else(|| ParseError::MissingField(field)) self.ok_or(ParseError::MissingField(field))
} }
} }
@@ -765,9 +765,20 @@ impl Beatmap {
let mut unsorted = false; let mut unsorted = false;
let mut prev_time = 0.0; let mut prev_time = 0.0;
let mut empty = true; let mut empty = true;
// `point_split` elements will have the lifetime of `buf`.
// If it wasn't split into parts, the borrow checker would complain.
// The ptr is cast to a `*const u8` so its lifetime is not bound to `buf`.
// At the end of this scope, the vec will be built one last time
// so it can be dropped and thus deallocated.
let mut point_split_ptr = Vec::new().as_mut_ptr() as *const u8;
let mut point_split_length = 0;
let mut point_split_capacity = 0;
let mut segments = Vec::new();
let mut vertices = Vec::new();
while read_line!(reader, buf)? != 0 { while read_line!(reader, buf)? != 0 {
let line = line_prepare!(buf); let line = line_prepare!(buf);
@@ -814,7 +825,7 @@ impl Beatmap {
let mut curve_points = Vec::with_capacity(4); let mut curve_points = Vec::with_capacity(4);
curve_points.push(pos); curve_points.push(pos);
let curve_point_iter = split.next().next_field("curve points")?.split("|"); let curve_point_iter = split.next().next_field("curve points")?.split('|');
let mut repeats: usize = split.next().next_field("repeats")?.parse()?; let mut repeats: usize = split.next().next_field("repeats")?.parse()?;
if repeats > 9000 { if repeats > 9000 {
@@ -829,9 +840,19 @@ impl Beatmap {
let mut end_idx = 0; let mut end_idx = 0;
let mut first = true; let mut first = true;
let point_split: Vec<_> = curve_point_iter.collect(); // SAFETY: Parts originate from an actual Vec and are updated each iteration
let mut segments = Vec::new(); let mut point_split = unsafe {
Vec::from_raw_parts(
point_split_ptr as *mut &str,
point_split_length,
point_split_capacity,
)
};
point_split.clear();
point_split.extend(curve_point_iter);
#[allow(clippy::blocks_in_if_conditions)]
while { while {
end_idx += 1; end_idx += 1;
@@ -848,29 +869,25 @@ impl Beatmap {
// * The start of the next segment is the index after the type descriptor. // * The start of the next segment is the index after the type descriptor.
let end_point = point_split.get(end_idx + 1).copied(); let end_point = point_split.get(end_idx + 1).copied();
convert_points( let slice = &point_split[start_idx..end_idx];
&point_split[start_idx..end_idx], convert_points(slice, end_point, first, pos, &mut segments, &mut vertices)?;
end_point,
first,
pos,
&mut segments,
)?;
start_idx = end_idx; start_idx = end_idx;
first = false; first = false;
} }
if end_idx > start_idx { if end_idx > start_idx {
convert_points( let slice = &point_split[start_idx..end_idx];
&point_split[start_idx..end_idx], convert_points(slice, None, first, pos, &mut segments, &mut vertices)?;
None,
first,
pos,
&mut segments,
)?;
} }
let curve_points = merge_points_lists(segments); point_split_ptr = point_split.as_mut_ptr() as *const u8;
point_split_length = point_split.len();
point_split_capacity = point_split.capacity();
mem::forget(point_split);
// Drains `segments` so it doesn't have to be cleared
let curve_points = merge_points_lists(&mut segments);
if curve_points.is_empty() { if curve_points.is_empty() {
HitObjectKind::Circle HitObjectKind::Circle
@@ -944,17 +961,27 @@ impl Beatmap {
sort_unstable(&mut self.hit_objects); sort_unstable(&mut self.hit_objects);
} }
// Construct vec one last time so it gets deallocated.
// SAFETY: Parts originate from an actual Vec and are updated each iteration
let _ = unsafe {
Vec::from_raw_parts(
point_split_ptr as *mut &str,
point_split_length,
point_split_capacity,
)
};
Ok(empty) Ok(empty)
} }
} }
// TODO: Cleanup
fn convert_points( fn convert_points(
points: &[&str], points: &[&str],
end_point: Option<&str>, end_point: Option<&str>,
first: bool, first: bool,
offset: Pos2, offset: Pos2,
segments: &mut Vec<Vec<PathControlPoint>>, segments: &mut Vec<Vec<PathControlPoint>>,
vertices: &mut Vec<PathControlPoint>,
) -> Result<(), ParseError> { ) -> Result<(), ParseError> {
let mut path_kind = PathType::from_str(points[0]); let mut path_kind = PathType::from_str(points[0]);
@@ -962,20 +989,20 @@ fn convert_points(
let readable_points = points.len() - 1; let readable_points = points.len() - 1;
let end_point_len = end_point.is_some() as usize; let end_point_len = end_point.is_some() as usize;
let mut vertices = vertices.clear();
vec![PathControlPoint::default(); read_offset + readable_points + end_point_len]; vertices.reserve(read_offset + readable_points + end_point_len);
// * Fill any non-read points. // * Fill any non-read points.
// Not necessary since vertices are already initialized vertices.extend((0..read_offset).map(|_| PathControlPoint::default()));
// * Parse into control points. // * Parse into control points.
for i in 1..points.len() { for &point in points.iter().skip(1) {
read_point(points[i], offset, &mut vertices[read_offset + i - 1])?; vertices.push(read_point(point, offset)?);
} }
// * If an endpoint is given, add it to the end. // * If an endpoint is given, add it to the end.
if let Some(end_point) = end_point { if let Some(end_point) = end_point {
read_point(end_point, offset, vertices.last_mut().unwrap())?; vertices.push(read_point(end_point, offset)?);
} }
// * Edge-case rules (to match stable). // * Edge-case rules (to match stable).
@@ -1002,6 +1029,7 @@ fn convert_points(
let mut start_idx = 0; let mut start_idx = 0;
let mut end_idx = 0; let mut end_idx = 0;
#[allow(clippy::blocks_in_if_conditions)]
while { while {
end_idx += 1; end_idx += 1;
@@ -1034,25 +1062,21 @@ fn convert_points(
Ok(()) Ok(())
} }
fn read_point( fn read_point(value: &str, start_pos: Pos2) -> Result<PathControlPoint, ParseError> {
value: &str,
start_pos: Pos2,
point: &mut PathControlPoint,
) -> Result<(), ParseError> {
let mut v = value.split(':').map(str::parse); let mut v = value.split(':').map(str::parse);
match (v.next(), v.next()) { match (v.next(), v.next()) {
(Some(Ok(x)), Some(Ok(y))) => point.pos = Pos2 { x, y } - start_pos, (Some(Ok(x)), Some(Ok(y))) => Ok(PathControlPoint::from(Pos2 { x, y } - start_pos)),
_ => return Err(ParseError::InvalidCurvePoints), _ => Err(ParseError::InvalidCurvePoints),
}; }
Ok(())
} }
fn merge_points_lists(control_point_list: Vec<Vec<PathControlPoint>>) -> Vec<PathControlPoint> { fn merge_points_lists(
control_point_list: &mut Vec<Vec<PathControlPoint>>,
) -> Vec<PathControlPoint> {
let total_count = control_point_list.iter().map(Vec::len).sum(); let total_count = control_point_list.iter().map(Vec::len).sum();
let mut merged_list = Vec::with_capacity(total_count); let mut merged_list = Vec::with_capacity(total_count);
let iter = control_point_list.into_iter().map(Vec::into_iter).flatten(); let iter = control_point_list.drain(..).map(Vec::into_iter).flatten();
merged_list.extend(iter); merged_list.extend(iter);
merged_list merged_list
@@ -1089,6 +1113,12 @@ pub struct PathControlPoint {
pub kind: Option<PathType>, pub kind: Option<PathType>,
} }
impl From<Pos2> for PathControlPoint {
fn from(pos: Pos2) -> Self {
Self { pos, kind: None }
}
}
/// The type of curve of a slider. /// The type of curve of a slider.
#[derive(Copy, Clone, Debug, Eq, PartialEq)] #[derive(Copy, Clone, Debug, Eq, PartialEq)]
pub enum PathType { pub enum PathType {