Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[read-fonts] gvar: improve delta decoding perf #1235

Merged
merged 5 commits into from
Nov 17, 2024
Merged
Changes from 4 commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
124 changes: 104 additions & 20 deletions read-fonts/src/tables/variations.rs
Original file line number Diff line number Diff line change
Expand Up @@ -4,8 +4,6 @@ include!("../../generated/generated_variations.rs");

use super::gvar::SharedTuples;

use std::iter::Skip;

pub const NO_VARIATION_INDEX: u32 = 0xFFFFFFFF;
/// Outer and inner indices for reading from an [ItemVariationStore].
#[derive(Clone, Copy, Debug, Default, PartialEq, Eq, PartialOrd, Ord, Hash)]
Expand Down Expand Up @@ -403,7 +401,7 @@ impl<'a> PackedDeltas<'a> {
/// NOTE: this is unbounded, and assumes all of data is deltas.
#[doc(hidden)] // used by tests in write-fonts
pub fn consume_all(data: FontData<'a>) -> Self {
let count = DeltaRunIter::new(data.cursor(), None).count();
let count = count_all_deltas(data);
Self { data, count }
}

Expand All @@ -414,6 +412,14 @@ impl<'a> PackedDeltas<'a> {
pub fn iter(&self) -> DeltaRunIter<'a> {
DeltaRunIter::new(self.data.cursor(), Some(self.count))
}

fn x_deltas(&self) -> DeltaRunIter<'a> {
DeltaRunIter::new(self.data.cursor(), Some(self.count / 2))
}

fn y_deltas(&self) -> DeltaRunIter<'a> {
DeltaRunIter::new(self.data.cursor(), Some(self.count)).skip_fast(self.count / 2)
}
}

/// Flag indicating that this run contains no data,
Expand All @@ -425,12 +431,15 @@ const DELTAS_ARE_WORDS: u8 = 0x40;
const DELTA_RUN_COUNT_MASK: u8 = 0x3F;

/// The type of values for a given delta run (influences the number of bytes per delta)
///
/// The variants are intentionally set to the byte size of the type to allow usage
/// as a multiplier when computing offsets.
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum DeltaRunType {
Zero,
I8,
I16,
I32,
Zero = 0,
I8 = 1,
I16 = 2,
I32 = 4,
}

impl DeltaRunType {
Expand Down Expand Up @@ -473,6 +482,41 @@ impl<'a> DeltaRunIter<'a> {
while self.next().is_some() {}
self.cursor
}

/// Skips `n` deltas without reading the actual delta values.
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Seems like it would be faster still to have precomputed start of y deltas. Spec opportunity that we could support with measurable perf impact?

Copy link
Member Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I imagine it would improve performance but the size increase might be substantial. I was actually thinking the opposite— that teaching write-fonts to pack the x/y streams together could shave off a nice chunk of bytes in a large CJK variable font.

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

While it's not specified in the spec, I don't think anyone in their sane mind would get the idea that they can be encoded together. HB doesn't support decoding them as such. I don't think FreeType does either.

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It would be an interesting data point to know what the impact on perf would be if we could jump rathern than read-to-skip.

fn skip_fast(mut self, n: usize) -> Self {
let mut wanted = n;
loop {
let remaining = self.remaining_in_run as usize;
if wanted > remaining {
// Haven't seen enough deltas yet; consume the remaining
// data bytes and move to the next run
self.cursor.advance_by(remaining * self.value_type as usize);
wanted -= remaining;
if self.read_next_control().is_none() {
self.limit = Some(0);
break;
}
continue;
}
let consumed = wanted.min(remaining);
self.remaining_in_run -= consumed as u8;
self.cursor.advance_by(consumed * self.value_type as usize);
if let Some(limit) = self.limit.as_mut() {
*limit = limit.saturating_sub(n);
}
break;
}
self
}

fn read_next_control(&mut self) -> Option<()> {
self.remaining_in_run = 0;
let control: u8 = self.cursor.read().ok()?;
self.value_type = DeltaRunType::new(control);
self.remaining_in_run = (control & DELTA_RUN_COUNT_MASK) + 1;
Some(())
}
}

impl Iterator for DeltaRunIter<'_> {
Expand All @@ -485,16 +529,9 @@ impl Iterator for DeltaRunIter<'_> {
}
self.limit = Some(limit - 1);
}
// if no items remain in this run, start the next one.
// NOTE: we use `while` so we can sanely handle the case where some
// run in the middle of the data has an explicit zero length
//TODO: create a font with data of this shape and go crash some font parsers
while self.remaining_in_run == 0 {
let control: u8 = self.cursor.read().ok()?;
self.value_type = DeltaRunType::new(control);
self.remaining_in_run = (control & DELTA_RUN_COUNT_MASK) + 1;
if self.remaining_in_run == 0 {
self.read_next_control()?;
}

self.remaining_in_run -= 1;
match self.value_type {
DeltaRunType::Zero => Some(0),
Expand All @@ -505,6 +542,19 @@ impl Iterator for DeltaRunIter<'_> {
}
}

/// Counts the number of deltas available in the given data, avoiding
/// excessive reads.
fn count_all_deltas(data: FontData) -> usize {
let mut count = 0;
let mut offset = 0;
while let Ok(control) = data.read_at::<u8>(offset) {
let run_count = (control & DELTA_RUN_COUNT_MASK) as usize + 1;
count += run_count;
offset += run_count * DeltaRunType::new(control) as usize + 1;
}
count
}

/// A helper type for iterating over [`TupleVariationHeader`]s.
pub struct TupleVariationHeaderIter<'a> {
data: FontData<'a>,
Expand Down Expand Up @@ -806,7 +856,7 @@ pub struct TupleDeltaIter<'a, T> {
points: Option<PackedPointNumbersIter<'a>>,
next_point: usize,
x_iter: DeltaRunIter<'a>,
y_iter: Option<Skip<DeltaRunIter<'a>>>,
y_iter: Option<DeltaRunIter<'a>>,
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Optional, feels a little weird that only y is an option, could it just be an iter that's empty instead of None?

Copy link
Member Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The iterator would need to produce an infinite stream of zeroes to fit into the current logic and I think that complication might lead to bugs.

I’ll replace this with an enum that holds two iters for points and one for scalars which should make this more clear.

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

That rationale would make a fine comment :)

_marker: std::marker::PhantomData<fn() -> T>,
}

Expand All @@ -817,13 +867,16 @@ where
fn new(points: &'a PackedPointNumbers, deltas: &'a PackedDeltas) -> TupleDeltaIter<'a, T> {
let mut points = points.iter();
let next_point = points.next();
let num_encoded_points = deltas.count() / 2; // x and y encoded independently
let y_iter = T::is_point().then(|| deltas.iter().skip(num_encoded_points));
let (x_iter, y_iter) = if T::is_point() {
(deltas.x_deltas(), Some(deltas.y_deltas()))
} else {
(deltas.iter(), None)
};
TupleDeltaIter {
cur: 0,
points: next_point.map(|_| points),
next_point: next_point.unwrap_or_default() as usize,
x_iter: deltas.iter(),
x_iter,
y_iter,
_marker: std::marker::PhantomData,
}
Expand Down Expand Up @@ -1328,6 +1381,37 @@ mod tests {
assert_eq!(all_points.iter().count(), u16::MAX as _);
}

/// Test that we split properly when the coordinate boundary doesn't align
/// with a packed run boundary
#[test]
fn packed_delta_run_crosses_coord_boundary() {
// 8 deltas with values 0..=7 with a run broken after the first 6; the
// coordinate boundary occurs after the first 4
static INPUT: FontData = FontData::new(&[
// first run: 6 deltas as bytes
5,
0,
1,
2,
3,
// coordinate boundary is here
4,
5,
// second run: 2 deltas as words
1 | DELTAS_ARE_WORDS,
0,
6,
0,
7,
]);
let deltas = PackedDeltas::consume_all(INPUT);
assert_eq!(deltas.count, 8);
let x_deltas = deltas.x_deltas().collect::<Vec<_>>();
let y_deltas = deltas.y_deltas().collect::<Vec<_>>();
assert_eq!(x_deltas, [0, 1, 2, 3]);
assert_eq!(y_deltas, [4, 5, 6, 7]);
}

/// We don't have a reference for our float delta computation, so this is
/// a sanity test to ensure that floating point deltas are within a
/// reasonable margin of the same in fixed point.
Expand Down