Skip to content

perf: fn rav1d_prepare_intra_edges: pre-slice #1415

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.

Sign up for GitHub

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

Open
ERobsham wants to merge 2 commits into
base: main
Choose a base branch
from
Open

perf: fn rav1d_prepare_intra_edges: pre-slice #1415

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
69df003
perf improvement re: issue #1394
ERobsham May 25, 2025
46e6d7e
fixes + suggestion from PR
ERobsham May 25, 2025
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
45 changes: 40 additions & 5 deletions src/ipred_prepare.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -186,6 +186,8 @@ pub fn rav1d_prepare_intra_edges<BD: BitDepth>(

let bitdepth = bd.bitdepth();
let stride = dst.pixel_stride::<BD>();
let is_neg_stride = 0 > stride;
let abs_stride = if is_neg_stride { (stride * -1) as usize } else { stride as usize };

match mode {
VERT_PRED..=VERT_LEFT_PRED => {
Expand Down Expand Up @@ -245,8 +247,26 @@ pub fn rav1d_prepare_intra_edges<BD: BitDepth>(
let left = &mut topleft_out[topleft_out_offset - sz..];
if have_left {
let px_have = cmp::min(sz, (h - y << 2) as usize);
for i in 0..px_have {
left[sz - 1 - i] = *(dst + (i as isize * stride - 1)).index::<BD>();
{
let slice_offset = if is_neg_stride { px_have as isize * stride } else { 0 };
let dst_slice = &*(dst + slice_offset - 1isize)
.slice::<BD>((px_have - 1) * abs_stride + 1);

// SAFETY: We've already implcitly bounds checked with the `slice()` call.
// We can safely avoid any bounds-checking overhead now.
if is_neg_stride {
for i in 0..px_have {
left[sz - 1 - i] = *unsafe {
dst_slice.get_unchecked((px_have * abs_stride) - (i * abs_stride))
};
}
} else {
for i in 0..px_have {
left[sz - 1 - i] = *unsafe {
dst_slice.get_unchecked(i * abs_stride)
}
}
}
}
if px_have < sz {
BD::pixel_set(left, left[sz - px_have], sz - px_have);
Expand Down Expand Up @@ -274,9 +294,24 @@ pub fn rav1d_prepare_intra_edges<BD: BitDepth>(
};
if have_bottomleft {
let px_have = cmp::min(sz, (h - y - th << 2) as usize);
for i in 0..px_have {
bottom_left[sz - 1 - i] =
*(dst + ((sz + i) as isize * stride - 1)).index::<BD>();
{
let slice_offset = if is_neg_stride { (px_have + sz) as isize * stride } else { (sz * abs_stride) as isize };
let dst_slice = &*(dst + slice_offset - 1isize).slice::<BD>((px_have - 1) * abs_stride + 1);
// SAFETY: We've already implcitly bounds checked with the `slice()` call.
// We can safely avoid any bounds-checking overhead now.
if is_neg_stride {
for i in 0..px_have {
bottom_left[sz - 1 - i] = *unsafe {
dst_slice.get_unchecked((px_have * abs_stride) - (i * abs_stride))
};
}
} else {
for i in 0..px_have {
bottom_left[sz - 1 - i] = *unsafe {
dst_slice.get_unchecked(i * abs_stride)
}
}
}
}
if px_have < sz {
BD::pixel_set(bottom_left, bottom_left[sz - px_have], sz - px_have);
Expand Down
Loading